Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- #define fast()(ios_base::sync_with_stdio(false),cin.tie(NULL));
- typedef unsigned long long ull;
- #define pb push_back
- vector<ull>v;
- int prime[]={2,3,5,7,11};
- int main()
- {
- fast();
- v.pb(1);
- for(ull i=2;i<=65535;i++)
- {
- double lm=(double)64.0/(double)log2((double)i);
- for(int j=0;j<5;j++)
- {
- ull k=prime[j]+prime[j];
- if(k>=lm)break;
- ull last=1,hs;
- for(int t=0;t<prime[j];t++)last*=i;
- hs=last;
- do
- {
- last*=hs;
- v.pb(last);
- k+=prime[j];
- }while(k<lm);
- }
- }
- cout<<"1"<<endl;
- sort(v.begin(),v.end());
- for(ull i=1;i<v.size();i++)
- {
- if(v[i]!=v[i-1])cout<<v[i]<<endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement