蓝桥杯 排他平方数

#include <bits/stdc++.h>

using namespace std;
#define maxn 999999

int mark[20] = {0};
int cnt = 0;
int main()
{
    for(int i=203879; i<=maxn; i++)
    {
        memset(mark, 0, sizeof(mark));
        int tmp = i;
        long long t = i;
        while(tmp)
        {
            mark[tmp%10] = 1;
            tmp /= 10;
        }
        t *= t;
        long long T = t;
        bool flag = true;
        while(t)
        {
            int a = t%10;
            if(mark[a])
            {
                flag = false;
                break;
            }
            t /= 10;
        }
        if(flag)
        {
            cout<<++cnt<<":"<<i<<endl;
            cout<<T<<endl;
        }
    }
    return 0;
}