zoj 2952 Find All M^N Please

/*直接暴力*/ #define LOCAL #include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<cstdlib> #include<iomanip> #include<string> #include<algorithm> #include<ctime> #include<stack> #include<queue> #include<vector> #define N 50000 #define MAX 2147483648 using namespace std; int main() { #ifdef LOCAL freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); #endif int i,j,t=(int)sqrt((double)MAX),k=0,ans[N]; for(i=2;i<=t;i++) { for(j=2;pow((double)i,(double)j)<MAX;j++)//注意这个条件 { ans[k++]=pow((double)i,(double)j); } } sort(ans,ans+k);//排序 cout<<ans[0]<<endl; for(i=1;i<k;i++) { if(ans[i]!=ans[i-1])//去重 cout<<ans[i]<<endl; } return 0; }