id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
21,200 | int main()
{
int a,i,j,k,m;
i=3;
scanf("%d",&a);
while(i<=a/2)
{
k=3;
while(k<i)
{
if(i%k==0)break;
k=k+2;
}
if(k==i)
{
j=a-i;
m=3;
while(m<j)
{
if(j%m==0)break;
m=m+2;
}
if(m==j) printf("%d %d\n",i,j);
}
i=i+2;
}
return 0;
} | 43 |
21,201 | int i,j,n;
int prime(int a)
{
for(i=2;i*i<=a;i++)
if(a%i==0) return(0);
}
int main()
{
cin>>n;
for(j=2;j<=n/2;j++)
{
if(prime(j)*prime(n-j)!=0) cout<<j<<" "<<n-j<<endl;
}
return 0;
} | 43 |
21,202 | main()
{
int m,n,i,j,k;
scanf("%d",&m);
for(i=3;i<m/2+1;i++)
{
for(j=2;j<i;j++)
{
if(i%j==0)
break;
}
if(j==i)
{
n=m-i;
for(k=2;k<n;k++)
{
if(n%k==0)
break;
}
if(k==n)
printf("%d %d\n",i,n);
}
}
getchar();
getchar();
} | 43 |
21,203 | main()
{
int a,b,c,d,e,f;
scanf("%d",&a);
b=a/2;
if(a==6)
{printf("3 3");
return 0;}
for(c=3;c<=b;c++)
{for(e=0,d=2;d<c;d++)
{if(c%d==0)
e=1;}
if(e==0)
{f=a-c;
for(e=0,d=2;d<f;d++)
{if(f%d==0)
e=1;}
if(e==0)
printf("%d %d\n",c,f);
}
}
getchar();
getchar();
} | 43 |
21,204 | int f(int n,int m)
{
int i,sushu,j;
sushu=0;
for(i=2;i<=sqrt(n);i++)
{
if(n%i==0)
{
sushu=-1;
}
}
if(sushu==0)
{
for(j=2;j<=sqrt(m-n);j++)
{
if((m-n)%j==0)
{
sushu=-1;
}
}
}
if(sushu==0)
{
printf("%d %d\n",n,m-n);
}
}
int main()
{
int exp,c,b,a[100],days,w,m;
int i,t,T,n,s,t2,j,k,len,x,y,ip,u;
long e,p,q,r,sp,sq,sr;
double d,h,g[100];
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2)
{
f(i,m);
}
return 0;
}
| 43 |
21,205 | int main()
{int m,i,q,a;
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2)
{a=1;
for(q=3;q<(m-i)/3;q=q+2)
{if(i==i/q*q&&i/q!=1){a=0;break;}
if((m-i)==(m-i)/q*q) {a=0;break;}}
if (a) printf("%d %d\n",i,m-i);}
return 0;
}
| 43 |
21,206 | int main()
{
int n,i,j,k,l,x,y;
scanf("%d",&n);
for(i=3;i<=n/2;i=i+2)
{
for(k=3,x=0;k<=(i+1)/2;)
{
if(i%k==0)
{
x=x+1;
break;
}
else
k=k+2;
}
if(x!=0)
continue;
else
{
j=n-i;
for(l=3,y=0;l<=j/2;)
{
if(j%l==0)
{
y=y+1;
break;
}
else
l=l+2;
}
if(y==0)
printf("%d %d\n",i,j);
}
}
}
| 43 |
21,207 | int main()
{
int m,i,a,j;
scanf("%d",&m);
for(i=3;i<=m/2;)
{
for(j=2;j<=i;j++)
{
if(i%j==0)break;
}
if(j==i)
{
a=m-i;
for(j=2;j<=a;j++)
{
if(a%j==0)break;
}
if(j==a)
printf("%d %d\n",i,a);
}
i=i+2;
}
return 0;
}
| 43 |
21,208 | int prime(int n)
{
int i;
double k=sqrt((double)n);
for(i=2;i<=k;i++)
if(n%i==0) break;
if(i>k) return 1;
else return 0;
}
int main()
{
int m;
scanf("%d",&m);
int i;
for(i=3;i<=m/2;i+=2)
if(prime(i)&&prime(m-i)) {printf("%d %d\n",i,m-i);continue;}
return 0;
} | 43 |
21,209 | int main()
{
int m,t=1,p=1;
cin>>m;
for(int i1=3;i1<=m/2;i1=i1+2)
{ 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;
else
continue;
}
else
continue;
}
}
| 43 |
21,210 | int main()
{
int su(int x);
int n,i;
scanf("%d\n",&n);
for(i=3;i<=n/2;i+=2)
{
if(su(i)&&su(n-i))
{
printf("%d %d\n",i,n-i);
}
}
}
int su(int x)
{
int t,k,leap=1;
if(x==3)
return 1;
else
{
for(t=3;t<=(x/2);t+=2)
{
k=x%t;
if(k==0)
{
leap=0;
break;
}
}
}
return(leap);
} | 43 |
21,211 | int main()
{
int m,i=3,n=2,j;
cin>>m;
while(i<=m/2){
while(n<i){
if (i%n!=0) {
if (n>=i-1){
j=m-i;
n=2;
while(n<j){
if (j%n!=0){
if(n>=j-1){
cout<<i<<" "<<j<<"\n";}
n++;}
else n=j;
}
n=i-1; }
n++;}
else n=i;}
i++;
n=2;}
return 0;
} | 43 |
21,212 | inline int single(int);
int main()
{
int m,a1,a2;
cin>>m;
for(a1=2;a1<=m/2;a1++)
{
if(single(a1)==2)
{
a2=m-a1;
if(single(a2)==2)
cout<<a1<<' '<<a2<<endl;
}
}
return 0;
}
inline int single(int x)
{
int n=0;int j;
for (j=1;j<=x;j++)
{
if (x%j==0)
n=n+1;
}
return n;
}
| 43 |
21,213 | int main()
{
int i,j,m,a,b,t,s,n=0;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
n=n+1;
t=0;
s=0;
a=i;
b=m-i;
for(j=2;j<a;j++)
{
if(a%j==0)
t=t+1;
}
for(j=2;j<b;j++)
{
if(b%j==0)
s=s+1;
}
if(s==0&&t==0)
{
if(n==1)
printf("%d %d",a,b);
else
printf("\n%d %d",a,b);
}
}
return 0;
} | 43 |
21,214 | int main()
{
int a[N],m,i,j,test,number=0;
for(i=3;i<=N;i++)
{
test=1;
for(j=2;j<i;j++)
{
if(i%j==0) test=0;
}
if(test)
{
number=number+1;
a[number-1]=i;
}
}
scanf("%d",&m);
for(i=0;i<number;i++)
{
for(j=i;j<number;j++)
{
if(a[i]+a[j]==m)
{
printf("%d %d\n",a[i],a[j]);
}
}
}
return 0;
} | 43 |
21,215 | main()
{
int a,b,c,i,j,d,k;
b=0;
scanf("%d",&a);
if(a==6)
printf("3 3");
else
{d=a/2;
for(i=3;i<=d;i++)
{
for(b=0,j=2;j<i;j++)
{if(i%j==0)
b=1;}
if(b==0)
{c=a-i;
for(k=2;k<c;k++)
if(c%k==0)
b=1;
if(b==0)
printf("%d %d\n",i,(a-i));}
}
}
getchar();
getchar();
} | 43 |
21,216 | //?????
int f(int a)
{
int i;
int l=(float)sqrt((float)a);
for(i=2;i<=l;i++)
if(a%i==0)
{
break;
return 0;
}
if(i==l+1)
return 1;
}
int main()
{
int n,i;
scanf("%d",&n);
if (n%2!=0)
return 0;
else
{
for(i=3;i<=n/2;i=i+2)
if(f(i)==1&&f(n-i)==1)
printf("%d %d\n",i,n-i);
}
return 0;
} | 43 |
21,217 | int main()
{
int n,m,i,j,k;
scanf("%d",&n);
for(i=3;i<=(n/2);i=i+2)
{
for(j=2;j<=sqrt(i);j++)
{
if(i%j==0)
break;
}
if(j>sqrt(i))
{
m=n-i;
for(k=2;k<=sqrt(m);k++)
{
if(m%k==0)
break;
}
if(k>sqrt(m))
{
printf("%d %d",i,n-i);
printf("\n");
}
}
}
return 0;
} | 43 |
21,218 | int main()
{
int m,i,j,a=0,b,c=0;
scanf("%d",&m);
for(i=3;i<m;i++)
{
for(j=2;j<=sqrt((double)i);j++) a=a+(i%j==0);
if(a==0)
{
b=m-i;
if(b>=i)
{
for(j=2;j<=sqrt((double)b);j++) c=c+(b%j==0);
if(c==0) printf("%d %d\n",i,b);
c=0;
}
}
a=0;
}
} | 43 |
21,219 | int main()
{
int n,i,j;
scanf("%d",&n);
int f(int);
int (*p)(int);
p=f;
for(i=3;i<n/2+1;i=i+2)
{
if((*p)(i)==1&&(*p)(n-i)==1)
printf("%d %d\n",i,n-i);
}
getchar();
getchar();
}
int f(int a)
{
int i,c;
for(i=2;i<a;i++)
if(a%i==0)break;
if(i==a)//???
c=1;
else c=2;
return(c);
}
| 43 |
21,220 | int main()
{
int num,a,b,r;
cin >> num;
for(a=3;a<=num/2;a+=2){
for(r=2;r<a;r++) if(!(a%r)) r=a;
if(r==a){
b=num-a;
for(r=2;r<b;r++) if(!(b%r)) r=b;
}
if(r==b) cout << a << ' ' << b << '\n';
}
return 0;
} | 43 |
21,221 | int sushu(int x)
{
int j;
for(j=2;j<x;j++)
{
if(x%j==0) break;
}
if(j==x) return 1;
else return 0;
}
int main()
{
int m,a,b;
int i,j;
scanf("%d",&m);
for(i=3;i<=m-i;i++)
{
a=sushu(i);
b=sushu(m-i);
if(a==1&&b==1) printf("%d %d\n",i,m-i);
}
return 0;
} | 43 |
21,222 | int zhiyinshu(int x)
{
int i=2;
while (i<x)
{
if (x%i==0)
{
return 0;
}
else
{
i++;
}
}
return 1;
}
int main ()
{
int i,j,x;
scanf("%d",&x);
for (i=3;i<j;i++)
{
j=x-i;
if ((zhiyinshu(i)==1)&&(zhiyinshu(j))) printf("%d %d\n",i,j);
}
return 0;
}
| 43 |
21,223 | int main()
{
int m,a,i,j,k,b,c,d,e=0;
scanf("%d",&m);
a=m/2;
for(i=3;i<=a;i=i+2)
{
for(j=3;j<=sqrt(i);j=j+2)
{
b=i%j;
if(b==0)
{e++;break;}
}
c=m-i;
for(k=3;k<=sqrt(c);k=k+2)
{
d=c%k;
if(d==0)
{e++;break;}
}
if(e==0)
printf("%d %d\n",i,c);
e=0;
}
return 0;
}
| 43 |
21,224 | int sushu(int x)
{
int a,b,t=2;
b=sqrt(x);
for (int i=2;i<=b;i++)
{
if (x%i==0)
{
t=i;
break;
}
else {t=i+1;}
}
if (t>b)
a=1;
else a=0;
return (a);
}
int main()
{
int n,c;
cin>>n;
for (int j=3;j<=(n/2);j++)
{
c=n-j;
if (sushu(c)+sushu(j)==2)
cout<<j<<" "<<c<<endl;
}
return 0;
}
| 43 |
21,225 | main()
{
int m,i,k,t;
scanf("%d",&m);
for(i=3;i<=(m/2);i=i+2)
{
for(t=2;t<=(i/2);t++)
if(i%t==0)
break;
if(t>(i/2))
{
for(t=2;t<=((m-i)/2);t++)
if((m-i)%t==0)
break;
if(t>(m-i)/2)
printf("%d %d\n",i,m-i);
}
}
} | 43 |
21,226 | //**************************
//*????????? *
//*?????? 1200012775 *
//*???2012/10/25 *
//**************************
int main()
{
int m, p, x, i;//????????????????????
cin >> m;//????
if (m % 2 == 0 && m >= 6 && m <= 10000)//?????????
{
for (p = 3; p <= (m / 2); p = p + 2)//????p??3????
{
x = 1;//??????1?x???
for(i = 2; i <= sqrt(p); i++)//?p?????
{
if(p % i == 0)//p?????????????
{
x = 0;//x??0???
break;//????????????
}
}
for(i = 2; i<= sqrt(m - p); i++)//???m-p?????
{
if((m - p) % i == 0)//m-p?????????????
{
x = 0;//x??0???
break;//????????????
}
}
if(x == 1)//????????????
cout << p << " " << m-p << endl;//??????
}
}
return 0;
} | 43 |
21,227 |
int main()
{
int n,i,j,k,m;
i = 2;
cin>>n;
for(;i<=n/2;i++)
{
j = n-i;
if (i%2!=0 && j%2!=0)
{
m=0;
for (k=2;k<=j-1;k++)
{
if (k != i)
{
if (i%k==0 || j%k==0)
m++;
}
}
if ( m == 0)
cout<<i<<" "<<j<<endl;
}
}
return 0;
} | 43 |
21,228 | int main()
{
int m , i , j , a, b, p , q;
cin >> m;
for ( i = 3; i <= m/2; i = i + 2)
{
p = 0;
q = 0;
for ( a = 2; a< i ; a ++)
{
if ( i % a ==0)
{
p=1;
}
}
if ( p==0 )
{
j = m - i ;
for ( b = 2 ; b < j ; b ++)
{
if ( j % b == 0)
{
q=1 ;
}
}
if ( q==0 )
{
cout << i << ' ' << j << endl;
}
}
}
return 0;
}
| 43 |
21,229 | int prime(int a)
{
int i,n;
if(a==1)return 0;
n=(int)sqrt((double)a);
for(i=2;i<=n;i++)
if(a%i==0)return 0;
return 1;
}
void main()
{
int i,m;
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2)
{ if(prime(i)&&prime(m-i)) {printf("%d %d\n",i,m-i); continue;}}
}
| 43 |
21,230 | int SU(int n)
{
int i,k=0;
for(i=2;i<=n/2;i++)
{
if(n%i==0)
k++;
}
if(k==0)
return 1;
else
return 0;
}
int main()
{
int n,i,j;
scanf("%d",&n);
for(i=3;i<=n/2;i++)
{
j=n-i;
if(SU(i)==1)
{
if(SU(j)==1)
printf("%d %d\n",i,j);
}
}
return 0;
} | 43 |
21,231 | int main()
{
int m,j,w,e;
scanf("%d",&m);
int judge(int a);
for(j=2;j<=m/2;j++)
{
w=judge(j);
e=judge(m-j);
if(w==1&&e==1)
printf("%d %d\n",j,m-j);
}
return 0;
}
int judge(int a)
{
int i,flag=1;
for(i=2;i*i<=a;i++)
{
if(a%i==0)
{flag=0;
break;}
}
return flag;
} | 43 |
21,232 | int sushu(double a)
{
int i,n,s;
if((int) a%2==0)
{
return 0;
}
s=sqrt(a);
for(i=3;i<=s;i+=2)
{
if((int)a%i==0)
return 0;
}
return 1;
}
int main()
{
int m,i,n;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
if(sushu((double) i)&&sushu((double) m-i))
{
printf("%d %d\n", i,m-i);
}
}
} | 43 |
21,233 | /**********************************
*??????????.cpp *
*????? *
*????: 2012-10-27 *
*?????????????????*
**********************************/
int main()
{
//????m??????odd1,odd2?odd1???devisor1,odd2???devisor2,????i,j
int m, odd1, odd2;
int devisor1, devisor2;
int i, j;
//??m
cin >> m;
for (odd1 = 3; odd1 <= (m / 2); odd1 = odd1 + 2) //??odd1 <= odd2
{
odd2 = m - odd1; //??odd2
i = 0;
j = 0; //??????????????????????????
//????????????????????????
for (devisor1 = 3; devisor1 < odd1; devisor1 = devisor1 + 2)
{
if (odd1 % devisor1 == 0)
{
i = i + 1;
break;
}
}
//?odd1??????3??????????????????????odd2?????
if (i == 0)
{
for (devisor2 = 3; devisor2 < odd2; devisor2 = devisor2 + 2)
{
if (odd2 % devisor2 == 0)
{
j = j + 1;
break;
}
}
//?odd2?????????????????
if (j == 0)
cout << odd1 << " " << odd2 << endl;
}
}
return 0;
}
| 43 |
21,234 | int main()
{
int m, a, b;
cin >> m;
for (a = 3; a <= (m / 2); a = a + 2)
{
int count1 = 1;
for (int n = 2; n <= sqrt(a); n++)
{
if (a % n == 0)
continue;
count1++;
}
if (count1 > sqrt(a) - 1)
{
b = m - a;
int count2 = 1;
for (int i = 2; i <= sqrt(b); i++)
{
if (b % i == 0)
continue;
count2++;
}
if (count2 > sqrt(b) - 1)
cout << a << " " << b << endl;
}
}
return 0;
}
| 43 |
21,235 |
void main()
{
int m,i,t,j,k,p,a;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
a=1;
t=i;p=m-i;
for(j=2;j<=t/2;j++)
{
if(t%j==0)
{a=0;
break;}
}
for(k=2;k<=p/2;k++)
{
if(p%k==0)
{a=0;
break;}
}
if(a)
printf("%d %d\n",t,p);
}
} | 43 |
21,236 | void main()
{
int m,n,i,k,a[10000],j=0,p;
scanf("%d",&m);
for(n=3;n<m;n=n+2)
{
k=sqrt(n);
for (i=2;i<=k;i++)
{if (n%i==0) break;}
if (i>=k+1) {a[j]=n;j++;}
}
for (i=0;i<j-1;i++)
for (p=i;p<j;p++)
{if (a[i]+a[p]==m) printf("%d %d\n",a[i],a[p]);}
}
| 43 |
21,237 | int main()
{
int a,b,c,d,k,s=0,i,ch[10007]={'0'};
for(a=2;a<=10000;a++)
{
for(i=1,k=0;i<=a;i++)
{
b=a%i;
if(b==0)
k++;
else
s++;
}
if(k==2)
ch[a]=1;
}
scanf("%d",&c);
for(d=2;d<=(c/2);d++)
{ if(ch[d]*ch[c-d]==1)
printf("%d %d\n",d,c-d);
}
return 0;
} | 43 |
21,238 |
int main()
{
int m;
cin>>m;
int e;
int b=0;
int c=0;
for(int k=3;k<=m/2;k=k+2)
{
e=0;
for(int i=2;i<=sqrt(k);i=i+1)//??k?????
{
b=k%i;
if(b==0)
e=1;
}
if(e==0)//??k???
{
c=m-k;
for(int i=2;i<=sqrt(c);i=i+1)//??k?????
{
b=c%i;
if(b==0)
e=1;
}
if(e==0)//??k???
cout<<k<<" "<<c<<endl;
}
}
return 0;
} | 43 |
21,239 | main()
{
int m,a,b,x,y,i,j,p1,p2;
scanf("%d\n",&m);
for(a=3;a<=(m/2);a=a+2)
{
b=m-a;
p1=1;
p2=1;
for(i=2;i<a;i++)
{
x=a%i;
if(x==0)
{
p1=0;
break;
}
}
for(j=2;j<b;j++)
{
y=b%j;
if(y==0)
{
p2=0;
break;
}
}
if(p1!=0&&p2!=0)
printf("%d %d\n",a,b);
}
return 0;
} | 43 |
21,240 | int main()
{
int n;
int a,b;
int i,k,l,j;
cin >> n;
for(a=3;a<=n/2;a=a+2)
{
j=0;
for(i=2;i<a;i++)
{if(a%i==0)
{j=j+1;}
}
if(j==0)
{
b=n-a;
l=0;
for(k=2;k<b;k++)
{
if(b%k==0)
{l=l+1;}
}
if(l==0)
cout << a << " " << b << endl;
continue;
}}
return 0;
}
| 43 |
21,241 | void main()
{
int m,i,j,a[10000]={0};
scanf("%d",&m);
for(i=2;i<m;i+=2)
{
if((i+1)%2)
{
a[i]=1;
for(j=3;j<=i;j+=2)
{
if((i+1)%j==0)
{
a[i]=0;break;
}
}
}
}
for(i=0;i<m/2;i++)
{
if(a[i]&&a[m-2-i]) printf("%d %d\n",i+1,m-1-i);
}
}
| 43 |
21,242 | int z(int n)
{
int i,t,r;
t=0;
r=(int)sqrt(n)+1;
for(i=3;i<=r;i=i+2)
{
if(n%i==0)
{
t++;
break;
}
}
if(t==0)
return(1);
else
return(0);
}
int main()
{
int m,i,j;
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2)
{
if(z(i))
{
j=m-i;
if(z(j))
printf("%d %d\n",i,j);
}
}
return 0;
}
| 43 |
21,243 |
int main()
{
int i,n,k,m,l;
scanf("%d",&n);
for(i=3;i<(n/2+1);i+=2)
{
m=0;
for(k=2;k<i/2;k++)
{
if(i%k==0){
m=1;
break;
}
}
if(m==0){
for(l=3;l<((n-i)/2+1);l++)
{
if((n-i)%l==0){
m=1;
break;
}
}
}
if(m==0)printf("%d %d\n",i,n-i);
}
return 0;
} | 43 |
21,244 | int main()
{
int m,a[2500],b=0,c=0,x,d,i,j;
cin >> m;
for(i=3;i<m;i++)
{
c=0;
for(j=2;j*j<=i;j++)
{
d = i % j;
if(d==0)
{
c = 1;
break;
}
}
if(c==0)
{
a[b] = i;
b++;
}
}
x = b;
for(i=0;i<x;i++)
{
for(j=x-1;j>i-1;j--)
{
if(m==a[i]+a[j])
{
x = j;
cout << a[i] << " " << a[j] <<endl;
break;
}
}
}
return 0;
} | 43 |
21,245 | int main()
{
int i,j,m,s,t;
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2)
{for(j=2;j<=m;j++)
{t=0;if(((m-i)!=j)&&(i!=j)&&((i%j==0)||((m-i)%j==0))){t=1;break;}}
if(t==0)
printf("%d %d\n",i,m-i);}
return 0;
} | 43 |
21,246 | //*************************************
//* ????1.cpp *
//* ??????1200012844 *
//* ?????2012?10?23? *
//* ??????????? *
//**************************************
int main()
{
int m, x, y, i, j, l, k;//????m?m???????x?y???i?j??????l?k
cin >> m;//??????m
for( x = 3; x <= m / 2; x += 2 )//??????3??????????????
{
//l = (int) sqrt(x);
for ( i = 2; i < x ; i++ )//???2?????????
if ((x % i) == 0) break;//?????????
if ( i == x )//??x??????y?????
{
y = m - x;
//k = (int) sqrt(y);
for( j = 2; j < y ; j++ )//???2?????????
if ((y % j) == 0) break;//?????????
if ( j == y )//??y???????x y
cout << x << ' ' << y << endl;
}
}
return 0;
} | 43 |
21,247 | int main()
{
int oushu,xiao,da,i,j,panduan;
cin>>oushu;
for(xiao=3;xiao<=oushu/2;xiao++)
{
panduan=0;
da=oushu-xiao;
for(i=2;i<xiao;i++)
{
if(xiao%i==0)panduan++;//??????????? ??????panduan??
}
for(j=2;j<da;j++)
{
if(da%j==0)panduan++;//?????????????????panduan??
}
if(panduan==0)cout<<xiao<<" "<<da<<endl;//???????????panduan?????????
}
cin.get();cin.get();cin.get();
return 0;
}
| 43 |
21,248 | int main()
{
int A[10000],B[10000],m,a=2,b=2,k=1,j=1,i=2,s=1,t=1;
scanf("%d",&m);
while(a<m)
{
for(i=2;i<a;i++)
{
if(a%i==0)
{
break;
}
}
if(i==a)
{
A[k]=a;
k++;
}
a++;
}
while(b<m)
{
for(i=2;i<b;i++)
{
if(b%i==0)
{
break;
}
}
if(i==b)
{
B[j]=b;
j++;
}
b++;
}
while(s<=k)
{
t=0;
while(t<=j)
{
if(A[s]+B[t]==m)
{
if(s<=t) printf("%d %d\n",A[s],B[t]);
}
t++;
}
s++;
}
return 0;
} | 43 |
21,249 | int number(int n)
{
int i;
for(i=2;i<n;i++)
if(n%i==0)
return 0;
return 1;
}
int main()
{
int m,i;
scanf("%d", &m);
for(i=3;i<m;i=i+2)
{
if(number(i)&&number(m-i))
{
if(i<=m-i)
printf("%d %d\n", i, m-i);
}
}
return 0;
}
| 43 |
21,250 | int sushu(int x)
{
int i=2;
int c=0;
for(i=2;i<=x;i++)
{
if(x%i==0)
break;
if(2*i>x)
c=1;
}
return c;
}
void main()
{
int a;
int j;
scanf("%d",&a);
for(j=1;4*j+2<=a;j++)
{
if(!sushu(2*j+1))
continue;
else
if(sushu(a-1-2*j))
printf("%d %d\n",2*j+1,a-1-2*j);
}
}
| 43 |
21,251 | int main()
{
int m,n,a,b,c;
scanf("%d",&m);
n=3;
while(n<=(m/2))
{
b=2;
c=2;
while(c<n)
{
if((n%c)==0)
break;
else
c++;
}
if(c==n)
{
a=m-n;
}
else
{
n=n+2;
continue;
}
while(b<a)
{
if((a%b)==0)
break;
else
b++;
}
if(b==a)
{
printf("%d %d\n",n,a);
}
n=n+2;
}
return 0;
}
| 43 |
21,252 | int main(){
int e;
cin>>e;
int a = 3,b;
while(a <= e/2){
int t = 3;
while(t < a){
int m = a%t;
if(m == 0)break;
t+=2;
}
int q = 3;
while(q < e - a){
int n = (e-a)%q;
if(n == 0)break;
q+=2;
}
if(t == a && q == e-a)
cout<<a<<" "<<e-a<<endl;
a += 2;
}
return 0;
}
| 43 |
21,253 | int main()
{
int m, i, j, p, q;
cin >> m;
if (m == 6)
{
cout << 3 << " " << 3 << endl;
}
if (m == 8)
{
cout << 3 << " " << 5 << endl;
}
if (m == 10)
{
cout << 3 << " " << 7 << '\n' << 5 << " " << 5 << endl;
}
if (m == 12)
{
cout << 5 << " " << 7 << endl;
}
if (m >= 14)
{
for (i = 3; i <= m / 2; i = i + 2)
{
if ((i == 3) || (i == 5) || (i == 7))
{
j = m - i;
for (q = 3; q <= sqrt(j); q = q + 2)
{
if (j % q == 0)
{
break;
}
else if ((j % q != 0) && (q <= sqrt(j)) && (q + 2 > sqrt(j)))
{
cout << i << " " << j << endl;
}
}
}
for (p = 3; p <= sqrt(i); p = p + 2)
{
if (i % p == 0)
{
break;
}
else if ((i % p != 0) && (p <= sqrt(i)) && (p + 2 > sqrt(i)))
{
j = m - i;
for (q = 3; q <= sqrt(j); q = q + 2)
{
if (j % q == 0)
{
break;
}
else if ((j % q != 0) && (q <= sqrt(j)) && (q + 2 > sqrt(j)))
{
cout << i << " " << j << endl;
}
}
}
}
}
}
return 0;
} | 43 |
21,254 | main()
{
int m,i,j,k,l;
scanf("%d",&m);
for(i=3;i<=m/2;i++,i++)
{
for(k=2;k<i;k++)
{
if(i%k==0)break;
}
if(k<i)continue;
else
{
j=m-i;
for(l=2;l<j;l++)
{
if(j%l==0)break;
}
if(l>=j)printf("%d %d\n",i,j);
}
}
} | 43 |
21,255 |
main()
{
int m,a,b,k,s;
scanf("%d",&m);
for(a=3;a<=(m/2);a=a+2)
{
for(k=3;k<a;k=k+2)
{if(a%k==0)
{a=a+2;
k=3;}}
b=m-a;
if(b>=a)
{
s=0;
for(k=3;k<b;k=k+2)
{if(b%k==0)
s=s+1;}
if(s==0)
printf("%d %d\n",a,b);
}
}
}
| 43 |
21,256 | int main()
{
int n,i;
scanf("%d",&n);
for (i=3;i<=(n/2);i=i+2)
if (check(i)&&check(n-i))
printf("%d %d\n",i,n-i);
}
int check(int a)
{
int i;
for (i=2;i<=sqrt(a);i++)
if (a%i==0) return 0;
return 1;
} | 43 |
21,257 | int main()
{
int m,i,k,j,n;
scanf("%d",&m);
for(i=3;i<=(m/2);i++)
{
k=1;
for(j=2;j<=(i/2);j++)
{
if(i%j==0)
{
k=0;
}
}
if(k==1)
n=m-i;
for(j=2;j<=(n/2);j++)
{
if(n%j==0)
{
k=0;
}
}
if(k==1)
printf("%d %d\n",i,n);
}
return 0;
}
| 43 |
21,258 | int main()
{
int m,i,j,k,flag;
scanf("%d",&m);
for(i=3;i<=m/2;i+=2)
{
flag=0;
for(k=3;k<=sqrt(i);k+=2)
{
if(i%k==0)
{
flag=1;
}
}
if(flag==0)
{
for(j=3;j<=sqrt(m-i);j+=2)
{
if((m-i)%j==0)
{
flag=1;
}
}
if(flag==0)
{
printf("%d %d\n",i,m-i);
}
}
}
return 0;
} | 43 |
21,259 | int main()
{
int m,a,b,i,j,mult;
scanf("%d",&m);
a=2;
while(a<=(m+1)/2)
{
mult=1,i=2;
while(i<a)
{
mult=mult&&(a%i);
i++;
}
if(mult!=0)
{
b=m-a,mult=1,i=2;
while(i<b)
{
mult=mult&&(b%i);
i++;
}
if(mult!=0)
{
printf("%d %d\n",a,b);
}
}
a++;
}
} | 43 |
21,260 |
int d(int x);
int main()
{int n,r[100],t[100];
cin>>n;int w=1;
for(int i=3;i<n/2+1;i++)
{ if(d(i)==1&&d(n-i)==1)
{r[w]=i;t[w]=n-i;cout<<r[w]<<' '<<t[w]<<endl;w++;}
}
}
int d(int x)
{int m,c=1,q;
for(int i=2;i<x;i++)
{ m=x%i;c++;
if(m==0)
{c=0;break;}
}
if(c!=0) q=1;
else q=0;return q;
} | 43 |
21,261 | int p(int n)
{
for(int i=2;i*i<=n;i++)
if (n%i==0) return 0;
return 1;
}
int main()
{
int a,p(int n);
scanf("%d",&a);
for (int i=3;2*i<=a;i++)
if (p(i)*p(a-i)!=0) printf("%d %d\n",i,a-i);
}
| 43 |
21,262 | int main()
{
int m, i, different, mod;
cin >> m;
for (i = 3; i <= m / 2; i += 2)
{
for (int j = 2; j <= sqrt(i); j++)
{
mod = i % j;
if (mod != 0)
continue;
else
{
mod = 0;
break;
}
}
if (mod != 0 || i == 3)
{
different = m - i;
for (int k = 2; k <= sqrt(different); k++)
{
mod = different % k;
if (mod != 0)
continue;
else
{
mod = 0;
break;
}
}
if (mod != 0 || different == 3)
cout << i << " " << different << endl;
}
else
continue;
}
return 0;
}
| 43 |
21,263 | int main()
{
int m,i,j,k,flag,a;
scanf("%d",&m);
if(m>=6&&m<=10000)
{
for(k=3;k<=m/2;k=k+2)
{
flag=1;
for(i=2;i<k;i++)
{
if(k%i==0)
{
flag=0;
break;
}
}
if(flag==1)
{
a=m-k;
for(j=2;j<a;j++)
{
if(a%j==0)
{
flag=0;
break;
}
}
if(flag==1)
printf("%d %d\n",k,a);
}
}
}
return 0;
} | 43 |
21,264 | int main()
{
int m,x,y,i,n;//????m ??????x,y ????i x(y)?1?x(y)??????n
cin >>m;
for (x=3;x<=m/2;x++)
{
n=0;
for (i=2;i<=x/2;i++)
{
if (x%i==0) n++;
}
if (n==0)
{
y=m-x;
for (i=2;i<=y/2;i++)
{
if (y%i==0) n++;
}
}
if (n==0) cout <<x <<" " <<y <<endl;
}
return 0;
} | 43 |
21,265 |
int check(int n)
{
if(n==2)
return 0;
for(int i=2;i<=sqrt(n);i++)
if(n%i==0)
return 0;
return 1;
}
int main()
{
int m;
cin>>m;
for(int i=3;i<=m/2;i++)
{
if(check(i)==1&&check(m-i)==1)
cout<<i<<" "<<m-i<<endl;
}
return 0;
}
| 43 |
21,266 | int main()
{
int i,j,n,flag,k=0;
int zhishu[10000];
scanf("%d",&n);
for(i=3;i<n;i=i+2)
{
flag=0;
for(j=3;j<sqrt(i)+1;j=j+2)
{
if(i%j==0)
{
flag=1;
break;
}
}
if(flag==0)
{
zhishu[k]=i;
k++;
}
}
for(i=0;i<=k;i++)
{
for(j=k-1;j>=i;j--)
{
if(n-zhishu[i]==zhishu[j])
printf("%d %d\n",zhishu[i],zhishu[j]);
}
}
return 0;
}
| 43 |
21,267 | int isprime(int p);
int main(){
int m,a,b,prime1,prime2;
scanf("%d",&m);
for(a=3;a<=m/2;a=a+2){
b=m-a;
prime1=isprime(a);
prime2=isprime(b);
if(prime1&&prime2)
printf("%d %d\n",a,b);
}
return 0;
}
int isprime(int p){
int i,isprime=1;
if(p%2==0){
if(p==2){
return isprime;
}
isprime=0;
return isprime;
}
for(i=3;i<p;i=i+2){
if(p%i==0){
isprime=0;
break;
}
}
return isprime;
} | 43 |
21,268 | int main()
{
int m,n,t,l,i,j;
scanf("%d",&m);
for(i=2;i<=m/2;i++)
{
t=1;
l=1;
for(j=2;j<=i/2;j++)
{
if(i%j==0)
{
t=-1;
break;
}
}
if(t==1&&i%2!=0)
{
n=m-i;
for(j=2;j<=n/2;j++)
{
if(n%j==0)
{
l=-1;
break;
}
}
if(l==1&&l%2!=0)
printf("%d %d\n",i,n);
}
}
return 0;
} | 43 |
21,269 |
int main(void)
{
int i,j,m,k=0,temp=0;
cin>>m;
int arr_a[1300];
for (i=3;i<=m;i++)
{
for (j=2;j<=floor(sqrt(i));j++)
if (i%j==0) temp++;
if (temp==0) arr_a[k++]=i;
temp=0;
}
for (i=0;i<k;i++)
{
for (j=i;j<k;j++)
if (arr_a[i]+arr_a[j]==m)
cout<<arr_a[i]<<" "<<arr_a[j]<<endl;
}
return 0;
}
| 43 |
21,270 | int main()
{
int k,m,i,n,flag1=0,flag2=0,j;
scanf("%d",&n);
for(i=3;i<n;i++)
{
flag1=flag2=0;
for(m=2;m<i;m++){if(i%m!=0)flag1++;}
if(flag1!=i-2)continue;
j=n-i;
for(k=2;k<j;k++){if(j%k!=0)flag2++;}
if(flag2!=j-2)continue;
if(i<=j)printf("%d %d\n\n",i,j);
}
return 0;
} | 43 |
21,271 | int main ()
{
int m,a,b,i;
scanf("%d",&m);
for (a=3;a<=m/2;a+=2)
{
for(i=2;i<=sqrt(a);i++)
if (a%i==0) break;
if (i>sqrt(a))
b=m-a;
else
continue;
for(i=2;i<=sqrt(b);i++)
if (b%i==0)break;
if (i>sqrt(b))
printf("%d %d\n",a,b);
}
return 0;
} | 43 |
21,272 |
int prime(int k);
int main()
{
int n;
cin>>n;
for (int i=2;i<=n/2;i++)
if (prime(i)&&prime(n-i)) cout<<i<<' '<<n-i<<endl;
}
int prime(int k)
{
if (k==2) return 1;
for (int i=2;i<=k/2;i++)
if (k%i==0) return 0;
return 1;
}
| 43 |
21,273 | int main(){
int m;
scanf("%d",&m);
int n;
int a=0,b=0;
for(int i=3;i<=m/2;i=i+2){
n=m-i;
for(int j=3;j<=i;j++){
if(i%j==0){
a++; }}
for(int k=3;k<=n;k++){
if(n%k==0){
b++; }}
if(a==1&&b==1){
printf("%d %d\n",i,n);
}
a=0;
b=0;
}
int y;
scanf("%d",&y);
return 0;}
| 43 |
21,274 | int main()
{
int isprime(int x);
int a,b;
cin>>b;
for(int i=3;i<=b/2;i++)
if(isprime(i)&&isprime(b-i)) cout<<i<<" "<<b-i<<endl;
return 0;
}
int isprime(int x)
{
for(int y=2;y<=x/2;y++)
{
if(x%y==0) return 0;
}
return 1;
}
| 43 |
21,275 |
int main()
{
int prime(int );
int m;
scanf("%d",&m);
int a,b;
for(a=3;a<=m/2;a=a+2)
{
if(prime(a))
{
b=m-a;
if(prime(b))
printf("%d %d\n",a,b);
}
}
return 0;
}
int prime(int n)
{
int i,k=sqrt(n);
for(i=2;i<=k;i++)
{
if(n%i==0) break;
}
if(i>k) return 1;
else return 0;
} | 43 |
21,276 | void main()
{
int n,i,q,s,k;
scanf("%d",&n);
k=sqrt(n-3);
for(i=2;i<=k;i++)
if((n-3)%i==0)break;
if(i>k)printf("3 %d\n",n-3);
for(q=5;q<=(n/2);q++)
{
k=sqrt(q);
for(i=2;i<=k;i++)
if(q%i==0)break;
if(i>k)
{
s=sqrt(n-q);
for(i=2;i<=s;i++)
if((n-q)%i==0)break;
if(i>s)printf("%d %d\n",q,n-q);
}
}
}
| 43 |
21,277 | int main()
{
int m,a,b,i,j,p,q,s,t;
scanf("%d",&m);
for (a=3;2*a<=m;a=a+2)
{
q=1;t=1;
for (i=3;i<a;i=i+2)
{
p=(a%i!=0);q=q*p;
}
if (q!=0)
{
b=m-a;
for (j=3;j<b;j=j+2)
{
s=(b%j!=0);t=t*s;
}
if (t!=0)
printf("%d %d\n",a,b);
else continue;
}
else continue;
}
return 0;
} | 43 |
21,278 | int SS(int i);
int main()
{
int n,i;
scanf("%d",&n);
for(i=3;i<=n/2;i++)
{
if(SS(i)&&SS(n-i))
printf("%d %d\n",i,n-i);
}
}
int SS(int i)
{
int k;
for(k=2;k<=i-1;k++)
if(i%k==0)break;
if(k<i)return 0;
else
return 1;
} | 43 |
21,279 | int main()
{
int m,i,j,a,b,c;
scanf("%d",&m);
for(i=3;i<=(m/2);i+=2)
{
a=i;
for(j=2;j<a;j++)
{
b=a%j;
if(b==0)
break;
}
if(b==0)
continue;
c=m-a;
for(j=2;j<c;j++)
{
b=c%j;
if(b==0)
break;
}
if(b!=0)
printf("%d %d\n",a,c);
}
return 0;
}
| 43 |
21,280 | int main()
{
int m;
int a[10000];
int i,j,k;
for(i=2,k=0;i<10000;i++)
{
for(j=2;j<=i;)
{
if(i%j==0)
break;
j++;
}
if(j==i)
{
a[k]=i;
k++;
}
}
scanf("%d",&m);
for(i=0;a[i]<=m;i++)
{
for(j=i;a[j]<=m-a[i];j++)
{
if(a[i]+a[j]==m)
{
printf("%d %d\n",a[i],a[j]);
}
}
}
return 0;
} | 43 |
21,281 | int main()
{
int m,i,j,k;
cin>>m;
i=3;
while(i<=(m/2))
{
j=2;
while(j<i)
{
if (i%j==0)
{
break;
}
else j++;
if (((j==i-1)||(i==3))==1)
{
k=2;
while(k<(m-i))
{
if ((m-i)%k==0)
{
break;
}
else k++;
if (((k==(m-i-1))||(m-i==3))==1)
cout<<i<<" "<<(m-i)<<endl;
}
}
}
i=i+2;
}
return 0;
}
| 43 |
21,282 | int prime(int n)
{
int i,flag=1;
for(i=2;i<=sqrt(n);i++)
{
if(n%i==0)
{
flag=0;
return 0;
}
}
if(flag!=0)
return 1;
}
int main()
{
int n;
scanf("%d",&n);
int i,j,k;
for(i=2;i<=n/2;i++)
{
if(prime(i)==1)
{
if(prime(n-i)==1)
{
printf("%d %d\n",i,n-i);
}
}
}
}
| 43 |
21,283 | int main()
{
int n,j,i;
char isprime[MAXN+1]={0,0};
scanf("%d",&n);
for(i=2;i<=n;i++)
{
isprime[i]=1;
}
for(i=2;i<=n/2;i++)
{
if(isprime[i])
{
for(j=i+i;j<=n;j+=i)
{
isprime[j]=0;
}
}
}
for(j=2;j<=n/2;j++)
{
if(isprime[j]&&isprime[n-j])
{
printf("%d %d\n",j,n-j);
}
}
return 0;
}
| 43 |
21,284 | int zhi(int x)
{
int b=1,i=1;
for(i=2;i<=x/2;i++)
if(x%i==0) b=b+1;
return b;
}
int main()
{
int i,m;
cin>>m;
for(i=3;i<=m/2;i=i+2)
{
if(zhi(i)==1&&zhi(m-i)==1)
cout<<i<<' '<<m-i<<endl;
}
return 0;
}
| 43 |
21,285 | int main()
{
int m,a,b,i,sum1,sum2;
sum1=sum2=0;
scanf("%d",&m);
for(a=3;a<(m/2+1);a=a+2)
{
b=m-a;
for(i=1;i<=b;i++)
{
if(b%i==0)
{
sum1=sum1;
}
else
{
sum1=sum1+1;
}
}
for(i=1;i<=a;i++)
{
if(a%i==0)
{
sum2=sum2;
}
else
{
sum2=sum2+1;
}
}
if((sum1==b-2)&&(sum2==a-2))
{
printf("%d %d\n\n",a,b);
}
sum1=sum2=0;
}
return 0;
} | 43 |
21,286 | void main()
{
int m,k,i,j,t,s;
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2)
{
t=(int)sqrt(i);
s=0;
for(k=3;k<=t;k=k+2)
{s=0;
if(i%k==0) {s=1;break;}}
if(s==0)
{
j=m-i;
t=(int)sqrt(j);
for(k=3;k<=t;k=k+2)
{s=0;if(j%k==0) {s=1;break;}}
if(s==0)
printf("%d %d\n",i,j);
}
}
}
| 43 |
21,287 | int sushu(int a)
{
int i;
for(i=2;i<a;i++)
{
if(a%i==0)
break;
}
if(i==a)
return 1;
}
main()
{
int m,i;
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2)
{
if((sushu(i)==1)&&(sushu(m-i)==1))
printf("%d %d\n",i,m-i);
}
} | 43 |
21,288 | int main()
{
int m,a,b,i,sig=0,sigg=0,j;
scanf("%d",&m);
for(a=3;a<=m/2;a++)
{
for(j=2;j<=a-1;j++)
{if(a%j==0)
{sigg=1;
break;
}
}
if(sigg==0)
{b=m-a;
for(i=2;i<=b-1;i++)
{if(b%i==0)
{sig=1;
break;
}
}
if(sig==0)
printf("%d %d\n",a,b);
sig=0;
}
sigg=0;
}
scanf("%d",&m);
return 0;
} | 43 |
21,289 | int main()
{
int n,i,b,t,j;
scanf("%d",&n);
for (i=3;i<=n/2;i=i+2)
{
t=n-i;
b=1;
for (j=2;j<i;j++)
if (i%j==0) b=0;
for (j=2;j<t;j++)
if (t%j==0) b=0;
if (b==1) printf("%d %d\n",i,t);
}
return 0;
} | 43 |
21,290 | int sushu(int m)
{ int i;
for(i=2;i<=m;i++)
if(m%i==0)break;
if(i<m)return 0;
else return 1;
}
main()
{ int n,a,b,x,y;
scanf("%d",&n);
a=3;b=n-a;
while(a<=b)
{ x=sushu(a);
y=sushu(b);
if(x==1&&y==1)
{printf("%d %d\n",a,b);a=a+2;b=b-2;}
else {a=a+2;b=b-2;}
}
} | 43 |
21,291 | //********************************
//*???1.cpp **
//*?????? 1200012768 **
//*???2012.10.24 **
//*??????????? **
//********************************
int main()
{
int m, i, j, k;
cin >> m;
for (i = 3; i <= m / 2; i += 2)
{
int root1 = sqrt(i);
for (j = 3; j <= root1; j += 2) //???????i?????
{
if (i % j == 0)
break;
}
if (j <= root1 ) //??i????
continue; //?????????????
int root2 = sqrt(m - i);
for (k = 3; k <= root2; k += 2) //??????? m - i ?????
{
if((m - i) % k == 0)
break;
}
if (k > root2 ) //m - i ????
cout << i << " " << m - i << endl;
}
return 0;
} | 43 |
21,292 | int main()
{
int m,i,j,w,x,k,s;
cin>>m;
for(i=3;i<=m/2;i+=2)
{
j=m-i;
w=sqrt(i);
x=sqrt(j);
for(k=2;k<=i-1;k++)
{
if(i%k==0) break;
if(k>=i-1)
{
for(s=2;s<=j-1;s++)
{
if(j%s==0) break;
if(s>=j-1) cout<<i<<' '<<j<<endl;
}
}
}
}
return 0;
}
| 43 |
21,293 | int shusu(int n)
{ int k;
k=(int)sqrt(n);
int i,t;
if(n==3)
return 0;
else
{ for(i=3,t=0;i<=k;i=i+2)
if(n%i==0)
t=t+1;
return t;
}
}
main()
{ int n;
scanf("%d",&n);
int i;
for(i=3;i<=n/2;i=i+2)
{if(shusu(i)==0&&shusu(n-i)==0)
printf("%d %d\n",i,n-i);
}
}
| 43 |
21,294 | int main(){
int m,i,j,t,k;
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2){
for(j=3;j<i;j=j+2)
if(i%j==0)
break;
if(j<i)
continue;
else{
t=m-i;
for(k=3;k<t;k=k+2)
if(t%k==0)
break;
if(k==t)
printf("%d %d\n",i,t);
}
}
return 0;
} | 43 |
21,295 |
int main()
{
int jishu(int x);
int sushu(int x);
int m,a,i;
scanf("%d",&m);
for(i=1; i<=(m/2); i++)
{
if(sushu(i)&&jishu(i))
{
a=m-i;
if(jishu(a)&&sushu(a))
{
printf("%d %d\n",i,a);
}
}
}
return 0;
}
int jishu(int x)
{
int d;
if(x%2==0)
return 0;
else
return 1;
}
int sushu(int x)
{
int k,i,c;
k=sqrt(x);
if(x<3)
{
return 0;
}
else
{
for(i=2; i<=k; i++)
{
if(x%i==0)
{
break;
}
}
if(i>k)
{
return 1;
}
else
{
return 0;
}
}
}
| 43 |
21,296 | void main()
{
int i,j,m,n;
int prime(int n);
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{ if(prime(i)&&prime(m-i))
printf("%d %d\n",i,m-i);}
}
int prime(int n)
{
int k,i;
k=sqrt(n);
for(i=2;i<=k;i++) if(n%i==0)break;
return(i>k)?1:0;
}
| 43 |
21,297 |
int main()
{
int i,j,m,p=1,n,q=1;
scanf("%d",&m);
for(i=3;i<m/2+1;i=i+2)
{ p=1;q=1;
for(j=3;j<i/3+1;j=j+2)
{
if(i%j==0)
{
p=2;
break;
}
else
continue;
}
if(p==1)
{
n=m-i;
for(j=3;j<n/3+1;j=j+2)
{
if(n%j==0)
{q=2;
break;}
else
continue;
}
}else
continue;
if(p==1&&q==1)
printf("%d %d\n",i,n);
}
} | 43 |
21,298 | int main()
{
int m,x,y,a,b,i,j;
scanf("%d",&m);
for(x=3;x<=m/2;x++,x++)
{
a=sqrt(x*1.0);
for(i=3;i<=a;i++,i++)
{
if (x%i==0) break;
}
if (i>a||x==3||x==5)
{
y=m-x;
b=sqrt(y*1.0);
for(j=3;j<=b;j++,j++)
{
if (y%j==0) break;
}
if (j>b||y==3||y==5)
printf("%d %d\n",x,y);
}
}
} | 43 |
21,299 | int main()
{
int odd[20001]={0};
int num[10001]={0};
int n,i,j,sum;
cin>>n;
for (i=2;i<=10000;i++)
{
if (odd[i]==0)
{
j=i;
while (j<=10000)
{
j=j+i;
odd[j]=1;
}
}
}
sum=0;
for (i=3;i<=10000;i++)
if (odd[i]==0)
{
sum=sum+1;
num[sum]=i;
}
for (i=1;i<=sum;i++)
for (j=i;j<=sum;j++)
if (num[i]+num[j]==n)
cout<<num[i]<<" "<<num[j]<<endl;
return 0;
}
| 43 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.