id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
21,000 | int main()
{
int i,n,j,k;
int flag1=0;
int flag2=0;
cin>>n;
for(j=3;j<=n/2;j=j+2)
{
k=n-j;
for(i=2;i<j;i++)
{
if(j%i==0)
{
flag1=1;
break;
}
}
for(i=2;i<k;i++)
{
if(k%i==0)
{
flag2=1;
break;
}
}
if(flag1!=1&&flag2!=1)
cout<<j<<" "<<k<<endl;
flag1=0;
flag2=0;
}
;
return 0;
} | 43 |
21,001 | 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 |
21,002 | 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 |
21,003 | int jud(int k)
{
int s=sqrt(k);
for(int i=2;i<=s;i++)
if(k%i==0)
return 0;
return 1;
}
int main()
{
int m, t, s;
cin>>m;
for(t=3;t<=m/2;t++)
{
s=m-t;
if(jud(s)+jud(t)==2)
cout<<t<<' '<<s<<endl;
}
return 0;
} | 43 |
21,004 | int main()
{
int n,i,j,k=0,m=0;
scanf("%d",&n);
for(i=3;i<=n/2;i=i+2)
{
for(j=1;j<=sqrt(i);j++)
{
if(i%j==0)
k=k+1;
}
for(j=1;j<=sqrt(n-i);j++)
{
if((n-i)%j==0)
m=m+1;
}
if(m==1&&k==1) printf("%d %d\n",i,n-i);
m=0;
k=0;
}
return 0;
} | 43 |
21,005 | //int main()
int f(int n)
{
int j=0,m;
//if(n==2)
//return 1;
//else
for(int i=2;i<n;i++)
{
m=n%i;
if(m==0)
j=j+1;
}
if(j==0)
return 1;
else
return 0;
}
int main()
{
int n,h;
scanf("%d",&n);
for(int k=2;k<=n/2;k++)
{
h=n-k;
if((f(h)==1)&&(f(k)==1))
printf("%d %d\n",k,h);
}
getchar();
getchar();
}
| 43 |
21,006 | int main()
{
int m,i,j,flag=0;
scanf("%d",&m);
for (i=3;i<=m/2;i+=2)
{
{
for (j=3;j<=sqrt(i);j+=2)
if (i%j==0) flag=1;
for (j=3;j<=sqrt(m-i);j+=2)
if ((m-i)%j==0) flag=1;
}
if (flag==0) printf("%d %d\n",i,m-i);
flag=0;
}
return 0;
} | 43 |
21,007 | //??????
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 |
21,008 | int main()
{
int i,j,m,flag,n,k,sum;
scanf("%d\n",&m);
for(i=3;i<=m;i++)
{
flag=0;
for(j=2;j<=i/2;j++)
{
if(i%j==0)
{
flag=1;
break;
}
}
if(flag==0)
{
n=m-i;
sum=0;
for(k=3;k<=n/2;k++)
{
if(n%k==0)
{
sum=1;
break;
}
}
if(sum==0&&i<=n)
printf("%d %d\n",i,n);
}
}
return 0;
}
| 43 |
21,009 | 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 |
21,010 | int main()
{
int m;
cin>>m;
int a=3;
for(;a<=m/2;a=a+2)
{
double s=sqrt(a);
int i=2;
for (;i<=(int)s+1;i++)
{
int b;
b=a%i;
if(b==0) break;
}
if(i<=(int)s+1) continue;
else {
int c;
c=m-a;
double t=sqrt((double)c);
int h=2;
for (;h<=(int)t+1;h++)
{
int d;
d=c%h;
if(d==0) break;
}
if(h<=(int)t+1) continue;
else
{cout<<a<<' '<<c<<endl;}
}
}
return 0;
}
| 43 |
21,011 | 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 |
21,012 | int isprime(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);
if((m%2==0)&&(m>=6)&&(m<=10000))
{
for(i=3;i<=m/2;i=i+2)
{
if(isprime(i)&&isprime(m-i))
printf("%d %d\n",i,m-i);
}
}
return 0;
}
| 43 |
21,013 | 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 |
21,014 | int main()
{ int m;
scanf("%d",&m);
int p[A]={0};
int i,j;
p[0]=p[1]=1;
for(i=2;i<=m;i++)
{
if(p[i]==0)
{
for(j=2;j<=m/i;j++)
p[i*j]=1;
}
}/*??????*/
int k;
for(k=3;k<=m/2;k+=2)
{
if(p[k]+p[m-k]==0)
printf("%d %d\n",k,m-k);
}
return 0;
}
| 43 |
21,015 | 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 |
21,016 | 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 |
21,017 | int main()
{
int m, i, j, a, b;
cin >> m;
a = 3;
b = m - 3;
do
{
for ( i = 2; i < a; i ++ )
if ( a % i == 0 )
break;
for ( j = 2; j < b; j ++)
if ( b % j == 0)
break;
if(i==a && j==b) cout<<a<<" "<<b<<endl;
a = a + 1;
b = m - a;
}while( a <= b );
return 0;
}
| 43 |
21,018 | 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 |
21,019 |
int main()
{
int m,i,j,k,mod,h=1;
scanf("%d",&m);
//????
for(i=3;i<=m/2;i=i+2) {
for(j=2;j<i;j=j+1){
mod=i%j;
if(mod==0){h=0;}
}
if(h!=0){
for(k=2;k<(m-i);k=k+1){
mod=(m-i)%k;
if(mod==0){h=0;}
}
if(h!=0){
printf("%d %d\n",i,m-i);
}
}
h=1;
}
return 0;
}
| 43 |
21,020 | void main() {
int m,n,i,k,a[10000],j = 0,p;
scanf("%d",&m);
for (n = 3;n < m;n+=2) {
k=sqrt(n);
for (i = 2;i <= k;i++)
if (n%i == 0) break;
if (i >= k+1) a[j++] = n;
}
for (i = 0;i < j-1;i++)
for (p = i;p < j;p++)
if (a[i]+a[p] == m) printf("%d %d\n",a[i],a[p]);
}
| 43 |
21,021 | 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 |
21,022 | int main()
{
int num,p,q;
int i,j;
cin>>num;
for(p=3;p<=(num/2);p=p+2)
{for(i=2;i<p;i++)
{if(p%i==0)
{break;}
if(i==p-1)
{q=num-p;
for(j=2;j<q;j++)
{if(q%j==0)
{break;}
if(j==q-1)
{cout<<p<<" "<<q<<endl;}
}
}
}
}
return 0;
} | 43 |
21,023 | 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 |
21,024 | int i,n,s=0;
int zhishu(int a)
{
s=0;
if(a==1)
return 0;
else
{
for(i=2;i<=a/2;i++)
{if(a%i==0)
s++;}
if(s==0)
return 1;
else
return 0;
}
}
main()
{
int i,n;
scanf("%d",&n);
for(i=1;i<=n/2;i++)
{
if(zhishu(i)==1 && zhishu(n-i)==1)
printf("%d %d\n",i,n-i);
}
getchar();
getchar();
} | 43 |
21,025 | //******************************
//???: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 |
21,026 | int main()
{
int n, k, g, a, b;
cin >> n;
for (a = 3; a <= n / 2; a += 2)
{
k = 0; g = 0;
for (int i = 3; i <= a; i += 2)
{
if (a % i != 0)
continue;
else
k++;
}
b = n - a;
for (int i = 3; i <= b; i += 2)
{
if (b % i != 0)
continue;
else
g++;
}
if (k == 1 && g == 1)
cout << a << " " << b << endl;
}
return 0;
} | 43 |
21,027 |
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 |
21,028 | int main()
{
int m,j1,j2,i,d;
scanf("%d",&m);
for(j1=3;j1<=m/2;)
{
for(i=2;i<j1;i++)
{
d=j1%i;
if(d==0)break;
}
if(d==0){j1=j1+1;continue;}
else
{
j2=m-j1;
for(i=2;i<j2;i++)
{
d=j2%i;
if(d==0)break;
}
}
if(d==0){j1=j1+1;continue;}
else{printf("%d %d\n",j1,j2);}
j1=j1+1;
}
return 0;
} | 43 |
21,029 | 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 |
21,030 |
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 |
21,031 | //*********************************************
//* 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 |
21,032 | 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 |
21,033 | int main()
{
int a[10001],i,j,k,d,n;
for(i=0;i<10001;i++)
a[i]=1;
for(i=2;i<10001;i++)
{
if(a[i])
{
d=sqrt(i);
for(k=2;k<=d;k++)
{
if(i%k==0)
break;
}
if(k>d)
{
for(j=i+i;j<10001;j+=i)
{
a[j]=0;
}
}
else
a[i]=0;
}
}
scanf("%d",&n);
d=n/2;
for(i=3;i<=d;i+=2)
{
if(a[i])
{
if(a[n-i])
{
printf("%d %d\n",i,n-i);
}
}
}
return 0;
} | 43 |
21,034 | 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 |
21,035 | 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 |
21,036 | int main()
{
int m,i,p,k;
int judge(int af);
cin>>m;
for(i=3;i<=m/2;i+=2)
{
p=judge(i);
k=judge(m-i);
if(p!=1&&k!=1)
cout<<i<<" "<<m-i<<endl;
}
return 0;
}
int judge(int af)
{
int j;
for(j=3;j<af;j+=2)
{
if(af%j==0)
{
return 1;
break;
}
}
}
| 43 |
21,037 | 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 |
21,038 |
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 |
21,039 | 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 |
21,040 | int panduan (int n);
int main()
{
int m,i,t=0;
cin>>m;
for (i=3;i*2<=m;i++)
{
t=0;
if (i%2!=0&&(m-i)%2!=0)
{
t=panduan(i)+panduan(m-i);
if (t==2)
cout<<i<<" "<<m-i<<endl;
}
}
return 0;
}
int panduan (int n)
{
int j;
for (j=2;j*j<=n;j++)
{
if (n%j==0)
break;
}
if (j*j>n)
return 1;
else
return 0;
}
| 43 |
21,041 |
int main()
{
int m,a,k,b;
scanf("%d",&m);
if(m==6)
printf("3 3\n");
else
{
for(k=1;4*k+2<=m;k++)
{
a=2*k+1;
b=m-a;
int i=2;
while(i*i<=a)
{
if(a%i==0) break;
i++;
}
int j=2;
while(j*j<=b)
{
if(b%j==0) break;
j++;
}
if(i*i>a&&j*j>b) printf("%d %d\n",a,b);
}
}
return 0;
} | 43 |
21,042 | main()
{
int m,k=0,i1,i2,x,y;
scanf("%d",&m);
for(i1=3;i1<=(m/2);i1=i1+2)
{
i2=m-i1;
for(x=3;x<i1;x++)
if((i1%x)==0)
{
k=1;
break;
}
if(k!=1)
{
for(y=3;y<i2;y++)
if((i2%y)==0)
{
k=1;
break;
}
}
if(k!=1) printf("%d %d\n",i1,i2);
k=0;
}
return 0;
} | 43 |
21,043 | //********************************
//*????????? **
//*?????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 |
21,044 | 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 |
21,045 |
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 |
21,046 | int main()
{
int a[2000];
int i,j,k,l,n,m;
n=0;
for (i=0;i<=1999;i++)
a[i]=0;
for (i=2;i<=10000;i++)
{
k=0;
for (j=2;j<=sqrt(i);j++)
{
if (i%j==0)
{
k=1;
break;
}
}
if (k==0)
{
a[n]=i;
n++;
}
}
scanf("%d",&m);
for (i=1;a[i]!=0;i++)
{
for (j=i;a[j]!=0;j++)
{
if (a[i]+a[j]==m)
{
printf("%d %d\n",a[i],a[j]);
}
}
}
return 0;
} | 43 |
21,047 | int main()
{
int m, i,j,k,p,s=1; //m?????????i?j????m???????k?p??????s?????
cin>>m;
for(i=0;i<m/2-2;i++)
{
i=i+3;
j=m-i;
if(i%2!=0)
{
s=s*1;
}
else
{
s=s*0;
}
for(k=0;k<i-2;k++)
{
if(i%(k+2)!=0)
{
s=s*1;
}
else
{
s=s*0;
}
}
for(p=0;p<j-2;p++)
{
if(j%(p+2)!=0)
{
s=s*1;
}
else
{
s=s*0;
}
}
if(s==1)
{
cout<<i<<' '<<j<<endl;
}
s=1;
i=i-3;
}
cin.get();cin.get();
return 0;
} | 43 |
21,048 | /* Name : ??????
* Version : 1.0
* Date : 2013-01-19
* New : Null
* Description :
* State : Design
*/
int main()
{
int N=0;
int A=0,B=0;
int Prime[10000]={-1};
cin>>N;
for (int n=2;n<N;n++)
{
for (int j=2;j<n;j++)
if (n%j==0)
{
Prime[n-1]=-1;
break;
}
}
for (int n=1;n<=N/2;n=n+2)
{
if (Prime[n-1]==0 && Prime[N-n-1]==0)
cout<<n<<' '<<N-n<<endl;
}
return 0;
}
| 43 |
21,049 | //******************************
//*??:??? 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 |
21,050 | 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 |
21,051 | int main()
{
int n,k,y,h,i,m,x;
while (cin >> n&&n!=0)
{
for (x=3;x<=n/2;x++)
{
k=(int)sqrt(x);
y=n-x;
for (i=2;i<=k;i++)
if ((x%i)==0) break;
if (i==k+1)
{
h=(int)sqrt(y);
for (m=2;m<=h;m++)
if ((y%m)==0) break;
if (m==h+1)
cout << x << " " << y << endl;
}
}
}
return 0;
} | 43 |
21,052 | int prime(int a)
{
int k=2;
while(k<=a/2)
{
if(a%k==0) {return 0;break;}
else k++;
}
if(k>a/2) return 1;
}
int main ()
{
int n,i;
scanf("%d",&n);
for(i=3;i<=n/2;i++)
if(prime(i)==1&&prime(n-i)==1)
printf("%d %d\n",i,n-i);
}
| 43 |
21,053 | void main()
{int m,a,b,i,k,l;
scanf("%d",&m);
l=m/2;
for(a=3;a<=l;a+=2)
{k=sqrt(a);
for(i=2;i<=k;i++)
if(a%i==0) break;
if(i>=k+1)
{b=m-a;
k=sqrt(b);
for(i=2;i<=k;i++)
if(b%i==0) break;
if(i>=k+1)
printf("%d %d\n",a,b);}
}
} | 43 |
21,054 | int main()
{
int m,i,j,n,k;
scanf("%d",&m);
for(i=3;i<=m;i=i+2)
{
j=m-i;
for(n=2,k=0;n<i;n++)
{
if(i%n==0)
k++;
}
if(k==0)
for(n=2,k=0;n<j;n++)
{
if(j%n==0)
k++;
}
if(k==0&&i<=j)
printf("%d %d\n",i,j);
}
return 0;
}
| 43 |
21,055 | 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 |
21,056 | 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 |
21,057 | int f(int n)
{
int i,a;
a=sqrt(n);
for(i=2;i<=a;i++)
{
if(n%i==0) return 0;
}
return 1;
}
int main()
{
int n;
scanf("%d",&n);
int i;
for(i=3;i<=(n/2);i++)
{
if(f(i)&&f(n-i)) printf("%d %d\n",i,(n-i));
}
getchar();
getchar();
getchar();
}
| 43 |
21,058 |
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 |
21,059 | int main()
{
int m , a;
cin >>m;
cout <<endl;
for (int i = 2;i <= m/2;i++)//??i?????
{
if (i%2 == 1)
{
int l=0;
for (int k = 2;k <= floor(sqrt(i));k++)//??i?????
if (i%k == 0) l = l + 1;
if (l == 0)
{
int h = 0;
a = m - i ;//?i????m?????a????
for ( int b = 2;b <= floor(sqrt(a));b++)//??a?????
if (a%b == 0) h = h + 1;
if (h == 0)
cout << i <<" "<< a <<endl;
}
}
}
return 0;
}
| 43 |
21,060 | 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 |
21,061 | 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 |
21,062 | //********************************
//*????????? **
//*????? 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 |
21,063 | 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 |
21,064 | 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 |
21,065 | int main()
{
int m;
int j;
int i;
int a,b,e;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
{
e=0;
for(j=2;j<i;j++)
{
if(i%j==0)
{
e++;
}
}
if(e==0)
{
a=i;
b=m-a;
e=0;
for(j=2;j<b;j++)
{
if(b%j==0)
{
e++;
}
}
if(e==0)
{
printf("%d %d\n",a ,b);
}
}
}
}
| 43 |
21,066 | int main()
{
int i, n,a,b,j,l=0,e=0,k;
scanf("%d",&n);
for(i=3;i<=n/2;i+=2)
{
for(j=3;j<=i/2;j+=2)
{
if(i%j==0)
l=l+1;
}
for(k=3;k<=(n-i)/2;k+=2)
{
if((n-i)%k==0)
e=e+1;
}
if(l==0&&e==0)
printf("%d %d\n",i,n-i);
j=3;
k=3;
l=0;
e=0;
}
return 0;
}
| 43 |
21,067 | int f(int x)
{
int i;
for(i=2;i<x;i++)
if(x%i==0)return 0;
return 1;
}
void main()
{
int m,i;
scanf("%d",&m);
for(i=2;i<=m/2;i++)
{if(f(i)==1&&f(m-i)==1)
printf("%d %d\n",i,m-i);}
}
| 43 |
21,068 | 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 |
21,069 | //************************************************
// ?? ?1.cpp *
// ?? ???? 1200012925 *
// ?? ?10?22? *
// ?? ????????? *
//************************************************
int main()
{
//??????? ????????????
int n, a, b, i, m, sum, sum2;
//?????????
cin >> n;
//??????????
for (i = 1 ; i <= (n - 2) / 4 ; i ++)
{
a = 2 * i + 1 ;
sum = 0;
//??a???
for (m = 1 ; m < a ; m ++)
{
if (a % m != 0 )
sum = sum + 1 ;
}
//?????a?????? ???
//?a ?????????b ?????
//?????a
if ( sum == a - 2 )
{
b = n - a ;
sum2 = 0;
for (m = 1 ; m < b ; m = m++)
{
if ( b % m != 0 )
sum2 += 1 ;
//???????? ????
if ( sum2 == b - 2 )
cout << a <<" " << b << endl ;
}
}
}
return 0 ;
}
| 43 |
21,070 | int main()
{
int m,i,j,flag=0;
scanf("%d",&m);
for (i=3;i<=m/2;i+=2)
{
{
for (j=3;j<=i/2;j+=2)
if (i%j==0) flag=1;
for (j=3;j<=(m-i)/2;j+=2)
if ((m-i)%j==0) flag=1;
}
if (flag==0) printf("%d %d\n",i,m-i);
flag=0;
}
return 0;
}
| 43 |
21,071 | int main()
{
int num,i,j,k=1,a[100000],b;
scanf("%d",&num);
for(i=1;i<=num;i++)
{
for(j=2;j<=i;j++)
{
if(i%j==0)
{
if(i==j)
{
a[k]=j;
k++;
}
else
break;
}
}
}
for (k;k>=1;k--)
{
for (b=1;b<=k;b++)
{
if (a[k]+a[b]==num)
{
printf("%d %d\n",a[b],a[k]);
}
}
}
return 0;
} | 43 |
21,072 | 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 |
21,073 | 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 |
21,074 | int sushu(int k)
{
for(int i=2;i<=sqrt(k);i++)
{
if(k%i==0)
{
return 1;
break;
}
}
return 0;
}
int main()
{
int m=0;//m??????
int i=0,j=0;//i,j???????
int numb=0;//numb?i,m-i????????
cin>>m;
for(i=3;i<=m/2;i+=2)
{
j=m-i;
numb=sushu(i)+sushu(j);
if(numb==0)
cout<<i<<' '<<j<<endl;
}
return 0;
} | 43 |
21,075 | 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 |
21,076 | int main()
{
int m, i, j, k, n;
cin >> m;
for (i = 3; i <= m /2; i += 2)
{
j = m - i;
for (k = 2; k < i; k ++)
if (i % k == 0) break;
else
if (k > sqrt(i))
{
for (n = 3; n < j; n += 2)
if (j % n == 0)
break;
if (n > sqrt(j))
{
cout << i << " " << j << endl;
break;
}
}
}
return 0;
} | 43 |
21,077 | 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 |
21,078 | int p[11000], i, j, m;
int main() {
for (i = 0, scanf("%d", &m); i <= m; i++)
p[i] = 0;
for (i = 2; i * i < m; i++) {
for (j = i * 2;!p[i]&& j <= m; j += i)
p[j]++;
}
for (i = 2; i <= m / 2; i++)
if (p[i]+p[m - i] == 0)
printf("%d %d\n", i, m - i);
return 0;
}
| 43 |
21,079 | /*??
Geeker???????????????????????????????????????????????????????m?m>=6????int????????????2??????????1???????????????
????
????m?m?????6 <= m <= 10000
????
2???m?????????????????????????????????2???????????????????????????????????????????????????????????
????
40
????
3 37
11 29
17 23
*
*/
int main()
{
int m,a,b,i,x,y;
cin>>m;
for(a=3;a<=(m/2);a++)
{
b=m-a;
int x=y=0;
for(int i=2;i<=floor(sqrt(a));i++)
{
if(a%i==0)
{
x++;
}
}
for(int i=2;i<=floor(sqrt(b));i++)
{
if(b%i==0)
{
y++;
}
}
if(x==0&&y==0)
{
cout<<a<<" "<<b<<endl;
}
}
return 0;
}
| 43 |
21,080 | int jss(int x);
int main(){
int m,i;
scanf("%d",&m);
for(i=m-2;i>=m/2;i--){
if(jss(i)&&jss(m-i)){
printf("%d %d\n",(m-i),i);
}
}
return 0;
}
int jss(int x){
int j;
int a=0;
for(j=x-1;j>=3;j--){
if(x%j==0){
a=1;
break;
}
}
if(x%2==1&&a==0&&x!=1){
return 1;
}
else{
return 0;
}
}
| 43 |
21,081 | 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 |
21,082 | int isprime(int n)
{
int i;
for(i=2;i<n;i++)
if(n%i==0)
return 0;
return 1;
}
int main(void)
{
int m;
int 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);
continue;
}
}
return 0;
} | 43 |
21,083 | 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 |
21,084 | int main()
{
int n, m, u, i, j, g,s,b;
cin >> n;
m=n/2;
s=0;
b=0;
for(i=3;i<=m;i++)
{
u=n-i;
for( j=2;j<i;j++)
{
if(i%j==0)break;
if(j==i-1)
{s=i;
}
}
for( g=2;g<u;g++)
{
if(u%g==0)break;
if(g==(u-1))
b=u;
}
if((s!=0)&&(b!=0))
{
cout << s <<" "<< b << endl;
}
s=0;
b=0;
}
return 0;
} | 43 |
21,085 | void main()
{
int i,j,n,sqrti,m=0,a[10000];
scanf("%d",&n);
for(i=3;i<=n;i+=2)
{
sqrti=(int)sqrt(i);
for(j=3;j<=sqrti;j+=2)
{
if(i%j==0)
{
break;
}
}
if(j>sqrti)
{
a[m]=i;
m++;
}
}
for(i=0;i<=m;i++)
{
for(j=i;j<=m;j++)
if(n==a[i]+a[j])
{
printf("%d %d\n",a[i],a[j]);
}
}
}
| 43 |
21,086 | 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 |
21,087 | 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 |
21,088 | //********************************
//*?????????
//*?????? 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 |
21,089 | 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 |
21,090 | 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 |
21,091 | 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 |
21,092 | int main()
{
int m;
int i,k,a=0,b=0,c=0;
scanf("%d",&m);
for(i=2;i<=(m/2);i++){
if((i%2)==0){
a=1;
}
for(k=2;k<i;k++){
if((i%k)==0){
b=1;
}
}
for(k=2;k<(m-i);k++){
if((m-i)%k==0){
c=1;
}
}
if((a==0)&&(b==0)&&(c==0)){
printf("%d %d\n",i,m-i);
}
a=0;
b=0;
c=0;
}
return 0;
} | 43 |
21,093 | //**********************************
//* ????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 |
21,094 | 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 |
21,095 | 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 |
21,096 | //***********************************************
// 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 |
21,097 | int S(int x);
int main()
{
int m,i,x,y;
scanf("%d",&m);
for(i=3;i<=m/2;i++)
if(S(i)==0&&S(m-i)==0)
printf("%d %d\n",i,m-i);
return 0;
}
int S(int x)
{int i,k,r=0;
k=sqrt(x);
for(i=2;i<=k;i++)
if(x%i==0){
r=1;break;}
return r;
} | 43 |
21,098 | 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 |
21,099 | 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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.