label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
43 | 21200 |
int main()
{
int m; //m???6???
cin >> m; //??m
int n1 = 0, n2 = 0; //n1,n2????????????m;
for (n1 = 3; n1 <= (m / 2); n1+=2)
{
int k = 0; //?? k???n1??????????n1?????
for (k = 2; k <= sqrt(n1); k++)
{
if (n1 % k == 0) //????k????????????????
break;
}
//if (k == (int (sqrt(n1) + 1))) //??k???int sqrt(n1) + 1??????????? ???????
if (k > sqrt(n1))
n2 = m - n1;
else
continue;
for (k = 2; k <= sqrt(n2); k++)
{
if (n2 % k == 0) //????k????????????????
break;
}
//if (k == (int (sqrt(n2) + 1))) //??k???int sqrt(n1) + 1??????????? ???????
if (k > sqrt(n2))
cout << n1 << " " << n2 << endl; //?????????
}
return 0;
}
|
43 | 21201 | 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 | 21202 | 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 | 21203 | int main()
{
int number,i,j,f,g,s;
int k=1;
scanf("%d",&number);
int num[20000];
for(i=2;i<number;i++)
{ s=i-1;
for(j=(i-1);j>0;j--)
{
if(i%j!=0)
s--;}
if(s==1)
{num[k]=i;
k++;}}
for(f=k-1;f>0;f--)
{
for(g=1;g<=f;g++)
{if(num[f]+num[g]==number)
printf("%d %d\n",num[g],num[f]);}}
getchar();
getchar();
return 0;
} |
43 | 21204 | main()
{ int a,b,d=3,e,h,y,i,x,z;
float c,f,g;
scanf("%d\n",&a);
b=a/2;
while(d<=b)
{ e=a-d;
f=sqrt(d);
g=sqrt(e);
h=2;
i=2;
y=1;
z=1;
while(h<=f)
{ if(d%h==0)
{ y=0;break;}
else h++;
}
while(i<=g)
{ if(e%i==0)
{z=0;break;}
else i++;
}
if(y==1&&z==1)
printf("%d %d\n",d,e);
d=d+2;
}
} |
43 | 21205 | int IsPrime(int a)
{
int i,flag=0;
for (i = 2; i <a/2; i++)
{
if (a%i == 0){ flag = 1; continue; }
}
if (flag == 0)return 1;
else return 0;
}
int main()
{
int b,i;
long m;
scanf("%ld", &m);
for (b = 3; b <= m /2;b+=2)
if (IsPrime(m-b) == 1 && IsPrime(b) == 1)
printf("%d %d\n",b,m-b);
return 0;
} |
43 | 21206 |
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 | 21207 | 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 | 21208 | int ss(int a);
main()
{
int m;
scanf("%d",&m);
int a,b;
int i,j;
for(a=3;a<=m/2;a++)
{
i=ss(a);
if(i==0)
{
b=m-a;
j=ss(b);
if(j==0)
printf("%d %d\n",a,b);
}
}
return 0;
}
int ss(int a)
{
int i=2,k=0;
for(i=2;i<=(a/2);i++)
if((a%i)==0)
k++;
return k;
}
|
43 | 21209 | int main()
{
int n,i,j,a,flag1 = 0, flag2=0;
scanf("%d",&n);
for(i=3;i<=n/2;i++)
{flag1 = 0;
flag2=0;
a=i;
for(j=2;j<=i/2;j++)
{
if(i%j==0)
flag1=1;
}
if(flag1 ==0)
{
i=n-i;
for(j=2;j<=i/2;j++)
{
if(i%j==0)
flag2=1;
}
if(flag1==0 && flag2==0)
printf("%d %d\n",n-i,i);
}
i=a;
}
return 0;
}
|
43 | 21210 | //??????
int main()
{
int n, a, b, sureA = 0, sureB = 0;
cin>>n;
for(a = 3 ; a <= n/2 ; a += 2)
{
b = n - a;
if(a == 3)
sureA = 1;
if(b == 3)
sureB = 1;
for(int i1 = 2 ; i1 <= sqrt(a) ; i1++)
{
if(a % i1 == 0)
break;
if(sqrt(a) - i1 < 1)
sureA = 1;
}
for(int i2 = 2 ; i2 <= sqrt(b) ; i2++)
{
if(b % i2 == 0)
break;
if(sqrt(b) - i2 < 1)
sureB = 1;
}
if(sureA == 1 && sureB == 1)
cout<<a<<" "<<b<<endl;
sureA = 0;
sureB = 0;
}
return 0;
}
|
43 | 21211 | int ss[70000];
void ps()
{
int i,j;
for(i=2;i<70000;i++)
if(!ss[i])
for(j=i*2;j<70000;j=j+i)
ss[j]=1;
}
int main()
{
int n,i;
memset(ss,0,sizeof(ss));
ps();
cin>>n;
for(i=3;i<=n/2;i++)
if(!ss[i]&&!ss[n-i])
cout<<i<<' '<<n-i<<endl;
}
|
43 | 21212 | 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 | 21213 | 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 | 21214 | 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 | 21215 |
int su(int x);
int main(){
int m,n,i;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
if(su(i)==1&&su(m-i)==1)
printf("%d %d\n",i,m-i);
}
return 0;
}
int su(int x){
int j;
for(j=2;j<=x/2;j++)
{
if(x%j==0)
return 0;
}
return 1;
} |
43 | 21216 | int f(int n)
{
int m=0;
int i=2;
for(;i<n;)
{
if(n%i==0)
break;
i++;
}
{
if(i==n)
m=1;
}
return m;
}
main()
{
int n,k;
scanf("%d",&n);
for (int i=3;i<=(n/2);i++)
{ k=n-i;
{if (f(i)==1&&f(k)==1)
printf("%d %d\n",i,k);
}
}
getchar();
getchar();
return 0;
}
|
43 | 21217 | int main(){
int n,i,j;
int k;
cin>>n;
for(i=3;i<=n/2;i+=2){
//cout<<i<<" "<<j<<endl;
j = n-i;
int flag;
for(k=2;k<i;k++)
{
if(i%k!=0)
flag=0;
if(i%k==0){
flag=1;
break;
}
}
if(flag == 1)continue;
for(k=2;k<j;k++)
{
if(j%k!=0)
flag=0;
if(j%k==0){
flag=1;
break;
}
}
if(flag == 0)
cout<<i<<" "<<j<<endl;
}
return 0;
}
|
43 | 21218 | 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 | 21219 | int sushu(int x)
{
int i,k;
k=sqrt(x);
for(i=2;i<=k;i++){
if(x%i==0)break;}
if(i>k) return 1;
else return 0;
}
int main()
{
int m,i,a,b;
scanf("%d",&m);
for(i=1;i<(m+2)/4;i++){
a=2*i+1;
b=m-a;
if(sushu(a)==1){
if(sushu(b)==1)printf("%d %d\n",a,b);}
}
return 0;
}
|
43 | 21220 | 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 | 21221 | 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 | 21222 | 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 | 21223 | 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 | 21224 | 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 | 21225 |
int main()
{
int a[5001]={0};
int m,i,n,j;
int q,k;
q=0;k=0;
for(i=2;i<=10000;i++)
{
for(j=1;j<=i/2;j++)
{
if(i%j==0) q=q+1;
}
if(q==1)
{
a[k]=i;
k=k+1;
}
q=0;
}
scanf("%d",&m);
n=k-1;
for(i=0;i<=n-1;i++)
{
for(j=i;j<=n-1;j++)
{
if(a[i]+a[j]==m)
{
printf("%d %d",a[i],a[j]);
printf("\n");
}
}
}
return 0;
} |
43 | 21226 | int fun(int x);
int main()
{
int a,i;
scanf("%d",&a);
for(i=3;i<=a/2;i+=2)
{
if(fun(i)==1&&fun(a-i)==1)
printf("%d %d\n",i,a-i);
}
return 0;
}
int fun(int x)
{
int i;
for(i = 2; i <= (int)sqrt(x); i++)
if(x % i == 0)
return 0;
return 1;
}
|
43 | 21227 | int sushu(int a)
{
int i;
for(i = 2;i <= sqrt(a)+1;i ++)
{if(a%i == 0) {a = 1; break;}}
return a;
}
int main()
{
int n,s1,s2,j,k;
scanf("%d",&n);
for(j = 2;j <= n/2; j++){
s1=sushu(j);
if(s1 != 1){
k=n-s1;
s2=sushu(k);
if(s2 != 1)
printf("%d %d\n",s1,s2);
}
}
return 0;
} |
43 | 21228 | int main()
{
int i,j,a,b,m;
int x[10000]={0},y[10000];
scanf("%d",&m);
for(a=2;a<=m;a++)
{
for(b=2;b<=sqrt(a);b++)
if(a%b==0)
{
x[a-1]=1;
y[a-1]=0;
}
if(x[a-1]==0)y[a-1]=a;
}
for(i=1;i<=m;i++)
for(j=1;j<=m;j++)
if(m-y[i]==y[j]&&y[i]<=y[j])printf("%d %d\n",y[i],y[j]);
return 0;
}
|
43 | 21229 | //****************************
//**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 | 21230 |
int checkprime(int x)
{
int j;
int count=0;
if (x==1) count=1;
if (x==2||x==3) count=0;
if (x>=4){
for (j=2;j<=sqrt(x);j++)
{
if (x%j==0)
count++;
}}
return count;
}
int main()
{
int i;
int n;
cin>>n;
for (i=1;i<=n/2;i++)
{
if (checkprime(i)==0&&checkprime(n-i)==0)
cout<<i<<" "<<n-i<<endl;
}
return 0;
}
|
43 | 21231 | 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 | 21232 | int main()
{
int n,p,i,j,a;
scanf("%d",&n);
for(j=3;j<=n/2;j+=2)
{
a=0;
for(i=3;i<=(int)sqrt(j);i+=2)
if(j%i==0)
{a=1;break;}
for(i=3;i<=(int)sqrt(n-j);i+=2)
if((n-j)%i==0)
{a=1;break;}
if(a==0)
printf("%d %d\n",j,n-j);
}
} |
43 | 21233 | 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 | 21234 | 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 | 21235 | int prime(int n)
{
int i,isprime=1;
for(i=2;i*i<=n;i++)
{
if(n%i==0)
{
isprime=0;
break;
}
}
return isprime;
}
main()
{
int n,i,a,b;
scanf("%d",&n);
for(i=3;i<=n/2;i+=2)
{
a=prime(i);
b=prime(n-i);
if(a==1&&b==1)
printf("%d %d\n",i,n-i);
}
getchar();
getchar();
}
|
43 | 21236 | 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 | 21237 | 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 | 21238 | 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 | 21239 | int main()
{
int i,m,j,sum;
cin >> m;
for(i=3;i<=m/2;i++)
{
sum=1;
for(j=2;j<=(int)sqrt(i);j++)
{
if(i%j==0)
{
sum=sum*0;
}
}
if(sum==1)
{
for(j=2;j<=(int)sqrt(m-i);j++)
{
if((m-i)%j==0)
{
sum=sum*0;
}
}
}
if(sum==1)
cout << i << " " << m-i << endl;
}
return 0;
} |
43 | 21240 | int pd(int x)
{
int z=0,i;
if(x%2!=0)
{for(i=3;i<=sqrt(x);i+=2)
{if(x%i==0)
break;
}
if(i>sqrt(x))
z=1;}
return z;
}
int main()
{
int n,a;
scanf("%d",&n);
for(a=3;a<=n/2;a+=2)
{
if(pd(a)==1&&pd(n-a)==1)
printf("%d %d\n\n",a,n-a);
}
return 0;
}
|
43 | 21241 | 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 | 21242 |
int sushu(int x){
if(x==1) return 0;
if(x==2||x==3) return 1;
int m=sqrt(x);
int i;
for(i=2;i<=m;i++){
if(x%i==0) return 0;
}
if(i==m+1) return 1;
}
int main(int argc, char* argv[])
{
int m;
scanf("%d",&m);
int i;
for(i=3;i<=m/2;i+=2){
if(sushu(i)&&sushu(m-i)) printf("%d %d\n",i,m-i);}
return 0;
}
|
43 | 21243 | inline int prime(int a);//????prime
int main()//?????
{
int m,b,c;//??????m??????b??????c
cin >>m;//????m
for(b=3;b<=m/2;b++)//?b?3?m/2??
{
c=m-b;//?m-b???c
if(prime(b)==1&&prime(c)==1)//??b?c???prime?????1
cout <<b<<" "<<c<<endl;//???b c??
}
return 0;//????????????????
}
inline int prime(int a)//??prime?????
{
int i;//??????i
for(i=2;i<a;i++)//?i?2?a-1??
{
if(a%i==0) break;//??a?i?? ????
}
if(i==a)//??i==a
return 1;//????1?
else return 0;//??????0?
} |
43 | 21244 | 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 | 21245 | 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 | 21246 | int main()
{
int m,a,b,i;
scanf("%d",&m);
for(a=3;a<=m/2;a+=2)
{
for(i=3;i<=a;i+=2)
if(a%i==0)break;
if(i<a)continue;
else
{
b=m-a;
for(i=3;i<=b;i+=2)
if(b%i==0)break;
if(i==b)
printf("%d %d\n",a,b);
}
}
return 0;
} |
43 | 21247 | //************************************
//*?????? 1300012809 **
//*???2013.10.24 **
//*??????????? **
//************************************
int main ()
{
int m,i,a,b,c,j,d,f,k,panduan;
cin >> m ;
c=m/2;
for (a=3;a<=c;a=a+2) //?????????3??????+2
{
b=m-a; //???3?m????????????????
d=sqrt(b);
panduan=0;
for (j=2;j<=d;j++) //??????????
{
if (b%j==0) panduan=1;
}
f=sqrt(a);
for (k=2;k<=f;k++) //???????????
{
if (a%k==0) panduan=1;
}
if (panduan==0) cout << a << " " << b << endl; //?????????
}
return 0 ;
} |
43 | 21248 | void main()
{
int su(int m);
int n,i;
scanf("%d",&n);
for(i=3;i<=n/2;i++)
{
if(su(i)&&su(n-i))
{
printf("%d %d\n",i,n-i);
}
}
}
int su(int m)
{
int j;
for(j=2;j<=sqrt(m);j++)
if(m%j==0)break;
if(j>sqrt(m))
return 1;
else
return 0;
}
|
43 | 21249 | 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 | 21250 | 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 | 21251 | 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 | 21252 | int main()
{
int m,i,o,k,l;
cin>>m;
for(i=2;i<=(m/2);i++)
{
o=m-i;
for(k=2;k<i;k++)
{
if (i%k==0) goto end;
}
for(l=2;l<o;l++)
{
if (o%l==0) goto end;
}
cout<<i<<" "<<o<<endl;
end: continue;
}
return 0;
}
|
43 | 21253 | int main()
{
int m;
cin >> m;
int n1, n2, i, j, p1, p2;
double a, b;
for(n1 = 3; n1 <= m / 2; n1 += 2)
{
n2 = m - n1;
a = sqrt(n1);
b = sqrt(n2);
//cout << a << b <<endl;
for(i = 2; i <= a; i++)
{
if(n1 % i == 0)
break;
}
if(i > a )
{
p1 = n1;
}
else
{
continue;
}
for(j = 2; j <= b; j++)
{
if(n2 % j == 0)
break;
}
if(j > b )
{
p2 = n2;
}
else
{
continue;
}
cout << p1 << " " << p2 << endl;
}
return 0;
} |
43 | 21254 | int prime(int a);
int main()
{
int i=3,m,d;
cin>>m;
for(i=3;i<=m/2;i+=2)
{
if(prime(i)!=0)
{
d=m-i;
if(prime(d)!=0)
{
cout<<i<<" "<<d<<endl;
}
}
}
return 0;
}
int prime(int a)
{
int e=1,i=3;
if(a<7)
a+=8;
else
if(a==7)
return 1;
for(i=3;i<=sqrt(a*1.0);i+=2)
{
e*=a%i;
if(e!=0)
e=1;
}
if(e!=0)
return 1;
else
return 0;
} |
43 | 21255 |
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 | 21256 | int main ()
{
int m = 0; //??????m
int t1 = 0; //??i???????
int t2 = 0; //??i0???????
int t = 0; //t1?t2???????i?i0???????
int i0 = 0;
cin >> m;
int f ( int x ); //?????????????f
for ( int i = 3; i <= m/2; i ++ ) //???????????
{
t1 = f ( i );
i0 = m - i;
t2 = f ( i0 );
t = t1 + t2;
if ( t == 2 ) cout << i << " " << i0 << endl;
i = i + 1;
}
return 0;
}
int f ( int x ) //???????????f
{
int z = 0; //????????????????
if ( x == 3 ) z = 1;
else
{
int k = 0;
for ( int j = 3; j < x; j ++ )
{
int y = 0;
y = x % j;
if ( y == 0 ) k = k + 1;
}
if ( k == 0 ) z = 1;
else
z = 0;
}
return z;
} |
43 | 21257 | int main()
{
int m,p[1229],i,j,a,x=0,k,l;
for(i=3;i<10000;i++)
{
a=sqrt(i);
for(j=2;j<=a+1;j++)
{
if(i%j==0) break;
if(j==a+1)
{
p[x]=i;
x=x+1;
}
}
}
scanf("%d",&m);
for(k=0;p[k]<=m/2;k++)
{
for(l=k;p[k]+p[l]<=m;l++)
{
if(p[k]+p[l]==m)
printf("%d %d\n",p[k],p[l]);
}
}
return 0;
} |
43 | 21258 | 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 | 21259 | void main()
{
int m,i,j,t,s,n;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
t=1;s=1,n=m-i;
for(j=2;j<=i/2;j++)
if(i%j==0)
{
t=0;
break;
}
for(j=2;j<=n/2;j++)
if(n%j==0)
{
s=0;
break;
}
if(t&&s)printf("%d %d\n",i,n);
}
}
|
43 | 21260 | int main()
{
int i,j,n,s,k,m;
scanf("%d",&n);
for(i=3;i<n/2+1;i+=2)
{
s=0;
for(m=2;m<i;m++)
{
if(i%m==0)
{
s=1;
break;
}
}
if(s==1)
{
continue;
}
j=n-i;
for(k=2;k<j;k++)
{
s=0;
if(j%k==0)
{
s=2;
break;
}
}
if(s==2)
{
continue;
}
if(i+j==n)
{
printf("%d %d\n",i,j);
}
}
return 0;
}
|
43 | 21261 | 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 | 21262 | //********************************
//*????????? **
//*??? ??? 1300012745 **
//*???2013.10.25 **
//********************************
int main()
{
int m, a, b, i, n=0;
cin>>m;
for (a=3;a <= m / 2;a+=2)
{
for (i=3;i <= sqrt(a);i++)
{
if (a % i==0)
n++;
}
if (n==0)
{
b=m - a;
for (i=3;i <= sqrt(b);i++)
{
if (b % i==0)
n++;
}
if (n==0)
cout << a << " " << b <<endl;
}
n=0; //?n????????????
}
return 0;
}
|
43 | 21263 | 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 | 21264 | int sushu[168]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997};
int main()
{
int i,j,m;
cin>>m;
for(i=0;i<168;++i)
for(j=i;j<168;++j)
{
if(m==sushu[i]+sushu[j]) cout<<sushu[i]<<" "<<sushu[j]<<endl;
}
return 0;
}
|
43 | 21265 | /********************************************
*@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 | 21266 | int main()
{
int n,i,j,k=1,counter=0;
int a[50000],s[50000]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{a[i]=i+1;}
s[0]=2;
for(i=2;i<n;i++)//????????
{
for(j=2;j<i+1;j++)
{
if(j==i)
{
if(a[i]%2==1)
s[k]=a[i];
k++;
}
if(a[i]%j==0) break;
}
}
for(i=0;i<k-1;i++)
{
for(j=i;j<k;j++)
{
if(s[i]+s[j]==n)
printf("%d %d\n",s[i],s[j]);
}
}
}
|
43 | 21267 | //********************************************************
//* ???: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 | 21268 | int main()
{
int i,j,k=2,t,su=1,put,temp,a[20000];
a[0]=2;a[1]=3;
for(i=4;i<10000;i++)
{
su=1;
for(j=2;j*j<=i;j++)
{
if(i%j==0)su=0;
}
if(su==1){a[k]=i;k++;}
}
scanf("%d",&put);
for(i=1;i<2000;i++)
{
temp=put-a[i];
for(t=i;t<2000;t++)
{
if(a[t]==temp)
{
printf("%d %d\n",a[i],a[t]);
}
if(a[t]>temp)break;
}
}
return 0;
}
|
43 | 21269 | void main()
{
int m,q,r,i,j,a,b;
scanf("%d",&m);
for (q=3;q<=m/2;q++)
{r=m-q;
a=0;
b=0;
for (i=2;i<=sqrt(q);i++)
if(q%i==0) a=1;
for (j=2;j<=sqrt(r);j++)
if(r%j==0) b=1;
if(a==0&&b==0) printf("%d %d\n",q,r);
}
} |
43 | 21270 | int main()
{
int n,i,j,k,a;
double b;
scanf("%d",&n);
for(i=3;i<=2*n-1;i=i+2)
{
b=i;
a=(int)sqrt(b)+1;
for(k=2;k<a;k++)
{
if(i%k==0)
break;
}
if(a==k)
for(j=i;j<=n-i;j=j+2)
{
b=j;
a=(int)sqrt(b)+1;
for(k=2;k<a;k++)
{
if(j%k==0)
break;
}
if(a==k)
if(n==i+j)
printf("%d %d\n",i,j);
}
}
return 0;
}
|
43 | 21271 | int main(){ int m,i,j,k,c=0;scanf("%d",&m);
for(i=3;2*i<=m;i++){
for(j=2;j*j<=i;j++)
{if(i%j==0){c=1;break;}
}for(j=2;j*j<=m-i;j++){if((m-i)%j==0){c=1;break;}}
k=m-i;if(c==0)printf("%d %d\n",i,k);c=0;
}return 0;} |
43 | 21272 |
int main(int argc, char* argv[])
{
int m,i,j,p,q;
scanf("%d",&m);
for(j=3;j<=m/2;j++){
p=0;
for(i=2;i<j;i++){if(j%i!=0)p=p+1;}
if(p==j-2){q=0;
for(i=2;i<m-j;i++){if((m-j)%i!=0)q=q+1;}
if(q==m-j-2)
printf("%d %d\n",j,m-j);}}
return 0;
}
|
43 | 21273 | int main()
{
int zhishu(int x);
int m,i,k,n,p;
scanf("%d",&m);
for(i=2;i<=m/2;i++)
{
n=m-i;
k=zhishu(i);
p=zhishu(n);
if(p==1&&k==1)
printf("%d %d\n",i,n);
}
return 0;
}
int zhishu(int x)
{
int i,j,k;
if(x==2)
k=1;
else
for(i=2;i<x;i++)
{
j=x%i;
if(j==0)
{
k=0;
break;
}
else
if(i==x-1)
k=1;
}
return k;
}
|
43 | 21274 | 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 | 21275 | int main()
{
int m,i,j,k;
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2){
for(j=3;j<=i&&i%j!=0;j=j+2);
for(k=3;k<=m-i&&(m-i)%k!=0;k=k+2);
if(j==i&&k==m-i)
printf("%d %d\n",j,k);
}
return 0;
} |
43 | 21276 | 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 | 21277 | //********************************
//*???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 | 21278 | int main()
{
int m,n,i,j,x,y,p,q;
scanf("%d",&m);
n=m/2;
i=3;
while(i<=n)
{
x=sqrt(i);
for(p=3;p<=x;p++)
{
if(i%p==0) break;
}
if(p>=x+1)
{j=m-i;
y=sqrt(j);
for(q=3;q<=y;q++)
{
if(j%q==0) break;
}
if(q>=y+1)
printf("\n%d %d\n",i,j);
}
i+=2;
}
return 0;
} |
43 | 21279 |
int main()
{
int n;
cin>>n;
int a,b,c,d;
for(a=3;a<=n/2;a=a+2)
{
for(c=2;c<=sqrt((double) a);c++) if(a%c==0) break;
for(d=2;d<=sqrt((double)n-a);d++) if((n-a)%d==0) break;
if(c>sqrt((double)a)&&d>sqrt((double)n-a)) cout<<a<<" "<<n-a<<endl;
}
return 0;
} |
43 | 21280 |
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 | 21281 | int main()
{
int n,a,k,m,i,j,x=0,y=0;
int prime1,prime2;
cin>>n;
for (i=3;i<=n/2;i=i+2)
{
for (j=1;j<=i;j=j+2)
{
if (i%j==0)
{
x++;
}
}
if (x==2) prime1=1;
else prime1=0;
x=0;
if (prime1==1)
{
a=n-i;
for (m=1;m<=a;m=m+2)
{
if (a%m==0)
{
y++;
}
}
if (y==2) prime2=1;
else prime2=0;
y=0;
if (prime2==1)
cout<<i<<" "<<a<<endl;
}
}
return 0;
}
|
43 | 21282 | int main()
{int i, j, k= 0,l, a[1228], m;
cin>> m;
for(i= 3; i<= 9997; i= i+ 2)
{l=0;
for(j= 3; j<= sqrt(i); j++)
{if(i%j== 0)
l++;}
if(l==0)
a[k++]= i;
}
for(i= 0; a[i]<= m/2; i++)
{for(j= i; a[j]<= m- a[i]; j++)
if(a[i]+ a[j]== m)
cout<< a[i]<< " "<< a[j]<< endl;
}
return 0;
} |
43 | 21283 | int main()
{
int m,a[20000],i,j,sign=0;
for(i=1;i<=20000;i++)
a[i]=-10000;
scanf("%d",&m);
for(i=2;i<=m;i++)
{
{
for(j=2;j<i;j++)
{
if(i%j==0)
sign+=1;
}
}
if(sign>0)
sign=0;
else a[i]=i;
}
for(i=2;i<m;i++)
for(j=i;j<m;j++)
if(a[j]+a[i]==m)
printf("%d %d\n",i,j);
return 0;
}
|
43 | 21284 | int main()
{
int m,a,b,i;
scanf("%d",&m);
for(a=2;a<=(m/2);a++)
{
b=m-a;
for(i=2;i<a;i++)
{if(a%i!=0)
continue;
else
goto a;}
for(i=2;i<b;i++)
{
if(b%i!=0)
continue;
else
goto a;
}
printf("%d %d\n",a,b);
a:continue;
}
return 0;
}
|
43 | 21285 | 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 | 21286 | 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 | 21287 |
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 | 21288 | 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 | 21289 | int main()
{
int m,i=3,i1=2,i2=2,x,y;
double k ,l;
scanf("%d",&m);
for(;i<=m/2;i=i+2)
{
k=sqrtf(i);
for(i1=2;i1<=k;i1++)
{
if(i%i1==0)
{
x=i1;
break;
}
}
if(i%x==0)
continue;
l=sqrtf(m-i);
for(i2=2;i2<=l;i2++)
{
if((m-i)%i2==0)
{
y=i2;
break;
}
}
if((m-i)%y==0)
continue;
printf("%d %d\n",i,m-i);
}
} |
43 | 21290 | 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 | 21291 | int shisushu(int n);
int main(){
int m,n;
scanf("%d",&m);
for(n=2;n<=m/2;n++){
if(shisushu(n)==1){
if(shisushu(m-n)==1){
printf("%d %d\n",n,m-n);
}
}
}
return 0;
}
int shisushu(int n){
int i;
int result=1;
for(i=2;i<=n/2;i++){
if(n%i==0){
result=0;
break;
}
}
return result;
} |
43 | 21292 | 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 | 21293 | 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 | 21294 | 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 | 21295 | 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 | 21296 | int JudgePrime(int n);
int JudgeOdd(int n);
void f(int n);
int main()
{
int num;
cin>>num;
f(num);
return 0;
}
void f(int n)
{
int i;
for(i=2;i<=n/2;i++)
{
if(JudgePrime(i)==1
&& JudgeOdd(i)==1
&& JudgePrime(n-i)==1
&& JudgeOdd(n-i)==1)
cout<<i<<' '<<n-i<<endl;
}
}
int JudgePrime(int n)
{
int k,i;
k=sqrt(n);
if(n==2) return 1;
else
{
for(i=2;i<=k;i++)
{
if(n%i==0) return 0;
}
}
return 1;
}
int JudgeOdd(int n)
{
if(n%2==1) return 1;
else return 0;
} |
43 | 21297 | 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 | 21298 |
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 | 21299 | int main()
{
int n,i,j,p;
scanf("%d",&n);
char a[10001]={0};
i=2;
while(i<n)
{
for(j=i+1;j<n;j=j+1)
if (j%i==0) a[j]=1;
i++;
for(;i<n;i=i+1)
if (a[i]==0) break;
}
p=0;
for(i=3;i<=(n/2);i=i+1)
if ((a[i]==0)&&(a[n-i]==0))
{
if (p) printf("\n");
p=p+1;
printf("%d %d",i,n-i);
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.