题解 | Prime Number

#include <iostream>
using namespace std;
int su(int k) {
    for (int i = 2; i * i <= k; i++) {
        if (k % i == 0)
            return 0;
    }
    return 1;
}
int main() {
    int n;
    while (cin >> n) { // 注意 while 处理多个 case
        int l = 0, i;
        for (i = 2; l != n; i++) {
            if (su(i) == 1) {
                l++;
            }
        }
        cout << i - 1 << endl;
    }
}
// 64 位输出请用 printf("%lld")