1 条题解
-
1
#include <bits/stdc++.h> using namespace std; #define ls u << 1 #define rs u << 1 | 1 #define LL long long #define int long long #define PII pair <int, int> #define fi first #define se second #define pub push_back #define pob pop_back #define puf push_front #define pof pop_front #define lb lower_bound #define ub upper_bound #define i128 __int128 #define pcnt(x) __builtin_popcount(x) #define mem(a,goal) memset(a, (goal), sizeof(a)) #define rep(x,start,end) for(int x = (start) - ((start) > (end)); x != (end) - ((start) > (end)); ((start) < (end) ? x ++ : x --)) #define aLL(x) (x).begin(), (x).end() #define sz(x) (int)(x).size() const int INF = 998244353; const int mod = 1e9 + 7; const int N = 100010; int a[N]; void solve() { int x, k; cin >> x >> k; if(x == 1 && k == 2) { cout << "YES" << '\n'; return ; } if(k == 1) { if(x == 1) { cout << "NO" << '\n'; return ; } for(int i = 2; i <= x / i; ++ i) { if(x % i == 0) { cout << "NO" << '\n'; return ; } } cout << "YES" << '\n'; } else cout << "NO" << '\n'; } signed main() { int t = 1; cin >> t; while (t --) solve(); return 0; }
- 1
信息
- ID
- 5570
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- 10
- 标签
- 递交数
- 1
- 已通过
- 1
- 上传者