Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<math.h>
- #include<algorithm>
- long long int a[20000000];
- using namespace std;
- int main(){
- long long int i,j,k,m,n,p,r,l=0;
- scanf("%lld",&n);
- fill(a,&a[20000000],-1);
- for(i=2;i<20000000;i++)
- {
- if(a[i]==-1)
- {
- for(j=2;i*j<20000000;j++)
- {
- a[i*j]=0;
- }
- }
- }
- for(i=2;i<20000000;i++)
- {
- if(a[i]!=0)
- {
- a[i]=i;
- // printf("%d\n",a[i]);
- }
- }
- sort(a,a+20000000);
- /* for(i=0;i<200;i++)
- {
- printf("%lld\n",a[i]);
- }*/
- for(i=2;i<20000000;i++)
- {
- if(a[i]>0&&(a[i]-a[i+1])==-2)
- {
- l++;
- }
- if(n==l)
- {
- printf("(%lld, %lld)\n",a[i],a[i+1]);
- break;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement