Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- int prime(int n)
- {
- int i;
- if(n==1)return 1;
- if(n==2)return 1;
- if(n%2==0)return 0;
- for(i=3;i*i<=n;i+=2)
- {
- if(n%i==0)return 0;
- }
- return 1;
- }
- int main()
- {
- int n,res1,res2,i,j,k,l,p;
- while(1)
- {
- i=3;
- l=0;
- scanf("%d",&n);
- if(n==EOF)break;
- while(1)
- {
- p=prime(i);
- if(p==1)
- {
- j=i+2;
- k=prime(j);
- if(k==1)
- {
- l++;
- res1=i;
- res2=j;
- }
- }
- if(l==n)
- {
- break;
- }
- i++;
- }
- printf("(%d, %d)\n",res1,res2);
- }
- }
Add Comment
Please, Sign In to add comment