Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- #define x 20000000
- bool mark[x+5];
- long long int isprime[x];
- int main()
- {
- int i,j,k=1;
- memset(mark,false,sizeof(mark));
- mark[0]=true;
- mark[1]=true;
- for(i=2;i*i<=x;i++)
- {
- if(mark[i]==false)
- {
- for(j=i*i;j<=x;j+=i)
- {
- mark[j]=true;
- }
- }
- }
- for(i=3;i<x;i++)
- {
- if(mark[i]==false && mark[i+2]==false)
- isprime[k++]=i;
- }
- long long int n;
- while(cin>>n)
- {
- cout<<"("<<isprime[n]<<", "<<isprime[n]+2<<")"<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement