The Last Practice
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13451 Accepted Submission(s): 3176
Problem Description
Tomorrow is contest day, Are you all ready?
We have been training for 45 days, and all guys must be tired.But , you are so lucky comparing with many excellent boys who have no chance to attend the Province-Final.
Now, your task is relaxing yourself and making the last practice. I guess that at least there are 2 problems which are easier than this problem.
what does this problem describe?
Give you a positive integer, please split it to some prime numbers, and you can got it through sample input and sample output.
We have been training for 45 days, and all guys must be tired.But , you are so lucky comparing with many excellent boys who have no chance to attend the Province-Final.
Now, your task is relaxing yourself and making the last practice. I guess that at least there are 2 problems which are easier than this problem.
what does this problem describe?
Give you a positive integer, please split it to some prime numbers, and you can got it through sample input and sample output.
Input
Input file contains multiple test case, each case consists of a positive integer n(1<n<65536), one per line. a negative terminates the input, and it should not to be processed.
Output
For each test case you should output its factor as sample output (prime factor must come forth ascending ), there is a blank line between outputs.
Sample Input
60 12 -1
Sample Output
Case 1. 2 2 3 1 5 1 Case 2. 2 2 3 1
Hint
60=2^2*3^1*5^1
思路很简单
题意是
6=1+5 x
6=2+4 x
6=3+3 v(因为3为素数,两个数都是素数满足条件)
as:10=3+7 和 10=7+3算作一个
因为不需要重复计算 所以只需要遍历到m/2就可以了。
#include<iostream>
#include<string.h>
using namespace std;
#define maxn 32768
bool prime[maxn];
void oral()
{
int k;
memset(prime,true,sizeof(prime));
prime[0]=false;
prime[1]=false;
for(k=2;k<maxn;k++)
{
if(prime[k])
{
for(int l=2;l*k<maxn;l++)
{
prime[l*k]=false;
}
}
}
}
int main()
{
oral();
int m;
while(cin>>m&&m)
{
int sum=0;
int j;
for(j=2;j<=m/2;j++)
{
if(prime[j]&&prime[m-j])
sum++;
}
cout<<sum<<endl;
}
return 0;
}