id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
21,100 | int main()
{
int m,i,j,a,b,p,q;
scanf("%d",&m);
a=m/2;
for(i=3;i<=a;i++){
b=0;
j=m-i;
if(i==3)
b=0;
else{
for(p=2;p<i;p++){
if(i%p==0)
b=1;
}
}
if(j==3)
b=0;
else{
for(q=2;q<j;q++){
if(j%q==0)
b=1;
}
}
if(b==0)
printf("%d %d\n",i,j);
}
return 0;
}
| 43 |
21,101 | int main()
{
int a[10000],i,k,j,t,x,b,c,d,e=0;
scanf("%d",&x);
for(i=3,j=0;i<10000;i++)
{
for(e=0,k=2;k<i;k++)
{
t=i/k;
if(t*k==i)
{
e=1;
break;
}
}
if(e==0)
{
a[j]=i;
j++;
}
}
for(b=0;b<=10000;b++)
{
c=x-a[b];
if(c<x/2) break;
for(d=0;d<10000;d++)
{
if(c==a[d])
{
printf("%d %d\n",a[b],a[d]);
break;
}
}
}
return 0;
}
| 43 |
21,102 | int main()
{
int i,n,flag1,flag2;
int x(int i);
scanf("%d",&n);
for(i=3;i<=n/2;i++)
{
flag1=0;
flag2=0;
flag1=x(i);
flag2=x(n-i);
if(flag1==1&&flag2==1)
{
printf("%d %d\n",i,n-i);
}
}
return 0;
}
int x(int i)
{
int j;
for(j=2;j<=i;j++)
{
if(i%j==0)
break;
}
if(j==i)
return 1;
else
return 0;
} | 43 |
21,103 |
int main()
{
int n, m, i, j;
double k;
cin >> n;
for(i = 3; i <= n / 2; i = i + 2)
{
int r = 0;
k = sqrt(i);
for(j = 2; j <= k; j++)
if(i % j == 0)
{
r++; break;
}
if(r)
continue;
r = 0;
k = sqrt(n - i);
for(j = 2; j <= k; j++)
if((n - i) % j == 0)
{
r++; break;
}
if(r)
continue;
cout << i << " " << (n- i) << endl;
}
return 0;
}
| 43 |
21,104 | int main()
{
int i, j, m, a, b;
scanf("%d", &m);
for(i=3; i<=m/2; i++)
{
a=0;
b=0;
for(j=2; j<=i-1; j++)
{
if(i%j==0)
{
a=1;
break;
}
}
if(a==0)
{
for(j=2; j<=m-i-1; j++)
{
if((m-i)%j==0)
{
b=1;
break;
}
}
if(b==0)
printf("%d %d\n", i, m-i);
}
}
return 0;
} | 43 |
21,105 |
int main()
{
int flag[SIZE]={0};
int i,j,r,num;
for(i=3;i<32767;i++)
{
if(i%2==1)
{
for(j=2;j<=sqrt(i);j++)
{
r=i%j;
if(r==0)
{
break;
}
}
if(r!=0)
{
flag[i]=1;
}
}
}
scanf("%d",&num);
for(i=3;i<=num/2;i++)
{
if(flag[i]==1&&flag[num-i]==1)
{
printf("%d %d\n",i,num-i);
}
i++;
}
return 0;
} | 43 |
21,106 | int main ()
{
int m,a,i;
int sushu(int m);
int jishu(int m);
scanf("%d",&m);
for(i=1;i<=(m/2);i++)
{
if(sushu(i)&&jishu(i))
{
a=m-i;
if(sushu(a)&&jishu(a))
printf("%d %d\n",i,a);
}
}
return 0;
}
int sushu(int m)
{
int t,c,k;
k=sqrt(m);
for(t=2;t<=k;t++)
if(m%t==0)break;
if(t>k) c=1;
else c=0;
if(m<3)
c=0;
return(c);
}
int jishu(int m)
{
int d;
if(m%2==0)
d=0;
else
d=1;
return(d);
}
| 43 |
21,107 | //*******************************
//* Name:Goldbach
//* Author:Sun Zeyu
//* Editting time:2013.10.17
//* Function:Goldbach
//*******************************
int main()
{
int m,x,a[2000]={0},i,k=0,j;
cin>>m;
for(x=3;x<m;x++)
{
for(i=2;i<=x/2;i++)
if(x%i==0)
break;
if(i>x/2)
{
a[k]=x;
k++;
}
}
for(i=0;i<k-1;i++)
for(j=i;j<k;j++)
if(a[i]+a[j]==m)
cout<<a[i]<<' '<<a[j]<<endl;
return 0;
}
| 43 |
21,108 | /********************************************
*@file 4.cpp *
*@author ?? *
*@date 2013-10-28 *
*@description *
*??????5??????? *
********************************************
*/
int main()
{
int n, x, y, i, j, count = 0;
cin >> n;
for (x = 3; x <= n / 2; x++)
{
for (i = 2; i <= x / 2; i++)
{
if (x % i == 0)
break;
count++;
}
if (count == x / 2 - 1)
{
y = n - x;
count = 0;
for (j = 2; j <= y / 2; j++)
{
if (y % j == 0)
break;
count ++;
}
if (count == y / 2 - 1)
{
cout << x << " " << y << endl;
count = 0;
}
else
count = 0;
}
else
count = 0;
}
return 0;
} | 43 |
21,109 | int sushu(int);
int main()
{
int m;
cin>>m;
for(int i=2;i<=m/2;i++)
{
if(sushu(i)&&sushu(m-i))
cout<<i<<" "<<m-i<<endl;
}
return 0;
}
int sushu(int n)
{
int j;
for( j=2;j<=sqrt(n);j++)
{
if(n%j==0)
{
return 0;
break;
}
}
if(j==(int)sqrt(n)+1)
return 1;
}
| 43 |
21,110 | void gbc(int n);
int ispn(int p);
int main()
{
int n;
scanf("%d",&n);
gbc(n);
return 0;
}
void gbc(int n)
{
int half=n/2;
int i;
int a,b;
for(i=3;i<=half;i=i+2)
{
a=ispn(i);
b=ispn(n-i);
if(a&&b)
{
printf("%d %d\n",i,n-i);
}
}
}
int ispn(int p)
{
int i,half,isprime;
isprime=1;
if(p%2==0)
{
if(p==2)
{
return isprime;
}else
{
isprime=0;
return isprime;
}
}
half=p/2;
for(i=3;i<=half;i=i+2)
{
if(p%i==0)
{
isprime=0;
break;
}
}
return isprime;
}
| 43 |
21,111 | int sushu(int n)
{
int flag=0,i;
for(i=2;i<n;i++)
{
if (n%i==0)
{
flag=1;
break;
}
}
if(flag) return 0;
else return 1;
}
void main()
{
int n,m,p,i;
scanf("%d",&n);
m=n/2;
for(i=2;i<=m;i++)
{
p=n-i;
if (sushu(i)==1&&sushu(p)==1)
{
printf("%d %d\n",i,p);
}
}
} | 43 |
21,112 | int main()
{int n,m,i,q,p,j;
scanf("%d",&n);
for (m=2;m<=n/2;m++)
{
for (i=2;i<=m-1;i++)
{ q=i;
if (m%i==0)
break;
}
if (q==m-1)
{
for (j=2;j<=n-m-1;j++)
{ p=j;
if ((n-m)%j==0)
break;
}
if (p==n-m-1)
printf("%d %d\n",m,n-m);
}
}
} | 43 |
21,113 |
int main()
{
int m;
int i,j,t,k,r;
int n;
int flag=1;
int a[10000];
scanf("%d",&m);
t=1;
for (i=3;i<=m;i=i+2)
{
flag=1;
for (j=3;j<=(int)floor(sqrt((double)i));j++)
{
if (i%j==0)
{
flag=0;
break;
}
}
if (flag==1)
{
a[t]=i;
t++;
}
}
n=t-1;
for (k=1;k<=n;k++)
{
for(r=k;r<=n;r++)
{
if (a[k]+a[r]==m)
{
printf("%d %d\n",a[k],a[r]);
}
}
}
return 0;
} | 43 |
21,114 | //********************************
//*???4.cpp **
//*????????? **
//*?????? 1300012838 **
//*???2013.10.23 **
//********************************
int main()
{
int m, judge, k;
cin >> m;
for (int i = 3; i <= m / 2; i++)
{
judge = 1;
for (int j = 2; j <= sqrt((double)i); j++)
{
if (i % j == 0)
{
judge = 0;
break;
}
}
if (judge == 1)
{
k = m - i;
judge = 1;
for (int j = 2; j <= sqrt((double)k); j++)
{
if (k % j == 0)
{
judge = 0;
break;
}
}
if (judge == 1)
{
cout << i << " " << k << endl;
}
}
}
return 0;
} | 43 |
21,115 | int sushu(int n)
{
int s=1,i;
for(i=3;i<=sqrt(n);i+=2)
{
if(n%i==0)
s=0;
}
return s;
}
void main()
{
int i,j,m;
scanf("%d",&m);
for(i=3;i<=m/2;i+=2)
{
if (sushu(i)==1 && sushu(m-i)==1)
{
printf("%d %d\n",i,m-i);
}
}
}
| 43 |
21,116 | int prime(int num)
{
int i;
if(num%2==0)
return 0;
else
{
for(i=3;i<num;i+=2)
{
if(num%i==0)
break;
}
if(i==num)
return 1;
else
return 0;
}
}
int main()
{
int num;
int i;
scanf("%d",&num);
for(i=3;i<=num/2;i+=2)
{
if(prime(i)&&prime(num-i))
printf("%d %d\n",i,num-i);
}
return 0;
}
| 43 |
21,117 | //***************************************************
//1.cpp ?????? ******
//?? ??? 1200018209 ********
//?? 2012-10-15 ******
//***************************************************
int main()
{
int temp,n,i,j,a[10000],k=1;
a[0]=2;
cin >> n;
for(i=3;i<=n;i=i+2)
{
temp=sqrt(i);
for(j=2;j<=temp;j++)
{
if(i%j==0)break;
}
if(j==temp+1)
{
a[k]=i;
k++;
}
}
for(i=0;i<k;i++)
{
for(j=k-1;j>=i;j--)
{
if(a[i]+a[j]==n)
{
cout << a[i] << " " << a[j] << endl;
}
}
}
return 0;
}
| 43 |
21,118 |
int main()
{
int m,i,j,n,k;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
n=0,k=0;
for(j=2;j<i;j++)
{ if(i%j==0) break;
n=j;}
if(n==(i-1))
{ for(j=2;j<(m-i);j++)
{if((m-i)%j==0) break;
k=j;}
}
if(k==(m-i-1))
printf("%d %d\n",i,m-i);
}
return 0;
} | 43 |
21,119 | main()
{
int a,n,i,j,b,p,x;
scanf("%d",&a);
for(i=3;i<=a/2;i++)
{ j=1;
for(n=2;n<i;n++)
{
if(i%n==0) j=0;
}
if(j)
{
b=a-i; x=1;
for(p=2;p<b;p++)
{
if(b%p==0) x=0;
}
if(x)
{
printf("%d %d\n",i,b);
}
}
}
return 0;
}
| 43 |
21,120 | int main()
{
int m,a,b,j,i;
scanf("%d",&m);
for(a=3;a<m;a=a+2)
for(b=3;b<m;b=b+2)
{
if(a+b==m&&a<=b)
{
for(i=2;i*i<=a;i++)
if(a%i==0) break;
for(j=2;j*j<=b;j++)
if(b%j==0) break;
if(i*i>a&&j*j>b) printf("%d %d\n",a,b);
}
}
} | 43 |
21,121 | int ss(int x)
{
double m;
int i,f=0;
m=sqrt(x);
if(x%2==0) return 0;
for(i=3;i<=m;i++)
{
if(x%i==0)
{
f=1;
break;
}
}
if(f==1) return 0;
else return 1;
}
int main()
{
int n,l,f,m;
double k;
int i,j,p;
scanf("%d",&p);
l=p/2;
for(i=3;i<=l;i+=2)
if(ss(i)&&ss(p-i))
printf("%d %d\n",i,p-i);
return 0;
}
| 43 |
21,122 | int main()
{
int m,a,b,i;
scanf("%d",&m);
if((m%2)==0)
{
for(a=3;a<=m/2;a+=2)
{
for(i=2;i<a;i++)
{
if(a%i==0)break;}
if(i<a)
continue;
else
{
b=m-a;
for(i=2;i<b;i++)
{
if(b%i==0)break;}
if(i<b)
continue;
else
printf("%d %d\n",a,b);
}
}
}
return 0;
}
| 43 |
21,123 | //***************************************
//** ????????? **
//** ?????? 1300012722 **
//** ???2013.10.24 **
//***************************************
int main()
{
int m, a, b, c, d, i, k; //????m??????a?b?????c?d?
cin >> m;
for (a = 3; a < m; a = a + 2)
{
b = m - a;
if (b < a) break; //??b>a,????
c = sqrt(a); //?a????
for (i = 2; i <= c; i++)
if (a % i == 0) break;
if (i > c) //??a??????b?????
{
d = sqrt(b);
for (k = 2; k <= d; k++)
if (b % k == 0) break;
if (k > d) //??b???????a?b??
cout << a << " " << b << endl;
}
}
return 0;
} | 43 |
21,124 | int main()
{
int m,i,j,c,d;
scanf("%d",&m);
for(i=3;i<=(m/2);i=i+2)
{
for(c=0,j=2;j<i;j++)
{
if(i%j!=0)
c=c+1;
}
if(c==(i-2))
{
for(d=0,j=2;j<(m-i);j++)
{
if((m-i)%j!=0)
d=d+1;
}
if(d==(m-i-2))
printf("%d %d\n",i,m-i);
}
}
} | 43 |
21,125 | int fun(int x)
{
int b=1;
for(int a=2;a<x;a++)
{
if(x%a==0)
{
b=0;
break;
}
}
return b;
}
main()
{
int m,n,k,i;
scanf("%d",&m);
n=m/2;
k=(n+1)/2;
for(i=2;i<=k;i++)
{
int c=2*i-1;
if(fun(c)==1&&fun(m-c)==1)
printf("%d %d\n",c,m-c);
}
getchar();
getchar();
}
| 43 |
21,126 | int work(int n)
{
for(int i=3;i<=sqrt(n);i+=2)
if(n%i==0)return 0;
return 1;
}
int main()
{
int m,i;
cin>>m;
for(i=3;i<=m/2;i+=2)
{
if(work(i)&&work(m-i))
cout<<i<<' '<<m-i<<endl;
}
return 0;
}
| 43 |
21,127 | int main()
{
int m;
int i,j,k;
scanf("%d",&m);
int s[2000];
s[0]=2;s[1]=3;
k=1;
for(j=3;j<10000;j++)
{
for(i=0;s[i]*s[i]<j;i++)
{
if(j%s[i]==0)
break;
}
if(s[i]*s[i]>j)
{
s[k]=j;
k++;
}
}
for(j=0;s[j]<=m/2;j++)
{
for(i=0;s[i]<=m;i++)
if(m==s[i]+s[j])
{
printf("%d %d\n",s[j],s[i]);
}
}
return 0;
} | 43 |
21,128 | int main ()
{
int a,i,b,j,n=0,m=0;
scanf("%d",&a);
for(i=3;i<=a/2;i=i+2)
{
for (j=2;j<i;j++)
{
if (i%j!=0)
n=n+1;
}
if (n==i-2)
{
b=a-i;
for (j=2;j<b;j++)
{
if (b%j!=0)
m=m+1;
}
if (m==b-2)
printf ("%d %d\n",i,b);
}
n=0;
m=0;
}
return 0;
} | 43 |
21,129 | int main()
{int m,p,q,i,j;
scanf("%d",&m);
for(i=3;i<=(m/2);i=i+2)
{
{
for(j=2;j<=sqrt(i);j++)
if(i%j==0)break;
if(j>sqrt(i)) p=1;
else p=0;
for(j=2;j<=sqrt(m-i);j++)
if((m-i)%j==0)break;
if(j>sqrt(m-i))
q=1;
else q=0;
}
if(p==1&&q==1)printf("%d %d\n",i,m-i);
}
return 0;
}
| 43 |
21,130 | //********************************
//*????????? **
//*????? 1300012739 **
//*???2013.10.23 **
//********************************
int main()
{
int n, m, i, j;
double k;
cin >> n;
for(i = 3; i <= n / 2; i = i + 2) //?i??????n/2?????
{
int r = 0; //??r = 0??r?0?????????????
k = sqrt(i);
for(j = 2; j <= k; j++) //??i?????
{
if(i % j == 0) r++;
}
if(r) continue; //?????????????????n - i?
else
{
r = 0;
k = sqrt(n - i);
for(j = 2; j <= sqrt(n - i); j++) //???n - i??????
{
if((n - i) % j == 0) r++;
}
}
if(r) continue; //????????????????i???n- i?
else
{
cout << i << " " << n - i << endl;
}
}
return 0;
}
| 43 |
21,131 | int su(int n)
{
int a=n;
int b=0;
int c=sqrt(n);
for(int d=2;d<=c;d++)
{
if((a%d)==0) b=b+1;
}
b=(b==0);
return(b);
}
int main()
{
int b;
cin>>b;
for(int i=1;i<=(b+4)/4;i++)
{int t=2*i+1;
if ((su(t)==1)&&(su(b-t)==1)&&(t<=(b-t)))
cout<<t<<" "<<b-t<<endl;
}
}
| 43 |
21,132 | //*****************************
//* ³ÌÐòÃû£º ¸çµÂ°ÍºÕ²ÂÏë **
//* ×÷Õߣº ÀîÕæÒ» 1300012948 **
//* ʱ¼ä£º 2013.10.24 **
//*****************************
int main()
{
int m, a, b, k, n;
cin >> m;
for(int i = 3; i <= (m / 2); i += 2)
{
a = (int)sqrt(i * 1.0);
for(k = 2; k <= a + 1; k++)
{
if(i % k == 0)
break;
else
continue;
}
if(k > (a + 1))
{
b = (int)sqrt((m - i) * 1.0);
for(n = 2; n <= b + 1; n++)
{
if((m - i) % n == 0)
break;
else
continue;
}
if(n > (b + 1))
cout << i << " " << (m - i) << endl;
}
}
return 0;
} | 43 |
21,133 | void main()
{
int flag(int n);
int m,i,a,b;
scanf("%d",&m);
while((m>=6)&&(m%2==0))
{
for(i=2;i<=m/2;i++)
{
if(flag(i)==0&&flag(m-i)==0)
printf("%d %d\n",i,m-i);
}
break;
}
}
int flag(int n)
{
int c,k,i;
k=sqrt(n);
for(i=2,c=0;i<=k;i++)
{
if(n%i==0)
{c=1;break;}
}
return(c);
}
| 43 |
21,134 | int check(int);
int main()
{
int n,i,j;
cin >> n;
for(i = 2; i < n; i++)
{
if((i % 2 != 0)&&(check(i)))
{
for(j = i; j < n; j++)
{
if((j % 2 != 0)&&(check(j)))
if(i + j == n)
cout << i << " " << j << endl;
}
}
}
return 0;
}
int check(int m)
{
if(m == 2)
return 1;
int i,j;
j = sqrt(m);
for(i = 2; i <= j; i++)
{
if(m % i == 0)
break;
}
if(i == j + 1)
return 1;
else
return 0;
} | 43 |
21,135 |
int sushu(int a){
int flag=1;
int m,i;
m=sqrt(a);
for(i=2;i<=m;i++){
if(a%i==0) flag=0;}
return flag;}
int main()
{
int m,x,y,k,i;
scanf("%d",&m);
for(k=3;k<=m/2;k+=2){
if(sushu(k)&&sushu(m-k)) printf("%d %d\n",k,m-k);}
return 0;
}
| 43 |
21,136 | //****************************
//**Title?????? **
//**Author:?? 1300012732 **
//**Date?2013.10.23 **
//**File?1.cpp **
//****************************
int main()
{
int m;
cin >> m;
int i;
for (i = 3; i <= m / 2; i += 2)
{
int r1, j;
for (j = 2; j <= sqrt(i); j++)
{
r1 = i % j;
if (r1 == 0)
break;
}
if (j > sqrt (i))
{
int n, r2, k;
n = m - i;
for (k = 2; k <= sqrt(n); k++)
{
r2 = n % k;
if (r2 == 0)
break;
}
if (k > sqrt(n))
cout << i << ' ' << n << endl;
}
}
return 0;
}
| 43 |
21,137 | int main()
{
int n,i,j,x,y,t;
scanf("%d",&n);
for(i=2;i<=(n/2.0);i++)
{
for(x=2;x<i;x++)
{
y=i%x;
if(y==0) break;
}
if(y!=0)
{
j=n-i;
for(t=2;t<=j/2.0;t++)
{ y=j%t;
if(y==0)
break;
}
if(y!=0)
printf("%d %d\n",i,j);
}
}
return 0;
} | 43 |
21,138 | int main()
{
int n,i,j,k,t,p,q;
scanf("%d",&n);
for(i=3;i<=n/2;i+=2){
t=n-i;
p=(int)sqrt(i);
q=(int)sqrt(t);
for(j=2;j<=p;j++){
if(i%j==0){
break;}
}
for(k=2;k<=q;k++){
if(t%k==0){
break;}
}
if(j>p && k>q){
printf("%d %d\n",i,t);
}
}
return 0;
}
| 43 |
21,139 | int main()
{
int m;
cin >> m;
int a[10001] = {0};
int b[10001] = {0};
int t = 0;
for(int i = 2; i < m; i++) // ????????m???????a?
{
for(int j = 2; j < m; j++)
{
if( i * j > m || a[i*j] != 0 )
continue;
a[i*j] = i * j;
//cout << a[i*j]<< " ";
b[t] = i * j ;
//cout << b[t] << " ";
t ++;
}
}
int x, p[10001] , q[10001];
int p1, q1;
for(int i = 3; i <= m/2; i = i + 2)
{
x = m - i; // x ,i ?????
//????????????
for(int j = 0; j < t; j++)
{
p[j] = b[j] - i;
q[j] = b[j] - x;
}
p1 = 0;
q1 = 0;
for(int j = 0; j < t; j++)
{
if( p[j] != 0)
p1 ++;
if( q[j] != 0)
q1 ++;
}
if( p1 == t && q1 == t)
cout << i << " " << x << endl;
}
return 0;
}
| 43 |
21,140 | int main ()
{
int m;
int i, j, p;
int n1, n2;
scanf("%d", &m);
for (n1=3; n1<=m/2; n1+=2) {
for (j=3, p=0; j<n1/2; j+=2) {
if (n1%j==0) {
p=1;
break;
}
}
if (p==0) {
n2=m-n1;
for (j=3; j<n2/2; j+=2) {
if (n2%j==0) {
p=1;
break;
}
}
if (p==0) {
printf("%d %d\n", n1, n2);
}
}
}
return 0;
} | 43 |
21,141 | int zhishu(int x)
{
int i,z=1;
for(i=2;i<=x/2;i++)
if(x%i==0)
{
z=0;
break;
}
return(z);
}
void main()
{
int m,i;
scanf("%d",&m);
for(i=2;i<=m/2;i++)
if(zhishu(i)&&zhishu(m-i))
printf("%d %d\n",i,m-i);
}
| 43 |
21,142 | int main()
{
int n,a=3,b=2,c,d=0,e=3,f,g=0;
scanf("%d",&n);
while (a<=n/2)
{
b=2;
d=0;
while(b<a)
{
c=a%b;
if(c==0)
{
break;}
else
{
d=d+1;
}
b=b+1;
}
if(d==a-2)
{
e=3;
g=0;
while(e<n-a)
{
f=(n-a)%e;
if(f==0)
{
break;
}
else
{
g=g+1;
}
e=e+1;
}
if(g==n-a-3)
{
printf("%d %d\n",a,n-a);
}
}
a=a+1;
}
return 0;
} | 43 |
21,143 | int judge(int x);
int main()
{
int n,i,j;
scanf("%d",&n);
for(i=3;i<=n/2;i++)
{
if(judge(i)==1)
{
j=n-i;
if(judge(j)==1)
{
printf("%d %d\n",i,j);
}
}
}
return 0;
}
int judge(int x)
{
int i,q=1;
for(i=2;i<x;i++)
{
if(x%i==0)
{
q=0;
break;
}
}
return q;
} | 43 |
21,144 | int main()
{
int m, i, j, n, sqrti, sqrtn;
scanf("%d",&m);
if(m>=6 && m<=10000 && m%2==0)
{
for(i=3; i<=m/2; i+=2)
{
sqrti=(int)sqrt(i);
for(j=3; j<=sqrti; j+=2)
{
if(i%j==0)
break;
}
if(j>sqrti)
{
n=m-i;
sqrtn=(int)sqrt(n);
for(j=3; j<=sqrtn; j+=2)
{
if(n%j==0)
break;
}
if(j>sqrtn)
printf("%d %d\n",i,n);
}
}
}
return 0;
} | 43 |
21,145 | int main()
{
int m,i,j,k;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
for(j=2;j<i;j++)
if(i%j==0) break;
if(j<i) continue;
for(k=2;k<m-i;k++)
if((m-i)%k==0) break;
if(k<(m-i)) continue;
printf("%d %d\n",i,m-i);
}
return 0;
} | 43 |
21,146 | int f(int x)
{ int c=0;int i;
for(i=1;i<=(sqrt(x)+1);i++)
{if(x%i==0) c++ ;}
if(c==1)
return 1;
else return 0;
}
int main()
{ int m;
scanf("%d",&m);
int c=3;
for(;c<=m/2;c=c+2)
{ int d;
d=m-c;
if(f(d)==1&&f(c)==1) printf("%d %d\n",c,d);
}
getchar();
getchar();
}
| 43 |
21,147 | main()
{
int a,b,n,i,j;
scanf("%d",&n);
a=3;
while(a<=n/2)
{ i=3;
while(i*i<=a)
{if(a%i==0) break;
else i=i+2;}
if (i*i>a)
{b=n-a;
j=3;
while(j*j<=b)
{if(b%j==0) break;
else j=j+2;}
if(j*j>b)
printf("%d %d\n",a,b);
}
a=a+2;}
} | 43 |
21,148 | void main()
{
int n,i,k;
int issu(int k);
scanf("%d",&n);
for(i=2;i<=n/2;i++)
{
if(issu(i))
{
if(issu(n-i))
printf("%d %d\n",i,n-i);
}
}
}
int issu(int k)
{
int j,s;
s=1;
for(j=2;j<k;j++)
{
if(k%j==0)
{
s=0;
return(s);
break;
}
}
} | 43 |
21,149 | void main()
{int a,b,c,i,s;
scanf("%d", &a);
for (b=3;b<=a/2;b=b+2)
{c=a-b;
s=0;
for (i=3;i<=b/2;i=i+2)
{if (b%i==0)
{s=1;break;}
}
if (s==1) continue;
else
for (i=3;i<=c/2;i=i+2)
{if (c%i==0)
{s=1;break;}
}
if (s==0)
printf("%d %d\n", b,c);
}
} | 43 |
21,150 | int prime(int n)
{
int i,z=1;
for(i=3;i<=n/2;i++)
{
if(n%i==0)
{z=0;break;}
}
return z;
}
main()
{
int n,i;
scanf("%d",&n);
for(i=3;i<=n/2;i=i+2)
{
if(prime(i)==1&&prime(n-i)==1)
printf("%d %d\n",i,n-i);
}
getchar();
getchar();
return 0;
}
| 43 |
21,151 | main()
{
int m,i,j,l;
float k,p;
scanf("%d",&m);
for(i=3;i<=m/2;i++,i++)
{
k=sqrt(i);
for(j=2;j<=k;j++)
if(i%j==0)break;
p=sqrt(m-i);
for(l=2;l<=p;l++)
if((m-i)%l==0)break;
if(j>k&&l>p)
printf("%d %d\n",i,m-i);
}
} | 43 |
21,152 | int main()
{
int n,i,j,flag;
int m;
scanf("%d",&n);
flag=1;
for(i=3;i<=n/2;i=i+2)
{
for(j=2;j<=i-1;j++)
{
if(i%j==0)
{
flag=-1;
break;
}
flag=1;
}
if(flag==1)
{
m=n-i;
for(j=2;j<=m-1;j++)
{
if(m%j==0)
{
flag=-1;
break;
}
flag=1;
}
}
if(flag==1)
printf("%d %d\n",i,m);
}
return 0;
} | 43 |
21,153 | int ju(int x)
{
int j;
for(j=2;j<x;j++)
{
if(x%j==0)
return 0;
}
return 1;
}
int main()
{
int i,num,flag=0;
int b;
scanf("%d",&num);
for(i=3;i<=num/2;i=i+2)
{
if(ju(i)==1)
{
b=num-i;
if(ju(b)==1)
{
printf("%d %d",i,b);
printf("\n");
}
}
}
return 0;
}
| 43 |
21,154 | int zhi(int i)
{
int j,d;
d=1;
for(j=1;j<=i/2; j++)
{
if(i%j==0) d=j;
}
return (d);
}
int main()
{
int m,i,j;
int d=1;
scanf("%d",&m);
for(i=3; i<=m/2;i=i+2)
{
j=m-i;
if (zhi(i) == 1 && zhi(j) == 1)
printf("%d %d\n",i,j);
}
}
| 43 |
21,155 | //********************************
//*????????? **
//*?????? 1300012861 **
//*???2013.10.17 **
//********************************
int main()
{
int n, x, y, i, r, j, s;
cin >> n;
for (x = 3; x <= n / 2; x += 2) //??? ???3?? ??+2
{
y = n - x;
r = sqrt (x);
s = sqrt (y);
for (i = 2; i <= r; i++) //??x?????
{
if (x % i == 0) //????????
{
break;
}
}
for (j = 2; j <= s; j++) //??y?????
{
if (y % j == 0)
{
break;
}
}
if ((i == r + 1) && (j == s + 1)) //?x?y??????????? ?????
cout << x << ' ' << y << endl;
}
return 0;
}
| 43 |
21,156 | int main()
{
int n,a,b,c,d;
scanf("%d",&n);
a=3;
while(a<=n/2)
{
for(b=2;b<=(sqrt)(a);b++)
{
if(a%b==0) goto o2;
}
c=n-a;
for(d=2;d<=(sqrt)(c);d++)
{
if(c%d==0) goto o2;
}
printf("%d %d\n",a,c);
o2:a++;
}
return 0;
} | 43 |
21,157 | int main()
{
int m,n,i,t,a; //m??;n?m???;i,t=??=??,i<t;a?????
cin>>m;
if(m%2!=0)
cout<<"input error";
else
{n=m/2;
for(i=3,t=m-i;i<=n;i++,t--)
{for(a=2;a<i;a++)
{if(i%a!=0);
else
break;
}
if(a==i)
{
for(a=2;a<t;a++)
{if(t%a!=0);
else
break;
}
if(a==t)
cout<<i<<' '<<t<<'\n';
else;
}
else;
}
}
cin.get();cin.get();
return 0;
} | 43 |
21,158 | int main()
{
int m,a,b,j,i,sgn1=0,sgn2=0;
scanf("%d",&m);
for (a=3;a<=m/2;a++)
{
for(j=2;j<=a/2+1;j++)
{
if(a%j==0)
{
sgn1=0;
break;
}
else sgn1=1;
}
if (sgn1==0) continue;
for(i=2;i<=(m-a)/2+1;i++)
{
if((m-a)%i==0)
{
sgn2=0;
break;
}else sgn2=1;
}
if(sgn1&&sgn2)
printf("%d %d\n",a,m-a);
}
return 0;
}
| 43 |
21,159 | int main()
{
int panduan(int x);
int m,i,j,a,b;
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2)
{
j=m-i;
a=panduan(i);
b=panduan(j);
if((a==1)&&(b==1))
printf("%d %d\n",i,j);
}
return 0;
}
int panduan(int x)
{
int i;
for(i=3;i<x/2;i++)
if(x%i==0)
{
return(0);break;
}
return(1);
} | 43 |
21,160 | int issushu(int n);
int a[1000],b[1000];
int main()
{
int n,j,q,i,count=0;
scanf("%d",&n);
for(i=2;i<=(n/2);i++)
{
j=issushu(i);
q=issushu(n-i);
if((j==1)&&(q==1))
{
a[count]=i;
b[count]=n-i;
count++;
}
}
if(count!=0){
for(i=0;i<count;i++)
{
printf("%d %d\n",a[i],b[i]);
}}
return 0;
}
int issushu(int n)
{
int i,flag=1;
for(i=2;i<n;i++)
{
if(n%i==0)
{
flag=0;
}
}
return flag;
} | 43 |
21,161 | int main()
{
int m,i,j,k=0,s;
int a[10000];
int *p=a;
scanf("%d",&m);
for(i=3;i<m;i+=2)
{
s=0;
for(j=2;j<i;j++)
{
if(i%j==0)
{
s=1;
}
}
if(s);
else
{
*(p+k)=i;
k++;
}
}
for(i=0;i<=k;i++)
{
for(j=i;j<=k;j++)
{
if(a[i]+a[j]==m)
printf("%d %d\n",a[i],a[j]);
}
}
return 0;
} | 43 |
21,162 | int prime(int n)
{
int i=3;
for(i=2;i<n/2+1;i++)
{
if(n%i==0)
return(0);
}
return(1);
}
main()
{
int m,n,i,j,k;
scanf("%d",&m);
for(i=3;i<(m/2)+1;i++)
{
j=prime(i);
k=m-i;
n=prime(k);
if(j!=0&&n!=0)
printf("%d %d\n",i,k);
}
getchar();
getchar();
}
| 43 |
21,163 | int main()
{
int m,a,b,i,j;
scanf("%d",&m);
if(m>=6&&m<=10000&&m%2==0)
{
for(a=2;a<=m;a++)
{
for(b=2;b<=m;b++)
{
if(a%2!=0&&b%2!=0&&a<=b)
{
if(m==a+b)
{
for(i=2;i<a;i++)
{if(a%i==0){
break;
}
}
if(i==a){
for(j=2;j<b;j++)
{if(b%j==0){
break;
}
}
if(j==b){
printf("%d %d\n",a,b);}}
}
}
}
}
}
return 0;
} | 43 |
21,164 | int main()
{ int m,a=3,b,i,j;
scanf("%d",&m);
loop:while(a<=m/2)
{i=2;
j=2;
while(i<=a-1)
{ if(a%i==0)
{a++;
goto loop;
}
else i++;
}
b=m-a;
while(j<=b-1)
{ if(b%j==0)
{a++;
goto loop;
}
else j++;
}
printf("%d %d\n",a,b);
a++;
}
return 0;
} | 43 |
21,165 | 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++)
{
if (a[i]==0)
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,166 | //****************************************************
//* ? ? ?: homework.cpp *
//* ? ?: ??? *
//* ????: 2012?10?22? *
//* ????: ?????? *
//****************************************************
int main()
{
int a[10001] ,i ,j ,n ; //??A??????????
cin >> n;
for (i = 2;i <= n;i++) a[i] = 1; //???A
for (i = 2;i <= n/2;i++)
{
if (a[i])
{
j = i + i; //?????????
while (j < n)
{ //????
a[j] = 0;
j = j + i;
}
}
}
for (i = 2;i <= n / 2; i++){
if (a[i] && a[n - i]) cout << i << ' ' << n - i << endl;
//?????????
}
return 0;
}
| 43 |
21,167 | //
// ????1.cpp
// ???????????
// ?????? 1200012943
// ??:2012.10.26
//
int main()
{
int m, n, a, b, r, i;
cin >> m;
n = m / 2;
for (a = 3; a <= n; a = a + 2)
{
r = ceil (sqrt (a)); //?a????
for (i = 2; i <= r; i++)
if ((a % i) == 0) break; //??????
if (i == r + 1)
{
b = m - a;
r = ceil (sqrt (b)); //?b????
for (i = 2; i <= r; i++)
if ((b % i) == 0) break; //??????
if (i == r + 1)
cout << a << ' ' << b << endl;
}
}
return 0;
} | 43 |
21,168 |
int istarget(int);
int main(void)
{
int num,i;
scanf("%d",&num);
for (i=2;i<=num/2;i++)
{
if (istarget(i)==1 && istarget(num-i)==1)
printf("%d %d\n",i,num-i);
}
return 0;
}
int istarget(int num)
{
int i;
for (i=2;i<=num/2;i++)
{
if (num%i==0)
return 0;
}
return 1;
}
| 43 |
21,169 |
int main()
{
int a[20000]={0},b[20000]={0},i,m,j,k;
cin>>m;
for(i=3;i<m;i=i+2)
{
a[i]=i;
for(j=3;j<i;j=j+2)
{
if(i%j==0)
a[i]=0;
}
}
for(i=3;i<=m/2;i=i+2)
if (a[i]==i&&a[m-i]==m-i)
{
cout<<a[i]<<" "<<a[m-i]<<endl;
}
return 0;
} | 43 |
21,170 |
int main()
{
int m = 0;
scanf("%d", &m);
int Set[5001];
int SetN = 1;
Set[0] = 0;
Set[1] = 2;
int i = 0, j = 0;
for ( i = 2; i <= m; i++ )
{
for ( j = 1; j <= SetN; j++ )
{
if ( i % Set[j] == 0 )
break;
}
if ( j == SetN + 1 )
{
SetN++;
Set[SetN] = i;
}
}
/*for ( j = 1; j <= SetN; j++ )
{
printf("%d\n", Set[j]);
}*/
for ( i = 1; i <= SetN; i++ )
{
if (Set[i]>m/2)
break;
for ( j = i; j <= SetN && Set[i]+Set[j] <= m; j++ )
{
if ( Set[i]+Set[j] == m )
{
printf("%d %d\n", Set[i], Set[j]);
}
}
}
return 0;
}
| 43 |
21,171 |
int main()
{
int m, pin; //m???????pin???????????
cin >> m; //??????
for ( int i = 3; i <= m / 2 ; i += 2 ) //?????m/2????
{
pin = 0; //????????pin = 0
for ( int k = 2; k * k <= i; k++ ) //??i?????????i???????
{
if ( i % k == 0 )
pin = 1; //??i?????pin???1
}
for ( int l = 2; l * l <= ( m - i ); l++ ) //??m-i?????
{
if ( ( m - i ) % l == 0 )
pin = 1; //??m-i?????pin???1
}
if ( pin == 0 ) //??pin = 0??i?m-i?????????
cout << i << " " << m - i << endl;
}
return 0;
} | 43 |
21,172 | int main()
{
int m, i, n, a, b;
cin >> m;
for (i = 3; i <= m / 2; i = i + 2)
{
a = 0;
b = sqrt(i);
for (n = 2; n <= b ; n++)
{
if ((i % n) == 0)
{
a = a + 1;
break;
}
}
for (n = 2; n <= sqrt(m - i) ; n++)
{
if (((m - i) % n) == 0)
{
a = a + 1;
break;
}
}
if (a == 0)
cout << i << " " << m - i << endl;
}
return 0;
} | 43 |
21,173 | main()
{
int x,i,j,k,l;
scanf("%d",&x);
for (i=3;i<=x/2;i+=2)
{
l=0;
j=x-i;
for(k=2;k<=i-1;k++)
{
l=l+!(i%k);
}
for (k=2;k<j;k++)
{
l+=!(j%k);
}
if (!l) printf("%d %d\n",i,j);
}
} | 43 |
21,174 | int main()
{
int m,i,j,k,judge;
scanf("%d",&m);
for (i=3;i*2<=m;i+=2){
judge=1;
for (k=3;k*3<=i;k+=2){
if (i%k==0) {judge=0;}
}
if (judge){
j=m-i;
for (k=3;k*3<=j;k+=2){
if (j%k==0) {judge=0;}
}
}
if (judge) printf("%d %d\n",i,j);
}
return 0;
} | 43 |
21,175 | main()
{
int a[91],m,i,j,n,k,l,t;
a[1]=2;
a[2]=3;
a[3]=5;
a[4]=7;
n=4; // ??????
scanf("%d",&m);
for(i=11;i<=m;i++)
{
t=0;
for(j=1;j<=n;j++)
{
if(i%a[j]==0) t=1;
}
if(t==0)
{
n++;
a[n]=i;
}
}
i=1;
while(a[i]<=m/2)
{
for(j=1;j<=n;j++)
if(a[i]+a[j]==m) printf("%d %d\n",a[i],a[j]);
i++;
}
} | 43 |
21,176 | int main()
{
int m,i,j,n;
scanf("%d",&m);
for(i=3;i<=m/2;i+=2)
{
for(j=3;j*j<=i;j+=2)
if(i%j==0)
break;
if(j*j<=i)
continue;
n=m-i;
for(j=3;j*j<=n;j+=2)
if(n%j==0)
break;
if(j*j>n)
printf("%d %d\n",i,m-i);
}
return 0;
}
| 43 |
21,177 | int main() //???
{ //?????
int m,a,b,i,k,y=1,x=1; //????
cin >> m; //??m??
for (a=3;a<=m/2;a=a+2)
{
x=1;
y=1;
for (i=3;i<=a-1;i=i+2)
{
if (a%i==0)
{
x=0;
break;
}
}
if (x==1)
{
for (k=3;k<=m-a-1;k=k+2)
{
if ((m-a)%k==0)
{
y=0;
break;
}
}
if (y==1)
{
cout << a << " " << m-a << endl;
}
}
}
return 0;
} | 43 |
21,178 | int main()
{
int b,j,i;
int a[10000];
scanf("%d",&b);
i=1;
while(i<=9999)
{j=2;
while(j<=(int)(i/2)+1)
{
if ((i%j)==0)
{
a[i]=0;break;
}
else
a[i]=i;
j=j+1;
}
i=i+1;
}
i=1;
while(i<=4999)
{
j=i;
while(j<=9999)
{
if (b==(a[i]+a[j]))
printf("%d %d\n",a[i],a[j]);
j=j+1;
}
i=i+1;
}
} | 43 |
21,179 | int main()
{
int k , m ,i ,a ,j,s,u;
cin>>m;
for(k=3;k<=m/2;k++)
{
s=u=0;
for(i=2;i<=sqrt(k);i++)
{
if(k%i==0)
s=s+1;
}
if(s==0)
{
a=m-k;
for(j=2;j<=sqrt(a);j++)
{
if(a%j==0)
u=u+1;
}
if(u==0)
cout<<k<<' '<<a<<endl;
}
}
return 0;
}
| 43 |
21,180 | int main()
{
int judge(int x);
int n,i,j,d=0;
scanf("%d",&n);
for(i=3;i<=n/2;i++)
{d=0;
if(judge(i)==1)d=d+1;
j=n-i;
if(judge(j)==1)d=d+1;
if(d==2)printf("%d %d\n",i,j);
}
return 0;
}
int judge(int x)
{
int i;
for(i=2;i<=x/2;i++)
if(x%i==0) break;
if(i>x/2) return 1;
else return 0;
} | 43 |
21,181 | int main()
{
int m,a[1000],s=0,i,j;
scanf("%d",&m);
for(i=2;i<m;i++)
{
for(j=2;j<=sqrt(i);j++)
{
if(i%j==0)
break;
}
if(j>sqrt(i))
{
a[s]=i;
s=s+1;
}
}
for(i=0;i<s-1;i++)
{
for(j=s-1;j>=i;j--)
{
if(a[i]+a[j]==m)
printf("%d %d\n",a[i],a[j]);
}
}
getchar();
getchar();
}
| 43 |
21,182 | int leap(int a)
{
int t=1,i=0;
if(a==2||a==3) return t;
else
{
for(i=2;i*i<=a;i++)
{
if(a%i==0)
{
t=0;
break;
}
}
}
return t;
}
int main()
{
int i,m;
scanf("%d",&m);
for(i=2;i<=m/2;i++)
{
if(leap(i)&&leap(m-i))
{
printf("%d %d\n",i,m-i);
}
}
return 0;
} | 43 |
21,183 | int iszhishu(int n)
{
int i,sum=0;
for(i=2;i<n;i++)
{
if(n%i==0)
{sum=sum+1;}
}
if(sum==0) return 1;
else return 0;
}
int main()
{
int m,i;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
if(iszhishu(i)&&iszhishu(m-i))
printf("%d %d\n",i,m-i);
}
return 0;
} | 43 |
21,184 | int prime(int k)
{
int p=(int)sqrt(k);
int t;
for (t=3;t<=p;t+=2)
if (k%t==0) break;
if (t>p) return 1; else return 0;
}
main()
{
int n;
scanf("%d",&n);
if (n<=200000)
{
for (int i=3;i<=n/2;i+=2)
if (prime(i))
{
if (prime(n-i))
printf("%d %d\n",i,n-i);
}}
else printf("%d",n);
}
| 43 |
21,185 | int main()
{
int prime(int x);
int n,p=3,q,num;
scanf("%d",&n);
for (p=3;p<=(n/2);p=p+2)
{
q=n-p;
if (prime(p)==1&&prime(q)==1)
printf("%d %d\n",p,q);
else
continue;
}
}
int prime (int x)
{
int i,k;
k=(int)sqrt(x);
for (i=2;i<=k;i++)
{
if (x%i==0)
break;
}
if (i==k+1)
return 1;
else
return 0;
}
| 43 |
21,186 |
int main()
{
int m,i;
scanf("%d",&m);
for(i=3;i<=(m/2);i=i+2)
{
int a,b,p=0,q=0;
for(a=2;a<=(i-1);a++)
{
if(i%a==0) p=p+1;
}
if(p==0)
{
for(b=2;b<=(m-i-1);b++)
{
if((m-i)%b==0) q=q+1;
}
if(q==0) printf("%d %d\n",i,m-i);
}
}
return 0;
} | 43 |
21,187 | main()
{
int n,i,j,a[10000],b[10000],c,d;
scanf("%d",&n);
for(i=2;i<=n;i++)
{
a[1]=1;
a[i]=i;
b[i]=1;
}
b[2]=0;
b[1]=0;
b[3]=1;
for(j=2;j<sqrt(i);j++)
{
for(i=j+1;i<=n;i++)
{
if(a[i]%a[j]==0)
b[i]=0;
}
}
for(i=3;i<=n;i++)
{
for(j=3;j<=n;j++)
if(b[i]==1&&b[j]==1)
{
if(a[i]%2==1&&a[j]%2==1)
{
if(n==a[i]+a[j]&&(a[i]<=a[j]))
printf("%d %d\n\n",a[i],a[j]);
}
}
}
getchar();
getchar();
}
| 43 |
21,188 | int main(){
int m,i=2,j=2,a,b,n,k,l;
scanf("%d",&m);
n=m/2;
while(i<=n){
k=2;
l=2;
while(k<=i){
if(i%k==0)
break;
else
k++;}
if(k==i){
j=m-i;
while(l<=j){
if(j%l==0)
break;
else
l++;}
if(l==j)
printf("%d %d\n",i,j);
i++;
}
else{
i++;
continue;
}
}
return 0;
} | 43 |
21,189 | //********************************************************
//* ???:1.cpp *
//* ?????? 1200012948 *
//* ????: 2012 10 22 *
//* ????:?????? *
//********************************************************
//??
int main()
{ //?i?j?????
int m, n, i, j, b;
cin >> m; //????m
for (n = 3; n <= m/2; n = n + 2) //n???3
{
for (i = 2; i <= n - 1; i++) //???n
{
if (n % i == 0)
break;
}
if (i == n)
{
b = m - n;
for (j = 2; j <= b - 1; j++)
{
if (b % j == 0)
break;
}
if (j == b) //??b?????
cout << n << " " << b << endl;
}
}
//??
return 0;
}
| 43 |
21,190 | int main()//?????
{
int m,i,j,l,k,s;//????
cin>>m;//??m
s=0;
for(i=2,s=0;i<=m/2;i++)//??
{
for(j=2,s=0;j<i;j++)//??
{
if(i%j==0)s=s+1;//??i??j,s=s+1
}
if(s==0)
{
l=m-i;//??s=0,??l
for(k=2,s=0;k<l;k++)//??
if(l%k==0)
s=s+1;//??l??k?s=s+1
}
if(s==0)cout<<i<<" "<<l<<endl;//??s=0,??i,l
}
return 0;
} | 43 |
21,191 | int sushu(int n);
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;
}
int sushu(int n)
{
int i,k;
k=sqrt(n);
for(i=3;i<=k;i=i+2)
if(n%i==0)
return 0;
return 1;
} | 43 |
21,192 | void main()
{
int m,n;
int i,j,flag1,flag2;
scanf("%d",&m);
for(n=2;n<=m/2;n++){
flag1=0;
flag2=0;
for(i=2;i<n;i++){
if(n%i==0){
flag1=1;
break;
}
}
for(j=2;j<m-n;j++){
if((m-n)%j==0){
flag2=1;
break;
}
}
if(!flag1&&!flag2)
printf("%d %d\n",n,m-n);
}
} | 43 |
21,193 | int main()
{
int m,a=2,b,i=2,j=2;
scanf("%d",&m);
while(a<=m/2)
{
int i=2,j=2;
while(i<a)
{
if(a%i!=0)
i++;
else
goto loop1;
}
b=m-a;
while(j<b)
{
if(b%j!=0)
j++;
else
break;
if(j==b)
{
printf("%d %d\n",a,b);
break;
}
}
loop1:a++;
}
} | 43 |
21,194 | int prime(int k)
{
int h,i,g;
h=sqrt(k);
g=1;
for(i=2;i<=h;i++)
{ if(k%i==0)
{ g=0;
break;}
}
if(g==0)
return 0;
else
return 1;
}
int main()
{
int m,j,l;
cin>>m;
for(j=3;j<=m/2;j=j+2)
{
l=m-j;
if(prime(j)==1&&prime(l)==1)
cout<<j<<" "<<l<<endl;
else
continue;
}
return 0;
}
| 43 |
21,195 | int main ()
{
int m, s, p,i,j;
cin >>m;
for (s = 3; s <= m / 2;s = s + 2)
{
p = m - s;
for ( i = 2; i <= (int) sqrt (s); i = i + 1 )
{if ( s % i == 0 )
break;}
for ( j = 2; j <= (int) sqrt (p); j = j + 1 )
{if ( p % j == 0 )
break;}
if ( j == (int) sqrt (p) + 1 && i == (int) sqrt (s) +1)
cout << s << " " <<p <<endl;
}
return 0;
} | 43 |
21,196 | int main()
{
int oNum,x1,x2,i=1,sum1=0,sum2=0,j=1,k=1;
cin >> oNum;
for (i=1;i<=oNum/2;i=i+2)
{
x1=i;
x2=oNum-x1;
for (j=1;j<=x1;j++)
{
if (x1%j==0)
sum1++;
}
for (k=1;k<=x2;k++)
{
if (x2%k==0)
sum2++;
}
if (sum1==2 && sum2==2)
cout << x1 << " " << x2 << endl;
sum1=0;
sum2=0;
j=1;
k=1;
}
return 0;
}
| 43 |
21,197 | //********************************
//*????????? **
//*????? 1300012707 **
//*???2013.10.23 **
//*******************************
int main()
{
int m, s1, s2;
cin >> m;
for ( int i = 3; i <= m / 2; i = i + 2)
{
s1 = 0;
s2 = 1;
for ( int j = 2; j <= sqrt(i); j = j + 1)
{
if ( i % j == 0)
{
s1 = 1;
break;
}
}
if ( s1 == 0)
{
s2 = 0;
for ( int j = 2; j <= sqrt( m - i); j = j + 1)
{
if ( ( m - i) % j == 0)
{
s2 = 1;
break;
}
}
}
if ( s2 == 0)
{
cout << i << " " << m - i << endl;
}
}
return 0;
} | 43 |
21,198 | double cal(int i,int n,double x)
{ double s;
if (i==n) return x;
else{ s=1+1/cal(i+1,n,x);return s;}//1+1/cal(i+1,n,x);
}
int main()
{
double x;int m,n,y,i,j,k;
int a[10004]={0};
for (i=2;i<=5000;i++)
{
if (!a[i])
for(j=2;j*i<=10000;j++)
a[j*i]=1;
}
scanf("%d",&m); y=m/2;
for(i=3;i<=y;i+=2)
if (!(a[i])&&(!a[m-i])) printf("%d %d\n",i,m-i);
}
| 43 |
21,199 |
int panduan(int n)
{
int i,a,k=1;
a=n/2+1;
for(i=2;i<a;i++)
{
if(n%i==0) k=0;
}
return k;
}
void main()
{
int i,m;
scanf("%d",&m);
i=3;
while (i<m/2+1)
{
if (panduan(i)==1&&panduan(m-i)==1) printf("%d %d\n",i,m-i);
i+=2;
}
} | 43 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.