id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
21,300 | int main()
{
int m,i,j,k;
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2)
{
int r=0;
for(k=3;k<i*1.0/2;k=k+2)
{
if(i%k==0)
{
r=1;
break;
}
}
if(r==1)
{
continue;
}
j=m-i;
for(k=3;k<j*1.0/2;k=k+2)
{
if(j%k==0)
{
r=1;
break;
}
}
if(r==0)
{
printf("%d %d\n",i,j);
}
}
return 0;
} | 43 |
21,301 | //********************************
//*????1.cpp **
//*????????? **
//*?????? 1200012834 **
//*???2012.10.22 **
//********************************
int main()
{
int m, a, b, i, j1=0, j2=0; // a??????b??????j1?j2?a?b????
cin >> m;
for(a = 3; a <= m/2; a++) // a?3???m/2???a<=b
{
b=m-a; // ??b??
for(i = 1; i <= a; i++) // ???????a?????
{
if(a % i == 0)
{
j1 = j1 + 1;
}
}
for(i = 1; i <= b; i++) // ???????b?????
{
if(b % i == 0)
{
j2 = j2 + 1;
}
}
if(j1 == 2 && j2 == 2) // ??a?b???2??????a?b????
{
cout << a << " " << b << endl; // ??a?b??
}
j1 = 0;
j2 = 0; // ????????????????0
}
return 0;
}
| 43 |
21,302 | //*************************
//*???2013?10?23? *
//*?????? *
//*??????????? *
//*************************
int main ()
{
int a, n, i, k; //??????a??????n????i?k
cin >> a;
for(n = 3; n <= a / 2; n += 2) //???????????3?????????
{
for(i = 2; i <= n - 1; i++) //??n?????
{
if(n % i == 0)
break; //??n???????????
else if(i == n - 1) //??n??????a-n
{
for(k = 2; k <= a - n - 1; k++) //??a-n?????
{
if((a - n) % k == 0)
break; //??a-n???????????
else if(k == a - n - 1) //??a-n???
cout << n << " " << a-n << endl; //??????
}
}
}
}
return 0;
} | 43 |
21,303 | int main()
{
int check(int x);
int a,b,num;
scanf("%d",&num);
for(a=2;a<=(num/2);a++)
{
b=num-a;
if(check(b)&&check(a)) printf("%d %d\n",a,b);
}
return 0;
}
int check(int x){
int i,k;
k=sqrt(x);
for(i=2;i<=k;i++)
if(!(x%i)){
x=0;break;}
return x;
}
| 43 |
21,304 | int judge(int x)
{
int i,j=1;
for(i=2;i*i<=x;i++)
if(x%i==0)
{
j=0;
break;
}
return j;
}
void main()
{
int m,i,j,p,q;
scanf("%d",&m);
for(i=2;i<m;i++)
if(judge(i))
{
p=i;
for(j=i;j<m;j++)
if(judge(j))
{
q=j;
if(p+q==m)
{
printf("%d %d\n",p,q);
break;
}
}
}
} | 43 |
21,305 | int sushu(int a)
{
int i;
for(i = 2;i <= sqrt(a)+1;i ++)
{if(a%i == 0) {a = 1; break;}}
return a;
}
int main()
{
int n,s1,s2,j,k;
scanf("%d",&n);
for(j = 2;j <= n/2; j++){
s1=sushu(j);
if(s1 != 1){
k=n-s1;
s2=sushu(k);
if(s2 != 1)
printf("%d %d\n",s1,s2);
}
}
return 0;
} | 43 |
21,306 | // ????????
// main.cpp
// Homework
//
// Created by ??? on 13-10-18.
// Copyright (c) 2013? ???. All rights reserved.
//
int sushu(int n)//???? ???1 ???0
{
for(int i=2;i*i<=n;i++)
{
if(n%i==0)
{
return 0;
break;
}
}
return 1;
}
int main()
{
int m,a;
cin>>m;
for(a=3;a<=m/2;a=a+2)
{
if(sushu(a)&&sushu(m-a))//?????m ?????
cout<<a<<" "<<m-a<<endl;
}
return 0;
}
| 43 |
21,307 | int main()
{
int m,a,b,g=1,l=1;
double c,d;
cin>>m;
for(a=3;a<=m/2;a+=2)
{
c=sqrt(a);
for(int i=2;i<=c;i++)
{
if(a%i==0)
{
g=0;
break;
}
}
if(g==1)
{
b=m-a;
d=sqrt(b);
for(int j=2;j<=d;j++)
{
if(b%j==0)
{
l=0;
break;
}
}
if(l==1)
{
cout<<a<<" "<<b<<endl;
}
}
g=1;
l=1;
}
return 0;
} | 43 |
21,308 | int main()
{
int i,n,m,j,l,a,b,k,p;
scanf("%d",&m);
for (i=3;i<=m/2;i++)
{
k=sqrt(i);
for(j=2;j<=k;j++) //??i?????
if(i%j==0) break;
if(j>=k+1){ p=sqrt(m-i);
for(l=2;l<=p;l++) //???m-i?????
if((m-i)%l==0) break;
if(l>=p+1)printf("%d %d\n",i,m-i) ;
}
}
} | 43 |
21,309 | int main()
{
int m,n,i,j,x,y,p,q;
scanf("%d",&m);
n=m/2;
i=3;
while(i<=n)
{
x=sqrt(i);
for(p=3;p<=x;p++)
{
if(i%p==0) break;
}
if(p>=x+1)
{j=m-i;
y=sqrt(j);
for(q=3;q<=y;q++)
{
if(j%q==0) break;
}
if(q>=y+1)
printf("\n%d %d\n",i,j);
}
i+=2;
}
return 0;
} | 43 |
21,310 | int su(int z)
{
int i=2,t=0,k=sqrt(z);
for(i=2;i<=k;i++)
{
if(z%i==0)
break;
}
if(i>k) t=1;
return t;
}
int main()
{
int m,i,j;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{ j=m-i;
if(su(i)&&su(j))
{printf("%d %d\n",i,j);
}
}
return 0;
}
| 43 |
21,311 | int main()
{int q[100000],w[100000];
int i,j,k,l,m,n,a,b,c;
scanf("%d",&n);
k=0;
for(i=3;i<=n;i++)
{
for(j=2;j<=i-1;j++)
{
if(i%j==0)
{break;}
if(j==i-1)
{
k=k+1;q[k]=w[k]=i;
}
}
}
for(l=1;l<=n;l++)
{
for(m=l;m<=n;m++)
if(n==q[l]+w[m])
printf("%d %d\n",q[l],w[m]);
}
}
| 43 |
21,312 | int main()
{
int m,i,j;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
for(j=1;j++;j<=i)
{
if(i%j==0)
break;
}
if(j==i)
{
for(j=2;j++;j<=m-i)
{
if((m-i)%j==0)
break;
}
if(j==m-i)
printf("%d %d\n",i,m-i);
}
}
getchar();
getchar();
}
| 43 |
21,313 | //************************************
//*?????? 1300012809 **
//*???2013.10.24 **
//*??????????? **
//************************************
int main ()
{
int m,i,a,b,c,j,d,f,k,panduan;
cin >> m ;
c=m/2;
for (a=3;a<=c;a=a+2) //?????????3??????+2
{
b=m-a; //???3?m????????????????
d=sqrt(b);
panduan=0;
for (j=2;j<=d;j++) //??????????
{
if (b%j==0) panduan=1;
}
f=sqrt(a);
for (k=2;k<=f;k++) //???????????
{
if (a%k==0) panduan=1;
}
if (panduan==0) cout << a << " " << b << endl; //?????????
}
return 0 ;
} | 43 |
21,314 | int main()
{
int m,i,j,z,k,h;
scanf("%d",&m);
for(i=3;i<=m/2;i+=2)
{
z=1;
k=m-i;
for(j=2;j<=sqrt(i);j++)
{
if(i%j==0)z=0;
}
for(h=2;h<=sqrt(k);h++)
{
if(k%h==0)z=0;
}
if(z!=0)printf("%d %d\n",i,k);
}
}
| 43 |
21,315 | int main()
{
int k,m,n,i,j;
scanf("%d",&k);
for(m=3;m<=k;m++)
{
n=k-m;
for(i=2;i<m;i++)
{
if (m%i==0)
break;
}
for(j=2;j<n;j++)
{
if(n%j==0)
break;
}
if (i==m&&j==n)
if (k==m+n)
if(m<=n)
printf("%d %d\n",m,n);
}
return 0;
}
| 43 |
21,316 |
int isPrime(int x)
{
int i;
for(i=2;i*i<=x;i++)
if(x%i==0)
return 0;
return 1;
}
int main()
{
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);
}
return 0;
} | 43 |
21,317 | int main()
{
int n,i,j,k,a;
double b;
scanf("%d",&n);
for(i=3;i<=2*n-1;i=i+2)
{
b=i;
a=(int)sqrt(b)+1;
for(k=2;k<a;k++)
{
if(i%k==0)
break;
}
if(a==k)
for(j=i;j<=n-i;j=j+2)
{
b=j;
a=(int)sqrt(b)+1;
for(k=2;k<a;k++)
{
if(j%k==0)
break;
}
if(a==k)
if(n==i+j)
printf("%d %d\n",i,j);
}
}
return 0;
}
| 43 |
21,318 | int main()
{
int m,i,j,flag,t;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
flag=1;
for(j=2;j<i;j++)
{
if(i%j!=0)
flag*=1;
else
flag*=0;
}
if(flag==1)
{
t=m-i;
flag=1;
for(j=2;j<m-i;j++)
{
if((m-i)%j!=0)
flag*=1;
else
flag*=0;
}
if(flag==1)
printf("%d %d\n",i,m-i);
}
}
return 0;
}
| 43 |
21,319 | void main()
{
int i,j,m,a,b;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
j=m-i;
for(a=2;a<=sqrt(i);a=a+1)
{
if(i%a==0) break;
}
for(b=2;b<=sqrt(j);b=b+1)
{
if(j%b==0) break;
}
if(a>sqrt(i)&&b>sqrt(j)) printf("%d %d\n",i,j);
}
}
| 43 |
21,320 | int prime(int a){
int k, x=(int)sqrt(a);
for (k=2;k<=x;k++) {
if (a%k==0) {
break;
}
}
if(k>x){
return 1;
}
else
return 0;
}
int main(){
int m,i,a,b;
scanf("%d\n",&m);
for(i=3;i<=m/2;i++){
a=i;
b=m-i;
if ((prime(a)==1)&&(prime(b)==1))
printf("%d %d\n",a,b);
}
return 0;
} | 43 |
21,321 | int main()
{
int m,a,b,i,k;
scanf("%d",&m);
for(a=3;a<=m/2;a=a+2)
{
b=m-a;
i=2;
k=2;
while(i<=a-1)
{
if(a%i==0)
break;
else
i=i+1;
}
while(k<=b-1)
{
if(b%k==0)
break;
else
{if(k==b-1&&i==a)
printf("%d %d\n",a,b);}
k=k+1;
}
}
} | 43 |
21,322 | // * * * * * * * * * * * * * * *
// *????????? *
// *?????? 1300013011 *
// *???2013.10.25 *
// * * * * * * * * * * * * * * *
int main()
{
int m, a, b, i, k; // a,b????,i,k????
cin >> m;
for(a = 3; a <= m / 2; a = a + 2) // ???m/2???
{
for(i = 3; i < a; i = i + 2)
{
if (a % i == 0)
break;
}
if (i == a)
{
b = m - a; // ?b??m-a
for(k = 3; k < b; k = k + 2) // ??b?????
{
if(b % k == 0)
break;
}
if (k == b)
cout << a << " " << b << endl;
}
}
return 0;
} | 43 |
21,323 | int main()
{
int m,i,j,a,b;
scanf("%d",&m);
for(i=1;i<=m/2;i++)
{
a=2;
while(i%a!=0&&a<=i)
a++;
if(a==i){
b=2;
while(((m-i)%b!=0)&&(b<=m-i))
b++;
if(b==m-i)
printf("%d %d\n",i,m-i);
}
}
return 0;
} | 43 |
21,324 |
int judge(int n)
{
int limit;
int count = 0;
limit = sqrt(n);
for(int i = 2; i <= limit; i ++)
{
if(n % i == 0)
count = 1;
}
if(count == 0)
return 1;
return 0;
}
int main ()
{
int m;
cin >> m;
for(int i = 3; i <= m / 2; i += 2)
{
if(judge(i) == 1 && judge(m - i) == 1)
cout << i << " " << m - i << endl;
}
return 0;
} | 43 |
21,325 | 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]);
}
}
} | 43 |
21,326 | int n;
void main()
{
int a;
scanf("%d",&n);
for(a=3;a<=n-a;a+=2){
if(chose(a)&&chose(n-a))
printf("%d %d\n",a,n-a);
}
}
int chose(int n)
{
int i;
if(n==3)
return 1;
else if(n%2){
for(i=3;i<=sqrt(n)+2;i+=2)
if(!(n%i))
break;
if(i>sqrt(n))
return 1;
else
return 0;
}
else
return 0;
} | 43 |
21,327 |
int main()
{
int n;
cin>>n;
int i,j,k;
for(i=3;i<=n/2;i=i+2)
{
for(j=2;j<=i;j++)
{
if(i%j==0) {break;}
}
if(j==i)//????????i???
{
for(k=2;k<=n-i;k++)
{
if((n-i)%k==0) {break;}
}
if(k==n-i)//???n-i???
{
cout<<i<<" "<<n-i<<endl;
}
}
}
return 0;
}
| 43 |
21,328 | //*****************************************************************
//??????
/*?????????????????????????m?m>=6????
int????????????2??????????1?????????
??????*/
//*****************************************************************
int check(int a) //?????????????
{
int i,k;
k=0;
if(a==2||a==3) //?????????else??????
k=0;
else
{
for(i=2;i<a;i++)
{
if(a%i==0)
{
k=k+1;
break;
}
}
}
if(k==0)
return a; //?????a
else
return 0; //?????0
}
int main()
{
int m,i,j;
cin>>m;
for(i=2;i<m;i++)
{
if(check(i)==0) //??i?????
continue;
else
{
j=m-i;
if(check(j)==0||j==1) //??m-i?????
continue;
else
{
if(i<=j)
cout<<i<<' '<<j<<endl; //????????
//i?j???????????i<m??????i<j.
}
}
}
cin.get();
return 0;
} | 43 |
21,329 | int main()
{
int n,i,j,t,p;
scanf("%d",&n);
for(i=3;i<=n/2;i++){
t=0;
p=0;
for(j=2;j<=i/2+1;j++){
while(t==0){
if(i%j==0)t=1;
break;
}
if(t==1)break;
}
for(j=2;j<=(n-i)/2+1;j++){
while(p==0){
if((n-i)%j==0)p=1;
break;
}
if(p==1)break;
}
if(t==0&&p==0)printf("%d %d\n",i,n-i);
}
return 0;
} | 43 |
21,330 | int zhishu(int n)
{
int i,m;
for(i=2;i<n;i++)
{
if (n%i==0)
{m=0;
break;}
}
if (i==n)
m=1;
return m;
}
int main()
{
int n,a,b;
scanf("%d",&n);
for(int i=3;i<=n/2;i++)
{
a=zhishu(i);
b=zhishu(n-i);
if (a==1&&b==1)
printf("%d %d\n",i,n-i);
}
getchar();
getchar();
getchar();
getchar();
}
| 43 |
21,331 | int main()
{
int m, x, y, i, k, t;
k = t = 0;
cin >> m;
for (x = 3; x <= (m / 2); x += 2)
{
for (i = 3; i * i <= x; i += 2)
{
if ((x % i) == 0)
{
k = 1;
break;
}
}
if (k == 0)
{
y = m - x;
for (i = 3; i * i <= y; i += 2)
{
if ((y % i) == 0)
{
t = 1;
break;
}
}
if (t == 0)
cout << x << ' ' << y << endl;
else
t = 0;
}
else
k = 0;
}
return 0;
} | 43 |
21,332 | int main()
{
int i,j,k=2,t,su=1,put,temp,a[20000];
a[0]=2;a[1]=3;
for(i=4;i<10000;i++)
{
su=1;
for(j=2;j*j<=i;j++)
{
if(i%j==0)su=0;
}
if(su==1){a[k]=i;k++;}
}
scanf("%d",&put);
for(i=1;i<2000;i++)
{
temp=put-a[i];
for(t=i;t<2000;t++)
{
if(a[t]==temp)
{
printf("%d %d\n",a[i],a[t]);
}
if(a[t]>temp)break;
}
}
return 0;
}
| 43 |
21,333 | int main()
{
int find(int n);
int m,k;
cin>>m;
for(k=3;k<=(m/2);k=k+2)
{
if(k==find(k)&&(m-k)==find(m-k))
cout<<k<<" "<<m-k<<endl;
}
return 0;
}
int find(int n)
{
int i,c=0;
for(i=1;i<=n;i++)
{
if(n%i==0) c=c+1;
}
if(c==2) return (n);
else return 0;
}
| 43 |
21,334 | int main()
{
int n,i,j,k,f,g,d;
scanf("%d",&n);
for(i=2;i<=(n/2);i++)
{
f=0;d=0;
j=n-i;
for(k=2;k<i;k++)
{if(i%k==0) {f=0;break;}
else f=1;}
for(g=2;g<j;g++)
{if(j%g==0) {d=0;break;}
else d=1;}
if(d==1&&f==1) printf("%d %d\n",i,j);
}
return 0;
}
| 43 |
21,335 | int p(int n)
{
int j,b;
if(n<2)return 0;
b=(int)sqrt(n);
if(n==2) return 1;
for(j=2;j<=b;j++)
if(n%j==0) return 0;
return 1;
}
int main()
{
int m,j;
scanf("%d",&m);
for(j=2;j<=m/2;j+=1)
if(p(j)&&p(m-j))printf("%d %d\n\n",j,m-j);
return 0;
}
| 43 |
21,336 |
int main(int argc, char* argv[])
{
int m,i,j,p,q;
scanf("%d",&m);
for(j=3;j<=m/2;j++){
p=0;
for(i=2;i<j;i++){if(j%i!=0)p=p+1;}
if(p==j-2){q=0;
for(i=2;i<m-j;i++){if((m-j)%i!=0)q=q+1;}
if(q==m-j-2)
printf("%d %d\n",j,m-j);}}
return 0;
}
| 43 |
21,337 |
int main(void)
{
int n;
scanf("%d",&n);
for(int i = 3;i < n;i++)
{
for(int k = 2;k < i;k++)
{
if(i % k == 0) goto There;
}
for(int k = 2;k < n-i;k++)
{
if((n-i)%k == 0) goto There;
}
if(i <= n-i) printf("%d %d\n",i,n-i);
There:;
}
return 0;
}
| 43 |
21,338 | int main()
{
int m,i,j,k,a,b;
cin>>m;
for(i=3;i<=m/2;i+=2){
a=1;b=1;
for(j=2;j<i/2;j++){
if(i%j==0)
a=0;}
for(k=2;k<(m-i)/2;k++){
if((m-i)%k==0)
b=0;}
if(a*b!=0)
cout<<i<<' '<<m-i<<endl;}
return 0;
} | 43 |
21,339 | int prime(int n)
{
int i,product=1;
for(i=2;i*i<=n;i++)
{
if(n%i==0)
product=0;
}
return(product);
}
int main()
{
int N,j,check;
cin>>N;
for(j=3;j<=N/2;j++)
{
check=prime(j)*prime(N-j);
if (check>0)
{
cout<<j<<' '<<N-j<<endl;
}
}
return 0;
} | 43 |
21,340 | main()
{
int m;
scanf("%d",&m);
if (m==6)
printf("3 3");
else if (m==8)
printf("3 5");
else
{
int a=3;
for (;a<=m/2;a=a+2)
{
if (sushu(a)==1&&sushu(m-a)==1)
printf("%d %d\n",a,m-a);
}
}
}
int sushu(int num)
{
int b=2;
for(;b<sqrt(num)+1;b++)
{
if (num%b==0)
break;
}
if(b>=sqrt(num)+1)
return 1;
else return 0;
}
| 43 |
21,341 | main()
{ int a,b,d=3,e,h,y,i,x,z;
float c,f,g;
scanf("%d\n",&a);
b=a/2;
while(d<=b)
{ e=a-d;
f=sqrt(d);
g=sqrt(e);
h=2;
i=2;
y=1;
z=1;
while(h<=f)
{ if(d%h==0)
{ y=0;break;}
else h++;
}
while(i<=g)
{ if(e%i==0)
{z=0;break;}
else i++;
}
if(y==1&&z==1)
printf("%d %d\n",d,e);
d=d+2;
}
} | 43 |
21,342 | int sushu[168]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997};
int main()
{
int i,j,m;
cin>>m;
for(i=0;i<168;++i)
for(j=i;j<168;++j)
{
if(m==sushu[i]+sushu[j]) cout<<sushu[i]<<" "<<sushu[j]<<endl;
}
return 0;
}
| 43 |
21,343 | void main()
{
int m,a=3,b,i,j,z1,z2;
scanf("%d",&m);
while (a<=(m/2))
{
z1=1;
for (i=2;i<=(int)(sqrt(a));i++)
{
if (a%i==0) z1*=0;
else z1*=1;
}
if (z1==1)
{
b=m-a;
z2=1;
for (j=2;j<=(int)(sqrt(b));j++)
{
if (b%j==0) z2*=0;
else z2*=1;
}
if (z2==1)
if (a+b==m) printf("%d %d\n",a,b);
}
a=a+2;
}
}
| 43 |
21,344 | int main()
{
int m, i ;
cin >> m ;
for (i = 3 ; i < ((m / 2) + 1) ; i += 2)
{
for (int j = 3 ; j <= m - i ; j += 2)
{
if ((i % j == 0)||((m - i) % j == 0))
{
if (j != i)
break ;
}
if (j >= (m - i - 2))
{
cout << i << " " << m - i << endl ;
break ;
}
}
}
return 0 ;
} | 43 |
21,345 | void main()
{
int m,q,r,i,j,a,b;
scanf("%d",&m);
for (q=3;q<=m/2;q++)
{r=m-q;
a=0;
b=0;
for (i=2;i<=sqrt(q);i++)
if(q%i==0) a=1;
for (j=2;j<=sqrt(r);j++)
if(r%j==0) b=1;
if(a==0&&b==0) printf("%d %d\n",q,r);
}
} | 43 |
21,346 | //********************************************
//*????????? *
//*?????? *
//*???1300012888 *
//*???2013.10.23 *
//********************************************
int main()
{
int m, a, b, i, j;
cin >> m;
for(a = 3;a <= m / 2;a = a + 2) //?3????2??
{ //??m?????
for(i = 2;i <= sqrt(a);)
{
if(a % i != 0)
i ++;
else
break;
}
if(i > sqrt(a)) //??a???
{
b = m - a;
for(j = 2;j <= sqrt(b);)
{
if(b % j != 0)
j ++;
else
break;
}
if(j > sqrt(b)) //??b???
cout << a << " " << b << endl;
}
}
return 0;
} | 43 |
21,347 | int main()
{
int f(int n);
int m,a=3,b;
scanf("%d",&m);
while(a<=(m/2))
{
if(f(a)==1)
{
b=m-a;
if(f(b)==1)
{
printf("%d %d\n",a,b);
}
}
a=a+2;
}
}
int f(int n)
{
int j;
j=2;
for(j=2;n%j!=0;j++);
return (j>n/2?1:0);
}
| 43 |
21,348 | int main()
{
int n,i,j,p;
scanf("%d",&n);
char a[10001]={0};
i=2;
while(i<n)
{
for(j=i+1;j<n;j=j+1)
if (j%i==0) a[j]=1;
i++;
for(;i<n;i=i+1)
if (a[i]==0) break;
}
p=0;
for(i=3;i<=(n/2);i=i+1)
if ((a[i]==0)&&(a[n-i]==0))
{
if (p) printf("\n");
p=p+1;
printf("%d %d",i,n-i);
}
return 0;
}
| 43 |
21,349 | int main()
{
int m,a,b,i;
scanf("%d",&m);
for(a=3;a<=m/2;a+=2)
{
for(i=3;i<=a;i+=2)
if(a%i==0)break;
if(i<a)continue;
else
{
b=m-a;
for(i=3;i<=b;i+=2)
if(b%i==0)break;
if(i==b)
printf("%d %d\n",a,b);
}
}
return 0;
} | 43 |
21,350 | int main()
{
int m, primeA, primeB;
int i, k;
cin >> m;
for (primeA = 3; primeA <= m - 1; primeA +=2)
{
primeB = m - primeA;
for (i = 2; i <= (int)sqrt(m); i++)
{
if (primeA % i == 0 && primeA != i)
{
break;
}
}
for (k = 2; k <= (int)sqrt(m); k++)
{
if (primeB % k == 0)
{
break;
}
}
if ((i == (int)sqrt(m) + 1) && (k == (int)sqrt(m) + 1) && (primeA <= primeB))
cout << primeA << " " << primeB << endl;
}
return 0;
} | 43 |
21,351 | int main()
{
int n;
cin>>n;
int a,b;
int i,j,l=0,k=0;
for(i=3;i<=n/2;i=i+2)
{
for(j=2;j*j<=i;j++)
{
if(i%j==0)
{l=1;
break;
}
}
if(l==0)
{
a=i;
b=n-a;
}
else
{l=0;
continue;
}
for(j=2;j*j<=b;j++)
{
if(b%j==0)
{k=1;
break;
}
else
k=0;
}
if(k==0)
{
cout<<a<<" "<<b<<endl;
a=0;b=0;k=0;l=0;
}
else
{continue;
}
}
return 0;
}
| 43 |
21,352 |
int judge(float x)
{
int i,m,x1;
if(x==3||x==5||x==7)
return(1);
else
{
m=(int)sqrt(x);
x1=(int)x;
for(i=3;i<=(m/2*2+1);i=i+2)
{
if(x1%i==0)
return(0);
}
return 1;
}
}
int main()
{
int num;
float p;
cin>>num;
for(p=3;p<=num/2;p=p+2)
{
if(judge(p)&&judge(num-p))
cout<<p<<' '<<num-p<<endl;
}
return 0;
}
| 43 |
21,353 | int main()
{
int i,j,k;
int n;
int a[10000]={0};
for(i=0;i<10000;i++)
if(i%2)
a[i]=i;
for(i=3;i<100;i=i+2)
for(j=i+2;j<10000;j++)
if(a[j])a[j]=j%i;
for(i=0;i<10000;i++)
if(a[i])
a[i]=i;
scanf("%d",&n);
for(i=3;i<n/2+1;i++)
if(a[i]&&(a[n-a[i]]))
printf("%d %d\n",a[i],n-a[i]);
}
| 43 |
21,354 | int f(int a)
{
int i=2,m;
m=sqrt(a);
for(i=2;i<=m;i++)
{
if(a%i==0)break;
}
if(i>=m+1)return a;
else return 0;
}
int main()
{
int m;
scanf("%d",&m);
int i,p,q;
for(i=3;i<=m/2;i=i+2)
{
p=f(i);q=f(m-i);
if(p!=0&&q!=0)printf("%d %d\n",p,q);
}
}
| 43 |
21,355 | int f (int x)
{
int y=2,z=0;
while(y<=sqrt(x))
{
z=z+!(x-(x/y)*y);
y=y+1;
}
return(z);
}
int main()
{
int a,b,n;
a=2;
scanf("%d",&n);
while(a<=(n/2))
{
b=n-a;
if((f (a)*f (a)+f (b)*f (b))==0)
printf("%d %d\n",a,b);
a++;
}
} | 43 |
21,356 | int main()
{
int n,i,j,a,flag1 = 0, flag2=0;
scanf("%d",&n);
for(i=3;i<=n/2;i++)
{flag1 = 0;
flag2=0;
a=i;
for(j=2;j<=i/2;j++)
{
if(i%j==0)
flag1=1;
}
if(flag1 ==0)
{
i=n-i;
for(j=2;j<=i/2;j++)
{
if(i%j==0)
flag2=1;
}
if(flag1==0 && flag2==0)
printf("%d %d\n",n-i,i);
}
i=a;
}
return 0;
}
| 43 |
21,357 | int main()
{
int i,j,k,m,n,l;
scanf("%d",&n);
for (i=3;i<=n/2;i++)
{
k=n-i;
l=1;
for (j=2;j<=sqrt(i);j++)
if (i%j==0)
{
l=0;
break;
}
if (l==1)
{
l=1;
for (j=2;j<=sqrt(k);j++)
if (k%j==0)
{
l=0;
break;
}
if (l==1)
printf("%d %d\n",i,k);
}
}
return 0;
}
| 43 |
21,358 | int main()
{
int su(int x);
int n,i,j;
scanf("%d",&n);
for(i=3;i<=n/2;i+=2)
{
j=n-i;
if(su(i)&&su(j))printf("%d %d\n",i,j);
}
}
int su(int x)
{
int i,z=1;
if(x==2)z=1;
else
{
for(i=2;i<=sqrt(x);i++)
{
if(x%i==0)
{
z=0;
break;
}
}
}
return z;
} | 43 |
21,359 | int main()
{
int i,m,j,sum;
cin >> m;
for(i=3;i<=m/2;i++)
{
sum=1;
for(j=2;j<=(int)sqrt(i);j++)
{
if(i%j==0)
{
sum=sum*0;
}
}
if(sum==1)
{
for(j=2;j<=(int)sqrt(m-i);j++)
{
if((m-i)%j==0)
{
sum=sum*0;
}
}
}
if(sum==1)
cout << i << " " << m-i << endl;
}
return 0;
} | 43 |
21,360 | int main()
{
int x,s=0,i,m,n,j,g,k,t=0;
scanf("%d",&x);
for(i=2;i<=x-1;i++)
{
s=0;
for(j=2;j<=i-1;j++)
{
if(i%j==0) s=1;
}
if(s==0)
{
t=0;
g=x-j;
if(g>=j)
{
for(k=2;k<=g-1;k++)
{
if(g%k==0) t=1;
}
if(t==0) printf("%d %d\n",i,g);
}
}
}
return 0;
}
| 43 |
21,361 | int main()
{
int m,n,i,j,b,a[5000];
scanf("%d",&m);
n=b=0;
for(j=3;j<m;j++)
{
for(i=2;i<=j/2;i++)
{
if(j%i==0)
{
n=1;
break;
}
}
if(n==0)
{
a[b]=j;
b+=1;
}
else
{
n=0;
}
}
for(i=0;i<=b;i++)
{
for(j=i;j<=b;j++)
{
if(m==a[i]+a[j])
{
printf("%d %d\n",a[i],a[j]);
}
}
}
return 0;
} | 43 |
21,362 | //*************************
//* ?????????
//* ?????
//* ???1200012941
//* ???2012?10?22?
//*************************
int main()
{
int i, j, x, n;
cin >> n;
for (x = 3; x <= n / 2; x = x + 2)
{
for (i = 2; i <=(int)sqrt(x) + 1; i++)
{
if (x % i == 0)
break;
if (i == (int)sqrt(x) + 1)
{
for (j = 2; j <=(int)sqrt(n-x) + 1; j++)
{
if ((n-x) % j == 0)
break;
if (j == (int)sqrt(n-x) + 1)
cout << x << " " << n - x << endl;
}
}
}
}
return 0;
}
| 43 |
21,363 | int main()
{
int n,i,j,m=0,good,count=0;
int b[100];
scanf("%d",&n);
for(i=3;i<n;i++)
{
good=0;
for(j=2;j<i;j++)
{
if(i%j==0)
{
good=1;
}
}
if(good==0)
{
b[m]=i;
m++;
count++;
}
}
for(i=0;i<count;i++)
{
for(j=0;j<count;j++)
{
if(b[i]+b[j]==n&&b[i]<=b[j])
{
printf("%d %d\n",b[i],b[j]);
}
}
}
return 0;
}
| 43 |
21,364 | int main()
{
int m,i,j,k,t,f1,f2;
double s[25]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
double a,b;
cin>>m;
a=3;
b=0;
while (a<=(m/2))
{
b=m-a;
i=0;
t=0;
k=0;
j=0;
while(i<25&&s[i]<a)
{
f1=fmod(a,s[i]);
if (f1!=0)
{
i=i+1;
t=t+1;
}
else i=i+26;
}
while(j<25&&s[j]<b)
{
f2=fmod(b,s[j]);
if (f2!=0)
{
j=j+1;
k=k+1;
}
else j=j+26;
}
if (k==j&&i==t) cout<<a<<" "<<b<<endl;
a=a+2;
}
return 0;
} | 43 |
21,365 | 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)
{
b=n-a;
l=0;
for(k=2;k<b;k++)
{
if(b%k==0)
{
l++;
}
else ;
}
if(l==0)
cout << a << " " << b << endl;
continue;
}}
return 0;
}
| 43 |
21,366 | int main()
{
int m, a, b;
cin >> m;
for (a = 3; a <= m / 2; a = a + 2)
{
int i;
for (i = 3; i <= a; i = i + 2)
if (a % i == 0)
break;
if (i == a)
b = m - a;
else
continue;
int k;
for (k = 3; k <= b; k = k + 2)
if (b % k == 0)
break;
if (k == b)
cout << a << " " << b << endl;
}
return 0;
}
| 43 |
21,367 | int main()
{
int n,i,j,k;
scanf("%d",&n);
for(i=3;i<=n/2;i++)
{
for(j=2;j<i;j++)
if(i%j==0) break;
for(k=2;k<n-i;k++)
if((n-i)%k==0) break;
if(j==i && k==n-i)
printf("%d %d\n",i,n-i);
}
getchar();
getchar();
} | 43 |
21,368 | int main ()
{
int i=3;
int j=3; //i+j=???m
int l1=2;
int l2=2;
int m,n,k; //n???????????????,k?????????????
char a='y'; //????????????????????????????
cin>>m;
n=m/2;
for (i=3;i<=n;i++)
{
a='y';
j=m-i;
k=sqrt(i);
for (l1=2;l1<=k;l1++)
{
if (i%l1==0)
a='n';
} //?????i?????
k=sqrt(j);
for (l2=2;l2<=k;l2++)
{
if (j%l2==0)
a='n';
} //?????j?????
if (a=='y')
cout<<i<<' '<<j<<endl;
}
return 0;
}
| 43 |
21,369 | int main ()
{
int m;
int tmp=0;
cin>>m;
for(int i = 3 ; i <= m/2 ; i++)
{
int count1=0;
int count2=0;
for(int k = 2 ; k < i ; k++)
{
if(i%k!=0)count1++;
}
if(count1<i-2)continue;
for(int j = 2 ; j < m-i ; j++)
{
if((m-i)%j!=0)count2++;
}
if(count2==m-i-2)
{
tmp++;
if(tmp==1)cout<<i<<" "<<m-i;
else cout<<'\n'<<i<<" "<<m-i;
}
}
return 0;
}
| 43 |
21,370 | int main()
{
int m, primeA, primeB;
int i, k;
cin >> m;
if (m >= 6 && m <=10000 && m % 2 == 0)
{//if
for (primeA = 3; primeA <= m - 1; primeA +=2)
{
primeB = m - primeA;
if (primeA <= primeB)
{
for (i = 3; i <= (int)sqrt(m); i++)
{
if (primeA % i == 0 && primeA != i)
{
break;
}
}
if (i == (int)sqrt(m) + 1)
{
for (k = 3; k <= (int)sqrt(m); k++)
{
if (primeB % k == 0 && primeB != k)
{
break;
}
}
if (k == (int)sqrt(m) + 1)
cout << primeA << " " << primeB << endl;
}
}
}
}//if
return 0;
} | 43 |
21,371 |
int sushu(int x)
{
int i,j;
if(x==3)
return 1;
for(i=2;i<=sqrt(x);i++)
{
if(x%i==0)
{
return 0;
}
}
return 1;
}
int main()
{
int m,i,j;
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2)
{
if(sushu(i))
{
j=m-i;
if(sushu(j))
{
printf("%d %d\n",i,j);
}
}
}
return 0;
}
| 43 |
21,372 | void main()
{
int m,i,d,x,e;
d=0;
e=0;
scanf("%d",&m);
for (i=2;i<=m/2;i++)
{ d=0;
e=0;
if (i%2==0);
else
{
for (x=2;x<i;x++)
if (i%x==0) d=1;
for (x=2;x<m-i;x++)
if ((m-i)%x==0) e=1;
if ((d==0) && (e==0)) printf("%d %d\n",i,m-i);
}
}
} | 43 |
21,373 | int main()
{
int m,i,a,b,c,d,e;
scanf("%d",&m);
a=m/2;
for(i=3;i<=a;i++)
{
for(b=2;b<i;b++)
{
c=i%b;
if(c==0)
{b=i;}
}
if(c==0)
{continue;}
else
{
d=m-i;
for(b=2;b<d;b++)
{
c=d%b;
if(c==0)
{b=d;}
}
}
if(c!=0)
{printf("%d %d\n",i,d);}
}
return 0;
}
| 43 |
21,374 | //********************************
//*????????? **
//*?????? 1200012808 **
//*???2012.10.10 **
//********************************
// ?????????????????????int f(int x)
int f(int x)
{
int j;
for (j = 2; j <= sqrt((double)x); j++)
{
if (x % j == 0)
return false;
}
return true;
}
int main()
{
int m, x, y;
cin >> m;
for ( x = 3; x <= m / 2 ; x += 2) // ?????m??????
{
y = m - x;
if ((f(x) == true) && (f(y) == true)) // ??x?m-x?????
cout << x << " " << y << endl; // ?????
}
return 0;
}
| 43 |
21,375 | int main()
{
int m,a,b,f,j;
scanf("%d",&m);
for(a=3;a<=m/2;a=a+2)
{
f=1;
for(j=2;j<a;j++)
{
if(a%j==0)
{
f=0;
break;
}
}
if(f==0)
continue;
b=m-a;
f=1;
for(j=2;j<b;j++)
{
if(b%j==0)
{
f=0;
break;
}
}
if(f)
printf("%d %d\n",a,b);
}
return 0;
}
| 43 |
21,376 | //********************************
//*????????? **
//*??? ??? 1300012745 **
//*???2013.10.25 **
//********************************
int main()
{
int m, a, b, i, n=0;
cin>>m;
for (a=3;a <= m / 2;a+=2)
{
for (i=3;i <= sqrt(a);i++)
{
if (a % i==0)
n++;
}
if (n==0)
{
b=m - a;
for (i=3;i <= sqrt(b);i++)
{
if (b % i==0)
n++;
}
if (n==0)
cout << a << " " << b <<endl;
}
n=0; //?n????????????
}
return 0;
}
| 43 |
21,377 | int main()
{
int m,i,o,k,l;
cin>>m;
for(i=2;i<=(m/2);i++)
{
o=m-i;
for(k=2;k<i;k++)
{
if (i%k==0) goto end;
}
for(l=2;l<o;l++)
{
if (o%l==0) goto end;
}
cout<<i<<" "<<o<<endl;
end: continue;
}
return 0;
}
| 43 |
21,378 | void main()
{
int a[20001],i,n,haha,j;
for(i=1;i<=10000;i++) a[i]=1;
a[0]=0;
a[1]=0;
i=2;
do
{
j=2;
if(a[i]==1)
do
{
n=i*j;
a[n]=0;
j++;
}while(n<=10000);
i++;
}while(i<=10000);
a[2]=0;
scanf("%d",&haha);
i=3;
do
{
j=haha-i;
if((a[i]==1)&&(a[j]==1)) printf("%d %d\n",i,j);
i++;
}while(i<=(haha/2));
return 0;
} | 43 |
21,379 | main()
{
int m,i,j;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
for(j=2;j<=i;j++)
{
if(i%j==0) break;
}
if(j==i)
{
for(j=2;j<=m-i;j++)
{
if((m-i)%j==0) break;
}
if(j==m-i) printf("%d %d\n",i,m-i);
}
}
}
| 43 |
21,380 |
int main()
{
int m, x, y;
int a, b = 0;
int k, l;
cin >> m;
for (int i = 3; i <= m/2 ; i = i + 2)
{
a = 0;
for (k = 2; k*k <= i; k++)
{
if ( i % k == 0)
a = 1;
}
for (l = 2; l*l <= (m - i); l++)
{
if (( m - i) % l == 0)
a = 1;
}
if (a == 0)
cout << i << " " << m - i << endl;
else
continue;
}
return 0;
} | 43 |
21,381 | /*
* 16.cpp
*??????
* Created on: 2012-10-18
* Author: ???
*/
int main()
{
int m;
cin>>m;
for(int i1=3;i1<=m/2;i1=i1+2)
{
int t=1,p=1;
for(int k1=2;k1<=sqrt(i1);k1++)
{
int q1=i1%k1;
t=t*(q1!=0);
}//????????????
if(t==1)
{
int i2=m-i1;
for(int k2=2;k2<=sqrt(i2);k2++)
{
int q2=i2%k2;
p=p*(q2!=0);
}//??????????
if(p==1)
cout<<i1<<" "<<i2<<endl;
}
}
}
| 43 |
21,382 | int main()
{
int m, n, c;
cin >> m;
for (int i = 3; i <= m / 2; i++)
{
c = 1;
for (int j = 2; j <= i; j++)
{
if (i % j == 0 && j != i)
{
c = 0;
break;
}
if (j == i)
break;
}
if (c)
{
n = m - i;
for (int k = 2; k <= n; k++)
{
if (n % k == 0 && n != k)
break;
if (n == k)
{
cout << i << " " << n << "\n";
}
}
}
}
return 0;
} | 43 |
21,383 | main()
{
int a(int x);//?????????
int m,i,k;
scanf("%d",&m);
for(i=2;i<m/2+1;i++)
{
if(a(i)==1&&a(m-i)==1)
printf("%d %d\n",i,m-i);
}
getchar();
getchar();
}
int a(int b)
{
int i,c=1;
for(i=2;i<b;i++)
{
if(b%i==0)
{
c=0;
break;
}
}
return(c);
} | 43 |
21,384 | int isprime(int n)
{
int i;
for(i=2;i*i<=n;i++)
if(n%i==0)
return 0;
return 1;
}
int main(int argc, char* argv[])
{
int m,j;
scanf("%d",&m);
for(j=3;j*2<=m;j+=2)
if(isprime(j)&&isprime(m-j))
printf("%d %d\n",j,(m-j));
return 0;
} | 43 |
21,385 | int main()
{
int n,i,j,w;
scanf("%d\n",&n);
w=0;
int a[32767]={0};
for(i=3;i<=n-1;i=i+2)
{
for(j=2;j<i;j++)
{
if(i%j==0)
w++;
}
if(w==0)
{
a[i]=i;
}
w=0;
}
for(i=3;i<=n-1;i=i+2)
{
for(j=i;j<=n-1;j=j+2)
{
if(a[i]+a[j]==n)
printf("%d %d\n",a[i],a[j]);
}
}
return 0;
} | 43 |
21,386 | int main()
{
int n,i,m,p,j;
scanf("%d",&n);
for(i=3;i<=n/2;i+=2)
{
for(j=3;(double)j<=sqrt((double)i);j+=2)
{
if(i%j==0)
break;
}
if((double)j>sqrt((double)i))
{
m=n-i;
for(p=3;(double)p<sqrt((double)m);p+=2)
{
if(m%p==0)
break;
}
if((double)p>sqrt((double)m))
printf("%d %d\n",i,m);
}
}
return 0;
} | 43 |
21,387 | int main()
{
int i,number,half,s1=0,s2=0,sum1=0,sum2=0,j,m,k1,k2;//??half???????s1,s2??????????????????????????????
cin>>number;
half=number/2;
for(s1=3;s1<=half;s1++)
{
sum1=0;
sum2=0;
s2=number-s1;//?????????
for(j=2;j<s1;j++)//??s1?????
{
k1=s1%j;
{if(k1==0)
sum1=sum1+1;}
}
for(m=2;m<s2;m++)//??s2?????
{
k2=s2%m;
{if(k2==0)
sum2=sum2+1;}
}
if(sum1==0&&sum2==0)
cout<<s1<<" "<<s2<<endl;//?????????
}
return 0;
}
| 43 |
21,388 | int main(){
int n,i,j;
int k;
cin>>n;
for(i=3;i<=n/2;i+=2){
//cout<<i<<" "<<j<<endl;
j = n-i;
int flag;
for(k=2;k<i;k++)
{
if(i%k!=0)
flag=0;
if(i%k==0){
flag=1;
break;
}
}
if(flag == 1)continue;
for(k=2;k<j;k++)
{
if(j%k!=0)
flag=0;
if(j%k==0){
flag=1;
break;
}
}
if(flag == 0)
cout<<i<<" "<<j<<endl;
}
return 0;
}
| 43 |
21,389 | //**********************************************
//?????????
//?????? 1300012917
//???2013.10.24
//**********************************************
int main()
{
int a[10001] = {0}, p, m, i, j, sm;//??a?????????a[??]=0?a[??]=1
cin >> m;
sm = sqrt(m);
//?2?m?????????????
for (i = 2; i <= sm; i++)
if (a[i] == 0)
for (j = 2; i * j < m; j++)
a[i * j] = 1;
//?3?m/2??m????????????????????
for (i = 3; i <= m / 2; i++)
if ((a[i] == 0) && (a[m-i] == 0))
cout << i << ' ' << m - i << endl;
return(0);
} | 43 |
21,390 | int su(int);
int main()
{
int m,i;
scanf("%d",&m);
for(i=3;i<=m/2;i+=2)
{
if(su(i)&&su(m-i))
printf("%d %d\n",i,m-i);
}
return 0;
}
int su(int a)
{
int j;
for (j=2;j<=a/2;j++)
{
if(a%j==0)
{ return 0;
break;}
if(j==a/2)
return 1;
}
}
| 43 |
21,391 | int main()
{
int m,i,j,n;
scanf("%d",&m);
int a[10001];
n=m/2;
for (i=2;i<=m;i++)
a[i]=0;
for(i=2;i<=n;i++)
{
for(j=i+i;j<=m;j=j+i)
a[j]=1;
}
for (i=2;i<=n;i++)
{
if ((a[i]==0)&&(a[m-i]==0))
printf("%d %d\n",i,m-i);
}
return 0;
}
| 43 |
21,392 | int main()
{
int m;
cin>>m;
int i,j,k,a=0,b=0,c,d;
for (i=3;i<=m-1;i=i+2)
{
for(j=m-i-1;j>=2;j--)
{
c=(m-i)%j;
if(c==0)
b=b+1;
if(c!=0)
b=b+0;
}
for(k=2;k<i;k++)
{
d=i%k;
if(d==0)
a=a+1;
if(d!=0)
a=a+0;
}
if(a==0&&b==0&&i<=(m-i))
cout<<i<<" "<<m-i<<endl;
a=0;
b=0;
}
return 0;
} | 43 |
21,393 |
int is_prime(int n)
{
int k,limit;
if(n == 2)
return 1;
if(n % 2 == 0)
return 0;
limit = n/2;
for(k=3; k <= limit; k+=2)
if(n % k == 0)
return 0;
return 1;
}
int main ()
{
int number,a,b,i;
cin >>number;
for (a=3;a<=number/2;a++)
{
b=number-a;
if (is_prime(a)==1&&is_prime(b)==1) cout <<a<<" "<<b<<endl;
}
return 0;
} | 43 |
21,394 | int main()
{
int m,a,i,b,h=1,g=1;
scanf("%d",&m);
for(a=3;a<=(m/2);a+=2)
{
for(i=2;i<a;i++)
{
if(a%i==0)
{
h=0;
}
}
for(b=2;b<(m-a);b++)
{
if((m-a)%b==0)
{
g=0;
}
}
if(h==1&&g==1)
{
printf("%d %d\n",a,m-a);
}
h=1;
g=1;
}
return 0;
}
| 43 |
21,395 | int shisushu(int n);
int main(){
int m,n;
scanf("%d",&m);
for(n=2;n<=m/2;n++){
if(shisushu(n)==1){
if(shisushu(m-n)==1){
printf("%d %d\n",n,m-n);
}
}
}
return 0;
}
int shisushu(int n){
int i;
int result=1;
for(i=2;i<=n/2;i++){
if(n%i==0){
result=0;
break;
}
}
return result;
} | 43 |
21,396 | int a[A]={0};
int main()
{
int n,i,s,j;
scanf("%d",&n);
for(i=2;i<A;i++)
{
if(a[i]==0)
{
for(j=i<<1;j<A;j+=i)
{
a[j]=1;
}
}
}
for(i=3;i<=n/2;i+=2)
{
if(a[i]==0)
{
if(a[n-i]==0) printf("%d %d\n",i,n-i);
}
}
return 0;
}
| 43 |
21,397 | /*
* 12.10.11a.cpp
* Created on: 2012-10-11
* Author: ???
* ???????????
*/
int p(int x)
{int i=2;
while(true)
{
if(i==(x-1)) {return(1);break;}
else if (x%i==0){return(2);break;}
i=i+1;
}
}
int main()
{
int n,m,a,k=3;
cin>>n;
m=n;
while(n--)
{a=m-k;if(k>(m/2))break;
if(p(k)==1&&p(a)==1)cout<<k<<' '<<a<<endl;
k=k+2;
}
return 0;
} | 43 |
21,398 | main()
{
int m,i,j,p1=0,p2=0;
scanf("%d",&m);
if(m>5&&m%2==0&&m<10001)
for(i=3;i<=m/2;i=i+2)
{
for(j=3;j<i;j=j+2)
{
if(i%j==0||(m-i)%j==0)
{
p1=1;
break;
}
}
for(j=i;j<m-i;j=j+2)
{
if((m-i)%j==0)
{
p2=1;
break;
}
}
if(p1==0&&p2==0) printf("%d %d\n",i,m-i);
p1=0;
p2=0;
}
return(0);
} | 43 |
21,399 | int main()
{
int a=2,b,m,s;
scanf("%d",&m);
s=m/2;
while(a<=s)
{
b=m-a;
int i=2,x,z,y=1,j=2,k,l,h=1;
while(i<a)
{
x=a-a/i*i;
if(x==0)
z=0;
else
z=1;
y=y*z;
i++;
}
while(j<b)
{
k=b-(b/j)*j;
if(k==0)
l=0;
else
l=1;
h=h*l;
j++;
}
if(y==1)
if(h==1)
printf("%d %d\n",a,b);
a++;
}
return 0;
}
| 43 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.