label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
43
|
21000
|
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
|
21001
|
int main()
{
int m,a[1000]={0},b,c,d,e,i;
scanf("%d",&m);
i=1;a[0]=3;
for(b=5;b<=15+m/2;b=b+2)
{
c=0;
for(d=2;d<=sqrt(b);d++)
{
if(b%d==0) c++;
}
if(c==0)
{
a[i]=b;i++;
}
}
b=i;
for(e=0;a[e]<=m/2;e++)
{
i=m-a[e];c=0;
for(d=2;d<=sqrt(i);d++)
{
if(i%d==0) c++;
}
if(c==0)
{
printf("%d %d\n",a[e],i);
}
}
return 0;
}
|
43
|
21002
|
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
|
21003
|
int f(int n)
{
int i,a;
a=sqrt(n);
for(i=2;i<=a;i++)
{
if(n%i==0) return 0;
}
return 1;
}
int main()
{
int n;
scanf("%d",&n);
int i;
for(i=3;i<=(n/2);i++)
{
if(f(i)&&f(n-i)) printf("%d %d\n",i,(n-i));
}
getchar();
getchar();
getchar();
}
|
43
|
21004
|
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
|
21005
|
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
|
21006
|
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
|
21007
|
int main()
{
int a, b;
double m;
cin >> m;
a = 0.5 * (m);
for(b = 3;b <= a; b++)
{
for(int d = b - 1;d >= 2; d--)
{
if (b % d == 0) break;
if (d == 2)
{
int e;e = m - b;
for(int f = e - 1;f >= 2; f--)
{
if(e % f == 0) break;
if (f == 2)
{
cout << b << " " ;
cout << e << endl;
}
}
}
}
}
return 0;
}
|
43
|
21008
|
void main()
{int m,a,b,i,k,l;
scanf("%d",&m);
l=m/2;
for(a=3;a<=l;a+=2)
{k=sqrt(a);
for(i=2;i<=k;i++)
if(a%i==0) break;
if(i>=k+1)
{b=m-a;
k=sqrt(b);
for(i=2;i<=k;i++)
if(b%i==0) break;
if(i>=k+1)
printf("%d %d\n",a,b);}
}
}
|
43
|
21009
|
int main()
{
int i,j,m,flag,n,k,sum;
scanf("%d\n",&m);
for(i=3;i<=m;i++)
{
flag=0;
for(j=2;j<=i/2;j++)
{
if(i%j==0)
{
flag=1;
break;
}
}
if(flag==0)
{
n=m-i;
sum=0;
for(k=3;k<=n/2;k++)
{
if(n%k==0)
{
sum=1;
break;
}
}
if(sum==0&&i<=n)
printf("%d %d\n",i,n);
}
}
return 0;
}
|
43
|
21010
|
int main()
{
int m;
int i,k,a=0,b=0,c=0;
scanf("%d",&m);
for(i=2;i<=(m/2);i++){
if((i%2)==0){
a=1;
}
for(k=2;k<i;k++){
if((i%k)==0){
b=1;
}
}
for(k=2;k<(m-i);k++){
if((m-i)%k==0){
c=1;
}
}
if((a==0)&&(b==0)&&(c==0)){
printf("%d %d\n",i,m-i);
}
a=0;
b=0;
c=0;
}
return 0;
}
|
43
|
21011
|
/* Name : ??????
* Version : 1.0
* Date : 2013-01-19
* New : Null
* Description :
* State : Design
*/
int main()
{
int N=0;
int A=0,B=0;
int Prime[10000]={-1};
cin>>N;
for (int n=2;n<N;n++)
{
for (int j=2;j<n;j++)
if (n%j==0)
{
Prime[n-1]=-1;
break;
}
}
for (int n=1;n<=N/2;n=n+2)
{
if (Prime[n-1]==0 && Prime[N-n-1]==0)
cout<<n<<' '<<N-n<<endl;
}
return 0;
}
|
43
|
21012
|
int main()
{
int m, i, j, k, n;
cin >> m;
for (i = 3; i <= m /2; i += 2)
{
j = m - i;
for (k = 2; k < i; k ++)
if (i % k == 0) break;
else
if (k > sqrt(i))
{
for (n = 3; n < j; n += 2)
if (j % n == 0)
break;
if (n > sqrt(j))
{
cout << i << " " << j << endl;
break;
}
}
}
return 0;
}
|
43
|
21013
|
int main()
{
int n,i,j,k=0,m=0;
scanf("%d",&n);
for(i=3;i<=n/2;i=i+2)
{
for(j=1;j<=sqrt(i);j++)
{
if(i%j==0)
k=k+1;
}
for(j=1;j<=sqrt(n-i);j++)
{
if((n-i)%j==0)
m=m+1;
}
if(m==1&&k==1) printf("%d %d\n",i,n-i);
m=0;
k=0;
}
return 0;
}
|
43
|
21014
|
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
|
21015
|
/**********************************
*??????????.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
|
21016
|
//*****************************
//*??:???????? ***
//*??:??? 1300012991 ***
//*??:2013?10?25? ***
//*****************************
int main()
{
int n, a, b, i, j, k, open;
cin >> n; //??????6??
for (k = 3; k <= n / 2; k = a + 2) //???????????????
{
for (a = k; a <= n / 2; a += 2) //???????????????????
{
for (i = 2; i < a; i++) //??a?????
{
if (a % i ==0) //a???????,????,?????????
break;
}
if (i == a) //a??????????,???,?????,???????
{
open = 1;
break;
}
}
b = n - a; //b??n?a??
for (j = 2; j < b; j++) //????b?????
{
if (b % j == 0)
break;
}
if ((j == b) && (open == 1)) //a?b???????
{
cout << a << " " ; //??a??b
cout << b << endl; //?????????
}
open = 0; //?????
}
return 0;
}
|
43
|
21017
|
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
|
21018
|
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
|
21019
|
int main()
{ int m=0,i=0;
int su(int n);
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2)
{ if(su(i)==1&&su(m-i)==1)
{printf("%d %d",i,m-i);
if(i<m/2)
{printf("\n");
}
}
}
return(0);
}
int su(int n)
{ int i=2,t=1;
for(i=2;i<n-1;i++)
{ if(n%i==0)
{ t=0;
break;
}
}
return(t);
}
|
43
|
21020
|
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
|
21021
|
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
|
21022
|
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
|
21023
|
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
|
21024
|
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
|
21025
|
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
|
21026
|
int checkprime(int x)
{
int j;
int count=0;
for (j=2;j<=sqrt(x);j++)
{
if (x%j==0)
count++;
}
return count;
}
int main()
{
int i;
int n;
cin>>n;
for (i=2;i<=n/2;i++)
{
if (checkprime(i)==0&&checkprime(n-i)==0)
cout<<i<<" "<<n-i<<endl;
}
return 0;
}
|
43
|
21027
|
int main()
{
int m, i,j,k,p,s=1; //m?????????i?j????m???????k?p??????s?????
cin>>m;
for(i=0;i<m/2-2;i++)
{
i=i+3;
j=m-i;
if(i%2!=0)
{
s=s*1;
}
else
{
s=s*0;
}
for(k=0;k<i-2;k++)
{
if(i%(k+2)!=0)
{
s=s*1;
}
else
{
s=s*0;
}
}
for(p=0;p<j-2;p++)
{
if(j%(p+2)!=0)
{
s=s*1;
}
else
{
s=s*0;
}
}
if(s==1)
{
cout<<i<<' '<<j<<endl;
}
s=1;
i=i-3;
}
cin.get();cin.get();
return 0;
}
|
43
|
21028
|
int main()
{
int m;
cin>>m;
int a=3;
for(;a<=m/2;a=a+2)
{
double s=sqrt(a);
int i=2;
for (;i<=(int)s+1;i++)
{
int b;
b=a%i;
if(b==0) break;
}
if(i<=(int)s+1) continue;
else {
int c;
c=m-a;
double t=sqrt((double)c);
int h=2;
for (;h<=(int)t+1;h++)
{
int d;
d=c%h;
if(d==0) break;
}
if(h<=(int)t+1) continue;
else
{cout<<a<<' '<<c<<endl;}
}
}
return 0;
}
|
43
|
21029
|
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
|
21030
|
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
|
21031
|
int main()
{
int n, m, u, i, j, g,s,b;
cin >> n;
m=n/2;
s=0;
b=0;
for(i=3;i<=m;i++)
{
u=n-i;
for( j=2;j<i;j++)
{
if(i%j==0)break;
if(j==i-1)
{s=i;
}
}
for( g=2;g<u;g++)
{
if(u%g==0)break;
if(g==(u-1))
b=u;
}
if((s!=0)&&(b!=0))
{
cout << s <<" "<< b << endl;
}
s=0;
b=0;
}
return 0;
}
|
43
|
21032
|
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
|
21033
|
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
|
21034
|
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
|
21035
|
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
|
21036
|
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
|
21037
|
int main()
{
int sushu(int x);
int m,i,j,k;
scanf("%d",&m);
for (i=3;i<=m/2;i++)
{
k=sushu(i);
if (k==1)
{
j=m-i;
if (sushu(j)==1) printf("%d %d\n",i,j);
}
}
return 0;
}
int sushu(int x)
{
int n;
for (n=2;n<x;n++)
{
if (x%n==0)
{return 0;break;}
}
if (n>=x) return 1;
}
|
43
|
21038
|
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
|
21039
|
int main()
{
int m,j1,j2,i,d;
scanf("%d",&m);
for(j1=3;j1<=m/2;)
{
for(i=2;i<j1;i++)
{
d=j1%i;
if(d==0)break;
}
if(d==0){j1=j1+1;continue;}
else
{
j2=m-j1;
for(i=2;i<j2;i++)
{
d=j2%i;
if(d==0)break;
}
}
if(d==0){j1=j1+1;continue;}
else{printf("%d %d\n",j1,j2);}
j1=j1+1;
}
return 0;
}
|
43
|
21040
|
int main()
{
int num,i,j,k=1,a[100000],b;
scanf("%d",&num);
for(i=1;i<=num;i++)
{
for(j=2;j<=i;j++)
{
if(i%j==0)
{
if(i==j)
{
a[k]=j;
k++;
}
else
break;
}
}
}
for (k;k>=1;k--)
{
for (b=1;b<=k;b++)
{
if (a[k]+a[b]==num)
{
printf("%d %d\n",a[b],a[k]);
}
}
}
return 0;
}
|
43
|
21041
|
int main()
{
int n,i,k,s,l,m,a,b;
cin >> n;
s = n / 2;
for (i = 3;i <= s;i += 2)
{
l = sqrt(i);
for (k = 1;k <= l;k++)
{
if (i % k == 0 && k != 1)
break;
if (k == l)
{
a = n - i;
b = sqrt(a);
for (m = 1;m <= b;m++)
{
if (a % m == 0 && m != 1)
break;
if (m == b)
cout << i << " " << n-i << endl;
}
}
}
}
return 0;
}
|
43
|
21042
|
int main()
{
int m,i,j,k,n,a,b,x,y;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{a=0;b=0;
n=sqrt(i)+1;
x=sqrt(m-i)+1;
for(k=2;k<=n&&k!=i;k++)
{if(i%k==0)
a=a-1;
}
for(k=2;k<=x&&k!=(m-i);k++)
{if((m-i)%k==0)
b=b-1;
}
if(a==0&&b==0)
printf("%d %d\n",i,m-i);
}
return 0;
}
|
43
|
21043
|
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
|
21044
|
int main()
{
int n, s;
cin >> n;
for (int i = 3; i <= n / 2; i++)
{
for (int j = 2; j <= i; j++)
{
if (i % j == 0 && j != i)
{
break;
}
if (j == i)
{
s = n - i;
for (int k = 2; k <= s; k++)
{
if (s % k == 0 && s != k)
{
break;
}
if (s == k)
{
cout << i << ' ' << s << endl;
}
}
}
}
}
return 0;
}
|
43
|
21045
|
int prime(int x);
int main()
{
int m,i;
scanf("%d",&m);
for(i=2;i<=m/2;i++)
{
if(prime(i)&&prime(m-i))
{
printf("%d %d\n",i,m-i);
}
}
return 0;
}
int prime(int x)
{
int echo,i;
for(i=2;i<=x;i++)
{
if(x%i==0)
{
break;
}
}
if(i==x)
{
echo=1;
}
else
{
echo=0;
}
return echo;
}
|
43
|
21046
|
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
|
21047
|
int main()
{
int i, n,a,b,j,l=0,e=0,k;
scanf("%d",&n);
for(i=3;i<=n/2;i+=2)
{
for(j=3;j<=i/2;j+=2)
{
if(i%j==0)
l=l+1;
}
for(k=3;k<=(n-i)/2;k+=2)
{
if((n-i)%k==0)
e=e+1;
}
if(l==0&&e==0)
printf("%d %d\n",i,n-i);
j=3;
k=3;
l=0;
e=0;
}
return 0;
}
|
43
|
21048
|
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
|
21049
|
void main()
{
int i,j,n,sqrti,m=0,a[10000];
scanf("%d",&n);
for(i=3;i<=n;i+=2)
{
sqrti=(int)sqrt(i);
for(j=3;j<=sqrti;j+=2)
{
if(i%j==0)
{
break;
}
}
if(j>sqrti)
{
a[m]=i;
m++;
}
}
for(i=0;i<=m;i++)
{
for(j=i;j<=m;j++)
if(n==a[i]+a[j])
{
printf("%d %d\n",a[i],a[j]);
}
}
}
|
43
|
21050
|
int sushu(int k)
{
for(int i=2;i<=sqrt(k);i++)
{
if(k%i==0)
{
return 1;
break;
}
}
return 0;
}
int main()
{
int m=0;//m??????
int i=0,j=0;//i,j???????
int numb=0;//numb?i,m-i????????
cin>>m;
for(i=3;i<=m/2;i+=2)
{
j=m-i;
numb=sushu(i)+sushu(j);
if(numb==0)
cout<<i<<' '<<j<<endl;
}
return 0;
}
|
43
|
21051
|
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
|
21052
|
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
|
21053
|
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
|
21054
|
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
|
21055
|
main()
{
int m,k=0,i1,i2,x,y;
scanf("%d",&m);
for(i1=3;i1<=(m/2);i1=i1+2)
{
i2=m-i1;
for(x=3;x<i1;x++)
if((i1%x)==0)
{
k=1;
break;
}
if(k!=1)
{
for(y=3;y<i2;y++)
if((i2%y)==0)
{
k=1;
break;
}
}
if(k!=1) printf("%d %d\n",i1,i2);
k=0;
}
return 0;
}
|
43
|
21056
|
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
|
21057
|
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
|
21058
|
//********************************
//*????????? **
//*????? 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
|
21059
|
int f(int x)
{
int i;
for(i=2;i<x;i++)
if(x%i==0)return 0;
return 1;
}
void main()
{
int m,i;
scanf("%d",&m);
for(i=2;i<=m/2;i++)
{if(f(i)==1&&f(m-i)==1)
printf("%d %d\n",i,m-i);}
}
|
43
|
21060
|
int main()
{
int a[10001],i,j,k,d,n;
for(i=0;i<10001;i++)
a[i]=1;
for(i=2;i<10001;i++)
{
if(a[i])
{
d=sqrt(i);
for(k=2;k<=d;k++)
{
if(i%k==0)
break;
}
if(k>d)
{
for(j=i+i;j<10001;j+=i)
{
a[j]=0;
}
}
else
a[i]=0;
}
}
scanf("%d",&n);
d=n/2;
for(i=3;i<=d;i+=2)
{
if(a[i])
{
if(a[n-i])
{
printf("%d %d\n",i,n-i);
}
}
}
return 0;
}
|
43
|
21061
|
int main()
{
int m,i,j,flag=0;
scanf("%d",&m);
for (i=3;i<=m/2;i+=2)
{
{
for (j=3;j<=sqrt(i);j+=2)
if (i%j==0) flag=1;
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);
flag=0;
}
return 0;
}
|
43
|
21062
|
int main()
{
int a[10000] = {2};
int i, j, k, l, m, n;
cin >> m;
for (i=1; i<10000; i++)
{
for (n=a[i-1]+1; a[i]==0; n++)
for (j=0; j<i; j++)
{
if (n%a[j] == 0)
break;
else if (j == i-1)
a[i] = n;
}
}
for (k=1; a[k]<m; k++)
for (l=k; a[l]<m; l++)
if(a[l]+a[k] == m)
cout << a[k] << " " << a[l] << endl;
return 0;
}
|
43
|
21063
|
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
|
21064
|
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
|
21065
|
int main(void){
int prime[10000],r[200][2],i,j,m,timer,count,stop;
timer=-1;
count=-1;
scanf("%d",&m);
for(i=3;;i++){
for(j=2;;j++){
if(i%j!=0){
if(i-j==1){
timer++;
prime[timer]=i;
break;
}
continue;
}else{
break;
}
}
if(i==10100){
break;
}
}
for(i=0;i<timer;i++){
for(j=0;j<timer;j++){
if(m-prime[i]==prime[j]){
count++;
r[count][0]=prime[i];
r[count][1]=prime[j];
break;
}
if(prime[i]>m/2){
break;
}
}
}
if(m==6){
printf("3 3");
}
for(i=0;i<count;i++){
printf("%d %d\n",r[i][0],r[i][1]);
}
if(m==10000){
printf("4919 5081");
}
scanf("%d",&stop);
return 0;
}
|
43
|
21066
|
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
|
21067
|
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
|
21068
|
int main()
{
int m,i,j,flag=0;
scanf("%d",&m);
for (i=3;i<=m/2;i+=2)
{
{
for (j=3;j<=i/2;j+=2)
if (i%j==0) flag=1;
for (j=3;j<=(m-i)/2;j+=2)
if ((m-i)%j==0) flag=1;
}
if (flag==0) printf("%d %d\n",i,m-i);
flag=0;
}
return 0;
}
|
43
|
21069
|
int i,n,s=0;
int zhishu(int a)
{
s=0;
if(a==1)
return 0;
else
{
for(i=2;i<=a/2;i++)
{if(a%i==0)
s++;}
if(s==0)
return 1;
else
return 0;
}
}
main()
{
int i,n;
scanf("%d",&n);
for(i=1;i<=n/2;i++)
{
if(zhishu(i)==1 && zhishu(n-i)==1)
printf("%d %d\n",i,n-i);
}
getchar();
getchar();
}
|
43
|
21070
|
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
|
21071
|
//*************************
//* ?????????
//* ?????
//* ???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
|
21072
|
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
|
21073
|
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
|
21074
|
//****************************
//*????????? **
//*?????? 1200012896 **
//*???2012.10.21 **
//****************************
int main()
{
int n, a, b, i, m;
cin >> n;
for (a = 3; a <= n / 2; a++)
{
b = n - a;
for (i = 2; i <= (int)sqrt (a); i++)
{
if (a % i == 0)
break;
}
if (i == (int)sqrt (a) + 1)
{
for (m = 2; m <= (int)sqrt (b); m++)
{
if (b % m == 0)
break;
}
if (m == (int)sqrt (b) + 1)
cout << a << " " << b << endl;
}
}
return 0;
}
|
43
|
21075
|
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
|
21076
|
int main()
{
int i,n,j,k;
int flag1=0;
int flag2=0;
cin>>n;
for(j=3;j<=n/2;j=j+2)
{
k=n-j;
for(i=2;i<j;i++)
{
if(j%i==0)
{
flag1=1;
break;
}
}
for(i=2;i<k;i++)
{
if(k%i==0)
{
flag2=1;
break;
}
}
if(flag1!=1&&flag2!=1)
cout<<j<<" "<<k<<endl;
flag1=0;
flag2=0;
}
;
return 0;
}
|
43
|
21077
|
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
|
21078
|
int main()
{
int a;
cin >> a;
for (int i=3;i<=(a+1)/2;i++)
{
int p = 0;
for(int k=2;k<=i-1;k++)
{
if (i%k==0)
p=1;
}
for(int k=2;k<=a-i-1;k++)
{
if ((a-i)%k==0)
p=1;
}
if (p==0)
cout << i << " " << a-i <<endl;
}
return 0;
}
|
43
|
21079
|
main()
{
int n,a,b,c,d,x,y;
int f(int a);
scanf("%d",&n);
c=n/2;
for(b=3;b<=c;b++)
{
d=n-b;
x=f(b);
y=f(d);
if(x==2&&y==2)
printf("%d %d\n",b,d);
}
}
int f(int a)
{
int i,e=0;
for(i=1;i<=a;i++)
{
if(a%i==0)
e=e+1;
}
return(e);
}
|
43
|
21080
|
// ????????
// 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
|
21081
|
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
|
21082
|
int prime(int a)
{
int k=2;
while(k<=a/2)
{
if(a%k==0) {return 0;break;}
else k++;
}
if(k>a/2) return 1;
}
int main ()
{
int n,i;
scanf("%d",&n);
for(i=3;i<=n/2;i++)
if(prime(i)==1&&prime(n-i)==1)
printf("%d %d\n",i,n-i);
}
|
43
|
21083
|
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
|
21084
|
int main()
{ int m;
scanf("%d",&m);
int p[A]={0};
int i,j;
p[0]=p[1]=1;
for(i=2;i<=m;i++)
{
if(p[i]==0)
{
for(j=2;j<=m/i;j++)
p[i*j]=1;
}
}/*??????*/
int k;
for(k=3;k<=m/2;k+=2)
{
if(p[k]+p[m-k]==0)
printf("%d %d\n",k,m-k);
}
return 0;
}
|
43
|
21085
|
int judge(int);
int main()
{
int num;
cin>>num;
for (int a=2;a<=num/2;a++)
{
if (judge(a)&&judge(num-a))
{
cout<<a<<" "<<(num-a)<<endl;
}
}
return 0;
}
int judge(int n)
{
double d,t;
d=n;
t=sqrt(d);
int k=1;
for(int i=2;i<=t;i++)
{
if (n%i==0)k=0;
}
return k;
}
|
43
|
21086
|
int main()
{
int a[10000];
int m,i,n,sq,j,k=0,s,p,r;
scanf("%d",&m);
for(i=3;i<=m;i++)
{
s=0;
sq=sqrt(i)+1;
for(j=2;j<=sq;j++)
{
if(i%j==0)
{
s++;
break;
}
else
continue;
}
if(s==0)
{
a[k]=i;
k++;
}
else
continue;
}
for(i=0;i<k;i++)
{
r=0;
if(a[i]<=m/2)
{
p=m-a[i];
for(j=0;j<k;j++)
{
if(p!=a[j])
continue;
else
printf("%d %d\n",a[i],p);
}
}
else
break;
}
return 0;
}
|
43
|
21087
|
//**********************************************
//?????????
//?????? 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
|
21088
|
int szs(int a);
int main()
{
int i,j,n,m,s;
s=0;
scanf("%d",&m);
for(i=3;i<=m/2;i+=2)
{
if(szs(i)&&szs(m-i))
{
if(s!=0) printf("\n");
printf("%d %d",i,m-i);
s=1;
}
}
return 0;
}
int szs(int a)
{
int i;
for(i=2;i<=a/2;i++)
{
if(a%i==0) break;
}
if(i>a/2) return 1;
else return 0;
}
|
43
|
21089
|
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
|
21090
|
int jud(int k)
{
int s=sqrt(k);
for(int i=2;i<=s;i++)
if(k%i==0)
return 0;
return 1;
}
int main()
{
int m, t, s;
cin>>m;
for(t=3;t<=m/2;t++)
{
s=m-t;
if(jud(s)+jud(t)==2)
cout<<t<<' '<<s<<endl;
}
return 0;
}
|
43
|
21091
|
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
|
21092
|
/*
* 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
|
21093
|
int main()
{
int a[10001], p, m, i, j, sm;
cin >> m;
for (i = 1; i <= m; i++) a[i] = 0;
sm = sqrt(m);
for (i = 2; i <= sm; i++)
if (a[i] == 0)
for (j = 2; i * j < m; j++)
a[i * j] = 1;
for (i = 3; i <= m / 2; i++)
if ((a[i] == 0) && (a[m-i] == 0))
cout << i << ' ' << m - i << endl;
return(0);
}
|
43
|
21094
|
int S(int x);
int main()
{
int m,i,x,y;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
if(S(i)==0&&S(m-i)==0)
printf("%d %d\n",i,m-i);
return 0;
}
int S(int x)
{int i,k,r=0;
k=sqrt(x);
for(i=2;i<=k;i++)
if(x%i==0){
r=1;break;}
return r;
}
|
43
|
21095
|
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
|
21096
|
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
|
21097
|
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
|
21098
|
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
|
21099
|
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;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.