node_ids
sequencelengths 4
1.4k
| edge_index
sequencelengths 1
2.22k
| text
sequencelengths 4
1.4k
| source
stringlengths 14
427k
|
|---|---|---|---|
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
4,
13,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
41,
13,
2,
4,
18,
13,
17,
17,
41,
13,
20,
13,
4,
18,
13,
13,
17,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
41,
13,
20,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
18,
13,
13,
30,
4,
18,
13,
13,
11,
1,
41,
13,
2,
13,
17,
2,
13,
13,
1,
0,
13,
2,
13,
13,
30,
30,
0,
18,
13,
13,
17,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
14,
2,
18,
13,
13,
13,
30,
3,
14,
2,
2,
18,
13,
13,
13,
17,
30,
0,
13,
17,
14,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
9,
14
],
[
14,
15
],
[
7,
16
],
[
16,
17
],
[
16,
18
],
[
18,
19
],
[
19,
20
],
[
19,
21
],
[
18,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
25,
26
],
[
18,
27
],
[
27,
28
],
[
27,
29
],
[
18,
31
],
[
31,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
31,
36
],
[
36,
37
],
[
36,
38
],
[
31,
39
],
[
39,
40
],
[
40,
41
],
[
31,
42
],
[
43,
43
],
[
43,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
44,
48
],
[
48,
49
],
[
49,
50
],
[
18,
51
],
[
51,
52
],
[
51,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
54,
57
],
[
53,
58
],
[
18,
59
],
[
59,
60
],
[
59,
61
],
[
18,
63
],
[
63,
64
],
[
64,
65
],
[
63,
66
],
[
63,
67
],
[
18,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
68,
72
],
[
18,
73
],
[
73,
74
],
[
74,
75
],
[
74,
76
],
[
73,
77
],
[
18,
78
],
[
78,
79
],
[
78,
80
],
[
18,
81
],
[
81,
82
],
[
82,
83
],
[
83,
84
],
[
83,
85
],
[
81,
86
],
[
86,
87
],
[
86,
88
],
[
81,
89
],
[
89,
90
],
[
90,
91
],
[
81,
92
],
[
93,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
95,
97
],
[
94,
98
],
[
98,
99
],
[
99,
100
],
[
100,
101
],
[
99,
102
],
[
98,
103
],
[
103,
104
],
[
104,
105
],
[
105,
106
],
[
105,
107
],
[
107,
108
],
[
107,
109
],
[
103,
110
],
[
110,
111
],
[
110,
112
],
[
103,
113
],
[
113,
114
],
[
114,
115
],
[
114,
116
],
[
116,
117
],
[
116,
118
],
[
103,
119
],
[
120,
120
],
[
120,
121
],
[
121,
122
],
[
122,
123
],
[
122,
124
],
[
121,
125
],
[
18,
126
],
[
126,
127
],
[
126,
128
],
[
18,
129
],
[
129,
130
],
[
130,
131
],
[
131,
132
],
[
131,
133
],
[
129,
134
],
[
134,
135
],
[
134,
136
],
[
129,
137
],
[
137,
138
],
[
138,
139
],
[
129,
140
],
[
141,
141
],
[
141,
142
],
[
142,
143
],
[
142,
144
],
[
141,
145
],
[
145,
146
],
[
146,
147
],
[
147,
148
],
[
147,
149
],
[
145,
150
],
[
150,
151
],
[
150,
152
],
[
152,
153
],
[
153,
154
],
[
145,
155
],
[
155,
156
],
[
156,
157
],
[
145,
158
],
[
159,
159
],
[
159,
160
],
[
160,
161
],
[
160,
162
],
[
162,
163
],
[
163,
164
],
[
162,
165
],
[
159,
166
],
[
166,
167
],
[
167,
168
],
[
168,
169
],
[
168,
170
],
[
167,
171
],
[
166,
172
],
[
172,
173
],
[
159,
174
],
[
174,
175
],
[
175,
176
],
[
176,
177
],
[
177,
178
],
[
177,
179
],
[
176,
180
],
[
175,
181
],
[
174,
182
],
[
182,
183
],
[
183,
184
],
[
183,
185
],
[
141,
186
],
[
186,
187
],
[
186,
188
],
[
188,
189
],
[
189,
190
],
[
18,
191
],
[
191,
192
],
[
192,
193
],
[
193,
194
],
[
193,
195
],
[
191,
196
]
] | [
"\nimport java.io.*;\nimport java.util.*;\n\nclass Main{\n\tpublic static void main(String[] args){\n\t\tsolve();\n\t}\n\tpublic static void solve(){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] num = new int[n];\n\t\tfor(int i=0;i<n;i++){\n\t\t\tnum[i] = sc.nextInt();\n\t\t}\n\t\tint etc = (int)Math.sqrt(100000000)+3;\n\t\tboolean[] prime = new boolean[etc];\n\t\tArrays.fill(prime, true);\n\t\tprime[0] = false;\n\t\tprime[1] = false;\n\t\tArrayList<Integer> list = new ArrayList<Integer>();\n\t\tfor(int i=2;i<etc;i++){\n\t\t\tif(prime[i]){\n\t\t\t\tlist.add(i);\n\t\t\t\tfor(int j=i*2;j<etc;j=j+i){\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint count = 0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tboolean flag = true;\n\t\t\tfor(int j=0;j<list.size();j++){\n\t\t\t\tint x = list.get(j);\n\t\t\t\tif(num[i] <= x){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(num[i]%x==0){\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\n\t}\n}\n\n",
"import java.io.*;",
"io.*",
"java",
"import java.util.*;",
"util.*",
"java",
"class Main{\n\tpublic static void main(String[] args){\n\t\tsolve();\n\t}\n\tpublic static void solve(){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] num = new int[n];\n\t\tfor(int i=0;i<n;i++){\n\t\t\tnum[i] = sc.nextInt();\n\t\t}\n\t\tint etc = (int)Math.sqrt(100000000)+3;\n\t\tboolean[] prime = new boolean[etc];\n\t\tArrays.fill(prime, true);\n\t\tprime[0] = false;\n\t\tprime[1] = false;\n\t\tArrayList<Integer> list = new ArrayList<Integer>();\n\t\tfor(int i=2;i<etc;i++){\n\t\t\tif(prime[i]){\n\t\t\t\tlist.add(i);\n\t\t\t\tfor(int j=i*2;j<etc;j=j+i){\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint count = 0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tboolean flag = true;\n\t\t\tfor(int j=0;j<list.size();j++){\n\t\t\t\tint x = list.get(j);\n\t\t\t\tif(num[i] <= x){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(num[i]%x==0){\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\n\t}\n}",
"Main",
"public static void main(String[] args){\n\t\tsolve();\n\t}",
"main",
"{\n\t\tsolve();\n\t}",
"solve()",
"solve",
"String[] args",
"args",
"public static void solve(){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] num = new int[n];\n\t\tfor(int i=0;i<n;i++){\n\t\t\tnum[i] = sc.nextInt();\n\t\t}\n\t\tint etc = (int)Math.sqrt(100000000)+3;\n\t\tboolean[] prime = new boolean[etc];\n\t\tArrays.fill(prime, true);\n\t\tprime[0] = false;\n\t\tprime[1] = false;\n\t\tArrayList<Integer> list = new ArrayList<Integer>();\n\t\tfor(int i=2;i<etc;i++){\n\t\t\tif(prime[i]){\n\t\t\t\tlist.add(i);\n\t\t\t\tfor(int j=i*2;j<etc;j=j+i){\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint count = 0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tboolean flag = true;\n\t\t\tfor(int j=0;j<list.size();j++){\n\t\t\t\tint x = list.get(j);\n\t\t\t\tif(num[i] <= x){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(num[i]%x==0){\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\n\t}",
"solve",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] num = new int[n];\n\t\tfor(int i=0;i<n;i++){\n\t\t\tnum[i] = sc.nextInt();\n\t\t}\n\t\tint etc = (int)Math.sqrt(100000000)+3;\n\t\tboolean[] prime = new boolean[etc];\n\t\tArrays.fill(prime, true);\n\t\tprime[0] = false;\n\t\tprime[1] = false;\n\t\tArrayList<Integer> list = new ArrayList<Integer>();\n\t\tfor(int i=2;i<etc;i++){\n\t\t\tif(prime[i]){\n\t\t\t\tlist.add(i);\n\t\t\t\tfor(int j=i*2;j<etc;j=j+i){\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint count = 0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tboolean flag = true;\n\t\t\tfor(int j=0;j<list.size();j++){\n\t\t\t\tint x = list.get(j);\n\t\t\t\tif(num[i] <= x){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(num[i]%x==0){\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int[] num = new int[n];",
"num",
"new int[n]",
"n",
"for(int i=0;i<n;i++){\n\t\t\tnum[i] = sc.nextInt();\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tnum[i] = sc.nextInt();\n\t\t}",
"{\n\t\t\tnum[i] = sc.nextInt();\n\t\t}",
"num[i] = sc.nextInt()",
"num[i]",
"num",
"i",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int etc = (int)Math.sqrt(100000000)+3;",
"etc",
"(int)Math.sqrt(100000000)+3",
"(int)Math.sqrt(100000000)",
"Math.sqrt",
"Math",
"100000000",
"3",
"boolean[] prime = new boolean[etc];",
"prime",
"new boolean[etc]",
"etc",
"Arrays.fill(prime, true)",
"Arrays.fill",
"Arrays",
"prime",
"true",
"prime[0] = false",
"prime[0]",
"prime",
"0",
"false",
"prime[1] = false",
"prime[1]",
"prime",
"1",
"false",
"ArrayList<Integer> list = new ArrayList<Integer>();",
"list",
"new ArrayList<Integer>()",
"for(int i=2;i<etc;i++){\n\t\t\tif(prime[i]){\n\t\t\t\tlist.add(i);\n\t\t\t\tfor(int j=i*2;j<etc;j=j+i){\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"int i=2;",
"int i=2;",
"i",
"2",
"i<etc",
"i",
"etc",
"i++",
"i++",
"i",
"{\n\t\t\tif(prime[i]){\n\t\t\t\tlist.add(i);\n\t\t\t\tfor(int j=i*2;j<etc;j=j+i){\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"{\n\t\t\tif(prime[i]){\n\t\t\t\tlist.add(i);\n\t\t\t\tfor(int j=i*2;j<etc;j=j+i){\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"if(prime[i]){\n\t\t\t\tlist.add(i);\n\t\t\t\tfor(int j=i*2;j<etc;j=j+i){\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}\n\t\t\t}",
"prime[i]",
"prime",
"i",
"{\n\t\t\t\tlist.add(i);\n\t\t\t\tfor(int j=i*2;j<etc;j=j+i){\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}\n\t\t\t}",
"list.add(i)",
"list.add",
"list",
"i",
"for(int j=i*2;j<etc;j=j+i){\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}",
"int j=i*2;",
"int j=i*2;",
"j",
"i*2",
"i",
"2",
"j<etc",
"j",
"etc",
"j=j+i",
"j=j+i",
"j",
"j+i",
"j",
"i",
"{\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}",
"{\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}",
"prime[j] = false",
"prime[j]",
"prime",
"j",
"false",
"int count = 0;",
"count",
"0",
"for(int i=0;i<n;i++){\n\t\t\tboolean flag = true;\n\t\t\tfor(int j=0;j<list.size();j++){\n\t\t\t\tint x = list.get(j);\n\t\t\t\tif(num[i] <= x){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(num[i]%x==0){\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tboolean flag = true;\n\t\t\tfor(int j=0;j<list.size();j++){\n\t\t\t\tint x = list.get(j);\n\t\t\t\tif(num[i] <= x){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(num[i]%x==0){\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"{\n\t\t\tboolean flag = true;\n\t\t\tfor(int j=0;j<list.size();j++){\n\t\t\t\tint x = list.get(j);\n\t\t\t\tif(num[i] <= x){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(num[i]%x==0){\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"boolean flag = true;",
"flag",
"true",
"for(int j=0;j<list.size();j++){\n\t\t\t\tint x = list.get(j);\n\t\t\t\tif(num[i] <= x){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(num[i]%x==0){\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t}",
"int j=0;",
"int j=0;",
"j",
"0",
"j<list.size()",
"j",
"list.size()",
"list.size",
"list",
"j++",
"j++",
"j",
"{\n\t\t\t\tint x = list.get(j);\n\t\t\t\tif(num[i] <= x){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(num[i]%x==0){\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tint x = list.get(j);\n\t\t\t\tif(num[i] <= x){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(num[i]%x==0){\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t}",
"int x = list.get(j);",
"x",
"list.get(j)",
"list.get",
"list",
"j",
"if(num[i] <= x){\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"num[i] <= x",
"num[i]",
"num",
"i",
"x",
"{\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"break;",
"if(num[i]%x==0){\n\t\t\t\t\tflag = false;\n\t\t\t\t}",
"num[i]%x==0",
"num[i]%x",
"num[i]",
"num",
"i",
"x",
"0",
"{\n\t\t\t\t\tflag = false;\n\t\t\t\t}",
"flag = false",
"flag",
"false",
"if(flag){\n\t\t\t\tcount++;\n\t\t\t}",
"flag",
"{\n\t\t\t\tcount++;\n\t\t\t}",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count"
] |
import java.io.*;
import java.util.*;
class Main{
public static void main(String[] args){
solve();
}
public static void solve(){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] num = new int[n];
for(int i=0;i<n;i++){
num[i] = sc.nextInt();
}
int etc = (int)Math.sqrt(100000000)+3;
boolean[] prime = new boolean[etc];
Arrays.fill(prime, true);
prime[0] = false;
prime[1] = false;
ArrayList<Integer> list = new ArrayList<Integer>();
for(int i=2;i<etc;i++){
if(prime[i]){
list.add(i);
for(int j=i*2;j<etc;j=j+i){
prime[j] = false;
}
}
}
int count = 0;
for(int i=0;i<n;i++){
boolean flag = true;
for(int j=0;j<list.size();j++){
int x = list.get(j);
if(num[i] <= x){
break;
}
if(num[i]%x==0){
flag = false;
}
}
if(flag){
count++;
}
}
System.out.println(count);
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
41,
13,
4,
13,
13,
14,
2,
13,
17,
30,
40,
13,
4,
18,
18,
13,
13,
13,
4,
18,
13,
12,
13,
30,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
2,
2,
13,
17,
17,
29,
17,
30,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
17,
23,
13,
12,
13,
30,
4,
18,
18,
13,
13,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
18,
20,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
137,
8
],
[
137,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
11,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
11,
20
],
[
20,
21
],
[
20,
22
],
[
11,
23
],
[
23,
24
],
[
24,
25
],
[
25,
26
],
[
25,
27
],
[
23,
28
],
[
28,
29
],
[
28,
30
],
[
23,
31
],
[
31,
32
],
[
32,
33
],
[
23,
34
],
[
35,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
35,
41
],
[
41,
42
],
[
41,
43
],
[
43,
44
],
[
43,
45
],
[
35,
46
],
[
46,
47
],
[
47,
48
],
[
47,
49
],
[
46,
50
],
[
50,
51
],
[
51,
52
],
[
11,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
53,
58
],
[
11,
59
],
[
59,
60
],
[
60,
61
],
[
137,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
65,
66
],
[
66,
67
],
[
66,
68
],
[
65,
69
],
[
69,
70
],
[
65,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
73,
75
],
[
72,
76
],
[
76,
77
],
[
77,
78
],
[
77,
79
],
[
76,
80
],
[
71,
81
],
[
81,
82
],
[
71,
83
],
[
83,
84
],
[
84,
85
],
[
85,
86
],
[
86,
87
],
[
86,
88
],
[
84,
89
],
[
89,
90
],
[
89,
91
],
[
91,
92
],
[
92,
93
],
[
91,
94
],
[
84,
95
],
[
95,
96
],
[
96,
97
],
[
96,
98
],
[
84,
99
],
[
100,
100
],
[
100,
101
],
[
101,
102
],
[
102,
103
],
[
103,
104
],
[
103,
105
],
[
102,
106
],
[
101,
107
],
[
107,
108
],
[
108,
109
],
[
83,
110
],
[
110,
111
],
[
62,
112
],
[
112,
113
],
[
137,
114
],
[
114,
115
],
[
114,
116
],
[
116,
117
],
[
117,
118
],
[
118,
119
],
[
119,
120
],
[
119,
121
],
[
117,
122
],
[
122,
123
],
[
123,
124
],
[
122,
125
],
[
114,
126
],
[
126,
127
],
[
137,
128
],
[
128,
129
],
[
128,
130
],
[
130,
131
],
[
131,
132
],
[
132,
133
],
[
128,
134
],
[
134,
135
],
[
0,
136
],
[
136,
137
],
[
136,
138
]
] | [
"import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tint a = sc.nextInt();\n\t\t\tboolean b = isPrime(a);\t\n\t\t\tif(b == true) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t\t\n\t\t\t\t\n\t\tsc.close();\n\t}\n\t\n\tboolean isPrime(int x) {\n\t\tif(x == 2) return true;\n\t\telse if(x < 2 || x % 2 == 0) return false;\n\t\telse {\n\t\t\tfor(int i = 3; i <= Math.sqrt(x); i += 2) {\n\t\t\t\tif(x%i==0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t}\n\n\tvoid debug(Object... o) {\n\t\tSystem.out.println(Arrays.deepToString(o));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n}",
"import java.util.Arrays;",
"Arrays",
"java.util",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tint a = sc.nextInt();\n\t\t\tboolean b = isPrime(a);\t\n\t\t\tif(b == true) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t\t\n\t\t\t\t\n\t\tsc.close();\n\t}\n\t\n\tboolean isPrime(int x) {\n\t\tif(x == 2) return true;\n\t\telse if(x < 2 || x % 2 == 0) return false;\n\t\telse {\n\t\t\tfor(int i = 3; i <= Math.sqrt(x); i += 2) {\n\t\t\t\tif(x%i==0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t}\n\n\tvoid debug(Object... o) {\n\t\tSystem.out.println(Arrays.deepToString(o));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n}",
"Main",
"void run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tint a = sc.nextInt();\n\t\t\tboolean b = isPrime(a);\t\n\t\t\tif(b == true) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t\t\n\t\t\t\t\n\t\tsc.close();\n\t}",
"run",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tint a = sc.nextInt();\n\t\t\tboolean b = isPrime(a);\t\n\t\t\tif(b == true) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t\t\n\t\t\t\t\n\t\tsc.close();\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int count = 0;",
"count",
"0",
"for(int i = 0; i < n; i++) {\n\t\t\tint a = sc.nextInt();\n\t\t\tboolean b = isPrime(a);\t\n\t\t\tif(b == true) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tint a = sc.nextInt();\n\t\t\tboolean b = isPrime(a);\t\n\t\t\tif(b == true) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"{\n\t\t\tint a = sc.nextInt();\n\t\t\tboolean b = isPrime(a);\t\n\t\t\tif(b == true) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"int a = sc.nextInt();",
"a",
"sc.nextInt()",
"sc.nextInt",
"sc",
"boolean b = isPrime(a);",
"b",
"isPrime(a)",
"isPrime",
"a",
"if(b == true) {\n\t\t\t\tcount++;\n\t\t\t}",
"b == true",
"b",
"true",
"{\n\t\t\t\tcount++;\n\t\t\t}",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"sc.close()",
"sc.close",
"sc",
"boolean isPrime(int x) {\n\t\tif(x == 2) return true;\n\t\telse if(x < 2 || x % 2 == 0) return false;\n\t\telse {\n\t\t\tfor(int i = 3; i <= Math.sqrt(x); i += 2) {\n\t\t\t\tif(x%i==0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t}",
"isPrime",
"{\n\t\tif(x == 2) return true;\n\t\telse if(x < 2 || x % 2 == 0) return false;\n\t\telse {\n\t\t\tfor(int i = 3; i <= Math.sqrt(x); i += 2) {\n\t\t\t\tif(x%i==0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t}",
"if(x == 2) return true;\n\t\telse if(x < 2 || x % 2 == 0) return false;\n\t\telse {\n\t\t\tfor(int i = 3; i <= Math.sqrt(x); i += 2) {\n\t\t\t\tif(x%i==0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}",
"x == 2",
"x",
"2",
"return true;",
"true",
"if(x < 2 || x % 2 == 0) return false;\n\t\telse {\n\t\t\tfor(int i = 3; i <= Math.sqrt(x); i += 2) {\n\t\t\t\tif(x%i==0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}",
"x < 2 || x % 2 == 0",
"x < 2",
"x",
"2",
"x % 2 == 0",
"x % 2",
"x",
"2",
"0",
"return false;",
"false",
"{\n\t\t\tfor(int i = 3; i <= Math.sqrt(x); i += 2) {\n\t\t\t\tif(x%i==0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}",
"for(int i = 3; i <= Math.sqrt(x); i += 2) {\n\t\t\t\tif(x%i==0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}",
"int i = 3;",
"int i = 3;",
"i",
"3",
"i <= Math.sqrt(x)",
"i",
"Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"i += 2",
"i += 2",
"i",
"2",
"{\n\t\t\t\tif(x%i==0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif(x%i==0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}",
"if(x%i==0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}",
"x%i==0",
"x%i",
"x",
"i",
"0",
"{\n\t\t\t\t\treturn false;\n\t\t\t\t}",
"return false;",
"false",
"return true;",
"true",
"int x",
"x",
"void debug(Object... o) {\n\t\tSystem.out.println(Arrays.deepToString(o));\n\t}",
"debug",
"{\n\t\tSystem.out.println(Arrays.deepToString(o));\n\t}",
"System.out.println(Arrays.deepToString(o))",
"System.out.println",
"System.out",
"System",
"System.out",
"Arrays.deepToString(o)",
"Arrays.deepToString",
"Arrays",
"o",
"Object... o",
"o",
"public static void main(String[] args) {\n\t\tnew Main().run();\n\t}",
"main",
"{\n\t\tnew Main().run();\n\t}",
"new Main().run()",
"new Main().run",
"new Main()",
"String[] args",
"args",
"public class Main {\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tint a = sc.nextInt();\n\t\t\tboolean b = isPrime(a);\t\n\t\t\tif(b == true) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t\t\n\t\t\t\t\n\t\tsc.close();\n\t}\n\t\n\tboolean isPrime(int x) {\n\t\tif(x == 2) return true;\n\t\telse if(x < 2 || x % 2 == 0) return false;\n\t\telse {\n\t\t\tfor(int i = 3; i <= Math.sqrt(x); i += 2) {\n\t\t\t\tif(x%i==0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t}\n\n\tvoid debug(Object... o) {\n\t\tSystem.out.println(Arrays.deepToString(o));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n}",
"public class Main {\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tint a = sc.nextInt();\n\t\t\tboolean b = isPrime(a);\t\n\t\t\tif(b == true) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t\t\n\t\t\t\t\n\t\tsc.close();\n\t}\n\t\n\tboolean isPrime(int x) {\n\t\tif(x == 2) return true;\n\t\telse if(x < 2 || x % 2 == 0) return false;\n\t\telse {\n\t\t\tfor(int i = 3; i <= Math.sqrt(x); i += 2) {\n\t\t\t\tif(x%i==0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t}\n\n\tvoid debug(Object... o) {\n\t\tSystem.out.println(Arrays.deepToString(o));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n}",
"Main"
] | import java.util.Arrays;
import java.util.Scanner;
public class Main {
void run() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int count = 0;
for(int i = 0; i < n; i++) {
int a = sc.nextInt();
boolean b = isPrime(a);
if(b == true) {
count++;
}
}
System.out.println(count);
sc.close();
}
boolean isPrime(int x) {
if(x == 2) return true;
else if(x < 2 || x % 2 == 0) return false;
else {
for(int i = 3; i <= Math.sqrt(x); i += 2) {
if(x%i==0) {
return false;
}
}
return true;
}
}
void debug(Object... o) {
System.out.println(Arrays.deepToString(o));
}
public static void main(String[] args) {
new Main().run();
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
2,
13,
17,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
4,
13,
4,
18,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
13,
14
],
[
14,
15
],
[
14,
16
],
[
12,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
19,
22
],
[
12,
23
],
[
23,
24
],
[
24,
25
],
[
12,
26
],
[
27,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
30,
31
],
[
30,
32
],
[
29,
33
],
[
28,
34
],
[
34,
35
],
[
35,
36
],
[
11,
37
],
[
37,
38
],
[
38,
39
],
[
38,
40
],
[
9,
41
],
[
41,
42
],
[
7,
43
],
[
43,
44
],
[
43,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
45,
49
],
[
49,
50
],
[
49,
51
],
[
51,
52
],
[
52,
53
],
[
45,
54
],
[
54,
55
],
[
54,
56
],
[
45,
57
],
[
57,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
57,
62
],
[
62,
63
],
[
62,
64
],
[
57,
65
],
[
65,
66
],
[
66,
67
],
[
57,
68
],
[
69,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
73,
74
],
[
74,
75
],
[
70,
76
],
[
76,
77
],
[
45,
78
],
[
78,
79
],
[
79,
80
],
[
80,
81
],
[
80,
82
],
[
78,
83
],
[
43,
84
],
[
84,
85
]
] | [
"import java.util.*;\nimport java.math.*;\nclass Main {\n\tstatic boolean isPrime(int N)\n\t{\n\t\tfor (int i = 2; i <= Math.sqrt(N); i++) \n\t\t{\n\t\t\tif(N % i == 0){return false;}\n\t }\n\t\treturn N!=1;\n }\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint cnt = 0;\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tif(isPrime(sc.nextInt()))\n\t\t\t\tcnt++;\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}\n \n\n\n}\n\n\n",
"import java.util.*;",
"util.*",
"java",
"import java.math.*;",
"math.*",
"java",
"class Main {\n\tstatic boolean isPrime(int N)\n\t{\n\t\tfor (int i = 2; i <= Math.sqrt(N); i++) \n\t\t{\n\t\t\tif(N % i == 0){return false;}\n\t }\n\t\treturn N!=1;\n }\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint cnt = 0;\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tif(isPrime(sc.nextInt()))\n\t\t\t\tcnt++;\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}\n \n\n\n}",
"Main",
"static boolean isPrime(int N)\n\t{\n\t\tfor (int i = 2; i <= Math.sqrt(N); i++) \n\t\t{\n\t\t\tif(N % i == 0){return false;}\n\t }\n\t\treturn N!=1;\n }",
"isPrime",
"{\n\t\tfor (int i = 2; i <= Math.sqrt(N); i++) \n\t\t{\n\t\t\tif(N % i == 0){return false;}\n\t }\n\t\treturn N!=1;\n }",
"for (int i = 2; i <= Math.sqrt(N); i++) \n\t\t{\n\t\t\tif(N % i == 0){return false;}\n\t }",
"int i = 2;",
"int i = 2;",
"i",
"2",
"i <= Math.sqrt(N)",
"i",
"Math.sqrt(N)",
"Math.sqrt",
"Math",
"N",
"i++",
"i++",
"i",
"{\n\t\t\tif(N % i == 0){return false;}\n\t }",
"{\n\t\t\tif(N % i == 0){return false;}\n\t }",
"if(N % i == 0){return false;}",
"N % i == 0",
"N % i",
"N",
"i",
"0",
"{return false;}",
"return false;",
"false",
"return N!=1;",
"N!=1",
"N",
"1",
"int N",
"N",
"public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint cnt = 0;\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tif(isPrime(sc.nextInt()))\n\t\t\t\tcnt++;\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint cnt = 0;\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tif(isPrime(sc.nextInt()))\n\t\t\t\tcnt++;\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int cnt = 0;",
"cnt",
"0",
"for (int i=0; i<n; i++) {\n\t\t\tif(isPrime(sc.nextInt()))\n\t\t\t\tcnt++;\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tif(isPrime(sc.nextInt()))\n\t\t\t\tcnt++;\n\t\t}",
"{\n\t\t\tif(isPrime(sc.nextInt()))\n\t\t\t\tcnt++;\n\t\t}",
"if(isPrime(sc.nextInt()))\n\t\t\t\tcnt++;",
"isPrime(sc.nextInt())",
"isPrime",
"sc.nextInt()",
"sc.nextInt",
"sc",
"cnt++",
"cnt",
"System.out.println(cnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"String[] args",
"args"
] | import java.util.*;
import java.math.*;
class Main {
static boolean isPrime(int N)
{
for (int i = 2; i <= Math.sqrt(N); i++)
{
if(N % i == 0){return false;}
}
return N!=1;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int cnt = 0;
for (int i=0; i<n; i++) {
if(isPrime(sc.nextInt()))
cnt++;
}
System.out.println(cnt);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
17,
4,
18,
13,
13,
17,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
11,
1,
41,
13,
17,
2,
13,
17,
1,
40,
13,
30,
30,
14,
18,
13,
13,
30,
11,
1,
41,
13,
13,
2,
13,
17,
1,
0,
13,
13,
30,
30,
0,
18,
13,
13,
17,
0,
18,
13,
13,
17,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
18,
13,
4,
18,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
21
],
[
21,
22
],
[
22,
23
],
[
21,
24
],
[
21,
25
],
[
8,
26
],
[
26,
27
],
[
27,
28
],
[
27,
29
],
[
26,
30
],
[
8,
31
],
[
31,
32
],
[
32,
33
],
[
32,
34
],
[
31,
35
],
[
8,
36
],
[
36,
37
],
[
37,
38
],
[
38,
39
],
[
38,
40
],
[
36,
41
],
[
41,
42
],
[
41,
43
],
[
36,
44
],
[
44,
45
],
[
45,
46
],
[
36,
47
],
[
48,
48
],
[
48,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
49,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
56,
57
],
[
56,
58
],
[
54,
59
],
[
59,
60
],
[
59,
61
],
[
54,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
54,
66
],
[
67,
67
],
[
67,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
68,
72
],
[
53,
73
],
[
73,
74
],
[
74,
75
],
[
74,
76
],
[
73,
77
],
[
8,
78
],
[
78,
79
],
[
78,
80
],
[
8,
81
],
[
81,
82
],
[
82,
83
],
[
83,
84
],
[
83,
85
],
[
81,
86
],
[
86,
87
],
[
86,
88
],
[
81,
89
],
[
89,
90
],
[
90,
91
],
[
81,
92
],
[
93,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
95,
97
],
[
97,
98
],
[
98,
99
],
[
94,
100
],
[
100,
101
],
[
8,
102
],
[
102,
103
],
[
103,
104
],
[
104,
105
],
[
104,
106
],
[
102,
107
],
[
6,
108
],
[
108,
109
]
] | [
"import java.util.*;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint n = stdIn.nextInt();\n\t\tboolean[] prime = new boolean[100000000];\n\t\tArrays.fill(prime,true);\n\t\tprime[0] = false;\n\t\tprime[1] = false;\n\n\t\tfor (int i=2; i<100000000; i++) {\n\t\t\tif (prime[i]) {\n\t\t\t\tfor (int j=i; j<100000000; j+=i) {\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}\n\t\t\t\tprime[i] = true;\n\t\t\t}\n\t\t}\n\n\t\tint count = 0;\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tif(prime[stdIn.nextInt()])\n\t\t\t\tcount++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}",
"import java.util.*;",
"util.*",
"java",
"class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint n = stdIn.nextInt();\n\t\tboolean[] prime = new boolean[100000000];\n\t\tArrays.fill(prime,true);\n\t\tprime[0] = false;\n\t\tprime[1] = false;\n\n\t\tfor (int i=2; i<100000000; i++) {\n\t\t\tif (prime[i]) {\n\t\t\t\tfor (int j=i; j<100000000; j+=i) {\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}\n\t\t\t\tprime[i] = true;\n\t\t\t}\n\t\t}\n\n\t\tint count = 0;\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tif(prime[stdIn.nextInt()])\n\t\t\t\tcount++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint n = stdIn.nextInt();\n\t\tboolean[] prime = new boolean[100000000];\n\t\tArrays.fill(prime,true);\n\t\tprime[0] = false;\n\t\tprime[1] = false;\n\n\t\tfor (int i=2; i<100000000; i++) {\n\t\t\tif (prime[i]) {\n\t\t\t\tfor (int j=i; j<100000000; j+=i) {\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}\n\t\t\t\tprime[i] = true;\n\t\t\t}\n\t\t}\n\n\t\tint count = 0;\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tif(prime[stdIn.nextInt()])\n\t\t\t\tcount++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"main",
"{\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint n = stdIn.nextInt();\n\t\tboolean[] prime = new boolean[100000000];\n\t\tArrays.fill(prime,true);\n\t\tprime[0] = false;\n\t\tprime[1] = false;\n\n\t\tfor (int i=2; i<100000000; i++) {\n\t\t\tif (prime[i]) {\n\t\t\t\tfor (int j=i; j<100000000; j+=i) {\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}\n\t\t\t\tprime[i] = true;\n\t\t\t}\n\t\t}\n\n\t\tint count = 0;\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tif(prime[stdIn.nextInt()])\n\t\t\t\tcount++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"Scanner stdIn = new Scanner(System.in);",
"stdIn",
"new Scanner(System.in)",
"int n = stdIn.nextInt();",
"n",
"stdIn.nextInt()",
"stdIn.nextInt",
"stdIn",
"boolean[] prime = new boolean[100000000];",
"prime",
"new boolean[100000000]",
"100000000",
"Arrays.fill(prime,true)",
"Arrays.fill",
"Arrays",
"prime",
"true",
"prime[0] = false",
"prime[0]",
"prime",
"0",
"false",
"prime[1] = false",
"prime[1]",
"prime",
"1",
"false",
"for (int i=2; i<100000000; i++) {\n\t\t\tif (prime[i]) {\n\t\t\t\tfor (int j=i; j<100000000; j+=i) {\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}\n\t\t\t\tprime[i] = true;\n\t\t\t}\n\t\t}",
"int i=2;",
"int i=2;",
"i",
"2",
"i<100000000",
"i",
"100000000",
"i++",
"i++",
"i",
"{\n\t\t\tif (prime[i]) {\n\t\t\t\tfor (int j=i; j<100000000; j+=i) {\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}\n\t\t\t\tprime[i] = true;\n\t\t\t}\n\t\t}",
"{\n\t\t\tif (prime[i]) {\n\t\t\t\tfor (int j=i; j<100000000; j+=i) {\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}\n\t\t\t\tprime[i] = true;\n\t\t\t}\n\t\t}",
"if (prime[i]) {\n\t\t\t\tfor (int j=i; j<100000000; j+=i) {\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}\n\t\t\t\tprime[i] = true;\n\t\t\t}",
"prime[i]",
"prime",
"i",
"{\n\t\t\t\tfor (int j=i; j<100000000; j+=i) {\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}\n\t\t\t\tprime[i] = true;\n\t\t\t}",
"for (int j=i; j<100000000; j+=i) {\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}",
"int j=i;",
"int j=i;",
"j",
"i",
"j<100000000",
"j",
"100000000",
"j+=i",
"j+=i",
"j",
"i",
"{\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}",
"{\n\t\t\t\t\tprime[j] = false;\n\t\t\t\t}",
"prime[j] = false",
"prime[j]",
"prime",
"j",
"false",
"prime[i] = true",
"prime[i]",
"prime",
"i",
"true",
"int count = 0;",
"count",
"0",
"for (int i=0; i<n; i++) {\n\t\t\tif(prime[stdIn.nextInt()])\n\t\t\t\tcount++;\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tif(prime[stdIn.nextInt()])\n\t\t\t\tcount++;\n\t\t}",
"{\n\t\t\tif(prime[stdIn.nextInt()])\n\t\t\t\tcount++;\n\t\t}",
"if(prime[stdIn.nextInt()])\n\t\t\t\tcount++;",
"prime[stdIn.nextInt()]",
"prime",
"stdIn.nextInt()",
"stdIn.nextInt",
"stdIn",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args"
] | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
int n = stdIn.nextInt();
boolean[] prime = new boolean[100000000];
Arrays.fill(prime,true);
prime[0] = false;
prime[1] = false;
for (int i=2; i<100000000; i++) {
if (prime[i]) {
for (int j=i; j<100000000; j+=i) {
prime[j] = false;
}
prime[i] = true;
}
}
int count = 0;
for (int i=0; i<n; i++) {
if(prime[stdIn.nextInt()])
count++;
}
System.out.println(count);
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
2,
18,
13,
13,
17,
17,
2,
18,
13,
13,
17,
9,
41,
13,
17,
11,
1,
41,
13,
17,
2,
2,
13,
13,
18,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
2,
18,
13,
13,
13,
17,
30,
0,
13,
17,
3,
14,
13,
40,
13,
4,
18,
18,
13,
13,
13,
4,
18,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
122,
5
],
[
122,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
21
],
[
21,
22
],
[
22,
23
],
[
23,
24
],
[
23,
25
],
[
21,
26
],
[
26,
27
],
[
26,
28
],
[
21,
29
],
[
29,
30
],
[
30,
31
],
[
21,
32
],
[
33,
33
],
[
33,
34
],
[
34,
35
],
[
35,
36
],
[
35,
37
],
[
34,
38
],
[
38,
39
],
[
39,
40
],
[
8,
41
],
[
41,
42
],
[
41,
43
],
[
8,
44
],
[
44,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
44,
49
],
[
49,
50
],
[
49,
51
],
[
44,
52
],
[
52,
53
],
[
53,
54
],
[
44,
55
],
[
56,
56
],
[
56,
57
],
[
57,
58
],
[
58,
59
],
[
59,
60
],
[
60,
61
],
[
61,
62
],
[
61,
63
],
[
60,
64
],
[
59,
65
],
[
58,
66
],
[
66,
67
],
[
67,
68
],
[
67,
69
],
[
66,
70
],
[
57,
71
],
[
56,
72
],
[
72,
73
],
[
72,
74
],
[
56,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
77,
79
],
[
75,
80
],
[
80,
81
],
[
81,
82
],
[
81,
83
],
[
80,
84
],
[
84,
85
],
[
84,
86
],
[
75,
87
],
[
87,
88
],
[
88,
89
],
[
88,
90
],
[
75,
91
],
[
92,
92
],
[
92,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
96,
97
],
[
96,
98
],
[
95,
99
],
[
94,
100
],
[
93,
101
],
[
101,
102
],
[
102,
103
],
[
102,
104
],
[
101,
105
],
[
56,
106
],
[
106,
107
],
[
106,
108
],
[
108,
109
],
[
8,
110
],
[
110,
111
],
[
111,
112
],
[
112,
113
],
[
112,
114
],
[
110,
115
],
[
8,
116
],
[
116,
117
],
[
117,
118
],
[
6,
119
],
[
119,
120
],
[
0,
121
],
[
121,
122
],
[
121,
123
]
] | [
"import java.util.Scanner;\n\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tint num[] = new int[n];\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tnum[i] = scan.nextInt();\n\t\t}\n\n\t\tint count = 0;\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (num[i] % 2 == 0 && num[i] > 2) continue;\n\t\t\tboolean isPrime = true;\n\t\t\tfor (int j = 3; j * j <= num[i]; j += 2) {\n\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (isPrime) count++;\n\t\t}\n\t\t\n\t\tSystem.out.println(count);\n\t\tscan.close();\n\t}\n\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tint num[] = new int[n];\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tnum[i] = scan.nextInt();\n\t\t}\n\n\t\tint count = 0;\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (num[i] % 2 == 0 && num[i] > 2) continue;\n\t\t\tboolean isPrime = true;\n\t\t\tfor (int j = 3; j * j <= num[i]; j += 2) {\n\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (isPrime) count++;\n\t\t}\n\t\t\n\t\tSystem.out.println(count);\n\t\tscan.close();\n\t}\n\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tint num[] = new int[n];\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tnum[i] = scan.nextInt();\n\t\t}\n\n\t\tint count = 0;\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (num[i] % 2 == 0 && num[i] > 2) continue;\n\t\t\tboolean isPrime = true;\n\t\t\tfor (int j = 3; j * j <= num[i]; j += 2) {\n\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (isPrime) count++;\n\t\t}\n\t\t\n\t\tSystem.out.println(count);\n\t\tscan.close();\n\t}",
"main",
"{\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tint num[] = new int[n];\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tnum[i] = scan.nextInt();\n\t\t}\n\n\t\tint count = 0;\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (num[i] % 2 == 0 && num[i] > 2) continue;\n\t\t\tboolean isPrime = true;\n\t\t\tfor (int j = 3; j * j <= num[i]; j += 2) {\n\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (isPrime) count++;\n\t\t}\n\t\t\n\t\tSystem.out.println(count);\n\t\tscan.close();\n\t}",
"Scanner scan = new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"int n = scan.nextInt();",
"n",
"scan.nextInt()",
"scan.nextInt",
"scan",
"int num[] = new int[n];",
"num",
"new int[n]",
"n",
"for (int i = 0; i < n; i++) {\n\t\t\tnum[i] = scan.nextInt();\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tnum[i] = scan.nextInt();\n\t\t}",
"{\n\t\t\tnum[i] = scan.nextInt();\n\t\t}",
"num[i] = scan.nextInt()",
"num[i]",
"num",
"i",
"scan.nextInt()",
"scan.nextInt",
"scan",
"int count = 0;",
"count",
"0",
"for (int i = 0; i < n; i++) {\n\t\t\tif (num[i] % 2 == 0 && num[i] > 2) continue;\n\t\t\tboolean isPrime = true;\n\t\t\tfor (int j = 3; j * j <= num[i]; j += 2) {\n\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (isPrime) count++;\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tif (num[i] % 2 == 0 && num[i] > 2) continue;\n\t\t\tboolean isPrime = true;\n\t\t\tfor (int j = 3; j * j <= num[i]; j += 2) {\n\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (isPrime) count++;\n\t\t}",
"{\n\t\t\tif (num[i] % 2 == 0 && num[i] > 2) continue;\n\t\t\tboolean isPrime = true;\n\t\t\tfor (int j = 3; j * j <= num[i]; j += 2) {\n\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (isPrime) count++;\n\t\t}",
"if (num[i] % 2 == 0 && num[i] > 2) continue;",
"num[i] % 2 == 0 && num[i] > 2",
"num[i] % 2 == 0",
"num[i] % 2",
"num[i]",
"num",
"i",
"2",
"0",
"num[i] > 2",
"num[i]",
"num",
"i",
"2",
"continue;",
"boolean isPrime = true;",
"isPrime",
"true",
"for (int j = 3; j * j <= num[i]; j += 2) {\n\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"int j = 3;",
"int j = 3;",
"j",
"3",
"j * j <= num[i]",
"j * j",
"j",
"j",
"num[i]",
"num",
"i",
"j += 2",
"j += 2",
"j",
"2",
"{\n\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"if (num[i] % j == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"num[i] % j == 0",
"num[i] % j",
"num[i]",
"num",
"i",
"j",
"0",
"{\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"isPrime = false",
"isPrime",
"false",
"break;",
"if (isPrime) count++;",
"isPrime",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"scan.close()",
"scan.close",
"scan",
"String[] args",
"args",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tint num[] = new int[n];\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tnum[i] = scan.nextInt();\n\t\t}\n\n\t\tint count = 0;\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (num[i] % 2 == 0 && num[i] > 2) continue;\n\t\t\tboolean isPrime = true;\n\t\t\tfor (int j = 3; j * j <= num[i]; j += 2) {\n\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (isPrime) count++;\n\t\t}\n\t\t\n\t\tSystem.out.println(count);\n\t\tscan.close();\n\t}\n\n}",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tint num[] = new int[n];\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tnum[i] = scan.nextInt();\n\t\t}\n\n\t\tint count = 0;\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (num[i] % 2 == 0 && num[i] > 2) continue;\n\t\t\tboolean isPrime = true;\n\t\t\tfor (int j = 3; j * j <= num[i]; j += 2) {\n\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (isPrime) count++;\n\t\t}\n\t\t\n\t\tSystem.out.println(count);\n\t\tscan.close();\n\t}\n\n}",
"Main"
] | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int num[] = new int[n];
for (int i = 0; i < n; i++) {
num[i] = scan.nextInt();
}
int count = 0;
for (int i = 0; i < n; i++) {
if (num[i] % 2 == 0 && num[i] > 2) continue;
boolean isPrime = true;
for (int j = 3; j * j <= num[i]; j += 2) {
if (num[i] % j == 0) {
isPrime = false;
break;
}
}
if (isPrime) count++;
}
System.out.println(count);
scan.close();
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
13,
41,
13,
17,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
33,
5
],
[
33,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
21
],
[
21,
22
],
[
21,
23
],
[
8,
24
],
[
24,
25
],
[
25,
26
],
[
26,
27
],
[
26,
28
],
[
24,
29
],
[
6,
30
],
[
30,
31
],
[
0,
32
],
[
32,
33
],
[
32,
34
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner stdIn = new Scanner(System.in);\n int n = stdIn.nextInt();\n int[] a = new int[n];\n int count = 0;\n Outer:\n for (int i = 0; i < n; i++) {\n a[i] = stdIn.nextInt();\n if (a[i] < 2) continue;\n if (a[i] == 2) {\n count++;\n continue;\n }\n if (a[i] % 2 == 0) continue;\n for (int j = 3; j <= a[i] / j; j+= 2) {\n if (a[i] % j == 0) continue Outer;\n }\n count++;\n }\n System.out.println(count);\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n public static void main(String[] args) {\n Scanner stdIn = new Scanner(System.in);\n int n = stdIn.nextInt();\n int[] a = new int[n];\n int count = 0;\n Outer:\n for (int i = 0; i < n; i++) {\n a[i] = stdIn.nextInt();\n if (a[i] < 2) continue;\n if (a[i] == 2) {\n count++;\n continue;\n }\n if (a[i] % 2 == 0) continue;\n for (int j = 3; j <= a[i] / j; j+= 2) {\n if (a[i] % j == 0) continue Outer;\n }\n count++;\n }\n System.out.println(count);\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner stdIn = new Scanner(System.in);\n int n = stdIn.nextInt();\n int[] a = new int[n];\n int count = 0;\n Outer:\n for (int i = 0; i < n; i++) {\n a[i] = stdIn.nextInt();\n if (a[i] < 2) continue;\n if (a[i] == 2) {\n count++;\n continue;\n }\n if (a[i] % 2 == 0) continue;\n for (int j = 3; j <= a[i] / j; j+= 2) {\n if (a[i] % j == 0) continue Outer;\n }\n count++;\n }\n System.out.println(count);\n }",
"main",
"{\n Scanner stdIn = new Scanner(System.in);\n int n = stdIn.nextInt();\n int[] a = new int[n];\n int count = 0;\n Outer:\n for (int i = 0; i < n; i++) {\n a[i] = stdIn.nextInt();\n if (a[i] < 2) continue;\n if (a[i] == 2) {\n count++;\n continue;\n }\n if (a[i] % 2 == 0) continue;\n for (int j = 3; j <= a[i] / j; j+= 2) {\n if (a[i] % j == 0) continue Outer;\n }\n count++;\n }\n System.out.println(count);\n }",
"Scanner stdIn = new Scanner(System.in);",
"stdIn",
"new Scanner(System.in)",
"int n = stdIn.nextInt();",
"n",
"stdIn.nextInt()",
"stdIn.nextInt",
"stdIn",
"int[] a = new int[n];",
"a",
"new int[n]",
"n",
"int count = 0;",
"count",
"0",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"public class Main {\n public static void main(String[] args) {\n Scanner stdIn = new Scanner(System.in);\n int n = stdIn.nextInt();\n int[] a = new int[n];\n int count = 0;\n Outer:\n for (int i = 0; i < n; i++) {\n a[i] = stdIn.nextInt();\n if (a[i] < 2) continue;\n if (a[i] == 2) {\n count++;\n continue;\n }\n if (a[i] % 2 == 0) continue;\n for (int j = 3; j <= a[i] / j; j+= 2) {\n if (a[i] % j == 0) continue Outer;\n }\n count++;\n }\n System.out.println(count);\n }\n}",
"public class Main {\n public static void main(String[] args) {\n Scanner stdIn = new Scanner(System.in);\n int n = stdIn.nextInt();\n int[] a = new int[n];\n int count = 0;\n Outer:\n for (int i = 0; i < n; i++) {\n a[i] = stdIn.nextInt();\n if (a[i] < 2) continue;\n if (a[i] == 2) {\n count++;\n continue;\n }\n if (a[i] % 2 == 0) continue;\n for (int j = 3; j <= a[i] / j; j+= 2) {\n if (a[i] % j == 0) continue Outer;\n }\n count++;\n }\n System.out.println(count);\n }\n}",
"Main"
] | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
int n = stdIn.nextInt();
int[] a = new int[n];
int count = 0;
Outer:
for (int i = 0; i < n; i++) {
a[i] = stdIn.nextInt();
if (a[i] < 2) continue;
if (a[i] == 2) {
count++;
continue;
}
if (a[i] % 2 == 0) continue;
for (int j = 3; j <= a[i] / j; j+= 2) {
if (a[i] % j == 0) continue Outer;
}
count++;
}
System.out.println(count);
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
14,
2,
2,
2,
13,
17,
17,
2,
13,
17,
30,
9,
14,
4,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
41,
13,
4,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
101,
5
],
[
101,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
20
],
[
20,
21
],
[
21,
22
],
[
22,
23
],
[
22,
24
],
[
20,
25
],
[
25,
26
],
[
25,
27
],
[
20,
28
],
[
28,
29
],
[
29,
30
],
[
20,
31
],
[
32,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
35,
36
],
[
36,
37
],
[
32,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
41,
42
],
[
41,
43
],
[
40,
44
],
[
39,
45
],
[
45,
46
],
[
45,
47
],
[
38,
48
],
[
48,
49
],
[
32,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
50,
54
],
[
54,
55
],
[
55,
56
],
[
8,
57
],
[
57,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
57,
62
],
[
6,
63
],
[
63,
64
],
[
101,
65
],
[
65,
66
],
[
65,
67
],
[
67,
68
],
[
68,
69
],
[
68,
70
],
[
70,
71
],
[
71,
72
],
[
70,
73
],
[
67,
74
],
[
74,
75
],
[
75,
76
],
[
76,
77
],
[
76,
78
],
[
74,
79
],
[
79,
80
],
[
79,
81
],
[
74,
82
],
[
82,
83
],
[
83,
84
],
[
74,
85
],
[
86,
86
],
[
86,
87
],
[
87,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
88,
92
],
[
87,
93
],
[
93,
94
],
[
94,
95
],
[
67,
96
],
[
96,
97
],
[
65,
98
],
[
98,
99
],
[
0,
100
],
[
100,
101
],
[
100,
102
]
] | [
"import java.util.Scanner;\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int count = 0;\n for(int i = 0; i < x; i++){\n int y = sc.nextInt();\n if(y%2 == 0 && y != 2){\n continue;\n }\n if(check(y)){\n count++;\n }\n }\n System.out.println(count);\n }\n public static boolean check(int y){\n int z = (int)Math.sqrt(y);\n for(int j = 2; j <= z; j++){\n if(y%j == 0){\n return false;\n }\n }\n return true;\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int count = 0;\n for(int i = 0; i < x; i++){\n int y = sc.nextInt();\n if(y%2 == 0 && y != 2){\n continue;\n }\n if(check(y)){\n count++;\n }\n }\n System.out.println(count);\n }\n public static boolean check(int y){\n int z = (int)Math.sqrt(y);\n for(int j = 2; j <= z; j++){\n if(y%j == 0){\n return false;\n }\n }\n return true;\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int count = 0;\n for(int i = 0; i < x; i++){\n int y = sc.nextInt();\n if(y%2 == 0 && y != 2){\n continue;\n }\n if(check(y)){\n count++;\n }\n }\n System.out.println(count);\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int count = 0;\n for(int i = 0; i < x; i++){\n int y = sc.nextInt();\n if(y%2 == 0 && y != 2){\n continue;\n }\n if(check(y)){\n count++;\n }\n }\n System.out.println(count);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int x = sc.nextInt();",
"x",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int count = 0;",
"count",
"0",
"for(int i = 0; i < x; i++){\n int y = sc.nextInt();\n if(y%2 == 0 && y != 2){\n continue;\n }\n if(check(y)){\n count++;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < x",
"i",
"x",
"i++",
"i++",
"i",
"{\n int y = sc.nextInt();\n if(y%2 == 0 && y != 2){\n continue;\n }\n if(check(y)){\n count++;\n }\n }",
"{\n int y = sc.nextInt();\n if(y%2 == 0 && y != 2){\n continue;\n }\n if(check(y)){\n count++;\n }\n }",
"int y = sc.nextInt();",
"y",
"sc.nextInt()",
"sc.nextInt",
"sc",
"if(y%2 == 0 && y != 2){\n continue;\n }",
"y%2 == 0 && y != 2",
"y%2 == 0",
"y%2",
"y",
"2",
"0",
"y != 2",
"y",
"2",
"{\n continue;\n }",
"continue;",
"if(check(y)){\n count++;\n }",
"check(y)",
"check",
"y",
"{\n count++;\n }",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"public static boolean check(int y){\n int z = (int)Math.sqrt(y);\n for(int j = 2; j <= z; j++){\n if(y%j == 0){\n return false;\n }\n }\n return true;\n }",
"check",
"{\n int z = (int)Math.sqrt(y);\n for(int j = 2; j <= z; j++){\n if(y%j == 0){\n return false;\n }\n }\n return true;\n }",
"int z = (int)Math.sqrt(y);",
"z",
"(int)Math.sqrt(y)",
"Math.sqrt",
"Math",
"y",
"for(int j = 2; j <= z; j++){\n if(y%j == 0){\n return false;\n }\n }",
"int j = 2;",
"int j = 2;",
"j",
"2",
"j <= z",
"j",
"z",
"j++",
"j++",
"j",
"{\n if(y%j == 0){\n return false;\n }\n }",
"{\n if(y%j == 0){\n return false;\n }\n }",
"if(y%j == 0){\n return false;\n }",
"y%j == 0",
"y%j",
"y",
"j",
"0",
"{\n return false;\n }",
"return false;",
"false",
"return true;",
"true",
"int y",
"y",
"public class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int count = 0;\n for(int i = 0; i < x; i++){\n int y = sc.nextInt();\n if(y%2 == 0 && y != 2){\n continue;\n }\n if(check(y)){\n count++;\n }\n }\n System.out.println(count);\n }\n public static boolean check(int y){\n int z = (int)Math.sqrt(y);\n for(int j = 2; j <= z; j++){\n if(y%j == 0){\n return false;\n }\n }\n return true;\n }\n}",
"public class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int count = 0;\n for(int i = 0; i < x; i++){\n int y = sc.nextInt();\n if(y%2 == 0 && y != 2){\n continue;\n }\n if(check(y)){\n count++;\n }\n }\n System.out.println(count);\n }\n public static boolean check(int y){\n int z = (int)Math.sqrt(y);\n for(int j = 2; j <= z; j++){\n if(y%j == 0){\n return false;\n }\n }\n return true;\n }\n}",
"Main"
] | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int x = sc.nextInt();
int count = 0;
for(int i = 0; i < x; i++){
int y = sc.nextInt();
if(y%2 == 0 && y != 2){
continue;
}
if(check(y)){
count++;
}
}
System.out.println(count);
}
public static boolean check(int y){
int z = (int)Math.sqrt(y);
for(int j = 2; j <= z; j++){
if(y%j == 0){
return false;
}
}
return true;
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
13,
41,
13,
17,
41,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
40,
13,
0,
13,
2,
18,
13,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
18,
13,
13,
17,
1,
40,
13,
30,
30,
14,
2,
2,
2,
18,
13,
13,
17,
17,
2,
18,
13,
13,
17,
30,
40,
13,
3,
14,
2,
2,
2,
18,
13,
13,
13,
17,
2,
18,
13,
13,
17,
30,
40,
13,
3,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
120,
5
],
[
120,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
21
],
[
21,
22
],
[
21,
23
],
[
8,
24
],
[
24,
25
],
[
8,
26
],
[
26,
27
],
[
27,
28
],
[
28,
29
],
[
28,
30
],
[
26,
31
],
[
31,
32
],
[
31,
33
],
[
26,
34
],
[
34,
35
],
[
35,
36
],
[
26,
37
],
[
38,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
39,
43
],
[
43,
44
],
[
44,
45
],
[
38,
46
],
[
46,
47
],
[
38,
48
],
[
48,
49
],
[
48,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
50,
54
],
[
38,
55
],
[
55,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
55,
60
],
[
60,
61
],
[
60,
62
],
[
62,
63
],
[
63,
64
],
[
64,
65
],
[
63,
66
],
[
66,
67
],
[
66,
68
],
[
62,
69
],
[
55,
70
],
[
70,
71
],
[
71,
72
],
[
55,
73
],
[
74,
74
],
[
74,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
78,
79
],
[
79,
80
],
[
79,
81
],
[
78,
82
],
[
77,
83
],
[
76,
84
],
[
84,
85
],
[
85,
86
],
[
85,
87
],
[
84,
88
],
[
75,
89
],
[
89,
90
],
[
90,
91
],
[
89,
92
],
[
74,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
97,
99
],
[
96,
100
],
[
95,
101
],
[
94,
102
],
[
102,
103
],
[
103,
104
],
[
103,
105
],
[
102,
106
],
[
93,
107
],
[
107,
108
],
[
108,
109
],
[
107,
110
],
[
8,
111
],
[
111,
112
],
[
112,
113
],
[
113,
114
],
[
113,
115
],
[
111,
116
],
[
6,
117
],
[
117,
118
],
[
0,
119
],
[
119,
120
],
[
119,
121
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner number = new Scanner(System.in);\n\t\tint a = number.nextInt();\n\t\tdouble[] b = new double[a];\n\t\tint c = 0;\n\t\tdouble d;\n\n\t\tfor(int i = 0;i < a;i++) {\n\t\t\tb[i] = number.nextInt();\n\t\t\tc++;\n\t\t\td = b[i] / 3;\n\t\t\tfor(double j = 2;j < Math.sqrt(b[i]) + 1;j++) {\n\t\t\t\tif(b[i] % 2 == 0 && b[i] > 2) {\n\t\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(b[i] % j == 0 && b[i] != 2) {\n\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tSystem.out.println(c);\n\t}\n}\n",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner number = new Scanner(System.in);\n\t\tint a = number.nextInt();\n\t\tdouble[] b = new double[a];\n\t\tint c = 0;\n\t\tdouble d;\n\n\t\tfor(int i = 0;i < a;i++) {\n\t\t\tb[i] = number.nextInt();\n\t\t\tc++;\n\t\t\td = b[i] / 3;\n\t\t\tfor(double j = 2;j < Math.sqrt(b[i]) + 1;j++) {\n\t\t\t\tif(b[i] % 2 == 0 && b[i] > 2) {\n\t\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(b[i] % j == 0 && b[i] != 2) {\n\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tSystem.out.println(c);\n\t}\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner number = new Scanner(System.in);\n\t\tint a = number.nextInt();\n\t\tdouble[] b = new double[a];\n\t\tint c = 0;\n\t\tdouble d;\n\n\t\tfor(int i = 0;i < a;i++) {\n\t\t\tb[i] = number.nextInt();\n\t\t\tc++;\n\t\t\td = b[i] / 3;\n\t\t\tfor(double j = 2;j < Math.sqrt(b[i]) + 1;j++) {\n\t\t\t\tif(b[i] % 2 == 0 && b[i] > 2) {\n\t\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(b[i] % j == 0 && b[i] != 2) {\n\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tSystem.out.println(c);\n\t}",
"main",
"{\n\t\tScanner number = new Scanner(System.in);\n\t\tint a = number.nextInt();\n\t\tdouble[] b = new double[a];\n\t\tint c = 0;\n\t\tdouble d;\n\n\t\tfor(int i = 0;i < a;i++) {\n\t\t\tb[i] = number.nextInt();\n\t\t\tc++;\n\t\t\td = b[i] / 3;\n\t\t\tfor(double j = 2;j < Math.sqrt(b[i]) + 1;j++) {\n\t\t\t\tif(b[i] % 2 == 0 && b[i] > 2) {\n\t\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(b[i] % j == 0 && b[i] != 2) {\n\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tSystem.out.println(c);\n\t}",
"Scanner number = new Scanner(System.in);",
"number",
"new Scanner(System.in)",
"int a = number.nextInt();",
"a",
"number.nextInt()",
"number.nextInt",
"number",
"double[] b = new double[a];",
"b",
"new double[a]",
"a",
"int c = 0;",
"c",
"0",
"double d;",
"d",
"for(int i = 0;i < a;i++) {\n\t\t\tb[i] = number.nextInt();\n\t\t\tc++;\n\t\t\td = b[i] / 3;\n\t\t\tfor(double j = 2;j < Math.sqrt(b[i]) + 1;j++) {\n\t\t\t\tif(b[i] % 2 == 0 && b[i] > 2) {\n\t\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(b[i] % j == 0 && b[i] != 2) {\n\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < a",
"i",
"a",
"i++",
"i++",
"i",
"{\n\t\t\tb[i] = number.nextInt();\n\t\t\tc++;\n\t\t\td = b[i] / 3;\n\t\t\tfor(double j = 2;j < Math.sqrt(b[i]) + 1;j++) {\n\t\t\t\tif(b[i] % 2 == 0 && b[i] > 2) {\n\t\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(b[i] % j == 0 && b[i] != 2) {\n\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t}",
"{\n\t\t\tb[i] = number.nextInt();\n\t\t\tc++;\n\t\t\td = b[i] / 3;\n\t\t\tfor(double j = 2;j < Math.sqrt(b[i]) + 1;j++) {\n\t\t\t\tif(b[i] % 2 == 0 && b[i] > 2) {\n\t\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(b[i] % j == 0 && b[i] != 2) {\n\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t}",
"b[i] = number.nextInt()",
"b[i]",
"b",
"i",
"number.nextInt()",
"number.nextInt",
"number",
"c++",
"c",
"d = b[i] / 3",
"d",
"b[i] / 3",
"b[i]",
"b",
"i",
"3",
"for(double j = 2;j < Math.sqrt(b[i]) + 1;j++) {\n\t\t\t\tif(b[i] % 2 == 0 && b[i] > 2) {\n\t\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(b[i] % j == 0 && b[i] != 2) {\n\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}",
"double j = 2;",
"double j = 2;",
"j",
"2",
"j < Math.sqrt(b[i]) + 1",
"j",
"Math.sqrt(b[i]) + 1",
"Math.sqrt(b[i])",
"Math.sqrt",
"Math",
"b[i]",
"b",
"i",
"1",
"j++",
"j++",
"j",
"{\n\t\t\t\tif(b[i] % 2 == 0 && b[i] > 2) {\n\t\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(b[i] % j == 0 && b[i] != 2) {\n\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}",
"{\n\t\t\t\tif(b[i] % 2 == 0 && b[i] > 2) {\n\t\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(b[i] % j == 0 && b[i] != 2) {\n\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}",
"if(b[i] % 2 == 0 && b[i] > 2) {\n\t\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"b[i] % 2 == 0 && b[i] > 2",
"b[i] % 2 == 0",
"b[i] % 2",
"b[i]",
"b",
"i",
"2",
"0",
"b[i] > 2",
"b[i]",
"b",
"i",
"2",
"{\n\t\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"c--",
"c",
"break;",
"if(b[i] % j == 0 && b[i] != 2) {\n\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"b[i] % j == 0 && b[i] != 2",
"b[i] % j == 0",
"b[i] % j",
"b[i]",
"b",
"i",
"j",
"0",
"b[i] != 2",
"b[i]",
"b",
"i",
"2",
"{\n\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"c--",
"c",
"break;",
"System.out.println(c)",
"System.out.println",
"System.out",
"System",
"System.out",
"c",
"String[] args",
"args",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner number = new Scanner(System.in);\n\t\tint a = number.nextInt();\n\t\tdouble[] b = new double[a];\n\t\tint c = 0;\n\t\tdouble d;\n\n\t\tfor(int i = 0;i < a;i++) {\n\t\t\tb[i] = number.nextInt();\n\t\t\tc++;\n\t\t\td = b[i] / 3;\n\t\t\tfor(double j = 2;j < Math.sqrt(b[i]) + 1;j++) {\n\t\t\t\tif(b[i] % 2 == 0 && b[i] > 2) {\n\t\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(b[i] % j == 0 && b[i] != 2) {\n\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tSystem.out.println(c);\n\t}\n}",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner number = new Scanner(System.in);\n\t\tint a = number.nextInt();\n\t\tdouble[] b = new double[a];\n\t\tint c = 0;\n\t\tdouble d;\n\n\t\tfor(int i = 0;i < a;i++) {\n\t\t\tb[i] = number.nextInt();\n\t\t\tc++;\n\t\t\td = b[i] / 3;\n\t\t\tfor(double j = 2;j < Math.sqrt(b[i]) + 1;j++) {\n\t\t\t\tif(b[i] % 2 == 0 && b[i] > 2) {\n\t\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(b[i] % j == 0 && b[i] != 2) {\n\t\t\t\t\n\t\t\t\t\tc--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tSystem.out.println(c);\n\t}\n}",
"Main"
] | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner number = new Scanner(System.in);
int a = number.nextInt();
double[] b = new double[a];
int c = 0;
double d;
for(int i = 0;i < a;i++) {
b[i] = number.nextInt();
c++;
d = b[i] / 3;
for(double j = 2;j < Math.sqrt(b[i]) + 1;j++) {
if(b[i] % 2 == 0 && b[i] > 2) {
c--;
break;
}
if(b[i] % j == 0 && b[i] != 2) {
c--;
break;
}
}
}
System.out.println(c);
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
17,
12,
13,
30,
41,
13,
20,
41,
13,
20,
4,
13,
13,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
4,
18,
13,
14,
4,
13,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
30,
11,
1,
41,
13,
17,
2,
2,
4,
18,
13,
13,
4,
18,
13,
13,
13,
1,
40,
13,
30,
30,
14,
2,
17,
2,
13,
4,
18,
13,
13,
30,
29,
17,
29,
17,
30,
11,
1,
41,
13,
17,
2,
2,
4,
18,
13,
13,
4,
18,
13,
13,
17,
1,
40,
13,
30,
30,
14,
2,
17,
2,
13,
4,
18,
13,
13,
30,
29,
17,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
17,
23,
13,
23,
13,
12,
13,
30,
41,
13,
17,
4,
18,
13,
17,
4,
18,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
0,
13,
17,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
2,
4,
18,
13,
13,
4,
18,
13,
13,
13,
1,
40,
13,
30,
30,
14,
2,
17,
2,
13,
4,
18,
13,
13,
30,
0,
13,
17,
3,
14,
40,
13,
30,
4,
18,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
263,
14
],
[
263,
15
],
[
15,
16
],
[
15,
17
],
[
263,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
21,
23
],
[
20,
24
],
[
24,
25
],
[
24,
26
],
[
20,
27
],
[
27,
28
],
[
27,
29
],
[
20,
30
],
[
30,
31
],
[
30,
32
],
[
32,
33
],
[
33,
34
],
[
32,
35
],
[
35,
36
],
[
36,
37
],
[
20,
38
],
[
38,
39
],
[
38,
40
],
[
20,
41
],
[
41,
42
],
[
42,
43
],
[
43,
44
],
[
43,
45
],
[
41,
46
],
[
46,
47
],
[
46,
48
],
[
41,
49
],
[
49,
50
],
[
50,
51
],
[
41,
52
],
[
53,
53
],
[
53,
54
],
[
54,
55
],
[
54,
56
],
[
56,
57
],
[
57,
58
],
[
56,
59
],
[
59,
60
],
[
60,
61
],
[
53,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
63,
66
],
[
62,
67
],
[
67,
68
],
[
68,
69
],
[
20,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
70,
75
],
[
18,
76
],
[
76,
77
],
[
263,
78
],
[
78,
79
],
[
78,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
82,
84
],
[
81,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
88,
89
],
[
88,
90
],
[
86,
91
],
[
91,
92
],
[
92,
93
],
[
93,
94
],
[
94,
95
],
[
93,
96
],
[
92,
97
],
[
97,
98
],
[
98,
99
],
[
97,
100
],
[
91,
101
],
[
86,
102
],
[
102,
103
],
[
103,
104
],
[
86,
105
],
[
106,
106
],
[
106,
107
],
[
107,
108
],
[
108,
109
],
[
108,
110
],
[
110,
111
],
[
110,
112
],
[
112,
113
],
[
113,
114
],
[
112,
115
],
[
107,
116
],
[
116,
117
],
[
117,
118
],
[
85,
119
],
[
119,
120
],
[
81,
121
],
[
121,
122
],
[
122,
123
],
[
123,
124
],
[
124,
125
],
[
124,
126
],
[
122,
127
],
[
127,
128
],
[
128,
129
],
[
129,
130
],
[
130,
131
],
[
129,
132
],
[
128,
133
],
[
133,
134
],
[
134,
135
],
[
133,
136
],
[
127,
137
],
[
122,
138
],
[
138,
139
],
[
139,
140
],
[
122,
141
],
[
142,
142
],
[
142,
143
],
[
143,
144
],
[
144,
145
],
[
144,
146
],
[
146,
147
],
[
146,
148
],
[
148,
149
],
[
149,
150
],
[
148,
151
],
[
143,
152
],
[
152,
153
],
[
153,
154
],
[
121,
155
],
[
155,
156
],
[
156,
157
],
[
157,
158
],
[
157,
159
],
[
155,
160
],
[
160,
161
],
[
161,
162
],
[
161,
163
],
[
160,
164
],
[
155,
165
],
[
165,
166
],
[
166,
167
],
[
166,
168
],
[
155,
169
],
[
170,
170
],
[
170,
171
],
[
171,
172
],
[
172,
173
],
[
173,
174
],
[
173,
175
],
[
172,
176
],
[
171,
177
],
[
177,
178
],
[
178,
179
],
[
121,
180
],
[
180,
181
],
[
78,
182
],
[
182,
183
],
[
78,
184
],
[
184,
185
],
[
263,
186
],
[
186,
187
],
[
186,
188
],
[
188,
189
],
[
189,
190
],
[
189,
191
],
[
188,
192
],
[
192,
193
],
[
193,
194
],
[
192,
195
],
[
188,
196
],
[
196,
197
],
[
197,
198
],
[
196,
199
],
[
188,
200
],
[
200,
201
],
[
201,
202
],
[
202,
203
],
[
202,
204
],
[
200,
205
],
[
205,
206
],
[
205,
207
],
[
200,
208
],
[
208,
209
],
[
209,
210
],
[
209,
211
],
[
200,
212
],
[
213,
213
],
[
213,
214
],
[
214,
215
],
[
214,
216
],
[
213,
217
],
[
217,
218
],
[
218,
219
],
[
219,
220
],
[
219,
221
],
[
217,
222
],
[
222,
223
],
[
223,
224
],
[
224,
225
],
[
225,
226
],
[
224,
227
],
[
223,
228
],
[
228,
229
],
[
229,
230
],
[
228,
231
],
[
222,
232
],
[
217,
233
],
[
233,
234
],
[
234,
235
],
[
217,
236
],
[
237,
237
],
[
237,
238
],
[
238,
239
],
[
239,
240
],
[
239,
241
],
[
241,
242
],
[
241,
243
],
[
243,
244
],
[
244,
245
],
[
243,
246
],
[
238,
247
],
[
247,
248
],
[
248,
249
],
[
248,
250
],
[
247,
251
],
[
213,
252
],
[
252,
253
],
[
253,
254
],
[
252,
255
],
[
255,
256
],
[
256,
257
],
[
257,
258
],
[
256,
259
],
[
186,
260
],
[
260,
261
],
[
0,
262
],
[
262,
263
],
[
262,
264
]
] | [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\n\npublic class Main {\n private static final int SIZE = 10000000;\n\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n ArrayList<Integer> primeList = new ArrayList<Integer>(SIZE);\n createPrime(primeList);\n int n = Integer.parseInt(br.readLine());\n int count = 0;\n for (int i = 0; i < n; i++) {\n int p = Integer.parseInt(br.readLine());\n if (prime(p, primeList)) {\n count++;\n }\n }\n System.out.println(count);\n }\n\n static boolean prime(int n, ArrayList<Integer> primeList) {\n if (n <= 1000000) {\n for (int i = 0; primeList.get(i) * primeList.get(i) <= n; i++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }\n return true;\n } else {\n for (int i = 0; primeList.get(i) * primeList.get(i) <= 1000000; i++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }\n for (int i = 3; i * i <= n; i += 2) {\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n }\n }\n\n public static void createPrime(ArrayList<Integer> primeList) {\n int n = 1000000;\n primeList.add(2);\n primeList.add(3);\n for (int i = 5; i <= n; i += 2) { //????±?????\\???°??????\n boolean wflag = false; //???????????????????????????\n for (int j = 1; primeList.get(j) * primeList.get(j) <= i; j++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == i % primeList.get(j)) { //???????????????????´???°??§?????????\n wflag = true;\n break;\n }\n }\n if (!wflag) { //???????????§????????????????????£??????\n primeList.add(i); //?´???°??¨????????°????????????\n }\n }\n }\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.util.ArrayList;",
"ArrayList",
"java.util",
"public class Main {\n private static final int SIZE = 10000000;\n\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n ArrayList<Integer> primeList = new ArrayList<Integer>(SIZE);\n createPrime(primeList);\n int n = Integer.parseInt(br.readLine());\n int count = 0;\n for (int i = 0; i < n; i++) {\n int p = Integer.parseInt(br.readLine());\n if (prime(p, primeList)) {\n count++;\n }\n }\n System.out.println(count);\n }\n\n static boolean prime(int n, ArrayList<Integer> primeList) {\n if (n <= 1000000) {\n for (int i = 0; primeList.get(i) * primeList.get(i) <= n; i++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }\n return true;\n } else {\n for (int i = 0; primeList.get(i) * primeList.get(i) <= 1000000; i++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }\n for (int i = 3; i * i <= n; i += 2) {\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n }\n }\n\n public static void createPrime(ArrayList<Integer> primeList) {\n int n = 1000000;\n primeList.add(2);\n primeList.add(3);\n for (int i = 5; i <= n; i += 2) { //????±?????\\???°??????\n boolean wflag = false; //???????????????????????????\n for (int j = 1; primeList.get(j) * primeList.get(j) <= i; j++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == i % primeList.get(j)) { //???????????????????´???°??§?????????\n wflag = true;\n break;\n }\n }\n if (!wflag) { //???????????§????????????????????£??????\n primeList.add(i); //?´???°??¨????????°????????????\n }\n }\n }\n}",
"Main",
"private static final int SIZE = 10000000;",
"SIZE",
"10000000",
"public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n ArrayList<Integer> primeList = new ArrayList<Integer>(SIZE);\n createPrime(primeList);\n int n = Integer.parseInt(br.readLine());\n int count = 0;\n for (int i = 0; i < n; i++) {\n int p = Integer.parseInt(br.readLine());\n if (prime(p, primeList)) {\n count++;\n }\n }\n System.out.println(count);\n }",
"main",
"{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n ArrayList<Integer> primeList = new ArrayList<Integer>(SIZE);\n createPrime(primeList);\n int n = Integer.parseInt(br.readLine());\n int count = 0;\n for (int i = 0; i < n; i++) {\n int p = Integer.parseInt(br.readLine());\n if (prime(p, primeList)) {\n count++;\n }\n }\n System.out.println(count);\n }",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"ArrayList<Integer> primeList = new ArrayList<Integer>(SIZE);",
"primeList",
"new ArrayList<Integer>(SIZE)",
"createPrime(primeList)",
"createPrime",
"primeList",
"int n = Integer.parseInt(br.readLine());",
"n",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"int count = 0;",
"count",
"0",
"for (int i = 0; i < n; i++) {\n int p = Integer.parseInt(br.readLine());\n if (prime(p, primeList)) {\n count++;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n int p = Integer.parseInt(br.readLine());\n if (prime(p, primeList)) {\n count++;\n }\n }",
"{\n int p = Integer.parseInt(br.readLine());\n if (prime(p, primeList)) {\n count++;\n }\n }",
"int p = Integer.parseInt(br.readLine());",
"p",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"if (prime(p, primeList)) {\n count++;\n }",
"prime(p, primeList)",
"prime",
"p",
"primeList",
"{\n count++;\n }",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"static boolean prime(int n, ArrayList<Integer> primeList) {\n if (n <= 1000000) {\n for (int i = 0; primeList.get(i) * primeList.get(i) <= n; i++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }\n return true;\n } else {\n for (int i = 0; primeList.get(i) * primeList.get(i) <= 1000000; i++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }\n for (int i = 3; i * i <= n; i += 2) {\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n }\n }",
"prime",
"{\n if (n <= 1000000) {\n for (int i = 0; primeList.get(i) * primeList.get(i) <= n; i++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }\n return true;\n } else {\n for (int i = 0; primeList.get(i) * primeList.get(i) <= 1000000; i++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }\n for (int i = 3; i * i <= n; i += 2) {\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n }\n }",
"if (n <= 1000000) {\n for (int i = 0; primeList.get(i) * primeList.get(i) <= n; i++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }\n return true;\n } else {\n for (int i = 0; primeList.get(i) * primeList.get(i) <= 1000000; i++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }\n for (int i = 3; i * i <= n; i += 2) {\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n }",
"n <= 1000000",
"n",
"1000000",
"{\n for (int i = 0; primeList.get(i) * primeList.get(i) <= n; i++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }\n return true;\n }",
"for (int i = 0; primeList.get(i) * primeList.get(i) <= n; i++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"primeList.get(i) * primeList.get(i) <= n",
"primeList.get(i) * primeList.get(i)",
"primeList.get(i)",
"primeList.get",
"primeList",
"i",
"primeList.get(i)",
"primeList.get",
"primeList",
"i",
"n",
"i++",
"i++",
"i",
"{\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }",
"{\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }",
"if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }",
"0 == n % primeList.get(i)",
"0",
"n % primeList.get(i)",
"n",
"primeList.get(i)",
"primeList.get",
"primeList",
"i",
"{ //???????????????????´???°??§?????????\n return false;\n }",
"return false;",
"false",
"return true;",
"true",
"{\n for (int i = 0; primeList.get(i) * primeList.get(i) <= 1000000; i++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }\n for (int i = 3; i * i <= n; i += 2) {\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n }",
"for (int i = 0; primeList.get(i) * primeList.get(i) <= 1000000; i++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"primeList.get(i) * primeList.get(i) <= 1000000",
"primeList.get(i) * primeList.get(i)",
"primeList.get(i)",
"primeList.get",
"primeList",
"i",
"primeList.get(i)",
"primeList.get",
"primeList",
"i",
"1000000",
"i++",
"i++",
"i",
"{\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }",
"{\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }",
"if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }",
"0 == n % primeList.get(i)",
"0",
"n % primeList.get(i)",
"n",
"primeList.get(i)",
"primeList.get",
"primeList",
"i",
"{ //???????????????????´???°??§?????????\n return false;\n }",
"return false;",
"false",
"for (int i = 3; i * i <= n; i += 2) {\n if (n % i == 0) {\n return false;\n }\n }",
"int i = 3;",
"int i = 3;",
"i",
"3",
"i * i <= n",
"i * i",
"i",
"i",
"n",
"i += 2",
"i += 2",
"i",
"2",
"{\n if (n % i == 0) {\n return false;\n }\n }",
"{\n if (n % i == 0) {\n return false;\n }\n }",
"if (n % i == 0) {\n return false;\n }",
"n % i == 0",
"n % i",
"n",
"i",
"0",
"{\n return false;\n }",
"return false;",
"false",
"return true;",
"true",
"int n",
"n",
"ArrayList<Integer> primeList",
"primeList",
"public static void createPrime(ArrayList<Integer> primeList) {\n int n = 1000000;\n primeList.add(2);\n primeList.add(3);\n for (int i = 5; i <= n; i += 2) { //????±?????\\???°??????\n boolean wflag = false; //???????????????????????????\n for (int j = 1; primeList.get(j) * primeList.get(j) <= i; j++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == i % primeList.get(j)) { //???????????????????´???°??§?????????\n wflag = true;\n break;\n }\n }\n if (!wflag) { //???????????§????????????????????£??????\n primeList.add(i); //?´???°??¨????????°????????????\n }\n }\n }",
"createPrime",
"{\n int n = 1000000;\n primeList.add(2);\n primeList.add(3);\n for (int i = 5; i <= n; i += 2) { //????±?????\\???°??????\n boolean wflag = false; //???????????????????????????\n for (int j = 1; primeList.get(j) * primeList.get(j) <= i; j++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == i % primeList.get(j)) { //???????????????????´???°??§?????????\n wflag = true;\n break;\n }\n }\n if (!wflag) { //???????????§????????????????????£??????\n primeList.add(i); //?´???°??¨????????°????????????\n }\n }\n }",
"int n = 1000000;",
"n",
"1000000",
"primeList.add(2)",
"primeList.add",
"primeList",
"2",
"primeList.add(3)",
"primeList.add",
"primeList",
"3",
"for (int i = 5; i <= n; i += 2) { //????±?????\\???°??????\n boolean wflag = false; //???????????????????????????\n for (int j = 1; primeList.get(j) * primeList.get(j) <= i; j++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == i % primeList.get(j)) { //???????????????????´???°??§?????????\n wflag = true;\n break;\n }\n }\n if (!wflag) { //???????????§????????????????????£??????\n primeList.add(i); //?´???°??¨????????°????????????\n }\n }",
"int i = 5;",
"int i = 5;",
"i",
"5",
"i <= n",
"i",
"n",
"i += 2",
"i += 2",
"i",
"2",
"{ //????±?????\\???°??????\n boolean wflag = false; //???????????????????????????\n for (int j = 1; primeList.get(j) * primeList.get(j) <= i; j++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == i % primeList.get(j)) { //???????????????????´???°??§?????????\n wflag = true;\n break;\n }\n }\n if (!wflag) { //???????????§????????????????????£??????\n primeList.add(i); //?´???°??¨????????°????????????\n }\n }",
"{ //????±?????\\???°??????\n boolean wflag = false; //???????????????????????????\n for (int j = 1; primeList.get(j) * primeList.get(j) <= i; j++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == i % primeList.get(j)) { //???????????????????´???°??§?????????\n wflag = true;\n break;\n }\n }\n if (!wflag) { //???????????§????????????????????£??????\n primeList.add(i); //?´???°??¨????????°????????????\n }\n }",
"boolean wflag = false;",
"wflag",
"false",
"for (int j = 1; primeList.get(j) * primeList.get(j) <= i; j++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == i % primeList.get(j)) { //???????????????????´???°??§?????????\n wflag = true;\n break;\n }\n }",
"int j = 1;",
"int j = 1;",
"j",
"1",
"primeList.get(j) * primeList.get(j) <= i",
"primeList.get(j) * primeList.get(j)",
"primeList.get(j)",
"primeList.get",
"primeList",
"j",
"primeList.get(j)",
"primeList.get",
"primeList",
"j",
"i",
"j++",
"j++",
"j",
"{\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == i % primeList.get(j)) { //???????????????????´???°??§?????????\n wflag = true;\n break;\n }\n }",
"{\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == i % primeList.get(j)) { //???????????????????´???°??§?????????\n wflag = true;\n break;\n }\n }",
"if (0 == i % primeList.get(j)) { //???????????????????´???°??§?????????\n wflag = true;\n break;\n }",
"0 == i % primeList.get(j)",
"0",
"i % primeList.get(j)",
"i",
"primeList.get(j)",
"primeList.get",
"primeList",
"j",
"{ //???????????????????´???°??§?????????\n wflag = true;\n break;\n }",
"wflag = true",
"wflag",
"true",
"break;",
"if (!wflag) { //???????????§????????????????????£??????\n primeList.add(i); //?´???°??¨????????°????????????\n }",
"!wflag",
"wflag",
"{ //???????????§????????????????????£??????\n primeList.add(i); //?´???°??¨????????°????????????\n }",
"primeList.add(i)",
"primeList.add",
"primeList",
"i",
"ArrayList<Integer> primeList",
"primeList",
"public class Main {\n private static final int SIZE = 10000000;\n\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n ArrayList<Integer> primeList = new ArrayList<Integer>(SIZE);\n createPrime(primeList);\n int n = Integer.parseInt(br.readLine());\n int count = 0;\n for (int i = 0; i < n; i++) {\n int p = Integer.parseInt(br.readLine());\n if (prime(p, primeList)) {\n count++;\n }\n }\n System.out.println(count);\n }\n\n static boolean prime(int n, ArrayList<Integer> primeList) {\n if (n <= 1000000) {\n for (int i = 0; primeList.get(i) * primeList.get(i) <= n; i++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }\n return true;\n } else {\n for (int i = 0; primeList.get(i) * primeList.get(i) <= 1000000; i++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }\n for (int i = 3; i * i <= n; i += 2) {\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n }\n }\n\n public static void createPrime(ArrayList<Integer> primeList) {\n int n = 1000000;\n primeList.add(2);\n primeList.add(3);\n for (int i = 5; i <= n; i += 2) { //????±?????\\???°??????\n boolean wflag = false; //???????????????????????????\n for (int j = 1; primeList.get(j) * primeList.get(j) <= i; j++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == i % primeList.get(j)) { //???????????????????´???°??§?????????\n wflag = true;\n break;\n }\n }\n if (!wflag) { //???????????§????????????????????£??????\n primeList.add(i); //?´???°??¨????????°????????????\n }\n }\n }\n}",
"public class Main {\n private static final int SIZE = 10000000;\n\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n ArrayList<Integer> primeList = new ArrayList<Integer>(SIZE);\n createPrime(primeList);\n int n = Integer.parseInt(br.readLine());\n int count = 0;\n for (int i = 0; i < n; i++) {\n int p = Integer.parseInt(br.readLine());\n if (prime(p, primeList)) {\n count++;\n }\n }\n System.out.println(count);\n }\n\n static boolean prime(int n, ArrayList<Integer> primeList) {\n if (n <= 1000000) {\n for (int i = 0; primeList.get(i) * primeList.get(i) <= n; i++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }\n return true;\n } else {\n for (int i = 0; primeList.get(i) * primeList.get(i) <= 1000000; i++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????\n return false;\n }\n }\n for (int i = 3; i * i <= n; i += 2) {\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n }\n }\n\n public static void createPrime(ArrayList<Integer> primeList) {\n int n = 1000000;\n primeList.add(2);\n primeList.add(3);\n for (int i = 5; i <= n; i += 2) { //????±?????\\???°??????\n boolean wflag = false; //???????????????????????????\n for (int j = 1; primeList.get(j) * primeList.get(j) <= i; j++) {\n // ????±??????°??????????????\\????????¨???????´???°??§????????????\n if (0 == i % primeList.get(j)) { //???????????????????´???°??§?????????\n wflag = true;\n break;\n }\n }\n if (!wflag) { //???????????§????????????????????£??????\n primeList.add(i); //?´???°??¨????????°????????????\n }\n }\n }\n}",
"Main"
] | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
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));
ArrayList<Integer> primeList = new ArrayList<Integer>(SIZE);
createPrime(primeList);
int n = Integer.parseInt(br.readLine());
int count = 0;
for (int i = 0; i < n; i++) {
int p = Integer.parseInt(br.readLine());
if (prime(p, primeList)) {
count++;
}
}
System.out.println(count);
}
static boolean prime(int n, ArrayList<Integer> primeList) {
if (n <= 1000000) {
for (int i = 0; primeList.get(i) * primeList.get(i) <= n; i++) {
// ????±??????°??????????????\????????¨???????´???°??§????????????
if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????
return false;
}
}
return true;
} else {
for (int i = 0; primeList.get(i) * primeList.get(i) <= 1000000; i++) {
// ????±??????°??????????????\????????¨???????´???°??§????????????
if (0 == n % primeList.get(i)) { //???????????????????´???°??§?????????
return false;
}
}
for (int i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
return false;
}
}
return true;
}
}
public static void createPrime(ArrayList<Integer> primeList) {
int n = 1000000;
primeList.add(2);
primeList.add(3);
for (int i = 5; i <= n; i += 2) { //????±?????\???°??????
boolean wflag = false; //???????????????????????????
for (int j = 1; primeList.get(j) * primeList.get(j) <= i; j++) {
// ????±??????°??????????????\????????¨???????´???°??§????????????
if (0 == i % primeList.get(j)) { //???????????????????´???°??§?????????
wflag = true;
break;
}
}
if (!wflag) { //???????????§????????????????????£??????
primeList.add(i); //?´???°??¨????????°????????????
}
}
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
38,
5,
13,
30,
4,
18,
18,
13,
13,
13,
30,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
41,
13,
13,
41,
13,
41,
13,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
4,
18,
13,
4,
18,
13,
14,
2,
17,
13,
30,
9,
14,
2,
17,
2,
13,
17,
30,
40,
13,
9,
11,
1,
0,
13,
17,
2,
2,
13,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
17,
2,
13,
13,
30,
40,
13,
3,
4,
18,
18,
13,
13,
13,
4,
18,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
13,
14
],
[
13,
15
],
[
15,
16
],
[
16,
17
],
[
17,
18
],
[
18,
19
],
[
18,
20
],
[
16,
21
],
[
12,
22
],
[
22,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
26,
27
],
[
25,
28
],
[
28,
29
],
[
29,
30
],
[
22,
31
],
[
31,
32
],
[
22,
33
],
[
33,
34
],
[
33,
35
],
[
22,
36
],
[
36,
37
],
[
22,
38
],
[
38,
39
],
[
22,
40
],
[
40,
41
],
[
41,
42
],
[
42,
43
],
[
42,
44
],
[
40,
45
],
[
45,
46
],
[
45,
47
],
[
40,
48
],
[
48,
49
],
[
49,
50
],
[
40,
51
],
[
52,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
55,
56
],
[
56,
57
],
[
55,
58
],
[
58,
59
],
[
59,
60
],
[
52,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
61,
65
],
[
65,
66
],
[
52,
67
],
[
67,
68
],
[
68,
69
],
[
68,
70
],
[
70,
71
],
[
70,
72
],
[
67,
73
],
[
73,
74
],
[
74,
75
],
[
73,
76
],
[
52,
77
],
[
77,
78
],
[
78,
79
],
[
79,
80
],
[
79,
81
],
[
77,
82
],
[
82,
83
],
[
83,
84
],
[
83,
85
],
[
82,
86
],
[
77,
87
],
[
87,
88
],
[
88,
89
],
[
88,
90
],
[
77,
91
],
[
92,
92
],
[
92,
93
],
[
93,
94
],
[
94,
95
],
[
94,
96
],
[
96,
97
],
[
96,
98
],
[
93,
99
],
[
99,
100
],
[
100,
101
],
[
99,
102
],
[
22,
103
],
[
103,
104
],
[
104,
105
],
[
105,
106
],
[
105,
107
],
[
103,
108
],
[
22,
109
],
[
109,
110
],
[
110,
111
],
[
6,
112
],
[
112,
113
]
] | [
"import java.io.*;\n \nclass Main {\n public static void main(String[] args) {\n BufferedReader kb = new BufferedReader( new InputStreamReader( System.in ) );\n try {\n int n = Integer.parseInt( kb.readLine() );\n \n int num;\n\t\t\tint cnt = n;\n int i, j;\n for( i=0; i<n; i++ ) {\n num = Integer.parseInt( kb.readLine() );\n\t\t\t\tif( 2 == num ) { continue; }\n\t\t\t\tif( 0 == num%2 ) {\n\t\t\t\t\tcnt--;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n for( j=3; j*j<=num; j+=2 ) {\n if( 0 == num%j ) {\n cnt--;\n\t\t\t\t\t\tbreak;\n }\n }\n }\n \n System.out.println( cnt );\n \n kb.close();\n } catch( IOException e ) {\n System.err.println( e );\n }\n }\n}",
"import java.io.*;",
"io.*",
"java",
"class Main {\n public static void main(String[] args) {\n BufferedReader kb = new BufferedReader( new InputStreamReader( System.in ) );\n try {\n int n = Integer.parseInt( kb.readLine() );\n \n int num;\n\t\t\tint cnt = n;\n int i, j;\n for( i=0; i<n; i++ ) {\n num = Integer.parseInt( kb.readLine() );\n\t\t\t\tif( 2 == num ) { continue; }\n\t\t\t\tif( 0 == num%2 ) {\n\t\t\t\t\tcnt--;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n for( j=3; j*j<=num; j+=2 ) {\n if( 0 == num%j ) {\n cnt--;\n\t\t\t\t\t\tbreak;\n }\n }\n }\n \n System.out.println( cnt );\n \n kb.close();\n } catch( IOException e ) {\n System.err.println( e );\n }\n }\n}",
"Main",
"public static void main(String[] args) {\n BufferedReader kb = new BufferedReader( new InputStreamReader( System.in ) );\n try {\n int n = Integer.parseInt( kb.readLine() );\n \n int num;\n\t\t\tint cnt = n;\n int i, j;\n for( i=0; i<n; i++ ) {\n num = Integer.parseInt( kb.readLine() );\n\t\t\t\tif( 2 == num ) { continue; }\n\t\t\t\tif( 0 == num%2 ) {\n\t\t\t\t\tcnt--;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n for( j=3; j*j<=num; j+=2 ) {\n if( 0 == num%j ) {\n cnt--;\n\t\t\t\t\t\tbreak;\n }\n }\n }\n \n System.out.println( cnt );\n \n kb.close();\n } catch( IOException e ) {\n System.err.println( e );\n }\n }",
"main",
"{\n BufferedReader kb = new BufferedReader( new InputStreamReader( System.in ) );\n try {\n int n = Integer.parseInt( kb.readLine() );\n \n int num;\n\t\t\tint cnt = n;\n int i, j;\n for( i=0; i<n; i++ ) {\n num = Integer.parseInt( kb.readLine() );\n\t\t\t\tif( 2 == num ) { continue; }\n\t\t\t\tif( 0 == num%2 ) {\n\t\t\t\t\tcnt--;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n for( j=3; j*j<=num; j+=2 ) {\n if( 0 == num%j ) {\n cnt--;\n\t\t\t\t\t\tbreak;\n }\n }\n }\n \n System.out.println( cnt );\n \n kb.close();\n } catch( IOException e ) {\n System.err.println( e );\n }\n }",
"BufferedReader kb = new BufferedReader( new InputStreamReader( System.in ) );",
"kb",
"new BufferedReader( new InputStreamReader( System.in ) )",
"try {\n int n = Integer.parseInt( kb.readLine() );\n \n int num;\n\t\t\tint cnt = n;\n int i, j;\n for( i=0; i<n; i++ ) {\n num = Integer.parseInt( kb.readLine() );\n\t\t\t\tif( 2 == num ) { continue; }\n\t\t\t\tif( 0 == num%2 ) {\n\t\t\t\t\tcnt--;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n for( j=3; j*j<=num; j+=2 ) {\n if( 0 == num%j ) {\n cnt--;\n\t\t\t\t\t\tbreak;\n }\n }\n }\n \n System.out.println( cnt );\n \n kb.close();\n } catch( IOException e ) {\n System.err.println( e );\n }",
"catch( IOException e ) {\n System.err.println( e );\n }",
"IOException e",
"{\n System.err.println( e );\n }",
"System.err.println( e )",
"System.err.println",
"System.err",
"System",
"System.err",
"e",
"{\n int n = Integer.parseInt( kb.readLine() );\n \n int num;\n\t\t\tint cnt = n;\n int i, j;\n for( i=0; i<n; i++ ) {\n num = Integer.parseInt( kb.readLine() );\n\t\t\t\tif( 2 == num ) { continue; }\n\t\t\t\tif( 0 == num%2 ) {\n\t\t\t\t\tcnt--;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n for( j=3; j*j<=num; j+=2 ) {\n if( 0 == num%j ) {\n cnt--;\n\t\t\t\t\t\tbreak;\n }\n }\n }\n \n System.out.println( cnt );\n \n kb.close();\n }",
"int n = Integer.parseInt( kb.readLine() );",
"n",
"Integer.parseInt( kb.readLine() )",
"Integer.parseInt",
"Integer",
"kb.readLine()",
"kb.readLine",
"kb",
"int num;",
"num",
"int cnt = n;",
"cnt",
"n",
"int i",
"i",
"j;",
"j",
"for( i=0; i<n; i++ ) {\n num = Integer.parseInt( kb.readLine() );\n\t\t\t\tif( 2 == num ) { continue; }\n\t\t\t\tif( 0 == num%2 ) {\n\t\t\t\t\tcnt--;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n for( j=3; j*j<=num; j+=2 ) {\n if( 0 == num%j ) {\n cnt--;\n\t\t\t\t\t\tbreak;\n }\n }\n }",
"i=0;",
"i=0",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n num = Integer.parseInt( kb.readLine() );\n\t\t\t\tif( 2 == num ) { continue; }\n\t\t\t\tif( 0 == num%2 ) {\n\t\t\t\t\tcnt--;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n for( j=3; j*j<=num; j+=2 ) {\n if( 0 == num%j ) {\n cnt--;\n\t\t\t\t\t\tbreak;\n }\n }\n }",
"{\n num = Integer.parseInt( kb.readLine() );\n\t\t\t\tif( 2 == num ) { continue; }\n\t\t\t\tif( 0 == num%2 ) {\n\t\t\t\t\tcnt--;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n for( j=3; j*j<=num; j+=2 ) {\n if( 0 == num%j ) {\n cnt--;\n\t\t\t\t\t\tbreak;\n }\n }\n }",
"num = Integer.parseInt( kb.readLine() )",
"num",
"Integer.parseInt( kb.readLine() )",
"Integer.parseInt",
"Integer",
"kb.readLine()",
"kb.readLine",
"kb",
"if( 2 == num ) { continue; }",
"2 == num",
"2",
"num",
"{ continue; }",
"continue;",
"if( 0 == num%2 ) {\n\t\t\t\t\tcnt--;\n\t\t\t\t\tcontinue;\n\t\t\t\t}",
"0 == num%2",
"0",
"num%2",
"num",
"2",
"{\n\t\t\t\t\tcnt--;\n\t\t\t\t\tcontinue;\n\t\t\t\t}",
"cnt--",
"cnt",
"continue;",
"for( j=3; j*j<=num; j+=2 ) {\n if( 0 == num%j ) {\n cnt--;\n\t\t\t\t\t\tbreak;\n }\n }",
"j=3;",
"j=3",
"j",
"3",
"j*j<=num",
"j*j",
"j",
"j",
"num",
"j+=2",
"j+=2",
"j",
"2",
"{\n if( 0 == num%j ) {\n cnt--;\n\t\t\t\t\t\tbreak;\n }\n }",
"{\n if( 0 == num%j ) {\n cnt--;\n\t\t\t\t\t\tbreak;\n }\n }",
"if( 0 == num%j ) {\n cnt--;\n\t\t\t\t\t\tbreak;\n }",
"0 == num%j",
"0",
"num%j",
"num",
"j",
"{\n cnt--;\n\t\t\t\t\t\tbreak;\n }",
"cnt--",
"cnt",
"break;",
"System.out.println( cnt )",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"kb.close()",
"kb.close",
"kb",
"String[] args",
"args"
] | import java.io.*;
class Main {
public static void main(String[] args) {
BufferedReader kb = new BufferedReader( new InputStreamReader( System.in ) );
try {
int n = Integer.parseInt( kb.readLine() );
int num;
int cnt = n;
int i, j;
for( i=0; i<n; i++ ) {
num = Integer.parseInt( kb.readLine() );
if( 2 == num ) { continue; }
if( 0 == num%2 ) {
cnt--;
continue;
}
for( j=3; j*j<=num; j+=2 ) {
if( 0 == num%j ) {
cnt--;
break;
}
}
}
System.out.println( cnt );
kb.close();
} catch( IOException e ) {
System.err.println( e );
}
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
17,
41,
13,
39,
17,
17,
17,
17,
41,
13,
20,
11,
1,
41,
13,
17,
2,
13,
17,
1,
40,
13,
30,
30,
0,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
18,
13,
13,
17,
30,
0,
13,
17,
3,
14,
13,
30,
4,
18,
13,
13,
41,
13,
20,
11,
1,
41,
13,
17,
2,
13,
17,
1,
40,
13,
30,
30,
0,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
14,
2,
2,
13,
13,
2,
2,
13,
13,
17,
30,
0,
13,
17,
3,
14,
13,
30,
4,
18,
13,
13,
41,
13,
20,
42,
4,
18,
13,
30,
41,
13,
4,
18,
13,
4,
18,
13,
0,
13,
17,
14,
4,
18,
13,
13,
30,
9,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
14,
2,
40,
4,
18,
13,
13,
2,
2,
13,
13,
17,
30,
0,
13,
17,
3,
14,
13,
30,
4,
18,
13,
13,
4,
18,
18,
13,
13,
4,
18,
13,
4,
18,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
223,
5
],
[
223,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
8,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
17,
19
],
[
17,
20
],
[
17,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
8,
25
],
[
25,
26
],
[
26,
27
],
[
27,
28
],
[
27,
29
],
[
25,
30
],
[
30,
31
],
[
30,
32
],
[
25,
33
],
[
33,
34
],
[
34,
35
],
[
25,
36
],
[
37,
37
],
[
37,
38
],
[
38,
39
],
[
38,
40
],
[
37,
41
],
[
41,
42
],
[
42,
43
],
[
43,
44
],
[
43,
45
],
[
41,
46
],
[
46,
47
],
[
46,
48
],
[
48,
49
],
[
48,
50
],
[
41,
51
],
[
51,
52
],
[
52,
53
],
[
41,
54
],
[
55,
55
],
[
55,
56
],
[
56,
57
],
[
57,
58
],
[
58,
59
],
[
58,
60
],
[
60,
61
],
[
60,
62
],
[
57,
63
],
[
56,
64
],
[
64,
65
],
[
65,
66
],
[
65,
67
],
[
64,
68
],
[
37,
69
],
[
69,
70
],
[
69,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
72,
75
],
[
8,
76
],
[
76,
77
],
[
76,
78
],
[
8,
79
],
[
79,
80
],
[
80,
81
],
[
81,
82
],
[
81,
83
],
[
79,
84
],
[
84,
85
],
[
84,
86
],
[
79,
87
],
[
87,
88
],
[
88,
89
],
[
79,
90
],
[
91,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
91,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
97,
99
],
[
95,
100
],
[
100,
101
],
[
100,
102
],
[
102,
103
],
[
103,
104
],
[
95,
105
],
[
105,
106
],
[
106,
107
],
[
95,
108
],
[
109,
109
],
[
109,
110
],
[
110,
111
],
[
110,
112
],
[
112,
113
],
[
113,
114
],
[
112,
115
],
[
109,
116
],
[
116,
117
],
[
117,
118
],
[
118,
119
],
[
118,
120
],
[
117,
121
],
[
121,
122
],
[
122,
123
],
[
122,
124
],
[
121,
125
],
[
116,
126
],
[
126,
127
],
[
127,
128
],
[
127,
129
],
[
126,
130
],
[
91,
131
],
[
131,
132
],
[
131,
133
],
[
133,
134
],
[
134,
135
],
[
135,
136
],
[
134,
137
],
[
8,
138
],
[
138,
139
],
[
138,
140
],
[
8,
141
],
[
141,
142
],
[
142,
143
],
[
143,
144
],
[
141,
145
],
[
145,
146
],
[
146,
147
],
[
146,
148
],
[
148,
149
],
[
149,
150
],
[
148,
151
],
[
151,
152
],
[
152,
153
],
[
145,
154
],
[
154,
155
],
[
154,
156
],
[
145,
157
],
[
157,
158
],
[
158,
159
],
[
159,
160
],
[
158,
161
],
[
157,
162
],
[
162,
163
],
[
145,
164
],
[
164,
165
],
[
165,
166
],
[
166,
167
],
[
166,
168
],
[
164,
169
],
[
169,
170
],
[
169,
171
],
[
171,
172
],
[
172,
173
],
[
164,
174
],
[
174,
175
],
[
175,
176
],
[
164,
177
],
[
178,
178
],
[
178,
179
],
[
179,
180
],
[
179,
181
],
[
181,
182
],
[
182,
183
],
[
181,
184
],
[
178,
185
],
[
185,
186
],
[
186,
187
],
[
187,
188
],
[
188,
189
],
[
189,
190
],
[
188,
191
],
[
186,
192
],
[
192,
193
],
[
193,
194
],
[
193,
195
],
[
192,
196
],
[
185,
197
],
[
197,
198
],
[
198,
199
],
[
198,
200
],
[
197,
201
],
[
145,
202
],
[
202,
203
],
[
202,
204
],
[
204,
205
],
[
205,
206
],
[
206,
207
],
[
205,
208
],
[
8,
209
],
[
209,
210
],
[
210,
211
],
[
211,
212
],
[
211,
213
],
[
209,
214
],
[
214,
215
],
[
215,
216
],
[
8,
217
],
[
217,
218
],
[
218,
219
],
[
6,
220
],
[
220,
221
],
[
0,
222
],
[
222,
223
],
[
222,
224
]
] | [
"import java.util.*;\n\npublic class Main {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tboolean is_prime = true;\n\t\tInteger[] prime_10 = {2, 3, 5, 7};\n\t\tArrayList<Integer> prime_100 = new ArrayList<Integer>(Arrays.asList(prime_10));\n\t\tfor(int i = 10; i < 100; i++){\n\t\t\tis_prime = true;\n\t\t\tfor(int j = 0; j < prime_10.length; j++){\n\t\t\t\tif(i % prime_10[j] == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tprime_100.add(i);\n\t\t\t}\n\t\t}\n\n\t\tArrayList<Integer> prime_10000 = new ArrayList<Integer>();\n\t\tfor(int i = 2; i < 10000; i++){\n\t\t\tis_prime = true;\n\t\t\tfor(int j = 0; j < prime_100.size(); j++){\n\t\t\t\tInteger prime = prime_100.get(j);\n\t\t\t\tif(i != prime&& i % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tprime_10000.add(i);\n\t\t\t}\n\t\t}\n\n\t\tArrayList<Integer> result = new ArrayList<Integer>();\n\t\twhile(s.hasNext()){\n\t\t\tInteger number = Integer.parseInt(s.next());\n\t\t\tis_prime = true;\n\t\t\tif(result.contains(number)){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor(int j = 0; j < prime_10000.size(); j++){\n\t\t\t\tInteger prime = prime_10000.get(j);\n\t\t\t\tif(!number.equals(prime) && number % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tresult.add(number);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(result.size());\n\t\ts.close();\n\t}\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tboolean is_prime = true;\n\t\tInteger[] prime_10 = {2, 3, 5, 7};\n\t\tArrayList<Integer> prime_100 = new ArrayList<Integer>(Arrays.asList(prime_10));\n\t\tfor(int i = 10; i < 100; i++){\n\t\t\tis_prime = true;\n\t\t\tfor(int j = 0; j < prime_10.length; j++){\n\t\t\t\tif(i % prime_10[j] == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tprime_100.add(i);\n\t\t\t}\n\t\t}\n\n\t\tArrayList<Integer> prime_10000 = new ArrayList<Integer>();\n\t\tfor(int i = 2; i < 10000; i++){\n\t\t\tis_prime = true;\n\t\t\tfor(int j = 0; j < prime_100.size(); j++){\n\t\t\t\tInteger prime = prime_100.get(j);\n\t\t\t\tif(i != prime&& i % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tprime_10000.add(i);\n\t\t\t}\n\t\t}\n\n\t\tArrayList<Integer> result = new ArrayList<Integer>();\n\t\twhile(s.hasNext()){\n\t\t\tInteger number = Integer.parseInt(s.next());\n\t\t\tis_prime = true;\n\t\t\tif(result.contains(number)){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor(int j = 0; j < prime_10000.size(); j++){\n\t\t\t\tInteger prime = prime_10000.get(j);\n\t\t\t\tif(!number.equals(prime) && number % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tresult.add(number);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(result.size());\n\t\ts.close();\n\t}\n}",
"Main",
"/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tboolean is_prime = true;\n\t\tInteger[] prime_10 = {2, 3, 5, 7};\n\t\tArrayList<Integer> prime_100 = new ArrayList<Integer>(Arrays.asList(prime_10));\n\t\tfor(int i = 10; i < 100; i++){\n\t\t\tis_prime = true;\n\t\t\tfor(int j = 0; j < prime_10.length; j++){\n\t\t\t\tif(i % prime_10[j] == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tprime_100.add(i);\n\t\t\t}\n\t\t}\n\n\t\tArrayList<Integer> prime_10000 = new ArrayList<Integer>();\n\t\tfor(int i = 2; i < 10000; i++){\n\t\t\tis_prime = true;\n\t\t\tfor(int j = 0; j < prime_100.size(); j++){\n\t\t\t\tInteger prime = prime_100.get(j);\n\t\t\t\tif(i != prime&& i % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tprime_10000.add(i);\n\t\t\t}\n\t\t}\n\n\t\tArrayList<Integer> result = new ArrayList<Integer>();\n\t\twhile(s.hasNext()){\n\t\t\tInteger number = Integer.parseInt(s.next());\n\t\t\tis_prime = true;\n\t\t\tif(result.contains(number)){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor(int j = 0; j < prime_10000.size(); j++){\n\t\t\t\tInteger prime = prime_10000.get(j);\n\t\t\t\tif(!number.equals(prime) && number % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tresult.add(number);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(result.size());\n\t\ts.close();\n\t}",
"main",
"{\n\t\tScanner s = new Scanner(System.in);\n\t\tboolean is_prime = true;\n\t\tInteger[] prime_10 = {2, 3, 5, 7};\n\t\tArrayList<Integer> prime_100 = new ArrayList<Integer>(Arrays.asList(prime_10));\n\t\tfor(int i = 10; i < 100; i++){\n\t\t\tis_prime = true;\n\t\t\tfor(int j = 0; j < prime_10.length; j++){\n\t\t\t\tif(i % prime_10[j] == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tprime_100.add(i);\n\t\t\t}\n\t\t}\n\n\t\tArrayList<Integer> prime_10000 = new ArrayList<Integer>();\n\t\tfor(int i = 2; i < 10000; i++){\n\t\t\tis_prime = true;\n\t\t\tfor(int j = 0; j < prime_100.size(); j++){\n\t\t\t\tInteger prime = prime_100.get(j);\n\t\t\t\tif(i != prime&& i % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tprime_10000.add(i);\n\t\t\t}\n\t\t}\n\n\t\tArrayList<Integer> result = new ArrayList<Integer>();\n\t\twhile(s.hasNext()){\n\t\t\tInteger number = Integer.parseInt(s.next());\n\t\t\tis_prime = true;\n\t\t\tif(result.contains(number)){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor(int j = 0; j < prime_10000.size(); j++){\n\t\t\t\tInteger prime = prime_10000.get(j);\n\t\t\t\tif(!number.equals(prime) && number % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tresult.add(number);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(result.size());\n\t\ts.close();\n\t}",
"Scanner s = new Scanner(System.in);",
"s",
"new Scanner(System.in)",
"boolean is_prime = true;",
"is_prime",
"true",
"Integer[] prime_10 = {2, 3, 5, 7};",
"prime_10",
"{2, 3, 5, 7}",
"2",
"3",
"5",
"7",
"ArrayList<Integer> prime_100 = new ArrayList<Integer>(Arrays.asList(prime_10));",
"prime_100",
"new ArrayList<Integer>(Arrays.asList(prime_10))",
"for(int i = 10; i < 100; i++){\n\t\t\tis_prime = true;\n\t\t\tfor(int j = 0; j < prime_10.length; j++){\n\t\t\t\tif(i % prime_10[j] == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tprime_100.add(i);\n\t\t\t}\n\t\t}",
"int i = 10;",
"int i = 10;",
"i",
"10",
"i < 100",
"i",
"100",
"i++",
"i++",
"i",
"{\n\t\t\tis_prime = true;\n\t\t\tfor(int j = 0; j < prime_10.length; j++){\n\t\t\t\tif(i % prime_10[j] == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tprime_100.add(i);\n\t\t\t}\n\t\t}",
"{\n\t\t\tis_prime = true;\n\t\t\tfor(int j = 0; j < prime_10.length; j++){\n\t\t\t\tif(i % prime_10[j] == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tprime_100.add(i);\n\t\t\t}\n\t\t}",
"is_prime = true",
"is_prime",
"true",
"for(int j = 0; j < prime_10.length; j++){\n\t\t\t\tif(i % prime_10[j] == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < prime_10.length",
"j",
"prime_10.length",
"prime_10",
"prime_10.length",
"j++",
"j++",
"j",
"{\n\t\t\t\tif(i % prime_10[j] == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif(i % prime_10[j] == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"if(i % prime_10[j] == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"i % prime_10[j] == 0",
"i % prime_10[j]",
"i",
"prime_10[j]",
"prime_10",
"j",
"0",
"{\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"is_prime = false",
"is_prime",
"false",
"break;",
"if(is_prime){\n\t\t\t\tprime_100.add(i);\n\t\t\t}",
"is_prime",
"{\n\t\t\t\tprime_100.add(i);\n\t\t\t}",
"prime_100.add(i)",
"prime_100.add",
"prime_100",
"i",
"ArrayList<Integer> prime_10000 = new ArrayList<Integer>();",
"prime_10000",
"new ArrayList<Integer>()",
"for(int i = 2; i < 10000; i++){\n\t\t\tis_prime = true;\n\t\t\tfor(int j = 0; j < prime_100.size(); j++){\n\t\t\t\tInteger prime = prime_100.get(j);\n\t\t\t\tif(i != prime&& i % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tprime_10000.add(i);\n\t\t\t}\n\t\t}",
"int i = 2;",
"int i = 2;",
"i",
"2",
"i < 10000",
"i",
"10000",
"i++",
"i++",
"i",
"{\n\t\t\tis_prime = true;\n\t\t\tfor(int j = 0; j < prime_100.size(); j++){\n\t\t\t\tInteger prime = prime_100.get(j);\n\t\t\t\tif(i != prime&& i % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tprime_10000.add(i);\n\t\t\t}\n\t\t}",
"{\n\t\t\tis_prime = true;\n\t\t\tfor(int j = 0; j < prime_100.size(); j++){\n\t\t\t\tInteger prime = prime_100.get(j);\n\t\t\t\tif(i != prime&& i % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tprime_10000.add(i);\n\t\t\t}\n\t\t}",
"is_prime = true",
"is_prime",
"true",
"for(int j = 0; j < prime_100.size(); j++){\n\t\t\t\tInteger prime = prime_100.get(j);\n\t\t\t\tif(i != prime&& i % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < prime_100.size()",
"j",
"prime_100.size()",
"prime_100.size",
"prime_100",
"j++",
"j++",
"j",
"{\n\t\t\t\tInteger prime = prime_100.get(j);\n\t\t\t\tif(i != prime&& i % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tInteger prime = prime_100.get(j);\n\t\t\t\tif(i != prime&& i % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"Integer prime = prime_100.get(j);",
"prime",
"prime_100.get(j)",
"prime_100.get",
"prime_100",
"j",
"if(i != prime&& i % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"i != prime&& i % prime == 0",
"i != prime",
"i",
"prime",
"i % prime == 0",
"i % prime",
"i",
"prime",
"0",
"{\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"is_prime = false",
"is_prime",
"false",
"break;",
"if(is_prime){\n\t\t\t\tprime_10000.add(i);\n\t\t\t}",
"is_prime",
"{\n\t\t\t\tprime_10000.add(i);\n\t\t\t}",
"prime_10000.add(i)",
"prime_10000.add",
"prime_10000",
"i",
"ArrayList<Integer> result = new ArrayList<Integer>();",
"result",
"new ArrayList<Integer>()",
"while(s.hasNext()){\n\t\t\tInteger number = Integer.parseInt(s.next());\n\t\t\tis_prime = true;\n\t\t\tif(result.contains(number)){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor(int j = 0; j < prime_10000.size(); j++){\n\t\t\t\tInteger prime = prime_10000.get(j);\n\t\t\t\tif(!number.equals(prime) && number % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tresult.add(number);\n\t\t\t}\n\t\t}",
"s.hasNext()",
"s.hasNext",
"s",
"{\n\t\t\tInteger number = Integer.parseInt(s.next());\n\t\t\tis_prime = true;\n\t\t\tif(result.contains(number)){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor(int j = 0; j < prime_10000.size(); j++){\n\t\t\t\tInteger prime = prime_10000.get(j);\n\t\t\t\tif(!number.equals(prime) && number % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tresult.add(number);\n\t\t\t}\n\t\t}",
"Integer number = Integer.parseInt(s.next());",
"number",
"Integer.parseInt(s.next())",
"Integer.parseInt",
"Integer",
"s.next()",
"s.next",
"s",
"is_prime = true",
"is_prime",
"true",
"if(result.contains(number)){\n\t\t\t\tcontinue;\n\t\t\t}",
"result.contains(number)",
"result.contains",
"result",
"number",
"{\n\t\t\t\tcontinue;\n\t\t\t}",
"continue;",
"for(int j = 0; j < prime_10000.size(); j++){\n\t\t\t\tInteger prime = prime_10000.get(j);\n\t\t\t\tif(!number.equals(prime) && number % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < prime_10000.size()",
"j",
"prime_10000.size()",
"prime_10000.size",
"prime_10000",
"j++",
"j++",
"j",
"{\n\t\t\t\tInteger prime = prime_10000.get(j);\n\t\t\t\tif(!number.equals(prime) && number % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tInteger prime = prime_10000.get(j);\n\t\t\t\tif(!number.equals(prime) && number % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"Integer prime = prime_10000.get(j);",
"prime",
"prime_10000.get(j)",
"prime_10000.get",
"prime_10000",
"j",
"if(!number.equals(prime) && number % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"!number.equals(prime) && number % prime == 0",
"!number.equals(prime)",
"number.equals(prime)",
"number.equals",
"number",
"prime",
"number % prime == 0",
"number % prime",
"number",
"prime",
"0",
"{\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"is_prime = false",
"is_prime",
"false",
"break;",
"if(is_prime){\n\t\t\t\tresult.add(number);\n\t\t\t}",
"is_prime",
"{\n\t\t\t\tresult.add(number);\n\t\t\t}",
"result.add(number)",
"result.add",
"result",
"number",
"System.out.println(result.size())",
"System.out.println",
"System.out",
"System",
"System.out",
"result.size()",
"result.size",
"result",
"s.close()",
"s.close",
"s",
"String[] args",
"args",
"public class Main {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tboolean is_prime = true;\n\t\tInteger[] prime_10 = {2, 3, 5, 7};\n\t\tArrayList<Integer> prime_100 = new ArrayList<Integer>(Arrays.asList(prime_10));\n\t\tfor(int i = 10; i < 100; i++){\n\t\t\tis_prime = true;\n\t\t\tfor(int j = 0; j < prime_10.length; j++){\n\t\t\t\tif(i % prime_10[j] == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tprime_100.add(i);\n\t\t\t}\n\t\t}\n\n\t\tArrayList<Integer> prime_10000 = new ArrayList<Integer>();\n\t\tfor(int i = 2; i < 10000; i++){\n\t\t\tis_prime = true;\n\t\t\tfor(int j = 0; j < prime_100.size(); j++){\n\t\t\t\tInteger prime = prime_100.get(j);\n\t\t\t\tif(i != prime&& i % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tprime_10000.add(i);\n\t\t\t}\n\t\t}\n\n\t\tArrayList<Integer> result = new ArrayList<Integer>();\n\t\twhile(s.hasNext()){\n\t\t\tInteger number = Integer.parseInt(s.next());\n\t\t\tis_prime = true;\n\t\t\tif(result.contains(number)){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor(int j = 0; j < prime_10000.size(); j++){\n\t\t\t\tInteger prime = prime_10000.get(j);\n\t\t\t\tif(!number.equals(prime) && number % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tresult.add(number);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(result.size());\n\t\ts.close();\n\t}\n}",
"public class Main {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tboolean is_prime = true;\n\t\tInteger[] prime_10 = {2, 3, 5, 7};\n\t\tArrayList<Integer> prime_100 = new ArrayList<Integer>(Arrays.asList(prime_10));\n\t\tfor(int i = 10; i < 100; i++){\n\t\t\tis_prime = true;\n\t\t\tfor(int j = 0; j < prime_10.length; j++){\n\t\t\t\tif(i % prime_10[j] == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tprime_100.add(i);\n\t\t\t}\n\t\t}\n\n\t\tArrayList<Integer> prime_10000 = new ArrayList<Integer>();\n\t\tfor(int i = 2; i < 10000; i++){\n\t\t\tis_prime = true;\n\t\t\tfor(int j = 0; j < prime_100.size(); j++){\n\t\t\t\tInteger prime = prime_100.get(j);\n\t\t\t\tif(i != prime&& i % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tprime_10000.add(i);\n\t\t\t}\n\t\t}\n\n\t\tArrayList<Integer> result = new ArrayList<Integer>();\n\t\twhile(s.hasNext()){\n\t\t\tInteger number = Integer.parseInt(s.next());\n\t\t\tis_prime = true;\n\t\t\tif(result.contains(number)){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor(int j = 0; j < prime_10000.size(); j++){\n\t\t\t\tInteger prime = prime_10000.get(j);\n\t\t\t\tif(!number.equals(prime) && number % prime == 0){\n\t\t\t\t\tis_prime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is_prime){\n\t\t\t\tresult.add(number);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(result.size());\n\t\ts.close();\n\t}\n}",
"Main"
] | import java.util.*;
public class Main {
/**
* @param args
*/
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
boolean is_prime = true;
Integer[] prime_10 = {2, 3, 5, 7};
ArrayList<Integer> prime_100 = new ArrayList<Integer>(Arrays.asList(prime_10));
for(int i = 10; i < 100; i++){
is_prime = true;
for(int j = 0; j < prime_10.length; j++){
if(i % prime_10[j] == 0){
is_prime = false;
break;
}
}
if(is_prime){
prime_100.add(i);
}
}
ArrayList<Integer> prime_10000 = new ArrayList<Integer>();
for(int i = 2; i < 10000; i++){
is_prime = true;
for(int j = 0; j < prime_100.size(); j++){
Integer prime = prime_100.get(j);
if(i != prime&& i % prime == 0){
is_prime = false;
break;
}
}
if(is_prime){
prime_10000.add(i);
}
}
ArrayList<Integer> result = new ArrayList<Integer>();
while(s.hasNext()){
Integer number = Integer.parseInt(s.next());
is_prime = true;
if(result.contains(number)){
continue;
}
for(int j = 0; j < prime_10000.size(); j++){
Integer prime = prime_10000.get(j);
if(!number.equals(prime) && number % prime == 0){
is_prime = false;
break;
}
}
if(is_prime){
result.add(number);
}
}
System.out.println(result.size());
s.close();
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
17,
41,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
0,
18,
13,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
18,
13,
13,
13,
17,
30,
0,
13,
17,
3,
14,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
92,
5
],
[
92,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
8,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
8,
20
],
[
20,
21
],
[
20,
22
],
[
8,
24
],
[
24,
25
],
[
25,
26
],
[
26,
27
],
[
26,
28
],
[
24,
29
],
[
29,
30
],
[
29,
31
],
[
24,
32
],
[
32,
33
],
[
33,
34
],
[
24,
35
],
[
36,
36
],
[
36,
37
],
[
37,
38
],
[
37,
39
],
[
36,
40
],
[
40,
41
],
[
41,
42
],
[
41,
43
],
[
40,
44
],
[
44,
45
],
[
45,
46
],
[
36,
47
],
[
47,
48
],
[
48,
49
],
[
49,
50
],
[
49,
51
],
[
47,
52
],
[
52,
53
],
[
52,
54
],
[
54,
55
],
[
55,
56
],
[
54,
57
],
[
57,
58
],
[
57,
59
],
[
47,
60
],
[
60,
61
],
[
61,
62
],
[
47,
63
],
[
64,
64
],
[
64,
65
],
[
65,
66
],
[
66,
67
],
[
67,
68
],
[
68,
69
],
[
68,
70
],
[
67,
71
],
[
66,
72
],
[
65,
73
],
[
73,
74
],
[
74,
75
],
[
74,
76
],
[
73,
77
],
[
36,
78
],
[
78,
79
],
[
78,
80
],
[
80,
81
],
[
81,
82
],
[
8,
83
],
[
83,
84
],
[
84,
85
],
[
85,
86
],
[
85,
87
],
[
83,
88
],
[
6,
89
],
[
89,
90
],
[
0,
91
],
[
91,
92
],
[
91,
93
]
] | [
"import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner input=new Scanner(System.in);\n\t\tint primeNumber=0;\n\t\tint circle=input.nextInt();\n\t\tint[] list=new int[circle];\n\t\tfor(int i=0;i<circle;i++){\n\t\t\tboolean isPrime=true;\n\t\t\tlist[i]=input.nextInt();\n\t\t\tfor(int j=2;j<=Math.sqrt(list[i]);j++){\n\t\t\t\tif(list[i]%j==0){\n\t\t\t\t\tisPrime=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(isPrime){\n\t\t\t\tprimeNumber++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(primeNumber);\n\t}\n\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n\tpublic static void main(String[] args){\n\t\tScanner input=new Scanner(System.in);\n\t\tint primeNumber=0;\n\t\tint circle=input.nextInt();\n\t\tint[] list=new int[circle];\n\t\tfor(int i=0;i<circle;i++){\n\t\t\tboolean isPrime=true;\n\t\t\tlist[i]=input.nextInt();\n\t\t\tfor(int j=2;j<=Math.sqrt(list[i]);j++){\n\t\t\t\tif(list[i]%j==0){\n\t\t\t\t\tisPrime=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(isPrime){\n\t\t\t\tprimeNumber++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(primeNumber);\n\t}\n\n}",
"Main",
"public static void main(String[] args){\n\t\tScanner input=new Scanner(System.in);\n\t\tint primeNumber=0;\n\t\tint circle=input.nextInt();\n\t\tint[] list=new int[circle];\n\t\tfor(int i=0;i<circle;i++){\n\t\t\tboolean isPrime=true;\n\t\t\tlist[i]=input.nextInt();\n\t\t\tfor(int j=2;j<=Math.sqrt(list[i]);j++){\n\t\t\t\tif(list[i]%j==0){\n\t\t\t\t\tisPrime=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(isPrime){\n\t\t\t\tprimeNumber++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(primeNumber);\n\t}",
"main",
"{\n\t\tScanner input=new Scanner(System.in);\n\t\tint primeNumber=0;\n\t\tint circle=input.nextInt();\n\t\tint[] list=new int[circle];\n\t\tfor(int i=0;i<circle;i++){\n\t\t\tboolean isPrime=true;\n\t\t\tlist[i]=input.nextInt();\n\t\t\tfor(int j=2;j<=Math.sqrt(list[i]);j++){\n\t\t\t\tif(list[i]%j==0){\n\t\t\t\t\tisPrime=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(isPrime){\n\t\t\t\tprimeNumber++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(primeNumber);\n\t}",
"Scanner input=new Scanner(System.in);",
"input",
"new Scanner(System.in)",
"int primeNumber=0;",
"primeNumber",
"0",
"int circle=input.nextInt();",
"circle",
"input.nextInt()",
"input.nextInt",
"input",
"int[] list=new int[circle];",
"list",
"new int[circle]",
"circle",
"for(int i=0;i<circle;i++){\n\t\t\tboolean isPrime=true;\n\t\t\tlist[i]=input.nextInt();\n\t\t\tfor(int j=2;j<=Math.sqrt(list[i]);j++){\n\t\t\t\tif(list[i]%j==0){\n\t\t\t\t\tisPrime=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(isPrime){\n\t\t\t\tprimeNumber++;\n\t\t\t}\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<circle",
"i",
"circle",
"i++",
"i++",
"i",
"{\n\t\t\tboolean isPrime=true;\n\t\t\tlist[i]=input.nextInt();\n\t\t\tfor(int j=2;j<=Math.sqrt(list[i]);j++){\n\t\t\t\tif(list[i]%j==0){\n\t\t\t\t\tisPrime=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(isPrime){\n\t\t\t\tprimeNumber++;\n\t\t\t}\n\t\t}",
"{\n\t\t\tboolean isPrime=true;\n\t\t\tlist[i]=input.nextInt();\n\t\t\tfor(int j=2;j<=Math.sqrt(list[i]);j++){\n\t\t\t\tif(list[i]%j==0){\n\t\t\t\t\tisPrime=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(isPrime){\n\t\t\t\tprimeNumber++;\n\t\t\t}\n\t\t}",
"boolean isPrime=true;",
"isPrime",
"true",
"list[i]=input.nextInt()",
"list[i]",
"list",
"i",
"input.nextInt()",
"input.nextInt",
"input",
"for(int j=2;j<=Math.sqrt(list[i]);j++){\n\t\t\t\tif(list[i]%j==0){\n\t\t\t\t\tisPrime=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"int j=2;",
"int j=2;",
"j",
"2",
"j<=Math.sqrt(list[i])",
"j",
"Math.sqrt(list[i])",
"Math.sqrt",
"Math",
"list[i]",
"list",
"i",
"j++",
"j++",
"j",
"{\n\t\t\t\tif(list[i]%j==0){\n\t\t\t\t\tisPrime=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif(list[i]%j==0){\n\t\t\t\t\tisPrime=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"if(list[i]%j==0){\n\t\t\t\t\tisPrime=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"list[i]%j==0",
"list[i]%j",
"list[i]",
"list",
"i",
"j",
"0",
"{\n\t\t\t\t\tisPrime=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"isPrime=false",
"isPrime",
"false",
"break;",
"if(isPrime){\n\t\t\t\tprimeNumber++;\n\t\t\t}",
"isPrime",
"{\n\t\t\t\tprimeNumber++;\n\t\t\t}",
"primeNumber++",
"primeNumber",
"System.out.println(primeNumber)",
"System.out.println",
"System.out",
"System",
"System.out",
"primeNumber",
"String[] args",
"args",
"public class Main {\n\tpublic static void main(String[] args){\n\t\tScanner input=new Scanner(System.in);\n\t\tint primeNumber=0;\n\t\tint circle=input.nextInt();\n\t\tint[] list=new int[circle];\n\t\tfor(int i=0;i<circle;i++){\n\t\t\tboolean isPrime=true;\n\t\t\tlist[i]=input.nextInt();\n\t\t\tfor(int j=2;j<=Math.sqrt(list[i]);j++){\n\t\t\t\tif(list[i]%j==0){\n\t\t\t\t\tisPrime=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(isPrime){\n\t\t\t\tprimeNumber++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(primeNumber);\n\t}\n\n}",
"public class Main {\n\tpublic static void main(String[] args){\n\t\tScanner input=new Scanner(System.in);\n\t\tint primeNumber=0;\n\t\tint circle=input.nextInt();\n\t\tint[] list=new int[circle];\n\t\tfor(int i=0;i<circle;i++){\n\t\t\tboolean isPrime=true;\n\t\t\tlist[i]=input.nextInt();\n\t\t\tfor(int j=2;j<=Math.sqrt(list[i]);j++){\n\t\t\t\tif(list[i]%j==0){\n\t\t\t\t\tisPrime=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(isPrime){\n\t\t\t\tprimeNumber++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(primeNumber);\n\t}\n\n}",
"Main"
] | import java.util.*;
public class Main {
public static void main(String[] args){
Scanner input=new Scanner(System.in);
int primeNumber=0;
int circle=input.nextInt();
int[] list=new int[circle];
for(int i=0;i<circle;i++){
boolean isPrime=true;
list[i]=input.nextInt();
for(int j=2;j<=Math.sqrt(list[i]);j++){
if(list[i]%j==0){
isPrime=false;
break;
}
}
if(isPrime){
primeNumber++;
}
}
System.out.println(primeNumber);
}
} |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
42,
4,
18,
13,
30,
41,
13,
17,
11,
1,
41,
13,
4,
18,
13,
2,
13,
17,
1,
40,
13,
30,
30,
0,
13,
20,
14,
4,
18,
13,
17,
40,
13,
4,
18,
18,
13,
13,
17,
13,
12,
13,
30,
20,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
64,
8
],
[
64,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
11,
15
],
[
15,
16
],
[
11,
17
],
[
17,
18
],
[
18,
19
],
[
19,
20
],
[
17,
21
],
[
21,
22
],
[
22,
23
],
[
22,
24
],
[
21,
25
],
[
25,
26
],
[
26,
27
],
[
27,
28
],
[
27,
29
],
[
29,
30
],
[
30,
31
],
[
25,
32
],
[
32,
33
],
[
32,
34
],
[
25,
35
],
[
35,
36
],
[
36,
37
],
[
25,
38
],
[
39,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
39,
43
],
[
43,
44
],
[
44,
45
],
[
45,
46
],
[
44,
47
],
[
43,
48
],
[
48,
49
],
[
21,
50
],
[
50,
51
],
[
51,
52
],
[
52,
53
],
[
52,
54
],
[
50,
55
],
[
50,
56
],
[
64,
57
],
[
57,
58
],
[
57,
59
],
[
59,
60
],
[
57,
61
],
[
61,
62
],
[
0,
63
],
[
63,
64
],
[
63,
65
]
] | [
"import java.util.Scanner;\nimport java.math.*;\n\npublic class Main{\n Main(){\n\tScanner sc = new Scanner(System.in);\n\tBigInteger bi;\n\n\twhile(sc.hasNext()){\n\t int cnt = 0;\n\t for(int i = sc.nextInt(); i >= 1; --i){\n\t\tbi = new BigInteger(sc.next());\n\t\tif(bi.isProbablePrime(1000)) ++cnt;\n\t }\n\t System.out.printf(\"%d\\n\", cnt);\n\t}\n }\n\n public static void main(String[] args){\n\tnew Main();\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"import java.math.*;",
"math.*",
"java",
"public class Main{\n Main(){\n\tScanner sc = new Scanner(System.in);\n\tBigInteger bi;\n\n\twhile(sc.hasNext()){\n\t int cnt = 0;\n\t for(int i = sc.nextInt(); i >= 1; --i){\n\t\tbi = new BigInteger(sc.next());\n\t\tif(bi.isProbablePrime(1000)) ++cnt;\n\t }\n\t System.out.printf(\"%d\\n\", cnt);\n\t}\n }\n\n public static void main(String[] args){\n\tnew Main();\n }\n}",
"Main",
"Main(){\n\tScanner sc = new Scanner(System.in);\n\tBigInteger bi;\n\n\twhile(sc.hasNext()){\n\t int cnt = 0;\n\t for(int i = sc.nextInt(); i >= 1; --i){\n\t\tbi = new BigInteger(sc.next());\n\t\tif(bi.isProbablePrime(1000)) ++cnt;\n\t }\n\t System.out.printf(\"%d\\n\", cnt);\n\t}\n }",
"Main",
"{\n\tScanner sc = new Scanner(System.in);\n\tBigInteger bi;\n\n\twhile(sc.hasNext()){\n\t int cnt = 0;\n\t for(int i = sc.nextInt(); i >= 1; --i){\n\t\tbi = new BigInteger(sc.next());\n\t\tif(bi.isProbablePrime(1000)) ++cnt;\n\t }\n\t System.out.printf(\"%d\\n\", cnt);\n\t}\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"BigInteger bi;",
"bi",
"while(sc.hasNext()){\n\t int cnt = 0;\n\t for(int i = sc.nextInt(); i >= 1; --i){\n\t\tbi = new BigInteger(sc.next());\n\t\tif(bi.isProbablePrime(1000)) ++cnt;\n\t }\n\t System.out.printf(\"%d\\n\", cnt);\n\t}",
"sc.hasNext()",
"sc.hasNext",
"sc",
"{\n\t int cnt = 0;\n\t for(int i = sc.nextInt(); i >= 1; --i){\n\t\tbi = new BigInteger(sc.next());\n\t\tif(bi.isProbablePrime(1000)) ++cnt;\n\t }\n\t System.out.printf(\"%d\\n\", cnt);\n\t}",
"int cnt = 0;",
"cnt",
"0",
"for(int i = sc.nextInt(); i >= 1; --i){\n\t\tbi = new BigInteger(sc.next());\n\t\tif(bi.isProbablePrime(1000)) ++cnt;\n\t }",
"int i = sc.nextInt();",
"int i = sc.nextInt();",
"i",
"sc.nextInt()",
"sc.nextInt",
"sc",
"i >= 1",
"i",
"1",
"--i",
"--i",
"i",
"{\n\t\tbi = new BigInteger(sc.next());\n\t\tif(bi.isProbablePrime(1000)) ++cnt;\n\t }",
"{\n\t\tbi = new BigInteger(sc.next());\n\t\tif(bi.isProbablePrime(1000)) ++cnt;\n\t }",
"bi = new BigInteger(sc.next())",
"bi",
"new BigInteger(sc.next())",
"if(bi.isProbablePrime(1000)) ++cnt;",
"bi.isProbablePrime(1000)",
"bi.isProbablePrime",
"bi",
"1000",
"++cnt",
"cnt",
"System.out.printf(\"%d\\n\", cnt)",
"System.out.printf",
"System.out",
"System",
"System.out",
"\"%d\\n\"",
"cnt",
"public static void main(String[] args){\n\tnew Main();\n }",
"main",
"{\n\tnew Main();\n }",
"new Main()",
"String[] args",
"args",
"public class Main{\n Main(){\n\tScanner sc = new Scanner(System.in);\n\tBigInteger bi;\n\n\twhile(sc.hasNext()){\n\t int cnt = 0;\n\t for(int i = sc.nextInt(); i >= 1; --i){\n\t\tbi = new BigInteger(sc.next());\n\t\tif(bi.isProbablePrime(1000)) ++cnt;\n\t }\n\t System.out.printf(\"%d\\n\", cnt);\n\t}\n }\n\n public static void main(String[] args){\n\tnew Main();\n }\n}",
"public class Main{\n Main(){\n\tScanner sc = new Scanner(System.in);\n\tBigInteger bi;\n\n\twhile(sc.hasNext()){\n\t int cnt = 0;\n\t for(int i = sc.nextInt(); i >= 1; --i){\n\t\tbi = new BigInteger(sc.next());\n\t\tif(bi.isProbablePrime(1000)) ++cnt;\n\t }\n\t System.out.printf(\"%d\\n\", cnt);\n\t}\n }\n\n public static void main(String[] args){\n\tnew Main();\n }\n}",
"Main"
] | import java.util.Scanner;
import java.math.*;
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)) ++cnt;
}
System.out.printf("%d\n", cnt);
}
}
public static void main(String[] args){
new Main();
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
13,
17,
30,
0,
13,
17,
3,
14,
2,
18,
13,
13,
17,
30,
3,
14,
2,
2,
18,
13,
13,
17,
17,
30,
0,
13,
17,
3,
14,
2,
2,
18,
13,
13,
13,
17,
30,
0,
13,
17,
3,
14,
13,
40,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
4,
18,
18,
13,
13,
4,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
147,
5
],
[
147,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
13,
14
],
[
14,
15
],
[
14,
16
],
[
12,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
19,
21
],
[
12,
22
],
[
22,
23
],
[
23,
24
],
[
12,
25
],
[
26,
26
],
[
26,
27
],
[
27,
28
],
[
27,
29
],
[
26,
30
],
[
30,
31
],
[
31,
32
],
[
32,
33
],
[
32,
34
],
[
30,
35
],
[
35,
36
],
[
35,
37
],
[
37,
38
],
[
38,
39
],
[
37,
40
],
[
40,
41
],
[
40,
42
],
[
30,
43
],
[
43,
44
],
[
44,
45
],
[
30,
46
],
[
47,
47
],
[
47,
48
],
[
48,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
49,
53
],
[
48,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
54,
58
],
[
48,
59
],
[
59,
60
],
[
60,
61
],
[
61,
62
],
[
61,
63
],
[
60,
64
],
[
59,
65
],
[
65,
66
],
[
59,
67
],
[
67,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
70,
72
],
[
69,
73
],
[
68,
74
],
[
67,
75
],
[
75,
76
],
[
76,
77
],
[
76,
78
],
[
75,
79
],
[
47,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
83,
84
],
[
83,
85
],
[
82,
86
],
[
81,
87
],
[
80,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
88,
92
],
[
26,
93
],
[
93,
94
],
[
93,
95
],
[
95,
96
],
[
8,
97
],
[
97,
98
],
[
6,
99
],
[
99,
100
],
[
147,
101
],
[
101,
102
],
[
101,
103
],
[
103,
104
],
[
104,
105
],
[
104,
106
],
[
103,
107
],
[
107,
108
],
[
107,
109
],
[
109,
110
],
[
110,
111
],
[
103,
112
],
[
112,
113
],
[
112,
114
],
[
103,
116
],
[
116,
117
],
[
117,
118
],
[
118,
119
],
[
118,
120
],
[
116,
121
],
[
121,
122
],
[
121,
123
],
[
116,
124
],
[
124,
125
],
[
125,
126
],
[
116,
127
],
[
128,
128
],
[
128,
129
],
[
129,
130
],
[
130,
131
],
[
130,
132
],
[
129,
133
],
[
133,
134
],
[
134,
135
],
[
103,
136
],
[
136,
137
],
[
137,
138
],
[
138,
139
],
[
138,
140
],
[
136,
141
],
[
141,
142
],
[
141,
143
],
[
101,
144
],
[
144,
145
],
[
0,
146
],
[
146,
147
],
[
146,
148
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n\t\n\tpublic static int Pm(int[] A) {\n\t\t\n\t\tint count = 0;\n\t\t\n\t\tfor(int i=0;i<A.length;i++) {\n\t\t\tboolean NumberF = true;\n\t\t\tfor(int j=2;j<= Math.sqrt(A[i]);j++) {\n\t\t\t\t\n\t\t\t\tif(A[i] < 2) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] == 2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] % 2 == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A[i] % j == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif(NumberF) count++;\n\t\t}\n\t\t\n\t\treturn count;\n\t\t\n\t}\n\t\n public static void main(String[] args) {\n \tScanner sc = new Scanner(System.in);\n \t\n \tint n = sc.nextInt();\n \t\n \tint[] box = new int[n];\n \t\n \tfor(int i=0;i<n;i++) {\n \t\tbox[i] = sc.nextInt();\n \t}\n \t\n \tSystem.out.println(Pm(box));\n \t\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\t\n\tpublic static int Pm(int[] A) {\n\t\t\n\t\tint count = 0;\n\t\t\n\t\tfor(int i=0;i<A.length;i++) {\n\t\t\tboolean NumberF = true;\n\t\t\tfor(int j=2;j<= Math.sqrt(A[i]);j++) {\n\t\t\t\t\n\t\t\t\tif(A[i] < 2) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] == 2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] % 2 == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A[i] % j == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif(NumberF) count++;\n\t\t}\n\t\t\n\t\treturn count;\n\t\t\n\t}\n\t\n public static void main(String[] args) {\n \tScanner sc = new Scanner(System.in);\n \t\n \tint n = sc.nextInt();\n \t\n \tint[] box = new int[n];\n \t\n \tfor(int i=0;i<n;i++) {\n \t\tbox[i] = sc.nextInt();\n \t}\n \t\n \tSystem.out.println(Pm(box));\n \t\n }\n}",
"Main",
"public static int Pm(int[] A) {\n\t\t\n\t\tint count = 0;\n\t\t\n\t\tfor(int i=0;i<A.length;i++) {\n\t\t\tboolean NumberF = true;\n\t\t\tfor(int j=2;j<= Math.sqrt(A[i]);j++) {\n\t\t\t\t\n\t\t\t\tif(A[i] < 2) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] == 2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] % 2 == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A[i] % j == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif(NumberF) count++;\n\t\t}\n\t\t\n\t\treturn count;\n\t\t\n\t}",
"Pm",
"{\n\t\t\n\t\tint count = 0;\n\t\t\n\t\tfor(int i=0;i<A.length;i++) {\n\t\t\tboolean NumberF = true;\n\t\t\tfor(int j=2;j<= Math.sqrt(A[i]);j++) {\n\t\t\t\t\n\t\t\t\tif(A[i] < 2) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] == 2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] % 2 == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A[i] % j == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif(NumberF) count++;\n\t\t}\n\t\t\n\t\treturn count;\n\t\t\n\t}",
"int count = 0;",
"count",
"0",
"for(int i=0;i<A.length;i++) {\n\t\t\tboolean NumberF = true;\n\t\t\tfor(int j=2;j<= Math.sqrt(A[i]);j++) {\n\t\t\t\t\n\t\t\t\tif(A[i] < 2) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] == 2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] % 2 == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A[i] % j == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif(NumberF) count++;\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<A.length",
"i",
"A.length",
"A",
"A.length",
"i++",
"i++",
"i",
"{\n\t\t\tboolean NumberF = true;\n\t\t\tfor(int j=2;j<= Math.sqrt(A[i]);j++) {\n\t\t\t\t\n\t\t\t\tif(A[i] < 2) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] == 2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] % 2 == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A[i] % j == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif(NumberF) count++;\n\t\t}",
"{\n\t\t\tboolean NumberF = true;\n\t\t\tfor(int j=2;j<= Math.sqrt(A[i]);j++) {\n\t\t\t\t\n\t\t\t\tif(A[i] < 2) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] == 2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] % 2 == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A[i] % j == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif(NumberF) count++;\n\t\t}",
"boolean NumberF = true;",
"NumberF",
"true",
"for(int j=2;j<= Math.sqrt(A[i]);j++) {\n\t\t\t\t\n\t\t\t\tif(A[i] < 2) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] == 2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] % 2 == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A[i] % j == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}",
"int j=2;",
"int j=2;",
"j",
"2",
"j<= Math.sqrt(A[i])",
"j",
"Math.sqrt(A[i])",
"Math.sqrt",
"Math",
"A[i]",
"A",
"i",
"j++",
"j++",
"j",
"{\n\t\t\t\t\n\t\t\t\tif(A[i] < 2) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] == 2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] % 2 == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A[i] % j == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}",
"{\n\t\t\t\t\n\t\t\t\tif(A[i] < 2) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] == 2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] % 2 == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A[i] % j == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}",
"if(A[i] < 2) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] == 2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] % 2 == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"A[i] < 2",
"A[i]",
"A",
"i",
"2",
"{\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"NumberF = false",
"NumberF",
"false",
"break;",
"if(A[i] == 2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] % 2 == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"A[i] == 2",
"A[i]",
"A",
"i",
"2",
"{\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"break;",
"if(A[i] % 2 == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"A[i] % 2 == 0",
"A[i] % 2",
"A[i]",
"A",
"i",
"2",
"0",
"{\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"NumberF = false",
"NumberF",
"false",
"break;",
"if(A[i] % j == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"A[i] % j == 0",
"A[i] % j",
"A[i]",
"A",
"i",
"j",
"0",
"{\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"NumberF = false",
"NumberF",
"false",
"break;",
"if(NumberF) count++;",
"NumberF",
"count++",
"count",
"return count;",
"count",
"int[] A",
"A",
"public static void main(String[] args) {\n \tScanner sc = new Scanner(System.in);\n \t\n \tint n = sc.nextInt();\n \t\n \tint[] box = new int[n];\n \t\n \tfor(int i=0;i<n;i++) {\n \t\tbox[i] = sc.nextInt();\n \t}\n \t\n \tSystem.out.println(Pm(box));\n \t\n }",
"main",
"{\n \tScanner sc = new Scanner(System.in);\n \t\n \tint n = sc.nextInt();\n \t\n \tint[] box = new int[n];\n \t\n \tfor(int i=0;i<n;i++) {\n \t\tbox[i] = sc.nextInt();\n \t}\n \t\n \tSystem.out.println(Pm(box));\n \t\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int[] box = new int[n];",
"box",
"new int[n]",
"n",
"for(int i=0;i<n;i++) {\n \t\tbox[i] = sc.nextInt();\n \t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n \t\tbox[i] = sc.nextInt();\n \t}",
"{\n \t\tbox[i] = sc.nextInt();\n \t}",
"box[i] = sc.nextInt()",
"box[i]",
"box",
"i",
"sc.nextInt()",
"sc.nextInt",
"sc",
"System.out.println(Pm(box))",
"System.out.println",
"System.out",
"System",
"System.out",
"Pm(box)",
"Pm",
"box",
"String[] args",
"args",
"public class Main {\n\t\n\tpublic static int Pm(int[] A) {\n\t\t\n\t\tint count = 0;\n\t\t\n\t\tfor(int i=0;i<A.length;i++) {\n\t\t\tboolean NumberF = true;\n\t\t\tfor(int j=2;j<= Math.sqrt(A[i]);j++) {\n\t\t\t\t\n\t\t\t\tif(A[i] < 2) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] == 2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] % 2 == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A[i] % j == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif(NumberF) count++;\n\t\t}\n\t\t\n\t\treturn count;\n\t\t\n\t}\n\t\n public static void main(String[] args) {\n \tScanner sc = new Scanner(System.in);\n \t\n \tint n = sc.nextInt();\n \t\n \tint[] box = new int[n];\n \t\n \tfor(int i=0;i<n;i++) {\n \t\tbox[i] = sc.nextInt();\n \t}\n \t\n \tSystem.out.println(Pm(box));\n \t\n }\n}",
"public class Main {\n\t\n\tpublic static int Pm(int[] A) {\n\t\t\n\t\tint count = 0;\n\t\t\n\t\tfor(int i=0;i<A.length;i++) {\n\t\t\tboolean NumberF = true;\n\t\t\tfor(int j=2;j<= Math.sqrt(A[i]);j++) {\n\t\t\t\t\n\t\t\t\tif(A[i] < 2) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] == 2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(A[i] % 2 == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A[i] % j == 0) {\n\t\t\t\t\tNumberF = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif(NumberF) count++;\n\t\t}\n\t\t\n\t\treturn count;\n\t\t\n\t}\n\t\n public static void main(String[] args) {\n \tScanner sc = new Scanner(System.in);\n \t\n \tint n = sc.nextInt();\n \t\n \tint[] box = new int[n];\n \t\n \tfor(int i=0;i<n;i++) {\n \t\tbox[i] = sc.nextInt();\n \t}\n \t\n \tSystem.out.println(Pm(box));\n \t\n }\n}",
"Main"
] | import java.util.Scanner;
public class Main {
public static int Pm(int[] A) {
int count = 0;
for(int i=0;i<A.length;i++) {
boolean NumberF = true;
for(int j=2;j<= Math.sqrt(A[i]);j++) {
if(A[i] < 2) {
NumberF = false;
break;
}else if(A[i] == 2) {
break;
}else if(A[i] % 2 == 0) {
NumberF = false;
break;
}
if(A[i] % j == 0) {
NumberF = false;
break;
}
}
if(NumberF) count++;
}
return count;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] box = new int[n];
for(int i=0;i<n;i++) {
box[i] = sc.nextInt();
}
System.out.println(Pm(box));
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
41,
13,
4,
18,
13,
14,
2,
13,
17,
30,
0,
13,
17,
14,
2,
2,
13,
17,
17,
30,
41,
13,
4,
18,
13,
13,
11,
1,
41,
13,
13,
2,
13,
17,
1,
40,
13,
30,
30,
0,
13,
2,
13,
13,
14,
2,
13,
17,
30,
0,
13,
17,
3,
14,
2,
13,
17,
30,
0,
13,
17,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
109,
5
],
[
109,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
20
],
[
20,
21
],
[
20,
22
],
[
8,
23
],
[
23,
24
],
[
24,
25
],
[
25,
26
],
[
25,
27
],
[
23,
28
],
[
28,
29
],
[
28,
30
],
[
23,
31
],
[
31,
32
],
[
32,
33
],
[
23,
34
],
[
35,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
35,
39
],
[
39,
40
],
[
39,
41
],
[
41,
42
],
[
42,
43
],
[
35,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
44,
48
],
[
48,
49
],
[
49,
50
],
[
49,
51
],
[
44,
52
],
[
52,
53
],
[
53,
54
],
[
54,
55
],
[
54,
56
],
[
53,
57
],
[
52,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
61,
62
],
[
62,
63
],
[
61,
64
],
[
58,
65
],
[
65,
66
],
[
66,
67
],
[
67,
68
],
[
67,
69
],
[
65,
70
],
[
70,
71
],
[
70,
72
],
[
65,
73
],
[
73,
74
],
[
74,
75
],
[
65,
76
],
[
77,
77
],
[
77,
78
],
[
78,
79
],
[
78,
80
],
[
80,
81
],
[
80,
82
],
[
77,
83
],
[
83,
84
],
[
84,
85
],
[
84,
86
],
[
83,
87
],
[
87,
88
],
[
88,
89
],
[
88,
90
],
[
87,
91
],
[
58,
92
],
[
92,
93
],
[
93,
94
],
[
93,
95
],
[
92,
96
],
[
96,
97
],
[
97,
98
],
[
97,
99
],
[
8,
100
],
[
100,
101
],
[
101,
102
],
[
102,
103
],
[
102,
104
],
[
100,
105
],
[
6,
106
],
[
106,
107
],
[
0,
108
],
[
108,
109
],
[
108,
110
]
] | [
"import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tint count = 0;\n\t\tint y = 0;\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tint z = 0;\n\t\t\tint x = scanner.nextInt();\n\t\t\tif (x == 2) {\n\t\t\t\tcount += 1;\n\t\t\t} else if (x % 2 == 1) {\n\t\t\t\tdouble xx = Math.sqrt((double)x);\n\t\t\t\tfor (int i = (int)xx; i >= 3; i--) {\n\t\t\t\t\ty = x % i;\n\t\t\t\t\tif (y == 0) {\n\t\t\t\t\t\tz += 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (z == 0) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tint count = 0;\n\t\tint y = 0;\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tint z = 0;\n\t\t\tint x = scanner.nextInt();\n\t\t\tif (x == 2) {\n\t\t\t\tcount += 1;\n\t\t\t} else if (x % 2 == 1) {\n\t\t\t\tdouble xx = Math.sqrt((double)x);\n\t\t\t\tfor (int i = (int)xx; i >= 3; i--) {\n\t\t\t\t\ty = x % i;\n\t\t\t\t\tif (y == 0) {\n\t\t\t\t\t\tz += 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (z == 0) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tint count = 0;\n\t\tint y = 0;\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tint z = 0;\n\t\t\tint x = scanner.nextInt();\n\t\t\tif (x == 2) {\n\t\t\t\tcount += 1;\n\t\t\t} else if (x % 2 == 1) {\n\t\t\t\tdouble xx = Math.sqrt((double)x);\n\t\t\t\tfor (int i = (int)xx; i >= 3; i--) {\n\t\t\t\t\ty = x % i;\n\t\t\t\t\tif (y == 0) {\n\t\t\t\t\t\tz += 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (z == 0) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"main",
"{\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tint count = 0;\n\t\tint y = 0;\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tint z = 0;\n\t\t\tint x = scanner.nextInt();\n\t\t\tif (x == 2) {\n\t\t\t\tcount += 1;\n\t\t\t} else if (x % 2 == 1) {\n\t\t\t\tdouble xx = Math.sqrt((double)x);\n\t\t\t\tfor (int i = (int)xx; i >= 3; i--) {\n\t\t\t\t\ty = x % i;\n\t\t\t\t\tif (y == 0) {\n\t\t\t\t\t\tz += 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (z == 0) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"Scanner scanner = new Scanner(System.in);",
"scanner",
"new Scanner(System.in)",
"int n = scanner.nextInt();",
"n",
"scanner.nextInt()",
"scanner.nextInt",
"scanner",
"int count = 0;",
"count",
"0",
"int y = 0;",
"y",
"0",
"for (int j = 0; j < n; j++) {\n\t\t\tint z = 0;\n\t\t\tint x = scanner.nextInt();\n\t\t\tif (x == 2) {\n\t\t\t\tcount += 1;\n\t\t\t} else if (x % 2 == 1) {\n\t\t\t\tdouble xx = Math.sqrt((double)x);\n\t\t\t\tfor (int i = (int)xx; i >= 3; i--) {\n\t\t\t\t\ty = x % i;\n\t\t\t\t\tif (y == 0) {\n\t\t\t\t\t\tz += 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (z == 0) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < n",
"j",
"n",
"j++",
"j++",
"j",
"{\n\t\t\tint z = 0;\n\t\t\tint x = scanner.nextInt();\n\t\t\tif (x == 2) {\n\t\t\t\tcount += 1;\n\t\t\t} else if (x % 2 == 1) {\n\t\t\t\tdouble xx = Math.sqrt((double)x);\n\t\t\t\tfor (int i = (int)xx; i >= 3; i--) {\n\t\t\t\t\ty = x % i;\n\t\t\t\t\tif (y == 0) {\n\t\t\t\t\t\tz += 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (z == 0) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"{\n\t\t\tint z = 0;\n\t\t\tint x = scanner.nextInt();\n\t\t\tif (x == 2) {\n\t\t\t\tcount += 1;\n\t\t\t} else if (x % 2 == 1) {\n\t\t\t\tdouble xx = Math.sqrt((double)x);\n\t\t\t\tfor (int i = (int)xx; i >= 3; i--) {\n\t\t\t\t\ty = x % i;\n\t\t\t\t\tif (y == 0) {\n\t\t\t\t\t\tz += 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (z == 0) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"int z = 0;",
"z",
"0",
"int x = scanner.nextInt();",
"x",
"scanner.nextInt()",
"scanner.nextInt",
"scanner",
"if (x == 2) {\n\t\t\t\tcount += 1;\n\t\t\t} else if (x % 2 == 1) {\n\t\t\t\tdouble xx = Math.sqrt((double)x);\n\t\t\t\tfor (int i = (int)xx; i >= 3; i--) {\n\t\t\t\t\ty = x % i;\n\t\t\t\t\tif (y == 0) {\n\t\t\t\t\t\tz += 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (z == 0) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t}\n\t\t\t}",
"x == 2",
"x",
"2",
"{\n\t\t\t\tcount += 1;\n\t\t\t}",
"count += 1",
"count",
"1",
"if (x % 2 == 1) {\n\t\t\t\tdouble xx = Math.sqrt((double)x);\n\t\t\t\tfor (int i = (int)xx; i >= 3; i--) {\n\t\t\t\t\ty = x % i;\n\t\t\t\t\tif (y == 0) {\n\t\t\t\t\t\tz += 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (z == 0) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t}\n\t\t\t}",
"x % 2 == 1",
"x % 2",
"x",
"2",
"1",
"{\n\t\t\t\tdouble xx = Math.sqrt((double)x);\n\t\t\t\tfor (int i = (int)xx; i >= 3; i--) {\n\t\t\t\t\ty = x % i;\n\t\t\t\t\tif (y == 0) {\n\t\t\t\t\t\tz += 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (z == 0) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t}\n\t\t\t}",
"double xx = Math.sqrt((double)x);",
"xx",
"Math.sqrt((double)x)",
"Math.sqrt",
"Math",
"(double)x",
"for (int i = (int)xx; i >= 3; i--) {\n\t\t\t\t\ty = x % i;\n\t\t\t\t\tif (y == 0) {\n\t\t\t\t\t\tz += 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}",
"int i = (int)xx;",
"int i = (int)xx;",
"i",
"(int)xx",
"i >= 3",
"i",
"3",
"i--",
"i--",
"i",
"{\n\t\t\t\t\ty = x % i;\n\t\t\t\t\tif (y == 0) {\n\t\t\t\t\t\tz += 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}",
"{\n\t\t\t\t\ty = x % i;\n\t\t\t\t\tif (y == 0) {\n\t\t\t\t\t\tz += 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}",
"y = x % i",
"y",
"x % i",
"x",
"i",
"if (y == 0) {\n\t\t\t\t\t\tz += 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}",
"y == 0",
"y",
"0",
"{\n\t\t\t\t\t\tz += 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}",
"z += 1",
"z",
"1",
"break;",
"if (z == 0) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t}",
"z == 0",
"z",
"0",
"{\n\t\t\t\t\tcount += 1;\n\t\t\t\t}",
"count += 1",
"count",
"1",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tint count = 0;\n\t\tint y = 0;\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tint z = 0;\n\t\t\tint x = scanner.nextInt();\n\t\t\tif (x == 2) {\n\t\t\t\tcount += 1;\n\t\t\t} else if (x % 2 == 1) {\n\t\t\t\tdouble xx = Math.sqrt((double)x);\n\t\t\t\tfor (int i = (int)xx; i >= 3; i--) {\n\t\t\t\t\ty = x % i;\n\t\t\t\t\tif (y == 0) {\n\t\t\t\t\t\tz += 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (z == 0) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tint count = 0;\n\t\tint y = 0;\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tint z = 0;\n\t\t\tint x = scanner.nextInt();\n\t\t\tif (x == 2) {\n\t\t\t\tcount += 1;\n\t\t\t} else if (x % 2 == 1) {\n\t\t\t\tdouble xx = Math.sqrt((double)x);\n\t\t\t\tfor (int i = (int)xx; i >= 3; i--) {\n\t\t\t\t\ty = x % i;\n\t\t\t\t\tif (y == 0) {\n\t\t\t\t\t\tz += 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (z == 0) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}",
"Main"
] | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int count = 0;
int y = 0;
for (int j = 0; j < n; j++) {
int z = 0;
int x = scanner.nextInt();
if (x == 2) {
count += 1;
} else if (x % 2 == 1) {
double xx = Math.sqrt((double)x);
for (int i = (int)xx; i >= 3; i--) {
y = x % i;
if (y == 0) {
z += 1;
break;
}
}
if (z == 0) {
count += 1;
}
}
}
System.out.println(count);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
14,
2,
13,
17,
29,
17,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
17,
29,
17,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
0,
13,
17,
30,
14,
2,
2,
13,
13,
17,
29,
17,
29,
17,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
41,
13,
17,
41,
13,
17,
42,
2,
13,
13,
30,
41,
13,
4,
18,
13,
4,
18,
13,
14,
4,
13,
13,
40,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
10,
11
],
[
10,
12
],
[
9,
13
],
[
13,
14
],
[
9,
15
],
[
15,
16
],
[
16,
17
],
[
16,
18
],
[
15,
19
],
[
19,
20
],
[
15,
21
],
[
21,
22
],
[
22,
23
],
[
23,
24
],
[
23,
25
],
[
22,
26
],
[
21,
27
],
[
27,
28
],
[
8,
29
],
[
29,
30
],
[
30,
31
],
[
31,
32
],
[
31,
33
],
[
29,
34
],
[
34,
35
],
[
35,
36
],
[
35,
37
],
[
34,
38
],
[
29,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
29,
43
],
[
43,
44
],
[
44,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
45,
49
],
[
44,
50
],
[
50,
51
],
[
8,
52
],
[
52,
53
],
[
6,
54
],
[
54,
55
],
[
4,
56
],
[
56,
57
],
[
56,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
58,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
65,
66
],
[
64,
67
],
[
67,
68
],
[
68,
69
],
[
58,
70
],
[
70,
71
],
[
70,
72
],
[
58,
73
],
[
73,
74
],
[
73,
75
],
[
58,
76
],
[
76,
77
],
[
76,
78
],
[
58,
79
],
[
79,
80
],
[
80,
81
],
[
80,
82
],
[
79,
83
],
[
83,
84
],
[
84,
85
],
[
84,
86
],
[
86,
87
],
[
87,
88
],
[
86,
89
],
[
89,
90
],
[
90,
91
],
[
83,
92
],
[
92,
93
],
[
93,
94
],
[
93,
95
],
[
92,
96
],
[
96,
97
],
[
83,
98
],
[
98,
99
],
[
58,
100
],
[
100,
101
],
[
101,
102
],
[
102,
103
],
[
102,
104
],
[
100,
105
],
[
56,
106
],
[
106,
107
]
] | [
"import java.io.*;\n\nclass Main{\n static boolean isPrime(int r){\n if(r<2)\n return false;\n else if(r == 2)\n return true;\n else if(r%2 ==0)\n return false;\n for(int i=3; i*i<=r; i+=2)\n if(r%i == 0)\n return false;\n return true;\n }\n\n public static void main(String[] args) throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int N = Integer.parseInt(br.readLine());\n int i = 0;\n int count = 0;\n boolean isPrime = false;\n while(i<N){\n int r = Integer.parseInt(br.readLine());\n if(isPrime(r))\n count++;\n i++;\n }\n System.out.println(count);\n }\n}",
"import java.io.*;",
"io.*",
"java",
"class Main{\n static boolean isPrime(int r){\n if(r<2)\n return false;\n else if(r == 2)\n return true;\n else if(r%2 ==0)\n return false;\n for(int i=3; i*i<=r; i+=2)\n if(r%i == 0)\n return false;\n return true;\n }\n\n public static void main(String[] args) throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int N = Integer.parseInt(br.readLine());\n int i = 0;\n int count = 0;\n boolean isPrime = false;\n while(i<N){\n int r = Integer.parseInt(br.readLine());\n if(isPrime(r))\n count++;\n i++;\n }\n System.out.println(count);\n }\n}",
"Main",
"static boolean isPrime(int r){\n if(r<2)\n return false;\n else if(r == 2)\n return true;\n else if(r%2 ==0)\n return false;\n for(int i=3; i*i<=r; i+=2)\n if(r%i == 0)\n return false;\n return true;\n }",
"isPrime",
"{\n if(r<2)\n return false;\n else if(r == 2)\n return true;\n else if(r%2 ==0)\n return false;\n for(int i=3; i*i<=r; i+=2)\n if(r%i == 0)\n return false;\n return true;\n }",
"if(r<2)\n return false;\n else if(r == 2)\n return true;\n else if(r%2 ==0)\n return false;",
"r<2",
"r",
"2",
"return false;",
"false",
"if(r == 2)\n return true;\n else if(r%2 ==0)\n return false;",
"r == 2",
"r",
"2",
"return true;",
"true",
"if(r%2 ==0)\n return false;",
"r%2 ==0",
"r%2",
"r",
"2",
"0",
"return false;",
"false",
"for(int i=3; i*i<=r; i+=2)\n if(r%i == 0)\n return false;",
"int i=3;",
"int i=3;",
"i",
"3",
"i*i<=r",
"i*i",
"i",
"i",
"r",
"i+=2",
"i+=2",
"i",
"2",
"if(r%i == 0)\n return false;",
"if(r%i == 0)\n return false;",
"r%i == 0",
"r%i",
"r",
"i",
"0",
"return false;",
"false",
"return true;",
"true",
"int r",
"r",
"public static void main(String[] args) throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int N = Integer.parseInt(br.readLine());\n int i = 0;\n int count = 0;\n boolean isPrime = false;\n while(i<N){\n int r = Integer.parseInt(br.readLine());\n if(isPrime(r))\n count++;\n i++;\n }\n System.out.println(count);\n }",
"main",
"{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int N = Integer.parseInt(br.readLine());\n int i = 0;\n int count = 0;\n boolean isPrime = false;\n while(i<N){\n int r = Integer.parseInt(br.readLine());\n if(isPrime(r))\n count++;\n i++;\n }\n System.out.println(count);\n }",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"int N = Integer.parseInt(br.readLine());",
"N",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"int i = 0;",
"i",
"0",
"int count = 0;",
"count",
"0",
"boolean isPrime = false;",
"isPrime",
"false",
"while(i<N){\n int r = Integer.parseInt(br.readLine());\n if(isPrime(r))\n count++;\n i++;\n }",
"i<N",
"i",
"N",
"{\n int r = Integer.parseInt(br.readLine());\n if(isPrime(r))\n count++;\n i++;\n }",
"int r = Integer.parseInt(br.readLine());",
"r",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"if(isPrime(r))\n count++;",
"isPrime(r)",
"isPrime",
"r",
"count++",
"count",
"i++",
"i",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args"
] | 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(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.readLine());
int i = 0;
int count = 0;
boolean isPrime = false;
while(i<N){
int r = Integer.parseInt(br.readLine());
if(isPrime(r))
count++;
i++;
}
System.out.println(count);
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
20,
4,
18,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
13,
17,
30,
9,
14,
2,
2,
2,
2,
18,
13,
13,
17,
2,
18,
13,
13,
17,
2,
18,
13,
13,
17,
2,
18,
13,
13,
17,
30,
40,
13,
9,
11,
1,
41,
13,
17,
2,
2,
13,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
18,
13,
13,
13,
17,
30,
0,
13,
17,
3,
0,
13,
17,
14,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
156,
11
],
[
156,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
14,
18
],
[
18,
19
],
[
18,
20
],
[
21,
22
],
[
22,
23
],
[
21,
24
],
[
24,
25
],
[
25,
26
],
[
14,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
29,
31
],
[
27,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
34,
36
],
[
27,
37
],
[
37,
38
],
[
38,
39
],
[
27,
40
],
[
41,
41
],
[
41,
42
],
[
42,
43
],
[
43,
44
],
[
43,
45
],
[
42,
46
],
[
46,
47
],
[
47,
48
],
[
46,
49
],
[
49,
50
],
[
50,
51
],
[
14,
52
],
[
52,
53
],
[
52,
54
],
[
14,
55
],
[
55,
56
],
[
55,
57
],
[
14,
58
],
[
58,
59
],
[
59,
60
],
[
60,
61
],
[
60,
62
],
[
58,
63
],
[
63,
64
],
[
63,
65
],
[
65,
66
],
[
65,
67
],
[
58,
68
],
[
68,
69
],
[
69,
70
],
[
58,
71
],
[
72,
72
],
[
72,
73
],
[
73,
74
],
[
74,
75
],
[
75,
76
],
[
75,
77
],
[
74,
78
],
[
73,
79
],
[
79,
80
],
[
72,
81
],
[
81,
82
],
[
84,
83
],
[
95,
84
],
[
84,
85
],
[
85,
86
],
[
86,
87
],
[
86,
88
],
[
85,
89
],
[
84,
90
],
[
90,
91
],
[
91,
92
],
[
91,
93
],
[
90,
94
],
[
95,
95
],
[
95,
96
],
[
96,
97
],
[
96,
98
],
[
95,
99
],
[
84,
100
],
[
100,
101
],
[
101,
102
],
[
101,
103
],
[
100,
104
],
[
81,
105
],
[
105,
106
],
[
106,
107
],
[
105,
108
],
[
72,
109
],
[
109,
110
],
[
110,
111
],
[
111,
112
],
[
111,
113
],
[
109,
114
],
[
114,
115
],
[
115,
116
],
[
115,
117
],
[
114,
118
],
[
118,
119
],
[
118,
120
],
[
109,
121
],
[
121,
122
],
[
122,
123
],
[
109,
124
],
[
125,
125
],
[
125,
126
],
[
126,
127
],
[
127,
128
],
[
128,
129
],
[
129,
130
],
[
129,
131
],
[
128,
132
],
[
127,
133
],
[
126,
134
],
[
134,
135
],
[
135,
136
],
[
135,
137
],
[
134,
138
],
[
125,
139
],
[
139,
140
],
[
139,
141
],
[
72,
142
],
[
142,
143
],
[
142,
144
],
[
144,
145
],
[
145,
146
],
[
14,
147
],
[
147,
148
],
[
148,
149
],
[
149,
150
],
[
149,
151
],
[
147,
152
],
[
12,
153
],
[
153,
154
],
[
0,
155
],
[
155,
156
],
[
155,
157
]
] | [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\tpublic static void main(String args[]) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint[] numArray = new int[Integer.parseInt(br.readLine())];\n\t\tfor (int i = 0; i < numArray.length; i++) {\n\t\t\tnumArray[i] = Integer.parseInt(br.readLine());\n\t\t}\n\n\t\t// ?卒???属???????????????\n\t\tint count = 0;\n\t\tboolean isPrime = false;\n\t\tfor (int i = 0; i < numArray.length; i++) {\n\t\t\tif (numArray[i] == 1) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (numArray[i] == 2 || numArray[i] == 3 || numArray[i] == 5\n\t\t\t\t\t|| numArray[i] == 7) {\n\t\t\t\tcount++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int j = 2; j * j <= numArray[i]; j++) {\n\t\t\t\tif ((numArray[i] % j) == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tisPrime = true;\n\t\t\t}\n\t\t\tif (isPrime) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\t}\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"public class Main {\n\n\tpublic static void main(String args[]) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint[] numArray = new int[Integer.parseInt(br.readLine())];\n\t\tfor (int i = 0; i < numArray.length; i++) {\n\t\t\tnumArray[i] = Integer.parseInt(br.readLine());\n\t\t}\n\n\t\t// ?卒???属???????????????\n\t\tint count = 0;\n\t\tboolean isPrime = false;\n\t\tfor (int i = 0; i < numArray.length; i++) {\n\t\t\tif (numArray[i] == 1) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (numArray[i] == 2 || numArray[i] == 3 || numArray[i] == 5\n\t\t\t\t\t|| numArray[i] == 7) {\n\t\t\t\tcount++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int j = 2; j * j <= numArray[i]; j++) {\n\t\t\t\tif ((numArray[i] % j) == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tisPrime = true;\n\t\t\t}\n\t\t\tif (isPrime) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\t}\n}",
"Main",
"public static void main(String args[]) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint[] numArray = new int[Integer.parseInt(br.readLine())];\n\t\tfor (int i = 0; i < numArray.length; i++) {\n\t\t\tnumArray[i] = Integer.parseInt(br.readLine());\n\t\t}\n\n\t\t// ?卒???属???????????????\n\t\tint count = 0;\n\t\tboolean isPrime = false;\n\t\tfor (int i = 0; i < numArray.length; i++) {\n\t\t\tif (numArray[i] == 1) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (numArray[i] == 2 || numArray[i] == 3 || numArray[i] == 5\n\t\t\t\t\t|| numArray[i] == 7) {\n\t\t\t\tcount++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int j = 2; j * j <= numArray[i]; j++) {\n\t\t\t\tif ((numArray[i] % j) == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tisPrime = true;\n\t\t\t}\n\t\t\tif (isPrime) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\t}",
"main",
"{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint[] numArray = new int[Integer.parseInt(br.readLine())];\n\t\tfor (int i = 0; i < numArray.length; i++) {\n\t\t\tnumArray[i] = Integer.parseInt(br.readLine());\n\t\t}\n\n\t\t// ?卒???属???????????????\n\t\tint count = 0;\n\t\tboolean isPrime = false;\n\t\tfor (int i = 0; i < numArray.length; i++) {\n\t\t\tif (numArray[i] == 1) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (numArray[i] == 2 || numArray[i] == 3 || numArray[i] == 5\n\t\t\t\t\t|| numArray[i] == 7) {\n\t\t\t\tcount++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int j = 2; j * j <= numArray[i]; j++) {\n\t\t\t\tif ((numArray[i] % j) == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tisPrime = true;\n\t\t\t}\n\t\t\tif (isPrime) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\t}",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"int[] numArray = new int[Integer.parseInt(br.readLine())];",
"numArray",
"new int[Integer.parseInt(br.readLine())]",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"for (int i = 0; i < numArray.length; i++) {\n\t\t\tnumArray[i] = Integer.parseInt(br.readLine());\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < numArray.length",
"i",
"numArray.length",
"numArray",
"numArray.length",
"i++",
"i++",
"i",
"{\n\t\t\tnumArray[i] = Integer.parseInt(br.readLine());\n\t\t}",
"{\n\t\t\tnumArray[i] = Integer.parseInt(br.readLine());\n\t\t}",
"numArray[i] = Integer.parseInt(br.readLine())",
"numArray[i]",
"numArray",
"i",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"int count = 0;",
"count",
"0",
"boolean isPrime = false;",
"isPrime",
"false",
"for (int i = 0; i < numArray.length; i++) {\n\t\t\tif (numArray[i] == 1) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (numArray[i] == 2 || numArray[i] == 3 || numArray[i] == 5\n\t\t\t\t\t|| numArray[i] == 7) {\n\t\t\t\tcount++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int j = 2; j * j <= numArray[i]; j++) {\n\t\t\t\tif ((numArray[i] % j) == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tisPrime = true;\n\t\t\t}\n\t\t\tif (isPrime) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < numArray.length",
"i",
"numArray.length",
"numArray",
"numArray.length",
"i++",
"i++",
"i",
"{\n\t\t\tif (numArray[i] == 1) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (numArray[i] == 2 || numArray[i] == 3 || numArray[i] == 5\n\t\t\t\t\t|| numArray[i] == 7) {\n\t\t\t\tcount++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int j = 2; j * j <= numArray[i]; j++) {\n\t\t\t\tif ((numArray[i] % j) == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tisPrime = true;\n\t\t\t}\n\t\t\tif (isPrime) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"{\n\t\t\tif (numArray[i] == 1) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (numArray[i] == 2 || numArray[i] == 3 || numArray[i] == 5\n\t\t\t\t\t|| numArray[i] == 7) {\n\t\t\t\tcount++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int j = 2; j * j <= numArray[i]; j++) {\n\t\t\t\tif ((numArray[i] % j) == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tisPrime = true;\n\t\t\t}\n\t\t\tif (isPrime) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"if (numArray[i] == 1) {\n\t\t\t\tcontinue;\n\t\t\t}",
"numArray[i] == 1",
"numArray[i]",
"numArray",
"i",
"1",
"{\n\t\t\t\tcontinue;\n\t\t\t}",
"continue;",
"if (numArray[i] == 2 || numArray[i] == 3 || numArray[i] == 5\n\t\t\t\t\t|| numArray[i] == 7) {\n\t\t\t\tcount++;\n\t\t\t\tcontinue;\n\t\t\t}",
"numArray[i] == 2 || numArray[i] == 3 || numArray[i] == 5\n\t\t\t\t\t|| numArray[i] == 7",
"numArray[i] == 5",
"numArray[i] == 2 || numArray[i] == 3 || numArray[i] == 5\n\t\t\t\t\t|| numArray[i] == 7",
"numArray[i] == 2",
"numArray[i]",
"numArray",
"i",
"2",
"numArray[i] == 3",
"numArray[i]",
"numArray",
"i",
"3",
"numArray[i] == 5",
"numArray[i]",
"numArray",
"i",
"5",
"numArray[i] == 7",
"numArray[i]",
"numArray",
"i",
"7",
"{\n\t\t\t\tcount++;\n\t\t\t\tcontinue;\n\t\t\t}",
"count++",
"count",
"continue;",
"for (int j = 2; j * j <= numArray[i]; j++) {\n\t\t\t\tif ((numArray[i] % j) == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tisPrime = true;\n\t\t\t}",
"int j = 2;",
"int j = 2;",
"j",
"2",
"j * j <= numArray[i]",
"j * j",
"j",
"j",
"numArray[i]",
"numArray",
"i",
"j++",
"j++",
"j",
"{\n\t\t\t\tif ((numArray[i] % j) == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tisPrime = true;\n\t\t\t}",
"{\n\t\t\t\tif ((numArray[i] % j) == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tisPrime = true;\n\t\t\t}",
"if ((numArray[i] % j) == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"(numArray[i] % j) == 0",
"(numArray[i] % j)",
"numArray[i]",
"numArray",
"i",
"j",
"0",
"{\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"isPrime = false",
"isPrime",
"false",
"break;",
"isPrime = true",
"isPrime",
"true",
"if (isPrime) {\n\t\t\t\tcount++;\n\t\t\t}",
"isPrime",
"{\n\t\t\t\tcount++;\n\t\t\t}",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String args[]",
"args",
"public class Main {\n\n\tpublic static void main(String args[]) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint[] numArray = new int[Integer.parseInt(br.readLine())];\n\t\tfor (int i = 0; i < numArray.length; i++) {\n\t\t\tnumArray[i] = Integer.parseInt(br.readLine());\n\t\t}\n\n\t\t// ?卒???属???????????????\n\t\tint count = 0;\n\t\tboolean isPrime = false;\n\t\tfor (int i = 0; i < numArray.length; i++) {\n\t\t\tif (numArray[i] == 1) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (numArray[i] == 2 || numArray[i] == 3 || numArray[i] == 5\n\t\t\t\t\t|| numArray[i] == 7) {\n\t\t\t\tcount++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int j = 2; j * j <= numArray[i]; j++) {\n\t\t\t\tif ((numArray[i] % j) == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tisPrime = true;\n\t\t\t}\n\t\t\tif (isPrime) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\t}\n}",
"public class Main {\n\n\tpublic static void main(String args[]) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint[] numArray = new int[Integer.parseInt(br.readLine())];\n\t\tfor (int i = 0; i < numArray.length; i++) {\n\t\t\tnumArray[i] = Integer.parseInt(br.readLine());\n\t\t}\n\n\t\t// ?卒???属???????????????\n\t\tint count = 0;\n\t\tboolean isPrime = false;\n\t\tfor (int i = 0; i < numArray.length; i++) {\n\t\t\tif (numArray[i] == 1) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (numArray[i] == 2 || numArray[i] == 3 || numArray[i] == 5\n\t\t\t\t\t|| numArray[i] == 7) {\n\t\t\t\tcount++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int j = 2; j * j <= numArray[i]; j++) {\n\t\t\t\tif ((numArray[i] % j) == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tisPrime = true;\n\t\t\t}\n\t\t\tif (isPrime) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\t}\n}",
"Main"
] | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String args[]) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int[] numArray = new int[Integer.parseInt(br.readLine())];
for (int i = 0; i < numArray.length; i++) {
numArray[i] = Integer.parseInt(br.readLine());
}
// ?卒???属???????????????
int count = 0;
boolean isPrime = false;
for (int i = 0; i < numArray.length; i++) {
if (numArray[i] == 1) {
continue;
}
if (numArray[i] == 2 || numArray[i] == 3 || numArray[i] == 5
|| numArray[i] == 7) {
count++;
continue;
}
for (int j = 2; j * j <= numArray[i]; j++) {
if ((numArray[i] % j) == 0) {
isPrime = false;
break;
}
isPrime = true;
}
if (isPrime) {
count++;
}
}
System.out.println(count);
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
4,
18,
13,
14,
4,
13,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
17,
14,
2,
2,
13,
17,
2,
2,
13,
17,
17,
30,
29,
17,
41,
13,
17,
42,
2,
13,
4,
18,
13,
13,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
0,
13,
17,
29,
17,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
8,
19
],
[
19,
20
],
[
19,
21
],
[
8,
22
],
[
22,
23
],
[
23,
24
],
[
24,
25
],
[
24,
26
],
[
22,
27
],
[
27,
28
],
[
27,
29
],
[
22,
30
],
[
30,
31
],
[
31,
32
],
[
22,
33
],
[
34,
34
],
[
34,
35
],
[
35,
36
],
[
35,
37
],
[
37,
38
],
[
38,
39
],
[
34,
40
],
[
40,
41
],
[
41,
42
],
[
41,
43
],
[
40,
44
],
[
44,
45
],
[
8,
46
],
[
46,
47
],
[
47,
48
],
[
48,
49
],
[
48,
50
],
[
46,
51
],
[
6,
52
],
[
52,
53
],
[
4,
54
],
[
54,
55
],
[
54,
56
],
[
56,
57
],
[
57,
58
],
[
58,
59
],
[
58,
60
],
[
57,
61
],
[
61,
62
],
[
62,
63
],
[
56,
64
],
[
64,
65
],
[
65,
66
],
[
66,
67
],
[
66,
68
],
[
65,
69
],
[
69,
70
],
[
70,
71
],
[
70,
72
],
[
69,
73
],
[
64,
74
],
[
74,
75
],
[
75,
76
],
[
56,
77
],
[
77,
78
],
[
77,
79
],
[
56,
80
],
[
80,
81
],
[
81,
82
],
[
81,
83
],
[
83,
84
],
[
84,
85
],
[
83,
86
],
[
80,
87
],
[
87,
88
],
[
88,
89
],
[
89,
90
],
[
90,
91
],
[
90,
92
],
[
89,
93
],
[
88,
94
],
[
94,
95
],
[
95,
96
],
[
87,
97
],
[
97,
98
],
[
97,
99
],
[
56,
100
],
[
100,
101
],
[
54,
102
],
[
102,
103
]
] | [
"import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String args[]){\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint n = scan.nextInt();\n\t\tint x;\n\t\tint ans = 0;\n\t\t\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tx = scan.nextInt();\n\t\t\tif(isprime(x))ans++;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\t\n\tpublic static boolean isprime(int x){\n\t\tif(x == 2){\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tif(x < 2 || x % 2 == 0){\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tint i = 3;\n\t\twhile(i <= Math.sqrt(x)){\n\t\t\tif(x % i == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti += 2;\n\t\t}\n\t\t\n\t\treturn true;\n\t}\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"class Main {\n\tpublic static void main(String args[]){\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint n = scan.nextInt();\n\t\tint x;\n\t\tint ans = 0;\n\t\t\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tx = scan.nextInt();\n\t\t\tif(isprime(x))ans++;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\t\n\tpublic static boolean isprime(int x){\n\t\tif(x == 2){\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tif(x < 2 || x % 2 == 0){\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tint i = 3;\n\t\twhile(i <= Math.sqrt(x)){\n\t\t\tif(x % i == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti += 2;\n\t\t}\n\t\t\n\t\treturn true;\n\t}\n}",
"Main",
"public static void main(String args[]){\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint n = scan.nextInt();\n\t\tint x;\n\t\tint ans = 0;\n\t\t\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tx = scan.nextInt();\n\t\t\tif(isprime(x))ans++;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}",
"main",
"{\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint n = scan.nextInt();\n\t\tint x;\n\t\tint ans = 0;\n\t\t\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tx = scan.nextInt();\n\t\t\tif(isprime(x))ans++;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}",
"Scanner scan = new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"int n = scan.nextInt();",
"n",
"scan.nextInt()",
"scan.nextInt",
"scan",
"int x;",
"x",
"int ans = 0;",
"ans",
"0",
"for(int i = 0; i < n; i++){\n\t\t\tx = scan.nextInt();\n\t\t\tif(isprime(x))ans++;\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tx = scan.nextInt();\n\t\t\tif(isprime(x))ans++;\n\t\t}",
"{\n\t\t\tx = scan.nextInt();\n\t\t\tif(isprime(x))ans++;\n\t\t}",
"x = scan.nextInt()",
"x",
"scan.nextInt()",
"scan.nextInt",
"scan",
"if(isprime(x))ans++;",
"isprime(x)",
"isprime",
"x",
"ans++",
"ans",
"System.out.println(ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"ans",
"String args[]",
"args",
"public static boolean isprime(int x){\n\t\tif(x == 2){\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tif(x < 2 || x % 2 == 0){\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tint i = 3;\n\t\twhile(i <= Math.sqrt(x)){\n\t\t\tif(x % i == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti += 2;\n\t\t}\n\t\t\n\t\treturn true;\n\t}",
"isprime",
"{\n\t\tif(x == 2){\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tif(x < 2 || x % 2 == 0){\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tint i = 3;\n\t\twhile(i <= Math.sqrt(x)){\n\t\t\tif(x % i == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti += 2;\n\t\t}\n\t\t\n\t\treturn true;\n\t}",
"if(x == 2){\n\t\t\treturn true;\n\t\t}",
"x == 2",
"x",
"2",
"{\n\t\t\treturn true;\n\t\t}",
"return true;",
"true",
"if(x < 2 || x % 2 == 0){\n\t\t\treturn false;\n\t\t}",
"x < 2 || x % 2 == 0",
"x < 2",
"x",
"2",
"x % 2 == 0",
"x % 2",
"x",
"2",
"0",
"{\n\t\t\treturn false;\n\t\t}",
"return false;",
"false",
"int i = 3;",
"i",
"3",
"while(i <= Math.sqrt(x)){\n\t\t\tif(x % i == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti += 2;\n\t\t}",
"i <= Math.sqrt(x)",
"i",
"Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"{\n\t\t\tif(x % i == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti += 2;\n\t\t}",
"if(x % i == 0){\n\t\t\t\treturn false;\n\t\t\t}",
"x % i == 0",
"x % i",
"x",
"i",
"0",
"{\n\t\t\t\treturn false;\n\t\t\t}",
"return false;",
"false",
"i += 2",
"i",
"2",
"return true;",
"true",
"int x",
"x"
] | import java.util.Scanner;
class Main {
public static void main(String args[]){
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int x;
int ans = 0;
for(int i = 0; i < n; i++){
x = scan.nextInt();
if(isprime(x))ans++;
}
System.out.println(ans);
}
public static boolean isprime(int x){
if(x == 2){
return true;
}
if(x < 2 || x % 2 == 0){
return false;
}
int i = 3;
while(i <= Math.sqrt(x)){
if(x % i == 0){
return false;
}
i += 2;
}
return true;
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
4,
18,
13,
14,
4,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
2,
13,
17,
23,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
17,
14,
2,
2,
13,
17,
2,
2,
13,
17,
17,
30,
29,
17,
30,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
13,
1,
0,
13,
2,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
118,
5
],
[
118,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
14,
17
],
[
17,
18
],
[
18,
19
],
[
8,
20
],
[
20,
21
],
[
20,
22
],
[
8,
23
],
[
23,
24
],
[
24,
25
],
[
25,
26
],
[
25,
27
],
[
23,
28
],
[
28,
29
],
[
28,
30
],
[
23,
31
],
[
31,
32
],
[
32,
33
],
[
23,
34
],
[
35,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
38,
41
],
[
41,
42
],
[
42,
43
],
[
35,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
44,
48
],
[
48,
49
],
[
49,
50
],
[
8,
51
],
[
51,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
51,
56
],
[
56,
57
],
[
56,
58
],
[
6,
59
],
[
59,
60
],
[
118,
61
],
[
61,
62
],
[
61,
63
],
[
63,
64
],
[
64,
65
],
[
65,
66
],
[
65,
67
],
[
64,
68
],
[
68,
69
],
[
69,
70
],
[
64,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
73,
75
],
[
72,
76
],
[
76,
77
],
[
77,
78
],
[
77,
79
],
[
76,
80
],
[
71,
81
],
[
81,
82
],
[
82,
83
],
[
71,
84
],
[
84,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
87,
89
],
[
85,
90
],
[
90,
91
],
[
90,
92
],
[
92,
93
],
[
93,
94
],
[
92,
95
],
[
85,
96
],
[
96,
97
],
[
97,
98
],
[
97,
99
],
[
99,
100
],
[
99,
101
],
[
85,
102
],
[
103,
103
],
[
103,
104
],
[
104,
105
],
[
105,
106
],
[
106,
107
],
[
106,
108
],
[
105,
109
],
[
104,
110
],
[
110,
111
],
[
111,
112
],
[
84,
113
],
[
113,
114
],
[
61,
115
],
[
115,
116
],
[
0,
117
],
[
117,
118
],
[
117,
119
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n \n public static void main (String... args) {\n Scanner scanner = new Scanner(System.in);\n int n = Integer.parseInt(scanner.nextLine());\n \n int count = 0;\n for (int i=0; i<n; i++) {\n int a = Integer.parseInt(scanner.nextLine());\n \n if (isPrime(a)) {\n count++;\n }\n }\n System.out.println(count + \"\");\n }\n \n private static boolean isPrime(int a) {\n if (a == 2) {\n return true;\n } else if (a < 2 || a%2 == 0) {\n return false;\n } else {\n for (int i = 3; i <= Math.sqrt(a); i = i + 2) {\n if (a % i == 0) {\n return false;\n }\n }\n return true;\n }\n }\n}\n",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n \n public static void main (String... args) {\n Scanner scanner = new Scanner(System.in);\n int n = Integer.parseInt(scanner.nextLine());\n \n int count = 0;\n for (int i=0; i<n; i++) {\n int a = Integer.parseInt(scanner.nextLine());\n \n if (isPrime(a)) {\n count++;\n }\n }\n System.out.println(count + \"\");\n }\n \n private static boolean isPrime(int a) {\n if (a == 2) {\n return true;\n } else if (a < 2 || a%2 == 0) {\n return false;\n } else {\n for (int i = 3; i <= Math.sqrt(a); i = i + 2) {\n if (a % i == 0) {\n return false;\n }\n }\n return true;\n }\n }\n}",
"Main",
"public static void main (String... args) {\n Scanner scanner = new Scanner(System.in);\n int n = Integer.parseInt(scanner.nextLine());\n \n int count = 0;\n for (int i=0; i<n; i++) {\n int a = Integer.parseInt(scanner.nextLine());\n \n if (isPrime(a)) {\n count++;\n }\n }\n System.out.println(count + \"\");\n }",
"main",
"{\n Scanner scanner = new Scanner(System.in);\n int n = Integer.parseInt(scanner.nextLine());\n \n int count = 0;\n for (int i=0; i<n; i++) {\n int a = Integer.parseInt(scanner.nextLine());\n \n if (isPrime(a)) {\n count++;\n }\n }\n System.out.println(count + \"\");\n }",
"Scanner scanner = new Scanner(System.in);",
"scanner",
"new Scanner(System.in)",
"int n = Integer.parseInt(scanner.nextLine());",
"n",
"Integer.parseInt(scanner.nextLine())",
"Integer.parseInt",
"Integer",
"scanner.nextLine()",
"scanner.nextLine",
"scanner",
"int count = 0;",
"count",
"0",
"for (int i=0; i<n; i++) {\n int a = Integer.parseInt(scanner.nextLine());\n \n if (isPrime(a)) {\n count++;\n }\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n int a = Integer.parseInt(scanner.nextLine());\n \n if (isPrime(a)) {\n count++;\n }\n }",
"{\n int a = Integer.parseInt(scanner.nextLine());\n \n if (isPrime(a)) {\n count++;\n }\n }",
"int a = Integer.parseInt(scanner.nextLine());",
"a",
"Integer.parseInt(scanner.nextLine())",
"Integer.parseInt",
"Integer",
"scanner.nextLine()",
"scanner.nextLine",
"scanner",
"if (isPrime(a)) {\n count++;\n }",
"isPrime(a)",
"isPrime",
"a",
"{\n count++;\n }",
"count++",
"count",
"System.out.println(count + \"\")",
"System.out.println",
"System.out",
"System",
"System.out",
"count + \"\"",
"count",
"\"\"",
"String... args",
"args",
"private static boolean isPrime(int a) {\n if (a == 2) {\n return true;\n } else if (a < 2 || a%2 == 0) {\n return false;\n } else {\n for (int i = 3; i <= Math.sqrt(a); i = i + 2) {\n if (a % i == 0) {\n return false;\n }\n }\n return true;\n }\n }",
"isPrime",
"{\n if (a == 2) {\n return true;\n } else if (a < 2 || a%2 == 0) {\n return false;\n } else {\n for (int i = 3; i <= Math.sqrt(a); i = i + 2) {\n if (a % i == 0) {\n return false;\n }\n }\n return true;\n }\n }",
"if (a == 2) {\n return true;\n } else if (a < 2 || a%2 == 0) {\n return false;\n } else {\n for (int i = 3; i <= Math.sqrt(a); i = i + 2) {\n if (a % i == 0) {\n return false;\n }\n }\n return true;\n }",
"a == 2",
"a",
"2",
"{\n return true;\n }",
"return true;",
"true",
"if (a < 2 || a%2 == 0) {\n return false;\n } else {\n for (int i = 3; i <= Math.sqrt(a); i = i + 2) {\n if (a % i == 0) {\n return false;\n }\n }\n return true;\n }",
"a < 2 || a%2 == 0",
"a < 2",
"a",
"2",
"a%2 == 0",
"a%2",
"a",
"2",
"0",
"{\n return false;\n }",
"return false;",
"false",
"{\n for (int i = 3; i <= Math.sqrt(a); i = i + 2) {\n if (a % i == 0) {\n return false;\n }\n }\n return true;\n }",
"for (int i = 3; i <= Math.sqrt(a); i = i + 2) {\n if (a % i == 0) {\n return false;\n }\n }",
"int i = 3;",
"int i = 3;",
"i",
"3",
"i <= Math.sqrt(a)",
"i",
"Math.sqrt(a)",
"Math.sqrt",
"Math",
"a",
"i = i + 2",
"i = i + 2",
"i",
"i + 2",
"i",
"2",
"{\n if (a % i == 0) {\n return false;\n }\n }",
"{\n if (a % i == 0) {\n return false;\n }\n }",
"if (a % i == 0) {\n return false;\n }",
"a % i == 0",
"a % i",
"a",
"i",
"0",
"{\n return false;\n }",
"return false;",
"false",
"return true;",
"true",
"int a",
"a",
"public class Main {\n \n public static void main (String... args) {\n Scanner scanner = new Scanner(System.in);\n int n = Integer.parseInt(scanner.nextLine());\n \n int count = 0;\n for (int i=0; i<n; i++) {\n int a = Integer.parseInt(scanner.nextLine());\n \n if (isPrime(a)) {\n count++;\n }\n }\n System.out.println(count + \"\");\n }\n \n private static boolean isPrime(int a) {\n if (a == 2) {\n return true;\n } else if (a < 2 || a%2 == 0) {\n return false;\n } else {\n for (int i = 3; i <= Math.sqrt(a); i = i + 2) {\n if (a % i == 0) {\n return false;\n }\n }\n return true;\n }\n }\n}",
"public class Main {\n \n public static void main (String... args) {\n Scanner scanner = new Scanner(System.in);\n int n = Integer.parseInt(scanner.nextLine());\n \n int count = 0;\n for (int i=0; i<n; i++) {\n int a = Integer.parseInt(scanner.nextLine());\n \n if (isPrime(a)) {\n count++;\n }\n }\n System.out.println(count + \"\");\n }\n \n private static boolean isPrime(int a) {\n if (a == 2) {\n return true;\n } else if (a < 2 || a%2 == 0) {\n return false;\n } else {\n for (int i = 3; i <= Math.sqrt(a); i = i + 2) {\n if (a % i == 0) {\n return false;\n }\n }\n return true;\n }\n }\n}",
"Main"
] | import java.util.Scanner;
public class Main {
public static void main (String... args) {
Scanner scanner = new Scanner(System.in);
int n = Integer.parseInt(scanner.nextLine());
int count = 0;
for (int i=0; i<n; i++) {
int a = Integer.parseInt(scanner.nextLine());
if (isPrime(a)) {
count++;
}
}
System.out.println(count + "");
}
private static boolean isPrime(int a) {
if (a == 2) {
return true;
} else if (a < 2 || a%2 == 0) {
return false;
} else {
for (int i = 3; i <= Math.sqrt(a); i = i + 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
17,
14,
2,
2,
13,
17,
2,
2,
13,
17,
17,
30,
29,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
17,
23,
13,
6,
13,
12,
13,
30,
41,
13,
41,
13,
41,
13,
17,
41,
13,
20,
41,
13,
20,
0,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
4,
18,
13,
14,
4,
18,
13,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
13,
14
],
[
13,
15
],
[
12,
16
],
[
16,
17
],
[
17,
18
],
[
11,
19
],
[
19,
20
],
[
20,
21
],
[
21,
22
],
[
21,
23
],
[
20,
24
],
[
24,
25
],
[
25,
26
],
[
25,
27
],
[
24,
28
],
[
19,
29
],
[
29,
30
],
[
30,
31
],
[
11,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
34,
36
],
[
32,
37
],
[
37,
38
],
[
37,
39
],
[
39,
40
],
[
40,
41
],
[
39,
42
],
[
32,
43
],
[
43,
44
],
[
44,
45
],
[
44,
46
],
[
32,
47
],
[
48,
48
],
[
48,
49
],
[
49,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
50,
54
],
[
49,
55
],
[
55,
56
],
[
56,
57
],
[
11,
58
],
[
58,
59
],
[
9,
60
],
[
60,
61
],
[
0,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
64,
66
],
[
66,
67
],
[
67,
68
],
[
66,
69
],
[
69,
70
],
[
66,
71
],
[
71,
72
],
[
71,
73
],
[
66,
74
],
[
74,
75
],
[
74,
76
],
[
66,
77
],
[
77,
78
],
[
77,
79
],
[
66,
80
],
[
80,
81
],
[
80,
82
],
[
82,
83
],
[
83,
84
],
[
66,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
87,
89
],
[
85,
90
],
[
90,
91
],
[
90,
92
],
[
85,
93
],
[
93,
94
],
[
94,
95
],
[
85,
96
],
[
97,
97
],
[
97,
98
],
[
98,
99
],
[
98,
100
],
[
100,
101
],
[
101,
102
],
[
97,
103
],
[
103,
104
],
[
104,
105
],
[
105,
106
],
[
104,
107
],
[
103,
108
],
[
108,
109
],
[
66,
110
],
[
110,
111
],
[
111,
112
],
[
112,
113
],
[
112,
114
],
[
110,
115
],
[
64,
116
],
[
116,
117
]
] | [
"import java.util.Scanner;\nimport java.lang.Math;\n\nclass Judge {\n\n\t/**\n\t 素数かどうかを判定します。\n\t @param p 数字\n\t @return 素数ならtrue,違うならfalse\n\t */\n\tboolean isPrime(int p) {\n\t\t// pが2\n\t\tif (p == 2) {\n\t\t\treturn true;\n\t\t}\n\n\t\t// pが2未満 または 偶数\n\t\tif (p < 2 || (p % 2) == 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tfor (int i = 3; i <= Math.sqrt(p); i += 2) {\n\t\t\tif (p % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n}\n\nclass Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tint num;\n\t\tint input;\n\t\tint cnt = 0;\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tJudge j = new Judge();\n\n\t\tnum = sc.nextInt();\n\n\t\tfor (int i = 0; i < num; i++) {\n\t\t\tinput = sc.nextInt();\n\t\t\tif(j.isPrime(input)) cnt++;\n\t\t}\n\n\t\tSystem.out.println(cnt);\n\t}\n}\n",
"import java.util.Scanner;",
"Scanner",
"java.util",
"import java.lang.Math;",
"Math",
"java.lang",
"class Judge {\n\n\t/**\n\t 素数かどうかを判定します。\n\t @param p 数字\n\t @return 素数ならtrue,違うならfalse\n\t */\n\tboolean isPrime(int p) {\n\t\t// pが2\n\t\tif (p == 2) {\n\t\t\treturn true;\n\t\t}\n\n\t\t// pが2未満 または 偶数\n\t\tif (p < 2 || (p % 2) == 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tfor (int i = 3; i <= Math.sqrt(p); i += 2) {\n\t\t\tif (p % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n}",
"Judge",
"/**\n\t 素数かどうかを判定します。\n\t @param p 数字\n\t @return 素数ならtrue,違うならfalse\n\t */\n\tboolean isPrime(int p) {\n\t\t// pが2\n\t\tif (p == 2) {\n\t\t\treturn true;\n\t\t}\n\n\t\t// pが2未満 または 偶数\n\t\tif (p < 2 || (p % 2) == 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tfor (int i = 3; i <= Math.sqrt(p); i += 2) {\n\t\t\tif (p % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}",
"isPrime",
"{\n\t\t// pが2\n\t\tif (p == 2) {\n\t\t\treturn true;\n\t\t}\n\n\t\t// pが2未満 または 偶数\n\t\tif (p < 2 || (p % 2) == 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tfor (int i = 3; i <= Math.sqrt(p); i += 2) {\n\t\t\tif (p % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}",
"if (p == 2) {\n\t\t\treturn true;\n\t\t}",
"p == 2",
"p",
"2",
"{\n\t\t\treturn true;\n\t\t}",
"return true;",
"true",
"if (p < 2 || (p % 2) == 0) {\n\t\t\treturn false;\n\t\t}",
"p < 2 || (p % 2) == 0",
"p < 2",
"p",
"2",
"(p % 2) == 0",
"(p % 2)",
"p",
"2",
"0",
"{\n\t\t\treturn false;\n\t\t}",
"return false;",
"false",
"for (int i = 3; i <= Math.sqrt(p); i += 2) {\n\t\t\tif (p % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}",
"int i = 3;",
"int i = 3;",
"i",
"3",
"i <= Math.sqrt(p)",
"i",
"Math.sqrt(p)",
"Math.sqrt",
"Math",
"p",
"i += 2",
"i += 2",
"i",
"2",
"{\n\t\t\tif (p % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}",
"{\n\t\t\tif (p % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}",
"if (p % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}",
"p % i == 0",
"p % i",
"p",
"i",
"0",
"{\n\t\t\t\treturn false;\n\t\t\t}",
"return false;",
"false",
"return true;",
"true",
"int p",
"p",
"class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tint num;\n\t\tint input;\n\t\tint cnt = 0;\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tJudge j = new Judge();\n\n\t\tnum = sc.nextInt();\n\n\t\tfor (int i = 0; i < num; i++) {\n\t\t\tinput = sc.nextInt();\n\t\t\tif(j.isPrime(input)) cnt++;\n\t\t}\n\n\t\tSystem.out.println(cnt);\n\t}\n}",
"Main",
"public static void main(String[] args) {\n\n\t\tint num;\n\t\tint input;\n\t\tint cnt = 0;\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tJudge j = new Judge();\n\n\t\tnum = sc.nextInt();\n\n\t\tfor (int i = 0; i < num; i++) {\n\t\t\tinput = sc.nextInt();\n\t\t\tif(j.isPrime(input)) cnt++;\n\t\t}\n\n\t\tSystem.out.println(cnt);\n\t}",
"main",
"{\n\n\t\tint num;\n\t\tint input;\n\t\tint cnt = 0;\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tJudge j = new Judge();\n\n\t\tnum = sc.nextInt();\n\n\t\tfor (int i = 0; i < num; i++) {\n\t\t\tinput = sc.nextInt();\n\t\t\tif(j.isPrime(input)) cnt++;\n\t\t}\n\n\t\tSystem.out.println(cnt);\n\t}",
"int num;",
"num",
"int input;",
"input",
"int cnt = 0;",
"cnt",
"0",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"Judge j = new Judge();",
"j",
"new Judge()",
"num = sc.nextInt()",
"num",
"sc.nextInt()",
"sc.nextInt",
"sc",
"for (int i = 0; i < num; i++) {\n\t\t\tinput = sc.nextInt();\n\t\t\tif(j.isPrime(input)) cnt++;\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < num",
"i",
"num",
"i++",
"i++",
"i",
"{\n\t\t\tinput = sc.nextInt();\n\t\t\tif(j.isPrime(input)) cnt++;\n\t\t}",
"{\n\t\t\tinput = sc.nextInt();\n\t\t\tif(j.isPrime(input)) cnt++;\n\t\t}",
"input = sc.nextInt()",
"input",
"sc.nextInt()",
"sc.nextInt",
"sc",
"if(j.isPrime(input)) cnt++;",
"j.isPrime(input)",
"j.isPrime",
"j",
"input",
"cnt++",
"cnt",
"System.out.println(cnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"String[] args",
"args"
] | import java.util.Scanner;
import java.lang.Math;
class Judge {
/**
素数かどうかを判定します。
@param p 数字
@return 素数ならtrue,違うならfalse
*/
boolean isPrime(int p) {
// pが2
if (p == 2) {
return true;
}
// pが2未満 または 偶数
if (p < 2 || (p % 2) == 0) {
return false;
}
for (int i = 3; i <= Math.sqrt(p); i += 2) {
if (p % i == 0) {
return false;
}
}
return true;
}
}
class Main {
public static void main(String[] args) {
int num;
int input;
int cnt = 0;
Scanner sc = new Scanner(System.in);
Judge j = new Judge();
num = sc.nextInt();
for (int i = 0; i < num; i++) {
input = sc.nextInt();
if(j.isPrime(input)) cnt++;
}
System.out.println(cnt);
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
0,
13,
4,
18,
13,
14,
4,
18,
20,
17,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
59,
8
],
[
59,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
11,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
11,
20
],
[
20,
21
],
[
20,
22
],
[
11,
23
],
[
23,
24
],
[
24,
25
],
[
25,
26
],
[
25,
27
],
[
23,
28
],
[
28,
29
],
[
28,
30
],
[
23,
31
],
[
31,
32
],
[
32,
33
],
[
23,
34
],
[
35,
35
],
[
35,
36
],
[
36,
37
],
[
35,
38
],
[
38,
39
],
[
38,
40
],
[
40,
41
],
[
41,
42
],
[
35,
43
],
[
43,
44
],
[
44,
45
],
[
45,
46
],
[
44,
47
],
[
43,
48
],
[
48,
49
],
[
11,
50
],
[
50,
51
],
[
51,
52
],
[
52,
53
],
[
52,
54
],
[
50,
55
],
[
9,
56
],
[
56,
57
],
[
0,
58
],
[
58,
59
],
[
58,
60
]
] | [
"import java.math.*;\nimport java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int N = scan.nextInt();\n int num = 0;\n for(int i = 0; i < N; ++i) {\n String s;\n s = scan.next();\n if(new BigInteger(s).isProbablePrime(5)) ++num;\n }\n System.out.println(num);\n }\n}",
"import java.math.*;",
"math.*",
"java",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int N = scan.nextInt();\n int num = 0;\n for(int i = 0; i < N; ++i) {\n String s;\n s = scan.next();\n if(new BigInteger(s).isProbablePrime(5)) ++num;\n }\n System.out.println(num);\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int N = scan.nextInt();\n int num = 0;\n for(int i = 0; i < N; ++i) {\n String s;\n s = scan.next();\n if(new BigInteger(s).isProbablePrime(5)) ++num;\n }\n System.out.println(num);\n }",
"main",
"{\n Scanner scan = new Scanner(System.in);\n int N = scan.nextInt();\n int num = 0;\n for(int i = 0; i < N; ++i) {\n String s;\n s = scan.next();\n if(new BigInteger(s).isProbablePrime(5)) ++num;\n }\n System.out.println(num);\n }",
"Scanner scan = new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"int N = scan.nextInt();",
"N",
"scan.nextInt()",
"scan.nextInt",
"scan",
"int num = 0;",
"num",
"0",
"for(int i = 0; i < N; ++i) {\n String s;\n s = scan.next();\n if(new BigInteger(s).isProbablePrime(5)) ++num;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < N",
"i",
"N",
"++i",
"++i",
"i",
"{\n String s;\n s = scan.next();\n if(new BigInteger(s).isProbablePrime(5)) ++num;\n }",
"{\n String s;\n s = scan.next();\n if(new BigInteger(s).isProbablePrime(5)) ++num;\n }",
"String s;",
"s",
"s = scan.next()",
"s",
"scan.next()",
"scan.next",
"scan",
"if(new BigInteger(s).isProbablePrime(5)) ++num;",
"new BigInteger(s).isProbablePrime(5)",
"new BigInteger(s).isProbablePrime",
"new BigInteger(s)",
"5",
"++num",
"num",
"System.out.println(num)",
"System.out.println",
"System.out",
"System",
"System.out",
"num",
"String[] args",
"args",
"public class Main {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int N = scan.nextInt();\n int num = 0;\n for(int i = 0; i < N; ++i) {\n String s;\n s = scan.next();\n if(new BigInteger(s).isProbablePrime(5)) ++num;\n }\n System.out.println(num);\n }\n}",
"public class Main {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int N = scan.nextInt();\n int num = 0;\n for(int i = 0; i < N; ++i) {\n String s;\n s = scan.next();\n if(new BigInteger(s).isProbablePrime(5)) ++num;\n }\n System.out.println(num);\n }\n}",
"Main"
] | import java.math.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int N = scan.nextInt();
int num = 0;
for(int i = 0; i < N; ++i) {
String s;
s = scan.next();
if(new BigInteger(s).isProbablePrime(5)) ++num;
}
System.out.println(num);
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
14,
2,
13,
17,
29,
17,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
17,
29,
17,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
29,
17,
29,
17,
23,
13,
12,
13,
30,
41,
13,
41,
13,
41,
13,
41,
13,
20,
0,
13,
4,
18,
13,
0,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
4,
18,
13,
14,
4,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
4,
18,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
114,
5
],
[
114,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
10,
11
],
[
10,
12
],
[
9,
13
],
[
13,
14
],
[
8,
15
],
[
15,
16
],
[
16,
17
],
[
16,
18
],
[
15,
19
],
[
19,
20
],
[
8,
21
],
[
21,
22
],
[
22,
23
],
[
23,
24
],
[
23,
25
],
[
22,
26
],
[
21,
27
],
[
27,
28
],
[
8,
29
],
[
29,
30
],
[
30,
31
],
[
31,
32
],
[
31,
33
],
[
29,
34
],
[
34,
35
],
[
35,
36
],
[
35,
37
],
[
34,
38
],
[
29,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
29,
43
],
[
44,
44
],
[
44,
45
],
[
45,
46
],
[
46,
47
],
[
47,
48
],
[
47,
49
],
[
46,
50
],
[
45,
51
],
[
51,
52
],
[
8,
53
],
[
53,
54
],
[
6,
55
],
[
55,
56
],
[
114,
57
],
[
57,
58
],
[
57,
59
],
[
59,
60
],
[
60,
61
],
[
59,
62
],
[
62,
63
],
[
59,
64
],
[
64,
65
],
[
59,
66
],
[
66,
67
],
[
66,
68
],
[
59,
69
],
[
69,
70
],
[
69,
71
],
[
71,
72
],
[
72,
73
],
[
59,
74
],
[
74,
75
],
[
74,
76
],
[
59,
77
],
[
77,
78
],
[
78,
79
],
[
79,
80
],
[
79,
81
],
[
77,
82
],
[
82,
83
],
[
82,
84
],
[
77,
85
],
[
85,
86
],
[
86,
87
],
[
77,
88
],
[
89,
89
],
[
89,
90
],
[
90,
91
],
[
90,
92
],
[
92,
93
],
[
93,
94
],
[
89,
95
],
[
95,
96
],
[
96,
97
],
[
96,
98
],
[
95,
99
],
[
99,
100
],
[
100,
101
],
[
59,
102
],
[
102,
103
],
[
103,
104
],
[
104,
105
],
[
104,
106
],
[
102,
107
],
[
59,
108
],
[
108,
109
],
[
109,
110
],
[
57,
111
],
[
111,
112
],
[
0,
113
],
[
113,
114
],
[
113,
115
]
] | [
"import java.util.Scanner;\n\npublic class Main{\n\n\n\tpublic static boolean isPrime(int num){\n\t\t//?´???°????????¶\n\t\t//????????????????°?????????´??°??§??????????????????\n\t\tif(num==1)return false;\n\t\tif(num==2)return true;\n\t\tif(num%2==0)return false;\n\n\t\tfor(int i=3;i*i<=num;i+=2){\n\t\t\tif(num%i==0)return false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\n\n\tpublic static void main(String[] args){\n\n\t\tint N;\n\t\tint box, cnt;\n\n\t\tScanner scan=new Scanner(System.in);\n\t\tN=scan.nextInt();\n\n\t\tcnt=0;\n\t\tfor(int i=0;i<N;i++){\n\t\tbox=scan.nextInt();\n\n\t\tif(isPrime(box)){cnt++;}\n\t\t}\n\n\t\tSystem.out.println(cnt);\n\n\t\tscan.close();\n\n\t}\n\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main{\n\n\n\tpublic static boolean isPrime(int num){\n\t\t//?´???°????????¶\n\t\t//????????????????°?????????´??°??§??????????????????\n\t\tif(num==1)return false;\n\t\tif(num==2)return true;\n\t\tif(num%2==0)return false;\n\n\t\tfor(int i=3;i*i<=num;i+=2){\n\t\t\tif(num%i==0)return false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\n\n\tpublic static void main(String[] args){\n\n\t\tint N;\n\t\tint box, cnt;\n\n\t\tScanner scan=new Scanner(System.in);\n\t\tN=scan.nextInt();\n\n\t\tcnt=0;\n\t\tfor(int i=0;i<N;i++){\n\t\tbox=scan.nextInt();\n\n\t\tif(isPrime(box)){cnt++;}\n\t\t}\n\n\t\tSystem.out.println(cnt);\n\n\t\tscan.close();\n\n\t}\n\n}",
"Main",
"public static boolean isPrime(int num){\n\t\t//?´???°????????¶\n\t\t//????????????????°?????????´??°??§??????????????????\n\t\tif(num==1)return false;\n\t\tif(num==2)return true;\n\t\tif(num%2==0)return false;\n\n\t\tfor(int i=3;i*i<=num;i+=2){\n\t\t\tif(num%i==0)return false;\n\t\t}\n\n\t\treturn true;\n\t}",
"isPrime",
"{\n\t\t//?´???°????????¶\n\t\t//????????????????°?????????´??°??§??????????????????\n\t\tif(num==1)return false;\n\t\tif(num==2)return true;\n\t\tif(num%2==0)return false;\n\n\t\tfor(int i=3;i*i<=num;i+=2){\n\t\t\tif(num%i==0)return false;\n\t\t}\n\n\t\treturn true;\n\t}",
"if(num==1)return false;",
"num==1",
"num",
"1",
"return false;",
"false",
"if(num==2)return true;",
"num==2",
"num",
"2",
"return true;",
"true",
"if(num%2==0)return false;",
"num%2==0",
"num%2",
"num",
"2",
"0",
"return false;",
"false",
"for(int i=3;i*i<=num;i+=2){\n\t\t\tif(num%i==0)return false;\n\t\t}",
"int i=3;",
"int i=3;",
"i",
"3",
"i*i<=num",
"i*i",
"i",
"i",
"num",
"i+=2",
"i+=2",
"i",
"2",
"{\n\t\t\tif(num%i==0)return false;\n\t\t}",
"{\n\t\t\tif(num%i==0)return false;\n\t\t}",
"if(num%i==0)return false;",
"num%i==0",
"num%i",
"num",
"i",
"0",
"return false;",
"false",
"return true;",
"true",
"int num",
"num",
"public static void main(String[] args){\n\n\t\tint N;\n\t\tint box, cnt;\n\n\t\tScanner scan=new Scanner(System.in);\n\t\tN=scan.nextInt();\n\n\t\tcnt=0;\n\t\tfor(int i=0;i<N;i++){\n\t\tbox=scan.nextInt();\n\n\t\tif(isPrime(box)){cnt++;}\n\t\t}\n\n\t\tSystem.out.println(cnt);\n\n\t\tscan.close();\n\n\t}",
"main",
"{\n\n\t\tint N;\n\t\tint box, cnt;\n\n\t\tScanner scan=new Scanner(System.in);\n\t\tN=scan.nextInt();\n\n\t\tcnt=0;\n\t\tfor(int i=0;i<N;i++){\n\t\tbox=scan.nextInt();\n\n\t\tif(isPrime(box)){cnt++;}\n\t\t}\n\n\t\tSystem.out.println(cnt);\n\n\t\tscan.close();\n\n\t}",
"int N;",
"N",
"int box",
"box",
"cnt;",
"cnt",
"Scanner scan=new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"N=scan.nextInt()",
"N",
"scan.nextInt()",
"scan.nextInt",
"scan",
"cnt=0",
"cnt",
"0",
"for(int i=0;i<N;i++){\n\t\tbox=scan.nextInt();\n\n\t\tif(isPrime(box)){cnt++;}\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<N",
"i",
"N",
"i++",
"i++",
"i",
"{\n\t\tbox=scan.nextInt();\n\n\t\tif(isPrime(box)){cnt++;}\n\t\t}",
"{\n\t\tbox=scan.nextInt();\n\n\t\tif(isPrime(box)){cnt++;}\n\t\t}",
"box=scan.nextInt()",
"box",
"scan.nextInt()",
"scan.nextInt",
"scan",
"if(isPrime(box)){cnt++;}",
"isPrime(box)",
"isPrime",
"box",
"{cnt++;}",
"cnt++",
"cnt",
"System.out.println(cnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"scan.close()",
"scan.close",
"scan",
"String[] args",
"args",
"public class Main{\n\n\n\tpublic static boolean isPrime(int num){\n\t\t//?´???°????????¶\n\t\t//????????????????°?????????´??°??§??????????????????\n\t\tif(num==1)return false;\n\t\tif(num==2)return true;\n\t\tif(num%2==0)return false;\n\n\t\tfor(int i=3;i*i<=num;i+=2){\n\t\t\tif(num%i==0)return false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\n\n\tpublic static void main(String[] args){\n\n\t\tint N;\n\t\tint box, cnt;\n\n\t\tScanner scan=new Scanner(System.in);\n\t\tN=scan.nextInt();\n\n\t\tcnt=0;\n\t\tfor(int i=0;i<N;i++){\n\t\tbox=scan.nextInt();\n\n\t\tif(isPrime(box)){cnt++;}\n\t\t}\n\n\t\tSystem.out.println(cnt);\n\n\t\tscan.close();\n\n\t}\n\n}",
"public class Main{\n\n\n\tpublic static boolean isPrime(int num){\n\t\t//?´???°????????¶\n\t\t//????????????????°?????????´??°??§??????????????????\n\t\tif(num==1)return false;\n\t\tif(num==2)return true;\n\t\tif(num%2==0)return false;\n\n\t\tfor(int i=3;i*i<=num;i+=2){\n\t\t\tif(num%i==0)return false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\n\n\tpublic static void main(String[] args){\n\n\t\tint N;\n\t\tint box, cnt;\n\n\t\tScanner scan=new Scanner(System.in);\n\t\tN=scan.nextInt();\n\n\t\tcnt=0;\n\t\tfor(int i=0;i<N;i++){\n\t\tbox=scan.nextInt();\n\n\t\tif(isPrime(box)){cnt++;}\n\t\t}\n\n\t\tSystem.out.println(cnt);\n\n\t\tscan.close();\n\n\t}\n\n}",
"Main"
] | import java.util.Scanner;
public class Main{
public static boolean isPrime(int num){
//?´???°????????¶
//????????????????°?????????´??°??§??????????????????
if(num==1)return false;
if(num==2)return true;
if(num%2==0)return false;
for(int i=3;i*i<=num;i+=2){
if(num%i==0)return false;
}
return true;
}
public static void main(String[] args){
int N;
int box, cnt;
Scanner scan=new Scanner(System.in);
N=scan.nextInt();
cnt=0;
for(int i=0;i<N;i++){
box=scan.nextInt();
if(isPrime(box)){cnt++;}
}
System.out.println(cnt);
scan.close();
}
} |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
17,
41,
13,
41,
13,
41,
13,
41,
13,
20,
0,
13,
4,
18,
13,
4,
18,
13,
41,
13,
20,
2,
13,
17,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
4,
18,
13,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
17,
0,
13,
4,
13,
18,
13,
13,
14,
2,
13,
13,
30,
0,
13,
2,
13,
17,
30,
0,
13,
13,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
13,
17,
30,
40,
13,
3,
14,
2,
2,
18,
13,
13,
13,
17,
30,
40,
13,
14,
2,
13,
17,
30,
3,
14,
2,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
162,
8
],
[
162,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
11,
14
],
[
14,
15
],
[
11,
16
],
[
16,
17
],
[
11,
18
],
[
18,
19
],
[
11,
20
],
[
20,
21
],
[
20,
22
],
[
11,
23
],
[
23,
24
],
[
11,
25
],
[
25,
26
],
[
11,
27
],
[
27,
28
],
[
11,
29
],
[
29,
30
],
[
29,
31
],
[
11,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
35,
36
],
[
34,
37
],
[
37,
38
],
[
38,
39
],
[
11,
40
],
[
40,
41
],
[
40,
42
],
[
43,
44
],
[
43,
45
],
[
11,
46
],
[
46,
47
],
[
47,
48
],
[
48,
49
],
[
48,
50
],
[
46,
51
],
[
51,
52
],
[
51,
53
],
[
46,
54
],
[
54,
55
],
[
55,
56
],
[
46,
57
],
[
58,
58
],
[
58,
59
],
[
59,
60
],
[
60,
61
],
[
60,
62
],
[
59,
63
],
[
63,
64
],
[
64,
65
],
[
63,
66
],
[
66,
67
],
[
67,
68
],
[
11,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
69,
74
],
[
74,
75
],
[
74,
76
],
[
69,
77
],
[
77,
78
],
[
78,
79
],
[
69,
80
],
[
81,
81
],
[
81,
82
],
[
82,
83
],
[
82,
84
],
[
81,
85
],
[
85,
86
],
[
85,
87
],
[
87,
88
],
[
87,
89
],
[
89,
90
],
[
89,
91
],
[
81,
92
],
[
92,
93
],
[
93,
94
],
[
93,
95
],
[
92,
96
],
[
96,
97
],
[
97,
98
],
[
97,
99
],
[
99,
100
],
[
99,
101
],
[
92,
102
],
[
102,
103
],
[
103,
104
],
[
103,
105
],
[
81,
106
],
[
106,
107
],
[
107,
108
],
[
108,
109
],
[
108,
110
],
[
106,
111
],
[
111,
112
],
[
111,
113
],
[
106,
114
],
[
114,
115
],
[
115,
116
],
[
106,
117
],
[
118,
118
],
[
118,
119
],
[
119,
120
],
[
120,
121
],
[
121,
122
],
[
121,
123
],
[
120,
124
],
[
119,
125
],
[
125,
126
],
[
126,
127
],
[
125,
128
],
[
118,
129
],
[
129,
130
],
[
130,
131
],
[
131,
132
],
[
132,
133
],
[
132,
134
],
[
131,
135
],
[
130,
136
],
[
129,
137
],
[
137,
138
],
[
138,
139
],
[
118,
140
],
[
140,
141
],
[
141,
142
],
[
141,
143
],
[
140,
144
],
[
144,
145
],
[
118,
146
],
[
146,
147
],
[
147,
148
],
[
147,
149
],
[
146,
150
],
[
150,
151
],
[
151,
152
],
[
11,
153
],
[
153,
154
],
[
154,
155
],
[
155,
156
],
[
155,
157
],
[
153,
158
],
[
9,
159
],
[
159,
160
],
[
0,
161
],
[
161,
162
],
[
161,
163
]
] | [
"import static java.lang.Math.*;\n\nimport java.util.Scanner;\n\npublic class Main {\n\t public static void main(String[] args) {\n\t\t int n,i,b,count,kekka=0,j,c;\n\t\t double d;\n\t\t \n\t Scanner sc=new Scanner(System.in);\n\t n=Integer.parseInt(sc.next());\n\t \n\t int a[]=new int[n+1];\n\t for(i=0;i<n;i++){\n\t \ta[i]=Integer.parseInt(sc.next());\n\t \t\n\t }\n\t \n\t for(i=0;i<n;i++){\n\t \tcount=0;\n\t \t\n\t \t\n \td=sqrt(a[i]);\n \t\n \tif((int)d<d){\n \t\t c=(int)d+1;\n \t}\n \telse{\n \t\t c=(int)d;\n \t}\n \t\n\t \tfor(j=2;j<=c;j++){\n\t \t\tif(a[i]==2){\n\t \t\t\tkekka++;\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\t\n\t \t\tif(a[i]%j==0){\n\t \t\t\tcount++;\n\t \t\t\t\n\t \t\t}\n\t \t\t\n\t \t\tif(count==1){\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\tif(j==c){\n\t\t \t\tkekka++;\n\t\t \t\t\n\t\t \t}\n\t \t}\n\t \t\n\t \t\n\t }\n\t System.out.println(kekka);\n\t }\n\t }",
"import static java.lang.Math.*;",
"import static java.lang.Math.*;",
"import static java.lang.Math.*;",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\t public static void main(String[] args) {\n\t\t int n,i,b,count,kekka=0,j,c;\n\t\t double d;\n\t\t \n\t Scanner sc=new Scanner(System.in);\n\t n=Integer.parseInt(sc.next());\n\t \n\t int a[]=new int[n+1];\n\t for(i=0;i<n;i++){\n\t \ta[i]=Integer.parseInt(sc.next());\n\t \t\n\t }\n\t \n\t for(i=0;i<n;i++){\n\t \tcount=0;\n\t \t\n\t \t\n \td=sqrt(a[i]);\n \t\n \tif((int)d<d){\n \t\t c=(int)d+1;\n \t}\n \telse{\n \t\t c=(int)d;\n \t}\n \t\n\t \tfor(j=2;j<=c;j++){\n\t \t\tif(a[i]==2){\n\t \t\t\tkekka++;\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\t\n\t \t\tif(a[i]%j==0){\n\t \t\t\tcount++;\n\t \t\t\t\n\t \t\t}\n\t \t\t\n\t \t\tif(count==1){\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\tif(j==c){\n\t\t \t\tkekka++;\n\t\t \t\t\n\t\t \t}\n\t \t}\n\t \t\n\t \t\n\t }\n\t System.out.println(kekka);\n\t }\n\t }",
"Main",
"public static void main(String[] args) {\n\t\t int n,i,b,count,kekka=0,j,c;\n\t\t double d;\n\t\t \n\t Scanner sc=new Scanner(System.in);\n\t n=Integer.parseInt(sc.next());\n\t \n\t int a[]=new int[n+1];\n\t for(i=0;i<n;i++){\n\t \ta[i]=Integer.parseInt(sc.next());\n\t \t\n\t }\n\t \n\t for(i=0;i<n;i++){\n\t \tcount=0;\n\t \t\n\t \t\n \td=sqrt(a[i]);\n \t\n \tif((int)d<d){\n \t\t c=(int)d+1;\n \t}\n \telse{\n \t\t c=(int)d;\n \t}\n \t\n\t \tfor(j=2;j<=c;j++){\n\t \t\tif(a[i]==2){\n\t \t\t\tkekka++;\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\t\n\t \t\tif(a[i]%j==0){\n\t \t\t\tcount++;\n\t \t\t\t\n\t \t\t}\n\t \t\t\n\t \t\tif(count==1){\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\tif(j==c){\n\t\t \t\tkekka++;\n\t\t \t\t\n\t\t \t}\n\t \t}\n\t \t\n\t \t\n\t }\n\t System.out.println(kekka);\n\t }",
"main",
"{\n\t\t int n,i,b,count,kekka=0,j,c;\n\t\t double d;\n\t\t \n\t Scanner sc=new Scanner(System.in);\n\t n=Integer.parseInt(sc.next());\n\t \n\t int a[]=new int[n+1];\n\t for(i=0;i<n;i++){\n\t \ta[i]=Integer.parseInt(sc.next());\n\t \t\n\t }\n\t \n\t for(i=0;i<n;i++){\n\t \tcount=0;\n\t \t\n\t \t\n \td=sqrt(a[i]);\n \t\n \tif((int)d<d){\n \t\t c=(int)d+1;\n \t}\n \telse{\n \t\t c=(int)d;\n \t}\n \t\n\t \tfor(j=2;j<=c;j++){\n\t \t\tif(a[i]==2){\n\t \t\t\tkekka++;\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\t\n\t \t\tif(a[i]%j==0){\n\t \t\t\tcount++;\n\t \t\t\t\n\t \t\t}\n\t \t\t\n\t \t\tif(count==1){\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\tif(j==c){\n\t\t \t\tkekka++;\n\t\t \t\t\n\t\t \t}\n\t \t}\n\t \t\n\t \t\n\t }\n\t System.out.println(kekka);\n\t }",
"int n",
"n",
"i",
"i",
"b",
"b",
"count",
"count",
"kekka=0",
"kekka",
"0",
"j",
"j",
"c;",
"c",
"double d;",
"d",
"Scanner sc=new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"n=Integer.parseInt(sc.next())",
"n",
"Integer.parseInt(sc.next())",
"Integer.parseInt",
"Integer",
"sc.next()",
"sc.next",
"sc",
"int a[]=new int[n+1];",
"a",
"new int[n+1]",
"n+1",
"n",
"1",
"for(i=0;i<n;i++){\n\t \ta[i]=Integer.parseInt(sc.next());\n\t \t\n\t }",
"i=0;",
"i=0",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t \ta[i]=Integer.parseInt(sc.next());\n\t \t\n\t }",
"{\n\t \ta[i]=Integer.parseInt(sc.next());\n\t \t\n\t }",
"a[i]=Integer.parseInt(sc.next())",
"a[i]",
"a",
"i",
"Integer.parseInt(sc.next())",
"Integer.parseInt",
"Integer",
"sc.next()",
"sc.next",
"sc",
"for(i=0;i<n;i++){\n\t \tcount=0;\n\t \t\n\t \t\n \td=sqrt(a[i]);\n \t\n \tif((int)d<d){\n \t\t c=(int)d+1;\n \t}\n \telse{\n \t\t c=(int)d;\n \t}\n \t\n\t \tfor(j=2;j<=c;j++){\n\t \t\tif(a[i]==2){\n\t \t\t\tkekka++;\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\t\n\t \t\tif(a[i]%j==0){\n\t \t\t\tcount++;\n\t \t\t\t\n\t \t\t}\n\t \t\t\n\t \t\tif(count==1){\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\tif(j==c){\n\t\t \t\tkekka++;\n\t\t \t\t\n\t\t \t}\n\t \t}\n\t \t\n\t \t\n\t }",
"i=0;",
"i=0",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t \tcount=0;\n\t \t\n\t \t\n \td=sqrt(a[i]);\n \t\n \tif((int)d<d){\n \t\t c=(int)d+1;\n \t}\n \telse{\n \t\t c=(int)d;\n \t}\n \t\n\t \tfor(j=2;j<=c;j++){\n\t \t\tif(a[i]==2){\n\t \t\t\tkekka++;\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\t\n\t \t\tif(a[i]%j==0){\n\t \t\t\tcount++;\n\t \t\t\t\n\t \t\t}\n\t \t\t\n\t \t\tif(count==1){\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\tif(j==c){\n\t\t \t\tkekka++;\n\t\t \t\t\n\t\t \t}\n\t \t}\n\t \t\n\t \t\n\t }",
"{\n\t \tcount=0;\n\t \t\n\t \t\n \td=sqrt(a[i]);\n \t\n \tif((int)d<d){\n \t\t c=(int)d+1;\n \t}\n \telse{\n \t\t c=(int)d;\n \t}\n \t\n\t \tfor(j=2;j<=c;j++){\n\t \t\tif(a[i]==2){\n\t \t\t\tkekka++;\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\t\n\t \t\tif(a[i]%j==0){\n\t \t\t\tcount++;\n\t \t\t\t\n\t \t\t}\n\t \t\t\n\t \t\tif(count==1){\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\tif(j==c){\n\t\t \t\tkekka++;\n\t\t \t\t\n\t\t \t}\n\t \t}\n\t \t\n\t \t\n\t }",
"count=0",
"count",
"0",
"d=sqrt(a[i])",
"d",
"sqrt(a[i])",
"sqrt",
"a[i]",
"a",
"i",
"if((int)d<d){\n \t\t c=(int)d+1;\n \t}\n \telse{\n \t\t c=(int)d;\n \t}",
"(int)d<d",
"(int)d",
"d",
"{\n \t\t c=(int)d+1;\n \t}",
"c=(int)d+1",
"c",
"(int)d+1",
"(int)d",
"1",
"{\n \t\t c=(int)d;\n \t}",
"c=(int)d",
"c",
"(int)d",
"for(j=2;j<=c;j++){\n\t \t\tif(a[i]==2){\n\t \t\t\tkekka++;\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\t\n\t \t\tif(a[i]%j==0){\n\t \t\t\tcount++;\n\t \t\t\t\n\t \t\t}\n\t \t\t\n\t \t\tif(count==1){\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\tif(j==c){\n\t\t \t\tkekka++;\n\t\t \t\t\n\t\t \t}\n\t \t}",
"j=2;",
"j=2",
"j",
"2",
"j<=c",
"j",
"c",
"j++",
"j++",
"j",
"{\n\t \t\tif(a[i]==2){\n\t \t\t\tkekka++;\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\t\n\t \t\tif(a[i]%j==0){\n\t \t\t\tcount++;\n\t \t\t\t\n\t \t\t}\n\t \t\t\n\t \t\tif(count==1){\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\tif(j==c){\n\t\t \t\tkekka++;\n\t\t \t\t\n\t\t \t}\n\t \t}",
"{\n\t \t\tif(a[i]==2){\n\t \t\t\tkekka++;\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\t\n\t \t\tif(a[i]%j==0){\n\t \t\t\tcount++;\n\t \t\t\t\n\t \t\t}\n\t \t\t\n\t \t\tif(count==1){\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\tif(j==c){\n\t\t \t\tkekka++;\n\t\t \t\t\n\t\t \t}\n\t \t}",
"if(a[i]==2){\n\t \t\t\tkekka++;\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}",
"a[i]==2",
"a[i]",
"a",
"i",
"2",
"{\n\t \t\t\tkekka++;\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}",
"kekka++",
"kekka",
"break;",
"if(a[i]%j==0){\n\t \t\t\tcount++;\n\t \t\t\t\n\t \t\t}",
"a[i]%j==0",
"a[i]%j",
"a[i]",
"a",
"i",
"j",
"0",
"{\n\t \t\t\tcount++;\n\t \t\t\t\n\t \t\t}",
"count++",
"count",
"if(count==1){\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}",
"count==1",
"count",
"1",
"{\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}",
"break;",
"if(j==c){\n\t\t \t\tkekka++;\n\t\t \t\t\n\t\t \t}",
"j==c",
"j",
"c",
"{\n\t\t \t\tkekka++;\n\t\t \t\t\n\t\t \t}",
"kekka++",
"kekka",
"System.out.println(kekka)",
"System.out.println",
"System.out",
"System",
"System.out",
"kekka",
"String[] args",
"args",
"public class Main {\n\t public static void main(String[] args) {\n\t\t int n,i,b,count,kekka=0,j,c;\n\t\t double d;\n\t\t \n\t Scanner sc=new Scanner(System.in);\n\t n=Integer.parseInt(sc.next());\n\t \n\t int a[]=new int[n+1];\n\t for(i=0;i<n;i++){\n\t \ta[i]=Integer.parseInt(sc.next());\n\t \t\n\t }\n\t \n\t for(i=0;i<n;i++){\n\t \tcount=0;\n\t \t\n\t \t\n \td=sqrt(a[i]);\n \t\n \tif((int)d<d){\n \t\t c=(int)d+1;\n \t}\n \telse{\n \t\t c=(int)d;\n \t}\n \t\n\t \tfor(j=2;j<=c;j++){\n\t \t\tif(a[i]==2){\n\t \t\t\tkekka++;\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\t\n\t \t\tif(a[i]%j==0){\n\t \t\t\tcount++;\n\t \t\t\t\n\t \t\t}\n\t \t\t\n\t \t\tif(count==1){\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\tif(j==c){\n\t\t \t\tkekka++;\n\t\t \t\t\n\t\t \t}\n\t \t}\n\t \t\n\t \t\n\t }\n\t System.out.println(kekka);\n\t }\n\t }",
"public class Main {\n\t public static void main(String[] args) {\n\t\t int n,i,b,count,kekka=0,j,c;\n\t\t double d;\n\t\t \n\t Scanner sc=new Scanner(System.in);\n\t n=Integer.parseInt(sc.next());\n\t \n\t int a[]=new int[n+1];\n\t for(i=0;i<n;i++){\n\t \ta[i]=Integer.parseInt(sc.next());\n\t \t\n\t }\n\t \n\t for(i=0;i<n;i++){\n\t \tcount=0;\n\t \t\n\t \t\n \td=sqrt(a[i]);\n \t\n \tif((int)d<d){\n \t\t c=(int)d+1;\n \t}\n \telse{\n \t\t c=(int)d;\n \t}\n \t\n\t \tfor(j=2;j<=c;j++){\n\t \t\tif(a[i]==2){\n\t \t\t\tkekka++;\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\t\n\t \t\tif(a[i]%j==0){\n\t \t\t\tcount++;\n\t \t\t\t\n\t \t\t}\n\t \t\t\n\t \t\tif(count==1){\n\t \t\t\t\n\t \t\t\tbreak;\n\t \t\t}\n\t \t\tif(j==c){\n\t\t \t\tkekka++;\n\t\t \t\t\n\t\t \t}\n\t \t}\n\t \t\n\t \t\n\t }\n\t System.out.println(kekka);\n\t }\n\t }",
"Main"
] | import static java.lang.Math.*;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int n,i,b,count,kekka=0,j,c;
double d;
Scanner sc=new Scanner(System.in);
n=Integer.parseInt(sc.next());
int a[]=new int[n+1];
for(i=0;i<n;i++){
a[i]=Integer.parseInt(sc.next());
}
for(i=0;i<n;i++){
count=0;
d=sqrt(a[i]);
if((int)d<d){
c=(int)d+1;
}
else{
c=(int)d;
}
for(j=2;j<=c;j++){
if(a[i]==2){
kekka++;
break;
}
if(a[i]%j==0){
count++;
}
if(count==1){
break;
}
if(j==c){
kekka++;
}
}
}
System.out.println(kekka);
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
40,
13,
30,
14,
2,
2,
13,
13,
17,
29,
17,
29,
17,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
14,
4,
13,
4,
18,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
78,
5
],
[
78,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
10,
11
],
[
11,
12
],
[
11,
13
],
[
9,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
14,
18
],
[
9,
19
],
[
19,
20
],
[
20,
21
],
[
9,
22
],
[
22,
23
],
[
23,
24
],
[
24,
25
],
[
25,
26
],
[
25,
27
],
[
24,
28
],
[
23,
29
],
[
29,
30
],
[
8,
31
],
[
31,
32
],
[
6,
33
],
[
33,
34
],
[
78,
35
],
[
35,
36
],
[
35,
37
],
[
37,
38
],
[
38,
39
],
[
38,
40
],
[
37,
41
],
[
41,
42
],
[
41,
43
],
[
43,
44
],
[
44,
45
],
[
37,
46
],
[
46,
47
],
[
46,
48
],
[
37,
49
],
[
49,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
49,
54
],
[
54,
55
],
[
54,
56
],
[
49,
57
],
[
57,
58
],
[
58,
59
],
[
49,
60
],
[
60,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
65,
66
],
[
61,
67
],
[
67,
68
],
[
37,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
69,
74
],
[
35,
75
],
[
75,
76
],
[
0,
77
],
[
77,
78
],
[
77,
79
]
] | [
"import java.util.Scanner;\n\npublic class Main{\n static boolean is_prime(int p){\n for(int i = 2; i * i <= p; i++)\n if(p % i == 0) return false;\n return true;\n }\n\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n int ps = scan.nextInt(); int r = 0;\n for(int i = 0; i < ps; i++)\n if(is_prime(scan.nextInt())) r++;\n System.out.println(r);\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main{\n static boolean is_prime(int p){\n for(int i = 2; i * i <= p; i++)\n if(p % i == 0) return false;\n return true;\n }\n\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n int ps = scan.nextInt(); int r = 0;\n for(int i = 0; i < ps; i++)\n if(is_prime(scan.nextInt())) r++;\n System.out.println(r);\n }\n}",
"Main",
"static boolean is_prime(int p){\n for(int i = 2; i * i <= p; i++)\n if(p % i == 0) return false;\n return true;\n }",
"is_prime",
"{\n for(int i = 2; i * i <= p; i++)\n if(p % i == 0) return false;\n return true;\n }",
"for(int i = 2; i * i <= p; i++)\n if(p % i == 0) return false;",
"int i = 2;",
"int i = 2;",
"i",
"2",
"i * i <= p",
"i * i",
"i",
"i",
"p",
"i++",
"i++",
"i",
"if(p % i == 0) return false;",
"if(p % i == 0) return false;",
"p % i == 0",
"p % i",
"p",
"i",
"0",
"return false;",
"false",
"return true;",
"true",
"int p",
"p",
"public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n int ps = scan.nextInt(); int r = 0;\n for(int i = 0; i < ps; i++)\n if(is_prime(scan.nextInt())) r++;\n System.out.println(r);\n }",
"main",
"{\n Scanner scan = new Scanner(System.in);\n int ps = scan.nextInt(); int r = 0;\n for(int i = 0; i < ps; i++)\n if(is_prime(scan.nextInt())) r++;\n System.out.println(r);\n }",
"Scanner scan = new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"int ps = scan.nextInt();",
"ps",
"scan.nextInt()",
"scan.nextInt",
"scan",
"int r = 0;",
"r",
"0",
"for(int i = 0; i < ps; i++)\n if(is_prime(scan.nextInt())) r++;",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < ps",
"i",
"ps",
"i++",
"i++",
"i",
"if(is_prime(scan.nextInt())) r++;",
"if(is_prime(scan.nextInt())) r++;",
"is_prime(scan.nextInt())",
"is_prime",
"scan.nextInt()",
"scan.nextInt",
"scan",
"r++",
"r",
"System.out.println(r)",
"System.out.println",
"System.out",
"System",
"System.out",
"r",
"String[] args",
"args",
"public class Main{\n static boolean is_prime(int p){\n for(int i = 2; i * i <= p; i++)\n if(p % i == 0) return false;\n return true;\n }\n\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n int ps = scan.nextInt(); int r = 0;\n for(int i = 0; i < ps; i++)\n if(is_prime(scan.nextInt())) r++;\n System.out.println(r);\n }\n}",
"public class Main{\n static boolean is_prime(int p){\n for(int i = 2; i * i <= p; i++)\n if(p % i == 0) return false;\n return true;\n }\n\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n int ps = scan.nextInt(); int r = 0;\n for(int i = 0; i < ps; i++)\n if(is_prime(scan.nextInt())) r++;\n System.out.println(r);\n }\n}",
"Main"
] | import java.util.Scanner;
public class Main{
static boolean is_prime(int p){
for(int i = 2; i * i <= p; i++)
if(p % i == 0) return false;
return true;
}
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
int ps = scan.nextInt(); int r = 0;
for(int i = 0; i < ps; i++)
if(is_prime(scan.nextInt())) r++;
System.out.println(r);
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
4,
13,
4,
18,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
17,
29,
17,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
0,
13,
2,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
29,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
97,
5
],
[
97,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
20
],
[
20,
21
],
[
21,
22
],
[
22,
23
],
[
22,
24
],
[
20,
25
],
[
25,
26
],
[
25,
27
],
[
20,
28
],
[
28,
29
],
[
29,
30
],
[
20,
31
],
[
32,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
34,
36
],
[
36,
37
],
[
37,
38
],
[
33,
39
],
[
39,
40
],
[
8,
41
],
[
41,
42
],
[
42,
43
],
[
43,
44
],
[
43,
45
],
[
41,
46
],
[
6,
47
],
[
47,
48
],
[
97,
49
],
[
49,
50
],
[
49,
51
],
[
51,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
52,
56
],
[
56,
57
],
[
51,
58
],
[
58,
59
],
[
59,
60
],
[
60,
61
],
[
60,
62
],
[
59,
63
],
[
58,
64
],
[
64,
65
],
[
51,
66
],
[
66,
67
],
[
67,
68
],
[
68,
69
],
[
68,
70
],
[
66,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
71,
75
],
[
66,
76
],
[
76,
77
],
[
77,
78
],
[
77,
79
],
[
79,
80
],
[
79,
81
],
[
66,
82
],
[
83,
83
],
[
83,
84
],
[
84,
85
],
[
85,
86
],
[
86,
87
],
[
86,
88
],
[
85,
89
],
[
84,
90
],
[
90,
91
],
[
51,
92
],
[
92,
93
],
[
49,
94
],
[
94,
95
],
[
0,
96
],
[
96,
97
],
[
96,
98
]
] | [
"import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] arg){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint c = 0;\n\t\t\n\t\tfor(int i=0; i < n; i++){\n\t\t\tif(PNcheck(sc.nextInt())) c++;\n\t\t}\n\t\tSystem.out.println(c);\n\t}\n\t\n\tstatic boolean PNcheck(int n){\n\t\tif(n == 2) return true;\n\t\tif((n % 2) == 0) return false;\n\t\t\n\t\tfor(int i=3; i*i <= n; i = i+2){\n\t\t\tif((n % i) == 0) return false;\n\t\t}\n\t\treturn true;\n\t}\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\tpublic static void main(String[] arg){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint c = 0;\n\t\t\n\t\tfor(int i=0; i < n; i++){\n\t\t\tif(PNcheck(sc.nextInt())) c++;\n\t\t}\n\t\tSystem.out.println(c);\n\t}\n\t\n\tstatic boolean PNcheck(int n){\n\t\tif(n == 2) return true;\n\t\tif((n % 2) == 0) return false;\n\t\t\n\t\tfor(int i=3; i*i <= n; i = i+2){\n\t\t\tif((n % i) == 0) return false;\n\t\t}\n\t\treturn true;\n\t}\n}",
"Main",
"public static void main(String[] arg){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint c = 0;\n\t\t\n\t\tfor(int i=0; i < n; i++){\n\t\t\tif(PNcheck(sc.nextInt())) c++;\n\t\t}\n\t\tSystem.out.println(c);\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint c = 0;\n\t\t\n\t\tfor(int i=0; i < n; i++){\n\t\t\tif(PNcheck(sc.nextInt())) c++;\n\t\t}\n\t\tSystem.out.println(c);\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int c = 0;",
"c",
"0",
"for(int i=0; i < n; i++){\n\t\t\tif(PNcheck(sc.nextInt())) c++;\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tif(PNcheck(sc.nextInt())) c++;\n\t\t}",
"{\n\t\t\tif(PNcheck(sc.nextInt())) c++;\n\t\t}",
"if(PNcheck(sc.nextInt())) c++;",
"PNcheck(sc.nextInt())",
"PNcheck",
"sc.nextInt()",
"sc.nextInt",
"sc",
"c++",
"c",
"System.out.println(c)",
"System.out.println",
"System.out",
"System",
"System.out",
"c",
"String[] arg",
"arg",
"static boolean PNcheck(int n){\n\t\tif(n == 2) return true;\n\t\tif((n % 2) == 0) return false;\n\t\t\n\t\tfor(int i=3; i*i <= n; i = i+2){\n\t\t\tif((n % i) == 0) return false;\n\t\t}\n\t\treturn true;\n\t}",
"PNcheck",
"{\n\t\tif(n == 2) return true;\n\t\tif((n % 2) == 0) return false;\n\t\t\n\t\tfor(int i=3; i*i <= n; i = i+2){\n\t\t\tif((n % i) == 0) return false;\n\t\t}\n\t\treturn true;\n\t}",
"if(n == 2) return true;",
"n == 2",
"n",
"2",
"return true;",
"true",
"if((n % 2) == 0) return false;",
"(n % 2) == 0",
"(n % 2)",
"n",
"2",
"0",
"return false;",
"false",
"for(int i=3; i*i <= n; i = i+2){\n\t\t\tif((n % i) == 0) return false;\n\t\t}",
"int i=3;",
"int i=3;",
"i",
"3",
"i*i <= n",
"i*i",
"i",
"i",
"n",
"i = i+2",
"i = i+2",
"i",
"i+2",
"i",
"2",
"{\n\t\t\tif((n % i) == 0) return false;\n\t\t}",
"{\n\t\t\tif((n % i) == 0) return false;\n\t\t}",
"if((n % i) == 0) return false;",
"(n % i) == 0",
"(n % i)",
"n",
"i",
"0",
"return false;",
"false",
"return true;",
"true",
"int n",
"n",
"public class Main {\n\tpublic static void main(String[] arg){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint c = 0;\n\t\t\n\t\tfor(int i=0; i < n; i++){\n\t\t\tif(PNcheck(sc.nextInt())) c++;\n\t\t}\n\t\tSystem.out.println(c);\n\t}\n\t\n\tstatic boolean PNcheck(int n){\n\t\tif(n == 2) return true;\n\t\tif((n % 2) == 0) return false;\n\t\t\n\t\tfor(int i=3; i*i <= n; i = i+2){\n\t\t\tif((n % i) == 0) return false;\n\t\t}\n\t\treturn true;\n\t}\n}",
"public class Main {\n\tpublic static void main(String[] arg){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint c = 0;\n\t\t\n\t\tfor(int i=0; i < n; i++){\n\t\t\tif(PNcheck(sc.nextInt())) c++;\n\t\t}\n\t\tSystem.out.println(c);\n\t}\n\t\n\tstatic boolean PNcheck(int n){\n\t\tif(n == 2) return true;\n\t\tif((n % 2) == 0) return false;\n\t\t\n\t\tfor(int i=3; i*i <= n; i = i+2){\n\t\t\tif((n % i) == 0) return false;\n\t\t}\n\t\treturn true;\n\t}\n}",
"Main"
] | import java.util.Scanner;
public class Main {
public static void main(String[] arg){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int c = 0;
for(int i=0; i < n; i++){
if(PNcheck(sc.nextInt())) c++;
}
System.out.println(c);
}
static boolean PNcheck(int n){
if(n == 2) return true;
if((n % 2) == 0) return false;
for(int i=3; i*i <= n; i = i+2){
if((n % i) == 0) return false;
}
return true;
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
41,
13,
17,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
4,
18,
13,
28,
13,
13,
30,
30,
0,
13,
4,
13,
13,
14,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
29,
17,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
17,
29,
17,
41,
13,
4,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
140,
14
],
[
140,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
18,
20
],
[
17,
21
],
[
21,
22
],
[
17,
23
],
[
23,
24
],
[
23,
25
],
[
17,
26
],
[
26,
27
],
[
26,
28
],
[
28,
29
],
[
29,
30
],
[
28,
31
],
[
31,
32
],
[
32,
33
],
[
17,
34
],
[
34,
35
],
[
34,
36
],
[
17,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
38,
43
],
[
43,
44
],
[
43,
45
],
[
38,
46
],
[
46,
47
],
[
47,
48
],
[
38,
49
],
[
50,
50
],
[
50,
51
],
[
51,
52
],
[
52,
53
],
[
52,
54
],
[
51,
55
],
[
55,
56
],
[
56,
57
],
[
55,
58
],
[
58,
59
],
[
59,
60
],
[
17,
61
],
[
61,
62
],
[
61,
63
],
[
61,
64
],
[
65,
65
],
[
65,
66
],
[
66,
67
],
[
66,
68
],
[
68,
69
],
[
68,
70
],
[
65,
71
],
[
71,
72
],
[
71,
73
],
[
73,
74
],
[
17,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
77,
79
],
[
75,
80
],
[
15,
81
],
[
81,
82
],
[
140,
83
],
[
83,
84
],
[
83,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
87,
89
],
[
86,
90
],
[
90,
91
],
[
86,
92
],
[
92,
93
],
[
93,
94
],
[
93,
95
],
[
92,
96
],
[
96,
97
],
[
92,
98
],
[
98,
99
],
[
99,
100
],
[
100,
101
],
[
100,
102
],
[
99,
103
],
[
98,
104
],
[
104,
105
],
[
85,
106
],
[
106,
107
],
[
106,
108
],
[
108,
109
],
[
109,
110
],
[
108,
111
],
[
85,
112
],
[
112,
113
],
[
113,
114
],
[
114,
115
],
[
114,
116
],
[
112,
117
],
[
117,
118
],
[
117,
119
],
[
112,
120
],
[
120,
121
],
[
121,
122
],
[
121,
123
],
[
112,
124
],
[
125,
125
],
[
125,
126
],
[
126,
127
],
[
127,
128
],
[
128,
129
],
[
128,
130
],
[
127,
131
],
[
126,
132
],
[
132,
133
],
[
133,
134
],
[
85,
135
],
[
135,
136
],
[
83,
137
],
[
137,
138
],
[
0,
139
],
[
139,
140
],
[
139,
141
]
] | [
"import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.List;\n\n/*Question\n/?´???°??? 1 ??¨????????°??????????????§????????????????????¶??°????´???°??¨?¨?????????????\n/????????°????????????8 ???????´???°???2, 3, 5, 7, 11, 13, 17, 19 ??¨???????????????1 ????´???°??§?????????????????????\n/n ????????´??°???????????????????????????????????????????´???°?????°???????????????????????°???????????????????????????????????? \n*/\n\n/*Input\n/??????????????? n ?????????????????????????¶???? n ?????? n ????????´??°???????????????????????? \n*/\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader sc = new BufferedReader(new InputStreamReader(System.in));\n\t\t//????????¨\n\t\tboolean b;\n\t\tint count = 0;\n\t\t/*??\\???\n\t\t/??????????´???°?????\\???????¬??????°????????\\???\n\t\t*/\n\t\tint n = Integer.parseInt(sc.readLine());\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\ta[i] = Integer.parseInt(sc.readLine());\n\t\t}\n\t\t/*??°??????????????\\???Prime???????????????\n\t\t/true??????count?????°???1?¢???????\n\t\t*/\n\t\tfor (int s:a) {\n\t\t\tb = Prime(s);\n\t\t\tif (b) count++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n\t/*Prime????????????\n\t/??????????????????????´???°???????????????????????????????????????\n\t/??????1?????????????¬????2??¨??¶??°?????????\n\t/??\\??????3??????2??\\????¢??????????????????§?????£????????????????????????\n\t*/\n\n\tpublic static boolean Prime(int s) {\n\t\tif (s < 2) return false;\n\t\telse if (s == 2) return true;\n\t\telse if (s % 2 == 0) return false;\n\t\tdouble sqrts = Math.sqrt(s);\n\t\tfor (int i = 3; i <= sqrts; i += 2) {\n\t\tif (s % i == 0) {\n\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.util.ArrayList;",
"ArrayList",
"java.util",
"import java.util.List;",
"List",
"java.util",
"public class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader sc = new BufferedReader(new InputStreamReader(System.in));\n\t\t//????????¨\n\t\tboolean b;\n\t\tint count = 0;\n\t\t/*??\\???\n\t\t/??????????´???°?????\\???????¬??????°????????\\???\n\t\t*/\n\t\tint n = Integer.parseInt(sc.readLine());\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\ta[i] = Integer.parseInt(sc.readLine());\n\t\t}\n\t\t/*??°??????????????\\???Prime???????????????\n\t\t/true??????count?????°???1?¢???????\n\t\t*/\n\t\tfor (int s:a) {\n\t\t\tb = Prime(s);\n\t\t\tif (b) count++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n\t/*Prime????????????\n\t/??????????????????????´???°???????????????????????????????????????\n\t/??????1?????????????¬????2??¨??¶??°?????????\n\t/??\\??????3??????2??\\????¢??????????????????§?????£????????????????????????\n\t*/\n\n\tpublic static boolean Prime(int s) {\n\t\tif (s < 2) return false;\n\t\telse if (s == 2) return true;\n\t\telse if (s % 2 == 0) return false;\n\t\tdouble sqrts = Math.sqrt(s);\n\t\tfor (int i = 3; i <= sqrts; i += 2) {\n\t\tif (s % i == 0) {\n\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n}",
"Main",
"public static void main(String[] args) throws Exception {\n\t\tBufferedReader sc = new BufferedReader(new InputStreamReader(System.in));\n\t\t//????????¨\n\t\tboolean b;\n\t\tint count = 0;\n\t\t/*??\\???\n\t\t/??????????´???°?????\\???????¬??????°????????\\???\n\t\t*/\n\t\tint n = Integer.parseInt(sc.readLine());\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\ta[i] = Integer.parseInt(sc.readLine());\n\t\t}\n\t\t/*??°??????????????\\???Prime???????????????\n\t\t/true??????count?????°???1?¢???????\n\t\t*/\n\t\tfor (int s:a) {\n\t\t\tb = Prime(s);\n\t\t\tif (b) count++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"main",
"{\n\t\tBufferedReader sc = new BufferedReader(new InputStreamReader(System.in));\n\t\t//????????¨\n\t\tboolean b;\n\t\tint count = 0;\n\t\t/*??\\???\n\t\t/??????????´???°?????\\???????¬??????°????????\\???\n\t\t*/\n\t\tint n = Integer.parseInt(sc.readLine());\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\ta[i] = Integer.parseInt(sc.readLine());\n\t\t}\n\t\t/*??°??????????????\\???Prime???????????????\n\t\t/true??????count?????°???1?¢???????\n\t\t*/\n\t\tfor (int s:a) {\n\t\t\tb = Prime(s);\n\t\t\tif (b) count++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"BufferedReader sc = new BufferedReader(new InputStreamReader(System.in));",
"sc",
"new BufferedReader(new InputStreamReader(System.in))",
"boolean b;",
"b",
"int count = 0;",
"count",
"0",
"int n = Integer.parseInt(sc.readLine());",
"n",
"Integer.parseInt(sc.readLine())",
"Integer.parseInt",
"Integer",
"sc.readLine()",
"sc.readLine",
"sc",
"int[] a = new int[n];",
"a",
"new int[n]",
"n",
"for(int i = 0;i < n;i++){\n\t\t\ta[i] = Integer.parseInt(sc.readLine());\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\ta[i] = Integer.parseInt(sc.readLine());\n\t\t}",
"{\n\t\t\ta[i] = Integer.parseInt(sc.readLine());\n\t\t}",
"a[i] = Integer.parseInt(sc.readLine())",
"a[i]",
"a",
"i",
"Integer.parseInt(sc.readLine())",
"Integer.parseInt",
"Integer",
"sc.readLine()",
"sc.readLine",
"sc",
"for (int s:a) {\n\t\t\tb = Prime(s);\n\t\t\tif (b) count++;\n\t\t}",
"int s",
"a",
"{\n\t\t\tb = Prime(s);\n\t\t\tif (b) count++;\n\t\t}",
"{\n\t\t\tb = Prime(s);\n\t\t\tif (b) count++;\n\t\t}",
"b = Prime(s)",
"b",
"Prime(s)",
"Prime",
"s",
"if (b) count++;",
"b",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"public static boolean Prime(int s) {\n\t\tif (s < 2) return false;\n\t\telse if (s == 2) return true;\n\t\telse if (s % 2 == 0) return false;\n\t\tdouble sqrts = Math.sqrt(s);\n\t\tfor (int i = 3; i <= sqrts; i += 2) {\n\t\tif (s % i == 0) {\n\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}",
"Prime",
"{\n\t\tif (s < 2) return false;\n\t\telse if (s == 2) return true;\n\t\telse if (s % 2 == 0) return false;\n\t\tdouble sqrts = Math.sqrt(s);\n\t\tfor (int i = 3; i <= sqrts; i += 2) {\n\t\tif (s % i == 0) {\n\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}",
"if (s < 2) return false;\n\t\telse if (s == 2) return true;\n\t\telse if (s % 2 == 0) return false;",
"s < 2",
"s",
"2",
"return false;",
"false",
"if (s == 2) return true;\n\t\telse if (s % 2 == 0) return false;",
"s == 2",
"s",
"2",
"return true;",
"true",
"if (s % 2 == 0) return false;",
"s % 2 == 0",
"s % 2",
"s",
"2",
"0",
"return false;",
"false",
"double sqrts = Math.sqrt(s);",
"sqrts",
"Math.sqrt(s)",
"Math.sqrt",
"Math",
"s",
"for (int i = 3; i <= sqrts; i += 2) {\n\t\tif (s % i == 0) {\n\t\t\treturn false;\n\t\t\t}\n\t\t}",
"int i = 3;",
"int i = 3;",
"i",
"3",
"i <= sqrts",
"i",
"sqrts",
"i += 2",
"i += 2",
"i",
"2",
"{\n\t\tif (s % i == 0) {\n\t\t\treturn false;\n\t\t\t}\n\t\t}",
"{\n\t\tif (s % i == 0) {\n\t\t\treturn false;\n\t\t\t}\n\t\t}",
"if (s % i == 0) {\n\t\t\treturn false;\n\t\t\t}",
"s % i == 0",
"s % i",
"s",
"i",
"0",
"{\n\t\t\treturn false;\n\t\t\t}",
"return false;",
"false",
"return true;",
"true",
"int s",
"s",
"public class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader sc = new BufferedReader(new InputStreamReader(System.in));\n\t\t//????????¨\n\t\tboolean b;\n\t\tint count = 0;\n\t\t/*??\\???\n\t\t/??????????´???°?????\\???????¬??????°????????\\???\n\t\t*/\n\t\tint n = Integer.parseInt(sc.readLine());\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\ta[i] = Integer.parseInt(sc.readLine());\n\t\t}\n\t\t/*??°??????????????\\???Prime???????????????\n\t\t/true??????count?????°???1?¢???????\n\t\t*/\n\t\tfor (int s:a) {\n\t\t\tb = Prime(s);\n\t\t\tif (b) count++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n\t/*Prime????????????\n\t/??????????????????????´???°???????????????????????????????????????\n\t/??????1?????????????¬????2??¨??¶??°?????????\n\t/??\\??????3??????2??\\????¢??????????????????§?????£????????????????????????\n\t*/\n\n\tpublic static boolean Prime(int s) {\n\t\tif (s < 2) return false;\n\t\telse if (s == 2) return true;\n\t\telse if (s % 2 == 0) return false;\n\t\tdouble sqrts = Math.sqrt(s);\n\t\tfor (int i = 3; i <= sqrts; i += 2) {\n\t\tif (s % i == 0) {\n\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n}",
"public class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader sc = new BufferedReader(new InputStreamReader(System.in));\n\t\t//????????¨\n\t\tboolean b;\n\t\tint count = 0;\n\t\t/*??\\???\n\t\t/??????????´???°?????\\???????¬??????°????????\\???\n\t\t*/\n\t\tint n = Integer.parseInt(sc.readLine());\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\ta[i] = Integer.parseInt(sc.readLine());\n\t\t}\n\t\t/*??°??????????????\\???Prime???????????????\n\t\t/true??????count?????°???1?¢???????\n\t\t*/\n\t\tfor (int s:a) {\n\t\t\tb = Prime(s);\n\t\t\tif (b) count++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n\t/*Prime????????????\n\t/??????????????????????´???°???????????????????????????????????????\n\t/??????1?????????????¬????2??¨??¶??°?????????\n\t/??\\??????3??????2??\\????¢??????????????????§?????£????????????????????????\n\t*/\n\n\tpublic static boolean Prime(int s) {\n\t\tif (s < 2) return false;\n\t\telse if (s == 2) return true;\n\t\telse if (s % 2 == 0) return false;\n\t\tdouble sqrts = Math.sqrt(s);\n\t\tfor (int i = 3; i <= sqrts; i += 2) {\n\t\tif (s % i == 0) {\n\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n}",
"Main"
] | import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
/*Question
/?´???°??? 1 ??¨????????°??????????????§????????????????????¶??°????´???°??¨?¨?????????????
/????????°????????????8 ???????´???°???2, 3, 5, 7, 11, 13, 17, 19 ??¨???????????????1 ????´???°??§?????????????????????
/n ????????´??°???????????????????????????????????????????´???°?????°???????????????????????°????????????????????????????????????
*/
/*Input
/??????????????? n ?????????????????????????¶???? n ?????? n ????????´??°????????????????????????
*/
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader sc = new BufferedReader(new InputStreamReader(System.in));
//????????¨
boolean b;
int count = 0;
/*??\???
/??????????´???°?????\???????¬??????°????????\???
*/
int n = Integer.parseInt(sc.readLine());
int[] a = new int[n];
for(int i = 0;i < n;i++){
a[i] = Integer.parseInt(sc.readLine());
}
/*??°??????????????\???Prime???????????????
/true??????count?????°???1?¢???????
*/
for (int s:a) {
b = Prime(s);
if (b) count++;
}
System.out.println(count);
}
/*Prime????????????
/??????????????????????´???°???????????????????????????????????????
/??????1?????????????¬????2??¨??¶??°?????????
/??\??????3??????2??\????¢??????????????????§?????£????????????????????????
*/
public static boolean Prime(int s) {
if (s < 2) return false;
else if (s == 2) return true;
else if (s % 2 == 0) return false;
double sqrts = Math.sqrt(s);
for (int i = 3; i <= sqrts; i += 2) {
if (s % i == 0) {
return false;
}
}
return true;
}
} |
[
7,
15,
13,
17,
6,
13,
41,
13,
12,
13,
30,
0,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
14,
2,
2,
13,
17,
2,
13,
17,
30,
40,
13,
9,
41,
13,
17,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
30,
0,
13,
17,
3,
14,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
94,
5
],
[
94,
6
],
[
6,
7
],
[
94,
8
],
[
8,
9
],
[
8,
10
],
[
10,
11
],
[
11,
12
],
[
11,
13
],
[
10,
14
],
[
14,
15
],
[
14,
16
],
[
16,
17
],
[
17,
18
],
[
10,
19
],
[
19,
20
],
[
19,
21
],
[
10,
22
],
[
22,
23
],
[
23,
24
],
[
24,
25
],
[
24,
26
],
[
22,
27
],
[
27,
28
],
[
27,
29
],
[
22,
30
],
[
30,
31
],
[
31,
32
],
[
22,
33
],
[
34,
34
],
[
34,
35
],
[
35,
36
],
[
35,
37
],
[
37,
38
],
[
38,
39
],
[
34,
40
],
[
40,
41
],
[
41,
42
],
[
42,
43
],
[
42,
44
],
[
41,
45
],
[
45,
46
],
[
45,
47
],
[
40,
48
],
[
48,
49
],
[
49,
50
],
[
48,
51
],
[
34,
52
],
[
52,
53
],
[
52,
54
],
[
34,
55
],
[
55,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
55,
60
],
[
60,
61
],
[
61,
62
],
[
61,
63
],
[
60,
64
],
[
55,
65
],
[
65,
66
],
[
66,
67
],
[
55,
68
],
[
69,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
71,
75
],
[
70,
76
],
[
76,
77
],
[
77,
78
],
[
77,
79
],
[
76,
80
],
[
34,
81
],
[
81,
82
],
[
81,
83
],
[
83,
84
],
[
10,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
87,
89
],
[
85,
90
],
[
8,
91
],
[
91,
92
],
[
0,
93
],
[
93,
94
],
[
93,
95
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n public static Scanner sc;\n public static void main(String[] args) throws Exception {\n sc = new Scanner(System.in);\n int n = sc.nextInt();\n int res = 0;\n for (int i = 0; i < n; i++) {\n int num = sc.nextInt();\n if (num == 2 || num == 3) {\n res++;\n continue;\n }\n boolean b = true;\n for (int j = 2; j*j <= num; j++) {\n if (num%j == 0) {\n b = false;\n break;\n }\n }\n if (b) res++;\n }\n System.out.println(res);\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n public static Scanner sc;\n public static void main(String[] args) throws Exception {\n sc = new Scanner(System.in);\n int n = sc.nextInt();\n int res = 0;\n for (int i = 0; i < n; i++) {\n int num = sc.nextInt();\n if (num == 2 || num == 3) {\n res++;\n continue;\n }\n boolean b = true;\n for (int j = 2; j*j <= num; j++) {\n if (num%j == 0) {\n b = false;\n break;\n }\n }\n if (b) res++;\n }\n System.out.println(res);\n }\n}",
"Main",
"public static Scanner sc;",
"sc",
"public static void main(String[] args) throws Exception {\n sc = new Scanner(System.in);\n int n = sc.nextInt();\n int res = 0;\n for (int i = 0; i < n; i++) {\n int num = sc.nextInt();\n if (num == 2 || num == 3) {\n res++;\n continue;\n }\n boolean b = true;\n for (int j = 2; j*j <= num; j++) {\n if (num%j == 0) {\n b = false;\n break;\n }\n }\n if (b) res++;\n }\n System.out.println(res);\n }",
"main",
"{\n sc = new Scanner(System.in);\n int n = sc.nextInt();\n int res = 0;\n for (int i = 0; i < n; i++) {\n int num = sc.nextInt();\n if (num == 2 || num == 3) {\n res++;\n continue;\n }\n boolean b = true;\n for (int j = 2; j*j <= num; j++) {\n if (num%j == 0) {\n b = false;\n break;\n }\n }\n if (b) res++;\n }\n System.out.println(res);\n }",
"sc = new Scanner(System.in)",
"sc",
"new Scanner(System.in)",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int res = 0;",
"res",
"0",
"for (int i = 0; i < n; i++) {\n int num = sc.nextInt();\n if (num == 2 || num == 3) {\n res++;\n continue;\n }\n boolean b = true;\n for (int j = 2; j*j <= num; j++) {\n if (num%j == 0) {\n b = false;\n break;\n }\n }\n if (b) res++;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n int num = sc.nextInt();\n if (num == 2 || num == 3) {\n res++;\n continue;\n }\n boolean b = true;\n for (int j = 2; j*j <= num; j++) {\n if (num%j == 0) {\n b = false;\n break;\n }\n }\n if (b) res++;\n }",
"{\n int num = sc.nextInt();\n if (num == 2 || num == 3) {\n res++;\n continue;\n }\n boolean b = true;\n for (int j = 2; j*j <= num; j++) {\n if (num%j == 0) {\n b = false;\n break;\n }\n }\n if (b) res++;\n }",
"int num = sc.nextInt();",
"num",
"sc.nextInt()",
"sc.nextInt",
"sc",
"if (num == 2 || num == 3) {\n res++;\n continue;\n }",
"num == 2 || num == 3",
"num == 2",
"num",
"2",
"num == 3",
"num",
"3",
"{\n res++;\n continue;\n }",
"res++",
"res",
"continue;",
"boolean b = true;",
"b",
"true",
"for (int j = 2; j*j <= num; j++) {\n if (num%j == 0) {\n b = false;\n break;\n }\n }",
"int j = 2;",
"int j = 2;",
"j",
"2",
"j*j <= num",
"j*j",
"j",
"j",
"num",
"j++",
"j++",
"j",
"{\n if (num%j == 0) {\n b = false;\n break;\n }\n }",
"{\n if (num%j == 0) {\n b = false;\n break;\n }\n }",
"if (num%j == 0) {\n b = false;\n break;\n }",
"num%j == 0",
"num%j",
"num",
"j",
"0",
"{\n b = false;\n break;\n }",
"b = false",
"b",
"false",
"break;",
"if (b) res++;",
"b",
"res++",
"res",
"System.out.println(res)",
"System.out.println",
"System.out",
"System",
"System.out",
"res",
"String[] args",
"args",
"public class Main {\n public static Scanner sc;\n public static void main(String[] args) throws Exception {\n sc = new Scanner(System.in);\n int n = sc.nextInt();\n int res = 0;\n for (int i = 0; i < n; i++) {\n int num = sc.nextInt();\n if (num == 2 || num == 3) {\n res++;\n continue;\n }\n boolean b = true;\n for (int j = 2; j*j <= num; j++) {\n if (num%j == 0) {\n b = false;\n break;\n }\n }\n if (b) res++;\n }\n System.out.println(res);\n }\n}",
"public class Main {\n public static Scanner sc;\n public static void main(String[] args) throws Exception {\n sc = new Scanner(System.in);\n int n = sc.nextInt();\n int res = 0;\n for (int i = 0; i < n; i++) {\n int num = sc.nextInt();\n if (num == 2 || num == 3) {\n res++;\n continue;\n }\n boolean b = true;\n for (int j = 2; j*j <= num; j++) {\n if (num%j == 0) {\n b = false;\n break;\n }\n }\n if (b) res++;\n }\n System.out.println(res);\n }\n}",
"Main"
] | import java.util.Scanner;
public class Main {
public static Scanner sc;
public static void main(String[] args) throws Exception {
sc = new Scanner(System.in);
int n = sc.nextInt();
int res = 0;
for (int i = 0; i < n; i++) {
int num = sc.nextInt();
if (num == 2 || num == 3) {
res++;
continue;
}
boolean b = true;
for (int j = 2; j*j <= num; j++) {
if (num%j == 0) {
b = false;
break;
}
}
if (b) res++;
}
System.out.println(res);
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
4,
13,
4,
18,
13,
4,
18,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
17,
29,
17,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
17,
29,
17,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
29,
17,
14,
2,
2,
13,
2,
13,
17,
17,
29,
17,
29,
17,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
14,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
20,
23
],
[
23,
24
],
[
24,
25
],
[
14,
26
],
[
26,
27
],
[
26,
28
],
[
14,
29
],
[
29,
30
],
[
30,
31
],
[
31,
32
],
[
31,
33
],
[
29,
34
],
[
34,
35
],
[
34,
36
],
[
29,
37
],
[
37,
38
],
[
38,
39
],
[
29,
40
],
[
41,
41
],
[
41,
42
],
[
42,
43
],
[
43,
44
],
[
43,
45
],
[
45,
46
],
[
46,
47
],
[
45,
48
],
[
48,
49
],
[
49,
50
],
[
42,
51
],
[
51,
52
],
[
14,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
53,
58
],
[
12,
59
],
[
59,
60
],
[
10,
61
],
[
61,
62
],
[
61,
63
],
[
63,
64
],
[
64,
65
],
[
65,
66
],
[
65,
67
],
[
64,
68
],
[
68,
69
],
[
64,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
71,
75
],
[
70,
76
],
[
76,
77
],
[
70,
78
],
[
78,
79
],
[
79,
80
],
[
79,
81
],
[
78,
82
],
[
82,
83
],
[
78,
84
],
[
84,
85
],
[
85,
86
],
[
86,
87
],
[
86,
88
],
[
85,
89
],
[
84,
90
],
[
90,
91
],
[
63,
92
],
[
92,
93
],
[
93,
94
],
[
94,
95
],
[
94,
96
],
[
92,
97
],
[
97,
98
],
[
98,
99
],
[
98,
100
],
[
97,
101
],
[
92,
102
],
[
102,
103
],
[
103,
104
],
[
103,
105
],
[
92,
106
],
[
107,
107
],
[
107,
108
],
[
108,
109
],
[
109,
110
],
[
110,
111
],
[
110,
112
],
[
109,
113
],
[
108,
114
],
[
114,
115
],
[
107,
116
],
[
116,
117
],
[
117,
118
],
[
118,
119
],
[
118,
120
],
[
120,
121
],
[
120,
122
],
[
117,
123
],
[
116,
124
],
[
124,
125
],
[
63,
126
],
[
126,
127
],
[
61,
128
],
[
128,
129
]
] | [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\nclass Main{\n public static void main(String[] args) throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int cnt = 0;\n for(int i=0;i<n;i++){\n if(isPrime(Integer.parseInt(br.readLine())))cnt++;\n }\n System.out.println(cnt);\n }\n public static boolean isPrime(int x){\n if(x == 2)return true; // 2\n else if(x % 2 == 0)return false;\n else if(x <= 7)return true; // 3,5,7\n else if(x % 3 == 0)return false;\n\n for(int i=5; i*i<=x; i+=6){\n if(x % i == 0)return false;\n if(x % (i + 2) == 0)return false;\n }\n return true;\n }\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"class Main{\n public static void main(String[] args) throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int cnt = 0;\n for(int i=0;i<n;i++){\n if(isPrime(Integer.parseInt(br.readLine())))cnt++;\n }\n System.out.println(cnt);\n }\n public static boolean isPrime(int x){\n if(x == 2)return true; // 2\n else if(x % 2 == 0)return false;\n else if(x <= 7)return true; // 3,5,7\n else if(x % 3 == 0)return false;\n\n for(int i=5; i*i<=x; i+=6){\n if(x % i == 0)return false;\n if(x % (i + 2) == 0)return false;\n }\n return true;\n }\n}",
"Main",
"public static void main(String[] args) throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int cnt = 0;\n for(int i=0;i<n;i++){\n if(isPrime(Integer.parseInt(br.readLine())))cnt++;\n }\n System.out.println(cnt);\n }",
"main",
"{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int cnt = 0;\n for(int i=0;i<n;i++){\n if(isPrime(Integer.parseInt(br.readLine())))cnt++;\n }\n System.out.println(cnt);\n }",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"int n = Integer.parseInt(br.readLine());",
"n",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"int cnt = 0;",
"cnt",
"0",
"for(int i=0;i<n;i++){\n if(isPrime(Integer.parseInt(br.readLine())))cnt++;\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n if(isPrime(Integer.parseInt(br.readLine())))cnt++;\n }",
"{\n if(isPrime(Integer.parseInt(br.readLine())))cnt++;\n }",
"if(isPrime(Integer.parseInt(br.readLine())))cnt++;",
"isPrime(Integer.parseInt(br.readLine()))",
"isPrime",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"cnt++",
"cnt",
"System.out.println(cnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"String[] args",
"args",
"public static boolean isPrime(int x){\n if(x == 2)return true; // 2\n else if(x % 2 == 0)return false;\n else if(x <= 7)return true; // 3,5,7\n else if(x % 3 == 0)return false;\n\n for(int i=5; i*i<=x; i+=6){\n if(x % i == 0)return false;\n if(x % (i + 2) == 0)return false;\n }\n return true;\n }",
"isPrime",
"{\n if(x == 2)return true; // 2\n else if(x % 2 == 0)return false;\n else if(x <= 7)return true; // 3,5,7\n else if(x % 3 == 0)return false;\n\n for(int i=5; i*i<=x; i+=6){\n if(x % i == 0)return false;\n if(x % (i + 2) == 0)return false;\n }\n return true;\n }",
"if(x == 2)return true; // 2\n else if(x % 2 == 0)return false;\n else if(x <= 7)return true; // 3,5,7\n else if(x % 3 == 0)return false;",
"x == 2",
"x",
"2",
"return true; // 2",
"true",
"if(x % 2 == 0)return false;\n else if(x <= 7)return true; // 3,5,7\n else if(x % 3 == 0)return false;",
"x % 2 == 0",
"x % 2",
"x",
"2",
"0",
"return false;",
"false",
"if(x <= 7)return true; // 3,5,7\n else if(x % 3 == 0)return false;",
"x <= 7",
"x",
"7",
"return true; // 3,5,7",
"true",
"if(x % 3 == 0)return false;",
"x % 3 == 0",
"x % 3",
"x",
"3",
"0",
"return false;",
"false",
"for(int i=5; i*i<=x; i+=6){\n if(x % i == 0)return false;\n if(x % (i + 2) == 0)return false;\n }",
"int i=5;",
"int i=5;",
"i",
"5",
"i*i<=x",
"i*i",
"i",
"i",
"x",
"i+=6",
"i+=6",
"i",
"6",
"{\n if(x % i == 0)return false;\n if(x % (i + 2) == 0)return false;\n }",
"{\n if(x % i == 0)return false;\n if(x % (i + 2) == 0)return false;\n }",
"if(x % i == 0)return false;",
"x % i == 0",
"x % i",
"x",
"i",
"0",
"return false;",
"false",
"if(x % (i + 2) == 0)return false;",
"x % (i + 2) == 0",
"x % (i + 2)",
"x",
"(i + 2)",
"i",
"2",
"0",
"return false;",
"false",
"return true;",
"true",
"int x",
"x"
] | 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 cnt = 0;
for(int i=0;i<n;i++){
if(isPrime(Integer.parseInt(br.readLine())))cnt++;
}
System.out.println(cnt);
}
public static boolean isPrime(int x){
if(x == 2)return true; // 2
else if(x % 2 == 0)return false;
else if(x <= 7)return true; // 3,5,7
else if(x % 3 == 0)return false;
for(int i=5; i*i<=x; i+=6){
if(x % i == 0)return false;
if(x % (i + 2) == 0)return false;
}
return true;
}
} |
[
7,
15,
13,
17,
6,
13,
41,
13,
20,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
4,
13,
4,
18,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
41,
13,
4,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
29,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
85,
5
],
[
85,
6
],
[
6,
7
],
[
6,
8
],
[
85,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
11,
17
],
[
17,
18
],
[
17,
19
],
[
11,
20
],
[
20,
21
],
[
21,
22
],
[
22,
23
],
[
22,
24
],
[
20,
25
],
[
25,
26
],
[
25,
27
],
[
20,
28
],
[
28,
29
],
[
29,
30
],
[
20,
31
],
[
32,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
34,
36
],
[
36,
37
],
[
37,
38
],
[
33,
39
],
[
39,
40
],
[
40,
41
],
[
11,
42
],
[
42,
43
],
[
43,
44
],
[
44,
45
],
[
44,
46
],
[
42,
47
],
[
9,
48
],
[
48,
49
],
[
85,
50
],
[
50,
51
],
[
50,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
55,
56
],
[
56,
57
],
[
55,
58
],
[
52,
59
],
[
59,
60
],
[
60,
61
],
[
61,
62
],
[
61,
63
],
[
59,
64
],
[
64,
65
],
[
64,
66
],
[
59,
67
],
[
67,
68
],
[
68,
69
],
[
59,
70
],
[
71,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
74,
75
],
[
74,
76
],
[
73,
77
],
[
72,
78
],
[
78,
79
],
[
52,
80
],
[
80,
81
],
[
50,
82
],
[
82,
83
],
[
0,
84
],
[
84,
85
],
[
84,
86
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n static Scanner sc = new Scanner(System.in);\n\n public static void main(String[] args) {\n int n = sc.nextInt();\n int count = 0;\n for (int i = 0; i < n; i++) {\n if (isPrimeNumber(sc.nextInt())) {\n count++;\n }\n }\n System.out.println(count);\n }\n\n private static boolean isPrimeNumber(int num) {\n double max = Math.sqrt(num);\n for (int i = 2; i <= max; i++) {\n if (num % i == 0) return false;\n }\n return true;\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n static Scanner sc = new Scanner(System.in);\n\n public static void main(String[] args) {\n int n = sc.nextInt();\n int count = 0;\n for (int i = 0; i < n; i++) {\n if (isPrimeNumber(sc.nextInt())) {\n count++;\n }\n }\n System.out.println(count);\n }\n\n private static boolean isPrimeNumber(int num) {\n double max = Math.sqrt(num);\n for (int i = 2; i <= max; i++) {\n if (num % i == 0) return false;\n }\n return true;\n }\n}",
"Main",
"static Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"public static void main(String[] args) {\n int n = sc.nextInt();\n int count = 0;\n for (int i = 0; i < n; i++) {\n if (isPrimeNumber(sc.nextInt())) {\n count++;\n }\n }\n System.out.println(count);\n }",
"main",
"{\n int n = sc.nextInt();\n int count = 0;\n for (int i = 0; i < n; i++) {\n if (isPrimeNumber(sc.nextInt())) {\n count++;\n }\n }\n System.out.println(count);\n }",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int count = 0;",
"count",
"0",
"for (int i = 0; i < n; i++) {\n if (isPrimeNumber(sc.nextInt())) {\n count++;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n if (isPrimeNumber(sc.nextInt())) {\n count++;\n }\n }",
"{\n if (isPrimeNumber(sc.nextInt())) {\n count++;\n }\n }",
"if (isPrimeNumber(sc.nextInt())) {\n count++;\n }",
"isPrimeNumber(sc.nextInt())",
"isPrimeNumber",
"sc.nextInt()",
"sc.nextInt",
"sc",
"{\n count++;\n }",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"private static boolean isPrimeNumber(int num) {\n double max = Math.sqrt(num);\n for (int i = 2; i <= max; i++) {\n if (num % i == 0) return false;\n }\n return true;\n }",
"isPrimeNumber",
"{\n double max = Math.sqrt(num);\n for (int i = 2; i <= max; i++) {\n if (num % i == 0) return false;\n }\n return true;\n }",
"double max = Math.sqrt(num);",
"max",
"Math.sqrt(num)",
"Math.sqrt",
"Math",
"num",
"for (int i = 2; i <= max; i++) {\n if (num % i == 0) return false;\n }",
"int i = 2;",
"int i = 2;",
"i",
"2",
"i <= max",
"i",
"max",
"i++",
"i++",
"i",
"{\n if (num % i == 0) return false;\n }",
"{\n if (num % i == 0) return false;\n }",
"if (num % i == 0) return false;",
"num % i == 0",
"num % i",
"num",
"i",
"0",
"return false;",
"false",
"return true;",
"true",
"int num",
"num",
"public class Main {\n static Scanner sc = new Scanner(System.in);\n\n public static void main(String[] args) {\n int n = sc.nextInt();\n int count = 0;\n for (int i = 0; i < n; i++) {\n if (isPrimeNumber(sc.nextInt())) {\n count++;\n }\n }\n System.out.println(count);\n }\n\n private static boolean isPrimeNumber(int num) {\n double max = Math.sqrt(num);\n for (int i = 2; i <= max; i++) {\n if (num % i == 0) return false;\n }\n return true;\n }\n}",
"public class Main {\n static Scanner sc = new Scanner(System.in);\n\n public static void main(String[] args) {\n int n = sc.nextInt();\n int count = 0;\n for (int i = 0; i < n; i++) {\n if (isPrimeNumber(sc.nextInt())) {\n count++;\n }\n }\n System.out.println(count);\n }\n\n private static boolean isPrimeNumber(int num) {\n double max = Math.sqrt(num);\n for (int i = 2; i <= max; i++) {\n if (num % i == 0) return false;\n }\n return true;\n }\n}",
"Main"
] | import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
int n = sc.nextInt();
int count = 0;
for (int i = 0; i < n; i++) {
if (isPrimeNumber(sc.nextInt())) {
count++;
}
}
System.out.println(count);
}
private static boolean isPrimeNumber(int num) {
double max = Math.sqrt(num);
for (int i = 2; i <= max; i++) {
if (num % i == 0) return false;
}
return true;
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
41,
13,
41,
13,
41,
13,
17,
0,
13,
4,
18,
13,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
4,
18,
13,
0,
13,
4,
13,
13,
4,
18,
18,
13,
13,
13,
4,
18,
13,
23,
13,
12,
13,
30,
29,
2,
13,
17,
23,
13,
12,
13,
30,
41,
13,
41,
13,
41,
13,
14,
2,
13,
17,
30,
29,
17,
0,
13,
4,
13,
13,
14,
2,
13,
17,
30,
29,
17,
30,
0,
13,
4,
18,
13,
13,
11,
1,
0,
13,
17,
2,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
132,
5
],
[
132,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
8,
14
],
[
14,
15
],
[
8,
16
],
[
16,
17
],
[
8,
18
],
[
18,
19
],
[
18,
20
],
[
8,
21
],
[
21,
22
],
[
21,
23
],
[
23,
24
],
[
24,
25
],
[
8,
26
],
[
26,
27
],
[
27,
28
],
[
28,
29
],
[
28,
30
],
[
26,
31
],
[
31,
32
],
[
31,
33
],
[
26,
34
],
[
34,
35
],
[
35,
36
],
[
26,
37
],
[
38,
38
],
[
38,
39
],
[
39,
40
],
[
39,
41
],
[
41,
42
],
[
42,
43
],
[
38,
44
],
[
44,
45
],
[
44,
46
],
[
46,
47
],
[
46,
48
],
[
8,
49
],
[
49,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
49,
54
],
[
8,
55
],
[
55,
56
],
[
56,
57
],
[
6,
58
],
[
58,
59
],
[
132,
60
],
[
60,
61
],
[
60,
62
],
[
62,
63
],
[
63,
64
],
[
64,
65
],
[
64,
66
],
[
60,
67
],
[
67,
68
],
[
132,
69
],
[
69,
70
],
[
69,
71
],
[
71,
72
],
[
72,
73
],
[
71,
74
],
[
74,
75
],
[
71,
76
],
[
76,
77
],
[
71,
78
],
[
78,
79
],
[
79,
80
],
[
79,
81
],
[
78,
82
],
[
82,
83
],
[
83,
84
],
[
71,
85
],
[
85,
86
],
[
85,
87
],
[
87,
88
],
[
87,
89
],
[
71,
90
],
[
90,
91
],
[
91,
92
],
[
91,
93
],
[
90,
94
],
[
94,
95
],
[
95,
96
],
[
90,
97
],
[
97,
98
],
[
98,
99
],
[
98,
100
],
[
100,
101
],
[
101,
102
],
[
100,
103
],
[
97,
104
],
[
104,
105
],
[
105,
106
],
[
106,
107
],
[
106,
108
],
[
104,
109
],
[
109,
110
],
[
109,
111
],
[
104,
112
],
[
112,
113
],
[
113,
114
],
[
113,
115
],
[
104,
116
],
[
117,
117
],
[
117,
118
],
[
118,
119
],
[
119,
120
],
[
120,
121
],
[
120,
122
],
[
119,
123
],
[
118,
124
],
[
124,
125
],
[
125,
126
],
[
71,
127
],
[
127,
128
],
[
69,
129
],
[
129,
130
],
[
0,
131
],
[
131,
132
],
[
131,
133
]
] | [
"import java.util.Scanner;\n\npublic class Main{\n\n\tpublic static void main(String[] args){\n\t\tScanner scan=new Scanner(System.in);\n\t\tint i,n,num,count=0;\n\t\tn=scan.nextInt();\n\t\tfor(i=0;i<n;i++) {\n\t\t\tnum=scan.nextInt();\n\t\t\tcount+=checkpm(num);\n\t\t}\n\t\tSystem.out.println(count);\n\t\tscan.close();\n\t}\n\tpublic static int checkem(int num) {\n\t\treturn num%2;\n\t}\n\tpublic static int checkpm(int num) {\n\t\tint i,ans;\n\t\tdouble root;\n\t\tif(num==2) {\n\t\t\treturn 1;\n\t\t}\n\t\tans=checkem(num);\n\t\tif(ans==0) {\n\t\t\treturn 0;\n\t\t}\n\t\telse {\n\t\t\troot=Math.sqrt(num);\n\t\t\tfor(i=3;i<=root;i+=2) {\n\t\t\t\tif(num%i==0) {\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 1;\n\t}\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main{\n\n\tpublic static void main(String[] args){\n\t\tScanner scan=new Scanner(System.in);\n\t\tint i,n,num,count=0;\n\t\tn=scan.nextInt();\n\t\tfor(i=0;i<n;i++) {\n\t\t\tnum=scan.nextInt();\n\t\t\tcount+=checkpm(num);\n\t\t}\n\t\tSystem.out.println(count);\n\t\tscan.close();\n\t}\n\tpublic static int checkem(int num) {\n\t\treturn num%2;\n\t}\n\tpublic static int checkpm(int num) {\n\t\tint i,ans;\n\t\tdouble root;\n\t\tif(num==2) {\n\t\t\treturn 1;\n\t\t}\n\t\tans=checkem(num);\n\t\tif(ans==0) {\n\t\t\treturn 0;\n\t\t}\n\t\telse {\n\t\t\troot=Math.sqrt(num);\n\t\t\tfor(i=3;i<=root;i+=2) {\n\t\t\t\tif(num%i==0) {\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 1;\n\t}\n}",
"Main",
"public static void main(String[] args){\n\t\tScanner scan=new Scanner(System.in);\n\t\tint i,n,num,count=0;\n\t\tn=scan.nextInt();\n\t\tfor(i=0;i<n;i++) {\n\t\t\tnum=scan.nextInt();\n\t\t\tcount+=checkpm(num);\n\t\t}\n\t\tSystem.out.println(count);\n\t\tscan.close();\n\t}",
"main",
"{\n\t\tScanner scan=new Scanner(System.in);\n\t\tint i,n,num,count=0;\n\t\tn=scan.nextInt();\n\t\tfor(i=0;i<n;i++) {\n\t\t\tnum=scan.nextInt();\n\t\t\tcount+=checkpm(num);\n\t\t}\n\t\tSystem.out.println(count);\n\t\tscan.close();\n\t}",
"Scanner scan=new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"int i",
"i",
"n",
"n",
"num",
"num",
"count=0;",
"count",
"0",
"n=scan.nextInt()",
"n",
"scan.nextInt()",
"scan.nextInt",
"scan",
"for(i=0;i<n;i++) {\n\t\t\tnum=scan.nextInt();\n\t\t\tcount+=checkpm(num);\n\t\t}",
"i=0;",
"i=0",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tnum=scan.nextInt();\n\t\t\tcount+=checkpm(num);\n\t\t}",
"{\n\t\t\tnum=scan.nextInt();\n\t\t\tcount+=checkpm(num);\n\t\t}",
"num=scan.nextInt()",
"num",
"scan.nextInt()",
"scan.nextInt",
"scan",
"count+=checkpm(num)",
"count",
"checkpm(num)",
"checkpm",
"num",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"scan.close()",
"scan.close",
"scan",
"String[] args",
"args",
"public static int checkem(int num) {\n\t\treturn num%2;\n\t}",
"checkem",
"{\n\t\treturn num%2;\n\t}",
"return num%2;",
"num%2",
"num",
"2",
"int num",
"num",
"public static int checkpm(int num) {\n\t\tint i,ans;\n\t\tdouble root;\n\t\tif(num==2) {\n\t\t\treturn 1;\n\t\t}\n\t\tans=checkem(num);\n\t\tif(ans==0) {\n\t\t\treturn 0;\n\t\t}\n\t\telse {\n\t\t\troot=Math.sqrt(num);\n\t\t\tfor(i=3;i<=root;i+=2) {\n\t\t\t\tif(num%i==0) {\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 1;\n\t}",
"checkpm",
"{\n\t\tint i,ans;\n\t\tdouble root;\n\t\tif(num==2) {\n\t\t\treturn 1;\n\t\t}\n\t\tans=checkem(num);\n\t\tif(ans==0) {\n\t\t\treturn 0;\n\t\t}\n\t\telse {\n\t\t\troot=Math.sqrt(num);\n\t\t\tfor(i=3;i<=root;i+=2) {\n\t\t\t\tif(num%i==0) {\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 1;\n\t}",
"int i",
"i",
"ans;",
"ans",
"double root;",
"root",
"if(num==2) {\n\t\t\treturn 1;\n\t\t}",
"num==2",
"num",
"2",
"{\n\t\t\treturn 1;\n\t\t}",
"return 1;",
"1",
"ans=checkem(num)",
"ans",
"checkem(num)",
"checkem",
"num",
"if(ans==0) {\n\t\t\treturn 0;\n\t\t}\n\t\telse {\n\t\t\troot=Math.sqrt(num);\n\t\t\tfor(i=3;i<=root;i+=2) {\n\t\t\t\tif(num%i==0) {\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"ans==0",
"ans",
"0",
"{\n\t\t\treturn 0;\n\t\t}",
"return 0;",
"0",
"{\n\t\t\troot=Math.sqrt(num);\n\t\t\tfor(i=3;i<=root;i+=2) {\n\t\t\t\tif(num%i==0) {\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"root=Math.sqrt(num)",
"root",
"Math.sqrt(num)",
"Math.sqrt",
"Math",
"num",
"for(i=3;i<=root;i+=2) {\n\t\t\t\tif(num%i==0) {\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}",
"i=3;",
"i=3",
"i",
"3",
"i<=root",
"i",
"root",
"i+=2",
"i+=2",
"i",
"2",
"{\n\t\t\t\tif(num%i==0) {\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif(num%i==0) {\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}",
"if(num%i==0) {\n\t\t\t\t\treturn 0;\n\t\t\t\t}",
"num%i==0",
"num%i",
"num",
"i",
"0",
"{\n\t\t\t\t\treturn 0;\n\t\t\t\t}",
"return 0;",
"0",
"return 1;",
"1",
"int num",
"num",
"public class Main{\n\n\tpublic static void main(String[] args){\n\t\tScanner scan=new Scanner(System.in);\n\t\tint i,n,num,count=0;\n\t\tn=scan.nextInt();\n\t\tfor(i=0;i<n;i++) {\n\t\t\tnum=scan.nextInt();\n\t\t\tcount+=checkpm(num);\n\t\t}\n\t\tSystem.out.println(count);\n\t\tscan.close();\n\t}\n\tpublic static int checkem(int num) {\n\t\treturn num%2;\n\t}\n\tpublic static int checkpm(int num) {\n\t\tint i,ans;\n\t\tdouble root;\n\t\tif(num==2) {\n\t\t\treturn 1;\n\t\t}\n\t\tans=checkem(num);\n\t\tif(ans==0) {\n\t\t\treturn 0;\n\t\t}\n\t\telse {\n\t\t\troot=Math.sqrt(num);\n\t\t\tfor(i=3;i<=root;i+=2) {\n\t\t\t\tif(num%i==0) {\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 1;\n\t}\n}",
"public class Main{\n\n\tpublic static void main(String[] args){\n\t\tScanner scan=new Scanner(System.in);\n\t\tint i,n,num,count=0;\n\t\tn=scan.nextInt();\n\t\tfor(i=0;i<n;i++) {\n\t\t\tnum=scan.nextInt();\n\t\t\tcount+=checkpm(num);\n\t\t}\n\t\tSystem.out.println(count);\n\t\tscan.close();\n\t}\n\tpublic static int checkem(int num) {\n\t\treturn num%2;\n\t}\n\tpublic static int checkpm(int num) {\n\t\tint i,ans;\n\t\tdouble root;\n\t\tif(num==2) {\n\t\t\treturn 1;\n\t\t}\n\t\tans=checkem(num);\n\t\tif(ans==0) {\n\t\t\treturn 0;\n\t\t}\n\t\telse {\n\t\t\troot=Math.sqrt(num);\n\t\t\tfor(i=3;i<=root;i+=2) {\n\t\t\t\tif(num%i==0) {\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 1;\n\t}\n}",
"Main"
] | import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner scan=new Scanner(System.in);
int i,n,num,count=0;
n=scan.nextInt();
for(i=0;i<n;i++) {
num=scan.nextInt();
count+=checkpm(num);
}
System.out.println(count);
scan.close();
}
public static int checkem(int num) {
return num%2;
}
public static int checkpm(int num) {
int i,ans;
double root;
if(num==2) {
return 1;
}
ans=checkem(num);
if(ans==0) {
return 0;
}
else {
root=Math.sqrt(num);
for(i=3;i<=root;i+=2) {
if(num%i==0) {
return 0;
}
}
}
return 1;
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
41,
13,
17,
28,
13,
13,
30,
30,
14,
4,
13,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
29,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
98,
8
],
[
98,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
11,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
11,
20
],
[
20,
21
],
[
20,
22
],
[
11,
24
],
[
24,
25
],
[
25,
26
],
[
26,
27
],
[
26,
28
],
[
24,
29
],
[
29,
30
],
[
29,
31
],
[
24,
32
],
[
32,
33
],
[
33,
34
],
[
24,
35
],
[
36,
36
],
[
36,
37
],
[
37,
38
],
[
38,
39
],
[
38,
40
],
[
37,
41
],
[
41,
42
],
[
42,
43
],
[
11,
44
],
[
44,
45
],
[
44,
46
],
[
11,
47
],
[
47,
48
],
[
47,
49
],
[
47,
50
],
[
51,
51
],
[
51,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
52,
56
],
[
56,
57
],
[
11,
58
],
[
58,
59
],
[
59,
60
],
[
60,
61
],
[
60,
62
],
[
58,
63
],
[
9,
64
],
[
64,
65
],
[
98,
66
],
[
66,
67
],
[
66,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
69,
74
],
[
74,
75
],
[
74,
76
],
[
76,
77
],
[
77,
78
],
[
76,
79
],
[
69,
80
],
[
80,
81
],
[
81,
82
],
[
69,
83
],
[
84,
84
],
[
84,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
87,
89
],
[
86,
90
],
[
85,
91
],
[
91,
92
],
[
68,
93
],
[
93,
94
],
[
66,
95
],
[
95,
96
],
[
0,
97
],
[
97,
98
],
[
97,
99
]
] | [
"import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt(); //整数の数\n int[] x = new int[n];\n for (int i=0; i<n; i++) {\n x[i] = sc.nextInt();\n }\n int count = 0; //素数の数\n for (int a:x) {\n if(prime(a)) count++;\n }\n System.out.println(count); //最大公約数を出力\n }\n\n /**\n * 素数判定\n */\n public static boolean prime(int x) {\n for (int i=2; i<=Math.sqrt(x); i++) {\n if (x%i==0) return false;\n }\n return true;\n }\n}",
"import java.util.Arrays;",
"Arrays",
"java.util",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt(); //整数の数\n int[] x = new int[n];\n for (int i=0; i<n; i++) {\n x[i] = sc.nextInt();\n }\n int count = 0; //素数の数\n for (int a:x) {\n if(prime(a)) count++;\n }\n System.out.println(count); //最大公約数を出力\n }\n\n /**\n * 素数判定\n */\n public static boolean prime(int x) {\n for (int i=2; i<=Math.sqrt(x); i++) {\n if (x%i==0) return false;\n }\n return true;\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt(); //整数の数\n int[] x = new int[n];\n for (int i=0; i<n; i++) {\n x[i] = sc.nextInt();\n }\n int count = 0; //素数の数\n for (int a:x) {\n if(prime(a)) count++;\n }\n System.out.println(count); //最大公約数を出力\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt(); //整数の数\n int[] x = new int[n];\n for (int i=0; i<n; i++) {\n x[i] = sc.nextInt();\n }\n int count = 0; //素数の数\n for (int a:x) {\n if(prime(a)) count++;\n }\n System.out.println(count); //最大公約数を出力\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int[] x = new int[n];",
"x",
"new int[n]",
"n",
"for (int i=0; i<n; i++) {\n x[i] = sc.nextInt();\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n x[i] = sc.nextInt();\n }",
"{\n x[i] = sc.nextInt();\n }",
"x[i] = sc.nextInt()",
"x[i]",
"x",
"i",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int count = 0;",
"count",
"0",
"for (int a:x) {\n if(prime(a)) count++;\n }",
"int a",
"x",
"{\n if(prime(a)) count++;\n }",
"{\n if(prime(a)) count++;\n }",
"if(prime(a)) count++;",
"prime(a)",
"prime",
"a",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"/**\n * 素数判定\n */\n public static boolean prime(int x) {\n for (int i=2; i<=Math.sqrt(x); i++) {\n if (x%i==0) return false;\n }\n return true;\n }",
"prime",
"{\n for (int i=2; i<=Math.sqrt(x); i++) {\n if (x%i==0) return false;\n }\n return true;\n }",
"for (int i=2; i<=Math.sqrt(x); i++) {\n if (x%i==0) return false;\n }",
"int i=2;",
"int i=2;",
"i",
"2",
"i<=Math.sqrt(x)",
"i",
"Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"i++",
"i++",
"i",
"{\n if (x%i==0) return false;\n }",
"{\n if (x%i==0) return false;\n }",
"if (x%i==0) return false;",
"x%i==0",
"x%i",
"x",
"i",
"0",
"return false;",
"false",
"return true;",
"true",
"int x",
"x",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt(); //整数の数\n int[] x = new int[n];\n for (int i=0; i<n; i++) {\n x[i] = sc.nextInt();\n }\n int count = 0; //素数の数\n for (int a:x) {\n if(prime(a)) count++;\n }\n System.out.println(count); //最大公約数を出力\n }\n\n /**\n * 素数判定\n */\n public static boolean prime(int x) {\n for (int i=2; i<=Math.sqrt(x); i++) {\n if (x%i==0) return false;\n }\n return true;\n }\n}",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt(); //整数の数\n int[] x = new int[n];\n for (int i=0; i<n; i++) {\n x[i] = sc.nextInt();\n }\n int count = 0; //素数の数\n for (int a:x) {\n if(prime(a)) count++;\n }\n System.out.println(count); //最大公約数を出力\n }\n\n /**\n * 素数判定\n */\n public static boolean prime(int x) {\n for (int i=2; i<=Math.sqrt(x); i++) {\n if (x%i==0) return false;\n }\n return true;\n }\n}",
"Main"
] | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(); //整数の数
int[] x = new int[n];
for (int i=0; i<n; i++) {
x[i] = sc.nextInt();
}
int count = 0; //素数の数
for (int a:x) {
if(prime(a)) count++;
}
System.out.println(count); //最大公約数を出力
}
/**
* 素数判定
*/
public static boolean prime(int x) {
for (int i=2; i<=Math.sqrt(x); i++) {
if (x%i==0) return false;
}
return true;
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
41,
13,
41,
13,
17,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
18,
13,
4,
18,
13,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
4,
13,
18,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
41,
13,
17,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
2,
2,
13,
17,
17,
29,
17,
42,
2,
13,
4,
18,
13,
13,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
0,
13,
2,
13,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
134,
5
],
[
134,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
8,
11
],
[
11,
12
],
[
8,
13
],
[
13,
14
],
[
13,
15
],
[
8,
16
],
[
16,
17
],
[
16,
18
],
[
8,
19
],
[
19,
20
],
[
19,
21
],
[
21,
22
],
[
22,
23
],
[
21,
24
],
[
24,
25
],
[
25,
26
],
[
8,
27
],
[
27,
28
],
[
27,
29
],
[
8,
31
],
[
31,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
31,
36
],
[
36,
37
],
[
36,
38
],
[
31,
39
],
[
39,
40
],
[
40,
41
],
[
31,
42
],
[
42,
43
],
[
43,
44
],
[
44,
45
],
[
44,
46
],
[
43,
47
],
[
47,
48
],
[
48,
49
],
[
47,
50
],
[
50,
51
],
[
51,
52
],
[
8,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
53,
58
],
[
58,
59
],
[
58,
60
],
[
53,
61
],
[
61,
62
],
[
62,
63
],
[
53,
64
],
[
65,
65
],
[
65,
66
],
[
66,
67
],
[
67,
68
],
[
67,
69
],
[
69,
70
],
[
69,
71
],
[
66,
72
],
[
72,
73
],
[
73,
74
],
[
8,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
77,
79
],
[
75,
80
],
[
6,
81
],
[
81,
82
],
[
134,
83
],
[
83,
84
],
[
83,
85
],
[
85,
86
],
[
86,
87
],
[
86,
88
],
[
85,
89
],
[
89,
90
],
[
90,
91
],
[
90,
92
],
[
89,
93
],
[
93,
94
],
[
85,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
97,
99
],
[
96,
100
],
[
100,
101
],
[
101,
102
],
[
101,
103
],
[
100,
104
],
[
95,
105
],
[
105,
106
],
[
85,
107
],
[
107,
108
],
[
108,
109
],
[
108,
110
],
[
110,
111
],
[
111,
112
],
[
110,
113
],
[
107,
114
],
[
114,
115
],
[
115,
116
],
[
116,
117
],
[
117,
118
],
[
117,
119
],
[
116,
120
],
[
115,
121
],
[
121,
122
],
[
122,
123
],
[
114,
124
],
[
124,
125
],
[
124,
126
],
[
126,
127
],
[
126,
128
],
[
85,
129
],
[
129,
130
],
[
83,
131
],
[
131,
132
],
[
0,
133
],
[
133,
134
],
[
133,
135
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tint k,i;\n\t\tint s = 0;\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = Integer.parseInt(in.nextLine());\n\t\tint array[] = new int[n];\n\t\tfor(i=0;i<n;i++)array[i] = Integer.parseInt(in.next());\n\t\tfor (k=0;k<n;k++){\n\t\t\tif (isprime(array[k])){\n\t\t\t\ts++;\n\t\t}\n\t}\n\t\tSystem.out.println(s);\n}\n\n\tpublic static boolean isprime(int x) {\n\t\tint i = 3;\n\t\tif (x == 2)\n\t\t\t\treturn true;\n\t\tif (x < 2 || x % 2 == 0 )\n\t\t\t\treturn false;\n\t\twhile (i <= Math.sqrt(x)){\n\t\t\tif (x % i == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i+2;\n\t\t}\n\t\treturn true;\n\t}\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tint k,i;\n\t\tint s = 0;\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = Integer.parseInt(in.nextLine());\n\t\tint array[] = new int[n];\n\t\tfor(i=0;i<n;i++)array[i] = Integer.parseInt(in.next());\n\t\tfor (k=0;k<n;k++){\n\t\t\tif (isprime(array[k])){\n\t\t\t\ts++;\n\t\t}\n\t}\n\t\tSystem.out.println(s);\n}\n\n\tpublic static boolean isprime(int x) {\n\t\tint i = 3;\n\t\tif (x == 2)\n\t\t\t\treturn true;\n\t\tif (x < 2 || x % 2 == 0 )\n\t\t\t\treturn false;\n\t\twhile (i <= Math.sqrt(x)){\n\t\t\tif (x % i == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i+2;\n\t\t}\n\t\treturn true;\n\t}\n}",
"Main",
"public static void main(String[] args) {\n\t\tint k,i;\n\t\tint s = 0;\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = Integer.parseInt(in.nextLine());\n\t\tint array[] = new int[n];\n\t\tfor(i=0;i<n;i++)array[i] = Integer.parseInt(in.next());\n\t\tfor (k=0;k<n;k++){\n\t\t\tif (isprime(array[k])){\n\t\t\t\ts++;\n\t\t}\n\t}\n\t\tSystem.out.println(s);\n}",
"main",
"{\n\t\tint k,i;\n\t\tint s = 0;\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = Integer.parseInt(in.nextLine());\n\t\tint array[] = new int[n];\n\t\tfor(i=0;i<n;i++)array[i] = Integer.parseInt(in.next());\n\t\tfor (k=0;k<n;k++){\n\t\t\tif (isprime(array[k])){\n\t\t\t\ts++;\n\t\t}\n\t}\n\t\tSystem.out.println(s);\n}",
"int k",
"k",
"i;",
"i",
"int s = 0;",
"s",
"0",
"Scanner in = new Scanner(System.in);",
"in",
"new Scanner(System.in)",
"int n = Integer.parseInt(in.nextLine());",
"n",
"Integer.parseInt(in.nextLine())",
"Integer.parseInt",
"Integer",
"in.nextLine()",
"in.nextLine",
"in",
"int array[] = new int[n];",
"array",
"new int[n]",
"n",
"for(i=0;i<n;i++)array[i] = Integer.parseInt(in.next());",
"i=0;",
"i=0",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"array[i] = Integer.parseInt(in.next());",
"array[i] = Integer.parseInt(in.next())",
"array[i]",
"array",
"i",
"Integer.parseInt(in.next())",
"Integer.parseInt",
"Integer",
"in.next()",
"in.next",
"in",
"for (k=0;k<n;k++){\n\t\t\tif (isprime(array[k])){\n\t\t\t\ts++;\n\t\t}\n\t}",
"k=0;",
"k=0",
"k",
"0",
"k<n",
"k",
"n",
"k++",
"k++",
"k",
"{\n\t\t\tif (isprime(array[k])){\n\t\t\t\ts++;\n\t\t}\n\t}",
"{\n\t\t\tif (isprime(array[k])){\n\t\t\t\ts++;\n\t\t}\n\t}",
"if (isprime(array[k])){\n\t\t\t\ts++;\n\t\t}",
"isprime(array[k])",
"isprime",
"array[k]",
"array",
"k",
"{\n\t\t\t\ts++;\n\t\t}",
"s++",
"s",
"System.out.println(s)",
"System.out.println",
"System.out",
"System",
"System.out",
"s",
"String[] args",
"args",
"public static boolean isprime(int x) {\n\t\tint i = 3;\n\t\tif (x == 2)\n\t\t\t\treturn true;\n\t\tif (x < 2 || x % 2 == 0 )\n\t\t\t\treturn false;\n\t\twhile (i <= Math.sqrt(x)){\n\t\t\tif (x % i == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i+2;\n\t\t}\n\t\treturn true;\n\t}",
"isprime",
"{\n\t\tint i = 3;\n\t\tif (x == 2)\n\t\t\t\treturn true;\n\t\tif (x < 2 || x % 2 == 0 )\n\t\t\t\treturn false;\n\t\twhile (i <= Math.sqrt(x)){\n\t\t\tif (x % i == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i+2;\n\t\t}\n\t\treturn true;\n\t}",
"int i = 3;",
"i",
"3",
"if (x == 2)\n\t\t\t\treturn true;",
"x == 2",
"x",
"2",
"return true;",
"true",
"if (x < 2 || x % 2 == 0 )\n\t\t\t\treturn false;",
"x < 2 || x % 2 == 0",
"x < 2",
"x",
"2",
"x % 2 == 0",
"x % 2",
"x",
"2",
"0",
"return false;",
"false",
"while (i <= Math.sqrt(x)){\n\t\t\tif (x % i == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i+2;\n\t\t}",
"i <= Math.sqrt(x)",
"i",
"Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"{\n\t\t\tif (x % i == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i+2;\n\t\t}",
"if (x % i == 0){\n\t\t\t\treturn false;\n\t\t\t}",
"x % i == 0",
"x % i",
"x",
"i",
"0",
"{\n\t\t\t\treturn false;\n\t\t\t}",
"return false;",
"false",
"i = i+2",
"i",
"i+2",
"i",
"2",
"return true;",
"true",
"int x",
"x",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tint k,i;\n\t\tint s = 0;\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = Integer.parseInt(in.nextLine());\n\t\tint array[] = new int[n];\n\t\tfor(i=0;i<n;i++)array[i] = Integer.parseInt(in.next());\n\t\tfor (k=0;k<n;k++){\n\t\t\tif (isprime(array[k])){\n\t\t\t\ts++;\n\t\t}\n\t}\n\t\tSystem.out.println(s);\n}\n\n\tpublic static boolean isprime(int x) {\n\t\tint i = 3;\n\t\tif (x == 2)\n\t\t\t\treturn true;\n\t\tif (x < 2 || x % 2 == 0 )\n\t\t\t\treturn false;\n\t\twhile (i <= Math.sqrt(x)){\n\t\t\tif (x % i == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i+2;\n\t\t}\n\t\treturn true;\n\t}\n}",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tint k,i;\n\t\tint s = 0;\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = Integer.parseInt(in.nextLine());\n\t\tint array[] = new int[n];\n\t\tfor(i=0;i<n;i++)array[i] = Integer.parseInt(in.next());\n\t\tfor (k=0;k<n;k++){\n\t\t\tif (isprime(array[k])){\n\t\t\t\ts++;\n\t\t}\n\t}\n\t\tSystem.out.println(s);\n}\n\n\tpublic static boolean isprime(int x) {\n\t\tint i = 3;\n\t\tif (x == 2)\n\t\t\t\treturn true;\n\t\tif (x < 2 || x % 2 == 0 )\n\t\t\t\treturn false;\n\t\twhile (i <= Math.sqrt(x)){\n\t\t\tif (x % i == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i+2;\n\t\t}\n\t\treturn true;\n\t}\n}",
"Main"
] | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int k,i;
int s = 0;
Scanner in = new Scanner(System.in);
int n = Integer.parseInt(in.nextLine());
int array[] = new int[n];
for(i=0;i<n;i++)array[i] = Integer.parseInt(in.next());
for (k=0;k<n;k++){
if (isprime(array[k])){
s++;
}
}
System.out.println(s);
}
public static boolean isprime(int x) {
int i = 3;
if (x == 2)
return true;
if (x < 2 || x % 2 == 0 )
return false;
while (i <= Math.sqrt(x)){
if (x % i == 0){
return false;
}
i = i+2;
}
return true;
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
38,
30,
41,
13,
20,
41,
13,
20,
17,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
17,
1,
40,
13,
30,
30,
14,
40,
18,
13,
13,
30,
41,
13,
17,
42,
2,
2,
13,
13,
17,
30,
0,
18,
13,
2,
13,
13,
17,
40,
13,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
40,
18,
13,
4,
18,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
10,
11
],
[
11,
12
],
[
11,
13
],
[
10,
14
],
[
14,
15
],
[
14,
16
],
[
10,
18
],
[
18,
19
],
[
19,
20
],
[
19,
21
],
[
18,
22
],
[
10,
23
],
[
23,
24
],
[
24,
25
],
[
24,
26
],
[
23,
27
],
[
10,
28
],
[
28,
29
],
[
29,
30
],
[
30,
31
],
[
30,
32
],
[
28,
33
],
[
33,
34
],
[
33,
35
],
[
35,
36
],
[
36,
37
],
[
35,
38
],
[
28,
39
],
[
39,
40
],
[
40,
41
],
[
28,
42
],
[
43,
43
],
[
43,
44
],
[
44,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
44,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
49,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
54,
58
],
[
53,
59
],
[
59,
60
],
[
60,
61
],
[
61,
62
],
[
61,
63
],
[
63,
64
],
[
63,
65
],
[
60,
66
],
[
59,
67
],
[
67,
68
],
[
10,
69
],
[
69,
70
],
[
69,
71
],
[
71,
72
],
[
72,
73
],
[
10,
74
],
[
74,
75
],
[
74,
76
],
[
10,
77
],
[
77,
78
],
[
78,
79
],
[
79,
80
],
[
79,
81
],
[
77,
82
],
[
82,
83
],
[
82,
84
],
[
77,
85
],
[
85,
86
],
[
86,
87
],
[
77,
88
],
[
89,
89
],
[
89,
90
],
[
90,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
94,
95
],
[
95,
96
],
[
90,
97
],
[
97,
98
],
[
98,
99
],
[
10,
100
],
[
100,
101
],
[
101,
102
],
[
102,
103
],
[
102,
104
],
[
100,
105
],
[
6,
106
],
[
106,
107
]
] | [
"import java.util.*;\n \nclass Main {\n public static void main(String args[]) {\n // new Thread(null, () -> {\n try(Scanner sc = new Scanner(System.in)){\n boolean[] prime = new boolean[100000005];\n prime[0] = true; prime[1] = true;\n for (int i = 2; i <= Math.sqrt(100000005); i++) {\n if (!prime[i]) {\n int j = 2;\n while (i * j < 100000005) {\n prime[i*j] = true;\n j++;\n }\n }\n }\n int N = sc.nextInt();\n int ans = 0;\n for (int i = 0; i < N; i++) {\n if (!prime[sc.nextInt()]) {\n ans++;\n }\n }\n System.out.println(ans);\n }\n //}, \"\", 1<<24).start();\n }\n}",
"import java.util.*;",
"util.*",
"java",
"class Main {\n public static void main(String args[]) {\n // new Thread(null, () -> {\n try(Scanner sc = new Scanner(System.in)){\n boolean[] prime = new boolean[100000005];\n prime[0] = true; prime[1] = true;\n for (int i = 2; i <= Math.sqrt(100000005); i++) {\n if (!prime[i]) {\n int j = 2;\n while (i * j < 100000005) {\n prime[i*j] = true;\n j++;\n }\n }\n }\n int N = sc.nextInt();\n int ans = 0;\n for (int i = 0; i < N; i++) {\n if (!prime[sc.nextInt()]) {\n ans++;\n }\n }\n System.out.println(ans);\n }\n //}, \"\", 1<<24).start();\n }\n}",
"Main",
"public static void main(String args[]) {\n // new Thread(null, () -> {\n try(Scanner sc = new Scanner(System.in)){\n boolean[] prime = new boolean[100000005];\n prime[0] = true; prime[1] = true;\n for (int i = 2; i <= Math.sqrt(100000005); i++) {\n if (!prime[i]) {\n int j = 2;\n while (i * j < 100000005) {\n prime[i*j] = true;\n j++;\n }\n }\n }\n int N = sc.nextInt();\n int ans = 0;\n for (int i = 0; i < N; i++) {\n if (!prime[sc.nextInt()]) {\n ans++;\n }\n }\n System.out.println(ans);\n }\n //}, \"\", 1<<24).start();\n }",
"main",
"{\n // new Thread(null, () -> {\n try(Scanner sc = new Scanner(System.in)){\n boolean[] prime = new boolean[100000005];\n prime[0] = true; prime[1] = true;\n for (int i = 2; i <= Math.sqrt(100000005); i++) {\n if (!prime[i]) {\n int j = 2;\n while (i * j < 100000005) {\n prime[i*j] = true;\n j++;\n }\n }\n }\n int N = sc.nextInt();\n int ans = 0;\n for (int i = 0; i < N; i++) {\n if (!prime[sc.nextInt()]) {\n ans++;\n }\n }\n System.out.println(ans);\n }\n //}, \"\", 1<<24).start();\n }",
"try(Scanner sc = new Scanner(System.in)){\n boolean[] prime = new boolean[100000005];\n prime[0] = true; prime[1] = true;\n for (int i = 2; i <= Math.sqrt(100000005); i++) {\n if (!prime[i]) {\n int j = 2;\n while (i * j < 100000005) {\n prime[i*j] = true;\n j++;\n }\n }\n }\n int N = sc.nextInt();\n int ans = 0;\n for (int i = 0; i < N; i++) {\n if (!prime[sc.nextInt()]) {\n ans++;\n }\n }\n System.out.println(ans);\n }",
"{\n boolean[] prime = new boolean[100000005];\n prime[0] = true; prime[1] = true;\n for (int i = 2; i <= Math.sqrt(100000005); i++) {\n if (!prime[i]) {\n int j = 2;\n while (i * j < 100000005) {\n prime[i*j] = true;\n j++;\n }\n }\n }\n int N = sc.nextInt();\n int ans = 0;\n for (int i = 0; i < N; i++) {\n if (!prime[sc.nextInt()]) {\n ans++;\n }\n }\n System.out.println(ans);\n }",
"Scanner sc = new Scanner(System.in)",
"Scanner sc = new Scanner(System.in)",
"new Scanner(System.in)",
"boolean[] prime = new boolean[100000005];",
"prime",
"new boolean[100000005]",
"100000005",
"prime[0] = true",
"prime[0]",
"prime",
"0",
"true",
"prime[1] = true",
"prime[1]",
"prime",
"1",
"true",
"for (int i = 2; i <= Math.sqrt(100000005); i++) {\n if (!prime[i]) {\n int j = 2;\n while (i * j < 100000005) {\n prime[i*j] = true;\n j++;\n }\n }\n }",
"int i = 2;",
"int i = 2;",
"i",
"2",
"i <= Math.sqrt(100000005)",
"i",
"Math.sqrt(100000005)",
"Math.sqrt",
"Math",
"100000005",
"i++",
"i++",
"i",
"{\n if (!prime[i]) {\n int j = 2;\n while (i * j < 100000005) {\n prime[i*j] = true;\n j++;\n }\n }\n }",
"{\n if (!prime[i]) {\n int j = 2;\n while (i * j < 100000005) {\n prime[i*j] = true;\n j++;\n }\n }\n }",
"if (!prime[i]) {\n int j = 2;\n while (i * j < 100000005) {\n prime[i*j] = true;\n j++;\n }\n }",
"!prime[i]",
"prime[i]",
"prime",
"i",
"{\n int j = 2;\n while (i * j < 100000005) {\n prime[i*j] = true;\n j++;\n }\n }",
"int j = 2;",
"j",
"2",
"while (i * j < 100000005) {\n prime[i*j] = true;\n j++;\n }",
"i * j < 100000005",
"i * j",
"i",
"j",
"100000005",
"{\n prime[i*j] = true;\n j++;\n }",
"prime[i*j] = true",
"prime[i*j]",
"prime",
"i*j",
"i",
"j",
"true",
"j++",
"j",
"int N = sc.nextInt();",
"N",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int ans = 0;",
"ans",
"0",
"for (int i = 0; i < N; i++) {\n if (!prime[sc.nextInt()]) {\n ans++;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < N",
"i",
"N",
"i++",
"i++",
"i",
"{\n if (!prime[sc.nextInt()]) {\n ans++;\n }\n }",
"{\n if (!prime[sc.nextInt()]) {\n ans++;\n }\n }",
"if (!prime[sc.nextInt()]) {\n ans++;\n }",
"!prime[sc.nextInt()]",
"prime[sc.nextInt()]",
"prime",
"sc.nextInt()",
"sc.nextInt",
"sc",
"{\n ans++;\n }",
"ans++",
"ans",
"System.out.println(ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"ans",
"String args[]",
"args"
] | import java.util.*;
class Main {
public static void main(String args[]) {
// new Thread(null, () -> {
try(Scanner sc = new Scanner(System.in)){
boolean[] prime = new boolean[100000005];
prime[0] = true; prime[1] = true;
for (int i = 2; i <= Math.sqrt(100000005); i++) {
if (!prime[i]) {
int j = 2;
while (i * j < 100000005) {
prime[i*j] = true;
j++;
}
}
}
int N = sc.nextInt();
int ans = 0;
for (int i = 0; i < N; i++) {
if (!prime[sc.nextInt()]) {
ans++;
}
}
System.out.println(ans);
}
//}, "", 1<<24).start();
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
2,
2,
13,
17,
17,
29,
17,
41,
13,
17,
42,
2,
13,
4,
18,
13,
13,
30,
14,
2,
2,
13,
13,
17,
29,
17,
0,
13,
17,
29,
17,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
14,
4,
13,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
100,
5
],
[
100,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
10,
11
],
[
10,
12
],
[
9,
13
],
[
13,
14
],
[
8,
15
],
[
15,
16
],
[
16,
17
],
[
17,
18
],
[
17,
19
],
[
16,
20
],
[
20,
21
],
[
21,
22
],
[
21,
23
],
[
20,
24
],
[
15,
25
],
[
25,
26
],
[
8,
27
],
[
27,
28
],
[
27,
29
],
[
8,
30
],
[
30,
31
],
[
31,
32
],
[
31,
33
],
[
33,
34
],
[
34,
35
],
[
33,
36
],
[
30,
37
],
[
37,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
39,
43
],
[
38,
44
],
[
44,
45
],
[
37,
46
],
[
46,
47
],
[
46,
48
],
[
8,
49
],
[
49,
50
],
[
6,
51
],
[
51,
52
],
[
100,
53
],
[
53,
54
],
[
53,
55
],
[
55,
56
],
[
56,
57
],
[
56,
58
],
[
55,
59
],
[
59,
60
],
[
59,
61
],
[
61,
62
],
[
62,
63
],
[
55,
64
],
[
64,
65
],
[
64,
66
],
[
55,
67
],
[
67,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
67,
72
],
[
72,
73
],
[
72,
74
],
[
67,
75
],
[
75,
76
],
[
76,
77
],
[
67,
78
],
[
79,
79
],
[
79,
80
],
[
80,
81
],
[
80,
82
],
[
82,
83
],
[
83,
84
],
[
79,
85
],
[
85,
86
],
[
86,
87
],
[
86,
88
],
[
85,
89
],
[
89,
90
],
[
55,
91
],
[
91,
92
],
[
92,
93
],
[
93,
94
],
[
93,
95
],
[
91,
96
],
[
53,
97
],
[
97,
98
],
[
0,
99
],
[
99,
100
],
[
99,
101
]
] | [
"import java.util.*;\n\npublic class Main {\n static boolean isPrime(int x){\n if(x==2) return true;\n if(x<2 || x%2==0) return false;\n int i = 3;\n while(i<=Math.sqrt(x)){\n if(x%i == 0) return false;\n i += 2;\n }\n return true;\n }\n \n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int count = 0;\n for(int i=0;i<n;i++){\n int x = sc.nextInt();\n if(isPrime(x)) count++;\n }\n System.out.println(count);\n }\n}\n",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n static boolean isPrime(int x){\n if(x==2) return true;\n if(x<2 || x%2==0) return false;\n int i = 3;\n while(i<=Math.sqrt(x)){\n if(x%i == 0) return false;\n i += 2;\n }\n return true;\n }\n \n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int count = 0;\n for(int i=0;i<n;i++){\n int x = sc.nextInt();\n if(isPrime(x)) count++;\n }\n System.out.println(count);\n }\n}",
"Main",
"static boolean isPrime(int x){\n if(x==2) return true;\n if(x<2 || x%2==0) return false;\n int i = 3;\n while(i<=Math.sqrt(x)){\n if(x%i == 0) return false;\n i += 2;\n }\n return true;\n }",
"isPrime",
"{\n if(x==2) return true;\n if(x<2 || x%2==0) return false;\n int i = 3;\n while(i<=Math.sqrt(x)){\n if(x%i == 0) return false;\n i += 2;\n }\n return true;\n }",
"if(x==2) return true;",
"x==2",
"x",
"2",
"return true;",
"true",
"if(x<2 || x%2==0) return false;",
"x<2 || x%2==0",
"x<2",
"x",
"2",
"x%2==0",
"x%2",
"x",
"2",
"0",
"return false;",
"false",
"int i = 3;",
"i",
"3",
"while(i<=Math.sqrt(x)){\n if(x%i == 0) return false;\n i += 2;\n }",
"i<=Math.sqrt(x)",
"i",
"Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"{\n if(x%i == 0) return false;\n i += 2;\n }",
"if(x%i == 0) return false;",
"x%i == 0",
"x%i",
"x",
"i",
"0",
"return false;",
"false",
"i += 2",
"i",
"2",
"return true;",
"true",
"int x",
"x",
"public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int count = 0;\n for(int i=0;i<n;i++){\n int x = sc.nextInt();\n if(isPrime(x)) count++;\n }\n System.out.println(count);\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int count = 0;\n for(int i=0;i<n;i++){\n int x = sc.nextInt();\n if(isPrime(x)) count++;\n }\n System.out.println(count);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int count = 0;",
"count",
"0",
"for(int i=0;i<n;i++){\n int x = sc.nextInt();\n if(isPrime(x)) count++;\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n int x = sc.nextInt();\n if(isPrime(x)) count++;\n }",
"{\n int x = sc.nextInt();\n if(isPrime(x)) count++;\n }",
"int x = sc.nextInt();",
"x",
"sc.nextInt()",
"sc.nextInt",
"sc",
"if(isPrime(x)) count++;",
"isPrime(x)",
"isPrime",
"x",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"public class Main {\n static boolean isPrime(int x){\n if(x==2) return true;\n if(x<2 || x%2==0) return false;\n int i = 3;\n while(i<=Math.sqrt(x)){\n if(x%i == 0) return false;\n i += 2;\n }\n return true;\n }\n \n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int count = 0;\n for(int i=0;i<n;i++){\n int x = sc.nextInt();\n if(isPrime(x)) count++;\n }\n System.out.println(count);\n }\n}",
"public class Main {\n static boolean isPrime(int x){\n if(x==2) return true;\n if(x<2 || x%2==0) return false;\n int i = 3;\n while(i<=Math.sqrt(x)){\n if(x%i == 0) return false;\n i += 2;\n }\n return true;\n }\n \n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int count = 0;\n for(int i=0;i<n;i++){\n int x = sc.nextInt();\n if(isPrime(x)) count++;\n }\n System.out.println(count);\n }\n}",
"Main"
] | import java.util.*;
public class Main {
static boolean isPrime(int x){
if(x==2) return true;
if(x<2 || x%2==0) return false;
int i = 3;
while(i<=Math.sqrt(x)){
if(x%i == 0) return false;
i += 2;
}
return true;
}
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int count = 0;
for(int i=0;i<n;i++){
int x = sc.nextInt();
if(isPrime(x)) count++;
}
System.out.println(count);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
38,
5,
13,
30,
4,
18,
18,
13,
13,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
4,
18,
13,
14,
4,
13,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
2,
2,
13,
17,
17,
29,
17,
41,
13,
17,
42,
2,
13,
4,
18,
13,
13,
30,
14,
2,
2,
13,
13,
17,
29,
17,
0,
13,
2,
13,
17,
29,
17,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
10,
11
],
[
10,
12
],
[
12,
13
],
[
13,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
13,
18
],
[
9,
19
],
[
19,
20
],
[
20,
21
],
[
20,
22
],
[
19,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
26,
27
],
[
25,
28
],
[
28,
29
],
[
29,
30
],
[
19,
31
],
[
31,
32
],
[
31,
33
],
[
19,
34
],
[
34,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
34,
39
],
[
39,
40
],
[
39,
41
],
[
34,
42
],
[
42,
43
],
[
43,
44
],
[
34,
45
],
[
46,
46
],
[
46,
47
],
[
47,
48
],
[
47,
49
],
[
49,
50
],
[
50,
51
],
[
49,
52
],
[
52,
53
],
[
53,
54
],
[
46,
55
],
[
55,
56
],
[
56,
57
],
[
56,
58
],
[
55,
59
],
[
59,
60
],
[
19,
61
],
[
61,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
61,
66
],
[
6,
67
],
[
67,
68
],
[
4,
69
],
[
69,
70
],
[
69,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
73,
75
],
[
72,
76
],
[
76,
77
],
[
71,
78
],
[
78,
79
],
[
79,
80
],
[
80,
81
],
[
80,
82
],
[
79,
83
],
[
83,
84
],
[
84,
85
],
[
84,
86
],
[
83,
87
],
[
78,
88
],
[
88,
89
],
[
71,
90
],
[
90,
91
],
[
90,
92
],
[
71,
93
],
[
93,
94
],
[
94,
95
],
[
94,
96
],
[
96,
97
],
[
97,
98
],
[
96,
99
],
[
93,
100
],
[
100,
101
],
[
101,
102
],
[
102,
103
],
[
103,
104
],
[
103,
105
],
[
102,
106
],
[
101,
107
],
[
107,
108
],
[
100,
109
],
[
109,
110
],
[
109,
111
],
[
111,
112
],
[
111,
113
],
[
71,
114
],
[
114,
115
],
[
69,
116
],
[
116,
117
]
] | [
"/* ALDS1_1_C */\nimport java.io.*;\n\nclass Main\n{\n public static void main(String[] args)\n {\n try{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int count = 0;\n\n for(int i = 0; i < n; i++){\n long x = Long.parseLong(br.readLine());\n if(isprime(x)) count++;\n }\n System.out.println(count);\n\n }catch(Exception e){\n System.out.println(e);\n }\n }\n\n public static boolean isprime(long x)\n {\n if(x == 2) return true;\n if(x < 2 || x % 2 == 0) return false;\n\n int i = 3;\n while(i <= Math.sqrt(x)){\n if(x % i == 0) return false;\n i = i + 2;\n }\n\n return true;\n }\n}",
"import java.io.*;",
"io.*",
"java",
"class Main\n{\n public static void main(String[] args)\n {\n try{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int count = 0;\n\n for(int i = 0; i < n; i++){\n long x = Long.parseLong(br.readLine());\n if(isprime(x)) count++;\n }\n System.out.println(count);\n\n }catch(Exception e){\n System.out.println(e);\n }\n }\n\n public static boolean isprime(long x)\n {\n if(x == 2) return true;\n if(x < 2 || x % 2 == 0) return false;\n\n int i = 3;\n while(i <= Math.sqrt(x)){\n if(x % i == 0) return false;\n i = i + 2;\n }\n\n return true;\n }\n}",
"Main",
"public static void main(String[] args)\n {\n try{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int count = 0;\n\n for(int i = 0; i < n; i++){\n long x = Long.parseLong(br.readLine());\n if(isprime(x)) count++;\n }\n System.out.println(count);\n\n }catch(Exception e){\n System.out.println(e);\n }\n }",
"main",
"{\n try{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int count = 0;\n\n for(int i = 0; i < n; i++){\n long x = Long.parseLong(br.readLine());\n if(isprime(x)) count++;\n }\n System.out.println(count);\n\n }catch(Exception e){\n System.out.println(e);\n }\n }",
"try{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int count = 0;\n\n for(int i = 0; i < n; i++){\n long x = Long.parseLong(br.readLine());\n if(isprime(x)) count++;\n }\n System.out.println(count);\n\n }catch(Exception e){\n System.out.println(e);\n }",
"catch(Exception e){\n System.out.println(e);\n }",
"Exception e",
"{\n System.out.println(e);\n }",
"System.out.println(e)",
"System.out.println",
"System.out",
"System",
"System.out",
"e",
"{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int count = 0;\n\n for(int i = 0; i < n; i++){\n long x = Long.parseLong(br.readLine());\n if(isprime(x)) count++;\n }\n System.out.println(count);\n\n }",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"int n = Integer.parseInt(br.readLine());",
"n",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"int count = 0;",
"count",
"0",
"for(int i = 0; i < n; i++){\n long x = Long.parseLong(br.readLine());\n if(isprime(x)) count++;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n long x = Long.parseLong(br.readLine());\n if(isprime(x)) count++;\n }",
"{\n long x = Long.parseLong(br.readLine());\n if(isprime(x)) count++;\n }",
"long x = Long.parseLong(br.readLine());",
"x",
"Long.parseLong(br.readLine())",
"Long.parseLong",
"Long",
"br.readLine()",
"br.readLine",
"br",
"if(isprime(x)) count++;",
"isprime(x)",
"isprime",
"x",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"public static boolean isprime(long x)\n {\n if(x == 2) return true;\n if(x < 2 || x % 2 == 0) return false;\n\n int i = 3;\n while(i <= Math.sqrt(x)){\n if(x % i == 0) return false;\n i = i + 2;\n }\n\n return true;\n }",
"isprime",
"{\n if(x == 2) return true;\n if(x < 2 || x % 2 == 0) return false;\n\n int i = 3;\n while(i <= Math.sqrt(x)){\n if(x % i == 0) return false;\n i = i + 2;\n }\n\n return true;\n }",
"if(x == 2) return true;",
"x == 2",
"x",
"2",
"return true;",
"true",
"if(x < 2 || x % 2 == 0) return false;",
"x < 2 || x % 2 == 0",
"x < 2",
"x",
"2",
"x % 2 == 0",
"x % 2",
"x",
"2",
"0",
"return false;",
"false",
"int i = 3;",
"i",
"3",
"while(i <= Math.sqrt(x)){\n if(x % i == 0) return false;\n i = i + 2;\n }",
"i <= Math.sqrt(x)",
"i",
"Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"{\n if(x % i == 0) return false;\n i = i + 2;\n }",
"if(x % i == 0) return false;",
"x % i == 0",
"x % i",
"x",
"i",
"0",
"return false;",
"false",
"i = i + 2",
"i",
"i + 2",
"i",
"2",
"return true;",
"true",
"long x",
"x"
] | /* ALDS1_1_C */
import java.io.*;
class Main
{
public static void main(String[] args)
{
try{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
int count = 0;
for(int i = 0; i < n; i++){
long x = Long.parseLong(br.readLine());
if(isprime(x)) count++;
}
System.out.println(count);
}catch(Exception e){
System.out.println(e);
}
}
public static boolean isprime(long x)
{
if(x == 2) return true;
if(x < 2 || x % 2 == 0) return false;
int i = 3;
while(i <= Math.sqrt(x)){
if(x % i == 0) return false;
i = i + 2;
}
return true;
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
17,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
14,
4,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
10,
11
],
[
11,
12
],
[
11,
13
],
[
9,
14
],
[
14,
15
],
[
14,
16
],
[
16,
17
],
[
17,
18
],
[
16,
19
],
[
9,
20
],
[
20,
21
],
[
21,
22
],
[
9,
23
],
[
24,
24
],
[
24,
25
],
[
25,
26
],
[
26,
27
],
[
27,
28
],
[
27,
29
],
[
26,
30
],
[
25,
31
],
[
31,
32
],
[
32,
33
],
[
8,
34
],
[
34,
35
],
[
6,
36
],
[
36,
37
],
[
4,
38
],
[
38,
39
],
[
38,
40
],
[
40,
41
],
[
41,
42
],
[
41,
43
],
[
40,
44
],
[
44,
45
],
[
44,
46
],
[
46,
47
],
[
47,
48
],
[
40,
49
],
[
49,
50
],
[
49,
51
],
[
40,
52
],
[
52,
53
],
[
53,
54
],
[
54,
55
],
[
54,
56
],
[
52,
57
],
[
57,
58
],
[
57,
59
],
[
52,
60
],
[
60,
61
],
[
61,
62
],
[
52,
63
],
[
64,
64
],
[
64,
65
],
[
65,
66
],
[
65,
67
],
[
67,
68
],
[
68,
69
],
[
64,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
70,
74
],
[
74,
75
],
[
75,
76
],
[
40,
77
],
[
77,
78
],
[
78,
79
],
[
79,
80
],
[
79,
81
],
[
77,
82
],
[
38,
83
],
[
83,
84
]
] | [
"import java.util.Scanner;\n\nclass Main {\n public static Boolean PrimeCheck(int x){\n\tfor(int i=2; i<=Math.sqrt(x);i++){\n\t if(x%i==0){\n\t\treturn false;\n\t }\n\t}\n\treturn true;\n }\n public static void main(String[] args) {\n\t Scanner sc = new Scanner(System.in);\n\t int n = sc.nextInt();\n\t int count = 0;\n\t for(int i=0;i<n;i++){\n\t int x = sc.nextInt();\n\t if(PrimeCheck(x)){\n\t\t count++;\n\t }\n\t }\n\t System.out.println(count);\n }\n \n}\n",
"import java.util.Scanner;",
"Scanner",
"java.util",
"class Main {\n public static Boolean PrimeCheck(int x){\n\tfor(int i=2; i<=Math.sqrt(x);i++){\n\t if(x%i==0){\n\t\treturn false;\n\t }\n\t}\n\treturn true;\n }\n public static void main(String[] args) {\n\t Scanner sc = new Scanner(System.in);\n\t int n = sc.nextInt();\n\t int count = 0;\n\t for(int i=0;i<n;i++){\n\t int x = sc.nextInt();\n\t if(PrimeCheck(x)){\n\t\t count++;\n\t }\n\t }\n\t System.out.println(count);\n }\n \n}",
"Main",
"public static Boolean PrimeCheck(int x){\n\tfor(int i=2; i<=Math.sqrt(x);i++){\n\t if(x%i==0){\n\t\treturn false;\n\t }\n\t}\n\treturn true;\n }",
"PrimeCheck",
"{\n\tfor(int i=2; i<=Math.sqrt(x);i++){\n\t if(x%i==0){\n\t\treturn false;\n\t }\n\t}\n\treturn true;\n }",
"for(int i=2; i<=Math.sqrt(x);i++){\n\t if(x%i==0){\n\t\treturn false;\n\t }\n\t}",
"int i=2;",
"int i=2;",
"i",
"2",
"i<=Math.sqrt(x)",
"i",
"Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"i++",
"i++",
"i",
"{\n\t if(x%i==0){\n\t\treturn false;\n\t }\n\t}",
"{\n\t if(x%i==0){\n\t\treturn false;\n\t }\n\t}",
"if(x%i==0){\n\t\treturn false;\n\t }",
"x%i==0",
"x%i",
"x",
"i",
"0",
"{\n\t\treturn false;\n\t }",
"return false;",
"false",
"return true;",
"true",
"int x",
"x",
"public static void main(String[] args) {\n\t Scanner sc = new Scanner(System.in);\n\t int n = sc.nextInt();\n\t int count = 0;\n\t for(int i=0;i<n;i++){\n\t int x = sc.nextInt();\n\t if(PrimeCheck(x)){\n\t\t count++;\n\t }\n\t }\n\t System.out.println(count);\n }",
"main",
"{\n\t Scanner sc = new Scanner(System.in);\n\t int n = sc.nextInt();\n\t int count = 0;\n\t for(int i=0;i<n;i++){\n\t int x = sc.nextInt();\n\t if(PrimeCheck(x)){\n\t\t count++;\n\t }\n\t }\n\t System.out.println(count);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int count = 0;",
"count",
"0",
"for(int i=0;i<n;i++){\n\t int x = sc.nextInt();\n\t if(PrimeCheck(x)){\n\t\t count++;\n\t }\n\t }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t int x = sc.nextInt();\n\t if(PrimeCheck(x)){\n\t\t count++;\n\t }\n\t }",
"{\n\t int x = sc.nextInt();\n\t if(PrimeCheck(x)){\n\t\t count++;\n\t }\n\t }",
"int x = sc.nextInt();",
"x",
"sc.nextInt()",
"sc.nextInt",
"sc",
"if(PrimeCheck(x)){\n\t\t count++;\n\t }",
"PrimeCheck(x)",
"PrimeCheck",
"x",
"{\n\t\t count++;\n\t }",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args"
] | import java.util.Scanner;
class Main {
public static Boolean PrimeCheck(int x){
for(int i=2; i<=Math.sqrt(x);i++){
if(x%i==0){
return false;
}
}
return true;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int count = 0;
for(int i=0;i<n;i++){
int x = sc.nextInt();
if(PrimeCheck(x)){
count++;
}
}
System.out.println(count);
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
20,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
4,
18,
13,
14,
4,
18,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
6,
13,
41,
13,
20,
17,
12,
13,
30,
4,
18,
13,
13,
17,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
18,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
18,
13,
13,
17,
30,
9,
11,
1,
41,
13,
2,
13,
17,
2,
13,
2,
18,
13,
13,
17,
1,
0,
13,
13,
30,
30,
0,
18,
13,
13,
17,
12,
13,
30,
14,
2,
2,
2,
13,
17,
17,
2,
13,
17,
30,
29,
17,
29,
18,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
179,
17
],
[
179,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
21,
23
],
[
20,
24
],
[
24,
25
],
[
24,
26
],
[
26,
27
],
[
27,
28
],
[
26,
29
],
[
29,
30
],
[
30,
31
],
[
20,
32
],
[
32,
33
],
[
32,
34
],
[
20,
35
],
[
35,
36
],
[
35,
37
],
[
20,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
38,
43
],
[
43,
44
],
[
43,
45
],
[
38,
46
],
[
46,
47
],
[
47,
48
],
[
38,
49
],
[
50,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
53,
54
],
[
54,
55
],
[
53,
56
],
[
56,
57
],
[
57,
58
],
[
50,
59
],
[
59,
60
],
[
60,
61
],
[
61,
62
],
[
60,
63
],
[
59,
64
],
[
64,
65
],
[
65,
66
],
[
20,
67
],
[
67,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
67,
72
],
[
18,
73
],
[
73,
74
],
[
0,
75
],
[
75,
76
],
[
75,
77
],
[
77,
78
],
[
77,
79
],
[
75,
81
],
[
81,
82
],
[
81,
83
],
[
83,
84
],
[
84,
85
],
[
85,
86
],
[
84,
87
],
[
84,
88
],
[
83,
89
],
[
89,
90
],
[
90,
91
],
[
90,
92
],
[
89,
93
],
[
83,
94
],
[
94,
95
],
[
95,
96
],
[
95,
97
],
[
94,
98
],
[
83,
99
],
[
99,
100
],
[
100,
101
],
[
100,
102
],
[
99,
103
],
[
83,
104
],
[
104,
105
],
[
105,
106
],
[
106,
107
],
[
106,
108
],
[
104,
109
],
[
109,
110
],
[
109,
111
],
[
111,
112
],
[
112,
113
],
[
111,
114
],
[
114,
115
],
[
114,
116
],
[
104,
117
],
[
117,
118
],
[
118,
119
],
[
118,
120
],
[
104,
121
],
[
122,
122
],
[
122,
123
],
[
123,
124
],
[
124,
125
],
[
125,
126
],
[
125,
127
],
[
124,
128
],
[
123,
129
],
[
129,
130
],
[
122,
131
],
[
131,
132
],
[
132,
133
],
[
133,
134
],
[
133,
135
],
[
135,
136
],
[
135,
137
],
[
131,
138
],
[
138,
139
],
[
138,
140
],
[
140,
141
],
[
141,
142
],
[
141,
143
],
[
140,
144
],
[
131,
145
],
[
145,
146
],
[
146,
147
],
[
146,
148
],
[
131,
149
],
[
150,
150
],
[
150,
151
],
[
151,
152
],
[
152,
153
],
[
152,
154
],
[
151,
155
],
[
75,
156
],
[
156,
157
],
[
156,
158
],
[
158,
159
],
[
159,
160
],
[
160,
161
],
[
161,
162
],
[
162,
163
],
[
162,
164
],
[
161,
165
],
[
160,
166
],
[
166,
167
],
[
166,
168
],
[
159,
169
],
[
169,
170
],
[
170,
171
],
[
158,
172
],
[
172,
173
],
[
173,
174
],
[
173,
175
],
[
156,
176
],
[
176,
177
],
[
0,
178
],
[
178,
179
],
[
178,
180
]
] | [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.Date;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\t// TODO ?????????????????????????????????????????????\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tPrimeNumberGenerator png = new PrimeNumberGenerator();\n\t\tint count = 0;\n\n\t\tfor(int i = 0; i < n; i++){\n\n\t\t\tint m = Integer.parseInt(br.readLine());\n\n\n\t\t\tif(png.isPrime(m)){\n\t\t\t\t\t//System.out.println(i);\n\t\t\t\tcount++;\n\t\t\t}\n\n\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n}\n\nclass PrimeNumberGenerator {\n\tprivate boolean[] isPrime= new boolean[100000001];\n\n\tpublic PrimeNumberGenerator() {\n\t\t//Date from = new Date();\n\t\tArrays.fill(isPrime, true);\n\n\t\tisPrime[0] = false;\n\t\tisPrime[1] = false;\n\t\tisPrime[2] = true;\n\n\t\tfor(int i = 3; i <= Math.sqrt( isPrime.length ); i+=2){\n\t\t\t/*\n\t\t\tif(i % 2 == 0){\n\t\t\t\tisPrime[i] = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t*/\n\n\t\t\tif(isPrime[i] == false){\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tfor(int j = i * 2; j <= isPrime.length - 1; j += i){\n\t\t\t\tisPrime[j] = false;\n\t\t\t}\n\t\t}\n\t\t//Date to = new Date();\n\t\t//System.out.println(\"init takes \"+ (to.getTime() - from.getTime())+ \"milli sec\");\n\t}\n\n\tpublic boolean isPrime(int index){\n\t\tif(index % 2 == 0 && index != 2){\n\t\t\treturn false;\n\t\t}\n\t\treturn isPrime[index];\n\t}\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.util.Arrays;",
"Arrays",
"java.util",
"import java.util.Date;",
"Date",
"java.util",
"public class Main {\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\t// TODO ?????????????????????????????????????????????\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tPrimeNumberGenerator png = new PrimeNumberGenerator();\n\t\tint count = 0;\n\n\t\tfor(int i = 0; i < n; i++){\n\n\t\t\tint m = Integer.parseInt(br.readLine());\n\n\n\t\t\tif(png.isPrime(m)){\n\t\t\t\t\t//System.out.println(i);\n\t\t\t\tcount++;\n\t\t\t}\n\n\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n}",
"Main",
"public static void main(String[] args) throws NumberFormatException, IOException {\n\t\t// TODO ?????????????????????????????????????????????\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tPrimeNumberGenerator png = new PrimeNumberGenerator();\n\t\tint count = 0;\n\n\t\tfor(int i = 0; i < n; i++){\n\n\t\t\tint m = Integer.parseInt(br.readLine());\n\n\n\t\t\tif(png.isPrime(m)){\n\t\t\t\t\t//System.out.println(i);\n\t\t\t\tcount++;\n\t\t\t}\n\n\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"main",
"{\n\t\t// TODO ?????????????????????????????????????????????\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tPrimeNumberGenerator png = new PrimeNumberGenerator();\n\t\tint count = 0;\n\n\t\tfor(int i = 0; i < n; i++){\n\n\t\t\tint m = Integer.parseInt(br.readLine());\n\n\n\t\t\tif(png.isPrime(m)){\n\t\t\t\t\t//System.out.println(i);\n\t\t\t\tcount++;\n\t\t\t}\n\n\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"int n = Integer.parseInt(br.readLine());",
"n",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"PrimeNumberGenerator png = new PrimeNumberGenerator();",
"png",
"new PrimeNumberGenerator()",
"int count = 0;",
"count",
"0",
"for(int i = 0; i < n; i++){\n\n\t\t\tint m = Integer.parseInt(br.readLine());\n\n\n\t\t\tif(png.isPrime(m)){\n\t\t\t\t\t//System.out.println(i);\n\t\t\t\tcount++;\n\t\t\t}\n\n\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\n\t\t\tint m = Integer.parseInt(br.readLine());\n\n\n\t\t\tif(png.isPrime(m)){\n\t\t\t\t\t//System.out.println(i);\n\t\t\t\tcount++;\n\t\t\t}\n\n\n\t\t}",
"{\n\n\t\t\tint m = Integer.parseInt(br.readLine());\n\n\n\t\t\tif(png.isPrime(m)){\n\t\t\t\t\t//System.out.println(i);\n\t\t\t\tcount++;\n\t\t\t}\n\n\n\t\t}",
"int m = Integer.parseInt(br.readLine());",
"m",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"if(png.isPrime(m)){\n\t\t\t\t\t//System.out.println(i);\n\t\t\t\tcount++;\n\t\t\t}",
"png.isPrime(m)",
"png.isPrime",
"png",
"m",
"{\n\t\t\t\t\t//System.out.println(i);\n\t\t\t\tcount++;\n\t\t\t}",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"class PrimeNumberGenerator {\n\tprivate boolean[] isPrime= new boolean[100000001];\n\n\tpublic PrimeNumberGenerator() {\n\t\t//Date from = new Date();\n\t\tArrays.fill(isPrime, true);\n\n\t\tisPrime[0] = false;\n\t\tisPrime[1] = false;\n\t\tisPrime[2] = true;\n\n\t\tfor(int i = 3; i <= Math.sqrt( isPrime.length ); i+=2){\n\t\t\t/*\n\t\t\tif(i % 2 == 0){\n\t\t\t\tisPrime[i] = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t*/\n\n\t\t\tif(isPrime[i] == false){\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tfor(int j = i * 2; j <= isPrime.length - 1; j += i){\n\t\t\t\tisPrime[j] = false;\n\t\t\t}\n\t\t}\n\t\t//Date to = new Date();\n\t\t//System.out.println(\"init takes \"+ (to.getTime() - from.getTime())+ \"milli sec\");\n\t}\n\n\tpublic boolean isPrime(int index){\n\t\tif(index % 2 == 0 && index != 2){\n\t\t\treturn false;\n\t\t}\n\t\treturn isPrime[index];\n\t}\n}",
"PrimeNumberGenerator",
"private boolean[] isPrime= new boolean[100000001];",
"isPrime",
"new boolean[100000001]",
"100000001",
"public PrimeNumberGenerator() {\n\t\t//Date from = new Date();\n\t\tArrays.fill(isPrime, true);\n\n\t\tisPrime[0] = false;\n\t\tisPrime[1] = false;\n\t\tisPrime[2] = true;\n\n\t\tfor(int i = 3; i <= Math.sqrt( isPrime.length ); i+=2){\n\t\t\t/*\n\t\t\tif(i % 2 == 0){\n\t\t\t\tisPrime[i] = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t*/\n\n\t\t\tif(isPrime[i] == false){\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tfor(int j = i * 2; j <= isPrime.length - 1; j += i){\n\t\t\t\tisPrime[j] = false;\n\t\t\t}\n\t\t}\n\t\t//Date to = new Date();\n\t\t//System.out.println(\"init takes \"+ (to.getTime() - from.getTime())+ \"milli sec\");\n\t}",
"PrimeNumberGenerator",
"{\n\t\t//Date from = new Date();\n\t\tArrays.fill(isPrime, true);\n\n\t\tisPrime[0] = false;\n\t\tisPrime[1] = false;\n\t\tisPrime[2] = true;\n\n\t\tfor(int i = 3; i <= Math.sqrt( isPrime.length ); i+=2){\n\t\t\t/*\n\t\t\tif(i % 2 == 0){\n\t\t\t\tisPrime[i] = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t*/\n\n\t\t\tif(isPrime[i] == false){\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tfor(int j = i * 2; j <= isPrime.length - 1; j += i){\n\t\t\t\tisPrime[j] = false;\n\t\t\t}\n\t\t}\n\t\t//Date to = new Date();\n\t\t//System.out.println(\"init takes \"+ (to.getTime() - from.getTime())+ \"milli sec\");\n\t}",
"Arrays.fill(isPrime, true)",
"Arrays.fill",
"Arrays",
"isPrime",
"true",
"isPrime[0] = false",
"isPrime[0]",
"isPrime",
"0",
"false",
"isPrime[1] = false",
"isPrime[1]",
"isPrime",
"1",
"false",
"isPrime[2] = true",
"isPrime[2]",
"isPrime",
"2",
"true",
"for(int i = 3; i <= Math.sqrt( isPrime.length ); i+=2){\n\t\t\t/*\n\t\t\tif(i % 2 == 0){\n\t\t\t\tisPrime[i] = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t*/\n\n\t\t\tif(isPrime[i] == false){\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tfor(int j = i * 2; j <= isPrime.length - 1; j += i){\n\t\t\t\tisPrime[j] = false;\n\t\t\t}\n\t\t}",
"int i = 3;",
"int i = 3;",
"i",
"3",
"i <= Math.sqrt( isPrime.length )",
"i",
"Math.sqrt( isPrime.length )",
"Math.sqrt",
"Math",
"isPrime.length",
"isPrime",
"isPrime.length",
"i+=2",
"i+=2",
"i",
"2",
"{\n\t\t\t/*\n\t\t\tif(i % 2 == 0){\n\t\t\t\tisPrime[i] = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t*/\n\n\t\t\tif(isPrime[i] == false){\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tfor(int j = i * 2; j <= isPrime.length - 1; j += i){\n\t\t\t\tisPrime[j] = false;\n\t\t\t}\n\t\t}",
"{\n\t\t\t/*\n\t\t\tif(i % 2 == 0){\n\t\t\t\tisPrime[i] = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t*/\n\n\t\t\tif(isPrime[i] == false){\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tfor(int j = i * 2; j <= isPrime.length - 1; j += i){\n\t\t\t\tisPrime[j] = false;\n\t\t\t}\n\t\t}",
"if(isPrime[i] == false){\n\t\t\t\tcontinue;\n\t\t\t}",
"isPrime[i] == false",
"isPrime[i]",
"isPrime",
"i",
"false",
"{\n\t\t\t\tcontinue;\n\t\t\t}",
"continue;",
"for(int j = i * 2; j <= isPrime.length - 1; j += i){\n\t\t\t\tisPrime[j] = false;\n\t\t\t}",
"int j = i * 2;",
"int j = i * 2;",
"j",
"i * 2",
"i",
"2",
"j <= isPrime.length - 1",
"j",
"isPrime.length - 1",
"isPrime.length",
"isPrime",
"isPrime.length",
"1",
"j += i",
"j += i",
"j",
"i",
"{\n\t\t\t\tisPrime[j] = false;\n\t\t\t}",
"{\n\t\t\t\tisPrime[j] = false;\n\t\t\t}",
"isPrime[j] = false",
"isPrime[j]",
"isPrime",
"j",
"false",
"public boolean isPrime(int index){\n\t\tif(index % 2 == 0 && index != 2){\n\t\t\treturn false;\n\t\t}\n\t\treturn isPrime[index];\n\t}",
"isPrime",
"{\n\t\tif(index % 2 == 0 && index != 2){\n\t\t\treturn false;\n\t\t}\n\t\treturn isPrime[index];\n\t}",
"if(index % 2 == 0 && index != 2){\n\t\t\treturn false;\n\t\t}",
"index % 2 == 0 && index != 2",
"index % 2 == 0",
"index % 2",
"index",
"2",
"0",
"index != 2",
"index",
"2",
"{\n\t\t\treturn false;\n\t\t}",
"return false;",
"false",
"return isPrime[index];",
"isPrime[index]",
"isPrime",
"index",
"int index",
"index",
"public class Main {\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\t// TODO ?????????????????????????????????????????????\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tPrimeNumberGenerator png = new PrimeNumberGenerator();\n\t\tint count = 0;\n\n\t\tfor(int i = 0; i < n; i++){\n\n\t\t\tint m = Integer.parseInt(br.readLine());\n\n\n\t\t\tif(png.isPrime(m)){\n\t\t\t\t\t//System.out.println(i);\n\t\t\t\tcount++;\n\t\t\t}\n\n\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n}",
"public class Main {\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\t// TODO ?????????????????????????????????????????????\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tPrimeNumberGenerator png = new PrimeNumberGenerator();\n\t\tint count = 0;\n\n\t\tfor(int i = 0; i < n; i++){\n\n\t\t\tint m = Integer.parseInt(br.readLine());\n\n\n\t\t\tif(png.isPrime(m)){\n\t\t\t\t\t//System.out.println(i);\n\t\t\t\tcount++;\n\t\t\t}\n\n\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n}",
"Main"
] | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Date;
public class Main {
public static void main(String[] args) throws NumberFormatException, IOException {
// TODO ?????????????????????????????????????????????
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
PrimeNumberGenerator png = new PrimeNumberGenerator();
int count = 0;
for(int i = 0; i < n; i++){
int m = Integer.parseInt(br.readLine());
if(png.isPrime(m)){
//System.out.println(i);
count++;
}
}
System.out.println(count);
}
}
class PrimeNumberGenerator {
private boolean[] isPrime= new boolean[100000001];
public PrimeNumberGenerator() {
//Date from = new Date();
Arrays.fill(isPrime, true);
isPrime[0] = false;
isPrime[1] = false;
isPrime[2] = true;
for(int i = 3; i <= Math.sqrt( isPrime.length ); i+=2){
/*
if(i % 2 == 0){
isPrime[i] = false;
continue;
}
*/
if(isPrime[i] == false){
continue;
}
for(int j = i * 2; j <= isPrime.length - 1; j += i){
isPrime[j] = false;
}
}
//Date to = new Date();
//System.out.println("init takes "+ (to.getTime() - from.getTime())+ "milli sec");
}
public boolean isPrime(int index){
if(index % 2 == 0 && index != 2){
return false;
}
return isPrime[index];
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
13,
17,
30,
40,
13,
9,
14,
2,
2,
18,
13,
13,
17,
2,
2,
18,
13,
13,
17,
17,
30,
9,
41,
13,
17,
42,
2,
13,
4,
18,
13,
18,
13,
13,
30,
14,
2,
2,
18,
13,
13,
13,
17,
30,
3,
0,
13,
17,
14,
2,
13,
4,
18,
13,
18,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
14,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
20,
23
],
[
23,
24
],
[
24,
25
],
[
14,
26
],
[
26,
27
],
[
26,
28
],
[
14,
30
],
[
30,
31
],
[
31,
32
],
[
32,
33
],
[
32,
34
],
[
30,
35
],
[
35,
36
],
[
35,
37
],
[
37,
38
],
[
37,
39
],
[
30,
40
],
[
40,
41
],
[
41,
42
],
[
30,
43
],
[
44,
44
],
[
44,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
45,
49
],
[
49,
50
],
[
50,
51
],
[
49,
52
],
[
52,
53
],
[
53,
54
],
[
14,
55
],
[
55,
56
],
[
55,
57
],
[
14,
58
],
[
58,
59
],
[
59,
60
],
[
60,
61
],
[
60,
62
],
[
58,
63
],
[
63,
64
],
[
63,
65
],
[
65,
66
],
[
65,
67
],
[
58,
68
],
[
68,
69
],
[
69,
70
],
[
58,
71
],
[
72,
72
],
[
72,
73
],
[
73,
74
],
[
74,
75
],
[
75,
76
],
[
75,
77
],
[
74,
78
],
[
73,
79
],
[
79,
80
],
[
80,
81
],
[
79,
82
],
[
73,
83
],
[
83,
84
],
[
84,
85
],
[
85,
86
],
[
86,
87
],
[
86,
88
],
[
85,
89
],
[
84,
90
],
[
90,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
91,
95
],
[
90,
96
],
[
83,
97
],
[
97,
98
],
[
72,
99
],
[
99,
100
],
[
99,
101
],
[
72,
102
],
[
102,
103
],
[
103,
104
],
[
103,
105
],
[
105,
106
],
[
106,
107
],
[
105,
108
],
[
108,
109
],
[
108,
110
],
[
102,
111
],
[
111,
112
],
[
112,
113
],
[
113,
114
],
[
114,
115
],
[
115,
116
],
[
115,
117
],
[
114,
118
],
[
113,
119
],
[
112,
120
],
[
120,
121
],
[
111,
122
],
[
122,
123
],
[
122,
124
],
[
72,
125
],
[
125,
126
],
[
126,
127
],
[
126,
128
],
[
128,
129
],
[
129,
130
],
[
128,
131
],
[
131,
132
],
[
131,
133
],
[
125,
134
],
[
134,
135
],
[
135,
136
],
[
14,
137
],
[
137,
138
],
[
138,
139
],
[
139,
140
],
[
139,
141
],
[
137,
142
],
[
12,
143
],
[
143,
144
]
] | [
"import java.io.*;\nimport java.util.*;\nimport java.lang.*;\n\nclass Main{\n public static void main(String[] args) throws IOException{\n Scanner scan=new Scanner(System.in);\n int n=Integer.parseInt(scan.next());\n int[] numbers=new int[n];\n for(int i=0;i<numbers.length;i++){\n numbers[i]=Integer.parseInt(scan.next());\n }\n\n int count=0;\n for(int i=0;i<numbers.length;i++){\n if(numbers[i]==2){\n count++;\n continue;\n }else if(numbers[i]<2 || numbers[i]%2==0){\n continue;\n }\n int j=3;\n while(j<=Math.sqrt(numbers[i])){\n if(numbers[i]%j==0){\n break;\n }\n j+=2;\n }\n if(j>Math.sqrt(numbers[i])){\n count++;\n }\n }\n System.out.println(count);\n }\n}",
"import java.io.*;",
"io.*",
"java",
"import java.util.*;",
"util.*",
"java",
"import java.lang.*;",
"lang.*",
"java",
"class Main{\n public static void main(String[] args) throws IOException{\n Scanner scan=new Scanner(System.in);\n int n=Integer.parseInt(scan.next());\n int[] numbers=new int[n];\n for(int i=0;i<numbers.length;i++){\n numbers[i]=Integer.parseInt(scan.next());\n }\n\n int count=0;\n for(int i=0;i<numbers.length;i++){\n if(numbers[i]==2){\n count++;\n continue;\n }else if(numbers[i]<2 || numbers[i]%2==0){\n continue;\n }\n int j=3;\n while(j<=Math.sqrt(numbers[i])){\n if(numbers[i]%j==0){\n break;\n }\n j+=2;\n }\n if(j>Math.sqrt(numbers[i])){\n count++;\n }\n }\n System.out.println(count);\n }\n}",
"Main",
"public static void main(String[] args) throws IOException{\n Scanner scan=new Scanner(System.in);\n int n=Integer.parseInt(scan.next());\n int[] numbers=new int[n];\n for(int i=0;i<numbers.length;i++){\n numbers[i]=Integer.parseInt(scan.next());\n }\n\n int count=0;\n for(int i=0;i<numbers.length;i++){\n if(numbers[i]==2){\n count++;\n continue;\n }else if(numbers[i]<2 || numbers[i]%2==0){\n continue;\n }\n int j=3;\n while(j<=Math.sqrt(numbers[i])){\n if(numbers[i]%j==0){\n break;\n }\n j+=2;\n }\n if(j>Math.sqrt(numbers[i])){\n count++;\n }\n }\n System.out.println(count);\n }",
"main",
"{\n Scanner scan=new Scanner(System.in);\n int n=Integer.parseInt(scan.next());\n int[] numbers=new int[n];\n for(int i=0;i<numbers.length;i++){\n numbers[i]=Integer.parseInt(scan.next());\n }\n\n int count=0;\n for(int i=0;i<numbers.length;i++){\n if(numbers[i]==2){\n count++;\n continue;\n }else if(numbers[i]<2 || numbers[i]%2==0){\n continue;\n }\n int j=3;\n while(j<=Math.sqrt(numbers[i])){\n if(numbers[i]%j==0){\n break;\n }\n j+=2;\n }\n if(j>Math.sqrt(numbers[i])){\n count++;\n }\n }\n System.out.println(count);\n }",
"Scanner scan=new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"int n=Integer.parseInt(scan.next());",
"n",
"Integer.parseInt(scan.next())",
"Integer.parseInt",
"Integer",
"scan.next()",
"scan.next",
"scan",
"int[] numbers=new int[n];",
"numbers",
"new int[n]",
"n",
"for(int i=0;i<numbers.length;i++){\n numbers[i]=Integer.parseInt(scan.next());\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<numbers.length",
"i",
"numbers.length",
"numbers",
"numbers.length",
"i++",
"i++",
"i",
"{\n numbers[i]=Integer.parseInt(scan.next());\n }",
"{\n numbers[i]=Integer.parseInt(scan.next());\n }",
"numbers[i]=Integer.parseInt(scan.next())",
"numbers[i]",
"numbers",
"i",
"Integer.parseInt(scan.next())",
"Integer.parseInt",
"Integer",
"scan.next()",
"scan.next",
"scan",
"int count=0;",
"count",
"0",
"for(int i=0;i<numbers.length;i++){\n if(numbers[i]==2){\n count++;\n continue;\n }else if(numbers[i]<2 || numbers[i]%2==0){\n continue;\n }\n int j=3;\n while(j<=Math.sqrt(numbers[i])){\n if(numbers[i]%j==0){\n break;\n }\n j+=2;\n }\n if(j>Math.sqrt(numbers[i])){\n count++;\n }\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<numbers.length",
"i",
"numbers.length",
"numbers",
"numbers.length",
"i++",
"i++",
"i",
"{\n if(numbers[i]==2){\n count++;\n continue;\n }else if(numbers[i]<2 || numbers[i]%2==0){\n continue;\n }\n int j=3;\n while(j<=Math.sqrt(numbers[i])){\n if(numbers[i]%j==0){\n break;\n }\n j+=2;\n }\n if(j>Math.sqrt(numbers[i])){\n count++;\n }\n }",
"{\n if(numbers[i]==2){\n count++;\n continue;\n }else if(numbers[i]<2 || numbers[i]%2==0){\n continue;\n }\n int j=3;\n while(j<=Math.sqrt(numbers[i])){\n if(numbers[i]%j==0){\n break;\n }\n j+=2;\n }\n if(j>Math.sqrt(numbers[i])){\n count++;\n }\n }",
"if(numbers[i]==2){\n count++;\n continue;\n }else if(numbers[i]<2 || numbers[i]%2==0){\n continue;\n }",
"numbers[i]==2",
"numbers[i]",
"numbers",
"i",
"2",
"{\n count++;\n continue;\n }",
"count++",
"count",
"continue;",
"if(numbers[i]<2 || numbers[i]%2==0){\n continue;\n }",
"numbers[i]<2 || numbers[i]%2==0",
"numbers[i]<2",
"numbers[i]",
"numbers",
"i",
"2",
"numbers[i]%2==0",
"numbers[i]%2",
"numbers[i]",
"numbers",
"i",
"2",
"0",
"{\n continue;\n }",
"continue;",
"int j=3;",
"j",
"3",
"while(j<=Math.sqrt(numbers[i])){\n if(numbers[i]%j==0){\n break;\n }\n j+=2;\n }",
"j<=Math.sqrt(numbers[i])",
"j",
"Math.sqrt(numbers[i])",
"Math.sqrt",
"Math",
"numbers[i]",
"numbers",
"i",
"{\n if(numbers[i]%j==0){\n break;\n }\n j+=2;\n }",
"if(numbers[i]%j==0){\n break;\n }",
"numbers[i]%j==0",
"numbers[i]%j",
"numbers[i]",
"numbers",
"i",
"j",
"0",
"{\n break;\n }",
"break;",
"j+=2",
"j",
"2",
"if(j>Math.sqrt(numbers[i])){\n count++;\n }",
"j>Math.sqrt(numbers[i])",
"j",
"Math.sqrt(numbers[i])",
"Math.sqrt",
"Math",
"numbers[i]",
"numbers",
"i",
"{\n count++;\n }",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args"
] | import java.io.*;
import java.util.*;
import java.lang.*;
class Main{
public static void main(String[] args) throws IOException{
Scanner scan=new Scanner(System.in);
int n=Integer.parseInt(scan.next());
int[] numbers=new int[n];
for(int i=0;i<numbers.length;i++){
numbers[i]=Integer.parseInt(scan.next());
}
int count=0;
for(int i=0;i<numbers.length;i++){
if(numbers[i]==2){
count++;
continue;
}else if(numbers[i]<2 || numbers[i]%2==0){
continue;
}
int j=3;
while(j<=Math.sqrt(numbers[i])){
if(numbers[i]%j==0){
break;
}
j+=2;
}
if(j>Math.sqrt(numbers[i])){
count++;
}
}
System.out.println(count);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
41,
13,
17,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
18,
13,
13,
9,
11,
1,
41,
13,
2,
17,
13,
2,
13,
18,
13,
13,
1,
0,
13,
13,
30,
30,
0,
18,
13,
13,
17,
42,
2,
13,
17,
30,
41,
13,
4,
18,
13,
14,
2,
2,
13,
13,
4,
13,
13,
40,
13,
14,
2,
2,
13,
13,
40,
18,
13,
13,
40,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
17,
29,
17,
30,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
29,
17,
29,
17,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
20
],
[
20,
21
],
[
20,
22
],
[
8,
23
],
[
23,
24
],
[
23,
25
],
[
8,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
29,
31
],
[
27,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
34,
36
],
[
27,
37
],
[
37,
38
],
[
38,
39
],
[
27,
40
],
[
41,
41
],
[
41,
42
],
[
42,
43
],
[
43,
44
],
[
43,
45
],
[
42,
46
],
[
41,
47
],
[
47,
48
],
[
48,
49
],
[
49,
50
],
[
49,
51
],
[
51,
52
],
[
51,
53
],
[
47,
54
],
[
54,
55
],
[
54,
56
],
[
56,
57
],
[
56,
58
],
[
47,
59
],
[
59,
60
],
[
60,
61
],
[
60,
62
],
[
47,
63
],
[
64,
64
],
[
64,
65
],
[
65,
66
],
[
66,
67
],
[
66,
68
],
[
65,
69
],
[
8,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
70,
74
],
[
74,
75
],
[
75,
76
],
[
75,
77
],
[
77,
78
],
[
78,
79
],
[
74,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
82,
84
],
[
81,
85
],
[
85,
86
],
[
85,
87
],
[
80,
88
],
[
88,
89
],
[
80,
90
],
[
90,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
91,
95
],
[
95,
96
],
[
96,
97
],
[
96,
98
],
[
90,
99
],
[
99,
100
],
[
74,
101
],
[
101,
102
],
[
8,
103
],
[
103,
104
],
[
104,
105
],
[
105,
106
],
[
105,
107
],
[
103,
108
],
[
6,
109
],
[
109,
110
],
[
4,
111
],
[
111,
112
],
[
111,
113
],
[
113,
114
],
[
114,
115
],
[
115,
116
],
[
115,
117
],
[
114,
118
],
[
118,
119
],
[
114,
120
],
[
120,
121
],
[
121,
122
],
[
122,
123
],
[
122,
124
],
[
121,
125
],
[
120,
126
],
[
126,
127
],
[
120,
128
],
[
128,
129
],
[
129,
130
],
[
130,
131
],
[
131,
132
],
[
131,
133
],
[
129,
134
],
[
134,
135
],
[
135,
136
],
[
135,
137
],
[
134,
138
],
[
129,
139
],
[
139,
140
],
[
140,
141
],
[
140,
142
],
[
129,
143
],
[
144,
144
],
[
144,
145
],
[
145,
146
],
[
146,
147
],
[
147,
148
],
[
147,
149
],
[
146,
150
],
[
145,
151
],
[
151,
152
],
[
128,
153
],
[
153,
154
],
[
111,
155
],
[
155,
156
]
] | [
"import java.util.Scanner;\n\nclass Main { \n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int N = in.nextInt();\n int count = 0;\n int borderline = 1000;\n \n boolean primes[] = new boolean [borderline];\n for(int n = 2; n < primes.length; n++){\n if(primes[n]) continue;\n for(int m = 2 * n; m < primes.length; m += n) {\n primes[m] = true;\n }\n }\n \n while (N != 0) {\n int num = in.nextInt();\n if ((num > borderline) && isPrime(num)) count++;\n else if ((num <= borderline) && !primes[num]) count++;\n N--;\n }\n \n System.out.println(count);\n }\n \n public static boolean isPrime(int x) {\n if (x == 2) return true;\n else if (x % 2 == 0) return false;\n else {\n for (int i = 3; i * i <= x; i += 2) {\n if (x % i == 0) return false;\n }\n return true;\n }\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"class Main { \n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int N = in.nextInt();\n int count = 0;\n int borderline = 1000;\n \n boolean primes[] = new boolean [borderline];\n for(int n = 2; n < primes.length; n++){\n if(primes[n]) continue;\n for(int m = 2 * n; m < primes.length; m += n) {\n primes[m] = true;\n }\n }\n \n while (N != 0) {\n int num = in.nextInt();\n if ((num > borderline) && isPrime(num)) count++;\n else if ((num <= borderline) && !primes[num]) count++;\n N--;\n }\n \n System.out.println(count);\n }\n \n public static boolean isPrime(int x) {\n if (x == 2) return true;\n else if (x % 2 == 0) return false;\n else {\n for (int i = 3; i * i <= x; i += 2) {\n if (x % i == 0) return false;\n }\n return true;\n }\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int N = in.nextInt();\n int count = 0;\n int borderline = 1000;\n \n boolean primes[] = new boolean [borderline];\n for(int n = 2; n < primes.length; n++){\n if(primes[n]) continue;\n for(int m = 2 * n; m < primes.length; m += n) {\n primes[m] = true;\n }\n }\n \n while (N != 0) {\n int num = in.nextInt();\n if ((num > borderline) && isPrime(num)) count++;\n else if ((num <= borderline) && !primes[num]) count++;\n N--;\n }\n \n System.out.println(count);\n }",
"main",
"{\n Scanner in = new Scanner(System.in);\n int N = in.nextInt();\n int count = 0;\n int borderline = 1000;\n \n boolean primes[] = new boolean [borderline];\n for(int n = 2; n < primes.length; n++){\n if(primes[n]) continue;\n for(int m = 2 * n; m < primes.length; m += n) {\n primes[m] = true;\n }\n }\n \n while (N != 0) {\n int num = in.nextInt();\n if ((num > borderline) && isPrime(num)) count++;\n else if ((num <= borderline) && !primes[num]) count++;\n N--;\n }\n \n System.out.println(count);\n }",
"Scanner in = new Scanner(System.in);",
"in",
"new Scanner(System.in)",
"int N = in.nextInt();",
"N",
"in.nextInt()",
"in.nextInt",
"in",
"int count = 0;",
"count",
"0",
"int borderline = 1000;",
"borderline",
"1000",
"boolean primes[] = new boolean [borderline];",
"primes",
"new boolean [borderline]",
"borderline",
"for(int n = 2; n < primes.length; n++){\n if(primes[n]) continue;\n for(int m = 2 * n; m < primes.length; m += n) {\n primes[m] = true;\n }\n }",
"int n = 2;",
"int n = 2;",
"n",
"2",
"n < primes.length",
"n",
"primes.length",
"primes",
"primes.length",
"n++",
"n++",
"n",
"{\n if(primes[n]) continue;\n for(int m = 2 * n; m < primes.length; m += n) {\n primes[m] = true;\n }\n }",
"{\n if(primes[n]) continue;\n for(int m = 2 * n; m < primes.length; m += n) {\n primes[m] = true;\n }\n }",
"if(primes[n]) continue;",
"primes[n]",
"primes",
"n",
"continue;",
"for(int m = 2 * n; m < primes.length; m += n) {\n primes[m] = true;\n }",
"int m = 2 * n;",
"int m = 2 * n;",
"m",
"2 * n",
"2",
"n",
"m < primes.length",
"m",
"primes.length",
"primes",
"primes.length",
"m += n",
"m += n",
"m",
"n",
"{\n primes[m] = true;\n }",
"{\n primes[m] = true;\n }",
"primes[m] = true",
"primes[m]",
"primes",
"m",
"true",
"while (N != 0) {\n int num = in.nextInt();\n if ((num > borderline) && isPrime(num)) count++;\n else if ((num <= borderline) && !primes[num]) count++;\n N--;\n }",
"N != 0",
"N",
"0",
"{\n int num = in.nextInt();\n if ((num > borderline) && isPrime(num)) count++;\n else if ((num <= borderline) && !primes[num]) count++;\n N--;\n }",
"int num = in.nextInt();",
"num",
"in.nextInt()",
"in.nextInt",
"in",
"if ((num > borderline) && isPrime(num)) count++;\n else if ((num <= borderline) && !primes[num]) count++;",
"(num > borderline) && isPrime(num)",
"(num > borderline)",
"num",
"borderline",
"isPrime(num)",
"isPrime",
"num",
"count++",
"count",
"if ((num <= borderline) && !primes[num]) count++;",
"(num <= borderline) && !primes[num]",
"(num <= borderline)",
"num",
"borderline",
"!primes[num]",
"primes[num]",
"primes",
"num",
"count++",
"count",
"N--",
"N",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"public static boolean isPrime(int x) {\n if (x == 2) return true;\n else if (x % 2 == 0) return false;\n else {\n for (int i = 3; i * i <= x; i += 2) {\n if (x % i == 0) return false;\n }\n return true;\n }\n }",
"isPrime",
"{\n if (x == 2) return true;\n else if (x % 2 == 0) return false;\n else {\n for (int i = 3; i * i <= x; i += 2) {\n if (x % i == 0) return false;\n }\n return true;\n }\n }",
"if (x == 2) return true;\n else if (x % 2 == 0) return false;\n else {\n for (int i = 3; i * i <= x; i += 2) {\n if (x % i == 0) return false;\n }\n return true;\n }",
"x == 2",
"x",
"2",
"return true;",
"true",
"if (x % 2 == 0) return false;\n else {\n for (int i = 3; i * i <= x; i += 2) {\n if (x % i == 0) return false;\n }\n return true;\n }",
"x % 2 == 0",
"x % 2",
"x",
"2",
"0",
"return false;",
"false",
"{\n for (int i = 3; i * i <= x; i += 2) {\n if (x % i == 0) return false;\n }\n return true;\n }",
"for (int i = 3; i * i <= x; i += 2) {\n if (x % i == 0) return false;\n }",
"int i = 3;",
"int i = 3;",
"i",
"3",
"i * i <= x",
"i * i",
"i",
"i",
"x",
"i += 2",
"i += 2",
"i",
"2",
"{\n if (x % i == 0) return false;\n }",
"{\n if (x % i == 0) return false;\n }",
"if (x % i == 0) return false;",
"x % i == 0",
"x % i",
"x",
"i",
"0",
"return false;",
"false",
"return true;",
"true",
"int x",
"x"
] | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int N = in.nextInt();
int count = 0;
int borderline = 1000;
boolean primes[] = new boolean [borderline];
for(int n = 2; n < primes.length; n++){
if(primes[n]) continue;
for(int m = 2 * n; m < primes.length; m += n) {
primes[m] = true;
}
}
while (N != 0) {
int num = in.nextInt();
if ((num > borderline) && isPrime(num)) count++;
else if ((num <= borderline) && !primes[num]) count++;
N--;
}
System.out.println(count);
}
public static boolean isPrime(int x) {
if (x == 2) return true;
else if (x % 2 == 0) return false;
else {
for (int i = 3; i * i <= x; i += 2) {
if (x % i == 0) return false;
}
return true;
}
}
} |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
4,
18,
13,
4,
18,
13,
4,
18,
18,
13,
13,
4,
18,
13,
4,
13,
13,
23,
13,
12,
13,
30,
41,
13,
17,
28,
13,
13,
30,
30,
14,
4,
13,
13,
40,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
14,
2,
13,
17,
30,
0,
13,
17,
14,
2,
13,
17,
30,
0,
13,
17,
14,
2,
2,
13,
17,
17,
30,
0,
13,
17,
30,
0,
13,
17,
41,
13,
4,
18,
13,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
30,
0,
13,
17,
3,
29,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
167,
8
],
[
167,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
13,
14
],
[
13,
15
],
[
15,
16
],
[
16,
17
],
[
17,
18
],
[
12,
19
],
[
19,
20
],
[
20,
21
],
[
20,
22
],
[
19,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
26,
27
],
[
25,
28
],
[
28,
29
],
[
29,
30
],
[
19,
31
],
[
31,
32
],
[
31,
33
],
[
19,
35
],
[
35,
36
],
[
36,
37
],
[
37,
38
],
[
37,
39
],
[
35,
40
],
[
40,
41
],
[
40,
42
],
[
35,
43
],
[
43,
44
],
[
44,
45
],
[
35,
46
],
[
47,
47
],
[
47,
48
],
[
48,
49
],
[
49,
50
],
[
49,
51
],
[
48,
52
],
[
52,
53
],
[
53,
54
],
[
52,
55
],
[
55,
56
],
[
56,
57
],
[
19,
58
],
[
58,
59
],
[
59,
60
],
[
19,
61
],
[
61,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
61,
66
],
[
66,
67
],
[
67,
68
],
[
66,
69
],
[
69,
70
],
[
69,
71
],
[
9,
72
],
[
72,
73
],
[
167,
74
],
[
74,
75
],
[
74,
76
],
[
76,
77
],
[
77,
78
],
[
77,
79
],
[
76,
80
],
[
80,
81
],
[
80,
82
],
[
80,
83
],
[
84,
84
],
[
84,
85
],
[
85,
86
],
[
86,
87
],
[
86,
88
],
[
85,
89
],
[
89,
90
],
[
76,
91
],
[
91,
92
],
[
74,
93
],
[
93,
94
],
[
167,
95
],
[
95,
96
],
[
95,
97
],
[
97,
98
],
[
98,
99
],
[
97,
100
],
[
100,
101
],
[
101,
102
],
[
101,
103
],
[
100,
104
],
[
104,
105
],
[
105,
106
],
[
105,
107
],
[
100,
108
],
[
108,
109
],
[
109,
110
],
[
109,
111
],
[
108,
112
],
[
112,
113
],
[
113,
114
],
[
113,
115
],
[
108,
116
],
[
116,
117
],
[
117,
118
],
[
118,
119
],
[
118,
120
],
[
117,
121
],
[
116,
122
],
[
122,
123
],
[
123,
124
],
[
123,
125
],
[
116,
126
],
[
126,
127
],
[
127,
128
],
[
127,
129
],
[
126,
130
],
[
130,
131
],
[
130,
132
],
[
132,
133
],
[
133,
134
],
[
132,
135
],
[
132,
136
],
[
126,
137
],
[
137,
138
],
[
138,
139
],
[
139,
140
],
[
139,
141
],
[
137,
142
],
[
142,
143
],
[
142,
144
],
[
137,
145
],
[
145,
146
],
[
146,
147
],
[
146,
148
],
[
137,
149
],
[
150,
150
],
[
150,
151
],
[
151,
152
],
[
152,
153
],
[
153,
154
],
[
153,
155
],
[
152,
156
],
[
151,
157
],
[
157,
158
],
[
158,
159
],
[
158,
160
],
[
157,
161
],
[
97,
162
],
[
162,
163
],
[
95,
164
],
[
164,
165
],
[
0,
166
],
[
166,
167
],
[
166,
168
]
] | [
"import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tfinal int n = Integer.parseInt(reader.readLine());\n\t\t\tfinal int[] list = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tlist[i] = Integer.parseInt(reader.readLine());\n\t\t\t}\n\t\t\treader.close();\n\t\t\t\n\t\t\tSystem.out.println(String.valueOf(countPrime(list)));\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\t\n\t}\n\t\n\tpublic static int countPrime(final int[] list) {\n\t\tint count = 0;\n\t\t\n\t\tfor (int num : list) {\n\t\t\tif (isPrime(num)) count++;\n\t\t}\n\t\treturn count;\n\t}\n\t\n\tpublic static boolean isPrime(final int num) {\n\t\tboolean isPrime;\n\t\t\n\t\tif (num < 2) {\n\t\t\tisPrime = false;\n\t\t\t\n\t\t} else if (num == 2) {\n\t\t\tisPrime = true;\n\t\t\t\n\t\t} else if (num % 2 == 0) { \n\t\t\tisPrime = false;\n\t\t\t\n\t\t} else {\n\t\t\tisPrime = true;\n\t\t\t\n\t\t\tfinal int end = (int)Math.pow(num, 0.5);\n\t\t\tfor (int i = 3; i <= end; i += 2) {\n\t\t\t\tif (num % i == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn isPrime;\n\t}\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tfinal int n = Integer.parseInt(reader.readLine());\n\t\t\tfinal int[] list = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tlist[i] = Integer.parseInt(reader.readLine());\n\t\t\t}\n\t\t\treader.close();\n\t\t\t\n\t\t\tSystem.out.println(String.valueOf(countPrime(list)));\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\t\n\t}\n\t\n\tpublic static int countPrime(final int[] list) {\n\t\tint count = 0;\n\t\t\n\t\tfor (int num : list) {\n\t\t\tif (isPrime(num)) count++;\n\t\t}\n\t\treturn count;\n\t}\n\t\n\tpublic static boolean isPrime(final int num) {\n\t\tboolean isPrime;\n\t\t\n\t\tif (num < 2) {\n\t\t\tisPrime = false;\n\t\t\t\n\t\t} else if (num == 2) {\n\t\t\tisPrime = true;\n\t\t\t\n\t\t} else if (num % 2 == 0) { \n\t\t\tisPrime = false;\n\t\t\t\n\t\t} else {\n\t\t\tisPrime = true;\n\t\t\t\n\t\t\tfinal int end = (int)Math.pow(num, 0.5);\n\t\t\tfor (int i = 3; i <= end; i += 2) {\n\t\t\t\tif (num % i == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn isPrime;\n\t}\n}",
"Main",
"public static void main(String[] args) {\n\t\ttry {\n\t\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tfinal int n = Integer.parseInt(reader.readLine());\n\t\t\tfinal int[] list = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tlist[i] = Integer.parseInt(reader.readLine());\n\t\t\t}\n\t\t\treader.close();\n\t\t\t\n\t\t\tSystem.out.println(String.valueOf(countPrime(list)));\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\t\n\t}",
"main",
"{\n\t\ttry {\n\t\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tfinal int n = Integer.parseInt(reader.readLine());\n\t\t\tfinal int[] list = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tlist[i] = Integer.parseInt(reader.readLine());\n\t\t\t}\n\t\t\treader.close();\n\t\t\t\n\t\t\tSystem.out.println(String.valueOf(countPrime(list)));\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\t\n\t}",
"try {\n\t\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tfinal int n = Integer.parseInt(reader.readLine());\n\t\t\tfinal int[] list = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tlist[i] = Integer.parseInt(reader.readLine());\n\t\t\t}\n\t\t\treader.close();\n\t\t\t\n\t\t\tSystem.out.println(String.valueOf(countPrime(list)));\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}",
"catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}",
"Exception e",
"{\n\t\t\te.printStackTrace();\n\t\t}",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n\t\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tfinal int n = Integer.parseInt(reader.readLine());\n\t\t\tfinal int[] list = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tlist[i] = Integer.parseInt(reader.readLine());\n\t\t\t}\n\t\t\treader.close();\n\t\t\t\n\t\t\tSystem.out.println(String.valueOf(countPrime(list)));\n\t\t}",
"BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));",
"reader",
"new BufferedReader(new InputStreamReader(System.in))",
"final int n = Integer.parseInt(reader.readLine());",
"n",
"Integer.parseInt(reader.readLine())",
"Integer.parseInt",
"Integer",
"reader.readLine()",
"reader.readLine",
"reader",
"final int[] list = new int[n];",
"list",
"new int[n]",
"n",
"for (int i = 0; i < n; i++) {\n\t\t\t\tlist[i] = Integer.parseInt(reader.readLine());\n\t\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\t\tlist[i] = Integer.parseInt(reader.readLine());\n\t\t\t}",
"{\n\t\t\t\tlist[i] = Integer.parseInt(reader.readLine());\n\t\t\t}",
"list[i] = Integer.parseInt(reader.readLine())",
"list[i]",
"list",
"i",
"Integer.parseInt(reader.readLine())",
"Integer.parseInt",
"Integer",
"reader.readLine()",
"reader.readLine",
"reader",
"reader.close()",
"reader.close",
"reader",
"System.out.println(String.valueOf(countPrime(list)))",
"System.out.println",
"System.out",
"System",
"System.out",
"String.valueOf(countPrime(list))",
"String.valueOf",
"String",
"countPrime(list)",
"countPrime",
"list",
"String[] args",
"args",
"public static int countPrime(final int[] list) {\n\t\tint count = 0;\n\t\t\n\t\tfor (int num : list) {\n\t\t\tif (isPrime(num)) count++;\n\t\t}\n\t\treturn count;\n\t}",
"countPrime",
"{\n\t\tint count = 0;\n\t\t\n\t\tfor (int num : list) {\n\t\t\tif (isPrime(num)) count++;\n\t\t}\n\t\treturn count;\n\t}",
"int count = 0;",
"count",
"0",
"for (int num : list) {\n\t\t\tif (isPrime(num)) count++;\n\t\t}",
"int num",
"list",
"{\n\t\t\tif (isPrime(num)) count++;\n\t\t}",
"{\n\t\t\tif (isPrime(num)) count++;\n\t\t}",
"if (isPrime(num)) count++;",
"isPrime(num)",
"isPrime",
"num",
"count++",
"count",
"return count;",
"count",
"final int[] list",
"list",
"public static boolean isPrime(final int num) {\n\t\tboolean isPrime;\n\t\t\n\t\tif (num < 2) {\n\t\t\tisPrime = false;\n\t\t\t\n\t\t} else if (num == 2) {\n\t\t\tisPrime = true;\n\t\t\t\n\t\t} else if (num % 2 == 0) { \n\t\t\tisPrime = false;\n\t\t\t\n\t\t} else {\n\t\t\tisPrime = true;\n\t\t\t\n\t\t\tfinal int end = (int)Math.pow(num, 0.5);\n\t\t\tfor (int i = 3; i <= end; i += 2) {\n\t\t\t\tif (num % i == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn isPrime;\n\t}",
"isPrime",
"{\n\t\tboolean isPrime;\n\t\t\n\t\tif (num < 2) {\n\t\t\tisPrime = false;\n\t\t\t\n\t\t} else if (num == 2) {\n\t\t\tisPrime = true;\n\t\t\t\n\t\t} else if (num % 2 == 0) { \n\t\t\tisPrime = false;\n\t\t\t\n\t\t} else {\n\t\t\tisPrime = true;\n\t\t\t\n\t\t\tfinal int end = (int)Math.pow(num, 0.5);\n\t\t\tfor (int i = 3; i <= end; i += 2) {\n\t\t\t\tif (num % i == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn isPrime;\n\t}",
"boolean isPrime;",
"isPrime",
"if (num < 2) {\n\t\t\tisPrime = false;\n\t\t\t\n\t\t} else if (num == 2) {\n\t\t\tisPrime = true;\n\t\t\t\n\t\t} else if (num % 2 == 0) { \n\t\t\tisPrime = false;\n\t\t\t\n\t\t} else {\n\t\t\tisPrime = true;\n\t\t\t\n\t\t\tfinal int end = (int)Math.pow(num, 0.5);\n\t\t\tfor (int i = 3; i <= end; i += 2) {\n\t\t\t\tif (num % i == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"num < 2",
"num",
"2",
"{\n\t\t\tisPrime = false;\n\t\t\t\n\t\t}",
"isPrime = false",
"isPrime",
"false",
"if (num == 2) {\n\t\t\tisPrime = true;\n\t\t\t\n\t\t} else if (num % 2 == 0) { \n\t\t\tisPrime = false;\n\t\t\t\n\t\t} else {\n\t\t\tisPrime = true;\n\t\t\t\n\t\t\tfinal int end = (int)Math.pow(num, 0.5);\n\t\t\tfor (int i = 3; i <= end; i += 2) {\n\t\t\t\tif (num % i == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"num == 2",
"num",
"2",
"{\n\t\t\tisPrime = true;\n\t\t\t\n\t\t}",
"isPrime = true",
"isPrime",
"true",
"if (num % 2 == 0) { \n\t\t\tisPrime = false;\n\t\t\t\n\t\t} else {\n\t\t\tisPrime = true;\n\t\t\t\n\t\t\tfinal int end = (int)Math.pow(num, 0.5);\n\t\t\tfor (int i = 3; i <= end; i += 2) {\n\t\t\t\tif (num % i == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"num % 2 == 0",
"num % 2",
"num",
"2",
"0",
"{ \n\t\t\tisPrime = false;\n\t\t\t\n\t\t}",
"isPrime = false",
"isPrime",
"false",
"{\n\t\t\tisPrime = true;\n\t\t\t\n\t\t\tfinal int end = (int)Math.pow(num, 0.5);\n\t\t\tfor (int i = 3; i <= end; i += 2) {\n\t\t\t\tif (num % i == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"isPrime = true",
"isPrime",
"true",
"final int end = (int)Math.pow(num, 0.5);",
"end",
"(int)Math.pow(num, 0.5)",
"Math.pow",
"Math",
"num",
"0.5",
"for (int i = 3; i <= end; i += 2) {\n\t\t\t\tif (num % i == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"int i = 3;",
"int i = 3;",
"i",
"3",
"i <= end",
"i",
"end",
"i += 2",
"i += 2",
"i",
"2",
"{\n\t\t\t\tif (num % i == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif (num % i == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"if (num % i == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"num % i == 0",
"num % i",
"num",
"i",
"0",
"{\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"isPrime = false",
"isPrime",
"false",
"break;",
"return isPrime;",
"isPrime",
"final int num",
"num",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tfinal int n = Integer.parseInt(reader.readLine());\n\t\t\tfinal int[] list = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tlist[i] = Integer.parseInt(reader.readLine());\n\t\t\t}\n\t\t\treader.close();\n\t\t\t\n\t\t\tSystem.out.println(String.valueOf(countPrime(list)));\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\t\n\t}\n\t\n\tpublic static int countPrime(final int[] list) {\n\t\tint count = 0;\n\t\t\n\t\tfor (int num : list) {\n\t\t\tif (isPrime(num)) count++;\n\t\t}\n\t\treturn count;\n\t}\n\t\n\tpublic static boolean isPrime(final int num) {\n\t\tboolean isPrime;\n\t\t\n\t\tif (num < 2) {\n\t\t\tisPrime = false;\n\t\t\t\n\t\t} else if (num == 2) {\n\t\t\tisPrime = true;\n\t\t\t\n\t\t} else if (num % 2 == 0) { \n\t\t\tisPrime = false;\n\t\t\t\n\t\t} else {\n\t\t\tisPrime = true;\n\t\t\t\n\t\t\tfinal int end = (int)Math.pow(num, 0.5);\n\t\t\tfor (int i = 3; i <= end; i += 2) {\n\t\t\t\tif (num % i == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn isPrime;\n\t}\n}",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tfinal int n = Integer.parseInt(reader.readLine());\n\t\t\tfinal int[] list = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tlist[i] = Integer.parseInt(reader.readLine());\n\t\t\t}\n\t\t\treader.close();\n\t\t\t\n\t\t\tSystem.out.println(String.valueOf(countPrime(list)));\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\t\n\t}\n\t\n\tpublic static int countPrime(final int[] list) {\n\t\tint count = 0;\n\t\t\n\t\tfor (int num : list) {\n\t\t\tif (isPrime(num)) count++;\n\t\t}\n\t\treturn count;\n\t}\n\t\n\tpublic static boolean isPrime(final int num) {\n\t\tboolean isPrime;\n\t\t\n\t\tif (num < 2) {\n\t\t\tisPrime = false;\n\t\t\t\n\t\t} else if (num == 2) {\n\t\t\tisPrime = true;\n\t\t\t\n\t\t} else if (num % 2 == 0) { \n\t\t\tisPrime = false;\n\t\t\t\n\t\t} else {\n\t\t\tisPrime = true;\n\t\t\t\n\t\t\tfinal int end = (int)Math.pow(num, 0.5);\n\t\t\tfor (int i = 3; i <= end; i += 2) {\n\t\t\t\tif (num % i == 0) {\n\t\t\t\t\tisPrime = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn isPrime;\n\t}\n}",
"Main"
] | import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) {
try {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
final int n = Integer.parseInt(reader.readLine());
final int[] list = new int[n];
for (int i = 0; i < n; i++) {
list[i] = Integer.parseInt(reader.readLine());
}
reader.close();
System.out.println(String.valueOf(countPrime(list)));
} catch (Exception e) {
e.printStackTrace();
}
}
public static int countPrime(final int[] list) {
int count = 0;
for (int num : list) {
if (isPrime(num)) count++;
}
return count;
}
public static boolean isPrime(final int num) {
boolean isPrime;
if (num < 2) {
isPrime = false;
} else if (num == 2) {
isPrime = true;
} else if (num % 2 == 0) {
isPrime = false;
} else {
isPrime = true;
final int end = (int)Math.pow(num, 0.5);
for (int i = 3; i <= end; i += 2) {
if (num % i == 0) {
isPrime = false;
break;
}
}
}
return isPrime;
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
4,
13,
4,
18,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
13,
17,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
29,
17,
29,
2,
13,
17,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
20
],
[
20,
21
],
[
21,
22
],
[
22,
23
],
[
22,
24
],
[
20,
25
],
[
25,
26
],
[
25,
27
],
[
20,
28
],
[
28,
29
],
[
29,
30
],
[
20,
31
],
[
32,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
34,
36
],
[
36,
37
],
[
37,
38
],
[
33,
39
],
[
39,
40
],
[
8,
41
],
[
41,
42
],
[
42,
43
],
[
43,
44
],
[
43,
45
],
[
41,
46
],
[
6,
47
],
[
47,
48
],
[
4,
49
],
[
49,
50
],
[
49,
51
],
[
51,
52
],
[
52,
53
],
[
53,
54
],
[
54,
55
],
[
54,
56
],
[
52,
57
],
[
57,
58
],
[
57,
59
],
[
59,
60
],
[
60,
61
],
[
59,
62
],
[
59,
63
],
[
52,
64
],
[
64,
65
],
[
65,
66
],
[
52,
67
],
[
68,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
70,
74
],
[
69,
75
],
[
75,
76
],
[
51,
77
],
[
77,
78
],
[
78,
79
],
[
78,
80
],
[
49,
81
],
[
81,
82
]
] | [
"import java.util.*;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint n = stdIn.nextInt();\n\t\tint count = 0;\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tif(isPrime(stdIn.nextInt()))\n\t\t\t\tcount++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n\tstatic boolean isPrime(int x){\n\t\tfor (int i=2; i<=Math.pow(x,0.5); i++) {\n\t\t\tif(x%i == 0)\n\t\t\t\treturn false;\n\t\t}\n\t\treturn x!=1;\n\t}\n}",
"import java.util.*;",
"util.*",
"java",
"class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint n = stdIn.nextInt();\n\t\tint count = 0;\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tif(isPrime(stdIn.nextInt()))\n\t\t\t\tcount++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n\tstatic boolean isPrime(int x){\n\t\tfor (int i=2; i<=Math.pow(x,0.5); i++) {\n\t\t\tif(x%i == 0)\n\t\t\t\treturn false;\n\t\t}\n\t\treturn x!=1;\n\t}\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint n = stdIn.nextInt();\n\t\tint count = 0;\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tif(isPrime(stdIn.nextInt()))\n\t\t\t\tcount++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"main",
"{\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint n = stdIn.nextInt();\n\t\tint count = 0;\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tif(isPrime(stdIn.nextInt()))\n\t\t\t\tcount++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"Scanner stdIn = new Scanner(System.in);",
"stdIn",
"new Scanner(System.in)",
"int n = stdIn.nextInt();",
"n",
"stdIn.nextInt()",
"stdIn.nextInt",
"stdIn",
"int count = 0;",
"count",
"0",
"for (int i=0; i<n; i++) {\n\t\t\tif(isPrime(stdIn.nextInt()))\n\t\t\t\tcount++;\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tif(isPrime(stdIn.nextInt()))\n\t\t\t\tcount++;\n\t\t}",
"{\n\t\t\tif(isPrime(stdIn.nextInt()))\n\t\t\t\tcount++;\n\t\t}",
"if(isPrime(stdIn.nextInt()))\n\t\t\t\tcount++;",
"isPrime(stdIn.nextInt())",
"isPrime",
"stdIn.nextInt()",
"stdIn.nextInt",
"stdIn",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"static boolean isPrime(int x){\n\t\tfor (int i=2; i<=Math.pow(x,0.5); i++) {\n\t\t\tif(x%i == 0)\n\t\t\t\treturn false;\n\t\t}\n\t\treturn x!=1;\n\t}",
"isPrime",
"{\n\t\tfor (int i=2; i<=Math.pow(x,0.5); i++) {\n\t\t\tif(x%i == 0)\n\t\t\t\treturn false;\n\t\t}\n\t\treturn x!=1;\n\t}",
"for (int i=2; i<=Math.pow(x,0.5); i++) {\n\t\t\tif(x%i == 0)\n\t\t\t\treturn false;\n\t\t}",
"int i=2;",
"int i=2;",
"i",
"2",
"i<=Math.pow(x,0.5)",
"i",
"Math.pow(x,0.5)",
"Math.pow",
"Math",
"x",
"0.5",
"i++",
"i++",
"i",
"{\n\t\t\tif(x%i == 0)\n\t\t\t\treturn false;\n\t\t}",
"{\n\t\t\tif(x%i == 0)\n\t\t\t\treturn false;\n\t\t}",
"if(x%i == 0)\n\t\t\t\treturn false;",
"x%i == 0",
"x%i",
"x",
"i",
"0",
"return false;",
"false",
"return x!=1;",
"x!=1",
"x",
"1",
"int x",
"x"
] | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
int n = stdIn.nextInt();
int count = 0;
for (int i=0; i<n; i++) {
if(isPrime(stdIn.nextInt()))
count++;
}
System.out.println(count);
}
static boolean isPrime(int x){
for (int i=2; i<=Math.pow(x,0.5); i++) {
if(x%i == 0)
return false;
}
return x!=1;
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
14,
4,
13,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
85,
5
],
[
85,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
20
],
[
20,
21
],
[
21,
22
],
[
22,
23
],
[
22,
24
],
[
20,
25
],
[
25,
26
],
[
25,
27
],
[
20,
28
],
[
28,
29
],
[
29,
30
],
[
20,
31
],
[
32,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
35,
36
],
[
36,
37
],
[
32,
38
],
[
38,
39
],
[
39,
40
],
[
39,
41
],
[
38,
42
],
[
42,
43
],
[
8,
44
],
[
44,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
44,
49
],
[
6,
50
],
[
50,
51
],
[
85,
52
],
[
52,
53
],
[
52,
54
],
[
54,
55
],
[
55,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
55,
60
],
[
60,
61
],
[
60,
62
],
[
62,
63
],
[
63,
64
],
[
62,
65
],
[
55,
66
],
[
66,
67
],
[
67,
68
],
[
55,
69
],
[
70,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
73,
75
],
[
72,
76
],
[
71,
77
],
[
77,
78
],
[
78,
79
],
[
54,
80
],
[
80,
81
],
[
52,
82
],
[
82,
83
],
[
0,
84
],
[
84,
85
],
[
84,
86
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint ans=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint x=sc.nextInt();\n\t\t\tif(isPrime(x)) ans++;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\tstatic boolean isPrime(int x){\n\t\tfor(int j=2;j<=Math.sqrt(x);j++){\n\t\t\tif(x%j==0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint ans=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint x=sc.nextInt();\n\t\t\tif(isPrime(x)) ans++;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\tstatic boolean isPrime(int x){\n\t\tfor(int j=2;j<=Math.sqrt(x);j++){\n\t\t\tif(x%j==0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n}",
"Main",
"public static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint ans=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint x=sc.nextInt();\n\t\t\tif(isPrime(x)) ans++;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}",
"main",
"{\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint ans=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint x=sc.nextInt();\n\t\t\tif(isPrime(x)) ans++;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}",
"Scanner sc=new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n=sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int ans=0;",
"ans",
"0",
"for(int i=0;i<n;i++){\n\t\t\tint x=sc.nextInt();\n\t\t\tif(isPrime(x)) ans++;\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tint x=sc.nextInt();\n\t\t\tif(isPrime(x)) ans++;\n\t\t}",
"{\n\t\t\tint x=sc.nextInt();\n\t\t\tif(isPrime(x)) ans++;\n\t\t}",
"int x=sc.nextInt();",
"x",
"sc.nextInt()",
"sc.nextInt",
"sc",
"if(isPrime(x)) ans++;",
"isPrime(x)",
"isPrime",
"x",
"ans++",
"ans",
"System.out.println(ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"ans",
"String[] args",
"args",
"static boolean isPrime(int x){\n\t\tfor(int j=2;j<=Math.sqrt(x);j++){\n\t\t\tif(x%j==0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}",
"isPrime",
"{\n\t\tfor(int j=2;j<=Math.sqrt(x);j++){\n\t\t\tif(x%j==0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}",
"for(int j=2;j<=Math.sqrt(x);j++){\n\t\t\tif(x%j==0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}",
"int j=2;",
"int j=2;",
"j",
"2",
"j<=Math.sqrt(x)",
"j",
"Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"j++",
"j++",
"j",
"{\n\t\t\tif(x%j==0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}",
"{\n\t\t\tif(x%j==0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}",
"if(x%j==0){\n\t\t\t\treturn false;\n\t\t\t}",
"x%j==0",
"x%j",
"x",
"j",
"0",
"{\n\t\t\t\treturn false;\n\t\t\t}",
"return false;",
"false",
"return true;",
"true",
"int x",
"x",
"public class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint ans=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint x=sc.nextInt();\n\t\t\tif(isPrime(x)) ans++;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\tstatic boolean isPrime(int x){\n\t\tfor(int j=2;j<=Math.sqrt(x);j++){\n\t\t\tif(x%j==0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n}",
"public class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint ans=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint x=sc.nextInt();\n\t\t\tif(isPrime(x)) ans++;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\tstatic boolean isPrime(int x){\n\t\tfor(int j=2;j<=Math.sqrt(x);j++){\n\t\t\tif(x%j==0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n}",
"Main"
] | import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int ans=0;
for(int i=0;i<n;i++){
int x=sc.nextInt();
if(isPrime(x)) ans++;
}
System.out.println(ans);
}
static boolean isPrime(int x){
for(int j=2;j<=Math.sqrt(x);j++){
if(x%j==0){
return false;
}
}
return true;
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
0,
13,
20,
41,
13,
20,
4,
18,
13,
4,
18,
13,
23,
13,
6,
13,
12,
13,
30,
41,
13,
17,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
14,
4,
13,
13,
30,
40,
13,
4,
18,
13,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
17,
14,
2,
2,
13,
17,
2,
2,
13,
17,
17,
30,
29,
17,
41,
13,
17,
42,
2,
4,
18,
13,
13,
13,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
0,
13,
17,
29,
17,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
23,
13,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
4,
18,
13,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
4,
18,
13,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
4,
18,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
16,
17
],
[
16,
18
],
[
0,
19
],
[
19,
20
],
[
19,
21
],
[
0,
22
],
[
22,
23
],
[
22,
24
],
[
0,
25
],
[
247,
26
],
[
247,
27
],
[
27,
28
],
[
247,
29
],
[
29,
30
],
[
247,
31
],
[
31,
32
],
[
31,
33
],
[
33,
34
],
[
34,
35
],
[
34,
36
],
[
33,
37
],
[
37,
38
],
[
37,
39
],
[
33,
40
],
[
40,
41
],
[
40,
42
],
[
33,
43
],
[
43,
44
],
[
44,
45
],
[
33,
46
],
[
46,
47
],
[
47,
48
],
[
31,
49
],
[
49,
50
],
[
247,
51
],
[
51,
52
],
[
51,
53
],
[
53,
54
],
[
53,
55
],
[
55,
56
],
[
56,
57
],
[
56,
58
],
[
55,
59
],
[
59,
60
],
[
59,
61
],
[
61,
62
],
[
62,
63
],
[
55,
64
],
[
64,
65
],
[
65,
66
],
[
66,
67
],
[
66,
68
],
[
64,
69
],
[
69,
70
],
[
69,
71
],
[
64,
72
],
[
72,
73
],
[
73,
74
],
[
64,
75
],
[
76,
76
],
[
76,
77
],
[
77,
78
],
[
77,
79
],
[
79,
80
],
[
80,
81
],
[
76,
82
],
[
82,
83
],
[
83,
84
],
[
83,
85
],
[
82,
86
],
[
86,
87
],
[
87,
88
],
[
55,
89
],
[
89,
90
],
[
90,
91
],
[
89,
92
],
[
51,
93
],
[
93,
94
],
[
93,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
97,
99
],
[
96,
100
],
[
100,
101
],
[
101,
102
],
[
95,
103
],
[
103,
104
],
[
104,
105
],
[
105,
106
],
[
105,
107
],
[
104,
108
],
[
108,
109
],
[
109,
110
],
[
109,
111
],
[
108,
112
],
[
103,
113
],
[
113,
114
],
[
114,
115
],
[
95,
116
],
[
116,
117
],
[
116,
118
],
[
95,
119
],
[
119,
120
],
[
120,
121
],
[
121,
122
],
[
122,
123
],
[
121,
124
],
[
120,
125
],
[
119,
126
],
[
126,
127
],
[
127,
128
],
[
128,
129
],
[
129,
130
],
[
129,
131
],
[
128,
132
],
[
127,
133
],
[
133,
134
],
[
134,
135
],
[
126,
136
],
[
136,
137
],
[
136,
138
],
[
95,
139
],
[
139,
140
],
[
93,
141
],
[
141,
142
],
[
247,
143
],
[
143,
144
],
[
143,
145
],
[
145,
146
],
[
143,
147
],
[
147,
148
],
[
143,
149
],
[
149,
150
],
[
149,
151
],
[
151,
152
],
[
152,
153
],
[
152,
154
],
[
149,
155
],
[
155,
156
],
[
143,
157
],
[
157,
158
],
[
157,
159
],
[
159,
160
],
[
160,
161
],
[
161,
162
],
[
162,
163
],
[
162,
164
],
[
161,
165
],
[
165,
166
],
[
166,
167
],
[
167,
168
],
[
160,
169
],
[
169,
170
],
[
170,
171
],
[
170,
172
],
[
159,
173
],
[
173,
174
],
[
174,
175
],
[
175,
176
],
[
174,
177
],
[
177,
178
],
[
178,
179
],
[
143,
180
],
[
180,
181
],
[
180,
182
],
[
182,
183
],
[
183,
184
],
[
184,
185
],
[
185,
186
],
[
185,
187
],
[
184,
188
],
[
188,
189
],
[
189,
190
],
[
190,
191
],
[
183,
192
],
[
192,
193
],
[
193,
194
],
[
193,
195
],
[
182,
196
],
[
196,
197
],
[
197,
198
],
[
198,
199
],
[
197,
200
],
[
200,
201
],
[
201,
202
],
[
143,
203
],
[
203,
204
],
[
203,
205
],
[
205,
206
],
[
206,
207
],
[
207,
208
],
[
208,
209
],
[
208,
210
],
[
207,
211
],
[
211,
212
],
[
212,
213
],
[
213,
214
],
[
206,
215
],
[
215,
216
],
[
216,
217
],
[
216,
218
],
[
205,
219
],
[
219,
220
],
[
220,
221
],
[
221,
222
],
[
143,
223
],
[
223,
224
],
[
223,
225
],
[
225,
226
],
[
226,
227
],
[
227,
228
],
[
228,
229
],
[
228,
230
],
[
227,
231
],
[
231,
232
],
[
232,
233
],
[
233,
234
],
[
226,
235
],
[
235,
236
],
[
236,
237
],
[
236,
238
],
[
225,
239
],
[
239,
240
],
[
240,
241
],
[
241,
242
],
[
240,
243
],
[
243,
244
],
[
244,
245
],
[
0,
246
],
[
246,
247
],
[
246,
248
]
] | [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\nimport java.math.BigDecimal;\n\npublic class Main {\n static InputReader in;\n static PrintWriter out;\n\n static class Solution {\n void solve() throws IOException {\n int cnt = 0;\n int n = in.nextInt();\n for (int i = 0; i < n; i++) {\n int x = in.nextInt();\n if (primalityTest(x)) {\n cnt++;\n }\n }\n \n out.println(cnt);\n// End solve()\n }\n \n boolean primalityTest(int x) {\n if (x == 2) {\n return true;\n }\n \n if (x < 2 || x % 2 == 0) {\n return false;\n }\n \n int i = 3;\n while (Math.sqrt(x) >= i ) {\n if (x % i == 0) {\n return false;\n }\n \n i += 2;\n }\n \n return true;\n }\n \n// End Solution\n}\n\n\n public static void main(String[] args) throws IOException {\n in = new InputReader(System.in);\n out = new PrintWriter(System.out);\n Solution solver = new Solution();\n solver.solve();\n out.close();\n}\n\n\n static class InputReader {\n public BufferedReader br;\n public StringTokenizer st;\n\n public InputReader(InputStream stream) {\n br = new BufferedReader(new InputStreamReader(stream));\n }\n\n public int nextInt() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Integer.parseInt(st.nextToken());\n }\n\n public long nextLong() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Long.parseLong(st.nextToken());\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return st.nextToken();\n }\n\n public double nextDouble() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Double.parseDouble(st.nextToken());\n }\n\n }\n\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStream;",
"InputStream",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.io.PrintWriter;",
"PrintWriter",
"java.io",
"import java.util.Scanner;",
"Scanner",
"java.util",
"import java.util.StringTokenizer;",
"StringTokenizer",
"java.util",
"import java.math.BigDecimal;",
"BigDecimal",
"java.math",
"public class Main {\n static InputReader in;\n static PrintWriter out;\n\n static class Solution {\n void solve() throws IOException {\n int cnt = 0;\n int n = in.nextInt();\n for (int i = 0; i < n; i++) {\n int x = in.nextInt();\n if (primalityTest(x)) {\n cnt++;\n }\n }\n \n out.println(cnt);\n// End solve()\n }\n \n boolean primalityTest(int x) {\n if (x == 2) {\n return true;\n }\n \n if (x < 2 || x % 2 == 0) {\n return false;\n }\n \n int i = 3;\n while (Math.sqrt(x) >= i ) {\n if (x % i == 0) {\n return false;\n }\n \n i += 2;\n }\n \n return true;\n }\n \n// End Solution\n}\n\n\n public static void main(String[] args) throws IOException {\n in = new InputReader(System.in);\n out = new PrintWriter(System.out);\n Solution solver = new Solution();\n solver.solve();\n out.close();\n}\n\n\n static class InputReader {\n public BufferedReader br;\n public StringTokenizer st;\n\n public InputReader(InputStream stream) {\n br = new BufferedReader(new InputStreamReader(stream));\n }\n\n public int nextInt() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Integer.parseInt(st.nextToken());\n }\n\n public long nextLong() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Long.parseLong(st.nextToken());\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return st.nextToken();\n }\n\n public double nextDouble() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Double.parseDouble(st.nextToken());\n }\n\n }\n\n}",
"Main",
"static InputReader in;",
"in",
"static PrintWriter out;",
"out",
"public static void main(String[] args) throws IOException {\n in = new InputReader(System.in);\n out = new PrintWriter(System.out);\n Solution solver = new Solution();\n solver.solve();\n out.close();\n}",
"main",
"{\n in = new InputReader(System.in);\n out = new PrintWriter(System.out);\n Solution solver = new Solution();\n solver.solve();\n out.close();\n}",
"in = new InputReader(System.in)",
"in",
"new InputReader(System.in)",
"out = new PrintWriter(System.out)",
"out",
"new PrintWriter(System.out)",
"Solution solver = new Solution();",
"solver",
"new Solution()",
"solver.solve()",
"solver.solve",
"solver",
"out.close()",
"out.close",
"out",
"String[] args",
"args",
"static class Solution {\n void solve() throws IOException {\n int cnt = 0;\n int n = in.nextInt();\n for (int i = 0; i < n; i++) {\n int x = in.nextInt();\n if (primalityTest(x)) {\n cnt++;\n }\n }\n \n out.println(cnt);\n// End solve()\n }\n \n boolean primalityTest(int x) {\n if (x == 2) {\n return true;\n }\n \n if (x < 2 || x % 2 == 0) {\n return false;\n }\n \n int i = 3;\n while (Math.sqrt(x) >= i ) {\n if (x % i == 0) {\n return false;\n }\n \n i += 2;\n }\n \n return true;\n }\n \n// End Solution\n}",
"Solution",
"void solve() throws IOException {\n int cnt = 0;\n int n = in.nextInt();\n for (int i = 0; i < n; i++) {\n int x = in.nextInt();\n if (primalityTest(x)) {\n cnt++;\n }\n }\n \n out.println(cnt);\n// End solve()\n }",
"solve",
"{\n int cnt = 0;\n int n = in.nextInt();\n for (int i = 0; i < n; i++) {\n int x = in.nextInt();\n if (primalityTest(x)) {\n cnt++;\n }\n }\n \n out.println(cnt);\n// End solve()\n }",
"int cnt = 0;",
"cnt",
"0",
"int n = in.nextInt();",
"n",
"in.nextInt()",
"in.nextInt",
"in",
"for (int i = 0; i < n; i++) {\n int x = in.nextInt();\n if (primalityTest(x)) {\n cnt++;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n int x = in.nextInt();\n if (primalityTest(x)) {\n cnt++;\n }\n }",
"{\n int x = in.nextInt();\n if (primalityTest(x)) {\n cnt++;\n }\n }",
"int x = in.nextInt();",
"x",
"in.nextInt()",
"in.nextInt",
"in",
"if (primalityTest(x)) {\n cnt++;\n }",
"primalityTest(x)",
"primalityTest",
"x",
"{\n cnt++;\n }",
"cnt++",
"cnt",
"out.println(cnt)",
"out.println",
"out",
"cnt",
"boolean primalityTest(int x) {\n if (x == 2) {\n return true;\n }\n \n if (x < 2 || x % 2 == 0) {\n return false;\n }\n \n int i = 3;\n while (Math.sqrt(x) >= i ) {\n if (x % i == 0) {\n return false;\n }\n \n i += 2;\n }\n \n return true;\n }",
"primalityTest",
"{\n if (x == 2) {\n return true;\n }\n \n if (x < 2 || x % 2 == 0) {\n return false;\n }\n \n int i = 3;\n while (Math.sqrt(x) >= i ) {\n if (x % i == 0) {\n return false;\n }\n \n i += 2;\n }\n \n return true;\n }",
"if (x == 2) {\n return true;\n }",
"x == 2",
"x",
"2",
"{\n return true;\n }",
"return true;",
"true",
"if (x < 2 || x % 2 == 0) {\n return false;\n }",
"x < 2 || x % 2 == 0",
"x < 2",
"x",
"2",
"x % 2 == 0",
"x % 2",
"x",
"2",
"0",
"{\n return false;\n }",
"return false;",
"false",
"int i = 3;",
"i",
"3",
"while (Math.sqrt(x) >= i ) {\n if (x % i == 0) {\n return false;\n }\n \n i += 2;\n }",
"Math.sqrt(x) >= i",
"Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"i",
"{\n if (x % i == 0) {\n return false;\n }\n \n i += 2;\n }",
"if (x % i == 0) {\n return false;\n }",
"x % i == 0",
"x % i",
"x",
"i",
"0",
"{\n return false;\n }",
"return false;",
"false",
"i += 2",
"i",
"2",
"return true;",
"true",
"int x",
"x",
"static class InputReader {\n public BufferedReader br;\n public StringTokenizer st;\n\n public InputReader(InputStream stream) {\n br = new BufferedReader(new InputStreamReader(stream));\n }\n\n public int nextInt() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Integer.parseInt(st.nextToken());\n }\n\n public long nextLong() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Long.parseLong(st.nextToken());\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return st.nextToken();\n }\n\n public double nextDouble() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Double.parseDouble(st.nextToken());\n }\n\n }",
"InputReader",
"public BufferedReader br;",
"br",
"public StringTokenizer st;",
"st",
"public InputReader(InputStream stream) {\n br = new BufferedReader(new InputStreamReader(stream));\n }",
"InputReader",
"{\n br = new BufferedReader(new InputStreamReader(stream));\n }",
"br = new BufferedReader(new InputStreamReader(stream))",
"br",
"new BufferedReader(new InputStreamReader(stream))",
"InputStream stream",
"stream",
"public int nextInt() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Integer.parseInt(st.nextToken());\n }",
"nextInt",
"{\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Integer.parseInt(st.nextToken());\n }",
"while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }",
"st == null || !st.hasMoreTokens()",
"st == null",
"st",
"null",
"!st.hasMoreTokens()",
"st.hasMoreTokens()",
"st.hasMoreTokens",
"st",
"{\n st = new StringTokenizer(br.readLine());\n }",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return Integer.parseInt(st.nextToken());",
"Integer.parseInt(st.nextToken())",
"Integer.parseInt",
"Integer",
"st.nextToken()",
"st.nextToken",
"st",
"public long nextLong() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Long.parseLong(st.nextToken());\n }",
"nextLong",
"{\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Long.parseLong(st.nextToken());\n }",
"while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }",
"st == null || !st.hasMoreTokens()",
"st == null",
"st",
"null",
"!st.hasMoreTokens()",
"st.hasMoreTokens()",
"st.hasMoreTokens",
"st",
"{\n st = new StringTokenizer(br.readLine());\n }",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return Long.parseLong(st.nextToken());",
"Long.parseLong(st.nextToken())",
"Long.parseLong",
"Long",
"st.nextToken()",
"st.nextToken",
"st",
"public String next() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return st.nextToken();\n }",
"next",
"{\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return st.nextToken();\n }",
"while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }",
"st == null || !st.hasMoreTokens()",
"st == null",
"st",
"null",
"!st.hasMoreTokens()",
"st.hasMoreTokens()",
"st.hasMoreTokens",
"st",
"{\n st = new StringTokenizer(br.readLine());\n }",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"public double nextDouble() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Double.parseDouble(st.nextToken());\n }",
"nextDouble",
"{\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Double.parseDouble(st.nextToken());\n }",
"while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }",
"st == null || !st.hasMoreTokens()",
"st == null",
"st",
"null",
"!st.hasMoreTokens()",
"st.hasMoreTokens()",
"st.hasMoreTokens",
"st",
"{\n st = new StringTokenizer(br.readLine());\n }",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return Double.parseDouble(st.nextToken());",
"Double.parseDouble(st.nextToken())",
"Double.parseDouble",
"Double",
"st.nextToken()",
"st.nextToken",
"st",
"public class Main {\n static InputReader in;\n static PrintWriter out;\n\n static class Solution {\n void solve() throws IOException {\n int cnt = 0;\n int n = in.nextInt();\n for (int i = 0; i < n; i++) {\n int x = in.nextInt();\n if (primalityTest(x)) {\n cnt++;\n }\n }\n \n out.println(cnt);\n// End solve()\n }\n \n boolean primalityTest(int x) {\n if (x == 2) {\n return true;\n }\n \n if (x < 2 || x % 2 == 0) {\n return false;\n }\n \n int i = 3;\n while (Math.sqrt(x) >= i ) {\n if (x % i == 0) {\n return false;\n }\n \n i += 2;\n }\n \n return true;\n }\n \n// End Solution\n}\n\n\n public static void main(String[] args) throws IOException {\n in = new InputReader(System.in);\n out = new PrintWriter(System.out);\n Solution solver = new Solution();\n solver.solve();\n out.close();\n}\n\n\n static class InputReader {\n public BufferedReader br;\n public StringTokenizer st;\n\n public InputReader(InputStream stream) {\n br = new BufferedReader(new InputStreamReader(stream));\n }\n\n public int nextInt() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Integer.parseInt(st.nextToken());\n }\n\n public long nextLong() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Long.parseLong(st.nextToken());\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return st.nextToken();\n }\n\n public double nextDouble() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Double.parseDouble(st.nextToken());\n }\n\n }\n\n}",
"public class Main {\n static InputReader in;\n static PrintWriter out;\n\n static class Solution {\n void solve() throws IOException {\n int cnt = 0;\n int n = in.nextInt();\n for (int i = 0; i < n; i++) {\n int x = in.nextInt();\n if (primalityTest(x)) {\n cnt++;\n }\n }\n \n out.println(cnt);\n// End solve()\n }\n \n boolean primalityTest(int x) {\n if (x == 2) {\n return true;\n }\n \n if (x < 2 || x % 2 == 0) {\n return false;\n }\n \n int i = 3;\n while (Math.sqrt(x) >= i ) {\n if (x % i == 0) {\n return false;\n }\n \n i += 2;\n }\n \n return true;\n }\n \n// End Solution\n}\n\n\n public static void main(String[] args) throws IOException {\n in = new InputReader(System.in);\n out = new PrintWriter(System.out);\n Solution solver = new Solution();\n solver.solve();\n out.close();\n}\n\n\n static class InputReader {\n public BufferedReader br;\n public StringTokenizer st;\n\n public InputReader(InputStream stream) {\n br = new BufferedReader(new InputStreamReader(stream));\n }\n\n public int nextInt() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Integer.parseInt(st.nextToken());\n }\n\n public long nextLong() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Long.parseLong(st.nextToken());\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return st.nextToken();\n }\n\n public double nextDouble() throws IOException {\n while (st == null || !st.hasMoreTokens()) {\n st = new StringTokenizer(br.readLine());\n }\n return Double.parseDouble(st.nextToken());\n }\n\n }\n\n}",
"Main"
] | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.math.BigDecimal;
public class Main {
static InputReader in;
static PrintWriter out;
static class Solution {
void solve() throws IOException {
int cnt = 0;
int n = in.nextInt();
for (int i = 0; i < n; i++) {
int x = in.nextInt();
if (primalityTest(x)) {
cnt++;
}
}
out.println(cnt);
// End solve()
}
boolean primalityTest(int x) {
if (x == 2) {
return true;
}
if (x < 2 || x % 2 == 0) {
return false;
}
int i = 3;
while (Math.sqrt(x) >= i ) {
if (x % i == 0) {
return false;
}
i += 2;
}
return true;
}
// End Solution
}
public static void main(String[] args) throws IOException {
in = new InputReader(System.in);
out = new PrintWriter(System.out);
Solution solver = new Solution();
solver.solve();
out.close();
}
static class InputReader {
public BufferedReader br;
public StringTokenizer st;
public InputReader(InputStream stream) {
br = new BufferedReader(new InputStreamReader(stream));
}
public int nextInt() throws IOException {
while (st == null || !st.hasMoreTokens()) {
st = new StringTokenizer(br.readLine());
}
return Integer.parseInt(st.nextToken());
}
public long nextLong() throws IOException {
while (st == null || !st.hasMoreTokens()) {
st = new StringTokenizer(br.readLine());
}
return Long.parseLong(st.nextToken());
}
public String next() throws IOException {
while (st == null || !st.hasMoreTokens()) {
st = new StringTokenizer(br.readLine());
}
return st.nextToken();
}
public double nextDouble() throws IOException {
while (st == null || !st.hasMoreTokens()) {
st = new StringTokenizer(br.readLine());
}
return Double.parseDouble(st.nextToken());
}
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
4,
18,
13,
14,
4,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
17,
14,
2,
2,
13,
17,
2,
2,
13,
17,
17,
30,
29,
17,
30,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
114,
5
],
[
114,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
14,
17
],
[
17,
18
],
[
18,
19
],
[
8,
20
],
[
20,
21
],
[
20,
22
],
[
8,
23
],
[
23,
24
],
[
24,
25
],
[
25,
26
],
[
25,
27
],
[
23,
28
],
[
28,
29
],
[
28,
30
],
[
23,
31
],
[
31,
32
],
[
32,
33
],
[
23,
34
],
[
35,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
38,
41
],
[
41,
42
],
[
42,
43
],
[
35,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
44,
48
],
[
48,
49
],
[
49,
50
],
[
8,
51
],
[
51,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
51,
56
],
[
6,
57
],
[
57,
58
],
[
114,
59
],
[
59,
60
],
[
59,
61
],
[
61,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
62,
66
],
[
66,
67
],
[
67,
68
],
[
62,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
70,
74
],
[
74,
75
],
[
75,
76
],
[
75,
77
],
[
74,
78
],
[
69,
79
],
[
79,
80
],
[
80,
81
],
[
69,
82
],
[
82,
83
],
[
83,
84
],
[
84,
85
],
[
85,
86
],
[
85,
87
],
[
83,
88
],
[
88,
89
],
[
88,
90
],
[
90,
91
],
[
91,
92
],
[
90,
93
],
[
83,
94
],
[
94,
95
],
[
95,
96
],
[
95,
97
],
[
83,
98
],
[
99,
99
],
[
99,
100
],
[
100,
101
],
[
101,
102
],
[
102,
103
],
[
102,
104
],
[
101,
105
],
[
100,
106
],
[
106,
107
],
[
107,
108
],
[
82,
109
],
[
109,
110
],
[
59,
111
],
[
111,
112
],
[
0,
113
],
[
113,
114
],
[
113,
115
]
] | [
"import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.nextLine());\n int counter = 0;\n \n for(int i = 0; i < n; i ++) {\n int key = Integer.parseInt(sc.nextLine());\n if(isPrime(key)) {\n counter ++;\n }\n }\n \n System.out.println(counter);\n }\n \n public static boolean isPrime(int a) {\n if(a == 2) {\n return true;\n } else if(a == 1 || a % 2 == 0) {\n return false;\n } else {\n for(int i = 3; i <= (int)Math.sqrt(a); i += 2) {\n if(a % i == 0) {\n return false;\n }\n }\n return true;\n }\n }\n \n}",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.nextLine());\n int counter = 0;\n \n for(int i = 0; i < n; i ++) {\n int key = Integer.parseInt(sc.nextLine());\n if(isPrime(key)) {\n counter ++;\n }\n }\n \n System.out.println(counter);\n }\n \n public static boolean isPrime(int a) {\n if(a == 2) {\n return true;\n } else if(a == 1 || a % 2 == 0) {\n return false;\n } else {\n for(int i = 3; i <= (int)Math.sqrt(a); i += 2) {\n if(a % i == 0) {\n return false;\n }\n }\n return true;\n }\n }\n \n}",
"Main",
"public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.nextLine());\n int counter = 0;\n \n for(int i = 0; i < n; i ++) {\n int key = Integer.parseInt(sc.nextLine());\n if(isPrime(key)) {\n counter ++;\n }\n }\n \n System.out.println(counter);\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.nextLine());\n int counter = 0;\n \n for(int i = 0; i < n; i ++) {\n int key = Integer.parseInt(sc.nextLine());\n if(isPrime(key)) {\n counter ++;\n }\n }\n \n System.out.println(counter);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = Integer.parseInt(sc.nextLine());",
"n",
"Integer.parseInt(sc.nextLine())",
"Integer.parseInt",
"Integer",
"sc.nextLine()",
"sc.nextLine",
"sc",
"int counter = 0;",
"counter",
"0",
"for(int i = 0; i < n; i ++) {\n int key = Integer.parseInt(sc.nextLine());\n if(isPrime(key)) {\n counter ++;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i ++",
"i ++",
"i",
"{\n int key = Integer.parseInt(sc.nextLine());\n if(isPrime(key)) {\n counter ++;\n }\n }",
"{\n int key = Integer.parseInt(sc.nextLine());\n if(isPrime(key)) {\n counter ++;\n }\n }",
"int key = Integer.parseInt(sc.nextLine());",
"key",
"Integer.parseInt(sc.nextLine())",
"Integer.parseInt",
"Integer",
"sc.nextLine()",
"sc.nextLine",
"sc",
"if(isPrime(key)) {\n counter ++;\n }",
"isPrime(key)",
"isPrime",
"key",
"{\n counter ++;\n }",
"counter ++",
"counter",
"System.out.println(counter)",
"System.out.println",
"System.out",
"System",
"System.out",
"counter",
"String[] args",
"args",
"public static boolean isPrime(int a) {\n if(a == 2) {\n return true;\n } else if(a == 1 || a % 2 == 0) {\n return false;\n } else {\n for(int i = 3; i <= (int)Math.sqrt(a); i += 2) {\n if(a % i == 0) {\n return false;\n }\n }\n return true;\n }\n }",
"isPrime",
"{\n if(a == 2) {\n return true;\n } else if(a == 1 || a % 2 == 0) {\n return false;\n } else {\n for(int i = 3; i <= (int)Math.sqrt(a); i += 2) {\n if(a % i == 0) {\n return false;\n }\n }\n return true;\n }\n }",
"if(a == 2) {\n return true;\n } else if(a == 1 || a % 2 == 0) {\n return false;\n } else {\n for(int i = 3; i <= (int)Math.sqrt(a); i += 2) {\n if(a % i == 0) {\n return false;\n }\n }\n return true;\n }",
"a == 2",
"a",
"2",
"{\n return true;\n }",
"return true;",
"true",
"if(a == 1 || a % 2 == 0) {\n return false;\n } else {\n for(int i = 3; i <= (int)Math.sqrt(a); i += 2) {\n if(a % i == 0) {\n return false;\n }\n }\n return true;\n }",
"a == 1 || a % 2 == 0",
"a == 1",
"a",
"1",
"a % 2 == 0",
"a % 2",
"a",
"2",
"0",
"{\n return false;\n }",
"return false;",
"false",
"{\n for(int i = 3; i <= (int)Math.sqrt(a); i += 2) {\n if(a % i == 0) {\n return false;\n }\n }\n return true;\n }",
"for(int i = 3; i <= (int)Math.sqrt(a); i += 2) {\n if(a % i == 0) {\n return false;\n }\n }",
"int i = 3;",
"int i = 3;",
"i",
"3",
"i <= (int)Math.sqrt(a)",
"i",
"(int)Math.sqrt(a)",
"Math.sqrt",
"Math",
"a",
"i += 2",
"i += 2",
"i",
"2",
"{\n if(a % i == 0) {\n return false;\n }\n }",
"{\n if(a % i == 0) {\n return false;\n }\n }",
"if(a % i == 0) {\n return false;\n }",
"a % i == 0",
"a % i",
"a",
"i",
"0",
"{\n return false;\n }",
"return false;",
"false",
"return true;",
"true",
"int a",
"a",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.nextLine());\n int counter = 0;\n \n for(int i = 0; i < n; i ++) {\n int key = Integer.parseInt(sc.nextLine());\n if(isPrime(key)) {\n counter ++;\n }\n }\n \n System.out.println(counter);\n }\n \n public static boolean isPrime(int a) {\n if(a == 2) {\n return true;\n } else if(a == 1 || a % 2 == 0) {\n return false;\n } else {\n for(int i = 3; i <= (int)Math.sqrt(a); i += 2) {\n if(a % i == 0) {\n return false;\n }\n }\n return true;\n }\n }\n \n}",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.nextLine());\n int counter = 0;\n \n for(int i = 0; i < n; i ++) {\n int key = Integer.parseInt(sc.nextLine());\n if(isPrime(key)) {\n counter ++;\n }\n }\n \n System.out.println(counter);\n }\n \n public static boolean isPrime(int a) {\n if(a == 2) {\n return true;\n } else if(a == 1 || a % 2 == 0) {\n return false;\n } else {\n for(int i = 3; i <= (int)Math.sqrt(a); i += 2) {\n if(a % i == 0) {\n return false;\n }\n }\n return true;\n }\n }\n \n}",
"Main"
] | 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 ++;
}
}
System.out.println(counter);
}
public static boolean isPrime(int a) {
if(a == 2) {
return true;
} else if(a == 1 || a % 2 == 0) {
return false;
} else {
for(int i = 3; i <= (int)Math.sqrt(a); i += 2) {
if(a % i == 0) {
return false;
}
}
return true;
}
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
17,
41,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
2,
18,
13,
13,
17,
1,
40,
13,
30,
30,
14,
2,
2,
18,
13,
13,
13,
17,
30,
0,
13,
17,
14,
2,
13,
17,
30,
0,
13,
17,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
109,
5
],
[
109,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
8,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
8,
20
],
[
20,
21
],
[
20,
22
],
[
8,
24
],
[
24,
25
],
[
25,
26
],
[
26,
27
],
[
26,
28
],
[
24,
29
],
[
29,
30
],
[
29,
31
],
[
24,
32
],
[
32,
33
],
[
33,
34
],
[
24,
35
],
[
36,
36
],
[
36,
37
],
[
37,
38
],
[
38,
39
],
[
38,
40
],
[
37,
41
],
[
41,
42
],
[
42,
43
],
[
8,
44
],
[
44,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
44,
49
],
[
49,
50
],
[
49,
51
],
[
44,
52
],
[
52,
53
],
[
53,
54
],
[
44,
55
],
[
56,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
56,
60
],
[
60,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
60,
65
],
[
65,
66
],
[
65,
67
],
[
67,
68
],
[
68,
69
],
[
67,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
70,
74
],
[
60,
75
],
[
75,
76
],
[
76,
77
],
[
60,
78
],
[
79,
79
],
[
79,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
83,
84
],
[
83,
85
],
[
82,
86
],
[
81,
87
],
[
80,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
56,
92
],
[
92,
93
],
[
93,
94
],
[
93,
95
],
[
92,
96
],
[
96,
97
],
[
97,
98
],
[
97,
99
],
[
8,
100
],
[
100,
101
],
[
101,
102
],
[
102,
103
],
[
102,
104
],
[
100,
105
],
[
6,
106
],
[
106,
107
],
[
0,
108
],
[
108,
109
],
[
108,
110
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t//prime numbers\n\t\tScanner in = new Scanner(System.in);\n\t int prime =0;\n\t int n = in.nextInt();\n\t int[] array = new int[n];\n\t for(int i =0;i<n;i++){\n\t array[i]= in.nextInt();\n\t }\n\t for(int j = 0; j<n;j++){\n\t \t Boolean primeN = true;\n\t for(int x = 2;x<Math.sqrt(array[j]+1);x++) {\n\t \t if(array[j]%x==0) {\n\t \t\t primeN = false;\n\t \t }\n\t }\n\t if(primeN==true) {\n\t \t prime+=1;\n\t }\n\t \n\t }\n\t System.out.println(prime);\n}}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\t//prime numbers\n\t\tScanner in = new Scanner(System.in);\n\t int prime =0;\n\t int n = in.nextInt();\n\t int[] array = new int[n];\n\t for(int i =0;i<n;i++){\n\t array[i]= in.nextInt();\n\t }\n\t for(int j = 0; j<n;j++){\n\t \t Boolean primeN = true;\n\t for(int x = 2;x<Math.sqrt(array[j]+1);x++) {\n\t \t if(array[j]%x==0) {\n\t \t\t primeN = false;\n\t \t }\n\t }\n\t if(primeN==true) {\n\t \t prime+=1;\n\t }\n\t \n\t }\n\t System.out.println(prime);\n}}",
"Main",
"public static void main(String[] args) {\n\t\t//prime numbers\n\t\tScanner in = new Scanner(System.in);\n\t int prime =0;\n\t int n = in.nextInt();\n\t int[] array = new int[n];\n\t for(int i =0;i<n;i++){\n\t array[i]= in.nextInt();\n\t }\n\t for(int j = 0; j<n;j++){\n\t \t Boolean primeN = true;\n\t for(int x = 2;x<Math.sqrt(array[j]+1);x++) {\n\t \t if(array[j]%x==0) {\n\t \t\t primeN = false;\n\t \t }\n\t }\n\t if(primeN==true) {\n\t \t prime+=1;\n\t }\n\t \n\t }\n\t System.out.println(prime);\n}",
"main",
"{\n\t\t//prime numbers\n\t\tScanner in = new Scanner(System.in);\n\t int prime =0;\n\t int n = in.nextInt();\n\t int[] array = new int[n];\n\t for(int i =0;i<n;i++){\n\t array[i]= in.nextInt();\n\t }\n\t for(int j = 0; j<n;j++){\n\t \t Boolean primeN = true;\n\t for(int x = 2;x<Math.sqrt(array[j]+1);x++) {\n\t \t if(array[j]%x==0) {\n\t \t\t primeN = false;\n\t \t }\n\t }\n\t if(primeN==true) {\n\t \t prime+=1;\n\t }\n\t \n\t }\n\t System.out.println(prime);\n}",
"Scanner in = new Scanner(System.in);",
"in",
"new Scanner(System.in)",
"int prime =0;",
"prime",
"0",
"int n = in.nextInt();",
"n",
"in.nextInt()",
"in.nextInt",
"in",
"int[] array = new int[n];",
"array",
"new int[n]",
"n",
"for(int i =0;i<n;i++){\n\t array[i]= in.nextInt();\n\t }",
"int i =0;",
"int i =0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t array[i]= in.nextInt();\n\t }",
"{\n\t array[i]= in.nextInt();\n\t }",
"array[i]= in.nextInt()",
"array[i]",
"array",
"i",
"in.nextInt()",
"in.nextInt",
"in",
"for(int j = 0; j<n;j++){\n\t \t Boolean primeN = true;\n\t for(int x = 2;x<Math.sqrt(array[j]+1);x++) {\n\t \t if(array[j]%x==0) {\n\t \t\t primeN = false;\n\t \t }\n\t }\n\t if(primeN==true) {\n\t \t prime+=1;\n\t }\n\t \n\t }",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j<n",
"j",
"n",
"j++",
"j++",
"j",
"{\n\t \t Boolean primeN = true;\n\t for(int x = 2;x<Math.sqrt(array[j]+1);x++) {\n\t \t if(array[j]%x==0) {\n\t \t\t primeN = false;\n\t \t }\n\t }\n\t if(primeN==true) {\n\t \t prime+=1;\n\t }\n\t \n\t }",
"{\n\t \t Boolean primeN = true;\n\t for(int x = 2;x<Math.sqrt(array[j]+1);x++) {\n\t \t if(array[j]%x==0) {\n\t \t\t primeN = false;\n\t \t }\n\t }\n\t if(primeN==true) {\n\t \t prime+=1;\n\t }\n\t \n\t }",
"Boolean primeN = true;",
"primeN",
"true",
"for(int x = 2;x<Math.sqrt(array[j]+1);x++) {\n\t \t if(array[j]%x==0) {\n\t \t\t primeN = false;\n\t \t }\n\t }",
"int x = 2;",
"int x = 2;",
"x",
"2",
"x<Math.sqrt(array[j]+1)",
"x",
"Math.sqrt(array[j]+1)",
"Math.sqrt",
"Math",
"array[j]+1",
"array[j]",
"array",
"j",
"1",
"x++",
"x++",
"x",
"{\n\t \t if(array[j]%x==0) {\n\t \t\t primeN = false;\n\t \t }\n\t }",
"{\n\t \t if(array[j]%x==0) {\n\t \t\t primeN = false;\n\t \t }\n\t }",
"if(array[j]%x==0) {\n\t \t\t primeN = false;\n\t \t }",
"array[j]%x==0",
"array[j]%x",
"array[j]",
"array",
"j",
"x",
"0",
"{\n\t \t\t primeN = false;\n\t \t }",
"primeN = false",
"primeN",
"false",
"if(primeN==true) {\n\t \t prime+=1;\n\t }",
"primeN==true",
"primeN",
"true",
"{\n\t \t prime+=1;\n\t }",
"prime+=1",
"prime",
"1",
"System.out.println(prime)",
"System.out.println",
"System.out",
"System",
"System.out",
"prime",
"String[] args",
"args",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\t//prime numbers\n\t\tScanner in = new Scanner(System.in);\n\t int prime =0;\n\t int n = in.nextInt();\n\t int[] array = new int[n];\n\t for(int i =0;i<n;i++){\n\t array[i]= in.nextInt();\n\t }\n\t for(int j = 0; j<n;j++){\n\t \t Boolean primeN = true;\n\t for(int x = 2;x<Math.sqrt(array[j]+1);x++) {\n\t \t if(array[j]%x==0) {\n\t \t\t primeN = false;\n\t \t }\n\t }\n\t if(primeN==true) {\n\t \t prime+=1;\n\t }\n\t \n\t }\n\t System.out.println(prime);\n}}",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\t//prime numbers\n\t\tScanner in = new Scanner(System.in);\n\t int prime =0;\n\t int n = in.nextInt();\n\t int[] array = new int[n];\n\t for(int i =0;i<n;i++){\n\t array[i]= in.nextInt();\n\t }\n\t for(int j = 0; j<n;j++){\n\t \t Boolean primeN = true;\n\t for(int x = 2;x<Math.sqrt(array[j]+1);x++) {\n\t \t if(array[j]%x==0) {\n\t \t\t primeN = false;\n\t \t }\n\t }\n\t if(primeN==true) {\n\t \t prime+=1;\n\t }\n\t \n\t }\n\t System.out.println(prime);\n}}",
"Main"
] | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
//prime numbers
Scanner in = new Scanner(System.in);
int prime =0;
int n = in.nextInt();
int[] array = new int[n];
for(int i =0;i<n;i++){
array[i]= in.nextInt();
}
for(int j = 0; j<n;j++){
Boolean primeN = true;
for(int x = 2;x<Math.sqrt(array[j]+1);x++) {
if(array[j]%x==0) {
primeN = false;
}
}
if(primeN==true) {
prime+=1;
}
}
System.out.println(prime);
}}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
42,
2,
13,
17,
30,
41,
13,
4,
18,
13,
14,
4,
13,
13,
40,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
17,
29,
17,
30,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
29,
17,
29,
17,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
20
],
[
20,
21
],
[
21,
22
],
[
21,
23
],
[
20,
24
],
[
24,
25
],
[
25,
26
],
[
25,
27
],
[
27,
28
],
[
28,
29
],
[
24,
30
],
[
30,
31
],
[
31,
32
],
[
31,
33
],
[
30,
34
],
[
34,
35
],
[
24,
36
],
[
36,
37
],
[
8,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
38,
43
],
[
6,
44
],
[
44,
45
],
[
4,
46
],
[
46,
47
],
[
46,
48
],
[
48,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
49,
53
],
[
53,
54
],
[
49,
55
],
[
55,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
56,
60
],
[
55,
61
],
[
61,
62
],
[
55,
63
],
[
63,
64
],
[
64,
65
],
[
65,
66
],
[
66,
67
],
[
66,
68
],
[
64,
69
],
[
69,
70
],
[
70,
71
],
[
70,
72
],
[
69,
73
],
[
64,
74
],
[
74,
75
],
[
75,
76
],
[
75,
77
],
[
64,
78
],
[
79,
79
],
[
79,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
82,
84
],
[
81,
85
],
[
80,
86
],
[
86,
87
],
[
63,
88
],
[
88,
89
],
[
46,
90
],
[
90,
91
]
] | [
"import java.util.Scanner;\n\nclass Main { \n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int N = in.nextInt();\n int count = 0;\n \n while (N != 0) {\n int num = in.nextInt();\n if (isPrime(num)) count++;\n N--;\n }\n \n System.out.println(count);\n }\n \n public static boolean isPrime(int x) {\n if (x == 2) return true;\n else if (x % 2 == 0) return false;\n else {\n // if if x has a factor, then it has one less than or equal to sqrt(x),\n // so for efficiency we only need to check i <= sqrt(N) or equivalently i*i <= x\n for (int i = 3; i * i <= x; i += 2) {\n if (x % i == 0) return false;\n }\n return true;\n }\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"class Main { \n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int N = in.nextInt();\n int count = 0;\n \n while (N != 0) {\n int num = in.nextInt();\n if (isPrime(num)) count++;\n N--;\n }\n \n System.out.println(count);\n }\n \n public static boolean isPrime(int x) {\n if (x == 2) return true;\n else if (x % 2 == 0) return false;\n else {\n // if if x has a factor, then it has one less than or equal to sqrt(x),\n // so for efficiency we only need to check i <= sqrt(N) or equivalently i*i <= x\n for (int i = 3; i * i <= x; i += 2) {\n if (x % i == 0) return false;\n }\n return true;\n }\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int N = in.nextInt();\n int count = 0;\n \n while (N != 0) {\n int num = in.nextInt();\n if (isPrime(num)) count++;\n N--;\n }\n \n System.out.println(count);\n }",
"main",
"{\n Scanner in = new Scanner(System.in);\n int N = in.nextInt();\n int count = 0;\n \n while (N != 0) {\n int num = in.nextInt();\n if (isPrime(num)) count++;\n N--;\n }\n \n System.out.println(count);\n }",
"Scanner in = new Scanner(System.in);",
"in",
"new Scanner(System.in)",
"int N = in.nextInt();",
"N",
"in.nextInt()",
"in.nextInt",
"in",
"int count = 0;",
"count",
"0",
"while (N != 0) {\n int num = in.nextInt();\n if (isPrime(num)) count++;\n N--;\n }",
"N != 0",
"N",
"0",
"{\n int num = in.nextInt();\n if (isPrime(num)) count++;\n N--;\n }",
"int num = in.nextInt();",
"num",
"in.nextInt()",
"in.nextInt",
"in",
"if (isPrime(num)) count++;",
"isPrime(num)",
"isPrime",
"num",
"count++",
"count",
"N--",
"N",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"public static boolean isPrime(int x) {\n if (x == 2) return true;\n else if (x % 2 == 0) return false;\n else {\n // if if x has a factor, then it has one less than or equal to sqrt(x),\n // so for efficiency we only need to check i <= sqrt(N) or equivalently i*i <= x\n for (int i = 3; i * i <= x; i += 2) {\n if (x % i == 0) return false;\n }\n return true;\n }\n }",
"isPrime",
"{\n if (x == 2) return true;\n else if (x % 2 == 0) return false;\n else {\n // if if x has a factor, then it has one less than or equal to sqrt(x),\n // so for efficiency we only need to check i <= sqrt(N) or equivalently i*i <= x\n for (int i = 3; i * i <= x; i += 2) {\n if (x % i == 0) return false;\n }\n return true;\n }\n }",
"if (x == 2) return true;\n else if (x % 2 == 0) return false;\n else {\n // if if x has a factor, then it has one less than or equal to sqrt(x),\n // so for efficiency we only need to check i <= sqrt(N) or equivalently i*i <= x\n for (int i = 3; i * i <= x; i += 2) {\n if (x % i == 0) return false;\n }\n return true;\n }",
"x == 2",
"x",
"2",
"return true;",
"true",
"if (x % 2 == 0) return false;\n else {\n // if if x has a factor, then it has one less than or equal to sqrt(x),\n // so for efficiency we only need to check i <= sqrt(N) or equivalently i*i <= x\n for (int i = 3; i * i <= x; i += 2) {\n if (x % i == 0) return false;\n }\n return true;\n }",
"x % 2 == 0",
"x % 2",
"x",
"2",
"0",
"return false;",
"false",
"{\n // if if x has a factor, then it has one less than or equal to sqrt(x),\n // so for efficiency we only need to check i <= sqrt(N) or equivalently i*i <= x\n for (int i = 3; i * i <= x; i += 2) {\n if (x % i == 0) return false;\n }\n return true;\n }",
"for (int i = 3; i * i <= x; i += 2) {\n if (x % i == 0) return false;\n }",
"int i = 3;",
"int i = 3;",
"i",
"3",
"i * i <= x",
"i * i",
"i",
"i",
"x",
"i += 2",
"i += 2",
"i",
"2",
"{\n if (x % i == 0) return false;\n }",
"{\n if (x % i == 0) return false;\n }",
"if (x % i == 0) return false;",
"x % i == 0",
"x % i",
"x",
"i",
"0",
"return false;",
"false",
"return true;",
"true",
"int x",
"x"
] | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int N = in.nextInt();
int count = 0;
while (N != 0) {
int num = in.nextInt();
if (isPrime(num)) count++;
N--;
}
System.out.println(count);
}
public static boolean isPrime(int x) {
if (x == 2) return true;
else if (x % 2 == 0) return false;
else {
// if if x has a factor, then it has one less than or equal to sqrt(x),
// so for efficiency we only need to check i <= sqrt(N) or equivalently i*i <= x
for (int i = 3; i * i <= x; i += 2) {
if (x % i == 0) return false;
}
return true;
}
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
41,
13,
41,
13,
17,
41,
13,
17,
0,
13,
4,
18,
13,
4,
18,
13,
42,
17,
30,
14,
2,
13,
13,
30,
3,
0,
13,
4,
18,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
13,
4,
18,
13,
13,
30,
40,
13,
3,
14,
2,
2,
13,
13,
17,
30,
14,
2,
13,
13,
30,
3,
14,
2,
13,
13,
30,
40,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
108,
11
],
[
108,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
14,
18
],
[
18,
19
],
[
14,
20
],
[
20,
21
],
[
14,
22
],
[
22,
23
],
[
22,
24
],
[
14,
25
],
[
25,
26
],
[
25,
27
],
[
14,
28
],
[
28,
29
],
[
28,
30
],
[
30,
31
],
[
31,
32
],
[
30,
33
],
[
33,
34
],
[
34,
35
],
[
14,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
39,
43
],
[
43,
44
],
[
38,
45
],
[
45,
46
],
[
45,
47
],
[
47,
48
],
[
48,
49
],
[
47,
50
],
[
50,
51
],
[
51,
52
],
[
38,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
53,
58
],
[
58,
59
],
[
58,
60
],
[
53,
61
],
[
61,
62
],
[
62,
63
],
[
53,
64
],
[
65,
65
],
[
65,
66
],
[
66,
67
],
[
67,
68
],
[
67,
69
],
[
69,
70
],
[
70,
71
],
[
69,
72
],
[
66,
73
],
[
73,
74
],
[
74,
75
],
[
73,
76
],
[
65,
77
],
[
77,
78
],
[
78,
79
],
[
79,
80
],
[
79,
81
],
[
78,
82
],
[
77,
83
],
[
83,
84
],
[
84,
85
],
[
85,
86
],
[
85,
87
],
[
84,
88
],
[
88,
89
],
[
84,
90
],
[
90,
91
],
[
91,
92
],
[
91,
93
],
[
90,
94
],
[
94,
95
],
[
95,
96
],
[
38,
97
],
[
97,
98
],
[
14,
99
],
[
99,
100
],
[
100,
101
],
[
101,
102
],
[
101,
103
],
[
99,
104
],
[
12,
105
],
[
105,
106
],
[
0,
107
],
[
107,
108
],
[
107,
109
]
] | [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tint number;\n\t\tshort numberOfTimes, checkTime = 0, count = 0;\n\t\tnumberOfTimes = Short.parseShort(in.readLine());\n\t\twhile (true) {\n\t\t\tif (checkTime == numberOfTimes) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tnumber = Integer.parseInt(in.readLine());\n\t\t\tfor (int x = 2; x <= number; x++) {\n\t\t\t\tif (x > Math.sqrt(number)) {\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (number % x == 0) {\n\t\t\t\t\tif (number != x) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else if (number == x) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcheckTime++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"public class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tint number;\n\t\tshort numberOfTimes, checkTime = 0, count = 0;\n\t\tnumberOfTimes = Short.parseShort(in.readLine());\n\t\twhile (true) {\n\t\t\tif (checkTime == numberOfTimes) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tnumber = Integer.parseInt(in.readLine());\n\t\t\tfor (int x = 2; x <= number; x++) {\n\t\t\t\tif (x > Math.sqrt(number)) {\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (number % x == 0) {\n\t\t\t\t\tif (number != x) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else if (number == x) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcheckTime++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}",
"Main",
"public static void main(String[] args) throws IOException {\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tint number;\n\t\tshort numberOfTimes, checkTime = 0, count = 0;\n\t\tnumberOfTimes = Short.parseShort(in.readLine());\n\t\twhile (true) {\n\t\t\tif (checkTime == numberOfTimes) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tnumber = Integer.parseInt(in.readLine());\n\t\t\tfor (int x = 2; x <= number; x++) {\n\t\t\t\tif (x > Math.sqrt(number)) {\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (number % x == 0) {\n\t\t\t\t\tif (number != x) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else if (number == x) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcheckTime++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"main",
"{\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tint number;\n\t\tshort numberOfTimes, checkTime = 0, count = 0;\n\t\tnumberOfTimes = Short.parseShort(in.readLine());\n\t\twhile (true) {\n\t\t\tif (checkTime == numberOfTimes) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tnumber = Integer.parseInt(in.readLine());\n\t\t\tfor (int x = 2; x <= number; x++) {\n\t\t\t\tif (x > Math.sqrt(number)) {\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (number % x == 0) {\n\t\t\t\t\tif (number != x) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else if (number == x) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcheckTime++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"BufferedReader in = new BufferedReader(new InputStreamReader(System.in));",
"in",
"new BufferedReader(new InputStreamReader(System.in))",
"int number;",
"number",
"short numberOfTimes",
"numberOfTimes",
"checkTime = 0",
"checkTime",
"0",
"count = 0;",
"count",
"0",
"numberOfTimes = Short.parseShort(in.readLine())",
"numberOfTimes",
"Short.parseShort(in.readLine())",
"Short.parseShort",
"Short",
"in.readLine()",
"in.readLine",
"in",
"while (true) {\n\t\t\tif (checkTime == numberOfTimes) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tnumber = Integer.parseInt(in.readLine());\n\t\t\tfor (int x = 2; x <= number; x++) {\n\t\t\t\tif (x > Math.sqrt(number)) {\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (number % x == 0) {\n\t\t\t\t\tif (number != x) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else if (number == x) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcheckTime++;\n\t\t}",
"true",
"{\n\t\t\tif (checkTime == numberOfTimes) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tnumber = Integer.parseInt(in.readLine());\n\t\t\tfor (int x = 2; x <= number; x++) {\n\t\t\t\tif (x > Math.sqrt(number)) {\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (number % x == 0) {\n\t\t\t\t\tif (number != x) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else if (number == x) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcheckTime++;\n\t\t}",
"if (checkTime == numberOfTimes) {\n\t\t\t\tbreak;\n\t\t\t}",
"checkTime == numberOfTimes",
"checkTime",
"numberOfTimes",
"{\n\t\t\t\tbreak;\n\t\t\t}",
"break;",
"number = Integer.parseInt(in.readLine())",
"number",
"Integer.parseInt(in.readLine())",
"Integer.parseInt",
"Integer",
"in.readLine()",
"in.readLine",
"in",
"for (int x = 2; x <= number; x++) {\n\t\t\t\tif (x > Math.sqrt(number)) {\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (number % x == 0) {\n\t\t\t\t\tif (number != x) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else if (number == x) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}",
"int x = 2;",
"int x = 2;",
"x",
"2",
"x <= number",
"x",
"number",
"x++",
"x++",
"x",
"{\n\t\t\t\tif (x > Math.sqrt(number)) {\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (number % x == 0) {\n\t\t\t\t\tif (number != x) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else if (number == x) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif (x > Math.sqrt(number)) {\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (number % x == 0) {\n\t\t\t\t\tif (number != x) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else if (number == x) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}",
"if (x > Math.sqrt(number)) {\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"x > Math.sqrt(number)",
"x",
"Math.sqrt(number)",
"Math.sqrt",
"Math",
"number",
"{\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"count++",
"count",
"break;",
"if (number % x == 0) {\n\t\t\t\t\tif (number != x) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else if (number == x) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}",
"number % x == 0",
"number % x",
"number",
"x",
"0",
"{\n\t\t\t\t\tif (number != x) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else if (number == x) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}",
"if (number != x) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else if (number == x) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}",
"number != x",
"number",
"x",
"{\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}",
"break;",
"if (number == x) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}",
"number == x",
"number",
"x",
"{\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}",
"count++",
"count",
"checkTime++",
"checkTime",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"public class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tint number;\n\t\tshort numberOfTimes, checkTime = 0, count = 0;\n\t\tnumberOfTimes = Short.parseShort(in.readLine());\n\t\twhile (true) {\n\t\t\tif (checkTime == numberOfTimes) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tnumber = Integer.parseInt(in.readLine());\n\t\t\tfor (int x = 2; x <= number; x++) {\n\t\t\t\tif (x > Math.sqrt(number)) {\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (number % x == 0) {\n\t\t\t\t\tif (number != x) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else if (number == x) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcheckTime++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}",
"public class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tint number;\n\t\tshort numberOfTimes, checkTime = 0, count = 0;\n\t\tnumberOfTimes = Short.parseShort(in.readLine());\n\t\twhile (true) {\n\t\t\tif (checkTime == numberOfTimes) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tnumber = Integer.parseInt(in.readLine());\n\t\t\tfor (int x = 2; x <= number; x++) {\n\t\t\t\tif (x > Math.sqrt(number)) {\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (number % x == 0) {\n\t\t\t\t\tif (number != x) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else if (number == x) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcheckTime++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}",
"Main"
] | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
int number;
short numberOfTimes, checkTime = 0, count = 0;
numberOfTimes = Short.parseShort(in.readLine());
while (true) {
if (checkTime == numberOfTimes) {
break;
}
number = Integer.parseInt(in.readLine());
for (int x = 2; x <= number; x++) {
if (x > Math.sqrt(number)) {
count++;
break;
}
if (number % x == 0) {
if (number != x) {
break;
} else if (number == x) {
count++;
}
}
}
checkTime++;
}
System.out.println(count);
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
41,
13,
20,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
18,
13,
13,
9,
11,
1,
41,
13,
2,
17,
13,
2,
13,
18,
13,
13,
1,
0,
13,
13,
30,
30,
0,
18,
13,
13,
17,
42,
2,
13,
17,
30,
41,
13,
4,
18,
13,
14,
40,
18,
13,
13,
40,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
20
],
[
20,
21
],
[
20,
22
],
[
8,
24
],
[
24,
25
],
[
25,
26
],
[
26,
27
],
[
26,
28
],
[
24,
29
],
[
29,
30
],
[
29,
31
],
[
31,
32
],
[
31,
33
],
[
24,
34
],
[
34,
35
],
[
35,
36
],
[
24,
37
],
[
38,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
39,
43
],
[
38,
44
],
[
44,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
48,
49
],
[
48,
50
],
[
44,
51
],
[
51,
52
],
[
51,
53
],
[
53,
54
],
[
53,
55
],
[
44,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
44,
60
],
[
61,
61
],
[
61,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
62,
66
],
[
8,
67
],
[
67,
68
],
[
68,
69
],
[
68,
70
],
[
67,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
74,
75
],
[
75,
76
],
[
71,
77
],
[
77,
78
],
[
78,
79
],
[
79,
80
],
[
79,
81
],
[
77,
82
],
[
82,
83
],
[
71,
84
],
[
84,
85
],
[
8,
86
],
[
86,
87
],
[
87,
88
],
[
88,
89
],
[
88,
90
],
[
86,
91
],
[
6,
92
],
[
92,
93
]
] | [
"import java.util.Scanner;\n\nclass Main { \n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int N = in.nextInt();\n int count = 0;\n \n boolean primes[] = new boolean [100000000];\n for(int n = 2; n < primes.length; n++){\n if(primes[n]) continue;\n for(int m = 2 * n; m < primes.length; m += n){\n primes[m] = true;\n }\n }\n \n while (N != 0) {\n int num = in.nextInt();\n if (!primes[num]) count++;\n N--;\n }\n \n System.out.println(count);\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"class Main { \n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int N = in.nextInt();\n int count = 0;\n \n boolean primes[] = new boolean [100000000];\n for(int n = 2; n < primes.length; n++){\n if(primes[n]) continue;\n for(int m = 2 * n; m < primes.length; m += n){\n primes[m] = true;\n }\n }\n \n while (N != 0) {\n int num = in.nextInt();\n if (!primes[num]) count++;\n N--;\n }\n \n System.out.println(count);\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int N = in.nextInt();\n int count = 0;\n \n boolean primes[] = new boolean [100000000];\n for(int n = 2; n < primes.length; n++){\n if(primes[n]) continue;\n for(int m = 2 * n; m < primes.length; m += n){\n primes[m] = true;\n }\n }\n \n while (N != 0) {\n int num = in.nextInt();\n if (!primes[num]) count++;\n N--;\n }\n \n System.out.println(count);\n }",
"main",
"{\n Scanner in = new Scanner(System.in);\n int N = in.nextInt();\n int count = 0;\n \n boolean primes[] = new boolean [100000000];\n for(int n = 2; n < primes.length; n++){\n if(primes[n]) continue;\n for(int m = 2 * n; m < primes.length; m += n){\n primes[m] = true;\n }\n }\n \n while (N != 0) {\n int num = in.nextInt();\n if (!primes[num]) count++;\n N--;\n }\n \n System.out.println(count);\n }",
"Scanner in = new Scanner(System.in);",
"in",
"new Scanner(System.in)",
"int N = in.nextInt();",
"N",
"in.nextInt()",
"in.nextInt",
"in",
"int count = 0;",
"count",
"0",
"boolean primes[] = new boolean [100000000];",
"primes",
"new boolean [100000000]",
"100000000",
"for(int n = 2; n < primes.length; n++){\n if(primes[n]) continue;\n for(int m = 2 * n; m < primes.length; m += n){\n primes[m] = true;\n }\n }",
"int n = 2;",
"int n = 2;",
"n",
"2",
"n < primes.length",
"n",
"primes.length",
"primes",
"primes.length",
"n++",
"n++",
"n",
"{\n if(primes[n]) continue;\n for(int m = 2 * n; m < primes.length; m += n){\n primes[m] = true;\n }\n }",
"{\n if(primes[n]) continue;\n for(int m = 2 * n; m < primes.length; m += n){\n primes[m] = true;\n }\n }",
"if(primes[n]) continue;",
"primes[n]",
"primes",
"n",
"continue;",
"for(int m = 2 * n; m < primes.length; m += n){\n primes[m] = true;\n }",
"int m = 2 * n;",
"int m = 2 * n;",
"m",
"2 * n",
"2",
"n",
"m < primes.length",
"m",
"primes.length",
"primes",
"primes.length",
"m += n",
"m += n",
"m",
"n",
"{\n primes[m] = true;\n }",
"{\n primes[m] = true;\n }",
"primes[m] = true",
"primes[m]",
"primes",
"m",
"true",
"while (N != 0) {\n int num = in.nextInt();\n if (!primes[num]) count++;\n N--;\n }",
"N != 0",
"N",
"0",
"{\n int num = in.nextInt();\n if (!primes[num]) count++;\n N--;\n }",
"int num = in.nextInt();",
"num",
"in.nextInt()",
"in.nextInt",
"in",
"if (!primes[num]) count++;",
"!primes[num]",
"primes[num]",
"primes",
"num",
"count++",
"count",
"N--",
"N",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args"
] | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int N = in.nextInt();
int count = 0;
boolean primes[] = new boolean [100000000];
for(int n = 2; n < primes.length; n++){
if(primes[n]) continue;
for(int m = 2 * n; m < primes.length; m += n){
primes[m] = true;
}
}
while (N != 0) {
int num = in.nextInt();
if (!primes[num]) count++;
N--;
}
System.out.println(count);
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
8,
4,
13,
4,
18,
13,
17,
17,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
17,
14,
2,
2,
13,
17,
2,
2,
13,
17,
17,
30,
29,
17,
41,
13,
4,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
108,
5
],
[
108,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
20
],
[
20,
21
],
[
21,
22
],
[
22,
23
],
[
22,
24
],
[
20,
25
],
[
25,
26
],
[
25,
27
],
[
20,
28
],
[
28,
29
],
[
29,
30
],
[
20,
31
],
[
32,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
35,
41
],
[
35,
42
],
[
8,
43
],
[
43,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
43,
48
],
[
6,
49
],
[
49,
50
],
[
108,
51
],
[
51,
52
],
[
51,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
54,
58
],
[
58,
59
],
[
59,
60
],
[
54,
61
],
[
61,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
62,
66
],
[
66,
67
],
[
67,
68
],
[
67,
69
],
[
66,
70
],
[
61,
71
],
[
71,
72
],
[
72,
73
],
[
53,
74
],
[
74,
75
],
[
74,
76
],
[
76,
77
],
[
77,
78
],
[
76,
79
],
[
53,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
82,
84
],
[
80,
85
],
[
85,
86
],
[
85,
87
],
[
80,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
80,
92
],
[
93,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
96,
97
],
[
96,
98
],
[
95,
99
],
[
94,
100
],
[
100,
101
],
[
101,
102
],
[
53,
103
],
[
103,
104
],
[
51,
105
],
[
105,
106
],
[
0,
107
],
[
107,
108
],
[
107,
109
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int count = sc.nextInt();\n int sum = 0;\n for (int i = 0; i < count; i++) {\n sum += isPrimeNumber(sc.nextLong()) ? 1 : 0;\n }\n System.out.println(sum);\n }\n\n private static boolean isPrimeNumber(long a) {\n if (a == 2) {\n return true;\n } else if (a < 2 || a % 2 == 0) {\n return false;\n }\n\n long sqrt = (long) Math.sqrt(a);\n for (int i = 3; i <= sqrt; i += 2) {\n if (a % i == 0) {\n return false;\n }\n }\n return true;\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int count = sc.nextInt();\n int sum = 0;\n for (int i = 0; i < count; i++) {\n sum += isPrimeNumber(sc.nextLong()) ? 1 : 0;\n }\n System.out.println(sum);\n }\n\n private static boolean isPrimeNumber(long a) {\n if (a == 2) {\n return true;\n } else if (a < 2 || a % 2 == 0) {\n return false;\n }\n\n long sqrt = (long) Math.sqrt(a);\n for (int i = 3; i <= sqrt; i += 2) {\n if (a % i == 0) {\n return false;\n }\n }\n return true;\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int count = sc.nextInt();\n int sum = 0;\n for (int i = 0; i < count; i++) {\n sum += isPrimeNumber(sc.nextLong()) ? 1 : 0;\n }\n System.out.println(sum);\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n int count = sc.nextInt();\n int sum = 0;\n for (int i = 0; i < count; i++) {\n sum += isPrimeNumber(sc.nextLong()) ? 1 : 0;\n }\n System.out.println(sum);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int count = sc.nextInt();",
"count",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int sum = 0;",
"sum",
"0",
"for (int i = 0; i < count; i++) {\n sum += isPrimeNumber(sc.nextLong()) ? 1 : 0;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < count",
"i",
"count",
"i++",
"i++",
"i",
"{\n sum += isPrimeNumber(sc.nextLong()) ? 1 : 0;\n }",
"{\n sum += isPrimeNumber(sc.nextLong()) ? 1 : 0;\n }",
"sum += isPrimeNumber(sc.nextLong()) ? 1 : 0",
"sum",
"isPrimeNumber(sc.nextLong()) ? 1 : 0",
"isPrimeNumber(sc.nextLong())",
"isPrimeNumber",
"sc.nextLong()",
"sc.nextLong",
"sc",
"1",
"0",
"System.out.println(sum)",
"System.out.println",
"System.out",
"System",
"System.out",
"sum",
"String[] args",
"args",
"private static boolean isPrimeNumber(long a) {\n if (a == 2) {\n return true;\n } else if (a < 2 || a % 2 == 0) {\n return false;\n }\n\n long sqrt = (long) Math.sqrt(a);\n for (int i = 3; i <= sqrt; i += 2) {\n if (a % i == 0) {\n return false;\n }\n }\n return true;\n }",
"isPrimeNumber",
"{\n if (a == 2) {\n return true;\n } else if (a < 2 || a % 2 == 0) {\n return false;\n }\n\n long sqrt = (long) Math.sqrt(a);\n for (int i = 3; i <= sqrt; i += 2) {\n if (a % i == 0) {\n return false;\n }\n }\n return true;\n }",
"if (a == 2) {\n return true;\n } else if (a < 2 || a % 2 == 0) {\n return false;\n }",
"a == 2",
"a",
"2",
"{\n return true;\n }",
"return true;",
"true",
"if (a < 2 || a % 2 == 0) {\n return false;\n }",
"a < 2 || a % 2 == 0",
"a < 2",
"a",
"2",
"a % 2 == 0",
"a % 2",
"a",
"2",
"0",
"{\n return false;\n }",
"return false;",
"false",
"long sqrt = (long) Math.sqrt(a);",
"sqrt",
"(long) Math.sqrt(a)",
"Math.sqrt",
"Math",
"a",
"for (int i = 3; i <= sqrt; i += 2) {\n if (a % i == 0) {\n return false;\n }\n }",
"int i = 3;",
"int i = 3;",
"i",
"3",
"i <= sqrt",
"i",
"sqrt",
"i += 2",
"i += 2",
"i",
"2",
"{\n if (a % i == 0) {\n return false;\n }\n }",
"{\n if (a % i == 0) {\n return false;\n }\n }",
"if (a % i == 0) {\n return false;\n }",
"a % i == 0",
"a % i",
"a",
"i",
"0",
"{\n return false;\n }",
"return false;",
"false",
"return true;",
"true",
"long a",
"a",
"public class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int count = sc.nextInt();\n int sum = 0;\n for (int i = 0; i < count; i++) {\n sum += isPrimeNumber(sc.nextLong()) ? 1 : 0;\n }\n System.out.println(sum);\n }\n\n private static boolean isPrimeNumber(long a) {\n if (a == 2) {\n return true;\n } else if (a < 2 || a % 2 == 0) {\n return false;\n }\n\n long sqrt = (long) Math.sqrt(a);\n for (int i = 3; i <= sqrt; i += 2) {\n if (a % i == 0) {\n return false;\n }\n }\n return true;\n }\n}",
"public class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int count = sc.nextInt();\n int sum = 0;\n for (int i = 0; i < count; i++) {\n sum += isPrimeNumber(sc.nextLong()) ? 1 : 0;\n }\n System.out.println(sum);\n }\n\n private static boolean isPrimeNumber(long a) {\n if (a == 2) {\n return true;\n } else if (a < 2 || a % 2 == 0) {\n return false;\n }\n\n long sqrt = (long) Math.sqrt(a);\n for (int i = 3; i <= sqrt; i += 2) {\n if (a % i == 0) {\n return false;\n }\n }\n return true;\n }\n}",
"Main"
] | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int count = sc.nextInt();
int sum = 0;
for (int i = 0; i < count; i++) {
sum += isPrimeNumber(sc.nextLong()) ? 1 : 0;
}
System.out.println(sum);
}
private static boolean isPrimeNumber(long a) {
if (a == 2) {
return true;
} else if (a < 2 || a % 2 == 0) {
return false;
}
long sqrt = (long) Math.sqrt(a);
for (int i = 3; i <= sqrt; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
0,
18,
13,
13,
4,
18,
13,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
13,
17,
30,
40,
13,
14,
2,
2,
2,
18,
13,
13,
17,
17,
2,
18,
13,
13,
17,
30,
41,
13,
4,
18,
13,
18,
13,
13,
41,
13,
2,
13,
17,
41,
13,
17,
41,
13,
17,
42,
2,
13,
13,
30,
14,
2,
2,
18,
13,
13,
13,
17,
30,
0,
13,
17,
3,
0,
13,
17,
14,
2,
13,
17,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
149,
5
],
[
149,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
19,
22
],
[
8,
23
],
[
23,
24
],
[
23,
25
],
[
8,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
29,
31
],
[
27,
32
],
[
32,
33
],
[
32,
34
],
[
27,
35
],
[
35,
36
],
[
36,
37
],
[
27,
38
],
[
39,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
42,
43
],
[
43,
44
],
[
39,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
45,
49
],
[
49,
50
],
[
50,
51
],
[
49,
52
],
[
8,
53
],
[
53,
54
],
[
53,
55
],
[
8,
56
],
[
56,
57
],
[
57,
58
],
[
58,
59
],
[
58,
60
],
[
56,
61
],
[
61,
62
],
[
61,
63
],
[
56,
64
],
[
64,
65
],
[
65,
66
],
[
56,
67
],
[
68,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
70,
74
],
[
69,
75
],
[
75,
76
],
[
76,
77
],
[
69,
78
],
[
78,
79
],
[
79,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
82,
84
],
[
81,
85
],
[
80,
86
],
[
79,
87
],
[
87,
88
],
[
88,
89
],
[
88,
90
],
[
87,
91
],
[
78,
92
],
[
92,
93
],
[
93,
94
],
[
93,
95
],
[
95,
96
],
[
96,
97
],
[
95,
98
],
[
98,
99
],
[
98,
100
],
[
92,
101
],
[
101,
102
],
[
101,
103
],
[
103,
104
],
[
103,
105
],
[
92,
106
],
[
106,
107
],
[
106,
108
],
[
92,
109
],
[
109,
110
],
[
109,
111
],
[
92,
112
],
[
112,
113
],
[
113,
114
],
[
113,
115
],
[
112,
116
],
[
116,
117
],
[
117,
118
],
[
118,
119
],
[
119,
120
],
[
120,
121
],
[
120,
122
],
[
119,
123
],
[
118,
124
],
[
117,
125
],
[
125,
126
],
[
126,
127
],
[
126,
128
],
[
125,
129
],
[
116,
130
],
[
130,
131
],
[
130,
132
],
[
92,
133
],
[
133,
134
],
[
134,
135
],
[
134,
136
],
[
133,
137
],
[
137,
138
],
[
138,
139
],
[
8,
140
],
[
140,
141
],
[
141,
142
],
[
142,
143
],
[
142,
144
],
[
140,
145
],
[
6,
146
],
[
146,
147
],
[
0,
148
],
[
148,
149
],
[
148,
150
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO ?????????????????????????????????????????????\n\t\tScanner sc = new Scanner(System.in);\n\t\tString line1 = sc.nextLine();\n\t\tint n = Integer.parseInt(line1);\n\n\t\tint[] num = new int[n];\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tString kari = sc.nextLine();\n\t\t\tnum[i] = Integer.parseInt(kari);\n\t\t}\n\n\t\tint answer = 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (num[i] == 2) {\n\t\t\t\tanswer++;\n\t\t\t} else if (num[i] % 2 != 0 && num[i] >= 3) {\n\t\t\t\tdouble sq = Math.sqrt((double) num[i]);\n\t\t\t\tint sqr = (int) sq +1;\n\n\t\t\t\tint j = 3;\n\t\t\t\tint breakcount = 0;\n\t\t\t\twhile (j <= sqr) {\n\t\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\t\tbreakcount = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tj += 2;\n\t\t\t\t}\n\t\t\t\tif (breakcount == 0) {\n\t\t\t\t\tanswer++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(answer);\n\n\t}\n\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO ?????????????????????????????????????????????\n\t\tScanner sc = new Scanner(System.in);\n\t\tString line1 = sc.nextLine();\n\t\tint n = Integer.parseInt(line1);\n\n\t\tint[] num = new int[n];\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tString kari = sc.nextLine();\n\t\t\tnum[i] = Integer.parseInt(kari);\n\t\t}\n\n\t\tint answer = 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (num[i] == 2) {\n\t\t\t\tanswer++;\n\t\t\t} else if (num[i] % 2 != 0 && num[i] >= 3) {\n\t\t\t\tdouble sq = Math.sqrt((double) num[i]);\n\t\t\t\tint sqr = (int) sq +1;\n\n\t\t\t\tint j = 3;\n\t\t\t\tint breakcount = 0;\n\t\t\t\twhile (j <= sqr) {\n\t\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\t\tbreakcount = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tj += 2;\n\t\t\t\t}\n\t\t\t\tif (breakcount == 0) {\n\t\t\t\t\tanswer++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(answer);\n\n\t}\n\n}",
"Main",
"public static void main(String[] args) {\n\t\t// TODO ?????????????????????????????????????????????\n\t\tScanner sc = new Scanner(System.in);\n\t\tString line1 = sc.nextLine();\n\t\tint n = Integer.parseInt(line1);\n\n\t\tint[] num = new int[n];\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tString kari = sc.nextLine();\n\t\t\tnum[i] = Integer.parseInt(kari);\n\t\t}\n\n\t\tint answer = 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (num[i] == 2) {\n\t\t\t\tanswer++;\n\t\t\t} else if (num[i] % 2 != 0 && num[i] >= 3) {\n\t\t\t\tdouble sq = Math.sqrt((double) num[i]);\n\t\t\t\tint sqr = (int) sq +1;\n\n\t\t\t\tint j = 3;\n\t\t\t\tint breakcount = 0;\n\t\t\t\twhile (j <= sqr) {\n\t\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\t\tbreakcount = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tj += 2;\n\t\t\t\t}\n\t\t\t\tif (breakcount == 0) {\n\t\t\t\t\tanswer++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(answer);\n\n\t}",
"main",
"{\n\t\t// TODO ?????????????????????????????????????????????\n\t\tScanner sc = new Scanner(System.in);\n\t\tString line1 = sc.nextLine();\n\t\tint n = Integer.parseInt(line1);\n\n\t\tint[] num = new int[n];\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tString kari = sc.nextLine();\n\t\t\tnum[i] = Integer.parseInt(kari);\n\t\t}\n\n\t\tint answer = 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (num[i] == 2) {\n\t\t\t\tanswer++;\n\t\t\t} else if (num[i] % 2 != 0 && num[i] >= 3) {\n\t\t\t\tdouble sq = Math.sqrt((double) num[i]);\n\t\t\t\tint sqr = (int) sq +1;\n\n\t\t\t\tint j = 3;\n\t\t\t\tint breakcount = 0;\n\t\t\t\twhile (j <= sqr) {\n\t\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\t\tbreakcount = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tj += 2;\n\t\t\t\t}\n\t\t\t\tif (breakcount == 0) {\n\t\t\t\t\tanswer++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(answer);\n\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String line1 = sc.nextLine();",
"line1",
"sc.nextLine()",
"sc.nextLine",
"sc",
"int n = Integer.parseInt(line1);",
"n",
"Integer.parseInt(line1)",
"Integer.parseInt",
"Integer",
"line1",
"int[] num = new int[n];",
"num",
"new int[n]",
"n",
"for (int i = 0; i < n; i++) {\n\t\t\tString kari = sc.nextLine();\n\t\t\tnum[i] = Integer.parseInt(kari);\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tString kari = sc.nextLine();\n\t\t\tnum[i] = Integer.parseInt(kari);\n\t\t}",
"{\n\t\t\tString kari = sc.nextLine();\n\t\t\tnum[i] = Integer.parseInt(kari);\n\t\t}",
"String kari = sc.nextLine();",
"kari",
"sc.nextLine()",
"sc.nextLine",
"sc",
"num[i] = Integer.parseInt(kari)",
"num[i]",
"num",
"i",
"Integer.parseInt(kari)",
"Integer.parseInt",
"Integer",
"kari",
"int answer = 0;",
"answer",
"0",
"for (int i = 0; i < n; i++) {\n\t\t\tif (num[i] == 2) {\n\t\t\t\tanswer++;\n\t\t\t} else if (num[i] % 2 != 0 && num[i] >= 3) {\n\t\t\t\tdouble sq = Math.sqrt((double) num[i]);\n\t\t\t\tint sqr = (int) sq +1;\n\n\t\t\t\tint j = 3;\n\t\t\t\tint breakcount = 0;\n\t\t\t\twhile (j <= sqr) {\n\t\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\t\tbreakcount = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tj += 2;\n\t\t\t\t}\n\t\t\t\tif (breakcount == 0) {\n\t\t\t\t\tanswer++;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tif (num[i] == 2) {\n\t\t\t\tanswer++;\n\t\t\t} else if (num[i] % 2 != 0 && num[i] >= 3) {\n\t\t\t\tdouble sq = Math.sqrt((double) num[i]);\n\t\t\t\tint sqr = (int) sq +1;\n\n\t\t\t\tint j = 3;\n\t\t\t\tint breakcount = 0;\n\t\t\t\twhile (j <= sqr) {\n\t\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\t\tbreakcount = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tj += 2;\n\t\t\t\t}\n\t\t\t\tif (breakcount == 0) {\n\t\t\t\t\tanswer++;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"{\n\t\t\tif (num[i] == 2) {\n\t\t\t\tanswer++;\n\t\t\t} else if (num[i] % 2 != 0 && num[i] >= 3) {\n\t\t\t\tdouble sq = Math.sqrt((double) num[i]);\n\t\t\t\tint sqr = (int) sq +1;\n\n\t\t\t\tint j = 3;\n\t\t\t\tint breakcount = 0;\n\t\t\t\twhile (j <= sqr) {\n\t\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\t\tbreakcount = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tj += 2;\n\t\t\t\t}\n\t\t\t\tif (breakcount == 0) {\n\t\t\t\t\tanswer++;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"if (num[i] == 2) {\n\t\t\t\tanswer++;\n\t\t\t} else if (num[i] % 2 != 0 && num[i] >= 3) {\n\t\t\t\tdouble sq = Math.sqrt((double) num[i]);\n\t\t\t\tint sqr = (int) sq +1;\n\n\t\t\t\tint j = 3;\n\t\t\t\tint breakcount = 0;\n\t\t\t\twhile (j <= sqr) {\n\t\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\t\tbreakcount = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tj += 2;\n\t\t\t\t}\n\t\t\t\tif (breakcount == 0) {\n\t\t\t\t\tanswer++;\n\t\t\t\t}\n\t\t\t}",
"num[i] == 2",
"num[i]",
"num",
"i",
"2",
"{\n\t\t\t\tanswer++;\n\t\t\t}",
"answer++",
"answer",
"if (num[i] % 2 != 0 && num[i] >= 3) {\n\t\t\t\tdouble sq = Math.sqrt((double) num[i]);\n\t\t\t\tint sqr = (int) sq +1;\n\n\t\t\t\tint j = 3;\n\t\t\t\tint breakcount = 0;\n\t\t\t\twhile (j <= sqr) {\n\t\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\t\tbreakcount = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tj += 2;\n\t\t\t\t}\n\t\t\t\tif (breakcount == 0) {\n\t\t\t\t\tanswer++;\n\t\t\t\t}\n\t\t\t}",
"num[i] % 2 != 0 && num[i] >= 3",
"num[i] % 2 != 0",
"num[i] % 2",
"num[i]",
"num",
"i",
"2",
"0",
"num[i] >= 3",
"num[i]",
"num",
"i",
"3",
"{\n\t\t\t\tdouble sq = Math.sqrt((double) num[i]);\n\t\t\t\tint sqr = (int) sq +1;\n\n\t\t\t\tint j = 3;\n\t\t\t\tint breakcount = 0;\n\t\t\t\twhile (j <= sqr) {\n\t\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\t\tbreakcount = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tj += 2;\n\t\t\t\t}\n\t\t\t\tif (breakcount == 0) {\n\t\t\t\t\tanswer++;\n\t\t\t\t}\n\t\t\t}",
"double sq = Math.sqrt((double) num[i]);",
"sq",
"Math.sqrt((double) num[i])",
"Math.sqrt",
"Math",
"(double) num[i]",
"num",
"i",
"int sqr = (int) sq +1;",
"sqr",
"(int) sq +1",
"(int) sq",
"1",
"int j = 3;",
"j",
"3",
"int breakcount = 0;",
"breakcount",
"0",
"while (j <= sqr) {\n\t\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\t\tbreakcount = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tj += 2;\n\t\t\t\t}",
"j <= sqr",
"j",
"sqr",
"{\n\t\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\t\tbreakcount = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tj += 2;\n\t\t\t\t}",
"if (num[i] % j == 0) {\n\t\t\t\t\t\tbreakcount = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}",
"num[i] % j == 0",
"num[i] % j",
"num[i]",
"num",
"i",
"j",
"0",
"{\n\t\t\t\t\t\tbreakcount = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}",
"breakcount = 1",
"breakcount",
"1",
"break;",
"j += 2",
"j",
"2",
"if (breakcount == 0) {\n\t\t\t\t\tanswer++;\n\t\t\t\t}",
"breakcount == 0",
"breakcount",
"0",
"{\n\t\t\t\t\tanswer++;\n\t\t\t\t}",
"answer++",
"answer",
"System.out.println(answer)",
"System.out.println",
"System.out",
"System",
"System.out",
"answer",
"String[] args",
"args",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO ?????????????????????????????????????????????\n\t\tScanner sc = new Scanner(System.in);\n\t\tString line1 = sc.nextLine();\n\t\tint n = Integer.parseInt(line1);\n\n\t\tint[] num = new int[n];\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tString kari = sc.nextLine();\n\t\t\tnum[i] = Integer.parseInt(kari);\n\t\t}\n\n\t\tint answer = 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (num[i] == 2) {\n\t\t\t\tanswer++;\n\t\t\t} else if (num[i] % 2 != 0 && num[i] >= 3) {\n\t\t\t\tdouble sq = Math.sqrt((double) num[i]);\n\t\t\t\tint sqr = (int) sq +1;\n\n\t\t\t\tint j = 3;\n\t\t\t\tint breakcount = 0;\n\t\t\t\twhile (j <= sqr) {\n\t\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\t\tbreakcount = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tj += 2;\n\t\t\t\t}\n\t\t\t\tif (breakcount == 0) {\n\t\t\t\t\tanswer++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(answer);\n\n\t}\n\n}",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO ?????????????????????????????????????????????\n\t\tScanner sc = new Scanner(System.in);\n\t\tString line1 = sc.nextLine();\n\t\tint n = Integer.parseInt(line1);\n\n\t\tint[] num = new int[n];\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tString kari = sc.nextLine();\n\t\t\tnum[i] = Integer.parseInt(kari);\n\t\t}\n\n\t\tint answer = 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (num[i] == 2) {\n\t\t\t\tanswer++;\n\t\t\t} else if (num[i] % 2 != 0 && num[i] >= 3) {\n\t\t\t\tdouble sq = Math.sqrt((double) num[i]);\n\t\t\t\tint sqr = (int) sq +1;\n\n\t\t\t\tint j = 3;\n\t\t\t\tint breakcount = 0;\n\t\t\t\twhile (j <= sqr) {\n\t\t\t\t\tif (num[i] % j == 0) {\n\t\t\t\t\t\tbreakcount = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tj += 2;\n\t\t\t\t}\n\t\t\t\tif (breakcount == 0) {\n\t\t\t\t\tanswer++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(answer);\n\n\t}\n\n}",
"Main"
] | 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++) {
String kari = sc.nextLine();
num[i] = Integer.parseInt(kari);
}
int answer = 0;
for (int i = 0; i < n; i++) {
if (num[i] == 2) {
answer++;
} else if (num[i] % 2 != 0 && num[i] >= 3) {
double sq = Math.sqrt((double) num[i]);
int sqr = (int) sq +1;
int j = 3;
int breakcount = 0;
while (j <= sqr) {
if (num[i] % j == 0) {
breakcount = 1;
break;
}
j += 2;
}
if (breakcount == 0) {
answer++;
}
}
}
System.out.println(answer);
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
40,
13,
30,
14,
2,
2,
13,
13,
17,
29,
17,
29,
2,
13,
17,
23,
13,
12,
13,
30,
41,
13,
41,
13,
17,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
4,
18,
13,
14,
4,
13,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
104,
17
],
[
104,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
22,
23
],
[
23,
24
],
[
23,
25
],
[
21,
26
],
[
26,
27
],
[
27,
28
],
[
27,
29
],
[
26,
30
],
[
21,
31
],
[
31,
32
],
[
32,
33
],
[
21,
34
],
[
34,
35
],
[
35,
36
],
[
36,
37
],
[
37,
38
],
[
37,
39
],
[
36,
40
],
[
35,
41
],
[
41,
42
],
[
20,
43
],
[
43,
44
],
[
44,
45
],
[
44,
46
],
[
18,
47
],
[
47,
48
],
[
104,
49
],
[
49,
50
],
[
49,
51
],
[
51,
52
],
[
52,
53
],
[
51,
54
],
[
54,
55
],
[
54,
56
],
[
51,
57
],
[
57,
58
],
[
57,
59
],
[
51,
60
],
[
60,
61
],
[
60,
62
],
[
62,
63
],
[
63,
64
],
[
62,
65
],
[
65,
66
],
[
66,
67
],
[
51,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
70,
72
],
[
68,
73
],
[
73,
74
],
[
73,
75
],
[
68,
76
],
[
76,
77
],
[
77,
78
],
[
68,
79
],
[
80,
80
],
[
80,
81
],
[
81,
82
],
[
81,
83
],
[
83,
84
],
[
84,
85
],
[
83,
86
],
[
86,
87
],
[
87,
88
],
[
80,
89
],
[
89,
90
],
[
90,
91
],
[
90,
92
],
[
89,
93
],
[
93,
94
],
[
51,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
97,
99
],
[
95,
100
],
[
49,
101
],
[
101,
102
],
[
0,
103
],
[
103,
104
],
[
103,
105
]
] | [
"import java.util.*;\nimport java.io.*;\nimport static java.util.Arrays.*;\nimport static java.util.Collections.*;\nimport static java.lang.Math.*;\n\npublic class Main {\n\n public static boolean is_prime(int k) {\n for (int i=2; i*i<=k; i++) \n if (k%i == 0) return false;\n return k != 1;\n }\n\n public static void main(String[] args) {\n int i;\n int res = 0;\n Scanner sc = new Scanner(System.in); \n int n = Integer.parseInt(sc.next());;\n for (i=0; i<n; i++) {\n int a = Integer.parseInt(sc.next());;\n if (is_prime(a)) res++;\n }\n System.out.println(res);\n }\n}",
"import java.util.*;",
"util.*",
"java",
"import java.io.*;",
"io.*",
"java",
"import static java.util.Arrays.*;",
"import static java.util.Arrays.*;",
"import static java.util.Arrays.*;",
"import static java.util.Collections.*;",
"import static java.util.Collections.*;",
"import static java.util.Collections.*;",
"import static java.lang.Math.*;",
"import static java.lang.Math.*;",
"import static java.lang.Math.*;",
"public class Main {\n\n public static boolean is_prime(int k) {\n for (int i=2; i*i<=k; i++) \n if (k%i == 0) return false;\n return k != 1;\n }\n\n public static void main(String[] args) {\n int i;\n int res = 0;\n Scanner sc = new Scanner(System.in); \n int n = Integer.parseInt(sc.next());;\n for (i=0; i<n; i++) {\n int a = Integer.parseInt(sc.next());;\n if (is_prime(a)) res++;\n }\n System.out.println(res);\n }\n}",
"Main",
"public static boolean is_prime(int k) {\n for (int i=2; i*i<=k; i++) \n if (k%i == 0) return false;\n return k != 1;\n }",
"is_prime",
"{\n for (int i=2; i*i<=k; i++) \n if (k%i == 0) return false;\n return k != 1;\n }",
"for (int i=2; i*i<=k; i++) \n if (k%i == 0) return false;",
"int i=2;",
"int i=2;",
"i",
"2",
"i*i<=k",
"i*i",
"i",
"i",
"k",
"i++",
"i++",
"i",
"if (k%i == 0) return false;",
"if (k%i == 0) return false;",
"k%i == 0",
"k%i",
"k",
"i",
"0",
"return false;",
"false",
"return k != 1;",
"k != 1",
"k",
"1",
"int k",
"k",
"public static void main(String[] args) {\n int i;\n int res = 0;\n Scanner sc = new Scanner(System.in); \n int n = Integer.parseInt(sc.next());;\n for (i=0; i<n; i++) {\n int a = Integer.parseInt(sc.next());;\n if (is_prime(a)) res++;\n }\n System.out.println(res);\n }",
"main",
"{\n int i;\n int res = 0;\n Scanner sc = new Scanner(System.in); \n int n = Integer.parseInt(sc.next());;\n for (i=0; i<n; i++) {\n int a = Integer.parseInt(sc.next());;\n if (is_prime(a)) res++;\n }\n System.out.println(res);\n }",
"int i;",
"i",
"int res = 0;",
"res",
"0",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = Integer.parseInt(sc.next());",
"n",
"Integer.parseInt(sc.next())",
"Integer.parseInt",
"Integer",
"sc.next()",
"sc.next",
"sc",
"for (i=0; i<n; i++) {\n int a = Integer.parseInt(sc.next());;\n if (is_prime(a)) res++;\n }",
"i=0;",
"i=0",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n int a = Integer.parseInt(sc.next());;\n if (is_prime(a)) res++;\n }",
"{\n int a = Integer.parseInt(sc.next());;\n if (is_prime(a)) res++;\n }",
"int a = Integer.parseInt(sc.next());",
"a",
"Integer.parseInt(sc.next())",
"Integer.parseInt",
"Integer",
"sc.next()",
"sc.next",
"sc",
"if (is_prime(a)) res++;",
"is_prime(a)",
"is_prime",
"a",
"res++",
"res",
"System.out.println(res)",
"System.out.println",
"System.out",
"System",
"System.out",
"res",
"String[] args",
"args",
"public class Main {\n\n public static boolean is_prime(int k) {\n for (int i=2; i*i<=k; i++) \n if (k%i == 0) return false;\n return k != 1;\n }\n\n public static void main(String[] args) {\n int i;\n int res = 0;\n Scanner sc = new Scanner(System.in); \n int n = Integer.parseInt(sc.next());;\n for (i=0; i<n; i++) {\n int a = Integer.parseInt(sc.next());;\n if (is_prime(a)) res++;\n }\n System.out.println(res);\n }\n}",
"public class Main {\n\n public static boolean is_prime(int k) {\n for (int i=2; i*i<=k; i++) \n if (k%i == 0) return false;\n return k != 1;\n }\n\n public static void main(String[] args) {\n int i;\n int res = 0;\n Scanner sc = new Scanner(System.in); \n int n = Integer.parseInt(sc.next());;\n for (i=0; i<n; i++) {\n int a = Integer.parseInt(sc.next());;\n if (is_prime(a)) res++;\n }\n System.out.println(res);\n }\n}",
"Main"
] | import java.util.*;
import java.io.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import static java.lang.Math.*;
public class Main {
public static boolean is_prime(int k) {
for (int i=2; i*i<=k; i++)
if (k%i == 0) return false;
return k != 1;
}
public static void main(String[] args) {
int i;
int res = 0;
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());;
for (i=0; i<n; i++) {
int a = Integer.parseInt(sc.next());;
if (is_prime(a)) res++;
}
System.out.println(res);
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
0,
13,
4,
18,
13,
13,
14,
2,
2,
13,
17,
2,
13,
17,
29,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
17,
17,
29,
17,
14,
2,
2,
13,
13,
17,
29,
17,
29,
17,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
41,
13,
17,
41,
13,
41,
13,
0,
13,
4,
18,
13,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
4,
18,
13,
14,
4,
13,
13,
40,
13,
9,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
117,
5
],
[
117,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
8,
11
],
[
11,
12
],
[
11,
13
],
[
13,
14
],
[
14,
15
],
[
13,
16
],
[
8,
17
],
[
17,
18
],
[
18,
19
],
[
19,
20
],
[
19,
21
],
[
18,
22
],
[
22,
23
],
[
22,
24
],
[
17,
25
],
[
25,
26
],
[
8,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
29,
31
],
[
27,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
35,
36
],
[
34,
37
],
[
27,
38
],
[
38,
39
],
[
39,
40
],
[
27,
41
],
[
42,
42
],
[
42,
43
],
[
43,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
44,
48
],
[
43,
49
],
[
49,
50
],
[
42,
51
],
[
51,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
52,
56
],
[
51,
57
],
[
57,
58
],
[
8,
59
],
[
59,
60
],
[
6,
61
],
[
61,
62
],
[
117,
63
],
[
63,
64
],
[
63,
65
],
[
65,
66
],
[
66,
67
],
[
66,
68
],
[
65,
69
],
[
69,
70
],
[
65,
71
],
[
71,
72
],
[
71,
73
],
[
65,
74
],
[
74,
75
],
[
65,
76
],
[
76,
77
],
[
65,
78
],
[
78,
79
],
[
78,
80
],
[
80,
81
],
[
81,
82
],
[
65,
83
],
[
83,
84
],
[
84,
85
],
[
85,
86
],
[
85,
87
],
[
83,
88
],
[
88,
89
],
[
88,
90
],
[
83,
91
],
[
91,
92
],
[
92,
93
],
[
83,
94
],
[
95,
95
],
[
95,
96
],
[
96,
97
],
[
96,
98
],
[
98,
99
],
[
99,
100
],
[
95,
101
],
[
101,
102
],
[
102,
103
],
[
102,
104
],
[
101,
105
],
[
105,
106
],
[
101,
107
],
[
65,
108
],
[
108,
109
],
[
109,
110
],
[
110,
111
],
[
110,
112
],
[
108,
113
],
[
63,
114
],
[
114,
115
],
[
0,
116
],
[
116,
117
],
[
116,
118
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static boolean check(double a){\n\t\tdouble b;\n\t\tb = Math.sqrt(a);\n\t\tif(b>1.0 && b<2.0) return true;\n\n\t\tfor(int i=2;i<=(int)Math.floor(b);i++){\n\t\t\tif((a%2.0) == 0.0) return false;\n\t\t\tif((a%(double)i) == 0.0) return false;\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint i,c=0,n;\n\t\tdouble tmp;\n\t\tn = sc.nextInt();\n\n\t\tfor(i=0;i<n;i++){\n\t\t\ttmp = sc.nextDouble();\n\t\t\tif(check(tmp)) c++;\n\t\t\telse continue;\n\t\t}\n\t\tSystem.out.println(c);\n\t}\n\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n\tpublic static boolean check(double a){\n\t\tdouble b;\n\t\tb = Math.sqrt(a);\n\t\tif(b>1.0 && b<2.0) return true;\n\n\t\tfor(int i=2;i<=(int)Math.floor(b);i++){\n\t\t\tif((a%2.0) == 0.0) return false;\n\t\t\tif((a%(double)i) == 0.0) return false;\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint i,c=0,n;\n\t\tdouble tmp;\n\t\tn = sc.nextInt();\n\n\t\tfor(i=0;i<n;i++){\n\t\t\ttmp = sc.nextDouble();\n\t\t\tif(check(tmp)) c++;\n\t\t\telse continue;\n\t\t}\n\t\tSystem.out.println(c);\n\t}\n\n}",
"Main",
"public static boolean check(double a){\n\t\tdouble b;\n\t\tb = Math.sqrt(a);\n\t\tif(b>1.0 && b<2.0) return true;\n\n\t\tfor(int i=2;i<=(int)Math.floor(b);i++){\n\t\t\tif((a%2.0) == 0.0) return false;\n\t\t\tif((a%(double)i) == 0.0) return false;\n\t\t}\n\t\treturn true;\n\t}",
"check",
"{\n\t\tdouble b;\n\t\tb = Math.sqrt(a);\n\t\tif(b>1.0 && b<2.0) return true;\n\n\t\tfor(int i=2;i<=(int)Math.floor(b);i++){\n\t\t\tif((a%2.0) == 0.0) return false;\n\t\t\tif((a%(double)i) == 0.0) return false;\n\t\t}\n\t\treturn true;\n\t}",
"double b;",
"b",
"b = Math.sqrt(a)",
"b",
"Math.sqrt(a)",
"Math.sqrt",
"Math",
"a",
"if(b>1.0 && b<2.0) return true;",
"b>1.0 && b<2.0",
"b>1.0",
"b",
"1.0",
"b<2.0",
"b",
"2.0",
"return true;",
"true",
"for(int i=2;i<=(int)Math.floor(b);i++){\n\t\t\tif((a%2.0) == 0.0) return false;\n\t\t\tif((a%(double)i) == 0.0) return false;\n\t\t}",
"int i=2;",
"int i=2;",
"i",
"2",
"i<=(int)Math.floor(b)",
"i",
"(int)Math.floor(b)",
"Math.floor",
"Math",
"b",
"i++",
"i++",
"i",
"{\n\t\t\tif((a%2.0) == 0.0) return false;\n\t\t\tif((a%(double)i) == 0.0) return false;\n\t\t}",
"{\n\t\t\tif((a%2.0) == 0.0) return false;\n\t\t\tif((a%(double)i) == 0.0) return false;\n\t\t}",
"if((a%2.0) == 0.0) return false;",
"(a%2.0) == 0.0",
"(a%2.0)",
"a",
"2.0",
"0.0",
"return false;",
"false",
"if((a%(double)i) == 0.0) return false;",
"(a%(double)i) == 0.0",
"(a%(double)i)",
"a",
"(double)i",
"0.0",
"return false;",
"false",
"return true;",
"true",
"double a",
"a",
"public static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint i,c=0,n;\n\t\tdouble tmp;\n\t\tn = sc.nextInt();\n\n\t\tfor(i=0;i<n;i++){\n\t\t\ttmp = sc.nextDouble();\n\t\t\tif(check(tmp)) c++;\n\t\t\telse continue;\n\t\t}\n\t\tSystem.out.println(c);\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint i,c=0,n;\n\t\tdouble tmp;\n\t\tn = sc.nextInt();\n\n\t\tfor(i=0;i<n;i++){\n\t\t\ttmp = sc.nextDouble();\n\t\t\tif(check(tmp)) c++;\n\t\t\telse continue;\n\t\t}\n\t\tSystem.out.println(c);\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int i",
"i",
"c=0",
"c",
"0",
"n;",
"n",
"double tmp;",
"tmp",
"n = sc.nextInt()",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"for(i=0;i<n;i++){\n\t\t\ttmp = sc.nextDouble();\n\t\t\tif(check(tmp)) c++;\n\t\t\telse continue;\n\t\t}",
"i=0;",
"i=0",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\ttmp = sc.nextDouble();\n\t\t\tif(check(tmp)) c++;\n\t\t\telse continue;\n\t\t}",
"{\n\t\t\ttmp = sc.nextDouble();\n\t\t\tif(check(tmp)) c++;\n\t\t\telse continue;\n\t\t}",
"tmp = sc.nextDouble()",
"tmp",
"sc.nextDouble()",
"sc.nextDouble",
"sc",
"if(check(tmp)) c++;\n\t\t\telse continue;",
"check(tmp)",
"check",
"tmp",
"c++",
"c",
"continue;",
"System.out.println(c)",
"System.out.println",
"System.out",
"System",
"System.out",
"c",
"String[] args",
"args",
"public class Main {\n\n\tpublic static boolean check(double a){\n\t\tdouble b;\n\t\tb = Math.sqrt(a);\n\t\tif(b>1.0 && b<2.0) return true;\n\n\t\tfor(int i=2;i<=(int)Math.floor(b);i++){\n\t\t\tif((a%2.0) == 0.0) return false;\n\t\t\tif((a%(double)i) == 0.0) return false;\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint i,c=0,n;\n\t\tdouble tmp;\n\t\tn = sc.nextInt();\n\n\t\tfor(i=0;i<n;i++){\n\t\t\ttmp = sc.nextDouble();\n\t\t\tif(check(tmp)) c++;\n\t\t\telse continue;\n\t\t}\n\t\tSystem.out.println(c);\n\t}\n\n}",
"public class Main {\n\n\tpublic static boolean check(double a){\n\t\tdouble b;\n\t\tb = Math.sqrt(a);\n\t\tif(b>1.0 && b<2.0) return true;\n\n\t\tfor(int i=2;i<=(int)Math.floor(b);i++){\n\t\t\tif((a%2.0) == 0.0) return false;\n\t\t\tif((a%(double)i) == 0.0) return false;\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint i,c=0,n;\n\t\tdouble tmp;\n\t\tn = sc.nextInt();\n\n\t\tfor(i=0;i<n;i++){\n\t\t\ttmp = sc.nextDouble();\n\t\t\tif(check(tmp)) c++;\n\t\t\telse continue;\n\t\t}\n\t\tSystem.out.println(c);\n\t}\n\n}",
"Main"
] | 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) return false;
}
return true;
}
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int i,c=0,n;
double tmp;
n = sc.nextInt();
for(i=0;i<n;i++){
tmp = sc.nextDouble();
if(check(tmp)) c++;
else continue;
}
System.out.println(c);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
14,
4,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
17,
14,
2,
2,
13,
17,
2,
2,
13,
17,
17,
30,
29,
17,
41,
13,
17,
42,
2,
13,
4,
18,
13,
13,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
0,
13,
2,
13,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
106,
5
],
[
106,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
20
],
[
20,
21
],
[
21,
22
],
[
22,
23
],
[
22,
24
],
[
20,
25
],
[
25,
26
],
[
25,
27
],
[
20,
28
],
[
28,
29
],
[
29,
30
],
[
20,
31
],
[
32,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
35,
36
],
[
36,
37
],
[
32,
38
],
[
38,
39
],
[
39,
40
],
[
39,
41
],
[
38,
42
],
[
42,
43
],
[
43,
44
],
[
8,
45
],
[
45,
46
],
[
46,
47
],
[
47,
48
],
[
47,
49
],
[
45,
50
],
[
6,
51
],
[
51,
52
],
[
106,
53
],
[
53,
54
],
[
53,
55
],
[
55,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
56,
60
],
[
60,
61
],
[
61,
62
],
[
55,
63
],
[
63,
64
],
[
64,
65
],
[
65,
66
],
[
65,
67
],
[
64,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
68,
72
],
[
63,
73
],
[
73,
74
],
[
74,
75
],
[
55,
76
],
[
76,
77
],
[
76,
78
],
[
55,
79
],
[
79,
80
],
[
80,
81
],
[
80,
82
],
[
82,
83
],
[
83,
84
],
[
82,
85
],
[
79,
86
],
[
86,
87
],
[
87,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
88,
92
],
[
87,
93
],
[
93,
94
],
[
94,
95
],
[
86,
96
],
[
96,
97
],
[
96,
98
],
[
98,
99
],
[
98,
100
],
[
55,
101
],
[
101,
102
],
[
53,
103
],
[
103,
104
],
[
0,
105
],
[
105,
106
],
[
105,
107
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint cnt = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint num = sc.nextInt();\n\t\t\tif (isPrime(num)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(cnt);\n\t}\n\n\tprivate static boolean isPrime(int x) {\n\t\tif (x == 2) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (x < 2 || x % 2 == 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tint i = 3;\n\n\t\twhile (i <= Math.sqrt(x)) {\n\t\t\tif (x % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i + 2;\n\t\t}\n\t\treturn true;\n\t}\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint cnt = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint num = sc.nextInt();\n\t\t\tif (isPrime(num)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(cnt);\n\t}\n\n\tprivate static boolean isPrime(int x) {\n\t\tif (x == 2) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (x < 2 || x % 2 == 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tint i = 3;\n\n\t\twhile (i <= Math.sqrt(x)) {\n\t\t\tif (x % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i + 2;\n\t\t}\n\t\treturn true;\n\t}\n}",
"Main",
"public static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint cnt = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint num = sc.nextInt();\n\t\t\tif (isPrime(num)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(cnt);\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint cnt = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint num = sc.nextInt();\n\t\t\tif (isPrime(num)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(cnt);\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int cnt = 0;",
"cnt",
"0",
"for (int i = 0; i < n; i++) {\n\t\t\tint num = sc.nextInt();\n\t\t\tif (isPrime(num)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tint num = sc.nextInt();\n\t\t\tif (isPrime(num)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}",
"{\n\t\t\tint num = sc.nextInt();\n\t\t\tif (isPrime(num)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}",
"int num = sc.nextInt();",
"num",
"sc.nextInt()",
"sc.nextInt",
"sc",
"if (isPrime(num)) {\n\t\t\t\tcnt++;\n\t\t\t}",
"isPrime(num)",
"isPrime",
"num",
"{\n\t\t\t\tcnt++;\n\t\t\t}",
"cnt++",
"cnt",
"System.out.println(cnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"String args[]",
"args",
"private static boolean isPrime(int x) {\n\t\tif (x == 2) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (x < 2 || x % 2 == 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tint i = 3;\n\n\t\twhile (i <= Math.sqrt(x)) {\n\t\t\tif (x % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i + 2;\n\t\t}\n\t\treturn true;\n\t}",
"isPrime",
"{\n\t\tif (x == 2) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (x < 2 || x % 2 == 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tint i = 3;\n\n\t\twhile (i <= Math.sqrt(x)) {\n\t\t\tif (x % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i + 2;\n\t\t}\n\t\treturn true;\n\t}",
"if (x == 2) {\n\t\t\treturn true;\n\t\t}",
"x == 2",
"x",
"2",
"{\n\t\t\treturn true;\n\t\t}",
"return true;",
"true",
"if (x < 2 || x % 2 == 0) {\n\t\t\treturn false;\n\t\t}",
"x < 2 || x % 2 == 0",
"x < 2",
"x",
"2",
"x % 2 == 0",
"x % 2",
"x",
"2",
"0",
"{\n\t\t\treturn false;\n\t\t}",
"return false;",
"false",
"int i = 3;",
"i",
"3",
"while (i <= Math.sqrt(x)) {\n\t\t\tif (x % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i + 2;\n\t\t}",
"i <= Math.sqrt(x)",
"i",
"Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"{\n\t\t\tif (x % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i + 2;\n\t\t}",
"if (x % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}",
"x % i == 0",
"x % i",
"x",
"i",
"0",
"{\n\t\t\t\treturn false;\n\t\t\t}",
"return false;",
"false",
"i = i + 2",
"i",
"i + 2",
"i",
"2",
"return true;",
"true",
"int x",
"x",
"public class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint cnt = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint num = sc.nextInt();\n\t\t\tif (isPrime(num)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(cnt);\n\t}\n\n\tprivate static boolean isPrime(int x) {\n\t\tif (x == 2) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (x < 2 || x % 2 == 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tint i = 3;\n\n\t\twhile (i <= Math.sqrt(x)) {\n\t\t\tif (x % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i + 2;\n\t\t}\n\t\treturn true;\n\t}\n}",
"public class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint cnt = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint num = sc.nextInt();\n\t\t\tif (isPrime(num)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(cnt);\n\t}\n\n\tprivate static boolean isPrime(int x) {\n\t\tif (x == 2) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (x < 2 || x % 2 == 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tint i = 3;\n\n\t\twhile (i <= Math.sqrt(x)) {\n\t\t\tif (x % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i + 2;\n\t\t}\n\t\treturn true;\n\t}\n}",
"Main"
] | import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int cnt = 0;
for (int i = 0; i < n; i++) {
int num = sc.nextInt();
if (isPrime(num)) {
cnt++;
}
}
System.out.println(cnt);
}
private static boolean isPrime(int x) {
if (x == 2) {
return true;
}
if (x < 2 || x % 2 == 0) {
return false;
}
int i = 3;
while (i <= Math.sqrt(x)) {
if (x % i == 0) {
return false;
}
i = i + 2;
}
return true;
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
4,
18,
13,
4,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
14,
2,
13,
17,
30,
40,
13,
29,
14,
2,
2,
13,
17,
17,
30,
29,
30,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
40,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
115,
11
],
[
115,
12
],
[
12,
13
],
[
115,
14
],
[
14,
15
],
[
14,
16
],
[
16,
17
],
[
17,
18
],
[
17,
19
],
[
16,
20
],
[
20,
21
],
[
20,
22
],
[
22,
23
],
[
23,
24
],
[
22,
25
],
[
25,
26
],
[
26,
27
],
[
16,
28
],
[
28,
29
],
[
29,
30
],
[
30,
31
],
[
30,
32
],
[
28,
33
],
[
33,
34
],
[
33,
35
],
[
28,
36
],
[
36,
37
],
[
37,
38
],
[
28,
39
],
[
40,
40
],
[
40,
41
],
[
41,
42
],
[
41,
43
],
[
43,
44
],
[
44,
45
],
[
43,
46
],
[
46,
47
],
[
47,
48
],
[
40,
49
],
[
49,
50
],
[
49,
51
],
[
16,
52
],
[
52,
53
],
[
53,
54
],
[
54,
55
],
[
54,
56
],
[
52,
57
],
[
14,
58
],
[
58,
59
],
[
115,
60
],
[
60,
61
],
[
60,
62
],
[
62,
63
],
[
63,
64
],
[
64,
65
],
[
64,
66
],
[
63,
67
],
[
67,
68
],
[
63,
69
],
[
69,
70
],
[
70,
71
],
[
70,
72
],
[
69,
73
],
[
73,
74
],
[
74,
75
],
[
73,
76
],
[
69,
77
],
[
77,
78
],
[
78,
79
],
[
79,
80
],
[
79,
81
],
[
78,
82
],
[
77,
83
],
[
83,
84
],
[
77,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
88,
89
],
[
88,
90
],
[
86,
91
],
[
91,
92
],
[
91,
93
],
[
93,
94
],
[
94,
95
],
[
93,
96
],
[
86,
97
],
[
97,
98
],
[
98,
99
],
[
86,
100
],
[
101,
101
],
[
101,
102
],
[
102,
103
],
[
103,
104
],
[
104,
105
],
[
104,
106
],
[
103,
107
],
[
102,
108
],
[
108,
109
],
[
62,
110
],
[
110,
111
],
[
60,
112
],
[
112,
113
],
[
0,
114
],
[
114,
115
],
[
114,
116
]
] | [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main{\n\tpublic static int count;\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tfor(int i = 0;i < n; i++){\n\t\t\tint num = Integer.parseInt(br.readLine());\n\t\t\tsolve(num);\n\t\t}\n\n\t\tSystem.out.println(count);\n\n\t}\n\n\tpublic static void solve(int num){\n\t\tif(num == 1){\n\t\t\treturn;\n\t\t}\n\t\telse if(num == 2){\n\t\t\tcount++;\n\t\t\treturn;\n\t\t}\n\t\telse if(num % 2 == 0){\n\t\t\treturn;\n\t\t}\n\t\telse{\n\t\t\tfor(int i = 3;i <= Math.sqrt(num); i++){\n\t\t\t\tif(num % i == 0){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcount++;\n\t}\n\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"public class Main{\n\tpublic static int count;\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tfor(int i = 0;i < n; i++){\n\t\t\tint num = Integer.parseInt(br.readLine());\n\t\t\tsolve(num);\n\t\t}\n\n\t\tSystem.out.println(count);\n\n\t}\n\n\tpublic static void solve(int num){\n\t\tif(num == 1){\n\t\t\treturn;\n\t\t}\n\t\telse if(num == 2){\n\t\t\tcount++;\n\t\t\treturn;\n\t\t}\n\t\telse if(num % 2 == 0){\n\t\t\treturn;\n\t\t}\n\t\telse{\n\t\t\tfor(int i = 3;i <= Math.sqrt(num); i++){\n\t\t\t\tif(num % i == 0){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcount++;\n\t}\n\n}",
"Main",
"public static int count;",
"count",
"public static void main(String[] args) throws NumberFormatException, IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tfor(int i = 0;i < n; i++){\n\t\t\tint num = Integer.parseInt(br.readLine());\n\t\t\tsolve(num);\n\t\t}\n\n\t\tSystem.out.println(count);\n\n\t}",
"main",
"{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tfor(int i = 0;i < n; i++){\n\t\t\tint num = Integer.parseInt(br.readLine());\n\t\t\tsolve(num);\n\t\t}\n\n\t\tSystem.out.println(count);\n\n\t}",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"int n = Integer.parseInt(br.readLine());",
"n",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"for(int i = 0;i < n; i++){\n\t\t\tint num = Integer.parseInt(br.readLine());\n\t\t\tsolve(num);\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tint num = Integer.parseInt(br.readLine());\n\t\t\tsolve(num);\n\t\t}",
"{\n\t\t\tint num = Integer.parseInt(br.readLine());\n\t\t\tsolve(num);\n\t\t}",
"int num = Integer.parseInt(br.readLine());",
"num",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"solve(num)",
"solve",
"num",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"public static void solve(int num){\n\t\tif(num == 1){\n\t\t\treturn;\n\t\t}\n\t\telse if(num == 2){\n\t\t\tcount++;\n\t\t\treturn;\n\t\t}\n\t\telse if(num % 2 == 0){\n\t\t\treturn;\n\t\t}\n\t\telse{\n\t\t\tfor(int i = 3;i <= Math.sqrt(num); i++){\n\t\t\t\tif(num % i == 0){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcount++;\n\t}",
"solve",
"{\n\t\tif(num == 1){\n\t\t\treturn;\n\t\t}\n\t\telse if(num == 2){\n\t\t\tcount++;\n\t\t\treturn;\n\t\t}\n\t\telse if(num % 2 == 0){\n\t\t\treturn;\n\t\t}\n\t\telse{\n\t\t\tfor(int i = 3;i <= Math.sqrt(num); i++){\n\t\t\t\tif(num % i == 0){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcount++;\n\t}",
"if(num == 1){\n\t\t\treturn;\n\t\t}\n\t\telse if(num == 2){\n\t\t\tcount++;\n\t\t\treturn;\n\t\t}\n\t\telse if(num % 2 == 0){\n\t\t\treturn;\n\t\t}\n\t\telse{\n\t\t\tfor(int i = 3;i <= Math.sqrt(num); i++){\n\t\t\t\tif(num % i == 0){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"num == 1",
"num",
"1",
"{\n\t\t\treturn;\n\t\t}",
"return;",
"if(num == 2){\n\t\t\tcount++;\n\t\t\treturn;\n\t\t}\n\t\telse if(num % 2 == 0){\n\t\t\treturn;\n\t\t}\n\t\telse{\n\t\t\tfor(int i = 3;i <= Math.sqrt(num); i++){\n\t\t\t\tif(num % i == 0){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"num == 2",
"num",
"2",
"{\n\t\t\tcount++;\n\t\t\treturn;\n\t\t}",
"count++",
"count",
"return;",
"if(num % 2 == 0){\n\t\t\treturn;\n\t\t}\n\t\telse{\n\t\t\tfor(int i = 3;i <= Math.sqrt(num); i++){\n\t\t\t\tif(num % i == 0){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"num % 2 == 0",
"num % 2",
"num",
"2",
"0",
"{\n\t\t\treturn;\n\t\t}",
"return;",
"{\n\t\t\tfor(int i = 3;i <= Math.sqrt(num); i++){\n\t\t\t\tif(num % i == 0){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"for(int i = 3;i <= Math.sqrt(num); i++){\n\t\t\t\tif(num % i == 0){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}",
"int i = 3;",
"int i = 3;",
"i",
"3",
"i <= Math.sqrt(num)",
"i",
"Math.sqrt(num)",
"Math.sqrt",
"Math",
"num",
"i++",
"i++",
"i",
"{\n\t\t\t\tif(num % i == 0){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif(num % i == 0){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}",
"if(num % i == 0){\n\t\t\t\t\treturn;\n\t\t\t\t}",
"num % i == 0",
"num % i",
"num",
"i",
"0",
"{\n\t\t\t\t\treturn;\n\t\t\t\t}",
"return;",
"count++",
"count",
"int num",
"num",
"public class Main{\n\tpublic static int count;\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tfor(int i = 0;i < n; i++){\n\t\t\tint num = Integer.parseInt(br.readLine());\n\t\t\tsolve(num);\n\t\t}\n\n\t\tSystem.out.println(count);\n\n\t}\n\n\tpublic static void solve(int num){\n\t\tif(num == 1){\n\t\t\treturn;\n\t\t}\n\t\telse if(num == 2){\n\t\t\tcount++;\n\t\t\treturn;\n\t\t}\n\t\telse if(num % 2 == 0){\n\t\t\treturn;\n\t\t}\n\t\telse{\n\t\t\tfor(int i = 3;i <= Math.sqrt(num); i++){\n\t\t\t\tif(num % i == 0){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcount++;\n\t}\n\n}",
"public class Main{\n\tpublic static int count;\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tfor(int i = 0;i < n; i++){\n\t\t\tint num = Integer.parseInt(br.readLine());\n\t\t\tsolve(num);\n\t\t}\n\n\t\tSystem.out.println(count);\n\n\t}\n\n\tpublic static void solve(int num){\n\t\tif(num == 1){\n\t\t\treturn;\n\t\t}\n\t\telse if(num == 2){\n\t\t\tcount++;\n\t\t\treturn;\n\t\t}\n\t\telse if(num % 2 == 0){\n\t\t\treturn;\n\t\t}\n\t\telse{\n\t\t\tfor(int i = 3;i <= Math.sqrt(num); i++){\n\t\t\t\tif(num % i == 0){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcount++;\n\t}\n\n}",
"Main"
] | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main{
public static int count;
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
for(int i = 0;i < n; i++){
int num = Integer.parseInt(br.readLine());
solve(num);
}
System.out.println(count);
}
public static void solve(int num){
if(num == 1){
return;
}
else if(num == 2){
count++;
return;
}
else if(num % 2 == 0){
return;
}
else{
for(int i = 3;i <= Math.sqrt(num); i++){
if(num % i == 0){
return;
}
}
}
count++;
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
20,
41,
13,
17,
41,
13,
17,
41,
13,
17,
41,
13,
17,
41,
13,
41,
13,
0,
13,
4,
18,
13,
4,
18,
13,
0,
13,
20,
13,
0,
13,
20,
13,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
4,
18,
13,
0,
18,
13,
13,
4,
18,
13,
18,
13,
13,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
11,
1,
0,
13,
17,
2,
13,
2,
18,
13,
13,
17,
1,
40,
13,
30,
30,
14,
2,
2,
13,
2,
18,
13,
13,
17,
2,
18,
13,
13,
17,
30,
40,
13,
14,
2,
2,
18,
13,
13,
13,
17,
30,
3,
4,
18,
13,
13,
4,
18,
18,
13,
13,
4,
18,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
8,
15
],
[
15,
16
],
[
15,
17
],
[
8,
18
],
[
18,
19
],
[
18,
20
],
[
8,
21
],
[
21,
22
],
[
21,
23
],
[
8,
24
],
[
24,
25
],
[
24,
26
],
[
8,
27
],
[
27,
28
],
[
8,
29
],
[
29,
30
],
[
8,
31
],
[
31,
32
],
[
31,
33
],
[
33,
34
],
[
34,
35
],
[
33,
36
],
[
36,
37
],
[
37,
38
],
[
8,
39
],
[
39,
40
],
[
39,
41
],
[
8,
43
],
[
43,
44
],
[
43,
45
],
[
8,
47
],
[
47,
48
],
[
48,
49
],
[
49,
50
],
[
49,
51
],
[
47,
52
],
[
52,
53
],
[
52,
54
],
[
47,
55
],
[
55,
56
],
[
56,
57
],
[
47,
58
],
[
59,
59
],
[
59,
60
],
[
60,
61
],
[
61,
62
],
[
61,
63
],
[
60,
64
],
[
64,
65
],
[
65,
66
],
[
64,
67
],
[
67,
68
],
[
68,
69
],
[
59,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
70,
74
],
[
74,
75
],
[
75,
76
],
[
74,
77
],
[
77,
78
],
[
77,
79
],
[
8,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
82,
84
],
[
80,
85
],
[
85,
86
],
[
85,
87
],
[
80,
88
],
[
88,
89
],
[
89,
90
],
[
80,
91
],
[
92,
92
],
[
92,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
95,
97
],
[
93,
98
],
[
98,
99
],
[
98,
100
],
[
100,
101
],
[
101,
102
],
[
101,
103
],
[
100,
104
],
[
93,
105
],
[
105,
106
],
[
106,
107
],
[
93,
108
],
[
109,
109
],
[
109,
110
],
[
110,
111
],
[
111,
112
],
[
112,
113
],
[
112,
114
],
[
114,
115
],
[
115,
116
],
[
115,
117
],
[
114,
118
],
[
111,
119
],
[
119,
120
],
[
120,
121
],
[
120,
122
],
[
119,
123
],
[
110,
124
],
[
124,
125
],
[
125,
126
],
[
109,
127
],
[
127,
128
],
[
128,
129
],
[
129,
130
],
[
130,
131
],
[
130,
132
],
[
129,
133
],
[
128,
134
],
[
127,
135
],
[
135,
136
],
[
8,
137
],
[
137,
138
],
[
138,
139
],
[
137,
140
],
[
8,
141
],
[
141,
142
],
[
142,
143
],
[
143,
144
],
[
143,
145
],
[
141,
146
],
[
146,
147
],
[
147,
148
],
[
6,
149
],
[
149,
150
]
] | [
"import java.util.Scanner;\n\n/**\n * \n */\n\n/**\n * @author kawakami\n *\n */\nclass Main {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tStringBuilder sb = new StringBuilder();\n\t\tScanner as = new Scanner(System.in);\n\t\t\n\t\tint n = 0;\n\t\tint i = 0;\n\t\tint j = 0;\n\t\tint count = 0;\n\t\tint gre[];\n\t\tint pnum[];\n\t\t\n\t\tn = Integer.parseInt(as.next());\n\t\t\n\t\tpnum = new int[n];\n\t\tgre = new int[n];\n\t\t\n\t\tfor(i=0;i<n;i++){\n\t\t\t\n\t\t\tpnum[i] = Integer.parseInt(as.next());\n\t\t\tgre[i] = (int) Math.sqrt(pnum[i]);\n\t\t\t//System.out.println(\"moto:\"+pnum[i]);\n\t\t\t//System.out.println(\"root:\"+gre[i]);\n\t\t\t\n\t\t}\n\t\t\n\t\tfor(i=0;i<n;i++){\n\t\t\tfor(j=2;j<=gre[i]+1;j++){\n\t\t\t\t\n\t\t\t\tif(j == gre[i]+1 && pnum[i] != 1){\n\t\t\t\t\t\n\t\t\t\t\t//System.out.println(pnum[i]);\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tif(pnum[i] % j == 0){\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\n\t\t}\n\t\t\n\t\tsb.append(count);\n\t\tSystem.out.println(sb.toString());\n\n\t}\n\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"class Main {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tStringBuilder sb = new StringBuilder();\n\t\tScanner as = new Scanner(System.in);\n\t\t\n\t\tint n = 0;\n\t\tint i = 0;\n\t\tint j = 0;\n\t\tint count = 0;\n\t\tint gre[];\n\t\tint pnum[];\n\t\t\n\t\tn = Integer.parseInt(as.next());\n\t\t\n\t\tpnum = new int[n];\n\t\tgre = new int[n];\n\t\t\n\t\tfor(i=0;i<n;i++){\n\t\t\t\n\t\t\tpnum[i] = Integer.parseInt(as.next());\n\t\t\tgre[i] = (int) Math.sqrt(pnum[i]);\n\t\t\t//System.out.println(\"moto:\"+pnum[i]);\n\t\t\t//System.out.println(\"root:\"+gre[i]);\n\t\t\t\n\t\t}\n\t\t\n\t\tfor(i=0;i<n;i++){\n\t\t\tfor(j=2;j<=gre[i]+1;j++){\n\t\t\t\t\n\t\t\t\tif(j == gre[i]+1 && pnum[i] != 1){\n\t\t\t\t\t\n\t\t\t\t\t//System.out.println(pnum[i]);\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tif(pnum[i] % j == 0){\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\n\t\t}\n\t\t\n\t\tsb.append(count);\n\t\tSystem.out.println(sb.toString());\n\n\t}\n\n}",
"Main",
"/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tStringBuilder sb = new StringBuilder();\n\t\tScanner as = new Scanner(System.in);\n\t\t\n\t\tint n = 0;\n\t\tint i = 0;\n\t\tint j = 0;\n\t\tint count = 0;\n\t\tint gre[];\n\t\tint pnum[];\n\t\t\n\t\tn = Integer.parseInt(as.next());\n\t\t\n\t\tpnum = new int[n];\n\t\tgre = new int[n];\n\t\t\n\t\tfor(i=0;i<n;i++){\n\t\t\t\n\t\t\tpnum[i] = Integer.parseInt(as.next());\n\t\t\tgre[i] = (int) Math.sqrt(pnum[i]);\n\t\t\t//System.out.println(\"moto:\"+pnum[i]);\n\t\t\t//System.out.println(\"root:\"+gre[i]);\n\t\t\t\n\t\t}\n\t\t\n\t\tfor(i=0;i<n;i++){\n\t\t\tfor(j=2;j<=gre[i]+1;j++){\n\t\t\t\t\n\t\t\t\tif(j == gre[i]+1 && pnum[i] != 1){\n\t\t\t\t\t\n\t\t\t\t\t//System.out.println(pnum[i]);\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tif(pnum[i] % j == 0){\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\n\t\t}\n\t\t\n\t\tsb.append(count);\n\t\tSystem.out.println(sb.toString());\n\n\t}",
"main",
"{\n\t\t// TODO Auto-generated method stub\n\t\tStringBuilder sb = new StringBuilder();\n\t\tScanner as = new Scanner(System.in);\n\t\t\n\t\tint n = 0;\n\t\tint i = 0;\n\t\tint j = 0;\n\t\tint count = 0;\n\t\tint gre[];\n\t\tint pnum[];\n\t\t\n\t\tn = Integer.parseInt(as.next());\n\t\t\n\t\tpnum = new int[n];\n\t\tgre = new int[n];\n\t\t\n\t\tfor(i=0;i<n;i++){\n\t\t\t\n\t\t\tpnum[i] = Integer.parseInt(as.next());\n\t\t\tgre[i] = (int) Math.sqrt(pnum[i]);\n\t\t\t//System.out.println(\"moto:\"+pnum[i]);\n\t\t\t//System.out.println(\"root:\"+gre[i]);\n\t\t\t\n\t\t}\n\t\t\n\t\tfor(i=0;i<n;i++){\n\t\t\tfor(j=2;j<=gre[i]+1;j++){\n\t\t\t\t\n\t\t\t\tif(j == gre[i]+1 && pnum[i] != 1){\n\t\t\t\t\t\n\t\t\t\t\t//System.out.println(pnum[i]);\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tif(pnum[i] % j == 0){\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\n\t\t}\n\t\t\n\t\tsb.append(count);\n\t\tSystem.out.println(sb.toString());\n\n\t}",
"StringBuilder sb = new StringBuilder();",
"sb",
"new StringBuilder()",
"Scanner as = new Scanner(System.in);",
"as",
"new Scanner(System.in)",
"int n = 0;",
"n",
"0",
"int i = 0;",
"i",
"0",
"int j = 0;",
"j",
"0",
"int count = 0;",
"count",
"0",
"int gre[];",
"gre",
"int pnum[];",
"pnum",
"n = Integer.parseInt(as.next())",
"n",
"Integer.parseInt(as.next())",
"Integer.parseInt",
"Integer",
"as.next()",
"as.next",
"as",
"pnum = new int[n]",
"pnum",
"new int[n]",
"n",
"gre = new int[n]",
"gre",
"new int[n]",
"n",
"for(i=0;i<n;i++){\n\t\t\t\n\t\t\tpnum[i] = Integer.parseInt(as.next());\n\t\t\tgre[i] = (int) Math.sqrt(pnum[i]);\n\t\t\t//System.out.println(\"moto:\"+pnum[i]);\n\t\t\t//System.out.println(\"root:\"+gre[i]);\n\t\t\t\n\t\t}",
"i=0;",
"i=0",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\t\n\t\t\tpnum[i] = Integer.parseInt(as.next());\n\t\t\tgre[i] = (int) Math.sqrt(pnum[i]);\n\t\t\t//System.out.println(\"moto:\"+pnum[i]);\n\t\t\t//System.out.println(\"root:\"+gre[i]);\n\t\t\t\n\t\t}",
"{\n\t\t\t\n\t\t\tpnum[i] = Integer.parseInt(as.next());\n\t\t\tgre[i] = (int) Math.sqrt(pnum[i]);\n\t\t\t//System.out.println(\"moto:\"+pnum[i]);\n\t\t\t//System.out.println(\"root:\"+gre[i]);\n\t\t\t\n\t\t}",
"pnum[i] = Integer.parseInt(as.next())",
"pnum[i]",
"pnum",
"i",
"Integer.parseInt(as.next())",
"Integer.parseInt",
"Integer",
"as.next()",
"as.next",
"as",
"gre[i] = (int) Math.sqrt(pnum[i])",
"gre[i]",
"gre",
"i",
"(int) Math.sqrt(pnum[i])",
"Math.sqrt",
"Math",
"pnum[i]",
"pnum",
"i",
"for(i=0;i<n;i++){\n\t\t\tfor(j=2;j<=gre[i]+1;j++){\n\t\t\t\t\n\t\t\t\tif(j == gre[i]+1 && pnum[i] != 1){\n\t\t\t\t\t\n\t\t\t\t\t//System.out.println(pnum[i]);\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tif(pnum[i] % j == 0){\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\n\t\t}",
"i=0;",
"i=0",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tfor(j=2;j<=gre[i]+1;j++){\n\t\t\t\t\n\t\t\t\tif(j == gre[i]+1 && pnum[i] != 1){\n\t\t\t\t\t\n\t\t\t\t\t//System.out.println(pnum[i]);\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tif(pnum[i] % j == 0){\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\n\t\t}",
"{\n\t\t\tfor(j=2;j<=gre[i]+1;j++){\n\t\t\t\t\n\t\t\t\tif(j == gre[i]+1 && pnum[i] != 1){\n\t\t\t\t\t\n\t\t\t\t\t//System.out.println(pnum[i]);\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tif(pnum[i] % j == 0){\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\n\t\t}",
"for(j=2;j<=gre[i]+1;j++){\n\t\t\t\t\n\t\t\t\tif(j == gre[i]+1 && pnum[i] != 1){\n\t\t\t\t\t\n\t\t\t\t\t//System.out.println(pnum[i]);\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tif(pnum[i] % j == 0){\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}",
"j=2;",
"j=2",
"j",
"2",
"j<=gre[i]+1",
"j",
"gre[i]+1",
"gre[i]",
"gre",
"i",
"1",
"j++",
"j++",
"j",
"{\n\t\t\t\t\n\t\t\t\tif(j == gre[i]+1 && pnum[i] != 1){\n\t\t\t\t\t\n\t\t\t\t\t//System.out.println(pnum[i]);\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tif(pnum[i] % j == 0){\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}",
"{\n\t\t\t\t\n\t\t\t\tif(j == gre[i]+1 && pnum[i] != 1){\n\t\t\t\t\t\n\t\t\t\t\t//System.out.println(pnum[i]);\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tif(pnum[i] % j == 0){\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}",
"if(j == gre[i]+1 && pnum[i] != 1){\n\t\t\t\t\t\n\t\t\t\t\t//System.out.println(pnum[i]);\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t\t}",
"j == gre[i]+1 && pnum[i] != 1",
"j == gre[i]+1",
"j",
"gre[i]+1",
"gre[i]",
"gre",
"i",
"1",
"pnum[i] != 1",
"pnum[i]",
"pnum",
"i",
"1",
"{\n\t\t\t\t\t\n\t\t\t\t\t//System.out.println(pnum[i]);\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t\t}",
"count++",
"count",
"if(pnum[i] % j == 0){\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\t}",
"pnum[i] % j == 0",
"pnum[i] % j",
"pnum[i]",
"pnum",
"i",
"j",
"0",
"{\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\t}",
"break;",
"sb.append(count)",
"sb.append",
"sb",
"count",
"System.out.println(sb.toString())",
"System.out.println",
"System.out",
"System",
"System.out",
"sb.toString()",
"sb.toString",
"sb",
"String[] args",
"args"
] | 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 = 0;
int count = 0;
int gre[];
int pnum[];
n = Integer.parseInt(as.next());
pnum = new int[n];
gre = new int[n];
for(i=0;i<n;i++){
pnum[i] = Integer.parseInt(as.next());
gre[i] = (int) Math.sqrt(pnum[i]);
//System.out.println("moto:"+pnum[i]);
//System.out.println("root:"+gre[i]);
}
for(i=0;i<n;i++){
for(j=2;j<=gre[i]+1;j++){
if(j == gre[i]+1 && pnum[i] != 1){
//System.out.println(pnum[i]);
count++;
}
if(pnum[i] % j == 0){
break;
}
}
}
sb.append(count);
System.out.println(sb.toString());
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
13,
1,
40,
13,
30,
30,
0,
13,
4,
18,
13,
14,
4,
18,
20,
17,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
18,
20
],
[
17,
21
],
[
21,
22
],
[
21,
23
],
[
17,
24
],
[
24,
25
],
[
24,
26
],
[
26,
27
],
[
27,
28
],
[
17,
29
],
[
29,
30
],
[
17,
31
],
[
31,
32
],
[
31,
33
],
[
17,
34
],
[
34,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
34,
39
],
[
39,
40
],
[
39,
41
],
[
41,
42
],
[
42,
43
],
[
41,
44
],
[
34,
45
],
[
45,
46
],
[
46,
47
],
[
34,
48
],
[
49,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
52,
53
],
[
53,
54
],
[
49,
55
],
[
55,
56
],
[
56,
57
],
[
57,
58
],
[
56,
59
],
[
55,
60
],
[
60,
61
],
[
61,
62
],
[
17,
63
],
[
63,
64
],
[
64,
65
],
[
65,
66
],
[
65,
67
],
[
63,
68
],
[
15,
69
],
[
69,
70
]
] | [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.math.BigInteger;\n\nclass Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tStringBuilder buider = new StringBuilder();\n\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tString n = br.readLine();\n\n\t\tString nums;\n\n\t\tint count=0;\n\t\tfor(int i=0; i<Integer.parseInt(n); i++){\n\t\t\t nums = br.readLine();\n\t\t\tif(new BigInteger(nums).isProbablePrime(3)){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\n\t}\n\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.math.BigInteger;",
"BigInteger",
"java.math",
"class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tStringBuilder buider = new StringBuilder();\n\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tString n = br.readLine();\n\n\t\tString nums;\n\n\t\tint count=0;\n\t\tfor(int i=0; i<Integer.parseInt(n); i++){\n\t\t\t nums = br.readLine();\n\t\t\tif(new BigInteger(nums).isProbablePrime(3)){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\n\t}\n\n}",
"Main",
"public static void main(String[] args) throws IOException {\n\n\t\tStringBuilder buider = new StringBuilder();\n\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tString n = br.readLine();\n\n\t\tString nums;\n\n\t\tint count=0;\n\t\tfor(int i=0; i<Integer.parseInt(n); i++){\n\t\t\t nums = br.readLine();\n\t\t\tif(new BigInteger(nums).isProbablePrime(3)){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\n\t}",
"main",
"{\n\n\t\tStringBuilder buider = new StringBuilder();\n\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tString n = br.readLine();\n\n\t\tString nums;\n\n\t\tint count=0;\n\t\tfor(int i=0; i<Integer.parseInt(n); i++){\n\t\t\t nums = br.readLine();\n\t\t\tif(new BigInteger(nums).isProbablePrime(3)){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\n\t}",
"StringBuilder buider = new StringBuilder();",
"buider",
"new StringBuilder()",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"String n = br.readLine();",
"n",
"br.readLine()",
"br.readLine",
"br",
"String nums;",
"nums",
"int count=0;",
"count",
"0",
"for(int i=0; i<Integer.parseInt(n); i++){\n\t\t\t nums = br.readLine();\n\t\t\tif(new BigInteger(nums).isProbablePrime(3)){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<Integer.parseInt(n)",
"i",
"Integer.parseInt(n)",
"Integer.parseInt",
"Integer",
"n",
"i++",
"i++",
"i",
"{\n\t\t\t nums = br.readLine();\n\t\t\tif(new BigInteger(nums).isProbablePrime(3)){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"{\n\t\t\t nums = br.readLine();\n\t\t\tif(new BigInteger(nums).isProbablePrime(3)){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"nums = br.readLine()",
"nums",
"br.readLine()",
"br.readLine",
"br",
"if(new BigInteger(nums).isProbablePrime(3)){\n\t\t\t\tcount++;\n\t\t\t}",
"new BigInteger(nums).isProbablePrime(3)",
"new BigInteger(nums).isProbablePrime",
"new BigInteger(nums)",
"3",
"{\n\t\t\t\tcount++;\n\t\t\t}",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args"
] | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
class Main {
public static void main(String[] args) throws IOException {
StringBuilder buider = new StringBuilder();
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String n = br.readLine();
String nums;
int count=0;
for(int i=0; i<Integer.parseInt(n); i++){
nums = br.readLine();
if(new BigInteger(nums).isProbablePrime(3)){
count++;
}
}
System.out.println(count);
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
4,
13,
4,
18,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
17,
14,
2,
13,
17,
30,
29,
17,
14,
2,
2,
13,
17,
17,
30,
29,
17,
41,
13,
4,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
110,
5
],
[
110,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
20
],
[
20,
21
],
[
21,
22
],
[
22,
23
],
[
22,
24
],
[
20,
25
],
[
25,
26
],
[
25,
27
],
[
20,
28
],
[
28,
29
],
[
29,
30
],
[
20,
31
],
[
32,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
34,
36
],
[
36,
37
],
[
37,
38
],
[
33,
39
],
[
39,
40
],
[
40,
41
],
[
8,
42
],
[
42,
43
],
[
43,
44
],
[
44,
45
],
[
44,
46
],
[
42,
47
],
[
6,
48
],
[
48,
49
],
[
110,
50
],
[
50,
51
],
[
50,
52
],
[
52,
53
],
[
53,
54
],
[
54,
55
],
[
54,
56
],
[
53,
57
],
[
57,
58
],
[
58,
59
],
[
53,
60
],
[
60,
61
],
[
61,
62
],
[
61,
63
],
[
60,
64
],
[
64,
65
],
[
65,
66
],
[
60,
67
],
[
67,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
68,
72
],
[
67,
73
],
[
73,
74
],
[
74,
75
],
[
52,
76
],
[
76,
77
],
[
76,
78
],
[
78,
79
],
[
79,
80
],
[
78,
81
],
[
52,
82
],
[
82,
83
],
[
83,
84
],
[
84,
85
],
[
84,
86
],
[
82,
87
],
[
87,
88
],
[
87,
89
],
[
82,
90
],
[
90,
91
],
[
91,
92
],
[
91,
93
],
[
82,
94
],
[
95,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
98,
99
],
[
98,
100
],
[
97,
101
],
[
96,
102
],
[
102,
103
],
[
103,
104
],
[
52,
105
],
[
105,
106
],
[
50,
107
],
[
107,
108
],
[
0,
109
],
[
109,
110
],
[
109,
111
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int ans = 0;\n for (int i = 0; i < n; i++) {\n if (isPrime(sc.nextInt())) {\n ans++;\n }\n }\n System.out.println(ans);\n }\n\n private static boolean isPrime(int num) {\n if (num < 2) {\n return false;\n } else if (num == 2) {\n return true;\n } else if (num % 2 == 0) {\n return false;\n }\n double sqrtNum = Math.sqrt(num);\n for (int i = 3; i <= sqrtNum; i += 2) {\n if (num % i == 0) {\n return false;\n }\n }\n return true;\n }\n\n}\n",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int ans = 0;\n for (int i = 0; i < n; i++) {\n if (isPrime(sc.nextInt())) {\n ans++;\n }\n }\n System.out.println(ans);\n }\n\n private static boolean isPrime(int num) {\n if (num < 2) {\n return false;\n } else if (num == 2) {\n return true;\n } else if (num % 2 == 0) {\n return false;\n }\n double sqrtNum = Math.sqrt(num);\n for (int i = 3; i <= sqrtNum; i += 2) {\n if (num % i == 0) {\n return false;\n }\n }\n return true;\n }\n\n}",
"Main",
"public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int ans = 0;\n for (int i = 0; i < n; i++) {\n if (isPrime(sc.nextInt())) {\n ans++;\n }\n }\n System.out.println(ans);\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int ans = 0;\n for (int i = 0; i < n; i++) {\n if (isPrime(sc.nextInt())) {\n ans++;\n }\n }\n System.out.println(ans);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int ans = 0;",
"ans",
"0",
"for (int i = 0; i < n; i++) {\n if (isPrime(sc.nextInt())) {\n ans++;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n if (isPrime(sc.nextInt())) {\n ans++;\n }\n }",
"{\n if (isPrime(sc.nextInt())) {\n ans++;\n }\n }",
"if (isPrime(sc.nextInt())) {\n ans++;\n }",
"isPrime(sc.nextInt())",
"isPrime",
"sc.nextInt()",
"sc.nextInt",
"sc",
"{\n ans++;\n }",
"ans++",
"ans",
"System.out.println(ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"ans",
"String[] args",
"args",
"private static boolean isPrime(int num) {\n if (num < 2) {\n return false;\n } else if (num == 2) {\n return true;\n } else if (num % 2 == 0) {\n return false;\n }\n double sqrtNum = Math.sqrt(num);\n for (int i = 3; i <= sqrtNum; i += 2) {\n if (num % i == 0) {\n return false;\n }\n }\n return true;\n }",
"isPrime",
"{\n if (num < 2) {\n return false;\n } else if (num == 2) {\n return true;\n } else if (num % 2 == 0) {\n return false;\n }\n double sqrtNum = Math.sqrt(num);\n for (int i = 3; i <= sqrtNum; i += 2) {\n if (num % i == 0) {\n return false;\n }\n }\n return true;\n }",
"if (num < 2) {\n return false;\n } else if (num == 2) {\n return true;\n } else if (num % 2 == 0) {\n return false;\n }",
"num < 2",
"num",
"2",
"{\n return false;\n }",
"return false;",
"false",
"if (num == 2) {\n return true;\n } else if (num % 2 == 0) {\n return false;\n }",
"num == 2",
"num",
"2",
"{\n return true;\n }",
"return true;",
"true",
"if (num % 2 == 0) {\n return false;\n }",
"num % 2 == 0",
"num % 2",
"num",
"2",
"0",
"{\n return false;\n }",
"return false;",
"false",
"double sqrtNum = Math.sqrt(num);",
"sqrtNum",
"Math.sqrt(num)",
"Math.sqrt",
"Math",
"num",
"for (int i = 3; i <= sqrtNum; i += 2) {\n if (num % i == 0) {\n return false;\n }\n }",
"int i = 3;",
"int i = 3;",
"i",
"3",
"i <= sqrtNum",
"i",
"sqrtNum",
"i += 2",
"i += 2",
"i",
"2",
"{\n if (num % i == 0) {\n return false;\n }\n }",
"{\n if (num % i == 0) {\n return false;\n }\n }",
"if (num % i == 0) {\n return false;\n }",
"num % i == 0",
"num % i",
"num",
"i",
"0",
"{\n return false;\n }",
"return false;",
"false",
"return true;",
"true",
"int num",
"num",
"public class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int ans = 0;\n for (int i = 0; i < n; i++) {\n if (isPrime(sc.nextInt())) {\n ans++;\n }\n }\n System.out.println(ans);\n }\n\n private static boolean isPrime(int num) {\n if (num < 2) {\n return false;\n } else if (num == 2) {\n return true;\n } else if (num % 2 == 0) {\n return false;\n }\n double sqrtNum = Math.sqrt(num);\n for (int i = 3; i <= sqrtNum; i += 2) {\n if (num % i == 0) {\n return false;\n }\n }\n return true;\n }\n\n}",
"public class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int ans = 0;\n for (int i = 0; i < n; i++) {\n if (isPrime(sc.nextInt())) {\n ans++;\n }\n }\n System.out.println(ans);\n }\n\n private static boolean isPrime(int num) {\n if (num < 2) {\n return false;\n } else if (num == 2) {\n return true;\n } else if (num % 2 == 0) {\n return false;\n }\n double sqrtNum = Math.sqrt(num);\n for (int i = 3; i <= sqrtNum; i += 2) {\n if (num % i == 0) {\n return false;\n }\n }\n return true;\n }\n\n}",
"Main"
] | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int ans = 0;
for (int i = 0; i < n; i++) {
if (isPrime(sc.nextInt())) {
ans++;
}
}
System.out.println(ans);
}
private static boolean isPrime(int num) {
if (num < 2) {
return false;
} else if (num == 2) {
return true;
} else if (num % 2 == 0) {
return false;
}
double sqrtNum = Math.sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
return false;
}
}
return true;
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
17,
41,
13,
20,
13,
4,
13,
13,
13,
4,
13,
13,
23,
13,
12,
13,
30,
41,
13,
41,
13,
41,
13,
4,
18,
13,
13,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
17,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
18,
13,
13,
30,
11,
1,
0,
13,
2,
13,
13,
2,
13,
13,
1,
0,
13,
13,
30,
30,
0,
18,
13,
13,
17,
23,
13,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
41,
13,
17,
42,
2,
13,
17,
30,
0,
13,
4,
18,
13,
14,
18,
13,
13,
30,
40,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
8,
16
],
[
16,
17
],
[
16,
18
],
[
16,
19
],
[
8,
20
],
[
20,
21
],
[
20,
22
],
[
6,
23
],
[
23,
24
],
[
4,
25
],
[
25,
26
],
[
25,
27
],
[
27,
28
],
[
28,
29
],
[
27,
30
],
[
30,
31
],
[
27,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
35,
36
],
[
34,
37
],
[
27,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
38,
43
],
[
43,
44
],
[
43,
45
],
[
38,
46
],
[
46,
47
],
[
47,
48
],
[
38,
49
],
[
50,
50
],
[
50,
51
],
[
51,
52
],
[
52,
53
],
[
52,
54
],
[
51,
55
],
[
27,
56
],
[
56,
57
],
[
57,
58
],
[
58,
59
],
[
58,
60
],
[
56,
61
],
[
61,
62
],
[
61,
63
],
[
56,
64
],
[
64,
65
],
[
65,
66
],
[
56,
67
],
[
68,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
70,
72
],
[
69,
73
],
[
73,
74
],
[
74,
75
],
[
75,
76
],
[
76,
77
],
[
76,
78
],
[
78,
79
],
[
78,
80
],
[
74,
81
],
[
81,
82
],
[
81,
83
],
[
74,
84
],
[
84,
85
],
[
85,
86
],
[
85,
87
],
[
74,
88
],
[
89,
89
],
[
89,
90
],
[
90,
91
],
[
91,
92
],
[
91,
93
],
[
90,
94
],
[
25,
95
],
[
95,
96
],
[
25,
97
],
[
97,
98
],
[
4,
99
],
[
99,
100
],
[
99,
101
],
[
101,
102
],
[
102,
103
],
[
102,
104
],
[
101,
105
],
[
105,
106
],
[
105,
107
],
[
107,
108
],
[
108,
109
],
[
101,
110
],
[
110,
111
],
[
101,
112
],
[
112,
113
],
[
112,
114
],
[
101,
115
],
[
115,
116
],
[
116,
117
],
[
116,
118
],
[
115,
119
],
[
119,
120
],
[
120,
121
],
[
120,
122
],
[
122,
123
],
[
123,
124
],
[
119,
125
],
[
125,
126
],
[
126,
127
],
[
126,
128
],
[
125,
129
],
[
129,
130
],
[
130,
131
],
[
119,
132
],
[
132,
133
],
[
101,
134
],
[
134,
135
],
[
135,
136
],
[
136,
137
],
[
136,
138
],
[
134,
139
],
[
99,
140
],
[
140,
141
]
] | [
"import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String[] args){\n\t\tint max = 100000001;\n\t\tboolean [] x = new boolean[max];\n\t\t\n\t\tPrimeList(x, max);\n\t\t\n\t\tOutput(x);\n\t}\n\t\n\tprivate static void PrimeList (boolean x[], int max){\n\t\tint i;\n\t\tint j;\n\t\tdouble sqrt = Math.sqrt(max);\n\t\t\n\t\tfor (i = 2; i < max; i++){\n\t\t\tx[i] = true;\n\t\t}\n\t\t\n\t\tfor (i = 2; i < sqrt; i++){\n\t\t\tif (x[i]){\n\t\t\t\tfor (j = i + i; j < max; j += i){\n\t\t\t\t\tx[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\tprivate static void Output(boolean x[]){\n\t\tScanner cin = new Scanner(System.in);\n\t\tint n = cin.nextInt();\n\t\tint a;\n\t\tint count = 0;\n\t\t\n\t\twhile (n > 0){\n\t\t\ta = cin.nextInt();\n\t\t\tif (x[a]){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tn--;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"class Main {\n\tpublic static void main(String[] args){\n\t\tint max = 100000001;\n\t\tboolean [] x = new boolean[max];\n\t\t\n\t\tPrimeList(x, max);\n\t\t\n\t\tOutput(x);\n\t}\n\t\n\tprivate static void PrimeList (boolean x[], int max){\n\t\tint i;\n\t\tint j;\n\t\tdouble sqrt = Math.sqrt(max);\n\t\t\n\t\tfor (i = 2; i < max; i++){\n\t\t\tx[i] = true;\n\t\t}\n\t\t\n\t\tfor (i = 2; i < sqrt; i++){\n\t\t\tif (x[i]){\n\t\t\t\tfor (j = i + i; j < max; j += i){\n\t\t\t\t\tx[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\tprivate static void Output(boolean x[]){\n\t\tScanner cin = new Scanner(System.in);\n\t\tint n = cin.nextInt();\n\t\tint a;\n\t\tint count = 0;\n\t\t\n\t\twhile (n > 0){\n\t\t\ta = cin.nextInt();\n\t\t\tif (x[a]){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tn--;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}",
"Main",
"public static void main(String[] args){\n\t\tint max = 100000001;\n\t\tboolean [] x = new boolean[max];\n\t\t\n\t\tPrimeList(x, max);\n\t\t\n\t\tOutput(x);\n\t}",
"main",
"{\n\t\tint max = 100000001;\n\t\tboolean [] x = new boolean[max];\n\t\t\n\t\tPrimeList(x, max);\n\t\t\n\t\tOutput(x);\n\t}",
"int max = 100000001;",
"max",
"100000001",
"boolean [] x = new boolean[max];",
"x",
"new boolean[max]",
"max",
"PrimeList(x, max)",
"PrimeList",
"x",
"max",
"Output(x)",
"Output",
"x",
"String[] args",
"args",
"private static void PrimeList (boolean x[], int max){\n\t\tint i;\n\t\tint j;\n\t\tdouble sqrt = Math.sqrt(max);\n\t\t\n\t\tfor (i = 2; i < max; i++){\n\t\t\tx[i] = true;\n\t\t}\n\t\t\n\t\tfor (i = 2; i < sqrt; i++){\n\t\t\tif (x[i]){\n\t\t\t\tfor (j = i + i; j < max; j += i){\n\t\t\t\t\tx[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}",
"PrimeList",
"{\n\t\tint i;\n\t\tint j;\n\t\tdouble sqrt = Math.sqrt(max);\n\t\t\n\t\tfor (i = 2; i < max; i++){\n\t\t\tx[i] = true;\n\t\t}\n\t\t\n\t\tfor (i = 2; i < sqrt; i++){\n\t\t\tif (x[i]){\n\t\t\t\tfor (j = i + i; j < max; j += i){\n\t\t\t\t\tx[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}",
"int i;",
"i",
"int j;",
"j",
"double sqrt = Math.sqrt(max);",
"sqrt",
"Math.sqrt(max)",
"Math.sqrt",
"Math",
"max",
"for (i = 2; i < max; i++){\n\t\t\tx[i] = true;\n\t\t}",
"i = 2;",
"i = 2",
"i",
"2",
"i < max",
"i",
"max",
"i++",
"i++",
"i",
"{\n\t\t\tx[i] = true;\n\t\t}",
"{\n\t\t\tx[i] = true;\n\t\t}",
"x[i] = true",
"x[i]",
"x",
"i",
"true",
"for (i = 2; i < sqrt; i++){\n\t\t\tif (x[i]){\n\t\t\t\tfor (j = i + i; j < max; j += i){\n\t\t\t\t\tx[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"i = 2;",
"i = 2",
"i",
"2",
"i < sqrt",
"i",
"sqrt",
"i++",
"i++",
"i",
"{\n\t\t\tif (x[i]){\n\t\t\t\tfor (j = i + i; j < max; j += i){\n\t\t\t\t\tx[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"{\n\t\t\tif (x[i]){\n\t\t\t\tfor (j = i + i; j < max; j += i){\n\t\t\t\t\tx[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"if (x[i]){\n\t\t\t\tfor (j = i + i; j < max; j += i){\n\t\t\t\t\tx[j] = false;\n\t\t\t\t}\n\t\t\t}",
"x[i]",
"x",
"i",
"{\n\t\t\t\tfor (j = i + i; j < max; j += i){\n\t\t\t\t\tx[j] = false;\n\t\t\t\t}\n\t\t\t}",
"for (j = i + i; j < max; j += i){\n\t\t\t\t\tx[j] = false;\n\t\t\t\t}",
"j = i + i;",
"j = i + i",
"j",
"i + i",
"i",
"i",
"j < max",
"j",
"max",
"j += i",
"j += i",
"j",
"i",
"{\n\t\t\t\t\tx[j] = false;\n\t\t\t\t}",
"{\n\t\t\t\t\tx[j] = false;\n\t\t\t\t}",
"x[j] = false",
"x[j]",
"x",
"j",
"false",
"boolean x[]",
"x",
"int max",
"max",
"private static void Output(boolean x[]){\n\t\tScanner cin = new Scanner(System.in);\n\t\tint n = cin.nextInt();\n\t\tint a;\n\t\tint count = 0;\n\t\t\n\t\twhile (n > 0){\n\t\t\ta = cin.nextInt();\n\t\t\tif (x[a]){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tn--;\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"Output",
"{\n\t\tScanner cin = new Scanner(System.in);\n\t\tint n = cin.nextInt();\n\t\tint a;\n\t\tint count = 0;\n\t\t\n\t\twhile (n > 0){\n\t\t\ta = cin.nextInt();\n\t\t\tif (x[a]){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tn--;\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"Scanner cin = new Scanner(System.in);",
"cin",
"new Scanner(System.in)",
"int n = cin.nextInt();",
"n",
"cin.nextInt()",
"cin.nextInt",
"cin",
"int a;",
"a",
"int count = 0;",
"count",
"0",
"while (n > 0){\n\t\t\ta = cin.nextInt();\n\t\t\tif (x[a]){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tn--;\n\t\t}",
"n > 0",
"n",
"0",
"{\n\t\t\ta = cin.nextInt();\n\t\t\tif (x[a]){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tn--;\n\t\t}",
"a = cin.nextInt()",
"a",
"cin.nextInt()",
"cin.nextInt",
"cin",
"if (x[a]){\n\t\t\t\tcount++;\n\t\t\t}",
"x[a]",
"x",
"a",
"{\n\t\t\t\tcount++;\n\t\t\t}",
"count++",
"count",
"n--",
"n",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"boolean x[]",
"x"
] | import java.util.Scanner;
class Main {
public static void main(String[] args){
int max = 100000001;
boolean [] x = new boolean[max];
PrimeList(x, max);
Output(x);
}
private static void PrimeList (boolean x[], int max){
int i;
int j;
double sqrt = Math.sqrt(max);
for (i = 2; i < max; i++){
x[i] = true;
}
for (i = 2; i < sqrt; i++){
if (x[i]){
for (j = i + i; j < max; j += i){
x[j] = false;
}
}
}
}
private static void Output(boolean x[]){
Scanner cin = new Scanner(System.in);
int n = cin.nextInt();
int a;
int count = 0;
while (n > 0){
a = cin.nextInt();
if (x[a]){
count++;
}
n--;
}
System.out.println(count);
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
17,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
4,
18,
13,
14,
4,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
17,
14,
2,
2,
13,
17,
17,
30,
29,
17,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
117,
11
],
[
117,
12
],
[
12,
13
],
[
12,
14
],
[
117,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
18,
20
],
[
17,
21
],
[
21,
22
],
[
21,
23
],
[
23,
24
],
[
24,
25
],
[
23,
26
],
[
26,
27
],
[
27,
28
],
[
17,
29
],
[
29,
30
],
[
29,
31
],
[
17,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
34,
36
],
[
32,
37
],
[
37,
38
],
[
37,
39
],
[
32,
40
],
[
40,
41
],
[
41,
42
],
[
32,
43
],
[
44,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
47,
48
],
[
48,
49
],
[
47,
50
],
[
50,
51
],
[
51,
52
],
[
44,
53
],
[
53,
54
],
[
54,
55
],
[
54,
56
],
[
53,
57
],
[
57,
58
],
[
58,
59
],
[
17,
60
],
[
60,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
60,
65
],
[
15,
66
],
[
66,
67
],
[
117,
68
],
[
68,
69
],
[
68,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
71,
75
],
[
75,
76
],
[
76,
77
],
[
71,
78
],
[
78,
79
],
[
79,
80
],
[
80,
81
],
[
80,
82
],
[
79,
83
],
[
78,
84
],
[
84,
85
],
[
85,
86
],
[
70,
87
],
[
87,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
87,
92
],
[
92,
93
],
[
93,
94
],
[
93,
95
],
[
92,
96
],
[
87,
97
],
[
97,
98
],
[
98,
99
],
[
98,
100
],
[
87,
101
],
[
102,
102
],
[
102,
103
],
[
103,
104
],
[
104,
105
],
[
105,
106
],
[
105,
107
],
[
104,
108
],
[
103,
109
],
[
109,
110
],
[
110,
111
],
[
70,
112
],
[
112,
113
],
[
68,
114
],
[
114,
115
],
[
0,
116
],
[
116,
117
],
[
116,
118
]
] | [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n private static final int SIZE = 10000000;\n\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int count = 0;\n for (int i = 0; i < n; i++) {\n long p = Long.parseLong(br.readLine());\n if (prime(p)) {\n count++;\n }\n }\n System.out.println(count);\n }\n\n static boolean prime(long n) {\n if (n == 2) {\n return true;\n } else if (n % 2 == 0) {\n return false;\n }\n for (int i = 3; i * i <= n; i += 2) {\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n }\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"public class Main {\n private static final int SIZE = 10000000;\n\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int count = 0;\n for (int i = 0; i < n; i++) {\n long p = Long.parseLong(br.readLine());\n if (prime(p)) {\n count++;\n }\n }\n System.out.println(count);\n }\n\n static boolean prime(long n) {\n if (n == 2) {\n return true;\n } else if (n % 2 == 0) {\n return false;\n }\n for (int i = 3; i * i <= n; i += 2) {\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n }\n}",
"Main",
"private static final int SIZE = 10000000;",
"SIZE",
"10000000",
"public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int count = 0;\n for (int i = 0; i < n; i++) {\n long p = Long.parseLong(br.readLine());\n if (prime(p)) {\n count++;\n }\n }\n System.out.println(count);\n }",
"main",
"{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int count = 0;\n for (int i = 0; i < n; i++) {\n long p = Long.parseLong(br.readLine());\n if (prime(p)) {\n count++;\n }\n }\n System.out.println(count);\n }",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"int n = Integer.parseInt(br.readLine());",
"n",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"int count = 0;",
"count",
"0",
"for (int i = 0; i < n; i++) {\n long p = Long.parseLong(br.readLine());\n if (prime(p)) {\n count++;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n long p = Long.parseLong(br.readLine());\n if (prime(p)) {\n count++;\n }\n }",
"{\n long p = Long.parseLong(br.readLine());\n if (prime(p)) {\n count++;\n }\n }",
"long p = Long.parseLong(br.readLine());",
"p",
"Long.parseLong(br.readLine())",
"Long.parseLong",
"Long",
"br.readLine()",
"br.readLine",
"br",
"if (prime(p)) {\n count++;\n }",
"prime(p)",
"prime",
"p",
"{\n count++;\n }",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"static boolean prime(long n) {\n if (n == 2) {\n return true;\n } else if (n % 2 == 0) {\n return false;\n }\n for (int i = 3; i * i <= n; i += 2) {\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n }",
"prime",
"{\n if (n == 2) {\n return true;\n } else if (n % 2 == 0) {\n return false;\n }\n for (int i = 3; i * i <= n; i += 2) {\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n }",
"if (n == 2) {\n return true;\n } else if (n % 2 == 0) {\n return false;\n }",
"n == 2",
"n",
"2",
"{\n return true;\n }",
"return true;",
"true",
"if (n % 2 == 0) {\n return false;\n }",
"n % 2 == 0",
"n % 2",
"n",
"2",
"0",
"{\n return false;\n }",
"return false;",
"false",
"for (int i = 3; i * i <= n; i += 2) {\n if (n % i == 0) {\n return false;\n }\n }",
"int i = 3;",
"int i = 3;",
"i",
"3",
"i * i <= n",
"i * i",
"i",
"i",
"n",
"i += 2",
"i += 2",
"i",
"2",
"{\n if (n % i == 0) {\n return false;\n }\n }",
"{\n if (n % i == 0) {\n return false;\n }\n }",
"if (n % i == 0) {\n return false;\n }",
"n % i == 0",
"n % i",
"n",
"i",
"0",
"{\n return false;\n }",
"return false;",
"false",
"return true;",
"true",
"long n",
"n",
"public class Main {\n private static final int SIZE = 10000000;\n\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int count = 0;\n for (int i = 0; i < n; i++) {\n long p = Long.parseLong(br.readLine());\n if (prime(p)) {\n count++;\n }\n }\n System.out.println(count);\n }\n\n static boolean prime(long n) {\n if (n == 2) {\n return true;\n } else if (n % 2 == 0) {\n return false;\n }\n for (int i = 3; i * i <= n; i += 2) {\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n }\n}",
"public class Main {\n private static final int SIZE = 10000000;\n\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int count = 0;\n for (int i = 0; i < n; i++) {\n long p = Long.parseLong(br.readLine());\n if (prime(p)) {\n count++;\n }\n }\n System.out.println(count);\n }\n\n static boolean prime(long n) {\n if (n == 2) {\n return true;\n } else if (n % 2 == 0) {\n return false;\n }\n for (int i = 3; i * i <= n; i += 2) {\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n }\n}",
"Main"
] | 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.parseInt(br.readLine());
int count = 0;
for (int i = 0; i < n; i++) {
long p = Long.parseLong(br.readLine());
if (prime(p)) {
count++;
}
}
System.out.println(count);
}
static boolean prime(long n) {
if (n == 2) {
return true;
} else if (n % 2 == 0) {
return false;
}
for (int i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
return false;
}
}
return true;
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
17,
41,
13,
20,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
14,
4,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
41,
13,
4,
18,
13,
4,
18,
13,
13,
14,
2,
13,
17,
30,
29,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
17,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
8,
15
],
[
15,
16
],
[
15,
17
],
[
8,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
8,
23
],
[
23,
24
],
[
24,
25
],
[
25,
26
],
[
25,
27
],
[
23,
28
],
[
28,
29
],
[
28,
30
],
[
23,
31
],
[
31,
32
],
[
32,
33
],
[
23,
34
],
[
35,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
35,
41
],
[
41,
42
],
[
42,
43
],
[
42,
44
],
[
41,
45
],
[
45,
46
],
[
46,
47
],
[
8,
48
],
[
48,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
48,
53
],
[
6,
54
],
[
54,
55
],
[
4,
56
],
[
56,
57
],
[
56,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
61,
62
],
[
62,
63
],
[
61,
64
],
[
64,
65
],
[
65,
66
],
[
64,
67
],
[
58,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
68,
72
],
[
72,
73
],
[
73,
74
],
[
58,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
77,
79
],
[
75,
80
],
[
80,
81
],
[
80,
82
],
[
75,
83
],
[
83,
84
],
[
84,
85
],
[
75,
86
],
[
87,
87
],
[
87,
88
],
[
88,
89
],
[
89,
90
],
[
90,
91
],
[
90,
92
],
[
89,
93
],
[
88,
94
],
[
94,
95
],
[
95,
96
],
[
58,
97
],
[
97,
98
],
[
56,
99
],
[
99,
100
]
] | [
"import java.util.*;\n\nclass Main {\n\tpublic static void main(String args[]){\n\t\tArrayList<Integer> ar = new ArrayList<Integer>();\n\t\tint cnt = 0;\n\t\tScanner sc = new Scanner(System.in);\n\t\tint size = sc.nextInt();\n\t\tfor(int i = 0;i < size;i++){\n\t\t\tint num = sc.nextInt();\n\t\t\tif(hantei(num)){\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}\n\t\n\t\n\tprivate static boolean hantei(int x){\n\t\tint n = (int) Math.ceil(Math.sqrt((double)x));\n\t\tif(x == 2){\n\t\t\treturn true;\n\t\t}\n\t\tfor(int j = 2;j <= n;j++){\n\t\t\tif(x % j == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\t\n\t}\n\t\n}",
"import java.util.*;",
"util.*",
"java",
"class Main {\n\tpublic static void main(String args[]){\n\t\tArrayList<Integer> ar = new ArrayList<Integer>();\n\t\tint cnt = 0;\n\t\tScanner sc = new Scanner(System.in);\n\t\tint size = sc.nextInt();\n\t\tfor(int i = 0;i < size;i++){\n\t\t\tint num = sc.nextInt();\n\t\t\tif(hantei(num)){\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}\n\t\n\t\n\tprivate static boolean hantei(int x){\n\t\tint n = (int) Math.ceil(Math.sqrt((double)x));\n\t\tif(x == 2){\n\t\t\treturn true;\n\t\t}\n\t\tfor(int j = 2;j <= n;j++){\n\t\t\tif(x % j == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\t\n\t}\n\t\n}",
"Main",
"public static void main(String args[]){\n\t\tArrayList<Integer> ar = new ArrayList<Integer>();\n\t\tint cnt = 0;\n\t\tScanner sc = new Scanner(System.in);\n\t\tint size = sc.nextInt();\n\t\tfor(int i = 0;i < size;i++){\n\t\t\tint num = sc.nextInt();\n\t\t\tif(hantei(num)){\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}",
"main",
"{\n\t\tArrayList<Integer> ar = new ArrayList<Integer>();\n\t\tint cnt = 0;\n\t\tScanner sc = new Scanner(System.in);\n\t\tint size = sc.nextInt();\n\t\tfor(int i = 0;i < size;i++){\n\t\t\tint num = sc.nextInt();\n\t\t\tif(hantei(num)){\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}",
"ArrayList<Integer> ar = new ArrayList<Integer>();",
"ar",
"new ArrayList<Integer>()",
"int cnt = 0;",
"cnt",
"0",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int size = sc.nextInt();",
"size",
"sc.nextInt()",
"sc.nextInt",
"sc",
"for(int i = 0;i < size;i++){\n\t\t\tint num = sc.nextInt();\n\t\t\tif(hantei(num)){\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < size",
"i",
"size",
"i++",
"i++",
"i",
"{\n\t\t\tint num = sc.nextInt();\n\t\t\tif(hantei(num)){\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}",
"{\n\t\t\tint num = sc.nextInt();\n\t\t\tif(hantei(num)){\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}",
"int num = sc.nextInt();",
"num",
"sc.nextInt()",
"sc.nextInt",
"sc",
"if(hantei(num)){\n\t\t\t\tcnt++;\n\t\t\t}",
"hantei(num)",
"hantei",
"num",
"{\n\t\t\t\tcnt++;\n\t\t\t}",
"cnt++",
"cnt",
"System.out.println(cnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"String args[]",
"args",
"private static boolean hantei(int x){\n\t\tint n = (int) Math.ceil(Math.sqrt((double)x));\n\t\tif(x == 2){\n\t\t\treturn true;\n\t\t}\n\t\tfor(int j = 2;j <= n;j++){\n\t\t\tif(x % j == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\t\n\t}",
"hantei",
"{\n\t\tint n = (int) Math.ceil(Math.sqrt((double)x));\n\t\tif(x == 2){\n\t\t\treturn true;\n\t\t}\n\t\tfor(int j = 2;j <= n;j++){\n\t\t\tif(x % j == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\t\n\t}",
"int n = (int) Math.ceil(Math.sqrt((double)x));",
"n",
"(int) Math.ceil(Math.sqrt((double)x))",
"Math.ceil",
"Math",
"Math.sqrt((double)x)",
"Math.sqrt",
"Math",
"(double)x",
"if(x == 2){\n\t\t\treturn true;\n\t\t}",
"x == 2",
"x",
"2",
"{\n\t\t\treturn true;\n\t\t}",
"return true;",
"true",
"for(int j = 2;j <= n;j++){\n\t\t\tif(x % j == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}",
"int j = 2;",
"int j = 2;",
"j",
"2",
"j <= n",
"j",
"n",
"j++",
"j++",
"j",
"{\n\t\t\tif(x % j == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}",
"{\n\t\t\tif(x % j == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}",
"if(x % j == 0){\n\t\t\t\treturn false;\n\t\t\t}",
"x % j == 0",
"x % j",
"x",
"j",
"0",
"{\n\t\t\t\treturn false;\n\t\t\t}",
"return false;",
"false",
"return true;",
"true",
"int x",
"x"
] | import java.util.*;
class Main {
public static void main(String args[]){
ArrayList<Integer> ar = new ArrayList<Integer>();
int cnt = 0;
Scanner sc = new Scanner(System.in);
int size = sc.nextInt();
for(int i = 0;i < size;i++){
int num = sc.nextInt();
if(hantei(num)){
cnt++;
}
}
System.out.println(cnt);
}
private static boolean hantei(int x){
int n = (int) Math.ceil(Math.sqrt((double)x));
if(x == 2){
return true;
}
for(int j = 2;j <= n;j++){
if(x % j == 0){
return false;
}
}
return true;
}
} |
[
7,
15,
13,
17,
6,
13,
41,
13,
20,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
4,
18,
13,
14,
4,
13,
13,
40,
13,
4,
18,
13,
13,
4,
18,
13,
23,
13,
12,
13,
30,
14,
2,
2,
2,
2,
13,
17,
2,
13,
17,
2,
13,
17,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
17,
29,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
29,
17,
29,
17,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
4,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
11,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
17,
20
],
[
20,
21
],
[
21,
22
],
[
11,
23
],
[
23,
24
],
[
23,
25
],
[
11,
26
],
[
26,
27
],
[
27,
28
],
[
28,
29
],
[
28,
30
],
[
26,
31
],
[
31,
32
],
[
31,
33
],
[
26,
34
],
[
34,
35
],
[
35,
36
],
[
26,
37
],
[
38,
38
],
[
38,
39
],
[
39,
40
],
[
39,
41
],
[
41,
42
],
[
42,
43
],
[
41,
44
],
[
44,
45
],
[
45,
46
],
[
38,
47
],
[
47,
48
],
[
48,
49
],
[
48,
50
],
[
47,
51
],
[
51,
52
],
[
11,
53
],
[
53,
54
],
[
54,
55
],
[
53,
56
],
[
11,
57
],
[
57,
58
],
[
58,
59
],
[
9,
60
],
[
60,
61
],
[
4,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
65,
66
],
[
68,
67
],
[
75,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
68,
72
],
[
72,
73
],
[
72,
74
],
[
75,
75
],
[
75,
76
],
[
75,
77
],
[
68,
78
],
[
78,
79
],
[
78,
80
],
[
65,
81
],
[
81,
82
],
[
64,
83
],
[
83,
84
],
[
84,
85
],
[
85,
86
],
[
85,
87
],
[
84,
88
],
[
83,
89
],
[
89,
90
],
[
64,
91
],
[
91,
92
],
[
92,
93
],
[
93,
94
],
[
93,
95
],
[
91,
96
],
[
96,
97
],
[
96,
98
],
[
98,
99
],
[
99,
100
],
[
98,
101
],
[
91,
102
],
[
102,
103
],
[
103,
104
],
[
91,
105
],
[
106,
106
],
[
106,
107
],
[
107,
108
],
[
108,
109
],
[
109,
110
],
[
109,
111
],
[
108,
112
],
[
107,
113
],
[
113,
114
],
[
64,
115
],
[
115,
116
],
[
62,
117
],
[
117,
118
]
] | [
"import java.io.*;\n\nclass Main{\n\nstatic final PrintWriter out=new PrintWriter(System.out);\n\npublic static void main(String[] args) throws IOException{\nBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\nint n=Integer.parseInt(br.readLine());\nint ans=0;\nfor(int i=0;i<n;i++){\nint a=Integer.parseInt(br.readLine());\nif(isPrime(a)) ans++;\n}\nout.println(ans);\nout.flush();\n}\n\nprivate static boolean isPrime(int a){\nif(a==2||a==3||a==5||a==7) return true;\nif(a%2==0) return false;\nfor(int i=3;i<=Math.sqrt(a);i++){\nif(a%i==0) return false;\n}\nreturn true;\n}\n}",
"import java.io.*;",
"io.*",
"java",
"class Main{\n\nstatic final PrintWriter out=new PrintWriter(System.out);\n\npublic static void main(String[] args) throws IOException{\nBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\nint n=Integer.parseInt(br.readLine());\nint ans=0;\nfor(int i=0;i<n;i++){\nint a=Integer.parseInt(br.readLine());\nif(isPrime(a)) ans++;\n}\nout.println(ans);\nout.flush();\n}\n\nprivate static boolean isPrime(int a){\nif(a==2||a==3||a==5||a==7) return true;\nif(a%2==0) return false;\nfor(int i=3;i<=Math.sqrt(a);i++){\nif(a%i==0) return false;\n}\nreturn true;\n}\n}",
"Main",
"static final PrintWriter out=new PrintWriter(System.out);",
"out",
"new PrintWriter(System.out)",
"public static void main(String[] args) throws IOException{\nBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\nint n=Integer.parseInt(br.readLine());\nint ans=0;\nfor(int i=0;i<n;i++){\nint a=Integer.parseInt(br.readLine());\nif(isPrime(a)) ans++;\n}\nout.println(ans);\nout.flush();\n}",
"main",
"{\nBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\nint n=Integer.parseInt(br.readLine());\nint ans=0;\nfor(int i=0;i<n;i++){\nint a=Integer.parseInt(br.readLine());\nif(isPrime(a)) ans++;\n}\nout.println(ans);\nout.flush();\n}",
"BufferedReader br=new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"int n=Integer.parseInt(br.readLine());",
"n",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"int ans=0;",
"ans",
"0",
"for(int i=0;i<n;i++){\nint a=Integer.parseInt(br.readLine());\nif(isPrime(a)) ans++;\n}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\nint a=Integer.parseInt(br.readLine());\nif(isPrime(a)) ans++;\n}",
"{\nint a=Integer.parseInt(br.readLine());\nif(isPrime(a)) ans++;\n}",
"int a=Integer.parseInt(br.readLine());",
"a",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"if(isPrime(a)) ans++;",
"isPrime(a)",
"isPrime",
"a",
"ans++",
"ans",
"out.println(ans)",
"out.println",
"out",
"ans",
"out.flush()",
"out.flush",
"out",
"String[] args",
"args",
"private static boolean isPrime(int a){\nif(a==2||a==3||a==5||a==7) return true;\nif(a%2==0) return false;\nfor(int i=3;i<=Math.sqrt(a);i++){\nif(a%i==0) return false;\n}\nreturn true;\n}",
"isPrime",
"{\nif(a==2||a==3||a==5||a==7) return true;\nif(a%2==0) return false;\nfor(int i=3;i<=Math.sqrt(a);i++){\nif(a%i==0) return false;\n}\nreturn true;\n}",
"if(a==2||a==3||a==5||a==7) return true;",
"a==2||a==3||a==5||a==7",
"a==5",
"a==2||a==3||a==5||a==7",
"a==2",
"a",
"2",
"a==3",
"a",
"3",
"a==5",
"a",
"5",
"a==7",
"a",
"7",
"return true;",
"true",
"if(a%2==0) return false;",
"a%2==0",
"a%2",
"a",
"2",
"0",
"return false;",
"false",
"for(int i=3;i<=Math.sqrt(a);i++){\nif(a%i==0) return false;\n}",
"int i=3;",
"int i=3;",
"i",
"3",
"i<=Math.sqrt(a)",
"i",
"Math.sqrt(a)",
"Math.sqrt",
"Math",
"a",
"i++",
"i++",
"i",
"{\nif(a%i==0) return false;\n}",
"{\nif(a%i==0) return false;\n}",
"if(a%i==0) return false;",
"a%i==0",
"a%i",
"a",
"i",
"0",
"return false;",
"false",
"return true;",
"true",
"int a",
"a"
] | import java.io.*;
class Main{
static final PrintWriter out=new PrintWriter(System.out);
public static void main(String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int n=Integer.parseInt(br.readLine());
int ans=0;
for(int i=0;i<n;i++){
int a=Integer.parseInt(br.readLine());
if(isPrime(a)) ans++;
}
out.println(ans);
out.flush();
}
private static boolean isPrime(int a){
if(a==2||a==3||a==5||a==7) return true;
if(a%2==0) return false;
for(int i=3;i<=Math.sqrt(a);i++){
if(a%i==0) return false;
}
return true;
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
14,
4,
13,
18,
13,
13,
30,
0,
13,
17,
4,
18,
18,
13,
13,
13,
4,
18,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
17,
14,
2,
2,
13,
17,
2,
2,
13,
17,
17,
30,
29,
17,
41,
13,
17,
42,
2,
13,
4,
18,
13,
13,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
0,
13,
17,
29,
17,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
21
],
[
21,
22
],
[
21,
23
],
[
8,
24
],
[
24,
25
],
[
25,
26
],
[
26,
27
],
[
26,
28
],
[
24,
29
],
[
29,
30
],
[
29,
31
],
[
24,
32
],
[
32,
33
],
[
33,
34
],
[
24,
35
],
[
36,
36
],
[
36,
37
],
[
37,
38
],
[
38,
39
],
[
38,
40
],
[
37,
41
],
[
41,
42
],
[
42,
43
],
[
36,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
47,
48
],
[
47,
49
],
[
44,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
8,
54
],
[
54,
55
],
[
55,
56
],
[
56,
57
],
[
56,
58
],
[
54,
59
],
[
8,
60
],
[
60,
61
],
[
61,
62
],
[
6,
63
],
[
63,
64
],
[
4,
65
],
[
65,
66
],
[
65,
67
],
[
67,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
68,
72
],
[
72,
73
],
[
73,
74
],
[
67,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
77,
79
],
[
76,
80
],
[
80,
81
],
[
81,
82
],
[
81,
83
],
[
80,
84
],
[
75,
85
],
[
85,
86
],
[
86,
87
],
[
67,
88
],
[
88,
89
],
[
88,
90
],
[
67,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
94,
95
],
[
95,
96
],
[
94,
97
],
[
91,
98
],
[
98,
99
],
[
99,
100
],
[
100,
101
],
[
101,
102
],
[
101,
103
],
[
100,
104
],
[
99,
105
],
[
105,
106
],
[
106,
107
],
[
98,
108
],
[
108,
109
],
[
108,
110
],
[
67,
111
],
[
111,
112
],
[
65,
113
],
[
113,
114
]
] | [
"import java.util.Scanner;\n\nclass Main {\n\n\tpublic static void main(String args[]) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint num = scan.nextInt();\n\t\tint[] array = new int[num];\n\t\tint count = 0;\n\n\t\tfor (int i = 0; i < num; i++) {\n\t\t\tarray[i] = scan.nextInt();\n\t\t\tif(isprime(array[i])) {\n\t\t\t\tcount+=1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\n\t\tscan.close();\n\t}\n\n\tprivate static boolean isprime(int x) {\n\t\tif (x == 2) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (x < 2 || x % 2 == 0) {\n\t\t\treturn false;\n\t\t}\n\t\tint i = 3;\n\t\twhile (i <= Math.sqrt(x)) {\n\t\t\tif (x % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti += 2;\n\t\t}\n\t\treturn true;\n\t}\n\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"class Main {\n\n\tpublic static void main(String args[]) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint num = scan.nextInt();\n\t\tint[] array = new int[num];\n\t\tint count = 0;\n\n\t\tfor (int i = 0; i < num; i++) {\n\t\t\tarray[i] = scan.nextInt();\n\t\t\tif(isprime(array[i])) {\n\t\t\t\tcount+=1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\n\t\tscan.close();\n\t}\n\n\tprivate static boolean isprime(int x) {\n\t\tif (x == 2) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (x < 2 || x % 2 == 0) {\n\t\t\treturn false;\n\t\t}\n\t\tint i = 3;\n\t\twhile (i <= Math.sqrt(x)) {\n\t\t\tif (x % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti += 2;\n\t\t}\n\t\treturn true;\n\t}\n\n}",
"Main",
"public static void main(String args[]) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint num = scan.nextInt();\n\t\tint[] array = new int[num];\n\t\tint count = 0;\n\n\t\tfor (int i = 0; i < num; i++) {\n\t\t\tarray[i] = scan.nextInt();\n\t\t\tif(isprime(array[i])) {\n\t\t\t\tcount+=1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\n\t\tscan.close();\n\t}",
"main",
"{\n\t\tScanner scan = new Scanner(System.in);\n\t\tint num = scan.nextInt();\n\t\tint[] array = new int[num];\n\t\tint count = 0;\n\n\t\tfor (int i = 0; i < num; i++) {\n\t\t\tarray[i] = scan.nextInt();\n\t\t\tif(isprime(array[i])) {\n\t\t\t\tcount+=1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\n\t\tscan.close();\n\t}",
"Scanner scan = new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"int num = scan.nextInt();",
"num",
"scan.nextInt()",
"scan.nextInt",
"scan",
"int[] array = new int[num];",
"array",
"new int[num]",
"num",
"int count = 0;",
"count",
"0",
"for (int i = 0; i < num; i++) {\n\t\t\tarray[i] = scan.nextInt();\n\t\t\tif(isprime(array[i])) {\n\t\t\t\tcount+=1;\n\t\t\t}\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < num",
"i",
"num",
"i++",
"i++",
"i",
"{\n\t\t\tarray[i] = scan.nextInt();\n\t\t\tif(isprime(array[i])) {\n\t\t\t\tcount+=1;\n\t\t\t}\n\t\t}",
"{\n\t\t\tarray[i] = scan.nextInt();\n\t\t\tif(isprime(array[i])) {\n\t\t\t\tcount+=1;\n\t\t\t}\n\t\t}",
"array[i] = scan.nextInt()",
"array[i]",
"array",
"i",
"scan.nextInt()",
"scan.nextInt",
"scan",
"if(isprime(array[i])) {\n\t\t\t\tcount+=1;\n\t\t\t}",
"isprime(array[i])",
"isprime",
"array[i]",
"array",
"i",
"{\n\t\t\t\tcount+=1;\n\t\t\t}",
"count+=1",
"count",
"1",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"scan.close()",
"scan.close",
"scan",
"String args[]",
"args",
"private static boolean isprime(int x) {\n\t\tif (x == 2) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (x < 2 || x % 2 == 0) {\n\t\t\treturn false;\n\t\t}\n\t\tint i = 3;\n\t\twhile (i <= Math.sqrt(x)) {\n\t\t\tif (x % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti += 2;\n\t\t}\n\t\treturn true;\n\t}",
"isprime",
"{\n\t\tif (x == 2) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (x < 2 || x % 2 == 0) {\n\t\t\treturn false;\n\t\t}\n\t\tint i = 3;\n\t\twhile (i <= Math.sqrt(x)) {\n\t\t\tif (x % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti += 2;\n\t\t}\n\t\treturn true;\n\t}",
"if (x == 2) {\n\t\t\treturn true;\n\t\t}",
"x == 2",
"x",
"2",
"{\n\t\t\treturn true;\n\t\t}",
"return true;",
"true",
"if (x < 2 || x % 2 == 0) {\n\t\t\treturn false;\n\t\t}",
"x < 2 || x % 2 == 0",
"x < 2",
"x",
"2",
"x % 2 == 0",
"x % 2",
"x",
"2",
"0",
"{\n\t\t\treturn false;\n\t\t}",
"return false;",
"false",
"int i = 3;",
"i",
"3",
"while (i <= Math.sqrt(x)) {\n\t\t\tif (x % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti += 2;\n\t\t}",
"i <= Math.sqrt(x)",
"i",
"Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"{\n\t\t\tif (x % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti += 2;\n\t\t}",
"if (x % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}",
"x % i == 0",
"x % i",
"x",
"i",
"0",
"{\n\t\t\t\treturn false;\n\t\t\t}",
"return false;",
"false",
"i += 2",
"i",
"2",
"return true;",
"true",
"int x",
"x"
] | import java.util.Scanner;
class Main {
public static void main(String args[]) {
Scanner scan = new Scanner(System.in);
int num = scan.nextInt();
int[] array = new int[num];
int count = 0;
for (int i = 0; i < num; i++) {
array[i] = scan.nextInt();
if(isprime(array[i])) {
count+=1;
}
}
System.out.println(count);
scan.close();
}
private static boolean isprime(int x) {
if (x == 2) {
return true;
}
if (x < 2 || x % 2 == 0) {
return false;
}
int i = 3;
while (i <= Math.sqrt(x)) {
if (x % i == 0) {
return false;
}
i += 2;
}
return true;
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
4,
13,
4,
18,
13,
4,
18,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
29,
17,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
17,
29,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
29,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
113,
11
],
[
113,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
14,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
20,
23
],
[
23,
24
],
[
24,
25
],
[
14,
26
],
[
26,
27
],
[
26,
28
],
[
14,
29
],
[
29,
30
],
[
30,
31
],
[
31,
32
],
[
31,
33
],
[
29,
34
],
[
34,
35
],
[
34,
36
],
[
29,
37
],
[
37,
38
],
[
38,
39
],
[
29,
40
],
[
41,
41
],
[
41,
42
],
[
42,
43
],
[
43,
44
],
[
43,
45
],
[
45,
46
],
[
46,
47
],
[
45,
48
],
[
48,
49
],
[
49,
50
],
[
42,
51
],
[
51,
52
],
[
14,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
53,
58
],
[
12,
59
],
[
59,
60
],
[
113,
61
],
[
61,
62
],
[
61,
63
],
[
63,
64
],
[
64,
65
],
[
65,
66
],
[
65,
67
],
[
64,
68
],
[
68,
69
],
[
63,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
70,
74
],
[
74,
75
],
[
63,
76
],
[
76,
77
],
[
77,
78
],
[
78,
79
],
[
78,
80
],
[
77,
81
],
[
76,
82
],
[
82,
83
],
[
63,
84
],
[
84,
85
],
[
85,
86
],
[
86,
87
],
[
86,
88
],
[
84,
89
],
[
89,
90
],
[
89,
91
],
[
91,
92
],
[
92,
93
],
[
91,
94
],
[
84,
95
],
[
95,
96
],
[
96,
97
],
[
84,
98
],
[
99,
99
],
[
99,
100
],
[
100,
101
],
[
101,
102
],
[
102,
103
],
[
102,
104
],
[
101,
105
],
[
100,
106
],
[
106,
107
],
[
63,
108
],
[
108,
109
],
[
61,
110
],
[
110,
111
],
[
0,
112
],
[
112,
113
],
[
112,
114
]
] | [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tint primeCnt = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (checkPrimeNumber(Integer.parseInt(br.readLine()))) primeCnt++;\n\t\t}\n\t\tSystem.out.println(primeCnt);\n\t}\n\n\tpublic static boolean checkPrimeNumber(int target) {\n\t\tif (target < 2) return false;\n\t\tif (target == 2) return true;\n\t\tif (target % 2 == 0) return false;\n\n\t\tfor (int i = 3; i <= Math.sqrt(target); i++) {\n\t\t\tif (target % i == 0) return false;\n\t\t}\n\t\treturn true;\n\t}\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"public class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tint primeCnt = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (checkPrimeNumber(Integer.parseInt(br.readLine()))) primeCnt++;\n\t\t}\n\t\tSystem.out.println(primeCnt);\n\t}\n\n\tpublic static boolean checkPrimeNumber(int target) {\n\t\tif (target < 2) return false;\n\t\tif (target == 2) return true;\n\t\tif (target % 2 == 0) return false;\n\n\t\tfor (int i = 3; i <= Math.sqrt(target); i++) {\n\t\t\tif (target % i == 0) return false;\n\t\t}\n\t\treturn true;\n\t}\n}",
"Main",
"public static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tint primeCnt = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (checkPrimeNumber(Integer.parseInt(br.readLine()))) primeCnt++;\n\t\t}\n\t\tSystem.out.println(primeCnt);\n\t}",
"main",
"{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tint primeCnt = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (checkPrimeNumber(Integer.parseInt(br.readLine()))) primeCnt++;\n\t\t}\n\t\tSystem.out.println(primeCnt);\n\t}",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"int n = Integer.parseInt(br.readLine());",
"n",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"int primeCnt = 0;",
"primeCnt",
"0",
"for (int i = 0; i < n; i++) {\n\t\t\tif (checkPrimeNumber(Integer.parseInt(br.readLine()))) primeCnt++;\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tif (checkPrimeNumber(Integer.parseInt(br.readLine()))) primeCnt++;\n\t\t}",
"{\n\t\t\tif (checkPrimeNumber(Integer.parseInt(br.readLine()))) primeCnt++;\n\t\t}",
"if (checkPrimeNumber(Integer.parseInt(br.readLine()))) primeCnt++;",
"checkPrimeNumber(Integer.parseInt(br.readLine()))",
"checkPrimeNumber",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"primeCnt++",
"primeCnt",
"System.out.println(primeCnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"primeCnt",
"String[] args",
"args",
"public static boolean checkPrimeNumber(int target) {\n\t\tif (target < 2) return false;\n\t\tif (target == 2) return true;\n\t\tif (target % 2 == 0) return false;\n\n\t\tfor (int i = 3; i <= Math.sqrt(target); i++) {\n\t\t\tif (target % i == 0) return false;\n\t\t}\n\t\treturn true;\n\t}",
"checkPrimeNumber",
"{\n\t\tif (target < 2) return false;\n\t\tif (target == 2) return true;\n\t\tif (target % 2 == 0) return false;\n\n\t\tfor (int i = 3; i <= Math.sqrt(target); i++) {\n\t\t\tif (target % i == 0) return false;\n\t\t}\n\t\treturn true;\n\t}",
"if (target < 2) return false;",
"target < 2",
"target",
"2",
"return false;",
"false",
"if (target == 2) return true;",
"target == 2",
"target",
"2",
"return true;",
"true",
"if (target % 2 == 0) return false;",
"target % 2 == 0",
"target % 2",
"target",
"2",
"0",
"return false;",
"false",
"for (int i = 3; i <= Math.sqrt(target); i++) {\n\t\t\tif (target % i == 0) return false;\n\t\t}",
"int i = 3;",
"int i = 3;",
"i",
"3",
"i <= Math.sqrt(target)",
"i",
"Math.sqrt(target)",
"Math.sqrt",
"Math",
"target",
"i++",
"i++",
"i",
"{\n\t\t\tif (target % i == 0) return false;\n\t\t}",
"{\n\t\t\tif (target % i == 0) return false;\n\t\t}",
"if (target % i == 0) return false;",
"target % i == 0",
"target % i",
"target",
"i",
"0",
"return false;",
"false",
"return true;",
"true",
"int target",
"target",
"public class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tint primeCnt = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (checkPrimeNumber(Integer.parseInt(br.readLine()))) primeCnt++;\n\t\t}\n\t\tSystem.out.println(primeCnt);\n\t}\n\n\tpublic static boolean checkPrimeNumber(int target) {\n\t\tif (target < 2) return false;\n\t\tif (target == 2) return true;\n\t\tif (target % 2 == 0) return false;\n\n\t\tfor (int i = 3; i <= Math.sqrt(target); i++) {\n\t\t\tif (target % i == 0) return false;\n\t\t}\n\t\treturn true;\n\t}\n}",
"public class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tint primeCnt = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (checkPrimeNumber(Integer.parseInt(br.readLine()))) primeCnt++;\n\t\t}\n\t\tSystem.out.println(primeCnt);\n\t}\n\n\tpublic static boolean checkPrimeNumber(int target) {\n\t\tif (target < 2) return false;\n\t\tif (target == 2) return true;\n\t\tif (target % 2 == 0) return false;\n\n\t\tfor (int i = 3; i <= Math.sqrt(target); i++) {\n\t\t\tif (target % i == 0) return false;\n\t\t}\n\t\treturn true;\n\t}\n}",
"Main"
] | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
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());
int primeCnt = 0;
for (int i = 0; i < n; i++) {
if (checkPrimeNumber(Integer.parseInt(br.readLine()))) primeCnt++;
}
System.out.println(primeCnt);
}
public static boolean checkPrimeNumber(int target) {
if (target < 2) return false;
if (target == 2) return true;
if (target % 2 == 0) return false;
for (int i = 3; i <= Math.sqrt(target); i++) {
if (target % i == 0) return false;
}
return true;
}
} |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
41,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
4,
13,
18,
13,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
17,
29,
17,
14,
2,
13,
17,
29,
17,
30,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
29,
17,
29,
17,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
9,
10
],
[
7,
11
],
[
11,
12
],
[
7,
13
],
[
13,
14
],
[
13,
15
],
[
15,
16
],
[
16,
17
],
[
16,
18
],
[
15,
19
],
[
19,
20
],
[
19,
21
],
[
21,
22
],
[
22,
23
],
[
15,
24
],
[
24,
25
],
[
24,
26
],
[
26,
27
],
[
27,
28
],
[
26,
29
],
[
15,
30
],
[
30,
31
],
[
30,
32
],
[
15,
34
],
[
34,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
34,
39
],
[
39,
40
],
[
39,
41
],
[
34,
42
],
[
42,
43
],
[
43,
44
],
[
34,
45
],
[
46,
46
],
[
46,
47
],
[
47,
48
],
[
48,
49
],
[
48,
50
],
[
47,
51
],
[
51,
52
],
[
52,
53
],
[
51,
54
],
[
54,
55
],
[
55,
56
],
[
15,
57
],
[
57,
58
],
[
57,
59
],
[
15,
60
],
[
60,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
60,
65
],
[
65,
66
],
[
65,
67
],
[
67,
68
],
[
67,
69
],
[
60,
70
],
[
70,
71
],
[
71,
72
],
[
60,
73
],
[
74,
74
],
[
74,
75
],
[
75,
76
],
[
76,
77
],
[
76,
78
],
[
78,
79
],
[
78,
80
],
[
75,
81
],
[
81,
82
],
[
15,
83
],
[
83,
84
],
[
84,
85
],
[
85,
86
],
[
85,
87
],
[
83,
88
],
[
13,
89
],
[
89,
90
],
[
7,
91
],
[
91,
92
],
[
91,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
95,
97
],
[
94,
98
],
[
98,
99
],
[
94,
100
],
[
100,
101
],
[
101,
102
],
[
102,
103
],
[
102,
104
],
[
101,
105
],
[
100,
106
],
[
106,
107
],
[
100,
108
],
[
108,
109
],
[
109,
110
],
[
109,
111
],
[
108,
112
],
[
112,
113
],
[
108,
114
],
[
114,
115
],
[
115,
116
],
[
116,
117
],
[
117,
118
],
[
117,
119
],
[
115,
120
],
[
120,
121
],
[
121,
122
],
[
121,
123
],
[
120,
124
],
[
115,
125
],
[
125,
126
],
[
126,
127
],
[
126,
128
],
[
115,
129
],
[
130,
130
],
[
130,
131
],
[
131,
132
],
[
132,
133
],
[
133,
134
],
[
133,
135
],
[
132,
136
],
[
131,
137
],
[
137,
138
],
[
114,
139
],
[
139,
140
],
[
91,
141
],
[
141,
142
]
] | [
"import java.io.*;\nimport java.util.*;\n\n\n\nclass Main{\n //読み込みのテンプレ(stringオブジェクトまで)\n \n static int number;\n static int[] linenumbers;\n \n \n public static void main(String[] args) throws IOException{\n BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n //Integer that shows the number of the lines\n String strnumber = reader.readLine();\n int number = Integer.parseInt(strnumber);\n \n //System.out.println(number);\n \n int[] linenumbers = new int[number];\n \n for(int i=0;i<number;i++){\n linenumbers[i] = Integer.parseInt((String)reader.readLine());\n }\n int prime_number=0;\n \n for(int i=0;i<linenumbers.length;i++){\n if(isPrime(linenumbers[i]))prime_number++;\n }\n \n System.out.println(prime_number);\n }\n \n public static boolean isPrime(int n){\n if(n==2)return true;\n else if(n%2==0)return false;\n else if(n<9)return true;\n else{\n for(int i =3;i*i<=n;i+=2){\n if(n%i==0)return false;\n }\n return true;\n \n }\n \n }\n \n \n}",
"import java.io.*;",
"io.*",
"java",
"import java.util.*;",
"util.*",
"java",
"class Main{\n //読み込みのテンプレ(stringオブジェクトまで)\n \n static int number;\n static int[] linenumbers;\n \n \n public static void main(String[] args) throws IOException{\n BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n //Integer that shows the number of the lines\n String strnumber = reader.readLine();\n int number = Integer.parseInt(strnumber);\n \n //System.out.println(number);\n \n int[] linenumbers = new int[number];\n \n for(int i=0;i<number;i++){\n linenumbers[i] = Integer.parseInt((String)reader.readLine());\n }\n int prime_number=0;\n \n for(int i=0;i<linenumbers.length;i++){\n if(isPrime(linenumbers[i]))prime_number++;\n }\n \n System.out.println(prime_number);\n }\n \n public static boolean isPrime(int n){\n if(n==2)return true;\n else if(n%2==0)return false;\n else if(n<9)return true;\n else{\n for(int i =3;i*i<=n;i+=2){\n if(n%i==0)return false;\n }\n return true;\n \n }\n \n }\n \n \n}",
"Main",
"static int number;",
"number",
"static int[] linenumbers;",
"linenumbers",
"public static void main(String[] args) throws IOException{\n BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n //Integer that shows the number of the lines\n String strnumber = reader.readLine();\n int number = Integer.parseInt(strnumber);\n \n //System.out.println(number);\n \n int[] linenumbers = new int[number];\n \n for(int i=0;i<number;i++){\n linenumbers[i] = Integer.parseInt((String)reader.readLine());\n }\n int prime_number=0;\n \n for(int i=0;i<linenumbers.length;i++){\n if(isPrime(linenumbers[i]))prime_number++;\n }\n \n System.out.println(prime_number);\n }",
"main",
"{\n BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n //Integer that shows the number of the lines\n String strnumber = reader.readLine();\n int number = Integer.parseInt(strnumber);\n \n //System.out.println(number);\n \n int[] linenumbers = new int[number];\n \n for(int i=0;i<number;i++){\n linenumbers[i] = Integer.parseInt((String)reader.readLine());\n }\n int prime_number=0;\n \n for(int i=0;i<linenumbers.length;i++){\n if(isPrime(linenumbers[i]))prime_number++;\n }\n \n System.out.println(prime_number);\n }",
"BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));",
"reader",
"new BufferedReader(new InputStreamReader(System.in))",
"String strnumber = reader.readLine();",
"strnumber",
"reader.readLine()",
"reader.readLine",
"reader",
"int number = Integer.parseInt(strnumber);",
"number",
"Integer.parseInt(strnumber)",
"Integer.parseInt",
"Integer",
"strnumber",
"int[] linenumbers = new int[number];",
"linenumbers",
"new int[number]",
"number",
"for(int i=0;i<number;i++){\n linenumbers[i] = Integer.parseInt((String)reader.readLine());\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<number",
"i",
"number",
"i++",
"i++",
"i",
"{\n linenumbers[i] = Integer.parseInt((String)reader.readLine());\n }",
"{\n linenumbers[i] = Integer.parseInt((String)reader.readLine());\n }",
"linenumbers[i] = Integer.parseInt((String)reader.readLine())",
"linenumbers[i]",
"linenumbers",
"i",
"Integer.parseInt((String)reader.readLine())",
"Integer.parseInt",
"Integer",
"(String)reader.readLine()",
"reader.readLine",
"reader",
"int prime_number=0;",
"prime_number",
"0",
"for(int i=0;i<linenumbers.length;i++){\n if(isPrime(linenumbers[i]))prime_number++;\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<linenumbers.length",
"i",
"linenumbers.length",
"linenumbers",
"linenumbers.length",
"i++",
"i++",
"i",
"{\n if(isPrime(linenumbers[i]))prime_number++;\n }",
"{\n if(isPrime(linenumbers[i]))prime_number++;\n }",
"if(isPrime(linenumbers[i]))prime_number++;",
"isPrime(linenumbers[i])",
"isPrime",
"linenumbers[i]",
"linenumbers",
"i",
"prime_number++",
"prime_number",
"System.out.println(prime_number)",
"System.out.println",
"System.out",
"System",
"System.out",
"prime_number",
"String[] args",
"args",
"public static boolean isPrime(int n){\n if(n==2)return true;\n else if(n%2==0)return false;\n else if(n<9)return true;\n else{\n for(int i =3;i*i<=n;i+=2){\n if(n%i==0)return false;\n }\n return true;\n \n }\n \n }",
"isPrime",
"{\n if(n==2)return true;\n else if(n%2==0)return false;\n else if(n<9)return true;\n else{\n for(int i =3;i*i<=n;i+=2){\n if(n%i==0)return false;\n }\n return true;\n \n }\n \n }",
"if(n==2)return true;\n else if(n%2==0)return false;\n else if(n<9)return true;\n else{\n for(int i =3;i*i<=n;i+=2){\n if(n%i==0)return false;\n }\n return true;\n \n }",
"n==2",
"n",
"2",
"return true;",
"true",
"if(n%2==0)return false;\n else if(n<9)return true;\n else{\n for(int i =3;i*i<=n;i+=2){\n if(n%i==0)return false;\n }\n return true;\n \n }",
"n%2==0",
"n%2",
"n",
"2",
"0",
"return false;",
"false",
"if(n<9)return true;\n else{\n for(int i =3;i*i<=n;i+=2){\n if(n%i==0)return false;\n }\n return true;\n \n }",
"n<9",
"n",
"9",
"return true;",
"true",
"{\n for(int i =3;i*i<=n;i+=2){\n if(n%i==0)return false;\n }\n return true;\n \n }",
"for(int i =3;i*i<=n;i+=2){\n if(n%i==0)return false;\n }",
"int i =3;",
"int i =3;",
"i",
"3",
"i*i<=n",
"i*i",
"i",
"i",
"n",
"i+=2",
"i+=2",
"i",
"2",
"{\n if(n%i==0)return false;\n }",
"{\n if(n%i==0)return false;\n }",
"if(n%i==0)return false;",
"n%i==0",
"n%i",
"n",
"i",
"0",
"return false;",
"false",
"return true;",
"true",
"int n",
"n"
] | import java.io.*;
import java.util.*;
class Main{
//読み込みのテンプレ(stringオブジェクトまで)
static int number;
static int[] linenumbers;
public static void main(String[] args) throws IOException{
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
//Integer that shows the number of the lines
String strnumber = reader.readLine();
int number = Integer.parseInt(strnumber);
//System.out.println(number);
int[] linenumbers = new int[number];
for(int i=0;i<number;i++){
linenumbers[i] = Integer.parseInt((String)reader.readLine());
}
int prime_number=0;
for(int i=0;i<linenumbers.length;i++){
if(isPrime(linenumbers[i]))prime_number++;
}
System.out.println(prime_number);
}
public static boolean isPrime(int n){
if(n==2)return true;
else if(n%2==0)return false;
else if(n<9)return true;
else{
for(int i =3;i*i<=n;i+=2){
if(n%i==0)return false;
}
return true;
}
}
} |
[
7,
15,
13,
17,
6,
13,
41,
13,
12,
13,
30,
0,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
13,
41,
13,
17,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
18,
13,
13,
13,
17,
30,
40,
13,
3,
14,
2,
13,
17,
30,
40,
13,
0,
13,
17,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
98,
5
],
[
98,
6
],
[
6,
7
],
[
98,
8
],
[
8,
9
],
[
8,
10
],
[
10,
11
],
[
11,
12
],
[
11,
13
],
[
10,
14
],
[
14,
15
],
[
14,
16
],
[
16,
17
],
[
17,
18
],
[
10,
19
],
[
19,
20
],
[
19,
21
],
[
10,
23
],
[
23,
24
],
[
23,
25
],
[
10,
26
],
[
26,
27
],
[
26,
28
],
[
10,
29
],
[
29,
30
],
[
30,
31
],
[
31,
32
],
[
31,
33
],
[
29,
34
],
[
34,
35
],
[
34,
36
],
[
29,
37
],
[
37,
38
],
[
38,
39
],
[
29,
40
],
[
41,
41
],
[
41,
42
],
[
42,
43
],
[
43,
44
],
[
43,
45
],
[
42,
46
],
[
46,
47
],
[
47,
48
],
[
41,
49
],
[
49,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
49,
54
],
[
54,
55
],
[
54,
56
],
[
56,
57
],
[
57,
58
],
[
56,
59
],
[
59,
60
],
[
59,
61
],
[
49,
62
],
[
62,
63
],
[
63,
64
],
[
49,
65
],
[
66,
66
],
[
66,
67
],
[
67,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
70,
72
],
[
69,
73
],
[
68,
74
],
[
67,
75
],
[
75,
76
],
[
76,
77
],
[
75,
78
],
[
41,
79
],
[
79,
80
],
[
80,
81
],
[
80,
82
],
[
79,
83
],
[
83,
84
],
[
84,
85
],
[
41,
86
],
[
86,
87
],
[
86,
88
],
[
10,
89
],
[
89,
90
],
[
90,
91
],
[
91,
92
],
[
91,
93
],
[
89,
94
],
[
8,
95
],
[
95,
96
],
[
0,
97
],
[
97,
98
],
[
97,
99
]
] | [
"import java.util.Scanner;\npublic class Main{\n\nprivate static Scanner scanner;\n\npublic static void main(String args[])\n{\n\tscanner = new Scanner(System.in);\n\tint a = scanner.nextInt();\n\tint[] b = new int[a];\n\tint count = 0,pre = 0;\n\n\tfor(int i = 0;i < a;i++) {\n\t\tb[i] = scanner.nextInt();\n\t\tfor(int j = 2;j <= Math.sqrt(b[i]);j++) {\n\t\t\tif(b[i]%j == 0) {\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(count == 0) {\n\t\t\tpre++;\n\t\t}\n\t\tcount = 0;\n\t}\n\tSystem.out.println(pre);\n}\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main{\n\nprivate static Scanner scanner;\n\npublic static void main(String args[])\n{\n\tscanner = new Scanner(System.in);\n\tint a = scanner.nextInt();\n\tint[] b = new int[a];\n\tint count = 0,pre = 0;\n\n\tfor(int i = 0;i < a;i++) {\n\t\tb[i] = scanner.nextInt();\n\t\tfor(int j = 2;j <= Math.sqrt(b[i]);j++) {\n\t\t\tif(b[i]%j == 0) {\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(count == 0) {\n\t\t\tpre++;\n\t\t}\n\t\tcount = 0;\n\t}\n\tSystem.out.println(pre);\n}\n}",
"Main",
"private static Scanner scanner;",
"scanner",
"public static void main(String args[])\n{\n\tscanner = new Scanner(System.in);\n\tint a = scanner.nextInt();\n\tint[] b = new int[a];\n\tint count = 0,pre = 0;\n\n\tfor(int i = 0;i < a;i++) {\n\t\tb[i] = scanner.nextInt();\n\t\tfor(int j = 2;j <= Math.sqrt(b[i]);j++) {\n\t\t\tif(b[i]%j == 0) {\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(count == 0) {\n\t\t\tpre++;\n\t\t}\n\t\tcount = 0;\n\t}\n\tSystem.out.println(pre);\n}",
"main",
"{\n\tscanner = new Scanner(System.in);\n\tint a = scanner.nextInt();\n\tint[] b = new int[a];\n\tint count = 0,pre = 0;\n\n\tfor(int i = 0;i < a;i++) {\n\t\tb[i] = scanner.nextInt();\n\t\tfor(int j = 2;j <= Math.sqrt(b[i]);j++) {\n\t\t\tif(b[i]%j == 0) {\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(count == 0) {\n\t\t\tpre++;\n\t\t}\n\t\tcount = 0;\n\t}\n\tSystem.out.println(pre);\n}",
"scanner = new Scanner(System.in)",
"scanner",
"new Scanner(System.in)",
"int a = scanner.nextInt();",
"a",
"scanner.nextInt()",
"scanner.nextInt",
"scanner",
"int[] b = new int[a];",
"b",
"new int[a]",
"a",
"int count = 0",
"count",
"0",
"pre = 0;",
"pre",
"0",
"for(int i = 0;i < a;i++) {\n\t\tb[i] = scanner.nextInt();\n\t\tfor(int j = 2;j <= Math.sqrt(b[i]);j++) {\n\t\t\tif(b[i]%j == 0) {\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(count == 0) {\n\t\t\tpre++;\n\t\t}\n\t\tcount = 0;\n\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < a",
"i",
"a",
"i++",
"i++",
"i",
"{\n\t\tb[i] = scanner.nextInt();\n\t\tfor(int j = 2;j <= Math.sqrt(b[i]);j++) {\n\t\t\tif(b[i]%j == 0) {\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(count == 0) {\n\t\t\tpre++;\n\t\t}\n\t\tcount = 0;\n\t}",
"{\n\t\tb[i] = scanner.nextInt();\n\t\tfor(int j = 2;j <= Math.sqrt(b[i]);j++) {\n\t\t\tif(b[i]%j == 0) {\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(count == 0) {\n\t\t\tpre++;\n\t\t}\n\t\tcount = 0;\n\t}",
"b[i] = scanner.nextInt()",
"b[i]",
"b",
"i",
"scanner.nextInt()",
"scanner.nextInt",
"scanner",
"for(int j = 2;j <= Math.sqrt(b[i]);j++) {\n\t\t\tif(b[i]%j == 0) {\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}",
"int j = 2;",
"int j = 2;",
"j",
"2",
"j <= Math.sqrt(b[i])",
"j",
"Math.sqrt(b[i])",
"Math.sqrt",
"Math",
"b[i]",
"b",
"i",
"j++",
"j++",
"j",
"{\n\t\t\tif(b[i]%j == 0) {\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}",
"{\n\t\t\tif(b[i]%j == 0) {\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}",
"if(b[i]%j == 0) {\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}",
"b[i]%j == 0",
"b[i]%j",
"b[i]",
"b",
"i",
"j",
"0",
"{\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}",
"count++",
"count",
"break;",
"if(count == 0) {\n\t\t\tpre++;\n\t\t}",
"count == 0",
"count",
"0",
"{\n\t\t\tpre++;\n\t\t}",
"pre++",
"pre",
"count = 0",
"count",
"0",
"System.out.println(pre)",
"System.out.println",
"System.out",
"System",
"System.out",
"pre",
"String args[]",
"args",
"public class Main{\n\nprivate static Scanner scanner;\n\npublic static void main(String args[])\n{\n\tscanner = new Scanner(System.in);\n\tint a = scanner.nextInt();\n\tint[] b = new int[a];\n\tint count = 0,pre = 0;\n\n\tfor(int i = 0;i < a;i++) {\n\t\tb[i] = scanner.nextInt();\n\t\tfor(int j = 2;j <= Math.sqrt(b[i]);j++) {\n\t\t\tif(b[i]%j == 0) {\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(count == 0) {\n\t\t\tpre++;\n\t\t}\n\t\tcount = 0;\n\t}\n\tSystem.out.println(pre);\n}\n}",
"public class Main{\n\nprivate static Scanner scanner;\n\npublic static void main(String args[])\n{\n\tscanner = new Scanner(System.in);\n\tint a = scanner.nextInt();\n\tint[] b = new int[a];\n\tint count = 0,pre = 0;\n\n\tfor(int i = 0;i < a;i++) {\n\t\tb[i] = scanner.nextInt();\n\t\tfor(int j = 2;j <= Math.sqrt(b[i]);j++) {\n\t\t\tif(b[i]%j == 0) {\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(count == 0) {\n\t\t\tpre++;\n\t\t}\n\t\tcount = 0;\n\t}\n\tSystem.out.println(pre);\n}\n}",
"Main"
] | import java.util.Scanner;
public class Main{
private static Scanner scanner;
public static void main(String args[])
{
scanner = new Scanner(System.in);
int a = scanner.nextInt();
int[] b = new int[a];
int count = 0,pre = 0;
for(int i = 0;i < a;i++) {
b[i] = scanner.nextInt();
for(int j = 2;j <= Math.sqrt(b[i]);j++) {
if(b[i]%j == 0) {
count++;
break;
}
}
if(count == 0) {
pre++;
}
count = 0;
}
System.out.println(pre);
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
42,
4,
18,
13,
30,
41,
13,
17,
11,
1,
41,
13,
4,
18,
13,
2,
13,
17,
1,
40,
13,
30,
30,
41,
13,
20,
14,
4,
18,
13,
17,
40,
13,
4,
18,
18,
13,
13,
17,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
11,
15
],
[
15,
16
],
[
16,
17
],
[
17,
18
],
[
15,
19
],
[
19,
20
],
[
20,
21
],
[
20,
22
],
[
19,
23
],
[
23,
24
],
[
24,
25
],
[
25,
26
],
[
25,
27
],
[
27,
28
],
[
28,
29
],
[
23,
30
],
[
30,
31
],
[
30,
32
],
[
23,
33
],
[
33,
34
],
[
34,
35
],
[
23,
36
],
[
37,
37
],
[
37,
38
],
[
38,
39
],
[
38,
40
],
[
37,
41
],
[
41,
42
],
[
42,
43
],
[
43,
44
],
[
42,
45
],
[
41,
46
],
[
46,
47
],
[
19,
48
],
[
48,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
48,
53
],
[
48,
54
],
[
9,
55
],
[
55,
56
]
] | [
"import java.util.*;\nimport java.math.*;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\twhile(sc.hasNext()){\n\t\t\tint ct = 0;\n\t\t\tfor(int i = sc.nextInt(); i>=1; --i){\n\t\t\t\tBigInteger b = new BigInteger(sc.next());\n\t\t\t\tif(b.isProbablePrime(5)) ++ct;\n\t\t\t}\n\t\t\tSystem.out.printf(\"%d\\n\", ct);\n\t\t}\n\t}\n}",
"import java.util.*;",
"util.*",
"java",
"import java.math.*;",
"math.*",
"java",
"class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\twhile(sc.hasNext()){\n\t\t\tint ct = 0;\n\t\t\tfor(int i = sc.nextInt(); i>=1; --i){\n\t\t\t\tBigInteger b = new BigInteger(sc.next());\n\t\t\t\tif(b.isProbablePrime(5)) ++ct;\n\t\t\t}\n\t\t\tSystem.out.printf(\"%d\\n\", ct);\n\t\t}\n\t}\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\twhile(sc.hasNext()){\n\t\t\tint ct = 0;\n\t\t\tfor(int i = sc.nextInt(); i>=1; --i){\n\t\t\t\tBigInteger b = new BigInteger(sc.next());\n\t\t\t\tif(b.isProbablePrime(5)) ++ct;\n\t\t\t}\n\t\t\tSystem.out.printf(\"%d\\n\", ct);\n\t\t}\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\twhile(sc.hasNext()){\n\t\t\tint ct = 0;\n\t\t\tfor(int i = sc.nextInt(); i>=1; --i){\n\t\t\t\tBigInteger b = new BigInteger(sc.next());\n\t\t\t\tif(b.isProbablePrime(5)) ++ct;\n\t\t\t}\n\t\t\tSystem.out.printf(\"%d\\n\", ct);\n\t\t}\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"while(sc.hasNext()){\n\t\t\tint ct = 0;\n\t\t\tfor(int i = sc.nextInt(); i>=1; --i){\n\t\t\t\tBigInteger b = new BigInteger(sc.next());\n\t\t\t\tif(b.isProbablePrime(5)) ++ct;\n\t\t\t}\n\t\t\tSystem.out.printf(\"%d\\n\", ct);\n\t\t}",
"sc.hasNext()",
"sc.hasNext",
"sc",
"{\n\t\t\tint ct = 0;\n\t\t\tfor(int i = sc.nextInt(); i>=1; --i){\n\t\t\t\tBigInteger b = new BigInteger(sc.next());\n\t\t\t\tif(b.isProbablePrime(5)) ++ct;\n\t\t\t}\n\t\t\tSystem.out.printf(\"%d\\n\", ct);\n\t\t}",
"int ct = 0;",
"ct",
"0",
"for(int i = sc.nextInt(); i>=1; --i){\n\t\t\t\tBigInteger b = new BigInteger(sc.next());\n\t\t\t\tif(b.isProbablePrime(5)) ++ct;\n\t\t\t}",
"int i = sc.nextInt();",
"int i = sc.nextInt();",
"i",
"sc.nextInt()",
"sc.nextInt",
"sc",
"i>=1",
"i",
"1",
"--i",
"--i",
"i",
"{\n\t\t\t\tBigInteger b = new BigInteger(sc.next());\n\t\t\t\tif(b.isProbablePrime(5)) ++ct;\n\t\t\t}",
"{\n\t\t\t\tBigInteger b = new BigInteger(sc.next());\n\t\t\t\tif(b.isProbablePrime(5)) ++ct;\n\t\t\t}",
"BigInteger b = new BigInteger(sc.next());",
"b",
"new BigInteger(sc.next())",
"if(b.isProbablePrime(5)) ++ct;",
"b.isProbablePrime(5)",
"b.isProbablePrime",
"b",
"5",
"++ct",
"ct",
"System.out.printf(\"%d\\n\", ct)",
"System.out.printf",
"System.out",
"System",
"System.out",
"\"%d\\n\"",
"ct",
"String[] args",
"args"
] | import java.util.*;
import java.math.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while(sc.hasNext()){
int ct = 0;
for(int i = sc.nextInt(); i>=1; --i){
BigInteger b = new BigInteger(sc.next());
if(b.isProbablePrime(5)) ++ct;
}
System.out.printf("%d\n", ct);
}
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
41,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
17,
0,
13,
4,
18,
13,
14,
2,
2,
2,
13,
17,
17,
2,
13,
17,
30,
0,
13,
17,
11,
1,
41,
13,
17,
2,
2,
13,
4,
18,
13,
13,
2,
13,
17,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
30,
0,
13,
17,
3,
14,
2,
13,
17,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
107,
5
],
[
107,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
8,
19
],
[
19,
20
],
[
8,
21
],
[
21,
22
],
[
21,
23
],
[
8,
24
],
[
24,
25
],
[
25,
26
],
[
26,
27
],
[
26,
28
],
[
24,
29
],
[
29,
30
],
[
29,
31
],
[
24,
32
],
[
32,
33
],
[
33,
34
],
[
24,
35
],
[
36,
36
],
[
36,
37
],
[
37,
38
],
[
37,
39
],
[
36,
40
],
[
40,
41
],
[
40,
42
],
[
42,
43
],
[
43,
44
],
[
36,
45
],
[
45,
46
],
[
46,
47
],
[
47,
48
],
[
48,
49
],
[
48,
50
],
[
47,
51
],
[
46,
52
],
[
52,
53
],
[
52,
54
],
[
45,
55
],
[
55,
56
],
[
56,
57
],
[
56,
58
],
[
36,
59
],
[
59,
60
],
[
60,
61
],
[
61,
62
],
[
61,
63
],
[
59,
64
],
[
64,
65
],
[
65,
66
],
[
65,
67
],
[
67,
68
],
[
68,
69
],
[
67,
70
],
[
64,
71
],
[
71,
72
],
[
71,
73
],
[
59,
74
],
[
74,
75
],
[
75,
76
],
[
75,
77
],
[
59,
78
],
[
79,
79
],
[
79,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
82,
84
],
[
81,
85
],
[
80,
86
],
[
86,
87
],
[
87,
88
],
[
87,
89
],
[
86,
90
],
[
36,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
91,
95
],
[
95,
96
],
[
96,
97
],
[
8,
98
],
[
98,
99
],
[
99,
100
],
[
100,
101
],
[
100,
102
],
[
98,
103
],
[
6,
104
],
[
104,
105
],
[
0,
106
],
[
106,
107
],
[
106,
108
]
] | [
"import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint flag, num, cnt = 0;\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tflag = 0;\n\t\t\t\n\t\t\tnum = sc.nextInt();\n\t\t\t\n\t\t\tif(num % 2 == 0 && num != 2) {\n\t\t\t\tflag = 1;\n\t\t\t}\n\t\t\t\n\t\t\tfor(int j = 3; j <= Math.sqrt(num) && flag == 0; j+=2) {\n\t\t\t\tif(num % j == 0) {\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(flag == 0) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint flag, num, cnt = 0;\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tflag = 0;\n\t\t\t\n\t\t\tnum = sc.nextInt();\n\t\t\t\n\t\t\tif(num % 2 == 0 && num != 2) {\n\t\t\t\tflag = 1;\n\t\t\t}\n\t\t\t\n\t\t\tfor(int j = 3; j <= Math.sqrt(num) && flag == 0; j+=2) {\n\t\t\t\tif(num % j == 0) {\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(flag == 0) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint flag, num, cnt = 0;\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tflag = 0;\n\t\t\t\n\t\t\tnum = sc.nextInt();\n\t\t\t\n\t\t\tif(num % 2 == 0 && num != 2) {\n\t\t\t\tflag = 1;\n\t\t\t}\n\t\t\t\n\t\t\tfor(int j = 3; j <= Math.sqrt(num) && flag == 0; j+=2) {\n\t\t\t\tif(num % j == 0) {\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(flag == 0) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint flag, num, cnt = 0;\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tflag = 0;\n\t\t\t\n\t\t\tnum = sc.nextInt();\n\t\t\t\n\t\t\tif(num % 2 == 0 && num != 2) {\n\t\t\t\tflag = 1;\n\t\t\t}\n\t\t\t\n\t\t\tfor(int j = 3; j <= Math.sqrt(num) && flag == 0; j+=2) {\n\t\t\t\tif(num % j == 0) {\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(flag == 0) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int flag",
"flag",
"num",
"num",
"cnt = 0;",
"cnt",
"0",
"for(int i = 0; i < n; i++) {\n\t\t\tflag = 0;\n\t\t\t\n\t\t\tnum = sc.nextInt();\n\t\t\t\n\t\t\tif(num % 2 == 0 && num != 2) {\n\t\t\t\tflag = 1;\n\t\t\t}\n\t\t\t\n\t\t\tfor(int j = 3; j <= Math.sqrt(num) && flag == 0; j+=2) {\n\t\t\t\tif(num % j == 0) {\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(flag == 0) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tflag = 0;\n\t\t\t\n\t\t\tnum = sc.nextInt();\n\t\t\t\n\t\t\tif(num % 2 == 0 && num != 2) {\n\t\t\t\tflag = 1;\n\t\t\t}\n\t\t\t\n\t\t\tfor(int j = 3; j <= Math.sqrt(num) && flag == 0; j+=2) {\n\t\t\t\tif(num % j == 0) {\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(flag == 0) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}",
"{\n\t\t\tflag = 0;\n\t\t\t\n\t\t\tnum = sc.nextInt();\n\t\t\t\n\t\t\tif(num % 2 == 0 && num != 2) {\n\t\t\t\tflag = 1;\n\t\t\t}\n\t\t\t\n\t\t\tfor(int j = 3; j <= Math.sqrt(num) && flag == 0; j+=2) {\n\t\t\t\tif(num % j == 0) {\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(flag == 0) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}",
"flag = 0",
"flag",
"0",
"num = sc.nextInt()",
"num",
"sc.nextInt()",
"sc.nextInt",
"sc",
"if(num % 2 == 0 && num != 2) {\n\t\t\t\tflag = 1;\n\t\t\t}",
"num % 2 == 0 && num != 2",
"num % 2 == 0",
"num % 2",
"num",
"2",
"0",
"num != 2",
"num",
"2",
"{\n\t\t\t\tflag = 1;\n\t\t\t}",
"flag = 1",
"flag",
"1",
"for(int j = 3; j <= Math.sqrt(num) && flag == 0; j+=2) {\n\t\t\t\tif(num % j == 0) {\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"int j = 3;",
"int j = 3;",
"j",
"3",
"j <= Math.sqrt(num) && flag == 0",
"j <= Math.sqrt(num)",
"j",
"Math.sqrt(num)",
"Math.sqrt",
"Math",
"num",
"flag == 0",
"flag",
"0",
"j+=2",
"j+=2",
"j",
"2",
"{\n\t\t\t\tif(num % j == 0) {\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif(num % j == 0) {\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"if(num % j == 0) {\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"num % j == 0",
"num % j",
"num",
"j",
"0",
"{\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"flag = 1",
"flag",
"1",
"break;",
"if(flag == 0) {\n\t\t\t\tcnt++;\n\t\t\t}",
"flag == 0",
"flag",
"0",
"{\n\t\t\t\tcnt++;\n\t\t\t}",
"cnt++",
"cnt",
"System.out.println(cnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"String[] args",
"args",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint flag, num, cnt = 0;\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tflag = 0;\n\t\t\t\n\t\t\tnum = sc.nextInt();\n\t\t\t\n\t\t\tif(num % 2 == 0 && num != 2) {\n\t\t\t\tflag = 1;\n\t\t\t}\n\t\t\t\n\t\t\tfor(int j = 3; j <= Math.sqrt(num) && flag == 0; j+=2) {\n\t\t\t\tif(num % j == 0) {\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(flag == 0) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}\n}",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint flag, num, cnt = 0;\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tflag = 0;\n\t\t\t\n\t\t\tnum = sc.nextInt();\n\t\t\t\n\t\t\tif(num % 2 == 0 && num != 2) {\n\t\t\t\tflag = 1;\n\t\t\t}\n\t\t\t\n\t\t\tfor(int j = 3; j <= Math.sqrt(num) && flag == 0; j+=2) {\n\t\t\t\tif(num % j == 0) {\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(flag == 0) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}\n}",
"Main"
] | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int flag, num, cnt = 0;
for(int i = 0; i < n; i++) {
flag = 0;
num = sc.nextInt();
if(num % 2 == 0 && num != 2) {
flag = 1;
}
for(int j = 3; j <= Math.sqrt(num) && flag == 0; j+=2) {
if(num % j == 0) {
flag = 1;
break;
}
}
if(flag == 0) {
cnt++;
}
}
System.out.println(cnt);
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
41,
13,
17,
41,
13,
4,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
30,
0,
13,
17,
14,
2,
13,
17,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
20
],
[
20,
21
],
[
21,
22
],
[
22,
23
],
[
22,
24
],
[
20,
25
],
[
25,
26
],
[
25,
27
],
[
20,
28
],
[
28,
29
],
[
29,
30
],
[
20,
31
],
[
32,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
35,
36
],
[
36,
37
],
[
32,
38
],
[
38,
39
],
[
38,
40
],
[
32,
41
],
[
41,
42
],
[
41,
43
],
[
43,
44
],
[
44,
45
],
[
43,
46
],
[
32,
47
],
[
47,
48
],
[
48,
49
],
[
49,
50
],
[
49,
51
],
[
47,
52
],
[
52,
53
],
[
52,
54
],
[
47,
55
],
[
55,
56
],
[
56,
57
],
[
47,
58
],
[
59,
59
],
[
59,
60
],
[
60,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
61,
65
],
[
60,
66
],
[
66,
67
],
[
67,
68
],
[
67,
69
],
[
32,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
70,
74
],
[
74,
75
],
[
75,
76
],
[
8,
77
],
[
77,
78
],
[
78,
79
],
[
79,
80
],
[
79,
81
],
[
77,
82
],
[
6,
83
],
[
83,
84
]
] | [
"import java.util.Scanner;\n\nclass Main{\n static public void main(String[] av){\n\tScanner sc = new Scanner(System.in);\n\tint n = sc.nextInt();\n\tint cnt = 0;\n\tfor(int i=0; i<n; i++){\n\t int x = sc.nextInt();\n\t int flag = 0;\n\t int y = (int)Math.sqrt(x);\n\t for(int j=2; j<=y; j++){\n\t\tif(x%j == 0){\n\t\t flag = 1;\n\t\t}\n\t }\n\t if(flag == 0){\n\t\tcnt++;\n\t }\n\t}\n\tSystem.out.println(cnt);\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"class Main{\n static public void main(String[] av){\n\tScanner sc = new Scanner(System.in);\n\tint n = sc.nextInt();\n\tint cnt = 0;\n\tfor(int i=0; i<n; i++){\n\t int x = sc.nextInt();\n\t int flag = 0;\n\t int y = (int)Math.sqrt(x);\n\t for(int j=2; j<=y; j++){\n\t\tif(x%j == 0){\n\t\t flag = 1;\n\t\t}\n\t }\n\t if(flag == 0){\n\t\tcnt++;\n\t }\n\t}\n\tSystem.out.println(cnt);\n }\n}",
"Main",
"static public void main(String[] av){\n\tScanner sc = new Scanner(System.in);\n\tint n = sc.nextInt();\n\tint cnt = 0;\n\tfor(int i=0; i<n; i++){\n\t int x = sc.nextInt();\n\t int flag = 0;\n\t int y = (int)Math.sqrt(x);\n\t for(int j=2; j<=y; j++){\n\t\tif(x%j == 0){\n\t\t flag = 1;\n\t\t}\n\t }\n\t if(flag == 0){\n\t\tcnt++;\n\t }\n\t}\n\tSystem.out.println(cnt);\n }",
"main",
"{\n\tScanner sc = new Scanner(System.in);\n\tint n = sc.nextInt();\n\tint cnt = 0;\n\tfor(int i=0; i<n; i++){\n\t int x = sc.nextInt();\n\t int flag = 0;\n\t int y = (int)Math.sqrt(x);\n\t for(int j=2; j<=y; j++){\n\t\tif(x%j == 0){\n\t\t flag = 1;\n\t\t}\n\t }\n\t if(flag == 0){\n\t\tcnt++;\n\t }\n\t}\n\tSystem.out.println(cnt);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int cnt = 0;",
"cnt",
"0",
"for(int i=0; i<n; i++){\n\t int x = sc.nextInt();\n\t int flag = 0;\n\t int y = (int)Math.sqrt(x);\n\t for(int j=2; j<=y; j++){\n\t\tif(x%j == 0){\n\t\t flag = 1;\n\t\t}\n\t }\n\t if(flag == 0){\n\t\tcnt++;\n\t }\n\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t int x = sc.nextInt();\n\t int flag = 0;\n\t int y = (int)Math.sqrt(x);\n\t for(int j=2; j<=y; j++){\n\t\tif(x%j == 0){\n\t\t flag = 1;\n\t\t}\n\t }\n\t if(flag == 0){\n\t\tcnt++;\n\t }\n\t}",
"{\n\t int x = sc.nextInt();\n\t int flag = 0;\n\t int y = (int)Math.sqrt(x);\n\t for(int j=2; j<=y; j++){\n\t\tif(x%j == 0){\n\t\t flag = 1;\n\t\t}\n\t }\n\t if(flag == 0){\n\t\tcnt++;\n\t }\n\t}",
"int x = sc.nextInt();",
"x",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int flag = 0;",
"flag",
"0",
"int y = (int)Math.sqrt(x);",
"y",
"(int)Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"for(int j=2; j<=y; j++){\n\t\tif(x%j == 0){\n\t\t flag = 1;\n\t\t}\n\t }",
"int j=2;",
"int j=2;",
"j",
"2",
"j<=y",
"j",
"y",
"j++",
"j++",
"j",
"{\n\t\tif(x%j == 0){\n\t\t flag = 1;\n\t\t}\n\t }",
"{\n\t\tif(x%j == 0){\n\t\t flag = 1;\n\t\t}\n\t }",
"if(x%j == 0){\n\t\t flag = 1;\n\t\t}",
"x%j == 0",
"x%j",
"x",
"j",
"0",
"{\n\t\t flag = 1;\n\t\t}",
"flag = 1",
"flag",
"1",
"if(flag == 0){\n\t\tcnt++;\n\t }",
"flag == 0",
"flag",
"0",
"{\n\t\tcnt++;\n\t }",
"cnt++",
"cnt",
"System.out.println(cnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"String[] av",
"av"
] | import java.util.Scanner;
class Main{
static public void main(String[] av){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int cnt = 0;
for(int i=0; i<n; i++){
int x = sc.nextInt();
int flag = 0;
int y = (int)Math.sqrt(x);
for(int j=2; j<=y; j++){
if(x%j == 0){
flag = 1;
}
}
if(flag == 0){
cnt++;
}
}
System.out.println(cnt);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
4,
18,
13,
14,
4,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
17,
14,
2,
2,
13,
17,
17,
30,
29,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
108,
5
],
[
108,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
14,
17
],
[
17,
18
],
[
18,
19
],
[
8,
20
],
[
20,
21
],
[
20,
22
],
[
8,
23
],
[
23,
24
],
[
24,
25
],
[
25,
26
],
[
25,
27
],
[
23,
28
],
[
28,
29
],
[
28,
30
],
[
23,
31
],
[
31,
32
],
[
32,
33
],
[
23,
34
],
[
35,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
38,
41
],
[
41,
42
],
[
42,
43
],
[
35,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
44,
48
],
[
48,
49
],
[
49,
50
],
[
8,
51
],
[
51,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
51,
56
],
[
6,
57
],
[
57,
58
],
[
108,
59
],
[
59,
60
],
[
59,
61
],
[
61,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
62,
66
],
[
66,
67
],
[
67,
68
],
[
61,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
70,
74
],
[
69,
75
],
[
75,
76
],
[
76,
77
],
[
61,
78
],
[
78,
79
],
[
79,
80
],
[
80,
81
],
[
80,
82
],
[
78,
83
],
[
83,
84
],
[
83,
85
],
[
85,
86
],
[
86,
87
],
[
85,
88
],
[
78,
89
],
[
89,
90
],
[
90,
91
],
[
78,
92
],
[
93,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
96,
97
],
[
96,
98
],
[
95,
99
],
[
94,
100
],
[
100,
101
],
[
101,
102
],
[
61,
103
],
[
103,
104
],
[
59,
105
],
[
105,
106
],
[
0,
107
],
[
107,
108
],
[
107,
109
]
] | [
"import java.util.Scanner;\npublic class Main{\n public static void main(String[] args){\n\tScanner scan = new Scanner(System.in);\n\tint n = Integer.parseInt(scan.nextLine());\n\tint cnt = 0;\n for (int i = 0; i < n; i++) {\n\t int a = Integer.parseInt(scan.nextLine());\n\t if (isPrime(a)) {\n\t\tcnt++;\n\t }\n\t}\n\tSystem.out.println(cnt);\n }\n public static boolean isPrime(int a){\n\tif (a == 2) {\n\t return true;\n\t}\n\tif (a % 2 == 0) {\n\t return false;\n\t}\n\tfor (int i = 3; i <= Math.sqrt(a); i++) {\n\t if (a % i == 0) {\n\t\treturn false;\n\t }\n\t}\n\treturn true;\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main{\n public static void main(String[] args){\n\tScanner scan = new Scanner(System.in);\n\tint n = Integer.parseInt(scan.nextLine());\n\tint cnt = 0;\n for (int i = 0; i < n; i++) {\n\t int a = Integer.parseInt(scan.nextLine());\n\t if (isPrime(a)) {\n\t\tcnt++;\n\t }\n\t}\n\tSystem.out.println(cnt);\n }\n public static boolean isPrime(int a){\n\tif (a == 2) {\n\t return true;\n\t}\n\tif (a % 2 == 0) {\n\t return false;\n\t}\n\tfor (int i = 3; i <= Math.sqrt(a); i++) {\n\t if (a % i == 0) {\n\t\treturn false;\n\t }\n\t}\n\treturn true;\n }\n}",
"Main",
"public static void main(String[] args){\n\tScanner scan = new Scanner(System.in);\n\tint n = Integer.parseInt(scan.nextLine());\n\tint cnt = 0;\n for (int i = 0; i < n; i++) {\n\t int a = Integer.parseInt(scan.nextLine());\n\t if (isPrime(a)) {\n\t\tcnt++;\n\t }\n\t}\n\tSystem.out.println(cnt);\n }",
"main",
"{\n\tScanner scan = new Scanner(System.in);\n\tint n = Integer.parseInt(scan.nextLine());\n\tint cnt = 0;\n for (int i = 0; i < n; i++) {\n\t int a = Integer.parseInt(scan.nextLine());\n\t if (isPrime(a)) {\n\t\tcnt++;\n\t }\n\t}\n\tSystem.out.println(cnt);\n }",
"Scanner scan = new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"int n = Integer.parseInt(scan.nextLine());",
"n",
"Integer.parseInt(scan.nextLine())",
"Integer.parseInt",
"Integer",
"scan.nextLine()",
"scan.nextLine",
"scan",
"int cnt = 0;",
"cnt",
"0",
"for (int i = 0; i < n; i++) {\n\t int a = Integer.parseInt(scan.nextLine());\n\t if (isPrime(a)) {\n\t\tcnt++;\n\t }\n\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t int a = Integer.parseInt(scan.nextLine());\n\t if (isPrime(a)) {\n\t\tcnt++;\n\t }\n\t}",
"{\n\t int a = Integer.parseInt(scan.nextLine());\n\t if (isPrime(a)) {\n\t\tcnt++;\n\t }\n\t}",
"int a = Integer.parseInt(scan.nextLine());",
"a",
"Integer.parseInt(scan.nextLine())",
"Integer.parseInt",
"Integer",
"scan.nextLine()",
"scan.nextLine",
"scan",
"if (isPrime(a)) {\n\t\tcnt++;\n\t }",
"isPrime(a)",
"isPrime",
"a",
"{\n\t\tcnt++;\n\t }",
"cnt++",
"cnt",
"System.out.println(cnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"String[] args",
"args",
"public static boolean isPrime(int a){\n\tif (a == 2) {\n\t return true;\n\t}\n\tif (a % 2 == 0) {\n\t return false;\n\t}\n\tfor (int i = 3; i <= Math.sqrt(a); i++) {\n\t if (a % i == 0) {\n\t\treturn false;\n\t }\n\t}\n\treturn true;\n }",
"isPrime",
"{\n\tif (a == 2) {\n\t return true;\n\t}\n\tif (a % 2 == 0) {\n\t return false;\n\t}\n\tfor (int i = 3; i <= Math.sqrt(a); i++) {\n\t if (a % i == 0) {\n\t\treturn false;\n\t }\n\t}\n\treturn true;\n }",
"if (a == 2) {\n\t return true;\n\t}",
"a == 2",
"a",
"2",
"{\n\t return true;\n\t}",
"return true;",
"true",
"if (a % 2 == 0) {\n\t return false;\n\t}",
"a % 2 == 0",
"a % 2",
"a",
"2",
"0",
"{\n\t return false;\n\t}",
"return false;",
"false",
"for (int i = 3; i <= Math.sqrt(a); i++) {\n\t if (a % i == 0) {\n\t\treturn false;\n\t }\n\t}",
"int i = 3;",
"int i = 3;",
"i",
"3",
"i <= Math.sqrt(a)",
"i",
"Math.sqrt(a)",
"Math.sqrt",
"Math",
"a",
"i++",
"i++",
"i",
"{\n\t if (a % i == 0) {\n\t\treturn false;\n\t }\n\t}",
"{\n\t if (a % i == 0) {\n\t\treturn false;\n\t }\n\t}",
"if (a % i == 0) {\n\t\treturn false;\n\t }",
"a % i == 0",
"a % i",
"a",
"i",
"0",
"{\n\t\treturn false;\n\t }",
"return false;",
"false",
"return true;",
"true",
"int a",
"a",
"public class Main{\n public static void main(String[] args){\n\tScanner scan = new Scanner(System.in);\n\tint n = Integer.parseInt(scan.nextLine());\n\tint cnt = 0;\n for (int i = 0; i < n; i++) {\n\t int a = Integer.parseInt(scan.nextLine());\n\t if (isPrime(a)) {\n\t\tcnt++;\n\t }\n\t}\n\tSystem.out.println(cnt);\n }\n public static boolean isPrime(int a){\n\tif (a == 2) {\n\t return true;\n\t}\n\tif (a % 2 == 0) {\n\t return false;\n\t}\n\tfor (int i = 3; i <= Math.sqrt(a); i++) {\n\t if (a % i == 0) {\n\t\treturn false;\n\t }\n\t}\n\treturn true;\n }\n}",
"public class Main{\n public static void main(String[] args){\n\tScanner scan = new Scanner(System.in);\n\tint n = Integer.parseInt(scan.nextLine());\n\tint cnt = 0;\n for (int i = 0; i < n; i++) {\n\t int a = Integer.parseInt(scan.nextLine());\n\t if (isPrime(a)) {\n\t\tcnt++;\n\t }\n\t}\n\tSystem.out.println(cnt);\n }\n public static boolean isPrime(int a){\n\tif (a == 2) {\n\t return true;\n\t}\n\tif (a % 2 == 0) {\n\t return false;\n\t}\n\tfor (int i = 3; i <= Math.sqrt(a); i++) {\n\t if (a % i == 0) {\n\t\treturn false;\n\t }\n\t}\n\treturn true;\n }\n}",
"Main"
] | import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
int n = Integer.parseInt(scan.nextLine());
int cnt = 0;
for (int i = 0; i < n; i++) {
int a = Integer.parseInt(scan.nextLine());
if (isPrime(a)) {
cnt++;
}
}
System.out.println(cnt);
}
public static boolean isPrime(int a){
if (a == 2) {
return true;
}
if (a % 2 == 0) {
return false;
}
for (int i = 3; i <= Math.sqrt(a); i++) {
if (a % i == 0) {
return false;
}
}
return true;
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
4,
18,
13,
14,
4,
13,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
29,
17,
29,
17,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
14,
17
],
[
17,
18
],
[
18,
19
],
[
8,
20
],
[
20,
21
],
[
20,
22
],
[
8,
23
],
[
23,
24
],
[
24,
25
],
[
25,
26
],
[
25,
27
],
[
23,
28
],
[
28,
29
],
[
28,
30
],
[
23,
31
],
[
31,
32
],
[
32,
33
],
[
23,
34
],
[
35,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
38,
41
],
[
41,
42
],
[
42,
43
],
[
35,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
44,
48
],
[
48,
49
],
[
8,
50
],
[
50,
51
],
[
51,
52
],
[
52,
53
],
[
52,
54
],
[
50,
55
],
[
6,
56
],
[
56,
57
],
[
4,
58
],
[
58,
59
],
[
58,
60
],
[
60,
61
],
[
61,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
61,
66
],
[
66,
67
],
[
67,
68
],
[
67,
69
],
[
66,
70
],
[
61,
71
],
[
71,
72
],
[
72,
73
],
[
61,
74
],
[
75,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
78,
79
],
[
78,
80
],
[
77,
81
],
[
76,
82
],
[
82,
83
],
[
60,
84
],
[
84,
85
],
[
58,
86
],
[
86,
87
]
] | [
"import java.io.*;\n\nclass Main {\n public static void main (String[] args) throws Exception {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int prime = 0;\n for (int i = 0; i < n; i++) {\n int element = Integer.parseInt(br.readLine());\n if (isPrime(element)) prime++;\n }\n System.out.println(prime);\n }\n\n static boolean isPrime (int n) {\n for (int i = 2; i*i <= n; i++) {\n if (n%i == 0) return false;\n }\n return true;\n }\n}",
"import java.io.*;",
"io.*",
"java",
"class Main {\n public static void main (String[] args) throws Exception {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int prime = 0;\n for (int i = 0; i < n; i++) {\n int element = Integer.parseInt(br.readLine());\n if (isPrime(element)) prime++;\n }\n System.out.println(prime);\n }\n\n static boolean isPrime (int n) {\n for (int i = 2; i*i <= n; i++) {\n if (n%i == 0) return false;\n }\n return true;\n }\n}",
"Main",
"public static void main (String[] args) throws Exception {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int prime = 0;\n for (int i = 0; i < n; i++) {\n int element = Integer.parseInt(br.readLine());\n if (isPrime(element)) prime++;\n }\n System.out.println(prime);\n }",
"main",
"{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int prime = 0;\n for (int i = 0; i < n; i++) {\n int element = Integer.parseInt(br.readLine());\n if (isPrime(element)) prime++;\n }\n System.out.println(prime);\n }",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"int n = Integer.parseInt(br.readLine());",
"n",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"int prime = 0;",
"prime",
"0",
"for (int i = 0; i < n; i++) {\n int element = Integer.parseInt(br.readLine());\n if (isPrime(element)) prime++;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n int element = Integer.parseInt(br.readLine());\n if (isPrime(element)) prime++;\n }",
"{\n int element = Integer.parseInt(br.readLine());\n if (isPrime(element)) prime++;\n }",
"int element = Integer.parseInt(br.readLine());",
"element",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"if (isPrime(element)) prime++;",
"isPrime(element)",
"isPrime",
"element",
"prime++",
"prime",
"System.out.println(prime)",
"System.out.println",
"System.out",
"System",
"System.out",
"prime",
"String[] args",
"args",
"static boolean isPrime (int n) {\n for (int i = 2; i*i <= n; i++) {\n if (n%i == 0) return false;\n }\n return true;\n }",
"isPrime",
"{\n for (int i = 2; i*i <= n; i++) {\n if (n%i == 0) return false;\n }\n return true;\n }",
"for (int i = 2; i*i <= n; i++) {\n if (n%i == 0) return false;\n }",
"int i = 2;",
"int i = 2;",
"i",
"2",
"i*i <= n",
"i*i",
"i",
"i",
"n",
"i++",
"i++",
"i",
"{\n if (n%i == 0) return false;\n }",
"{\n if (n%i == 0) return false;\n }",
"if (n%i == 0) return false;",
"n%i == 0",
"n%i",
"n",
"i",
"0",
"return false;",
"false",
"return true;",
"true",
"int n",
"n"
] | import java.io.*;
class Main {
public static void main (String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
int prime = 0;
for (int i = 0; i < n; i++) {
int element = Integer.parseInt(br.readLine());
if (isPrime(element)) prime++;
}
System.out.println(prime);
}
static boolean isPrime (int n) {
for (int i = 2; i*i <= n; i++) {
if (n%i == 0) return false;
}
return true;
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
4,
18,
13,
14,
4,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
17,
14,
2,
2,
13,
17,
2,
2,
13,
17,
17,
30,
29,
17,
41,
13,
17,
42,
2,
13,
4,
18,
13,
13,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
0,
13,
2,
13,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
112,
5
],
[
112,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
14,
17
],
[
17,
18
],
[
18,
19
],
[
8,
20
],
[
20,
21
],
[
20,
22
],
[
8,
23
],
[
23,
24
],
[
24,
25
],
[
25,
26
],
[
25,
27
],
[
23,
28
],
[
28,
29
],
[
28,
30
],
[
23,
31
],
[
31,
32
],
[
32,
33
],
[
23,
34
],
[
35,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
38,
41
],
[
41,
42
],
[
42,
43
],
[
35,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
44,
48
],
[
48,
49
],
[
49,
50
],
[
8,
51
],
[
51,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
51,
56
],
[
6,
57
],
[
57,
58
],
[
112,
59
],
[
59,
60
],
[
59,
61
],
[
61,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
62,
66
],
[
66,
67
],
[
67,
68
],
[
61,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
70,
74
],
[
74,
75
],
[
75,
76
],
[
75,
77
],
[
74,
78
],
[
69,
79
],
[
79,
80
],
[
80,
81
],
[
61,
82
],
[
82,
83
],
[
82,
84
],
[
61,
85
],
[
85,
86
],
[
86,
87
],
[
86,
88
],
[
88,
89
],
[
89,
90
],
[
88,
91
],
[
85,
92
],
[
92,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
95,
97
],
[
94,
98
],
[
93,
99
],
[
99,
100
],
[
100,
101
],
[
92,
102
],
[
102,
103
],
[
102,
104
],
[
104,
105
],
[
104,
106
],
[
61,
107
],
[
107,
108
],
[
59,
109
],
[
109,
110
],
[
0,
111
],
[
111,
112
],
[
111,
113
]
] | [
"import java.util.Scanner;\n \npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = Integer.parseInt(scanner.nextLine());\n \n int cnt = 0;\n for(int i = 0; i < n; i++){\n int x = Integer.parseInt(scanner.nextLine());\n if(isPrime(x)){\n cnt++;\n }\n }\n \n System.out.println(cnt);\n }\n \n public static boolean isPrime(int x) {\n if(x == 2){\n return true;\n }\n if(x < 2 || x % 2 == 0){\n return false;\n }\n\n int i = 3;\n while( i <= Math.sqrt(x) ){\n if(x % i == 0){\n return false;\n }\n i = i + 2;\n }\n return true;\n }\n}\n",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = Integer.parseInt(scanner.nextLine());\n \n int cnt = 0;\n for(int i = 0; i < n; i++){\n int x = Integer.parseInt(scanner.nextLine());\n if(isPrime(x)){\n cnt++;\n }\n }\n \n System.out.println(cnt);\n }\n \n public static boolean isPrime(int x) {\n if(x == 2){\n return true;\n }\n if(x < 2 || x % 2 == 0){\n return false;\n }\n\n int i = 3;\n while( i <= Math.sqrt(x) ){\n if(x % i == 0){\n return false;\n }\n i = i + 2;\n }\n return true;\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = Integer.parseInt(scanner.nextLine());\n \n int cnt = 0;\n for(int i = 0; i < n; i++){\n int x = Integer.parseInt(scanner.nextLine());\n if(isPrime(x)){\n cnt++;\n }\n }\n \n System.out.println(cnt);\n }",
"main",
"{\n Scanner scanner = new Scanner(System.in);\n int n = Integer.parseInt(scanner.nextLine());\n \n int cnt = 0;\n for(int i = 0; i < n; i++){\n int x = Integer.parseInt(scanner.nextLine());\n if(isPrime(x)){\n cnt++;\n }\n }\n \n System.out.println(cnt);\n }",
"Scanner scanner = new Scanner(System.in);",
"scanner",
"new Scanner(System.in)",
"int n = Integer.parseInt(scanner.nextLine());",
"n",
"Integer.parseInt(scanner.nextLine())",
"Integer.parseInt",
"Integer",
"scanner.nextLine()",
"scanner.nextLine",
"scanner",
"int cnt = 0;",
"cnt",
"0",
"for(int i = 0; i < n; i++){\n int x = Integer.parseInt(scanner.nextLine());\n if(isPrime(x)){\n cnt++;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n int x = Integer.parseInt(scanner.nextLine());\n if(isPrime(x)){\n cnt++;\n }\n }",
"{\n int x = Integer.parseInt(scanner.nextLine());\n if(isPrime(x)){\n cnt++;\n }\n }",
"int x = Integer.parseInt(scanner.nextLine());",
"x",
"Integer.parseInt(scanner.nextLine())",
"Integer.parseInt",
"Integer",
"scanner.nextLine()",
"scanner.nextLine",
"scanner",
"if(isPrime(x)){\n cnt++;\n }",
"isPrime(x)",
"isPrime",
"x",
"{\n cnt++;\n }",
"cnt++",
"cnt",
"System.out.println(cnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"String[] args",
"args",
"public static boolean isPrime(int x) {\n if(x == 2){\n return true;\n }\n if(x < 2 || x % 2 == 0){\n return false;\n }\n\n int i = 3;\n while( i <= Math.sqrt(x) ){\n if(x % i == 0){\n return false;\n }\n i = i + 2;\n }\n return true;\n }",
"isPrime",
"{\n if(x == 2){\n return true;\n }\n if(x < 2 || x % 2 == 0){\n return false;\n }\n\n int i = 3;\n while( i <= Math.sqrt(x) ){\n if(x % i == 0){\n return false;\n }\n i = i + 2;\n }\n return true;\n }",
"if(x == 2){\n return true;\n }",
"x == 2",
"x",
"2",
"{\n return true;\n }",
"return true;",
"true",
"if(x < 2 || x % 2 == 0){\n return false;\n }",
"x < 2 || x % 2 == 0",
"x < 2",
"x",
"2",
"x % 2 == 0",
"x % 2",
"x",
"2",
"0",
"{\n return false;\n }",
"return false;",
"false",
"int i = 3;",
"i",
"3",
"while( i <= Math.sqrt(x) ){\n if(x % i == 0){\n return false;\n }\n i = i + 2;\n }",
"i <= Math.sqrt(x)",
"i",
"Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"{\n if(x % i == 0){\n return false;\n }\n i = i + 2;\n }",
"if(x % i == 0){\n return false;\n }",
"x % i == 0",
"x % i",
"x",
"i",
"0",
"{\n return false;\n }",
"return false;",
"false",
"i = i + 2",
"i",
"i + 2",
"i",
"2",
"return true;",
"true",
"int x",
"x",
"public class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = Integer.parseInt(scanner.nextLine());\n \n int cnt = 0;\n for(int i = 0; i < n; i++){\n int x = Integer.parseInt(scanner.nextLine());\n if(isPrime(x)){\n cnt++;\n }\n }\n \n System.out.println(cnt);\n }\n \n public static boolean isPrime(int x) {\n if(x == 2){\n return true;\n }\n if(x < 2 || x % 2 == 0){\n return false;\n }\n\n int i = 3;\n while( i <= Math.sqrt(x) ){\n if(x % i == 0){\n return false;\n }\n i = i + 2;\n }\n return true;\n }\n}",
"public class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = Integer.parseInt(scanner.nextLine());\n \n int cnt = 0;\n for(int i = 0; i < n; i++){\n int x = Integer.parseInt(scanner.nextLine());\n if(isPrime(x)){\n cnt++;\n }\n }\n \n System.out.println(cnt);\n }\n \n public static boolean isPrime(int x) {\n if(x == 2){\n return true;\n }\n if(x < 2 || x % 2 == 0){\n return false;\n }\n\n int i = 3;\n while( i <= Math.sqrt(x) ){\n if(x % i == 0){\n return false;\n }\n i = i + 2;\n }\n return true;\n }\n}",
"Main"
] | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = Integer.parseInt(scanner.nextLine());
int cnt = 0;
for(int i = 0; i < n; i++){
int x = Integer.parseInt(scanner.nextLine());
if(isPrime(x)){
cnt++;
}
}
System.out.println(cnt);
}
public static boolean isPrime(int x) {
if(x == 2){
return true;
}
if(x < 2 || x % 2 == 0){
return false;
}
int i = 3;
while( i <= Math.sqrt(x) ){
if(x % i == 0){
return false;
}
i = i + 2;
}
return true;
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
13,
41,
13,
41,
13,
17,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
14,
2,
4,
13,
18,
13,
13,
17,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
41,
13,
17,
14,
2,
13,
17,
30,
29,
17,
14,
2,
2,
13,
17,
17,
30,
29,
17,
30,
0,
13,
17,
42,
2,
13,
4,
18,
13,
13,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
0,
13,
2,
13,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
118,
5
],
[
118,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
21
],
[
21,
22
],
[
8,
23
],
[
23,
24
],
[
23,
25
],
[
8,
26
],
[
26,
27
],
[
27,
28
],
[
28,
29
],
[
28,
30
],
[
26,
31
],
[
31,
32
],
[
31,
33
],
[
26,
34
],
[
34,
35
],
[
35,
36
],
[
26,
37
],
[
38,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
39,
43
],
[
43,
44
],
[
44,
45
],
[
38,
46
],
[
46,
47
],
[
47,
48
],
[
48,
49
],
[
48,
50
],
[
50,
51
],
[
50,
52
],
[
47,
53
],
[
46,
54
],
[
54,
55
],
[
55,
56
],
[
8,
57
],
[
57,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
57,
62
],
[
6,
63
],
[
63,
64
],
[
118,
65
],
[
65,
66
],
[
65,
67
],
[
67,
68
],
[
68,
69
],
[
68,
70
],
[
67,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
71,
75
],
[
75,
76
],
[
76,
77
],
[
71,
78
],
[
78,
79
],
[
79,
80
],
[
80,
81
],
[
80,
82
],
[
79,
83
],
[
78,
84
],
[
84,
85
],
[
85,
86
],
[
78,
87
],
[
87,
88
],
[
88,
89
],
[
88,
90
],
[
87,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
94,
95
],
[
95,
96
],
[
94,
97
],
[
91,
98
],
[
98,
99
],
[
99,
100
],
[
100,
101
],
[
101,
102
],
[
101,
103
],
[
100,
104
],
[
99,
105
],
[
105,
106
],
[
106,
107
],
[
98,
108
],
[
108,
109
],
[
108,
110
],
[
110,
111
],
[
110,
112
],
[
67,
113
],
[
113,
114
],
[
65,
115
],
[
115,
116
],
[
0,
117
],
[
117,
118
],
[
117,
119
]
] | [
"import java.util.*;\n//import java.util.Math.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int A[] = new int[n];\n int i;\n int count = 0;\n \n for(i = 0; i < n; i++){\n A[i] = sc.nextInt();\n// System.out.println(isprime(A[i]));\n if(isprime(A[i]) == true){\n count++;\n }\n }\n \n System.out.println(count);\n \n }\n \n public static boolean isprime(int x){\n int i = 0;\n // System.out.println(x);\n if(x == 2){\n return true;\n }else if((x % 2) == 0){\n return false;\n }else{\n i = 3;\n while(i <= Math.sqrt(x)){\n if((x % i) == 0){\n return false;\n }\n i = i + 2;\n }\n }\n return true;\n }\n}\n",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n public static void main(String[] args) throws Exception {\n\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int A[] = new int[n];\n int i;\n int count = 0;\n \n for(i = 0; i < n; i++){\n A[i] = sc.nextInt();\n// System.out.println(isprime(A[i]));\n if(isprime(A[i]) == true){\n count++;\n }\n }\n \n System.out.println(count);\n \n }\n \n public static boolean isprime(int x){\n int i = 0;\n // System.out.println(x);\n if(x == 2){\n return true;\n }else if((x % 2) == 0){\n return false;\n }else{\n i = 3;\n while(i <= Math.sqrt(x)){\n if((x % i) == 0){\n return false;\n }\n i = i + 2;\n }\n }\n return true;\n }\n}",
"Main",
"public static void main(String[] args) throws Exception {\n\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int A[] = new int[n];\n int i;\n int count = 0;\n \n for(i = 0; i < n; i++){\n A[i] = sc.nextInt();\n// System.out.println(isprime(A[i]));\n if(isprime(A[i]) == true){\n count++;\n }\n }\n \n System.out.println(count);\n \n }",
"main",
"{\n\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int A[] = new int[n];\n int i;\n int count = 0;\n \n for(i = 0; i < n; i++){\n A[i] = sc.nextInt();\n// System.out.println(isprime(A[i]));\n if(isprime(A[i]) == true){\n count++;\n }\n }\n \n System.out.println(count);\n \n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int A[] = new int[n];",
"A",
"new int[n]",
"n",
"int i;",
"i",
"int count = 0;",
"count",
"0",
"for(i = 0; i < n; i++){\n A[i] = sc.nextInt();\n// System.out.println(isprime(A[i]));\n if(isprime(A[i]) == true){\n count++;\n }\n }",
"i = 0;",
"i = 0",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n A[i] = sc.nextInt();\n// System.out.println(isprime(A[i]));\n if(isprime(A[i]) == true){\n count++;\n }\n }",
"{\n A[i] = sc.nextInt();\n// System.out.println(isprime(A[i]));\n if(isprime(A[i]) == true){\n count++;\n }\n }",
"A[i] = sc.nextInt()",
"A[i]",
"A",
"i",
"sc.nextInt()",
"sc.nextInt",
"sc",
"if(isprime(A[i]) == true){\n count++;\n }",
"isprime(A[i]) == true",
"isprime(A[i])",
"isprime",
"A[i]",
"A",
"i",
"true",
"{\n count++;\n }",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"public static boolean isprime(int x){\n int i = 0;\n // System.out.println(x);\n if(x == 2){\n return true;\n }else if((x % 2) == 0){\n return false;\n }else{\n i = 3;\n while(i <= Math.sqrt(x)){\n if((x % i) == 0){\n return false;\n }\n i = i + 2;\n }\n }\n return true;\n }",
"isprime",
"{\n int i = 0;\n // System.out.println(x);\n if(x == 2){\n return true;\n }else if((x % 2) == 0){\n return false;\n }else{\n i = 3;\n while(i <= Math.sqrt(x)){\n if((x % i) == 0){\n return false;\n }\n i = i + 2;\n }\n }\n return true;\n }",
"int i = 0;",
"i",
"0",
"if(x == 2){\n return true;\n }else if((x % 2) == 0){\n return false;\n }else{\n i = 3;\n while(i <= Math.sqrt(x)){\n if((x % i) == 0){\n return false;\n }\n i = i + 2;\n }\n }",
"x == 2",
"x",
"2",
"{\n return true;\n }",
"return true;",
"true",
"if((x % 2) == 0){\n return false;\n }else{\n i = 3;\n while(i <= Math.sqrt(x)){\n if((x % i) == 0){\n return false;\n }\n i = i + 2;\n }\n }",
"(x % 2) == 0",
"(x % 2)",
"x",
"2",
"0",
"{\n return false;\n }",
"return false;",
"false",
"{\n i = 3;\n while(i <= Math.sqrt(x)){\n if((x % i) == 0){\n return false;\n }\n i = i + 2;\n }\n }",
"i = 3",
"i",
"3",
"while(i <= Math.sqrt(x)){\n if((x % i) == 0){\n return false;\n }\n i = i + 2;\n }",
"i <= Math.sqrt(x)",
"i",
"Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"{\n if((x % i) == 0){\n return false;\n }\n i = i + 2;\n }",
"if((x % i) == 0){\n return false;\n }",
"(x % i) == 0",
"(x % i)",
"x",
"i",
"0",
"{\n return false;\n }",
"return false;",
"false",
"i = i + 2",
"i",
"i + 2",
"i",
"2",
"return true;",
"true",
"int x",
"x",
"public class Main {\n public static void main(String[] args) throws Exception {\n\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int A[] = new int[n];\n int i;\n int count = 0;\n \n for(i = 0; i < n; i++){\n A[i] = sc.nextInt();\n// System.out.println(isprime(A[i]));\n if(isprime(A[i]) == true){\n count++;\n }\n }\n \n System.out.println(count);\n \n }\n \n public static boolean isprime(int x){\n int i = 0;\n // System.out.println(x);\n if(x == 2){\n return true;\n }else if((x % 2) == 0){\n return false;\n }else{\n i = 3;\n while(i <= Math.sqrt(x)){\n if((x % i) == 0){\n return false;\n }\n i = i + 2;\n }\n }\n return true;\n }\n}",
"public class Main {\n public static void main(String[] args) throws Exception {\n\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int A[] = new int[n];\n int i;\n int count = 0;\n \n for(i = 0; i < n; i++){\n A[i] = sc.nextInt();\n// System.out.println(isprime(A[i]));\n if(isprime(A[i]) == true){\n count++;\n }\n }\n \n System.out.println(count);\n \n }\n \n public static boolean isprime(int x){\n int i = 0;\n // System.out.println(x);\n if(x == 2){\n return true;\n }else if((x % 2) == 0){\n return false;\n }else{\n i = 3;\n while(i <= Math.sqrt(x)){\n if((x % i) == 0){\n return false;\n }\n i = i + 2;\n }\n }\n return true;\n }\n}",
"Main"
] | import java.util.*;
//import java.util.Math.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int A[] = new int[n];
int i;
int count = 0;
for(i = 0; i < n; i++){
A[i] = sc.nextInt();
// System.out.println(isprime(A[i]));
if(isprime(A[i]) == true){
count++;
}
}
System.out.println(count);
}
public static boolean isprime(int x){
int i = 0;
// System.out.println(x);
if(x == 2){
return true;
}else if((x % 2) == 0){
return false;
}else{
i = 3;
while(i <= Math.sqrt(x)){
if((x % i) == 0){
return false;
}
i = i + 2;
}
}
return true;
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
14,
4,
13,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
29,
17,
14,
2,
13,
17,
29,
17,
30,
14,
2,
2,
13,
17,
17,
29,
17,
14,
2,
2,
13,
17,
17,
29,
17,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
13,
17,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
29,
17,
29,
17,
23,
13,
6,
13,
41,
13,
18,
13,
13,
41,
13,
20,
17,
41,
13,
17,
41,
13,
17,
12,
13,
30,
14,
2,
13,
13,
30,
29,
17,
30,
0,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
13,
14,
2,
13,
17,
30,
29,
17,
29,
17,
12,
13,
30,
29,
8,
4,
13,
18,
13,
40,
13,
40,
17,
12,
13,
30,
29,
2,
2,
17,
13,
2,
13,
17,
23,
13,
12,
13,
30,
42,
2,
4,
13,
40,
4,
13,
18,
13,
13,
40,
13,
12,
13,
30,
4,
13,
29,
4,
13,
12,
13,
30,
14,
40,
4,
13,
37,
20,
41,
13,
20,
41,
13,
4,
13,
42,
4,
13,
13,
30,
4,
18,
13,
13,
0,
13,
4,
13,
29,
4,
18,
13,
12,
13,
30,
29,
4,
13,
12,
13,
30,
14,
40,
4,
13,
37,
20,
41,
13,
17,
41,
13,
17,
41,
13,
4,
13,
14,
2,
13,
17,
30,
0,
13,
17,
0,
13,
4,
13,
14,
2,
2,
13,
17,
2,
17,
13,
30,
37,
20,
42,
17,
30,
14,
2,
2,
17,
13,
2,
13,
17,
30,
0,
13,
17,
0,
13,
2,
13,
17,
14,
2,
2,
13,
40,
17,
40,
4,
13,
13,
30,
29,
8,
13,
40,
13,
13,
30,
37,
20,
0,
13,
4,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
353,
14
],
[
353,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
18,
20
],
[
17,
21
],
[
21,
22
],
[
21,
23
],
[
23,
24
],
[
24,
25
],
[
17,
26
],
[
26,
27
],
[
26,
28
],
[
17,
29
],
[
29,
30
],
[
30,
31
],
[
31,
32
],
[
31,
33
],
[
29,
34
],
[
34,
35
],
[
34,
36
],
[
29,
37
],
[
37,
38
],
[
38,
39
],
[
29,
40
],
[
41,
41
],
[
41,
42
],
[
42,
43
],
[
42,
44
],
[
44,
45
],
[
45,
46
],
[
41,
47
],
[
47,
48
],
[
48,
49
],
[
48,
50
],
[
47,
51
],
[
51,
52
],
[
17,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
53,
58
],
[
15,
59
],
[
59,
60
],
[
353,
61
],
[
61,
62
],
[
61,
63
],
[
63,
64
],
[
64,
65
],
[
65,
66
],
[
65,
67
],
[
64,
68
],
[
68,
69
],
[
64,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
70,
74
],
[
74,
75
],
[
70,
76
],
[
76,
77
],
[
77,
78
],
[
78,
79
],
[
79,
80
],
[
79,
81
],
[
78,
82
],
[
77,
83
],
[
83,
84
],
[
76,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
87,
89
],
[
86,
90
],
[
85,
91
],
[
91,
92
],
[
76,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
95,
97
],
[
93,
98
],
[
98,
99
],
[
98,
100
],
[
100,
101
],
[
101,
102
],
[
102,
103
],
[
101,
104
],
[
100,
105
],
[
93,
106
],
[
106,
107
],
[
107,
108
],
[
107,
109
],
[
93,
110
],
[
111,
111
],
[
111,
112
],
[
112,
113
],
[
113,
114
],
[
114,
115
],
[
114,
116
],
[
113,
117
],
[
112,
118
],
[
118,
119
],
[
76,
120
],
[
120,
121
],
[
61,
122
],
[
122,
123
],
[
0,
124
],
[
124,
125
],
[
124,
126
],
[
126,
127
],
[
126,
128
],
[
128,
129
],
[
128,
130
],
[
124,
131
],
[
131,
132
],
[
131,
133
],
[
124,
135
],
[
135,
136
],
[
135,
137
],
[
124,
138
],
[
138,
139
],
[
138,
140
],
[
124,
141
],
[
141,
142
],
[
141,
143
],
[
143,
144
],
[
144,
145
],
[
145,
146
],
[
145,
147
],
[
144,
148
],
[
148,
149
],
[
149,
150
],
[
144,
151
],
[
151,
152
],
[
152,
153
],
[
152,
154
],
[
151,
155
],
[
155,
156
],
[
156,
157
],
[
156,
158
],
[
158,
159
],
[
159,
160
],
[
160,
161
],
[
155,
162
],
[
162,
163
],
[
163,
164
],
[
163,
165
],
[
165,
166
],
[
166,
167
],
[
165,
168
],
[
151,
169
],
[
169,
170
],
[
170,
171
],
[
170,
172
],
[
169,
173
],
[
173,
174
],
[
174,
175
],
[
143,
176
],
[
176,
177
],
[
124,
178
],
[
178,
179
],
[
178,
180
],
[
180,
181
],
[
181,
182
],
[
182,
183
],
[
183,
184
],
[
182,
185
],
[
185,
186
],
[
185,
187
],
[
187,
188
],
[
182,
189
],
[
189,
190
],
[
124,
191
],
[
191,
192
],
[
191,
193
],
[
193,
194
],
[
194,
195
],
[
195,
196
],
[
196,
197
],
[
196,
198
],
[
195,
199
],
[
199,
200
],
[
199,
201
],
[
191,
202
],
[
202,
203
],
[
124,
204
],
[
204,
205
],
[
204,
206
],
[
206,
207
],
[
207,
208
],
[
208,
209
],
[
209,
210
],
[
208,
211
],
[
211,
212
],
[
212,
213
],
[
212,
214
],
[
214,
215
],
[
214,
216
],
[
207,
217
],
[
217,
218
],
[
124,
219
],
[
219,
220
],
[
219,
221
],
[
221,
222
],
[
222,
223
],
[
221,
224
],
[
224,
225
],
[
225,
226
],
[
124,
227
],
[
227,
228
],
[
227,
229
],
[
229,
230
],
[
230,
231
],
[
231,
232
],
[
232,
233
],
[
230,
234
],
[
234,
235
],
[
229,
236
],
[
236,
237
],
[
236,
238
],
[
229,
239
],
[
239,
240
],
[
239,
241
],
[
241,
242
],
[
229,
243
],
[
243,
244
],
[
244,
245
],
[
244,
246
],
[
243,
247
],
[
247,
248
],
[
248,
249
],
[
249,
250
],
[
248,
251
],
[
247,
252
],
[
252,
253
],
[
252,
254
],
[
254,
255
],
[
229,
256
],
[
256,
257
],
[
257,
258
],
[
258,
259
],
[
124,
260
],
[
260,
261
],
[
260,
262
],
[
262,
263
],
[
263,
264
],
[
264,
265
],
[
124,
266
],
[
266,
267
],
[
266,
268
],
[
268,
269
],
[
269,
270
],
[
270,
271
],
[
271,
272
],
[
269,
273
],
[
273,
274
],
[
268,
275
],
[
275,
276
],
[
275,
277
],
[
268,
278
],
[
278,
279
],
[
278,
280
],
[
268,
281
],
[
281,
282
],
[
281,
283
],
[
283,
284
],
[
268,
285
],
[
285,
286
],
[
286,
287
],
[
286,
288
],
[
285,
289
],
[
289,
290
],
[
290,
291
],
[
290,
292
],
[
289,
293
],
[
293,
294
],
[
293,
295
],
[
295,
296
],
[
268,
297
],
[
297,
298
],
[
298,
299
],
[
299,
300
],
[
299,
301
],
[
298,
302
],
[
302,
303
],
[
302,
304
],
[
297,
305
],
[
305,
306
],
[
306,
307
],
[
268,
308
],
[
308,
309
],
[
308,
310
],
[
310,
311
],
[
311,
312
],
[
312,
313
],
[
313,
314
],
[
313,
315
],
[
312,
316
],
[
316,
317
],
[
316,
318
],
[
311,
319
],
[
319,
320
],
[
320,
321
],
[
320,
322
],
[
319,
323
],
[
323,
324
],
[
323,
325
],
[
325,
326
],
[
325,
327
],
[
311,
328
],
[
328,
329
],
[
329,
330
],
[
330,
331
],
[
330,
332
],
[
332,
333
],
[
329,
334
],
[
334,
335
],
[
335,
336
],
[
335,
337
],
[
328,
338
],
[
338,
339
],
[
339,
340
],
[
340,
341
],
[
340,
342
],
[
342,
343
],
[
340,
344
],
[
328,
345
],
[
345,
346
],
[
346,
347
],
[
310,
348
],
[
348,
349
],
[
348,
350
],
[
350,
351
],
[
0,
352
],
[
352,
353
],
[
352,
354
]
] | [
"import java.util.ArrayDeque;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n public static void main(String[] args) {\n FS fs = new FS();\n int n = fs.nextInt();\n int sum = 0;\n for (int i = 0; i < n; i++) {\n int m = fs.nextInt();\n if (test(m)) sum++;\n }\n System.out.println(sum);\n }\n\n private static boolean test(int m) {\n if (m == 2) return true;\n else if (m == 3) return true;\n else {\n if (m%2==0)return false;\n if (m%3==0)return false;\n for (int i = 5; i < Math.sqrt(m)+1; i += 2) {\n if (m % i == 0) return false;\n }\n return true;\n }\n }\n\n}\n\n\n class FS {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n return hasNextByte() ? buffer[ptr++] : -1;\n }\n\n private boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n private void skipUnprintable() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n }\n\n public boolean hasNext() {\n skipUnprintable();\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public int nextInt() {\n return (int) nextLong();\n }\n\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n}\n",
"import java.util.ArrayDeque;",
"ArrayDeque",
"java.util",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStream;",
"InputStream",
"java.io",
"import java.util.NoSuchElementException;",
"NoSuchElementException",
"java.util",
"public class Main {\n public static void main(String[] args) {\n FS fs = new FS();\n int n = fs.nextInt();\n int sum = 0;\n for (int i = 0; i < n; i++) {\n int m = fs.nextInt();\n if (test(m)) sum++;\n }\n System.out.println(sum);\n }\n\n private static boolean test(int m) {\n if (m == 2) return true;\n else if (m == 3) return true;\n else {\n if (m%2==0)return false;\n if (m%3==0)return false;\n for (int i = 5; i < Math.sqrt(m)+1; i += 2) {\n if (m % i == 0) return false;\n }\n return true;\n }\n }\n\n}",
"Main",
"public static void main(String[] args) {\n FS fs = new FS();\n int n = fs.nextInt();\n int sum = 0;\n for (int i = 0; i < n; i++) {\n int m = fs.nextInt();\n if (test(m)) sum++;\n }\n System.out.println(sum);\n }",
"main",
"{\n FS fs = new FS();\n int n = fs.nextInt();\n int sum = 0;\n for (int i = 0; i < n; i++) {\n int m = fs.nextInt();\n if (test(m)) sum++;\n }\n System.out.println(sum);\n }",
"FS fs = new FS();",
"fs",
"new FS()",
"int n = fs.nextInt();",
"n",
"fs.nextInt()",
"fs.nextInt",
"fs",
"int sum = 0;",
"sum",
"0",
"for (int i = 0; i < n; i++) {\n int m = fs.nextInt();\n if (test(m)) sum++;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n int m = fs.nextInt();\n if (test(m)) sum++;\n }",
"{\n int m = fs.nextInt();\n if (test(m)) sum++;\n }",
"int m = fs.nextInt();",
"m",
"fs.nextInt()",
"fs.nextInt",
"fs",
"if (test(m)) sum++;",
"test(m)",
"test",
"m",
"sum++",
"sum",
"System.out.println(sum)",
"System.out.println",
"System.out",
"System",
"System.out",
"sum",
"String[] args",
"args",
"private static boolean test(int m) {\n if (m == 2) return true;\n else if (m == 3) return true;\n else {\n if (m%2==0)return false;\n if (m%3==0)return false;\n for (int i = 5; i < Math.sqrt(m)+1; i += 2) {\n if (m % i == 0) return false;\n }\n return true;\n }\n }",
"test",
"{\n if (m == 2) return true;\n else if (m == 3) return true;\n else {\n if (m%2==0)return false;\n if (m%3==0)return false;\n for (int i = 5; i < Math.sqrt(m)+1; i += 2) {\n if (m % i == 0) return false;\n }\n return true;\n }\n }",
"if (m == 2) return true;\n else if (m == 3) return true;\n else {\n if (m%2==0)return false;\n if (m%3==0)return false;\n for (int i = 5; i < Math.sqrt(m)+1; i += 2) {\n if (m % i == 0) return false;\n }\n return true;\n }",
"m == 2",
"m",
"2",
"return true;",
"true",
"if (m == 3) return true;\n else {\n if (m%2==0)return false;\n if (m%3==0)return false;\n for (int i = 5; i < Math.sqrt(m)+1; i += 2) {\n if (m % i == 0) return false;\n }\n return true;\n }",
"m == 3",
"m",
"3",
"return true;",
"true",
"{\n if (m%2==0)return false;\n if (m%3==0)return false;\n for (int i = 5; i < Math.sqrt(m)+1; i += 2) {\n if (m % i == 0) return false;\n }\n return true;\n }",
"if (m%2==0)return false;",
"m%2==0",
"m%2",
"m",
"2",
"0",
"return false;",
"false",
"if (m%3==0)return false;",
"m%3==0",
"m%3",
"m",
"3",
"0",
"return false;",
"false",
"for (int i = 5; i < Math.sqrt(m)+1; i += 2) {\n if (m % i == 0) return false;\n }",
"int i = 5;",
"int i = 5;",
"i",
"5",
"i < Math.sqrt(m)+1",
"i",
"Math.sqrt(m)+1",
"Math.sqrt(m)",
"Math.sqrt",
"Math",
"m",
"1",
"i += 2",
"i += 2",
"i",
"2",
"{\n if (m % i == 0) return false;\n }",
"{\n if (m % i == 0) return false;\n }",
"if (m % i == 0) return false;",
"m % i == 0",
"m % i",
"m",
"i",
"0",
"return false;",
"false",
"return true;",
"true",
"int m",
"m",
"class FS {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n return hasNextByte() ? buffer[ptr++] : -1;\n }\n\n private boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n private void skipUnprintable() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n }\n\n public boolean hasNext() {\n skipUnprintable();\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public int nextInt() {\n return (int) nextLong();\n }\n\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n}",
"FS",
"private final InputStream in = System.in;",
"in",
"System.in",
"System",
"System.in",
"private final byte[] buffer = new byte[1024];",
"buffer",
"new byte[1024]",
"1024",
"private int ptr = 0;",
"ptr",
"0",
"private int buflen = 0;",
"buflen",
"0",
"private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }",
"hasNextByte",
"{\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }",
"if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }",
"ptr < buflen",
"ptr",
"buflen",
"{\n return true;\n }",
"return true;",
"true",
"{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }",
"ptr = 0",
"ptr",
"0",
"try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }",
"catch (IOException e) {\n e.printStackTrace();\n }",
"IOException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n buflen = in.read(buffer);\n }",
"buflen = in.read(buffer)",
"buflen",
"in.read(buffer)",
"in.read",
"in",
"buffer",
"if (buflen <= 0) {\n return false;\n }",
"buflen <= 0",
"buflen",
"0",
"{\n return false;\n }",
"return false;",
"false",
"return true;",
"true",
"private int readByte() {\n return hasNextByte() ? buffer[ptr++] : -1;\n }",
"readByte",
"{\n return hasNextByte() ? buffer[ptr++] : -1;\n }",
"return hasNextByte() ? buffer[ptr++] : -1;",
"hasNextByte() ? buffer[ptr++] : -1",
"hasNextByte()",
"hasNextByte",
"buffer[ptr++]",
"buffer",
"ptr++",
"ptr",
"-1",
"1",
"private boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }",
"isPrintableChar",
"{\n return 33 <= c && c <= 126;\n }",
"return 33 <= c && c <= 126;",
"33 <= c && c <= 126",
"33 <= c",
"33",
"c",
"c <= 126",
"c",
"126",
"int c",
"c",
"private void skipUnprintable() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n }",
"skipUnprintable",
"{\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n }",
"while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;",
"hasNextByte() && !isPrintableChar(buffer[ptr])",
"hasNextByte()",
"hasNextByte",
"!isPrintableChar(buffer[ptr])",
"isPrintableChar(buffer[ptr])",
"isPrintableChar",
"buffer[ptr]",
"buffer",
"ptr",
"ptr++",
"ptr",
"public boolean hasNext() {\n skipUnprintable();\n return hasNextByte();\n }",
"hasNext",
"{\n skipUnprintable();\n return hasNextByte();\n }",
"skipUnprintable()",
"skipUnprintable",
"return hasNextByte();",
"hasNextByte()",
"hasNextByte",
"public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }",
"next",
"{\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }",
"if (!hasNext()) throw new NoSuchElementException();",
"!hasNext()",
"hasNext()",
"hasNext",
"throw new NoSuchElementException();",
"new NoSuchElementException()",
"StringBuilder sb = new StringBuilder();",
"sb",
"new StringBuilder()",
"int b = readByte();",
"b",
"readByte()",
"readByte",
"while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }",
"isPrintableChar(b)",
"isPrintableChar",
"b",
"{\n sb.appendCodePoint(b);\n b = readByte();\n }",
"sb.appendCodePoint(b)",
"sb.appendCodePoint",
"sb",
"b",
"b = readByte()",
"b",
"readByte()",
"readByte",
"return sb.toString();",
"sb.toString()",
"sb.toString",
"sb",
"public int nextInt() {\n return (int) nextLong();\n }",
"nextInt",
"{\n return (int) nextLong();\n }",
"return (int) nextLong();",
"(int) nextLong()",
"nextLong",
"public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }",
"nextLong",
"{\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }",
"if (!hasNext()) throw new NoSuchElementException();",
"!hasNext()",
"hasNext()",
"hasNext",
"throw new NoSuchElementException();",
"new NoSuchElementException()",
"long n = 0;",
"n",
"0",
"boolean minus = false;",
"minus",
"false",
"int b = readByte();",
"b",
"readByte()",
"readByte",
"if (b == '-') {\n minus = true;\n b = readByte();\n }",
"b == '-'",
"b",
"'-'",
"{\n minus = true;\n b = readByte();\n }",
"minus = true",
"minus",
"true",
"b = readByte()",
"b",
"readByte()",
"readByte",
"if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }",
"b < '0' || '9' < b",
"b < '0'",
"b",
"'0'",
"'9' < b",
"'9'",
"b",
"{\n throw new NumberFormatException();\n }",
"throw new NumberFormatException();",
"new NumberFormatException()",
"while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }",
"true",
"{\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }",
"if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }",
"'0' <= b && b <= '9'",
"'0' <= b",
"'0'",
"b",
"b <= '9'",
"b",
"'9'",
"{\n n *= 10;\n n += b - '0';\n }",
"n *= 10",
"n",
"10",
"n += b - '0'",
"n",
"b - '0'",
"b",
"'0'",
"if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }",
"b == -1 || !isPrintableChar(b)",
"b == -1",
"b",
"-1",
"1",
"!isPrintableChar(b)",
"isPrintableChar(b)",
"isPrintableChar",
"b",
"{\n return minus ? -n : n;\n }",
"return minus ? -n : n;",
"minus ? -n : n",
"minus",
"-n",
"n",
"n",
"{\n throw new NumberFormatException();\n }",
"throw new NumberFormatException();",
"new NumberFormatException()",
"b = readByte()",
"b",
"readByte()",
"readByte",
"public class Main {\n public static void main(String[] args) {\n FS fs = new FS();\n int n = fs.nextInt();\n int sum = 0;\n for (int i = 0; i < n; i++) {\n int m = fs.nextInt();\n if (test(m)) sum++;\n }\n System.out.println(sum);\n }\n\n private static boolean test(int m) {\n if (m == 2) return true;\n else if (m == 3) return true;\n else {\n if (m%2==0)return false;\n if (m%3==0)return false;\n for (int i = 5; i < Math.sqrt(m)+1; i += 2) {\n if (m % i == 0) return false;\n }\n return true;\n }\n }\n\n}",
"public class Main {\n public static void main(String[] args) {\n FS fs = new FS();\n int n = fs.nextInt();\n int sum = 0;\n for (int i = 0; i < n; i++) {\n int m = fs.nextInt();\n if (test(m)) sum++;\n }\n System.out.println(sum);\n }\n\n private static boolean test(int m) {\n if (m == 2) return true;\n else if (m == 3) return true;\n else {\n if (m%2==0)return false;\n if (m%3==0)return false;\n for (int i = 5; i < Math.sqrt(m)+1; i += 2) {\n if (m % i == 0) return false;\n }\n return true;\n }\n }\n\n}",
"Main"
] | import java.util.ArrayDeque;
import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) {
FS fs = new FS();
int n = fs.nextInt();
int sum = 0;
for (int i = 0; i < n; i++) {
int m = fs.nextInt();
if (test(m)) sum++;
}
System.out.println(sum);
}
private static boolean test(int m) {
if (m == 2) return true;
else if (m == 3) return true;
else {
if (m%2==0)return false;
if (m%3==0)return false;
for (int i = 5; i < Math.sqrt(m)+1; i += 2) {
if (m % i == 0) return false;
}
return true;
}
}
}
class FS {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
return hasNextByte() ? buffer[ptr++] : -1;
}
private boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
private void skipUnprintable() {
while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
}
public boolean hasNext() {
skipUnprintable();
return hasNextByte();
}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public int nextInt() {
return (int) nextLong();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
41,
13,
17,
28,
13,
13,
30,
30,
14,
4,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
17,
14,
2,
2,
13,
17,
17,
30,
29,
17,
14,
2,
13,
17,
30,
29,
17,
14,
2,
2,
13,
17,
17,
30,
29,
17,
30,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
14,
2,
2,
13,
2,
13,
17,
17,
30,
29,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
141,
5
],
[
141,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
21
],
[
21,
22
],
[
22,
23
],
[
23,
24
],
[
23,
25
],
[
21,
26
],
[
26,
27
],
[
26,
28
],
[
21,
29
],
[
29,
30
],
[
30,
31
],
[
21,
32
],
[
33,
33
],
[
33,
34
],
[
34,
35
],
[
35,
36
],
[
35,
37
],
[
34,
38
],
[
38,
39
],
[
39,
40
],
[
8,
41
],
[
41,
42
],
[
41,
43
],
[
8,
44
],
[
44,
45
],
[
44,
46
],
[
44,
47
],
[
48,
48
],
[
48,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
49,
53
],
[
53,
54
],
[
54,
55
],
[
8,
56
],
[
56,
57
],
[
57,
58
],
[
58,
59
],
[
58,
60
],
[
56,
61
],
[
6,
62
],
[
62,
63
],
[
141,
64
],
[
64,
65
],
[
64,
66
],
[
66,
67
],
[
67,
68
],
[
68,
69
],
[
68,
70
],
[
67,
71
],
[
71,
72
],
[
72,
73
],
[
67,
74
],
[
74,
75
],
[
75,
76
],
[
76,
77
],
[
76,
78
],
[
75,
79
],
[
74,
80
],
[
80,
81
],
[
81,
82
],
[
74,
83
],
[
83,
84
],
[
84,
85
],
[
84,
86
],
[
83,
87
],
[
87,
88
],
[
88,
89
],
[
83,
90
],
[
90,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
91,
95
],
[
90,
96
],
[
96,
97
],
[
97,
98
],
[
90,
99
],
[
99,
100
],
[
100,
101
],
[
101,
102
],
[
102,
103
],
[
102,
104
],
[
100,
105
],
[
105,
106
],
[
106,
107
],
[
106,
108
],
[
105,
109
],
[
100,
110
],
[
110,
111
],
[
111,
112
],
[
111,
113
],
[
100,
114
],
[
115,
115
],
[
115,
116
],
[
116,
117
],
[
117,
118
],
[
118,
119
],
[
118,
120
],
[
117,
121
],
[
116,
122
],
[
122,
123
],
[
123,
124
],
[
116,
125
],
[
125,
126
],
[
126,
127
],
[
127,
128
],
[
127,
129
],
[
129,
130
],
[
129,
131
],
[
126,
132
],
[
125,
133
],
[
133,
134
],
[
134,
135
],
[
99,
136
],
[
136,
137
],
[
64,
138
],
[
138,
139
],
[
0,
140
],
[
140,
141
],
[
140,
142
]
] | [
"import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint[] primeNum = new int[n];\n\t\t\n\t\t\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tprimeNum[i] = sc.nextInt();\n\t\t}\n\t\t\n\t\tint cnt = 0;\n\t\t\n\t\tfor(int i : primeNum) {\n\t\t\tif(primeDec(i)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(cnt);\n\t}\n\t\n\tstatic boolean primeDec(int N) {\n\t\tif(N == 2) {\n\t\t\treturn true;\n\t\t} else if(N % 2 == 0) {\n\t\t\treturn false;\n\t\t} else if(N < 9) {\n\t\t\treturn true;\n\t\t} else if(N % 3 == 0) {\n\t\t\treturn false;\n\t\t} else {\n\t\t\tfor(int i = 5; i * i <= N; i+=6) {\n\t\t\t\tif(N % i== 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t} else if(N % (i + 2) == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t}\n\t}\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint[] primeNum = new int[n];\n\t\t\n\t\t\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tprimeNum[i] = sc.nextInt();\n\t\t}\n\t\t\n\t\tint cnt = 0;\n\t\t\n\t\tfor(int i : primeNum) {\n\t\t\tif(primeDec(i)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(cnt);\n\t}\n\t\n\tstatic boolean primeDec(int N) {\n\t\tif(N == 2) {\n\t\t\treturn true;\n\t\t} else if(N % 2 == 0) {\n\t\t\treturn false;\n\t\t} else if(N < 9) {\n\t\t\treturn true;\n\t\t} else if(N % 3 == 0) {\n\t\t\treturn false;\n\t\t} else {\n\t\t\tfor(int i = 5; i * i <= N; i+=6) {\n\t\t\t\tif(N % i== 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t} else if(N % (i + 2) == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t}\n\t}\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint[] primeNum = new int[n];\n\t\t\n\t\t\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tprimeNum[i] = sc.nextInt();\n\t\t}\n\t\t\n\t\tint cnt = 0;\n\t\t\n\t\tfor(int i : primeNum) {\n\t\t\tif(primeDec(i)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(cnt);\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint[] primeNum = new int[n];\n\t\t\n\t\t\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tprimeNum[i] = sc.nextInt();\n\t\t}\n\t\t\n\t\tint cnt = 0;\n\t\t\n\t\tfor(int i : primeNum) {\n\t\t\tif(primeDec(i)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(cnt);\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int[] primeNum = new int[n];",
"primeNum",
"new int[n]",
"n",
"for(int i = 0; i < n; i++) {\n\t\t\tprimeNum[i] = sc.nextInt();\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tprimeNum[i] = sc.nextInt();\n\t\t}",
"{\n\t\t\tprimeNum[i] = sc.nextInt();\n\t\t}",
"primeNum[i] = sc.nextInt()",
"primeNum[i]",
"primeNum",
"i",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int cnt = 0;",
"cnt",
"0",
"for(int i : primeNum) {\n\t\t\tif(primeDec(i)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}",
"int i",
"primeNum",
"{\n\t\t\tif(primeDec(i)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}",
"{\n\t\t\tif(primeDec(i)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}",
"if(primeDec(i)) {\n\t\t\t\tcnt++;\n\t\t\t}",
"primeDec(i)",
"primeDec",
"i",
"{\n\t\t\t\tcnt++;\n\t\t\t}",
"cnt++",
"cnt",
"System.out.println(cnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"String[] args",
"args",
"static boolean primeDec(int N) {\n\t\tif(N == 2) {\n\t\t\treturn true;\n\t\t} else if(N % 2 == 0) {\n\t\t\treturn false;\n\t\t} else if(N < 9) {\n\t\t\treturn true;\n\t\t} else if(N % 3 == 0) {\n\t\t\treturn false;\n\t\t} else {\n\t\t\tfor(int i = 5; i * i <= N; i+=6) {\n\t\t\t\tif(N % i== 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t} else if(N % (i + 2) == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t}\n\t}",
"primeDec",
"{\n\t\tif(N == 2) {\n\t\t\treturn true;\n\t\t} else if(N % 2 == 0) {\n\t\t\treturn false;\n\t\t} else if(N < 9) {\n\t\t\treturn true;\n\t\t} else if(N % 3 == 0) {\n\t\t\treturn false;\n\t\t} else {\n\t\t\tfor(int i = 5; i * i <= N; i+=6) {\n\t\t\t\tif(N % i== 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t} else if(N % (i + 2) == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t}\n\t}",
"if(N == 2) {\n\t\t\treturn true;\n\t\t} else if(N % 2 == 0) {\n\t\t\treturn false;\n\t\t} else if(N < 9) {\n\t\t\treturn true;\n\t\t} else if(N % 3 == 0) {\n\t\t\treturn false;\n\t\t} else {\n\t\t\tfor(int i = 5; i * i <= N; i+=6) {\n\t\t\t\tif(N % i== 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t} else if(N % (i + 2) == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t}",
"N == 2",
"N",
"2",
"{\n\t\t\treturn true;\n\t\t}",
"return true;",
"true",
"if(N % 2 == 0) {\n\t\t\treturn false;\n\t\t} else if(N < 9) {\n\t\t\treturn true;\n\t\t} else if(N % 3 == 0) {\n\t\t\treturn false;\n\t\t} else {\n\t\t\tfor(int i = 5; i * i <= N; i+=6) {\n\t\t\t\tif(N % i== 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t} else if(N % (i + 2) == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t}",
"N % 2 == 0",
"N % 2",
"N",
"2",
"0",
"{\n\t\t\treturn false;\n\t\t}",
"return false;",
"false",
"if(N < 9) {\n\t\t\treturn true;\n\t\t} else if(N % 3 == 0) {\n\t\t\treturn false;\n\t\t} else {\n\t\t\tfor(int i = 5; i * i <= N; i+=6) {\n\t\t\t\tif(N % i== 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t} else if(N % (i + 2) == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t}",
"N < 9",
"N",
"9",
"{\n\t\t\treturn true;\n\t\t}",
"return true;",
"true",
"if(N % 3 == 0) {\n\t\t\treturn false;\n\t\t} else {\n\t\t\tfor(int i = 5; i * i <= N; i+=6) {\n\t\t\t\tif(N % i== 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t} else if(N % (i + 2) == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t}",
"N % 3 == 0",
"N % 3",
"N",
"3",
"0",
"{\n\t\t\treturn false;\n\t\t}",
"return false;",
"false",
"{\n\t\t\tfor(int i = 5; i * i <= N; i+=6) {\n\t\t\t\tif(N % i== 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t} else if(N % (i + 2) == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t}",
"for(int i = 5; i * i <= N; i+=6) {\n\t\t\t\tif(N % i== 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t} else if(N % (i + 2) == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}",
"int i = 5;",
"int i = 5;",
"i",
"5",
"i * i <= N",
"i * i",
"i",
"i",
"N",
"i+=6",
"i+=6",
"i",
"6",
"{\n\t\t\t\tif(N % i== 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t} else if(N % (i + 2) == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif(N % i== 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t} else if(N % (i + 2) == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}",
"if(N % i== 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t} else if(N % (i + 2) == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}",
"N % i== 0",
"N % i",
"N",
"i",
"0",
"{\n\t\t\t\t\treturn false;\n\t\t\t\t}",
"return false;",
"false",
"if(N % (i + 2) == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}",
"N % (i + 2) == 0",
"N % (i + 2)",
"N",
"(i + 2)",
"i",
"2",
"0",
"{\n\t\t\t\t\treturn false;\n\t\t\t\t}",
"return false;",
"false",
"return true;",
"true",
"int N",
"N",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint[] primeNum = new int[n];\n\t\t\n\t\t\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tprimeNum[i] = sc.nextInt();\n\t\t}\n\t\t\n\t\tint cnt = 0;\n\t\t\n\t\tfor(int i : primeNum) {\n\t\t\tif(primeDec(i)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(cnt);\n\t}\n\t\n\tstatic boolean primeDec(int N) {\n\t\tif(N == 2) {\n\t\t\treturn true;\n\t\t} else if(N % 2 == 0) {\n\t\t\treturn false;\n\t\t} else if(N < 9) {\n\t\t\treturn true;\n\t\t} else if(N % 3 == 0) {\n\t\t\treturn false;\n\t\t} else {\n\t\t\tfor(int i = 5; i * i <= N; i+=6) {\n\t\t\t\tif(N % i== 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t} else if(N % (i + 2) == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t}\n\t}\n}",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint[] primeNum = new int[n];\n\t\t\n\t\t\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tprimeNum[i] = sc.nextInt();\n\t\t}\n\t\t\n\t\tint cnt = 0;\n\t\t\n\t\tfor(int i : primeNum) {\n\t\t\tif(primeDec(i)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(cnt);\n\t}\n\t\n\tstatic boolean primeDec(int N) {\n\t\tif(N == 2) {\n\t\t\treturn true;\n\t\t} else if(N % 2 == 0) {\n\t\t\treturn false;\n\t\t} else if(N < 9) {\n\t\t\treturn true;\n\t\t} else if(N % 3 == 0) {\n\t\t\treturn false;\n\t\t} else {\n\t\t\tfor(int i = 5; i * i <= N; i+=6) {\n\t\t\t\tif(N % i== 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t} else if(N % (i + 2) == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t}\n\t}\n}",
"Main"
] | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] primeNum = new int[n];
for(int i = 0; i < n; i++) {
primeNum[i] = sc.nextInt();
}
int cnt = 0;
for(int i : primeNum) {
if(primeDec(i)) {
cnt++;
}
}
System.out.println(cnt);
}
static boolean primeDec(int N) {
if(N == 2) {
return true;
} else if(N % 2 == 0) {
return false;
} else if(N < 9) {
return true;
} else if(N % 3 == 0) {
return false;
} else {
for(int i = 5; i * i <= N; i+=6) {
if(N % i== 0) {
return false;
} else if(N % (i + 2) == 0) {
return false;
}
}
return true;
}
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
4,
18,
13,
14,
4,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
17,
14,
2,
13,
17,
30,
29,
17,
14,
2,
2,
13,
17,
17,
30,
29,
17,
41,
13,
4,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
0,
13,
2,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
117,
5
],
[
117,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
8,
19
],
[
19,
20
],
[
19,
21
],
[
8,
22
],
[
22,
23
],
[
23,
24
],
[
24,
25
],
[
24,
26
],
[
22,
27
],
[
27,
28
],
[
27,
29
],
[
22,
30
],
[
30,
31
],
[
31,
32
],
[
22,
33
],
[
34,
34
],
[
34,
35
],
[
35,
36
],
[
35,
37
],
[
37,
38
],
[
38,
39
],
[
34,
40
],
[
40,
41
],
[
41,
42
],
[
41,
43
],
[
40,
44
],
[
44,
45
],
[
45,
46
],
[
8,
47
],
[
47,
48
],
[
48,
49
],
[
49,
50
],
[
49,
51
],
[
47,
52
],
[
6,
53
],
[
53,
54
],
[
117,
55
],
[
55,
56
],
[
55,
57
],
[
57,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
58,
62
],
[
62,
63
],
[
63,
64
],
[
57,
65
],
[
65,
66
],
[
66,
67
],
[
66,
68
],
[
65,
69
],
[
69,
70
],
[
70,
71
],
[
57,
72
],
[
72,
73
],
[
73,
74
],
[
74,
75
],
[
74,
76
],
[
73,
77
],
[
72,
78
],
[
78,
79
],
[
79,
80
],
[
57,
81
],
[
81,
82
],
[
81,
83
],
[
83,
84
],
[
84,
85
],
[
83,
86
],
[
57,
87
],
[
87,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
87,
92
],
[
92,
93
],
[
92,
94
],
[
87,
95
],
[
95,
96
],
[
96,
97
],
[
96,
98
],
[
98,
99
],
[
98,
100
],
[
87,
101
],
[
102,
102
],
[
102,
103
],
[
103,
104
],
[
104,
105
],
[
105,
106
],
[
105,
107
],
[
104,
108
],
[
103,
109
],
[
109,
110
],
[
110,
111
],
[
57,
112
],
[
112,
113
],
[
55,
114
],
[
114,
115
],
[
0,
116
],
[
116,
117
],
[
116,
118
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n\n\t/**\n\t * 入力された数のうち素数の数がいくつかを出力する\n\t * \n\t * @param args\n\t * 入力数、素数判定する数字\n\t */\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint num = scan.nextInt();\n\n\t\tlong check;\n\t\tint count = 0;// 素数の数\n\t\t// 入力された数の素数を判定する\n\t\tfor (int i = 0; i < num; i++) {\n\t\t\tcheck = scan.nextLong();\n\t\t\tif (PrimeNumber_Checker(check)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n\t/**\n\t * 素数であるかどうかを判定数\n\t * \n\t * @param check_num\n\t * 判定する数字\n\t * @return 判定結果(true:素数)\n\t */\n\tpublic static boolean PrimeNumber_Checker(long check_num) {\n\t\tif (check_num < 2) {// 1は素数ではない\n\t\t\treturn false;\n\t\t}\n\t\tif (check_num == 2) {// ２は素数\n\t\t\treturn true;\n\t\t}\n\t\tif (check_num % 2 == 0) {// 偶数は素数でない\n\t\t\treturn false;\n\t\t}\n\n\t\tdouble sqrtNum = Math.sqrt(check_num);\n\t\tfor (int k = 3; k <= sqrtNum; k = k + 2) {\n\t\t\tif (check_num % k == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\n\t}\n}\n",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n\t/**\n\t * 入力された数のうち素数の数がいくつかを出力する\n\t * \n\t * @param args\n\t * 入力数、素数判定する数字\n\t */\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint num = scan.nextInt();\n\n\t\tlong check;\n\t\tint count = 0;// 素数の数\n\t\t// 入力された数の素数を判定する\n\t\tfor (int i = 0; i < num; i++) {\n\t\t\tcheck = scan.nextLong();\n\t\t\tif (PrimeNumber_Checker(check)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n\t/**\n\t * 素数であるかどうかを判定数\n\t * \n\t * @param check_num\n\t * 判定する数字\n\t * @return 判定結果(true:素数)\n\t */\n\tpublic static boolean PrimeNumber_Checker(long check_num) {\n\t\tif (check_num < 2) {// 1は素数ではない\n\t\t\treturn false;\n\t\t}\n\t\tif (check_num == 2) {// ２は素数\n\t\t\treturn true;\n\t\t}\n\t\tif (check_num % 2 == 0) {// 偶数は素数でない\n\t\t\treturn false;\n\t\t}\n\n\t\tdouble sqrtNum = Math.sqrt(check_num);\n\t\tfor (int k = 3; k <= sqrtNum; k = k + 2) {\n\t\t\tif (check_num % k == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\n\t}\n}",
"Main",
"/**\n\t * 入力された数のうち素数の数がいくつかを出力する\n\t * \n\t * @param args\n\t * 入力数、素数判定する数字\n\t */\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint num = scan.nextInt();\n\n\t\tlong check;\n\t\tint count = 0;// 素数の数\n\t\t// 入力された数の素数を判定する\n\t\tfor (int i = 0; i < num; i++) {\n\t\t\tcheck = scan.nextLong();\n\t\t\tif (PrimeNumber_Checker(check)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"main",
"{\n\t\tScanner scan = new Scanner(System.in);\n\t\tint num = scan.nextInt();\n\n\t\tlong check;\n\t\tint count = 0;// 素数の数\n\t\t// 入力された数の素数を判定する\n\t\tfor (int i = 0; i < num; i++) {\n\t\t\tcheck = scan.nextLong();\n\t\t\tif (PrimeNumber_Checker(check)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"Scanner scan = new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"int num = scan.nextInt();",
"num",
"scan.nextInt()",
"scan.nextInt",
"scan",
"long check;",
"check",
"int count = 0;",
"count",
"0",
"for (int i = 0; i < num; i++) {\n\t\t\tcheck = scan.nextLong();\n\t\t\tif (PrimeNumber_Checker(check)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < num",
"i",
"num",
"i++",
"i++",
"i",
"{\n\t\t\tcheck = scan.nextLong();\n\t\t\tif (PrimeNumber_Checker(check)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"{\n\t\t\tcheck = scan.nextLong();\n\t\t\tif (PrimeNumber_Checker(check)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"check = scan.nextLong()",
"check",
"scan.nextLong()",
"scan.nextLong",
"scan",
"if (PrimeNumber_Checker(check)) {\n\t\t\t\tcount++;\n\t\t\t}",
"PrimeNumber_Checker(check)",
"PrimeNumber_Checker",
"check",
"{\n\t\t\t\tcount++;\n\t\t\t}",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"/**\n\t * 素数であるかどうかを判定数\n\t * \n\t * @param check_num\n\t * 判定する数字\n\t * @return 判定結果(true:素数)\n\t */\n\tpublic static boolean PrimeNumber_Checker(long check_num) {\n\t\tif (check_num < 2) {// 1は素数ではない\n\t\t\treturn false;\n\t\t}\n\t\tif (check_num == 2) {// ２は素数\n\t\t\treturn true;\n\t\t}\n\t\tif (check_num % 2 == 0) {// 偶数は素数でない\n\t\t\treturn false;\n\t\t}\n\n\t\tdouble sqrtNum = Math.sqrt(check_num);\n\t\tfor (int k = 3; k <= sqrtNum; k = k + 2) {\n\t\t\tif (check_num % k == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\n\t}",
"PrimeNumber_Checker",
"{\n\t\tif (check_num < 2) {// 1は素数ではない\n\t\t\treturn false;\n\t\t}\n\t\tif (check_num == 2) {// ２は素数\n\t\t\treturn true;\n\t\t}\n\t\tif (check_num % 2 == 0) {// 偶数は素数でない\n\t\t\treturn false;\n\t\t}\n\n\t\tdouble sqrtNum = Math.sqrt(check_num);\n\t\tfor (int k = 3; k <= sqrtNum; k = k + 2) {\n\t\t\tif (check_num % k == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\n\t}",
"if (check_num < 2) {// 1は素数ではない\n\t\t\treturn false;\n\t\t}",
"check_num < 2",
"check_num",
"2",
"{// 1は素数ではない\n\t\t\treturn false;\n\t\t}",
"return false;",
"false",
"if (check_num == 2) {// ２は素数\n\t\t\treturn true;\n\t\t}",
"check_num == 2",
"check_num",
"2",
"{// ２は素数\n\t\t\treturn true;\n\t\t}",
"return true;",
"true",
"if (check_num % 2 == 0) {// 偶数は素数でない\n\t\t\treturn false;\n\t\t}",
"check_num % 2 == 0",
"check_num % 2",
"check_num",
"2",
"0",
"{// 偶数は素数でない\n\t\t\treturn false;\n\t\t}",
"return false;",
"false",
"double sqrtNum = Math.sqrt(check_num);",
"sqrtNum",
"Math.sqrt(check_num)",
"Math.sqrt",
"Math",
"check_num",
"for (int k = 3; k <= sqrtNum; k = k + 2) {\n\t\t\tif (check_num % k == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}",
"int k = 3;",
"int k = 3;",
"k",
"3",
"k <= sqrtNum",
"k",
"sqrtNum",
"k = k + 2",
"k = k + 2",
"k",
"k + 2",
"k",
"2",
"{\n\t\t\tif (check_num % k == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}",
"{\n\t\t\tif (check_num % k == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}",
"if (check_num % k == 0) {\n\t\t\t\treturn false;\n\t\t\t}",
"check_num % k == 0",
"check_num % k",
"check_num",
"k",
"0",
"{\n\t\t\t\treturn false;\n\t\t\t}",
"return false;",
"false",
"return true;",
"true",
"long check_num",
"check_num",
"public class Main {\n\n\t/**\n\t * 入力された数のうち素数の数がいくつかを出力する\n\t * \n\t * @param args\n\t * 入力数、素数判定する数字\n\t */\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint num = scan.nextInt();\n\n\t\tlong check;\n\t\tint count = 0;// 素数の数\n\t\t// 入力された数の素数を判定する\n\t\tfor (int i = 0; i < num; i++) {\n\t\t\tcheck = scan.nextLong();\n\t\t\tif (PrimeNumber_Checker(check)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n\t/**\n\t * 素数であるかどうかを判定数\n\t * \n\t * @param check_num\n\t * 判定する数字\n\t * @return 判定結果(true:素数)\n\t */\n\tpublic static boolean PrimeNumber_Checker(long check_num) {\n\t\tif (check_num < 2) {// 1は素数ではない\n\t\t\treturn false;\n\t\t}\n\t\tif (check_num == 2) {// ２は素数\n\t\t\treturn true;\n\t\t}\n\t\tif (check_num % 2 == 0) {// 偶数は素数でない\n\t\t\treturn false;\n\t\t}\n\n\t\tdouble sqrtNum = Math.sqrt(check_num);\n\t\tfor (int k = 3; k <= sqrtNum; k = k + 2) {\n\t\t\tif (check_num % k == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\n\t}\n}",
"public class Main {\n\n\t/**\n\t * 入力された数のうち素数の数がいくつかを出力する\n\t * \n\t * @param args\n\t * 入力数、素数判定する数字\n\t */\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint num = scan.nextInt();\n\n\t\tlong check;\n\t\tint count = 0;// 素数の数\n\t\t// 入力された数の素数を判定する\n\t\tfor (int i = 0; i < num; i++) {\n\t\t\tcheck = scan.nextLong();\n\t\t\tif (PrimeNumber_Checker(check)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n\t/**\n\t * 素数であるかどうかを判定数\n\t * \n\t * @param check_num\n\t * 判定する数字\n\t * @return 判定結果(true:素数)\n\t */\n\tpublic static boolean PrimeNumber_Checker(long check_num) {\n\t\tif (check_num < 2) {// 1は素数ではない\n\t\t\treturn false;\n\t\t}\n\t\tif (check_num == 2) {// ２は素数\n\t\t\treturn true;\n\t\t}\n\t\tif (check_num % 2 == 0) {// 偶数は素数でない\n\t\t\treturn false;\n\t\t}\n\n\t\tdouble sqrtNum = Math.sqrt(check_num);\n\t\tfor (int k = 3; k <= sqrtNum; k = k + 2) {\n\t\t\tif (check_num % k == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\n\t}\n}",
"Main"
] | import java.util.Scanner;
public class Main {
/**
* 入力された数のうち素数の数がいくつかを出力する
*
* @param args
* 入力数、素数判定する数字
*/
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int num = scan.nextInt();
long check;
int count = 0;// 素数の数
// 入力された数の素数を判定する
for (int i = 0; i < num; i++) {
check = scan.nextLong();
if (PrimeNumber_Checker(check)) {
count++;
}
}
System.out.println(count);
}
/**
* 素数であるかどうかを判定数
*
* @param check_num
* 判定する数字
* @return 判定結果(true:素数)
*/
public static boolean PrimeNumber_Checker(long check_num) {
if (check_num < 2) {// 1は素数ではない
return false;
}
if (check_num == 2) {// ２は素数
return true;
}
if (check_num % 2 == 0) {// 偶数は素数でない
return false;
}
double sqrtNum = Math.sqrt(check_num);
for (int k = 3; k <= sqrtNum; k = k + 2) {
if (check_num % k == 0) {
return false;
}
}
return true;
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
17,
41,
13,
20,
13,
41,
13,
20,
17,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
13,
17,
1,
40,
13,
30,
30,
0,
18,
13,
13,
17,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
13,
17,
30,
11,
1,
41,
13,
2,
13,
13,
2,
13,
2,
13,
17,
1,
0,
13,
13,
30,
30,
0,
18,
13,
13,
17,
41,
13,
20,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
14,
2,
18,
13,
18,
13,
13,
17,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
8,
16
],
[
16,
17
],
[
16,
18
],
[
8,
20
],
[
20,
21
],
[
20,
22
],
[
8,
23
],
[
23,
24
],
[
24,
25
],
[
25,
26
],
[
25,
27
],
[
23,
28
],
[
28,
29
],
[
28,
30
],
[
30,
31
],
[
30,
32
],
[
23,
33
],
[
33,
34
],
[
34,
35
],
[
23,
36
],
[
37,
37
],
[
37,
38
],
[
38,
39
],
[
39,
40
],
[
39,
41
],
[
38,
42
],
[
8,
43
],
[
43,
44
],
[
44,
45
],
[
44,
46
],
[
43,
47
],
[
8,
48
],
[
48,
49
],
[
49,
50
],
[
49,
51
],
[
48,
52
],
[
8,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
53,
58
],
[
58,
59
],
[
58,
60
],
[
60,
61
],
[
61,
62
],
[
60,
63
],
[
53,
64
],
[
64,
65
],
[
65,
66
],
[
53,
67
],
[
68,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
70,
74
],
[
69,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
78,
79
],
[
78,
80
],
[
80,
81
],
[
80,
82
],
[
76,
83
],
[
83,
84
],
[
83,
85
],
[
85,
86
],
[
85,
87
],
[
76,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
76,
92
],
[
93,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
95,
97
],
[
94,
98
],
[
8,
99
],
[
99,
100
],
[
99,
101
],
[
8,
102
],
[
102,
103
],
[
102,
104
],
[
104,
105
],
[
105,
106
],
[
8,
107
],
[
107,
108
],
[
108,
109
],
[
109,
110
],
[
109,
111
],
[
107,
112
],
[
112,
113
],
[
112,
114
],
[
107,
115
],
[
115,
116
],
[
116,
117
],
[
107,
118
],
[
119,
119
],
[
119,
120
],
[
120,
121
],
[
121,
122
],
[
121,
123
],
[
120,
124
],
[
124,
125
],
[
125,
126
],
[
119,
127
],
[
127,
128
],
[
128,
129
],
[
129,
130
],
[
129,
131
],
[
131,
132
],
[
131,
133
],
[
128,
134
],
[
127,
135
],
[
135,
136
],
[
8,
137
],
[
137,
138
],
[
138,
139
],
[
139,
140
],
[
139,
141
],
[
137,
142
],
[
6,
143
],
[
143,
144
]
] | [
"import java.util.Scanner;\n \nclass Main\n{\n\tpublic static void main (String[] args) throws java.lang.Exception\n\t{\n\t\tint max = 100000001;\n\t\tboolean [] sosuu = new boolean [max];\n\t\tint [] n = new int [10000];\n\t\tint count = 0;\n \n\t\tfor (int i = 1; i <= max - 1; i++) {\n\t\t\tsosuu[i] = true;\n\t\t}\n\t\tsosuu[0] = false;\n\t\tsosuu[1] = false;\n \n\t\tfor (int i = 2; i <= Math.sqrt(max); i++) {\n\t\t\tif (sosuu[i] == true) {\n\t\t\t\tfor (int j = i + i; j <= max - 1; j += i) {\n\t\t\t\t\tsosuu[j] = false;\n\t\t\t\t}\n\t\t\t}\n \n\t\t}\n \n\t\tScanner cin = new Scanner (System.in);\n\t\tint x = cin.nextInt();\n \n\t\tfor (int i = 0; i < x; i++) {\n\t\t\tn[i] = cin.nextInt();\n\t\t\tif (sosuu[n[i]] == true) count++;\n\t\t}\n \n\t\tSystem.out.println(count);\n\t}\n \n\t//private static void sosuulist() {\n\t//\t\n\t//}\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"class Main\n{\n\tpublic static void main (String[] args) throws java.lang.Exception\n\t{\n\t\tint max = 100000001;\n\t\tboolean [] sosuu = new boolean [max];\n\t\tint [] n = new int [10000];\n\t\tint count = 0;\n \n\t\tfor (int i = 1; i <= max - 1; i++) {\n\t\t\tsosuu[i] = true;\n\t\t}\n\t\tsosuu[0] = false;\n\t\tsosuu[1] = false;\n \n\t\tfor (int i = 2; i <= Math.sqrt(max); i++) {\n\t\t\tif (sosuu[i] == true) {\n\t\t\t\tfor (int j = i + i; j <= max - 1; j += i) {\n\t\t\t\t\tsosuu[j] = false;\n\t\t\t\t}\n\t\t\t}\n \n\t\t}\n \n\t\tScanner cin = new Scanner (System.in);\n\t\tint x = cin.nextInt();\n \n\t\tfor (int i = 0; i < x; i++) {\n\t\t\tn[i] = cin.nextInt();\n\t\t\tif (sosuu[n[i]] == true) count++;\n\t\t}\n \n\t\tSystem.out.println(count);\n\t}\n \n\t//private static void sosuulist() {\n\t//\t\n\t//}\n}",
"Main",
"public static void main (String[] args) throws java.lang.Exception\n\t{\n\t\tint max = 100000001;\n\t\tboolean [] sosuu = new boolean [max];\n\t\tint [] n = new int [10000];\n\t\tint count = 0;\n \n\t\tfor (int i = 1; i <= max - 1; i++) {\n\t\t\tsosuu[i] = true;\n\t\t}\n\t\tsosuu[0] = false;\n\t\tsosuu[1] = false;\n \n\t\tfor (int i = 2; i <= Math.sqrt(max); i++) {\n\t\t\tif (sosuu[i] == true) {\n\t\t\t\tfor (int j = i + i; j <= max - 1; j += i) {\n\t\t\t\t\tsosuu[j] = false;\n\t\t\t\t}\n\t\t\t}\n \n\t\t}\n \n\t\tScanner cin = new Scanner (System.in);\n\t\tint x = cin.nextInt();\n \n\t\tfor (int i = 0; i < x; i++) {\n\t\t\tn[i] = cin.nextInt();\n\t\t\tif (sosuu[n[i]] == true) count++;\n\t\t}\n \n\t\tSystem.out.println(count);\n\t}",
"main",
"{\n\t\tint max = 100000001;\n\t\tboolean [] sosuu = new boolean [max];\n\t\tint [] n = new int [10000];\n\t\tint count = 0;\n \n\t\tfor (int i = 1; i <= max - 1; i++) {\n\t\t\tsosuu[i] = true;\n\t\t}\n\t\tsosuu[0] = false;\n\t\tsosuu[1] = false;\n \n\t\tfor (int i = 2; i <= Math.sqrt(max); i++) {\n\t\t\tif (sosuu[i] == true) {\n\t\t\t\tfor (int j = i + i; j <= max - 1; j += i) {\n\t\t\t\t\tsosuu[j] = false;\n\t\t\t\t}\n\t\t\t}\n \n\t\t}\n \n\t\tScanner cin = new Scanner (System.in);\n\t\tint x = cin.nextInt();\n \n\t\tfor (int i = 0; i < x; i++) {\n\t\t\tn[i] = cin.nextInt();\n\t\t\tif (sosuu[n[i]] == true) count++;\n\t\t}\n \n\t\tSystem.out.println(count);\n\t}",
"int max = 100000001;",
"max",
"100000001",
"boolean [] sosuu = new boolean [max];",
"sosuu",
"new boolean [max]",
"max",
"int [] n = new int [10000];",
"n",
"new int [10000]",
"10000",
"int count = 0;",
"count",
"0",
"for (int i = 1; i <= max - 1; i++) {\n\t\t\tsosuu[i] = true;\n\t\t}",
"int i = 1;",
"int i = 1;",
"i",
"1",
"i <= max - 1",
"i",
"max - 1",
"max",
"1",
"i++",
"i++",
"i",
"{\n\t\t\tsosuu[i] = true;\n\t\t}",
"{\n\t\t\tsosuu[i] = true;\n\t\t}",
"sosuu[i] = true",
"sosuu[i]",
"sosuu",
"i",
"true",
"sosuu[0] = false",
"sosuu[0]",
"sosuu",
"0",
"false",
"sosuu[1] = false",
"sosuu[1]",
"sosuu",
"1",
"false",
"for (int i = 2; i <= Math.sqrt(max); i++) {\n\t\t\tif (sosuu[i] == true) {\n\t\t\t\tfor (int j = i + i; j <= max - 1; j += i) {\n\t\t\t\t\tsosuu[j] = false;\n\t\t\t\t}\n\t\t\t}\n \n\t\t}",
"int i = 2;",
"int i = 2;",
"i",
"2",
"i <= Math.sqrt(max)",
"i",
"Math.sqrt(max)",
"Math.sqrt",
"Math",
"max",
"i++",
"i++",
"i",
"{\n\t\t\tif (sosuu[i] == true) {\n\t\t\t\tfor (int j = i + i; j <= max - 1; j += i) {\n\t\t\t\t\tsosuu[j] = false;\n\t\t\t\t}\n\t\t\t}\n \n\t\t}",
"{\n\t\t\tif (sosuu[i] == true) {\n\t\t\t\tfor (int j = i + i; j <= max - 1; j += i) {\n\t\t\t\t\tsosuu[j] = false;\n\t\t\t\t}\n\t\t\t}\n \n\t\t}",
"if (sosuu[i] == true) {\n\t\t\t\tfor (int j = i + i; j <= max - 1; j += i) {\n\t\t\t\t\tsosuu[j] = false;\n\t\t\t\t}\n\t\t\t}",
"sosuu[i] == true",
"sosuu[i]",
"sosuu",
"i",
"true",
"{\n\t\t\t\tfor (int j = i + i; j <= max - 1; j += i) {\n\t\t\t\t\tsosuu[j] = false;\n\t\t\t\t}\n\t\t\t}",
"for (int j = i + i; j <= max - 1; j += i) {\n\t\t\t\t\tsosuu[j] = false;\n\t\t\t\t}",
"int j = i + i;",
"int j = i + i;",
"j",
"i + i",
"i",
"i",
"j <= max - 1",
"j",
"max - 1",
"max",
"1",
"j += i",
"j += i",
"j",
"i",
"{\n\t\t\t\t\tsosuu[j] = false;\n\t\t\t\t}",
"{\n\t\t\t\t\tsosuu[j] = false;\n\t\t\t\t}",
"sosuu[j] = false",
"sosuu[j]",
"sosuu",
"j",
"false",
"Scanner cin = new Scanner (System.in);",
"cin",
"new Scanner (System.in)",
"int x = cin.nextInt();",
"x",
"cin.nextInt()",
"cin.nextInt",
"cin",
"for (int i = 0; i < x; i++) {\n\t\t\tn[i] = cin.nextInt();\n\t\t\tif (sosuu[n[i]] == true) count++;\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < x",
"i",
"x",
"i++",
"i++",
"i",
"{\n\t\t\tn[i] = cin.nextInt();\n\t\t\tif (sosuu[n[i]] == true) count++;\n\t\t}",
"{\n\t\t\tn[i] = cin.nextInt();\n\t\t\tif (sosuu[n[i]] == true) count++;\n\t\t}",
"n[i] = cin.nextInt()",
"n[i]",
"n",
"i",
"cin.nextInt()",
"cin.nextInt",
"cin",
"if (sosuu[n[i]] == true) count++;",
"sosuu[n[i]] == true",
"sosuu[n[i]]",
"sosuu",
"n[i]",
"n",
"i",
"true",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args"
] | import java.util.Scanner;
class Main
{
public static void main (String[] args) throws java.lang.Exception
{
int max = 100000001;
boolean [] sosuu = new boolean [max];
int [] n = new int [10000];
int count = 0;
for (int i = 1; i <= max - 1; i++) {
sosuu[i] = true;
}
sosuu[0] = false;
sosuu[1] = false;
for (int i = 2; i <= Math.sqrt(max); i++) {
if (sosuu[i] == true) {
for (int j = i + i; j <= max - 1; j += i) {
sosuu[j] = false;
}
}
}
Scanner cin = new Scanner (System.in);
int x = cin.nextInt();
for (int i = 0; i < x; i++) {
n[i] = cin.nextInt();
if (sosuu[n[i]] == true) count++;
}
System.out.println(count);
}
//private static void sosuulist() {
//
//}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
4,
13,
4,
18,
13,
30,
0,
13,
17,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
17,
29,
17,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
13,
17,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
17,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
20
],
[
20,
21
],
[
21,
22
],
[
22,
23
],
[
22,
24
],
[
20,
25
],
[
25,
26
],
[
25,
27
],
[
20,
28
],
[
28,
29
],
[
29,
30
],
[
20,
31
],
[
32,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
34,
36
],
[
36,
37
],
[
37,
38
],
[
33,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
8,
43
],
[
43,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
43,
48
],
[
6,
49
],
[
49,
50
],
[
4,
51
],
[
51,
52
],
[
51,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
54,
58
],
[
58,
59
],
[
53,
60
],
[
60,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
61,
65
],
[
60,
66
],
[
66,
67
],
[
53,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
70,
72
],
[
68,
73
],
[
73,
74
],
[
73,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
76,
79
],
[
75,
80
],
[
68,
81
],
[
81,
82
],
[
82,
83
],
[
82,
84
],
[
68,
85
],
[
86,
86
],
[
86,
87
],
[
87,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
88,
92
],
[
87,
93
],
[
93,
94
],
[
94,
95
],
[
53,
96
],
[
96,
97
],
[
51,
98
],
[
98,
99
]
] | [
"import java.util.Scanner;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int cnt = 0;\n\n for(int i = 0; i < n; ++i) {\n \tif(isPrime(sc.nextInt())){\n \t\tcnt += 1;\n \t}\n }\n\n System.out.println(cnt);\n }\n\n public static boolean isPrime(int p) {\n \tif(p == 2) return true;\n \tif(p % 2 == 0) return false;\n\tfor(int q = 3; q < Math.sqrt(p) + 1; q += 2){\n\t\tif(p % q == 0){\n\t\t\treturn false;\n\t\t}\n\t}\n \treturn true;\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int cnt = 0;\n\n for(int i = 0; i < n; ++i) {\n \tif(isPrime(sc.nextInt())){\n \t\tcnt += 1;\n \t}\n }\n\n System.out.println(cnt);\n }\n\n public static boolean isPrime(int p) {\n \tif(p == 2) return true;\n \tif(p % 2 == 0) return false;\n\tfor(int q = 3; q < Math.sqrt(p) + 1; q += 2){\n\t\tif(p % q == 0){\n\t\t\treturn false;\n\t\t}\n\t}\n \treturn true;\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int cnt = 0;\n\n for(int i = 0; i < n; ++i) {\n \tif(isPrime(sc.nextInt())){\n \t\tcnt += 1;\n \t}\n }\n\n System.out.println(cnt);\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int cnt = 0;\n\n for(int i = 0; i < n; ++i) {\n \tif(isPrime(sc.nextInt())){\n \t\tcnt += 1;\n \t}\n }\n\n System.out.println(cnt);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int cnt = 0;",
"cnt",
"0",
"for(int i = 0; i < n; ++i) {\n \tif(isPrime(sc.nextInt())){\n \t\tcnt += 1;\n \t}\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"++i",
"++i",
"i",
"{\n \tif(isPrime(sc.nextInt())){\n \t\tcnt += 1;\n \t}\n }",
"{\n \tif(isPrime(sc.nextInt())){\n \t\tcnt += 1;\n \t}\n }",
"if(isPrime(sc.nextInt())){\n \t\tcnt += 1;\n \t}",
"isPrime(sc.nextInt())",
"isPrime",
"sc.nextInt()",
"sc.nextInt",
"sc",
"{\n \t\tcnt += 1;\n \t}",
"cnt += 1",
"cnt",
"1",
"System.out.println(cnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"String[] args",
"args",
"public static boolean isPrime(int p) {\n \tif(p == 2) return true;\n \tif(p % 2 == 0) return false;\n\tfor(int q = 3; q < Math.sqrt(p) + 1; q += 2){\n\t\tif(p % q == 0){\n\t\t\treturn false;\n\t\t}\n\t}\n \treturn true;\n }",
"isPrime",
"{\n \tif(p == 2) return true;\n \tif(p % 2 == 0) return false;\n\tfor(int q = 3; q < Math.sqrt(p) + 1; q += 2){\n\t\tif(p % q == 0){\n\t\t\treturn false;\n\t\t}\n\t}\n \treturn true;\n }",
"if(p == 2) return true;",
"p == 2",
"p",
"2",
"return true;",
"true",
"if(p % 2 == 0) return false;",
"p % 2 == 0",
"p % 2",
"p",
"2",
"0",
"return false;",
"false",
"for(int q = 3; q < Math.sqrt(p) + 1; q += 2){\n\t\tif(p % q == 0){\n\t\t\treturn false;\n\t\t}\n\t}",
"int q = 3;",
"int q = 3;",
"q",
"3",
"q < Math.sqrt(p) + 1",
"q",
"Math.sqrt(p) + 1",
"Math.sqrt(p)",
"Math.sqrt",
"Math",
"p",
"1",
"q += 2",
"q += 2",
"q",
"2",
"{\n\t\tif(p % q == 0){\n\t\t\treturn false;\n\t\t}\n\t}",
"{\n\t\tif(p % q == 0){\n\t\t\treturn false;\n\t\t}\n\t}",
"if(p % q == 0){\n\t\t\treturn false;\n\t\t}",
"p % q == 0",
"p % q",
"p",
"q",
"0",
"{\n\t\t\treturn false;\n\t\t}",
"return false;",
"false",
"return true;",
"true",
"int p",
"p"
] | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int cnt = 0;
for(int i = 0; i < n; ++i) {
if(isPrime(sc.nextInt())){
cnt += 1;
}
}
System.out.println(cnt);
}
public static boolean isPrime(int p) {
if(p == 2) return true;
if(p % 2 == 0) return false;
for(int q = 3; q < Math.sqrt(p) + 1; q += 2){
if(p % q == 0){
return false;
}
}
return true;
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
4,
18,
13,
14,
4,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
2,
2,
13,
17,
17,
29,
17,
41,
13,
17,
42,
2,
2,
13,
13,
13,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
0,
13,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
113,
11
],
[
113,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
14,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
20,
23
],
[
23,
24
],
[
24,
25
],
[
14,
26
],
[
26,
27
],
[
26,
28
],
[
14,
29
],
[
29,
30
],
[
30,
31
],
[
31,
32
],
[
31,
33
],
[
29,
34
],
[
34,
35
],
[
34,
36
],
[
29,
37
],
[
37,
38
],
[
38,
39
],
[
29,
40
],
[
41,
41
],
[
41,
42
],
[
42,
43
],
[
42,
44
],
[
44,
45
],
[
45,
46
],
[
44,
47
],
[
47,
48
],
[
48,
49
],
[
41,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
50,
54
],
[
54,
55
],
[
55,
56
],
[
14,
57
],
[
57,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
57,
62
],
[
12,
63
],
[
63,
64
],
[
113,
65
],
[
65,
66
],
[
65,
67
],
[
67,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
68,
72
],
[
72,
73
],
[
67,
74
],
[
74,
75
],
[
75,
76
],
[
76,
77
],
[
76,
78
],
[
75,
79
],
[
79,
80
],
[
80,
81
],
[
80,
82
],
[
79,
83
],
[
74,
84
],
[
84,
85
],
[
67,
86
],
[
86,
87
],
[
86,
88
],
[
67,
89
],
[
89,
90
],
[
90,
91
],
[
91,
92
],
[
91,
93
],
[
90,
94
],
[
89,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
98,
99
],
[
98,
100
],
[
97,
101
],
[
96,
102
],
[
102,
103
],
[
103,
104
],
[
95,
105
],
[
105,
106
],
[
105,
107
],
[
67,
108
],
[
108,
109
],
[
65,
110
],
[
110,
111
],
[
0,
112
],
[
112,
113
],
[
112,
114
]
] | [
"import java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int cnt = 0;\n for (int i = 0; i < n; i++){\n int m = Integer.parseInt(br.readLine());\n if (isPrime(m)){\n cnt++;\n }\n }\n System.out.println(cnt);\n }\n static boolean isPrime(int q){\n if (q == 2) return true;\n if (q < 2 || ((q & 1) == 0)) return false;\n \n int i = 3;\n while (i * i <= q){\n if (q % i == 0){\n return false;\n }\n i += 2;\n //if ((i & 1) == 0) i++;\n }\n return true;\n \n }\n}",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"public class Main {\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int cnt = 0;\n for (int i = 0; i < n; i++){\n int m = Integer.parseInt(br.readLine());\n if (isPrime(m)){\n cnt++;\n }\n }\n System.out.println(cnt);\n }\n static boolean isPrime(int q){\n if (q == 2) return true;\n if (q < 2 || ((q & 1) == 0)) return false;\n \n int i = 3;\n while (i * i <= q){\n if (q % i == 0){\n return false;\n }\n i += 2;\n //if ((i & 1) == 0) i++;\n }\n return true;\n \n }\n}",
"Main",
"public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int cnt = 0;\n for (int i = 0; i < n; i++){\n int m = Integer.parseInt(br.readLine());\n if (isPrime(m)){\n cnt++;\n }\n }\n System.out.println(cnt);\n }",
"main",
"{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int cnt = 0;\n for (int i = 0; i < n; i++){\n int m = Integer.parseInt(br.readLine());\n if (isPrime(m)){\n cnt++;\n }\n }\n System.out.println(cnt);\n }",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"int n = Integer.parseInt(br.readLine());",
"n",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"int cnt = 0;",
"cnt",
"0",
"for (int i = 0; i < n; i++){\n int m = Integer.parseInt(br.readLine());\n if (isPrime(m)){\n cnt++;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n int m = Integer.parseInt(br.readLine());\n if (isPrime(m)){\n cnt++;\n }\n }",
"{\n int m = Integer.parseInt(br.readLine());\n if (isPrime(m)){\n cnt++;\n }\n }",
"int m = Integer.parseInt(br.readLine());",
"m",
"Integer.parseInt(br.readLine())",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"if (isPrime(m)){\n cnt++;\n }",
"isPrime(m)",
"isPrime",
"m",
"{\n cnt++;\n }",
"cnt++",
"cnt",
"System.out.println(cnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"String[] args",
"args",
"static boolean isPrime(int q){\n if (q == 2) return true;\n if (q < 2 || ((q & 1) == 0)) return false;\n \n int i = 3;\n while (i * i <= q){\n if (q % i == 0){\n return false;\n }\n i += 2;\n //if ((i & 1) == 0) i++;\n }\n return true;\n \n }",
"isPrime",
"{\n if (q == 2) return true;\n if (q < 2 || ((q & 1) == 0)) return false;\n \n int i = 3;\n while (i * i <= q){\n if (q % i == 0){\n return false;\n }\n i += 2;\n //if ((i & 1) == 0) i++;\n }\n return true;\n \n }",
"if (q == 2) return true;",
"q == 2",
"q",
"2",
"return true;",
"true",
"if (q < 2 || ((q & 1) == 0)) return false;",
"q < 2 || ((q & 1) == 0)",
"q < 2",
"q",
"2",
"((q & 1) == 0)",
"(q & 1)",
"q",
"1",
"0",
"return false;",
"false",
"int i = 3;",
"i",
"3",
"while (i * i <= q){\n if (q % i == 0){\n return false;\n }\n i += 2;\n //if ((i & 1) == 0) i++;\n }",
"i * i <= q",
"i * i",
"i",
"i",
"q",
"{\n if (q % i == 0){\n return false;\n }\n i += 2;\n //if ((i & 1) == 0) i++;\n }",
"if (q % i == 0){\n return false;\n }",
"q % i == 0",
"q % i",
"q",
"i",
"0",
"{\n return false;\n }",
"return false;",
"false",
"i += 2",
"i",
"2",
"return true;",
"true",
"int q",
"q",
"public class Main {\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int cnt = 0;\n for (int i = 0; i < n; i++){\n int m = Integer.parseInt(br.readLine());\n if (isPrime(m)){\n cnt++;\n }\n }\n System.out.println(cnt);\n }\n static boolean isPrime(int q){\n if (q == 2) return true;\n if (q < 2 || ((q & 1) == 0)) return false;\n \n int i = 3;\n while (i * i <= q){\n if (q % i == 0){\n return false;\n }\n i += 2;\n //if ((i & 1) == 0) i++;\n }\n return true;\n \n }\n}",
"public class Main {\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int cnt = 0;\n for (int i = 0; i < n; i++){\n int m = Integer.parseInt(br.readLine());\n if (isPrime(m)){\n cnt++;\n }\n }\n System.out.println(cnt);\n }\n static boolean isPrime(int q){\n if (q == 2) return true;\n if (q < 2 || ((q & 1) == 0)) return false;\n \n int i = 3;\n while (i * i <= q){\n if (q % i == 0){\n return false;\n }\n i += 2;\n //if ((i & 1) == 0) i++;\n }\n return true;\n \n }\n}",
"Main"
] | import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
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());
int cnt = 0;
for (int i = 0; i < n; i++){
int m = Integer.parseInt(br.readLine());
if (isPrime(m)){
cnt++;
}
}
System.out.println(cnt);
}
static boolean isPrime(int q){
if (q == 2) return true;
if (q < 2 || ((q & 1) == 0)) return false;
int i = 3;
while (i * i <= q){
if (q % i == 0){
return false;
}
i += 2;
//if ((i & 1) == 0) i++;
}
return true;
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
14,
2,
13,
17,
30,
0,
13,
17,
14,
2,
2,
2,
13,
17,
17,
2,
13,
17,
30,
0,
13,
17,
30,
41,
13,
4,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
0,
13,
2,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
30,
0,
13,
17,
3,
14,
2,
13,
17,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
14,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
20,
23
],
[
23,
24
],
[
24,
25
],
[
14,
26
],
[
26,
27
],
[
26,
28
],
[
14,
29
],
[
29,
30
],
[
30,
31
],
[
31,
32
],
[
31,
33
],
[
29,
34
],
[
34,
35
],
[
34,
36
],
[
29,
37
],
[
37,
38
],
[
38,
39
],
[
29,
40
],
[
41,
41
],
[
41,
42
],
[
42,
43
],
[
42,
44
],
[
44,
45
],
[
45,
46
],
[
44,
47
],
[
47,
48
],
[
48,
49
],
[
41,
50
],
[
50,
51
],
[
50,
52
],
[
41,
53
],
[
53,
54
],
[
54,
55
],
[
54,
56
],
[
53,
57
],
[
57,
58
],
[
58,
59
],
[
58,
60
],
[
53,
61
],
[
61,
62
],
[
62,
63
],
[
63,
64
],
[
64,
65
],
[
64,
66
],
[
63,
67
],
[
62,
68
],
[
68,
69
],
[
68,
70
],
[
61,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
61,
75
],
[
75,
76
],
[
76,
77
],
[
76,
78
],
[
78,
79
],
[
79,
80
],
[
78,
81
],
[
75,
82
],
[
82,
83
],
[
83,
84
],
[
84,
85
],
[
84,
86
],
[
82,
87
],
[
87,
88
],
[
87,
89
],
[
82,
90
],
[
90,
91
],
[
91,
92
],
[
91,
93
],
[
93,
94
],
[
93,
95
],
[
82,
96
],
[
97,
97
],
[
97,
98
],
[
98,
99
],
[
99,
100
],
[
100,
101
],
[
100,
102
],
[
99,
103
],
[
98,
104
],
[
104,
105
],
[
105,
106
],
[
105,
107
],
[
104,
108
],
[
41,
109
],
[
109,
110
],
[
110,
111
],
[
110,
112
],
[
109,
113
],
[
113,
114
],
[
114,
115
],
[
14,
116
],
[
116,
117
],
[
117,
118
],
[
118,
119
],
[
118,
120
],
[
116,
121
],
[
12,
122
],
[
122,
123
]
] | [
"\n\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\nclass Main{\n public static void main(String args[]) throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n int n = Integer.parseInt( br.readLine() );\n\n int answer = 0;\n\n for(int i = 0 ; i < n; i++){\n int x = Integer.parseInt( br.readLine() );\n int flag = 0;\n\n if(x == 2){\n \tflag = 0;\n\n }else if( x%2 == 0 || x < 2){\n \tflag = 1;\n\n }else{\n\n double sqrt = Math.sqrt(x);\n for(int j = 3; j <= sqrt; j = j+2){\n \t if(x % j ==0){\n \t\tflag = 1;\n\n \t\tbreak;\n \t }\n }\n\n }\n\n\n \tif(flag == 0){\n\n \t\tanswer++;\n\n \t}\n\n }\n\n\n\n System.out.println(answer);\n }\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"class Main{\n public static void main(String args[]) throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n int n = Integer.parseInt( br.readLine() );\n\n int answer = 0;\n\n for(int i = 0 ; i < n; i++){\n int x = Integer.parseInt( br.readLine() );\n int flag = 0;\n\n if(x == 2){\n \tflag = 0;\n\n }else if( x%2 == 0 || x < 2){\n \tflag = 1;\n\n }else{\n\n double sqrt = Math.sqrt(x);\n for(int j = 3; j <= sqrt; j = j+2){\n \t if(x % j ==0){\n \t\tflag = 1;\n\n \t\tbreak;\n \t }\n }\n\n }\n\n\n \tif(flag == 0){\n\n \t\tanswer++;\n\n \t}\n\n }\n\n\n\n System.out.println(answer);\n }\n}",
"Main",
"public static void main(String args[]) throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n int n = Integer.parseInt( br.readLine() );\n\n int answer = 0;\n\n for(int i = 0 ; i < n; i++){\n int x = Integer.parseInt( br.readLine() );\n int flag = 0;\n\n if(x == 2){\n \tflag = 0;\n\n }else if( x%2 == 0 || x < 2){\n \tflag = 1;\n\n }else{\n\n double sqrt = Math.sqrt(x);\n for(int j = 3; j <= sqrt; j = j+2){\n \t if(x % j ==0){\n \t\tflag = 1;\n\n \t\tbreak;\n \t }\n }\n\n }\n\n\n \tif(flag == 0){\n\n \t\tanswer++;\n\n \t}\n\n }\n\n\n\n System.out.println(answer);\n }",
"main",
"{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n int n = Integer.parseInt( br.readLine() );\n\n int answer = 0;\n\n for(int i = 0 ; i < n; i++){\n int x = Integer.parseInt( br.readLine() );\n int flag = 0;\n\n if(x == 2){\n \tflag = 0;\n\n }else if( x%2 == 0 || x < 2){\n \tflag = 1;\n\n }else{\n\n double sqrt = Math.sqrt(x);\n for(int j = 3; j <= sqrt; j = j+2){\n \t if(x % j ==0){\n \t\tflag = 1;\n\n \t\tbreak;\n \t }\n }\n\n }\n\n\n \tif(flag == 0){\n\n \t\tanswer++;\n\n \t}\n\n }\n\n\n\n System.out.println(answer);\n }",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"int n = Integer.parseInt( br.readLine() );",
"n",
"Integer.parseInt( br.readLine() )",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"int answer = 0;",
"answer",
"0",
"for(int i = 0 ; i < n; i++){\n int x = Integer.parseInt( br.readLine() );\n int flag = 0;\n\n if(x == 2){\n \tflag = 0;\n\n }else if( x%2 == 0 || x < 2){\n \tflag = 1;\n\n }else{\n\n double sqrt = Math.sqrt(x);\n for(int j = 3; j <= sqrt; j = j+2){\n \t if(x % j ==0){\n \t\tflag = 1;\n\n \t\tbreak;\n \t }\n }\n\n }\n\n\n \tif(flag == 0){\n\n \t\tanswer++;\n\n \t}\n\n }",
"int i = 0 ;",
"int i = 0 ;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n int x = Integer.parseInt( br.readLine() );\n int flag = 0;\n\n if(x == 2){\n \tflag = 0;\n\n }else if( x%2 == 0 || x < 2){\n \tflag = 1;\n\n }else{\n\n double sqrt = Math.sqrt(x);\n for(int j = 3; j <= sqrt; j = j+2){\n \t if(x % j ==0){\n \t\tflag = 1;\n\n \t\tbreak;\n \t }\n }\n\n }\n\n\n \tif(flag == 0){\n\n \t\tanswer++;\n\n \t}\n\n }",
"{\n int x = Integer.parseInt( br.readLine() );\n int flag = 0;\n\n if(x == 2){\n \tflag = 0;\n\n }else if( x%2 == 0 || x < 2){\n \tflag = 1;\n\n }else{\n\n double sqrt = Math.sqrt(x);\n for(int j = 3; j <= sqrt; j = j+2){\n \t if(x % j ==0){\n \t\tflag = 1;\n\n \t\tbreak;\n \t }\n }\n\n }\n\n\n \tif(flag == 0){\n\n \t\tanswer++;\n\n \t}\n\n }",
"int x = Integer.parseInt( br.readLine() );",
"x",
"Integer.parseInt( br.readLine() )",
"Integer.parseInt",
"Integer",
"br.readLine()",
"br.readLine",
"br",
"int flag = 0;",
"flag",
"0",
"if(x == 2){\n \tflag = 0;\n\n }else if( x%2 == 0 || x < 2){\n \tflag = 1;\n\n }else{\n\n double sqrt = Math.sqrt(x);\n for(int j = 3; j <= sqrt; j = j+2){\n \t if(x % j ==0){\n \t\tflag = 1;\n\n \t\tbreak;\n \t }\n }\n\n }",
"x == 2",
"x",
"2",
"{\n \tflag = 0;\n\n }",
"flag = 0",
"flag",
"0",
"if( x%2 == 0 || x < 2){\n \tflag = 1;\n\n }else{\n\n double sqrt = Math.sqrt(x);\n for(int j = 3; j <= sqrt; j = j+2){\n \t if(x % j ==0){\n \t\tflag = 1;\n\n \t\tbreak;\n \t }\n }\n\n }",
"x%2 == 0 || x < 2",
"x%2 == 0",
"x%2",
"x",
"2",
"0",
"x < 2",
"x",
"2",
"{\n \tflag = 1;\n\n }",
"flag = 1",
"flag",
"1",
"{\n\n double sqrt = Math.sqrt(x);\n for(int j = 3; j <= sqrt; j = j+2){\n \t if(x % j ==0){\n \t\tflag = 1;\n\n \t\tbreak;\n \t }\n }\n\n }",
"double sqrt = Math.sqrt(x);",
"sqrt",
"Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"for(int j = 3; j <= sqrt; j = j+2){\n \t if(x % j ==0){\n \t\tflag = 1;\n\n \t\tbreak;\n \t }\n }",
"int j = 3;",
"int j = 3;",
"j",
"3",
"j <= sqrt",
"j",
"sqrt",
"j = j+2",
"j = j+2",
"j",
"j+2",
"j",
"2",
"{\n \t if(x % j ==0){\n \t\tflag = 1;\n\n \t\tbreak;\n \t }\n }",
"{\n \t if(x % j ==0){\n \t\tflag = 1;\n\n \t\tbreak;\n \t }\n }",
"if(x % j ==0){\n \t\tflag = 1;\n\n \t\tbreak;\n \t }",
"x % j ==0",
"x % j",
"x",
"j",
"0",
"{\n \t\tflag = 1;\n\n \t\tbreak;\n \t }",
"flag = 1",
"flag",
"1",
"break;",
"if(flag == 0){\n\n \t\tanswer++;\n\n \t}",
"flag == 0",
"flag",
"0",
"{\n\n \t\tanswer++;\n\n \t}",
"answer++",
"answer",
"System.out.println(answer)",
"System.out.println",
"System.out",
"System",
"System.out",
"answer",
"String args[]",
"args"
] |
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;
for(int i = 0 ; i < n; i++){
int x = Integer.parseInt( br.readLine() );
int flag = 0;
if(x == 2){
flag = 0;
}else if( x%2 == 0 || x < 2){
flag = 1;
}else{
double sqrt = Math.sqrt(x);
for(int j = 3; j <= sqrt; j = j+2){
if(x % j ==0){
flag = 1;
break;
}
}
}
if(flag == 0){
answer++;
}
}
System.out.println(answer);
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
2,
13,
17,
14,
2,
2,
2,
13,
17,
17,
2,
2,
13,
17,
17,
30,
29,
17,
41,
13,
17,
42,
2,
2,
13,
13,
13,
30,
14,
2,
2,
2,
13,
13,
17,
2,
2,
13,
2,
13,
17,
17,
30,
29,
17,
0,
13,
2,
13,
17,
29,
17,
23,
13,
12,
13,
30,
41,
13,
17,
28,
13,
13,
30,
30,
14,
4,
13,
13,
30,
40,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
13,
41,
13,
17,
42,
2,
13,
13,
30,
41,
13,
4,
18,
13,
0,
18,
13,
13,
13,
40,
13,
4,
18,
13,
41,
13,
4,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
143,
5
],
[
143,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
10,
11
],
[
10,
12
],
[
9,
13
],
[
13,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
9,
18
],
[
18,
19
],
[
19,
20
],
[
20,
21
],
[
21,
22
],
[
21,
23
],
[
20,
24
],
[
19,
25
],
[
25,
26
],
[
26,
27
],
[
26,
28
],
[
25,
29
],
[
18,
30
],
[
30,
31
],
[
31,
32
],
[
8,
33
],
[
33,
34
],
[
33,
35
],
[
8,
36
],
[
36,
37
],
[
37,
38
],
[
38,
39
],
[
38,
40
],
[
37,
41
],
[
36,
42
],
[
42,
43
],
[
43,
44
],
[
44,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
45,
49
],
[
44,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
53,
54
],
[
53,
55
],
[
50,
56
],
[
43,
57
],
[
57,
58
],
[
58,
59
],
[
42,
60
],
[
60,
61
],
[
60,
62
],
[
62,
63
],
[
62,
64
],
[
8,
65
],
[
65,
66
],
[
6,
67
],
[
67,
68
],
[
143,
69
],
[
69,
70
],
[
69,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
71,
75
],
[
75,
76
],
[
75,
77
],
[
75,
78
],
[
79,
79
],
[
79,
80
],
[
80,
81
],
[
81,
82
],
[
81,
83
],
[
80,
84
],
[
84,
85
],
[
85,
86
],
[
71,
87
],
[
87,
88
],
[
69,
89
],
[
89,
90
],
[
143,
91
],
[
91,
92
],
[
91,
93
],
[
93,
94
],
[
94,
95
],
[
94,
96
],
[
93,
97
],
[
97,
98
],
[
97,
99
],
[
99,
100
],
[
100,
101
],
[
93,
102
],
[
102,
103
],
[
102,
104
],
[
93,
106
],
[
106,
107
],
[
106,
108
],
[
93,
109
],
[
109,
110
],
[
110,
111
],
[
110,
112
],
[
109,
113
],
[
113,
114
],
[
114,
115
],
[
114,
116
],
[
116,
117
],
[
117,
118
],
[
113,
119
],
[
119,
120
],
[
120,
121
],
[
120,
122
],
[
119,
123
],
[
113,
124
],
[
124,
125
],
[
93,
126
],
[
126,
127
],
[
127,
128
],
[
93,
129
],
[
129,
130
],
[
129,
131
],
[
131,
132
],
[
131,
133
],
[
93,
134
],
[
134,
135
],
[
135,
136
],
[
136,
137
],
[
136,
138
],
[
134,
139
],
[
91,
140
],
[
140,
141
],
[
0,
142
],
[
142,
143
],
[
142,
144
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n\t\n\t/*public static Boolean primenumber(int n) {\n\t\tBoolean result = true;\n\t\tint mid = (int)(n^(1/2));\n\t\tif (n > 2) {\n\t\t\tfor (int i = 2; i < mid; i++) {\n\t\t\t\tif (n%i == 0) {\n\t\t\t\t\tresult = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}*/\n\t\n\tpublic static Boolean primenumber(int n) {\n\t\tif (n <= 3) {\n\t\t\treturn n > 1;\n\t\t}\n\t\telse if (n%2 == 0 || n%3 == 0) {\n\t\t\treturn false;\n\t\t}\n\t\tint i = 5;\n\t\twhile (i*i <= n) {\n\t\t\tif (n%i == 0 || n%(i + 2) == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i + 6;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tpublic static int numberprimes(int[] P) {\n\t\tint counter = 0;\n\t\tfor (int p : P) {\n\t\t\tif (primenumber(p)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\t\t}\n\t\treturn counter;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint numintegers = in.nextInt();\n\t\tint[] P = new int[numintegers];\n\t\tint index = 0;\n\t\twhile (index < numintegers) {\n\t\t\tint num = in.nextInt();\n\t\t\tP[index] = num;\n\t\t\tindex++;\n\t\t}\n\t\tin.close();\n\t\tint result = numberprimes(P);\n\t\tSystem.out.println(result);\n\t}\n}\n",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\t\n\t/*public static Boolean primenumber(int n) {\n\t\tBoolean result = true;\n\t\tint mid = (int)(n^(1/2));\n\t\tif (n > 2) {\n\t\t\tfor (int i = 2; i < mid; i++) {\n\t\t\t\tif (n%i == 0) {\n\t\t\t\t\tresult = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}*/\n\t\n\tpublic static Boolean primenumber(int n) {\n\t\tif (n <= 3) {\n\t\t\treturn n > 1;\n\t\t}\n\t\telse if (n%2 == 0 || n%3 == 0) {\n\t\t\treturn false;\n\t\t}\n\t\tint i = 5;\n\t\twhile (i*i <= n) {\n\t\t\tif (n%i == 0 || n%(i + 2) == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i + 6;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tpublic static int numberprimes(int[] P) {\n\t\tint counter = 0;\n\t\tfor (int p : P) {\n\t\t\tif (primenumber(p)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\t\t}\n\t\treturn counter;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint numintegers = in.nextInt();\n\t\tint[] P = new int[numintegers];\n\t\tint index = 0;\n\t\twhile (index < numintegers) {\n\t\t\tint num = in.nextInt();\n\t\t\tP[index] = num;\n\t\t\tindex++;\n\t\t}\n\t\tin.close();\n\t\tint result = numberprimes(P);\n\t\tSystem.out.println(result);\n\t}\n}",
"Main",
"public static Boolean primenumber(int n) {\n\t\tif (n <= 3) {\n\t\t\treturn n > 1;\n\t\t}\n\t\telse if (n%2 == 0 || n%3 == 0) {\n\t\t\treturn false;\n\t\t}\n\t\tint i = 5;\n\t\twhile (i*i <= n) {\n\t\t\tif (n%i == 0 || n%(i + 2) == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i + 6;\n\t\t}\n\t\treturn true;\n\t}",
"primenumber",
"{\n\t\tif (n <= 3) {\n\t\t\treturn n > 1;\n\t\t}\n\t\telse if (n%2 == 0 || n%3 == 0) {\n\t\t\treturn false;\n\t\t}\n\t\tint i = 5;\n\t\twhile (i*i <= n) {\n\t\t\tif (n%i == 0 || n%(i + 2) == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i + 6;\n\t\t}\n\t\treturn true;\n\t}",
"if (n <= 3) {\n\t\t\treturn n > 1;\n\t\t}\n\t\telse if (n%2 == 0 || n%3 == 0) {\n\t\t\treturn false;\n\t\t}",
"n <= 3",
"n",
"3",
"{\n\t\t\treturn n > 1;\n\t\t}",
"return n > 1;",
"n > 1",
"n",
"1",
"if (n%2 == 0 || n%3 == 0) {\n\t\t\treturn false;\n\t\t}",
"n%2 == 0 || n%3 == 0",
"n%2 == 0",
"n%2",
"n",
"2",
"0",
"n%3 == 0",
"n%3",
"n",
"3",
"0",
"{\n\t\t\treturn false;\n\t\t}",
"return false;",
"false",
"int i = 5;",
"i",
"5",
"while (i*i <= n) {\n\t\t\tif (n%i == 0 || n%(i + 2) == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i + 6;\n\t\t}",
"i*i <= n",
"i*i",
"i",
"i",
"n",
"{\n\t\t\tif (n%i == 0 || n%(i + 2) == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i + 6;\n\t\t}",
"if (n%i == 0 || n%(i + 2) == 0) {\n\t\t\t\treturn false;\n\t\t\t}",
"n%i == 0 || n%(i + 2) == 0",
"n%i == 0",
"n%i",
"n",
"i",
"0",
"n%(i + 2) == 0",
"n%(i + 2)",
"n",
"(i + 2)",
"i",
"2",
"0",
"{\n\t\t\t\treturn false;\n\t\t\t}",
"return false;",
"false",
"i = i + 6",
"i",
"i + 6",
"i",
"6",
"return true;",
"true",
"int n",
"n",
"public static int numberprimes(int[] P) {\n\t\tint counter = 0;\n\t\tfor (int p : P) {\n\t\t\tif (primenumber(p)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\t\t}\n\t\treturn counter;\n\t}",
"numberprimes",
"{\n\t\tint counter = 0;\n\t\tfor (int p : P) {\n\t\t\tif (primenumber(p)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\t\t}\n\t\treturn counter;\n\t}",
"int counter = 0;",
"counter",
"0",
"for (int p : P) {\n\t\t\tif (primenumber(p)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\t\t}",
"int p",
"P",
"{\n\t\t\tif (primenumber(p)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\t\t}",
"{\n\t\t\tif (primenumber(p)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\t\t}",
"if (primenumber(p)) {\n\t\t\t\tcounter++;\n\t\t\t}",
"primenumber(p)",
"primenumber",
"p",
"{\n\t\t\t\tcounter++;\n\t\t\t}",
"counter++",
"counter",
"return counter;",
"counter",
"int[] P",
"P",
"public static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint numintegers = in.nextInt();\n\t\tint[] P = new int[numintegers];\n\t\tint index = 0;\n\t\twhile (index < numintegers) {\n\t\t\tint num = in.nextInt();\n\t\t\tP[index] = num;\n\t\t\tindex++;\n\t\t}\n\t\tin.close();\n\t\tint result = numberprimes(P);\n\t\tSystem.out.println(result);\n\t}",
"main",
"{\n\t\tScanner in = new Scanner(System.in);\n\t\tint numintegers = in.nextInt();\n\t\tint[] P = new int[numintegers];\n\t\tint index = 0;\n\t\twhile (index < numintegers) {\n\t\t\tint num = in.nextInt();\n\t\t\tP[index] = num;\n\t\t\tindex++;\n\t\t}\n\t\tin.close();\n\t\tint result = numberprimes(P);\n\t\tSystem.out.println(result);\n\t}",
"Scanner in = new Scanner(System.in);",
"in",
"new Scanner(System.in)",
"int numintegers = in.nextInt();",
"numintegers",
"in.nextInt()",
"in.nextInt",
"in",
"int[] P = new int[numintegers];",
"P",
"new int[numintegers]",
"numintegers",
"int index = 0;",
"index",
"0",
"while (index < numintegers) {\n\t\t\tint num = in.nextInt();\n\t\t\tP[index] = num;\n\t\t\tindex++;\n\t\t}",
"index < numintegers",
"index",
"numintegers",
"{\n\t\t\tint num = in.nextInt();\n\t\t\tP[index] = num;\n\t\t\tindex++;\n\t\t}",
"int num = in.nextInt();",
"num",
"in.nextInt()",
"in.nextInt",
"in",
"P[index] = num",
"P[index]",
"P",
"index",
"num",
"index++",
"index",
"in.close()",
"in.close",
"in",
"int result = numberprimes(P);",
"result",
"numberprimes(P)",
"numberprimes",
"P",
"System.out.println(result)",
"System.out.println",
"System.out",
"System",
"System.out",
"result",
"String[] args",
"args",
"public class Main {\n\t\n\t/*public static Boolean primenumber(int n) {\n\t\tBoolean result = true;\n\t\tint mid = (int)(n^(1/2));\n\t\tif (n > 2) {\n\t\t\tfor (int i = 2; i < mid; i++) {\n\t\t\t\tif (n%i == 0) {\n\t\t\t\t\tresult = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}*/\n\t\n\tpublic static Boolean primenumber(int n) {\n\t\tif (n <= 3) {\n\t\t\treturn n > 1;\n\t\t}\n\t\telse if (n%2 == 0 || n%3 == 0) {\n\t\t\treturn false;\n\t\t}\n\t\tint i = 5;\n\t\twhile (i*i <= n) {\n\t\t\tif (n%i == 0 || n%(i + 2) == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i + 6;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tpublic static int numberprimes(int[] P) {\n\t\tint counter = 0;\n\t\tfor (int p : P) {\n\t\t\tif (primenumber(p)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\t\t}\n\t\treturn counter;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint numintegers = in.nextInt();\n\t\tint[] P = new int[numintegers];\n\t\tint index = 0;\n\t\twhile (index < numintegers) {\n\t\t\tint num = in.nextInt();\n\t\t\tP[index] = num;\n\t\t\tindex++;\n\t\t}\n\t\tin.close();\n\t\tint result = numberprimes(P);\n\t\tSystem.out.println(result);\n\t}\n}",
"public class Main {\n\t\n\t/*public static Boolean primenumber(int n) {\n\t\tBoolean result = true;\n\t\tint mid = (int)(n^(1/2));\n\t\tif (n > 2) {\n\t\t\tfor (int i = 2; i < mid; i++) {\n\t\t\t\tif (n%i == 0) {\n\t\t\t\t\tresult = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}*/\n\t\n\tpublic static Boolean primenumber(int n) {\n\t\tif (n <= 3) {\n\t\t\treturn n > 1;\n\t\t}\n\t\telse if (n%2 == 0 || n%3 == 0) {\n\t\t\treturn false;\n\t\t}\n\t\tint i = 5;\n\t\twhile (i*i <= n) {\n\t\t\tif (n%i == 0 || n%(i + 2) == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti = i + 6;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tpublic static int numberprimes(int[] P) {\n\t\tint counter = 0;\n\t\tfor (int p : P) {\n\t\t\tif (primenumber(p)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\t\t}\n\t\treturn counter;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint numintegers = in.nextInt();\n\t\tint[] P = new int[numintegers];\n\t\tint index = 0;\n\t\twhile (index < numintegers) {\n\t\t\tint num = in.nextInt();\n\t\t\tP[index] = num;\n\t\t\tindex++;\n\t\t}\n\t\tin.close();\n\t\tint result = numberprimes(P);\n\t\tSystem.out.println(result);\n\t}\n}",
"Main"
] | import java.util.Scanner;
public class Main {
/*public static Boolean primenumber(int n) {
Boolean result = true;
int mid = (int)(n^(1/2));
if (n > 2) {
for (int i = 2; i < mid; i++) {
if (n%i == 0) {
result = false;
break;
}
}
}
return result;
}*/
public static Boolean primenumber(int n) {
if (n <= 3) {
return n > 1;
}
else if (n%2 == 0 || n%3 == 0) {
return false;
}
int i = 5;
while (i*i <= n) {
if (n%i == 0 || n%(i + 2) == 0) {
return false;
}
i = i + 6;
}
return true;
}
public static int numberprimes(int[] P) {
int counter = 0;
for (int p : P) {
if (primenumber(p)) {
counter++;
}
}
return counter;
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int numintegers = in.nextInt();
int[] P = new int[numintegers];
int index = 0;
while (index < numintegers) {
int num = in.nextInt();
P[index] = num;
index++;
}
in.close();
int result = numberprimes(P);
System.out.println(result);
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
4,
13,
4,
18,
13,
4,
18,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
2,
2,
13,
17,
17,
29,
17,
41,
13,
17,
42,
2,
13,
4,
18,
13,
13,
30,
14,
2,
2,
13,
13,
17,
29,
17,
0,
13,
2,
13,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
108,
8
],
[
108,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
11,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
17,
20
],
[
20,
21
],
[
21,
22
],
[
11,
23
],
[
23,
24
],
[
23,
25
],
[
11,
26
],
[
26,
27
],
[
27,
28
],
[
28,
29
],
[
28,
30
],
[
26,
31
],
[
31,
32
],
[
31,
33
],
[
26,
34
],
[
34,
35
],
[
35,
36
],
[
26,
37
],
[
38,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
42,
43
],
[
43,
44
],
[
42,
45
],
[
45,
46
],
[
46,
47
],
[
39,
48
],
[
48,
49
],
[
11,
50
],
[
50,
51
],
[
51,
52
],
[
52,
53
],
[
52,
54
],
[
50,
55
],
[
9,
56
],
[
56,
57
],
[
108,
58
],
[
58,
59
],
[
58,
60
],
[
60,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
61,
65
],
[
65,
66
],
[
60,
67
],
[
67,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
68,
72
],
[
72,
73
],
[
73,
74
],
[
73,
75
],
[
72,
76
],
[
67,
77
],
[
77,
78
],
[
60,
79
],
[
79,
80
],
[
79,
81
],
[
60,
82
],
[
82,
83
],
[
83,
84
],
[
83,
85
],
[
85,
86
],
[
86,
87
],
[
85,
88
],
[
82,
89
],
[
89,
90
],
[
90,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
91,
95
],
[
90,
96
],
[
96,
97
],
[
89,
98
],
[
98,
99
],
[
98,
100
],
[
100,
101
],
[
100,
102
],
[
60,
103
],
[
103,
104
],
[
58,
105
],
[
105,
106
],
[
0,
107
],
[
107,
108
],
[
107,
109
]
] | [
"import java.util.*;\nimport java.io.*;\npublic class Main{\n\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n int n = Integer.parseInt(sc.next());\n int count=0;\n for(int i=0; i<n; i++){\n if(isPrime(Integer.parseInt(sc.next()))) count++;\n }\n System.out.println(count);\n\n }\n //素数判定\n public static boolean isPrime(int x){\n if(x == 2) return true;\n if(x < 2 || x % 2 == 0) return false;\n \n int i = 3;\n while(i <= Math.sqrt(x)){\n if(x % i == 0) return false;\n i = i + 2;\n }\n return true;\n }\n}\n",
"import java.util.*;",
"util.*",
"java",
"import java.io.*;",
"io.*",
"java",
"public class Main{\n\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n int n = Integer.parseInt(sc.next());\n int count=0;\n for(int i=0; i<n; i++){\n if(isPrime(Integer.parseInt(sc.next()))) count++;\n }\n System.out.println(count);\n\n }\n //素数判定\n public static boolean isPrime(int x){\n if(x == 2) return true;\n if(x < 2 || x % 2 == 0) return false;\n \n int i = 3;\n while(i <= Math.sqrt(x)){\n if(x % i == 0) return false;\n i = i + 2;\n }\n return true;\n }\n}",
"Main",
"public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n int n = Integer.parseInt(sc.next());\n int count=0;\n for(int i=0; i<n; i++){\n if(isPrime(Integer.parseInt(sc.next()))) count++;\n }\n System.out.println(count);\n\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n\n int n = Integer.parseInt(sc.next());\n int count=0;\n for(int i=0; i<n; i++){\n if(isPrime(Integer.parseInt(sc.next()))) count++;\n }\n System.out.println(count);\n\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = Integer.parseInt(sc.next());",
"n",
"Integer.parseInt(sc.next())",
"Integer.parseInt",
"Integer",
"sc.next()",
"sc.next",
"sc",
"int count=0;",
"count",
"0",
"for(int i=0; i<n; i++){\n if(isPrime(Integer.parseInt(sc.next()))) count++;\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n if(isPrime(Integer.parseInt(sc.next()))) count++;\n }",
"{\n if(isPrime(Integer.parseInt(sc.next()))) count++;\n }",
"if(isPrime(Integer.parseInt(sc.next()))) count++;",
"isPrime(Integer.parseInt(sc.next()))",
"isPrime",
"Integer.parseInt(sc.next())",
"Integer.parseInt",
"Integer",
"sc.next()",
"sc.next",
"sc",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"//素数判定\n public static boolean isPrime(int x){\n if(x == 2) return true;\n if(x < 2 || x % 2 == 0) return false;\n \n int i = 3;\n while(i <= Math.sqrt(x)){\n if(x % i == 0) return false;\n i = i + 2;\n }\n return true;\n }",
"isPrime",
"{\n if(x == 2) return true;\n if(x < 2 || x % 2 == 0) return false;\n \n int i = 3;\n while(i <= Math.sqrt(x)){\n if(x % i == 0) return false;\n i = i + 2;\n }\n return true;\n }",
"if(x == 2) return true;",
"x == 2",
"x",
"2",
"return true;",
"true",
"if(x < 2 || x % 2 == 0) return false;",
"x < 2 || x % 2 == 0",
"x < 2",
"x",
"2",
"x % 2 == 0",
"x % 2",
"x",
"2",
"0",
"return false;",
"false",
"int i = 3;",
"i",
"3",
"while(i <= Math.sqrt(x)){\n if(x % i == 0) return false;\n i = i + 2;\n }",
"i <= Math.sqrt(x)",
"i",
"Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"{\n if(x % i == 0) return false;\n i = i + 2;\n }",
"if(x % i == 0) return false;",
"x % i == 0",
"x % i",
"x",
"i",
"0",
"return false;",
"false",
"i = i + 2",
"i",
"i + 2",
"i",
"2",
"return true;",
"true",
"int x",
"x",
"public class Main{\n\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n int n = Integer.parseInt(sc.next());\n int count=0;\n for(int i=0; i<n; i++){\n if(isPrime(Integer.parseInt(sc.next()))) count++;\n }\n System.out.println(count);\n\n }\n //素数判定\n public static boolean isPrime(int x){\n if(x == 2) return true;\n if(x < 2 || x % 2 == 0) return false;\n \n int i = 3;\n while(i <= Math.sqrt(x)){\n if(x % i == 0) return false;\n i = i + 2;\n }\n return true;\n }\n}",
"public class Main{\n\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n int n = Integer.parseInt(sc.next());\n int count=0;\n for(int i=0; i<n; i++){\n if(isPrime(Integer.parseInt(sc.next()))) count++;\n }\n System.out.println(count);\n\n }\n //素数判定\n public static boolean isPrime(int x){\n if(x == 2) return true;\n if(x < 2 || x % 2 == 0) return false;\n \n int i = 3;\n while(i <= Math.sqrt(x)){\n if(x % i == 0) return false;\n i = i + 2;\n }\n return true;\n }\n}",
"Main"
] | import java.util.*;
import java.io.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
int count=0;
for(int i=0; i<n; i++){
if(isPrime(Integer.parseInt(sc.next()))) count++;
}
System.out.println(count);
}
//素数判定
public static boolean isPrime(int x){
if(x == 2) return true;
if(x < 2 || x % 2 == 0) return false;
int i = 3;
while(i <= Math.sqrt(x)){
if(x % i == 0) return false;
i = i + 2;
}
return true;
}
}
|
[
7,
15,
13,
17,
6,
13,
41,
13,
17,
12,
13,
30,
41,
13,
20,
2,
13,
17,
0,
18,
13,
17,
0,
18,
13,
17,
17,
41,
13,
4,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
40,
18,
13,
13,
30,
11,
1,
41,
13,
2,
17,
13,
2,
13,
13,
1,
0,
13,
13,
30,
30,
0,
18,
13,
13,
17,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
13,
13,
41,
13,
4,
18,
13,
41,
13,
17,
42,
2,
13,
17,
30,
0,
13,
8,
40,
18,
13,
4,
18,
13,
17,
17,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
123,
5
],
[
123,
6
],
[
6,
7
],
[
6,
8
],
[
123,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
15,
16
],
[
15,
17
],
[
11,
18
],
[
18,
19
],
[
19,
20
],
[
19,
21
],
[
18,
22
],
[
22,
23
],
[
23,
24
],
[
23,
25
],
[
22,
26
],
[
11,
27
],
[
27,
28
],
[
27,
29
],
[
29,
30
],
[
30,
31
],
[
29,
32
],
[
11,
33
],
[
33,
34
],
[
34,
35
],
[
35,
36
],
[
35,
37
],
[
33,
38
],
[
38,
39
],
[
38,
40
],
[
33,
41
],
[
41,
42
],
[
42,
43
],
[
33,
44
],
[
45,
45
],
[
45,
46
],
[
46,
47
],
[
47,
48
],
[
48,
49
],
[
48,
50
],
[
46,
51
],
[
51,
52
],
[
52,
53
],
[
53,
54
],
[
54,
55
],
[
54,
56
],
[
56,
57
],
[
56,
58
],
[
52,
59
],
[
59,
60
],
[
59,
61
],
[
52,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
52,
66
],
[
67,
67
],
[
67,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
68,
72
],
[
11,
73
],
[
73,
74
],
[
9,
75
],
[
75,
76
],
[
123,
77
],
[
77,
78
],
[
77,
79
],
[
79,
80
],
[
80,
81
],
[
80,
82
],
[
79,
83
],
[
83,
84
],
[
83,
85
],
[
85,
86
],
[
85,
87
],
[
79,
88
],
[
88,
89
],
[
88,
90
],
[
90,
91
],
[
91,
92
],
[
79,
93
],
[
93,
94
],
[
93,
95
],
[
79,
96
],
[
96,
97
],
[
97,
98
],
[
97,
99
],
[
96,
100
],
[
100,
101
],
[
101,
102
],
[
101,
103
],
[
103,
104
],
[
104,
105
],
[
105,
106
],
[
105,
107
],
[
107,
108
],
[
108,
109
],
[
103,
110
],
[
103,
111
],
[
100,
112
],
[
112,
113
],
[
79,
114
],
[
114,
115
],
[
115,
116
],
[
116,
117
],
[
116,
118
],
[
114,
119
],
[
77,
120
],
[
120,
121
],
[
0,
122
],
[
122,
123
],
[
122,
124
]
] | [
"\n//implement the sieve of eratos\nimport java.util.Scanner;\n\n\n//we will use the filter method to construct the prime table from 1 to n\n\n\npublic class Main {\n\t//we can thus use binary search to check whether i is in the table\n\tstatic final int N = 100000000;\n\t\n\t\n\t\n\t// this is no good for java, so slow\n\tpublic static boolean[] eratos(int n){\n\t\t// the original value should be false\n\t\tboolean [] table = new boolean[n+1];\n\t\t\n\t\ttable[0] = table[1] = true;\n\t\t\n\t\tint k = (int)Math.sqrt(n);\n\t\tfor(int i = 2; i <= k; i++) {\n\t\t\tif(!table[i]) {\n\t\t\t\tfor(int j = 2*i; j <= n; j+=i) {\n\t\t\t\t\ttable[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn table;\n\t}\n\t\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tboolean[] table = eratos(N);\n\t\t\n\t\tint len = cin.nextInt();\n\t\tint count = 0;\n\n\t\t\n\t\twhile(len > 0) {\n\t\t\tcount += (!table[cin.nextInt()])? 1:0;\n\t\t\tlen--;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\t//we can thus use binary search to check whether i is in the table\n\tstatic final int N = 100000000;\n\t\n\t\n\t\n\t// this is no good for java, so slow\n\tpublic static boolean[] eratos(int n){\n\t\t// the original value should be false\n\t\tboolean [] table = new boolean[n+1];\n\t\t\n\t\ttable[0] = table[1] = true;\n\t\t\n\t\tint k = (int)Math.sqrt(n);\n\t\tfor(int i = 2; i <= k; i++) {\n\t\t\tif(!table[i]) {\n\t\t\t\tfor(int j = 2*i; j <= n; j+=i) {\n\t\t\t\t\ttable[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn table;\n\t}\n\t\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tboolean[] table = eratos(N);\n\t\t\n\t\tint len = cin.nextInt();\n\t\tint count = 0;\n\n\t\t\n\t\twhile(len > 0) {\n\t\t\tcount += (!table[cin.nextInt()])? 1:0;\n\t\t\tlen--;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n\n}",
"Main",
"//we can thus use binary search to check whether i is in the table\n\tstatic final int N = 100000000;",
"N",
"100000000",
"// this is no good for java, so slow\n\tpublic static boolean[] eratos(int n){\n\t\t// the original value should be false\n\t\tboolean [] table = new boolean[n+1];\n\t\t\n\t\ttable[0] = table[1] = true;\n\t\t\n\t\tint k = (int)Math.sqrt(n);\n\t\tfor(int i = 2; i <= k; i++) {\n\t\t\tif(!table[i]) {\n\t\t\t\tfor(int j = 2*i; j <= n; j+=i) {\n\t\t\t\t\ttable[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn table;\n\t}",
"eratos",
"{\n\t\t// the original value should be false\n\t\tboolean [] table = new boolean[n+1];\n\t\t\n\t\ttable[0] = table[1] = true;\n\t\t\n\t\tint k = (int)Math.sqrt(n);\n\t\tfor(int i = 2; i <= k; i++) {\n\t\t\tif(!table[i]) {\n\t\t\t\tfor(int j = 2*i; j <= n; j+=i) {\n\t\t\t\t\ttable[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn table;\n\t}",
"boolean [] table = new boolean[n+1];",
"table",
"new boolean[n+1]",
"n+1",
"n",
"1",
"table[0] = table[1] = true",
"table[0]",
"table",
"0",
"table[1] = true",
"table[1]",
"table",
"1",
"true",
"int k = (int)Math.sqrt(n);",
"k",
"(int)Math.sqrt(n)",
"Math.sqrt",
"Math",
"n",
"for(int i = 2; i <= k; i++) {\n\t\t\tif(!table[i]) {\n\t\t\t\tfor(int j = 2*i; j <= n; j+=i) {\n\t\t\t\t\ttable[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"int i = 2;",
"int i = 2;",
"i",
"2",
"i <= k",
"i",
"k",
"i++",
"i++",
"i",
"{\n\t\t\tif(!table[i]) {\n\t\t\t\tfor(int j = 2*i; j <= n; j+=i) {\n\t\t\t\t\ttable[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"{\n\t\t\tif(!table[i]) {\n\t\t\t\tfor(int j = 2*i; j <= n; j+=i) {\n\t\t\t\t\ttable[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"if(!table[i]) {\n\t\t\t\tfor(int j = 2*i; j <= n; j+=i) {\n\t\t\t\t\ttable[j] = true;\n\t\t\t\t}\n\t\t\t}",
"!table[i]",
"table[i]",
"table",
"i",
"{\n\t\t\t\tfor(int j = 2*i; j <= n; j+=i) {\n\t\t\t\t\ttable[j] = true;\n\t\t\t\t}\n\t\t\t}",
"for(int j = 2*i; j <= n; j+=i) {\n\t\t\t\t\ttable[j] = true;\n\t\t\t\t}",
"int j = 2*i;",
"int j = 2*i;",
"j",
"2*i",
"2",
"i",
"j <= n",
"j",
"n",
"j+=i",
"j+=i",
"j",
"i",
"{\n\t\t\t\t\ttable[j] = true;\n\t\t\t\t}",
"{\n\t\t\t\t\ttable[j] = true;\n\t\t\t\t}",
"table[j] = true",
"table[j]",
"table",
"j",
"true",
"return table;",
"table",
"int n",
"n",
"public static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tboolean[] table = eratos(N);\n\t\t\n\t\tint len = cin.nextInt();\n\t\tint count = 0;\n\n\t\t\n\t\twhile(len > 0) {\n\t\t\tcount += (!table[cin.nextInt()])? 1:0;\n\t\t\tlen--;\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"main",
"{\n\t\tScanner cin = new Scanner(System.in);\n\t\tboolean[] table = eratos(N);\n\t\t\n\t\tint len = cin.nextInt();\n\t\tint count = 0;\n\n\t\t\n\t\twhile(len > 0) {\n\t\t\tcount += (!table[cin.nextInt()])? 1:0;\n\t\t\tlen--;\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"Scanner cin = new Scanner(System.in);",
"cin",
"new Scanner(System.in)",
"boolean[] table = eratos(N);",
"table",
"eratos(N)",
"eratos",
"N",
"int len = cin.nextInt();",
"len",
"cin.nextInt()",
"cin.nextInt",
"cin",
"int count = 0;",
"count",
"0",
"while(len > 0) {\n\t\t\tcount += (!table[cin.nextInt()])? 1:0;\n\t\t\tlen--;\n\t\t}",
"len > 0",
"len",
"0",
"{\n\t\t\tcount += (!table[cin.nextInt()])? 1:0;\n\t\t\tlen--;\n\t\t}",
"count += (!table[cin.nextInt()])? 1:0",
"count",
"(!table[cin.nextInt()])? 1:0",
"(!table[cin.nextInt()])",
"table[cin.nextInt()]",
"table",
"cin.nextInt()",
"cin.nextInt",
"cin",
"1",
"0",
"len--",
"len",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"public class Main {\n\t//we can thus use binary search to check whether i is in the table\n\tstatic final int N = 100000000;\n\t\n\t\n\t\n\t// this is no good for java, so slow\n\tpublic static boolean[] eratos(int n){\n\t\t// the original value should be false\n\t\tboolean [] table = new boolean[n+1];\n\t\t\n\t\ttable[0] = table[1] = true;\n\t\t\n\t\tint k = (int)Math.sqrt(n);\n\t\tfor(int i = 2; i <= k; i++) {\n\t\t\tif(!table[i]) {\n\t\t\t\tfor(int j = 2*i; j <= n; j+=i) {\n\t\t\t\t\ttable[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn table;\n\t}\n\t\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tboolean[] table = eratos(N);\n\t\t\n\t\tint len = cin.nextInt();\n\t\tint count = 0;\n\n\t\t\n\t\twhile(len > 0) {\n\t\t\tcount += (!table[cin.nextInt()])? 1:0;\n\t\t\tlen--;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n\n}",
"public class Main {\n\t//we can thus use binary search to check whether i is in the table\n\tstatic final int N = 100000000;\n\t\n\t\n\t\n\t// this is no good for java, so slow\n\tpublic static boolean[] eratos(int n){\n\t\t// the original value should be false\n\t\tboolean [] table = new boolean[n+1];\n\t\t\n\t\ttable[0] = table[1] = true;\n\t\t\n\t\tint k = (int)Math.sqrt(n);\n\t\tfor(int i = 2; i <= k; i++) {\n\t\t\tif(!table[i]) {\n\t\t\t\tfor(int j = 2*i; j <= n; j+=i) {\n\t\t\t\t\ttable[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn table;\n\t}\n\t\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tboolean[] table = eratos(N);\n\t\t\n\t\tint len = cin.nextInt();\n\t\tint count = 0;\n\n\t\t\n\t\twhile(len > 0) {\n\t\t\tcount += (!table[cin.nextInt()])? 1:0;\n\t\t\tlen--;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n\n}",
"Main"
] |
//implement the sieve of eratos
import java.util.Scanner;
//we will use the filter method to construct the prime table from 1 to n
public class Main {
//we can thus use binary search to check whether i is in the table
static final int N = 100000000;
// this is no good for java, so slow
public static boolean[] eratos(int n){
// the original value should be false
boolean [] table = new boolean[n+1];
table[0] = table[1] = true;
int k = (int)Math.sqrt(n);
for(int i = 2; i <= k; i++) {
if(!table[i]) {
for(int j = 2*i; j <= n; j+=i) {
table[j] = true;
}
}
}
return table;
}
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
boolean[] table = eratos(N);
int len = cin.nextInt();
int count = 0;
while(len > 0) {
count += (!table[cin.nextInt()])? 1:0;
len--;
}
System.out.println(count);
}
} |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
14,
2,
2,
13,
17,
2,
13,
17,
29,
17,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
13,
17,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
30,
29,
17,
29,
17,
23,
13,
12,
13,
30,
38,
30,
41,
13,
20,
41,
13,
41,
13,
17,
41,
13,
17,
41,
13,
17,
41,
13,
17,
42,
2,
0,
13,
4,
18,
13,
17,
30,
14,
13,
30,
0,
13,
4,
18,
13,
13,
0,
13,
17,
30,
0,
13,
4,
13,
4,
18,
13,
13,
40,
13,
14,
2,
13,
13,
30,
3,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
122,
8
],
[
122,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
13,
14
],
[
14,
15
],
[
14,
16
],
[
13,
17
],
[
17,
18
],
[
17,
19
],
[
12,
20
],
[
20,
21
],
[
11,
22
],
[
22,
23
],
[
23,
24
],
[
24,
25
],
[
24,
26
],
[
22,
27
],
[
27,
28
],
[
27,
29
],
[
29,
30
],
[
30,
31
],
[
31,
32
],
[
30,
33
],
[
29,
34
],
[
22,
35
],
[
35,
36
],
[
36,
37
],
[
22,
38
],
[
39,
39
],
[
39,
40
],
[
40,
41
],
[
41,
42
],
[
42,
43
],
[
42,
44
],
[
41,
45
],
[
40,
46
],
[
46,
47
],
[
47,
48
],
[
11,
49
],
[
49,
50
],
[
9,
51
],
[
51,
52
],
[
122,
53
],
[
53,
54
],
[
53,
55
],
[
55,
56
],
[
56,
57
],
[
57,
58
],
[
58,
59
],
[
58,
60
],
[
57,
61
],
[
61,
62
],
[
57,
63
],
[
63,
64
],
[
63,
65
],
[
57,
66
],
[
66,
67
],
[
66,
68
],
[
57,
69
],
[
69,
70
],
[
69,
71
],
[
57,
72
],
[
72,
73
],
[
72,
74
],
[
57,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
77,
79
],
[
79,
80
],
[
80,
81
],
[
76,
82
],
[
75,
83
],
[
83,
84
],
[
84,
85
],
[
84,
86
],
[
86,
87
],
[
87,
88
],
[
87,
89
],
[
89,
90
],
[
90,
91
],
[
89,
92
],
[
86,
93
],
[
93,
94
],
[
93,
95
],
[
84,
96
],
[
96,
97
],
[
97,
98
],
[
97,
99
],
[
99,
100
],
[
99,
101
],
[
101,
102
],
[
102,
103
],
[
101,
104
],
[
96,
105
],
[
105,
106
],
[
96,
107
],
[
107,
108
],
[
108,
109
],
[
108,
110
],
[
107,
111
],
[
111,
112
],
[
57,
113
],
[
113,
114
],
[
114,
115
],
[
115,
116
],
[
115,
117
],
[
113,
118
],
[
53,
119
],
[
119,
120
],
[
0,
121
],
[
121,
122
],
[
121,
123
]
] | [
"import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tprivate static int prime(int a){\n\t\tif(a==2||a==3)return 1;\n\t\tfor(int i=2;i<Math.sqrt(a)+1;i++){\n\t\t\tif(a%i==0){\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t\treturn 1;\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception {\n // TODO ?????????????????????????????????????????????\n \n try (BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {\n String line;\n int n=0,j=0,store=0;\n boolean first=true;\n while ((line = br.readLine()) != null) {\n \tif(first){\n \t\tn=Integer.parseInt(line);\n \t\tfirst=false;\n \t}else{\n \t\tstore+=prime(Integer.parseInt(line));\n \t\tj++;\n \t\tif(j==n){\n \t\t\tbreak;\n \t\t}\n \t} \t\n }\n System.out.println(store);\n }\n\t}\n\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"public class Main {\n\tprivate static int prime(int a){\n\t\tif(a==2||a==3)return 1;\n\t\tfor(int i=2;i<Math.sqrt(a)+1;i++){\n\t\t\tif(a%i==0){\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t\treturn 1;\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception {\n // TODO ?????????????????????????????????????????????\n \n try (BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {\n String line;\n int n=0,j=0,store=0;\n boolean first=true;\n while ((line = br.readLine()) != null) {\n \tif(first){\n \t\tn=Integer.parseInt(line);\n \t\tfirst=false;\n \t}else{\n \t\tstore+=prime(Integer.parseInt(line));\n \t\tj++;\n \t\tif(j==n){\n \t\t\tbreak;\n \t\t}\n \t} \t\n }\n System.out.println(store);\n }\n\t}\n\n}",
"Main",
"private static int prime(int a){\n\t\tif(a==2||a==3)return 1;\n\t\tfor(int i=2;i<Math.sqrt(a)+1;i++){\n\t\t\tif(a%i==0){\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t\treturn 1;\n\t}",
"prime",
"{\n\t\tif(a==2||a==3)return 1;\n\t\tfor(int i=2;i<Math.sqrt(a)+1;i++){\n\t\t\tif(a%i==0){\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t\treturn 1;\n\t}",
"if(a==2||a==3)return 1;",
"a==2||a==3",
"a==2",
"a",
"2",
"a==3",
"a",
"3",
"return 1;",
"1",
"for(int i=2;i<Math.sqrt(a)+1;i++){\n\t\t\tif(a%i==0){\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}",
"int i=2;",
"int i=2;",
"i",
"2",
"i<Math.sqrt(a)+1",
"i",
"Math.sqrt(a)+1",
"Math.sqrt(a)",
"Math.sqrt",
"Math",
"a",
"1",
"i++",
"i++",
"i",
"{\n\t\t\tif(a%i==0){\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}",
"{\n\t\t\tif(a%i==0){\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}",
"if(a%i==0){\n\t\t\t\treturn 0;\n\t\t\t}",
"a%i==0",
"a%i",
"a",
"i",
"0",
"{\n\t\t\t\treturn 0;\n\t\t\t}",
"return 0;",
"0",
"return 1;",
"1",
"int a",
"a",
"public static void main(String[] args) throws Exception {\n // TODO ?????????????????????????????????????????????\n \n try (BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {\n String line;\n int n=0,j=0,store=0;\n boolean first=true;\n while ((line = br.readLine()) != null) {\n \tif(first){\n \t\tn=Integer.parseInt(line);\n \t\tfirst=false;\n \t}else{\n \t\tstore+=prime(Integer.parseInt(line));\n \t\tj++;\n \t\tif(j==n){\n \t\t\tbreak;\n \t\t}\n \t} \t\n }\n System.out.println(store);\n }\n\t}",
"main",
"{\n // TODO ?????????????????????????????????????????????\n \n try (BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {\n String line;\n int n=0,j=0,store=0;\n boolean first=true;\n while ((line = br.readLine()) != null) {\n \tif(first){\n \t\tn=Integer.parseInt(line);\n \t\tfirst=false;\n \t}else{\n \t\tstore+=prime(Integer.parseInt(line));\n \t\tj++;\n \t\tif(j==n){\n \t\t\tbreak;\n \t\t}\n \t} \t\n }\n System.out.println(store);\n }\n\t}",
"try (BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {\n String line;\n int n=0,j=0,store=0;\n boolean first=true;\n while ((line = br.readLine()) != null) {\n \tif(first){\n \t\tn=Integer.parseInt(line);\n \t\tfirst=false;\n \t}else{\n \t\tstore+=prime(Integer.parseInt(line));\n \t\tj++;\n \t\tif(j==n){\n \t\t\tbreak;\n \t\t}\n \t} \t\n }\n System.out.println(store);\n }",
"{\n String line;\n int n=0,j=0,store=0;\n boolean first=true;\n while ((line = br.readLine()) != null) {\n \tif(first){\n \t\tn=Integer.parseInt(line);\n \t\tfirst=false;\n \t}else{\n \t\tstore+=prime(Integer.parseInt(line));\n \t\tj++;\n \t\tif(j==n){\n \t\t\tbreak;\n \t\t}\n \t} \t\n }\n System.out.println(store);\n }",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in))",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in))",
"new BufferedReader(new InputStreamReader(System.in))",
"String line;",
"line",
"int n=0",
"n",
"0",
"j=0",
"j",
"0",
"store=0;",
"store",
"0",
"boolean first=true;",
"first",
"true",
"while ((line = br.readLine()) != null) {\n \tif(first){\n \t\tn=Integer.parseInt(line);\n \t\tfirst=false;\n \t}else{\n \t\tstore+=prime(Integer.parseInt(line));\n \t\tj++;\n \t\tif(j==n){\n \t\t\tbreak;\n \t\t}\n \t} \t\n }",
"(line = br.readLine()) != null",
"(line = br.readLine())",
"line",
"br.readLine()",
"br.readLine",
"br",
"null",
"{\n \tif(first){\n \t\tn=Integer.parseInt(line);\n \t\tfirst=false;\n \t}else{\n \t\tstore+=prime(Integer.parseInt(line));\n \t\tj++;\n \t\tif(j==n){\n \t\t\tbreak;\n \t\t}\n \t} \t\n }",
"if(first){\n \t\tn=Integer.parseInt(line);\n \t\tfirst=false;\n \t}else{\n \t\tstore+=prime(Integer.parseInt(line));\n \t\tj++;\n \t\tif(j==n){\n \t\t\tbreak;\n \t\t}\n \t}",
"first",
"{\n \t\tn=Integer.parseInt(line);\n \t\tfirst=false;\n \t}",
"n=Integer.parseInt(line)",
"n",
"Integer.parseInt(line)",
"Integer.parseInt",
"Integer",
"line",
"first=false",
"first",
"false",
"{\n \t\tstore+=prime(Integer.parseInt(line));\n \t\tj++;\n \t\tif(j==n){\n \t\t\tbreak;\n \t\t}\n \t}",
"store+=prime(Integer.parseInt(line))",
"store",
"prime(Integer.parseInt(line))",
"prime",
"Integer.parseInt(line)",
"Integer.parseInt",
"Integer",
"line",
"j++",
"j",
"if(j==n){\n \t\t\tbreak;\n \t\t}",
"j==n",
"j",
"n",
"{\n \t\t\tbreak;\n \t\t}",
"break;",
"System.out.println(store)",
"System.out.println",
"System.out",
"System",
"System.out",
"store",
"String[] args",
"args",
"public class Main {\n\tprivate static int prime(int a){\n\t\tif(a==2||a==3)return 1;\n\t\tfor(int i=2;i<Math.sqrt(a)+1;i++){\n\t\t\tif(a%i==0){\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t\treturn 1;\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception {\n // TODO ?????????????????????????????????????????????\n \n try (BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {\n String line;\n int n=0,j=0,store=0;\n boolean first=true;\n while ((line = br.readLine()) != null) {\n \tif(first){\n \t\tn=Integer.parseInt(line);\n \t\tfirst=false;\n \t}else{\n \t\tstore+=prime(Integer.parseInt(line));\n \t\tj++;\n \t\tif(j==n){\n \t\t\tbreak;\n \t\t}\n \t} \t\n }\n System.out.println(store);\n }\n\t}\n\n}",
"public class Main {\n\tprivate static int prime(int a){\n\t\tif(a==2||a==3)return 1;\n\t\tfor(int i=2;i<Math.sqrt(a)+1;i++){\n\t\t\tif(a%i==0){\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t\treturn 1;\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception {\n // TODO ?????????????????????????????????????????????\n \n try (BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {\n String line;\n int n=0,j=0,store=0;\n boolean first=true;\n while ((line = br.readLine()) != null) {\n \tif(first){\n \t\tn=Integer.parseInt(line);\n \t\tfirst=false;\n \t}else{\n \t\tstore+=prime(Integer.parseInt(line));\n \t\tj++;\n \t\tif(j==n){\n \t\t\tbreak;\n \t\t}\n \t} \t\n }\n System.out.println(store);\n }\n\t}\n\n}",
"Main"
] | import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
private static int prime(int a){
if(a==2||a==3)return 1;
for(int i=2;i<Math.sqrt(a)+1;i++){
if(a%i==0){
return 0;
}
}
return 1;
}
public static void main(String[] args) throws Exception {
// TODO ?????????????????????????????????????????????
try (BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {
String line;
int n=0,j=0,store=0;
boolean first=true;
while ((line = br.readLine()) != null) {
if(first){
n=Integer.parseInt(line);
first=false;
}else{
store+=prime(Integer.parseInt(line));
j++;
if(j==n){
break;
}
}
}
System.out.println(store);
}
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
38,
5,
13,
30,
4,
18,
18,
13,
13,
13,
30,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
41,
13,
17,
41,
13,
41,
13,
41,
13,
17,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
17,
0,
13,
4,
18,
13,
4,
18,
13,
11,
1,
0,
13,
17,
2,
13,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
17,
2,
13,
13,
30,
0,
13,
17,
3,
14,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
4,
18,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
13,
14
],
[
13,
15
],
[
15,
16
],
[
16,
17
],
[
17,
18
],
[
18,
19
],
[
18,
20
],
[
16,
21
],
[
12,
22
],
[
22,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
26,
27
],
[
25,
28
],
[
28,
29
],
[
29,
30
],
[
22,
31
],
[
31,
32
],
[
22,
33
],
[
33,
34
],
[
33,
35
],
[
22,
36
],
[
36,
37
],
[
22,
38
],
[
38,
39
],
[
22,
40
],
[
40,
41
],
[
40,
42
],
[
22,
43
],
[
43,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
43,
48
],
[
48,
49
],
[
48,
50
],
[
43,
51
],
[
51,
52
],
[
52,
53
],
[
43,
54
],
[
55,
55
],
[
55,
56
],
[
56,
57
],
[
56,
58
],
[
55,
59
],
[
59,
60
],
[
59,
61
],
[
61,
62
],
[
62,
63
],
[
61,
64
],
[
64,
65
],
[
65,
66
],
[
55,
67
],
[
67,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
67,
72
],
[
72,
73
],
[
72,
74
],
[
74,
75
],
[
74,
76
],
[
67,
77
],
[
77,
78
],
[
78,
79
],
[
67,
80
],
[
81,
81
],
[
81,
82
],
[
82,
83
],
[
83,
84
],
[
83,
85
],
[
85,
86
],
[
85,
87
],
[
82,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
88,
92
],
[
55,
93
],
[
93,
94
],
[
93,
95
],
[
95,
96
],
[
96,
97
],
[
22,
98
],
[
98,
99
],
[
99,
100
],
[
100,
101
],
[
100,
102
],
[
98,
103
],
[
22,
104
],
[
104,
105
],
[
105,
106
],
[
6,
107
],
[
107,
108
]
] | [
"import java.io.*;\n \nclass Main {\n public static void main(String[] args) {\n BufferedReader kb = new BufferedReader( new InputStreamReader( System.in ) );\n try {\n int n = Integer.parseInt( kb.readLine() );\n \n int num, cnt = 0;\n int i, j;\n boolean isprime = true;\n for( i=0; i<n; i++ ) {\n \tisprime = true;\n \tnum = Integer.parseInt( kb.readLine() );\n \tfor( j=2; j<=(num/j); j++ ) {\n \t\tif( 0 == num%j ) {\n \t\t\tisprime = false;\n \t\t\tbreak;\n \t\t}\n \t}\n \tif( isprime ) {\n \t\tcnt++;\n \t}\n }\n \n System.out.println( cnt );\n \n kb.close();\n } catch( IOException e ) {\n System.err.println( e );\n }\n }\n}",
"import java.io.*;",
"io.*",
"java",
"class Main {\n public static void main(String[] args) {\n BufferedReader kb = new BufferedReader( new InputStreamReader( System.in ) );\n try {\n int n = Integer.parseInt( kb.readLine() );\n \n int num, cnt = 0;\n int i, j;\n boolean isprime = true;\n for( i=0; i<n; i++ ) {\n \tisprime = true;\n \tnum = Integer.parseInt( kb.readLine() );\n \tfor( j=2; j<=(num/j); j++ ) {\n \t\tif( 0 == num%j ) {\n \t\t\tisprime = false;\n \t\t\tbreak;\n \t\t}\n \t}\n \tif( isprime ) {\n \t\tcnt++;\n \t}\n }\n \n System.out.println( cnt );\n \n kb.close();\n } catch( IOException e ) {\n System.err.println( e );\n }\n }\n}",
"Main",
"public static void main(String[] args) {\n BufferedReader kb = new BufferedReader( new InputStreamReader( System.in ) );\n try {\n int n = Integer.parseInt( kb.readLine() );\n \n int num, cnt = 0;\n int i, j;\n boolean isprime = true;\n for( i=0; i<n; i++ ) {\n \tisprime = true;\n \tnum = Integer.parseInt( kb.readLine() );\n \tfor( j=2; j<=(num/j); j++ ) {\n \t\tif( 0 == num%j ) {\n \t\t\tisprime = false;\n \t\t\tbreak;\n \t\t}\n \t}\n \tif( isprime ) {\n \t\tcnt++;\n \t}\n }\n \n System.out.println( cnt );\n \n kb.close();\n } catch( IOException e ) {\n System.err.println( e );\n }\n }",
"main",
"{\n BufferedReader kb = new BufferedReader( new InputStreamReader( System.in ) );\n try {\n int n = Integer.parseInt( kb.readLine() );\n \n int num, cnt = 0;\n int i, j;\n boolean isprime = true;\n for( i=0; i<n; i++ ) {\n \tisprime = true;\n \tnum = Integer.parseInt( kb.readLine() );\n \tfor( j=2; j<=(num/j); j++ ) {\n \t\tif( 0 == num%j ) {\n \t\t\tisprime = false;\n \t\t\tbreak;\n \t\t}\n \t}\n \tif( isprime ) {\n \t\tcnt++;\n \t}\n }\n \n System.out.println( cnt );\n \n kb.close();\n } catch( IOException e ) {\n System.err.println( e );\n }\n }",
"BufferedReader kb = new BufferedReader( new InputStreamReader( System.in ) );",
"kb",
"new BufferedReader( new InputStreamReader( System.in ) )",
"try {\n int n = Integer.parseInt( kb.readLine() );\n \n int num, cnt = 0;\n int i, j;\n boolean isprime = true;\n for( i=0; i<n; i++ ) {\n \tisprime = true;\n \tnum = Integer.parseInt( kb.readLine() );\n \tfor( j=2; j<=(num/j); j++ ) {\n \t\tif( 0 == num%j ) {\n \t\t\tisprime = false;\n \t\t\tbreak;\n \t\t}\n \t}\n \tif( isprime ) {\n \t\tcnt++;\n \t}\n }\n \n System.out.println( cnt );\n \n kb.close();\n } catch( IOException e ) {\n System.err.println( e );\n }",
"catch( IOException e ) {\n System.err.println( e );\n }",
"IOException e",
"{\n System.err.println( e );\n }",
"System.err.println( e )",
"System.err.println",
"System.err",
"System",
"System.err",
"e",
"{\n int n = Integer.parseInt( kb.readLine() );\n \n int num, cnt = 0;\n int i, j;\n boolean isprime = true;\n for( i=0; i<n; i++ ) {\n \tisprime = true;\n \tnum = Integer.parseInt( kb.readLine() );\n \tfor( j=2; j<=(num/j); j++ ) {\n \t\tif( 0 == num%j ) {\n \t\t\tisprime = false;\n \t\t\tbreak;\n \t\t}\n \t}\n \tif( isprime ) {\n \t\tcnt++;\n \t}\n }\n \n System.out.println( cnt );\n \n kb.close();\n }",
"int n = Integer.parseInt( kb.readLine() );",
"n",
"Integer.parseInt( kb.readLine() )",
"Integer.parseInt",
"Integer",
"kb.readLine()",
"kb.readLine",
"kb",
"int num",
"num",
"cnt = 0;",
"cnt",
"0",
"int i",
"i",
"j;",
"j",
"boolean isprime = true;",
"isprime",
"true",
"for( i=0; i<n; i++ ) {\n \tisprime = true;\n \tnum = Integer.parseInt( kb.readLine() );\n \tfor( j=2; j<=(num/j); j++ ) {\n \t\tif( 0 == num%j ) {\n \t\t\tisprime = false;\n \t\t\tbreak;\n \t\t}\n \t}\n \tif( isprime ) {\n \t\tcnt++;\n \t}\n }",
"i=0;",
"i=0",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n \tisprime = true;\n \tnum = Integer.parseInt( kb.readLine() );\n \tfor( j=2; j<=(num/j); j++ ) {\n \t\tif( 0 == num%j ) {\n \t\t\tisprime = false;\n \t\t\tbreak;\n \t\t}\n \t}\n \tif( isprime ) {\n \t\tcnt++;\n \t}\n }",
"{\n \tisprime = true;\n \tnum = Integer.parseInt( kb.readLine() );\n \tfor( j=2; j<=(num/j); j++ ) {\n \t\tif( 0 == num%j ) {\n \t\t\tisprime = false;\n \t\t\tbreak;\n \t\t}\n \t}\n \tif( isprime ) {\n \t\tcnt++;\n \t}\n }",
"isprime = true",
"isprime",
"true",
"num = Integer.parseInt( kb.readLine() )",
"num",
"Integer.parseInt( kb.readLine() )",
"Integer.parseInt",
"Integer",
"kb.readLine()",
"kb.readLine",
"kb",
"for( j=2; j<=(num/j); j++ ) {\n \t\tif( 0 == num%j ) {\n \t\t\tisprime = false;\n \t\t\tbreak;\n \t\t}\n \t}",
"j=2;",
"j=2",
"j",
"2",
"j<=(num/j)",
"j",
"(num/j)",
"num",
"j",
"j++",
"j++",
"j",
"{\n \t\tif( 0 == num%j ) {\n \t\t\tisprime = false;\n \t\t\tbreak;\n \t\t}\n \t}",
"{\n \t\tif( 0 == num%j ) {\n \t\t\tisprime = false;\n \t\t\tbreak;\n \t\t}\n \t}",
"if( 0 == num%j ) {\n \t\t\tisprime = false;\n \t\t\tbreak;\n \t\t}",
"0 == num%j",
"0",
"num%j",
"num",
"j",
"{\n \t\t\tisprime = false;\n \t\t\tbreak;\n \t\t}",
"isprime = false",
"isprime",
"false",
"break;",
"if( isprime ) {\n \t\tcnt++;\n \t}",
"isprime",
"{\n \t\tcnt++;\n \t}",
"cnt++",
"cnt",
"System.out.println( cnt )",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"kb.close()",
"kb.close",
"kb",
"String[] args",
"args"
] | import java.io.*;
class Main {
public static void main(String[] args) {
BufferedReader kb = new BufferedReader( new InputStreamReader( System.in ) );
try {
int n = Integer.parseInt( kb.readLine() );
int num, cnt = 0;
int i, j;
boolean isprime = true;
for( i=0; i<n; i++ ) {
isprime = true;
num = Integer.parseInt( kb.readLine() );
for( j=2; j<=(num/j); j++ ) {
if( 0 == num%j ) {
isprime = false;
break;
}
}
if( isprime ) {
cnt++;
}
}
System.out.println( cnt );
kb.close();
} catch( IOException e ) {
System.err.println( e );
}
}
} |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
2,
4,
18,
13,
13,
17,
14,
2,
13,
17,
29,
17,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
17,
29,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
0,
13,
17,
30,
30,
14,
2,
2,
13,
13,
17,
29,
17,
29,
17,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
4,
13,
4,
18,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
110,
8
],
[
110,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
16,
17
],
[
15,
18
],
[
14,
19
],
[
11,
20
],
[
20,
21
],
[
21,
22
],
[
21,
23
],
[
20,
24
],
[
24,
25
],
[
11,
26
],
[
26,
27
],
[
27,
28
],
[
27,
29
],
[
26,
30
],
[
30,
31
],
[
11,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
34,
36
],
[
33,
37
],
[
32,
38
],
[
38,
39
],
[
11,
40
],
[
40,
41
],
[
41,
42
],
[
42,
43
],
[
42,
44
],
[
40,
45
],
[
45,
46
],
[
45,
47
],
[
40,
48
],
[
48,
49
],
[
49,
50
],
[
49,
51
],
[
40,
52
],
[
53,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
56,
57
],
[
56,
58
],
[
55,
59
],
[
54,
60
],
[
60,
61
],
[
11,
62
],
[
62,
63
],
[
9,
64
],
[
64,
65
],
[
110,
66
],
[
66,
67
],
[
66,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
68,
72
],
[
72,
73
],
[
72,
74
],
[
74,
75
],
[
75,
76
],
[
68,
77
],
[
77,
78
],
[
77,
79
],
[
68,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
82,
84
],
[
80,
85
],
[
85,
86
],
[
85,
87
],
[
80,
88
],
[
88,
89
],
[
89,
90
],
[
80,
91
],
[
92,
92
],
[
92,
93
],
[
93,
94
],
[
94,
95
],
[
94,
96
],
[
96,
97
],
[
97,
98
],
[
93,
99
],
[
99,
100
],
[
68,
101
],
[
101,
102
],
[
102,
103
],
[
103,
104
],
[
103,
105
],
[
101,
106
],
[
66,
107
],
[
107,
108
],
[
0,
109
],
[
109,
110
],
[
109,
111
]
] | [
"import java.util.Scanner;\nimport java.lang.Math;\n\n// ALDS1_1_C\npublic class Main {\n\tpublic static boolean primeJudge(int a) {\n\t\tdouble sqrt = Math.sqrt(a) + 1;\n\t\tif (a < 2) return false;\n\t\tif (a == 2) return true;\n\t\tif (a % 2 == 0) return false;\n\t\tfor (int i = 3; i < sqrt; i+=2) {\n\t\t\tif (a % i == 0) return false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (primeJudge(sc.nextInt())) count++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}\n",
"import java.util.Scanner;",
"Scanner",
"java.util",
"import java.lang.Math;",
"Math",
"java.lang",
"public class Main {\n\tpublic static boolean primeJudge(int a) {\n\t\tdouble sqrt = Math.sqrt(a) + 1;\n\t\tif (a < 2) return false;\n\t\tif (a == 2) return true;\n\t\tif (a % 2 == 0) return false;\n\t\tfor (int i = 3; i < sqrt; i+=2) {\n\t\t\tif (a % i == 0) return false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (primeJudge(sc.nextInt())) count++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}",
"Main",
"public static boolean primeJudge(int a) {\n\t\tdouble sqrt = Math.sqrt(a) + 1;\n\t\tif (a < 2) return false;\n\t\tif (a == 2) return true;\n\t\tif (a % 2 == 0) return false;\n\t\tfor (int i = 3; i < sqrt; i+=2) {\n\t\t\tif (a % i == 0) return false;\n\t\t}\n\t\treturn true;\n\t}",
"primeJudge",
"{\n\t\tdouble sqrt = Math.sqrt(a) + 1;\n\t\tif (a < 2) return false;\n\t\tif (a == 2) return true;\n\t\tif (a % 2 == 0) return false;\n\t\tfor (int i = 3; i < sqrt; i+=2) {\n\t\t\tif (a % i == 0) return false;\n\t\t}\n\t\treturn true;\n\t}",
"double sqrt = Math.sqrt(a) + 1;",
"sqrt",
"Math.sqrt(a) + 1",
"Math.sqrt(a)",
"Math.sqrt",
"Math",
"a",
"1",
"if (a < 2) return false;",
"a < 2",
"a",
"2",
"return false;",
"false",
"if (a == 2) return true;",
"a == 2",
"a",
"2",
"return true;",
"true",
"if (a % 2 == 0) return false;",
"a % 2 == 0",
"a % 2",
"a",
"2",
"0",
"return false;",
"false",
"for (int i = 3; i < sqrt; i+=2) {\n\t\t\tif (a % i == 0) return false;\n\t\t}",
"int i = 3;",
"int i = 3;",
"i",
"3",
"i < sqrt",
"i",
"sqrt",
"i+=2",
"i+=2",
"i",
"2",
"{\n\t\t\tif (a % i == 0) return false;\n\t\t}",
"{\n\t\t\tif (a % i == 0) return false;\n\t\t}",
"if (a % i == 0) return false;",
"a % i == 0",
"a % i",
"a",
"i",
"0",
"return false;",
"false",
"return true;",
"true",
"int a",
"a",
"public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (primeJudge(sc.nextInt())) count++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (primeJudge(sc.nextInt())) count++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int count = 0;",
"count",
"0",
"for (int i = 0; i < n; i++) {\n\t\t\tif (primeJudge(sc.nextInt())) count++;\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tif (primeJudge(sc.nextInt())) count++;\n\t\t}",
"{\n\t\t\tif (primeJudge(sc.nextInt())) count++;\n\t\t}",
"if (primeJudge(sc.nextInt())) count++;",
"primeJudge(sc.nextInt())",
"primeJudge",
"sc.nextInt()",
"sc.nextInt",
"sc",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"public class Main {\n\tpublic static boolean primeJudge(int a) {\n\t\tdouble sqrt = Math.sqrt(a) + 1;\n\t\tif (a < 2) return false;\n\t\tif (a == 2) return true;\n\t\tif (a % 2 == 0) return false;\n\t\tfor (int i = 3; i < sqrt; i+=2) {\n\t\t\tif (a % i == 0) return false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (primeJudge(sc.nextInt())) count++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}",
"public class Main {\n\tpublic static boolean primeJudge(int a) {\n\t\tdouble sqrt = Math.sqrt(a) + 1;\n\t\tif (a < 2) return false;\n\t\tif (a == 2) return true;\n\t\tif (a % 2 == 0) return false;\n\t\tfor (int i = 3; i < sqrt; i+=2) {\n\t\t\tif (a % i == 0) return false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (primeJudge(sc.nextInt())) count++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}",
"Main"
] | import java.util.Scanner;
import java.lang.Math;
// 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) {
if (a % i == 0) return false;
}
return true;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int count = 0;
for (int i = 0; i < n; i++) {
if (primeJudge(sc.nextInt())) count++;
}
System.out.println(count);
}
}
|
[
7,
15,
13,
17,
6,
13,
41,
13,
20,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
30,
0,
13,
17,
3,
14,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
82,
5
],
[
82,
6
],
[
6,
7
],
[
6,
8
],
[
82,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
11,
17
],
[
17,
18
],
[
17,
19
],
[
11,
20
],
[
20,
21
],
[
21,
22
],
[
22,
23
],
[
22,
24
],
[
20,
25
],
[
25,
26
],
[
25,
27
],
[
20,
28
],
[
28,
29
],
[
29,
30
],
[
20,
31
],
[
32,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
35,
36
],
[
36,
37
],
[
32,
38
],
[
38,
39
],
[
38,
40
],
[
32,
41
],
[
41,
42
],
[
42,
43
],
[
43,
44
],
[
43,
45
],
[
41,
46
],
[
46,
47
],
[
46,
48
],
[
48,
49
],
[
49,
50
],
[
48,
51
],
[
41,
52
],
[
52,
53
],
[
53,
54
],
[
41,
55
],
[
56,
56
],
[
56,
57
],
[
57,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
58,
62
],
[
57,
63
],
[
63,
64
],
[
64,
65
],
[
64,
66
],
[
63,
67
],
[
32,
68
],
[
68,
69
],
[
68,
70
],
[
70,
71
],
[
71,
72
],
[
11,
73
],
[
73,
74
],
[
74,
75
],
[
75,
76
],
[
75,
77
],
[
73,
78
],
[
9,
79
],
[
79,
80
],
[
0,
81
],
[
81,
82
],
[
81,
83
]
] | [
"\nimport java.util.Scanner;\n\npublic class Main {\n static Scanner sc = new Scanner(System.in);\n public static void main(String[] args) {\n int num = sc.nextInt();\n int count = 0;\n for(int i = 0; i < num; i++){\n int n = sc.nextInt();\n boolean flg = true;\n for(int j = 2; j <= Math.sqrt(n); j++){\n if(n % j == 0){\n flg = false;\n break;\n }\n }\n if(flg){\n count++;\n }\n }\n System.out.println(count);\n }\n \n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n static Scanner sc = new Scanner(System.in);\n public static void main(String[] args) {\n int num = sc.nextInt();\n int count = 0;\n for(int i = 0; i < num; i++){\n int n = sc.nextInt();\n boolean flg = true;\n for(int j = 2; j <= Math.sqrt(n); j++){\n if(n % j == 0){\n flg = false;\n break;\n }\n }\n if(flg){\n count++;\n }\n }\n System.out.println(count);\n }\n \n}",
"Main",
"static Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"public static void main(String[] args) {\n int num = sc.nextInt();\n int count = 0;\n for(int i = 0; i < num; i++){\n int n = sc.nextInt();\n boolean flg = true;\n for(int j = 2; j <= Math.sqrt(n); j++){\n if(n % j == 0){\n flg = false;\n break;\n }\n }\n if(flg){\n count++;\n }\n }\n System.out.println(count);\n }",
"main",
"{\n int num = sc.nextInt();\n int count = 0;\n for(int i = 0; i < num; i++){\n int n = sc.nextInt();\n boolean flg = true;\n for(int j = 2; j <= Math.sqrt(n); j++){\n if(n % j == 0){\n flg = false;\n break;\n }\n }\n if(flg){\n count++;\n }\n }\n System.out.println(count);\n }",
"int num = sc.nextInt();",
"num",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int count = 0;",
"count",
"0",
"for(int i = 0; i < num; i++){\n int n = sc.nextInt();\n boolean flg = true;\n for(int j = 2; j <= Math.sqrt(n); j++){\n if(n % j == 0){\n flg = false;\n break;\n }\n }\n if(flg){\n count++;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < num",
"i",
"num",
"i++",
"i++",
"i",
"{\n int n = sc.nextInt();\n boolean flg = true;\n for(int j = 2; j <= Math.sqrt(n); j++){\n if(n % j == 0){\n flg = false;\n break;\n }\n }\n if(flg){\n count++;\n }\n }",
"{\n int n = sc.nextInt();\n boolean flg = true;\n for(int j = 2; j <= Math.sqrt(n); j++){\n if(n % j == 0){\n flg = false;\n break;\n }\n }\n if(flg){\n count++;\n }\n }",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"boolean flg = true;",
"flg",
"true",
"for(int j = 2; j <= Math.sqrt(n); j++){\n if(n % j == 0){\n flg = false;\n break;\n }\n }",
"int j = 2;",
"int j = 2;",
"j",
"2",
"j <= Math.sqrt(n)",
"j",
"Math.sqrt(n)",
"Math.sqrt",
"Math",
"n",
"j++",
"j++",
"j",
"{\n if(n % j == 0){\n flg = false;\n break;\n }\n }",
"{\n if(n % j == 0){\n flg = false;\n break;\n }\n }",
"if(n % j == 0){\n flg = false;\n break;\n }",
"n % j == 0",
"n % j",
"n",
"j",
"0",
"{\n flg = false;\n break;\n }",
"flg = false",
"flg",
"false",
"break;",
"if(flg){\n count++;\n }",
"flg",
"{\n count++;\n }",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"public class Main {\n static Scanner sc = new Scanner(System.in);\n public static void main(String[] args) {\n int num = sc.nextInt();\n int count = 0;\n for(int i = 0; i < num; i++){\n int n = sc.nextInt();\n boolean flg = true;\n for(int j = 2; j <= Math.sqrt(n); j++){\n if(n % j == 0){\n flg = false;\n break;\n }\n }\n if(flg){\n count++;\n }\n }\n System.out.println(count);\n }\n \n}",
"public class Main {\n static Scanner sc = new Scanner(System.in);\n public static void main(String[] args) {\n int num = sc.nextInt();\n int count = 0;\n for(int i = 0; i < num; i++){\n int n = sc.nextInt();\n boolean flg = true;\n for(int j = 2; j <= Math.sqrt(n); j++){\n if(n % j == 0){\n flg = false;\n break;\n }\n }\n if(flg){\n count++;\n }\n }\n System.out.println(count);\n }\n \n}",
"Main"
] |
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
int num = sc.nextInt();
int count = 0;
for(int i = 0; i < num; i++){
int n = sc.nextInt();
boolean flg = true;
for(int j = 2; j <= Math.sqrt(n); j++){
if(n % j == 0){
flg = false;
break;
}
}
if(flg){
count++;
}
}
System.out.println(count);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
41,
13,
17,
41,
13,
17,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
42,
2,
13,
2,
4,
18,
13,
18,
13,
13,
17,
30,
14,
2,
2,
2,
18,
13,
13,
13,
17,
2,
18,
13,
13,
17,
30,
0,
13,
17,
3,
40,
13,
14,
2,
13,
17,
30,
40,
13,
0,
13,
17,
0,
13,
17,
4,
18,
18,
13,
13,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
21
],
[
21,
22
],
[
22,
23
],
[
23,
24
],
[
23,
25
],
[
21,
26
],
[
26,
27
],
[
26,
28
],
[
21,
29
],
[
29,
30
],
[
30,
31
],
[
21,
32
],
[
33,
33
],
[
33,
34
],
[
34,
35
],
[
35,
36
],
[
35,
37
],
[
34,
38
],
[
38,
39
],
[
39,
40
],
[
8,
41
],
[
41,
42
],
[
41,
43
],
[
8,
44
],
[
44,
45
],
[
44,
46
],
[
8,
47
],
[
47,
48
],
[
47,
49
],
[
8,
50
],
[
50,
51
],
[
51,
52
],
[
52,
53
],
[
52,
54
],
[
50,
55
],
[
55,
56
],
[
55,
57
],
[
57,
58
],
[
57,
59
],
[
50,
60
],
[
60,
61
],
[
61,
62
],
[
50,
63
],
[
64,
64
],
[
64,
65
],
[
65,
66
],
[
66,
67
],
[
66,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
69,
72
],
[
72,
73
],
[
72,
74
],
[
68,
75
],
[
65,
76
],
[
76,
77
],
[
77,
78
],
[
78,
79
],
[
79,
80
],
[
80,
81
],
[
81,
82
],
[
81,
83
],
[
80,
84
],
[
79,
85
],
[
78,
86
],
[
86,
87
],
[
87,
88
],
[
87,
89
],
[
86,
90
],
[
77,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
91,
95
],
[
76,
96
],
[
96,
97
],
[
64,
98
],
[
98,
99
],
[
99,
100
],
[
99,
101
],
[
98,
102
],
[
102,
103
],
[
103,
104
],
[
64,
105
],
[
105,
106
],
[
105,
107
],
[
64,
108
],
[
108,
109
],
[
108,
110
],
[
8,
111
],
[
111,
112
],
[
112,
113
],
[
113,
114
],
[
113,
115
],
[
111,
116
],
[
6,
117
],
[
117,
118
]
] | [
"import java.util.Scanner;\n\nclass Main{\n\tpublic static void main(String args[]){\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tint[] arr = new int[n];\n\t\tfor(int i=0; i<n; i++) {\n\t\t\tarr[i] = scan.nextInt();\n\t\t}\n\t\tint k = 2;\n\t\tint flag = 1; //0???????´???°??§????????????1???????´???°\n\t\tint cnt = 0; //?´???°?????°???????????????\n\t\tfor(int i=0; i<arr.length; i++){\n\t\t\twhile(k <= Math.sqrt(arr[i])+1){\n\t\t\t//while(arr[i] != k){\n\t\t\t//wh1ile(list.hasnext()){\n\t\t\t\t//System.out.println(\"arr[i]:\" + arr[i] + \",k:\" + k + \",??????:\" + arr[i] % k);\n\t\t\t\tif(arr[i] % k == 0 && arr[i] != 2){\n\t\t\t\t\tflag = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tif(flag == 1){cnt++;}\n\t\t\tflag = 1;\n\t\t\tk = 2;\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"class Main{\n\tpublic static void main(String args[]){\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tint[] arr = new int[n];\n\t\tfor(int i=0; i<n; i++) {\n\t\t\tarr[i] = scan.nextInt();\n\t\t}\n\t\tint k = 2;\n\t\tint flag = 1; //0???????´???°??§????????????1???????´???°\n\t\tint cnt = 0; //?´???°?????°???????????????\n\t\tfor(int i=0; i<arr.length; i++){\n\t\t\twhile(k <= Math.sqrt(arr[i])+1){\n\t\t\t//while(arr[i] != k){\n\t\t\t//wh1ile(list.hasnext()){\n\t\t\t\t//System.out.println(\"arr[i]:\" + arr[i] + \",k:\" + k + \",??????:\" + arr[i] % k);\n\t\t\t\tif(arr[i] % k == 0 && arr[i] != 2){\n\t\t\t\t\tflag = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tif(flag == 1){cnt++;}\n\t\t\tflag = 1;\n\t\t\tk = 2;\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}\n}",
"Main",
"public static void main(String args[]){\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tint[] arr = new int[n];\n\t\tfor(int i=0; i<n; i++) {\n\t\t\tarr[i] = scan.nextInt();\n\t\t}\n\t\tint k = 2;\n\t\tint flag = 1; //0???????´???°??§????????????1???????´???°\n\t\tint cnt = 0; //?´???°?????°???????????????\n\t\tfor(int i=0; i<arr.length; i++){\n\t\t\twhile(k <= Math.sqrt(arr[i])+1){\n\t\t\t//while(arr[i] != k){\n\t\t\t//wh1ile(list.hasnext()){\n\t\t\t\t//System.out.println(\"arr[i]:\" + arr[i] + \",k:\" + k + \",??????:\" + arr[i] % k);\n\t\t\t\tif(arr[i] % k == 0 && arr[i] != 2){\n\t\t\t\t\tflag = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tif(flag == 1){cnt++;}\n\t\t\tflag = 1;\n\t\t\tk = 2;\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}",
"main",
"{\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tint[] arr = new int[n];\n\t\tfor(int i=0; i<n; i++) {\n\t\t\tarr[i] = scan.nextInt();\n\t\t}\n\t\tint k = 2;\n\t\tint flag = 1; //0???????´???°??§????????????1???????´???°\n\t\tint cnt = 0; //?´???°?????°???????????????\n\t\tfor(int i=0; i<arr.length; i++){\n\t\t\twhile(k <= Math.sqrt(arr[i])+1){\n\t\t\t//while(arr[i] != k){\n\t\t\t//wh1ile(list.hasnext()){\n\t\t\t\t//System.out.println(\"arr[i]:\" + arr[i] + \",k:\" + k + \",??????:\" + arr[i] % k);\n\t\t\t\tif(arr[i] % k == 0 && arr[i] != 2){\n\t\t\t\t\tflag = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tif(flag == 1){cnt++;}\n\t\t\tflag = 1;\n\t\t\tk = 2;\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}",
"Scanner scan = new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"int n = scan.nextInt();",
"n",
"scan.nextInt()",
"scan.nextInt",
"scan",
"int[] arr = new int[n];",
"arr",
"new int[n]",
"n",
"for(int i=0; i<n; i++) {\n\t\t\tarr[i] = scan.nextInt();\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tarr[i] = scan.nextInt();\n\t\t}",
"{\n\t\t\tarr[i] = scan.nextInt();\n\t\t}",
"arr[i] = scan.nextInt()",
"arr[i]",
"arr",
"i",
"scan.nextInt()",
"scan.nextInt",
"scan",
"int k = 2;",
"k",
"2",
"int flag = 1;",
"flag",
"1",
"int cnt = 0;",
"cnt",
"0",
"for(int i=0; i<arr.length; i++){\n\t\t\twhile(k <= Math.sqrt(arr[i])+1){\n\t\t\t//while(arr[i] != k){\n\t\t\t//wh1ile(list.hasnext()){\n\t\t\t\t//System.out.println(\"arr[i]:\" + arr[i] + \",k:\" + k + \",??????:\" + arr[i] % k);\n\t\t\t\tif(arr[i] % k == 0 && arr[i] != 2){\n\t\t\t\t\tflag = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tif(flag == 1){cnt++;}\n\t\t\tflag = 1;\n\t\t\tk = 2;\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<arr.length",
"i",
"arr.length",
"arr",
"arr.length",
"i++",
"i++",
"i",
"{\n\t\t\twhile(k <= Math.sqrt(arr[i])+1){\n\t\t\t//while(arr[i] != k){\n\t\t\t//wh1ile(list.hasnext()){\n\t\t\t\t//System.out.println(\"arr[i]:\" + arr[i] + \",k:\" + k + \",??????:\" + arr[i] % k);\n\t\t\t\tif(arr[i] % k == 0 && arr[i] != 2){\n\t\t\t\t\tflag = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tif(flag == 1){cnt++;}\n\t\t\tflag = 1;\n\t\t\tk = 2;\n\t\t}",
"{\n\t\t\twhile(k <= Math.sqrt(arr[i])+1){\n\t\t\t//while(arr[i] != k){\n\t\t\t//wh1ile(list.hasnext()){\n\t\t\t\t//System.out.println(\"arr[i]:\" + arr[i] + \",k:\" + k + \",??????:\" + arr[i] % k);\n\t\t\t\tif(arr[i] % k == 0 && arr[i] != 2){\n\t\t\t\t\tflag = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tif(flag == 1){cnt++;}\n\t\t\tflag = 1;\n\t\t\tk = 2;\n\t\t}",
"while(k <= Math.sqrt(arr[i])+1){\n\t\t\t//while(arr[i] != k){\n\t\t\t//wh1ile(list.hasnext()){\n\t\t\t\t//System.out.println(\"arr[i]:\" + arr[i] + \",k:\" + k + \",??????:\" + arr[i] % k);\n\t\t\t\tif(arr[i] % k == 0 && arr[i] != 2){\n\t\t\t\t\tflag = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tk++;\n\t\t\t}",
"k <= Math.sqrt(arr[i])+1",
"k",
"Math.sqrt(arr[i])+1",
"Math.sqrt(arr[i])",
"Math.sqrt",
"Math",
"arr[i]",
"arr",
"i",
"1",
"{\n\t\t\t//while(arr[i] != k){\n\t\t\t//wh1ile(list.hasnext()){\n\t\t\t\t//System.out.println(\"arr[i]:\" + arr[i] + \",k:\" + k + \",??????:\" + arr[i] % k);\n\t\t\t\tif(arr[i] % k == 0 && arr[i] != 2){\n\t\t\t\t\tflag = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tk++;\n\t\t\t}",
"if(arr[i] % k == 0 && arr[i] != 2){\n\t\t\t\t\tflag = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"arr[i] % k == 0 && arr[i] != 2",
"arr[i] % k == 0",
"arr[i] % k",
"arr[i]",
"arr",
"i",
"k",
"0",
"arr[i] != 2",
"arr[i]",
"arr",
"i",
"2",
"{\n\t\t\t\t\tflag = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"flag = 0",
"flag",
"0",
"break;",
"k++",
"k",
"if(flag == 1){cnt++;}",
"flag == 1",
"flag",
"1",
"{cnt++;}",
"cnt++",
"cnt",
"flag = 1",
"flag",
"1",
"k = 2",
"k",
"2",
"System.out.println(cnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"String args[]",
"args"
] | import java.util.Scanner;
class Main{
public static void main(String args[]){
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int[] arr = new int[n];
for(int i=0; i<n; i++) {
arr[i] = scan.nextInt();
}
int k = 2;
int flag = 1; //0???????´???°??§????????????1???????´???°
int cnt = 0; //?´???°?????°???????????????
for(int i=0; i<arr.length; i++){
while(k <= Math.sqrt(arr[i])+1){
//while(arr[i] != k){
//wh1ile(list.hasnext()){
//System.out.println("arr[i]:" + arr[i] + ",k:" + k + ",??????:" + arr[i] % k);
if(arr[i] % k == 0 && arr[i] != 2){
flag = 0;
break;
}
k++;
}
if(flag == 1){cnt++;}
flag = 1;
k = 2;
}
System.out.println(cnt);
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
4,
18,
13,
14,
2,
13,
17,
30,
9,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
30,
0,
13,
17,
3,
14,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
94,
5
],
[
94,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
14,
17
],
[
17,
18
],
[
18,
19
],
[
8,
20
],
[
20,
21
],
[
20,
22
],
[
8,
23
],
[
23,
24
],
[
24,
25
],
[
25,
26
],
[
25,
27
],
[
23,
28
],
[
28,
29
],
[
28,
30
],
[
23,
31
],
[
31,
32
],
[
32,
33
],
[
23,
34
],
[
35,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
38,
41
],
[
41,
42
],
[
42,
43
],
[
35,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
44,
48
],
[
48,
49
],
[
35,
50
],
[
50,
51
],
[
50,
52
],
[
35,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
53,
58
],
[
58,
59
],
[
58,
60
],
[
60,
61
],
[
61,
62
],
[
60,
63
],
[
53,
64
],
[
64,
65
],
[
65,
66
],
[
53,
67
],
[
68,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
70,
74
],
[
69,
75
],
[
75,
76
],
[
76,
77
],
[
76,
78
],
[
75,
79
],
[
35,
80
],
[
80,
81
],
[
80,
82
],
[
82,
83
],
[
83,
84
],
[
8,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
87,
89
],
[
85,
90
],
[
6,
91
],
[
91,
92
],
[
0,
93
],
[
93,
94
],
[
93,
95
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n\n int num = Integer.parseInt(sc.nextLine());\n\n int result = 0;\n\n for (int i = 0; i < num; i++) {\n int target = Integer.parseInt(sc.nextLine());\n\n if (target == 1) { continue; }\n\n boolean flgPrime = true;\n for(int j = 2; j <= (int)Math.sqrt(target); j++) {\n if (target % j == 0) {\n flgPrime = false;\n break;\n }\n }\n\n if (flgPrime) {\n result++;\n }\n }\n\n System.out.println(result);\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n\n int num = Integer.parseInt(sc.nextLine());\n\n int result = 0;\n\n for (int i = 0; i < num; i++) {\n int target = Integer.parseInt(sc.nextLine());\n\n if (target == 1) { continue; }\n\n boolean flgPrime = true;\n for(int j = 2; j <= (int)Math.sqrt(target); j++) {\n if (target % j == 0) {\n flgPrime = false;\n break;\n }\n }\n\n if (flgPrime) {\n result++;\n }\n }\n\n System.out.println(result);\n }\n}",
"Main",
"public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n\n int num = Integer.parseInt(sc.nextLine());\n\n int result = 0;\n\n for (int i = 0; i < num; i++) {\n int target = Integer.parseInt(sc.nextLine());\n\n if (target == 1) { continue; }\n\n boolean flgPrime = true;\n for(int j = 2; j <= (int)Math.sqrt(target); j++) {\n if (target % j == 0) {\n flgPrime = false;\n break;\n }\n }\n\n if (flgPrime) {\n result++;\n }\n }\n\n System.out.println(result);\n }",
"main",
"{\n\n Scanner sc = new Scanner(System.in);\n\n int num = Integer.parseInt(sc.nextLine());\n\n int result = 0;\n\n for (int i = 0; i < num; i++) {\n int target = Integer.parseInt(sc.nextLine());\n\n if (target == 1) { continue; }\n\n boolean flgPrime = true;\n for(int j = 2; j <= (int)Math.sqrt(target); j++) {\n if (target % j == 0) {\n flgPrime = false;\n break;\n }\n }\n\n if (flgPrime) {\n result++;\n }\n }\n\n System.out.println(result);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int num = Integer.parseInt(sc.nextLine());",
"num",
"Integer.parseInt(sc.nextLine())",
"Integer.parseInt",
"Integer",
"sc.nextLine()",
"sc.nextLine",
"sc",
"int result = 0;",
"result",
"0",
"for (int i = 0; i < num; i++) {\n int target = Integer.parseInt(sc.nextLine());\n\n if (target == 1) { continue; }\n\n boolean flgPrime = true;\n for(int j = 2; j <= (int)Math.sqrt(target); j++) {\n if (target % j == 0) {\n flgPrime = false;\n break;\n }\n }\n\n if (flgPrime) {\n result++;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < num",
"i",
"num",
"i++",
"i++",
"i",
"{\n int target = Integer.parseInt(sc.nextLine());\n\n if (target == 1) { continue; }\n\n boolean flgPrime = true;\n for(int j = 2; j <= (int)Math.sqrt(target); j++) {\n if (target % j == 0) {\n flgPrime = false;\n break;\n }\n }\n\n if (flgPrime) {\n result++;\n }\n }",
"{\n int target = Integer.parseInt(sc.nextLine());\n\n if (target == 1) { continue; }\n\n boolean flgPrime = true;\n for(int j = 2; j <= (int)Math.sqrt(target); j++) {\n if (target % j == 0) {\n flgPrime = false;\n break;\n }\n }\n\n if (flgPrime) {\n result++;\n }\n }",
"int target = Integer.parseInt(sc.nextLine());",
"target",
"Integer.parseInt(sc.nextLine())",
"Integer.parseInt",
"Integer",
"sc.nextLine()",
"sc.nextLine",
"sc",
"if (target == 1) { continue; }",
"target == 1",
"target",
"1",
"{ continue; }",
"continue;",
"boolean flgPrime = true;",
"flgPrime",
"true",
"for(int j = 2; j <= (int)Math.sqrt(target); j++) {\n if (target % j == 0) {\n flgPrime = false;\n break;\n }\n }",
"int j = 2;",
"int j = 2;",
"j",
"2",
"j <= (int)Math.sqrt(target)",
"j",
"(int)Math.sqrt(target)",
"Math.sqrt",
"Math",
"target",
"j++",
"j++",
"j",
"{\n if (target % j == 0) {\n flgPrime = false;\n break;\n }\n }",
"{\n if (target % j == 0) {\n flgPrime = false;\n break;\n }\n }",
"if (target % j == 0) {\n flgPrime = false;\n break;\n }",
"target % j == 0",
"target % j",
"target",
"j",
"0",
"{\n flgPrime = false;\n break;\n }",
"flgPrime = false",
"flgPrime",
"false",
"break;",
"if (flgPrime) {\n result++;\n }",
"flgPrime",
"{\n result++;\n }",
"result++",
"result",
"System.out.println(result)",
"System.out.println",
"System.out",
"System",
"System.out",
"result",
"String[] args",
"args",
"public class Main {\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n\n int num = Integer.parseInt(sc.nextLine());\n\n int result = 0;\n\n for (int i = 0; i < num; i++) {\n int target = Integer.parseInt(sc.nextLine());\n\n if (target == 1) { continue; }\n\n boolean flgPrime = true;\n for(int j = 2; j <= (int)Math.sqrt(target); j++) {\n if (target % j == 0) {\n flgPrime = false;\n break;\n }\n }\n\n if (flgPrime) {\n result++;\n }\n }\n\n System.out.println(result);\n }\n}",
"public class Main {\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n\n int num = Integer.parseInt(sc.nextLine());\n\n int result = 0;\n\n for (int i = 0; i < num; i++) {\n int target = Integer.parseInt(sc.nextLine());\n\n if (target == 1) { continue; }\n\n boolean flgPrime = true;\n for(int j = 2; j <= (int)Math.sqrt(target); j++) {\n if (target % j == 0) {\n flgPrime = false;\n break;\n }\n }\n\n if (flgPrime) {\n result++;\n }\n }\n\n System.out.println(result);\n }\n}",
"Main"
] | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int num = Integer.parseInt(sc.nextLine());
int result = 0;
for (int i = 0; i < num; i++) {
int target = Integer.parseInt(sc.nextLine());
if (target == 1) { continue; }
boolean flgPrime = true;
for(int j = 2; j <= (int)Math.sqrt(target); j++) {
if (target % j == 0) {
flgPrime = false;
break;
}
}
if (flgPrime) {
result++;
}
}
System.out.println(result);
}
}
|
[
7,
15,
13,
17,
6,
13,
41,
13,
20,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
20,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
14,
4,
13,
18,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
17,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
2,
2,
13,
17,
17,
29,
17,
41,
13,
17,
42,
2,
13,
4,
18,
13,
13,
30,
14,
2,
2,
13,
13,
17,
29,
17,
0,
13,
17,
29,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
110,
5
],
[
110,
6
],
[
6,
7
],
[
6,
8
],
[
110,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
11,
17
],
[
17,
18
],
[
17,
19
],
[
11,
21
],
[
21,
22
],
[
21,
23
],
[
11,
24
],
[
24,
25
],
[
25,
26
],
[
26,
27
],
[
26,
28
],
[
24,
29
],
[
29,
30
],
[
29,
31
],
[
24,
32
],
[
32,
33
],
[
33,
34
],
[
24,
35
],
[
36,
36
],
[
36,
37
],
[
37,
38
],
[
38,
39
],
[
38,
40
],
[
37,
41
],
[
41,
42
],
[
42,
43
],
[
36,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
47,
48
],
[
47,
49
],
[
44,
50
],
[
50,
51
],
[
51,
52
],
[
11,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
53,
58
],
[
53,
59
],
[
9,
60
],
[
60,
61
],
[
110,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
65,
66
],
[
66,
67
],
[
66,
68
],
[
65,
69
],
[
69,
70
],
[
64,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
73,
75
],
[
72,
76
],
[
76,
77
],
[
77,
78
],
[
77,
79
],
[
76,
80
],
[
71,
81
],
[
81,
82
],
[
64,
83
],
[
83,
84
],
[
83,
85
],
[
64,
86
],
[
86,
87
],
[
87,
88
],
[
87,
89
],
[
89,
90
],
[
90,
91
],
[
89,
92
],
[
86,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
96,
97
],
[
96,
98
],
[
95,
99
],
[
94,
100
],
[
100,
101
],
[
93,
102
],
[
102,
103
],
[
102,
104
],
[
64,
105
],
[
105,
106
],
[
62,
107
],
[
107,
108
],
[
0,
109
],
[
109,
110
],
[
109,
111
]
] | [
"import java.util.*;\n\npublic class Main{\n\tprivate static final Scanner scan = new Scanner(System.in);\n\n\tpublic static void main(String[] args){\n\t\tint n = scan.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tarr[i] = scan.nextInt();\n\t\t\tif(isPrime(arr[i])){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.printf(\"%d\\n\", count);\n\t}\n\n\tpublic static boolean isPrime(int x){\n\t\tif(x == 2)\n\t\t\treturn true;\n\t\tif(x < 2 || x % 2 == 0)\n\t\t\treturn false;\n\t\tint i = 3;\n\t\twhile(i <= Math.sqrt(x)){\n\t\t\tif(x % i == 0)\n\t\t\t\treturn false;\n\t\t\ti += 2;\n\t\t}\n\t\treturn true;\n\t}\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main{\n\tprivate static final Scanner scan = new Scanner(System.in);\n\n\tpublic static void main(String[] args){\n\t\tint n = scan.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tarr[i] = scan.nextInt();\n\t\t\tif(isPrime(arr[i])){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.printf(\"%d\\n\", count);\n\t}\n\n\tpublic static boolean isPrime(int x){\n\t\tif(x == 2)\n\t\t\treturn true;\n\t\tif(x < 2 || x % 2 == 0)\n\t\t\treturn false;\n\t\tint i = 3;\n\t\twhile(i <= Math.sqrt(x)){\n\t\t\tif(x % i == 0)\n\t\t\t\treturn false;\n\t\t\ti += 2;\n\t\t}\n\t\treturn true;\n\t}\n}",
"Main",
"private static final Scanner scan = new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"public static void main(String[] args){\n\t\tint n = scan.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tarr[i] = scan.nextInt();\n\t\t\tif(isPrime(arr[i])){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.printf(\"%d\\n\", count);\n\t}",
"main",
"{\n\t\tint n = scan.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tarr[i] = scan.nextInt();\n\t\t\tif(isPrime(arr[i])){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.printf(\"%d\\n\", count);\n\t}",
"int n = scan.nextInt();",
"n",
"scan.nextInt()",
"scan.nextInt",
"scan",
"int[] arr = new int[n];",
"arr",
"new int[n]",
"n",
"int count = 0;",
"count",
"0",
"for(int i = 0; i < n; i++){\n\t\t\tarr[i] = scan.nextInt();\n\t\t\tif(isPrime(arr[i])){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tarr[i] = scan.nextInt();\n\t\t\tif(isPrime(arr[i])){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"{\n\t\t\tarr[i] = scan.nextInt();\n\t\t\tif(isPrime(arr[i])){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"arr[i] = scan.nextInt()",
"arr[i]",
"arr",
"i",
"scan.nextInt()",
"scan.nextInt",
"scan",
"if(isPrime(arr[i])){\n\t\t\t\tcount++;\n\t\t\t}",
"isPrime(arr[i])",
"isPrime",
"arr[i]",
"arr",
"i",
"{\n\t\t\t\tcount++;\n\t\t\t}",
"count++",
"count",
"System.out.printf(\"%d\\n\", count)",
"System.out.printf",
"System.out",
"System",
"System.out",
"\"%d\\n\"",
"count",
"String[] args",
"args",
"public static boolean isPrime(int x){\n\t\tif(x == 2)\n\t\t\treturn true;\n\t\tif(x < 2 || x % 2 == 0)\n\t\t\treturn false;\n\t\tint i = 3;\n\t\twhile(i <= Math.sqrt(x)){\n\t\t\tif(x % i == 0)\n\t\t\t\treturn false;\n\t\t\ti += 2;\n\t\t}\n\t\treturn true;\n\t}",
"isPrime",
"{\n\t\tif(x == 2)\n\t\t\treturn true;\n\t\tif(x < 2 || x % 2 == 0)\n\t\t\treturn false;\n\t\tint i = 3;\n\t\twhile(i <= Math.sqrt(x)){\n\t\t\tif(x % i == 0)\n\t\t\t\treturn false;\n\t\t\ti += 2;\n\t\t}\n\t\treturn true;\n\t}",
"if(x == 2)\n\t\t\treturn true;",
"x == 2",
"x",
"2",
"return true;",
"true",
"if(x < 2 || x % 2 == 0)\n\t\t\treturn false;",
"x < 2 || x % 2 == 0",
"x < 2",
"x",
"2",
"x % 2 == 0",
"x % 2",
"x",
"2",
"0",
"return false;",
"false",
"int i = 3;",
"i",
"3",
"while(i <= Math.sqrt(x)){\n\t\t\tif(x % i == 0)\n\t\t\t\treturn false;\n\t\t\ti += 2;\n\t\t}",
"i <= Math.sqrt(x)",
"i",
"Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"{\n\t\t\tif(x % i == 0)\n\t\t\t\treturn false;\n\t\t\ti += 2;\n\t\t}",
"if(x % i == 0)\n\t\t\t\treturn false;",
"x % i == 0",
"x % i",
"x",
"i",
"0",
"return false;",
"false",
"i += 2",
"i",
"2",
"return true;",
"true",
"int x",
"x",
"public class Main{\n\tprivate static final Scanner scan = new Scanner(System.in);\n\n\tpublic static void main(String[] args){\n\t\tint n = scan.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tarr[i] = scan.nextInt();\n\t\t\tif(isPrime(arr[i])){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.printf(\"%d\\n\", count);\n\t}\n\n\tpublic static boolean isPrime(int x){\n\t\tif(x == 2)\n\t\t\treturn true;\n\t\tif(x < 2 || x % 2 == 0)\n\t\t\treturn false;\n\t\tint i = 3;\n\t\twhile(i <= Math.sqrt(x)){\n\t\t\tif(x % i == 0)\n\t\t\t\treturn false;\n\t\t\ti += 2;\n\t\t}\n\t\treturn true;\n\t}\n}",
"public class Main{\n\tprivate static final Scanner scan = new Scanner(System.in);\n\n\tpublic static void main(String[] args){\n\t\tint n = scan.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tarr[i] = scan.nextInt();\n\t\t\tif(isPrime(arr[i])){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.printf(\"%d\\n\", count);\n\t}\n\n\tpublic static boolean isPrime(int x){\n\t\tif(x == 2)\n\t\t\treturn true;\n\t\tif(x < 2 || x % 2 == 0)\n\t\t\treturn false;\n\t\tint i = 3;\n\t\twhile(i <= Math.sqrt(x)){\n\t\t\tif(x % i == 0)\n\t\t\t\treturn false;\n\t\t\ti += 2;\n\t\t}\n\t\treturn true;\n\t}\n}",
"Main"
] | import java.util.*;
public class Main{
private static final Scanner scan = new Scanner(System.in);
public static void main(String[] args){
int n = scan.nextInt();
int[] arr = new int[n];
int count = 0;
for(int i = 0; i < n; i++){
arr[i] = scan.nextInt();
if(isPrime(arr[i])){
count++;
}
}
System.out.printf("%d\n", count);
}
public static boolean isPrime(int x){
if(x == 2)
return true;
if(x < 2 || x % 2 == 0)
return false;
int i = 3;
while(i <= Math.sqrt(x)){
if(x % i == 0)
return false;
i += 2;
}
return true;
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
17,
41,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
18,
13,
13,
14,
2,
13,
17,
9,
41,
13,
17,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
30,
0,
13,
17,
3,
14,
13,
40,
13,
4,
13,
13,
23,
13,
12,
13,
30,
11,
1,
41,
13,
17,
2,
13,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
29,
17,
29,
17,
23,
13,
12,
13,
30,
14,
2,
2,
13,
13,
17,
29,
13,
29,
4,
13,
13,
2,
13,
13,
23,
13,
23,
13,
12,
13,
30,
11,
1,
41,
13,
17,
2,
13,
2,
18,
13,
13,
17,
1,
40,
13,
30,
30,
4,
18,
18,
13,
13,
2,
18,
13,
13,
17,
4,
13,
18,
13,
2,
18,
13,
13,
17,
23,
13,
12,
13,
30,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
30,
4,
13,
17,
30,
4,
13,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
237,
5
],
[
237,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
8,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
8,
20
],
[
20,
21
],
[
20,
22
],
[
8,
24
],
[
24,
25
],
[
25,
26
],
[
26,
27
],
[
26,
28
],
[
24,
29
],
[
29,
30
],
[
29,
31
],
[
24,
32
],
[
32,
33
],
[
33,
34
],
[
24,
35
],
[
35,
36
],
[
36,
37
],
[
37,
38
],
[
37,
39
],
[
36,
40
],
[
40,
41
],
[
41,
42
],
[
8,
43
],
[
43,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
43,
48
],
[
48,
49
],
[
48,
50
],
[
43,
51
],
[
51,
52
],
[
52,
53
],
[
43,
54
],
[
55,
55
],
[
55,
56
],
[
56,
57
],
[
56,
58
],
[
58,
59
],
[
58,
60
],
[
55,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
61,
65
],
[
55,
66
],
[
66,
67
],
[
66,
68
],
[
55,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
69,
74
],
[
74,
75
],
[
75,
76
],
[
75,
77
],
[
74,
78
],
[
69,
79
],
[
79,
80
],
[
80,
81
],
[
69,
82
],
[
83,
83
],
[
83,
84
],
[
84,
85
],
[
85,
86
],
[
86,
87
],
[
86,
88
],
[
85,
89
],
[
84,
90
],
[
90,
91
],
[
91,
92
],
[
91,
93
],
[
90,
94
],
[
55,
95
],
[
95,
96
],
[
95,
97
],
[
97,
98
],
[
8,
99
],
[
99,
100
],
[
99,
101
],
[
6,
102
],
[
102,
103
],
[
237,
104
],
[
104,
105
],
[
104,
106
],
[
106,
107
],
[
107,
108
],
[
108,
109
],
[
109,
110
],
[
109,
111
],
[
107,
112
],
[
112,
113
],
[
112,
114
],
[
114,
115
],
[
114,
116
],
[
107,
117
],
[
117,
118
],
[
118,
119
],
[
107,
120
],
[
121,
121
],
[
121,
122
],
[
122,
123
],
[
123,
124
],
[
124,
125
],
[
124,
126
],
[
123,
127
],
[
122,
128
],
[
128,
129
],
[
106,
130
],
[
130,
131
],
[
104,
132
],
[
132,
133
],
[
237,
134
],
[
134,
135
],
[
134,
136
],
[
136,
137
],
[
137,
138
],
[
138,
139
],
[
139,
140
],
[
139,
141
],
[
138,
142
],
[
137,
143
],
[
143,
144
],
[
137,
145
],
[
145,
146
],
[
146,
147
],
[
146,
148
],
[
146,
149
],
[
149,
150
],
[
149,
151
],
[
134,
152
],
[
152,
153
],
[
134,
154
],
[
154,
155
],
[
237,
156
],
[
156,
157
],
[
156,
158
],
[
158,
159
],
[
159,
160
],
[
160,
161
],
[
161,
162
],
[
161,
163
],
[
159,
164
],
[
164,
165
],
[
164,
166
],
[
166,
167
],
[
167,
168
],
[
167,
169
],
[
166,
170
],
[
159,
171
],
[
171,
172
],
[
172,
173
],
[
159,
174
],
[
175,
175
],
[
175,
176
],
[
176,
177
],
[
177,
178
],
[
178,
179
],
[
178,
180
],
[
176,
181
],
[
181,
182
],
[
182,
183
],
[
182,
184
],
[
181,
185
],
[
158,
186
],
[
186,
187
],
[
186,
188
],
[
188,
189
],
[
188,
190
],
[
190,
191
],
[
191,
192
],
[
191,
193
],
[
190,
194
],
[
156,
195
],
[
195,
196
],
[
237,
197
],
[
197,
198
],
[
197,
199
],
[
199,
200
],
[
200,
201
],
[
201,
202
],
[
202,
203
],
[
202,
204
],
[
200,
205
],
[
197,
206
],
[
206,
207
],
[
237,
208
],
[
208,
209
],
[
208,
210
],
[
210,
211
],
[
211,
212
],
[
212,
213
],
[
213,
214
],
[
213,
215
],
[
211,
216
],
[
208,
217
],
[
217,
218
],
[
237,
219
],
[
219,
220
],
[
219,
221
],
[
221,
222
],
[
222,
223
],
[
223,
224
],
[
223,
225
],
[
222,
226
],
[
226,
227
],
[
227,
228
],
[
227,
229
],
[
222,
230
],
[
230,
231
],
[
231,
232
],
[
231,
233
],
[
219,
234
],
[
234,
235
],
[
0,
236
],
[
236,
237
],
[
236,
238
]
] | [
"import java.util.*;\n \npublic class Main {\n\t\n\t\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint ans=0;\n\t\tint n = sc.nextInt();\n\t\tint[] in = new int[n];\n\t\tfor(int i=0;i<n;i++) in[i] = sc.nextInt();\n\t\tfor(int t=0;t<n;t++){\n\t\t\tint num = in[t];\n\t\t\tif(num==1) continue;\n\t\t\tboolean f = true;\n\t\t\tfor(int i=2;i*i<=num;i++){\n\t\t\t\tif(num%i==0){\n\t\t\t\t\tf = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(f) ans++;\n\t\t}\n\t\tcout(ans);\n\t}\n\t\n\tpublic static boolean isPrime(int n){\n\t\tfor(int i=2;i<=n*n;i++){\n\t\t\tif(n%i==0) return true;\n\t\t}\n\t\treturn false;\n\t}\n\t\n\tpublic static int gcd(int a,int b){\n\t\tif(a%b==0) return b;\n\t\telse return gcd(b,a%b);\n\t}\n\t\n\tpublic static void showary(int[] ary){\n\t\tfor(int i=0;i<ary.length-1;i++){\n\t\t\tSystem.out.print(ary[i]+\" \");\n\t\t}\n\t\tcout(ary[ary.length-1]);\n\t}\n\t\n\tpublic static void cout(String n){\n\t\tSystem.out.println(n);\n\t}\n\t\n\tpublic static void cout(int n){\n\t\tSystem.out.println(n);\n\t}\n\tpublic static void cout(boolean n){\n\t\tif(n==true){\n\t\t\tcout(\"true\");\n\t\t}else{\n\t\t\tcout(\"false\");\n\t\t}\n\t}\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n\t\n\t\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint ans=0;\n\t\tint n = sc.nextInt();\n\t\tint[] in = new int[n];\n\t\tfor(int i=0;i<n;i++) in[i] = sc.nextInt();\n\t\tfor(int t=0;t<n;t++){\n\t\t\tint num = in[t];\n\t\t\tif(num==1) continue;\n\t\t\tboolean f = true;\n\t\t\tfor(int i=2;i*i<=num;i++){\n\t\t\t\tif(num%i==0){\n\t\t\t\t\tf = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(f) ans++;\n\t\t}\n\t\tcout(ans);\n\t}\n\t\n\tpublic static boolean isPrime(int n){\n\t\tfor(int i=2;i<=n*n;i++){\n\t\t\tif(n%i==0) return true;\n\t\t}\n\t\treturn false;\n\t}\n\t\n\tpublic static int gcd(int a,int b){\n\t\tif(a%b==0) return b;\n\t\telse return gcd(b,a%b);\n\t}\n\t\n\tpublic static void showary(int[] ary){\n\t\tfor(int i=0;i<ary.length-1;i++){\n\t\t\tSystem.out.print(ary[i]+\" \");\n\t\t}\n\t\tcout(ary[ary.length-1]);\n\t}\n\t\n\tpublic static void cout(String n){\n\t\tSystem.out.println(n);\n\t}\n\t\n\tpublic static void cout(int n){\n\t\tSystem.out.println(n);\n\t}\n\tpublic static void cout(boolean n){\n\t\tif(n==true){\n\t\t\tcout(\"true\");\n\t\t}else{\n\t\t\tcout(\"false\");\n\t\t}\n\t}\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint ans=0;\n\t\tint n = sc.nextInt();\n\t\tint[] in = new int[n];\n\t\tfor(int i=0;i<n;i++) in[i] = sc.nextInt();\n\t\tfor(int t=0;t<n;t++){\n\t\t\tint num = in[t];\n\t\t\tif(num==1) continue;\n\t\t\tboolean f = true;\n\t\t\tfor(int i=2;i*i<=num;i++){\n\t\t\t\tif(num%i==0){\n\t\t\t\t\tf = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(f) ans++;\n\t\t}\n\t\tcout(ans);\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint ans=0;\n\t\tint n = sc.nextInt();\n\t\tint[] in = new int[n];\n\t\tfor(int i=0;i<n;i++) in[i] = sc.nextInt();\n\t\tfor(int t=0;t<n;t++){\n\t\t\tint num = in[t];\n\t\t\tif(num==1) continue;\n\t\t\tboolean f = true;\n\t\t\tfor(int i=2;i*i<=num;i++){\n\t\t\t\tif(num%i==0){\n\t\t\t\t\tf = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(f) ans++;\n\t\t}\n\t\tcout(ans);\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int ans=0;",
"ans",
"0",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int[] in = new int[n];",
"in",
"new int[n]",
"n",
"for(int i=0;i<n;i++) in[i] = sc.nextInt();",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"in[i] = sc.nextInt();",
"in[i] = sc.nextInt()",
"in[i]",
"in",
"i",
"sc.nextInt()",
"sc.nextInt",
"sc",
"for(int t=0;t<n;t++){\n\t\t\tint num = in[t];\n\t\t\tif(num==1) continue;\n\t\t\tboolean f = true;\n\t\t\tfor(int i=2;i*i<=num;i++){\n\t\t\t\tif(num%i==0){\n\t\t\t\t\tf = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(f) ans++;\n\t\t}",
"int t=0;",
"int t=0;",
"t",
"0",
"t<n",
"t",
"n",
"t++",
"t++",
"t",
"{\n\t\t\tint num = in[t];\n\t\t\tif(num==1) continue;\n\t\t\tboolean f = true;\n\t\t\tfor(int i=2;i*i<=num;i++){\n\t\t\t\tif(num%i==0){\n\t\t\t\t\tf = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(f) ans++;\n\t\t}",
"{\n\t\t\tint num = in[t];\n\t\t\tif(num==1) continue;\n\t\t\tboolean f = true;\n\t\t\tfor(int i=2;i*i<=num;i++){\n\t\t\t\tif(num%i==0){\n\t\t\t\t\tf = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(f) ans++;\n\t\t}",
"int num = in[t];",
"num",
"in[t]",
"in",
"t",
"if(num==1) continue;",
"num==1",
"num",
"1",
"continue;",
"boolean f = true;",
"f",
"true",
"for(int i=2;i*i<=num;i++){\n\t\t\t\tif(num%i==0){\n\t\t\t\t\tf = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"int i=2;",
"int i=2;",
"i",
"2",
"i*i<=num",
"i*i",
"i",
"i",
"num",
"i++",
"i++",
"i",
"{\n\t\t\t\tif(num%i==0){\n\t\t\t\t\tf = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif(num%i==0){\n\t\t\t\t\tf = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"if(num%i==0){\n\t\t\t\t\tf = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"num%i==0",
"num%i",
"num",
"i",
"0",
"{\n\t\t\t\t\tf = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"f = false",
"f",
"false",
"break;",
"if(f) ans++;",
"f",
"ans++",
"ans",
"cout(ans)",
"cout",
"ans",
"String[] args",
"args",
"public static boolean isPrime(int n){\n\t\tfor(int i=2;i<=n*n;i++){\n\t\t\tif(n%i==0) return true;\n\t\t}\n\t\treturn false;\n\t}",
"isPrime",
"{\n\t\tfor(int i=2;i<=n*n;i++){\n\t\t\tif(n%i==0) return true;\n\t\t}\n\t\treturn false;\n\t}",
"for(int i=2;i<=n*n;i++){\n\t\t\tif(n%i==0) return true;\n\t\t}",
"int i=2;",
"int i=2;",
"i",
"2",
"i<=n*n",
"i",
"n*n",
"n",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tif(n%i==0) return true;\n\t\t}",
"{\n\t\t\tif(n%i==0) return true;\n\t\t}",
"if(n%i==0) return true;",
"n%i==0",
"n%i",
"n",
"i",
"0",
"return true;",
"true",
"return false;",
"false",
"int n",
"n",
"public static int gcd(int a,int b){\n\t\tif(a%b==0) return b;\n\t\telse return gcd(b,a%b);\n\t}",
"gcd",
"{\n\t\tif(a%b==0) return b;\n\t\telse return gcd(b,a%b);\n\t}",
"if(a%b==0) return b;\n\t\telse return gcd(b,a%b);",
"a%b==0",
"a%b",
"a",
"b",
"0",
"return b;",
"b",
"return gcd(b,a%b);",
"gcd(b,a%b)",
"gcd",
"b",
"a%b",
"a",
"b",
"int a",
"a",
"int b",
"b",
"public static void showary(int[] ary){\n\t\tfor(int i=0;i<ary.length-1;i++){\n\t\t\tSystem.out.print(ary[i]+\" \");\n\t\t}\n\t\tcout(ary[ary.length-1]);\n\t}",
"showary",
"{\n\t\tfor(int i=0;i<ary.length-1;i++){\n\t\t\tSystem.out.print(ary[i]+\" \");\n\t\t}\n\t\tcout(ary[ary.length-1]);\n\t}",
"for(int i=0;i<ary.length-1;i++){\n\t\t\tSystem.out.print(ary[i]+\" \");\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<ary.length-1",
"i",
"ary.length-1",
"ary.length",
"ary",
"ary.length",
"1",
"i++",
"i++",
"i",
"{\n\t\t\tSystem.out.print(ary[i]+\" \");\n\t\t}",
"{\n\t\t\tSystem.out.print(ary[i]+\" \");\n\t\t}",
"System.out.print(ary[i]+\" \")",
"System.out.print",
"System.out",
"System",
"System.out",
"ary[i]+\" \"",
"ary[i]",
"ary",
"i",
"\" \"",
"cout(ary[ary.length-1])",
"cout",
"ary[ary.length-1]",
"ary",
"ary.length-1",
"ary.length",
"ary",
"ary.length",
"1",
"int[] ary",
"ary",
"public static void cout(String n){\n\t\tSystem.out.println(n);\n\t}",
"cout",
"{\n\t\tSystem.out.println(n);\n\t}",
"System.out.println(n)",
"System.out.println",
"System.out",
"System",
"System.out",
"n",
"String n",
"n",
"public static void cout(int n){\n\t\tSystem.out.println(n);\n\t}",
"cout",
"{\n\t\tSystem.out.println(n);\n\t}",
"System.out.println(n)",
"System.out.println",
"System.out",
"System",
"System.out",
"n",
"int n",
"n",
"public static void cout(boolean n){\n\t\tif(n==true){\n\t\t\tcout(\"true\");\n\t\t}else{\n\t\t\tcout(\"false\");\n\t\t}\n\t}",
"cout",
"{\n\t\tif(n==true){\n\t\t\tcout(\"true\");\n\t\t}else{\n\t\t\tcout(\"false\");\n\t\t}\n\t}",
"if(n==true){\n\t\t\tcout(\"true\");\n\t\t}else{\n\t\t\tcout(\"false\");\n\t\t}",
"n==true",
"n",
"true",
"{\n\t\t\tcout(\"true\");\n\t\t}",
"cout(\"true\")",
"cout",
"\"true\"",
"{\n\t\t\tcout(\"false\");\n\t\t}",
"cout(\"false\")",
"cout",
"\"false\"",
"boolean n",
"n",
"public class Main {\n\t\n\t\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint ans=0;\n\t\tint n = sc.nextInt();\n\t\tint[] in = new int[n];\n\t\tfor(int i=0;i<n;i++) in[i] = sc.nextInt();\n\t\tfor(int t=0;t<n;t++){\n\t\t\tint num = in[t];\n\t\t\tif(num==1) continue;\n\t\t\tboolean f = true;\n\t\t\tfor(int i=2;i*i<=num;i++){\n\t\t\t\tif(num%i==0){\n\t\t\t\t\tf = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(f) ans++;\n\t\t}\n\t\tcout(ans);\n\t}\n\t\n\tpublic static boolean isPrime(int n){\n\t\tfor(int i=2;i<=n*n;i++){\n\t\t\tif(n%i==0) return true;\n\t\t}\n\t\treturn false;\n\t}\n\t\n\tpublic static int gcd(int a,int b){\n\t\tif(a%b==0) return b;\n\t\telse return gcd(b,a%b);\n\t}\n\t\n\tpublic static void showary(int[] ary){\n\t\tfor(int i=0;i<ary.length-1;i++){\n\t\t\tSystem.out.print(ary[i]+\" \");\n\t\t}\n\t\tcout(ary[ary.length-1]);\n\t}\n\t\n\tpublic static void cout(String n){\n\t\tSystem.out.println(n);\n\t}\n\t\n\tpublic static void cout(int n){\n\t\tSystem.out.println(n);\n\t}\n\tpublic static void cout(boolean n){\n\t\tif(n==true){\n\t\t\tcout(\"true\");\n\t\t}else{\n\t\t\tcout(\"false\");\n\t\t}\n\t}\n}",
"public class Main {\n\t\n\t\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint ans=0;\n\t\tint n = sc.nextInt();\n\t\tint[] in = new int[n];\n\t\tfor(int i=0;i<n;i++) in[i] = sc.nextInt();\n\t\tfor(int t=0;t<n;t++){\n\t\t\tint num = in[t];\n\t\t\tif(num==1) continue;\n\t\t\tboolean f = true;\n\t\t\tfor(int i=2;i*i<=num;i++){\n\t\t\t\tif(num%i==0){\n\t\t\t\t\tf = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(f) ans++;\n\t\t}\n\t\tcout(ans);\n\t}\n\t\n\tpublic static boolean isPrime(int n){\n\t\tfor(int i=2;i<=n*n;i++){\n\t\t\tif(n%i==0) return true;\n\t\t}\n\t\treturn false;\n\t}\n\t\n\tpublic static int gcd(int a,int b){\n\t\tif(a%b==0) return b;\n\t\telse return gcd(b,a%b);\n\t}\n\t\n\tpublic static void showary(int[] ary){\n\t\tfor(int i=0;i<ary.length-1;i++){\n\t\t\tSystem.out.print(ary[i]+\" \");\n\t\t}\n\t\tcout(ary[ary.length-1]);\n\t}\n\t\n\tpublic static void cout(String n){\n\t\tSystem.out.println(n);\n\t}\n\t\n\tpublic static void cout(int n){\n\t\tSystem.out.println(n);\n\t}\n\tpublic static void cout(boolean n){\n\t\tif(n==true){\n\t\t\tcout(\"true\");\n\t\t}else{\n\t\t\tcout(\"false\");\n\t\t}\n\t}\n}",
"Main"
] | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int ans=0;
int n = sc.nextInt();
int[] in = new int[n];
for(int i=0;i<n;i++) in[i] = sc.nextInt();
for(int t=0;t<n;t++){
int num = in[t];
if(num==1) continue;
boolean f = true;
for(int i=2;i*i<=num;i++){
if(num%i==0){
f = false;
break;
}
}
if(f) ans++;
}
cout(ans);
}
public static boolean isPrime(int n){
for(int i=2;i<=n*n;i++){
if(n%i==0) return true;
}
return false;
}
public static int gcd(int a,int b){
if(a%b==0) return b;
else return gcd(b,a%b);
}
public static void showary(int[] ary){
for(int i=0;i<ary.length-1;i++){
System.out.print(ary[i]+" ");
}
cout(ary[ary.length-1]);
}
public static void cout(String n){
System.out.println(n);
}
public static void cout(int n){
System.out.println(n);
}
public static void cout(boolean n){
if(n==true){
cout("true");
}else{
cout("false");
}
}
} |
[
7,
15,
13,
17,
6,
13,
41,
13,
12,
13,
30,
14,
2,
13,
17,
29,
17,
41,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
2,
13,
13,
14,
2,
2,
13,
13,
17,
29,
17,
14,
2,
13,
13,
3,
29,
17,
23,
13,
12,
13,
30,
0,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
4,
13,
18,
13,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
123,
5
],
[
123,
6
],
[
6,
7
],
[
123,
8
],
[
8,
9
],
[
8,
10
],
[
10,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
11,
15
],
[
15,
16
],
[
10,
17
],
[
17,
18
],
[
17,
19
],
[
10,
20
],
[
20,
21
],
[
21,
22
],
[
22,
23
],
[
22,
24
],
[
20,
25
],
[
25,
26
],
[
25,
27
],
[
20,
28
],
[
28,
29
],
[
29,
30
],
[
20,
31
],
[
32,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
35,
36
],
[
35,
37
],
[
32,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
39,
43
],
[
38,
44
],
[
44,
45
],
[
32,
46
],
[
46,
47
],
[
47,
48
],
[
47,
49
],
[
46,
50
],
[
10,
51
],
[
51,
52
],
[
8,
53
],
[
53,
54
],
[
123,
55
],
[
55,
56
],
[
55,
57
],
[
57,
58
],
[
58,
59
],
[
58,
60
],
[
57,
61
],
[
61,
62
],
[
61,
63
],
[
63,
64
],
[
64,
65
],
[
57,
66
],
[
66,
67
],
[
66,
68
],
[
57,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
70,
75
],
[
75,
76
],
[
75,
77
],
[
70,
78
],
[
78,
79
],
[
79,
80
],
[
70,
81
],
[
82,
82
],
[
82,
83
],
[
83,
84
],
[
84,
85
],
[
84,
86
],
[
83,
87
],
[
87,
88
],
[
88,
89
],
[
57,
90
],
[
90,
91
],
[
90,
92
],
[
57,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
95,
97
],
[
93,
98
],
[
98,
99
],
[
98,
100
],
[
93,
101
],
[
101,
102
],
[
102,
103
],
[
93,
104
],
[
105,
105
],
[
105,
106
],
[
106,
107
],
[
107,
108
],
[
107,
109
],
[
109,
110
],
[
109,
111
],
[
106,
112
],
[
112,
113
],
[
57,
114
],
[
114,
115
],
[
115,
116
],
[
116,
117
],
[
116,
118
],
[
114,
119
],
[
55,
120
],
[
120,
121
],
[
0,
122
],
[
122,
123
],
[
122,
124
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n\t\n\tstatic Scanner scan;\n\t\n\tpublic static boolean judgePN(int a) {\n\t\tif (a == 1) return false;\n\t\t\n\t\tint quotient = a;\n\t\t\n\t\tfor(int i = 2; i < a; i++) {\n\t\t\tquotient = a / i;\n\t\t\tif(a % i == 0) return false;\n\t\t\tif(i > quotient) break;\n\t\t}\n\t\t\n\t\treturn true;\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tscan = new Scanner(System.in);\n\t\t\n\t\t// Get the number of the input list\n\t\tfinal int n = scan.nextInt();\n\t\t\n\t\t// Get figures of the input list\n\t\tint list[] = new int[n];\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tlist[i] = scan.nextInt();\n\t\t}\n\t\t\n\t\t// Count the number of prime number\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tif(judgePN(list[i])) count++;\n\t\t}\n\t\t\n\t\t// Output\n\t\tSystem.out.println(count);\n\t}\n}\n",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\t\n\tstatic Scanner scan;\n\t\n\tpublic static boolean judgePN(int a) {\n\t\tif (a == 1) return false;\n\t\t\n\t\tint quotient = a;\n\t\t\n\t\tfor(int i = 2; i < a; i++) {\n\t\t\tquotient = a / i;\n\t\t\tif(a % i == 0) return false;\n\t\t\tif(i > quotient) break;\n\t\t}\n\t\t\n\t\treturn true;\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tscan = new Scanner(System.in);\n\t\t\n\t\t// Get the number of the input list\n\t\tfinal int n = scan.nextInt();\n\t\t\n\t\t// Get figures of the input list\n\t\tint list[] = new int[n];\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tlist[i] = scan.nextInt();\n\t\t}\n\t\t\n\t\t// Count the number of prime number\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tif(judgePN(list[i])) count++;\n\t\t}\n\t\t\n\t\t// Output\n\t\tSystem.out.println(count);\n\t}\n}",
"Main",
"static Scanner scan;",
"scan",
"public static boolean judgePN(int a) {\n\t\tif (a == 1) return false;\n\t\t\n\t\tint quotient = a;\n\t\t\n\t\tfor(int i = 2; i < a; i++) {\n\t\t\tquotient = a / i;\n\t\t\tif(a % i == 0) return false;\n\t\t\tif(i > quotient) break;\n\t\t}\n\t\t\n\t\treturn true;\n\t}",
"judgePN",
"{\n\t\tif (a == 1) return false;\n\t\t\n\t\tint quotient = a;\n\t\t\n\t\tfor(int i = 2; i < a; i++) {\n\t\t\tquotient = a / i;\n\t\t\tif(a % i == 0) return false;\n\t\t\tif(i > quotient) break;\n\t\t}\n\t\t\n\t\treturn true;\n\t}",
"if (a == 1) return false;",
"a == 1",
"a",
"1",
"return false;",
"false",
"int quotient = a;",
"quotient",
"a",
"for(int i = 2; i < a; i++) {\n\t\t\tquotient = a / i;\n\t\t\tif(a % i == 0) return false;\n\t\t\tif(i > quotient) break;\n\t\t}",
"int i = 2;",
"int i = 2;",
"i",
"2",
"i < a",
"i",
"a",
"i++",
"i++",
"i",
"{\n\t\t\tquotient = a / i;\n\t\t\tif(a % i == 0) return false;\n\t\t\tif(i > quotient) break;\n\t\t}",
"{\n\t\t\tquotient = a / i;\n\t\t\tif(a % i == 0) return false;\n\t\t\tif(i > quotient) break;\n\t\t}",
"quotient = a / i",
"quotient",
"a / i",
"a",
"i",
"if(a % i == 0) return false;",
"a % i == 0",
"a % i",
"a",
"i",
"0",
"return false;",
"false",
"if(i > quotient) break;",
"i > quotient",
"i",
"quotient",
"break;",
"return true;",
"true",
"int a",
"a",
"public static void main(String[] args) {\n\t\tscan = new Scanner(System.in);\n\t\t\n\t\t// Get the number of the input list\n\t\tfinal int n = scan.nextInt();\n\t\t\n\t\t// Get figures of the input list\n\t\tint list[] = new int[n];\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tlist[i] = scan.nextInt();\n\t\t}\n\t\t\n\t\t// Count the number of prime number\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tif(judgePN(list[i])) count++;\n\t\t}\n\t\t\n\t\t// Output\n\t\tSystem.out.println(count);\n\t}",
"main",
"{\n\t\tscan = new Scanner(System.in);\n\t\t\n\t\t// Get the number of the input list\n\t\tfinal int n = scan.nextInt();\n\t\t\n\t\t// Get figures of the input list\n\t\tint list[] = new int[n];\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tlist[i] = scan.nextInt();\n\t\t}\n\t\t\n\t\t// Count the number of prime number\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tif(judgePN(list[i])) count++;\n\t\t}\n\t\t\n\t\t// Output\n\t\tSystem.out.println(count);\n\t}",
"scan = new Scanner(System.in)",
"scan",
"new Scanner(System.in)",
"final int n = scan.nextInt();",
"n",
"scan.nextInt()",
"scan.nextInt",
"scan",
"int list[] = new int[n];",
"list",
"new int[n]",
"n",
"for(int i = 0; i < n; i++) {\n\t\t\tlist[i] = scan.nextInt();\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tlist[i] = scan.nextInt();\n\t\t}",
"{\n\t\t\tlist[i] = scan.nextInt();\n\t\t}",
"list[i] = scan.nextInt()",
"list[i]",
"list",
"i",
"scan.nextInt()",
"scan.nextInt",
"scan",
"int count = 0;",
"count",
"0",
"for(int i = 0; i < n; i++) {\n\t\t\tif(judgePN(list[i])) count++;\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tif(judgePN(list[i])) count++;\n\t\t}",
"{\n\t\t\tif(judgePN(list[i])) count++;\n\t\t}",
"if(judgePN(list[i])) count++;",
"judgePN(list[i])",
"judgePN",
"list[i]",
"list",
"i",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"public class Main {\n\t\n\tstatic Scanner scan;\n\t\n\tpublic static boolean judgePN(int a) {\n\t\tif (a == 1) return false;\n\t\t\n\t\tint quotient = a;\n\t\t\n\t\tfor(int i = 2; i < a; i++) {\n\t\t\tquotient = a / i;\n\t\t\tif(a % i == 0) return false;\n\t\t\tif(i > quotient) break;\n\t\t}\n\t\t\n\t\treturn true;\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tscan = new Scanner(System.in);\n\t\t\n\t\t// Get the number of the input list\n\t\tfinal int n = scan.nextInt();\n\t\t\n\t\t// Get figures of the input list\n\t\tint list[] = new int[n];\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tlist[i] = scan.nextInt();\n\t\t}\n\t\t\n\t\t// Count the number of prime number\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tif(judgePN(list[i])) count++;\n\t\t}\n\t\t\n\t\t// Output\n\t\tSystem.out.println(count);\n\t}\n}",
"public class Main {\n\t\n\tstatic Scanner scan;\n\t\n\tpublic static boolean judgePN(int a) {\n\t\tif (a == 1) return false;\n\t\t\n\t\tint quotient = a;\n\t\t\n\t\tfor(int i = 2; i < a; i++) {\n\t\t\tquotient = a / i;\n\t\t\tif(a % i == 0) return false;\n\t\t\tif(i > quotient) break;\n\t\t}\n\t\t\n\t\treturn true;\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tscan = new Scanner(System.in);\n\t\t\n\t\t// Get the number of the input list\n\t\tfinal int n = scan.nextInt();\n\t\t\n\t\t// Get figures of the input list\n\t\tint list[] = new int[n];\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tlist[i] = scan.nextInt();\n\t\t}\n\t\t\n\t\t// Count the number of prime number\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tif(judgePN(list[i])) count++;\n\t\t}\n\t\t\n\t\t// Output\n\t\tSystem.out.println(count);\n\t}\n}",
"Main"
] | import java.util.Scanner;
public class Main {
static Scanner scan;
public static boolean judgePN(int a) {
if (a == 1) return false;
int quotient = a;
for(int i = 2; i < a; i++) {
quotient = a / i;
if(a % i == 0) return false;
if(i > quotient) break;
}
return true;
}
public static void main(String[] args) {
scan = new Scanner(System.in);
// Get the number of the input list
final int n = scan.nextInt();
// Get figures of the input list
int list[] = new int[n];
for(int i = 0; i < n; i++) {
list[i] = scan.nextInt();
}
// Count the number of prime number
int count = 0;
for(int i = 0; i < n; i++) {
if(judgePN(list[i])) count++;
}
// Output
System.out.println(count);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
17,
11,
1,
41,
13,
17,
2,
13,
17,
1,
40,
13,
30,
30,
14,
2,
18,
13,
13,
17,
30,
0,
18,
13,
13,
17,
14,
2,
13,
17,
30,
41,
13,
2,
17,
13,
42,
2,
13,
17,
30,
14,
2,
18,
13,
13,
17,
30,
0,
18,
13,
13,
40,
17,
0,
13,
13,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
14,
2,
18,
13,
13,
17,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
116,
5
],
[
116,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
13
],
[
13,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
13,
18
],
[
18,
19
],
[
18,
20
],
[
13,
21
],
[
21,
22
],
[
22,
23
],
[
13,
24
],
[
25,
25
],
[
25,
26
],
[
26,
27
],
[
27,
28
],
[
28,
29
],
[
28,
30
],
[
27,
31
],
[
26,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
34,
36
],
[
33,
37
],
[
32,
38
],
[
38,
39
],
[
39,
40
],
[
39,
41
],
[
38,
42
],
[
42,
43
],
[
43,
44
],
[
43,
45
],
[
45,
46
],
[
45,
47
],
[
42,
48
],
[
48,
49
],
[
49,
50
],
[
49,
51
],
[
48,
52
],
[
52,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
54,
58
],
[
53,
59
],
[
59,
60
],
[
60,
61
],
[
61,
62
],
[
61,
63
],
[
60,
64
],
[
64,
65
],
[
52,
66
],
[
66,
67
],
[
66,
68
],
[
8,
69
],
[
69,
70
],
[
69,
71
],
[
8,
72
],
[
72,
73
],
[
72,
74
],
[
74,
75
],
[
75,
76
],
[
8,
77
],
[
77,
78
],
[
77,
79
],
[
8,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
82,
84
],
[
80,
85
],
[
85,
86
],
[
85,
87
],
[
80,
88
],
[
88,
89
],
[
89,
90
],
[
80,
91
],
[
92,
92
],
[
92,
93
],
[
93,
94
],
[
93,
95
],
[
95,
96
],
[
96,
97
],
[
92,
98
],
[
98,
99
],
[
99,
100
],
[
100,
101
],
[
100,
102
],
[
99,
103
],
[
98,
104
],
[
104,
105
],
[
105,
106
],
[
8,
107
],
[
107,
108
],
[
108,
109
],
[
109,
110
],
[
109,
111
],
[
107,
112
],
[
6,
113
],
[
113,
114
],
[
0,
115
],
[
115,
116
],
[
115,
117
]
] | [
"import java.util.Scanner;\npublic class Main{\n public static void main(String[] args){\n int[] era = new int[100000001];\n for(int i = 2; i <= 100000000; i++){\n if(era[i] == 0){\n era[i] = 1;\n if(i <= 10000){\n int j = 2*i;\n while(j <= 100000000){\n if(era[j] == 0){\n era[j] = -1;\n }\n j += i;\n }\n }\n }\n }\n Scanner scan = new Scanner(System.in);\n int n = scan.nextInt();\n \tint cnt = 0;\n for(int i = 0; i < n; i++){\n int x = scan.nextInt();\n if(era[x] > 0){\n cnt++;\n }\n }\n \tSystem.out.println(cnt);\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main{\n public static void main(String[] args){\n int[] era = new int[100000001];\n for(int i = 2; i <= 100000000; i++){\n if(era[i] == 0){\n era[i] = 1;\n if(i <= 10000){\n int j = 2*i;\n while(j <= 100000000){\n if(era[j] == 0){\n era[j] = -1;\n }\n j += i;\n }\n }\n }\n }\n Scanner scan = new Scanner(System.in);\n int n = scan.nextInt();\n \tint cnt = 0;\n for(int i = 0; i < n; i++){\n int x = scan.nextInt();\n if(era[x] > 0){\n cnt++;\n }\n }\n \tSystem.out.println(cnt);\n }\n}",
"Main",
"public static void main(String[] args){\n int[] era = new int[100000001];\n for(int i = 2; i <= 100000000; i++){\n if(era[i] == 0){\n era[i] = 1;\n if(i <= 10000){\n int j = 2*i;\n while(j <= 100000000){\n if(era[j] == 0){\n era[j] = -1;\n }\n j += i;\n }\n }\n }\n }\n Scanner scan = new Scanner(System.in);\n int n = scan.nextInt();\n \tint cnt = 0;\n for(int i = 0; i < n; i++){\n int x = scan.nextInt();\n if(era[x] > 0){\n cnt++;\n }\n }\n \tSystem.out.println(cnt);\n }",
"main",
"{\n int[] era = new int[100000001];\n for(int i = 2; i <= 100000000; i++){\n if(era[i] == 0){\n era[i] = 1;\n if(i <= 10000){\n int j = 2*i;\n while(j <= 100000000){\n if(era[j] == 0){\n era[j] = -1;\n }\n j += i;\n }\n }\n }\n }\n Scanner scan = new Scanner(System.in);\n int n = scan.nextInt();\n \tint cnt = 0;\n for(int i = 0; i < n; i++){\n int x = scan.nextInt();\n if(era[x] > 0){\n cnt++;\n }\n }\n \tSystem.out.println(cnt);\n }",
"int[] era = new int[100000001];",
"era",
"new int[100000001]",
"100000001",
"for(int i = 2; i <= 100000000; i++){\n if(era[i] == 0){\n era[i] = 1;\n if(i <= 10000){\n int j = 2*i;\n while(j <= 100000000){\n if(era[j] == 0){\n era[j] = -1;\n }\n j += i;\n }\n }\n }\n }",
"int i = 2;",
"int i = 2;",
"i",
"2",
"i <= 100000000",
"i",
"100000000",
"i++",
"i++",
"i",
"{\n if(era[i] == 0){\n era[i] = 1;\n if(i <= 10000){\n int j = 2*i;\n while(j <= 100000000){\n if(era[j] == 0){\n era[j] = -1;\n }\n j += i;\n }\n }\n }\n }",
"{\n if(era[i] == 0){\n era[i] = 1;\n if(i <= 10000){\n int j = 2*i;\n while(j <= 100000000){\n if(era[j] == 0){\n era[j] = -1;\n }\n j += i;\n }\n }\n }\n }",
"if(era[i] == 0){\n era[i] = 1;\n if(i <= 10000){\n int j = 2*i;\n while(j <= 100000000){\n if(era[j] == 0){\n era[j] = -1;\n }\n j += i;\n }\n }\n }",
"era[i] == 0",
"era[i]",
"era",
"i",
"0",
"{\n era[i] = 1;\n if(i <= 10000){\n int j = 2*i;\n while(j <= 100000000){\n if(era[j] == 0){\n era[j] = -1;\n }\n j += i;\n }\n }\n }",
"era[i] = 1",
"era[i]",
"era",
"i",
"1",
"if(i <= 10000){\n int j = 2*i;\n while(j <= 100000000){\n if(era[j] == 0){\n era[j] = -1;\n }\n j += i;\n }\n }",
"i <= 10000",
"i",
"10000",
"{\n int j = 2*i;\n while(j <= 100000000){\n if(era[j] == 0){\n era[j] = -1;\n }\n j += i;\n }\n }",
"int j = 2*i;",
"j",
"2*i",
"2",
"i",
"while(j <= 100000000){\n if(era[j] == 0){\n era[j] = -1;\n }\n j += i;\n }",
"j <= 100000000",
"j",
"100000000",
"{\n if(era[j] == 0){\n era[j] = -1;\n }\n j += i;\n }",
"if(era[j] == 0){\n era[j] = -1;\n }",
"era[j] == 0",
"era[j]",
"era",
"j",
"0",
"{\n era[j] = -1;\n }",
"era[j] = -1",
"era[j]",
"era",
"j",
"-1",
"1",
"j += i",
"j",
"i",
"Scanner scan = new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"int n = scan.nextInt();",
"n",
"scan.nextInt()",
"scan.nextInt",
"scan",
"int cnt = 0;",
"cnt",
"0",
"for(int i = 0; i < n; i++){\n int x = scan.nextInt();\n if(era[x] > 0){\n cnt++;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n int x = scan.nextInt();\n if(era[x] > 0){\n cnt++;\n }\n }",
"{\n int x = scan.nextInt();\n if(era[x] > 0){\n cnt++;\n }\n }",
"int x = scan.nextInt();",
"x",
"scan.nextInt()",
"scan.nextInt",
"scan",
"if(era[x] > 0){\n cnt++;\n }",
"era[x] > 0",
"era[x]",
"era",
"x",
"0",
"{\n cnt++;\n }",
"cnt++",
"cnt",
"System.out.println(cnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"String[] args",
"args",
"public class Main{\n public static void main(String[] args){\n int[] era = new int[100000001];\n for(int i = 2; i <= 100000000; i++){\n if(era[i] == 0){\n era[i] = 1;\n if(i <= 10000){\n int j = 2*i;\n while(j <= 100000000){\n if(era[j] == 0){\n era[j] = -1;\n }\n j += i;\n }\n }\n }\n }\n Scanner scan = new Scanner(System.in);\n int n = scan.nextInt();\n \tint cnt = 0;\n for(int i = 0; i < n; i++){\n int x = scan.nextInt();\n if(era[x] > 0){\n cnt++;\n }\n }\n \tSystem.out.println(cnt);\n }\n}",
"public class Main{\n public static void main(String[] args){\n int[] era = new int[100000001];\n for(int i = 2; i <= 100000000; i++){\n if(era[i] == 0){\n era[i] = 1;\n if(i <= 10000){\n int j = 2*i;\n while(j <= 100000000){\n if(era[j] == 0){\n era[j] = -1;\n }\n j += i;\n }\n }\n }\n }\n Scanner scan = new Scanner(System.in);\n int n = scan.nextInt();\n \tint cnt = 0;\n for(int i = 0; i < n; i++){\n int x = scan.nextInt();\n if(era[x] > 0){\n cnt++;\n }\n }\n \tSystem.out.println(cnt);\n }\n}",
"Main"
] | import java.util.Scanner;
public class Main{
public static void main(String[] args){
int[] era = new int[100000001];
for(int i = 2; i <= 100000000; i++){
if(era[i] == 0){
era[i] = 1;
if(i <= 10000){
int j = 2*i;
while(j <= 100000000){
if(era[j] == 0){
era[j] = -1;
}
j += i;
}
}
}
}
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int cnt = 0;
for(int i = 0; i < n; i++){
int x = scan.nextInt();
if(era[x] > 0){
cnt++;
}
}
System.out.println(cnt);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
17,
14,
2,
2,
13,
17,
2,
2,
13,
17,
17,
30,
29,
17,
30,
41,
13,
17,
42,
2,
13,
4,
18,
13,
13,
30,
14,
2,
2,
13,
13,
17,
29,
17,
0,
13,
17,
29,
17,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
4,
13,
4,
18,
13,
4,
18,
13,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
10,
11
],
[
10,
12
],
[
9,
13
],
[
13,
14
],
[
14,
15
],
[
9,
16
],
[
16,
17
],
[
17,
18
],
[
18,
19
],
[
18,
20
],
[
17,
21
],
[
21,
22
],
[
22,
23
],
[
22,
24
],
[
21,
25
],
[
16,
26
],
[
26,
27
],
[
27,
28
],
[
16,
29
],
[
29,
30
],
[
30,
31
],
[
30,
32
],
[
29,
33
],
[
33,
34
],
[
34,
35
],
[
34,
36
],
[
36,
37
],
[
37,
38
],
[
36,
39
],
[
33,
40
],
[
40,
41
],
[
41,
42
],
[
42,
43
],
[
43,
44
],
[
43,
45
],
[
42,
46
],
[
41,
47
],
[
47,
48
],
[
40,
49
],
[
49,
50
],
[
49,
51
],
[
29,
52
],
[
52,
53
],
[
6,
54
],
[
54,
55
],
[
4,
56
],
[
56,
57
],
[
56,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
58,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
65,
66
],
[
64,
67
],
[
67,
68
],
[
68,
69
],
[
58,
70
],
[
70,
71
],
[
70,
72
],
[
58,
73
],
[
73,
74
],
[
74,
75
],
[
75,
76
],
[
75,
77
],
[
73,
78
],
[
78,
79
],
[
78,
80
],
[
73,
81
],
[
81,
82
],
[
82,
83
],
[
73,
84
],
[
85,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
87,
89
],
[
89,
90
],
[
90,
91
],
[
89,
92
],
[
92,
93
],
[
93,
94
],
[
86,
95
],
[
95,
96
],
[
58,
97
],
[
97,
98
],
[
98,
99
],
[
99,
100
],
[
99,
101
],
[
97,
102
],
[
56,
103
],
[
103,
104
]
] | [
"import java.util.Scanner;\n\nclass Main{\n\n static boolean isPrime(int n){\n if(n == 2){\n return true;\n }else if(n < 2 || n % 2 == 0){\n return false;\n }else{\n int x = 3;\n while(x <= Math.sqrt((double)n)){\n if(n%x == 0) return false;\n x += 2;\n }\n return true;\n }\n }\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n int n = Integer.parseInt(sc.next());\n int result = 0;\n\n for(int i = 0; i < n; i++){\n if(isPrime(Integer.parseInt(sc.next()))) result++;\n }\n\n System.out.println(result);\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"class Main{\n\n static boolean isPrime(int n){\n if(n == 2){\n return true;\n }else if(n < 2 || n % 2 == 0){\n return false;\n }else{\n int x = 3;\n while(x <= Math.sqrt((double)n)){\n if(n%x == 0) return false;\n x += 2;\n }\n return true;\n }\n }\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n int n = Integer.parseInt(sc.next());\n int result = 0;\n\n for(int i = 0; i < n; i++){\n if(isPrime(Integer.parseInt(sc.next()))) result++;\n }\n\n System.out.println(result);\n }\n}",
"Main",
"static boolean isPrime(int n){\n if(n == 2){\n return true;\n }else if(n < 2 || n % 2 == 0){\n return false;\n }else{\n int x = 3;\n while(x <= Math.sqrt((double)n)){\n if(n%x == 0) return false;\n x += 2;\n }\n return true;\n }\n }",
"isPrime",
"{\n if(n == 2){\n return true;\n }else if(n < 2 || n % 2 == 0){\n return false;\n }else{\n int x = 3;\n while(x <= Math.sqrt((double)n)){\n if(n%x == 0) return false;\n x += 2;\n }\n return true;\n }\n }",
"if(n == 2){\n return true;\n }else if(n < 2 || n % 2 == 0){\n return false;\n }else{\n int x = 3;\n while(x <= Math.sqrt((double)n)){\n if(n%x == 0) return false;\n x += 2;\n }\n return true;\n }",
"n == 2",
"n",
"2",
"{\n return true;\n }",
"return true;",
"true",
"if(n < 2 || n % 2 == 0){\n return false;\n }else{\n int x = 3;\n while(x <= Math.sqrt((double)n)){\n if(n%x == 0) return false;\n x += 2;\n }\n return true;\n }",
"n < 2 || n % 2 == 0",
"n < 2",
"n",
"2",
"n % 2 == 0",
"n % 2",
"n",
"2",
"0",
"{\n return false;\n }",
"return false;",
"false",
"{\n int x = 3;\n while(x <= Math.sqrt((double)n)){\n if(n%x == 0) return false;\n x += 2;\n }\n return true;\n }",
"int x = 3;",
"x",
"3",
"while(x <= Math.sqrt((double)n)){\n if(n%x == 0) return false;\n x += 2;\n }",
"x <= Math.sqrt((double)n)",
"x",
"Math.sqrt((double)n)",
"Math.sqrt",
"Math",
"(double)n",
"{\n if(n%x == 0) return false;\n x += 2;\n }",
"if(n%x == 0) return false;",
"n%x == 0",
"n%x",
"n",
"x",
"0",
"return false;",
"false",
"x += 2",
"x",
"2",
"return true;",
"true",
"int n",
"n",
"public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n int n = Integer.parseInt(sc.next());\n int result = 0;\n\n for(int i = 0; i < n; i++){\n if(isPrime(Integer.parseInt(sc.next()))) result++;\n }\n\n System.out.println(result);\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n\n int n = Integer.parseInt(sc.next());\n int result = 0;\n\n for(int i = 0; i < n; i++){\n if(isPrime(Integer.parseInt(sc.next()))) result++;\n }\n\n System.out.println(result);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n = Integer.parseInt(sc.next());",
"n",
"Integer.parseInt(sc.next())",
"Integer.parseInt",
"Integer",
"sc.next()",
"sc.next",
"sc",
"int result = 0;",
"result",
"0",
"for(int i = 0; i < n; i++){\n if(isPrime(Integer.parseInt(sc.next()))) result++;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n if(isPrime(Integer.parseInt(sc.next()))) result++;\n }",
"{\n if(isPrime(Integer.parseInt(sc.next()))) result++;\n }",
"if(isPrime(Integer.parseInt(sc.next()))) result++;",
"isPrime(Integer.parseInt(sc.next()))",
"isPrime",
"Integer.parseInt(sc.next())",
"Integer.parseInt",
"Integer",
"sc.next()",
"sc.next",
"sc",
"result++",
"result",
"System.out.println(result)",
"System.out.println",
"System.out",
"System",
"System.out",
"result",
"String[] args",
"args"
] | import java.util.Scanner;
class Main{
static boolean isPrime(int n){
if(n == 2){
return true;
}else if(n < 2 || n % 2 == 0){
return false;
}else{
int x = 3;
while(x <= Math.sqrt((double)n)){
if(n%x == 0) return false;
x += 2;
}
return true;
}
}
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
int result = 0;
for(int i = 0; i < n; i++){
if(isPrime(Integer.parseInt(sc.next()))) result++;
}
System.out.println(result);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
17,
38,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
4,
13,
18,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
40,
13,
30,
30,
0,
13,
2,
13,
2,
2,
13,
13,
17,
29,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
13,
14
],
[
14,
15
],
[
14,
16
],
[
13,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
19,
22
],
[
22,
23
],
[
23,
24
],
[
13,
25
],
[
25,
26
],
[
25,
27
],
[
13,
29
],
[
29,
30
],
[
30,
31
],
[
31,
32
],
[
31,
33
],
[
29,
34
],
[
34,
35
],
[
34,
36
],
[
29,
37
],
[
37,
38
],
[
38,
39
],
[
29,
40
],
[
40,
41
],
[
41,
42
],
[
42,
43
],
[
42,
44
],
[
41,
45
],
[
45,
46
],
[
46,
47
],
[
45,
48
],
[
48,
49
],
[
49,
50
],
[
13,
51
],
[
51,
52
],
[
51,
53
],
[
13,
54
],
[
54,
55
],
[
55,
56
],
[
56,
57
],
[
56,
58
],
[
54,
59
],
[
59,
60
],
[
59,
61
],
[
54,
62
],
[
62,
63
],
[
63,
64
],
[
54,
65
],
[
66,
66
],
[
66,
67
],
[
67,
68
],
[
68,
69
],
[
68,
70
],
[
70,
71
],
[
70,
72
],
[
67,
73
],
[
73,
74
],
[
74,
75
],
[
13,
76
],
[
76,
77
],
[
77,
78
],
[
78,
79
],
[
78,
80
],
[
76,
81
],
[
6,
82
],
[
82,
83
],
[
4,
84
],
[
84,
85
],
[
84,
86
],
[
86,
87
],
[
87,
88
],
[
87,
89
],
[
86,
90
],
[
90,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
90,
95
],
[
95,
96
],
[
96,
97
],
[
96,
98
],
[
95,
99
],
[
90,
100
],
[
100,
101
],
[
101,
102
],
[
90,
103
],
[
104,
104
],
[
104,
105
],
[
105,
106
],
[
105,
107
],
[
107,
108
],
[
107,
109
],
[
109,
110
],
[
110,
111
],
[
110,
112
],
[
109,
113
],
[
86,
114
],
[
114,
115
],
[
84,
116
],
[
116,
117
]
] | [
"import java.util.Scanner;\nclass Main {\n\tpublic static void main(String[] args){\n\t\tfinal int Number=100;\n\t\ttry(Scanner sc = new Scanner(System.in)){\n\t\t\tint N = Integer.parseInt(sc.next());\n\t\t\tint[] p=new int[N];\n\t\t\tfor(int i=0;i<N;i++) p[i] = Integer.parseInt(sc.next());\n\t\t\tint cnt=0;\n\t\t\tfor(int i=0;i<N;i++){\n\t\t\t\tif(isPrime(p[i])){\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(cnt);\n\t\t}\n\t}\n\tpublic static boolean isPrime(int p){\n\t\tboolean ans=true;\n\t\tfor(int i=2;i*i<=p;i++){\n\t\t\tans=ans&&(p%i!=0);\n\t\t}\n\t\treturn ans;\n\t}\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"class Main {\n\tpublic static void main(String[] args){\n\t\tfinal int Number=100;\n\t\ttry(Scanner sc = new Scanner(System.in)){\n\t\t\tint N = Integer.parseInt(sc.next());\n\t\t\tint[] p=new int[N];\n\t\t\tfor(int i=0;i<N;i++) p[i] = Integer.parseInt(sc.next());\n\t\t\tint cnt=0;\n\t\t\tfor(int i=0;i<N;i++){\n\t\t\t\tif(isPrime(p[i])){\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(cnt);\n\t\t}\n\t}\n\tpublic static boolean isPrime(int p){\n\t\tboolean ans=true;\n\t\tfor(int i=2;i*i<=p;i++){\n\t\t\tans=ans&&(p%i!=0);\n\t\t}\n\t\treturn ans;\n\t}\n}",
"Main",
"public static void main(String[] args){\n\t\tfinal int Number=100;\n\t\ttry(Scanner sc = new Scanner(System.in)){\n\t\t\tint N = Integer.parseInt(sc.next());\n\t\t\tint[] p=new int[N];\n\t\t\tfor(int i=0;i<N;i++) p[i] = Integer.parseInt(sc.next());\n\t\t\tint cnt=0;\n\t\t\tfor(int i=0;i<N;i++){\n\t\t\t\tif(isPrime(p[i])){\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(cnt);\n\t\t}\n\t}",
"main",
"{\n\t\tfinal int Number=100;\n\t\ttry(Scanner sc = new Scanner(System.in)){\n\t\t\tint N = Integer.parseInt(sc.next());\n\t\t\tint[] p=new int[N];\n\t\t\tfor(int i=0;i<N;i++) p[i] = Integer.parseInt(sc.next());\n\t\t\tint cnt=0;\n\t\t\tfor(int i=0;i<N;i++){\n\t\t\t\tif(isPrime(p[i])){\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(cnt);\n\t\t}\n\t}",
"final int Number=100;",
"Number",
"100",
"try(Scanner sc = new Scanner(System.in)){\n\t\t\tint N = Integer.parseInt(sc.next());\n\t\t\tint[] p=new int[N];\n\t\t\tfor(int i=0;i<N;i++) p[i] = Integer.parseInt(sc.next());\n\t\t\tint cnt=0;\n\t\t\tfor(int i=0;i<N;i++){\n\t\t\t\tif(isPrime(p[i])){\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(cnt);\n\t\t}",
"{\n\t\t\tint N = Integer.parseInt(sc.next());\n\t\t\tint[] p=new int[N];\n\t\t\tfor(int i=0;i<N;i++) p[i] = Integer.parseInt(sc.next());\n\t\t\tint cnt=0;\n\t\t\tfor(int i=0;i<N;i++){\n\t\t\t\tif(isPrime(p[i])){\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(cnt);\n\t\t}",
"Scanner sc = new Scanner(System.in)",
"Scanner sc = new Scanner(System.in)",
"new Scanner(System.in)",
"int N = Integer.parseInt(sc.next());",
"N",
"Integer.parseInt(sc.next())",
"Integer.parseInt",
"Integer",
"sc.next()",
"sc.next",
"sc",
"int[] p=new int[N];",
"p",
"new int[N]",
"N",
"for(int i=0;i<N;i++) p[i] = Integer.parseInt(sc.next());",
"int i=0;",
"int i=0;",
"i",
"0",
"i<N",
"i",
"N",
"i++",
"i++",
"i",
"p[i] = Integer.parseInt(sc.next());",
"p[i] = Integer.parseInt(sc.next())",
"p[i]",
"p",
"i",
"Integer.parseInt(sc.next())",
"Integer.parseInt",
"Integer",
"sc.next()",
"sc.next",
"sc",
"int cnt=0;",
"cnt",
"0",
"for(int i=0;i<N;i++){\n\t\t\t\tif(isPrime(p[i])){\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<N",
"i",
"N",
"i++",
"i++",
"i",
"{\n\t\t\t\tif(isPrime(p[i])){\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif(isPrime(p[i])){\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t}",
"if(isPrime(p[i])){\n\t\t\t\t\tcnt++;\n\t\t\t\t}",
"isPrime(p[i])",
"isPrime",
"p[i]",
"p",
"i",
"{\n\t\t\t\t\tcnt++;\n\t\t\t\t}",
"cnt++",
"cnt",
"System.out.println(cnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"String[] args",
"args",
"public static boolean isPrime(int p){\n\t\tboolean ans=true;\n\t\tfor(int i=2;i*i<=p;i++){\n\t\t\tans=ans&&(p%i!=0);\n\t\t}\n\t\treturn ans;\n\t}",
"isPrime",
"{\n\t\tboolean ans=true;\n\t\tfor(int i=2;i*i<=p;i++){\n\t\t\tans=ans&&(p%i!=0);\n\t\t}\n\t\treturn ans;\n\t}",
"boolean ans=true;",
"ans",
"true",
"for(int i=2;i*i<=p;i++){\n\t\t\tans=ans&&(p%i!=0);\n\t\t}",
"int i=2;",
"int i=2;",
"i",
"2",
"i*i<=p",
"i*i",
"i",
"i",
"p",
"i++",
"i++",
"i",
"{\n\t\t\tans=ans&&(p%i!=0);\n\t\t}",
"{\n\t\t\tans=ans&&(p%i!=0);\n\t\t}",
"ans=ans&&(p%i!=0)",
"ans",
"ans&&(p%i!=0)",
"ans",
"(p%i!=0)",
"p%i",
"p",
"i",
"0",
"return ans;",
"ans",
"int p",
"p"
] | import java.util.Scanner;
class Main {
public static void main(String[] args){
final int Number=100;
try(Scanner sc = new Scanner(System.in)){
int N = Integer.parseInt(sc.next());
int[] p=new int[N];
for(int i=0;i<N;i++) p[i] = Integer.parseInt(sc.next());
int cnt=0;
for(int i=0;i<N;i++){
if(isPrime(p[i])){
cnt++;
}
}
System.out.println(cnt);
}
}
public static boolean isPrime(int p){
boolean ans=true;
for(int i=2;i*i<=p;i++){
ans=ans&&(p%i!=0);
}
return ans;
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
41,
13,
12,
13,
30,
41,
13,
20,
4,
13,
17,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
14,
2,
2,
13,
17,
2,
2,
13,
17,
17,
30,
9,
14,
40,
18,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
0,
13,
20,
2,
13,
17,
0,
18,
13,
17,
0,
18,
13,
17,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
0,
13,
17,
30,
30,
14,
40,
18,
13,
13,
30,
11,
1,
41,
13,
2,
13,
13,
2,
13,
13,
1,
0,
13,
13,
30,
30,
0,
18,
13,
13,
17,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
16,
17
],
[
16,
18
],
[
0,
19
],
[
150,
20
],
[
150,
21
],
[
21,
22
],
[
150,
23
],
[
23,
24
],
[
150,
25
],
[
25,
26
],
[
25,
27
],
[
27,
28
],
[
28,
29
],
[
28,
30
],
[
27,
31
],
[
31,
32
],
[
31,
33
],
[
27,
34
],
[
34,
35
],
[
34,
36
],
[
36,
37
],
[
37,
38
],
[
27,
39
],
[
39,
40
],
[
39,
41
],
[
27,
42
],
[
42,
43
],
[
43,
44
],
[
44,
45
],
[
44,
46
],
[
42,
47
],
[
47,
48
],
[
47,
49
],
[
42,
50
],
[
50,
51
],
[
51,
52
],
[
42,
53
],
[
54,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
57,
58
],
[
58,
59
],
[
54,
60
],
[
60,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
61,
65
],
[
65,
66
],
[
66,
67
],
[
66,
68
],
[
65,
69
],
[
60,
70
],
[
70,
71
],
[
54,
72
],
[
72,
73
],
[
73,
74
],
[
74,
75
],
[
74,
76
],
[
72,
77
],
[
77,
78
],
[
78,
79
],
[
27,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
82,
84
],
[
80,
85
],
[
25,
86
],
[
86,
87
],
[
150,
88
],
[
88,
89
],
[
88,
90
],
[
90,
91
],
[
91,
92
],
[
91,
93
],
[
94,
95
],
[
94,
96
],
[
90,
97
],
[
97,
98
],
[
98,
99
],
[
98,
100
],
[
97,
101
],
[
101,
102
],
[
102,
103
],
[
102,
104
],
[
101,
105
],
[
90,
106
],
[
106,
107
],
[
107,
108
],
[
108,
109
],
[
108,
110
],
[
106,
111
],
[
111,
112
],
[
111,
113
],
[
106,
114
],
[
114,
115
],
[
115,
116
],
[
115,
117
],
[
106,
118
],
[
119,
119
],
[
119,
120
],
[
120,
121
],
[
121,
122
],
[
122,
123
],
[
122,
124
],
[
120,
125
],
[
125,
126
],
[
126,
127
],
[
127,
128
],
[
128,
129
],
[
128,
130
],
[
130,
131
],
[
130,
132
],
[
126,
133
],
[
133,
134
],
[
133,
135
],
[
126,
136
],
[
136,
137
],
[
137,
138
],
[
137,
139
],
[
126,
140
],
[
141,
141
],
[
141,
142
],
[
142,
143
],
[
143,
144
],
[
143,
145
],
[
142,
146
],
[
88,
147
],
[
147,
148
],
[
0,
149
],
[
149,
150
],
[
149,
151
]
] | [
"import java.io.*;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Scanner;\npublic class Main {\n\tstatic String a;\n\tstatic boolean[] isntPrime;\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tmakePrimeList(100000000);\n\t\tint n = stdIn.nextInt();\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tint x = stdIn.nextInt();\n\t\t\tif(x != 2 && x % 2 == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(!isntPrime[x]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\t\n\t\n\tpublic static void makePrimeList(int n) {\n\t\tisntPrime = new boolean[n+1];\n\t\tisntPrime[0] = isntPrime[1] = true;\n\t\tfor(int i = 3; i < n; i+=2) {\n\t\t\tif(!isntPrime[i]) {\n\t\t\t\tfor(int j = i + i; j < n; j += i){\n\t\t\t\t\tisntPrime[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}",
"import java.io.*;",
"io.*",
"java",
"import java.util.ArrayDeque;",
"ArrayDeque",
"java.util",
"import java.util.ArrayList;",
"ArrayList",
"java.util",
"import java.util.Arrays;",
"Arrays",
"java.util",
"import java.util.Comparator;",
"Comparator",
"java.util",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\tstatic String a;\n\tstatic boolean[] isntPrime;\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tmakePrimeList(100000000);\n\t\tint n = stdIn.nextInt();\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tint x = stdIn.nextInt();\n\t\t\tif(x != 2 && x % 2 == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(!isntPrime[x]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\t\n\t\n\tpublic static void makePrimeList(int n) {\n\t\tisntPrime = new boolean[n+1];\n\t\tisntPrime[0] = isntPrime[1] = true;\n\t\tfor(int i = 3; i < n; i+=2) {\n\t\t\tif(!isntPrime[i]) {\n\t\t\t\tfor(int j = i + i; j < n; j += i){\n\t\t\t\t\tisntPrime[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}",
"Main",
"static String a;",
"a",
"static boolean[] isntPrime;",
"isntPrime",
"public static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tmakePrimeList(100000000);\n\t\tint n = stdIn.nextInt();\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tint x = stdIn.nextInt();\n\t\t\tif(x != 2 && x % 2 == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(!isntPrime[x]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"main",
"{\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tmakePrimeList(100000000);\n\t\tint n = stdIn.nextInt();\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tint x = stdIn.nextInt();\n\t\t\tif(x != 2 && x % 2 == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(!isntPrime[x]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}",
"Scanner stdIn = new Scanner(System.in);",
"stdIn",
"new Scanner(System.in)",
"makePrimeList(100000000)",
"makePrimeList",
"100000000",
"int n = stdIn.nextInt();",
"n",
"stdIn.nextInt()",
"stdIn.nextInt",
"stdIn",
"int count = 0;",
"count",
"0",
"for(int i = 0; i < n; i++) {\n\t\t\tint x = stdIn.nextInt();\n\t\t\tif(x != 2 && x % 2 == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(!isntPrime[x]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tint x = stdIn.nextInt();\n\t\t\tif(x != 2 && x % 2 == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(!isntPrime[x]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"{\n\t\t\tint x = stdIn.nextInt();\n\t\t\tif(x != 2 && x % 2 == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(!isntPrime[x]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"int x = stdIn.nextInt();",
"x",
"stdIn.nextInt()",
"stdIn.nextInt",
"stdIn",
"if(x != 2 && x % 2 == 0) {\n\t\t\t\tcontinue;\n\t\t\t}",
"x != 2 && x % 2 == 0",
"x != 2",
"x",
"2",
"x % 2 == 0",
"x % 2",
"x",
"2",
"0",
"{\n\t\t\t\tcontinue;\n\t\t\t}",
"continue;",
"if(!isntPrime[x]) {\n\t\t\t\tcount++;\n\t\t\t}",
"!isntPrime[x]",
"isntPrime[x]",
"isntPrime",
"x",
"{\n\t\t\t\tcount++;\n\t\t\t}",
"count++",
"count",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"public static void makePrimeList(int n) {\n\t\tisntPrime = new boolean[n+1];\n\t\tisntPrime[0] = isntPrime[1] = true;\n\t\tfor(int i = 3; i < n; i+=2) {\n\t\t\tif(!isntPrime[i]) {\n\t\t\t\tfor(int j = i + i; j < n; j += i){\n\t\t\t\t\tisntPrime[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}",
"makePrimeList",
"{\n\t\tisntPrime = new boolean[n+1];\n\t\tisntPrime[0] = isntPrime[1] = true;\n\t\tfor(int i = 3; i < n; i+=2) {\n\t\t\tif(!isntPrime[i]) {\n\t\t\t\tfor(int j = i + i; j < n; j += i){\n\t\t\t\t\tisntPrime[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}",
"isntPrime = new boolean[n+1]",
"isntPrime",
"new boolean[n+1]",
"n+1",
"n",
"1",
"isntPrime[0] = isntPrime[1] = true",
"isntPrime[0]",
"isntPrime",
"0",
"isntPrime[1] = true",
"isntPrime[1]",
"isntPrime",
"1",
"true",
"for(int i = 3; i < n; i+=2) {\n\t\t\tif(!isntPrime[i]) {\n\t\t\t\tfor(int j = i + i; j < n; j += i){\n\t\t\t\t\tisntPrime[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"int i = 3;",
"int i = 3;",
"i",
"3",
"i < n",
"i",
"n",
"i+=2",
"i+=2",
"i",
"2",
"{\n\t\t\tif(!isntPrime[i]) {\n\t\t\t\tfor(int j = i + i; j < n; j += i){\n\t\t\t\t\tisntPrime[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"{\n\t\t\tif(!isntPrime[i]) {\n\t\t\t\tfor(int j = i + i; j < n; j += i){\n\t\t\t\t\tisntPrime[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}",
"if(!isntPrime[i]) {\n\t\t\t\tfor(int j = i + i; j < n; j += i){\n\t\t\t\t\tisntPrime[j] = true;\n\t\t\t\t}\n\t\t\t}",
"!isntPrime[i]",
"isntPrime[i]",
"isntPrime",
"i",
"{\n\t\t\t\tfor(int j = i + i; j < n; j += i){\n\t\t\t\t\tisntPrime[j] = true;\n\t\t\t\t}\n\t\t\t}",
"for(int j = i + i; j < n; j += i){\n\t\t\t\t\tisntPrime[j] = true;\n\t\t\t\t}",
"int j = i + i;",
"int j = i + i;",
"j",
"i + i",
"i",
"i",
"j < n",
"j",
"n",
"j += i",
"j += i",
"j",
"i",
"{\n\t\t\t\t\tisntPrime[j] = true;\n\t\t\t\t}",
"{\n\t\t\t\t\tisntPrime[j] = true;\n\t\t\t\t}",
"isntPrime[j] = true",
"isntPrime[j]",
"isntPrime",
"j",
"true",
"int n",
"n",
"public class Main {\n\tstatic String a;\n\tstatic boolean[] isntPrime;\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tmakePrimeList(100000000);\n\t\tint n = stdIn.nextInt();\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tint x = stdIn.nextInt();\n\t\t\tif(x != 2 && x % 2 == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(!isntPrime[x]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\t\n\t\n\tpublic static void makePrimeList(int n) {\n\t\tisntPrime = new boolean[n+1];\n\t\tisntPrime[0] = isntPrime[1] = true;\n\t\tfor(int i = 3; i < n; i+=2) {\n\t\t\tif(!isntPrime[i]) {\n\t\t\t\tfor(int j = i + i; j < n; j += i){\n\t\t\t\t\tisntPrime[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}",
"public class Main {\n\tstatic String a;\n\tstatic boolean[] isntPrime;\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tmakePrimeList(100000000);\n\t\tint n = stdIn.nextInt();\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tint x = stdIn.nextInt();\n\t\t\tif(x != 2 && x % 2 == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(!isntPrime[x]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\t\n\t\n\tpublic static void makePrimeList(int n) {\n\t\tisntPrime = new boolean[n+1];\n\t\tisntPrime[0] = isntPrime[1] = true;\n\t\tfor(int i = 3; i < n; i+=2) {\n\t\t\tif(!isntPrime[i]) {\n\t\t\t\tfor(int j = i + i; j < n; j += i){\n\t\t\t\t\tisntPrime[j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}",
"Main"
] | import java.io.*;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
public class Main {
static String a;
static boolean[] isntPrime;
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
makePrimeList(100000000);
int n = stdIn.nextInt();
int count = 0;
for(int i = 0; i < n; i++) {
int x = stdIn.nextInt();
if(x != 2 && x % 2 == 0) {
continue;
}
if(!isntPrime[x]) {
count++;
}
}
System.out.println(count);
}
public static void makePrimeList(int n) {
isntPrime = new boolean[n+1];
isntPrime[0] = isntPrime[1] = true;
for(int i = 3; i < n; i+=2) {
if(!isntPrime[i]) {
for(int j = i + i; j < n; j += i){
isntPrime[j] = true;
}
}
}
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
4,
18,
13,
17,
4,
18,
13,
17,
4,
18,
13,
17,
4,
18,
13,
17,
41,
13,
20,
17,
4,
18,
13,
13,
17,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
0,
13,
2,
4,
18,
13,
13,
17,
42,
2,
13,
17,
30,
0,
18,
13,
13,
17,
0,
13,
4,
18,
13,
13,
0,
18,
13,
17,
17,
11,
1,
41,
13,
17,
2,
13,
17,
1,
40,
13,
30,
30,
14,
18,
13,
13,
30,
4,
18,
13,
2,
13,
17,
41,
13,
20,
17,
4,
18,
13,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
0,
13,
2,
4,
18,
13,
13,
17,
42,
2,
13,
17,
30,
0,
18,
13,
13,
17,
0,
13,
4,
18,
13,
13,
0,
18,
13,
17,
17,
11,
1,
41,
13,
17,
2,
13,
17,
1,
40,
13,
30,
30,
14,
18,
13,
13,
30,
4,
18,
13,
2,
13,
17,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
41,
13,
13,
0,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
4,
18,
13,
4,
18,
13,
42,
2,
13,
2,
4,
18,
13,
13,
4,
18,
13,
13,
30,
14,
2,
2,
13,
4,
18,
13,
13,
17,
30,
40,
13,
3,
30,
40,
13,
14,
2,
13,
4,
18,
13,
30,
3,
0,
13,
17,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
281,
11
],
[
281,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
14,
18
],
[
18,
19
],
[
19,
20
],
[
18,
21
],
[
14,
22
],
[
22,
23
],
[
23,
24
],
[
22,
25
],
[
14,
26
],
[
26,
27
],
[
27,
28
],
[
26,
29
],
[
14,
30
],
[
30,
31
],
[
31,
32
],
[
30,
33
],
[
14,
34
],
[
34,
35
],
[
34,
36
],
[
14,
38
],
[
38,
39
],
[
39,
40
],
[
38,
41
],
[
38,
42
],
[
14,
43
],
[
43,
44
],
[
43,
45
],
[
14,
46
],
[
46,
47
],
[
47,
48
],
[
48,
49
],
[
48,
50
],
[
46,
51
],
[
51,
52
],
[
51,
53
],
[
53,
54
],
[
54,
55
],
[
46,
56
],
[
56,
57
],
[
57,
58
],
[
46,
59
],
[
60,
60
],
[
60,
61
],
[
61,
62
],
[
61,
63
],
[
63,
64
],
[
64,
65
],
[
65,
66
],
[
64,
67
],
[
63,
68
],
[
60,
69
],
[
69,
70
],
[
70,
71
],
[
70,
72
],
[
69,
73
],
[
73,
74
],
[
74,
75
],
[
75,
76
],
[
75,
77
],
[
74,
78
],
[
73,
79
],
[
79,
80
],
[
79,
81
],
[
81,
82
],
[
82,
83
],
[
81,
84
],
[
14,
85
],
[
85,
86
],
[
86,
87
],
[
86,
88
],
[
85,
89
],
[
14,
90
],
[
90,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
90,
95
],
[
95,
96
],
[
95,
97
],
[
90,
98
],
[
98,
99
],
[
99,
100
],
[
90,
101
],
[
102,
102
],
[
102,
103
],
[
103,
104
],
[
104,
105
],
[
104,
106
],
[
103,
107
],
[
107,
108
],
[
108,
109
],
[
109,
110
],
[
108,
111
],
[
111,
112
],
[
111,
113
],
[
14,
114
],
[
114,
115
],
[
114,
116
],
[
14,
118
],
[
118,
119
],
[
119,
120
],
[
118,
121
],
[
118,
122
],
[
14,
123
],
[
123,
124
],
[
124,
125
],
[
125,
126
],
[
125,
127
],
[
123,
128
],
[
128,
129
],
[
128,
130
],
[
130,
131
],
[
131,
132
],
[
123,
133
],
[
133,
134
],
[
134,
135
],
[
123,
136
],
[
137,
137
],
[
137,
138
],
[
138,
139
],
[
138,
140
],
[
140,
141
],
[
141,
142
],
[
142,
143
],
[
141,
144
],
[
140,
145
],
[
137,
146
],
[
146,
147
],
[
147,
148
],
[
147,
149
],
[
146,
150
],
[
150,
151
],
[
151,
152
],
[
152,
153
],
[
152,
154
],
[
151,
155
],
[
150,
156
],
[
156,
157
],
[
156,
158
],
[
158,
159
],
[
159,
160
],
[
158,
161
],
[
14,
162
],
[
162,
163
],
[
163,
164
],
[
163,
165
],
[
162,
166
],
[
14,
167
],
[
167,
168
],
[
168,
169
],
[
169,
170
],
[
169,
171
],
[
167,
172
],
[
172,
173
],
[
172,
174
],
[
167,
175
],
[
175,
176
],
[
176,
177
],
[
167,
178
],
[
179,
179
],
[
179,
180
],
[
180,
181
],
[
181,
182
],
[
181,
183
],
[
180,
184
],
[
184,
185
],
[
185,
186
],
[
186,
187
],
[
185,
188
],
[
188,
189
],
[
188,
190
],
[
14,
191
],
[
191,
192
],
[
191,
193
],
[
14,
194
],
[
194,
195
],
[
194,
196
],
[
196,
197
],
[
197,
198
],
[
196,
199
],
[
199,
200
],
[
200,
201
],
[
14,
202
],
[
202,
203
],
[
202,
204
],
[
14,
205
],
[
205,
206
],
[
205,
207
],
[
14,
208
],
[
208,
209
],
[
208,
210
],
[
14,
211
],
[
211,
212
],
[
212,
213
],
[
213,
214
],
[
213,
215
],
[
211,
216
],
[
216,
217
],
[
216,
218
],
[
211,
219
],
[
219,
220
],
[
220,
221
],
[
211,
222
],
[
223,
223
],
[
223,
224
],
[
224,
225
],
[
224,
226
],
[
226,
227
],
[
227,
228
],
[
226,
229
],
[
229,
230
],
[
230,
231
],
[
223,
232
],
[
232,
233
],
[
233,
234
],
[
233,
235
],
[
235,
236
],
[
236,
237
],
[
237,
238
],
[
236,
239
],
[
235,
240
],
[
240,
241
],
[
241,
242
],
[
240,
243
],
[
232,
244
],
[
244,
245
],
[
245,
246
],
[
246,
247
],
[
247,
248
],
[
247,
249
],
[
249,
250
],
[
250,
251
],
[
249,
252
],
[
246,
253
],
[
245,
254
],
[
254,
255
],
[
255,
256
],
[
254,
257
],
[
245,
258
],
[
258,
259
],
[
259,
260
],
[
258,
261
],
[
261,
262
],
[
262,
263
],
[
262,
264
],
[
264,
265
],
[
265,
266
],
[
261,
267
],
[
267,
268
],
[
223,
269
],
[
269,
270
],
[
269,
271
],
[
14,
272
],
[
272,
273
],
[
273,
274
],
[
274,
275
],
[
274,
276
],
[
272,
277
],
[
12,
278
],
[
278,
279
],
[
0,
280
],
[
280,
281
],
[
280,
282
]
] | [
"import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tArrayList<Integer> prime = new ArrayList<Integer>();\n\t\tprime.add(2);\n\t\tprime.add(3);\n\t\tprime.add(5);\n\t\tprime.add(7);\n\n\t\tboolean sieve2[] = new boolean[100];\n\t\tArrays.fill(sieve2, true);\n\t\tint j = 0;\n\t\tfor(int i=0; i<prime.size(); i++){\n\t\t\tj = prime.get(i)-1;\n\t\t\twhile(j<100){\n\t\t\t\tsieve2[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}\n\t\t}\n\t\tsieve2[0] = false;\n\n\t\tfor(int i=0; i<100; i++){\n\t\t\tif(sieve2[i]){prime.add(i+1);}\n\t\t}\n\n\t\tboolean sieve3[] = new boolean[10000];\n\t\tArrays.fill(sieve3, true);\n\t\tfor(int i=0; i<prime.size(); i++){\n\t\t\tj = prime.get(i)-1;\n\t\t\twhile(j<10000){\n\t\t\t\tsieve3[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}\n\t\t}\n\t\tsieve3[0] = false;\n\t\tfor(int i=0; i<10000; i++){\n\t\t\tif(sieve3[i]){prime.add(i+1);}\n\t\t}\n\n\n\t\tScanner std = new Scanner(System.in);\n\t\tint n = Integer.parseInt(std.next());\n\t\tint search = 0;\n\t\tint answer = n;\n\t\tj = 0;\n\t\tfor(int i=0; i<n; i++){\n\t\t\tsearch = Integer.parseInt(std.next());\n\n\t\t\twhile(search >= prime.get(j)*prime.get(j)){\n\t\t\t\tif(search%prime.get(j) == 0){\n\t\t\t\t\tanswer--;\n\t\t\t\t\tbreak;\n\t\t\t\t}else{\n\t\t\t\t\tj++;\n\t\t\t\t\tif(j>=prime.size()){break;}\n\t\t\t\t}\n\t\t\t}\n\t\t\tj = 0;\n\t\t}\n\t\tSystem.out.println(answer);\n\t}\n}",
"import java.util.ArrayList;",
"ArrayList",
"java.util",
"import java.util.Arrays;",
"Arrays",
"java.util",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\tpublic static void main(String[] args){\n\t\tArrayList<Integer> prime = new ArrayList<Integer>();\n\t\tprime.add(2);\n\t\tprime.add(3);\n\t\tprime.add(5);\n\t\tprime.add(7);\n\n\t\tboolean sieve2[] = new boolean[100];\n\t\tArrays.fill(sieve2, true);\n\t\tint j = 0;\n\t\tfor(int i=0; i<prime.size(); i++){\n\t\t\tj = prime.get(i)-1;\n\t\t\twhile(j<100){\n\t\t\t\tsieve2[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}\n\t\t}\n\t\tsieve2[0] = false;\n\n\t\tfor(int i=0; i<100; i++){\n\t\t\tif(sieve2[i]){prime.add(i+1);}\n\t\t}\n\n\t\tboolean sieve3[] = new boolean[10000];\n\t\tArrays.fill(sieve3, true);\n\t\tfor(int i=0; i<prime.size(); i++){\n\t\t\tj = prime.get(i)-1;\n\t\t\twhile(j<10000){\n\t\t\t\tsieve3[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}\n\t\t}\n\t\tsieve3[0] = false;\n\t\tfor(int i=0; i<10000; i++){\n\t\t\tif(sieve3[i]){prime.add(i+1);}\n\t\t}\n\n\n\t\tScanner std = new Scanner(System.in);\n\t\tint n = Integer.parseInt(std.next());\n\t\tint search = 0;\n\t\tint answer = n;\n\t\tj = 0;\n\t\tfor(int i=0; i<n; i++){\n\t\t\tsearch = Integer.parseInt(std.next());\n\n\t\t\twhile(search >= prime.get(j)*prime.get(j)){\n\t\t\t\tif(search%prime.get(j) == 0){\n\t\t\t\t\tanswer--;\n\t\t\t\t\tbreak;\n\t\t\t\t}else{\n\t\t\t\t\tj++;\n\t\t\t\t\tif(j>=prime.size()){break;}\n\t\t\t\t}\n\t\t\t}\n\t\t\tj = 0;\n\t\t}\n\t\tSystem.out.println(answer);\n\t}\n}",
"Main",
"public static void main(String[] args){\n\t\tArrayList<Integer> prime = new ArrayList<Integer>();\n\t\tprime.add(2);\n\t\tprime.add(3);\n\t\tprime.add(5);\n\t\tprime.add(7);\n\n\t\tboolean sieve2[] = new boolean[100];\n\t\tArrays.fill(sieve2, true);\n\t\tint j = 0;\n\t\tfor(int i=0; i<prime.size(); i++){\n\t\t\tj = prime.get(i)-1;\n\t\t\twhile(j<100){\n\t\t\t\tsieve2[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}\n\t\t}\n\t\tsieve2[0] = false;\n\n\t\tfor(int i=0; i<100; i++){\n\t\t\tif(sieve2[i]){prime.add(i+1);}\n\t\t}\n\n\t\tboolean sieve3[] = new boolean[10000];\n\t\tArrays.fill(sieve3, true);\n\t\tfor(int i=0; i<prime.size(); i++){\n\t\t\tj = prime.get(i)-1;\n\t\t\twhile(j<10000){\n\t\t\t\tsieve3[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}\n\t\t}\n\t\tsieve3[0] = false;\n\t\tfor(int i=0; i<10000; i++){\n\t\t\tif(sieve3[i]){prime.add(i+1);}\n\t\t}\n\n\n\t\tScanner std = new Scanner(System.in);\n\t\tint n = Integer.parseInt(std.next());\n\t\tint search = 0;\n\t\tint answer = n;\n\t\tj = 0;\n\t\tfor(int i=0; i<n; i++){\n\t\t\tsearch = Integer.parseInt(std.next());\n\n\t\t\twhile(search >= prime.get(j)*prime.get(j)){\n\t\t\t\tif(search%prime.get(j) == 0){\n\t\t\t\t\tanswer--;\n\t\t\t\t\tbreak;\n\t\t\t\t}else{\n\t\t\t\t\tj++;\n\t\t\t\t\tif(j>=prime.size()){break;}\n\t\t\t\t}\n\t\t\t}\n\t\t\tj = 0;\n\t\t}\n\t\tSystem.out.println(answer);\n\t}",
"main",
"{\n\t\tArrayList<Integer> prime = new ArrayList<Integer>();\n\t\tprime.add(2);\n\t\tprime.add(3);\n\t\tprime.add(5);\n\t\tprime.add(7);\n\n\t\tboolean sieve2[] = new boolean[100];\n\t\tArrays.fill(sieve2, true);\n\t\tint j = 0;\n\t\tfor(int i=0; i<prime.size(); i++){\n\t\t\tj = prime.get(i)-1;\n\t\t\twhile(j<100){\n\t\t\t\tsieve2[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}\n\t\t}\n\t\tsieve2[0] = false;\n\n\t\tfor(int i=0; i<100; i++){\n\t\t\tif(sieve2[i]){prime.add(i+1);}\n\t\t}\n\n\t\tboolean sieve3[] = new boolean[10000];\n\t\tArrays.fill(sieve3, true);\n\t\tfor(int i=0; i<prime.size(); i++){\n\t\t\tj = prime.get(i)-1;\n\t\t\twhile(j<10000){\n\t\t\t\tsieve3[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}\n\t\t}\n\t\tsieve3[0] = false;\n\t\tfor(int i=0; i<10000; i++){\n\t\t\tif(sieve3[i]){prime.add(i+1);}\n\t\t}\n\n\n\t\tScanner std = new Scanner(System.in);\n\t\tint n = Integer.parseInt(std.next());\n\t\tint search = 0;\n\t\tint answer = n;\n\t\tj = 0;\n\t\tfor(int i=0; i<n; i++){\n\t\t\tsearch = Integer.parseInt(std.next());\n\n\t\t\twhile(search >= prime.get(j)*prime.get(j)){\n\t\t\t\tif(search%prime.get(j) == 0){\n\t\t\t\t\tanswer--;\n\t\t\t\t\tbreak;\n\t\t\t\t}else{\n\t\t\t\t\tj++;\n\t\t\t\t\tif(j>=prime.size()){break;}\n\t\t\t\t}\n\t\t\t}\n\t\t\tj = 0;\n\t\t}\n\t\tSystem.out.println(answer);\n\t}",
"ArrayList<Integer> prime = new ArrayList<Integer>();",
"prime",
"new ArrayList<Integer>()",
"prime.add(2)",
"prime.add",
"prime",
"2",
"prime.add(3)",
"prime.add",
"prime",
"3",
"prime.add(5)",
"prime.add",
"prime",
"5",
"prime.add(7)",
"prime.add",
"prime",
"7",
"boolean sieve2[] = new boolean[100];",
"sieve2",
"new boolean[100]",
"100",
"Arrays.fill(sieve2, true)",
"Arrays.fill",
"Arrays",
"sieve2",
"true",
"int j = 0;",
"j",
"0",
"for(int i=0; i<prime.size(); i++){\n\t\t\tj = prime.get(i)-1;\n\t\t\twhile(j<100){\n\t\t\t\tsieve2[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<prime.size()",
"i",
"prime.size()",
"prime.size",
"prime",
"i++",
"i++",
"i",
"{\n\t\t\tj = prime.get(i)-1;\n\t\t\twhile(j<100){\n\t\t\t\tsieve2[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}\n\t\t}",
"{\n\t\t\tj = prime.get(i)-1;\n\t\t\twhile(j<100){\n\t\t\t\tsieve2[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}\n\t\t}",
"j = prime.get(i)-1",
"j",
"prime.get(i)-1",
"prime.get(i)",
"prime.get",
"prime",
"i",
"1",
"while(j<100){\n\t\t\t\tsieve2[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}",
"j<100",
"j",
"100",
"{\n\t\t\t\tsieve2[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}",
"sieve2[j] = false",
"sieve2[j]",
"sieve2",
"j",
"false",
"j += prime.get(i)",
"j",
"prime.get(i)",
"prime.get",
"prime",
"i",
"sieve2[0] = false",
"sieve2[0]",
"sieve2",
"0",
"false",
"for(int i=0; i<100; i++){\n\t\t\tif(sieve2[i]){prime.add(i+1);}\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<100",
"i",
"100",
"i++",
"i++",
"i",
"{\n\t\t\tif(sieve2[i]){prime.add(i+1);}\n\t\t}",
"{\n\t\t\tif(sieve2[i]){prime.add(i+1);}\n\t\t}",
"if(sieve2[i]){prime.add(i+1);}",
"sieve2[i]",
"sieve2",
"i",
"{prime.add(i+1);}",
"prime.add(i+1)",
"prime.add",
"prime",
"i+1",
"i",
"1",
"boolean sieve3[] = new boolean[10000];",
"sieve3",
"new boolean[10000]",
"10000",
"Arrays.fill(sieve3, true)",
"Arrays.fill",
"Arrays",
"sieve3",
"true",
"for(int i=0; i<prime.size(); i++){\n\t\t\tj = prime.get(i)-1;\n\t\t\twhile(j<10000){\n\t\t\t\tsieve3[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<prime.size()",
"i",
"prime.size()",
"prime.size",
"prime",
"i++",
"i++",
"i",
"{\n\t\t\tj = prime.get(i)-1;\n\t\t\twhile(j<10000){\n\t\t\t\tsieve3[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}\n\t\t}",
"{\n\t\t\tj = prime.get(i)-1;\n\t\t\twhile(j<10000){\n\t\t\t\tsieve3[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}\n\t\t}",
"j = prime.get(i)-1",
"j",
"prime.get(i)-1",
"prime.get(i)",
"prime.get",
"prime",
"i",
"1",
"while(j<10000){\n\t\t\t\tsieve3[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}",
"j<10000",
"j",
"10000",
"{\n\t\t\t\tsieve3[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}",
"sieve3[j] = false",
"sieve3[j]",
"sieve3",
"j",
"false",
"j += prime.get(i)",
"j",
"prime.get(i)",
"prime.get",
"prime",
"i",
"sieve3[0] = false",
"sieve3[0]",
"sieve3",
"0",
"false",
"for(int i=0; i<10000; i++){\n\t\t\tif(sieve3[i]){prime.add(i+1);}\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<10000",
"i",
"10000",
"i++",
"i++",
"i",
"{\n\t\t\tif(sieve3[i]){prime.add(i+1);}\n\t\t}",
"{\n\t\t\tif(sieve3[i]){prime.add(i+1);}\n\t\t}",
"if(sieve3[i]){prime.add(i+1);}",
"sieve3[i]",
"sieve3",
"i",
"{prime.add(i+1);}",
"prime.add(i+1)",
"prime.add",
"prime",
"i+1",
"i",
"1",
"Scanner std = new Scanner(System.in);",
"std",
"new Scanner(System.in)",
"int n = Integer.parseInt(std.next());",
"n",
"Integer.parseInt(std.next())",
"Integer.parseInt",
"Integer",
"std.next()",
"std.next",
"std",
"int search = 0;",
"search",
"0",
"int answer = n;",
"answer",
"n",
"j = 0",
"j",
"0",
"for(int i=0; i<n; i++){\n\t\t\tsearch = Integer.parseInt(std.next());\n\n\t\t\twhile(search >= prime.get(j)*prime.get(j)){\n\t\t\t\tif(search%prime.get(j) == 0){\n\t\t\t\t\tanswer--;\n\t\t\t\t\tbreak;\n\t\t\t\t}else{\n\t\t\t\t\tj++;\n\t\t\t\t\tif(j>=prime.size()){break;}\n\t\t\t\t}\n\t\t\t}\n\t\t\tj = 0;\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tsearch = Integer.parseInt(std.next());\n\n\t\t\twhile(search >= prime.get(j)*prime.get(j)){\n\t\t\t\tif(search%prime.get(j) == 0){\n\t\t\t\t\tanswer--;\n\t\t\t\t\tbreak;\n\t\t\t\t}else{\n\t\t\t\t\tj++;\n\t\t\t\t\tif(j>=prime.size()){break;}\n\t\t\t\t}\n\t\t\t}\n\t\t\tj = 0;\n\t\t}",
"{\n\t\t\tsearch = Integer.parseInt(std.next());\n\n\t\t\twhile(search >= prime.get(j)*prime.get(j)){\n\t\t\t\tif(search%prime.get(j) == 0){\n\t\t\t\t\tanswer--;\n\t\t\t\t\tbreak;\n\t\t\t\t}else{\n\t\t\t\t\tj++;\n\t\t\t\t\tif(j>=prime.size()){break;}\n\t\t\t\t}\n\t\t\t}\n\t\t\tj = 0;\n\t\t}",
"search = Integer.parseInt(std.next())",
"search",
"Integer.parseInt(std.next())",
"Integer.parseInt",
"Integer",
"std.next()",
"std.next",
"std",
"while(search >= prime.get(j)*prime.get(j)){\n\t\t\t\tif(search%prime.get(j) == 0){\n\t\t\t\t\tanswer--;\n\t\t\t\t\tbreak;\n\t\t\t\t}else{\n\t\t\t\t\tj++;\n\t\t\t\t\tif(j>=prime.size()){break;}\n\t\t\t\t}\n\t\t\t}",
"search >= prime.get(j)*prime.get(j)",
"search",
"prime.get(j)*prime.get(j)",
"prime.get(j)",
"prime.get",
"prime",
"j",
"prime.get(j)",
"prime.get",
"prime",
"j",
"{\n\t\t\t\tif(search%prime.get(j) == 0){\n\t\t\t\t\tanswer--;\n\t\t\t\t\tbreak;\n\t\t\t\t}else{\n\t\t\t\t\tj++;\n\t\t\t\t\tif(j>=prime.size()){break;}\n\t\t\t\t}\n\t\t\t}",
"if(search%prime.get(j) == 0){\n\t\t\t\t\tanswer--;\n\t\t\t\t\tbreak;\n\t\t\t\t}else{\n\t\t\t\t\tj++;\n\t\t\t\t\tif(j>=prime.size()){break;}\n\t\t\t\t}",
"search%prime.get(j) == 0",
"search%prime.get(j)",
"search",
"prime.get(j)",
"prime.get",
"prime",
"j",
"0",
"{\n\t\t\t\t\tanswer--;\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"answer--",
"answer",
"break;",
"{\n\t\t\t\t\tj++;\n\t\t\t\t\tif(j>=prime.size()){break;}\n\t\t\t\t}",
"j++",
"j",
"if(j>=prime.size()){break;}",
"j>=prime.size()",
"j",
"prime.size()",
"prime.size",
"prime",
"{break;}",
"break;",
"j = 0",
"j",
"0",
"System.out.println(answer)",
"System.out.println",
"System.out",
"System",
"System.out",
"answer",
"String[] args",
"args",
"public class Main {\n\tpublic static void main(String[] args){\n\t\tArrayList<Integer> prime = new ArrayList<Integer>();\n\t\tprime.add(2);\n\t\tprime.add(3);\n\t\tprime.add(5);\n\t\tprime.add(7);\n\n\t\tboolean sieve2[] = new boolean[100];\n\t\tArrays.fill(sieve2, true);\n\t\tint j = 0;\n\t\tfor(int i=0; i<prime.size(); i++){\n\t\t\tj = prime.get(i)-1;\n\t\t\twhile(j<100){\n\t\t\t\tsieve2[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}\n\t\t}\n\t\tsieve2[0] = false;\n\n\t\tfor(int i=0; i<100; i++){\n\t\t\tif(sieve2[i]){prime.add(i+1);}\n\t\t}\n\n\t\tboolean sieve3[] = new boolean[10000];\n\t\tArrays.fill(sieve3, true);\n\t\tfor(int i=0; i<prime.size(); i++){\n\t\t\tj = prime.get(i)-1;\n\t\t\twhile(j<10000){\n\t\t\t\tsieve3[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}\n\t\t}\n\t\tsieve3[0] = false;\n\t\tfor(int i=0; i<10000; i++){\n\t\t\tif(sieve3[i]){prime.add(i+1);}\n\t\t}\n\n\n\t\tScanner std = new Scanner(System.in);\n\t\tint n = Integer.parseInt(std.next());\n\t\tint search = 0;\n\t\tint answer = n;\n\t\tj = 0;\n\t\tfor(int i=0; i<n; i++){\n\t\t\tsearch = Integer.parseInt(std.next());\n\n\t\t\twhile(search >= prime.get(j)*prime.get(j)){\n\t\t\t\tif(search%prime.get(j) == 0){\n\t\t\t\t\tanswer--;\n\t\t\t\t\tbreak;\n\t\t\t\t}else{\n\t\t\t\t\tj++;\n\t\t\t\t\tif(j>=prime.size()){break;}\n\t\t\t\t}\n\t\t\t}\n\t\t\tj = 0;\n\t\t}\n\t\tSystem.out.println(answer);\n\t}\n}",
"public class Main {\n\tpublic static void main(String[] args){\n\t\tArrayList<Integer> prime = new ArrayList<Integer>();\n\t\tprime.add(2);\n\t\tprime.add(3);\n\t\tprime.add(5);\n\t\tprime.add(7);\n\n\t\tboolean sieve2[] = new boolean[100];\n\t\tArrays.fill(sieve2, true);\n\t\tint j = 0;\n\t\tfor(int i=0; i<prime.size(); i++){\n\t\t\tj = prime.get(i)-1;\n\t\t\twhile(j<100){\n\t\t\t\tsieve2[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}\n\t\t}\n\t\tsieve2[0] = false;\n\n\t\tfor(int i=0; i<100; i++){\n\t\t\tif(sieve2[i]){prime.add(i+1);}\n\t\t}\n\n\t\tboolean sieve3[] = new boolean[10000];\n\t\tArrays.fill(sieve3, true);\n\t\tfor(int i=0; i<prime.size(); i++){\n\t\t\tj = prime.get(i)-1;\n\t\t\twhile(j<10000){\n\t\t\t\tsieve3[j] = false;\n\t\t\t\tj += prime.get(i);\n\t\t\t}\n\t\t}\n\t\tsieve3[0] = false;\n\t\tfor(int i=0; i<10000; i++){\n\t\t\tif(sieve3[i]){prime.add(i+1);}\n\t\t}\n\n\n\t\tScanner std = new Scanner(System.in);\n\t\tint n = Integer.parseInt(std.next());\n\t\tint search = 0;\n\t\tint answer = n;\n\t\tj = 0;\n\t\tfor(int i=0; i<n; i++){\n\t\t\tsearch = Integer.parseInt(std.next());\n\n\t\t\twhile(search >= prime.get(j)*prime.get(j)){\n\t\t\t\tif(search%prime.get(j) == 0){\n\t\t\t\t\tanswer--;\n\t\t\t\t\tbreak;\n\t\t\t\t}else{\n\t\t\t\t\tj++;\n\t\t\t\t\tif(j>=prime.size()){break;}\n\t\t\t\t}\n\t\t\t}\n\t\t\tj = 0;\n\t\t}\n\t\tSystem.out.println(answer);\n\t}\n}",
"Main"
] | import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args){
ArrayList<Integer> prime = new ArrayList<Integer>();
prime.add(2);
prime.add(3);
prime.add(5);
prime.add(7);
boolean sieve2[] = new boolean[100];
Arrays.fill(sieve2, true);
int j = 0;
for(int i=0; i<prime.size(); i++){
j = prime.get(i)-1;
while(j<100){
sieve2[j] = false;
j += prime.get(i);
}
}
sieve2[0] = false;
for(int i=0; i<100; i++){
if(sieve2[i]){prime.add(i+1);}
}
boolean sieve3[] = new boolean[10000];
Arrays.fill(sieve3, true);
for(int i=0; i<prime.size(); i++){
j = prime.get(i)-1;
while(j<10000){
sieve3[j] = false;
j += prime.get(i);
}
}
sieve3[0] = false;
for(int i=0; i<10000; i++){
if(sieve3[i]){prime.add(i+1);}
}
Scanner std = new Scanner(System.in);
int n = Integer.parseInt(std.next());
int search = 0;
int answer = n;
j = 0;
for(int i=0; i<n; i++){
search = Integer.parseInt(std.next());
while(search >= prime.get(j)*prime.get(j)){
if(search%prime.get(j) == 0){
answer--;
break;
}else{
j++;
if(j>=prime.size()){break;}
}
}
j = 0;
}
System.out.println(answer);
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
2,
17,
17,
41,
13,
2,
4,
18,
13,
17,
17,
17,
12,
13,
30,
41,
13,
18,
13,
13,
41,
13,
18,
13,
13,
41,
13,
20,
41,
13,
20,
41,
13,
20,
4,
18,
13,
17,
13,
13,
4,
18,
13,
23,
13,
6,
13,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
20,
13,
0,
13,
20,
13,
4,
18,
13,
13,
17,
0,
18,
13,
17,
0,
18,
13,
17,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
40,
18,
13,
13,
9,
11,
1,
41,
13,
2,
13,
13,
2,
13,
18,
13,
13,
1,
0,
13,
13,
30,
30,
0,
18,
13,
13,
17,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
18,
13,
4,
18,
13,
30,
40,
13,
4,
18,
13,
13,
23,
13,
23,
13,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
42,
40,
4,
18,
13,
30,
38,
5,
13,
30,
37,
20,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
0,
13,
20,
0,
13,
20,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
16,
17
],
[
16,
18
],
[
0,
19
],
[
19,
20
],
[
19,
21
],
[
0,
22
],
[
22,
23
],
[
22,
24
],
[
0,
25
],
[
25,
26
],
[
25,
27
],
[
0,
28
],
[
319,
29
],
[
319,
30
],
[
30,
31
],
[
30,
32
],
[
32,
33
],
[
32,
34
],
[
319,
35
],
[
35,
36
],
[
35,
37
],
[
37,
38
],
[
38,
39
],
[
39,
40
],
[
38,
41
],
[
38,
42
],
[
37,
43
],
[
319,
44
],
[
44,
45
],
[
44,
46
],
[
46,
47
],
[
47,
48
],
[
47,
49
],
[
49,
50
],
[
49,
51
],
[
46,
52
],
[
52,
53
],
[
52,
54
],
[
54,
55
],
[
54,
56
],
[
46,
57
],
[
57,
58
],
[
57,
59
],
[
46,
60
],
[
60,
61
],
[
60,
62
],
[
46,
63
],
[
63,
64
],
[
63,
65
],
[
46,
66
],
[
66,
67
],
[
67,
68
],
[
66,
69
],
[
66,
70
],
[
66,
71
],
[
46,
72
],
[
72,
73
],
[
73,
74
],
[
44,
75
],
[
75,
76
],
[
319,
77
],
[
77,
78
],
[
77,
79
],
[
79,
80
],
[
79,
81
],
[
81,
82
],
[
82,
83
],
[
82,
84
],
[
84,
85
],
[
85,
86
],
[
81,
87
],
[
87,
88
],
[
87,
89
],
[
81,
91
],
[
91,
92
],
[
91,
93
],
[
81,
95
],
[
95,
96
],
[
96,
97
],
[
95,
98
],
[
95,
99
],
[
81,
100
],
[
100,
101
],
[
101,
102
],
[
101,
103
],
[
100,
104
],
[
104,
105
],
[
105,
106
],
[
105,
107
],
[
104,
108
],
[
81,
109
],
[
109,
110
],
[
110,
111
],
[
111,
112
],
[
111,
113
],
[
109,
114
],
[
114,
115
],
[
114,
116
],
[
116,
117
],
[
117,
118
],
[
116,
119
],
[
119,
120
],
[
119,
121
],
[
109,
122
],
[
122,
123
],
[
123,
124
],
[
109,
125
],
[
126,
126
],
[
126,
127
],
[
127,
128
],
[
128,
129
],
[
129,
130
],
[
129,
131
],
[
127,
132
],
[
126,
133
],
[
133,
134
],
[
134,
135
],
[
135,
136
],
[
135,
137
],
[
137,
138
],
[
137,
139
],
[
133,
140
],
[
140,
141
],
[
140,
142
],
[
142,
143
],
[
142,
144
],
[
133,
145
],
[
145,
146
],
[
146,
147
],
[
146,
148
],
[
133,
149
],
[
150,
150
],
[
150,
151
],
[
151,
152
],
[
152,
153
],
[
152,
154
],
[
151,
155
],
[
81,
156
],
[
156,
157
],
[
156,
158
],
[
81,
159
],
[
159,
160
],
[
160,
161
],
[
161,
162
],
[
161,
163
],
[
159,
164
],
[
164,
165
],
[
164,
166
],
[
159,
167
],
[
167,
168
],
[
168,
169
],
[
159,
170
],
[
171,
171
],
[
171,
172
],
[
172,
173
],
[
173,
174
],
[
173,
175
],
[
175,
176
],
[
176,
177
],
[
172,
178
],
[
178,
179
],
[
179,
180
],
[
81,
181
],
[
181,
182
],
[
182,
183
],
[
181,
184
],
[
79,
185
],
[
185,
186
],
[
79,
187
],
[
187,
188
],
[
79,
189
],
[
189,
190
],
[
319,
191
],
[
191,
192
],
[
191,
193
],
[
193,
194
],
[
191,
195
],
[
195,
196
],
[
191,
197
],
[
197,
198
],
[
197,
199
],
[
199,
200
],
[
200,
201
],
[
201,
202
],
[
202,
203
],
[
203,
204
],
[
200,
205
],
[
205,
206
],
[
206,
207
],
[
207,
208
],
[
207,
209
],
[
209,
210
],
[
210,
211
],
[
206,
212
],
[
212,
213
],
[
213,
214
],
[
213,
215
],
[
199,
216
],
[
216,
217
],
[
217,
218
],
[
218,
219
],
[
191,
220
],
[
220,
221
],
[
220,
222
],
[
222,
223
],
[
223,
224
],
[
224,
225
],
[
225,
226
],
[
224,
227
],
[
227,
228
],
[
191,
229
],
[
229,
230
],
[
229,
231
],
[
231,
232
],
[
232,
233
],
[
233,
234
],
[
234,
235
],
[
233,
236
],
[
236,
237
],
[
191,
238
],
[
238,
239
],
[
238,
240
],
[
240,
241
],
[
241,
242
],
[
242,
243
],
[
243,
244
],
[
242,
245
],
[
245,
246
],
[
191,
247
],
[
247,
248
],
[
247,
249
],
[
249,
250
],
[
250,
251
],
[
250,
252
],
[
249,
254
],
[
254,
255
],
[
255,
256
],
[
256,
257
],
[
256,
258
],
[
254,
259
],
[
259,
260
],
[
259,
261
],
[
254,
262
],
[
262,
263
],
[
263,
264
],
[
254,
265
],
[
266,
266
],
[
266,
267
],
[
267,
268
],
[
268,
269
],
[
268,
270
],
[
267,
271
],
[
271,
272
],
[
249,
273
],
[
273,
274
],
[
247,
275
],
[
275,
276
],
[
191,
277
],
[
277,
278
],
[
277,
279
],
[
279,
280
],
[
280,
281
],
[
280,
282
],
[
279,
284
],
[
284,
285
],
[
285,
286
],
[
286,
287
],
[
286,
288
],
[
284,
289
],
[
289,
290
],
[
289,
291
],
[
284,
292
],
[
292,
293
],
[
293,
294
],
[
284,
295
],
[
296,
296
],
[
296,
297
],
[
297,
298
],
[
298,
299
],
[
298,
300
],
[
297,
301
],
[
301,
302
],
[
279,
303
],
[
303,
304
],
[
277,
305
],
[
305,
306
],
[
191,
307
],
[
307,
308
],
[
307,
309
],
[
309,
310
],
[
310,
311
],
[
310,
312
],
[
309,
313
],
[
313,
314
],
[
313,
315
],
[
307,
316
],
[
316,
317
],
[
0,
318
],
[
318,
319
],
[
318,
320
]
] | [
"\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskX solver = new TaskX();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic int INF = 1 << 30;\n\tstatic int MAX = (int)Math.pow(10, 8)+1;\n\n\tstatic class TaskX {\n\t\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\n\t\t\tint n = in.nextInt();\n\t\t\tboolean[] isPrime = new boolean[MAX];\n\t\t\tisPrime = new boolean[MAX];\n\t\t\tArrays.fill(isPrime, true);\n\t\t\tisPrime[0] = isPrime[1] = false;\n\t\t\tfor (int i = 2; i <= Math.sqrt(isPrime.length); i++) {\n\t\t\t\tif (!isPrime[i])\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int j = i + i; j < isPrime.length; j += i) {\n\t\t\t\t\tisPrime[j] = false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint count = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (isPrime[in.nextInt()]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tout.println(count);\n\n\t\t}\n\t}\n\n\tstatic class InputReader {\n\t\tBufferedReader in;\n\t\tStringTokenizer tok;\n\n\t\tpublic String nextString() {\n\t\t\twhile (!tok.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tok.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(nextString());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(nextString());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(nextString());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic InputReader(InputStream inputStream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(inputStream));\n\t\t\ttok = new StringTokenizer(\"\");\n\t\t}\n\n\t}\n\n}\n",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStream;",
"InputStream",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.io.OutputStream;",
"OutputStream",
"java.io",
"import java.io.PrintWriter;",
"PrintWriter",
"java.io",
"import java.util.Arrays;",
"Arrays",
"java.util",
"import java.util.InputMismatchException;",
"InputMismatchException",
"java.util",
"import java.util.StringTokenizer;",
"StringTokenizer",
"java.util",
"public class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskX solver = new TaskX();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic int INF = 1 << 30;\n\tstatic int MAX = (int)Math.pow(10, 8)+1;\n\n\tstatic class TaskX {\n\t\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\n\t\t\tint n = in.nextInt();\n\t\t\tboolean[] isPrime = new boolean[MAX];\n\t\t\tisPrime = new boolean[MAX];\n\t\t\tArrays.fill(isPrime, true);\n\t\t\tisPrime[0] = isPrime[1] = false;\n\t\t\tfor (int i = 2; i <= Math.sqrt(isPrime.length); i++) {\n\t\t\t\tif (!isPrime[i])\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int j = i + i; j < isPrime.length; j += i) {\n\t\t\t\t\tisPrime[j] = false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint count = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (isPrime[in.nextInt()]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tout.println(count);\n\n\t\t}\n\t}\n\n\tstatic class InputReader {\n\t\tBufferedReader in;\n\t\tStringTokenizer tok;\n\n\t\tpublic String nextString() {\n\t\t\twhile (!tok.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tok.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(nextString());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(nextString());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(nextString());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic InputReader(InputStream inputStream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(inputStream));\n\t\t\ttok = new StringTokenizer(\"\");\n\t\t}\n\n\t}\n\n}",
"Main",
"static int INF = 1 << 30;",
"INF",
"1 << 30",
"1",
"30",
"static int MAX = (int)Math.pow(10, 8)+1;",
"MAX",
"(int)Math.pow(10, 8)+1",
"(int)Math.pow(10, 8)",
"Math.pow",
"Math",
"10",
"8",
"1",
"public static void main(String[] args) throws IOException {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskX solver = new TaskX();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}",
"main",
"{\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskX solver = new TaskX();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}",
"InputStream inputStream = System.in;",
"inputStream",
"System.in",
"System",
"System.in",
"OutputStream outputStream = System.out;",
"outputStream",
"System.out",
"System",
"System.out",
"InputReader in = new InputReader(inputStream);",
"in",
"new InputReader(inputStream)",
"PrintWriter out = new PrintWriter(outputStream);",
"out",
"new PrintWriter(outputStream)",
"TaskX solver = new TaskX();",
"solver",
"new TaskX()",
"solver.solve(1, in, out)",
"solver.solve",
"solver",
"1",
"in",
"out",
"out.close()",
"out.close",
"out",
"String[] args",
"args",
"static class TaskX {\n\t\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\n\t\t\tint n = in.nextInt();\n\t\t\tboolean[] isPrime = new boolean[MAX];\n\t\t\tisPrime = new boolean[MAX];\n\t\t\tArrays.fill(isPrime, true);\n\t\t\tisPrime[0] = isPrime[1] = false;\n\t\t\tfor (int i = 2; i <= Math.sqrt(isPrime.length); i++) {\n\t\t\t\tif (!isPrime[i])\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int j = i + i; j < isPrime.length; j += i) {\n\t\t\t\t\tisPrime[j] = false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint count = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (isPrime[in.nextInt()]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tout.println(count);\n\n\t\t}\n\t}",
"TaskX",
"public void solve(int testNumber, InputReader in, PrintWriter out) {\n\n\t\t\tint n = in.nextInt();\n\t\t\tboolean[] isPrime = new boolean[MAX];\n\t\t\tisPrime = new boolean[MAX];\n\t\t\tArrays.fill(isPrime, true);\n\t\t\tisPrime[0] = isPrime[1] = false;\n\t\t\tfor (int i = 2; i <= Math.sqrt(isPrime.length); i++) {\n\t\t\t\tif (!isPrime[i])\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int j = i + i; j < isPrime.length; j += i) {\n\t\t\t\t\tisPrime[j] = false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint count = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (isPrime[in.nextInt()]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tout.println(count);\n\n\t\t}",
"solve",
"{\n\n\t\t\tint n = in.nextInt();\n\t\t\tboolean[] isPrime = new boolean[MAX];\n\t\t\tisPrime = new boolean[MAX];\n\t\t\tArrays.fill(isPrime, true);\n\t\t\tisPrime[0] = isPrime[1] = false;\n\t\t\tfor (int i = 2; i <= Math.sqrt(isPrime.length); i++) {\n\t\t\t\tif (!isPrime[i])\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int j = i + i; j < isPrime.length; j += i) {\n\t\t\t\t\tisPrime[j] = false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint count = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (isPrime[in.nextInt()]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tout.println(count);\n\n\t\t}",
"int n = in.nextInt();",
"n",
"in.nextInt()",
"in.nextInt",
"in",
"boolean[] isPrime = new boolean[MAX];",
"isPrime",
"new boolean[MAX]",
"MAX",
"isPrime = new boolean[MAX]",
"isPrime",
"new boolean[MAX]",
"MAX",
"Arrays.fill(isPrime, true)",
"Arrays.fill",
"Arrays",
"isPrime",
"true",
"isPrime[0] = isPrime[1] = false",
"isPrime[0]",
"isPrime",
"0",
"isPrime[1] = false",
"isPrime[1]",
"isPrime",
"1",
"false",
"for (int i = 2; i <= Math.sqrt(isPrime.length); i++) {\n\t\t\t\tif (!isPrime[i])\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int j = i + i; j < isPrime.length; j += i) {\n\t\t\t\t\tisPrime[j] = false;\n\t\t\t\t}\n\t\t\t}",
"int i = 2;",
"int i = 2;",
"i",
"2",
"i <= Math.sqrt(isPrime.length)",
"i",
"Math.sqrt(isPrime.length)",
"Math.sqrt",
"Math",
"isPrime.length",
"isPrime",
"isPrime.length",
"i++",
"i++",
"i",
"{\n\t\t\t\tif (!isPrime[i])\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int j = i + i; j < isPrime.length; j += i) {\n\t\t\t\t\tisPrime[j] = false;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif (!isPrime[i])\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int j = i + i; j < isPrime.length; j += i) {\n\t\t\t\t\tisPrime[j] = false;\n\t\t\t\t}\n\t\t\t}",
"if (!isPrime[i])\n\t\t\t\t\tcontinue;",
"!isPrime[i]",
"isPrime[i]",
"isPrime",
"i",
"continue;",
"for (int j = i + i; j < isPrime.length; j += i) {\n\t\t\t\t\tisPrime[j] = false;\n\t\t\t\t}",
"int j = i + i;",
"int j = i + i;",
"j",
"i + i",
"i",
"i",
"j < isPrime.length",
"j",
"isPrime.length",
"isPrime",
"isPrime.length",
"j += i",
"j += i",
"j",
"i",
"{\n\t\t\t\t\tisPrime[j] = false;\n\t\t\t\t}",
"{\n\t\t\t\t\tisPrime[j] = false;\n\t\t\t\t}",
"isPrime[j] = false",
"isPrime[j]",
"isPrime",
"j",
"false",
"int count = 0;",
"count",
"0",
"for (int i = 0; i < n; i++) {\n\t\t\t\tif (isPrime[in.nextInt()]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\t\tif (isPrime[in.nextInt()]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif (isPrime[in.nextInt()]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}",
"if (isPrime[in.nextInt()]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}",
"isPrime[in.nextInt()]",
"isPrime",
"in.nextInt()",
"in.nextInt",
"in",
"{\n\t\t\t\t\tcount++;\n\t\t\t\t}",
"count++",
"count",
"out.println(count)",
"out.println",
"out",
"count",
"int testNumber",
"testNumber",
"InputReader in",
"in",
"PrintWriter out",
"out",
"static class InputReader {\n\t\tBufferedReader in;\n\t\tStringTokenizer tok;\n\n\t\tpublic String nextString() {\n\t\t\twhile (!tok.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tok.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(nextString());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(nextString());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(nextString());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic InputReader(InputStream inputStream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(inputStream));\n\t\t\ttok = new StringTokenizer(\"\");\n\t\t}\n\n\t}",
"InputReader",
"BufferedReader in;",
"in",
"StringTokenizer tok;",
"tok",
"public String nextString() {\n\t\t\twhile (!tok.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tok.nextToken();\n\t\t}",
"nextString",
"{\n\t\t\twhile (!tok.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tok.nextToken();\n\t\t}",
"while (!tok.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}",
"!tok.hasMoreTokens()",
"tok.hasMoreTokens()",
"tok.hasMoreTokens",
"tok",
"{\n\t\t\t\ttry {\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}",
"try {\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}",
"catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}",
"IOException e",
"{\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}",
"throw new InputMismatchException();",
"new InputMismatchException()",
"{\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t}",
"tok = new StringTokenizer(in.readLine(), \" \")",
"tok",
"new StringTokenizer(in.readLine(), \" \")",
"return tok.nextToken();",
"tok.nextToken()",
"tok.nextToken",
"tok",
"public int nextInt() {\n\t\t\treturn Integer.parseInt(nextString());\n\t\t}",
"nextInt",
"{\n\t\t\treturn Integer.parseInt(nextString());\n\t\t}",
"return Integer.parseInt(nextString());",
"Integer.parseInt(nextString())",
"Integer.parseInt",
"Integer",
"nextString()",
"nextString",
"public long nextLong() {\n\t\t\treturn Long.parseLong(nextString());\n\t\t}",
"nextLong",
"{\n\t\t\treturn Long.parseLong(nextString());\n\t\t}",
"return Long.parseLong(nextString());",
"Long.parseLong(nextString())",
"Long.parseLong",
"Long",
"nextString()",
"nextString",
"public double nextDouble() {\n\t\t\treturn Double.parseDouble(nextString());\n\t\t}",
"nextDouble",
"{\n\t\t\treturn Double.parseDouble(nextString());\n\t\t}",
"return Double.parseDouble(nextString());",
"Double.parseDouble(nextString())",
"Double.parseDouble",
"Double",
"nextString()",
"nextString",
"public int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}",
"nextIntArray",
"{\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}",
"int[] res = new int[n];",
"res",
"new int[n]",
"n",
"for (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\t\tres[i] = nextInt();\n\t\t\t}",
"{\n\t\t\t\tres[i] = nextInt();\n\t\t\t}",
"res[i] = nextInt()",
"res[i]",
"res",
"i",
"nextInt()",
"nextInt",
"return res;",
"res",
"int n",
"n",
"public long[] nextLongArray(int n) {\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}",
"nextLongArray",
"{\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}",
"long[] res = new long[n];",
"res",
"new long[n]",
"n",
"for (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\t\tres[i] = nextLong();\n\t\t\t}",
"{\n\t\t\t\tres[i] = nextLong();\n\t\t\t}",
"res[i] = nextLong()",
"res[i]",
"res",
"i",
"nextLong()",
"nextLong",
"return res;",
"res",
"int n",
"n",
"public InputReader(InputStream inputStream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(inputStream));\n\t\t\ttok = new StringTokenizer(\"\");\n\t\t}",
"InputReader",
"{\n\t\t\tin = new BufferedReader(new InputStreamReader(inputStream));\n\t\t\ttok = new StringTokenizer(\"\");\n\t\t}",
"in = new BufferedReader(new InputStreamReader(inputStream))",
"in",
"new BufferedReader(new InputStreamReader(inputStream))",
"tok = new StringTokenizer(\"\")",
"tok",
"new StringTokenizer(\"\")",
"InputStream inputStream",
"inputStream",
"public class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskX solver = new TaskX();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic int INF = 1 << 30;\n\tstatic int MAX = (int)Math.pow(10, 8)+1;\n\n\tstatic class TaskX {\n\t\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\n\t\t\tint n = in.nextInt();\n\t\t\tboolean[] isPrime = new boolean[MAX];\n\t\t\tisPrime = new boolean[MAX];\n\t\t\tArrays.fill(isPrime, true);\n\t\t\tisPrime[0] = isPrime[1] = false;\n\t\t\tfor (int i = 2; i <= Math.sqrt(isPrime.length); i++) {\n\t\t\t\tif (!isPrime[i])\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int j = i + i; j < isPrime.length; j += i) {\n\t\t\t\t\tisPrime[j] = false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint count = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (isPrime[in.nextInt()]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tout.println(count);\n\n\t\t}\n\t}\n\n\tstatic class InputReader {\n\t\tBufferedReader in;\n\t\tStringTokenizer tok;\n\n\t\tpublic String nextString() {\n\t\t\twhile (!tok.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tok.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(nextString());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(nextString());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(nextString());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic InputReader(InputStream inputStream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(inputStream));\n\t\t\ttok = new StringTokenizer(\"\");\n\t\t}\n\n\t}\n\n}",
"public class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskX solver = new TaskX();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic int INF = 1 << 30;\n\tstatic int MAX = (int)Math.pow(10, 8)+1;\n\n\tstatic class TaskX {\n\t\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\n\t\t\tint n = in.nextInt();\n\t\t\tboolean[] isPrime = new boolean[MAX];\n\t\t\tisPrime = new boolean[MAX];\n\t\t\tArrays.fill(isPrime, true);\n\t\t\tisPrime[0] = isPrime[1] = false;\n\t\t\tfor (int i = 2; i <= Math.sqrt(isPrime.length); i++) {\n\t\t\t\tif (!isPrime[i])\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int j = i + i; j < isPrime.length; j += i) {\n\t\t\t\t\tisPrime[j] = false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint count = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (isPrime[in.nextInt()]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tout.println(count);\n\n\t\t}\n\t}\n\n\tstatic class InputReader {\n\t\tBufferedReader in;\n\t\tStringTokenizer tok;\n\n\t\tpublic String nextString() {\n\t\t\twhile (!tok.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tok.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(nextString());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(nextString());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(nextString());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic InputReader(InputStream inputStream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(inputStream));\n\t\t\ttok = new StringTokenizer(\"\");\n\t\t}\n\n\t}\n\n}",
"Main"
] |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
PrintWriter out = new PrintWriter(outputStream);
TaskX solver = new TaskX();
solver.solve(1, in, out);
out.close();
}
static int INF = 1 << 30;
static int MAX = (int)Math.pow(10, 8)+1;
static class TaskX {
public void solve(int testNumber, InputReader in, PrintWriter out) {
int n = in.nextInt();
boolean[] isPrime = new boolean[MAX];
isPrime = new boolean[MAX];
Arrays.fill(isPrime, true);
isPrime[0] = isPrime[1] = false;
for (int i = 2; i <= Math.sqrt(isPrime.length); i++) {
if (!isPrime[i])
continue;
for (int j = i + i; j < isPrime.length; j += i) {
isPrime[j] = false;
}
}
int count = 0;
for (int i = 0; i < n; i++) {
if (isPrime[in.nextInt()]) {
count++;
}
}
out.println(count);
}
}
static class InputReader {
BufferedReader in;
StringTokenizer tok;
public String nextString() {
while (!tok.hasMoreTokens()) {
try {
tok = new StringTokenizer(in.readLine(), " ");
} catch (IOException e) {
throw new InputMismatchException();
}
}
return tok.nextToken();
}
public int nextInt() {
return Integer.parseInt(nextString());
}
public long nextLong() {
return Long.parseLong(nextString());
}
public double nextDouble() {
return Double.parseDouble(nextString());
}
public int[] nextIntArray(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt();
}
return res;
}
public long[] nextLongArray(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong();
}
return res;
}
public InputReader(InputStream inputStream) {
in = new BufferedReader(new InputStreamReader(inputStream));
tok = new StringTokenizer("");
}
}
}
|
[
7,
15,
13,
17,
6,
13,
41,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
31,
5
],
[
31,
6
],
[
6,
7
],
[
31,
8
],
[
8,
9
],
[
8,
10
],
[
10,
11
],
[
11,
12
],
[
11,
13
],
[
10,
14
],
[
14,
15
],
[
14,
16
],
[
16,
17
],
[
17,
18
],
[
10,
19
],
[
19,
20
],
[
19,
21
],
[
10,
22
],
[
22,
23
],
[
23,
24
],
[
24,
25
],
[
24,
26
],
[
22,
27
],
[
8,
28
],
[
28,
29
],
[
0,
30
],
[
30,
31
],
[
30,
32
]
] | [
"import java.util.Scanner;\n\npublic class Main {\n\t static String a;\n\t public static void main(String[] args) {\n\t Scanner stdIn = new Scanner(System.in);\n\t int n = stdIn.nextInt();\n\t int count = 0;\n\t IN:for(int i = 0; i < n; i++) {\n\t int x = stdIn.nextInt();\n\t for(int j = 2; j*j <= x; j++) {\n\t if(x % j == 0) continue IN;\n\t }\n\t count++;\n\t }\n\t System.out.println(count);\n\t }\n\t}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\t static String a;\n\t public static void main(String[] args) {\n\t Scanner stdIn = new Scanner(System.in);\n\t int n = stdIn.nextInt();\n\t int count = 0;\n\t IN:for(int i = 0; i < n; i++) {\n\t int x = stdIn.nextInt();\n\t for(int j = 2; j*j <= x; j++) {\n\t if(x % j == 0) continue IN;\n\t }\n\t count++;\n\t }\n\t System.out.println(count);\n\t }\n\t}",
"Main",
"static String a;",
"a",
"public static void main(String[] args) {\n\t Scanner stdIn = new Scanner(System.in);\n\t int n = stdIn.nextInt();\n\t int count = 0;\n\t IN:for(int i = 0; i < n; i++) {\n\t int x = stdIn.nextInt();\n\t for(int j = 2; j*j <= x; j++) {\n\t if(x % j == 0) continue IN;\n\t }\n\t count++;\n\t }\n\t System.out.println(count);\n\t }",
"main",
"{\n\t Scanner stdIn = new Scanner(System.in);\n\t int n = stdIn.nextInt();\n\t int count = 0;\n\t IN:for(int i = 0; i < n; i++) {\n\t int x = stdIn.nextInt();\n\t for(int j = 2; j*j <= x; j++) {\n\t if(x % j == 0) continue IN;\n\t }\n\t count++;\n\t }\n\t System.out.println(count);\n\t }",
"Scanner stdIn = new Scanner(System.in);",
"stdIn",
"new Scanner(System.in)",
"int n = stdIn.nextInt();",
"n",
"stdIn.nextInt()",
"stdIn.nextInt",
"stdIn",
"int count = 0;",
"count",
"0",
"System.out.println(count)",
"System.out.println",
"System.out",
"System",
"System.out",
"count",
"String[] args",
"args",
"public class Main {\n\t static String a;\n\t public static void main(String[] args) {\n\t Scanner stdIn = new Scanner(System.in);\n\t int n = stdIn.nextInt();\n\t int count = 0;\n\t IN:for(int i = 0; i < n; i++) {\n\t int x = stdIn.nextInt();\n\t for(int j = 2; j*j <= x; j++) {\n\t if(x % j == 0) continue IN;\n\t }\n\t count++;\n\t }\n\t System.out.println(count);\n\t }\n\t}",
"public class Main {\n\t static String a;\n\t public static void main(String[] args) {\n\t Scanner stdIn = new Scanner(System.in);\n\t int n = stdIn.nextInt();\n\t int count = 0;\n\t IN:for(int i = 0; i < n; i++) {\n\t int x = stdIn.nextInt();\n\t for(int j = 2; j*j <= x; j++) {\n\t if(x % j == 0) continue IN;\n\t }\n\t count++;\n\t }\n\t System.out.println(count);\n\t }\n\t}",
"Main"
] | import java.util.Scanner;
public class Main {
static String a;
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
int n = stdIn.nextInt();
int count = 0;
IN:for(int i = 0; i < n; i++) {
int x = stdIn.nextInt();
for(int j = 2; j*j <= x; j++) {
if(x % j == 0) continue IN;
}
count++;
}
System.out.println(count);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
41,
13,
17,
14,
2,
13,
17,
30,
40,
13,
30,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
13,
17,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
30,
0,
13,
17,
3,
14,
2,
13,
17,
30,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
8,
20
],
[
20,
21
],
[
21,
22
],
[
22,
23
],
[
22,
24
],
[
20,
25
],
[
25,
26
],
[
25,
27
],
[
20,
28
],
[
28,
29
],
[
29,
30
],
[
20,
31
],
[
32,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
35,
36
],
[
36,
37
],
[
32,
38
],
[
38,
39
],
[
38,
40
],
[
32,
41
],
[
41,
42
],
[
42,
43
],
[
42,
44
],
[
41,
45
],
[
45,
46
],
[
46,
47
],
[
41,
48
],
[
48,
49
],
[
49,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
49,
54
],
[
54,
55
],
[
54,
56
],
[
56,
57
],
[
57,
58
],
[
58,
59
],
[
57,
60
],
[
56,
61
],
[
49,
62
],
[
62,
63
],
[
63,
64
],
[
49,
65
],
[
66,
66
],
[
66,
67
],
[
67,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
68,
72
],
[
67,
73
],
[
73,
74
],
[
74,
75
],
[
74,
76
],
[
73,
77
],
[
48,
78
],
[
78,
79
],
[
79,
80
],
[
79,
81
],
[
78,
82
],
[
82,
83
],
[
83,
84
],
[
8,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
87,
89
],
[
85,
90
],
[
6,
91
],
[
91,
92
]
] | [
"import java.util.Scanner;\n\nclass Main{\n public static void main(String[] args){\n\n Scanner stdIn = new Scanner(System.in);\n /*\n10^6から時間がかかりすぎる\n\n int[] a = new int[100000];//javaは0で初期化されてる\n\n a[0] = 1;\n a[1] = 1;//0と1は素数じゃないです\n\n //素数表\n for(int i = 2; i < a.length; i++){\n if(a[i] == 0){\n for(int j = i+1; j < a.length; j++){\n if(j % i == 0){\n a[j] = 1;\n }\n }\n }\n }\n System.out.println(\"素数表完成\");\n int n = stdIn.nextInt();\n int cnt = 0;//素数の数\n for(int i = 0; i < n; i++){\n int x = stdIn.nextInt();\n if(a[x] == 0){\n cnt++;\n }\n }\n System.out.println(cnt);\n */\n\n int n = stdIn.nextInt();\n int cnt = 0;//素数の数\n for(int i = 0; i < n; i++){\n int x = stdIn.nextInt();\n boolean check = true;\n if(x == 2){\n cnt++;\n }\n else{\n for(int j = 2; j < Math.sqrt(x)+1; j++){\n if(x % j == 0){\n check = false;\n break;\n }\n }\n if(check == true){\n cnt++;\n }\n }\n }\n System.out.println(cnt);\n }\n }\n",
"import java.util.Scanner;",
"Scanner",
"java.util",
"class Main{\n public static void main(String[] args){\n\n Scanner stdIn = new Scanner(System.in);\n /*\n10^6から時間がかかりすぎる\n\n int[] a = new int[100000];//javaは0で初期化されてる\n\n a[0] = 1;\n a[1] = 1;//0と1は素数じゃないです\n\n //素数表\n for(int i = 2; i < a.length; i++){\n if(a[i] == 0){\n for(int j = i+1; j < a.length; j++){\n if(j % i == 0){\n a[j] = 1;\n }\n }\n }\n }\n System.out.println(\"素数表完成\");\n int n = stdIn.nextInt();\n int cnt = 0;//素数の数\n for(int i = 0; i < n; i++){\n int x = stdIn.nextInt();\n if(a[x] == 0){\n cnt++;\n }\n }\n System.out.println(cnt);\n */\n\n int n = stdIn.nextInt();\n int cnt = 0;//素数の数\n for(int i = 0; i < n; i++){\n int x = stdIn.nextInt();\n boolean check = true;\n if(x == 2){\n cnt++;\n }\n else{\n for(int j = 2; j < Math.sqrt(x)+1; j++){\n if(x % j == 0){\n check = false;\n break;\n }\n }\n if(check == true){\n cnt++;\n }\n }\n }\n System.out.println(cnt);\n }\n }",
"Main",
"public static void main(String[] args){\n\n Scanner stdIn = new Scanner(System.in);\n /*\n10^6から時間がかかりすぎる\n\n int[] a = new int[100000];//javaは0で初期化されてる\n\n a[0] = 1;\n a[1] = 1;//0と1は素数じゃないです\n\n //素数表\n for(int i = 2; i < a.length; i++){\n if(a[i] == 0){\n for(int j = i+1; j < a.length; j++){\n if(j % i == 0){\n a[j] = 1;\n }\n }\n }\n }\n System.out.println(\"素数表完成\");\n int n = stdIn.nextInt();\n int cnt = 0;//素数の数\n for(int i = 0; i < n; i++){\n int x = stdIn.nextInt();\n if(a[x] == 0){\n cnt++;\n }\n }\n System.out.println(cnt);\n */\n\n int n = stdIn.nextInt();\n int cnt = 0;//素数の数\n for(int i = 0; i < n; i++){\n int x = stdIn.nextInt();\n boolean check = true;\n if(x == 2){\n cnt++;\n }\n else{\n for(int j = 2; j < Math.sqrt(x)+1; j++){\n if(x % j == 0){\n check = false;\n break;\n }\n }\n if(check == true){\n cnt++;\n }\n }\n }\n System.out.println(cnt);\n }",
"main",
"{\n\n Scanner stdIn = new Scanner(System.in);\n /*\n10^6から時間がかかりすぎる\n\n int[] a = new int[100000];//javaは0で初期化されてる\n\n a[0] = 1;\n a[1] = 1;//0と1は素数じゃないです\n\n //素数表\n for(int i = 2; i < a.length; i++){\n if(a[i] == 0){\n for(int j = i+1; j < a.length; j++){\n if(j % i == 0){\n a[j] = 1;\n }\n }\n }\n }\n System.out.println(\"素数表完成\");\n int n = stdIn.nextInt();\n int cnt = 0;//素数の数\n for(int i = 0; i < n; i++){\n int x = stdIn.nextInt();\n if(a[x] == 0){\n cnt++;\n }\n }\n System.out.println(cnt);\n */\n\n int n = stdIn.nextInt();\n int cnt = 0;//素数の数\n for(int i = 0; i < n; i++){\n int x = stdIn.nextInt();\n boolean check = true;\n if(x == 2){\n cnt++;\n }\n else{\n for(int j = 2; j < Math.sqrt(x)+1; j++){\n if(x % j == 0){\n check = false;\n break;\n }\n }\n if(check == true){\n cnt++;\n }\n }\n }\n System.out.println(cnt);\n }",
"Scanner stdIn = new Scanner(System.in);",
"stdIn",
"new Scanner(System.in)",
"int n = stdIn.nextInt();",
"n",
"stdIn.nextInt()",
"stdIn.nextInt",
"stdIn",
"int cnt = 0;",
"cnt",
"0",
"for(int i = 0; i < n; i++){\n int x = stdIn.nextInt();\n boolean check = true;\n if(x == 2){\n cnt++;\n }\n else{\n for(int j = 2; j < Math.sqrt(x)+1; j++){\n if(x % j == 0){\n check = false;\n break;\n }\n }\n if(check == true){\n cnt++;\n }\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n int x = stdIn.nextInt();\n boolean check = true;\n if(x == 2){\n cnt++;\n }\n else{\n for(int j = 2; j < Math.sqrt(x)+1; j++){\n if(x % j == 0){\n check = false;\n break;\n }\n }\n if(check == true){\n cnt++;\n }\n }\n }",
"{\n int x = stdIn.nextInt();\n boolean check = true;\n if(x == 2){\n cnt++;\n }\n else{\n for(int j = 2; j < Math.sqrt(x)+1; j++){\n if(x % j == 0){\n check = false;\n break;\n }\n }\n if(check == true){\n cnt++;\n }\n }\n }",
"int x = stdIn.nextInt();",
"x",
"stdIn.nextInt()",
"stdIn.nextInt",
"stdIn",
"boolean check = true;",
"check",
"true",
"if(x == 2){\n cnt++;\n }\n else{\n for(int j = 2; j < Math.sqrt(x)+1; j++){\n if(x % j == 0){\n check = false;\n break;\n }\n }\n if(check == true){\n cnt++;\n }\n }",
"x == 2",
"x",
"2",
"{\n cnt++;\n }",
"cnt++",
"cnt",
"{\n for(int j = 2; j < Math.sqrt(x)+1; j++){\n if(x % j == 0){\n check = false;\n break;\n }\n }\n if(check == true){\n cnt++;\n }\n }",
"for(int j = 2; j < Math.sqrt(x)+1; j++){\n if(x % j == 0){\n check = false;\n break;\n }\n }",
"int j = 2;",
"int j = 2;",
"j",
"2",
"j < Math.sqrt(x)+1",
"j",
"Math.sqrt(x)+1",
"Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"1",
"j++",
"j++",
"j",
"{\n if(x % j == 0){\n check = false;\n break;\n }\n }",
"{\n if(x % j == 0){\n check = false;\n break;\n }\n }",
"if(x % j == 0){\n check = false;\n break;\n }",
"x % j == 0",
"x % j",
"x",
"j",
"0",
"{\n check = false;\n break;\n }",
"check = false",
"check",
"false",
"break;",
"if(check == true){\n cnt++;\n }",
"check == true",
"check",
"true",
"{\n cnt++;\n }",
"cnt++",
"cnt",
"System.out.println(cnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt",
"String[] args",
"args"
] | import java.util.Scanner;
class Main{
public static void main(String[] args){
Scanner stdIn = new Scanner(System.in);
/*
10^6から時間がかかりすぎる
int[] a = new int[100000];//javaは0で初期化されてる
a[0] = 1;
a[1] = 1;//0と1は素数じゃないです
//素数表
for(int i = 2; i < a.length; i++){
if(a[i] == 0){
for(int j = i+1; j < a.length; j++){
if(j % i == 0){
a[j] = 1;
}
}
}
}
System.out.println("素数表完成");
int n = stdIn.nextInt();
int cnt = 0;//素数の数
for(int i = 0; i < n; i++){
int x = stdIn.nextInt();
if(a[x] == 0){
cnt++;
}
}
System.out.println(cnt);
*/
int n = stdIn.nextInt();
int cnt = 0;//素数の数
for(int i = 0; i < n; i++){
int x = stdIn.nextInt();
boolean check = true;
if(x == 2){
cnt++;
}
else{
for(int j = 2; j < Math.sqrt(x)+1; j++){
if(x % j == 0){
check = false;
break;
}
}
if(check == true){
cnt++;
}
}
}
System.out.println(cnt);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
4,
18,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
41,
13,
4,
18,
13,
13,
41,
13,
11,
1,
0,
13,
13,
2,
13,
17,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
3,
14,
2,
13,
17,
40,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
] | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
103,
5
],
[
103,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
8,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
8,
20
],
[
20,
21
],
[
20,
22
],
[
8,
23
],
[
23,
24
],
[
24,
25
],
[
25,
26
],
[
25,
27
],
[
23,
28
],
[
28,
29
],
[
28,
30
],
[
23,
31
],
[
31,
32
],
[
32,
33
],
[
23,
34
],
[
34,
35
],
[
35,
36
],
[
36,
37
],
[
35,
38
],
[
38,
39
],
[
39,
40
],
[
8,
41
],
[
41,
42
],
[
42,
43
],
[
43,
44
],
[
43,
45
],
[
41,
46
],
[
46,
47
],
[
46,
48
],
[
41,
49
],
[
49,
50
],
[
50,
51
],
[
41,
52
],
[
53,
53
],
[
53,
54
],
[
54,
55
],
[
54,
56
],
[
56,
57
],
[
57,
58
],
[
56,
59
],
[
53,
60
],
[
60,
61
],
[
60,
62
],
[
62,
63
],
[
63,
64
],
[
62,
65
],
[
53,
66
],
[
66,
67
],
[
53,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
70,
72
],
[
68,
73
],
[
73,
74
],
[
73,
75
],
[
68,
76
],
[
76,
77
],
[
77,
78
],
[
68,
79
],
[
80,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
83,
84
],
[
83,
85
],
[
82,
86
],
[
81,
87
],
[
53,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
88,
92
],
[
92,
93
],
[
8,
94
],
[
94,
95
],
[
95,
96
],
[
96,
97
],
[
96,
98
],
[
94,
99
],
[
6,
100
],
[
100,
101
],
[
0,
102
],
[
102,
103
],
[
102,
104
]
] | [
"\nimport java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t Scanner cin=new Scanner(System.in);\n\t\t List<Integer> list=new ArrayList<>();\n\t\t int n=cin.nextInt(),res=0;\n\t\t for(int i=0;i<n;i++)list.add(cin.nextInt());\n\t\t \n\t\t for(int i=0;i<n;i++) {\n\t\t\t int x=list.get(i),limit=(int)(Math.sqrt(x)),j;\n\t\t\t \n\t\t\t for(j=limit;j>1;j--) {\n\t\t\t\t if(x%j==0)break;\n\t\t\t }\n\t\t\t \n\t\t\t if(j==1)res++;\n\t\t\t \n\t\t }\n\t\t \n\t\t System.out.println(res);\n\t\t \n\t}\n\n}\n",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\t Scanner cin=new Scanner(System.in);\n\t\t List<Integer> list=new ArrayList<>();\n\t\t int n=cin.nextInt(),res=0;\n\t\t for(int i=0;i<n;i++)list.add(cin.nextInt());\n\t\t \n\t\t for(int i=0;i<n;i++) {\n\t\t\t int x=list.get(i),limit=(int)(Math.sqrt(x)),j;\n\t\t\t \n\t\t\t for(j=limit;j>1;j--) {\n\t\t\t\t if(x%j==0)break;\n\t\t\t }\n\t\t\t \n\t\t\t if(j==1)res++;\n\t\t\t \n\t\t }\n\t\t \n\t\t System.out.println(res);\n\t\t \n\t}\n\n}",
"Main",
"public static void main(String[] args) {\n\t\t Scanner cin=new Scanner(System.in);\n\t\t List<Integer> list=new ArrayList<>();\n\t\t int n=cin.nextInt(),res=0;\n\t\t for(int i=0;i<n;i++)list.add(cin.nextInt());\n\t\t \n\t\t for(int i=0;i<n;i++) {\n\t\t\t int x=list.get(i),limit=(int)(Math.sqrt(x)),j;\n\t\t\t \n\t\t\t for(j=limit;j>1;j--) {\n\t\t\t\t if(x%j==0)break;\n\t\t\t }\n\t\t\t \n\t\t\t if(j==1)res++;\n\t\t\t \n\t\t }\n\t\t \n\t\t System.out.println(res);\n\t\t \n\t}",
"main",
"{\n\t\t Scanner cin=new Scanner(System.in);\n\t\t List<Integer> list=new ArrayList<>();\n\t\t int n=cin.nextInt(),res=0;\n\t\t for(int i=0;i<n;i++)list.add(cin.nextInt());\n\t\t \n\t\t for(int i=0;i<n;i++) {\n\t\t\t int x=list.get(i),limit=(int)(Math.sqrt(x)),j;\n\t\t\t \n\t\t\t for(j=limit;j>1;j--) {\n\t\t\t\t if(x%j==0)break;\n\t\t\t }\n\t\t\t \n\t\t\t if(j==1)res++;\n\t\t\t \n\t\t }\n\t\t \n\t\t System.out.println(res);\n\t\t \n\t}",
"Scanner cin=new Scanner(System.in);",
"cin",
"new Scanner(System.in)",
"List<Integer> list=new ArrayList<>();",
"list",
"new ArrayList<>()",
"int n=cin.nextInt()",
"n",
"cin.nextInt()",
"cin.nextInt",
"cin",
"res=0;",
"res",
"0",
"for(int i=0;i<n;i++)list.add(cin.nextInt());",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"list.add(cin.nextInt());",
"list.add(cin.nextInt())",
"list.add",
"list",
"cin.nextInt()",
"cin.nextInt",
"cin",
"for(int i=0;i<n;i++) {\n\t\t\t int x=list.get(i),limit=(int)(Math.sqrt(x)),j;\n\t\t\t \n\t\t\t for(j=limit;j>1;j--) {\n\t\t\t\t if(x%j==0)break;\n\t\t\t }\n\t\t\t \n\t\t\t if(j==1)res++;\n\t\t\t \n\t\t }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\t int x=list.get(i),limit=(int)(Math.sqrt(x)),j;\n\t\t\t \n\t\t\t for(j=limit;j>1;j--) {\n\t\t\t\t if(x%j==0)break;\n\t\t\t }\n\t\t\t \n\t\t\t if(j==1)res++;\n\t\t\t \n\t\t }",
"{\n\t\t\t int x=list.get(i),limit=(int)(Math.sqrt(x)),j;\n\t\t\t \n\t\t\t for(j=limit;j>1;j--) {\n\t\t\t\t if(x%j==0)break;\n\t\t\t }\n\t\t\t \n\t\t\t if(j==1)res++;\n\t\t\t \n\t\t }",
"int x=list.get(i)",
"x",
"list.get(i)",
"list.get",
"list",
"i",
"limit=(int)(Math.sqrt(x))",
"limit",
"(int)(Math.sqrt(x))",
"Math.sqrt",
"Math",
"x",
"j;",
"j",
"for(j=limit;j>1;j--) {\n\t\t\t\t if(x%j==0)break;\n\t\t\t }",
"j=limit;",
"j=limit",
"j",
"limit",
"j>1",
"j",
"1",
"j--",
"j--",
"j",
"{\n\t\t\t\t if(x%j==0)break;\n\t\t\t }",
"{\n\t\t\t\t if(x%j==0)break;\n\t\t\t }",
"if(x%j==0)break;",
"x%j==0",
"x%j",
"x",
"j",
"0",
"break;",
"if(j==1)res++;",
"j==1",
"j",
"1",
"res++",
"res",
"System.out.println(res)",
"System.out.println",
"System.out",
"System",
"System.out",
"res",
"String[] args",
"args",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\t Scanner cin=new Scanner(System.in);\n\t\t List<Integer> list=new ArrayList<>();\n\t\t int n=cin.nextInt(),res=0;\n\t\t for(int i=0;i<n;i++)list.add(cin.nextInt());\n\t\t \n\t\t for(int i=0;i<n;i++) {\n\t\t\t int x=list.get(i),limit=(int)(Math.sqrt(x)),j;\n\t\t\t \n\t\t\t for(j=limit;j>1;j--) {\n\t\t\t\t if(x%j==0)break;\n\t\t\t }\n\t\t\t \n\t\t\t if(j==1)res++;\n\t\t\t \n\t\t }\n\t\t \n\t\t System.out.println(res);\n\t\t \n\t}\n\n}",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\t Scanner cin=new Scanner(System.in);\n\t\t List<Integer> list=new ArrayList<>();\n\t\t int n=cin.nextInt(),res=0;\n\t\t for(int i=0;i<n;i++)list.add(cin.nextInt());\n\t\t \n\t\t for(int i=0;i<n;i++) {\n\t\t\t int x=list.get(i),limit=(int)(Math.sqrt(x)),j;\n\t\t\t \n\t\t\t for(j=limit;j>1;j--) {\n\t\t\t\t if(x%j==0)break;\n\t\t\t }\n\t\t\t \n\t\t\t if(j==1)res++;\n\t\t\t \n\t\t }\n\t\t \n\t\t System.out.println(res);\n\t\t \n\t}\n\n}",
"Main"
] |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner cin=new Scanner(System.in);
List<Integer> list=new ArrayList<>();
int n=cin.nextInt(),res=0;
for(int i=0;i<n;i++)list.add(cin.nextInt());
for(int i=0;i<n;i++) {
int x=list.get(i),limit=(int)(Math.sqrt(x)),j;
for(j=limit;j>1;j--) {
if(x%j==0)break;
}
if(j==1)res++;
}
System.out.println(res);
}
}
|
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.