分拆素数和
Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8601Accepted Submission(s): 3740
Problem Description
把一个偶数拆成两个不同素数的和,有几种拆法呢?
Input
输入包含一些正的偶数,其值不会超过10000,个数不会超过500,若遇0,则结束。
Output
对应每个偶数,输出其拆成不同素数的个数,每个结果占一行。
Sample Input
30 26 0
Sample Output
3 2
Source
Recommend
lcy
筛法,枚举,水题,无解…………
贴代码!
4300185 | 2011-07-31 19:12:33 | Accepted | 2098 | 0MS | 200K | 497 B | C++ | 10SGetEternal{(。)(。)}! |
#include <iostream> using namespace std; #define MAXI 10011 bool pri[MAXI]; void init() { int i, j; pri[0] = pri[1] = 1; for (i = 4; i < MAXI; i += 2) pri[i] = 1; for (i = 3; i < MAXI; i += 2) if (!pri[i]) for (j = i * i; j < MAXI; j += i) pri[j] = 1; } int main() { int n, i, tsu; init(); while (scanf("%d", &n), n) { for (tsu = 0, i = 1; i < n / 2; i += 2) if (!pri[i] && !pri[n - i]) tsu++; printf("%d\n", tsu); } return 0; }
水到恒…………