1 条题解
-
0
C++ :
#include<iostream> #include<math.h> using namespace std; bool isPrime(int num); int main() { for (int y = 0; y <= 1; y++) { for (int m = 1; m <= 12; m++) { if (m == 2 && y == 0) { for (int i = 19880001 + y * 10000 + m * 100; i <= 19880029 + y * 10000 + m * 100; i++) { if(isPrime(i)) cout << i << endl; } } else if (m == 2 && y == 1) { for (int i = 19880001 + y * 10000 + m * 100; i <= 19880028 + y * 10000 + m * 100; i++) { if(isPrime(i)) cout << i << endl; } } else if (m == 4 || m == 6 || m == 9 || m == 11) { for (int i = 19880001 + y * 10000 + m * 100; i <= 19880030 + y * 10000 + m * 100; i++) { if(isPrime(i)) cout << i << endl; } } else { for (int i = 19880001 + y * 10000 + m * 100; i <= 19880031 + y * 10000 + m * 100; i++) { if(isPrime(i)) cout << i << endl; } } } } return 0; } bool isPrime(int num) { if (num % 2 == 0) return false; for (int i = 3; i < sqrt(num * 1.0); i = i + 2) { if (num % i == 0) return false; } return true; }
- 1
信息
- ID
- 3174
- 时间
- 1000ms
- 内存
- 128MiB
- 难度
- (无)
- 标签
- 递交数
- 0
- 已通过
- 0
- 上传者