1013 数素数 (20 分)
AC代码
#include <iostream>
#include <cmath>
using namespace std;
int isPrime(int x);
int main() {
int M, N;
cin >> M >> N;
int i = 2, cnt = 0;
while (cnt != N) {
if (isPrime(i)) {
cnt++;
if (cnt >= M) {
cout << i;
if ((cnt - M + 1) % 10 != 0 && cnt != N) cout << " ";
else if ((cnt - M + 1) % 10 == 0 && cnt != N) cout << endl;
}
}
i++;
}
return 0;
}
int isPrime(int x) {
int ret = 1;
for (int i = 2; i <= sqrt(x); i++) if (x%i == 0) { ret = 0; break; }
if (x == 1) ret = 0;
return ret;
}