全是RE
查看原帖
全是RE
1351761
chenhany楼主2024/8/22 21:40
#include<bits/stdc++.h>
using namespace std;
bool a[10000001];
long long b[10000001], n, k = 0, f, c[100001];
int main() {


	cin >> n;
	cin >> f;
	for (long long i = 0; i < f; i++) {
		cin >> c[i];

	}
	for (long long i = 2; i <= n; i++) {
		if (!a[i]) {
			b[k++] = i;
		}
		for (long long j = 0; k && i * a[j] < n; j++) {
			a[b[j]*i] = 1;
			if (i % b[j] == 0) {
				break;
			}
		}
	}
	for (long long i = 0; i < f; i++) {
		cout << b[c[i] - 1]<<endl;

	}
	return 0;



}
2024/8/22 21:40
加载中...