Cuckoo for Hashing

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

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

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

                    }
                }
            }

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

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

    }
    return 0;
}