【模拟】rqnoj P154 吉祥数

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
long long a[255]={0},n,ji;
bool b[100000],c[100000];
long long chai(long long ii,long long j)
{
long long ans,anss=0,i;
while (ii!=0)
{
ans=1;i=ii%10;
for (long long  jj=1;jj<=j;jj++) ans*=i;
anss+=ans;
ii/=10;
}
return anss;
}
int main()
{
memset(b,true,sizeof(b));
memset(c,true,sizeof(c));
cin>>n;	ji=1;
long long maxx=0;
while(scanf("%d",&a[ji])!=EOF){ji++;maxx=max(maxx,a[ji-1]);}
sort(a+1,a+ji);
for (long long  i=1;i<=n;i++)
{
for (long long j=1;j<=ji;j++)
{
if (c[a[j]]==true)
{
long long jjj=chai(a[j],i+1);
if (jjj<=maxx)b[jjj]=false;
}
}
for (long long j=1;j<=maxx;j++)c[j]=b[j];
}
for (long long i=1;i<ji;i++)
if (c[a[i]]==true) cout<<a[i]<<" ";
return 0;
}