6 条题解
-
-1
2024stu545
LV 4
@ 2025-3-30 15:54:33
a
-
-1
2024stu454 LV 2 @ 2025-3-17 17:02:08
#include<bits/stdc++.h> int n,t; bool isPrime(int t){ if(t1) return 0; for(int i=2;i*i<=t;i++) if(t%i0) return 0; return 1; } int main(){ scanf("%d",&n); while(n--){ scanf("%d",&t); printf(isPrime(t)?"YES\n":"NO\n"); } return 0; }
-
-1
2024stu690 LV 6 @ 2024-12-7 11:22:55
A
-
-2
2024stu322
LV 4
@ 2024-8-16 13:32:57
A
-
-4
2024stu290 LV 5 @ 2024-8-16 10:48:08
w
- 1
