label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
43 | 21100 | int main()
{
int m,a,b,A,B,i;
scanf("%d",&m);
a=3;
for(a=3;a<=m/2;a=a+2)
{
b=a;
for(b=a;b<=m;b=b+2)
{
if(a+b==m)
{
A=1;
B=1;
i=2;
for(i=2;i<a;i++)
{
if(a%i==0)
A=-1;
}
i=2;
for(i=2;i<b;i++)
{
if(b%i==0)
B=-1;
}
if(A==1&&B==1)
printf("%d %d\n",a,b);
}
}
}
return 0;
}
|
43 | 21101 | int main()
{
int n,i,j,m=0,good,count=0;
int b[100];
scanf("%d",&n);
for(i=3;i<n;i++)
{
good=0;
for(j=2;j<i;j++)
{
if(i%j==0)
{
good=1;
}
}
if(good==0)
{
b[m]=i;
m++;
count++;
}
}
for(i=0;i<count;i++)
{
for(j=0;j<count;j++)
{
if(b[i]+b[j]==n&&b[i]<=b[j])
{
printf("%d %d\n",b[i],b[j]);
}
}
}
return 0;
}
|
43 | 21102 | int issushu(int n);
int a[1000],b[1000];
int main()
{
int n,j,q,i,count=0;
scanf("%d",&n);
for(i=2;i<=(n/2);i++)
{
j=issushu(i);
q=issushu(n-i);
if((j==1)&&(q==1))
{
a[count]=i;
b[count]=n-i;
count++;
}
}
if(count!=0){
for(i=0;i<count;i++)
{
printf("%d %d\n",a[i],b[i]);
}}
return 0;
}
int issushu(int n)
{
int i,flag=1;
for(i=2;i<n;i++)
{
if(n%i==0)
{
flag=0;
}
}
return flag;
} |
43 | 21103 | 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 | 21104 | int PrimeNumber(int p){
int i;
for(i=2;i<=sqrt(p);i++)
if(p%i==0)
return 0;
return 1;
}
int main()
{
int m,j;
cin>>m;
for(j=3;j<=m/2;j=j+2)
{
if(PrimeNumber(j)&&PrimeNumber(m-j)) cout<<j<<' '<<m-j<<endl;
}
return 0;
}
|
43 | 21105 | 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 | 21106 | //********************************
//*?????????
//*?????? 1300012887 **
//*???2013.10.18 **
//********************************
int main()
{
int m, i, a, j, b, k; //??????
cin >> m;
for (i = 3; i <= m/2; i += 2) //?????3??????i?m-i?????
{
int a = sqrt(i);
for (j = 2; j <= a; j++) //??????i?????
{
if (i % j == 0)
break;
}
int b = sqrt(m - i);
for (k = 2; k <= b; k++) //??????m-i???
{
if ((m - i) % k == 0)
break;
}
if ((j == a + 1) && (k == b + 1)) //?????????????
cout << i << " " << m - i << endl;
}
return 0;
}
|
43 | 21107 | int main()
{
int m,i,j,k,odd1,odd2,sum1,sum2;//m:?????;i,j,k:????;odd1,odd2:??????????odd1<odd2;sum1,sum2:??????????????????
cin>>m;
for(i=3;i<=m/2;i+=2)
{
sum1=0;
sum2=0;
odd1=i;
odd2=m-odd1;
for(j=2;j<odd1;j++)
if(odd1%j==0)
sum1+=1;
for(k=2;k<odd2;k++)
if(odd2%k==0)
sum2+=1;
if(sum1==0&&sum2==0)
cout<<odd1<<' '<<odd2<<endl;
}
return 0;
}
|
43 | 21108 | //***********************************************
// 1.cpp
// ??????
// created on 2012-10-22
// author ?? 1200012934
//***********************************************
int main()
{
int m, i, j, l;
cin >> m;
for (i = 3; i <= m /2; i++)
{
l = (int) sqrt (i);
for (j = 2; j <= l; j++)
if (i % j == 0) break;
if (j == l + 1)
{
l = (int) sqrt (m - i);
for (j = 2; j <= l; j++)
if ((m - i) % j == 0) break;
if (j == l +1)
cout << i << " " << m - i << endl;
}
}
return 0;
} |
43 | 21109 | int main()
{
int m, x, y, i, k, t;
k = t = 0;
cin >> m;
for (x = 3; x <= (m / 2); x += 2)
{
for (i = 3; i * i <= x; i += 2)
{
if ((x % i) == 0)
{
k = 1;
break;
}
}
if (k == 0)
{
y = m - x;
for (i = 3; i * i <= y; i += 2)
{
if ((y % i) == 0)
{
t = 1;
break;
}
}
if (t == 0)
cout << x << ' ' << y << endl;
else
t = 0;
}
else
k = 0;
}
return 0;
} |
43 | 21110 |
int main()
{
int flag[SIZE]={0};
int i,j,r,num;
for(i=3;i<32767;i++)
{
if(i%2==1)
{
for(j=2;j<=sqrt(i);j++)
{
r=i%j;
if(r==0)
{
break;
}
}
if(r!=0)
{
flag[i]=1;
}
}
}
scanf("%d",&num);
for(i=3;i<=num/2;i++)
{
if(flag[i]==1&&flag[num-i]==1)
{
printf("%d %d\n",i,num-i);
}
i++;
}
return 0;
} |
43 | 21111 | int main()
{
int m, n, c;
cin >> m;
for (int i = 3; i <= m / 2; i++)
{
c = 1;
for (int j = 2; j <= i; j++)
{
if (i % j == 0 && j != i)
{
c = 0;
break;
}
if (j == i)
break;
}
if (c)
{
n = m - i;
for (int k = 2; k <= n; k++)
{
if (n % k == 0 && n != k)
break;
if (n == k)
{
cout << i << " " << n << "\n";
}
}
}
}
return 0;
} |
43 | 21112 | int main()
{
int m,i,j,k,t,f1,f2;
double s[25]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
double a,b;
cin>>m;
a=3;
b=0;
while (a<=(m/2))
{
b=m-a;
i=0;
t=0;
k=0;
j=0;
while(i<25&&s[i]<a)
{
f1=fmod(a,s[i]);
if (f1!=0)
{
i=i+1;
t=t+1;
}
else i=i+26;
}
while(j<25&&s[j]<b)
{
f2=fmod(b,s[j]);
if (f2!=0)
{
j=j+1;
k=k+1;
}
else j=j+26;
}
if (k==j&&i==t) cout<<a<<" "<<b<<endl;
a=a+2;
}
return 0;
} |
43 | 21113 | int main()
{
int sushu(int);//shusu?????????????
int num=0;//num???????
cin>>num;
for(int i=3;i<=num/2;i=i+2)
{
if(sushu(i)&&sushu(num-i))//???????1????????????if???
cout<<i<<' '<<num-i<<endl;
}
return 0;
}
int sushu(int n1)//??n1?????
{
if(n1==2||n1==3)return 1;
for(int j=2;j<=sqrt(n1);j++)
{
if(n1%j==0)return 0;//n1????????????0
}
return 1;//n1???j??????????????1
}
|
43 | 21114 | //********************************
//*????????? **
//*?????1300062805 **
//*???2013.10.27 **
//********************************
int main()
{
int m, a, b, c, d, e, i, n, p;
cin >> m;
for ( i = 3; i <= m / 2; i +=2 ) // ??????
{
n = (int)sqrt(i);
a = 2;
while ( a <= n)
{
p = i % a;
if ( p == 0 )break;// ???????
a++;
}
if ( a == n + 1) // ????????
{
c = m - i;
d = (int)sqrt (c);
for ( a = 2; a <= d; a ++) // ??????
{
e = c % a;
if ( e == 0)break;
}
if ( a == d + 1)
{
cout << i << " " << c << endl;
}
}
}
return 0;
}
|
43 | 21115 | int main()
{
int m,a,b,j,i;
scanf("%d",&m);
for(a=3;a<m;a=a+2)
for(b=3;b<m;b=b+2)
{
if(a+b==m&&a<=b)
{
for(i=2;i*i<=a;i++)
if(a%i==0) break;
for(j=2;j*j<=b;j++)
if(b%j==0) break;
if(i*i>a&&j*j>b) printf("%d %d\n",a,b);
}
}
} |
43 | 21116 | 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 | 21117 | int main()
{
int k , m ,i ,a ,j,s,u;
cin>>m;
for(k=3;k<=m/2;k++)
{
s=u=0;
for(i=2;i<=sqrt(k);i++)
{
if(k%i==0)
s=s+1;
}
if(s==0)
{
a=m-k;
for(j=2;j<=sqrt(a);j++)
{
if(a%j==0)
u=u+1;
}
if(u==0)
cout<<k<<' '<<a<<endl;
}
}
return 0;
}
|
43 | 21118 | int main()
{int m,a,i,k;
scanf("%d",&m);
for(a=3;a<=m/2;a+=2)
{k=0;{for(i=1;i<=m/2;i+=2)
if(a%i==0||(m-a)%i==0) k++;}
if(k==2) printf("%d %d\n",a,m-a);}
return 0;} |
43 | 21119 | 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 | 21120 | int main()
{
int a[100000],i,j,k,n;
cin >> n;
a[1]=2;
k=2;
for(i=3;i<=n;i+=2)
{
for(j=1;;j++)
{
if(a[j]*a[j]>i)
break;
else
{
if(i%a[j]==0)
break;
}
}
if(a[j]*a[j]>i)
{
a[k]=i;
k++;
}
}
for(i=1;i<k;i++)
{
for(j=i;j<k;j++)
{
if(a[i]+a[j]==n)
{
cout << a[i] << ' ' << a[j] << endl;
}
}
}
return 0;
}
|
43 | 21121 | int yes(int n)
{
int m,i;
m=(int)sqrt(n);
for(i=3;i<=m;i+=2)
{
if(n%i==0)
return 0;
}
return 1;
}
main()
{
int m,n,i;
scanf("%d",&n);
for(i=3;i<=n/2;i+=2)
{
if(yes(i)&&yes(n-i))
{
printf("%d %d\n",i,n-i);
}
}
getchar();
getchar();
}
|
43 | 21122 |
int sushu(int x)
{
int i,j;
if(x==3)
return 1;
for(i=2;i<=sqrt(x);i++)
{
if(x%i==0)
{
return 0;
}
}
return 1;
}
int main()
{
int m,i,j;
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2)
{
if(sushu(i))
{
j=m-i;
if(sushu(j))
{
printf("%d %d\n",i,j);
}
}
}
return 0;
}
|
43 | 21123 | //***************************************************
//1.cpp ?????? ******
//?? ??? 1200018209 ********
//?? 2012-10-15 ******
//***************************************************
int main()
{
int temp,n,i,j,a[10000],k=1;
a[0]=2;
cin >> n;
for(i=3;i<=n;i=i+2)
{
temp=sqrt(i);
for(j=2;j<=temp;j++)
{
if(i%j==0)break;
}
if(j==temp+1)
{
a[k]=i;
k++;
}
}
for(i=0;i<k;i++)
{
for(j=k-1;j>=i;j--)
{
if(a[i]+a[j]==n)
{
cout << a[i] << " " << a[j] << endl;
}
}
}
return 0;
}
|
43 | 21124 | int p(int n)
{
int j,b;
if(n<2)return 0;
b=(int)sqrt(n);
if(n==2) return 1;
for(j=2;j<=b;j++)
if(n%j==0) return 0;
return 1;
}
int main()
{
int m,j;
scanf("%d",&m);
for(j=2;j<=m/2;j+=1)
if(p(j)&&p(m-j))printf("%d %d\n\n",j,m-j);
return 0;
}
|
43 | 21125 | 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 | 21126 | 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 | 21127 |
int main()
{
int m;
scanf("%d",&m);
int a,i;
for(a=3;a<=(m/2);a=a+2)
{
int c=0;
for(i=2;i<a;i++)
if(a%i==0)
c++;
int d=0;
for(i=2;i<m-a;i++)
if((m-a)%i==0)
d++;
if(c==0&&d==0)
printf("%d %d\n",a,m-a);
}
getchar();
getchar();
} |
43 | 21128 | /*
* 16.cpp
*??????
* Created on: 2012-10-18
* Author: ???
*/
int main()
{
int m;
cin>>m;
for(int i1=3;i1<=m/2;i1=i1+2)
{
int t=1,p=1;
for(int k1=2;k1<=sqrt(i1);k1++)
{
int q1=i1%k1;
t=t*(q1!=0);
}//????????????
if(t==1)
{
int i2=m-i1;
for(int k2=2;k2<=sqrt(i2);k2++)
{
int q2=i2%k2;
p=p*(q2!=0);
}//??????????
if(p==1)
cout<<i1<<" "<<i2<<endl;
}
}
}
|
43 | 21129 | int main()
{
int m,n,i,j,b,a[5000];
scanf("%d",&m);
n=b=0;
for(j=3;j<m;j++)
{
for(i=2;i<=j/2;i++)
{
if(j%i==0)
{
n=1;
break;
}
}
if(n==0)
{
a[b]=j;
b+=1;
}
else
{
n=0;
}
}
for(i=0;i<=b;i++)
{
for(j=i;j<=b;j++)
{
if(m==a[i]+a[j])
{
printf("%d %d\n",a[i],a[j]);
}
}
}
return 0;
} |
43 | 21130 | int issn(int n);
int main()
{
int n,a,b=0,c;
int z[10000];
scanf("%d",&n);
for(a=3;a<n+100;a++)
{
if(issn(a))
{
z[b]=a;
b++;
}
}
for(a=0;a<=b-1;a++)
{
for(c=a;c<b-1;c++)
{
if(z[a]+z[c]==n)
{
printf("%d %d\n",z[a],z[c]);
}
}
}
return 0;
}
int issn(int n)
{
int a,b=1;
for(a=2;a<n;a++)
{
if(n%a==0) b=0;
}
return b;
} |
43 | 21131 | //********************************
//*??????????? **
//*????? 1200012845 **
//*???2012.10.22 **
//********************************
int main()
{
int m, a, b, i, j; //j?a????i?b???
cin >> m;
for (a = 3; a <= (m / 2); a = a + 2)
{
int a1 = (int) sqrt(a);
for (j = 2; j <= a1; j++)
{
if (a % j == 0) break; //?a??j??????????????
}
if (j == (a1 + 1)) //?j=a1+1?a???j???????a???
{
for (b = a; b <= m; b = b + 2)
{
int b1 = (int) sqrt(b);
for (i = 2; i <= b1; i++)
{
if (b % i == 0) break; //?b??i??????????????
}
if ((i == (b1 + 1)) && (a + b == m)) //?i=b1+1?b???i???????b???
{
cout << a << " " << b << endl;
}
}
}
}
return 0;
}
|
43 | 21132 | //********************************
//*????????? **
//*?????? 1200012808 **
//*???2012.10.10 **
//********************************
// ?????????????????????int f(int x)
int f(int x)
{
int j;
for (j = 2; j <= sqrt((double)x); j++)
{
if (x % j == 0)
return false;
}
return true;
}
int main()
{
int m, x, y;
cin >> m;
for ( x = 3; x <= m / 2 ; x += 2) // ?????m??????
{
y = m - x;
if ((f(x) == true) && (f(y) == true)) // ??x?m-x?????
cout << x << " " << y << endl; // ?????
}
return 0;
}
|
43 | 21133 | //*************************************
//*???Oct 23, 2013 - ?????? **
//*?????? 1300012719 **
//*???2013.10.25 **
//*************************************
int main()
{
int m, p1, p2, i, k; //m?????6???,p1,p2?????????????,i???p1,p2??????????,k???????????
cin >> m;
for (p1 = 3; p1 <= (m / 2); p1 += 2) //??????m,??m>=6,????????2,p1??3???????????
{
k = 1; //?????k
for (i = 1; i <= sqrt (p1); i += 2) //??p1????2???,???i????p1,?i?1?p1^(1/2)??????
{
if ((p1 % i == 0) && (i != 1)) //?????????1?i?p1???,??k???,???????,?????k=0
{ //??,?????????1?i???p1????p1???,?????k=1
k = 0;
break;
}
}
if (k == 1) //??p1?????,????,??????,p1????
{
p2 = m - p1; //?p1???,???p2?????
for (i = 1; i <= sqrt (p2); i += 2) //??????,??i???,???????k??1???????
{
if ((p2 % i == 0) && (i != 1))
{
k = 0;
break;
}
}
if (k == 1)
cout << p1 << " " << p2 << endl; //?p2???????????p1 p2,??p1+p2=m
}
}
return 0;
} |
43 | 21134 | int main()
{
int m,i,j,k;
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2)
{
int r=0;
for(k=3;k<i*1.0/2;k=k+2)
{
if(i%k==0)
{
r=1;
break;
}
}
if(r==1)
{
continue;
}
j=m-i;
for(k=3;k<j*1.0/2;k=k+2)
{
if(j%k==0)
{
r=1;
break;
}
}
if(r==0)
{
printf("%d %d\n",i,j);
}
}
return 0;
} |
43 | 21135 | int main()
{
int m,i,j,k=0,a;//m???????i,j???? .k????1??????????????,a?????i???
cin>>m;
for(i=3;i<=(m/2);i=i+2)
{
k=0;
a=m-i;
for(j=2;j<i;j++)
{
if(i%j==0)k++;//??????????????
}
if(k==0)//???1????????????
{
k=0;
for(j=2;j<a;j++)
{
if(a%j==0)k++;//??????????????
}
if(k==0)//???1????????????
{
a=m-i;
cout<<i<<" "<<a<<endl;
}
}
}
cin.get();
cin.get();
return 0;
} |
43 | 21136 | //**************************
//*????????? *
//*?????? 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 | 21137 | int main()
{
int m,i,j,k,a[10000]={0};
scanf("%d",&m);
a[2]=1;
for(i=3;i<=m;i=i+2)
{
k=sqrt(i);
for(j=2;j<=k;j++)
if(i%j==0)break;
if(j>=k+1)
a[i]=1;
}
for(i=3;i<=m-3;i++)
{
if(a[i]!=0)
{
for(j=i;j<=m-3;j++)
if((j+i==m)&&(a[j]!=0))printf("%d %d\n",i,j);
}
}
return 0;
} |
43 | 21138 | //*******************************
//* Name:Goldbach
//* Author:Sun Zeyu
//* Editting time:2013.10.17
//* Function:Goldbach
//*******************************
int main()
{
int m,x,a[2000]={0},i,k=0,j;
cin>>m;
for(x=3;x<m;x++)
{
for(i=2;i<=x/2;i++)
if(x%i==0)
break;
if(i>x/2)
{
a[k]=x;
k++;
}
}
for(i=0;i<k-1;i++)
for(j=i;j<k;j++)
if(a[i]+a[j]==m)
cout<<a[i]<<' '<<a[j]<<endl;
return 0;
}
|
43 | 21139 | int main()
{
int m, a, b;
cin >> m;
for (a = 3; a <= m / 2; a = a + 2)
{
int i;
for (i = 3; i <= a; i = i + 2)
if (a % i == 0)
break;
if (i == a)
b = m - a;
else
continue;
int k;
for (k = 3; k <= b; k = k + 2)
if (b % k == 0)
break;
if (k == b)
cout << a << " " << b << endl;
}
return 0;
}
|
43 | 21140 |
main()
{
int prime[10010]={0};
int m;
int i,j;
scanf("%d",&m);
prime[1]=1;
for(i=2;i<=100;i++)
for(j=i+1;j<=m;j++)
{if(j%i==0) prime[j]=1;}
for(j=3;j<=m/2;j=j+2)
if(prime[j]==0&&prime[m-j]==0)
printf("%d %d\n\n",j,m-j);
}
|
43 | 21141 | //********************************
//*????1.cpp **
//*????????? **
//*?????? 1200012834 **
//*???2012.10.22 **
//********************************
int main()
{
int m, a, b, i, j1=0, j2=0; // a??????b??????j1?j2?a?b????
cin >> m;
for(a = 3; a <= m/2; a++) // a?3???m/2???a<=b
{
b=m-a; // ??b??
for(i = 1; i <= a; i++) // ???????a?????
{
if(a % i == 0)
{
j1 = j1 + 1;
}
}
for(i = 1; i <= b; i++) // ???????b?????
{
if(b % i == 0)
{
j2 = j2 + 1;
}
}
if(j1 == 2 && j2 == 2) // ??a?b???2??????a?b????
{
cout << a << " " << b << endl; // ??a?b??
}
j1 = 0;
j2 = 0; // ????????????????0
}
return 0;
}
|
43 | 21142 | int main()
{
int n;
int a,b;
int i,k,l;
cin >> n;
for(a=3;a<=n/2;a=a+2)
{
int j=0;
for(i=2;i<a;i++)
{
if(a%i==0)
{
j++;
}
else ;
}
if(j==0)
{
b=n-a;
l=0;
for(k=2;k<b;k++)
{
if(b%k==0)
{
l++;
}
else ;
}
if(l==0)
cout << a << " " << b << endl;
continue;
}}
return 0;
}
|
43 | 21143 | int sushu(int n)
{
int flag=0,i;
for(i=2;i<n;i++)
{
if (n%i==0)
{
flag=1;
break;
}
}
if(flag) return 0;
else return 1;
}
void main()
{
int n,m,p,i;
scanf("%d",&n);
m=n/2;
for(i=2;i<=m;i++)
{
p=n-i;
if (sushu(i)==1&&sushu(p)==1)
{
printf("%d %d\n",i,p);
}
}
} |
43 | 21144 | int ss(int n)
{
int i,t=0;
scanf("%d",&n);
for(i=2;i<=(n/2);i++)
{
if(n%i==0)
{
t=1;
break;
}
}
if(t==1)
{
return 0;
}
else
{
return n;
}
}
int main()
{
int m,a,b;
scanf("%d",&m);
for(a=3;a<=(m/2);a++)
{
b=m-a;
if(m==ss(a)+ss(b))
{
printf("%d %d\n",ss(a),ss(b));
}
}
return 0;
} |
43 | 21145 | int su(int n)
{
int i,l;
l=sqrt(n);
for (i=2;i<=l;i++) if (n%i==0) return(0);
return(1);
}
void main()
{
int n,i;
scanf("%d",&n);
for (i=3;i<=n/2;i++)
{
if (i%2!=0&&(n-i)%2!=0&&su(i)&&su(n-i)) printf("%d %d\n",i,n-i);
}
} |
43 | 21146 | int sushu(int n){
int a,i;
if (n <= 1) return(0);
if (n == 2) return(1);
if (n %2 == 0) return(0);
a = sqrt( n )+1;
for (i=3; i<=a; i+=2){
if (n%i == 0) return(0);
}
return(1);
}
int main()
{
int x,y,z;
scanf("%d",&x);
for(y=3;y<=x/2;y+=2){
z=x-y;
if(sushu(y)&&sushu(z))
printf("%d %d\n",y,z);
}
return 0;
} |
43 | 21147 | 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 | 21148 | int A(int n)
{
int i,d=0;
for(i=2;i<n;i++)
{
if((n%i)==0)
{
d=1;
return 0;
}
}
if(d==0)
{
return 1;
}
}
int main()
{
int m,j;
scanf("%d",&m);
for(j=2;j<=m/2;j++)
{
if(A(j)&&A(m-j))
{
printf("%d %d\n",j,m-j);
}
}
return 0;
}
|
43 | 21149 | //********************************************
//*????????? *
//*?????? *
//*???1300012888 *
//*???2013.10.23 *
//********************************************
int main()
{
int m, a, b, i, j;
cin >> m;
for(a = 3;a <= m / 2;a = a + 2) //?3????2??
{ //??m?????
for(i = 2;i <= sqrt(a);)
{
if(a % i != 0)
i ++;
else
break;
}
if(i > sqrt(a)) //??a???
{
b = m - a;
for(j = 2;j <= sqrt(b);)
{
if(b % j != 0)
j ++;
else
break;
}
if(j > sqrt(b)) //??b???
cout << a << " " << b << endl;
}
}
return 0;
} |
43 | 21150 | int sushu(int n)
{
int i;
for(i=2;i<=sqrt(n);i++)
{
if(n%i==0) return 0;
}
return 1;
}
int main()
{
int m,i;
scanf("%d",&m);
for(i=2;i<m;i++)
{
if(sushu(i)&&sushu(m-i))
{
if(i<=m-i)
printf("%d %d\n",i,m-i);
else continue;
}
}
return 0;
}
|
43 | 21151 | 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 | 21152 | int f (int x)
{
int y=2,z=0;
while(y<=sqrt(x))
{
z=z+!(x-(x/y)*y);
y=y+1;
}
return(z);
}
int main()
{
int a,b,n;
a=2;
scanf("%d",&n);
while(a<=(n/2))
{
b=n-a;
if((f (a)*f (a)+f (b)*f (b))==0)
printf("%d %d\n",a,b);
a++;
}
} |
43 | 21153 | int f(int a)
{
int i,j=0;
if (a==2)
return 0;
else
{
for(i=2;i<a;i++)
{
if (a%i==0)
break;
j++;
}
if (j==a-2)
return 0;
else
return 1;
}
}
main ()
{
int a,b,c,i,j,k;
int g[100];
for(i=0;i<100;i++)
{
g[i]=0;
}
scanf("%d",&a);
j=0;
for (b=2;b<=a;b++)
{
if (f(b)==0)
{
g[j]=b;
j++;
}
}
for(i=0;i<j;i++)
{
c=a-g[i];
for (k=i;k<j;k++)
{
if (c==g[k])
printf("%d %d\n",g[i],g[k]);
}
}
getchar();
getchar();
}
|
43 | 21154 | int main()
{
int m,n,a,b,i1,i2,i3,flag;
scanf("%d",&a);
b=a/2;
for(i1=3;i1<=b;i1=i1+2)
{
m=i1;
n=a-i1;
flag=0;
for(i2=2;i2<m;i2++)
{
if(m%i2==0){ flag=flag+1;break;}
}
for(i3=2;i3<n;i3++)
{
if(n%i3==0){ flag=flag+1;break;}
}
if(flag==0) printf("%d %d\n",m,n);
}
return 0;
}
|
43 | 21155 | //*********************************************
//* file: 1.cpp
//* description???????
//* Created on: 2012-10-23
//* Author: ?? 1200012858
//*********************************************
int main()
{
int m, i, j, k, k1, p, q;
cin >> m;
for (i = 3; i <= (m / 2); i = i + 2)
{
k = (int)sqrt (i);
for (p = 2; p <= k; p++)
{
if (i % p == 0) break;
}
if (p == k + 1)
{
j = m - i;
k1= (int)sqrt (j);
for (q = 2; q <= k1; q++)
{
if (j % q == 0) break;
}
if (q == k1 + 1)
cout << i << " " << j << endl;
}
}
return 0;
} |
43 | 21156 | int main()
{
int m, i, g, sign1, sign2;
scanf("%d", &m);
for (i=2;i<=m/2;i++) {
sign1=0;
sign2=0;
if (i%2==0) {
continue;
}
for (g=2;g<i/2;g++) {
if (i%g!=0) {
continue;
} else {
sign1=sign1+1;
}
}
if (sign1==0) {
for (g=2;g<(m-i)/2;g++) {
if ((m-i)%g!=0) {
continue;
} else {
sign2=sign2+1;
}
}
} else {
continue;
}
if (sign2==0) {
printf("%d %d\n\n", i, m-i);
} else {
continue;
}
}
return 0;
} |
43 | 21157 | int zhishu(int x)
{
int flag=1;
for(int i=2;i<=x/2;i++)
{
if(x%i==0)
{
flag=0;
}
}
return flag;
}
int main()
{
int n,i;
scanf("%d",&n);
for(i=3;i<=n/2;i++)
{
if(zhishu(i)&&zhishu(n-i))
{
printf("%d %d\n",i,n-i);
}
}
return 0;
}
|
43 | 21158 | 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 | 21159 | //******************************
//*??:??? 1200062705 *
//*???: 1 ?????? *
//*?? 2012-12-26 *
//******************************
int main()
{
int m, a = 3, b, c, n;
cin >> m;
for (a = 3; a <= m / 2; a = a + 2)
{
n = (int)sqrt(a);
for (b = 2; b <= n; b++)
{
if (a % b == 0) break;
}
if (b == n + 1)
{
c = m - a;
n = (int)sqrt(c);
for(b = 2; b <= n; b++)
{
if (c % b == 0) break;
}
if (b == n + 1) cout << a << " " << c << endl;
}
}
return 0;
}
|
43 | 21160 |
int isPrime(int x)
{
int i;
for(i=2;i*i<=x;i++)
if(x%i==0)
return 0;
return 1;
}
int main()
{
int m,i;
scanf("%d",&m);
for(i=3;i<=m/2;i+=2)
{
if(isPrime(i)&&isPrime(m-i))
printf("%d %d\n",i,m-i);
}
return 0;
} |
43 | 21161 | //******************************
//???:4.cpp
//??: ??? 1300012754
//??:2013.10.25
//??:??????
//******************************
int main()
{
int a[10010]; //????
int m; //?????
int t = 1; //????m????????????
int flag = 1; //????
int b, c; //m??????
memset(a, 0, sizeof(a)); //?????
a[1] = 2; //?????????2
cin >> m; //???????
//?????????
for (int i = 3; i <= m; i++) //?3????
{
//?i????i?????????t???
for (int j = 1; j <= t; j++)
{
flag = 1; //????????????1???0
if (i % a[j] == 0) //??????????
{
flag = 0; //?????0
break; //exit for
}
}
if (flag == 1)
{
a[t+1] = i; //????t??????????????
t = t + 1; //?????????1
}
}
//??????????????????????????2????????????a[2] = 3???
for (int j = 2; j <= t; j++)
{
b = a[j]; //???????
c = m - a[j]; //????????????????????
if (b > c) //????????????????????????????????
break;
//??c??????????????
for (int i = t; i >= 2; i--)
{
if (c == a[i])
{
cout << b << " " << c << endl; //????????????
break;
}
}
}
return 0;
}
|
43 | 21162 | int main()
{
int m,i=0,j=0,a=0,b=0,c=0,d=0;
scanf("%d",&m);
for(i=3;i<=(m/2);i=i+2)
{
c=0;
d=0;
for(a=2;a<i;a++)
{
b=i%a;
if(b==0)
c++;
}
for(a=2;a<(m-i);a++)
{
b=(m-i)%a;
if(b==0)
d++;
}
if((c==0)&&(d==0))
printf("%d %d\n",i,(m-i));
}
return 0;
} |
43 | 21163 | int zhi(int i)
{
int j,d;
d=1;
for(j=1;j<=i/2; j++)
{
if(i%j==0) d=j;
}
return (d);
}
int main()
{
int m,i,j;
int d=1;
scanf("%d",&m);
for(i=3; i<=m/2;i=i+2)
{
j=m-i;
if (zhi(i) == 1 && zhi(j) == 1)
printf("%d %d\n",i,j);
}
}
|
43 | 21164 |
int main()
{
int a,b,n,p,q,i,j;
scanf("%d",&n);
for(a=3;a<=n/2;a=a+2)
{ for(i=3;i<=sqrt(a);i=i+2)
{ p=a%i;
if(p==0) break;
}
if(p!=0 )
{b=n-a;
if (b!=1)
{for(j=3;j<=sqrt(b);j=j+2)
{q=b%j;
if(q==0) break;
}
if(q!=0)
printf("%d %d\n",a,b);}}
}
return 0;
}
|
43 | 21165 | int main()
{
int m,a,b,g=1,l=1;
double c,d;
cin>>m;
for(a=3;a<=m/2;a+=2)
{
c=sqrt(a);
for(int i=2;i<=c;i++)
{
if(a%i==0)
{
g=0;
break;
}
}
if(g==1)
{
b=m-a;
d=sqrt(b);
for(int j=2;j<=d;j++)
{
if(b%j==0)
{
l=0;
break;
}
}
if(l==1)
{
cout<<a<<" "<<b<<endl;
}
}
g=1;
l=1;
}
return 0;
} |
43 | 21166 | int main()
{
int n;
int a,b;
int i,k,l;
cin >> n;
for(a=3;a<=n/2;a=a+2)
{
int j=0;
for(i=2;i<a;i++)
{
if(a%i==0)
{
j++;
}
else ;
}
if(j>0)
{
continue;
}
else
b=n-a;
l=0;
for(k=2;k<b;k++)
{
if(b%k==0)
{
l++;
}
else ;
}
if(l>0)
{
continue;
}
else
cout << a << " " << b << endl;
continue;
}
cin.get();cin.get();cin.get();
return 0;
}
|
43 | 21167 | //********************************
//*????????? **
//*????? 1300012739 **
//*???2013.10.23 **
//********************************
int main()
{
int n, m, i, j;
double k;
cin >> n;
for(i = 3; i <= n / 2; i = i + 2) //?i??????n/2?????
{
int r = 0; //??r = 0??r?0?????????????
k = sqrt(i);
for(j = 2; j <= k; j++) //??i?????
{
if(i % j == 0) r++;
}
if(r) continue; //?????????????????n - i?
else
{
r = 0;
k = sqrt(n - i);
for(j = 2; j <= sqrt(n - i); j++) //???n - i??????
{
if((n - i) % j == 0) r++;
}
}
if(r) continue; //????????????????i???n- i?
else
{
cout << i << " " << n - i << endl;
}
}
return 0;
}
|
43 | 21168 | int f(int x)
{ int c=0;int i;
for(i=1;i<=(sqrt(x)+1);i++)
{if(x%i==0) c++ ;}
if(c==1)
return 1;
else return 0;
}
int main()
{ int m;
scanf("%d",&m);
int c=3;
for(;c<=m/2;c=c+2)
{ int d;
d=m-c;
if(f(d)==1&&f(c)==1) printf("%d %d\n",c,d);
}
getchar();
getchar();
}
|
43 | 21169 | int main()
{
int m;
cin >> m;
int a[10001] = {0};
int b[10001] = {0};
int t = 0;
for(int i = 2; i < m; i++) // ????????m???????a?
{
for(int j = 2; j < m; j++)
{
if( i * j > m || a[i*j] != 0 )
continue;
a[i*j] = i * j;
//cout << a[i*j]<< " ";
b[t] = i * j ;
//cout << b[t] << " ";
t ++;
}
}
int x, p[10001] , q[10001];
int p1, q1;
for(int i = 3; i <= m/2; i = i + 2)
{
x = m - i; // x ,i ?????
//????????????
for(int j = 0; j < t; j++)
{
p[j] = b[j] - i;
q[j] = b[j] - x;
}
p1 = 0;
q1 = 0;
for(int j = 0; j < t; j++)
{
if( p[j] != 0)
p1 ++;
if( q[j] != 0)
q1 ++;
}
if( p1 == t && q1 == t)
cout << i << " " << x << endl;
}
return 0;
}
|
43 | 21170 | 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 | 21171 | 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 | 21172 | //??????
int main()
{
int m,i=3,j,x,y; //m?????? i??3????? j?m-i x?y???i,j???????????
int a,b,c=1;
cin>>m;
for(i=3;i<=m/2;i=i+2) //i?3?m/2?????
{
c=1;
j=m-i;
x=sqrt(i);
y=sqrt(j);
for(a=2;a<=x;a++) //?a?2?x?????i?????
{
if(i%a==0) //??i??a?? c=0 ?????
{
c=0;
break;
}
}
for(b=2;b<=y;b++) //?b?2?y?????j?????
{
if(j%b==0) //??j??b?? c=0 ?????
{
c=0;
break;
}
}
if(c==1) //?c=1???i j ???
{
cout<<i<<" "<<j<<endl;
}
}
return 0;
} |
43 | 21173 | main() {
int i,j=0,n,k=1,t,m;
scanf("%d",&m);
int a[m];
for(n=3;n<=m;n+=2)
{ t=sqrt(n);i=2;
for(i=2;;i++)
{ if(n%i==0) break;
if(i>t) { a[j]=n;j++;break; }}
}
t=0;
for(i=0;i<=j;i++)
for(k=i;k<=j;k++)
{ if(a[i]+a[k]==m)
{ t++;
printf("%d %d\n",a[i],a[k]);
}
}
if(t==0)
printf("no\n");
}
|
43 | 21174 |
int main(int argc, char *argv[])
{
int m,i,j,flag1,flag2;
scanf("%d",&m);
for (i=3;i<=m/2;i+=2)
{
flag1=1;
flag2=1;
for (j=2;j<=i-1;j++)
{
if (i%j==0)
{flag1=0;break;}
}
for (j=2;j<=m-i-1;j++)
{
if ((m-i)%j==0)
{flag2=0;break;}
}
if ((flag1==1)&&(flag2==1))
printf("%d %d\n",i,m-i);
}
return 0;
}
|
43 | 21175 | 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 | 21176 | int main()
{
int x,i,j,bl,g,a[2001],b[10001];
cin>>x;
if (x<6||x%2==1)
{
cout<<"Error!";
}
else
{
g=0;
for (i=3;i<=x;i++)
{
bl=0;
for (j=2;j<i;j++)
if (i%j==0)
{
bl=1;
break;
}
if (bl==0)
{
g++;
a[g]=i;
b[i]=1;
}
}
for (i=1;i<=g;i++)
{
if (a[i]*2<=x)
{
if (b[x-a[i]]==1)
{
cout<<a[i]<<" "<<x-a[i]<<endl;
}
}
else break;
}
}
} |
43 | 21177 | int main()
{
int m, i, j, k, t, p, q;
cin >> m;
for(i=3;i<=m/2;i=i+2) //???3?????????
{
for(t=1,k=2;k*k<=i;k++) //?????????????t????????????????
{
if(i%k==0)
{
t=0;
break; //??????t=0,????????????
}
}
if(t==1) //t!=0,???????
{
j=m-i;
for(p=1,q=2;q*q<=j;q++) //????????????????????????
{
if(j%q==0)
{
p=0;
break;
}
}
if(p==1)
cout << i <<" "<< j << endl; //?????????????i??????????i??j,i??
}
}
return 0;
}
|
43 | 21178 |
int main()
{
int n, i, j, a[10000], flag=0;
scanf("%d",&n);
for (i=3;i<=n;i++)
{
for(j=2;j<i;j++)
{if(i%j==0)
break;
}
if(j==i)
{flag+=1;
a[flag]=i;
}
}
for(i=1;i<=flag;i++)
{
for(j=i;j<=flag;j++)
{
if(a[i]+a[j]==n)
{printf("%d %d\n",a[i],a[j]);
break;
}
}
}
return 0;
}
|
43 | 21179 | int prime(int p);
void main()
{
int a,i;
scanf("%d",&a);
for (i=2;i<=a/2;i++)
{
if (prime(i)&&prime(a-i)) printf("%d %d\n",i,a-i);
}
}
int prime(int p)
{
int i;
for (i=2;i<=(int)sqrt(p);i++)
{
if (p%i==0) return(0);
}
return(1);
}
|
43 | 21180 | 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 | 21181 | int main()
{
int m,i,k,t,s=0,p=0;
scanf("%d",&m);
i=3;
k=1;
t=1;
while(i<=m/2)
{
while(k<=i)
{if(i%k==0)
s=s+1;
else;
k=k+1;}
if(s==2)
{
while(t<=m-i)
{if((m-i)%t==0)
p=p+1;
else;
t=t+1;}
if(p==2)
printf("%d %d\n",i,m-i);
else;
}
else;
s=0;
p=0;
t=1;
k=1;
i=i+1;
}
return 0;
} |
43 | 21182 | int su(int p)
{
int i,j,w;
w=1;
for (i=2;i<p;i++)
if (p%i==0) w=0;
if (w==1) return(1);
else return(0);
}
main()
{
int m,i,j,k;
scanf("%d",&m);
for (i=3;i<m/2+1;i++)
if ((su(i)==1)&&(su(m-i)==1)) printf("%d %d\n",i,m-i);
} |
43 | 21183 | 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 | 21184 | int main ()
{
int m;
int tmp=0;
cin>>m;
for(int i = 3 ; i <= m/2 ; i++)
{
int count1=0;
int count2=0;
for(int k = 2 ; k < i ; k++)
{
if(i%k!=0)count1++;
}
if(count1<i-2)continue;
for(int j = 2 ; j < m-i ; j++)
{
if((m-i)%j!=0)count2++;
}
if(count2==m-i-2)
{
tmp++;
if(tmp==1)cout<<i<<" "<<m-i;
else cout<<'\n'<<i<<" "<<m-i;
}
}
return 0;
}
|
43 | 21185 | int main()
{
int n,i,j,p,q,flag=0;
scanf("%d",&n);
for(i=3;i<=n/2;i+=2)
{
for(p=3;p<i/2;p+=2)
{
if(i%p==0)
flag=1;
}
for (p=3;p<(n-i)/2;p+=2)
{
if((n-i)%p==0)
flag=1;
}
if(flag==0)
{
printf("%d %d\n",i,n-i);
}
flag=0;
flag=0;
}
return 0;
} |
43 | 21186 | 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 | 21187 | int main()
{
int n,i,j,w;
scanf("%d\n",&n);
w=0;
int a[32767]={0};
for(i=3;i<=n-1;i=i+2)
{
for(j=2;j<i;j++)
{
if(i%j==0)
w++;
}
if(w==0)
{
a[i]=i;
}
w=0;
}
for(i=3;i<=n-1;i=i+2)
{
for(j=i;j<=n-1;j=j+2)
{
if(a[i]+a[j]==n)
printf("%d %d\n",a[i],a[j]);
}
}
return 0;
} |
43 | 21188 | /*
*@file 5.cpp
*@author ???
*@date 10.24
*@description ????????
*/
int main ()
{
int m, x, shuchu; //??????m?????????x,?????????????
cin >> m; //????m
for (x = 3; x <= m/2; x += 2)
{
shuchu = 1;
for (int i = 2; i <= sqrt(x); i++)
{
if ((x % i) == 0)
{
shuchu = 0;
break;
}
}
if (shuchu == 1)
{
for (int j = 2; j <= sqrt(m-x); j++)
{
if (((m-x) % j) == 0)
{
shuchu = 0;
break;
}
}
if (shuchu == 1)
{
cout << x << " " << m-x << endl;
}
}
}
return 0;
} |
43 | 21189 | 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 | 21190 | 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 | 21191 | main()
{
int m,i,j,l;
float k,p;
scanf("%d",&m);
for(i=3;i<=m/2;i++,i++)
{
k=sqrt(i);
for(j=2;j<=k;j++)
if(i%j==0)break;
p=sqrt(m-i);
for(l=2;l<=p;l++)
if((m-i)%l==0)break;
if(j>k&&l>p)
printf("%d %d\n",i,m-i);
}
} |
43 | 21192 | 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 | 21193 | int main()
{
int m;
cin>>m;
int i,j,k,a=0,b=0,c,d;
for (i=3;i<=m-1;i=i+2)
{
for(j=m-i-1;j>=2;j--)
{
c=(m-i)%j;
if(c==0)
b=b+1;
if(c!=0)
b=b+0;
}
for(k=2;k<i;k++)
{
d=i%k;
if(d==0)
a=a+1;
if(d!=0)
a=a+0;
}
if(a==0&&b==0&&i<=(m-i))
cout<<i<<" "<<m-i<<endl;
a=0;
b=0;
}
return 0;
} |
43 | 21194 | int main()
{
int m,i,j,z,k,h;
scanf("%d",&m);
for(i=3;i<=m/2;i+=2)
{
z=1;
k=m-i;
for(j=2;j<=sqrt(i);j++)
{
if(i%j==0)z=0;
}
for(h=2;h<=sqrt(k);h++)
{
if(k%h==0)z=0;
}
if(z!=0)printf("%d %d\n",i,k);
}
}
|
43 | 21195 | 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 | 21196 | int main()
{
int m,i,j;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
for(j=1;j++;j<=i)
{
if(i%j==0)
break;
}
if(j==i)
{
for(j=2;j++;j<=m-i)
{
if((m-i)%j==0)
break;
}
if(j==m-i)
printf("%d %d\n",i,m-i);
}
}
getchar();
getchar();
}
|
43 | 21197 | //********************************
//*??????????? **
//*????? 1300012839 **
//*???2013.10.27**
//********************************
int main()
{
int m,a,b,i,j; //m??????a?b?????i?j?????
cin >> m;
for( a = 3;a <= m/2;a+=2) //a?3??????
{
for(i = 2;i < a;i++) //??a?????
if(a % i == 0)break;
if( i == a )
{
b = m - a; //??a??????b?????
for(j = 2;j < b;j++)
if(b % j == 0)break;
if(b == j)cout << a << " " << b << endl; //?????????a?b
}
}
return 0;
} |
43 | 21198 |
int panduan(int n)
{
int i,a,k=1;
a=n/2+1;
for(i=2;i<a;i++)
{
if(n%i==0) k=0;
}
return k;
}
void main()
{
int i,m;
scanf("%d",&m);
i=3;
while (i<m/2+1)
{
if (panduan(i)==1&&panduan(m-i)==1) printf("%d %d\n",i,m-i);
i+=2;
}
} |
43 | 21199 | int main()
{
int m,i,j,flag,t;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
flag=1;
for(j=2;j<i;j++)
{
if(i%j!=0)
flag*=1;
else
flag*=0;
}
if(flag==1)
{
t=m-i;
flag=1;
for(j=2;j<m-i;j++)
{
if((m-i)%j!=0)
flag*=1;
else
flag*=0;
}
if(flag==1)
printf("%d %d\n",i,m-i);
}
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.