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 |
|---|---|---|---|---|---|
// IN THE NAME OF GOD
#include <iostream>
using namespace std;
typedef long long int ll;
int a, n, ans, d;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
for (int j = 2; j * j <= a; j++) {
if (!(i % j)) {
a = -1;
... | // IN THE NAME OF GOD
#include <iostream>
using namespace std;
typedef long long int ll;
int a, n, ans, d;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
for (int j = 2; j * j <= a; j++) {
if (!(a % j)) {
a = -1;
... | [["-", 15, 339, 51, 91, 28, 23, 0, 16, 31, 22], ["+", 15, 339, 51, 91, 28, 23, 0, 16, 31, 22]] | 1 | 126 | 2 |
#include <math.h>
#include <stdio.h>
int main() {
int n, x, count = 0;
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &x);
if (x == 2)
count++;
else if (x % 2) {
for (j = 3; j < sqrt((double)x); j += 2) {
if (x % j == 0)
break;
}
if (j >=... |
#include <math.h>
#include <stdio.h>
int main() {
int n, x, count = 0;
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &x);
if (x == 2)
count++;
else if (x % 2) {
for (j = 3; j < sqrt((double)x); j += 2) {
if (x % j == 0)
break;
}
if (j >... | [["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 137 | 2 |
// last edited at 26.8.2015 by charis
#include <cmath>
#include <iostream>
using namespace std;
/* Time Limit Exceeded
bool isPrime(int x){
if(x<=1) return false;
for(int i=2; i<x; i++){
if(x%i==0) return false;
}
return true;
}
*/
bool isPrime(int x) {
if (x == 2)
... | // last edited at 26.8.2015 by charis
#include <cmath>
#include <iostream>
using namespace std;
/* Time Limit Exceeded
bool isPrime(int x){
if(x<=1) return false;
for(int i=2; i<x; i++){
if(x%i==0) return false;
}
return true;
}
*/
bool isPrime(int x) {
if (x == 2)
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 161 | 2 |
import java.io.*;
class Main {
static boolean isPrime(int r) {
if (r < 2)
return false;
else if (r == 2)
return true;
else if (r % 2 == 0)
return false;
for (int i = 3; i * i < r; i += 2)
if (r % i == 0)
return false;
return true;
}
public static void main(Str... | import java.io.*;
class Main {
static boolean isPrime(int r) {
if (r < 2)
return false;
else if (r == 2)
return true;
else if (r % 2 == 0)
return false;
for (int i = 3; i * i <= r; i += 2)
if (r % i == 0)
return false;
return true;
}
public static void main(St... | [["-", 0, 195, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 184 | 2 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int count = 0;
int n = sc.nextInt();
for (int i = 0; i < n; i++) {
int state = 0;
int a = sc.nextInt();
for (int j = 2; j < Math.sqrt(a); j++) {
if (a % j ==... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int count = 0;
int n = sc.nextInt();
for (int i = 0; i < n; i++) {
int state = 0;
int a = sc.nextInt();
for (int j = 2; j <= Math.sqrt(a); j++) {
if (a % j =... | [["-", 0, 7, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 136 | 2 |
import java.lang.Math;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int i, size, count = 0;
List<Integer> numbers = new ArrayList<Integer>();
Scanner in = new Scanner(System.in);
size = Integer.parseInt(in.... | import java.lang.Math;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int i, size, count = 0;
List<Integer> numbers = new ArrayList<Integer>();
Scanner in = new Scanner(System.in);
size = Integer.parseInt(in.... | [["+", 8, 196, 0, 503, 49, 200, 51, 16, 17, 72], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 12, 499]] | 3 | 226 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String x = "";
try {
int lim = Integer.parseInt(in.readLine());
... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String x = "";
try {
int lim = Integer.parseInt(in.readLine());
... | [["-", 0, 7, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 200 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.read... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.read... | [["-", 0, 195, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 210 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
static int n;
static int[] nums;
static int result;
static void input() throws IOException {
n = readInt();
nums = new int[n];
for (int i = 0; i < n; i++) {
nums[i] = readInt();
... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
static int n;
static int[] nums;
static int result;
static void input() throws IOException {
n = readInt();
nums = new int[n];
for (int i = 0; i < n; i++) {
nums[i] = readInt();
... | [["-", 0, 195, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 495 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
*
* @author Y
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.readLine()... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
*
* @author Y
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.readLine())... | [["+", 0, 57, 15, 15, 0, 16, 12, 492, 141, 22], ["+", 15, 15, 0, 16, 12, 492, 3, 4, 0, 24], ["+", 0, 16, 12, 492, 3, 4, 0, 492, 500, 22], ["+", 0, 16, 12, 492, 3, 4, 0, 492, 0, 131], ["+", 12, 492, 3, 4, 0, 492, 3, 4, 0, 25]] | 3 | 223 | 5 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main {
public static void main(String args[]) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
int answer = 0;
... |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main {
public static void main(String args[]) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
int answer = 0;
... | [["-", 75, 57, 75, 196, 0, 7, 15, 16, 31, 22], ["+", 75, 57, 75, 196, 0, 7, 15, 16, 31, 22]] | 3 | 207 | 2 |
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int input = scan.nextInt();
int[] num = new int[input];
boolean t;
int count = 0;
for (int i = 0; i < input; i++) {
num[i] = scan.nextInt();
if (isPrime(num[i]))... | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int input = scan.nextInt();
int[] num = new int[input];
boolean t;
int count = 0;
for (int i = 0; i < input; i++) {
num[i] = scan.nextInt();
if (isPrime(num[i]))... | [["-", 0, 195, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 186 | 2 |
import java.util.Scanner;
/**
*
*/
/**
* @author kawakami
*
*/
class Main {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
StringBuilder sb = new StringBuilder();
Scanner as = new Scanner(System.in);
int n = 0;
int i = 0;
int j... | import java.util.Scanner;
/**
*
*/
/**
* @author kawakami
*
*/
class Main {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
StringBuilder sb = new StringBuilder();
Scanner as = new Scanner(System.in);
int n = 0;
int i = 0;
int j... | [["+", 15, 15, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 15, 15, 0, 16, 31, 16, 12, 16, 12, 499]] | 3 | 245 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO ?????????????????????????????????????????????
Scanner sc = new Scanner(System.in);
String line1 = sc.nextLine();
int n = Integer.parseInt(line1);
int[] num = new int[n];
for (int i = 0; i < n; i+... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO ?????????????????????????????????????????????
Scanner sc = new Scanner(System.in);
String line1 = sc.nextLine();
int n = Integer.parseInt(line1);
int[] num = new int[n];
for (int i = 0; i < n; i+... | [["+", 49, 200, 51, 492, 3, 4, 0, 74, 0, 24], ["+", 51, 492, 3, 4, 0, 74, 39, 511, 0, 512], ["+", 49, 200, 51, 492, 3, 4, 0, 74, 0, 25], ["+", 51, 492, 3, 4, 0, 74, 51, 504, 516, 22], ["+", 51, 492, 3, 4, 0, 74, 51, 504, 0, 70], ["+", 51, 492, 3, 4, 0, 74, 51, 504, 0, 73]] | 3 | 240 | 6 |
import java.io.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader buf = new BufferedReader(new InputStreamReader(System.in));
int idx = Integer.parseInt(buf.readLine());
int ans = 0;
for (int i = 0; i < idx; i++) {
int x = Integer.parseInt(buf.readL... | import java.io.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader buf = new BufferedReader(new InputStreamReader(System.in));
int idx = Integer.parseInt(buf.readLine());
int ans = 0;
for (int i = 0; i < idx; i++) {
int x = Integer.parseInt(buf.readL... | [["-", 75, 57, 75, 196, 0, 7, 15, 16, 12, 22], ["+", 75, 57, 75, 196, 0, 7, 15, 16, 12, 22]] | 3 | 192 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
private static final int SIZE = 10000000;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.p... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
private static final int SIZE = 10000000;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.p... | [["-", 0, 195, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 202 | 2 |
import java.util.Scanner;
public class Main {
static int[] memo = new int[45];
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int cnt = 0;
for (int i = 0; i < n; i++) {
int a = in.nextInt();
if (isPrime(a)) {
cnt++;
}... | import java.util.Scanner;
public class Main {
static int[] memo = new int[45];
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int cnt = 0;
for (int i = 0; i < n; i++) {
int a = in.nextInt();
if (isPrime(a)) {
cnt++;
}... | [["+", 8, 196, 0, 503, 49, 200, 51, 16, 17, 72], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 12, 499]] | 3 | 183 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int count = 0;
int n = Integer.parseInt(sc.nextLine());
for (int i = 0; i < n; i++) {
String s = sc.nextLine();
int num = Integer.parseInt(s);
double numDoubl... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int count = 0;
int n = Integer.parseInt(sc.nextLine());
for (int i = 0; i < n; i++) {
String s = sc.nextLine();
int num = Integer.parseInt(s);
double numDoubl... | [["+", 8, 196, 0, 503, 49, 200, 51, 16, 17, 72], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 12, 499]] | 3 | 174 | 2 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.nextLine());
int counter = 0;
for (int i = 0; i < n; i++) {
int key = Integer.parseInt(sc.nextLine());
if (isPrime(key)) {
counter++;
... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.nextLine());
int counter = 0;
for (int i = 0; i < n; i++) {
int key = Integer.parseInt(sc.nextLine());
if (isPrime(key)) {
counter++;
... | [["-", 75, 57, 75, 196, 0, 7, 15, 16, 17, 18], ["+", 75, 57, 75, 196, 0, 7, 15, 16, 17, 19]] | 3 | 188 | 2 |
import java.util.*;
public class Main {
/*
boolean[] furui() {
boolean[] tab = new boolean[100000001];
tab[0] = tab[1] = true;
for (int i = 2; i <= tab.length/2; i++) {
if (tab[i]) continue;
for (int j = i + i; j < tab.length; j+=i) {
... | import java.util.*;
public class Main {
/*
boolean[] furui() {
boolean[] tab = new boolean[100000001];
tab[0] = tab[1] = true;
for (int i = 2; i <= tab.length/2; i++) {
if (tab[i]) continue;
for (int j = i + i; j < tab.length; j+=i) {
... | [["-", 0, 57, 15, 15, 0, 16, 31, 16, 17, 85], ["+", 0, 57, 15, 15, 0, 16, 31, 16, 17, 109]] | 3 | 216 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scn = new Scanner(System.in);
int n = scn.nextInt();
int count = 0;
for (int i = 0; i < n; i++) {
int v = scn.nextInt();
boolean bol = true;
if (v == 2) {
count++;
continu... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scn = new Scanner(System.in);
int n = scn.nextInt();
int count = 0;
for (int i = 0; i < n; i++) {
int v = scn.nextInt();
boolean bol = true;
if (v == 2) {
count++;
continu... | [["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["-", 0, 7, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 196, 0, 7, 15, 16, 17, 19], ["+", 15, 16, 12, 492, 3, 4, 0, 74, 0, 24], ["+", 12, 492, 3, 4, 0, 74, 39, 511, 0, 512], ["+", 15, 16, 12, 492, 3, 4, 0, 74, 0, 25]] | 3 | 160 | 7 |
import java.lang.Math;
import java.util.Scanner;
// ALDS1_1_C
public class Main {
public static boolean primeJudge(int a) {
double sqrt = Math.sqrt(a);
if (a < 2)
return false;
if (a == 2)
return true;
if (a % 2 == 0)
return false;
for (int i = 3; i < sqrt; i += 2) {
if (a... | import java.lang.Math;
import java.util.Scanner;
// ALDS1_1_C
public class Main {
public static boolean primeJudge(int a) {
double sqrt = Math.sqrt(a) + 1;
if (a < 2)
return false;
if (a == 2)
return true;
if (a % 2 == 0)
return false;
for (int i = 3; i < sqrt; i += 2) {
i... | [["+", 8, 196, 0, 503, 49, 200, 51, 16, 17, 72], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 12, 499]] | 3 | 176 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
try (BufferedReader br =
new BufferedReader(new InputStreamReader(System.in))) {
int n = Integer.parseInt(br.readLine(... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
try (BufferedReader br =
new BufferedReader(new InputStreamReader(System.in))) {
int n = Integer.parseInt(br.readLine(... | [["-", 0, 195, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 211 | 2 |
import java.util.Scanner;
class Main {
public static void main(String... args) {
Scanner sc = new Scanner(System.in);
int size = sc.nextInt();
int count = 0;
for (int i = 0; i < size; i++) {
if (checkPrime(sc.nextInt())) {
count++;
}
}
System.out.println(count);
}
p... | import java.util.Scanner;
class Main {
public static void main(String... args) {
Scanner sc = new Scanner(System.in);
int size = sc.nextInt();
int count = 0;
for (int i = 0; i < size; i++) {
if (checkPrime(sc.nextInt())) {
count++;
}
}
System.out.println(count);
}
p... | [["-", 0, 195, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 174 | 2 |
import java.util.Scanner;
public class Main {
public static boolean check(double a) {
double b;
b = Math.sqrt(a);
if (b > 1.0 && b < 2.0)
return true;
for (int i = 3; i < (int)Math.floor(b); i++) {
if ((a % 2.0) == 0.0)
return false;
if ((a % (double)i) == 0.0)
ret... | import java.util.Scanner;
public class Main {
public static boolean check(double a) {
double b;
b = Math.sqrt(a);
if (b > 1.0 && b < 2.0)
return true;
for (int i = 2; i <= (int)Math.floor(b); i++) {
if ((a % 2.0) == 0.0)
return false;
if ((a % (double)i) == 0.0)
re... | [["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["-", 0, 195, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 196, 0, 57, 64, 196, 0, 45], ["-", 0, 7, 8, 196, 0, 57, 64, 196, 0, 46], ["-", 0, 7, 8, 196, 0, 57, 75, 196, 0, 45],... | 3 | 195 | 8 |
import java.math.*;
import java.util.Scanner;
public class Main {
Main() {
Scanner sc = new Scanner(System.in);
BigInteger bi;
while (sc.hasNext()) {
int cnt = 0;
for (int i = sc.nextInt(); i >= 1; --i) {
bi = new BigInteger(sc.next());
if (bi.isProbablePrime(1))
++... | import java.math.*;
import java.util.Scanner;
public class Main {
Main() {
Scanner sc = new Scanner(System.in);
BigInteger bi;
while (sc.hasNext()) {
int cnt = 0;
for (int i = sc.nextInt(); i >= 1; --i) {
bi = new BigInteger(sc.next());
if (bi.isProbablePrime(1000))
... | [["-", 0, 57, 15, 15, 0, 492, 3, 4, 0, 499], ["+", 0, 57, 15, 15, 0, 492, 3, 4, 0, 499]] | 3 | 128 | 2 |
#include <math.h>
#include <stdio.h>
#define M 10000
int Prime(int x);
main() {
int n, c = 0;
int i;
int A[M];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
for (i = 0; i < n; i++) {
if (Prime(A[i]) == 1)
c++;
}
printf("%d\n", c);
return 0;
}
int Prime(int x) {
in... | #include <math.h>
#include <stdio.h>
#define M 10000
int Prime(int x);
main() {
int n, c = 0;
int i;
int A[M];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
for (i = 0; i < n; i++) {
if (Prime(A[i]) == 1)
c++;
}
printf("%d\n", c);
return 0;
}
int Prime(int x) {
in... | [["-", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["-", 0, 52, 8, 9, 0, 57, 64, 37, 0, 35], ["-", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95], ["-", 8, 9, 0, 57, 75, 76, 0, 37, 0, 38], ["-", 8, 9, 0, 57, 75, 76, 0, 37, 0, 13]] | 0 | 188 | 5 |
#include <math.h>
#include <stdio.h>
int main(void) {
int n;
scanf("%d\n", &n);
int x;
int count = 0;
int i;
while (n--) {
scanf("%d\n", &x);
if (x == 2)
count++;
else if (x % 2 != 0) {
for (i = 3; i < sqrt(x); i = i + 2) {
if (x % i == 0)
break;
}
if (... | #include <math.h>
#include <stdio.h>
int main(void) {
int n;
scanf("%d\n", &n);
int x;
int count = 0;
int i;
while (n--) {
scanf("%d\n", &x);
if (x == 2)
count++;
else if (x % 2 != 0) {
for (i = 3; i <= sqrt(x); i = i + 2) {
if (x % i == 0)
break;
}
if ... | [["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19], ["-", 64, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["+", 64, 9, 0, 57, 15, 23, 0, 16, 17, 47]] | 0 | 130 | 4 |
#include <math.h>
#include <stdio.h>
int sosuu(int);
int main() {
int a, b, c, count1 = 0;
scanf("%d", &a);
for (int i = 0; i < a; i++) {
scanf("%d", &b);
c = sosuu(b);
if (c == 1)
count1++;
}
printf("%d\n", count1);
return 0;
}
int sosuu(int x) {
int i, c;
double d = sqrt(x);
if (x ... | #include <math.h>
#include <stdio.h>
int sosuu(int);
int main() {
int a, b, c, count1 = 0;
scanf("%d", &a);
for (int i = 0; i < a; i++) {
scanf("%d", &b);
c = sosuu(b);
if (c == 1)
count1++;
}
printf("%d\n", count1);
return 0;
}
int sosuu(int x) {
int i, c;
double d = sqrt(x);
if (x ... | [["-", 8, 9, 0, 52, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 23, 0, 16, 17, 19]] | 0 | 177 | 2 |
#include <math.h>
#include <stdio.h>
int main() {
int n, i, k, count;
float sqr;
int input_list[10000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &input_list[i]);
}
count = 0;
for (i = 0; i < n; i++) {
sqr = sqrt(input_list[i]);
for (k = 2; k < sqr; k++) {
if (input_li... | #include <math.h>
#include <stdio.h>
int main() {
int n, i, k, count;
float sqr;
int input_list[10000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &input_list[i]);
}
count = 0;
for (i = 0; i < n; i++) {
sqr = sqrt(input_list[i]);
for (k = 2; k <= sqr; k++) {
if (input_l... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47]] | 0 | 152 | 4 |
#include <stdio.h>
#define N 10000
int isPrime(int x) {
int i;
if (x < 2)
return 0;
if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
for (i = 3; i * i <= x; i = i + 2)
;
if (x % i == 0)
return 0;
return 1;
}
int main(void) {
int count, i, n;
count = 0;
scanf("%d", &n);
int a... | #include <stdio.h>
#define N 10000
int isPrime(int x) {
int i;
if (x < 2)
return 0;
if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
for (i = 3; i * i <= x; i = i + 2)
if (x % i == 0)
return 0;
return 1;
}
int main(void) {
int count, i, n;
count = 0;
scanf("%d", &n);
int a[N... | [["-", 0, 14, 8, 9, 0, 7, 8, 1, 0, 35]] | 0 | 165 | 1 |
#include <stdio.h>
int prime(int x);
int main(void) {
int n, t, a = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &t);
a += prime(t);
}
printf("%d\n", a);
}
int prime(int x) {
int i;
if (x == 2)
return 0;
if (x < 2 || x % 2 == 0)
return 0;
i = 3;
while (i <= sqrt(x)) ... | #include <stdio.h>
int prime(int x);
int main(void) {
int n, t, a = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &t);
a += prime(t);
}
printf("%d\n", a);
}
int prime(int x) {
int i;
if (x == 2)
return 1;
if (x < 2 || x % 2 == 0)
return 0;
i = 3;
while (i <= sqrt(x)) ... | [["-", 0, 14, 8, 9, 0, 57, 64, 37, 0, 13], ["+", 0, 14, 8, 9, 0, 57, 64, 37, 0, 13]] | 0 | 146 | 2 |
#include <stdio.h>
int isPrime(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 i, x, n;
int count = 0;
scanf("%d", &... | #include <stdio.h>
int isPrime(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 i, x, n;
int count = 0;
scanf("%d", &n)... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 36, 36, 0, 30, 0, 14, 8, 9, 0, 46], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 160 | 3 |
#include <math.h>
#include <stdio.h>
#define true 1
#define false 0
int isprime(int x) {
int i;
if (x == 2)
return true;
if (x < 2 || !x % 2)
return false;
for (i = 3; i <= sqrt(x); i += 2) {
if (!x % i)
return false;
}
return true;
}
int main() {
int n, i, x, count = 0;
scanf("%d", ... | #include <math.h>
#include <stdio.h>
#define true 1
#define false 0
int isprime(int x) {
int i;
if (x == 2)
return true;
if (x < 2 || !(x % 2))
return false;
for (i = 3; i <= sqrt(x); i += 2) {
if (!(x % i))
return false;
}
return true;
}
int main() {
int n, i, x, count = 0;
scanf("%... | [["+", 15, 23, 0, 16, 12, 91, 28, 23, 0, 24], ["+", 15, 23, 0, 16, 12, 91, 28, 23, 0, 25], ["+", 0, 57, 15, 23, 0, 91, 28, 23, 0, 24], ["+", 0, 57, 15, 23, 0, 91, 28, 23, 0, 25]] | 0 | 151 | 4 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int judge(x) {
double i = 3;
if (x == 1)
return 0;
if (x % 2 == 0 && x != 2)
return 0;
while (i <= x) {
if ((int)x % (int)i == 0)
return 0;
i++;
}
return 1;
}
int main() {
int n, i;
int s = 0;
int *A;
scanf("%d", &n);... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int judge(x) {
double i = 3;
if (x == 1)
return 0;
if (x % 2 == 0 && x != 2)
return 0;
while (i <= sqrt((double)x)) {
if ((int)x % (int)i == 0)
return 0;
i++;
}
return 1;
}
int main() {
int n, i;
int s = 0;
int *A;
sc... | [["+", 0, 52, 15, 23, 0, 16, 12, 2, 63, 22], ["+", 15, 23, 0, 16, 12, 2, 3, 4, 0, 24], ["+", 0, 16, 12, 2, 3, 4, 0, 74, 0, 24], ["+", 12, 2, 3, 4, 0, 74, 39, 77, 39, 40], ["+", 0, 16, 12, 2, 3, 4, 0, 74, 0, 25], ["+", 15, 23, 0, 16, 12, 2, 3, 4, 0, 25]] | 0 | 181 | 6 |
#include <math.h>
#include <stdio.h>
int main(void) {
int i, j, n, p, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &p);
if (p == 2) {
count++;
}
else if (p % 2 != 0 && p > 2) {
for (j = 3; j < sqrt((double)p); j += 2) {
if (p % j == 0) {
break;
... | #include <math.h>
#include <stdio.h>
int main(void) {
int i, j, n, p, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &p);
if (p == 2 || p == 3) {
count++;
}
else if (p % 2 != 0 && p > 4) {
for (j = 3; j < sqrt((double)p); j += 2) {
if (p % j == 0) {
... | [["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 106], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 60], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 143 | 6 |
#include <math.h>
#include <stdio.h>
int prime(int);
int main() {
int N, i;
int A[10001];
scanf("%d", &N);
for (i = 0; i <= N - 1; i++) {
scanf("%d", &A[i]);
}
int m = 0, all = 0;
for (i = 0; i <= N - 1; i++) {
all += prime(A[i]);
}
printf("%d\n", all);
return 0;
}
int prime(int x) {
if... | #include <math.h>
#include <stdio.h>
int prime(int);
int main() {
int N, i;
int A[10001];
scanf("%d", &N);
for (i = 0; i <= N - 1; i++) {
scanf("%d", &A[i]);
}
int m = 0, all = 0;
for (i = 0; i <= N - 1; i++) {
all += prime(A[i]);
}
printf("%d\n", all);
return 0;
}
int prime(int x) {
if... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 196 | 2 |
#include <math.h>
#include <stdio.h>
int hantei(int);
main() {
int i, j, n, sum = 0;
int N[10000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &N[i]);
if (hantei(N[j]))
sum++;
}
printf("%d\n", sum);
return 0;
}
int hantei(int n) {
int i = 3;
if (n == 2)
return 1;
if (n ... | #include <math.h>
#include <stdio.h>
int hantei(int);
main() {
int i, j, n, sum = 0;
int N[10000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &N[i]);
if (hantei(N[i]))
sum++;
}
printf("%d\n", sum);
return 0;
}
int hantei(int n) {
int i = 3;
if (n == 2)
return 1;
else i... | [["-", 15, 23, 0, 2, 3, 4, 0, 69, 71, 22], ["+", 15, 23, 0, 2, 3, 4, 0, 69, 71, 22], ["+", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 57, 75, 76, 0, 57, 75, 76, 0, 95], ["+", 75, 76, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 75, 76, 0, 9, 0, 52, 8, 9, 0, 46]] | 0 | 169 | 6 |
#include <math.h>
#include <stdio.h>
int main() {
int i, N, count = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
int n, j, l = 0;
scanf("%d", &n);
if (n == 1 || n == 2) {
count++;
continue;
}
if (n % 2 == 0) {
continue;
}
for (j = 3; j < sqrt(n); j += 2) {
if... |
#include <math.h>
#include <stdio.h>
int main() {
int i, N, count = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
int n, j, l = 0;
scanf("%d", &n);
if (n == 1 || n == 2) {
count++;
continue;
}
if (n % 2 == 0) {
continue;
}
for (j = 3; j <= sqrt(n); j += 2) {
i... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 155 | 2 |
#include <math.h>
#include <stdio.h>
#define YES 1
#define NO 0
int isprime(long p) {
int i;
long ps;
if (p == 2)
return YES;
if (p < 2 || p % 2 == 0)
return NO;
i = 3;
ps = (long)sqrt(p);
// printf("%ld\n", ps);
while (i < ps) {
if (p % i == 0)
return NO;
i += 2;
}
return ... |
#include <math.h>
#include <stdio.h>
#define YES 1
#define NO 0
int isprime(long p) {
int i;
long ps;
if (p == 2)
return YES;
if (p < 2 || p % 2 == 0)
return NO;
i = 3;
ps = (long)sqrt(p);
// printf("%ld\n", ps);
while (i <= ps) {
if (p % i == 0)
return NO;
i += 2;
}
retur... | [["-", 8, 9, 0, 52, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 23, 0, 16, 17, 19]] | 0 | 165 | 2 |
#include <math.h>
#include <stdio.h>
#define N_MAX 10000
int isPrime(int x) {
int i;
if (x <= 3) {
return 1;
} else if (x % 2 == 0) {
return 0;
} else {
for (i = 3; i < sqrt(x); i = i + 2) {
if (x % i == 0) {
return 0;
}
}
return 1;
}
}
int main(int argc, char *argv[]... |
#include <math.h>
#include <stdio.h>
#define N_MAX 10000
int isPrime(int x) {
int i;
if (x <= 3) {
return 1;
} else if (x % 2 == 0) {
return 0;
} else {
for (i = 3; i <= sqrt(x); i = i + 2) {
if (x % i == 0) {
return 0;
}
}
return 1;
}
}
int main(int argc, char *argv... | [["-", 75, 76, 0, 9, 0, 7, 15, 16, 17, 18], ["+", 75, 76, 0, 9, 0, 7, 15, 16, 17, 19]] | 0 | 168 | 2 |
#include "math.h"
#include "stdio.h"
main() {
int x, i, j, n, c, t = 0;
scanf("%d", &n);
for (j = 0; j < n; j++) {
scanf("%d", &x);
c = 1;
if (x == 2)
c = 1;
if (x < 2 || x % 2 == 0)
c = 0;
for (i = 3; i <= sqrt(x); i += 2) {
if (x % i == 0)
c = 0;
}
... | #include "math.h"
#include "stdio.h"
main() {
int x, i, j, n, c, t = 0;
scanf("%d", &n);
for (j = 0; j < n; j++) {
scanf("%d", &x);
c = 1;
if (x == 2) {
c = 1;
} else if (x < 2 || x % 2 == 0)
c = 0;
for (i = 3; i <= sqrt(x); i += 2) {
if (x % i == 0)
c = 0;
... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 0 | 147 | 3 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int isprime(int);
int main() {
int i, x, n, count = 0, k;
int *m;
scanf("%d", &n);
m = malloc(sizeof(int) * n);
for (i = 0; i < n; i++) {
scanf("%d", &m[i]);
// k = m[i];
// fprintf(stderr,"m: %d k: %d\n",m[i],k);
if (isprime(m[i]) ==... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int isprime(int);
int main() {
int i, x, n, count = 0;
int *m;
scanf("%d", &n);
m = malloc(sizeof(int) * n);
for (i = 0; i < n; i++) {
scanf("%d", &m[i]);
if (isprime(m[i]) == 1) {
count++;
}
}
printf("%d\n", count);
free(m);... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 98], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 106]] | 0 | 190 | 5 |
#include <stdio.h>
int isprime(int);
main() {
int i, n[10000], p, count = 0;
scanf("%d", &p);
for (i = 0; i < p; i++) {
scanf("%d", &n[i]);
if (isPrime(n[i]) == 1)
count++;
}
printf("%d\n", count);
return 0;
}
int isPrime(int n) {
int i;
if (n < 2)
return 0;
else if (n == 2)
r... | #include <stdio.h>
int isprime(int);
main() {
int i, n[10000], p, count = 0;
scanf("%d", &p);
for (i = 0; i < p; i++) {
scanf("%d", &n[i]);
if (isPrime(n[i]) == 1)
count++;
}
printf("%d\n", count);
return 0;
}
int isPrime(int n) {
int i;
if (n < 2)
return 0;
else if (n == 2)
r... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 167 | 11 |
#include <math.h>
#include <stdio.h>
int isprime(int x) {
int i = 3;
if (x == 2) {
return 0;
}
if (x < 2 || x % 2 == 0) {
return -1;
}
while (i <= sqrt(x)) {
if (x % i) {
return -1;
}
i += 2;
}
return 0;
}
int main(void) {
int n, m, i, c = 0;
scanf("%d", &n);
for (i = 0; ... | #include <math.h>
#include <stdio.h>
int isprime(int x) {
int i = 3;
if (x == 2) {
return 0;
}
if (x < 2 || x % 2 == 0) {
return -1;
}
while (i <= sqrt(x)) {
if (x % i == 0) {
return -1;
}
i += 2;
}
return 0;
}
int main(void) {
int n, m, i, c = 0;
scanf("%d", &n);
for (i ... | [["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13]] | 0 | 153 | 2 |
#include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define DT_MAX (10000)
int data[DT_MAX];
int out_data[DT_MAX];
int out_data_num;
int main() {
int n, i, k, flg;
char buff[8192];
double cnt;
out_data_num = 0;
gets(buff);
sscanf(buff, "%d", &n);
for (i = 0... | #include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define DT_MAX (10000)
int data[DT_MAX];
int out_data[DT_MAX];
int out_data_num;
int main() {
int n, i, k, flg;
char buff[8192];
double cnt;
out_data_num = 0;
gets(buff);
sscanf(buff, "%d", &n);
for (i = 0... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 272 | 2 |
#include <math.h>
#include <stdio.h>
int isprime(int x) {
if (x == 2)
return 1;
if (x < 2 || x % 2 == 0)
return 0;
int i;
for (i = 3; i < sqrt(x); i += 2)
if (x % i == 0)
return 0;
return 1;
}
int main(void) {
int n, x, i, num = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
sca... | #include <math.h>
#include <stdio.h>
int isprime(int x) {
if (x == 2)
return 1;
if (x < 2 || x % 2 == 0)
return 0;
int i;
for (i = 3; i <= sqrt(x); i += 2)
if (x % i == 0)
return 0;
return 1;
}
int main(void) {
int n, x, i, num = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
sc... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 146 | 2 |
#include <math.h>
#include <stdio.h>
int main(void) {
int i, j, n, x, ans = 0, flag;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &x);
if (x > 2 && x % 2 != 0) {
flag = 1;
for (j = 3; j < sqrt(x); j += 2) {
if (x % j == 0) {
flag = 0;
break;
}
... | #include <math.h>
#include <stdio.h>
int main(void) {
int i, j, n, x, ans = 0, flag;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &x);
if (x > 2 && x % 2 != 0) {
flag = 1;
for (j = 3; j <= sqrt(x); j += 2) {
if (x % j == 0) {
flag = 0;
break;
}
... | [["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19]] | 0 | 146 | 2 |
#include <math.h>
#include <stdio.h>
int main() {
int i, j, n, a, ans = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (a == 2)
ans++;
else if (a == 3)
ans++;
else if ((a % 2) == 0)
continue;
else {
for (j = 3; j <= (int)sqrt(a) + 1; j += 2) {
... | #include <math.h>
#include <stdio.h>
int main() {
int i, j, n, a, ans = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (a == 2)
ans++;
else if (a == 3)
ans++;
else if ((a % 2) == 0)
continue;
else {
for (j = 3; j < (int)sqrt(a) + 1; j++) {
... | [["-", 75, 76, 0, 9, 0, 7, 15, 16, 17, 19], ["+", 75, 76, 0, 9, 0, 7, 15, 16, 17, 18], ["-", 75, 76, 0, 9, 0, 7, 26, 11, 17, 107], ["-", 75, 76, 0, 9, 0, 7, 26, 11, 12, 13], ["+", 75, 76, 0, 9, 0, 7, 26, 27, 17, 29], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 159 | 7 |
#include <math.h>
#include <stdio.h>
int main() {
int n, i, j, count = 0, num;
scanf("%d", &n);
count = n;
for (i = 0; i < n; i++) {
scanf("%d", &num);
if (num % 2 == 0 && num > 2)
count--;
for (j = 3; j <= sqrt(num); j += 2) {
if (num % j == 0) {
count--;
break;
}... | #include <math.h>
#include <stdio.h>
int main() {
int n, i, j, count = 0, num;
scanf("%d", &n);
count = n;
for (i = 0; i < n; i++) {
scanf("%d", &num);
if (num % 2 == 0 && num > 2)
count--;
else {
for (j = 3; j <= sqrt(num); j += 2) {
if (num % j == 0) {
count--;
... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 0 | 124 | 3 |
#include <stdio.h>
int isPrime(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 % 1 == 0)
return 0;
}
return 1;
}
int main() {
int n, x, i;
int ct = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) ... | #include <stdio.h>
int isPrime(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 n, x, i;
int ct = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) ... | [["-", 0, 57, 15, 23, 0, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 12, 22]] | 0 | 151 | 2 |
#include <math.h>
#include <stdio.h>
int main() {
int i, j, num;
int judge = 1;
int count = 0;
scanf("%d", &num);
int A[num];
for (i = 0; i < num; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < num; i++) {
judge = 0;
// printf("\n");
if (A[i] == 2) {
judge = 0;
}
else if... | #include <math.h>
#include <stdio.h>
int main() {
int i, j, num;
int judge = 1;
int count = 0;
scanf("%d", &num);
int A[num];
for (i = 0; i < num; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < num; i++) {
judge = 0;
// printf("\n");
if (A[i] == 2) {
judge = 0;
}
else if... | [["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19]] | 0 | 199 | 2 |
#include <math.h>
#include <stdio.h>
int main() {
int A[10000], j;
int i, count = 0, a;
scanf("%d", &i);
for (a = 0; a < i; a++)
scanf("%d", &A[a]);
for (a = 0; a < i; a++) {
count++;
if (A[a] == 2) {
// printf("%d ",A[a]);
continue;
}
if (A[a] % 2 == 0) {
count--;
... | #include <math.h>
#include <stdio.h>
int main() {
int A[10000], j;
int i, count = 0, a;
scanf("%d", &i);
for (a = 0; a < i; a++)
scanf("%d", &A[a]);
for (a = 0; a < i; a++) {
count++;
if (A[a] == 2) {
// printf("%d ",A[a]);
continue;
}
if (A[a] % 2 == 0) {
count--;
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 176 | 2 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
int x[10000], N, i, j, num;
scanf("%d", &N);
if (N < 1 || N > 10000) {
printf("Please type 1 to 10000.");
exit(1);
}
num = N;
for (i = 0; i < N; i++) {
scanf("%d", &x[i]);
if (x[i] > 100000000 || x[i] < 2) {
pri... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
int x[10000], N, i, j, num;
scanf("%d", &N);
if (N < 1 || N > 10000) {
printf("Please type 1 to 10000.");
exit(1);
}
num = N;
for (i = 0; i < N; i++) {
scanf("%d", &x[i]);
if (x[i] > 100000000 || x[i] < 2) {
pri... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94]] | 0 | 191 | 1 |
#include <stdio.h>
int isPrime(int);
int main() {
int i, l, count, a;
count = 0;
scanf("%d", &l);
for (i = 0; i < l; i++) {
scanf("%d", &a);
count += isPrime(a);
}
printf("%d\n", count);
return 0;
}
int isPrime(int a) {
int i;
if (a == 1)
return 0;
else if (a == 2)
return 1;
... | #include <stdio.h>
int isPrime(int);
int main() {
int i, l, count, a;
count = 0;
scanf("%d", &l);
for (i = 0; i < l; i++) {
scanf("%d", &a);
count += isPrime(a);
}
printf("%d\n", count);
return 0;
}
int isPrime(int a) {
int i;
if (a < 2)
return 0;
else if (a == 2)
return 1;
... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["-", 75, 76, 0, 9, 0, 7, 15, 16, 17, 18], ["+", 75, 76, 0, 9, 0, 7, 15, 16, 17, 19]] | 0 | 161 | 6 |
#include <math.h>
#include <stdio.h>
int main(void) {
int a = 0, n, m, i, j, Rm;
scanf(" %d", &n);
for (i = 0; i < n; i++) {
scanf(" %d", &m);
Rm = pow(m, 0.5);
for (j = 2; j < Rm; j++) {
if (m % j == 0)
break;
}
if (j == Rm)
a++;
}
printf("%d\n", a);
}
| #include <math.h>
#include <stdio.h>
int main(void) {
int a = 0, n, m, i, j, Rm;
scanf(" %d", &n);
for (i = 0; i < n; i++) {
scanf(" %d", &m);
Rm = pow(m, 0.5);
// printf("i = %2d,Rm = %d\n",i,Rm);
for (j = 2; j < Rm + 1; j++) {
if (m % j == 0)
break;
}
if (j == Rm + 1)
... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 114 | 4 |
#include <stdio.h>
int prime(int n) {
int i;
if (n < 2)
return 0;
if (n == 2)
return 1;
if ((n & 1) == 0)
return 0;
for (i = 3; i * i <= n; i += 3)
if (n % i == 0)
return 0;
return 1;
}
int main() {
int n, p, c = 0;
scanf("%d", &n);
while (n--) {
scanf("%d", &p);
c += p... | #include <stdio.h>
int prime(int n) {
int i;
if (n < 2)
return 0;
if (n == 2)
return 1;
if ((n & 1) == 0)
return 0;
for (i = 3; i * i <= n; i += 2)
if (n % i == 0)
return 0;
return 1;
}
int main() {
int n, p, c = 0;
scanf("%d", &n);
while (n--) {
scanf("%d", &p);
c += p... | [["-", 0, 14, 8, 9, 0, 7, 26, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 26, 11, 12, 13]] | 0 | 136 | 2 |
#include <ctype.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define PI 3.14159265359
#define N_MAX 10000
#define NUM 1000
#define min(x, y) ((x) < (y) ? (x) : (y))
#define max(x, y) ((x) > (y) ? (x) : (y))
bool prime(const int n) {
int i;
if (n <= 1)
ret... | #include <ctype.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define PI 3.14159265359
#define N_MAX 10000
#define NUM 1000
#define min(x, y) ((x) < (y) ? (x) : (y))
#define max(x, y) ((x) > (y) ? (x) : (y))
bool prime(const int n) {
int i;
if (n <= 1)
ret... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 196 | 2 |
#include <math.h>
#include <stdio.h>
#define N 10000
#include <stdio.h>
#define N 10000
int main() {
int i = 0, A[N], count = 0, count2 = 0, n, k;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
for (i = 0; i < n; i++) {
if (A[i] == 2)
count++;
if (A[i] % 2 != 0) {
for (k... | #include <math.h>
#include <stdio.h>
#define N 10000
#include <stdio.h>
#define N 10000
int main() {
int i = 0, A[N], count = 0, count2 = 0, n, k;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
for (i = 0; i < n; i++) {
if (A[i] == 2)
count++;
if (A[i] % 2 != 0) {
for (k... | [["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19]] | 0 | 182 | 2 |
#include <math.h>
#include <stdio.h>
#define N 10000
int main() {
int count = 0, n, i, j;
int array[N];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &array[i]);
for (i = 0; i < n; i--) {
for (j = 2; j <= sqrt((double)array[i]); j++) {
if (array[i] % j == 0) {
count++;
... | #include <math.h>
#include <stdio.h>
#define N 10000
int main() {
int count = 0, n, i, j;
int array[N];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &array[i]);
for (i = 0; i < n; i++) {
for (j = 2; j <= sqrt((double)array[i]); j++) {
if (array[i] % j == 0) {
count++;
... | [["-", 0, 14, 8, 9, 0, 7, 26, 27, 17, 68], ["+", 0, 14, 8, 9, 0, 7, 26, 27, 17, 29]] | 0 | 138 | 2 |
#include <math.h>
#include <stdio.h>
int isprim();
int main() {
int a, b[10000], i, l, m = 0;
scanf("%d", &a);
for (l = 0; l < a; l++) {
scanf("%d", &b[l]);
}
for (i = 0; i < a; i++) {
if (isprim(b[i]) == 1)
m++;
}
printf("%d\n", m);
return 0;
}
int isprim(x) {
int i;
if (x == 2)
r... | #include <math.h>
#include <stdio.h>
int isprim();
int main() {
int a, b[10000], i, l, m = 0;
scanf("%d", &a);
for (l = 0; l < a; l++) {
scanf("%d", &b[l]);
}
for (i = 0; i < a; i++) {
if (isprim(b[i]) == 1)
m++;
}
printf("%d\n", m);
return 0;
}
int isprim(x) {
int i;
if (x == 2)
r... | [["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13]] | 0 | 182 | 2 |
#include <iostream>
using namespace std;
// prime judge function
int is_prime(int x) {
if (x == 2)
return 1;
if (x < 2 || x % 2 == 0)
return 0;
for (int i = 3; i * i < x; i += 2) {
if (x % i == 0)
return 0;
}
return 1;
}
int main() {
int A[10001], N;
cin >> N;
int cnt = 0;
for (int... | #include <iostream>
using namespace std;
// prime judge function
int is_prime(int x) {
if (x == 2)
return 1;
if (x < 2 || x % 2 == 0)
return 0;
for (int i = 3; i * i <= x; i += 2) {
if (x % i == 0)
return 0;
}
return 1;
}
int main() {
int A[10001], N;
cin >> N;
int cnt = 0;
for (in... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 137 | 2 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
bool judge(int p) {
if (p == 2)
return true;
if (p < 2 | p % 2 == 0)
return false;
int i = 3;
int sqrtx = sqrt(p);
while (i < sqrtx) {
if (p % i == 0) {
return false;
} else {
i = i + 2;
}
}
return true;
}
int main()... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
bool judge(int p) {
if (p == 2)
return true;
if (p < 2 | p % 2 == 0)
return false;
int i = 3;
int sqrtx = sqrt(p);
while (i <= sqrtx) {
if (p % i == 0) {
return false;
} else {
i = i + 2;
}
}
return true;
}
int main(... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 19], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 171 | 3 |
#include <cmath>
#include <cstdio>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int judge, count, flag, j;
double x;
count = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &judge);
if (judge == 2) {
count++;
} else if (judge > 2 && judge % 2 == 0) {
} else if (ju... | #include <cmath>
#include <cstdio>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int judge, count, flag, j;
double x;
count = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &judge);
if (judge == 2) {
count++;
} else if (judge > 2 && judge % 2 == 0) {
} else if (ju... | [["+", 64, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 64, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 199 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, f, n) for (int i = (f); i <= (n); ++i)
#define outl(x) cout << (x) << '\n'
#define FAST() cin.tie(0), ios::sync_with_stdio(false)
template <class A, class B> inline bool chmax(A &a, B b) {
return b > a ? a = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, f, n) for (int i = (f); i <= (n); ++i)
#define outl(x) cout << (x) << '\n'
#define FAST() cin.tie(0), ios::sync_with_stdio(false)
template <class A, class B> inline bool chmax(A &a, B b) {
return b > a ? a = ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 236 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
bool isPrime(int a) {
for (int i = 2; i < a / 2; i++) {
if (a % i == 0) {
return false;
}
}
return true;
}
int main() {
int n;
cin >> n;
int sum = 0;
int x;
for (int i = 0; i < n; i++) {
cin >> x;
if (isPrime(x))
... | #include <cmath>
#include <iostream>
using namespace std;
bool isPrime(int a) {
for (int i = 2; i <= sqrt(a); i++) {
if (a % i == 0) {
return false;
}
}
return true;
}
int main() {
int n;
cin >> n;
int sum = 0;
int x;
for (int i = 0; i < n; i++) {
cin >> x;
if (isPrime(x))
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 8, 9, 0, 7, 15, 16, 12, 2, 63, 22], ["+", 0, 7, 15, 16, 12, 2, 3, 4, 0, 24], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 85], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 7, 15, 16, 12, 2, 3, 4, 0, 25]] | 1 | 111 | 7 |
#include <iostream>
#include <math.h>
using namespace std;
bool isPrime(int x) {
if (x == 2) {
return 2;
}
if (x % 2 == 0) {
return false;
}
for (int w = 3; w < sqrt(x); w += 2) {
if (x % w == 0) {
return false;
}
}
return true;
}
int main() {
int i, p;
int count = 0;
cin >> ... |
#include <iostream>
#include <math.h>
using namespace std;
bool isPrime(int x) {
if (x == 2) {
return 2;
}
if (x % 2 == 0) {
return false;
}
for (int w = 3; w <= sqrt(x); w += 2) {
if (x % w == 0) {
return false;
}
}
return true;
}
int main() {
int i, p;
int count = 0;
cin >... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 134 | 2 |
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <sstream>
using namespace std;
void input(int *a, int n) {
for (int i = 0; i < n; i++) {
cin >> a[i];
}
}
int main() {
int n, a[10001];
cin >> n;
input(a, n);
int count = 0;
for (int i = 0; i < n; ... | #include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <sstream>
using namespace std;
void input(int *a, int n) {
for (int i = 0; i < n; i++) {
cin >> a[i];
}
}
int main() {
int n, a[10001];
cin >> n;
input(a, n);
int count = 0;
for (int i = 0; i < n; ... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 157 | 2 |
#include <iostream>
#include <math.h>
using namespace std;
bool primeNum(int num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
for (int i = 3; i <= sqrt(num); i += 2) {
if (num % i == 0)
return false;
}
}
int main(void) {
int n;
... | #include <iostream>
#include <math.h>
using namespace std;
bool primeNum(int num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
for (int i = 3; i <= sqrt(num); i += 2) {
if (num % i == 0)
return false;
}
return true;
}
int main(voi... | [["+", 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 | 139 | 3 |
#include <cmath>
#include <iostream>
using namespace std;
int IsPrime(int a) {
if (a == 2) {
return 1;
} else if (a % 2 == 0) {
return 0;
}
for (int i = 3; i < sqrt(a); i += 2) {
if (a % i == 0) {
return 0;
}
}
return 1;
}
int main() {
int n;
cin >> n;
int ans = 0;
for (in... | #include <cmath>
#include <iostream>
using namespace std;
int IsPrime(int a) {
if (a == 2) {
return 1;
} else if (a % 2 == 0) {
return 0;
}
for (int i = 3; i <= sqrt(a); i += 2) {
if (a % i == 0) {
return 0;
}
}
return 1;
}
int main() {
int n;
cin >> n;
int ans = 0;
for (i... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 134 | 2 |
#include <cstdio>
using namespace std;
bool Prime(int x) {
int i;
if (x < 2)
return false;
else if (x == 2)
return true;
if (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;
scanf("%d", &n);
int N[n];
... | #include <cstdio>
using namespace std;
bool Prime(int x) {
int i;
if (x < 2)
return false;
else if (x == 2)
return true;
if (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;
scanf("%d", &n);
int N[n];... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 180 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
bool isPrime(int num) {
if (num == 1)
return false;
if (num == 2)
return true;
if (num % 2 == 0)
return false;
for (int i = 3; i < sqrt(num); i += 2) {
bool flag = false;
for (int j = i; j < sqrt(i); j += 2) {
if (i % j == 0) ... | #include <cmath>
#include <iostream>
using namespace std;
bool isPrime(int num) {
if (num == 1)
return false;
if (num == 2)
return true;
if (num % 2 == 0)
return false;
for (int i = 3; i <= sqrt(num); i += 2) {
bool flag = false;
for (int j = i; j <= sqrt(i); j += 2) {
if (i % j == 0... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 193 | 4 |
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main(void) {
int n;
vector<int> v(10000);
int flg = 0;
int count = 0;
cin >> n;
for (int k = 0; k < n; k++) {
cin >> v[k];
for (int j = 2; j <= sqrt(v[k]) + 2; j++) {
if (v[k] % j == 0 && v[k] != j) {
flg... |
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main(void) {
int n;
vector<int> v(10000);
int flg = 0;
int count = 0;
cin >> n;
for (int k = 0; k < n; k++) {
cin >> v[k];
for (int j = 2; j <= sqrt(v[k]) + 2; j++) {
if (v[k] % j == 0 && v[k] != j) {
fl... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 141 | 2 |
#include <cmath>
#include <iostream>
int main() {
int n;
std::cin >> n;
int i, j;
int a[n] = {0};
int cnt = 0, cnt2 = 0;
for (i = 0; i < n; i++) {
std::cin >> a[i];
}
for (i = 0; i < n; i++) {
cnt = 0;
for (j = 2; j < sqrt(a[i]); j++) {
if (a[i] % j == 0) {
cnt += 1;
}... | #include <cmath>
#include <iostream>
int main() {
int n;
std::cin >> n;
int i, j;
int a[n] = {0};
int cnt = 0, cnt2 = 0;
for (i = 0; i < n; i++) {
std::cin >> a[i];
}
for (i = 0; i < n; i++) {
cnt = 0;
for (j = 2; j < sqrt(a[i]) + 1; j++) {
if (a[i] % j == 0) {
cnt += 1;
... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 155 | 4 |
#include <iostream>
bool isP(int x) {
for (int i = 2; i * i < x; i++) {
if (x % i == 0)
return false;
}
return true;
}
int main(void) {
int n, cnt = 0;
int a;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> a;
cnt += isP(a);
}
std::cout << cnt << std::endl;
return 0;
}
| #include <iostream>
bool isP(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
int main(void) {
int n, cnt = 0;
int a;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> a;
cnt += isP(a);
}
std::cout << cnt << std::endl;
return 0;
}
| [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 107 | 2 |
#include <iostream>
using namespace std;
int main() {
int N, a, ans = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
bool flag = true;
if (a != 2 && a % 2 == 0 || a == 1) {
flag = false;
} else if (a != 2) {
for (int j = 3; j * j < a; j += 2) {
if (a % j == 0) {
... | #include <iostream>
using namespace std;
int main() {
int N, a, ans = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
bool flag = true;
if (a != 2 && a % 2 == 0 || a == 1) {
flag = false;
} else if (a > 2) {
for (int j = 3; j * j <= a; j += 2) {
if (a % j == 0) {
... | [["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19]] | 1 | 135 | 4 |
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int input[n];
for (int i = 0; i < n; i++)
cin >> input[i];
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = 2; j <= sqrt(input[i]); j++) {
if (input[i] % j == 0) {
cnt++;
break;
... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int input[n];
for (int i = 0; i < n; i++)
cin >> input[i];
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = 2; j <= sqrt(input[i]); j++) {
if (input[i] % j == 0) {
cnt++;
break;
... | [["+", 0, 1, 0, 16, 31, 16, 12, 16, 31, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33]] | 1 | 115 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, a[11000], cnt = 0;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i) {
bool sosu = true;
for (int j = 2; j * j < a[i]; ++j) {
if (a[i] % j == 0) {
sosu = false;
break;
}
}
... | #include <iostream>
using namespace std;
int main() {
int n, a[11000], cnt = 0;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i) {
bool sosu = true;
for (int j = 2; j * j <= a[i]; ++j) {
if (a[i] % j == 0) {
sosu = false;
break;
}
}
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 126 | 2 |
#include <iostream>
using namespace std;
bool isprime(int x) {
if (x == 2) {
return true;
}
if (x < 2 || x % 2 == 0) {
return false;
}
for (int i = 3; i * i <= x; i += 2) {
if (x % i == 0) {
return false;
}
}
return true;
}
int main() {
int n, count = 0;
cin >> n;
for (int i =... | #include <iostream>
using namespace std;
bool isprime(int x) {
if (x == 2) {
return true;
}
if (x < 2 || x % 2 == 0) {
return false;
}
for (int i = 3; i * i <= x; i += 2) {
if (x % i == 0) {
return false;
}
}
return true;
}
int main() {
int n, count = 0;
cin >> n;
for (int i =... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 138 | 2 |
#include <math.h>
#include <stdio.h>
bool isPrime(int x) {
if (x == 2) {
return true;
}
if (x < 2 || x % 2 == 0) {
return false;
}
int i = 3;
while (i <= sqrt(x)) {
if (x % i == 0) {
return false;
}
i = i + 2;
}
return true;
}
int main() {
int n;
scanf("%d", &n);
int... | #include <math.h>
#include <stdio.h>
int isPrime(int x) {
if (x == 2) {
return true;
}
if (x < 2 || x % 2 == 0) {
return false;
}
int i = 3;
while (i <= sqrt(x)) {
if (x % i == 0) {
return false;
}
i = i + 2;
}
return true;
}
int main() {
int n;
scanf("%d", &n);
int ... | [["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 166 | 3 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int inf = 1e9 + 7;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
int in;
cin >> in;
int limit = sqrt(in);
for (int j = 2; j < limit; j++) {
if (in % j == 0) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int inf = 1e9 + 7;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
int in;
cin >> in;
int limit = sqrt(in);
for (int j = 2; j <= limit; j++) {
if (in % j == 0) {... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 31, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33]] | 1 | 111 | 4 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define outl(x) cout << (x) << '\n'
using namespace std;
using pii = pair<int, int>;
inline bool isPrime(int x) {
if (x == 2)
return true;
if ((x & 1) == 0)
return... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define outl(x) cout << (x) << '\n'
using namespace std;
using pii = pair<int, int>;
inline bool isPrime(int x) {
if (x == 2)
return true;
if ((x & 1) == 0)
return... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 163 | 2 |
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | [["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 219 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <sstream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, value, i, j, flag, cnt = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> value;
flag = 1;
if (value == 2)
cnt++;
if (v... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <sstream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, value, i, j, flag, cnt = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> value;
flag = 1;
if (value == 2)
cnt++;
if (v... | [["-", 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, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 141 | 4 |
#include <cassert>
#include <iostream>
#include <math.h>
using namespace std;
bool isPrime(int x) {
if (x < 2)
return false;
else if (x == 2)
return true;
if (x % 2 == 0)
return false;
int limit = (int)sqrt((double)x) + 1;
for (int i = 3; i <= x; i += 2) {
if (x % i == 0)
return false;
... | #include <cassert>
#include <iostream>
#include <math.h>
using namespace std;
bool isPrime(int x) {
if (x < 2)
return false;
else if (x == 2)
return true;
if (x % 2 == 0)
return false;
int limit = (int)sqrt((double)x) + 1;
for (int i = 3; i <= limit; i += 2) {
if (x % i == 0)
return fal... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 173 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int n;
bool is_prime(int x) {
bool ans = true;
if (x <= 1)
ans = false;
else if (x % 2 == 0 && x != 2)
ans = false;
else {
for (int i = 3; i * i <= x; i += 2) {
if (x % i) {
ans = false;
break;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int n;
bool is_prime(int x) {
bool ans = true;
if (x <= 1)
ans = false;
else if (x % 2 == 0 && x != 2)
ans = false;
else {
for (int i = 3; i * i <= x; i += 2) {
if (x % i == 0) {
ans = false;
break... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 146 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
bool isPrime(int n) {
if (n == 2) {
return true;
}
if ((n & 1) == 0) {
return false;
}
for (int i = 3; (i * i) < n; i += 2) {
if ((n % i) == 0) {
return false;
}
}
return (n != 1);
}
int main(void) {
int n, count = ... | #include <algorithm>
#include <iostream>
using namespace std;
bool isPrime(int n) {
if (n == 2) {
return true;
}
if ((n & 1) == 0) {
return false;
}
for (int i = 3; (i * i) <= n; i += 2) {
if ((n % i) == 0) {
return false;
}
}
return (n != 1);
}
int main(void) {
int n, count =... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 147 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, m, num = 0;
double d;
cin >> N;
int j;
for (int i = 0; i < N; i++) {
cin >> m;
d = sqrt(m);
for (j = 2; j <= (int)d && m % j; j++)
;
if ((int)d == j) {
num++;
}
}
cout << num << endl;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, m, num = 0;
double d;
cin >> N;
int j;
for (int i = 0; i < N; i++) {
cin >> m;
d = sqrt(m);
for (j = 2; j <= (int)d && m % j; j++)
;
if (d < j) {
num++;
}
}
cout << num << endl;
} | [["-", 0, 57, 15, 339, 51, 16, 31, 74, 0, 24], ["-", 15, 339, 51, 16, 31, 74, 39, 77, 39, 40], ["-", 0, 57, 15, 339, 51, 16, 31, 74, 0, 25], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 101 | 5 |
#include <iostream>
using namespace std;
int getPrimeNumbers(int max, int prime[]) {
prime[0] = 2;
int counter = 0;
bool isPrime;
for (int i = 3; prime[counter] * prime[counter] < max + 1; i += 2) {
isPrime = true;
for (int j = 0; j <= counter; j++) {
if (i % prime[j] == 0)
isPrime = fals... | #include <iostream>
using namespace std;
int getPrimeNumbers(int max, int prime[]) {
prime[0] = 2;
int counter = 0;
bool isPrime;
for (int i = 3; prime[counter] * prime[counter] < max; i += 2) {
isPrime = true;
for (int j = 0; j <= counter; j++) {
if (i % prime[j] == 0)
isPrime = false;
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 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, 57, 75, 76, 0, 95]] | 1 | 305 | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int sum = 0;
cin >> N;
while (N--) {
int a;
cin >> a;
if (a >= 2) {
++sum;
for (int i = 2; i * i <= a; ++i) {
if (a % i) {
--sum;
break;
}
}
}
}
cout << sum << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int sum = 0;
cin >> N;
while (N--) {
int a;
cin >> a;
if (a >= 2) {
++sum;
for (int i = 2; i * i <= a; ++i) {
if (a % i == 0) {
--sum;
break;
}
}
}
}
cout << sum << endl;
... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 89 | 2 |
#include <iostream>
int main() {
int n;
std::cin >> n;
int ans = 0;
for (int i = 0; i < n; ++i) {
int a;
std::cin >> a;
bool f = true;
for (int j = 2; j * j < a; ++j) {
if (a % j == 0)
f = false;
}
if (f)
ans++;
}
std::cout << ans << std::endl;
return 0;
} | #include <iostream>
int main() {
int n;
std::cin >> n;
int ans = 0;
for (int i = 0; i < n; ++i) {
int a;
std::cin >> a;
bool f = true;
for (int j = 2; j * j <= a; ++j) {
if (a % j == 0)
f = false;
}
if (f)
ans++;
}
std::cout << ans << std::endl;
return 0;
} | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 102 | 2 |
#include <math.h>
#include <stdio.h>
int isPrime(x) {
int i = 3;
if (x == 2)
return 1;
if (x < 2 || x % 2 == 0)
return 0;
while (i <= fabs(x)) {
if (x % i == 0)
return 0;
i += 2;
}
return 1;
}
int main() {
int x, n, i, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
... | #include <math.h>
#include <stdio.h>
int isPrime(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 x, n, i, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
... | [["-", 0, 52, 15, 23, 0, 16, 12, 2, 63, 22], ["+", 0, 52, 15, 23, 0, 16, 12, 2, 63, 22]] | 0 | 144 | 2 |
#include <math.h>
#include <stdio.h>
#define N 1000
int check(int);
int main() {
int total, A[N], i, num, cnt = 0;
scanf("%d", &total);
for (i = 0; i < total; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < total; i++) {
num = check(A[i]);
if (num == 1)
cnt++;
}
printf("%d\n", cnt);
... | #include <math.h>
#include <stdio.h>
#define N 100000
int check(int);
int main() {
int total, A[N], i, num, cnt = 0;
scanf("%d", &total);
for (i = 0; i < total; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < total; i++) {
num = check(A[i]);
if (num == 1)
cnt++;
}
printf("%d\n", cnt);... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 8, 9, 0, 52, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 23, 0, 16, 17, 19]] | 0 | 190 | 4 |
#include <math.h>
#include <stdio.h>
int main() {
int n, a[100000], i, j, f, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] < 2 && 1000000 < a[i])
break;
}
for (i = 0; i < n; i++) {
f = 0;
if (a[i] == 2)
f = 0;
else if (a[i] % 2 == 0)
... |
#include <math.h>
#include <stdio.h>
int main() {
int n, a[100000], i, j, f, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] < 2 && 1000000 < a[i])
break;
}
for (i = 0; i < n; i++) {
f = 0;
if (a[i] == 2)
f = 0;
else if (a[i] % 2 == 0)
... | [["-", 75, 76, 0, 9, 0, 7, 15, 16, 17, 18], ["+", 75, 76, 0, 9, 0, 7, 15, 16, 17, 19]] | 0 | 200 | 2 |
#include <math.h>
#include <stdio.h>
int Check(int);
int main() {
int i, j, count, num, data;
count = 0;
scanf("%d", &num);
for (i = 0; i < num; i++) {
scanf("%d", &data);
j = Check(data);
if (j == 1)
count++;
}
printf("%d\n", count);
return 0;
}
int Check(int data) {
int ... | #include <math.h>
#include <stdio.h>
int Check(int);
int main() {
int i, j, count, num, data;
count = 0;
scanf("%d", &num);
for (i = 0; i < num; i++) {
scanf("%d", &data);
j = Check(data);
if (j == 1)
count++;
}
printf("%d\n", count);
return 0;
}
int Check(int data) {
int ... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 162 | 2 |
#include <stdio.h>
int main() {
int n, a[10000], i, j, flag, ans = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = 0; i < n; i++) {
if (a[i] <= 1)
continue;
else {
flag = 0;
for (j = 2; j * j <= a[i] / 2; j++) {
if (a[i] % j == 0) {
flag... | #include <stdio.h>
int main() {
int n, a[10000], i, j, flag, ans = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = 0; i < n; i++) {
if (a[i] <= 1)
continue;
else {
flag = 0;
for (j = 2; j * j <= a[i]; j++) {
if (a[i] % j == 0) {
flag = 1... | [["-", 0, 9, 0, 7, 15, 16, 12, 16, 17, 85], ["-", 0, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 158 | 2 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
int n, j, i, uncount = 0, x, count = 0;
int *A;
scanf("%d", &n);
A = malloc(sizeof(int) * n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < n; i++) {
if (A[i] == 1)
uncount++;
else if (A[i] == 2... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
int n, j, i, uncount = 0, x, count = 0;
int *A;
scanf("%d", &n);
A = malloc(sizeof(int) * n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < n; i++) {
if (A[i] == 1)
uncount++;
else if (A[i] == 2... | [["-", 0, 57, 75, 76, 0, 7, 15, 16, 17, 18], ["+", 0, 57, 75, 76, 0, 7, 15, 16, 17, 19]] | 0 | 214 | 2 |
#include <math.h>
#include <stdio.h>
int isprime(int);
int main() {
int count, prime = 0;
int i, res;
int num[10000];
scanf("%d", &count);
for (i = 0; i < count; ++i) {
scanf("%d", &num[i]);
}
for (i = 0; i < count; ++i) {
prime += isprime(num[i]);
}
printf("%d\n", prime);
return 0;
}
i... | #include <math.h>
#include <stdio.h>
int isprime(int);
int main() {
int count, prime = 0;
int i, res;
int num[10000];
scanf("%d", &count);
for (i = 0; i < count; ++i) {
scanf("%d", &num[i]);
}
for (i = 0; i < count; ++i) {
prime += isprime(num[i]);
}
printf("%d\n", prime);
return 0;
}
i... | [["-", 0, 57, 15, 23, 0, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 31, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 0 | 190 | 3 |
#include <math.h>
#include <stdio.h>
#define N 10000
int main() {
int n, num[N], i, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &num[i]);
for (i = 0; i < n; i++) {
if (num[i] == 2)
continue;
if (num[i] % 2 == 0) {
count += 1;
continue;
}
for (j = ... | #include <math.h>
#include <stdio.h>
#define N 10000
int main() {
int n, num[N], i, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &num[i]);
for (i = 0; i < n; i++) {
if (num[i] == 2)
continue;
if (num[i] % 2 == 0) {
count += 1;
continue;
}
for (j = ... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 107], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 17, 29], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 165 | 6 |
#include <math.h>
#include <stdio.h>
int main() {
int n, x, count = 0;
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &x);
if (x == 2)
count++;
else if (x % 2) {
for (j = 3; j < sqrt(x); j += 2) {
if (x % j == 0)
break;
}
if (j >= sqrt(x)... | #include <math.h>
#include <stdio.h>
int main() {
int n, x, count = 0;
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &x);
if (x == 2)
count++;
else if (x % 2) {
for (j = 3; j <= sqrt(x); j += 2) {
if (x % j == 0)
break;
}
if (j > sqrt(x)... | [["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19], ["-", 64, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["+", 64, 9, 0, 57, 15, 23, 0, 16, 17, 47]] | 0 | 131 | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.