UVA11752 The Super Powers

 /*
  UVA11752 The Super Powers
  https://vjudge.net/contest/153365#problem/Y
  数论
  注意a^n=b要用除法求，并且求得的n比实际大1
  */
 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 #include <cmath>
 #include <vector>
 #include <queue>
 #include <set>
 #include <iostream>
 //#define test
 using namespace std;
 const int Nmax=;
 set<unsigned long long> ans;
 int is_prime[Nmax];
 int cnt;
 void get()
 {
     for(int i=;i<=;i++)
         is_prime[i]=;
     for(int i=;i<=;i++)
         if(is_prime[i])
             for(int j=;j*i<=;j++)
                 is_prime[i*j]=;
 }

 int main()
 {
     #ifdef test
     #endif
     ans.insert(1LL);
     get();
     //for(int i=1;i<=cnt;i++)
         //printf("%d ",num[i]);
     //printf("\n");
     //printf("%lld\n",qpow(65536LL,4));
     unsigned long long n=(1LL<<)-1LL;
     //printf("n:%llu\n",n);
     //return 0;
     for(unsigned long long i=2LL;;i++)
     {
         unsigned long long cnt=-,x=n;//算出最大的次数,注意最大次数要-1
         while(x>)
         {
             x/=i;
             cnt++;
         }
         if(cnt<)
             break;
         unsigned long long a=i;
         //不能这么乘，会超unsigned long long
         //unsigned long long tmp=i*i*i*i;//
         ////printf("%lld\n",tmp);
         //if(tmp>n)
             //break;
         for(unsigned long long j=;j<=cnt;j++)
         {
             a*=i;
             //printf("a:%lld\n",a);
             //if(a<=0LL)
                 //break;
             //if(a>n)
             //{
                 //printf("YES\n");
                 //return 0;
                 //break;
             //}
             if(!is_prime[j])
                 ans.insert(a);
         }
     }
     for(set<unsigned long long>::iterator i=ans.begin();i!=ans.end();i++)
         //cout<<*i<<endl;
     //unsigned long long 要用llu输出，否则会丢数据
         printf("%llu\n",*i);
     return ;
 }