buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
#include <math.h>
#include <stdio.h>
int is_Prime(int m);
int main() {
int a[10000], n, i;
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
if (is_Prime(a[i]) == 1) {
count++;
}
}
printf("%d\n", count);
return 0;
}
int i... | #include <math.h>
#include <stdio.h>
int is_Prime(int m);
int main() {
int a[10000], n, i;
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
if (is_Prime(a[i]) == 1) {
count++;
}
}
printf("%d\n", count);
return 0;
}
int i... | [["+", 0, 57, 15, 23, 0, 16, 31, 16, 17, 20], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 98], ["+", 15, 23, 0, 16, 12, 16, 31, 16, 31, 22]] | 0 | 162 | 4 |
#include <math.h>
#include <stdio.h>
int isPrime(int);
int main() {
int a[10000], i, n, c = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (isPrime(a[i] == 1))
c++;
}
printf("%d\n", c);
return 0;
}
int isPrime(int x) {
int i;
if (x == 2)
return 1;
if (x < 2 |... | #include <math.h>
#include <stdio.h>
int isPrime(int);
int main() {
int a[10000], i, n, c = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (isPrime(a[i]) == 1)
c++;
}
printf("%d\n", c);
return 0;
}
int isPrime(int x) {
int i;
if (x == 2)
return 1;
if (x < 2 |... | [["+", 15, 23, 0, 16, 31, 2, 3, 4, 0, 25], ["-", 0, 57, 15, 23, 0, 2, 3, 4, 0, 25]] | 0 | 166 | 2 |
#include <math.h>
#include <stdio.h>
int isprime(int);
int main(void) {
int n, x[10000], i, a = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &x[i]);
}
for (i = 0; i < n; i++) {
if (isprime(x[i]) == 1)
a++;
}
printf("%d", a);
return 0;
}
int isprime(int x) {
int i;
if (x... | #include <math.h>
#include <stdio.h>
int isprime(int);
int main(void) {
int n, x[10000], i, a = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &x[i]);
}
for (i = 0; i < n; i++) {
if (isprime(x[i]) == 1)
a++;
}
printf("%d\n", a);
return 0;
}
int isprime(int x) {
int i;
if ... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 185 | 3 |
#include <stdio.h>
int isPrime(int x) {
int i;
if (x <= 1)
return 0;
else if (x <= 3)
return 1;
if (x % 2 == 0)
return 0;
if (x % 3 == 0)
return 0;
for (i = 6; i * i <= x; i += 6) {
if (x % (i - 1) == 0)
return 0;
if (x % (i + 1) == 0)
return 0;
}
return 1;
}
int ... | #include <stdio.h>
int isPrime(int x) {
int i;
if (x <= 1)
return 0;
else if (x <= 3)
return 1;
if (x % 2 == 0)
return 0;
if (x % 3 == 0)
return 0;
for (i = 5; i * i <= x; i += 6) {
if (x % i == 0)
return 0;
if (x % (i + 2) == 0)
return 0;
}
return 1;
}
int main()... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 15, 23, 0, 16, 31, 16, 12, 23, 0, 24], ["-", 0, 16, 31, 16, 12, 23, 0, 16, 17, 33], ["-", 0, 16, 31, 16, 12, 23, 0, 16, 12, 13], ["-", 15, 23, 0, 16, 31, 16, 12, 23, 0, 25], ["+", 0, 16, 31, 16, 12, 23, 0, 16, 12, 13]] | 0 | 181 | 8 |
#include <stdio.h>
// If prime, return 1, else return 0.
int isPrime(int num) {
int rtn = 1;
int i;
for (i = 2; i * i <= num; i++) {
if (num % i == 0) {
rtn = 0;
break;
}
}
return rtn;
}
int main(void) {
int sum, num;
int i;
int ans = 0;
scanf("%d", &sum);
for (i = 0; i < su... | #include <stdio.h>
// If prime, return 1, else return 0.
int isPrime(int num) {
int rtn = 1;
int i;
for (i = 2; i * i <= num; i++) {
if (num % i == 0) {
rtn = 0;
break;
}
}
return rtn;
}
int main(void) {
int sum, num;
int i;
int ans = 0;
scanf("%d", &sum);
for (i = 0; i < su... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 132 | 3 |
#include <stdio.h>
int prime(int);
int main() {
int n, p, i, j, count = 0;
scanf("%d", &j);
for (i = 0; i < j; i++) {
scanf("%d", &n);
p = prime(n);
if (p == 1) {
count++;
}
}
printf("%d\n", count);
return 0;
}
int prime(int n) {
int i;
if (n < 2)
return 0;
else if (n =... | #include <stdio.h>
int prime(int);
int main() {
int n, p, i, j, count = 0;
scanf("%d", &j);
for (i = 1; i <= j; i++) {
scanf("%d", &n);
p = prime(n);
if (p == 1) {
count++;
}
}
printf("%d\n", count);
return 0;
}
int prime(int n) {
int i;
if (n < 2)
return 0;
else if (n ... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 166 | 6 |
#include <math.h>
#include <stdio.h>
#define N 100000
int main() {
int A[N];
int i, n, j;
int cnt = 0, flag;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
flag = 0;
for (j = 2; j < sqrt(A[i]); ++j) {
if (A[i] % j == 0) {
flag = 1;
break;
}
}
... | #include <math.h>
#include <stdio.h>
#define N 100000
int main() {
int A[N];
int i, n, j;
int cnt = 0, flag;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
flag = 0;
for (j = 2; j <= sqrt(A[i]); j++) {
if (A[i] % j == 0) {
flag = 1;
break;
}
}
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 17, 29]] | 0 | 137 | 4 |
#include <math.h>
#include <stdio.h>
int isPrime(int);
int main() {
int i = 0, n, total = 0;
int num[10000];
scanf("%d", &n);
while ((scanf("%d", &num[i])) != EOF) {
i++;
}
for (i = 0; i < n; i++) {
if (isPrime(num[i]))
total++;
}
printf("%d\n", total);
return 0;
}
int isPrime(int ... | #include <math.h>
#include <stdio.h>
int isPrime(int);
int main() {
int i = 0, n, total = 0;
int num[10000];
scanf("%d", &n);
while ((scanf("%d", &num[i])) != EOF) {
i++;
}
for (i = 0; i < n; i++) {
if (isPrime(num[i]))
total++;
}
printf("%d\n", total);
return 0;
}
int isPrime(int ... | [["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 79], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 60]] | 0 | 176 | 2 |
#include <math.h>
#include <stdio.h>
int Prime(int);
int main() {
int n, i, j, input, count = 0, frag;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &input);
if (Prime(input) == 1)
count++;
}
printf("%d\n\n", count);
return 0;
}
int Prime(x) {
int i;
if (x == 2)
return 1;
e... | #include <math.h>
#include <stdio.h>
int Prime(int);
int main() {
int n, i, j, input, count = 0, frag;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &input);
if (Prime(input) == 1)
count++;
}
printf("%d\n", count);
return 0;
}
int Prime(x) {
int i;
if (x == 2)
return 1;
els... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 162 | 3 |
#include <math.h>
#include <stdio.h>
int sosuu(int);
int main() {
int n, i, num = 0;
scanf("%d", &n);
int a;
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (sosuu(a) == 0) {
num++;
}
}
printf("%d\n", num);
return 0;
}
int sosuu(int x) {
int i;
if (x == 2)
return 0;
else if (x... | #include <math.h>
#include <stdio.h>
int sosuu(int);
int main() {
int n, i, num = 0;
scanf("%d", &n);
int a;
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (sosuu(a) == 0) {
num++;
}
}
printf("%d\n", num);
return 0;
}
int sosuu(int x) {
int i;
if (x == 2)
return 0;
else if (x... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 161 | 2 |
#include <math.h>
#include <stdio.h>
int main() {
int n, a[10000], cnt = 0, i, j, k = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
k = 0;
if (a[i] == 2) {
cnt += 1;
continue;
}
if (a[i] % 2 == 0)
continue;
j = 3;
wh... | #include <math.h>
#include <stdio.h>
int main() {
int n, a[10000], cnt = 0, i, j, k = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
k = 0;
if (a[i] == 2) {
cnt += 1;
continue;
}
if (a[i] % 2 == 0) {
continue;
}
j = 3... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 8, 9, 0, 52, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 23, 0, 16, 17, 19]] | 0 | 188 | 4 |
#include <math.h>
#include <stdio.h>
#define N 10000
#define TRUE 1
#define FALSE 0
int isprime(int);
int main() {
int i, j, num, A[N], count = 0;
while (1) {
scanf("%d", &num);
if (1 <= num && num <= N)
break;
}
for (i = 0; i < num; i++)
scanf("%d", &A[i]);
for (i = 0; i < num; i++)
... | #include <math.h>
#include <stdio.h>
#define N 10000
#define TRUE 1
#define FALSE 0
int isprime(int);
int main() {
int i, j, num, A[N], count = 0;
while (1) {
scanf("%d", &num);
if (1 <= num && num <= N)
break;
}
for (i = 0; i < num; i++)
scanf("%d", &A[i]);
for (i = 0; i < num; i++)
... | [["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 79], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 60]] | 0 | 206 | 2 |
#include <math.h>
#include <stdio.h>
#define N 10000
#define TRUE 1
#define FALSE 0
int isprime(int);
int main() {
int i, j, num, A[N], count = 0;
while (1) {
scanf("%d", &num);
if (1 <= num && num <= N)
break;
}
for (i = 0; i < num; i++) {
scanf("%d", &A[i]);
if (A[i] < 2 || N * N < A... | #include <math.h>
#include <stdio.h>
#define N 10000
#define TRUE 1
#define FALSE 0
int isprime(int);
int main() {
int i, j, num, A[N], count = 0;
while (1) {
scanf("%d", &num);
if (1 <= num && num <= N)
break;
}
for (i = 0; i < num; i++) {
scanf("%d", &A[i]);
if (A[i] < 2 || N * N < A... | [["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 79], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 60]] | 0 | 232 | 2 |
#include <stdio.h>
int IsPrime(int);
int main(void) {
int data, n, i, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &data);
if (IsPrime(data))
count++;
}
printf("%d\n", count);
return 0;
}
int IsPrime(int x) {
int i;
if (x == 2)
return 1;
if (x < 2 || x %... | #include <stdio.h>
int IsPrime(int);
int main(void) {
int data, n, i, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &data);
if (IsPrime(data) == 1)
count++;
// printf("data=%d count=%d\n",data,count);
}
printf("%d\n", count);
return 0;
}
int IsPrime(int x) {
i... | [["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 151 | 4 |
#include <math.h>
#include <stdio.h>
#define N 10000
#define TRUE 0
#define FALSE -1
int prime(int);
int main() {
int n, num[N], i, j, flag = 0, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &num[i]);
}
for (i = 0; i < n; i++) {
if (prime(num[i]) == TRUE)
count++;
}
... | #include <math.h>
#include <stdio.h>
#define N 10000
#define TRUE 0
#define FALSE -1
int prime(int);
int main() {
int n, num[N], i, j, flag = 0, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &num[i]);
}
for (i = 0; i < n; i++) {
if (prime(num[i]) == TRUE)
count++;
}
... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 98], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 106]] | 0 | 197 | 2 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
int n, i, j, c = 0;
int A[10000];
scanf("%d", &n);
if (n < 1 || 100000 < n)
exit(1);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
if (A[i] < 2 || 100000000 < A[i])
exit(2);
}
for (i = 0; i < n; i++) {
if (A[i... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
int n, i, j, c = 0;
int A[10000];
scanf("%d", &n);
if (n < 1 || 100000 < n)
exit(1);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
if (A[i] < 2 || 100000000 < A[i])
exit(2);
}
for (i = 0; i < n; i++) {
if (A[i... | [["-", 15, 16, 12, 2, 3, 4, 0, 16, 17, 85], ["-", 15, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 16, 12, 2, 3, 4, 0, 16, 17, 85], ["-", 0, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 0 | 216 | 4 |
#include <math.h>
#include <stdio.h>
int prime(int x) {
int i = 3;
if (x == 2)
return 1;
if (x < 2 || x % 2 == 0)
return 0;
while (i <= sqrt(x)) {
if (x % i == 0)
return 0;
i += 2;
}
return 1;
}
int main() {
int i, n, count = 0;
int a[10000];
scanf("%d", &n);
for (i = 0; i... | #include <math.h>
#include <stdio.h>
int prime(int x) {
int i = 3;
if (x == 2)
return 1;
if (x < 2 || x % 2 == 0)
return 0;
while (i <= sqrt(x)) {
if (x % i == 0)
return 0;
i += 2;
}
return 1;
}
int main() {
int i, n, count = 0;
int a[10000];
scanf("%d", &n);
for (i = 0; i... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 11, 12, 2, 3, 4, 0, 69, 71, 22], ["+", 0, 11, 12, 2, 3, 4, 0, 69, 71, 22]] | 0 | 162 | 6 |
#include <math.h>
#include <stdio.h>
#define Max 10000
int sosuu(int);
int main() {
int a, n, sum = 0;
int judge;
int x[Max];
scanf("%d", &n);
for (a = 0; a < n; a++) {
scanf("%d", &x[a]);
}
for (a = 0; a < n; a++) {
judge = sosuu(x[a]);
if (judge == 0)
sum++;
}
printf("%d\n", s... | #include <math.h>
#include <stdio.h>
#define Max 10000
int sosuu(int);
int main() {
int a, n, sum = 0;
int judge;
int x[Max];
scanf("%d", &n);
for (a = 0; a < n; a++) {
scanf("%d", &x[a]);
}
for (a = 0; a < n; a++) {
judge = sosuu(x[a]);
if (judge == 0)
sum++;
}
printf("%d\n", s... | [["-", 8, 9, 0, 7, 15, 16, 31, 16, 17, 48], ["-", 8, 9, 0, 7, 15, 16, 31, 16, 12, 22]] | 0 | 208 | 2 |
#include <math.h>
#include <stdio.h>
int primenm(int x) {
int i;
if (x == 2) {
return 0;
} else if (x % 2 == 0) {
return 0;
} else {
for (i = 3; i <= sqrt(x); i += 2) {
if (x % i == 0) {
return 0;
}
}
return 1;
}
}
int main() {
int n, a, i, cnt = 0;
scanf("%d", &... | #include <math.h>
#include <stdio.h>
int primenm(int x) {
int i;
if (x == 2) {
return 1;
} else if (x % 2 == 0) {
return 0;
} else {
for (i = 3; i <= sqrt(x); i += 2) {
if (x % i == 0) {
return 0;
}
}
return 1;
}
}
int main() {
int n, a, i, cnt = 0;
scanf("%d", &... | [["-", 8, 9, 0, 57, 64, 9, 0, 37, 0, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 13]] | 0 | 155 | 2 |
#include <math.h>
#include <stdio.h>
#define N 10000
#define T 1
#define F 0
int isprime(int x) {
int i;
if (x == 2) {
return T;
}
if (x < 2 || x % 2 == 0) {
return F;
}
i = 3;
while (i <= sqrt(x)) {
if (x % i == 0)
return F;
i = i + 2;
return T;
}
}
int main() {
int... | #include <math.h>
#include <stdio.h>
#define N 10000
#define T 1
#define F 0
int isprime(int x) {
int i;
if (x == 2) {
return T;
}
if (x < 2 || x % 2 == 0) {
return F;
}
i = 3;
while (i <= sqrt(x)) {
if (x % i == 0)
return F;
i += 2;
}
return T;
}
int main() {
int i, n,... | [["-", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 0 | 180 | 6 |
#include <stdio.h>
int prime(int);
int main() {
int A[10000];
int i, n;
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < n; i++) {
if (prime(A[i]))
count++;
printf("%d\n", count);
}
return 0;
}
int prime(int A) {
int j;
if (A < 2)... | #include <stdio.h>
int prime(int);
int main() {
int A[10000];
int i, n;
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < n; i++) {
if (prime(A[i]))
count++;
}
printf("%d\n", count);
return 0;
}
int prime(int A) {
int j;
if (A < 2)
... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 181 | 2 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int n, i, a, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (a == 2)
count += 1;
if (a % 2 != 0) {
j = 3;
while (1) {
if (a % j == 0)
break;
if ((j * j) >=... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int n, i, a, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (a == 2)
count += 1;
if (a % 2 != 0) {
j = 3;
while (1) {
if (a % j == 0)
break;
if ((j * j) > ... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["-", 64, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["+", 64, 9, 0, 57, 15, 23, 0, 16, 17, 47]] | 0 | 143 | 6 |
#include <math.h>
#include <stdio.h>
int main(void) {
int n, a, b, i, j, count = 0, A[10000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
j = 2;
b = sqrt(a);
while (a % j > 0 && j <= b)
j++;
if (j == b) {
A[count] = a;
count++;
}
}
printf("%d\n", coun... | #include <math.h>
#include <stdio.h>
int main(void) {
int n, a, b, i, j, count = 0, A[10000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
j = 2;
b = sqrt(a);
while (a % j > 0 && j <= b)
j++;
if (j == b + 1) {
A[count] = a;
count++;
}
}
printf("%d\n", ... | [["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 123 | 2 |
#include <stdio.h>
#include <stdlib.h>
int prime_or_not(int x) {
int i;
for (i = 2; i ^ 2 <= x; i++) {
if (x % i == 0)
return 0;
}
return 1;
}
int main() {
int i, n, x, y;
y = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &x);
y = y + prime_or_not(x);
}
printf("%d\n",... | #include <stdio.h>
#include <stdlib.h>
int prime_or_not(int x) {
int i;
for (i = 2; i * i <= x; i++) {
if (x % i == 0)
return 0;
}
return 1;
}
int main() {
int i, n, x, y;
y = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &x);
y = y + prime_or_not(x);
}
printf("%d\n",... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 140], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 31, 13], ["+", 8, 9, 0, 7, 15, 16, 31, 16, 17, 48], ["+", 8, 9, 0, 7, 15, 16, 31, 16, 12, 22]] | 0 | 122 | 4 |
#include <stdio.h>
int prime(int a) {
int i;
if (a <= 1)
return 1;
if (a == 2)
return 0;
if (a % 2 == 0)
return 1;
for (i = 3; i * i < a; i += 2) {
if (a % i == 0)
return 1;
}
return 0;
}
int main(void) {
int i, n, a, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
... | #include <stdio.h>
int prime(int a) {
int i;
if (a <= 1)
return 1;
if (a == 2)
return 0;
if (a % 2 == 0)
return 1;
for (i = 3; i * i <= a; i += 2) {
if (a % i == 0)
return 1;
}
return 0;
}
int main(void) {
int i, n, a, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 152 | 2 |
#include <math.h>
#include <stdio.h>
int main() {
int n, num, kazu, i, j;
int A[10000];
double b;
scanf("%d", &n);
kazu = 0;
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
num = 0;
b = sqrt(A[i]);
for (j = 1; j < b; j++) {
if (A[i] % j == 0) {
num++;
}
}
if (n... | #include <math.h>
#include <stdio.h>
int main() {
int n, num, kazu, i, j;
int A[10000];
double b;
scanf("%d", &n);
kazu = 0;
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
num = 0;
b = sqrt(A[i]);
for (j = 1; j <= b; j++) {
if (A[i] % j == 0) {
num++;
}
}
if (... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 141 | 2 |
#include <math.h>
#include <stdio.h>
int main(void) {
int n, count = 0, i, s, key;
long a;
scanf("%d", &n);
for (i = 0; i < n; i++) {
s = key = 2;
scanf("%ld", &a);
if (a == 1)
a;
else if (a == 2) { /*printf("sosuu\n");*/
count++;
} else {
while (count < sqrt(a) + 1 && key ... | #include <math.h>
#include <stdio.h>
int main(void) {
int n, count = 0, i, s, key;
long a;
scanf("%d", &n);
for (i = 0; i < n; i++) {
s = key = 2;
scanf("%ld", &a);
if (a == 1)
a;
else if (a == 2) { /*printf("sosuu\n")*/
;
count++;
} else {
while (s < sqrt(a) + 2 && k... | [["+", 75, 76, 0, 57, 64, 9, 0, 1, 0, 35], ["-", 0, 52, 15, 23, 0, 16, 31, 16, 31, 22], ["+", 0, 52, 15, 23, 0, 16, 31, 16, 31, 22], ["-", 15, 23, 0, 16, 31, 16, 12, 16, 12, 13], ["+", 15, 23, 0, 16, 31, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 0 | 163 | 6 |
#include <stdio.h>
int hantei(int x) {
int i;
if (x < 2)
return 0;
else if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
for (i = 3; i * i < x; i += 2) {
if (x % i == 0)
return 0;
}
return 1;
}
int main() {
int answer = 0;
int n, x, i;
scanf("%d", &n);
for (i = 0; i < n... | #include <stdio.h>
int hantei(int x) {
int i;
if (x < 2)
return 0;
else if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
for (i = 3; i * i <= x; i += 2) {
if (x % i == 0)
return 0;
}
return 1;
}
int main() {
int answer = 0;
int n, x, i;
scanf("%d", &n);
for (i = 0; i < ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 151 | 2 |
#include <math.h>
#include <stdio.h>
int main() {
int n, y, i, j, c, m, p;
c = 0;
scanf("%d", &n);
for (i = 0; i < n; ++i) {
scanf("%d", &y);
if (y == 2) {
c = c + 1;
} else if (y < 2 || y % 2 == 0) {
}
else {
m = sqrt(y);
p = 0;
for (j = 3; j <= m; j = j + 2) ... | #include <math.h>
#include <stdio.h>
int main() {
int n, y, i, j, c, m, p;
c = 0;
scanf("%d", &n);
for (i = 0; i < n; ++i) {
scanf("%d", &y);
if (y == 2) {
c = c + 1;
} else if (y < 2 || y % 2 == 0) {
}
else {
m = sqrt(y);
p = 0;
for (j = 3; j <= m; j = j + 2) ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 168 | 2 |
#include <stdio.h>
int isPrime(int x) {
int i;
if (x == 2) {
return 1;
} else if (x <= 1 || x % 2 == 0) {
return 0;
}
for (i = 3; i * i <= x; i += 2) {
if (x % i == 0) {
return 0;
}
return 1;
}
}
int main(void) {
int n, x, i;
int ans = 0;
scanf("%d", &n);
for (i = 0; i ... | #include <stdio.h>
int isPrime(int x) {
int i;
if (x == 2) {
return 1;
} else if (x < 2 || x % 2 == 0) {
return 0;
}
for (i = 3; i * i <= x; i += 2) {
if (x % i == 0) {
return 0;
}
}
return 1;
}
int main(void) {
int n, x, i;
int ans = 0;
scanf("%d", &n);
for (i = 0; i < n;... | [["-", 0, 57, 15, 23, 0, 16, 31, 16, 17, 19], ["-", 0, 57, 15, 23, 0, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 36, 36, 0, 30, 0, 14, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9,... | 0 | 158 | 8 |
#include <math.h>
#include <stdio.h>
int isPrime(int x) {
int i;
double s;
if (x == 2)
return 1;
if (x < 2 || x % 2 == 0)
return 0;
s = sqrt(x);
for (i = 3; i < s; i += 2)
if (x % i == 0)
return 0;
return 1;
}
int main() {
int c, i, n, x;
scanf("%d", &n);
c = 0;
for (i = ... | #include <math.h>
#include <stdio.h>
int isPrime(int x) {
int i;
double s;
if (x == 2)
return 1;
if (x < 2 || x % 2 == 0)
return 0;
s = sqrt(x);
for (i = 3; i <= s; i += 2)
if (x % i == 0)
return 0;
return 1;
}
int main() {
int c, i, n, x;
scanf("%d", &n);
c = 0;
for (i =... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 154 | 2 |
#include <math.h>
#include <stdio.h>
#define N 1000
int isprime(int);
int main() {
int n, i, count = 0, x;
int array[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &array[i]);
x = isprime(array[i]);
if (x == 1)
count = count + 1;
}
printf("%d\n", count);
return 0;
}
int ispr... | #include <math.h>
#include <stdio.h>
#define N 10000
int isprime(int);
int main() {
int n, i, count = 0, x;
int array[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &array[i]);
x = isprime(array[i]);
if (x == 1)
count = count + 1;
}
printf("%d\n", count);
return 0;
}
int isp... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 38], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 13]] | 0 | 181 | 5 |
#include <math.h>
#include <stdio.h>
#define N 10000
int main() {
int n, a[N], i, j, judge, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
if (a[i] == 2)
judge = 0;
else if (a[i] < 2 || a[i] % 2 == 0)
judge = 1;
j = 3;
... |
#include <math.h>
#include <stdio.h>
#define N 10000
int main() {
int n, a[N], i, j, judge, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
judge = 0;
if (a[i] == 2)
judge = 0;
else if (a[i] < 2 || a[i] % 2 == 0)
judge = 1... | [["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 0 | 185 | 4 |
#include <math.h>
#include <stdio.h>
#define TRUE 1
#define FALSE 0
int isPrime(int n) {
int i, lim, flag;
if (n == 2)
return TRUE;
if (n < 2)
return FALSE;
if (n % 2 == 0)
return FALSE;
lim = sqrt(n);
flag = 0;
for (i = 3; i < lim; i += 2) {
if (n % i == 0) {
flag = 1;
brea... | #include <math.h>
#include <stdio.h>
#define TRUE 1
#define FALSE 0
int isPrime(int n) {
int i, lim, flag;
if (n == 2)
return TRUE;
if (n < 2)
return FALSE;
if (n % 2 == 0)
return FALSE;
lim = sqrt(n) + 1;
flag = 0;
for (i = 3; i < lim; i += 2) {
if (n % i == 0) {
flag = 1;
... | [["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 0 | 186 | 4 |
#include <stdio.h>
int IsPrime(int n);
int main(void) {
int n, i, x, count = 0;
scanf("%d", &n);
if (n >= 1 && n <= 10000) {
for (i = 0; i < n; i++) {
scanf("%d", &x);
if (x >= 2 && x <= 100000000) {
if (IsPrime(x)) {
count++;
}
}
}
printf("%d\n", count);
... | #include <stdio.h>
int IsPrime(int n);
int main(void) {
int n, i, x, count = 0;
scanf("%d", &n);
if (n >= 1 && n <= 10000) {
for (i = 0; i < n; i++) {
scanf("%d", &x);
if (x >= 2 && x <= 100000000) {
if (IsPrime(x)) {
count++;
}
}
}
printf("%d\n", count);
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 153 | 2 |
#include <math.h>
#include <stdio.h>
int main() {
int x[10000];
int n, i, j, flag;
int cnt = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &x[i]);
}
for (i = 0; i < n; i++) {
flag = 1;
for (j = 2; j < (int)(sqrt(x[i])); j++) {
if (x[i] % j == 0) {
flag = 0;
... | #include <math.h>
#include <stdio.h>
int main() {
int x[10000];
int n, i, j, flag;
int cnt = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &x[i]);
}
for (i = 0; i < n; i++) {
flag = 1;
for (j = 2; j <= (int)(sqrt(x[i])); j++) {
if (x[i] % j == 0) {
flag = 0;
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 151 | 2 |
#include <math.h>
#include <stdio.h>
int p_number(int x) {
int i;
double r;
if (x < 2) {
return 0;
} else if (x == 2) {
return 1;
} else if (x % 2 == 0) {
return 0;
}
r = sqrt(x);
for (i = 3; i < r; i += 2) {
if (x % i == 0)
return 0;
}
return 1;
}
int main() {
int num;
... | #include <math.h>
#include <stdio.h>
int p_number(int x) {
int i;
double r;
if (x < 2) {
return 0;
} else if (x == 2) {
return 1;
} else if (x % 2 == 0) {
return 0;
}
r = sqrt(x);
for (i = 3; i <= r; i += 2) {
if (x % i == 0)
return 0;
}
return 1;
}
int main() {
int num;... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 166 | 2 |
#include <math.h>
#include <stdio.h>
int main() {
int check(int);
int n;
int number[10000];
int i;
int j;
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &number[i]);
if (check(number[i]) == 1)
count++;
}
printf("%d\n", count);
return 0;
}
int check(int x... | #include <math.h>
#include <stdio.h>
int main() {
int check(int);
int n;
int number[10000];
int i;
int j;
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &number[i]);
if (check(number[i]) == 1)
count++;
}
printf("%d\n", count);
return 0;
}
int check(int x... | [["-", 0, 57, 15, 23, 0, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 12, 22]] | 0 | 171 | 2 |
#include <stdio.h>
int Sosuu(int);
int main() {
int n, a, count = 0, i = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (Sosuu(a))
count++;
}
printf("%d\n", count);
return 0;
}
int Sosuu(int x) {
int i;
if (x < 2)
return 0;
else if (x == 2)
return 1;
if (x ... | #include <stdio.h>
int Sosuu(int);
int main() {
int n, a, count = 0, i = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (Sosuu(a))
count++;
}
printf("%d\n", count);
return 0;
}
int Sosuu(int x) {
int i;
if (x < 2)
return 0;
else if (x == 2)
return 1;
if (x ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 158 | 2 |
#include <stdio.h>
#include <stdlib.h>
int IsPrime(int);
int main() {
int *A;
int n, count = 0;
int i;
scanf("%d", &n);
A = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
for (i = 0; i < n; i++) {
if (IsPrime(A[i]) == 1)
count++;
}
printf("%d\n", count)... | #include <stdio.h>
#include <stdlib.h>
int IsPrime(int);
int main() {
int *A;
int n, count = 0;
int i;
scanf("%d", &n);
A = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
for (i = 0; i < n; i++) {
if (IsPrime(A[i]) == 1)
count++;
}
printf("%d\n", count)... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 193 | 2 |
#include "math.h"
#include "stdio.h"
#include "stdlib.h"
int cls(int);
int main() {
int n;
int p;
int i;
int num = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &p);
if (cls(p) == 1)
num++;
}
printf("%d", num);
return 0;
}
int cls(int n) {
int num = (int)sqrt(n);
int i;... | #include "math.h"
#include "stdio.h"
#include "stdlib.h"
int cls(int);
int main() {
int n;
int p;
int i;
int num = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &p);
if (cls(p) == 1)
num++;
}
printf("%d\n", num);
return 0;
}
int cls(int n) {
int num = (int)sqrt(n);
int... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 148 | 3 |
#include <math.h>
#include <stdio.h>
#define N 10000
int Prime(int);
int main() {
int k[N], n;
int i, num = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &k[i]);
if (Prime(k[i]) == 0)
num++;
}
printf("%d\n", num);
return 0;
}
int Prime(int x) {
int j, num = 0;
if (x == 2)
... | #include <math.h>
#include <stdio.h>
#define N 10000
int Prime(int);
int main() {
int k[N], n;
int i, num = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &k[i]);
if (Prime(k[i]) == 0)
num++;
}
printf("%d\n", num);
return 0;
}
int Prime(int x) {
int j, num = 0;
if (x == 2)
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 174 | 2 |
#include <math.h>
#include <stdio.h>
int isPrime(int);
int main() {
int i, n;
int count = 0;
int num;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &num);
if (isPrime(num) == 1)
count++;
}
printf("%d\n", count);
return 0;
}
int isPrime(int num) {
if (num == 2)
return ... | #include <math.h>
#include <stdio.h>
int isPrime(int);
int main() {
int i, n;
int count = 0;
int num;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &num);
if (isPrime(num) == 1)
count++;
}
printf("%d\n", count);
return 0;
}
int isPrime(int num) {
if (num == 2)
return ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 153 | 2 |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
//?´???°?????°??????????????°??????
//??¨?????????????????????????????¨??????
int IsPrimeNumber(int num) {
int count = 0;
//?´???°????????????num?????§????¢??????§??????
//??????30?????§????´???°?????°????????????1*30???2*15???3*10???5*... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
//?´???°?????°??????????????°??????
//??¨?????????????????????????????¨??????
int IsPrimeNumber(int num) {
int count = 0;
//?´???°????????????num?????§????¢??????§??????
//??????30?????§????´???°?????°????????????1*30???2*15???3*10???5*... | [["+", 0, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 0, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 165 | 2 |
#include <iostream>
using namespace std;
int n;
int a;
int p = 0;
void is_prime() {
for (int i = 2; i * i < n; i++) {
if (a % i == 0) {
return;
}
}
p++;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
is_prime();
}
cout << p;
return 0;
} | #include <iostream>
using namespace std;
int n;
int a;
int p = 0;
void is_prime() {
for (int i = 2; i * i <= a; i++) {
if (a % i == 0) {
return;
}
}
p++;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
is_prime();
}
cout << p << endl;
return 0;
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 97 | 6 |
#include <stdio.h>
int q, n, c;
int main() {
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", &n);
if (c > 1)
c++;
for (int j = 2; j * j <= n; j++) {
if (n % j == 0) {
c--;
break;
}
}
}
printf("%d\n", c);
} | #include <stdio.h>
int q, n, c;
int main() {
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", &n);
if (n > 1)
c++;
for (int j = 2; j * j <= n; j++) {
if (n % j == 0) {
c--;
break;
}
}
}
printf("%d\n", c);
} | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 103 | 2 |
#include <bits/stdc++.h>
using namespace std;
int Prime(int num);
int main() {
int n;
int ans = 0;
cin >> n;
for (int i = 0, a; i < n; i++) {
cin >> a;
ans += Prime(a);
}
cout << ans << endl;
}
int Prime(int num) {
if (num == 2)
return 1;
if (num % 2 == 0)
return 0;
for (int i = 3; ... | #include <bits/stdc++.h>
using namespace std;
int Prime(int num);
int main() {
int n;
int ans = 0;
cin >> n;
for (int i = 0, a; i < n; i++) {
cin >> a;
ans += Prime(a);
}
cout << ans << endl;
}
int Prime(int num) {
if (num == 2)
return 1;
if (num % 2 == 0)
return 0;
for (int i = 3; ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 128 | 2 |
#include <iostream>
#include <math.h>
using namespace std;
bool isPrime(int x);
int main() {
int n = 0;
int a[10000] = {};
int z = 0; // output
cin >> n;
for (int i = 0; i < 10000; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
if (isPrime(a[i]) == true) {
z++;
}
}
cout << z... | #include <iostream>
#include <math.h>
using namespace std;
bool isPrime(int x);
int main() {
int n = 0;
int a[10000] = {};
int z = 0; // output
cin >> n;
for (int i = 0; i < 10000; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
if (isPrime(a[i]) == true) {
z++;
}
}
cout << z... | [["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 146], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 35]] | 1 | 172 | 3 |
#include <iostream>
#include <math.h>
using namespace std;
bool is_prime(int num) {
if (num < 2)
return false;
if (num == 2)
return true;
for (int i = 2; i < (int)sqrt(num); i++) {
if (num % i == 0) {
return false;
}
}
return true;
}
int main() {
int N;
int count = 0;
cin >> N;
... | #include <iostream>
#include <math.h>
using namespace std;
bool is_prime(int num) {
if (num < 2)
return false;
if (num == 2)
return true;
for (int i = 2; i <= sqrt(num); i++) {
if (num % i == 0)
return false;
}
return true;
}
int main() {
int N;
int count = 0;
cin >> N;
int num;
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 8, 9, 0, 7, 15, 16, 12, 74, 0, 24], ["-", 0, 7, 15, 16, 12, 74, 39, 77, 39, 40], ["-", 8, 9, 0, 7, 15, 16, 12, 74, 0, 25], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 132 | 7 |
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, m, i, count;
cin >> n;
count = 0;
for (int j = 0; j < n; ++j) {
cin >> m;
if (m == 2)
++count;
else if (m < 2 || m % 2 == 0) {
continue;
} else {
i = 3;
while (m <= sqrt(i)) {
if (m % ... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, m, i, count;
cin >> n;
count = 0;
for (int j = 0; j < n; ++j) {
cin >> m;
if (m == 2)
++count;
else if (m < 2 || m % 2 == 0) {
continue;
} else {
i = 3;
while (i <= sqrt(m)) {
if (m % ... | [["-", 0, 9, 0, 52, 15, 339, 51, 16, 31, 22], ["+", 0, 9, 0, 52, 15, 339, 51, 16, 31, 22], ["-", 15, 339, 51, 16, 12, 2, 3, 4, 0, 22], ["+", 15, 339, 51, 16, 12, 2, 3, 4, 0, 22], ["-", 0, 52, 8, 9, 0, 57, 64, 116, 0, 117], ["+", 0, 52, 8, 9, 0, 57, 64, 93, 0, 94], ["-", 0, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 0, 9... | 1 | 134 | 10 |
#include <cmath>
#include <iostream>
using namespace std;
int n, x, c;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
for (int j = 2; j <= (int)pow(x, 0.5); j++) {
if (x % j == 0) {
c++;
break;
}
}
}
cout << c << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int n, x, c;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
for (int j = 2; j <= (int)pow(x, 0.5); j++) {
if (x % j == 0) {
c++;
break;
}
}
}
cout << n - c << endl;
return 0;
} | [["+", 0, 1, 0, 16, 31, 16, 12, 16, 31, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33]] | 1 | 93 | 10 |
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/*
* If true, return not 0. If... | #define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/*
* If true, return not 0. If... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 304 | 2 |
#include <iostream>
using namespace std;
int main() {
long n;
long a[10000];
int ans = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
int check = 0;
for (int j = 1; j * j <= a[i]; ++j) {
if (a[i] % j == 0)
check++;
}
if (check == 2)
ans++;
}
cout << ans << ... | #include <iostream>
using namespace std;
int main() {
long n;
long a[10000];
int ans = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
int check = 0;
for (int j = 1; j * j <= a[i]; ++j) {
if (a[i] % j == 0)
check++;
}
if (check == 1)
ans++;
}
cout << ans << ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 111 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
bool primenumber(int num) {
int sq_num, judge;
sq_num = sqrt(num);
if (num == 2)
return true;
if (num % 2 == 0)
judge++;
for (int i = 2; i < sq_num; i++) {
if (num % i == 0)
judge++;
}
if (judge == 0) {
return true;
} else... | #include <cmath>
#include <iostream>
using namespace std;
bool primenumber(int num) {
int sq_num, judge;
sq_num = sqrt(num);
if (num == 2)
return true;
if (num % 2 == 0)
judge++;
for (int i = 2; i <= sq_num; i++) {
if (num % i == 0)
judge++;
}
if (judge == 0) {
return true;
} els... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 152 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
bool is_prime(int n) {
// naive program
int p = 2;
while (p * p < n) {
if (n % p == 0) {
return false;
}
p++;
}
return true;
}
int main() {
int N;
int cnt = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int n;
cin ... | #include <algorithm>
#include <iostream>
using namespace std;
bool is_prime(int n) {
// naive program
int p = 2;
while (p * p <= n) {
if (n % p == 0) {
return false;
}
p++;
}
return true;
}
int main() {
int N;
int cnt = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int n;
cin... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 19]] | 1 | 110 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, a, an;
cin >> n;
an = n;
while (n--) {
cin >> a;
if (a == 1)
an--;
for (int i = 2; i * i <= a; i++)
if (a % i == 0)
an--;
}
cout << an << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a, an;
cin >> n;
an = n;
while (n--) {
cin >> a;
if (a == 1)
an--;
for (int i = 2; i * i <= a; i++)
if (a % i == 0) {
an--;
break;
}
}
cout << an << endl;
return 0;
} | [["+", 8, 9, 0, 7, 8, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 57, 64, 9, 0, 1, 0, 35], ["+", 0, 7, 8, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 7, 8, 57, 64, 9, 0, 46]] | 1 | 83 | 4 |
#include <cmath>
#include <iostream>
using namespace std;
int prime(int x) {
if (x == 2)
return 1;
else if (x < 2 || x % 2 == 0)
return 0;
for (int i = 3; i < sqrt(x); i++)
if (x % i == 0)
return 0;
return 1;
}
int main() {
int n, m, cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
... | #include <cmath>
#include <iostream>
using namespace std;
int prime(int x) {
if (x == 2)
return 1;
else if (x < 2 || x % 2 == 0)
return 0;
for (int i = 3; i <= sqrt(x); i++)
if (x % i == 0)
return 0;
return 1;
}
int main() {
int n, m, cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 132 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int A[n], count = 0;
for (int i = 0; i < n; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
int L = A[i];
int M = sqrt(L);
for (int x = 2; x < M; x++) {
if (L % x == 0) {
count--;
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int A[n], count = 0;
for (int i = 0; i < n; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
int L = A[i];
int M = sqrt(L);
for (int x = 2; x <= M; x++) {
if (L % x == 0) {
count--;
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 129 | 2 |
#include <cmath>
#include <iostream>
const int MAX_N = 10000;
int main() {
int n = 0;
int numbers[MAX_N] = {0};
std::cin >> n;
int count = n;
for (int i = 0; i < n; i++) {
int x = 0;
std::cin >> x;
if (x == 2) {
continue;
}
if ((x > 2) && ((x % 2) == 0)) {
count--;
... | #include <cmath>
#include <iostream>
const int MAX_N = 10000;
int main() {
int n = 0;
int numbers[MAX_N] = {0};
std::cin >> n;
int count = n;
for (int i = 0; i < n; i++) {
int x = 0;
std::cin >> x;
if (x == 2) {
continue;
}
if ((x > 2) && ((x % 2) == 0)) {
count--;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117], ["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 35], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 15, 339, 51, 16, 31, 23, 0, 16, 12, 22], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 12, 22], ["-", 0, 7... | 1 | 211 | 8 |
#include <cmath>
#include <iostream>
using namespace std;
bool checkp(int m) {
if (m == 2)
return true;
if (m <= 1 || m % 2 == 0)
return false;
for (int i = 3; i < sqrt(m); i += 2) {
if (m % i == 0)
return false;
}
return true;
}
int main() {
int n, m, cnt = 0;
cin >> n;
for (int i =... | #include <cmath>
#include <iostream>
using namespace std;
bool checkp(int m) {
if (m == 2)
return true;
if (m <= 1 || m % 2 == 0)
return false;
for (int i = 3; i <= sqrt(m); i += 2) {
if (m % i == 0)
return false;
}
return true;
}
int main() {
int n, m, cnt = 0;
cin >> n;
for (int i ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 132 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
bool is_prime(int x) {
auto n = static_cast<int>(sqrt(x));
if (x % 2 == 0 && x != 2) {
return false;
}
for (int i = 3; i < n; i += 2) {
if (x % i == 0) {
return false;
}
}
return true;
}
int... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
bool is_prime(int x) {
auto n = static_cast<int>(sqrt(x)) + 1;
if (x % 2 == 0 && x != 2) {
return false;
}
for (int i = 3; i < n; i += 2) {
if (x % i == 0) {
return false;
}
}
return true;
}
... | [["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 198 | 2 |
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
vector<int> in_list;
vector<bool> isprime;
int m = 0, N, tmp, Nsqrt, cnt;
scanf("%d", &N);
for (int i = 0; i < N; ++i) {
scanf("%d", &tmp);
if (m < tmp)
m = tmp;
in_list.push_back(tmp);
}
isprime.re... | #include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
vector<int> in_list;
vector<bool> isprime;
int m = 0, N, tmp, Nsqrt, cnt;
scanf("%d", &N);
for (int i = 0; i < N; ++i) {
scanf("%d", &tmp);
if (m < tmp)
m = tmp;
in_list.push_back(tmp);
}
isprime.re... | [["-", 0, 11, 12, 16, 31, 2, 3, 4, 0, 22], ["+", 0, 11, 12, 16, 31, 2, 3, 4, 0, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 235 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define For(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
bool isprime(int N) {
if (N == 2)
return true;
if (N % 2 == 0)
return false;
f... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define For(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
bool isprime(int N) {
if (N == 2)
return true;
if (N % 2 == 0)
return false;
f... | [["+", 0, 57, 15, 339, 51, 91, 28, 23, 0, 24], ["+", 0, 57, 15, 339, 51, 91, 28, 23, 0, 25]] | 1 | 142 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
bool flag[10001] = {0};
for (int i = 2; i < 10001; i++) {
if (flag[i])
continue;
for (int j = i + i; j < 10001; j++)
flag[j] = true;
}
int n;
int d;
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> d;
int j... | #include <bits/stdc++.h>
using namespace std;
int main() {
bool flag[10001] = {0};
for (int i = 2; i < 10001; i++) {
if (flag[i])
continue;
for (int j = i + i; j < 10001; j += i)
flag[j] = true;
}
int n;
int d;
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> d;
in... | [["-", 0, 7, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 7, 8, 9, 0, 7, 26, 11, 17, 107], ["+", 0, 7, 8, 9, 0, 7, 26, 11, 12, 22]] | 1 | 173 | 3 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
struct NT {
vector<bool> isprime;
ll mod_mult(ll a, ll b, ll m) {
ll res = 0;
ll exp = a % m;
while (b) {
if (b & 1) {
res += exp;
if (res > m)
res -= m;
... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
struct NT {
vector<bool> isprime;
ll mod_mult(ll a, ll b, ll m) {
ll res = 0;
ll exp = a % m;
while (b) {
if (b & 1) {
res += exp;
if (res > m)
res -= m;
... | [["-", 0, 57, 15, 339, 51, 2, 3, 4, 0, 13], ["+", 0, 57, 15, 339, 51, 2, 3, 4, 0, 13]] | 1 | 527 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unor... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unor... | [["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22]] | 1 | 173 | 2 |
#include <bits/stdc++.h>
#define MAX 100000000
using namespace std;
int main() {
int n, res = 0;
cin >> n;
for (int i = 0, tmp; i < n; i++) {
cin >> tmp;
for (int j = 2; j * j <= tmp; j++) {
if (tmp % j == 0) {
res++;
break;
}
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define MAX 100000000
using namespace std;
int main() {
int n, res = 0;
cin >> n;
for (int i = 0, tmp; i < n; i++) {
cin >> tmp;
for (int j = 2; j * j <= tmp; j++) {
if (tmp % j == 0) {
res++;
break;
}
}
}
cout << n - res << endl;
return 0;
} | [["+", 0, 1, 0, 16, 31, 16, 12, 16, 31, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33]] | 1 | 90 | 2 |
#include <algorithm> //std::sort
#include <bitset> //std::bitset
#include <chrono> //std::chrono(C++11)
#include <cmath> //abs,std::pow,sqrt,sin,cos,round,floor,ceil
#include <cstdlib> //abs
#include <ctime> //localtime_s
#include <fstream> //std::ifstream,std::ofstream
#include <functional> //... | #include <algorithm> //std::sort
#include <bitset> //std::bitset
#include <chrono> //std::chrono(C++11)
#include <cmath> //abs,std::pow,sqrt,sin,cos,round,floor,ceil
#include <cstdlib> //abs
#include <ctime> //localtime_s
#include <fstream> //std::ifstream,std::ofstream
#include <functional> //... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 8, 9, 0, 7, 15, 16, 12, 2, 63, 22], ["-", 0, 7, 15, 16, 12, 2, 3, 4, 0, 24], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 15, 16, 12, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 85], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 22]] | 1 | 230 | 7 |
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int n, m;
;
cin >> m;
int count = m;
for (int s = 0; s < m; s++) {
cin >> n;
if (n == 2)
continue;
else if (n % 2 == 0)
count--;
else {
for (int i = 3; i < sqrt(n); i += 2) {
if... | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int n, m;
;
cin >> m;
int count = m;
for (int s = 0; s < m; s++) {
cin >> n;
if (n == 2)
continue;
else if (n % 2 == 0)
count--;
else {
for (int i = 3; i <= sqrt(n); i += 2) {
i... | [["-", 75, 76, 0, 9, 0, 7, 15, 16, 17, 18], ["+", 75, 76, 0, 9, 0, 7, 15, 16, 17, 19]] | 1 | 118 | 2 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool is_prime(long long n) {
for (int i = 2; i * i < n; i++) {
if (n % i)
return false;
}
return true;
}
int main() {
int n, count = 0;
long long m;
cin >> n;
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool is_prime(long long n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
int main() {
int n, count = 0;
long long m;
cin >>... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 112 | 4 |
#define FOR(i, min, max) for (int(i) = (min); (i) < (max); (i)++)
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, c = 0;
cin >> n;
FOR(i, 0, n) {
int r;
cin >> r;
if (r == 2 || r == 3) {
... | #define FOR(i, min, max) for (int(i) = (min); (i) < (max); (i)++)
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, c = 0;
cin >> n;
FOR(i, 0, n) {
int r;
cin >> r;
if (r == 2 || r == 3) {
... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 154 | 2 |
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_1_C&lang=jp
#include <iostream>
#include <vector>
using namespace std;
#define debug(x) cout << #x << "==" << x << endl;
const int inf = 100000000;
typedef long long ll;
// 素数判定 O(root(n))
bool is_prime(int n) {
if (n == 1) {
return false;
... | // http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_1_C&lang=jp
#include <iostream>
#include <vector>
using namespace std;
#define debug(x) cout << #x << "==" << x << endl;
const int inf = 100000000;
typedef long long ll;
// 素数判定 O(root(n))
bool is_prime(int n) {
if (n == 1) {
return false;
... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22]] | 1 | 149 | 2 |
#include <iostream>
#include <vector>
using namespace std;
bool isprime(int val) {
if (val < 2)
return false;
if (val == 2)
return true;
if (val % 2 == 0)
return false;
for (int i = 3; i * i <= val; i += 2) {
if (val % 2 == 0)
return false;
}
return true;
}
int main() {
int vals =... | #include <iostream>
#include <vector>
using namespace std;
bool isprime(int val) {
if (val < 2)
return false;
if (val == 2)
return true;
if (val % 2 == 0)
return false;
for (int i = 3; i * i <= val; i += 2) {
if (val % i == 0)
return false;
}
return true;
}
int main() {
int vals =... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22]] | 1 | 120 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, pn, pnc = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> pn;
if ((pn == 2) || (pn == 3))
pnc += 1;
else if (pn % 2) {
} else {
for (int j = 3; j <= pn / j; j += 2) {
if (pn % j == 0) {
pnc -= 1;
... | #include <iostream>
using namespace std;
int main() {
int n, pn, pnc = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> pn;
if ((pn == 2) || (pn == 3))
pnc += 1;
else if (pn % 2 == 0) {
} else {
for (int j = 3; j <= pn / j; j += 2) {
if (pn % j == 0) {
pnc -= 1;
... | [["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 123 | 2 |
#include <iostream>
#include <math.h>
#define INPUT_FROM_FILE (0)
#if INPUT_FROM_FILE
#include <fstream>
#endif
#if INPUT_FROM_FILE
#define IS ifs
#else
#define IS std::cin
#endif
bool is_prime(int num) {
bool ret = true;
int max = int(sqrt(num));
if (num == 2) {
} else if (num % 2 == 0) {
ret = false;... | #include <iostream>
#include <math.h>
#define INPUT_FROM_FILE (0)
#if INPUT_FROM_FILE
#include <fstream>
#endif
#if INPUT_FROM_FILE
#define IS ifs
#else
#define IS std::cin
#endif
bool is_prime(int num) {
bool ret = true;
int max = int(sqrt(num)) + 1;
if (num == 2) {
} else if (num % 2 == 0) {
ret = fa... | [["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 201 | 2 |
#include <algorithm>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
bool is_prime(int x) {
if (x == 2)
re... | #include <algorithm>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
bool is_prime(int x) {
if (x == 2)
re... | [["+", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 138 | 4 |
#include <iostream>
using namespace std;
bool isPrime(int p) {
if (p <= 1)
return false;
for (int i = 2; i * i <= p; i += 2) {
if (p % i == 0)
return false;
}
return true;
}
int main() {
int n, p, count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p;
if (isPrime(p))
co... | #include <iostream>
using namespace std;
bool isPrime(int p) {
if (p <= 1)
return false;
for (int i = 2; i * i <= p; i++) {
if (p % i == 0)
return false;
}
return true;
}
int main() {
int n, p, count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p;
if (isPrime(p))
count... | [["-", 0, 14, 8, 9, 0, 7, 26, 11, 17, 107], ["-", 0, 14, 8, 9, 0, 7, 26, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 26, 27, 17, 29]] | 1 | 111 | 3 |
#include <iostream>
#include <math.h>
using namespace std;
int couent = 0;
int keisann(int a) {
if (a == 2) {
couent++;
}
if (a % 2 == 0) {
return 0;
}
int v = sqrt(a);
for (int i = 3; i < v; i += 2) {
if (a % i == 0) {
return 0;
}
}
couent++;
}
int main() {
int dataset;
cin ... | #include <iostream>
#include <math.h>
using namespace std;
int couent = 0;
int keisann(int a) {
if (a == 2) {
couent++;
}
if (a % 2 == 0) {
return 0;
}
int v = sqrt(a);
for (int i = 3; i <= v; i += 2) {
if (a % i == 0) {
return 0;
}
}
couent++;
}
int main() {
int dataset;
cin... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 133 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
int isPrime(int x) {
if (x == 2) {
return 1;
} else if (x % 2 == 0) {
return 0;
} else {
int ans = 1;
for (int j = 2; j < (int)sqrt((double)x); j++) {
if (x % j == 0) {
ans = 0;
break;
}
}
return ans;
... | #include <cmath>
#include <iostream>
using namespace std;
int isPrime(int x) {
if (x == 2) {
// cout << "Prime:" << 2 << endl;
return 1;
} else if (x % 2 == 0) {
return 0;
} else {
int ans = 1;
for (int j = 2; j <= (int)sqrt((double)x); j++) {
if (x % j == 0) {
ans = 0;
... | [["-", 75, 76, 0, 9, 0, 7, 15, 16, 17, 18], ["+", 75, 76, 0, 9, 0, 7, 15, 16, 17, 19]] | 1 | 147 | 2 |
#include <bits/stdc++.h>
using namespace std;
bool isPrime(int a) {
for (int i = 2; i * i <= a; i++)
if (a % i)
return 0;
return 1;
}
int main() {
int n;
cin >> n;
int ans = 0;
while (n--) {
int num;
cin >> num;
ans += isPrime(num);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
bool isPrime(int a) {
for (int i = 2; i * i <= a; i++)
if (a % i == 0)
return 0;
return 1;
}
int main() {
int n;
cin >> n;
int ans = 0;
while (n--) {
int num;
cin >> num;
ans += isPrime(num);
}
cout << ans << endl;
return 0;
} | [["+", 0, 7, 8, 57, 15, 339, 51, 16, 17, 60], ["+", 0, 7, 8, 57, 15, 339, 51, 16, 12, 13]] | 1 | 90 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
int prs[5000];
int pri = 1;
int isPrime(int a) {
int flg;
if (sqrt(a) > prs[pri]) {
for (int i = prs[pri] + 2; i < sqrt(a); i += 2) {
flg = 1;
for (int j = 0; j <= pri; j++) {
if (sqrt(i) < prs[i])
break;
if (i % p... | #include <cmath>
#include <iostream>
using namespace std;
int prs[10000];
int pri = 1;
int isPrime(int a) {
int flg;
if (sqrt(a) > prs[pri]) {
for (int i = prs[pri] + 2; i <= sqrt(a); i += 2) {
flg = 1;
for (int j = 0; j <= pri; j++) {
if (sqrt(i) < prs[i])
break;
if (i %... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19]] | 1 | 250 | 4 |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
bool is_prime(int64_t n) {
if (n == 2) {
return true;
} else if (n % 2 == 0) {
return false;
}
for (int64_t i = 3; i < sqrt(n); i += 2) {
if (n % i == 0) {
return false;
}
}
return true;
}
int main() {
i... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
bool is_prime(int64_t n) {
if (n == 2) {
return true;
} else if (n % 2 == 0) {
return false;
}
for (int64_t i = 3; i <= sqrt(n); i += 2) {
if (n % i == 0) {
return false;
}
}
return true;
}
int main() {
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 140 | 2 |
#include <cmath>
#include <iostream>
int gcd(long unsigned int a, long unsigned int b) {
// assuming a > b
if (a % b == 0)
return b;
return gcd(b, a % b);
}
bool is_prime(long unsigned int n) {
for (long unsigned int i = 2; i < n; i++)
if (gcd(n, i) != 1)
return false;
return true;
}
bool is... | #include <cmath>
#include <iostream>
int gcd(long unsigned int a, long unsigned int b) {
// assuming a > b
if (a % b == 0)
return b;
return gcd(b, a % b);
}
bool is_prime(long unsigned int n) {
for (long unsigned int i = 2; i < n; i++)
if (gcd(n, i) != 1)
return false;
return true;
}
bool is... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 217 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <unordered... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <unordered... | [["+", 8, 9, 0, 7, 15, 16, 31, 23, 0, 24], ["+", 8, 9, 0, 7, 15, 16, 31, 23, 0, 25], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 205 | 4 |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x, ans = 0;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
a.push_back(x);
}
for (int i = 0; i < n; i++) {
if (a[i] == 2) {
ans++;
continue;
}
if (a[i] <= 1)
... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x, ans = 0;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
a.push_back(x);
}
for (int i = 0; i < n; i++) {
if (a[i] == 2) {
ans++;
continue;
}
if (a[i] <= 1)
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 179 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
bool primep(int num) {
if (num == 2)
return true;
else if (num % 2 == 0)
return false;
else {
for (int i = 3; i < (int)sqrt(num); i += 2)
if (num % i == 0)
return false;
return true;
}
}
int main() {
int n;
int count... | #include <cmath>
#include <iostream>
using namespace std;
bool primep(int num) {
if (num == 2)
return true;
else if (num % 2 == 0)
return false;
else {
for (int i = 3; i <= ceil(sqrt(num)); i += 2)
if (num % i == 0)
return false;
return true;
}
}
int main() {
int n;
int cou... | [["-", 75, 76, 0, 9, 0, 7, 15, 16, 17, 18], ["+", 75, 76, 0, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 9, 0, 7, 15, 16, 12, 2, 63, 22], ["-", 0, 7, 15, 16, 12, 74, 39, 77, 39, 40], ["-", 0, 9, 0, 7, 15, 16, 12, 74, 0, 25], ["+", 12, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 135 | 6 |
#include <iostream>
#include <math.h>
using namespace std;
int pn(int num) {
if (num == 2 || num == 3 || num == 5)
return 1;
if (num < 2 || num % 2 == 0)
return 0;
int i = 3;
while (i < sqrt(num)) {
if (num % i == 0)
return 0;
i += 2;
}
return 1;
}
int main() {
int n;
int num... | #include <iostream>
#include <math.h>
using namespace std;
int pn(int num) {
if (num == 2 || num == 3 || num == 5)
return 1;
if (num < 2 || num % 2 == 0)
return 0;
int i = 3;
while (i <= sqrt(num)) {
if (num % i == 0)
return 0;
i += 2;
}
return 1;
}
int main() {
int n;
int nu... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 19]] | 1 | 139 | 2 |
#include <assert.h>
#include <iostream>
using namespace std;
bool primeChecker(int object) {
assert(object > 1);
int i = 2;
while (i * i <= object) {
if (object % i == 0)
return false;
i++;
}
return true;
}
int main() {
int n;
int counter = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
... | #include <assert.h>
#include <iostream>
using namespace std;
bool primeChecker(int object) {
assert(object > 1);
int i = 2;
while (i * i <= object) {
if (object % i == 0)
return false;
i++;
}
return true;
}
int main() {
int n;
int counter = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
... | [["-", 8, 9, 0, 57, 15, 339, 51, 91, 17, 111]] | 1 | 116 | 1 |
#include <iostream>
#include <math.h>
bool isPrim(int x) {
if (x == 2) {
return true;
}
if (x < 2 || x % 2 == 0) {
return false;
}
// x????????¶??°??????2??????sqrt(x)?????§???????????°??????
for (int i = 2; i < sqrt(x); i++) {
if ((x % i) == 0) {
return false;
}
i++;
}
return... | #include <iostream>
#include <math.h>
bool isPrim(int x) {
if (x == 2) {
return true;
}
if (x < 2 || x % 2 == 0) {
return false;
}
// x????????¶??°??????2??????sqrt(x)?????§???????????°??????
for (int i = 3; i <= sqrt(x); i++) {
if ((x % i) == 0) {
return false;
}
i++;
}
retur... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 141 | 4 |
#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int cnt = 0;
for (int... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int cnt = 0;
for (int... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 187 | 2 |
#include <cmath>
#include <cstdio>
int main(void) {
int i, n;
scanf("%d", &n);
int a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int c = 0;
for (i = 0; i < n; i++) {
int y = sqrt(a[i]);
// printf("y=%d\n",y);
int j;
if (y == 1) {
c++;
} else {
for (j = 2; j... | #include <cmath>
#include <cstdio>
int main(void) {
int i, n;
scanf("%d", &n);
int a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int c = 0;
for (i = 0; i < n; i++) {
int y = sqrt(a[i]);
// printf("y=%d\n",y);
int j;
if (y == 1) {
c++;
} else {
for (j = 2; j... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 163 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
void inputData(int R[], int *N) {
cin >> *N;
for (int i = 0; i < *N; i++) {
cin >> R[i];
}
}
bool isPrimeNumber(int in) {
if (in == 2)
return true;
if (in % 2 == 0)
return false;
int s = (int)sqrt((double)in);
for (int i = 3; i < s; ... | #include <cmath>
#include <iostream>
using namespace std;
void inputData(int R[], int *N) {
cin >> *N;
for (int i = 0; i < *N; i++) {
cin >> R[i];
}
}
bool isPrimeNumber(int in) {
if (in == 2)
return true;
if (in % 2 == 0)
return false;
int s = (int)sqrt((double)in);
for (int i = 3; i <= s;... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 205 | 2 |
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int N, x, c;
c = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> x;
int fc;
fc = 0;
for (int j = 1; j <= sqrt(x); j++) {
if (x % j == 0)
fc += 1;
}
if (fc == 2)
c += 1;
}
cout << c << endl... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int N, x, c;
c = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> x;
int fc;
fc = 0;
for (int j = 1; j <= sqrt(x); j++) {
if (x % j == 0) {
fc += 1;
}
}
if (fc == 1)
c += 1;
}
cout <<... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 106 | 4 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
bool is_prime(int num) {
int a = sqrt(num);
for (int i = 2; i < a; i++) {
if (num % i == 0) {
return false;
}
}
return true;
}
int main(void) {
int n;
cin >> n;
int num;
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
bool is_prime(int num) {
int a = sqrt(num);
for (int i = 2; i <= a; i++) {
if (num % i == 0) {
return false;
}
}
return true;
}
int main(void) {
int n;
cin >> n;
int num;
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 127 | 2 |
#include <cstdio>
#include <iostream>
using namespace std;
//?´???°????????¢??°
int isPrime(int n) {
unsigned int i;
if (n < 2) // ??\??????2??????????????°???????????¨??§false
return 0;
else if (n == 2) // ??\??????2????????°???????????¨??§True
return 1;
if (n % 2 == 0) //??\??????2??§????????????... | #include <cstdio>
#include <iostream>
using namespace std;
//?´???°????????¢??°
int isPrime(int n) {
unsigned int i;
if (n < 2) // ??\??????2??????????????°???????????¨??§false
return 0;
else if (n == 2) // ??\??????2????????°???????????¨??§True
return 1;
if (n % 2 == 0) //??\??????2??§????????????... | [["-", 0, 7, 8, 9, 0, 57, 64, 1, 0, 35]] | 1 | 158 | 1 |
#include <bits/stdc++.h>
using namespace std;
bool isprime(int p) {
for (int i = 2; i * i < p; i++) {
if (p % i == 0)
return false;
}
return true;
}
int main() {
int num;
int count = 0;
cin >> num;
for (int i = 0; i < num; i++) {
int p;
cin >> p;
if (isprime(p))
count++;
}
... | #include <bits/stdc++.h>
using namespace std;
bool isprime(int p) {
for (int i = 2; i * i <= p; i++) {
if (p % i == 0)
return false;
}
return true;
}
int main() {
int num;
int count = 0;
cin >> num;
for (int i = 0; i < num; i++) {
int p;
cin >> p;
if (isprime(p))
count++;
}
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 103 | 2 |
#include <math.h>
#include <stdio.h>
#define MAX 10000000
int main() {
int i, j, n, s, ary[10000], y;
double x;
scanf("%d", &n);
s = n;
for (i = 0; i < n; i++) {
scanf("%d", &ary[i]);
}
for (i = 0; i < n; i++) {
for (j = 2; j < sqrt(ary[i]); j++) {
if (ary[i] % j == 0) {
s = s - 1;... | #include <math.h>
#include <stdio.h>
#define MAX 10000000
int main() {
int i, j, n, s, ary[10000], y;
double x;
scanf("%d", &n);
s = n;
for (i = 0; i < n; i++) {
scanf("%d", &ary[i]);
}
for (i = 0; i < n; i++) {
for (j = 2; j <= sqrt(ary[i]); j++) {
if (ary[i] % j == 0) {
s = s - 1... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 141 | 2 |
#include <iostream>
using namespace std;
bool isprime(int x) {
int i;
if (x == 2) {
return true;
}
if (x < 2 || x % 2 == 0) {
return false;
}
for (i = 3; i * i <= x; i += 2) {
if (x % i == 0) {
return false;
}
return true;
}
}
int main() {
int n, i, x;
int count ... | #include <iostream>
using namespace std;
bool isprime(int x) {
int i;
if (x == 2) {
return true;
}
if (x < 2 || x % 2 == 0) {
return false;
}
for (i = 3; i * i <= x; i += 2) {
if (x % i == 0) {
return false;
}
}
return true;
}
int main() {
int n, i, x;
int count = ... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 142 | 2 |
#include <iostream>
using namespace std;
// 素数判定
bool isPrime(int x) {
// 1 は例外的に素数じゃない判定しておく
if (x == 1) {
return false;
}
// 偶数をはじく
if (x != 2 && x % 2 == 0) {
return false;
}
//√x までの間で割り切れる数値があれば素数じゃない
for (int i = 3; i * i < x; i += 2) {
if (x % i == 0) {
return false;
}
... | #include <iostream>
using namespace std;
// 素数判定
bool isPrime(int x) {
// 1 は例外的に素数じゃない判定しておく
if (x == 1) {
return false;
}
// 偶数をはじく
if (x != 2 && x % 2 == 0) {
return false;
}
//√x までの間で割り切れる数値があれば素数じゃない
for (int i = 3; i * i <= x; i += 2) {
if (x % i == 0) {
return false;
}
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 142 | 2 |
//
//
// prime.cpp - created by us162022
//
#include <iostream>
#include <math.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, x, count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (x % 2) {
bool flag = true;
for (int j = 3; j < sqrt(x); j += 2) {
if ... | //
//
// prime.cpp - created by us162022
//
#include <iostream>
#include <math.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, x, count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (x % 2) {
bool flag = true;
for (int j = 3; j <= sqrt(x); j += 2) {
if... | [["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19]] | 1 | 134 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.