id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
21,400 | int main()
{
int m,n,a,b,i1,i2,i3,flag;
scanf("%d",&a);
b=a/2;
for(i1=3;i1<=b;i1=i1+2)
{
m=i1;
n=a-i1;
flag=0;
for(i2=2;i2<m;i2++)
{
if(m%i2==0){ flag=flag+1;break;}
}
for(i3=2;i3<n;i3++)
{
if(n%i3==0){ flag=flag+1;break;}
}
if(flag==0) printf("%d %d\n",m,n);
}
return 0;
}
| 43 |
21,401 | int main()
{
int m,a[20000],i,j,sign=0;
for(i=1;i<=20000;i++)
a[i]=-10000;
scanf("%d",&m);
for(i=2;i<=m;i++)
{
{
for(j=2;j<i;j++)
{
if(i%j==0)
sign+=1;
}
}
if(sign>0)
sign=0;
else a[i]=i;
}
for(i=2;i<m;i++)
for(j=i;j<m;j++)
if(a[j]+a[i]==m)
printf("%d %d\n",i,j);
return 0;
}
| 43 |
21,402 |
int main()
{
int m;
scanf("%d",&m);
int a,i;
for(a=3;a<=(m/2);a=a+2)
{
int c=0;
for(i=2;i<a;i++)
if(a%i==0)
c++;
int d=0;
for(i=2;i<m-a;i++)
if((m-a)%i==0)
d++;
if(c==0&&d==0)
printf("%d %d\n",a,m-a);
}
getchar();
getchar();
} | 43 |
21,403 |
int main(int argc, char *argv[])
{
int m,i,j,flag1,flag2;
scanf("%d",&m);
for (i=3;i<=m/2;i+=2)
{
flag1=1;
flag2=1;
for (j=2;j<=i-1;j++)
{
if (i%j==0)
{flag1=0;break;}
}
for (j=2;j<=m-i-1;j++)
{
if ((m-i)%j==0)
{flag2=0;break;}
}
if ((flag1==1)&&(flag2==1))
printf("%d %d\n",i,m-i);
}
return 0;
}
| 43 |
21,404 | int sushu(int a)
{
int i,b;
b=(int)sqrt(a);
for(i=2;i<=b;i++)
{
if(a%i==0)
break;
}
if(i==b+1)
return 1;
else
return 0;
}
main()
{
int m,i;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
if(sushu(i)==1&&sushu(m-i)==1)
{
printf("%d %d\n",i,(m-i));
}
}
getchar();
getchar();
}
| 43 |
21,405 | int sushu(int n)
{
int i;
int flag=1;
for(i=2;i<n;i++)
{
if(n%i==0)
{
flag=0;
break;
}
}
return flag;
}
int main()
{
int m,i;
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2)
{
if(sushu(i)&&sushu(m-i))
{
printf("%d %d\n",i,m-i);
}
}
return 0;
} | 43 |
21,406 | int main()
{
int m,i,ii,tf,k;
cin>>m;
i=2;
while (i<m/2+1)
{
ii=1;
while (ii<(i/2+1))
{
ii=ii+1;
if (i%ii==0)
{
tf=0;
break;
}
else
tf=1;
}
ii=1;
while (ii<((m-i)/2+1))
{
ii=ii+1;
if ((m-i)%ii==0)
tf=0;
else
tf=tf*1;
}
if ((tf==1)&&(i!=1)&&(m-i!=1))
cout<<i<<" "<<(m-i)<<endl;
i++;
}
cin>>k;
return 0;
}
| 43 |
21,407 | int main()
{
int number,i,j,f,g,s;
int k=1;
scanf("%d",&number);
int num[20000];
for(i=2;i<number;i++)
{ s=i-1;
for(j=(i-1);j>0;j--)
{
if(i%j!=0)
s--;}
if(s==1)
{num[k]=i;
k++;}}
for(f=k-1;f>0;f--)
{
for(g=1;g<=f;g++)
{if(num[f]+num[g]==number)
printf("%d %d\n",num[g],num[f]);}}
getchar();
getchar();
return 0;
} | 43 |
21,408 |
int checkprime(int x)
{
int j;
int count=0;
for (j=2;j<=sqrt(x);j++)
{
if (x%j==0)
count++;
}
return count;
}
int main()
{
int i;
int n;
cin>>n;
for (i=2;i<=n/2;i++)
{
if (checkprime(i)==0&&checkprime(n-i)==0)
cout<<i<<" "<<n-i<<endl;
}
return 0;
} | 43 |
21,409 |
int szs(int a);
int main()
{
int i,j,n,m,s;
s=0;
scanf("%d",&m);
for(i=3;i<=m/2;i+=2)
{
if(szs(i)&&szs(m-i))
{
if(s!=0) printf("\n");
printf("%d %d",i,m-i);
s=1;
}
}
return 0;
}
int szs(int a)
{
int i;
for(i=2;i<=a/2;i++)
{
if(a%i==0) break;
}
if(i>a/2) return 1;
else return 0;
}
| 43 |
21,410 | int main()
{
int a, b;
double m;
cin >> m;
a = 0.5 * (m);
for(b = 3;b <= a; b++)
{
for(int d = b - 1;d >= 2; d--)
{
if (b % d == 0) break;
if (d == 2)
{
int e;e = m - b;
for(int f = e - 1;f >= 2; f--)
{
if(e % f == 0) break;
if (f == 2)
{
cout << b << " " ;
cout << e << endl;
}
}
}
}
}
return 0;
}
| 43 |
21,411 | void main()
{
int m,a,b,c,d;
scanf("%d",&m);
for(a=3;a<m;a++)
{
for(c=2;c<=sqrt(a);c++)
if(a%c==0)
break;
if(c>sqrt(a))
{
b=m-a;
for(d=2;d<=sqrt(b);d++)
{
if(b%d==0)
break;
}
if(d>sqrt(b)&&a<=b)
printf("%d %d\n",a,b);
}
}
}
| 43 |
21,412 | int main()
{
int m,i,j,k,l;
scanf("%d",&m);
for (i=3;i<=(m/2);i++)
{
for (j=2;j<=i;j++)
{
if (i%j==0)
break;
}
for (k=2;k<=m-i;k++)
{
if((m-i)%k==0)
break;
}
if (i==j)
{
if(m-i==k)
{
printf("%d",i);printf(" ");printf("%d\n",(m-i));
}
}
}
}
| 43 |
21,413 | main()
{
int n,a,b,c,d,x,y;
int f(int a);
scanf("%d",&n);
c=n/2;
for(b=3;b<=c;b++)
{
d=n-b;
x=f(b);
y=f(d);
if(x==2&&y==2)
printf("%d %d\n",b,d);
}
}
int f(int a)
{
int i,e=0;
for(i=1;i<=a;i++)
{
if(a%i==0)
e=e+1;
}
return(e);
}
| 43 |
21,414 | int main()
{
int a,i,j,n,m;
scanf("%d",&a);
for(i=3;i<a/2+1;i=i+2)
{
j=a-i;
for(n=3;n<i;n=n+2)
{
if(i%n==0)
{
goto loop;
}
}
for(m=3;m<j;m=m+2)
{
if(j%m==0)
{
goto loop;
}
}
printf("%d %d\n",i,j);
loop: continue;
}
return 0;
} | 43 |
21,415 |
int main(int argc, char* argv[])
{
int m,i,j,b,su;
scanf("%d",&m);
for(i=3;i<=m/2;i+=2){
su=1;
for(j=2;j<i;j++){
if(i%j==0) su=0;
}
if(su==1){
b=m-i;
for(j=2;j<b;j++){
if(b%j==0) su=0;
}
if(su==1)printf("%d %d\n",i,b);
}
}
return 0;
}
| 43 |
21,416 | int main()
{
int a[10001], p, m, i, j, sm;
cin >> m;
for (i = 1; i <= m; i++) a[i] = 0;
sm = sqrt(m);
for (i = 2; i <= sm; i++)
if (a[i] == 0)
for (j = 2; i * j < m; j++)
a[i * j] = 1;
for (i = 3; i <= m / 2; i++)
if ((a[i] == 0) && (a[m-i] == 0))
cout << i << ' ' << m - i << endl;
return(0);
} | 43 |
21,417 | //********************************
//*??????????? **
//*????? 1300012839 **
//*???2013.10.27**
//********************************
int main()
{
int m,a,b,i,j; //m??????a?b?????i?j?????
cin >> m;
for( a = 3;a <= m/2;a+=2) //a?3??????
{
for(i = 2;i < a;i++) //??a?????
if(a % i == 0)break;
if( i == a )
{
b = m - a; //??a??????b?????
for(j = 2;j < b;j++)
if(b % j == 0)break;
if(b == j)cout << a << " " << b << endl; //?????????a?b
}
}
return 0;
} | 43 |
21,418 | int main()
{
int m,a,b,A,B,i;
scanf("%d",&m);
a=3;
for(a=3;a<=m/2;a=a+2)
{
b=a;
for(b=a;b<=m;b=b+2)
{
if(a+b==m)
{
A=1;
B=1;
i=2;
for(i=2;i<a;i++)
{
if(a%i==0)
A=-1;
}
i=2;
for(i=2;i<b;i++)
{
if(b%i==0)
B=-1;
}
if(A==1&&B==1)
printf("%d %d\n",a,b);
}
}
}
return 0;
}
| 43 |
21,419 | int sushu(int n)
{
int i;
for(i=2;i<=sqrt(n);i++)
{
if(n%i==0) return 0;
}
return 1;
}
int main()
{
int m,i;
scanf("%d",&m);
for(i=2;i<m;i++)
{
if(sushu(i)&&sushu(m-i))
{
if(i<=m-i)
printf("%d %d\n",i,m-i);
else continue;
}
}
return 0;
}
| 43 |
21,420 |
int sushu(int x){
if(x==1) return 0;
if(x==2||x==3) return 1;
int m=sqrt(x);
int i;
for(i=2;i<=m;i++){
if(x%i==0) return 0;
}
if(i==m+1) return 1;
}
int main(int argc, char* argv[])
{
int m;
scanf("%d",&m);
int i;
for(i=3;i<=m/2;i+=2){
if(sushu(i)&&sushu(m-i)) printf("%d %d\n",i,m-i);}
return 0;
}
| 43 |
21,421 | int main()
{
int a[10000];
int m,i,n,sq,j,k=0,s,p,r;
scanf("%d",&m);
for(i=3;i<=m;i++)
{
s=0;
sq=sqrt(i)+1;
for(j=2;j<=sq;j++)
{
if(i%j==0)
{
s++;
break;
}
else
continue;
}
if(s==0)
{
a[k]=i;
k++;
}
else
continue;
}
for(i=0;i<k;i++)
{
r=0;
if(a[i]<=m/2)
{
p=m-a[i];
for(j=0;j<k;j++)
{
if(p!=a[j])
continue;
else
printf("%d %d\n",a[i],p);
}
}
else
break;
}
return 0;
}
| 43 |
21,422 | int main(){
int m,j,i,p;
cin>>m;
for(i=3;i<=m/2;i+=2)
{
p=0;
for(j=2;j<=sqrt(i);j++)if(i%j==0){p=1;break;}
for(j=2;j<=sqrt(m-i);j++)if((m-i)%j==0){p=1;break;}
if(p==1)continue;
else cout<<i<<" "<<m-i<<endl;
}
return 0;
}
| 43 |
21,423 | int main ( )
{
int j,i,n,m;
cin>>n;
int sushu[9999];
for(j=2;j<=n;j++)
{
for(i=2;i<=j;i++)
{
if(j%i==0)break;
}
if(i==j)sushu[j]=j;
}
for(m=2;m<=n/2;m++)
{
for(j=0;j<=n;j++)
{
if(m==sushu[j])for(i=0;i<=n;i++)
{
if((n-m)==sushu[i])
cout<<sushu[j]<<" "<<sushu[i]<<endl;
}
}
}
return 0;
}
| 43 |
21,424 | //*****************************
//*??:???????? ***
//*??:??? 1300012991 ***
//*??:2013?10?25? ***
//*****************************
int main()
{
int n, a, b, i, j, k, open;
cin >> n; //??????6??
for (k = 3; k <= n / 2; k = a + 2) //???????????????
{
for (a = k; a <= n / 2; a += 2) //???????????????????
{
for (i = 2; i < a; i++) //??a?????
{
if (a % i ==0) //a???????,????,?????????
break;
}
if (i == a) //a??????????,???,?????,???????
{
open = 1;
break;
}
}
b = n - a; //b??n?a??
for (j = 2; j < b; j++) //????b?????
{
if (b % j == 0)
break;
}
if ((j == b) && (open == 1)) //a?b???????
{
cout << a << " " ; //??a??b
cout << b << endl; //?????????
}
open = 0; //?????
}
return 0;
} | 43 |
21,425 | int pd(int x)
{
int z=0,i;
if(x%2!=0)
{for(i=3;i<=sqrt(x);i+=2)
{if(x%i==0)
break;
}
if(i>sqrt(x))
z=1;}
return z;
}
int main()
{
int n,a;
scanf("%d",&n);
for(a=3;a<=n/2;a+=2)
{
if(pd(a)==1&&pd(n-a)==1)
printf("%d %d\n\n",a,n-a);
}
return 0;
}
| 43 |
21,426 | //??????
int main()
{
int m,i=3,j,x,y; //m?????? i??3????? j?m-i x?y???i,j???????????
int a,b,c=1;
cin>>m;
for(i=3;i<=m/2;i=i+2) //i?3?m/2?????
{
c=1;
j=m-i;
x=sqrt(i);
y=sqrt(j);
for(a=2;a<=x;a++) //?a?2?x?????i?????
{
if(i%a==0) //??i??a?? c=0 ?????
{
c=0;
break;
}
}
for(b=2;b<=y;b++) //?b?2?y?????j?????
{
if(j%b==0) //??j??b?? c=0 ?????
{
c=0;
break;
}
}
if(c==1) //?c=1???i j ???
{
cout<<i<<" "<<j<<endl;
}
}
return 0;
} | 43 |
21,427 |
int su(int x);
int main(){
int m,n,i;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
if(su(i)==1&&su(m-i)==1)
printf("%d %d\n",i,m-i);
}
return 0;
}
int su(int x){
int j;
for(j=2;j<=x/2;j++)
{
if(x%j==0)
return 0;
}
return 1;
} | 43 |
21,428 | int su(int n)
{
int i,l;
l=sqrt(n);
for (i=2;i<=l;i++) if (n%i==0) return(0);
return(1);
}
void main()
{
int n,i;
scanf("%d",&n);
for (i=3;i<=n/2;i++)
{
if (i%2!=0&&(n-i)%2!=0&&su(i)&&su(n-i)) printf("%d %d\n",i,n-i);
}
} | 43 |
21,429 |
int judge(int);
int main()
{
int num;
cin>>num;
for (int a=2;a<=num/2;a++)
{
if (judge(a)&&judge(num-a))
{
cout<<a<<" "<<(num-a)<<endl;
}
}
return 0;
}
int judge(int n)
{
double d,t;
d=n;
t=sqrt(d);
int k=1;
for(int i=2;i<=t;i++)
{
if (n%i==0)k=0;
}
return k;
} | 43 |
21,430 | int ss[70000];
void ps()
{
int i,j;
for(i=2;i<70000;i++)
if(!ss[i])
for(j=i*2;j<70000;j=j+i)
ss[j]=1;
}
int main()
{
int n,i;
memset(ss,0,sizeof(ss));
ps();
cin>>n;
for(i=3;i<=n/2;i++)
if(!ss[i]&&!ss[n-i])
cout<<i<<' '<<n-i<<endl;
}
| 43 |
21,431 | int main()
{
int a,b,c,d,m,i,j;
scanf("%d",&m);
for(a=2;a<=m;a++)
{
for(b=a;b<=m;b++)
{
if(a+b==m)
{
c=1;
for(i=2;i<=sqrt(a);i++)
{
if(a%i==0)
c=0;
}
d=1;
for(j=2;j<=sqrt(b);j++)
{
if(b%j==0)
d=0;
}
if(c!=0)
if(d!=0) printf("%d %d\n",a,b);
}
}
}
return 0;
} | 43 |
21,432 |
int F(int n){
int m,i,j,s=1;
m=sqrt(n);
for(i=2;i<=m;i++){
for(j=m;j<=n;j++){
if(n==i*j){
s=0;
return 1;
break;
}
}
}
if(s==1) return 2;
}
int main()
{
int t,k,p;
scanf("%d",&t);
for(k=3;k<=t/2;k++){
if(F(k)==2){
p=t-k;
if(F(p)==2){
printf("%d %d\n",k,p);
}
}
}
return 0;
} | 43 |
21,433 |
int main ()
{
int m, i1, i2, k, a, b = 0;
cin >> m;
for (i1 = 3; i1 <= (m / 2); i1 += 2)
{
a = sqrt(m);
b = 0;
for (k = 2; k <= a; k++)
{
if (k == i1)
break;
if (i1 % k == 0)
b = b + 1;
}
if (b == 0)
{
i2 = m - i1;
b = 0;
for (k = 2; k <= a; k++)
{
if (k == i2)
break;
if (i2 % k == 0)
b = b + 1;
}
}
if (b == 0)
cout << i1 << " " << i2 << endl;
}
return 0;
}
| 43 |
21,434 | int main()
{
int m,a,b,i,j,i_limit_a,j_limit_b,bool_a,bool_b;
scanf("%d",&m);
for (a=3;a<=(m/2);a=a+2)
{
i_limit_a=sqrt(a);
bool_a=1;
for (i=3;i<=i_limit_a;i=i+2)
if (a%i==0) {bool_a=0;break;}
if (bool_a)
{
b=m-a;
bool_b=1;
j_limit_b=sqrt(b);
for (j=3;j<=j_limit_b;j=j+2)
if (b%j==0) {bool_b=0;break;}
if (bool_b) printf("%d %d\n",a,b);
}
}
return 0;
} | 43 |
21,435 |
int main()
{
double n;
cin >> n;
int i,j;
int k,l;
double t,s;
for(i=3;i<=n/2;i+=2)
{
t=sqrt((double)i);
for(j=2;j<=t;j++)
{
if(i%j==0)
break;
}
if(j>t)
{
l=n-i;
s=sqrt((double)l);
for(k=2;k<=s;k++)
{
if(l%k==0)
break;
}
if(k>s)
{
cout << i << " "<< l<<endl;
}
}
}
return 0;
} | 43 |
21,436 |
int checkprime(int x)
{
int j;
int count=0;
if (x==1) count=1;
if (x==2||x==3) count=0;
if (x>=4){
for (j=2;j<=sqrt(x);j++)
{
if (x%j==0)
count++;
}}
return count;
}
int main()
{
int i;
int n;
cin>>n;
for (i=1;i<=n/2;i++)
{
if (checkprime(i)==0&&checkprime(n-i)==0)
cout<<i<<" "<<n-i<<endl;
}
return 0;
}
| 43 |
21,437 | int sushu(int x)
{
int i,k;
k=sqrt(x);
for(i=2;i<=k;i++){
if(x%i==0)break;}
if(i>k) return 1;
else return 0;
}
int main()
{
int m,i,a,b;
scanf("%d",&m);
for(i=1;i<(m+2)/4;i++){
a=2*i+1;
b=m-a;
if(sushu(a)==1){
if(sushu(b)==1)printf("%d %d\n",a,b);}
}
return 0;
}
| 43 |
21,438 | int ss(int n)
{
int i,j,t=0;
for(i=2;i*i<=n;i++)
{
if(n%i == 0)
break;
}
if(i*i>n)
return 1;
else
return 0;
}
int main()
{
int m,a;
scanf("%d",&m);
for(a=3;a<=m/2;a++)
{
if(ss(a)&&ss(m-a))
{
printf("%d %d\n",a,m-a);
}
}
return 0;
} | 43 |
21,439 | int main()
{
int n,a,b,i,k;
cin>>n;
for(a=2;a<=(n/2);a++)
{
int j=0;
b=n-a;
for(i=2;i<=sqrt(a);i++)
{
if(a%i==0)
j=1;
}
for(k=2;k<=sqrt(b);k++)
{
if(b%k==0)
j=1;
}
if(j==0)
cout<<a<<" "<<b<<endl;
}
return 0;
} | 43 |
21,440 | int main()
{
int a;
cin >> a;
for (int i=3;i<=(a+1)/2;i++)
{
int p = 0;
for(int k=2;k<=i-1;k++)
{
if (i%k==0)
p=1;
}
for(int k=2;k<=a-i-1;k++)
{
if ((a-i)%k==0)
p=1;
}
if (p==0)
cout << i << " " << a-i <<endl;
}
return 0;
}
| 43 |
21,441 |
int main()
{
int n;
cin>>n;
int a,b,c,d;
for(a=3;a<=n/2;a=a+2)
{
for(c=2;c<=sqrt((double) a);c++) if(a%c==0) break;
for(d=2;d<=sqrt((double)n-a);d++) if((n-a)%d==0) break;
if(c>sqrt((double)a)&&d>sqrt((double)n-a)) cout<<a<<" "<<n-a<<endl;
}
return 0;
} | 43 |
21,442 | int main()
{
int m,p[1229],i,j,a,x=0,k,l;
for(i=3;i<10000;i++)
{
a=sqrt(i);
for(j=2;j<=a+1;j++)
{
if(i%j==0) break;
if(j==a+1)
{
p[x]=i;
x=x+1;
}
}
}
scanf("%d",&m);
for(k=0;p[k]<=m/2;k++)
{
for(l=k;p[k]+p[l]<=m;l++)
{
if(p[k]+p[l]==m)
printf("%d %d\n",p[k],p[l]);
}
}
return 0;
} | 43 |
21,443 | int main()
{
int m,i,j,k,n,a,b,x,y;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{a=0;b=0;
n=sqrt(i)+1;
x=sqrt(m-i)+1;
for(k=2;k<=n&&k!=i;k++)
{if(i%k==0)
a=a-1;
}
for(k=2;k<=x&&k!=(m-i);k++)
{if((m-i)%k==0)
b=b-1;
}
if(a==0&&b==0)
printf("%d %d\n",i,m-i);
}
return 0;
}
| 43 |
21,444 | int IsPrime(int a)
{
int i,flag=0;
for (i = 2; i <a/2; i++)
{
if (a%i == 0){ flag = 1; continue; }
}
if (flag == 0)return 1;
else return 0;
}
int main()
{
int b,i;
long m;
scanf("%ld", &m);
for (b = 3; b <= m /2;b+=2)
if (IsPrime(m-b) == 1 && IsPrime(b) == 1)
printf("%d %d\n",b,m-b);
return 0;
} | 43 |
21,445 | //********************************
//*????????? **
//*?????? 1200012837 **
//*???2012.10.22 **
//********************************
int main()
{
int m;
double x, y;
cin >> m;
for(x = 3; x <= m / 2; x += 2)
{
int i = 2;
for(; i <= (int)sqrt(x); i++)
{
if((int)x % i == 0)
break;
}
if(i == (int)sqrt(x) + 1)
{
y = m - x;
int k = 2;
for(; k <= (int)sqrt(y); k++)
{
if((int)y % k == 0)
break;
}
if(k == (int)sqrt(y) + 1)
cout << x << " " << y << endl;
}
}
return 0;
}
| 43 |
21,446 | int main()
{
int m,i,k,x,p=0,q=0;
scanf("%d",&m);
if(m==6)
printf("3 3");
else
for(i=3;i<=m/2;i+=2)
{
k=m-i;
for(x=2;x<=sqrt(i);x++)
{
if((i%x)==0)
p=1;
}
for(x=2;x<=sqrt(k);x++)
{
if((k%x)==0)
q=1;
}
if(p==0&&q==0)
printf("%d %d\n",i,k);
p=0;
q=0;
}
return 0;
} | 43 |
21,447 | int prime(int x);
int main()
{
int m,i;
scanf("%d",&m);
for(i=2;i<=m/2;i++)
{
if(prime(i)&&prime(m-i))
{
printf("%d %d\n",i,m-i);
}
}
return 0;
}
int prime(int x)
{
int echo,i;
for(i=2;i<=x;i++)
{
if(x%i==0)
{
break;
}
}
if(i==x)
{
echo=1;
}
else
{
echo=0;
}
return echo;
} | 43 |
21,448 | int f(int n)
{
int m=0;
int i=2;
for(;i<n;)
{
if(n%i==0)
break;
i++;
}
{
if(i==n)
m=1;
}
return m;
}
main()
{
int n,k;
scanf("%d",&n);
for (int i=3;i<=(n/2);i++)
{ k=n-i;
{if (f(i)==1&&f(k)==1)
printf("%d %d\n",i,k);
}
}
getchar();
getchar();
return 0;
}
| 43 |
21,449 | //* ????2??m???
//* ????
//*****
int susucheck(int a)
{int j;int flag=1;int l;
for(j=2;;j++)
{if(j*j<=a){ l=a/j;if(l*j==a) flag=0; }
else break;}
return flag;
}
int main()
{int m;
cin>>m;
int k;int i;
for(k=2;k<=m/2;k++)
{if(susucheck(k)&&susucheck(m-k))
cout<<k<<' '<<m-k<<endl;}
return 0;
} | 43 |
21,450 | int main()
{
int n,i,j,a,b,c,d,e;
scanf("%d",&n);
for(i=3;i<=(n/2);i=i+2)
{
a=sqrt(i);b=1;
for(j=2;j<=a;j++)
{if(i%j==0) b=j;}
if(b==1)
{
c=n-i;d=sqrt(c);e=1;
for(j=2;j<=d;j++)
{if(c%j==0) e=j;}
if(e==1) printf("%d %d\n",i,c);
}
}
} | 43 |
21,451 | /*
*@file 5.cpp
*@author ???
*@date 10.24
*@description ????????
*/
int main ()
{
int m, x, shuchu; //??????m?????????x,?????????????
cin >> m; //????m
for (x = 3; x <= m/2; x += 2)
{
shuchu = 1;
for (int i = 2; i <= sqrt(x); i++)
{
if ((x % i) == 0)
{
shuchu = 0;
break;
}
}
if (shuchu == 1)
{
for (int j = 2; j <= sqrt(m-x); j++)
{
if (((m-x) % j) == 0)
{
shuchu = 0;
break;
}
}
if (shuchu == 1)
{
cout << x << " " << m-x << endl;
}
}
}
return 0;
} | 43 |
21,452 | int main()
{
int m,n,k,j,i,l,p;
scanf("%d",&m);
for(n=3;n<=m/2;n++){
p=sqrt(n);
for(i=2;i<=p;i++){
if(n%i==0)break;
}
if(i>p){
k=m-n;
l=sqrt(k);
for(j=2;j<=l;j++){
if(k%j==0)break;
}
if(j>l)
printf("%d %d\n",n,k);
}
}
return 0;
} | 43 |
21,453 | int f(int x)
{
int i,t;
double k;
k=sqrt(x);
if(x%2==0);
t=0;
if(x%2==1)
{for(i=2;i<=k;i++)
{
if(x%i==0)
break;
}
if(i>k)
t=1;
else
t=0;
}
return t;
}
main()
{
int m,j;
scanf("%d",&m);
for(j=3;j<=(m/2);j++)
{
if((f(j)==1)&&(f(m-j)==1))
printf("%d %d\n",j,m-j);
}
getchar();
getchar();
getchar();
}
| 43 |
21,454 | int main()
{
int m,i,k,t,s=0,p=0;
scanf("%d",&m);
i=3;
k=1;
t=1;
while(i<=m/2)
{
while(k<=i)
{if(i%k==0)
s=s+1;
else;
k=k+1;}
if(s==2)
{
while(t<=m-i)
{if((m-i)%t==0)
p=p+1;
else;
t=t+1;}
if(p==2)
printf("%d %d\n",i,m-i);
else;
}
else;
s=0;
p=0;
t=1;
k=1;
i=i+1;
}
return 0;
} | 43 |
21,455 |
int SUSHU (int x)
{
int d = 2, none = 1, result = 0;
while (d * d <= x)
{
if (x % d == 0)
{
none = 0;
break;
}
else
d += 1;
}
if (none == 1)
result = 1;
return result;
}
int main()
{
int m, a = 3, b;
cin >> m;
while (2 * a <= m)
{
b = m - a;
if ((b % 2 != 0) && (SUSHU(a) == 1) && (SUSHU(b) == 1))
{
cout << a << " " << b << endl;
}
a += 2;
}
} | 43 |
21,456 | int main()
{
int a[10000] = {2};
int i, j, k, l, m, n;
cin >> m;
for (i=1; i<10000; i++)
{
for (n=a[i-1]+1; a[i]==0; n++)
for (j=0; j<i; j++)
{
if (n%a[j] == 0)
break;
else if (j == i-1)
a[i] = n;
}
}
for (k=1; a[k]<m; k++)
for (l=k; a[l]<m; l++)
if(a[l]+a[k] == m)
cout << a[k] << " " << a[l] << endl;
return 0;
}
| 43 |
21,457 | int main()
{
int m,a[1000]={0},b,c,d,e,i;
scanf("%d",&m);
i=1;a[0]=3;
for(b=5;b<=15+m/2;b=b+2)
{
c=0;
for(d=2;d<=sqrt(b);d++)
{
if(b%d==0) c++;
}
if(c==0)
{
a[i]=b;i++;
}
}
b=i;
for(e=0;a[e]<=m/2;e++)
{
i=m-a[e];c=0;
for(d=2;d<=sqrt(i);d++)
{
if(i%d==0) c++;
}
if(c==0)
{
printf("%d %d\n",a[e],i);
}
}
return 0;
}
| 43 |
21,458 | int main(void){
int prime[10000],r[200][2],i,j,m,timer,count,stop;
timer=-1;
count=-1;
scanf("%d",&m);
for(i=3;;i++){
for(j=2;;j++){
if(i%j!=0){
if(i-j==1){
timer++;
prime[timer]=i;
break;
}
continue;
}else{
break;
}
}
if(i==10100){
break;
}
}
for(i=0;i<timer;i++){
for(j=0;j<timer;j++){
if(m-prime[i]==prime[j]){
count++;
r[count][0]=prime[i];
r[count][1]=prime[j];
break;
}
if(prime[i]>m/2){
break;
}
}
}
if(m==6){
printf("3 3");
}
for(i=0;i<count;i++){
printf("%d %d\n",r[i][0],r[i][1]);
}
if(m==10000){
printf("4919 5081");
}
scanf("%d",&stop);
return 0;
} | 43 |
21,459 | int main()
{
int a[100000],i,j,k,n;
cin >> n;
a[1]=2;
k=2;
for(i=3;i<=n;i+=2)
{
for(j=1;;j++)
{
if(a[j]*a[j]>i)
break;
else
{
if(i%a[j]==0)
break;
}
}
if(a[j]*a[j]>i)
{
a[k]=i;
k++;
}
}
for(i=1;i<k;i++)
{
for(j=i;j<k;j++)
{
if(a[i]+a[j]==n)
{
cout << a[i] << ' ' << a[j] << endl;
}
}
}
return 0;
}
| 43 |
21,460 | int main()
{
int m;
cin >> m;
int n1, n2, i, j, p1, p2;
double a, b;
for(n1 = 3; n1 <= m / 2; n1 += 2)
{
n2 = m - n1;
a = sqrt(n1);
b = sqrt(n2);
//cout << a << b <<endl;
for(i = 2; i <= a; i++)
{
if(n1 % i == 0)
break;
}
if(i > a )
{
p1 = n1;
}
else
{
continue;
}
for(j = 2; j <= b; j++)
{
if(n2 % j == 0)
break;
}
if(j > b )
{
p2 = n2;
}
else
{
continue;
}
cout << p1 << " " << p2 << endl;
}
return 0;
} | 43 |
21,461 |
main ()
{
int m,a,b,i,t;
scanf("%d",&m);
for(a=2;a<=m/2;a++)
{
t=0;
for(i=2;i<a-1;i++)
{
if(a%i==0)t=1;
}
if(t==0)
{
b=m-a;
t=0;
for(i=2;i<b-1;i++)
{
if(b%i==0)t=1;
}
if(b==1)t=1;
if(t==0)printf("%d %d\n",a,b);
}
}
} | 43 |
21,462 | int prime(int p);
void main()
{
int a,i;
scanf("%d",&a);
for (i=2;i<=a/2;i++)
{
if (prime(i)&&prime(a-i)) printf("%d %d\n",i,a-i);
}
}
int prime(int p)
{
int i;
for (i=2;i<=(int)sqrt(p);i++)
{
if (p%i==0) return(0);
}
return(1);
}
| 43 |
21,463 | void main()
{
void pro(int n);
int n;
scanf("%d\n",&n);
pro(n);
}
void pro(int n)
{
int *odd(int n),*head;
int i,j;
head=odd(n);
for(i=0;head[i]<=n/2;i++)
for(j=i;head[j]!=0;j++)
{
if(head[i]+head[j]==n)printf("%d %d\n",head[i],head[j]);
}
}
int *odd(int n)
{
int i,j,k,m=0;
int a[1000]={0};
for(i=3;i<n;i+=2)
{
k=sqrt(i);
for(j=2;j<=k;j++)
{ if(i%j==0)break;}
if(j>k)
{
a[m]=i;m++;
}
}
return(a);
}
| 43 |
21,464 | int main()
{
int prime(int);
int n,i;
scanf("%d",&n);
for(i=2;i<=n/2;i++)
if(prime(i)&&prime(n-i))
printf("%d %d\n",i,n-i);
}
int prime(int n)
{
int i,a=1;
for(i=2;i<=sqrt(n)&&a==1;i++)
if(n%i==0)
a=0;
return(a);
} | 43 |
21,465 | void main()
{
int a,b,c,d;
scanf("%d",&a);
for(b=3;b<=a/2;b+=2)
{
for(c=2;c<=sqrt(b);c++)
if(b%c==0) break;
if(c>sqrt(b))
d=a-b;
else
continue;
for(c=2;c<=sqrt(d);c++)
if(d%c==0) break;
if(c>sqrt(d))
printf("%d %d\n",b,d);
}
} | 43 |
21,466 | int issn(int n);
int main()
{
int n,a,b=0,c;
int z[10000];
scanf("%d",&n);
for(a=3;a<n+100;a++)
{
if(issn(a))
{
z[b]=a;
b++;
}
}
for(a=0;a<=b-1;a++)
{
for(c=a;c<b-1;c++)
{
if(z[a]+z[c]==n)
{
printf("%d %d\n",z[a],z[c]);
}
}
}
return 0;
}
int issn(int n)
{
int a,b=1;
for(a=2;a<n;a++)
{
if(n%a==0) b=0;
}
return b;
} | 43 |
21,467 | int main()
{
int n;
int a,b;
int i,k,l;
cin >> n;
for(a=3;a<=n/2;a=a+2)
{
int j=0;
for(i=2;i<a;i++)
{
if(a%i==0)
{
j++;
}
else ;
}
if(j>0)
{
continue;
}
else
b=n-a;
l=0;
for(k=2;k<b;k++)
{
if(b%k==0)
{
l++;
}
else ;
}
if(l>0)
{
continue;
}
else
cout << a << " " << b << endl;
continue;
}
cin.get();cin.get();cin.get();
return 0;
}
| 43 |
21,468 |
int main()
{
int n, s;
cin >> n;
for (int i = 3; i <= n / 2; i++)
{
for (int j = 2; j <= i; j++)
{
if (i % j == 0 && j != i)
{
break;
}
if (j == i)
{
s = n - i;
for (int k = 2; k <= s; k++)
{
if (s % k == 0 && s != k)
{
break;
}
if (s == k)
{
cout << i << ' ' << s << endl;
}
}
}
}
}
return 0;
} | 43 |
21,469 | int ss(int a);
main()
{
int m;
scanf("%d",&m);
int a,b;
int i,j;
for(a=3;a<=m/2;a++)
{
i=ss(a);
if(i==0)
{
b=m-a;
j=ss(b);
if(j==0)
printf("%d %d\n",a,b);
}
}
return 0;
}
int ss(int a)
{
int i=2,k=0;
for(i=2;i<=(a/2);i++)
if((a%i)==0)
k++;
return k;
}
| 43 |
21,470 | int main()
{
int m,n,k,a,b,i,j,l,y,z,t,s;
scanf("%d",&m);
n=m/2;
k=(n+1)/2;
for(i=1;i<=k-1;i++)
{
a=2*i+1;
b=m-a;
t=1;
s=1;
for(j=2;j<=a-1;j++)
{
y=a%j;
if(y==0) t*=0;
}
for(l=2;l<=b-1;l++)
{
z=b%l;
if(z==0) s*=0;
}
if(t&&s)
printf("%d %d\n",a,b);
}
return(0);
}
| 43 |
21,471 | main ()
{
int i,j,k,m,n,p;
scanf("%d",&m);
n=m/2;
for (i=1;i<=n;i++)
{
p=m-i;
for (j=2;j<=i;j++)
if (i%j==0) break;
for (k=2;k<=p;k++)
if (p%k==0) break;
if (j==i&&k==p)
printf("%d %d\n",i,p);
}
}
| 43 |
21,472 | int main()
{
int m,i,j,k,odd1,odd2,sum1,sum2;//m:?????;i,j,k:????;odd1,odd2:??????????odd1<odd2;sum1,sum2:??????????????????
cin>>m;
for(i=3;i<=m/2;i+=2)
{
sum1=0;
sum2=0;
odd1=i;
odd2=m-odd1;
for(j=2;j<odd1;j++)
if(odd1%j==0)
sum1+=1;
for(k=2;k<odd2;k++)
if(odd2%k==0)
sum2+=1;
if(sum1==0&&sum2==0)
cout<<odd1<<' '<<odd2<<endl;
}
return 0;
}
| 43 |
21,473 | //*************************************
//*???Oct 23, 2013 - ?????? **
//*?????? 1300012719 **
//*???2013.10.25 **
//*************************************
int main()
{
int m, p1, p2, i, k; //m?????6???,p1,p2?????????????,i???p1,p2??????????,k???????????
cin >> m;
for (p1 = 3; p1 <= (m / 2); p1 += 2) //??????m,??m>=6,????????2,p1??3???????????
{
k = 1; //?????k
for (i = 1; i <= sqrt (p1); i += 2) //??p1????2???,???i????p1,?i?1?p1^(1/2)??????
{
if ((p1 % i == 0) && (i != 1)) //?????????1?i?p1???,??k???,???????,?????k=0
{ //??,?????????1?i???p1????p1???,?????k=1
k = 0;
break;
}
}
if (k == 1) //??p1?????,????,??????,p1????
{
p2 = m - p1; //?p1???,???p2?????
for (i = 1; i <= sqrt (p2); i += 2) //??????,??i???,???????k??1???????
{
if ((p2 % i == 0) && (i != 1))
{
k = 0;
break;
}
}
if (k == 1)
cout << p1 << " " << p2 << endl; //?p2???????????p1 p2,??p1+p2=m
}
}
return 0;
} | 43 |
21,474 | //*********************************************************************
//*????caixiang.cpp *
//*? ??spica *
//*?????2011?10? *
//*????:???????????m,?????2?????? *
//*********************************************************************
int main()
{
int even=0,odd1=0,odd2=0,sum1=0,sum2=0,j=0,k=0;//????even,?????odd1,odd2,??????sum1,sum2???????j,k
cin>>even;
for(odd1=3;odd1<=even/2;odd1++)
{
sum1=0;
sum2=0;
odd2=even-odd1;
for(j=2;j<odd1;j++)
{
if(odd1%j==0)
sum1=sum1+1;
}
for(k=2;k<odd2;k++)
{
if(odd2%k==0)
sum2=sum2+1;
}
if(sum1==0&&sum2==0)
cout<<odd1<<" "<<odd2<<endl;
}
return 0;
} | 43 |
21,475 | int prime(int n)
{
int i,isprime=1;
for(i=2;i*i<=n;i++)
{
if(n%i==0)
{
isprime=0;
break;
}
}
return isprime;
}
main()
{
int n,i,a,b;
scanf("%d",&n);
for(i=3;i<=n/2;i+=2)
{
a=prime(i);
b=prime(n-i);
if(a==1&&b==1)
printf("%d %d\n",i,n-i);
}
getchar();
getchar();
}
| 43 |
21,476 | //****************************
//*????????? **
//*?????? 1200012896 **
//*???2012.10.21 **
//****************************
int main()
{
int n, a, b, i, m;
cin >> n;
for (a = 3; a <= n / 2; a++)
{
b = n - a;
for (i = 2; i <= (int)sqrt (a); i++)
{
if (a % i == 0)
break;
}
if (i == (int)sqrt (a) + 1)
{
for (m = 2; m <= (int)sqrt (b); m++)
{
if (b % m == 0)
break;
}
if (m == (int)sqrt (b) + 1)
cout << a << " " << b << endl;
}
}
return 0;
} | 43 |
21,477 | int yes(int n)
{
int m,i;
m=(int)sqrt(n);
for(i=3;i<=m;i+=2)
{
if(n%i==0)
return 0;
}
return 1;
}
main()
{
int m,n,i;
scanf("%d",&n);
for(i=3;i<=n/2;i+=2)
{
if(yes(i)&&yes(n-i))
{
printf("%d %d\n",i,n-i);
}
}
getchar();
getchar();
}
| 43 |
21,478 | int main()
{
int n,i,k,s,l,m,a,b;
cin >> n;
s = n / 2;
for (i = 3;i <= s;i += 2)
{
l = sqrt(i);
for (k = 1;k <= l;k++)
{
if (i % k == 0 && k != 1)
break;
if (k == l)
{
a = n - i;
b = sqrt(a);
for (m = 1;m <= b;m++)
{
if (a % m == 0 && m != 1)
break;
if (m == b)
cout << i << " " << n-i << endl;
}
}
}
}
return 0;
}
| 43 |
21,479 | int prime(int n)
{
int i,flag = 0;
if(n%2)
{
for(i = 3;i <= sqrt((double)n); i+=2)
{
if(n%i==0){
flag = 1;
break;
}
}
if(flag)return 0;
else return 1;
}
else return 0;
}
int main()
{
int n,i;
cin>>n;
for(i = 3;i <= n/2;i+=2)
{
if(prime(i)&&prime(n-i))
cout<<i<<' '<<n-i<<endl;
}
return 0;
} | 43 |
21,480 | int main()
{
int m,i,j,k,c;
scanf("%d",&m);
for (i=3;i<=(m/2);i+=2)
{
c=1;
for(j=3;j<i;j++)
{
if(i%j==0)
{ c=0;
break;
}
}
if(c==0) continue;
for(k=3;k<m-i;k++)
{
if((m-i)%k==0)
{c=0;
break;
}
}
if(c==0) continue;
printf("%d %d\n",i,m-i);
}
return 0;
}
| 43 |
21,481 |
main()
{
int prime[10010]={0};
int m;
int i,j;
scanf("%d",&m);
prime[1]=1;
for(i=2;i<=100;i++)
for(j=i+1;j<=m;j++)
{if(j%i==0) prime[j]=1;}
for(j=3;j<=m/2;j=j+2)
if(prime[j]==0&&prime[m-j]==0)
printf("%d %d\n\n",j,m-j);
}
| 43 |
21,482 | int main()
{int i, j, k= 0,l, a[1228], m;
cin>> m;
for(i= 3; i<= 9997; i= i+ 2)
{l=0;
for(j= 3; j<= sqrt(i); j++)
{if(i%j== 0)
l++;}
if(l==0)
a[k++]= i;
}
for(i= 0; a[i]<= m/2; i++)
{for(j= i; a[j]<= m- a[i]; j++)
if(a[i]+ a[j]== m)
cout<< a[i]<< " "<< a[j]<< endl;
}
return 0;
} | 43 |
21,483 | int f(int a)
{
int i,j=0;
if (a==2)
return 0;
else
{
for(i=2;i<a;i++)
{
if (a%i==0)
break;
j++;
}
if (j==a-2)
return 0;
else
return 1;
}
}
main ()
{
int a,b,c,i,j,k;
int g[100];
for(i=0;i<100;i++)
{
g[i]=0;
}
scanf("%d",&a);
j=0;
for (b=2;b<=a;b++)
{
if (f(b)==0)
{
g[j]=b;
j++;
}
}
for(i=0;i<j;i++)
{
c=a-g[i];
for (k=i;k<j;k++)
{
if (c==g[k])
printf("%d %d\n",g[i],g[k]);
}
}
getchar();
getchar();
}
| 43 |
21,484 | /*
* 1.cpp
*
* Created on: 2012-10-8
* Author: Lixurong
*/
int runnian( int a );
int main()
{
int m;
cin >> m;
int a[5000]={0};
a[1]=2;
int s=2;
for( int i=3; i<10000; i++ )
{
int k=1;
for( int j=1; a[j]*a[j]<=i; j++ )
{
if( i%a[j]==0 )
{
k = 0;
break;
}
}
if( k==1 )
{
a[s]=i;
s++;
}
}
for( int i=1; a[i]<m; i++ )
{
for( int j=i; a[j]<m; j++ )
{
if( a[i]+a[j]==m )
{
cout << a[i] << " " << a[j] << endl;
}
}
}
return 0;
} | 43 |
21,485 | //********************************
//*??????????? **
//*????? 1200012845 **
//*???2012.10.22 **
//********************************
int main()
{
int m, a, b, i, j; //j?a????i?b???
cin >> m;
for (a = 3; a <= (m / 2); a = a + 2)
{
int a1 = (int) sqrt(a);
for (j = 2; j <= a1; j++)
{
if (a % j == 0) break; //?a??j??????????????
}
if (j == (a1 + 1)) //?j=a1+1?a???j???????a???
{
for (b = a; b <= m; b = b + 2)
{
int b1 = (int) sqrt(b);
for (i = 2; i <= b1; i++)
{
if (b % i == 0) break; //?b??i??????????????
}
if ((i == (b1 + 1)) && (a + b == m)) //?i=b1+1?b???i???????b???
{
cout << a << " " << b << endl;
}
}
}
}
return 0;
}
| 43 |
21,486 | //***************************
//???????????? ?cpp4?
//??????
//???1300012712
//???2013?10?23?
//***************************
int main ()
{
int m, x, i, j; // m???????? x?????? i j??????
cin >> m;
for (x = 3; x <= m/2; x = x + 2) // ?????? ???????????m/??
{
for (i = 2; i <= sqrt(x); i++) // ?2?x??????x?????
{
if (x % i == 0)
break; // ??x?????i?? ????
}
if (i > sqrt(x)) // ????????? ?x???
{
for (j = 2; j <= sqrt(m-x); j++) // ??m-x?????
{
if (((m - x) % j) == 0)
break; // ??m-x?????j?? ????
}
if (j > sqrt(m - x)) // ?????????? m-x????
cout << x << " " << m - x << endl; // m?m-x??????????
}
}
return 0;
}
| 43 |
21,487 |
int main()
{
int isprime(int n);
int m,i;
scanf("%d",&m);
for (i=3;i<=(m/2);i+=2)
{
if(isprime(i)&&isprime(m-i))
printf("%d %d\n",i,m-i);
}
}
int isprime(int n)
{
int i;
for (i=2;i*i<=n;i++)
if (n%i==0)
return 0;
return 1;
}
| 43 |
21,488 | int pa(int i);
int main()
{
int m,i,p,q,a,b;
scanf("%d",&m);
for(i=1;2*i<m-3;i++)
{
a=2*i+1;
b=m-1-2*i;
p=pa(a);
q=pa(b);
if(p==0&&q==0&&a<=b)
{
printf("%d %d\n",a,b);
}
}
return 0;
}
int pa(int i)
{
int k,t=0;
for(k=i-1;k>1;k--)
{
if (i%k==0){t++;}
}
return t;
} | 43 |
21,489 | int main()
{
int m,i,j,k;
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2){
for(j=3;j<=i&&i%j!=0;j=j+2);
for(k=3;k<=m-i&&(m-i)%k!=0;k=k+2);
if(j==i&&k==m-i)
printf("%d %d\n",j,k);
}
return 0;
} | 43 |
21,490 | int main()
{
int m,a,b,i;
scanf("%d",&m);
for(a=2;a<=(m/2);a++)
{
b=m-a;
for(i=2;i<a;i++)
{if(a%i!=0)
continue;
else
goto a;}
for(i=2;i<b;i++)
{
if(b%i!=0)
continue;
else
goto a;
}
printf("%d %d\n",a,b);
a:continue;
}
return 0;
}
| 43 |
21,491 | int main()
{
int i,j,n,s,k,m;
scanf("%d",&n);
for(i=3;i<n/2+1;i+=2)
{
s=0;
for(m=2;m<i;m++)
{
if(i%m==0)
{
s=1;
break;
}
}
if(s==1)
{
continue;
}
j=n-i;
for(k=2;k<j;k++)
{
s=0;
if(j%k==0)
{
s=2;
break;
}
}
if(s==2)
{
continue;
}
if(i+j==n)
{
printf("%d %d\n",i,j);
}
}
return 0;
}
| 43 |
21,492 | int main()
{
int n,a,b,i,j,k,l,flag=0;
scanf("%d",&n);
for(i=3;i<=n/2;i++)
{flag=0;
for(j=2;j<i;j++)
{
if(i%j==0)
flag=1;}
if(flag==0)
{a=i;
b=n-a;
for(k=2;k<b;k++)
if(b%k==0)
flag=1;}
if(flag==0)
printf("%d %d\n",a,b);}
scanf("%d",&l);
return 0;
} | 43 |
21,493 | main()
{
int m;
scanf("%d",&m);
int i,j,judge,k,judge2;
for (i=2;i<=m/2;i++)
{
judge=1;
for (j=2;j<i/2;j++)
{
if (i%j==0)
judge=0;
}
if (judge==1)
{
k=m-i;
judge2=1;
for (j=2;j<k/2+1;j++)
{
if (k%j==0)
judge2=0;
}
if (judge2==1)
printf("%d %d\n",i,k);
}
}
getchar();
getchar();
} | 43 |
21,494 | int main()
{
int sushu(int x);
int m,i,j,k;
scanf("%d",&m);
for (i=3;i<=m/2;i++)
{
k=sushu(i);
if (k==1)
{
j=m-i;
if (sushu(j)==1) printf("%d %d\n",i,j);
}
}
return 0;
}
int sushu(int x)
{
int n;
for (n=2;n<x;n++)
{
if (x%n==0)
{return 0;break;}
}
if (n>=x) return 1;
}
| 43 |
21,495 | int prime(int a);
int main()
{
int i=3,m,d;
cin>>m;
for(i=3;i<=m/2;i+=2)
{
if(prime(i)!=0)
{
d=m-i;
if(prime(d)!=0)
{
cout<<i<<" "<<d<<endl;
}
}
}
return 0;
}
int prime(int a)
{
int e=1,i=3;
if(a<7)
a+=8;
else
if(a==7)
return 1;
for(i=3;i<=sqrt(a*1.0);i+=2)
{
e*=a%i;
if(e!=0)
e=1;
}
if(e!=0)
return 1;
else
return 0;
} | 43 |
21,496 | int sushu(int w)
{
int c,d;
d=1;
c=2;
while(c<=w-1)
{
if(w%c==0)
{
d=0;
break;
}
c++;
}
return d;
}
int main()
{
int m,p;
scanf("%d",&m);
p=3;
while(p<=m/2)
{
if (sushu(p)&&sushu(m-p))
printf("%d %d\n",p,m-p);
p++;
}
return 0;
} | 43 |
21,497 | int main()
{
int sushu(int);//shusu?????????????
int num=0;//num???????
cin>>num;
for(int i=3;i<=num/2;i=i+2)
{
if(sushu(i)&&sushu(num-i))//???????1????????????if???
cout<<i<<' '<<num-i<<endl;
}
return 0;
}
int sushu(int n1)//??n1?????
{
if(n1==2||n1==3)return 1;
for(int j=2;j<=sqrt(n1);j++)
{
if(n1%j==0)return 0;//n1????????????0
}
return 1;//n1???j??????????????1
}
| 43 |
21,498 | int main()
{
int n,a,b,c,i,d=0,e=0;
scanf("%d",&n);
for( i=3;i<=n/2;i=i+2)
{
for( a=2;a<i;a++)
{
if(i%a==0)
{d=1;break;}
else {d=0;}
}
if(d==0)
{
b=n-i;
for( c=3;c<b;c=c+2)
{
if(b%c==0)
{e=1;break;}
else {e=0;}
}
}
else {continue;}
if(e==0&&d==0)
printf("%d %d\n",i,b);
else{ continue;}
}return 0;
} | 43 |
21,499 | int main()
{ int m=0,i=0;
int su(int n);
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2)
{ if(su(i)==1&&su(m-i)==1)
{printf("%d %d",i,m-i);
if(i<m/2)
{printf("\n");
}
}
}
return(0);
}
int su(int n)
{ int i=2,t=1;
for(i=2;i<n-1;i++)
{ if(n%i==0)
{ t=0;
break;
}
}
return(t);
} | 43 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.