Cuckoo for Hashing

http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2719

 #include <stdio.h>
 #include <string.h>
 const int N=;
 using namespace std;
 int a[N],b[N],f[N];
 int main()
 {
     int n1,n2,m,o=;
     while(~scanf("%d %d %d",&n1,&n2,&m))
     {
         o++;
         int flag1 = ,flag2 = ;
         if (n1==&&n2==&&m==)
             break;
         memset(a,-,sizeof(a));
         memset(b,-,sizeof(b));
         for (int i = ; i < m; i++)
             scanf("%d",&f[i]);
         int t1,t2,tt;
         for (int i = ; i < m; i++)
         {
             tt = f[i];
             while()
             {
                 t1 = tt%n1;
                 if (a[t1]==-)
                 {
                     a[t1] = tt;
                     flag1 = ;
                     break;
                 }
                 else
                 {
                     int temp = a[t1];
                     a[t1] = tt;
                     t2 = temp%n2;
                     if (b[t2]==-)
                     {
                         b[t2] = temp;
                         flag2 = ;
                         break;
                     }
                     else
                     {

                         tt = b[t2];
                         b[t2] = temp;
                         flag2 = ;

                     }
                 }
             }

         }
         printf("Case %d:\n",o);
         if (flag1)
         {
             printf("Table 1\n");
             for (int i = ; i < n1; i++)
             {
                 if (a[i]!=-)
                     printf("%d:%d\n",i,a[i]);

             }
         }
         if (flag2)
         {
             printf("Table 2\n");
             for (int i = ; i < n2; i++)
             {
                 if (b[i]!=-)
                     printf("%d:%d\n",i,b[i]);
             }
         }

     }
     return ;
 }