标签：ati span BMI letter write with style pac cst
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 48161 | Accepted: 18300 |
Description
Every even number greater than 4 can be
written as the sum of two odd prime numbers.
8 = 3 + 5. Both 3 and 5 are odd prime numbers.
20 = 3 + 17 = 7 + 13.
42 = 5 + 37 = 11 + 31 = 13 + 29 = 19 + 23.
Input
Output
Sample Input
8 20 42 0
Sample Output
8 = 3 + 5 20 = 3 + 17 42 = 5 + 37
Source
1 #include <iostream> 2 #include <cstdio> 3 using namespace std; 4 5 bool isprime[1000010]; //1 -> 合数， 0 -> 质数 6 7 int main() 8 { 9 isprime[0] = isprime[1] = 1; 10 for (register int i = 2 ; i <= 1000001 ; i ++) 11 { 12 if (isprime[i]) continue; 13 for (register int j = i ; j <= 1000001/i ; j ++) 14 isprime[i*j] = 1; 15 } 16 17 int n; 18 while (scanf("%d", &n) != EOF) 19 { 20 if (n == 0) return 0; 21 for (register int i = 0 ; i <= n ; i ++) 22 { 23 if (!isprime[i] and !isprime[n-i]) 24 { 25 printf("%d = %d + %d\n", n, i, n-i); 26 break; 27 } 28 } 29 } 30 31 }
[POJ2262] Goldbach’s Conjecture
标签：ati span BMI letter write with style pac cst
原文地址：https://www.cnblogs.com/zZh-Brim/p/9152918.html
