label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
43 | 21300 | int main ()
{
int m,a,b,i;
scanf("%d",&m);
for (a=3;a<=m/2;a+=2)
{
for(i=2;i<=sqrt(a);i++)
if (a%i==0) break;
if (i>sqrt(a))
b=m-a;
else
continue;
for(i=2;i<=sqrt(b);i++)
if (b%i==0)break;
if (i>sqrt(b))
printf("%d %d\n",a,b);
}
return 0;
} |
43 | 21301 | int main()
{
int a,b,c,d,m,i,j;
scanf("%d",&m);
for(a=2;a<=m;a++)
{
for(b=a;b<=m;b++)
{
if(a+b==m)
{
c=1;
for(i=2;i<=sqrt(a);i++)
{
if(a%i==0)
c=0;
}
d=1;
for(j=2;j<=sqrt(b);j++)
{
if(b%j==0)
d=0;
}
if(c!=0)
if(d!=0) printf("%d %d\n",a,b);
}
}
}
return 0;
} |
43 | 21302 | int main()
{
int m,i,j,c,d;
scanf("%d",&m);
for(i=3;i<=(m/2);i=i+2)
{
for(c=0,j=2;j<i;j++)
{
if(i%j!=0)
c=c+1;
}
if(c==(i-2))
{
for(d=0,j=2;j<(m-i);j++)
{
if((m-i)%j!=0)
d=d+1;
}
if(d==(m-i-2))
printf("%d %d\n",i,m-i);
}
}
} |
43 | 21303 | int main()
{
int n,a,b,c,i,d=0,e=0;
scanf("%d",&n);
for( i=3;i<=n/2;i=i+2)
{
for( a=2;a<i;a++)
{
if(i%a==0)
{d=1;break;}
else {d=0;}
}
if(d==0)
{
b=n-i;
for( c=3;c<b;c=c+2)
{
if(b%c==0)
{e=1;break;}
else {e=0;}
}
}
else {continue;}
if(e==0&&d==0)
printf("%d %d\n",i,b);
else{ continue;}
}return 0;
} |
43 | 21304 | //********************************
//*???1.cpp **
//*?????? 1200012768 **
//*???2012.10.24 **
//*??????????? **
//********************************
int main()
{
int m, i, j, k;
cin >> m;
for (i = 3; i <= m / 2; i += 2)
{
int root1 = sqrt(i);
for (j = 3; j <= root1; j += 2) //???????i?????
{
if (i % j == 0)
break;
}
if (j <= root1 ) //??i????
continue; //?????????????
int root2 = sqrt(m - i);
for (k = 3; k <= root2; k += 2) //??????? m - i ?????
{
if((m - i) % k == 0)
break;
}
if (k > root2 ) //m - i ????
cout << i << " " << m - i << endl;
}
return 0;
} |
43 | 21305 | int main()
{
int n,i,j,t,p;
scanf("%d",&n);
for(i=3;i<=n/2;i++){
t=0;
p=0;
for(j=2;j<=i/2+1;j++){
while(t==0){
if(i%j==0)t=1;
break;
}
if(t==1)break;
}
for(j=2;j<=(n-i)/2+1;j++){
while(p==0){
if((n-i)%j==0)p=1;
break;
}
if(p==1)break;
}
if(t==0&&p==0)printf("%d %d\n",i,n-i);
}
return 0;
} |
43 | 21306 |
int main()
{
int i,n,k,m,l;
scanf("%d",&n);
for(i=3;i<(n/2+1);i+=2)
{
m=0;
for(k=2;k<i/2;k++)
{
if(i%k==0){
m=1;
break;
}
}
if(m==0){
for(l=3;l<((n-i)/2+1);l++)
{
if((n-i)%l==0){
m=1;
break;
}
}
}
if(m==0)printf("%d %d\n",i,n-i);
}
return 0;
} |
43 | 21307 | int main()
{
int m,a[2500],b=0,c=0,x,d,i,j;
cin >> m;
for(i=3;i<m;i++)
{
c=0;
for(j=2;j*j<=i;j++)
{
d = i % j;
if(d==0)
{
c = 1;
break;
}
}
if(c==0)
{
a[b] = i;
b++;
}
}
x = b;
for(i=0;i<x;i++)
{
for(j=x-1;j>i-1;j--)
{
if(m==a[i]+a[j])
{
x = j;
cout << a[i] << " " << a[j] <<endl;
break;
}
}
}
return 0;
} |
43 | 21308 | int main()
{
int m,i,j,a,b,c;
scanf("%d",&m);
for(i=3;i<=(m/2);i+=2)
{
a=i;
for(j=2;j<a;j++)
{
b=a%j;
if(b==0)
break;
}
if(b==0)
continue;
c=m-a;
for(j=2;j<c;j++)
{
b=c%j;
if(b==0)
break;
}
if(b!=0)
printf("%d %d\n",a,c);
}
return 0;
}
|
43 | 21309 | int main()
{
int oushu,i,count,cha,j,k;//oushu??????i,j,k?????cha??i?????
cin>>oushu;
for(i=3;i<=oushu*0.5;i++)//i?????cha
{
cha=oushu-i;
count=0;
for(j=2;j<i;j++)
{
if (i%j==0) count++;//??????????count??
}
for(k=2;k<cha;k++)
{
if (cha%k==0) count++;
}
if (count==0) cout<<i<<" "<<cha<<endl;//?????????
}
return 0;
}
|
43 | 21310 |
int prime(int k);
int main()
{
int n;
cin>>n;
for (int i=2;i<=n/2;i++)
if (prime(i)&&prime(n-i)) cout<<i<<' '<<n-i<<endl;
}
int prime(int k)
{
if (k==2) return 1;
for (int i=2;i<=k/2;i++)
if (k%i==0) return 0;
return 1;
}
|
43 | 21311 | void main()
{
int m,a,b,c,d;
scanf("%d",&m);
for(a=3;a<m;a++)
{
for(c=2;c<=sqrt(a);c++)
if(a%c==0)
break;
if(c>sqrt(a))
{
b=m-a;
for(d=2;d<=sqrt(b);d++)
{
if(b%d==0)
break;
}
if(d>sqrt(b)&&a<=b)
printf("%d %d\n",a,b);
}
}
}
|
43 | 21312 | int work(int n)
{
for(int i=3;i<=sqrt(n);i+=2)
if(n%i==0)return 0;
return 1;
}
int main()
{
int m,i;
cin>>m;
for(i=3;i<=m/2;i+=2)
{
if(work(i)&&work(m-i))
cout<<i<<' '<<m-i<<endl;
}
return 0;
}
|
43 | 21313 | void main()
{
void pro(int n);
int n;
scanf("%d\n",&n);
pro(n);
}
void pro(int n)
{
int *odd(int n),*head;
int i,j;
head=odd(n);
for(i=0;head[i]<=n/2;i++)
for(j=i;head[j]!=0;j++)
{
if(head[i]+head[j]==n)printf("%d %d\n",head[i],head[j]);
}
}
int *odd(int n)
{
int i,j,k,m=0;
int a[1000]={0};
for(i=3;i<n;i+=2)
{
k=sqrt(i);
for(j=2;j<=k;j++)
{ if(i%j==0)break;}
if(j>k)
{
a[m]=i;m++;
}
}
return(a);
}
|
43 | 21314 | int main()
{
int k,m,n,i,j;
scanf("%d",&k);
for(m=3;m<=k;m++)
{
n=k-m;
for(i=2;i<m;i++)
{
if (m%i==0)
break;
}
for(j=2;j<n;j++)
{
if(n%j==0)
break;
}
if (i==m&&j==n)
if (k==m+n)
if(m<=n)
printf("%d %d\n",m,n);
}
return 0;
}
|
43 | 21315 | int main()
{
int m,n,k,a,b,i,j,l,y,z,t,s;
scanf("%d",&m);
n=m/2;
k=(n+1)/2;
for(i=1;i<=k-1;i++)
{
a=2*i+1;
b=m-a;
t=1;
s=1;
for(j=2;j<=a-1;j++)
{
y=a%j;
if(y==0) t*=0;
}
for(l=2;l<=b-1;l++)
{
z=b%l;
if(z==0) s*=0;
}
if(t&&s)
printf("%d %d\n",a,b);
}
return(0);
}
|
43 | 21316 | //********************************
//*????????? **
//*????? 1300012845 **
//*???2013.10.23 **
//********************************
int main ()//???
{
int i,j,k,m,s;//??????i?k
cin >> m;
for (i=3; i<=m/2; i+=2)//?i?????m/2???
{
s=sqrt(i);
for (j=2; j<=s;j++)
{
if (i%j==0)
break;
}
if (j==s+1)//??????????i?????
{
k=m-i;
s=sqrt(k);
for (j=2; j<=s;j++)//??k?????
{
if (k%j==0)
break;
}
if (j==s+1)
cout << i << " "<< k<< endl;
}
}
return 0;
} |
43 | 21317 | int main()
{
int m,n,l,i,j,a[10000],k=1;
scanf("%d",&m);
for(i=3;i<=m;i=i+2)
{
for(j=3;j<=i-1;j++)
if(i%j==0)break;
if(j>=i)
{a[k]=i;
k++;}
}
for(n=1;n<=k;n++)
{for(l=n;l<=k;l++)
if(a[n]+a[l]==m)
printf("%d %d\n",a[n],a[l]);
}
return 0;
} |
43 | 21318 | int prime(int n)
{
int i,z=1;
for(i=3;i<=n/2;i++)
{
if(n%i==0)
{z=0;break;}
}
return z;
}
main()
{
int n,i;
scanf("%d",&n);
for(i=3;i<=n/2;i=i+2)
{
if(prime(i)==1&&prime(n-i)==1)
printf("%d %d\n",i,n-i);
}
getchar();
getchar();
return 0;
}
|
43 | 21319 | int main()
{
int m,a,b,i,j;
scanf("%d",&m);
if(m>=6&&m<=10000&&m%2==0)
{
for(a=2;a<=m;a++)
{
for(b=2;b<=m;b++)
{
if(a%2!=0&&b%2!=0&&a<=b)
{
if(m==a+b)
{
for(i=2;i<a;i++)
{if(a%i==0){
break;
}
}
if(i==a){
for(j=2;j<b;j++)
{if(b%j==0){
break;
}
}
if(j==b){
printf("%d %d\n",a,b);}}
}
}
}
}
}
return 0;
} |
43 | 21320 | int sushu(int x)
{
int a,b,t=2;
b=sqrt(x);
for (int i=2;i<=b;i++)
{
if (x%i==0)
{
t=i;
break;
}
else {t=i+1;}
}
if (t>b)
a=1;
else a=0;
return (a);
}
int main()
{
int n,c;
cin>>n;
for (int j=3;j<=(n/2);j++)
{
c=n-j;
if (sushu(c)+sushu(j)==2)
cout<<j<<" "<<c<<endl;
}
return 0;
}
|
43 | 21321 | int main()
{
int m,i,a,j;
scanf("%d",&m);
for(i=3;i<=m/2;)
{
for(j=2;j<=i;j++)
{
if(i%j==0)break;
}
if(j==i)
{
a=m-i;
for(j=2;j<=a;j++)
{
if(a%j==0)break;
}
if(j==a)
printf("%d %d\n",i,a);
}
i=i+2;
}
return 0;
}
|
43 | 21322 | void main()
{
int m,a=3,b,i,j,z1,z2;
scanf("%d",&m);
while (a<=(m/2))
{
z1=1;
for (i=2;i<=(int)(sqrt(a));i++)
{
if (a%i==0) z1*=0;
else z1*=1;
}
if (z1==1)
{
b=m-a;
z2=1;
for (j=2;j<=(int)(sqrt(b));j++)
{
if (b%j==0) z2*=0;
else z2*=1;
}
if (z2==1)
if (a+b==m) printf("%d %d\n",a,b);
}
a=a+2;
}
}
|
43 | 21323 | int prime(int n)
{
int i;
double k=sqrt((double)n);
for(i=2;i<=k;i++)
if(n%i==0) break;
if(i>k) return 1;
else return 0;
}
int main()
{
int m;
scanf("%d",&m);
int i;
for(i=3;i<=m/2;i+=2)
if(prime(i)&&prime(m-i)) {printf("%d %d\n",i,m-i);continue;}
return 0;
} |
43 | 21324 | //?????
int f(int a)
{
int i;
int l=(float)sqrt((float)a);
for(i=2;i<=l;i++)
if(a%i==0)
{
break;
return 0;
}
if(i==l+1)
return 1;
}
int main()
{
int n,i;
scanf("%d",&n);
if (n%2!=0)
return 0;
else
{
for(i=3;i<=n/2;i=i+2)
if(f(i)==1&&f(n-i)==1)
printf("%d %d\n",i,n-i);
}
return 0;
} |
43 | 21325 | int main()
{
int m, a, b, i, j, k, l;
cin >> m;
for(i = 3; i < m; i = i + 2)
{
for(j = 3; j < i; j = j + 2)
if((i % j) == 0) break;
if(j == i)
a = i;
else
a = 0;
b = m - a;
for(k = 3; k < b; k = k + 2)
if((b % k) == 0) break;
if(k == b)
if(((a <= b)&&(a!=0))==1)
cout << a << " " << b << endl;
}
return 0;
}
|
43 | 21326 | int main()
{
int n,i,m,p,j;
scanf("%d",&n);
for(i=3;i<=n/2;i+=2)
{
for(j=3;(double)j<=sqrt((double)i);j+=2)
{
if(i%j==0)
break;
}
if((double)j>sqrt((double)i))
{
m=n-i;
for(p=3;(double)p<sqrt((double)m);p+=2)
{
if(m%p==0)
break;
}
if((double)p>sqrt((double)m))
printf("%d %d\n",i,m);
}
}
return 0;
} |
43 | 21327 | main()
{
int a,n,i,j,b,p,x;
scanf("%d",&a);
for(i=3;i<=a/2;i++)
{ j=1;
for(n=2;n<i;n++)
{
if(i%n==0) j=0;
}
if(j)
{
b=a-i; x=1;
for(p=2;p<b;p++)
{
if(b%p==0) x=0;
}
if(x)
{
printf("%d %d\n",i,b);
}
}
}
return 0;
}
|
43 | 21328 | int main()
{
int m,i,j,k;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
for(j=2;j<i;j++)
if(i%j==0) break;
if(j<i) continue;
for(k=2;k<m-i;k++)
if((m-i)%k==0) break;
if(k<(m-i)) continue;
printf("%d %d\n",i,m-i);
}
return 0;
} |
43 | 21329 | //*************************************
//* ????1.cpp *
//* ??????1200012844 *
//* ?????2012?10?23? *
//* ??????????? *
//**************************************
int main()
{
int m, x, y, i, j, l, k;//????m?m???????x?y???i?j??????l?k
cin >> m;//??????m
for( x = 3; x <= m / 2; x += 2 )//??????3??????????????
{
//l = (int) sqrt(x);
for ( i = 2; i < x ; i++ )//???2?????????
if ((x % i) == 0) break;//?????????
if ( i == x )//??x??????y?????
{
y = m - x;
//k = (int) sqrt(y);
for( j = 2; j < y ; j++ )//???2?????????
if ((y % j) == 0) break;//?????????
if ( j == y )//??y???????x y
cout << x << ' ' << y << endl;
}
}
return 0;
} |
43 | 21330 | void main()
{
int n,i,k;
int issu(int k);
scanf("%d",&n);
for(i=2;i<=n/2;i++)
{
if(issu(i))
{
if(issu(n-i))
printf("%d %d\n",i,n-i);
}
}
}
int issu(int k)
{
int j,s;
s=1;
for(j=2;j<k;j++)
{
if(k%j==0)
{
s=0;
return(s);
break;
}
}
} |
43 | 21331 | int main()
{
int m,j,w,e;
scanf("%d",&m);
int judge(int a);
for(j=2;j<=m/2;j++)
{
w=judge(j);
e=judge(m-j);
if(w==1&&e==1)
printf("%d %d\n",j,m-j);
}
return 0;
}
int judge(int a)
{
int i,flag=1;
for(i=2;i*i<=a;i++)
{
if(a%i==0)
{flag=0;
break;}
}
return flag;
} |
43 | 21332 | int main(){
int m,i=2,j=2,a,b,n,k,l;
scanf("%d",&m);
n=m/2;
while(i<=n){
k=2;
l=2;
while(k<=i){
if(i%k==0)
break;
else
k++;}
if(k==i){
j=m-i;
while(l<=j){
if(j%l==0)
break;
else
l++;}
if(l==j)
printf("%d %d\n",i,j);
i++;
}
else{
i++;
continue;
}
}
return 0;
} |
43 | 21333 | //**********************************
//* ????homework_1.cpp *
//* ??????1200012884 *
//* ?????2012?10?22? *
//* ??????????? *
//**********************************
int main()
{
int m, i, j, k, jud1, jud2; //?????????i????????????j?????k???????????????jud1?jud2
cin >> m; //????
for (i = 3;i <= (m / 2);i = i + 2)
{
jud1 = 1; //???
for (j = 3;j <= sqrt(i);j = j + 2) //???????i???
{
if (i % j == 0)
{
jud1 = 0;
break;
}
}
if (jud1) //??i???
{
k = m - i; //?????
jud2 = 1; //???
for (j = 3;j <= sqrt(k);j = j + 2)//???????k???
{
if (k % j == 0)
{
jud2 = 0;
break;
}
}
if (jud2) //???????k???
cout << i << " " << k << endl; //??????
}
}
return 0;
}
|
43 | 21334 | int main(){
int e;
cin>>e;
int a = 3,b;
while(a <= e/2){
int t = 3;
while(t < a){
int m = a%t;
if(m == 0)break;
t+=2;
}
int q = 3;
while(q < e - a){
int n = (e-a)%q;
if(n == 0)break;
q+=2;
}
if(t == a && q == e-a)
cout<<a<<" "<<e-a<<endl;
a += 2;
}
return 0;
}
|
43 | 21335 | int main ( )
{
int j,i,n,m;
cin>>n;
int sushu[9999];
for(j=2;j<=n;j++)
{
for(i=2;i<=j;i++)
{
if(j%i==0)break;
}
if(i==j)sushu[j]=j;
}
for(m=2;m<=n/2;m++)
{
for(j=0;j<=n;j++)
{
if(m==sushu[j])for(i=0;i<=n;i++)
{
if((n-m)==sushu[i])
cout<<sushu[j]<<" "<<sushu[i]<<endl;
}
}
}
return 0;
}
|
43 | 21336 | int f(int a)
{
int i=2,m;
m=sqrt(a);
for(i=2;i<=m;i++)
{
if(a%i==0)break;
}
if(i>=m+1)return a;
else return 0;
}
int main()
{
int m;
scanf("%d",&m);
int i,p,q;
for(i=3;i<=m/2;i=i+2)
{
p=f(i);q=f(m-i);
if(p!=0&&q!=0)printf("%d %d\n",p,q);
}
}
|
43 | 21337 | int main()
{
int f(int n);
int m,a=3,b;
scanf("%d",&m);
while(a<=(m/2))
{
if(f(a)==1)
{
b=m-a;
if(f(b)==1)
{
printf("%d %d\n",a,b);
}
}
a=a+2;
}
}
int f(int n)
{
int j;
j=2;
for(j=2;n%j!=0;j++);
return (j>n/2?1:0);
}
|
43 | 21338 | int main() //???
{ //?????
int m,a,b,i,k,y=1,x=1; //????
cin >> m; //??m??
for (a=3;a<=m/2;a=a+2)
{
x=1;
y=1;
for (i=3;i<=a-1;i=i+2)
{
if (a%i==0)
{
x=0;
break;
}
}
if (x==1)
{
for (k=3;k<=m-a-1;k=k+2)
{
if ((m-a)%k==0)
{
y=0;
break;
}
}
if (y==1)
{
cout << a << " " << m-a << endl;
}
}
}
return 0;
} |
43 | 21339 | int main()
{
int n,i,j,x,y,t;
scanf("%d",&n);
for(i=2;i<=(n/2.0);i++)
{
for(x=2;x<i;x++)
{
y=i%x;
if(y==0) break;
}
if(y!=0)
{
j=n-i;
for(t=2;t<=j/2.0;t++)
{ y=j%t;
if(y==0)
break;
}
if(y!=0)
printf("%d %d\n",i,j);
}
}
return 0;
} |
43 | 21340 | int sushu(int n)
{
int i;
int flag=1;
for(i=2;i<n;i++)
{
if(n%i==0)
{
flag=0;
break;
}
}
return flag;
}
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;
} |
43 | 21341 |
int p( int n)
{int i;
if(n==3)
return 1;
else
{ for(i=2;i<n;i++)
{if(n%i==0)
{return 0;
}
if(i==n-1)
{return 1;}
}}
}
int main()
{int m,j;
cin>>m;
for(j=3;j<=(m/2);j++)
{if(p(j)==1)
{if(p(m-j)==1)
cout<<j<<" "<<m-j<<endl;
}
}
return 0;
} |
43 | 21342 | int su(int z)
{
int i=2,t=0,k=sqrt(z);
for(i=2;i<=k;i++)
{
if(z%i==0)
break;
}
if(i>k) t=1;
return t;
}
int main()
{
int m,i,j;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{ j=m-i;
if(su(i)&&su(j))
{printf("%d %d\n",i,j);
}
}
return 0;
}
|
43 | 21343 | int main()
{
int prime(int);
int n,i;
scanf("%d",&n);
for(i=2;i<=n/2;i++)
if(prime(i)&&prime(n-i))
printf("%d %d\n",i,n-i);
}
int prime(int n)
{
int i,a=1;
for(i=2;i<=sqrt(n)&&a==1;i++)
if(n%i==0)
a=0;
return(a);
} |
43 | 21344 | int main()
{
int n,a,b,i,k;
cin>>n;
for(a=2;a<=(n/2);a++)
{
int j=0;
b=n-a;
for(i=2;i<=sqrt(a);i++)
{
if(a%i==0)
j=1;
}
for(k=2;k<=sqrt(b);k++)
{
if(b%k==0)
j=1;
}
if(j==0)
cout<<a<<" "<<b<<endl;
}
return 0;
} |
43 | 21345 | int main()
{int q[100000],w[100000];
int i,j,k,l,m,n,a,b,c;
scanf("%d",&n);
k=0;
for(i=3;i<=n;i++)
{
for(j=2;j<=i-1;j++)
{
if(i%j==0)
{break;}
if(j==i-1)
{
k=k+1;q[k]=w[k]=i;
}
}
}
for(l=1;l<=n;l++)
{
for(m=l;m<=n;m++)
if(n==q[l]+w[m])
printf("%d %d\n",q[l],w[m]);
}
}
|
43 | 21346 | int main()
{
int m,a[1000],s=0,i,j;
scanf("%d",&m);
for(i=2;i<m;i++)
{
for(j=2;j<=sqrt(i);j++)
{
if(i%j==0)
break;
}
if(j>sqrt(i))
{
a[s]=i;
s=s+1;
}
}
for(i=0;i<s-1;i++)
{
for(j=s-1;j>=i;j--)
{
if(a[i]+a[j]==m)
printf("%d %d\n",a[i],a[j]);
}
}
getchar();
getchar();
}
|
43 | 21347 | int prime(int n)
{
int i,flag = 0;
if(n%2)
{
for(i = 3;i <= sqrt((double)n); i+=2)
{
if(n%i==0){
flag = 1;
break;
}
}
if(flag)return 0;
else return 1;
}
else return 0;
}
int main()
{
int n,i;
cin>>n;
for(i = 3;i <= n/2;i+=2)
{
if(prime(i)&&prime(n-i))
cout<<i<<' '<<n-i<<endl;
}
return 0;
} |
43 | 21348 | int main()
{
int m,i,j,k,c;
scanf("%d",&m);
for (i=3;i<=(m/2);i+=2)
{
c=1;
for(j=3;j<i;j++)
{
if(i%j==0)
{ c=0;
break;
}
}
if(c==0) continue;
for(k=3;k<m-i;k++)
{
if((m-i)%k==0)
{c=0;
break;
}
}
if(c==0) continue;
printf("%d %d\n",i,m-i);
}
return 0;
}
|
43 | 21349 | int sushu(int a)
{
int i,b;
b=(int)sqrt(a);
for(i=2;i<=b;i++)
{
if(a%i==0)
break;
}
if(i==b+1)
return 1;
else
return 0;
}
main()
{
int m,i;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
if(sushu(i)==1&&sushu(m-i)==1)
{
printf("%d %d\n",i,(m-i));
}
}
getchar();
getchar();
}
|
43 | 21350 | //*************************
//*???2013?10?23? *
//*?????? *
//*??????????? *
//*************************
int main ()
{
int a, n, i, k; //??????a??????n????i?k
cin >> a;
for(n = 3; n <= a / 2; n += 2) //???????????3?????????
{
for(i = 2; i <= n - 1; i++) //??n?????
{
if(n % i == 0)
break; //??n???????????
else if(i == n - 1) //??n??????a-n
{
for(k = 2; k <= a - n - 1; k++) //??a-n?????
{
if((a - n) % k == 0)
break; //??a-n???????????
else if(k == a - n - 1) //??a-n???
cout << n << " " << a-n << endl; //??????
}
}
}
}
return 0;
} |
43 | 21351 | main()
{
int a[91],m,i,j,n,k,l,t;
a[1]=2;
a[2]=3;
a[3]=5;
a[4]=7;
n=4; // ??????
scanf("%d",&m);
for(i=11;i<=m;i++)
{
t=0;
for(j=1;j<=n;j++)
{
if(i%a[j]==0) t=1;
}
if(t==0)
{
n++;
a[n]=i;
}
}
i=1;
while(a[i]<=m/2)
{
for(j=1;j<=n;j++)
if(a[i]+a[j]==m) printf("%d %d\n",a[i],a[j]);
i++;
}
} |
43 | 21352 | int main()
{
int n,a,b,i,j,k,l,flag=0;
scanf("%d",&n);
for(i=3;i<=n/2;i++)
{flag=0;
for(j=2;j<i;j++)
{
if(i%j==0)
flag=1;}
if(flag==0)
{a=i;
b=n-a;
for(k=2;k<b;k++)
if(b%k==0)
flag=1;}
if(flag==0)
printf("%d %d\n",a,b);}
scanf("%d",&l);
return 0;
} |
43 | 21353 | int is(int x)
{
int i,res=1;
if(x%2==0)res=0;
for(i=3;i<=x/2;i++)
{
if(x%i==0)
{
res=0;
break;
}
}
return res;
}
int main()
{
int i=3,input;
scanf("%d",&input);
while(i<=input/2)
{
if(is(i)==0||is(input-i)==0);
else printf("%d %d\n",i,input-i);
i++;
}
}
|
43 | 21354 | int a[A]={0};
int main()
{
int n,i,s,j;
scanf("%d",&n);
for(i=2;i<A;i++)
{
if(a[i]==0)
{
for(j=i<<1;j<A;j+=i)
{
a[j]=1;
}
}
}
for(i=3;i<=n/2;i+=2)
{
if(a[i]==0)
{
if(a[n-i]==0) printf("%d %d\n",i,n-i);
}
}
return 0;
}
|
43 | 21355 | //****************************************************
//* ? ? ?: homework.cpp *
//* ? ?: ??? *
//* ????: 2012?10?22? *
//* ????: ?????? *
//****************************************************
int main()
{
int a[10001] ,i ,j ,n ; //??A??????????
cin >> n;
for (i = 2;i <= n;i++) a[i] = 1; //???A
for (i = 2;i <= n/2;i++)
{
if (a[i])
{
j = i + i; //?????????
while (j < n)
{ //????
a[j] = 0;
j = j + i;
}
}
}
for (i = 2;i <= n / 2; i++){
if (a[i] && a[n - i]) cout << i << ' ' << n - i << endl;
//?????????
}
return 0;
}
|
43 | 21356 | void main()
{
int i,j,m,a,b;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
j=m-i;
for(a=2;a<=sqrt(i);a=a+1)
{
if(i%a==0) break;
}
for(b=2;b<=sqrt(j);b=b+1)
{
if(j%b==0) break;
}
if(a>sqrt(i)&&b>sqrt(j)) printf("%d %d\n",i,j);
}
}
|
43 | 21357 | main()
{
int m;
scanf("%d",&m);
int i,j,judge,k,judge2;
for (i=2;i<=m/2;i++)
{
judge=1;
for (j=2;j<i/2;j++)
{
if (i%j==0)
judge=0;
}
if (judge==1)
{
k=m-i;
judge2=1;
for (j=2;j<k/2+1;j++)
{
if (k%j==0)
judge2=0;
}
if (judge2==1)
printf("%d %d\n",i,k);
}
}
getchar();
getchar();
} |
43 | 21358 | int main()
{
int i,number,half,s1=0,s2=0,sum1=0,sum2=0,j,m,k1,k2;//??half???????s1,s2??????????????????????????????
cin>>number;
half=number/2;
for(s1=3;s1<=half;s1++)
{
sum1=0;
sum2=0;
s2=number-s1;//?????????
for(j=2;j<s1;j++)//??s1?????
{
k1=s1%j;
{if(k1==0)
sum1=sum1+1;}
}
for(m=2;m<s2;m++)//??s2?????
{
k2=s2%m;
{if(k2==0)
sum2=sum2+1;}
}
if(sum1==0&&sum2==0)
cout<<s1<<" "<<s2<<endl;//?????????
}
return 0;
}
|
43 | 21359 | int main()
{
int m, primeA, primeB;
int i, k;
cin >> m;
if (m >= 6 && m <=10000 && m % 2 == 0)
{//if
for (primeA = 3; primeA <= m - 1; primeA +=2)
{
primeB = m - primeA;
if (primeA <= primeB)
{
for (i = 3; i <= (int)sqrt(m); i++)
{
if (primeA % i == 0 && primeA != i)
{
break;
}
}
if (i == (int)sqrt(m) + 1)
{
for (k = 3; k <= (int)sqrt(m); k++)
{
if (primeB % k == 0 && primeB != k)
{
break;
}
}
if (k == (int)sqrt(m) + 1)
cout << primeA << " " << primeB << endl;
}
}
}
}//if
return 0;
} |
43 | 21360 | int main()
{
int m,i,j,n;
scanf("%d",&m);
int a[10001];
n=m/2;
for (i=2;i<=m;i++)
a[i]=0;
for(i=2;i<=n;i++)
{
for(j=i+i;j<=m;j=j+i)
a[j]=1;
}
for (i=2;i<=n;i++)
{
if ((a[i]==0)&&(a[m-i]==0))
printf("%d %d\n",i,m-i);
}
return 0;
}
|
43 | 21361 | int main()
{
int m,a,i,j,k,b,c,d,e=0;
scanf("%d",&m);
a=m/2;
for(i=3;i<=a;i=i+2)
{
for(j=3;j<=sqrt(i);j=j+2)
{
b=i%j;
if(b==0)
{e++;break;}
}
c=m-i;
for(k=3;k<=sqrt(c);k=k+2)
{
d=c%k;
if(d==0)
{e++;break;}
}
if(e==0)
printf("%d %d\n",i,c);
e=0;
}
return 0;
}
|
43 | 21362 | int main()
{
int m,a,b;//m=????? a,b=??
int i,j,k,l;
cin>>m;
for(a=3;a<=m/2;a++)
{
int j=0;
for(i=2;i<a;i++)
j=j+(a%i==0);
if(j==0)
{
b=m-a;
int k=0;
for(l=2;l<b/2;l++)
k=k+(b%l==0);
if(k==0)
cout<<a<<" "<<b<<endl;
}
}
return 0;
}
|
43 | 21363 | //
// ????1.cpp
// ???????????
// ?????? 1200012943
// ??:2012.10.26
//
int main()
{
int m, n, a, b, r, i;
cin >> m;
n = m / 2;
for (a = 3; a <= n; a = a + 2)
{
r = ceil (sqrt (a)); //?a????
for (i = 2; i <= r; i++)
if ((a % i) == 0) break; //??????
if (i == r + 1)
{
b = m - a;
r = ceil (sqrt (b)); //?b????
for (i = 2; i <= r; i++)
if ((b % i) == 0) break; //??????
if (i == r + 1)
cout << a << ' ' << b << endl;
}
}
return 0;
} |
43 | 21364 | int zhishu(int n)
{
int m,d,i;
m=(int)sqrt(n);
for(i=2;i<=m;i++)
{ if(n%i==0)
break;}
if(i==m+1)
d=1;
else
d=0;
return(d);
}
main()
{
int p,m;
scanf("%d",&m);
for(p=3;p<=m/2;p++)
{if((zhishu(p)==1)&&(zhishu(m-p)==1))
printf("%d %d\n",p,m-p);}
getchar();getchar();getchar();getchar();getchar();getchar();getchar();
}
|
43 | 21365 |
int main()
{
int i,j,m,p=1,n,q=1;
scanf("%d",&m);
for(i=3;i<m/2+1;i=i+2)
{ p=1;q=1;
for(j=3;j<i/3+1;j=j+2)
{
if(i%j==0)
{
p=2;
break;
}
else
continue;
}
if(p==1)
{
n=m-i;
for(j=3;j<n/3+1;j=j+2)
{
if(n%j==0)
{q=2;
break;}
else
continue;
}
}else
continue;
if(p==1&&q==1)
printf("%d %d\n",i,n);
}
} |
43 | 21366 | int prime(int k)
{
int p=(int)sqrt(k);
int t;
for (t=3;t<=p;t+=2)
if (k%t==0) break;
if (t>p) return 1; else return 0;
}
main()
{
int n;
scanf("%d",&n);
if (n<=200000)
{
for (int i=3;i<=n/2;i+=2)
if (prime(i))
{
if (prime(n-i))
printf("%d %d\n",i,n-i);
}}
else printf("%d",n);
}
|
43 | 21367 | int main()
{
int m,a,i,b,h=1,g=1;
scanf("%d",&m);
for(a=3;a<=(m/2);a+=2)
{
for(i=2;i<a;i++)
{
if(a%i==0)
{
h=0;
}
}
for(b=2;b<(m-a);b++)
{
if((m-a)%b==0)
{
g=0;
}
}
if(h==1&&g==1)
{
printf("%d %d\n",a,m-a);
}
h=1;
g=1;
}
return 0;
}
|
43 | 21368 | int main(){
int m,j,i,p;
cin>>m;
for(i=3;i<=m/2;i+=2)
{
p=0;
for(j=2;j<=sqrt(i);j++)if(i%j==0){p=1;break;}
for(j=2;j<=sqrt(m-i);j++)if((m-i)%j==0){p=1;break;}
if(p==1)continue;
else cout<<i<<" "<<m-i<<endl;
}
return 0;
}
|
43 | 21369 | main ()
{
int i,j,k,m,n,p;
scanf("%d",&m);
n=m/2;
for (i=1;i<=n;i++)
{
p=m-i;
for (j=2;j<=i;j++)
if (i%j==0) break;
for (k=2;k<=p;k++)
if (p%k==0) break;
if (j==i&&k==p)
printf("%d %d\n",i,p);
}
}
|
43 | 21370 | inline int single(int);
int main()
{
int m,a1,a2;
cin>>m;
for(a1=2;a1<=m/2;a1++)
{
if(single(a1)==2)
{
a2=m-a1;
if(single(a2)==2)
cout<<a1<<' '<<a2<<endl;
}
}
return 0;
}
inline int single(int x)
{
int n=0;int j;
for (j=1;j<=x;j++)
{
if (x%j==0)
n=n+1;
}
return n;
}
|
43 | 21371 | int main()
{
int m,i,j,a,b;
scanf("%d",&m);
i=3;
while (i<=m/2)
{
a=0;
b=0;
j=2;
while (j<i)
{
if (i%j==0) break;
j=j+1;
}
if (j==i)
a=i;
j=2;
while (j<m-i)
{
if ((m-i)%j==0) break;
j=j+1;
}
if (j==m-i)
b=m-i;
if (a>0 && b>0)
printf("%d %d\n",a,b);
i=i+2;
}
return 0;
} |
43 | 21372 | int main()
{
int m , i , j , a, b, p , q;
cin >> m;
for ( i = 3; i <= m/2; i = i + 2)
{
p = 0;
q = 0;
for ( a = 2; a< i ; a ++)
{
if ( i % a ==0)
{
p=1;
}
}
if ( p==0 )
{
j = m - i ;
for ( b = 2 ; b < j ; b ++)
{
if ( j % b == 0)
{
q=1 ;
}
}
if ( q==0 )
{
cout << i << ' ' << j << endl;
}
}
}
return 0;
}
|
43 | 21373 | int sushu(int t)
{
int r,cnt=0;
r=(int)sqrt(t);
for(int i=1;i<=r;i++)
{
if(t%i==0)
cnt++;
}
if(cnt==1)
{
return t;
cnt=0;
}
else
{
return 0;
cnt=0;
}
}
int main()
{
int m,i,j;
scanf("%d",&m);
for(i=3;i<=(int)(m/2);i=i+2)
{
j=m-i;
if(sushu(i)==i&&sushu(j)==j)
printf("%d %d\n",i,j);
}
getchar();
getchar();
}
|
43 | 21374 | int main(){
int m;
scanf("%d",&m);
int n;
int a=0,b=0;
for(int i=3;i<=m/2;i=i+2){
n=m-i;
for(int j=3;j<=i;j++){
if(i%j==0){
a++; }}
for(int k=3;k<=n;k++){
if(n%k==0){
b++; }}
if(a==1&&b==1){
printf("%d %d\n",i,n);
}
a=0;
b=0;
}
int y;
scanf("%d",&y);
return 0;}
|
43 | 21375 |
int main()
{
int m;
cin>>m;
int e;
int b=0;
int c=0;
for(int k=3;k<=m/2;k=k+2)
{
e=0;
for(int i=2;i<=sqrt(k);i=i+1)//??k?????
{
b=k%i;
if(b==0)
e=1;
}
if(e==0)//??k???
{
c=m-k;
for(int i=2;i<=sqrt(c);i=i+1)//??k?????
{
b=c%i;
if(b==0)
e=1;
}
if(e==0)//??k???
cout<<k<<" "<<c<<endl;
}
}
return 0;
} |
43 | 21376 | int sushu(int n)
{
int s=1,i;
for(i=3;i<=sqrt(n);i+=2)
{
if(n%i==0)
s=0;
}
return s;
}
void main()
{
int i,j,m;
scanf("%d",&m);
for(i=3;i<=m/2;i+=2)
{
if (sushu(i)==1 && sushu(m-i)==1)
{
printf("%d %d\n",i,m-i);
}
}
}
|
43 | 21377 | int main()
{
int m,a,b,c,d,e,f;
scanf("%d",&m);
a=3;
while((2*a)<=m)
{
b=m-a;
c=sqrt(a);
d=sqrt(b);
e=c;
f=d;
while(e>=2)
{
if(a%e==0)
break;
else
e--;
}
while(f>=2)
{
if(b%f==0)
break;
else
f--;
}
if(e==1&&f==1)
printf("%d %d\n",a,b);
a++;
}
return(0);
} |
43 | 21378 | //***************************************
//** ????????? **
//** ?????? 1300012722 **
//** ???2013.10.24 **
//***************************************
int main()
{
int m, a, b, c, d, i, k; //????m??????a?b?????c?d?
cin >> m;
for (a = 3; a < m; a = a + 2)
{
b = m - a;
if (b < a) break; //??b>a,????
c = sqrt(a); //?a????
for (i = 2; i <= c; i++)
if (a % i == 0) break;
if (i > c) //??a??????b?????
{
d = sqrt(b);
for (k = 2; k <= d; k++)
if (b % k == 0) break;
if (k > d) //??b???????a?b??
cout << a << " " << b << endl;
}
}
return 0;
} |
43 | 21379 | int a[5000];
int main()
{
int sushu(int y);
int x,i;
scanf("%d",&x);
for(i=0;i<x/2;i++)
{
a[i]=i+1;
}
for(i=2;i<x/2;i++)
{
if(sushu(a[i])&&sushu(x-a[i]))
printf("%d %d\n",a[i],x-a[i]);
}
return 0;
}
int sushu(int y)
{
int i;
for(i=2;i<y/2+2;i++)
{
if(y%i==0)
break;
}
if(i<y/2+1)
return 0;
else
return 1;
}
|
43 | 21380 | int main()
{
int a,i,j,k,m;
i=3;
scanf("%d",&a);
while(i<=a/2)
{
k=3;
while(k<i)
{
if(i%k==0)break;
k=k+2;
}
if(k==i)
{
j=a-i;
m=3;
while(m<j)
{
if(j%m==0)break;
m=m+2;
}
if(m==j) printf("%d %d\n",i,j);
}
i=i+2;
}
return 0;
} |
43 | 21381 | int check(int);
int main()
{
int n,i,j;
cin >> n;
for(i = 2; i < n; i++)
{
if((i % 2 != 0)&&(check(i)))
{
for(j = i; j < n; j++)
{
if((j % 2 != 0)&&(check(j)))
if(i + j == n)
cout << i << " " << j << endl;
}
}
}
return 0;
}
int check(int m)
{
if(m == 2)
return 1;
int i,j;
j = sqrt(m);
for(i = 2; i <= j; i++)
{
if(m % i == 0)
break;
}
if(i == j + 1)
return 1;
else
return 0;
} |
43 | 21382 | void main()
{
int a[20001],i,n,haha,j;
for(i=1;i<=10000;i++) a[i]=1;
a[0]=0;
a[1]=0;
i=2;
do
{
j=2;
if(a[i]==1)
do
{
n=i*j;
a[n]=0;
j++;
}while(n<=10000);
i++;
}while(i<=10000);
a[2]=0;
scanf("%d",&haha);
i=3;
do
{
j=haha-i;
if((a[i]==1)&&(a[j]==1)) printf("%d %d\n",i,j);
i++;
}while(i<=(haha/2));
return 0;
} |
43 | 21383 | int main()
{int m,i,q,a;
scanf("%d",&m);
for(i=3;i<=m/2;i=i+2)
{a=1;
for(q=3;q<(m-i)/3;q=q+2)
{if(i==i/q*q&&i/q!=1){a=0;break;}
if((m-i)==(m-i)/q*q) {a=0;break;}}
if (a) printf("%d %d\n",i,m-i);}
return 0;
}
|
43 | 21384 | void main()
{
int m,i,d,x,e;
d=0;
e=0;
scanf("%d",&m);
for (i=2;i<=m/2;i++)
{ d=0;
e=0;
if (i%2==0);
else
{
for (x=2;x<i;x++)
if (i%x==0) d=1;
for (x=2;x<m-i;x++)
if ((m-i)%x==0) e=1;
if ((d==0) && (e==0)) printf("%d %d\n",i,m-i);
}
}
} |
43 | 21385 | int main()
{
int m,i,j,k,a,b;
cin>>m;
for(i=3;i<=m/2;i+=2){
a=1;b=1;
for(j=2;j<i/2;j++){
if(i%j==0)
a=0;}
for(k=2;k<(m-i)/2;k++){
if((m-i)%k==0)
b=0;}
if(a*b!=0)
cout<<i<<' '<<m-i<<endl;}
return 0;
} |
43 | 21386 | int main()
{
int n,a=3,b=2,c,d=0,e=3,f,g=0;
scanf("%d",&n);
while (a<=n/2)
{
b=2;
d=0;
while(b<a)
{
c=a%b;
if(c==0)
{
break;}
else
{
d=d+1;
}
b=b+1;
}
if(d==a-2)
{
e=3;
g=0;
while(e<n-a)
{
f=(n-a)%e;
if(f==0)
{
break;
}
else
{
g=g+1;
}
e=e+1;
}
if(g==n-a-3)
{
printf("%d %d\n",a,n-a);
}
}
a=a+1;
}
return 0;
} |
43 | 21387 | main()
{
int m=3,i,n,a,b;
scanf("%d",&n);
while(m<=n/2)
{for(i=2;i<=m-1;i++)
if(m%i==0)break;
if(i>=m)
{a=n-m;
for(i=2;i<=a-1;i++)
if(a%i==0)break;
if(i==a)
printf("%d %d\n",m,a);}
m=m+2;
}
}
|
43 | 21388 | int main()
{
int a[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};
int b[10001]={0,0};
int i,j,m;
for(i=2;i<=10000;i++)
{
b[i]=i;
}
for(i=0;i<=24;i++)
{
for(j=2;j<=10000;j++)
{
if(b[j]%a[i]==0&&b[j]!=a[i])
{
b[j]=0;
}
}
}
cin>>m;
{
for(i=2;2*i<=m;i++)
{
if(b[i]!=0&&b[m-i]!=0)
{
cout<<i<<" "<<m-i<<endl;
}
}
}
return 0;
}
|
43 | 21389 | int main()
{
int find(int n);
int m,k;
cin>>m;
for(k=3;k<=(m/2);k=k+2)
{
if(k==find(k)&&(m-k)==find(m-k))
cout<<k<<" "<<m-k<<endl;
}
return 0;
}
int find(int n)
{
int i,c=0;
for(i=1;i<=n;i++)
{
if(n%i==0) c=c+1;
}
if(c==2) return (n);
else return 0;
}
|
43 | 21390 | int zhishu(int x)
{
int i,z=1;
for(i=2;i<=x/2;i++)
if(x%i==0)
{
z=0;
break;
}
return(z);
}
void main()
{
int m,i;
scanf("%d",&m);
for(i=2;i<=m/2;i++)
if(zhishu(i)&&zhishu(m-i))
printf("%d %d\n",i,m-i);
}
|
43 | 21391 | main()
{
int m,i,j;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
for(j=2;j<=i;j++)
{
if(i%j==0) break;
}
if(j==i)
{
for(j=2;j<=m-i;j++)
{
if((m-i)%j==0) break;
}
if(j==m-i) printf("%d %d\n",i,m-i);
}
}
}
|
43 | 21392 | int main()
{
int a,i,j,n,m;
scanf("%d",&a);
for(i=3;i<a/2+1;i=i+2)
{
j=a-i;
for(n=3;n<i;n=n+2)
{
if(i%n==0)
{
goto loop;
}
}
for(m=3;m<j;m=m+2)
{
if(j%m==0)
{
goto loop;
}
}
printf("%d %d\n",i,j);
loop: continue;
}
return 0;
} |
43 | 21393 |
int main(int argc, char* argv[])
{
int m,i,j,b,su;
scanf("%d",&m);
for(i=3;i<=m/2;i+=2){
su=1;
for(j=2;j<i;j++){
if(i%j==0) su=0;
}
if(su==1){
b=m-i;
for(j=2;j<b;j++){
if(b%j==0) su=0;
}
if(su==1)printf("%d %d\n",i,b);
}
}
return 0;
}
|
43 | 21394 | int main()
{
int su(int x);
int n,i;
scanf("%d\n",&n);
for(i=3;i<=n/2;i+=2)
{
if(su(i)&&su(n-i))
{
printf("%d %d\n",i,n-i);
}
}
}
int su(int x)
{
int t,k,leap=1;
if(x==3)
return 1;
else
{
for(t=3;t<=(x/2);t+=2)
{
k=x%t;
if(k==0)
{
leap=0;
break;
}
}
}
return(leap);
} |
43 | 21395 |
main()
{
int m,a,b,k,s;
scanf("%d",&m);
for(a=3;a<=(m/2);a=a+2)
{
for(k=3;k<a;k=k+2)
{if(a%k==0)
{a=a+2;
k=3;}}
b=m-a;
if(b>=a)
{
s=0;
for(k=3;k<b;k=k+2)
{if(b%k==0)
s=s+1;}
if(s==0)
printf("%d %d\n",a,b);
}
}
}
|
43 | 21396 | int main()
{
int su(int x);
int n,i,j;
scanf("%d",&n);
for(i=3;i<=n/2;i+=2)
{
j=n-i;
if(su(i)&&su(j))printf("%d %d\n",i,j);
}
}
int su(int x)
{
int i,z=1;
if(x==2)z=1;
else
{
for(i=2;i<=sqrt(x);i++)
{
if(x%i==0)
{
z=0;
break;
}
}
}
return z;
} |
43 | 21397 |
int main()
{
int n;
cin>>n;
int i,j,k;
for(i=3;i<=n/2;i=i+2)
{
for(j=2;j<=i;j++)
{
if(i%j==0) {break;}
}
if(j==i)//????????i???
{
for(k=2;k<=n-i;k++)
{
if((n-i)%k==0) {break;}
}
if(k==n-i)//???n-i???
{
cout<<i<<" "<<n-i<<endl;
}
}
}
return 0;
}
|
43 | 21398 | main()
{
int m,i,k,t;
scanf("%d",&m);
for(i=3;i<=(m/2);i=i+2)
{
for(t=2;t<=(i/2);t++)
if(i%t==0)
break;
if(t>(i/2))
{
for(t=2;t<=((m-i)/2);t++)
if((m-i)%t==0)
break;
if(t>(m-i)/2)
printf("%d %d\n",i,m-i);
}
}
} |
43 | 21399 | int main()
{
int m, i ;
cin >> m ;
for (i = 3 ; i < ((m / 2) + 1) ; i += 2)
{
for (int j = 3 ; j <= m - i ; j += 2)
{
if ((i % j == 0)||((m - i) % j == 0))
{
if (j != i)
break ;
}
if (j >= (m - i - 2))
{
cout << i << " " << m - i << endl ;
break ;
}
}
}
return 0 ;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.