当一个数用指数形式表示时ab,当b不是素数时,ab一定是super power,那么b最小可以取4。因为范围是264,b最小为4,那么a最大的范围是216。我们只需要从2开始一直到216,将它们的非素数幂加入set(自动去重)中即可。
注意用 unsigned long long 和最后添加1.
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<algorithm>
#include<string>
#include<sstream>
#include<set>
#include<vector>
#include<stack>
#include<map>
#include<queue>
#include<deque>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<functional>
using namespace std;
#define maxn 1<<18
int primes[] = {2,3,5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53,59,61};
bool is[66];
int su[maxn],cnt;
bool issu[maxn];
int main()
{
unsigned long long x,x1;
set<unsigned long long>s;
s.clear();
x1=0;
x=x1-1;
//printf("***\n");
//printf("%llu\n",x);
for(int i=0;i<18;i++)
{
is[primes[i]]=1;
}
// printf("***\n");
for(int i=2;;i++)
{
int cas=0;
x1=x;
while(x1)
{
x1=x1/(unsigned long long)i;
cas++;
}
unsigned long long ans;
ans=(unsigned long long)i*i*i;
if(cas<5)
break;
// printf("%llu**\n",ans);
for(int j=4;j<cas;j++)
{
ans=ans*(unsigned long long)i;
if(!is[j])
{
s.insert(ans);
}
}
}
s.insert(1);///别忘了 1
set<unsigned long long>::iterator it;
for( it=s.begin();it!=s.end();it++)
printf("%llu\n",*it);
//printf("&&\n");
return 0;
}