/*
* Author: Arpit Bhayani
* https://arpitbhayani.me
*/
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <deque>
#include <iostream>
#include <list>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define ll long long
#define MIN(a, b) a < b ? a : b
using namespace std;
// int array[10010];
//
// void fill() {
// array[1] = 1;
// array[0] = 1;
// for(int i = 2; i < 10001; i++) {
// if(array[i] == 1) {
// continue;
// }
// array[i] = 0;
// for(int j = 2; i * j < 10010; j++) {
// array[i*j] = 1;
// }
// }
// }
int is_prime(int n) {
for(int i = 2; i < n; i++) {
if(n % i == 0) {
return 0;
}
}
return 1;
}
int main(int argc, char *argv[]) {
int t;
scanf("%d", &t);
char ans[2][8] = {"no", "yes"};
while( t-- ) {
int n;
scanf("%d", &n);
printf("%s\n", ans[is_prime(n)]);
}
return 0;
}
System Design Masterclass
A masterclass that helps you become great at designing scalable, fault-tolerant, and highly available systems.
1000+ learners
Details →Redis Internals
Learn internals of Redis by re-implementing some of the core features in Golang.
46+ learners
Details →