node_ids listlengths 4 1.4k | edge_index listlengths 1 2.22k | text listlengths 4 1.4k | source stringlengths 14 427k |
|---|---|---|---|
[
7,
15,
13,
17,
6,
13,
41,
13,
41,
13,
17,
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,
4,
18,
13,
41,
13,
20,
13... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
165,
5
],
[
165,
6
],
[
6,
7
],
[
165,
8
],
[
8,
9
],
[
8,
10
],
[
165,
11
],
[
11,
12
],
[
11,
13
],
[
13,
14... | [
"import java.util.Scanner;\n\npublic class Main {\n\n static Scanner scan;\n static int count = 0;\n\n public static void main(String[] args) {\n scan = new Scanner(System.in);\n\n // get input\n final int slen = scan.nextInt();\n int[] s = new int[slen];\n for(int i ... | import java.util.Scanner;
public class Main {
static Scanner scan;
static int count = 0;
public static void main(String[] args) {
scan = new Scanner(System.in);
// get input
final int slen = scan.nextInt();
int[] s = new int[slen];
for(int i = 0; i < slen; i++... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
13,
41,
13,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
20,
13,
41,
13,
11... | [
[
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
],
[... | [
"import java.util.Scanner;\n\nclass 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 S[] = new int[n];\n\t\tint i;\n\t\tfor(i=0; i<n; i++){\n\t\t\tS[i] = sc.nextInt();\n\t\t}\n\t\tint q = sc.nextInt();\n\t\tint T[] = new int[n];\n\t\tint ... | import java.util.Scanner;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int S[] = new int[n];
int i;
for(i=0; i<n; i++){
S[i] = sc.nextInt();
}
int q = sc.nextInt();
int T[] = new int[n];
int j;
for(j=0; j<q; j++){
T[j] = sc.ne... |
[
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,
4,
18,
13,
41,
13,
20,
41,
13,
4,
18,
4,
18,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
4... | [
[
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
],
[
119,
14
],
... | [
"import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.HashSet;\nimport java.util.Set;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint size = Integer.parseInt(b... | import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int size = Integer.parseInt(br.readLine());
Se... |
[
7,
15,
13,
17,
6,
13,
41,
13,
41,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
4,
18,
13,
0,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
0,
13,
4,
18,
13,
0,
13,
20,
13,
... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
176,
5
],
[
176,
6
],
[
6,
7
],
[
176,
8
],
[
8,
9
],
[
176,
10
],
[
10,
11
],
[
176,
12
],
[
12,
13
],
[
176,
... | [
"import java.util.Scanner;\n\n/**\n * Created by zhangrunfeng on 2/17/20\n */\n\npublic class Main {\n private int N;\n private int[] increArr;\n\n private int Q;\n private int[] arrQ;\n\n public Main (Scanner sc) {\n N = sc.nextInt();\n increArr = new int[N];\n for (int i = 0; i... | import java.util.Scanner;
/**
* Created by zhangrunfeng on 2/17/20
*/
public class Main {
private int N;
private int[] increArr;
private int Q;
private int[] arrQ;
public Main (Scanner sc) {
N = sc.nextInt();
increArr = new int[N];
for (int i = 0; i < N; i++) {
... |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
41,
13,
17,
0,
13,
20,
2,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
2,
13,
17,
4,
18,
13,
0,
18,
13,
... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
186,
8
],
[
186,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
]... | [
"import java.util.*;\nimport java.lang.Math;\npublic class Main{\n public static void main(String[] args){\n Scanner sc=new Scanner(System.in);\n int N=sc.nextInt();\n int A[];\n int ans=0;\n A=new int[N+2];\n for(int i=0;i<N;i++) A[i+1]=sc.nextInt();\n A[0]=-2000... | import java.util.*;
import java.lang.Math;
public class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int N=sc.nextInt();
int A[];
int ans=0;
A=new int[N+2];
for(int i=0;i<N;i++) A[i+1]=sc.nextInt();
A[0]=-2000000000;
... |
[
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,
4,
18,
4,
18,
13,
17,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
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
],
... | [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\n\nclass Main {\n\n\n public static void main(String args[]) throws IOException{\n\n\t BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t int n = Integer.parseInt( br.readLine() );\n\... | 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() );
String[] string =... |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
29,
8,
2,
13,
17,
4,
13,
13,
2,
13,
13,
13,
23,
13,
23,
13,
12,
13,
30,
29,
2,
2,
13,
13,
4,
13,
13,
13,
23,
13,
2... | [
[
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
],
... | [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.math.BigInteger;\nimport java.sql.Array;\nimport java.util.*;\n\npublic class Main {\n\n static long gcd (long a, long b) {return b>0?gcd(b,a%b):a;}\n static long lcm (long a, long b) {return a*b/gcd(a... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.sql.Array;
import java.util.*;
public class Main {
static long gcd (long a, long b) {return b>0?gcd(b,a%b):a;}
static long lcm (long a, long b) {return a*b/gcd(a,b);}
publ... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
2,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
162,
5
],
[
162,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner scan = new Scanner(System.in);\n\t\tint num1 = scan.nextInt();\n\t\tint[] array1 = new int[num1+1];\n\t\t //配列1個目\n\t\tfor(int i = 0; i < num1; i++) {\n\t\t\tarray1[i] = scan.nex... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner scan = new Scanner(System.in);
int num1 = scan.nextInt();
int[] array1 = new int[num1+1];
//配列1個目
for(int i = 0; i < num1; i++) {
array1[i] = scan.nextInt();
}
//配列2個目
int num2... |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
17,
41,
13,
13,
42,
2,
13,
13,
30,
41,
13,
2,
2,
13,
13,
17,
14,
2,
18,
13,
13,
13,
30,
29,
17,
14,
2,
13,
18,
13,
13,
30,
0,
13,
13,
30,
0,
13,
2,
13,
17... | [
[
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
],
... | [
"import java.util.*;\nimport java.io.*;\n\nclass Main{\n static int binarySearch(int[] tempArray, int n, int key){\n int left = 0;\n int right = n;\n\n while(left < right){\n int mid = (left + right) / 2;\n if(tempArray[mid] == key){\n return 1;\n ... | import java.util.*;
import java.io.*;
class Main{
static int binarySearch(int[] tempArray, int n, int key){
int left = 0;
int right = n;
while(left < right){
int mid = (left + right) / 2;
if(tempArray[mid] == key){
return 1;
}else if(key ... |
[
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,
4,
18,
13,
13,
41,
13,
4,
18,
13,
41,
13,
20,
13,
11... | [
[
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
],
[... | [
"import java.util.*;\n\nclass 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\tint[] l1 = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tl1[i] = sc.nextInt();\n\t\t}\n\t\tArrays.sort(l1);\n\t\t\n\t\tint q = sc.nextInt();\n\t\ti... | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] l1 = new int[n];
for (int i = 0; i < n; i++) {
l1[i] = sc.nextInt();
}
Arrays.sort(l1);
int q = sc.nextInt();
int[] l2 = new int[q];
for (int i = 0; i <... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
17,
41,
13,
18,
13,
13,
41,
13,
42,
2,
13,
13,
30,
0,
13,
2,
2,
13,
13,
17,
14,
2,
18,
13,
13,
13,
30,
29,
13,
14,
2,
18,
13,
13,
13,
30,
0,
13,
2,
13,
17,
14,
2,
13,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
146,
5
],
[
146,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"import java.util.*;\n\npublic class Main{\n\tstatic int search(int[] l,int key){\n\t\tint left = 0 ;\n\t\tint right = l.length;\n\t\tint mid ;\n\t\t\n\t\twhile(left < right){\n\t\t\tmid = (left + right) / 2 ;\n\t\t\tif(l[mid] == key){\n\t\t\t\treturn mid;\n\t\t\t}\n\t\t\telse if(l[mid] < key){\n\t\t\t\tleft = mid ... | import java.util.*;
public class Main{
static int search(int[] l,int key){
int left = 0 ;
int right = l.length;
int mid ;
while(left < right){
mid = (left + right) / 2 ;
if(l[mid] == key){
return mid;
}
else if(l[mid] < key){
left = mid +1 ;
}
else if(key < l[mid]){
right = mi... |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
4,
18,
13,
41,
13,
20,
4,
18,
13,
41,
13,
17,
28,
13,
4,
18,
4,
18,
13,
17,
30,
30,
14,
4,
18,
13,
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
],
[
0,
10
],
[
57,
11
],
[
57,
12
],
[
12,
13
],
[
12,
14
],
... | [
"import java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tscanner.nextLine();\n\t\tHashSet<String> set1 = new HashSet<>(Arrays.asList(scanner.nextLine().split(\" \")));\n\t\... | import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
scanner.nextLine();
HashSet<String> set1 = new HashSet<>(Arrays.asList(scanner.nextLine().split(" ")));
scanner.nextLine();
int... |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
13,
4,
18,
13,
41,
13,
4,
13,
4,
18,
13,
41,
13,
4,
13,
4,
18,
13,
41,
13,
4,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,... | [
[
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
],
[
249,
14
],
... | [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.regex.Pattern;\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 =... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.regex.Pattern;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = ip(br.readLi... |
[
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,
4,
18,
4,
18,
13,
17,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
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
],
... | [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\nclass Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tint n = Integer.parseInt(br.readLine());\n\n\t\tStr... | 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());
String[] ss = br.readLine()... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
17,
41,
13,
13,
41,
13,
17,
42,
2,
13,
13,
30,
0,
13,
2,
2,
13,
13,
17,
14,
2,
18,
13,
13,
13,
29,
17,
14,
2,
13,
18,
13,
13,
0,
13,
13,
0,
13,
2,
13,
17,
29,
17,
23,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
163,
5
],
[
163,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"import java.util.Scanner;\npublic class Main {\n\tpublic static int search(int[] a,int key,int n){\n\t\tint left = 0;\n\t\tint right = n;\n\t\tint mid = 0;\n\t\twhile(left<right){\n\t\t\tmid = (left + right)/2;\n\t\t\tif(a[mid]==key)\n\t\t\t\treturn 1;\n\t\t\telse if(key<a[mid])\n\t\t\t\tright = mid;\n\t\t\telse\n... | import java.util.Scanner;
public class Main {
public static int search(int[] a,int key,int n){
int left = 0;
int right = n;
int mid = 0;
while(left<right){
mid = (left + right)/2;
if(a[mid]==key)
return 1;
else if(key<a[mid])
right = mid;
else
left = mid +1;
}
return 0;
}
public s... |
[
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,
17,
41,
13,
20,
17,
41,
13,
4,
18,
4,
18,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
3... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
179,
11
],
[
179,
12
],
[
12,
13
],
[
12,
14
],... | [
"import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.IOException;\n\npublic class Main{\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());... | import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
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[... |
[
7,
15,
13,
17,
6,
13,
41,
13,
12,
13,
30,
41,
13,
20,
41,
13,
17,
41,
13,
17,
0,
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,
4,
18,
13,
41... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
4,
8
],
[
8,
9
],
[
8,
10
],
[
10,
11
],
[
11,
12
],
[
11,
13
],
[
10,
14
],
... | [
"import java.util.*;\nclass Main{\n static int n;\n public static void main(String args[])throws Exception{\n Scanner sc = new Scanner(System.in);\n int count = 0;\n int number = 0;\n n = sc.nextInt();\n int array_s [] = new int[n];\n for(int i =0; i<n; i++){\n array_s[i] = sc.nextInt();\n ... | import java.util.*;
class Main{
static int n;
public static void main(String args[])throws Exception{
Scanner sc = new Scanner(System.in);
int count = 0;
int number = 0;
n = sc.nextInt();
int array_s [] = new int[n];
for(int i =0; i<n; i++){
array_s[i] = sc.nextInt();
}
int q ... |
[
7,
15,
13,
17,
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,
0,
18,
13,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
1... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
378,
11
],
[
378,
12
],
[
12,
13
],
[
12,
14
],... | [
"import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n FastScanner fs = new FastScanner();\n int n = fs.nextInt();\n int[] arr1 = new int[n];\n for (int i = 0; i < n; ++i) arr1[i] = fs.nextIn... | import java.io.IOException;
import java.io.InputStream;
import java.util.*;
public class Main {
public static void main(String[] args) {
FastScanner fs = new FastScanner();
int n = fs.nextInt();
int[] arr1 = new int[n];
for (int i = 0; i < n; ++i) arr1[i] = fs.nextInt();
i... |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
38,
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,
4,
18,
13,
41,
13,
20,
1... | [
[
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
],
[
13,
14
]... | [
"import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\ttry(Scanner sc = new Scanner(System.in)) {\n\t\t\tint n = sc.nextInt();\n\t\t\tint[] S = new int[n];\n\t\t\tfor(int i=0; i<n; i++) {\n\t\t\t\tS[i] = sc.nextInt();\n\t\t\t}\n\t\t\t\n\t\t\tint ... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try(Scanner sc = new Scanner(System.in)) {
int n = sc.nextInt();
int[] S = new int[n];
for(int i=0; i<n; i++) {
S[i] = sc.nextInt();
}
int q = sc.nextInt();
int[] T = new int[q];... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
17,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
41,
13,
2,
18,
13,
13,
17,
42,
2,
13,
13,
30,
0,
13,
2,
2,
13,
13,
17,
14,
2,
18,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
188,
5
],
[
188,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"import java.util.Scanner;\n\npublic class Main {\n\t\n\tstatic int binarySearch(int[] a, int[] b) {\n\t\tint counter = 0;\n\t\tint mid = 0;\n\t\tfor(int i=0; i<b.length; i++){\n\t\t\tint L = 0;\n\t\t\tint R = a.length-1;\n\t\t\t\n\t\t\twhile(L<=R)\n\t\t\t{\n\t\t\t\tmid = (L+R)/2;\n//\t\t\t\tSystem.out.println(\"mi... | import java.util.Scanner;
public class Main {
static int binarySearch(int[] a, int[] b) {
int counter = 0;
int mid = 0;
for(int i=0; i<b.length; i++){
int L = 0;
int R = a.length-1;
while(L<=R)
{
mid = (L+R)/2;
// System.out.println("mid: "+ mid);
if(b[i]==a[mid])
{
counter... |
[
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,
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,
1... | [
[
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
],
... | [
"import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\... | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Vi... |
[
7,
15,
13,
17,
6,
13,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
20,
17,
12,
13,
30,
41,
13,
41,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
4,
18,
13,
0,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
153,
5
],
[
153,
6
],
[
6,
7
],
[
6,
8
],
[
153,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
11,
14
... | [
"import java.util.Scanner;\n\npublic class Main {\n static Scanner sc = new Scanner(System.in);\n static int n = Integer.parseInt(sc.next());\n static int[] a = new int[100000];\n\n public static void main(String[] args){\n int q,key,sum = 0;\n for (int i = 0; i < n; i++) {\n a[... | import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
static int n = Integer.parseInt(sc.next());
static int[] a = new int[100000];
public static void main(String[] args){
int q,key,sum = 0;
for (int i = 0; i < n; i++) {
a[i] = Integer.pa... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
4,
18,
20,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
17,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
10,
11
],
[
6,
12
],
[
12,
13
],
[
4,
14
],
[... | [
"import java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n new Main().main();\n }\n\n public void main() {\n Scanner scanner = new Scanner(System.in);\n\n int sNum = Integer.parseInt(scanner.nextLine());\n String[] sLine = scanner.nextLine().split(\" \", s... | import java.util.*;
class Main {
public static void main(String[] args) {
new Main().main();
}
public void main() {
Scanner scanner = new Scanner(System.in);
int sNum = Integer.parseInt(scanner.nextLine());
String[] sLine = scanner.nextLine().split(" ", sNum);
int[... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
17,
41,
13,
13,
42,
2,
13,
13,
30,
41,
13,
2,
2,
13,
13,
17,
14,
2,
18,
13,
13,
13,
29,
17,
14,
2,
13,
18,
13,
13,
0,
13,
13,
0,
13,
2,
13,
17,
29,
17,
23,
13,
23,
13... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
136,
5
],
[
136,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"import java.util.*;\n\npublic class Main {\n static int binarySearch(int n, int A[], int key) {\n int left = 0;\n int right = n;\n while(left < right) {\n int mid = (left + right) / 2;\n if(A[mid] == key) return 1;\n else if(key < A[mid]) right = mid;\n ... | import java.util.*;
public class Main {
static int binarySearch(int n, int A[], int key) {
int left = 0;
int right = n;
while(left < right) {
int mid = (left + right) / 2;
if(A[mid] == key) return 1;
else if(key < A[mid]) right = mid;
else lef... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
41,
13,
17,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
13,
41,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
4,
18,
13,
0,
18,
13,
13,
13,
41,
13,
4,
18... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
8,
11
],
[
11,
12
],
[
11,
13
],
[
8,
14
],
[... | [
"import java.util.Scanner;\n\n\n class Main {\n static public void main (String[] av){\n int b;\n int sum=0;\n Scanner sc =new Scanner(System.in);\n int n =sc.nextInt();\n int a[]= new int[n];\n int v;\n for(int i=0;i<n;i++){\n v=sc.nextInt();\n ... | import java.util.Scanner;
class Main {
static public void main (String[] av){
int b;
int sum=0;
Scanner sc =new Scanner(System.in);
int n =sc.nextInt();
int a[]= new int[n];
int v;
for(int i=0;i<n;i++){
v=sc.nextInt();
a[i]=v;
... |
[
7,
15,
13,
17,
6,
13,
41,
13,
41,
13,
41,
13,
41,
13,
12,
13,
30,
41,
13,
20,
0,
13,
4,
18,
13,
0,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
18,
13,
0,
13,
4,
18,
13,
0,
13,
... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
170,
5
],
[
170,
6
],
[
6,
7
],
[
170,
8
],
[
8,
9
],
[
170,
10
],
[
10,
11
],
[
170,
12
],
[
12,
13
],
[
170,
... | [
"import java.util.Scanner;\npublic class Main {\n public static int n;\n public static int S[];\n public static int q;\n public static int T[];\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n n=sc.nextInt();\n S=new int[n];\n for(int i=0... | import java.util.Scanner;
public class Main {
public static int n;
public static int S[];
public static int q;
public static int T[];
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
n=sc.nextInt();
S=new int[n];
for(int i=0;i<n;i++) S[i]=... |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
13,
41,
13,
20,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
4,
18,
13,
18,
1... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
93,
11
],
[
93,
12
],
[
12,
13
],
[
12,
14
],
... | [
"import java.util.Scanner;\nimport java.util.HashMap;\nimport java.util.Map;\n\npublic class Main{\n public static void main(final String[] args) {\n Scanner scan = new Scanner(System.in);\n int n = scan.nextInt();\n int[] a = new int[n];\n Map<Integer, Integer> mp = new HashMap<Integ... | import java.util.Scanner;
import java.util.HashMap;
import java.util.Map;
public class Main{
public static void main(final String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int[] a = new int[n];
Map<Integer, Integer> mp = new HashMap<Integer, Integer>()... |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
0,
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,
4,
18,
13,
41,
13,
17,
11... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
148,
8
],
[
148,
9
],
[
9,
10
],
[
148,
11
],
[
11,
12
],
[
11,
13
],
[
13,
14
... | [
"import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n static int[] a;\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = sc.nextInt... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
static int[] a;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = sc.nextInt();
}
... |
[
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,
4,
18,
13,
41,
13,
20,
13,
41,
13,
4,
18,
4,
18,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0... | [
[
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
],
[
194,
14
],
... | [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\n\npublic 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.parse... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
public static void main (String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLin... |
[
7,
15,
13,
17,
6,
13,
41,
13,
41,
13,
12,
13,
30,
41,
13,
17,
41,
13,
13,
42,
2,
13,
13,
30,
41,
13,
2,
2,
13,
13,
17,
14,
2,
18,
13,
13,
13,
29,
17,
14,
2,
13,
18,
13,
13,
0,
13,
13,
0,
13,
2,
13,
17,
29,
17... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
4,
8
],
[
8,
9
],
[
4,
10
],
[
10,
11
],
[
10,
12
],
[
12,
13
],
[
13,
14
],
... | [
"import java.util.Scanner;\n\nclass Main\n{\n static int n;\n static int q;\n\n static int Search(int[]s, int t, int n)\n {\n int left = 0;\n int right = n;\n\n while(left < right)\n {\n int mid = (left + right) / 2;\n\n if(s[mid] == t)\n ... | import java.util.Scanner;
class Main
{
static int n;
static int q;
static int Search(int[]s, int t, int n)
{
int left = 0;
int right = n;
while(left < right)
{
int mid = (left + right) / 2;
if(s[mid] == t)
return... |
[
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,
4,
18,
4,
18,
13,
17,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
17,
41,
13,
17,
11,
1,... | [
[
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
],... | [
"\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n public static void main(String[] args) throws IOException {\n BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n int n1 = Integer.parseInt(bf.readLine(... |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
int n1 = Integer.parseInt(bf.readLine());
S... |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
2,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
11... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
145,
8
],
[
145,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
]... | [
"import java.util.*;\n\nimport org.omg.Messaging.SYNC_WITH_TRANSPORT;\n\npublic class Main {\n public static void main(String[] args) {\n /*\n n: 5\n S: 1 2 3 4 5 \n q: 3\n T: 3 4 1\n out: 3\n */\n Scanner sc = new Scanner(System.in);\n int n = sc.ne... | import java.util.*;
import org.omg.Messaging.SYNC_WITH_TRANSPORT;
public class Main {
public static void main(String[] args) {
/*
n: 5
S: 1 2 3 4 5
q: 3
T: 3 4 1
out: 3
*/
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
in... |
[
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,
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,
... | [
[
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
],
... | [
"import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.Scanner;\n\npublic class Main {\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curC... | import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Scanner;
public class Main {
static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
pr... |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
4,
18,
20,
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,
4... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
89,
8
],
[
89,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
13,
14
],
... | [
"\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n\tprivate void run() {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tint[] num = new int[n];\n\t\tfor (int i = 0; i < n; i+... |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
new Main().run();
}
private void run() {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] num = new int[n];
for (int i = 0; i < n; i++) {
num[i] = scanner.nextInt... |
[
7,
15,
13,
17,
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,
41,
13,
4,
18,
13,
41,
13,
2... | [
[
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
],
... | [
"import java.io.*;\nimport java.util.*;\n\n\nclass Main{\n public static void main(String[] args){\n\tScanner sc = new Scanner(System.in);\n\tint count = 0;\n\tint R = sc.nextInt();\n\tint[] A = new int[R];\n\tfor(int i = 0;i < R;i++){\n\t A[i] = sc.nextInt();\n\t}\n\tint N = sc.nextInt();\n\tint[] B = new in... | import java.io.*;
import java.util.*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int count = 0;
int R = sc.nextInt();
int[] A = new int[R];
for(int i = 0;i < R;i++){
A[i] = sc.nextInt();
}
int N = sc.nextInt();
int[] B = new int[N];
for(int j = 0;j < N;j... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
38,
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,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
103,
5
],
[
103,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
10,
11
],
[
11,
12
],
[
11,
13
],
[
10,
14
... | [
"import java.util.Scanner;\n \npublic class Main {\n public static void main(String[] args) {\n try(Scanner sc = new Scanner(System.in)){\n \tint n = sc.nextInt();\n \tint [] S = new int[n];\n \tfor(int i=0;i<n;i++) {\n \t\tS[i] = sc.nextInt();\n \t}\n \t\n ... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try(Scanner sc = new Scanner(System.in)){
int n = sc.nextInt();
int [] S = new int[n];
for(int i=0;i<n;i++) {
S[i] = sc.nextInt();
}
int q = sc.nextInt();... |
[
7,
15,
13,
17,
6,
13,
41,
13,
41,
13,
41,
13,
17,
12,
13,
30,
41,
13,
20,
0,
13,
4,
18,
13,
0,
13,
20,
13,
41,
13,
2,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
41,
13,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
152,
5
],
[
152,
6
],
[
6,
7
],
[
152,
8
],
[
8,
9
],
[
152,
10
],
[
10,
11
],
[
10,
12
],
[
152,
13
],
[
13,
... | [
"import java.util.Scanner;\n\npublic class Main {\n public static int s[];\n public static int n;\n public static int count = 0;\n public static void main(String args[]){\n Scanner scan = new Scanner(System.in);\n n = scan.nextInt();\n s = new int[n];\n int right = n - 1;\n ... | import java.util.Scanner;
public class Main {
public static int s[];
public static int n;
public static int count = 0;
public static void main(String args[]){
Scanner scan = new Scanner(System.in);
n = scan.nextInt();
s = new int[n];
int right = n - 1;
for(int i ... |
[
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,
0,
18,
13,
13,
4,
18,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
4,
18,
18,
13,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
60,
5
],
[
60,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
... | [
"import 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[] S = new int[n];\n for(int i = 0; i < n; i++) S[i] = Integer.parseInt(sc.next());\n int q = sc.nextInt();\n ... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] S = new int[n];
for(int i = 0; i < n; i++) S[i] = Integer.parseInt(sc.next());
int q = sc.nextInt();
int ans = 0;
... |
[
7,
15,
13,
17,
6,
13,
41,
13,
41,
13,
12,
13,
30,
41,
13,
20,
0,
13,
4,
18,
13,
0,
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,
4,
18,
13,
41,
13,
20,
13,
11,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
182,
5
],
[
182,
6
],
[
6,
7
],
[
182,
8
],
[
8,
9
],
[
182,
10
],
[
10,
11
],
[
10,
12
],
[
12,
13
],
[
13,
1... | [
"import java.util.Scanner;\npublic class Main {\n static int n;\n static int s[];\n public static void main(String[] arg){\n Scanner sc = new Scanner(System.in);\n n = sc.nextInt();\n s = new int[n];\n for(int i=0;i<n;i++){\n s[i] = sc.nextInt();\n }\n i... | import java.util.Scanner;
public class Main {
static int n;
static int s[];
public static void main(String[] arg){
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
s = new int[n];
for(int i=0;i<n;i++){
s[i] = sc.nextInt();
}
int q = sc.nextIn... |
[
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,
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,
13,
1... | [
[
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
],
... | [
"import 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.*;\nimport java.awt.Point;\n\npublic class Main {\n // static int INF = (1 << 30) - 1;\n // static long L_IN... | 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.*;
import java.awt.Point;
public class Main {
// static int INF = (1 << 30) - 1;
// static long L_INF = (1L << 62) -... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
14,
2,
13,
13,
29,
17,
41,
13,
2,
2,
13,
13,
17,
14,
2,
18,
13,
13,
13,
29,
4,
13,
13,
13,
13,
2,
13,
17,
14,
2,
18,
13,
13,
13,
29,
4,
13,
13,
13,
2,
13,
17,
13,
29,
17,
23,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
148,
5
],
[
148,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
10,
11
],
[
10,
12
],
[
9,
13
],
[
13,
14
]... | [
"import java.util.Scanner;\n\n// ALDS1_4_B\npublic class Main {\n\tboolean binarySearch(int[] array, int target, int min, int max) {\n\t\tif (max < min) return false;\n\t\tint mid = (max + min) / 2;\n\t\tif (array[mid] > target) return binarySearch(array, target, min, mid - 1);\n\t\tif (array[mid] < target) return ... | import java.util.Scanner;
// ALDS1_4_B
public class Main {
boolean binarySearch(int[] array, int target, int min, int max) {
if (max < min) return false;
int mid = (max + min) / 2;
if (array[mid] > target) return binarySearch(array, target, min, mid - 1);
if (array[mid] < target) return binarySearch(array, ta... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
17,
41,
13,
2,
13,
17,
42,
2,
13,
13,
30,
41,
13,
2,
2,
13,
13,
17,
14,
2,
18,
13,
13,
13,
30,
29,
17,
14,
2,
18,
13,
13,
13,
30,
0,
13,
2,
13,
17,
14,
2,
13,
18,
13,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
202,
5
],
[
202,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"import java.io.*;\n\npublic class Main{\n\n static boolean binarySearch(int[] s, int n, int key){\n int left = 0;\n int right = n - 1;\n while(left <= right){\n int mid = (left + right) / 2;\n if(s[mid] == key){\n return true;\n }else if(s[mid... | import java.io.*;
public class Main{
static boolean binarySearch(int[] s, int n, int key){
int left = 0;
int right = n - 1;
while(left <= right){
int mid = (left + right) / 2;
if(s[mid] == key){
return true;
}else if(s[mid] < key){
... |
[
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,
4,
18,
4,
18,
13,
17,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
177,
8
],
[
177,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
]... | [
"import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main\n{\n\tpublic static void main(String[] args)throws Exception\n\t{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tString[] g = br.readLine().spl... | import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main
{
public static void main(String[] args)throws Exception
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
String[] g = br.readLine().split(" ");
int [] ar =... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
41,
13,
17,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
20,
13... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
199,
5
],
[
199,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
8,
11
],
[
11,
12
],
[
11,
13
],
[
8,
14
],... | [
"import java.util.Scanner;\n\npublic class Main{\n public static void main(String[] args){\n int i;\n int count=0;\n Scanner sc= new Scanner(System.in);\n \n int n= sc.nextInt();\n int intarr[]=new int[n];\n for(i=0;i<n;i++){\n intarr[i]=sc.nextInt(); \... | import java.util.Scanner;
public class Main{
public static void main(String[] args){
int i;
int count=0;
Scanner sc= new Scanner(System.in);
int n= sc.nextInt();
int intarr[]=new int[n];
for(i=0;i<n;i++){
intarr[i]=sc.nextInt();
}
... |
[
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,
4,
18,
13,
41,
13,
20,
13,
11,
1... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
111,
8
],
[
111,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
]... | [
"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[] s = new int[n];\n for (int i = 0; i < n; i++) {\n s[i] = sc.nextInt();\n }\n ... | 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[] s = new int[n];
for (int i = 0; i < n; i++) {
s[i] = sc.nextInt();
}
int q = s... |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
18,
13,
13,
41,
13,
20,
17,
41,
13,
17,
41,
13,
17,
12,
13,
30,
41,
13,
20,
41,
13,
4,
13,
41,
13,
20,
13,
41,
13,
40,
17,
11,
1,
41,
13,
17,
2,... | [
[
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
],
[
469,
14
],
... | [
"import java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.NoSuchElementException;\npublic class Main {\n\tpublic static void main(String[] args)throws Exception{\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tint n=nextInt();\n\t\tint S[]=new int[n];\n\t\tint k=... | import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args)throws Exception{
PrintWriter out = new PrintWriter(System.out);
int n=nextInt();
int S[]=new int[n];
int k=-1;
for(int i=0;i<n;i... |
[
7,
15,
13,
17,
15,
13,
17,
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,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
... | [
[
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
],
... | [
"import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.LinkedList;\nimport java.util.PriorityQueue;\n\n \npublic class Main {\n public static void main(String[] args) {\n InputReader sc = new In... | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.LinkedList;
import java.util.PriorityQueue;
public class Main {
public static void main(String[] args) {
InputReader sc = new InputReader(System... |
[
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,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
157,
5
],
[
157,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"\n\nimport 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 s[] = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ts[i] = sc.nextInt();\n\t\t}\n\n\t\tint q = sc.nextInt();\n\t\tint t[] = new int[... |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int s[] = new int[n];
for (int i = 0; i < n; i++) {
s[i] = sc.nextInt();
}
int q = sc.nextInt();
int t[] = new int[q];
for (int i = 0; i < q; i++) {
... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
17,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
18,
13,
18,
13,
13,
41,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
240,
5
],
[
240,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"import java.io.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\t\n\t\tint n=Integer.parseInt(br.readLine());\n String[] str=br.readLine().split(\" \");\n ... | import java.io.*;
public class Main {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n=Integer.parseInt(br.readLine());
String[] str=br.readLine().split(" ");
int[] S=new int[n];
... |
[
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,
0,
18,
13,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
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
],... | [
"import java.util.*;\npublic class Main {\n public static void main(String [] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int [] S = new int[n];\n for(int i=0;i<n;i++) S[i] = sc.nextInt();\n int q = sc.nextInt();\n int cnt = 0;\n for(i... | import java.util.*;
public class Main {
public static void main(String [] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int [] S = new int[n];
for(int i=0;i<n;i++) S[i] = sc.nextInt();
int q = sc.nextInt();
int cnt = 0;
for(int i=0;i<q;i++... |
[
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,
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... | [
[
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
],
... | [
"import java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileNotFoundException;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.lang.management.ManagementFactory;\nimport java.lang.management.ThreadMXBean;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.ut... | import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.lang.management.ManagementFactory;
import java.lang.management.ThreadMXBean;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;... |
[
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,
4,
18,
13,
13,
41,
13,
4,
18,
13,
41,
13,
20,
13,
11... | [
[
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
],
[... | [
"import java.util.*;\nclass Main{\n public static void main(String[] args){\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n int[] s = new int[n];\n for(int i = 0; i < n; i++){\n s[i] = scanner.nextInt();\n }\n Arrays.sort(s);\n ... | import java.util.*;
class Main{
public static void main(String[] args){
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] s = new int[n];
for(int i = 0; i < n; i++){
s[i] = scanner.nextInt();
}
Arrays.sort(s);
int q = scann... |
[
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,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
161,
5
],
[
161,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n int n = s.nextInt();\n int [] S = new int [n];\n for (int i = 0; i < n; i++) {\n S[i] = s.nextInt();\n }\n int q = s.nextInt(... |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int [] S = new int [n];
for (int i = 0; i < n; i++) {
S[i] = s.nextInt();
}
int q = s.nextInt();
int [... |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
17,
41,
13,
18,
13,
13,
42,
2,
13,
13,
30,
41,
13,
2,
2,
13,
13,
17,
14,
2,
18,
13,
13,
13,
29,
17,
14,
2,
18,
13,
13,
13,
0,
13,
13,
0,
13,
2,
13,
17,
29... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
178,
8
],
[
178,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
]... | [
"/*\n * http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_4_B&lang=jp\n */\nimport java.util.*;\nimport java.util.Arrays;\n\npublic class Main {\n\t\n\tboolean binSearch(int[] s, int x, int a, int b) {\n\t\tint left = 0;\n\t\tint right = s.length;\n\t\twhile (left < right) {\n\t\t\tint mid = (left + ri... | /*
* http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_4_B&lang=jp
*/
import java.util.*;
import java.util.Arrays;
public class Main {
boolean binSearch(int[] s, int x, int a, int b) {
int left = 0;
int right = s.length;
while (left < right) {
int mid = (left + right) / 2;
if (s[mid] == x... |
[
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,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
159,
5
],
[
159,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"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 = scanner.nextInt();\n int[] s = new int[n];\n for (int i = 0; i < n; i++) {\n s[i] = scanner.nextInt();\n }\n int ... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] s = new int[n];
for (int i = 0; i < n; i++) {
s[i] = scanner.nextInt();
}
int q = scanner.nex... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
20,
2,
13,
17,
41,
13,
4,
18,
4,
18,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
18,
... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
194,
5
],
[
194,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"import java.io.*;\n\npublic class Main{\n\n\tpublic static void main(String[] args) throws IOException{\n\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tint[] S = new int[n+1];\n\t\tString[] ins = br.readLine().split(\" \");\n\t\tfo... | import java.io.*;
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[] S = new int[n+1];
String[] ins = br.readLine().split(" ");
for(int i = 0; i < n; i++){
... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
38,
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,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41... | [
[
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
],
... | [
"import java.util.*;\n\nclass Main {\n public static void main(String args[]) {\n try (Scanner sc = new Scanner(System.in)) {\n int N = sc.nextInt();\n long[] S = new long[N];\n for (int i = 0; i < N; i++) {\n ... | import java.util.*;
class Main {
public static void main(String args[]) {
try (Scanner sc = new Scanner(System.in)) {
int N = sc.nextInt();
long[] S = new long[N];
for (int i = 0; i < N; i++) {
... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
2,
2,
13,
13,
17,
14,
2,
2,
13,
13,
2,
13,
13,
29,
40,
17,
14,
2,
2,
18,
13,
13,
13,
2,
18,
13,
13,
13,
29,
40,
17,
14,
2,
18,
13,
13,
13,
30,
29,
17,
14,
2,
18,
13,
... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
256,
5
],
[
256,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
]... | [
"import java.util.Scanner;\n\npublic class Main{\n public static int binarySearch(int start, int n, int[] S, int q) {\n int mid = (start + n) / 2;\n if(mid == start || mid == n)return -1;\n if (S[n] < q || S[start] > q)\n return -1;\n if (S[start] == q){\n return 1;\... | import java.util.Scanner;
public class Main{
public static int binarySearch(int start, int n, int[] S, int q) {
int mid = (start + n) / 2;
if(mid == start || mid == n)return -1;
if (S[n] < q || S[start] > q)
return -1;
if (S[start] == q){
return 1;
}
... |
[
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,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
41,
13,
4,
18,
1... | [
[
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
],
[
323,
14
],
... | [
"import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.NoSuchElementException;\nimport java.util.Arrays;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tFS r = new FS();\n\t\tint n = r.nextInt();\n\t\tint[] S = new int[n];\n\t\tfor(int i=0; i<n; i++) {\n\t\t\tS[i] = r.ne... | import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
import java.util.Arrays;
public class Main {
public static void main(String[] args) {
FS r = new FS();
int n = r.nextInt();
int[] S = new int[n];
for(int i=0; i<n; i++) {
S[i] = r.nextInt();
}
int q = r.nex... |
[
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,
41,
13,
4,
18,
4,
18,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
0,
18... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
171,
11
],
[
171,
12
],
[
12,
13
],
[
12,
14
],... | [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n public static void main(String[] args) throws IOException {\n\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
... |
[
7,
15,
13,
17,
6,
13,
41,
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,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
147,
5
],
[
147,
6
],
[
6,
7
],
[
147,
8
],
[
8,
9
],
[
8,
10
],
[
10,
11
],
[
11,
12
],
[
11,
13
],
[
10,
14
... | [
"import java.util.Scanner;\npublic class Main {\nprivate static Scanner s;\n\npublic static void main(String[] args) {\n\ts = new Scanner(System.in);\n\tint a = s.nextInt();\n\tint[] b = new int[a];\n\tfor(int i = 0;i < a;i++) {\n\t\tb[i] = s.nextInt();\n\t}\n\n\tint c = s.nextInt();\n\tint[] d = new int[c];\n\tfor... | import java.util.Scanner;
public class Main {
private static Scanner s;
public static void main(String[] args) {
s = new Scanner(System.in);
int a = s.nextInt();
int[] b = new int[a];
for(int i = 0;i < a;i++) {
b[i] = s.nextInt();
}
int c = s.nextInt();
int[] d = new int[c];
for(int i = 0;i < c;i++) {
d[i... |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
41,
13,
41,
13,
41,
13,
12,
13,
30,
14,
2,
13,
13,
30,
41,
13,
2,
2,
13,
13,
17,
14,
2,
13,
18,
13,
13,
30,
29,
4,
13,
13,
2,
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
],
... | [
"import java.util.Scanner;\nimport java.util.ArrayList;\nimport java.lang.Integer;\nimport java.lang.StringBuilder;\nimport java.lang.Math;\n\npublic class Main {\n private static int N;\n private static int[] S;\n private static int Q;\n private static int[] C;\n\n private static int binarySearch(int v, int l... | import java.util.Scanner;
import java.util.ArrayList;
import java.lang.Integer;
import java.lang.StringBuilder;
import java.lang.Math;
public class Main {
private static int N;
private static int[] S;
private static int Q;
private static int[] C;
private static int binarySearch(int v, int low, int high) {
... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
2,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
148,
5
],
[
148,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"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 = scanner.nextInt();\n int[] s = new int[n + 1];\n for (int i = 0; i < n; i++) {\n s[i] = scanner.nextInt();\n }\n ... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] s = new int[n + 1];
for (int i = 0; i < n; i++) {
s[i] = scanner.nextInt();
}
int q = scanner... |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
41,
13,
41,
13,
41,
13,
12,
13,
30,
41,
13,
20,
0,
13,
4,
18,
13,
0,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
18,
13,
0,
13,
4,
18,
... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
169,
8
],
[
169,
9
],
[
9,
10
],
[
169,
11
],
[
11,
12
],
[
169,
13
],
[
13,
14
... | [
"import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tint n, q;\n\tint[] s, t;\n\tvoid run() {\n\t\tScanner scan = new Scanner(System.in);\n\t\tn = scan.nextInt();\n\t\ts = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ts[i] = scan.nextInt();\n\t\tq = scan.nextInt();\n\t\tt = new int[q... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
int n, q;
int[] s, t;
void run() {
Scanner scan = new Scanner(System.in);
n = scan.nextInt();
s = new int[n];
for (int i = 0; i < n; i++)
s[i] = scan.nextInt();
q = scan.nextInt();
t = new int[q];
for (int i = 0; i < q; i++)
... |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
41,
13,
18,
13,
13,
41,
13,
18,
13,
13,
41,
13,
17,
41,
13,
18,
13,
13,
41,
13,
20,
17,
41,
13,
17,
41,
13,
17,
12,
13,
30,
41,
13,
4,
13,
41,
13,
4,
13,
13,
41,
13,
4,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
9,
10
],
[
7,
11
],
[
11,
12
],
[
11,
13
],
[
13,
14
],
... | [
"import java.util.*;\nimport java.io.*;\n\nclass Main {\n\tvoid solve () {\n\t\t\n\t\tint n = nextInt();\n\t\tint[] A = nextIntArray(n);\n\t\t\n\t\tint m = nextInt();\n\t\tint ans = 0;\n\t\tfor (int i=0; i<m; i++) {\n\t\t\tif (Arrays.binarySearch(A, nextInt()) >= 0) ans++;\n\t\t}\n\t\t\n\t\tout.println(ans);\n\t\t\... | import java.util.*;
import java.io.*;
class Main {
void solve () {
int n = nextInt();
int[] A = nextIntArray(n);
int m = nextInt();
int ans = 0;
for (int i=0; i<m; i++) {
if (Arrays.binarySearch(A, nextInt()) >= 0) ans++;
}
out.println(ans);
}
// <Main Method>
public static PrintW... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
17,
41,
13,
41,
13,
13,
42,
2,
13,
13,
30,
0,
13,
2,
2,
13,
13,
17,
14,
2,
13,
18,
13,
13,
29,
17,
14,
2,
13,
18,
13,
13,
0,
13,
2,
13,
17,
14,
2,
13,
18,
13,
13,
0,
... | [
[
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
],
[
8,
14
],
[
... | [
"import java.util.Scanner;\n \n \n class Main{\n \n public static boolean search(int A[],int n,int key){\n\t\t\n\t\tint left =0;\n\t\tint mid;\n\t\tint right =n;\n\t\t\n\t\twhile(left<right){\n\t\t\tmid=(left+right)/2;\n\t\t\tif(key==A[mid]) \n\t\t\t\treturn true; \n\t\t\tif(key>A[mid])\n\t\t\t\tleft=mid+1;\n\t\t... | import java.util.Scanner;
class Main{
public static boolean search(int A[],int n,int key){
int left =0;
int mid;
int right =n;
while(left<right){
mid=(left+right)/2;
if(key==A[mid])
return true;
if(key>A[mid])
left=mid+1;
else if(key<A[mid])
right =mid;
}
return fal... |
[
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,
4,
18,
13,
41,
13,
4,
18,
13,
17,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
160,
5
],
[
160,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"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\n\t\tString line1 = sc.nextLine();\n\t\tint n = Integer.parseInt(line1);\n\t\t\n\t\tString line2 = sc.nextLine();\n\t... | 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);
String line2 = sc.nextLine();
String[] kari2 = line2.split("... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
4,
13,
18,
13,
13,
13,
17,
13,
29,
13,
23,
13,
23,
13,
23,
13,
23,
13,
12,
13,
30,
42,
2,
13,
13,
30,
41,
... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
177,
5
],
[
177,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
13,
14
],... | [
"import java.util.*;\n\npublic class Main {\n static int calu(int n, int m, int A[], int S[]) {\n int count=0;\n for(int i=0;i<m;i++){\n count+=bsearch(S[i],A,0,n);\n }\n return count;\n }\n static int bsearch(int si,int A[],int left,int right)\n { \n whil... | import java.util.*;
public class Main {
static int calu(int n, int m, int A[], int S[]) {
int count=0;
for(int i=0;i<m;i++){
count+=bsearch(S[i],A,0,n);
}
return count;
}
static int bsearch(int si,int A[],int left,int right)
{
while (left < right){... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
17,
41,
13,
17,
41,
13,
41,
13,
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,
4,
1... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
172,
5
],
[
172,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"\nimport java.util.*;\n\n/**\n * A\n */\npublic class Main {\n public static void main(String[] args) {\n \n Scanner sc = new Scanner(System.in);\n int flag = 0, count = 0, left, right;\n\n int n = sc.nextInt();\n int[] S = new int[n];\n\n for(int i=0; i<n; i++) {\n ... |
import java.util.*;
/**
* A
*/
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int flag = 0, count = 0, left, right;
int n = sc.nextInt();
int[] S = new int[n];
for(int i=0; i<n; i++) {
S[i] = sc.nex... |
[
7,
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,
4,
18,
13,
41,
13,
4,
18,
13,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
13,
41,
13,
17,
11,
1,
41,
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
],
... | [
"import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\n\tstatic PrintWriter out;\n\tstatic InputReader ir;\n\n\tstatic void solve() {\n\t\tint n=ir.nextInt();\n\t\tint[] s=ir... | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
static PrintWriter out;
static InputReader ir;
static void solve() {
int n=ir.nextInt();
int[] s=ir.nextIntArray(n);
int q... |
[
7,
15,
13,
17,
6,
13,
41,
13,
20,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
4,
18,
13,
0,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
4,
9
],
[
9,
10
],
[
4,
11
],
[
11,
12
],
[
4,
13
],
[
13,
14
],
[... | [
"import java.util.Scanner;\nclass Main{\n\tScanner sc = new Scanner(System.in);\n\tint n;\n\tint[] S;\n\tint q;\n\tint[] T;\n\tint C;\n\tint left;\n\tint right;\n\tint mid;\n\tvoid n(){\n\t\tn=sc.nextInt();\n\t\tS=new int[n];\n\t\tfor(int i=0; i<n; i++){\n\t\t\tS[i]=sc.nextInt();\n\t\t}\n\t\tq=sc.nextInt();\n\t\tT=... | import java.util.Scanner;
class Main{
Scanner sc = new Scanner(System.in);
int n;
int[] S;
int q;
int[] T;
int C;
int left;
int right;
int mid;
void n(){
n=sc.nextInt();
S=new int[n];
for(int i=0; i<n; i++){
S[i]=sc.nextInt();
}
q=sc.nextInt();
T=new int[q];
for(int j=0; j<q; j++){
T[j]=sc... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
20,
17,
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,
4,
18,
13,
18,
13,
17,
41,
13,
4,
13,
18,
13... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
243,
5
],
[
243,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"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\tString[] str = new String[4];\n\t\tfor(int i = 0; i < str.length; i++) {\n\t\t\tstr[i] = sc.nextLine();\n\t\t}\n\t\tsc.close();\n\t\tint lenSort = Integer.parseInt(str[0]);\n\... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String[] str = new String[4];
for(int i = 0; i < str.length; i++) {
str[i] = sc.nextLine();
}
sc.close();
int lenSort = Integer.parseInt(str[0]);
int[] sorted = stringToIntArray... |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
20,
12,
13,
30,
41,
13,
14,
2,
2,
18,
13,
13,
17,
2,
4,
18,
18,
13,
17,
17,
17,
30,
0,
13,
4,
13,
17,
30,
0,
13,
4,
13,
41,
13,
4,
13,
13,
41,... | [
[
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
],
[
472,
14
],
... | [
"import java.io.BufferedReader;\nimport java.io.FileInputStream;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\n\n\npublic class Main {\n\tstatic ArrayList<Integer> list = new ArrayList<Integer>();\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader br;\n\t\tif( args... | import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
public class Main {
static ArrayList<Integer> list = new ArrayList<Integer>();
public static void main(String[] args) throws Exception {
BufferedReader br;
if( args.length > 0 && args[0]... |
[
7,
15,
13,
17,
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,
4,
18,
13,
41,
13,
2... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
167,
11
],
[
167,
12
],
[
12,
13
],
[
12,
14
],... | [
"import java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\n\t\tint n = scan.nextInt();\n\t\tint[] S = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tS[i] = scan.nextInt();\n\t... | import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int[] S = new int[n];
for (int i = 0; i < n; i++) {
S[i] = scan.nextInt();
}
int q = scan.nextInt();
... |
[
7,
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,
41,
13,
20,
0,
13,
4,
18,
13,
41,
13,
20,
13,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
1... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
164,
5
],
[
164,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
8,
11
],
[
11,
12
],
[
8,
13
],
[
13,
14
],... | [
"import java.util.Scanner;\n\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\t// TODO ?????????????????????????????????????????????\n\t\tint n,q,i,j,ans=0,left,right,mid,key;\n\t\tScanner sc=new Scanner(System.in);\n\t\tn=sc.nextInt();\n\t\tint s[]=new int[n];\n\t\tfor(i=0;i<n;i++){\n\t\t\ts[i... | import java.util.Scanner;
public class Main {
public static void main(String[] args){
// TODO ?????????????????????????????????????????????
int n,q,i,j,ans=0,left,right,mid,key;
Scanner sc=new Scanner(System.in);
n=sc.nextInt();
int s[]=new int[n];
for(i=0;i<n;i++){
s[i]=sc.nextInt();
}
q=sc.nextI... |
[
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,
4,
18,
4,
18,
13,
17,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
196,
11
],
[
196,
12
],
[
12,
13
],
[
12,
14
],... | [
"import java.io.BufferedReader;\n//import java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n//import java.util.Arrays;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\t//System.setIn(new FileInputStream(\"./AL... | import java.io.BufferedReader;
//import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
//import java.util.Arrays;
public class Main {
public static void main(String[] args) throws NumberFormatException, IOException {
//System.setIn(new FileInputStream("./ALDS1_4_B-in1.txt"))... |
[
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,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
99,
5
],
[
99,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
... | [
"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws Exception {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong[] S = new long[n];\n\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tS[i] = sc.nextLong();\n\t\t}\n\n\t\tint q = sc.nextInt();\n\... | import java.util.Scanner;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long[] S = new long[n];
for(int i = 0; i < n; i++) {
S[i] = sc.nextLong();
}
int q = sc.nextInt();
int count = 0;
for(int j = 0; j ... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
17,
41,
13,
13,
41,
13,
17,
42,
2,
13,
13,
30,
0,
13,
2,
2,
13,
13,
17,
14,
2,
13,
18,
13,
13,
29,
13,
14,
2,
13,
18,
13,
13,
0,
13,
2,
13,
17,
14,
2,
13,
18,
13,
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
],
[... | [
"import java.util.*;\n\nclass Main {\n\t//????????¢?´¢?????¬???\n\tpublic static int binarySearch(int[] A, int n, int key) {\n\t\tint left = 0;\n\t\tint right = n ;\n\t\tint mid = 0;\n\t\twhile(left < right) {\n\t\t\t mid = (left + right) / 2;\n\t\t\tif ( key == A[mid] ) return mid;\n\t\t\telse if ( key > A[mid] ) ... | import java.util.*;
class Main {
//????????¢?´¢?????¬???
public static int binarySearch(int[] A, int n, int key) {
int left = 0;
int right = n ;
int mid = 0;
while(left < right) {
mid = (left + right) / 2;
if ( key == A[mid] ) return mid;
else if ( key > A[mid] ) left = mid + 1;
else if ( key < ... |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
12,
13,
30,
41,
13,
20,
4,
18,
13,
23,
13,
12,
13,
30,
41,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
14,
2,
13,
17,
30,
38,
5,
13,
30,
4,
18,
13,
30,
4,
1... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
214,
11
],
[
214,
12
],
[
12,
13
],
[
12,
14
],... | [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n/**\n * 境界部分には気をつける(そこだけ別で処理するというのもあり)\n * 逆再生することで簡単になることもある\n */\npublic class Main {\n public Main() {\n }\n\n public static void main(String[] args ) {\n Main main = new Main();\n main... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
* 境界部分には気をつける(そこだけ別で処理するというのもあり)
* 逆再生することで簡単になることもある
*/
public class Main {
public Main() {
}
public static void main(String[] args ) {
Main main = new Main();
main.exec();
}
... |
[
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,
4,
18,
13,
41,
13,
41,
13,
41,
13,
41,
13,
4... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
133,
5
],
[
133,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"import java.util.Scanner;\npublic class Main {\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] s = new int[n];\n for(int i = 0; i < n; i++){\n s[i] = sc.nextInt();\n }\n int q ... | import java.util.Scanner;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] s = new int[n];
for(int i = 0; i < n; i++){
s[i] = sc.nextInt();
}
int q = sc.nextInt()... |
[
7,
15,
13,
17,
6,
13,
41,
13,
41,
13,
12,
13,
30,
41,
13,
20,
0,
13,
4,
18,
13,
0,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
166,
5
],
[
166,
6
],
[
6,
7
],
[
166,
8
],
[
8,
9
],
[
166,
10
],
[
10,
11
],
[
10,
12
],
[
12,
13
],
[
13,
1... | [
"\nimport java.util.Scanner;\n\npublic class Main {\n\n\n\tstatic int S[];\n\tstatic int n;\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tn = scan.nextInt();\n\t\tS = new int[n];\n\t\tfor(int i = 0;i < n;i++)S[i] = scan.nextInt();\n\t\tint q = scan.nextInt();\n\t\tint ... |
import java.util.Scanner;
public class Main {
static int S[];
static int n;
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
n = scan.nextInt();
S = new int[n];
for(int i = 0;i < n;i++)S[i] = scan.nextInt();
int q = scan.nextInt();
int c = 0;
for(int i = 0;i < q;i++) ... |
[
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,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,... | [
[
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
],... | [
"import 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[] S = new int[n];\n for (int i = 0; i < n; i++) {\n S[i] = sc.nextInt();\n }\n int q = sc.nextInt(... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] S = new int[n];
for (int i = 0; i < n; i++) {
S[i] = sc.nextInt();
}
int q = sc.nextInt();
int ... |
[
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,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
0,
13,
4,
18,
13,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
105,
5
],
[
105,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
8,
14
],
... | [
"import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner tx = new Scanner(System.in);\n\n int a, b,c, cont = 0;\n\n a = tx.nextInt();\n int arre[] = new int[a];\n for (int i = 0; i < a; i++) {\n arre[i]=tx.nextInt();\n ... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner tx = new Scanner(System.in);
int a, b,c, cont = 0;
a = tx.nextInt();
int arre[] = new int[a];
for (int i = 0; i < a; i++) {
arre[i]=tx.nextInt();
}
b... |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
4,
13,
23,
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,
... | [
[
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
],
[
109,
14
],
... | [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tALDS1_4_B();\n\t}\n\n\tpublic static void ALDS1_4_B() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint ans = 0;\n\t\tint n ... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Main {
public static void main(String[] args) {
ALDS1_4_B();
}
public static void ALDS1_4_B() {
Scanner sc = new Scanner(System.in);
int ans = 0;
int n = sc.nextInt();
int[] S = n... |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
41,
13,
12,
13,
30,
41,
13,
17,
41,
13,
4,
18,
13,
42,
2,
13,
13,
30,
41,
13,
2,
2,
13,
13,
17,
14,
2,
4,
18,
4,
18,
13,
13,
13,
30,
40,
13,
3,
14,
2,
13,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
146,
11
],
[
146,
12
],
[
12,
13
],
[
146,
14
]... | [
"import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\tstatic List<Integer> s;\n\tstatic int count;\n\n\tpublic static void binarySearch(int value) {\n\t\tint left = 0, right = s.size();\n\t\twhile (left < right) {\n\t\t\tint mid = (left + right) / 2;\n\t\t\tif (s.... | import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
static List<Integer> s;
static int count;
public static void binarySearch(int value) {
int left = 0, right = s.size();
while (left < right) {
int mid = (left + right) / 2;
if (s.get(mid).intValue() == value) ... |
[
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,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
172,
5
],
[
172,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"import java.util.Scanner;\n\npublic class Main {\n public static void main(final String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] S = new int[n];\n for (int i = 0; i < n; i++) {\n S[i] = sc.nextInt();\n }\n int q = sc.nextInt();\n int[] T = new int[... | import java.util.Scanner;
public class Main {
public static void main(final String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] S = new int[n];
for (int i = 0; i < n; i++) {
S[i] = sc.nextInt();
}
int q = sc.nextInt();
int[] T = new int[q];
for (int... |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
17,
41,
13,
39,
40,
17,
17,
17,
17,
41,
13,
39,
17,
17,
17,
40,
17,
12,
13,
30,
41,
13,
20,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
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
],
[
659,
14
],
... | [
"import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\npublic class Main {\n\tstatic long MOD=1000000007;\n\tstatic int[] dx= {-1,1,0,0};\n\tstatic int[] dy= {0,0,1,-1};\n\tpublic static void main(String[] args){\n\t\tPrintWriter out = new PrintWriter(System.out... | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
public class Main {
static long MOD=1000000007;
static int[] dx= {-1,1,0,0};
static int[] dy= {0,0,1,-1};
public static void main(String[] args){
PrintWriter out = new PrintWriter(System.out);
InputReader sc=... |
[
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,
4,
18,
13,
41,
13,
20,
13,
11,
1,
41,
13,
17... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
104,
5
],
[
104,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"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 = scanner.nextInt();\n int[] s = new int[n];\n for (int i = 0; i < n; i++) {\n s[i] = scanner.nextInt();\n }\n in... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] s = new int[n];
for (int i = 0; i < n; i++) {
s[i] = scanner.nextInt();
}
int q = scanner.ne... |
[
7,
15,
13,
17,
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,
4,
18,
13,
41,
13,
2... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
163,
11
],
[
163,
12
],
[
12,
13
],
[
12,
14
],... | [
"\nimport java.util.Arrays;\nimport java.util.Scanner;\n\nimport javax.sound.midi.MidiChannel;\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[] S = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tS[i] = sca... |
import java.util.Arrays;
import java.util.Scanner;
import javax.sound.midi.MidiChannel;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int[] S = new int[n];
for (int i = 0; i < n; i++) {
S[i] = scan.nextInt();
}
int q = sca... |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
4,
18,
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,
0,
18,
13,
13,
4,
18,
13,
4... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
240,
8
],
[
240,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
]... | [
"import java.util.*;\nimport java.io.*;\n\npublic class Main {\n \n public static void main(String[] args) {\n Main main = new Main();\n main.solv();\n }\n \n private void solv() {\n Scanner input = new Scanner(System.in);\n \n int n = input.nextInt();\n int[... | import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) {
Main main = new Main();
main.solv();
}
private void solv() {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int[] S = new int[n];
... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
17,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
18,
13,
18,
13,
13,
41,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
376,
5
],
[
376,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"import java.io.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\t\n\t\t\tint n=Integer.parseInt(br.readLine());\n String[] str=br.readLine().split(\" \");\n ... | import java.io.*;
public class Main {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n=Integer.parseInt(br.readLine());
String[] str=br.readLine().split(" ");
int[] S=new int[n];
... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
17,
41,
13,
18,
13,
13,
42,
2,
13,
13,
30,
41,
13,
2,
2,
13,
13,
17,
41,
13,
18,
13,
13,
14,
2,
13,
13,
29,
17,
14,
2,
13,
13,
0,
13,
2,
13,
17,
0,
13,
13,
29,
17,
23... | [
[
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
],
[... | [
"import java.util.Scanner;\n\nclass Main{\n\n static boolean binarySearch(int[] a, int x){\n int left = 0;\n int right = a.length;\n\n while(left < right){\n int k = (left + right) / 2;\n int w = a[k];\n if(w == x)\n return true;\n else if(x > w)\n left = k + 1;\n el... | import java.util.Scanner;
class Main{
static boolean binarySearch(int[] a, int x){
int left = 0;
int right = a.length;
while(left < right){
int k = (left + right) / 2;
int w = a[k];
if(w == x)
return true;
else if(x > w)
left = k + 1;
else
right = k... |
[
7,
15,
13,
17,
6,
13,
41,
13,
17,
41,
13,
20,
17,
41,
13,
17,
41,
13,
20,
17,
12,
13,
30,
41,
13,
20,
0,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
0,
13,
4,
18,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
185,
5
],
[
185,
6
],
[
6,
7
],
[
6,
8
],
[
185,
9
],
[
9,
10
],
[
9,
11
],
[
185,
13
],
[
13,
14
],
[
13,
15
... | [
"import java.util.*;\n\npublic class Main {\n public static int n = 0;\n public static int[] data = new int[100000];\n public static int q = 0;\n public static int[] targets = new int[50000];\n\n public static void main(String[] args) {\n Scanner num = new Scanner(System.in);\n n = num.... | import java.util.*;
public class Main {
public static int n = 0;
public static int[] data = new int[100000];
public static int q = 0;
public static int[] targets = new int[50000];
public static void main(String[] args) {
Scanner num = new Scanner(System.in);
n = num.nextInt();
... |
[
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,
4,
18,
13,
41,
13,
20,
13,
11,
1... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
123,
8
],
[
123,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
]... | [
"import java.io.*;\nimport java.util.*;\n\n\n\npublic class Main{\n public static void main(String[] args)throws IOException{\n //BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n //String str;\n Scanner sc = new Scanner(System.in);\n\n int n = sc.nextInt();\... | import java.io.*;
import java.util.*;
public class Main{
public static void main(String[] args)throws IOException{
//BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
//String str;
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[]S =... |
[
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,
14,
2,
4,
13,
13,
18,
13,
13,
17,
30,
40,
13,
29,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
17,
41,
13,
2,
... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
211,
5
],
[
211,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
13,
14
],... | [
"\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static int callBinarySearch(int[] first, int[] second) {\n\t\tint output = 0;\n\n\t\tfor(int j = 0 ;j < second.length;j++) {\n\t\t\tif(binarySearch(first,second[j]) == 1) {\n\t\t\t\toutput++;\n\t\t\t}\n\t\t}\n\t\treturn output;\n\t}\n\n\tpublic static ... |
import java.util.Scanner;
public class Main {
public static int callBinarySearch(int[] first, int[] second) {
int output = 0;
for(int j = 0 ;j < second.length;j++) {
if(binarySearch(first,second[j]) == 1) {
output++;
}
}
return output;
}
public static int binarySearch(int[] array, int x) {
... |
[
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,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
143,
5
],
[
143,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"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 = scanner.nextInt();\n int[] S = new int[n];\n for (int i = 0; i < n; i++) {\n S[i] = scanner.nextInt();\n }\n int ... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] S = new int[n];
for (int i = 0; i < n; i++) {
S[i] = scanner.nextInt();
}
int q = scanner.nex... |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
29,
4,
18,
13,
13,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
13,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
17,
41,
13,
4,
13,
4,
18,
13,
41,
13,
4,
18,
4,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
160,
11
],
[
160,
12
],
[
12,
13
],
[
12,
14
],... | [
"import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\n\n/**\n * Created by ??\\??? on 2016/12/7.\n */\npublic class Main {\n static int si(String s){\n return Integer.parseInt(s);\n }\n static void run(String[] args) throws Exception{\n BufferedReade... | import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
/**
* Created by ??\??? on 2016/12/7.
*/
public class Main {
static int si(String s){
return Integer.parseInt(s);
}
static void run(String[] args) throws Exception{
BufferedReader scan = new Buffe... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
20,
2,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
128,
5
],
[
128,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],... | [
"\nimport 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 n = sc.nextInt();\n int[] s = new int[n + 1];\n for (int i = 0; i < n; i++) {\n s[i] = sc.nextInt();\n }\n\n int q ... |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] s = new int[n + 1];
for (int i = 0; i < n; i++) {
s[i] = sc.nextInt();
}
int q = sc.nextInt();
... |
[
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,
41,
13,
4,
18,
13,
11,
1,
41... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
191,
8
],
[
191,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
]... | [
"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n MyScanner sc = new MyScanner();\n\n int n = sc.nextInt();\n int[] s = new int[n];\n for (int i = 0; i < n; i++) {\n s[i] = sc.nextInt();\n }\n\n int ans... | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
MyScanner sc = new MyScanner();
int n = sc.nextInt();
int[] s = new int[n];
for (int i = 0; i < n; i++) {
s[i] = sc.nextInt();
}
int ans = 0;
int ... |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
2,
13,
2,
2,
13,
13,
17,
14,
2,
13,
13,
30,
29,
17,
14,
2,
18,
13,
13,
13,
30,
29,
4,
13,
13,
13,
13,
2,
13,
17,
14,
2,
18,
13,
13,
13,
30,
29,
4,
13,
13,
13,
2,
13,
... | [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
187,
5
],
[
187,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
11,
13
],
[
13,
14
]... | [
"import java.util.Scanner;\n\npublic class Main {\n\t\n\tpublic static Boolean search(int[] S, int t, int low, int high) {\n\t\tint mid = low + (high-low)/2; // initializing middle value to search\n\t\tif (high < low) {\n\t\t\treturn false; // the algorithm has iterated through without finding t\n\t\t\t}\n\t\tif ... | import java.util.Scanner;
public class Main {
public static Boolean search(int[] S, int t, int low, int high) {
int mid = low + (high-low)/2; // initializing middle value to search
if (high < low) {
return false; // the algorithm has iterated through without finding t
}
if (S[mid] > t) {
return sea... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.