uva 256 – quirksome squares

int ()
{
    int ans[4][10], count[4] = {};
    int div[4] = { 10,100,1000,10000 };

    for (int i = 0; i < 10000; i++)
    {
        int square = i*i;
        for (int j = 0; j < 4; j++)
        {
            if (i < div[j])
            {
                int x = square / div[j] + square%div[j];
                if (x == i)
                    ans[j][count[j]++] = square;
            }
        }
    }

    int n;
    while (scanf("%d", &n) != EOF)
    {
        int idx = n / 2 - 1;
        for (int i = 0; i < count[idx]; i++)
            printf("%0*dn", n, ans[idx][i]);
    }

    return 0;
}