解题思路:
啊,筛表好笨啊。
参考代码:
#include<bits/stdc++.h> using namespace std; typedef long long LL; const int N = 50000; int is(int num) { for (int i = 2; i*i <= num; i++) if (num % i == 0) return 0; return 1; } int main() { int data[N] = { 0 }; for (int i = 2; i < N / 2; i++) { if (is(i)) for (int n = 2; n*i < N; n++) data[n*i] = 1; } int num, poi; cin >> num; while (num--) { cin >> poi; int token = 0; for (int i = 2; i < N; i++) { if (poi / i > 1 && !data[i] && poi % i == 0 && !data[poi / i]) { cout << "Yes" << endl; token = 1; break; } } if (!token) cout << "No" << endl; } return 0; }
0.0分
0 人评分