-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path10394.c
41 lines (40 loc) · 1.03 KB
/
10394.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
#include<stdio.h>
#include<string.h>
#include<math.h>
long long isprime[20000000],a,b,c=1,i,j,k=1,twin[20000000];
int main(){
//a=sqrt(50);
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
for(i=4;i<=20000000;i=i+2){
isprime[i]=1;
}
isprime[k]=2;
for(i=3;i<=20000000;i=i+2){
if(isprime[i]==0){
k++;
isprime[k]=i;
//printf("%lld %lld\n",k,isprime[k]);
}
for(j=i*i;j<=20000000;j=j+i+i){
isprime[j]=1;
}
}
for(i=1;i<=20000000;i++){
if(isprime[i+1]-isprime[i]==2){
twin[c]=isprime[i];
//printf("%lld %lld\n",c,isprime[c]);
c++;
}
}
//for(i=1;i<20000000;i++){
//printf("dhuk\n");
// if(isprime[i]!=1 && isprime[i]!=0){
//("dhuk\n");
//printf("%lld\n",isprime[i]);
//}
//}
while(scanf("%lld",&b)!=EOF){
printf("(%lld, %lld)\n",twin[b],twin[b]+2);
}
}