- 分享
不要点
- @ 2026-10-20 15:55:09
你的胆子真是肥嘟嘟的,敢点开!!!!!!!!!!!!!!!!!
13 条评论
-
-
#include <cmath> using namespace std; bool isPrime(int x) { if (x < 2) return false; for (int i = 2; i <= sqrt(x); i++) { if (x % i == 0) return false; } return true; } int main() { int n; cin >> n; int count = 0; int number = 2; while (true) { if (isPrime(number)) { count++; if (count == n) { cout << number; break; } } number++; } return 0; }
- 1