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,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
2,
13,
13,
17,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
2,
13,
13,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
0,
13,
17,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
113,
5
],
[
113,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
25,
26
],
[
8,
27
],
[
27,
28
],
[
27,
29
],
[
29,
30
],
[
30,
31
],
[
8,
32
],
[
32,
33
],
[
32,
34
],
[
8,
35
],
[
35,
36
],
[
35,
37
],
[
37,
38
],
[
37,
39
],
[
8,
40
],
[
40,
41
],
[
41,
42
],
[
42,
43
],
[
42,
44
],
[
40,
45
],
[
45,
46
],
[
45,
47
],
[
47,
48
],
[
48,
49
],
[
48,
50
],
[
47,
51
],
[
40,
52
],
[
52,
53
],
[
53,
54
],
[
40,
55
],
[
56,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
59,
60
],
[
60,
61
],
[
59,
62
],
[
59,
63
],
[
63,
64
],
[
63,
65
],
[
56,
66
],
[
66,
67
],
[
67,
68
],
[
68,
69
],
[
68,
70
],
[
66,
71
],
[
71,
72
],
[
71,
73
],
[
73,
74
],
[
74,
75
],
[
66,
76
],
[
76,
77
],
[
77,
78
],
[
66,
79
],
[
80,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
83,
84
],
[
84,
85
],
[
83,
86
],
[
82,
87
],
[
87,
88
],
[
88,
89
],
[
87,
90
],
[
81,
91
],
[
91,
92
],
[
92,
93
],
[
56,
94
],
[
94,
95
],
[
94,
96
],
[
96,
97
],
[
97,
98
],
[
96,
99
],
[
96,
100
],
[
56,
101
],
[
101,
102
],
[
101,
103
],
[
8,
104
],
[
104,
105
],
[
105,
106
],
[
106,
107
],
[
106,
108
],
[
104,
109
],
[
6,
110
],
[
110,
111
],
[
0,
112
],
[
112,
113
],
[
112,
114
]
]
| [
"\nimport java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\nString s=sc.next();\nString t=sc.next();\nint n=s.length();\nint m=t.length();\nint count=0;\nint ans=Integer.MAX_VALUE;\n\tfor(int i=0;i<n-m+1;i++) {\n\t\tString ss=s.substring(i,i+m);\n\t\tfor(int j=0;j<ss.length();j++) {\n\t\t\tif(ss.charAt(j)!=t.charAt(j)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tans=Math.min(ans,count);\n\t\tcount=0;\n\t}\n\tSystem.out.println(ans);\n\n\t}\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\nString s=sc.next();\nString t=sc.next();\nint n=s.length();\nint m=t.length();\nint count=0;\nint ans=Integer.MAX_VALUE;\n\tfor(int i=0;i<n-m+1;i++) {\n\t\tString ss=s.substring(i,i+m);\n\t\tfor(int j=0;j<ss.length();j++) {\n\t\t\tif(ss.charAt(j)!=t.charAt(j)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tans=Math.min(ans,count);\n\t\tcount=0;\n\t}\n\tSystem.out.println(ans);\n\n\t}\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\nString s=sc.next();\nString t=sc.next();\nint n=s.length();\nint m=t.length();\nint count=0;\nint ans=Integer.MAX_VALUE;\n\tfor(int i=0;i<n-m+1;i++) {\n\t\tString ss=s.substring(i,i+m);\n\t\tfor(int j=0;j<ss.length();j++) {\n\t\t\tif(ss.charAt(j)!=t.charAt(j)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tans=Math.min(ans,count);\n\t\tcount=0;\n\t}\n\tSystem.out.println(ans);\n\n\t}",
"main",
"{\n\t\tScanner sc=new Scanner(System.in);\nString s=sc.next();\nString t=sc.next();\nint n=s.length();\nint m=t.length();\nint count=0;\nint ans=Integer.MAX_VALUE;\n\tfor(int i=0;i<n-m+1;i++) {\n\t\tString ss=s.substring(i,i+m);\n\t\tfor(int j=0;j<ss.length();j++) {\n\t\t\tif(ss.charAt(j)!=t.charAt(j)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tans=Math.min(ans,count);\n\t\tcount=0;\n\t}\n\tSystem.out.println(ans);\n\n\t}",
"Scanner sc=new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String s=sc.next();",
"s",
"sc.next()",
"sc.next",
"sc",
"String t=sc.next();",
"t",
"sc.next()",
"sc.next",
"sc",
"int n=s.length();",
"n",
"s.length()",
"s.length",
"s",
"int m=t.length();",
"m",
"t.length()",
"t.length",
"t",
"int count=0;",
"count",
"0",
"int ans=Integer.MAX_VALUE;",
"ans",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"for(int i=0;i<n-m+1;i++) {\n\t\tString ss=s.substring(i,i+m);\n\t\tfor(int j=0;j<ss.length();j++) {\n\t\t\tif(ss.charAt(j)!=t.charAt(j)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tans=Math.min(ans,count);\n\t\tcount=0;\n\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n-m+1",
"i",
"n-m+1",
"n-m",
"n",
"m",
"1",
"i++",
"i++",
"i",
"{\n\t\tString ss=s.substring(i,i+m);\n\t\tfor(int j=0;j<ss.length();j++) {\n\t\t\tif(ss.charAt(j)!=t.charAt(j)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tans=Math.min(ans,count);\n\t\tcount=0;\n\t}",
"{\n\t\tString ss=s.substring(i,i+m);\n\t\tfor(int j=0;j<ss.length();j++) {\n\t\t\tif(ss.charAt(j)!=t.charAt(j)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tans=Math.min(ans,count);\n\t\tcount=0;\n\t}",
"String ss=s.substring(i,i+m);",
"ss",
"s.substring(i,i+m)",
"s.substring",
"s",
"i",
"i+m",
"i",
"m",
"for(int j=0;j<ss.length();j++) {\n\t\t\tif(ss.charAt(j)!=t.charAt(j)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"int j=0;",
"int j=0;",
"j",
"0",
"j<ss.length()",
"j",
"ss.length()",
"ss.length",
"ss",
"j++",
"j++",
"j",
"{\n\t\t\tif(ss.charAt(j)!=t.charAt(j)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"{\n\t\t\tif(ss.charAt(j)!=t.charAt(j)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"if(ss.charAt(j)!=t.charAt(j)) {\n\t\t\t\tcount++;\n\t\t\t}",
"ss.charAt(j)!=t.charAt(j)",
"ss.charAt(j)",
"ss.charAt",
"ss",
"j",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"{\n\t\t\t\tcount++;\n\t\t\t}",
"count++",
"count",
"ans=Math.min(ans,count)",
"ans",
"Math.min(ans,count)",
"Math.min",
"Math",
"ans",
"count",
"count=0",
"count",
"0",
"System.out.println(ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"ans",
"String[] args",
"args",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\nString s=sc.next();\nString t=sc.next();\nint n=s.length();\nint m=t.length();\nint count=0;\nint ans=Integer.MAX_VALUE;\n\tfor(int i=0;i<n-m+1;i++) {\n\t\tString ss=s.substring(i,i+m);\n\t\tfor(int j=0;j<ss.length();j++) {\n\t\t\tif(ss.charAt(j)!=t.charAt(j)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tans=Math.min(ans,count);\n\t\tcount=0;\n\t}\n\tSystem.out.println(ans);\n\n\t}\n}",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\nString s=sc.next();\nString t=sc.next();\nint n=s.length();\nint m=t.length();\nint count=0;\nint ans=Integer.MAX_VALUE;\n\tfor(int i=0;i<n-m+1;i++) {\n\t\tString ss=s.substring(i,i+m);\n\t\tfor(int j=0;j<ss.length();j++) {\n\t\t\tif(ss.charAt(j)!=t.charAt(j)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\tans=Math.min(ans,count);\n\t\tcount=0;\n\t}\n\tSystem.out.println(ans);\n\n\t}\n}",
"Main"
]
|
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String s=sc.next();
String t=sc.next();
int n=s.length();
int m=t.length();
int count=0;
int ans=Integer.MAX_VALUE;
for(int i=0;i<n-m+1;i++) {
String ss=s.substring(i,i+m);
for(int j=0;j<ss.length();j++) {
if(ss.charAt(j)!=t.charAt(j)) {
count++;
}
}
ans=Math.min(ans,count);
count=0;
}
System.out.println(ans);
}
} |
[
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,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
30,
40,
13,
0,
13,
4,
13,
13,
13,
4,
13,
13,
23,
13,
12,
13,
30,
29,
4,
13,
13,
17,
18,
13,
13,
13,
23,
13,
23,
13,
12,
13,
30,
14,
2,
2,
13,
13,
17,
30,
14,
2,
18,
13,
13,
13,
29,
13,
29,
13,
41,
13,
2,
2,
13,
13,
17,
14,
2,
18,
13,
13,
13,
30,
29,
4,
13,
13,
13,
13,
13,
30,
29,
4,
13,
13,
13,
13,
13,
23,
13,
23,
13,
23,
13,
23,
13,
12,
13,
30,
14,
2,
2,
13,
13,
17,
30,
14,
2,
4,
18,
13,
18,
13,
13,
13,
17,
29,
13,
29,
13,
41,
13,
2,
2,
13,
13,
17,
14,
2,
4,
18,
13,
18,
13,
13,
13,
17,
30,
29,
4,
13,
13,
13,
13,
13,
13,
30,
29,
4,
13,
13,
13,
13,
13,
13,
23,
13,
23,
13,
23,
13,
23,
13,
23,
13,
12,
13,
30,
29,
4,
13,
13,
17,
18,
13,
13,
13,
23,
13,
23,
13,
12,
13,
30,
14,
2,
2,
13,
13,
17,
30,
14,
2,
18,
13,
13,
13,
29,
13,
29,
13,
41,
13,
2,
2,
13,
13,
17,
14,
2,
18,
13,
13,
13,
30,
29,
4,
13,
13,
13,
13,
13,
30,
29,
4,
13,
13,
13,
13,
13,
23,
13,
23,
13,
23,
13,
23,
13,
12,
13,
30,
14,
2,
2,
13,
13,
17,
30,
14,
2,
4,
18,
13,
18,
13,
13,
13,
17,
29,
13,
29,
13,
41,
13,
2,
2,
13,
13,
17,
14,
2,
4,
18,
13,
18,
13,
13,
13,
17,
30,
29,
4,
13,
13,
13,
13,
13,
13,
30,
29,
4,
13,
13,
13,
13,
13,
13,
23,
13,
23,
13,
23,
13,
23,
13,
23,
13,
12,
13,
30,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
4,
18,
18,
13,
13,
6,
13,
41,
13,
18,
13,
13,
41,
13,
20,
17,
41,
13,
17,
41,
13,
17,
12,
13,
30,
14,
2,
13,
13,
30,
29,
17,
30,
0,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
13,
14,
2,
13,
17,
30,
29,
17,
29,
17,
12,
13,
30,
14,
4,
13,
29,
18,
13,
40,
13,
29,
40,
17,
12,
13,
30,
29,
2,
2,
17,
13,
2,
13,
17,
23,
13,
12,
13,
30,
42,
2,
4,
13,
40,
4,
13,
18,
13,
13,
40,
13,
29,
4,
13,
12,
13,
30,
14,
40,
4,
13,
37,
20,
41,
13,
20,
41,
13,
4,
13,
42,
4,
13,
13,
30,
4,
18,
13,
13,
0,
13,
4,
13,
29,
4,
18,
13,
12,
13,
30,
14,
40,
4,
13,
37,
20,
41,
13,
17,
41,
13,
17,
41,
13,
4,
13,
14,
2,
13,
17,
30,
0,
13,
17,
0,
13,
4,
13,
14,
2,
2,
13,
17,
2,
17,
13,
30,
37,
20,
42,
17,
30,
14,
2,
2,
17,
13,
2,
13,
17,
30,
0,
13,
17,
0,
13,
2,
13,
17,
14,
2,
2,
13,
40,
17,
40,
4,
13,
13,
30,
29,
8,
13,
40,
13,
13,
30,
37,
20,
0,
13,
4,
13,
12,
13,
30,
41,
13,
4,
13,
14,
2,
2,
13,
18,
13,
13,
2,
13,
18,
13,
13,
37,
20,
29,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
6,
13,
41,
13,
41,
13,
41,
13,
20,
12,
13,
30,
0,
18,
36,
13,
13,
0,
18,
36,
13,
13,
23,
13,
23,
13,
12,
13,
30,
29,
13,
12,
13,
30,
29,
13,
12,
13,
30,
29,
2,
13,
13,
12,
13,
30,
41,
13,
4,
18,
33,
13,
14,
2,
4,
18,
13,
4,
18,
36,
30,
29,
17,
41,
13,
13,
14,
2,
2,
18,
36,
13,
18,
13,
13,
2,
18,
36,
13,
18,
13,
13,
29,
17,
29,
17,
23,
13,
12,
13,
30,
29,
4,
18,
13,
17,
13,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
18,
36,
13,
13,
0,
18,
36,
13,
13,
23,
13,
23,
13,
12,
13,
30,
29,
13,
12,
13,
30,
29,
13,
12,
13,
30,
29,
2,
4,
18,
13,
4,
18,
13,
12,
13,
30,
14,
2,
4,
18,
13,
4,
18,
36,
30,
29,
17,
41,
13,
13,
29,
2,
4,
18,
18,
13,
13,
18,
36,
13,
4,
18,
18,
13,
13,
18,
36,
13,
23,
13,
12,
13,
30,
29,
4,
18,
13,
17,
13,
13,
6,
13,
12,
13,
30,
14,
2,
2,
13,
13,
17,
29,
13,
29,
4,
13,
13,
2,
13,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
4,
13,
13,
13,
41,
13,
2,
13,
13,
29,
2,
13,
13,
23,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
29,
40,
17,
41,
13,
17,
11,
1,
41,
13,
13,
2,
13,
17,
1,
40,
13,
30,
30,
0,
13,
13,
0,
13,
13,
29,
13,
23,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
41,
13,
20,
41,
13,
17,
41,
13,
17,
42,
2,
13,
4,
18,
13,
30,
42,
2,
2,
13,
2,
4,
18,
13,
17,
4,
18,
4,
18,
13,
13,
2,
13,
17,
30,
40,
13,
4,
18,
13,
4,
18,
13,
13,
2,
2,
13,
13,
17,
40,
13,
0,
13,
13,
29,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
41,
13,
20,
41,
13,
17,
41,
13,
17,
42,
2,
13,
18,
13,
13,
30,
42,
2,
2,
13,
2,
18,
13,
13,
17,
2,
18,
13,
13,
18,
13,
2,
13,
17,
30,
40,
13,
4,
18,
13,
18,
13,
13,
2,
2,
13,
13,
17,
40,
13,
0,
13,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
4,
18,
13,
29,
4,
13,
13,
23,
13,
12,
13,
30,
41,
13,
20,
4,
18,
13,
4,
18,
13,
42,
4,
18,
13,
30,
4,
18,
13,
17,
4,
18,
13,
4,
18,
13,
29,
4,
18,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
2,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
42,
2,
2,
13,
13,
17,
30,
40,
18,
13,
13,
0,
13,
13,
29,
13,
23,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
16,
17
],
[
16,
18
],
[
0,
19
],
[
19,
20
],
[
19,
21
],
[
0,
22
],
[
22,
23
],
[
22,
24
],
[
0,
25
],
[
25,
26
],
[
25,
27
],
[
0,
28
],
[
28,
29
],
[
28,
30
],
[
0,
31
],
[
31,
32
],
[
31,
33
],
[
0,
34
],
[
1180,
35
],
[
1180,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
39,
41
],
[
38,
42
],
[
42,
43
],
[
42,
44
],
[
44,
45
],
[
45,
46
],
[
38,
47
],
[
47,
48
],
[
47,
49
],
[
49,
50
],
[
50,
51
],
[
38,
52
],
[
52,
53
],
[
52,
54
],
[
54,
55
],
[
54,
56
],
[
38,
57
],
[
57,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
57,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
65,
66
],
[
66,
67
],
[
64,
68
],
[
68,
69
],
[
69,
70
],
[
57,
71
],
[
71,
72
],
[
72,
73
],
[
57,
74
],
[
75,
75
],
[
75,
76
],
[
76,
77
],
[
76,
78
],
[
75,
79
],
[
79,
80
],
[
80,
81
],
[
81,
82
],
[
81,
83
],
[
79,
84
],
[
84,
85
],
[
84,
86
],
[
86,
87
],
[
87,
88
],
[
79,
89
],
[
89,
90
],
[
90,
91
],
[
79,
92
],
[
93,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
96,
99
],
[
99,
100
],
[
99,
101
],
[
95,
102
],
[
102,
103
],
[
103,
104
],
[
102,
105
],
[
94,
106
],
[
106,
107
],
[
107,
108
],
[
75,
109
],
[
109,
110
],
[
109,
111
],
[
111,
112
],
[
111,
113
],
[
111,
114
],
[
38,
115
],
[
115,
116
],
[
115,
117
],
[
36,
118
],
[
118,
119
],
[
1180,
120
],
[
120,
121
],
[
120,
122
],
[
122,
123
],
[
123,
124
],
[
124,
125
],
[
124,
126
],
[
124,
127
],
[
124,
128
],
[
128,
129
],
[
128,
130
],
[
124,
131
],
[
120,
132
],
[
132,
133
],
[
120,
134
],
[
134,
135
],
[
1180,
136
],
[
136,
137
],
[
136,
138
],
[
138,
139
],
[
139,
140
],
[
140,
141
],
[
141,
142
],
[
141,
143
],
[
140,
144
],
[
139,
145
],
[
145,
146
],
[
146,
147
],
[
147,
148
],
[
148,
149
],
[
148,
150
],
[
147,
151
],
[
146,
152
],
[
152,
153
],
[
145,
154
],
[
154,
155
],
[
138,
156
],
[
156,
157
],
[
156,
158
],
[
158,
159
],
[
159,
160
],
[
159,
161
],
[
158,
162
],
[
138,
163
],
[
163,
164
],
[
164,
165
],
[
165,
166
],
[
165,
167
],
[
164,
168
],
[
163,
169
],
[
169,
170
],
[
170,
171
],
[
171,
172
],
[
171,
173
],
[
171,
174
],
[
171,
175
],
[
171,
176
],
[
163,
177
],
[
177,
178
],
[
178,
179
],
[
179,
180
],
[
179,
181
],
[
179,
182
],
[
179,
183
],
[
179,
184
],
[
136,
185
],
[
185,
186
],
[
136,
187
],
[
187,
188
],
[
136,
189
],
[
189,
190
],
[
136,
191
],
[
191,
192
],
[
1180,
193
],
[
193,
194
],
[
193,
195
],
[
195,
196
],
[
196,
197
],
[
197,
198
],
[
198,
199
],
[
198,
200
],
[
197,
201
],
[
196,
202
],
[
202,
203
],
[
203,
204
],
[
204,
205
],
[
205,
206
],
[
206,
207
],
[
205,
208
],
[
208,
209
],
[
208,
210
],
[
205,
211
],
[
204,
212
],
[
203,
213
],
[
213,
214
],
[
202,
215
],
[
215,
216
],
[
195,
217
],
[
217,
218
],
[
217,
219
],
[
219,
220
],
[
220,
221
],
[
220,
222
],
[
219,
223
],
[
195,
224
],
[
224,
225
],
[
225,
226
],
[
226,
227
],
[
227,
228
],
[
226,
229
],
[
229,
230
],
[
229,
231
],
[
226,
232
],
[
225,
233
],
[
224,
234
],
[
234,
235
],
[
235,
236
],
[
236,
237
],
[
236,
238
],
[
236,
239
],
[
236,
240
],
[
236,
241
],
[
236,
242
],
[
224,
243
],
[
243,
244
],
[
244,
245
],
[
245,
246
],
[
245,
247
],
[
245,
248
],
[
245,
249
],
[
245,
250
],
[
245,
251
],
[
193,
252
],
[
252,
253
],
[
193,
254
],
[
254,
255
],
[
193,
256
],
[
256,
257
],
[
193,
258
],
[
258,
259
],
[
193,
260
],
[
260,
261
],
[
1180,
262
],
[
262,
263
],
[
262,
264
],
[
264,
265
],
[
265,
266
],
[
266,
267
],
[
266,
268
],
[
266,
269
],
[
266,
270
],
[
270,
271
],
[
270,
272
],
[
266,
273
],
[
262,
274
],
[
274,
275
],
[
262,
276
],
[
276,
277
],
[
1180,
278
],
[
278,
279
],
[
278,
280
],
[
280,
281
],
[
281,
282
],
[
282,
283
],
[
283,
284
],
[
283,
285
],
[
282,
286
],
[
281,
287
],
[
287,
288
],
[
288,
289
],
[
289,
290
],
[
290,
291
],
[
290,
292
],
[
289,
293
],
[
288,
294
],
[
294,
295
],
[
287,
296
],
[
296,
297
],
[
280,
298
],
[
298,
299
],
[
298,
300
],
[
300,
301
],
[
301,
302
],
[
301,
303
],
[
300,
304
],
[
280,
305
],
[
305,
306
],
[
306,
307
],
[
307,
308
],
[
307,
309
],
[
306,
310
],
[
305,
311
],
[
311,
312
],
[
312,
313
],
[
313,
314
],
[
313,
315
],
[
313,
316
],
[
313,
317
],
[
313,
318
],
[
305,
319
],
[
319,
320
],
[
320,
321
],
[
321,
322
],
[
321,
323
],
[
321,
324
],
[
321,
325
],
[
321,
326
],
[
278,
327
],
[
327,
328
],
[
278,
329
],
[
329,
330
],
[
278,
331
],
[
331,
332
],
[
278,
333
],
[
333,
334
],
[
1180,
335
],
[
335,
336
],
[
335,
337
],
[
337,
338
],
[
338,
339
],
[
339,
340
],
[
340,
341
],
[
340,
342
],
[
339,
343
],
[
338,
344
],
[
344,
345
],
[
345,
346
],
[
346,
347
],
[
347,
348
],
[
348,
349
],
[
347,
350
],
[
350,
351
],
[
350,
352
],
[
347,
353
],
[
346,
354
],
[
345,
355
],
[
355,
356
],
[
344,
357
],
[
357,
358
],
[
337,
359
],
[
359,
360
],
[
359,
361
],
[
361,
362
],
[
362,
363
],
[
362,
364
],
[
361,
365
],
[
337,
366
],
[
366,
367
],
[
367,
368
],
[
368,
369
],
[
369,
370
],
[
368,
371
],
[
371,
372
],
[
371,
373
],
[
368,
374
],
[
367,
375
],
[
366,
376
],
[
376,
377
],
[
377,
378
],
[
378,
379
],
[
378,
380
],
[
378,
381
],
[
378,
382
],
[
378,
383
],
[
378,
384
],
[
366,
385
],
[
385,
386
],
[
386,
387
],
[
387,
388
],
[
387,
389
],
[
387,
390
],
[
387,
391
],
[
387,
392
],
[
387,
393
],
[
335,
394
],
[
394,
395
],
[
335,
396
],
[
396,
397
],
[
335,
398
],
[
398,
399
],
[
335,
400
],
[
400,
401
],
[
335,
402
],
[
402,
403
],
[
1180,
404
],
[
404,
405
],
[
404,
406
],
[
406,
407
],
[
407,
408
],
[
408,
409
],
[
409,
410
],
[
409,
411
],
[
407,
412
],
[
404,
413
],
[
413,
414
],
[
1180,
415
],
[
415,
416
],
[
415,
417
],
[
417,
418
],
[
418,
419
],
[
419,
420
],
[
420,
421
],
[
420,
422
],
[
418,
423
],
[
415,
424
],
[
424,
425
],
[
1180,
426
],
[
426,
427
],
[
426,
428
],
[
428,
429
],
[
429,
430
],
[
430,
431
],
[
431,
432
],
[
431,
433
],
[
1180,
434
],
[
434,
435
],
[
434,
436
],
[
436,
437
],
[
436,
438
],
[
438,
439
],
[
438,
440
],
[
434,
441
],
[
441,
442
],
[
441,
443
],
[
434,
445
],
[
445,
446
],
[
445,
447
],
[
434,
448
],
[
448,
449
],
[
448,
450
],
[
434,
451
],
[
451,
452
],
[
451,
453
],
[
453,
454
],
[
454,
455
],
[
455,
456
],
[
455,
457
],
[
454,
458
],
[
458,
459
],
[
459,
460
],
[
454,
461
],
[
461,
462
],
[
462,
463
],
[
462,
464
],
[
461,
465
],
[
465,
466
],
[
466,
467
],
[
466,
468
],
[
468,
469
],
[
469,
470
],
[
470,
471
],
[
465,
472
],
[
472,
473
],
[
473,
474
],
[
473,
475
],
[
475,
476
],
[
476,
477
],
[
475,
478
],
[
461,
479
],
[
479,
480
],
[
480,
481
],
[
480,
482
],
[
479,
483
],
[
483,
484
],
[
484,
485
],
[
453,
486
],
[
486,
487
],
[
434,
488
],
[
488,
489
],
[
488,
490
],
[
490,
491
],
[
491,
492
],
[
492,
493
],
[
491,
494
],
[
494,
495
],
[
495,
496
],
[
495,
497
],
[
497,
498
],
[
491,
499
],
[
499,
500
],
[
500,
501
],
[
434,
502
],
[
502,
503
],
[
502,
504
],
[
504,
505
],
[
505,
506
],
[
506,
507
],
[
507,
508
],
[
507,
509
],
[
506,
510
],
[
510,
511
],
[
510,
512
],
[
502,
513
],
[
513,
514
],
[
434,
515
],
[
515,
516
],
[
515,
517
],
[
517,
518
],
[
518,
519
],
[
519,
520
],
[
520,
521
],
[
519,
522
],
[
522,
523
],
[
523,
524
],
[
523,
525
],
[
525,
526
],
[
525,
527
],
[
518,
528
],
[
528,
529
],
[
517,
530
],
[
530,
531
],
[
531,
532
],
[
434,
533
],
[
533,
534
],
[
533,
535
],
[
535,
536
],
[
536,
537
],
[
537,
538
],
[
538,
539
],
[
536,
540
],
[
540,
541
],
[
535,
542
],
[
542,
543
],
[
542,
544
],
[
535,
545
],
[
545,
546
],
[
545,
547
],
[
547,
548
],
[
535,
549
],
[
549,
550
],
[
550,
551
],
[
550,
552
],
[
549,
553
],
[
553,
554
],
[
554,
555
],
[
555,
556
],
[
554,
557
],
[
553,
558
],
[
558,
559
],
[
558,
560
],
[
560,
561
],
[
535,
562
],
[
562,
563
],
[
563,
564
],
[
564,
565
],
[
434,
566
],
[
566,
567
],
[
566,
568
],
[
568,
569
],
[
569,
570
],
[
570,
571
],
[
571,
572
],
[
569,
573
],
[
573,
574
],
[
568,
575
],
[
575,
576
],
[
575,
577
],
[
568,
578
],
[
578,
579
],
[
578,
580
],
[
568,
581
],
[
581,
582
],
[
581,
583
],
[
583,
584
],
[
568,
585
],
[
585,
586
],
[
586,
587
],
[
586,
588
],
[
585,
589
],
[
589,
590
],
[
590,
591
],
[
590,
592
],
[
589,
593
],
[
593,
594
],
[
593,
595
],
[
595,
596
],
[
568,
597
],
[
597,
598
],
[
598,
599
],
[
599,
600
],
[
599,
601
],
[
598,
602
],
[
602,
603
],
[
602,
604
],
[
597,
605
],
[
605,
606
],
[
606,
607
],
[
568,
608
],
[
608,
609
],
[
608,
610
],
[
610,
611
],
[
611,
612
],
[
612,
613
],
[
613,
614
],
[
613,
615
],
[
612,
616
],
[
616,
617
],
[
616,
618
],
[
611,
619
],
[
619,
620
],
[
620,
621
],
[
620,
622
],
[
619,
623
],
[
623,
624
],
[
623,
625
],
[
625,
626
],
[
625,
627
],
[
611,
628
],
[
628,
629
],
[
629,
630
],
[
630,
631
],
[
630,
632
],
[
632,
633
],
[
629,
634
],
[
634,
635
],
[
635,
636
],
[
635,
637
],
[
628,
638
],
[
638,
639
],
[
639,
640
],
[
640,
641
],
[
640,
642
],
[
642,
643
],
[
640,
644
],
[
628,
645
],
[
645,
646
],
[
646,
647
],
[
610,
648
],
[
648,
649
],
[
648,
650
],
[
650,
651
],
[
434,
652
],
[
652,
653
],
[
652,
654
],
[
654,
655
],
[
655,
656
],
[
655,
657
],
[
657,
658
],
[
654,
659
],
[
659,
660
],
[
660,
661
],
[
661,
662
],
[
661,
663
],
[
663,
664
],
[
663,
665
],
[
660,
666
],
[
666,
667
],
[
666,
668
],
[
668,
669
],
[
668,
670
],
[
659,
671
],
[
671,
672
],
[
654,
673
],
[
673,
674
],
[
434,
675
],
[
675,
676
],
[
675,
677
],
[
677,
678
],
[
678,
679
],
[
679,
680
],
[
680,
681
],
[
679,
682
],
[
682,
683
],
[
1180,
684
],
[
684,
685
],
[
684,
686
],
[
686,
687
],
[
684,
688
],
[
688,
689
],
[
684,
690
],
[
690,
691
],
[
690,
692
],
[
684,
693
],
[
693,
694
],
[
693,
695
],
[
695,
696
],
[
696,
697
],
[
697,
698
],
[
697,
699
],
[
696,
700
],
[
695,
701
],
[
701,
702
],
[
702,
703
],
[
702,
704
],
[
701,
705
],
[
693,
706
],
[
706,
707
],
[
693,
708
],
[
708,
709
],
[
684,
710
],
[
710,
711
],
[
710,
712
],
[
712,
713
],
[
713,
714
],
[
684,
715
],
[
715,
716
],
[
715,
717
],
[
717,
718
],
[
718,
719
],
[
684,
720
],
[
720,
721
],
[
720,
722
],
[
722,
723
],
[
723,
724
],
[
724,
725
],
[
724,
726
],
[
684,
727
],
[
727,
728
],
[
727,
729
],
[
729,
730
],
[
730,
731
],
[
730,
732
],
[
732,
733
],
[
733,
734
],
[
732,
735
],
[
729,
736
],
[
736,
737
],
[
737,
738
],
[
738,
739
],
[
739,
740
],
[
737,
741
],
[
741,
742
],
[
742,
743
],
[
736,
744
],
[
744,
745
],
[
745,
746
],
[
729,
747
],
[
747,
748
],
[
747,
749
],
[
729,
750
],
[
750,
751
],
[
751,
752
],
[
752,
753
],
[
753,
754
],
[
753,
755
],
[
752,
756
],
[
756,
757
],
[
756,
758
],
[
751,
759
],
[
759,
760
],
[
760,
761
],
[
760,
762
],
[
759,
763
],
[
763,
764
],
[
763,
765
],
[
750,
766
],
[
766,
767
],
[
729,
768
],
[
768,
769
],
[
727,
770
],
[
770,
771
],
[
684,
772
],
[
772,
773
],
[
772,
774
],
[
774,
775
],
[
775,
776
],
[
776,
777
],
[
777,
778
],
[
776,
779
],
[
776,
780
],
[
776,
781
],
[
1180,
782
],
[
782,
783
],
[
782,
784
],
[
784,
785
],
[
782,
786
],
[
786,
787
],
[
782,
788
],
[
788,
789
],
[
788,
790
],
[
790,
791
],
[
791,
792
],
[
792,
793
],
[
792,
794
],
[
791,
795
],
[
790,
796
],
[
796,
797
],
[
797,
798
],
[
797,
799
],
[
796,
800
],
[
788,
801
],
[
801,
802
],
[
788,
803
],
[
803,
804
],
[
782,
805
],
[
805,
806
],
[
805,
807
],
[
807,
808
],
[
808,
809
],
[
782,
810
],
[
810,
811
],
[
810,
812
],
[
812,
813
],
[
813,
814
],
[
782,
815
],
[
815,
816
],
[
815,
817
],
[
817,
818
],
[
818,
819
],
[
819,
820
],
[
820,
821
],
[
821,
822
],
[
819,
823
],
[
823,
824
],
[
824,
825
],
[
782,
826
],
[
826,
827
],
[
826,
828
],
[
828,
829
],
[
829,
830
],
[
830,
831
],
[
831,
832
],
[
832,
833
],
[
830,
834
],
[
834,
835
],
[
835,
836
],
[
829,
837
],
[
837,
838
],
[
838,
839
],
[
828,
840
],
[
840,
841
],
[
840,
842
],
[
828,
843
],
[
843,
844
],
[
844,
845
],
[
845,
846
],
[
846,
847
],
[
847,
848
],
[
847,
849
],
[
845,
850
],
[
850,
851
],
[
850,
852
],
[
844,
853
],
[
853,
854
],
[
854,
855
],
[
855,
856
],
[
855,
857
],
[
853,
858
],
[
858,
859
],
[
858,
860
],
[
826,
861
],
[
861,
862
],
[
782,
863
],
[
863,
864
],
[
863,
865
],
[
865,
866
],
[
866,
867
],
[
867,
868
],
[
868,
869
],
[
867,
870
],
[
867,
871
],
[
867,
872
],
[
1180,
873
],
[
873,
874
],
[
873,
875
],
[
875,
876
],
[
875,
877
],
[
877,
878
],
[
878,
879
],
[
879,
880
],
[
880,
881
],
[
880,
882
],
[
879,
883
],
[
878,
884
],
[
884,
885
],
[
877,
886
],
[
886,
887
],
[
887,
888
],
[
887,
889
],
[
887,
890
],
[
890,
891
],
[
890,
892
],
[
875,
893
],
[
893,
894
],
[
875,
895
],
[
895,
896
],
[
873,
897
],
[
897,
898
],
[
897,
899
],
[
899,
900
],
[
900,
901
],
[
900,
902
],
[
902,
903
],
[
902,
904
],
[
902,
905
],
[
899,
906
],
[
906,
907
],
[
906,
908
],
[
908,
909
],
[
908,
910
],
[
899,
911
],
[
911,
912
],
[
912,
913
],
[
912,
914
],
[
897,
915
],
[
915,
916
],
[
897,
917
],
[
917,
918
],
[
873,
919
],
[
919,
920
],
[
919,
921
],
[
921,
922
],
[
922,
923
],
[
923,
924
],
[
923,
925
],
[
922,
926
],
[
926,
927
],
[
927,
928
],
[
921,
929
],
[
929,
930
],
[
929,
931
],
[
921,
932
],
[
932,
933
],
[
933,
934
],
[
934,
935
],
[
934,
936
],
[
932,
937
],
[
937,
938
],
[
937,
939
],
[
932,
940
],
[
940,
941
],
[
941,
942
],
[
932,
943
],
[
944,
944
],
[
944,
945
],
[
945,
946
],
[
945,
947
],
[
944,
948
],
[
948,
949
],
[
948,
950
],
[
921,
951
],
[
951,
952
],
[
919,
953
],
[
953,
954
],
[
919,
955
],
[
955,
956
],
[
873,
957
],
[
957,
958
],
[
957,
959
],
[
959,
960
],
[
960,
961
],
[
961,
962
],
[
960,
963
],
[
959,
964
],
[
964,
965
],
[
964,
966
],
[
959,
967
],
[
967,
968
],
[
967,
969
],
[
959,
970
],
[
970,
971
],
[
970,
972
],
[
959,
973
],
[
973,
974
],
[
974,
975
],
[
974,
976
],
[
976,
977
],
[
977,
978
],
[
973,
979
],
[
979,
980
],
[
980,
981
],
[
981,
982
],
[
982,
983
],
[
982,
984
],
[
984,
985
],
[
985,
986
],
[
986,
987
],
[
984,
988
],
[
981,
989
],
[
989,
990
],
[
990,
991
],
[
991,
992
],
[
992,
993
],
[
991,
994
],
[
989,
995
],
[
995,
996
],
[
995,
997
],
[
980,
998
],
[
998,
999
],
[
999,
1000
],
[
979,
1001
],
[
1001,
1002
],
[
1002,
1003
],
[
1001,
1004
],
[
1004,
1005
],
[
1005,
1006
],
[
1004,
1007
],
[
1001,
1008
],
[
1008,
1009
],
[
1009,
1010
],
[
1009,
1011
],
[
1008,
1012
],
[
979,
1013
],
[
1013,
1014
],
[
979,
1015
],
[
1015,
1016
],
[
1015,
1017
],
[
959,
1018
],
[
1018,
1019
],
[
957,
1020
],
[
1020,
1021
],
[
873,
1022
],
[
1022,
1023
],
[
1022,
1024
],
[
1024,
1025
],
[
1025,
1026
],
[
1026,
1027
],
[
1025,
1028
],
[
1024,
1029
],
[
1029,
1030
],
[
1029,
1031
],
[
1024,
1032
],
[
1032,
1033
],
[
1032,
1034
],
[
1024,
1035
],
[
1035,
1036
],
[
1035,
1037
],
[
1024,
1038
],
[
1038,
1039
],
[
1039,
1040
],
[
1039,
1041
],
[
1041,
1042
],
[
1041,
1043
],
[
1038,
1044
],
[
1044,
1045
],
[
1045,
1046
],
[
1046,
1047
],
[
1047,
1048
],
[
1047,
1049
],
[
1049,
1050
],
[
1050,
1051
],
[
1050,
1052
],
[
1049,
1053
],
[
1046,
1054
],
[
1054,
1055
],
[
1055,
1056
],
[
1055,
1057
],
[
1054,
1058
],
[
1058,
1059
],
[
1058,
1060
],
[
1060,
1061
],
[
1060,
1062
],
[
1045,
1063
],
[
1063,
1064
],
[
1064,
1065
],
[
1044,
1066
],
[
1066,
1067
],
[
1067,
1068
],
[
1066,
1069
],
[
1069,
1070
],
[
1069,
1071
],
[
1066,
1072
],
[
1072,
1073
],
[
1073,
1074
],
[
1073,
1075
],
[
1072,
1076
],
[
1044,
1077
],
[
1077,
1078
],
[
1044,
1079
],
[
1079,
1080
],
[
1079,
1081
],
[
1024,
1082
],
[
1082,
1083
],
[
1022,
1084
],
[
1084,
1085
],
[
873,
1086
],
[
1086,
1087
],
[
1086,
1088
],
[
1088,
1089
],
[
1089,
1090
],
[
1089,
1091
],
[
1091,
1092
],
[
1092,
1093
],
[
1088,
1094
],
[
1094,
1095
],
[
1095,
1096
],
[
1095,
1097
],
[
1086,
1098
],
[
1098,
1099
],
[
873,
1100
],
[
1100,
1101
],
[
1100,
1102
],
[
1102,
1103
],
[
1103,
1104
],
[
1103,
1105
],
[
1102,
1106
],
[
1106,
1107
],
[
1107,
1108
],
[
1106,
1109
],
[
1109,
1110
],
[
1110,
1111
],
[
1102,
1112
],
[
1112,
1113
],
[
1113,
1114
],
[
1114,
1115
],
[
1112,
1116
],
[
1116,
1117
],
[
1117,
1118
],
[
1118,
1119
],
[
1117,
1120
],
[
1116,
1121
],
[
1121,
1122
],
[
1122,
1123
],
[
1121,
1124
],
[
1124,
1125
],
[
1125,
1126
],
[
1102,
1127
],
[
1127,
1128
],
[
1128,
1129
],
[
1129,
1130
],
[
1100,
1131
],
[
1131,
1132
],
[
873,
1133
],
[
1133,
1134
],
[
1133,
1135
],
[
1135,
1136
],
[
1136,
1137
],
[
1136,
1138
],
[
1135,
1140
],
[
1140,
1141
],
[
1141,
1142
],
[
1142,
1143
],
[
1142,
1144
],
[
1140,
1145
],
[
1145,
1146
],
[
1146,
1147
],
[
1146,
1148
],
[
1145,
1149
],
[
1149,
1150
],
[
1149,
1151
],
[
1151,
1152
],
[
1151,
1153
],
[
1140,
1154
],
[
1154,
1155
],
[
1155,
1156
],
[
1140,
1157
],
[
1158,
1158
],
[
1158,
1159
],
[
1159,
1160
],
[
1160,
1161
],
[
1161,
1162
],
[
1161,
1163
],
[
1160,
1164
],
[
1159,
1165
],
[
1165,
1166
],
[
1166,
1167
],
[
1167,
1168
],
[
1167,
1169
],
[
1165,
1170
],
[
1170,
1171
],
[
1170,
1172
],
[
1135,
1173
],
[
1173,
1174
],
[
1133,
1175
],
[
1175,
1176
],
[
1133,
1177
],
[
1177,
1178
],
[
0,
1179
],
[
1179,
1180
],
[
1179,
1181
]
]
| [
"\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.util.*;\nimport java.util.List;\nimport java.util.jar.JarEntry;\nimport java.util.stream.Collectors;\nimport java.util.stream.IntStream;\n\nimport static java.lang.Math.max;\nimport static java.lang.Math.min;\nimport static java.lang.Math.pow;\n\nimport static java.lang.String.format;\n\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner=new Scanner();\n final String s = scanner.next();\n final String t = scanner.next();\n int ans=Integer.MAX_VALUE;\n for (int i = 0; i <= s.length() - t.length(); i++) {\n int count=0;\n for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)!=t.charAt(j)){\n count++;\n }\n }\n ans = min(count, ans);\n }\n put(ans);\n\n }\n\n public static int upper_bound(int[] a,int val){\n return upper_bound(a,0,a.length,val);\n }\n public static int upper_bound(int[] a,int l,int r,int val){\n if(r-l==1){\n if(a[l]>val) return l;\n return r;\n }\n int mid=(l+r)/2;\n if(a[mid]>val){\n return upper_bound(a,l,mid,val);\n }else{\n return upper_bound(a,mid,r,val);\n }\n }\n public static <T> int upper_bound(T[] a,int l,int r,T val,Comparator<T> comparator){\n if(r-l==1){\n if(comparator.compare(a[l],val)>0) return l;\n return r;\n }\n int mid=(l+r)/2;\n if(comparator.compare(a[mid],val)>0){\n return upper_bound(a,l,mid,val,comparator);\n }else{\n return upper_bound(a,mid,r,val,comparator);\n }\n }\n public static int lower_bound(int[] a,int val){\n return lower_bound(a,0,a.length,val);\n }\n public static int lower_bound(int[] a,int l,int r,int val){\n if(r-l==1){\n if(a[l]<val) return r;\n return l;\n }\n int mid=(l+r)/2;\n if(a[mid]<val){\n return lower_bound(a,mid,r,val);\n }else{\n return lower_bound(a,l,mid,val);\n }\n\n }\n\n public static <T> int lower_bound(T[] a,int l,int r,T val,Comparator<T> comparator){\n if(r-l==1){\n if(comparator.compare(a[l],val)<0) return r;\n return l;\n }\n int mid=(l+r)/2;\n if(comparator.compare(a[mid],val)<0){\n return lower_bound(a,mid,r,val,comparator);\n }else{\n return lower_bound(a,l,mid,val,comparator);\n }\n }\n\n\n public static void print(Object object){\n System.out.print(object);\n }\n public static void put(Object object) {\n System.out.println(object);\n }\n public static void put(){\n System.out.println();\n }\n\n final static private class Scanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n final static private class FixedPair {\n final private long x, y;\n final static public FixedPair ZEROS=new FixedPair(0,0);\n FixedPair(long x, long y) {\n this.x = x;\n this.y = y;\n }\n\n public long getX() {\n return x;\n }\n\n public long getY() {\n return y;\n }\n\n @Override\n public int hashCode() {\n return (int)x+(int)y;\n }\n\n @Override\n public boolean equals(Object obj) {\n boolean result=super.equals(obj);\n if(obj.getClass()!=this.getClass()){\n return false;\n }\n FixedPair pair=(FixedPair)obj;\n if(this.x==pair.x&&this.y==pair.y) return true;\n return false;\n }\n\n @Override\n public String toString() {\n return String.format(\"(%d,%d)\", x, y);\n }\n }\n final static private class Tuple<T,V>{\n //immutabl1でないことに注意(T,Vがmutableの場合変更可能)\n final private T t;\n final private V v;\n Tuple(T t,V v){\n this.t=t;\n this.v=v;\n }\n\n public T getT() {\n return t;\n }\n\n public V getV() {\n return v;\n }\n\n @Override\n public int hashCode() {\n return (t.hashCode()+v.hashCode());\n }\n\n @Override\n @SuppressWarnings(\"unchecked\")\n public boolean equals(Object obj) {\n if(obj.getClass()!=this.getClass()){\n return false;\n }\n Tuple<T,V> tuple=(Tuple<T, V>) obj;\n return tuple.t.equals(this.t)&&tuple.v.equals(this.v);\n }\n\n @Override\n public String toString() {\n return String.format(\"<Tuple>=<%s,%s>\",t,v);\n }\n }\n final static private class Util {\n static long gcd(long a,long b){\n //最大公約数 \n if(a%b==0)return b;\n return gcd(b,a%b);\n }\n static long lcm(long a,long b){\n //最小公倍数\n long gcd=gcd(a,b);\n long result=b/gcd;\n return a*result;\n }\n static long kaijoMod(int n,int mod){\n if(n<1) return -1;\n long result=1;\n for(int i=n;i>1;i--){\n result*=i;\n result%=mod;\n }\n return result;\n }\n static <T extends Comparable<T>> Map<T,Integer> count(List<T> list){\n //副作用\n Collections.sort(list);\n Map<T,Integer> result=new HashMap<>();\n int l=0,r=0;\n while(l<list.size()){\n while(r<list.size()-1&&list.get(r).equals(r+1)){\n r++;\n }\n result.put(list.get(r),r-l+1);\n r++;\n l=r;\n }\n return result;\n\n }\n static Map<Integer,Integer> count(int[] array){\n //副作用\n Arrays.sort(array);\n Map<Integer,Integer> result=new HashMap<>();\n int l=0,r=0;\n while(l<array.length){\n while(r<array.length-1&&array[r]==array[r+1]){\n r++;\n }\n result.put(array[l],r-l+1);\n r++;\n l=r;\n }\n return result;\n }\n static <T> String toStringBWS(Iterable<T> iterable){\n Iterator<T> ite=iterable.iterator();\n return toStringBWS(ite);\n }\n static <T> String toStringBWS(Iterator<T> ite){\n StringBuilder sb=new StringBuilder();\n sb.append(ite.next());\n while(ite.hasNext()){\n sb.append(\" \");\n sb.append(ite.next());\n }\n return sb.toString();\n }\n static int[] factoringInPrimeNumbers(long n,int size){\n //素因数分解\n //sizeがnに比べて小さい場合完全に素因数分解出来ていない可能性がある\n int[] result=new int[size];\n for(int i=2;n>1&&i< result.length;i++){\n while(n%i==0){\n result[i]++;\n n/=i;\n }\n }\n return result;\n\n }\n }\n}",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStream;",
"InputStream",
"java.io",
"import java.util.*;",
"util.*",
"java",
"import java.util.List;",
"List",
"java.util",
"import java.util.jar.JarEntry;",
"JarEntry",
"java.util.jar",
"import java.util.stream.Collectors;",
"Collectors",
"java.util.stream",
"import java.util.stream.IntStream;",
"IntStream",
"java.util.stream",
"import static java.lang.Math.max;",
"import static java.lang.Math.max;",
"import static java.lang.Math.max;",
"import static java.lang.Math.min;",
"import static java.lang.Math.min;",
"import static java.lang.Math.min;",
"import static java.lang.Math.pow;",
"import static java.lang.Math.pow;",
"import static java.lang.Math.pow;",
"import static java.lang.String.format;",
"import static java.lang.String.format;",
"import static java.lang.String.format;",
"public class Main {\n public static void main(String[] args) {\n Scanner scanner=new Scanner();\n final String s = scanner.next();\n final String t = scanner.next();\n int ans=Integer.MAX_VALUE;\n for (int i = 0; i <= s.length() - t.length(); i++) {\n int count=0;\n for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)!=t.charAt(j)){\n count++;\n }\n }\n ans = min(count, ans);\n }\n put(ans);\n\n }\n\n public static int upper_bound(int[] a,int val){\n return upper_bound(a,0,a.length,val);\n }\n public static int upper_bound(int[] a,int l,int r,int val){\n if(r-l==1){\n if(a[l]>val) return l;\n return r;\n }\n int mid=(l+r)/2;\n if(a[mid]>val){\n return upper_bound(a,l,mid,val);\n }else{\n return upper_bound(a,mid,r,val);\n }\n }\n public static <T> int upper_bound(T[] a,int l,int r,T val,Comparator<T> comparator){\n if(r-l==1){\n if(comparator.compare(a[l],val)>0) return l;\n return r;\n }\n int mid=(l+r)/2;\n if(comparator.compare(a[mid],val)>0){\n return upper_bound(a,l,mid,val,comparator);\n }else{\n return upper_bound(a,mid,r,val,comparator);\n }\n }\n public static int lower_bound(int[] a,int val){\n return lower_bound(a,0,a.length,val);\n }\n public static int lower_bound(int[] a,int l,int r,int val){\n if(r-l==1){\n if(a[l]<val) return r;\n return l;\n }\n int mid=(l+r)/2;\n if(a[mid]<val){\n return lower_bound(a,mid,r,val);\n }else{\n return lower_bound(a,l,mid,val);\n }\n\n }\n\n public static <T> int lower_bound(T[] a,int l,int r,T val,Comparator<T> comparator){\n if(r-l==1){\n if(comparator.compare(a[l],val)<0) return r;\n return l;\n }\n int mid=(l+r)/2;\n if(comparator.compare(a[mid],val)<0){\n return lower_bound(a,mid,r,val,comparator);\n }else{\n return lower_bound(a,l,mid,val,comparator);\n }\n }\n\n\n public static void print(Object object){\n System.out.print(object);\n }\n public static void put(Object object) {\n System.out.println(object);\n }\n public static void put(){\n System.out.println();\n }\n\n final static private class Scanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n final static private class FixedPair {\n final private long x, y;\n final static public FixedPair ZEROS=new FixedPair(0,0);\n FixedPair(long x, long y) {\n this.x = x;\n this.y = y;\n }\n\n public long getX() {\n return x;\n }\n\n public long getY() {\n return y;\n }\n\n @Override\n public int hashCode() {\n return (int)x+(int)y;\n }\n\n @Override\n public boolean equals(Object obj) {\n boolean result=super.equals(obj);\n if(obj.getClass()!=this.getClass()){\n return false;\n }\n FixedPair pair=(FixedPair)obj;\n if(this.x==pair.x&&this.y==pair.y) return true;\n return false;\n }\n\n @Override\n public String toString() {\n return String.format(\"(%d,%d)\", x, y);\n }\n }\n final static private class Tuple<T,V>{\n //immutabl1でないことに注意(T,Vがmutableの場合変更可能)\n final private T t;\n final private V v;\n Tuple(T t,V v){\n this.t=t;\n this.v=v;\n }\n\n public T getT() {\n return t;\n }\n\n public V getV() {\n return v;\n }\n\n @Override\n public int hashCode() {\n return (t.hashCode()+v.hashCode());\n }\n\n @Override\n @SuppressWarnings(\"unchecked\")\n public boolean equals(Object obj) {\n if(obj.getClass()!=this.getClass()){\n return false;\n }\n Tuple<T,V> tuple=(Tuple<T, V>) obj;\n return tuple.t.equals(this.t)&&tuple.v.equals(this.v);\n }\n\n @Override\n public String toString() {\n return String.format(\"<Tuple>=<%s,%s>\",t,v);\n }\n }\n final static private class Util {\n static long gcd(long a,long b){\n //最大公約数 \n if(a%b==0)return b;\n return gcd(b,a%b);\n }\n static long lcm(long a,long b){\n //最小公倍数\n long gcd=gcd(a,b);\n long result=b/gcd;\n return a*result;\n }\n static long kaijoMod(int n,int mod){\n if(n<1) return -1;\n long result=1;\n for(int i=n;i>1;i--){\n result*=i;\n result%=mod;\n }\n return result;\n }\n static <T extends Comparable<T>> Map<T,Integer> count(List<T> list){\n //副作用\n Collections.sort(list);\n Map<T,Integer> result=new HashMap<>();\n int l=0,r=0;\n while(l<list.size()){\n while(r<list.size()-1&&list.get(r).equals(r+1)){\n r++;\n }\n result.put(list.get(r),r-l+1);\n r++;\n l=r;\n }\n return result;\n\n }\n static Map<Integer,Integer> count(int[] array){\n //副作用\n Arrays.sort(array);\n Map<Integer,Integer> result=new HashMap<>();\n int l=0,r=0;\n while(l<array.length){\n while(r<array.length-1&&array[r]==array[r+1]){\n r++;\n }\n result.put(array[l],r-l+1);\n r++;\n l=r;\n }\n return result;\n }\n static <T> String toStringBWS(Iterable<T> iterable){\n Iterator<T> ite=iterable.iterator();\n return toStringBWS(ite);\n }\n static <T> String toStringBWS(Iterator<T> ite){\n StringBuilder sb=new StringBuilder();\n sb.append(ite.next());\n while(ite.hasNext()){\n sb.append(\" \");\n sb.append(ite.next());\n }\n return sb.toString();\n }\n static int[] factoringInPrimeNumbers(long n,int size){\n //素因数分解\n //sizeがnに比べて小さい場合完全に素因数分解出来ていない可能性がある\n int[] result=new int[size];\n for(int i=2;n>1&&i< result.length;i++){\n while(n%i==0){\n result[i]++;\n n/=i;\n }\n }\n return result;\n\n }\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner scanner=new Scanner();\n final String s = scanner.next();\n final String t = scanner.next();\n int ans=Integer.MAX_VALUE;\n for (int i = 0; i <= s.length() - t.length(); i++) {\n int count=0;\n for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)!=t.charAt(j)){\n count++;\n }\n }\n ans = min(count, ans);\n }\n put(ans);\n\n }",
"main",
"{\n Scanner scanner=new Scanner();\n final String s = scanner.next();\n final String t = scanner.next();\n int ans=Integer.MAX_VALUE;\n for (int i = 0; i <= s.length() - t.length(); i++) {\n int count=0;\n for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)!=t.charAt(j)){\n count++;\n }\n }\n ans = min(count, ans);\n }\n put(ans);\n\n }",
"Scanner scanner=new Scanner();",
"scanner",
"new Scanner()",
"final String s = scanner.next();",
"s",
"scanner.next()",
"scanner.next",
"scanner",
"final String t = scanner.next();",
"t",
"scanner.next()",
"scanner.next",
"scanner",
"int ans=Integer.MAX_VALUE;",
"ans",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"for (int i = 0; i <= s.length() - t.length(); i++) {\n int count=0;\n for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)!=t.charAt(j)){\n count++;\n }\n }\n ans = min(count, ans);\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= s.length() - t.length()",
"i",
"s.length() - t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"i++",
"i++",
"i",
"{\n int count=0;\n for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)!=t.charAt(j)){\n count++;\n }\n }\n ans = min(count, ans);\n }",
"{\n int count=0;\n for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)!=t.charAt(j)){\n count++;\n }\n }\n ans = min(count, ans);\n }",
"int count=0;",
"count",
"0",
"for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)!=t.charAt(j)){\n count++;\n }\n }",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n if(s.charAt(i+j)!=t.charAt(j)){\n count++;\n }\n }",
"{\n if(s.charAt(i+j)!=t.charAt(j)){\n count++;\n }\n }",
"if(s.charAt(i+j)!=t.charAt(j)){\n count++;\n }",
"s.charAt(i+j)!=t.charAt(j)",
"s.charAt(i+j)",
"s.charAt",
"s",
"i+j",
"i",
"j",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"{\n count++;\n }",
"count++",
"count",
"ans = min(count, ans)",
"ans",
"min(count, ans)",
"min",
"count",
"ans",
"put(ans)",
"put",
"ans",
"String[] args",
"args",
"public static int upper_bound(int[] a,int val){\n return upper_bound(a,0,a.length,val);\n }",
"upper_bound",
"{\n return upper_bound(a,0,a.length,val);\n }",
"return upper_bound(a,0,a.length,val);",
"upper_bound(a,0,a.length,val)",
"upper_bound",
"a",
"0",
"a.length",
"a",
"a.length",
"val",
"int[] a",
"a",
"int val",
"val",
"public static int upper_bound(int[] a,int l,int r,int val){\n if(r-l==1){\n if(a[l]>val) return l;\n return r;\n }\n int mid=(l+r)/2;\n if(a[mid]>val){\n return upper_bound(a,l,mid,val);\n }else{\n return upper_bound(a,mid,r,val);\n }\n }",
"upper_bound",
"{\n if(r-l==1){\n if(a[l]>val) return l;\n return r;\n }\n int mid=(l+r)/2;\n if(a[mid]>val){\n return upper_bound(a,l,mid,val);\n }else{\n return upper_bound(a,mid,r,val);\n }\n }",
"if(r-l==1){\n if(a[l]>val) return l;\n return r;\n }",
"r-l==1",
"r-l",
"r",
"l",
"1",
"{\n if(a[l]>val) return l;\n return r;\n }",
"if(a[l]>val) return l;",
"a[l]>val",
"a[l]",
"a",
"l",
"val",
"return l;",
"l",
"return r;",
"r",
"int mid=(l+r)/2;",
"mid",
"(l+r)/2",
"(l+r)",
"l",
"r",
"2",
"if(a[mid]>val){\n return upper_bound(a,l,mid,val);\n }else{\n return upper_bound(a,mid,r,val);\n }",
"a[mid]>val",
"a[mid]",
"a",
"mid",
"val",
"{\n return upper_bound(a,l,mid,val);\n }",
"return upper_bound(a,l,mid,val);",
"upper_bound(a,l,mid,val)",
"upper_bound",
"a",
"l",
"mid",
"val",
"{\n return upper_bound(a,mid,r,val);\n }",
"return upper_bound(a,mid,r,val);",
"upper_bound(a,mid,r,val)",
"upper_bound",
"a",
"mid",
"r",
"val",
"int[] a",
"a",
"int l",
"l",
"int r",
"r",
"int val",
"val",
"public static <T> int upper_bound(T[] a,int l,int r,T val,Comparator<T> comparator){\n if(r-l==1){\n if(comparator.compare(a[l],val)>0) return l;\n return r;\n }\n int mid=(l+r)/2;\n if(comparator.compare(a[mid],val)>0){\n return upper_bound(a,l,mid,val,comparator);\n }else{\n return upper_bound(a,mid,r,val,comparator);\n }\n }",
"upper_bound",
"{\n if(r-l==1){\n if(comparator.compare(a[l],val)>0) return l;\n return r;\n }\n int mid=(l+r)/2;\n if(comparator.compare(a[mid],val)>0){\n return upper_bound(a,l,mid,val,comparator);\n }else{\n return upper_bound(a,mid,r,val,comparator);\n }\n }",
"if(r-l==1){\n if(comparator.compare(a[l],val)>0) return l;\n return r;\n }",
"r-l==1",
"r-l",
"r",
"l",
"1",
"{\n if(comparator.compare(a[l],val)>0) return l;\n return r;\n }",
"if(comparator.compare(a[l],val)>0) return l;",
"comparator.compare(a[l],val)>0",
"comparator.compare(a[l],val)",
"comparator.compare",
"comparator",
"a[l]",
"a",
"l",
"val",
"0",
"return l;",
"l",
"return r;",
"r",
"int mid=(l+r)/2;",
"mid",
"(l+r)/2",
"(l+r)",
"l",
"r",
"2",
"if(comparator.compare(a[mid],val)>0){\n return upper_bound(a,l,mid,val,comparator);\n }else{\n return upper_bound(a,mid,r,val,comparator);\n }",
"comparator.compare(a[mid],val)>0",
"comparator.compare(a[mid],val)",
"comparator.compare",
"comparator",
"a[mid]",
"a",
"mid",
"val",
"0",
"{\n return upper_bound(a,l,mid,val,comparator);\n }",
"return upper_bound(a,l,mid,val,comparator);",
"upper_bound(a,l,mid,val,comparator)",
"upper_bound",
"a",
"l",
"mid",
"val",
"comparator",
"{\n return upper_bound(a,mid,r,val,comparator);\n }",
"return upper_bound(a,mid,r,val,comparator);",
"upper_bound(a,mid,r,val,comparator)",
"upper_bound",
"a",
"mid",
"r",
"val",
"comparator",
"T[] a",
"a",
"int l",
"l",
"int r",
"r",
"T val",
"val",
"Comparator<T> comparator",
"comparator",
"public static int lower_bound(int[] a,int val){\n return lower_bound(a,0,a.length,val);\n }",
"lower_bound",
"{\n return lower_bound(a,0,a.length,val);\n }",
"return lower_bound(a,0,a.length,val);",
"lower_bound(a,0,a.length,val)",
"lower_bound",
"a",
"0",
"a.length",
"a",
"a.length",
"val",
"int[] a",
"a",
"int val",
"val",
"public static int lower_bound(int[] a,int l,int r,int val){\n if(r-l==1){\n if(a[l]<val) return r;\n return l;\n }\n int mid=(l+r)/2;\n if(a[mid]<val){\n return lower_bound(a,mid,r,val);\n }else{\n return lower_bound(a,l,mid,val);\n }\n\n }",
"lower_bound",
"{\n if(r-l==1){\n if(a[l]<val) return r;\n return l;\n }\n int mid=(l+r)/2;\n if(a[mid]<val){\n return lower_bound(a,mid,r,val);\n }else{\n return lower_bound(a,l,mid,val);\n }\n\n }",
"if(r-l==1){\n if(a[l]<val) return r;\n return l;\n }",
"r-l==1",
"r-l",
"r",
"l",
"1",
"{\n if(a[l]<val) return r;\n return l;\n }",
"if(a[l]<val) return r;",
"a[l]<val",
"a[l]",
"a",
"l",
"val",
"return r;",
"r",
"return l;",
"l",
"int mid=(l+r)/2;",
"mid",
"(l+r)/2",
"(l+r)",
"l",
"r",
"2",
"if(a[mid]<val){\n return lower_bound(a,mid,r,val);\n }else{\n return lower_bound(a,l,mid,val);\n }",
"a[mid]<val",
"a[mid]",
"a",
"mid",
"val",
"{\n return lower_bound(a,mid,r,val);\n }",
"return lower_bound(a,mid,r,val);",
"lower_bound(a,mid,r,val)",
"lower_bound",
"a",
"mid",
"r",
"val",
"{\n return lower_bound(a,l,mid,val);\n }",
"return lower_bound(a,l,mid,val);",
"lower_bound(a,l,mid,val)",
"lower_bound",
"a",
"l",
"mid",
"val",
"int[] a",
"a",
"int l",
"l",
"int r",
"r",
"int val",
"val",
"public static <T> int lower_bound(T[] a,int l,int r,T val,Comparator<T> comparator){\n if(r-l==1){\n if(comparator.compare(a[l],val)<0) return r;\n return l;\n }\n int mid=(l+r)/2;\n if(comparator.compare(a[mid],val)<0){\n return lower_bound(a,mid,r,val,comparator);\n }else{\n return lower_bound(a,l,mid,val,comparator);\n }\n }",
"lower_bound",
"{\n if(r-l==1){\n if(comparator.compare(a[l],val)<0) return r;\n return l;\n }\n int mid=(l+r)/2;\n if(comparator.compare(a[mid],val)<0){\n return lower_bound(a,mid,r,val,comparator);\n }else{\n return lower_bound(a,l,mid,val,comparator);\n }\n }",
"if(r-l==1){\n if(comparator.compare(a[l],val)<0) return r;\n return l;\n }",
"r-l==1",
"r-l",
"r",
"l",
"1",
"{\n if(comparator.compare(a[l],val)<0) return r;\n return l;\n }",
"if(comparator.compare(a[l],val)<0) return r;",
"comparator.compare(a[l],val)<0",
"comparator.compare(a[l],val)",
"comparator.compare",
"comparator",
"a[l]",
"a",
"l",
"val",
"0",
"return r;",
"r",
"return l;",
"l",
"int mid=(l+r)/2;",
"mid",
"(l+r)/2",
"(l+r)",
"l",
"r",
"2",
"if(comparator.compare(a[mid],val)<0){\n return lower_bound(a,mid,r,val,comparator);\n }else{\n return lower_bound(a,l,mid,val,comparator);\n }",
"comparator.compare(a[mid],val)<0",
"comparator.compare(a[mid],val)",
"comparator.compare",
"comparator",
"a[mid]",
"a",
"mid",
"val",
"0",
"{\n return lower_bound(a,mid,r,val,comparator);\n }",
"return lower_bound(a,mid,r,val,comparator);",
"lower_bound(a,mid,r,val,comparator)",
"lower_bound",
"a",
"mid",
"r",
"val",
"comparator",
"{\n return lower_bound(a,l,mid,val,comparator);\n }",
"return lower_bound(a,l,mid,val,comparator);",
"lower_bound(a,l,mid,val,comparator)",
"lower_bound",
"a",
"l",
"mid",
"val",
"comparator",
"T[] a",
"a",
"int l",
"l",
"int r",
"r",
"T val",
"val",
"Comparator<T> comparator",
"comparator",
"public static void print(Object object){\n System.out.print(object);\n }",
"print",
"{\n System.out.print(object);\n }",
"System.out.print(object)",
"System.out.print",
"System.out",
"System",
"System.out",
"object",
"Object object",
"object",
"public static void put(Object object) {\n System.out.println(object);\n }",
"put",
"{\n System.out.println(object);\n }",
"System.out.println(object)",
"System.out.println",
"System.out",
"System",
"System.out",
"object",
"Object object",
"object",
"public static void put(){\n System.out.println();\n }",
"put",
"{\n System.out.println();\n }",
"System.out.println()",
"System.out.println",
"System.out",
"System",
"System.out",
"final static private class Scanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }",
"Scanner",
"private final InputStream in = System.in;",
"in",
"System.in",
"System",
"System.in",
"private final byte[] buffer = new byte[1024];",
"buffer",
"new byte[1024]",
"1024",
"private int ptr = 0;",
"ptr",
"0",
"private int buflen = 0;",
"buflen",
"0",
"private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }",
"hasNextByte",
"{\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }",
"if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }",
"ptr < buflen",
"ptr",
"buflen",
"{\n return true;\n }",
"return true;",
"true",
"{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }",
"ptr = 0",
"ptr",
"0",
"try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }",
"catch (IOException e) {\n e.printStackTrace();\n }",
"IOException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n buflen = in.read(buffer);\n }",
"buflen = in.read(buffer)",
"buflen",
"in.read(buffer)",
"in.read",
"in",
"buffer",
"if (buflen <= 0) {\n return false;\n }",
"buflen <= 0",
"buflen",
"0",
"{\n return false;\n }",
"return false;",
"false",
"return true;",
"true",
"private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }",
"readByte",
"{\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }",
"if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;",
"hasNextByte()",
"hasNextByte",
"return buffer[ptr++];",
"buffer[ptr++]",
"buffer",
"ptr++",
"ptr",
"return -1;",
"-1",
"1",
"private boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }",
"isPrintableChar",
"{\n return 33 <= c && c <= 126;\n }",
"return 33 <= c && c <= 126;",
"33 <= c && c <= 126",
"33 <= c",
"33",
"c",
"c <= 126",
"c",
"126",
"int c",
"c",
"public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }",
"hasNext",
"{\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }",
"while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;",
"hasNextByte() && !isPrintableChar(buffer[ptr])",
"hasNextByte()",
"hasNextByte",
"!isPrintableChar(buffer[ptr])",
"isPrintableChar(buffer[ptr])",
"isPrintableChar",
"buffer[ptr]",
"buffer",
"ptr",
"ptr++",
"ptr",
"return hasNextByte();",
"hasNextByte()",
"hasNextByte",
"public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }",
"next",
"{\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }",
"if (!hasNext())\n throw new NoSuchElementException();",
"!hasNext()",
"hasNext()",
"hasNext",
"throw new NoSuchElementException();",
"new NoSuchElementException()",
"StringBuilder sb = new StringBuilder();",
"sb",
"new StringBuilder()",
"int b = readByte();",
"b",
"readByte()",
"readByte",
"while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }",
"isPrintableChar(b)",
"isPrintableChar",
"b",
"{\n sb.appendCodePoint(b);\n b = readByte();\n }",
"sb.appendCodePoint(b)",
"sb.appendCodePoint",
"sb",
"b",
"b = readByte()",
"b",
"readByte()",
"readByte",
"return sb.toString();",
"sb.toString()",
"sb.toString",
"sb",
"public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }",
"nextLong",
"{\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }",
"if (!hasNext())\n throw new NoSuchElementException();",
"!hasNext()",
"hasNext()",
"hasNext",
"throw new NoSuchElementException();",
"new NoSuchElementException()",
"long n = 0;",
"n",
"0",
"boolean minus = false;",
"minus",
"false",
"int b = readByte();",
"b",
"readByte()",
"readByte",
"if (b == '-') {\n minus = true;\n b = readByte();\n }",
"b == '-'",
"b",
"'-'",
"{\n minus = true;\n b = readByte();\n }",
"minus = true",
"minus",
"true",
"b = readByte()",
"b",
"readByte()",
"readByte",
"if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }",
"b < '0' || '9' < b",
"b < '0'",
"b",
"'0'",
"'9' < b",
"'9'",
"b",
"{\n throw new NumberFormatException();\n }",
"throw new NumberFormatException();",
"new NumberFormatException()",
"while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }",
"true",
"{\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }",
"if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }",
"'0' <= b && b <= '9'",
"'0' <= b",
"'0'",
"b",
"b <= '9'",
"b",
"'9'",
"{\n n *= 10;\n n += b - '0';\n }",
"n *= 10",
"n",
"10",
"n += b - '0'",
"n",
"b - '0'",
"b",
"'0'",
"if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }",
"b == -1 || !isPrintableChar(b)",
"b == -1",
"b",
"-1",
"1",
"!isPrintableChar(b)",
"isPrintableChar(b)",
"isPrintableChar",
"b",
"{\n return minus ? -n : n;\n }",
"return minus ? -n : n;",
"minus ? -n : n",
"minus",
"-n",
"n",
"n",
"{\n throw new NumberFormatException();\n }",
"throw new NumberFormatException();",
"new NumberFormatException()",
"b = readByte()",
"b",
"readByte()",
"readByte",
"public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }",
"nextInt",
"{\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }",
"long nl = nextLong();",
"nl",
"nextLong()",
"nextLong",
"if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();",
"nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE",
"nl < Integer.MIN_VALUE",
"nl",
"Integer.MIN_VALUE",
"Integer",
"Integer.MIN_VALUE",
"nl > Integer.MAX_VALUE",
"nl",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"throw new NumberFormatException();",
"new NumberFormatException()",
"return (int) nl;",
"(int) nl",
"public double nextDouble() {\n return Double.parseDouble(next());\n }",
"nextDouble",
"{\n return Double.parseDouble(next());\n }",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"final static private class FixedPair {\n final private long x, y;\n final static public FixedPair ZEROS=new FixedPair(0,0);\n FixedPair(long x, long y) {\n this.x = x;\n this.y = y;\n }\n\n public long getX() {\n return x;\n }\n\n public long getY() {\n return y;\n }\n\n @Override\n public int hashCode() {\n return (int)x+(int)y;\n }\n\n @Override\n public boolean equals(Object obj) {\n boolean result=super.equals(obj);\n if(obj.getClass()!=this.getClass()){\n return false;\n }\n FixedPair pair=(FixedPair)obj;\n if(this.x==pair.x&&this.y==pair.y) return true;\n return false;\n }\n\n @Override\n public String toString() {\n return String.format(\"(%d,%d)\", x, y);\n }\n }",
"FixedPair",
"final private long x",
"x",
"y;",
"y",
"final static public FixedPair ZEROS=new FixedPair(0,0);",
"ZEROS",
"new FixedPair(0,0)",
"FixedPair(long x, long y) {\n this.x = x;\n this.y = y;\n }",
"FixedPair",
"{\n this.x = x;\n this.y = y;\n }",
"this.x = x",
"this.x",
"this",
"this.x",
"x",
"this.y = y",
"this.y",
"this",
"this.y",
"y",
"long x",
"x",
"long y",
"y",
"public long getX() {\n return x;\n }",
"getX",
"{\n return x;\n }",
"return x;",
"x",
"public long getY() {\n return y;\n }",
"getY",
"{\n return y;\n }",
"return y;",
"y",
"@Override\n public int hashCode() {\n return (int)x+(int)y;\n }",
"hashCode",
"{\n return (int)x+(int)y;\n }",
"return (int)x+(int)y;",
"(int)x+(int)y",
"(int)x",
"(int)y",
"@Override\n public boolean equals(Object obj) {\n boolean result=super.equals(obj);\n if(obj.getClass()!=this.getClass()){\n return false;\n }\n FixedPair pair=(FixedPair)obj;\n if(this.x==pair.x&&this.y==pair.y) return true;\n return false;\n }",
"equals",
"{\n boolean result=super.equals(obj);\n if(obj.getClass()!=this.getClass()){\n return false;\n }\n FixedPair pair=(FixedPair)obj;\n if(this.x==pair.x&&this.y==pair.y) return true;\n return false;\n }",
"boolean result=super.equals(obj);",
"result",
"super.equals(obj)",
"super.equals",
"super",
"obj",
"if(obj.getClass()!=this.getClass()){\n return false;\n }",
"obj.getClass()!=this.getClass()",
"obj.getClass()",
"obj.getClass",
"obj",
"this.getClass()",
"this.getClass",
"this",
"{\n return false;\n }",
"return false;",
"false",
"FixedPair pair=(FixedPair)obj;",
"pair",
"(FixedPair)obj",
"if(this.x==pair.x&&this.y==pair.y) return true;",
"this.x==pair.x&&this.y==pair.y",
"this.x==pair.x",
"this.x",
"this",
"this.x",
"pair.x",
"pair",
"pair.x",
"this.y==pair.y",
"this.y",
"this",
"this.y",
"pair.y",
"pair",
"pair.y",
"return true;",
"true",
"return false;",
"false",
"Object obj",
"obj",
"@Override\n public String toString() {\n return String.format(\"(%d,%d)\", x, y);\n }",
"toString",
"{\n return String.format(\"(%d,%d)\", x, y);\n }",
"return String.format(\"(%d,%d)\", x, y);",
"String.format(\"(%d,%d)\", x, y)",
"String.format",
"String",
"\"(%d,%d)\"",
"x",
"y",
"final static private class Tuple<T,V>{\n //immutabl1でないことに注意(T,Vがmutableの場合変更可能)\n final private T t;\n final private V v;\n Tuple(T t,V v){\n this.t=t;\n this.v=v;\n }\n\n public T getT() {\n return t;\n }\n\n public V getV() {\n return v;\n }\n\n @Override\n public int hashCode() {\n return (t.hashCode()+v.hashCode());\n }\n\n @Override\n @SuppressWarnings(\"unchecked\")\n public boolean equals(Object obj) {\n if(obj.getClass()!=this.getClass()){\n return false;\n }\n Tuple<T,V> tuple=(Tuple<T, V>) obj;\n return tuple.t.equals(this.t)&&tuple.v.equals(this.v);\n }\n\n @Override\n public String toString() {\n return String.format(\"<Tuple>=<%s,%s>\",t,v);\n }\n }",
"Tuple",
"//immutabl1でないことに注意(T,Vがmutableの場合変更可能)\n final private T t;",
"t",
"final private V v;",
"v",
"Tuple(T t,V v){\n this.t=t;\n this.v=v;\n }",
"Tuple",
"{\n this.t=t;\n this.v=v;\n }",
"this.t=t",
"this.t",
"this",
"this.t",
"t",
"this.v=v",
"this.v",
"this",
"this.v",
"v",
"T t",
"t",
"V v",
"v",
"public T getT() {\n return t;\n }",
"getT",
"{\n return t;\n }",
"return t;",
"t",
"public V getV() {\n return v;\n }",
"getV",
"{\n return v;\n }",
"return v;",
"v",
"@Override\n public int hashCode() {\n return (t.hashCode()+v.hashCode());\n }",
"hashCode",
"{\n return (t.hashCode()+v.hashCode());\n }",
"return (t.hashCode()+v.hashCode());",
"(t.hashCode()+v.hashCode())",
"t.hashCode()",
"t.hashCode",
"t",
"v.hashCode()",
"v.hashCode",
"v",
"@Override\n @SuppressWarnings(\"unchecked\")\n public boolean equals(Object obj) {\n if(obj.getClass()!=this.getClass()){\n return false;\n }\n Tuple<T,V> tuple=(Tuple<T, V>) obj;\n return tuple.t.equals(this.t)&&tuple.v.equals(this.v);\n }",
"equals",
"{\n if(obj.getClass()!=this.getClass()){\n return false;\n }\n Tuple<T,V> tuple=(Tuple<T, V>) obj;\n return tuple.t.equals(this.t)&&tuple.v.equals(this.v);\n }",
"if(obj.getClass()!=this.getClass()){\n return false;\n }",
"obj.getClass()!=this.getClass()",
"obj.getClass()",
"obj.getClass",
"obj",
"this.getClass()",
"this.getClass",
"this",
"{\n return false;\n }",
"return false;",
"false",
"Tuple<T,V> tuple=(Tuple<T, V>) obj;",
"tuple",
"(Tuple<T, V>) obj",
"return tuple.t.equals(this.t)&&tuple.v.equals(this.v);",
"tuple.t.equals(this.t)&&tuple.v.equals(this.v)",
"tuple.t.equals(this.t)",
"tuple.t.equals",
"tuple.t",
"tuple",
"tuple.t",
"this.t",
"this",
"this.t",
"tuple.v.equals(this.v)",
"tuple.v.equals",
"tuple.v",
"tuple",
"tuple.v",
"this.v",
"this",
"this.v",
"Object obj",
"obj",
"@Override\n public String toString() {\n return String.format(\"<Tuple>=<%s,%s>\",t,v);\n }",
"toString",
"{\n return String.format(\"<Tuple>=<%s,%s>\",t,v);\n }",
"return String.format(\"<Tuple>=<%s,%s>\",t,v);",
"String.format(\"<Tuple>=<%s,%s>\",t,v)",
"String.format",
"String",
"\"<Tuple>=<%s,%s>\"",
"t",
"v",
"final static private class Util {\n static long gcd(long a,long b){\n //最大公約数 \n if(a%b==0)return b;\n return gcd(b,a%b);\n }\n static long lcm(long a,long b){\n //最小公倍数\n long gcd=gcd(a,b);\n long result=b/gcd;\n return a*result;\n }\n static long kaijoMod(int n,int mod){\n if(n<1) return -1;\n long result=1;\n for(int i=n;i>1;i--){\n result*=i;\n result%=mod;\n }\n return result;\n }\n static <T extends Comparable<T>> Map<T,Integer> count(List<T> list){\n //副作用\n Collections.sort(list);\n Map<T,Integer> result=new HashMap<>();\n int l=0,r=0;\n while(l<list.size()){\n while(r<list.size()-1&&list.get(r).equals(r+1)){\n r++;\n }\n result.put(list.get(r),r-l+1);\n r++;\n l=r;\n }\n return result;\n\n }\n static Map<Integer,Integer> count(int[] array){\n //副作用\n Arrays.sort(array);\n Map<Integer,Integer> result=new HashMap<>();\n int l=0,r=0;\n while(l<array.length){\n while(r<array.length-1&&array[r]==array[r+1]){\n r++;\n }\n result.put(array[l],r-l+1);\n r++;\n l=r;\n }\n return result;\n }\n static <T> String toStringBWS(Iterable<T> iterable){\n Iterator<T> ite=iterable.iterator();\n return toStringBWS(ite);\n }\n static <T> String toStringBWS(Iterator<T> ite){\n StringBuilder sb=new StringBuilder();\n sb.append(ite.next());\n while(ite.hasNext()){\n sb.append(\" \");\n sb.append(ite.next());\n }\n return sb.toString();\n }\n static int[] factoringInPrimeNumbers(long n,int size){\n //素因数分解\n //sizeがnに比べて小さい場合完全に素因数分解出来ていない可能性がある\n int[] result=new int[size];\n for(int i=2;n>1&&i< result.length;i++){\n while(n%i==0){\n result[i]++;\n n/=i;\n }\n }\n return result;\n\n }\n }",
"Util",
"static long gcd(long a,long b){\n //最大公約数 \n if(a%b==0)return b;\n return gcd(b,a%b);\n }",
"gcd",
"{\n //最大公約数 \n if(a%b==0)return b;\n return gcd(b,a%b);\n }",
"if(a%b==0)return b;",
"a%b==0",
"a%b",
"a",
"b",
"0",
"return b;",
"b",
"return gcd(b,a%b);",
"gcd(b,a%b)",
"gcd",
"b",
"a%b",
"a",
"b",
"long a",
"a",
"long b",
"b",
"static long lcm(long a,long b){\n //最小公倍数\n long gcd=gcd(a,b);\n long result=b/gcd;\n return a*result;\n }",
"lcm",
"{\n //最小公倍数\n long gcd=gcd(a,b);\n long result=b/gcd;\n return a*result;\n }",
"long gcd=gcd(a,b);",
"gcd",
"gcd(a,b)",
"gcd",
"a",
"b",
"long result=b/gcd;",
"result",
"b/gcd",
"b",
"gcd",
"return a*result;",
"a*result",
"a",
"result",
"long a",
"a",
"long b",
"b",
"static long kaijoMod(int n,int mod){\n if(n<1) return -1;\n long result=1;\n for(int i=n;i>1;i--){\n result*=i;\n result%=mod;\n }\n return result;\n }",
"kaijoMod",
"{\n if(n<1) return -1;\n long result=1;\n for(int i=n;i>1;i--){\n result*=i;\n result%=mod;\n }\n return result;\n }",
"if(n<1) return -1;",
"n<1",
"n",
"1",
"return -1;",
"-1",
"1",
"long result=1;",
"result",
"1",
"for(int i=n;i>1;i--){\n result*=i;\n result%=mod;\n }",
"int i=n;",
"int i=n;",
"i",
"n",
"i>1",
"i",
"1",
"i--",
"i--",
"i",
"{\n result*=i;\n result%=mod;\n }",
"{\n result*=i;\n result%=mod;\n }",
"result*=i",
"result",
"i",
"result%=mod",
"result",
"mod",
"return result;",
"result",
"int n",
"n",
"int mod",
"mod",
"static <T extends Comparable<T>> Map<T,Integer> count(List<T> list){\n //副作用\n Collections.sort(list);\n Map<T,Integer> result=new HashMap<>();\n int l=0,r=0;\n while(l<list.size()){\n while(r<list.size()-1&&list.get(r).equals(r+1)){\n r++;\n }\n result.put(list.get(r),r-l+1);\n r++;\n l=r;\n }\n return result;\n\n }",
"count",
"{\n //副作用\n Collections.sort(list);\n Map<T,Integer> result=new HashMap<>();\n int l=0,r=0;\n while(l<list.size()){\n while(r<list.size()-1&&list.get(r).equals(r+1)){\n r++;\n }\n result.put(list.get(r),r-l+1);\n r++;\n l=r;\n }\n return result;\n\n }",
"Collections.sort(list)",
"Collections.sort",
"Collections",
"list",
"Map<T,Integer> result=new HashMap<>();",
"result",
"new HashMap<>()",
"int l=0",
"l",
"0",
"r=0;",
"r",
"0",
"while(l<list.size()){\n while(r<list.size()-1&&list.get(r).equals(r+1)){\n r++;\n }\n result.put(list.get(r),r-l+1);\n r++;\n l=r;\n }",
"l<list.size()",
"l",
"list.size()",
"list.size",
"list",
"{\n while(r<list.size()-1&&list.get(r).equals(r+1)){\n r++;\n }\n result.put(list.get(r),r-l+1);\n r++;\n l=r;\n }",
"while(r<list.size()-1&&list.get(r).equals(r+1)){\n r++;\n }",
"r<list.size()-1&&list.get(r).equals(r+1)",
"r<list.size()-1",
"r",
"list.size()-1",
"list.size()",
"list.size",
"list",
"1",
"list.get(r).equals(r+1)",
"list.get(r).equals",
"list.get(r)",
"list.get",
"list",
"r",
"r+1",
"r",
"1",
"{\n r++;\n }",
"r++",
"r",
"result.put(list.get(r),r-l+1)",
"result.put",
"result",
"list.get(r)",
"list.get",
"list",
"r",
"r-l+1",
"r-l",
"r",
"l",
"1",
"r++",
"r",
"l=r",
"l",
"r",
"return result;",
"result",
"List<T> list",
"list",
"static Map<Integer,Integer> count(int[] array){\n //副作用\n Arrays.sort(array);\n Map<Integer,Integer> result=new HashMap<>();\n int l=0,r=0;\n while(l<array.length){\n while(r<array.length-1&&array[r]==array[r+1]){\n r++;\n }\n result.put(array[l],r-l+1);\n r++;\n l=r;\n }\n return result;\n }",
"count",
"{\n //副作用\n Arrays.sort(array);\n Map<Integer,Integer> result=new HashMap<>();\n int l=0,r=0;\n while(l<array.length){\n while(r<array.length-1&&array[r]==array[r+1]){\n r++;\n }\n result.put(array[l],r-l+1);\n r++;\n l=r;\n }\n return result;\n }",
"Arrays.sort(array)",
"Arrays.sort",
"Arrays",
"array",
"Map<Integer,Integer> result=new HashMap<>();",
"result",
"new HashMap<>()",
"int l=0",
"l",
"0",
"r=0;",
"r",
"0",
"while(l<array.length){\n while(r<array.length-1&&array[r]==array[r+1]){\n r++;\n }\n result.put(array[l],r-l+1);\n r++;\n l=r;\n }",
"l<array.length",
"l",
"array.length",
"array",
"array.length",
"{\n while(r<array.length-1&&array[r]==array[r+1]){\n r++;\n }\n result.put(array[l],r-l+1);\n r++;\n l=r;\n }",
"while(r<array.length-1&&array[r]==array[r+1]){\n r++;\n }",
"r<array.length-1&&array[r]==array[r+1]",
"r<array.length-1",
"r",
"array.length-1",
"array.length",
"array",
"array.length",
"1",
"array[r]==array[r+1]",
"array[r]",
"array",
"r",
"array[r+1]",
"array",
"r+1",
"r",
"1",
"{\n r++;\n }",
"r++",
"r",
"result.put(array[l],r-l+1)",
"result.put",
"result",
"array[l]",
"array",
"l",
"r-l+1",
"r-l",
"r",
"l",
"1",
"r++",
"r",
"l=r",
"l",
"r",
"return result;",
"result",
"int[] array",
"array",
"static <T> String toStringBWS(Iterable<T> iterable){\n Iterator<T> ite=iterable.iterator();\n return toStringBWS(ite);\n }",
"toStringBWS",
"{\n Iterator<T> ite=iterable.iterator();\n return toStringBWS(ite);\n }",
"Iterator<T> ite=iterable.iterator();",
"ite",
"iterable.iterator()",
"iterable.iterator",
"iterable",
"return toStringBWS(ite);",
"toStringBWS(ite)",
"toStringBWS",
"ite",
"Iterable<T> iterable",
"iterable",
"static <T> String toStringBWS(Iterator<T> ite){\n StringBuilder sb=new StringBuilder();\n sb.append(ite.next());\n while(ite.hasNext()){\n sb.append(\" \");\n sb.append(ite.next());\n }\n return sb.toString();\n }",
"toStringBWS",
"{\n StringBuilder sb=new StringBuilder();\n sb.append(ite.next());\n while(ite.hasNext()){\n sb.append(\" \");\n sb.append(ite.next());\n }\n return sb.toString();\n }",
"StringBuilder sb=new StringBuilder();",
"sb",
"new StringBuilder()",
"sb.append(ite.next())",
"sb.append",
"sb",
"ite.next()",
"ite.next",
"ite",
"while(ite.hasNext()){\n sb.append(\" \");\n sb.append(ite.next());\n }",
"ite.hasNext()",
"ite.hasNext",
"ite",
"{\n sb.append(\" \");\n sb.append(ite.next());\n }",
"sb.append(\" \")",
"sb.append",
"sb",
"\" \"",
"sb.append(ite.next())",
"sb.append",
"sb",
"ite.next()",
"ite.next",
"ite",
"return sb.toString();",
"sb.toString()",
"sb.toString",
"sb",
"Iterator<T> ite",
"ite",
"static int[] factoringInPrimeNumbers(long n,int size){\n //素因数分解\n //sizeがnに比べて小さい場合完全に素因数分解出来ていない可能性がある\n int[] result=new int[size];\n for(int i=2;n>1&&i< result.length;i++){\n while(n%i==0){\n result[i]++;\n n/=i;\n }\n }\n return result;\n\n }",
"factoringInPrimeNumbers",
"{\n //素因数分解\n //sizeがnに比べて小さい場合完全に素因数分解出来ていない可能性がある\n int[] result=new int[size];\n for(int i=2;n>1&&i< result.length;i++){\n while(n%i==0){\n result[i]++;\n n/=i;\n }\n }\n return result;\n\n }",
"int[] result=new int[size];",
"result",
"new int[size]",
"size",
"for(int i=2;n>1&&i< result.length;i++){\n while(n%i==0){\n result[i]++;\n n/=i;\n }\n }",
"int i=2;",
"int i=2;",
"i",
"2",
"n>1&&i< result.length",
"n>1",
"n",
"1",
"i< result.length",
"i",
"result.length",
"result",
"result.length",
"i++",
"i++",
"i",
"{\n while(n%i==0){\n result[i]++;\n n/=i;\n }\n }",
"{\n while(n%i==0){\n result[i]++;\n n/=i;\n }\n }",
"while(n%i==0){\n result[i]++;\n n/=i;\n }",
"n%i==0",
"n%i",
"n",
"i",
"0",
"{\n result[i]++;\n n/=i;\n }",
"result[i]++",
"result[i]",
"result",
"i",
"n/=i",
"n",
"i",
"return result;",
"result",
"long n",
"n",
"int size",
"size",
"public class Main {\n public static void main(String[] args) {\n Scanner scanner=new Scanner();\n final String s = scanner.next();\n final String t = scanner.next();\n int ans=Integer.MAX_VALUE;\n for (int i = 0; i <= s.length() - t.length(); i++) {\n int count=0;\n for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)!=t.charAt(j)){\n count++;\n }\n }\n ans = min(count, ans);\n }\n put(ans);\n\n }\n\n public static int upper_bound(int[] a,int val){\n return upper_bound(a,0,a.length,val);\n }\n public static int upper_bound(int[] a,int l,int r,int val){\n if(r-l==1){\n if(a[l]>val) return l;\n return r;\n }\n int mid=(l+r)/2;\n if(a[mid]>val){\n return upper_bound(a,l,mid,val);\n }else{\n return upper_bound(a,mid,r,val);\n }\n }\n public static <T> int upper_bound(T[] a,int l,int r,T val,Comparator<T> comparator){\n if(r-l==1){\n if(comparator.compare(a[l],val)>0) return l;\n return r;\n }\n int mid=(l+r)/2;\n if(comparator.compare(a[mid],val)>0){\n return upper_bound(a,l,mid,val,comparator);\n }else{\n return upper_bound(a,mid,r,val,comparator);\n }\n }\n public static int lower_bound(int[] a,int val){\n return lower_bound(a,0,a.length,val);\n }\n public static int lower_bound(int[] a,int l,int r,int val){\n if(r-l==1){\n if(a[l]<val) return r;\n return l;\n }\n int mid=(l+r)/2;\n if(a[mid]<val){\n return lower_bound(a,mid,r,val);\n }else{\n return lower_bound(a,l,mid,val);\n }\n\n }\n\n public static <T> int lower_bound(T[] a,int l,int r,T val,Comparator<T> comparator){\n if(r-l==1){\n if(comparator.compare(a[l],val)<0) return r;\n return l;\n }\n int mid=(l+r)/2;\n if(comparator.compare(a[mid],val)<0){\n return lower_bound(a,mid,r,val,comparator);\n }else{\n return lower_bound(a,l,mid,val,comparator);\n }\n }\n\n\n public static void print(Object object){\n System.out.print(object);\n }\n public static void put(Object object) {\n System.out.println(object);\n }\n public static void put(){\n System.out.println();\n }\n\n final static private class Scanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n final static private class FixedPair {\n final private long x, y;\n final static public FixedPair ZEROS=new FixedPair(0,0);\n FixedPair(long x, long y) {\n this.x = x;\n this.y = y;\n }\n\n public long getX() {\n return x;\n }\n\n public long getY() {\n return y;\n }\n\n @Override\n public int hashCode() {\n return (int)x+(int)y;\n }\n\n @Override\n public boolean equals(Object obj) {\n boolean result=super.equals(obj);\n if(obj.getClass()!=this.getClass()){\n return false;\n }\n FixedPair pair=(FixedPair)obj;\n if(this.x==pair.x&&this.y==pair.y) return true;\n return false;\n }\n\n @Override\n public String toString() {\n return String.format(\"(%d,%d)\", x, y);\n }\n }\n final static private class Tuple<T,V>{\n //immutabl1でないことに注意(T,Vがmutableの場合変更可能)\n final private T t;\n final private V v;\n Tuple(T t,V v){\n this.t=t;\n this.v=v;\n }\n\n public T getT() {\n return t;\n }\n\n public V getV() {\n return v;\n }\n\n @Override\n public int hashCode() {\n return (t.hashCode()+v.hashCode());\n }\n\n @Override\n @SuppressWarnings(\"unchecked\")\n public boolean equals(Object obj) {\n if(obj.getClass()!=this.getClass()){\n return false;\n }\n Tuple<T,V> tuple=(Tuple<T, V>) obj;\n return tuple.t.equals(this.t)&&tuple.v.equals(this.v);\n }\n\n @Override\n public String toString() {\n return String.format(\"<Tuple>=<%s,%s>\",t,v);\n }\n }\n final static private class Util {\n static long gcd(long a,long b){\n //最大公約数 \n if(a%b==0)return b;\n return gcd(b,a%b);\n }\n static long lcm(long a,long b){\n //最小公倍数\n long gcd=gcd(a,b);\n long result=b/gcd;\n return a*result;\n }\n static long kaijoMod(int n,int mod){\n if(n<1) return -1;\n long result=1;\n for(int i=n;i>1;i--){\n result*=i;\n result%=mod;\n }\n return result;\n }\n static <T extends Comparable<T>> Map<T,Integer> count(List<T> list){\n //副作用\n Collections.sort(list);\n Map<T,Integer> result=new HashMap<>();\n int l=0,r=0;\n while(l<list.size()){\n while(r<list.size()-1&&list.get(r).equals(r+1)){\n r++;\n }\n result.put(list.get(r),r-l+1);\n r++;\n l=r;\n }\n return result;\n\n }\n static Map<Integer,Integer> count(int[] array){\n //副作用\n Arrays.sort(array);\n Map<Integer,Integer> result=new HashMap<>();\n int l=0,r=0;\n while(l<array.length){\n while(r<array.length-1&&array[r]==array[r+1]){\n r++;\n }\n result.put(array[l],r-l+1);\n r++;\n l=r;\n }\n return result;\n }\n static <T> String toStringBWS(Iterable<T> iterable){\n Iterator<T> ite=iterable.iterator();\n return toStringBWS(ite);\n }\n static <T> String toStringBWS(Iterator<T> ite){\n StringBuilder sb=new StringBuilder();\n sb.append(ite.next());\n while(ite.hasNext()){\n sb.append(\" \");\n sb.append(ite.next());\n }\n return sb.toString();\n }\n static int[] factoringInPrimeNumbers(long n,int size){\n //素因数分解\n //sizeがnに比べて小さい場合完全に素因数分解出来ていない可能性がある\n int[] result=new int[size];\n for(int i=2;n>1&&i< result.length;i++){\n while(n%i==0){\n result[i]++;\n n/=i;\n }\n }\n return result;\n\n }\n }\n}",
"public class Main {\n public static void main(String[] args) {\n Scanner scanner=new Scanner();\n final String s = scanner.next();\n final String t = scanner.next();\n int ans=Integer.MAX_VALUE;\n for (int i = 0; i <= s.length() - t.length(); i++) {\n int count=0;\n for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)!=t.charAt(j)){\n count++;\n }\n }\n ans = min(count, ans);\n }\n put(ans);\n\n }\n\n public static int upper_bound(int[] a,int val){\n return upper_bound(a,0,a.length,val);\n }\n public static int upper_bound(int[] a,int l,int r,int val){\n if(r-l==1){\n if(a[l]>val) return l;\n return r;\n }\n int mid=(l+r)/2;\n if(a[mid]>val){\n return upper_bound(a,l,mid,val);\n }else{\n return upper_bound(a,mid,r,val);\n }\n }\n public static <T> int upper_bound(T[] a,int l,int r,T val,Comparator<T> comparator){\n if(r-l==1){\n if(comparator.compare(a[l],val)>0) return l;\n return r;\n }\n int mid=(l+r)/2;\n if(comparator.compare(a[mid],val)>0){\n return upper_bound(a,l,mid,val,comparator);\n }else{\n return upper_bound(a,mid,r,val,comparator);\n }\n }\n public static int lower_bound(int[] a,int val){\n return lower_bound(a,0,a.length,val);\n }\n public static int lower_bound(int[] a,int l,int r,int val){\n if(r-l==1){\n if(a[l]<val) return r;\n return l;\n }\n int mid=(l+r)/2;\n if(a[mid]<val){\n return lower_bound(a,mid,r,val);\n }else{\n return lower_bound(a,l,mid,val);\n }\n\n }\n\n public static <T> int lower_bound(T[] a,int l,int r,T val,Comparator<T> comparator){\n if(r-l==1){\n if(comparator.compare(a[l],val)<0) return r;\n return l;\n }\n int mid=(l+r)/2;\n if(comparator.compare(a[mid],val)<0){\n return lower_bound(a,mid,r,val,comparator);\n }else{\n return lower_bound(a,l,mid,val,comparator);\n }\n }\n\n\n public static void print(Object object){\n System.out.print(object);\n }\n public static void put(Object object) {\n System.out.println(object);\n }\n public static void put(){\n System.out.println();\n }\n\n final static private class Scanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n final static private class FixedPair {\n final private long x, y;\n final static public FixedPair ZEROS=new FixedPair(0,0);\n FixedPair(long x, long y) {\n this.x = x;\n this.y = y;\n }\n\n public long getX() {\n return x;\n }\n\n public long getY() {\n return y;\n }\n\n @Override\n public int hashCode() {\n return (int)x+(int)y;\n }\n\n @Override\n public boolean equals(Object obj) {\n boolean result=super.equals(obj);\n if(obj.getClass()!=this.getClass()){\n return false;\n }\n FixedPair pair=(FixedPair)obj;\n if(this.x==pair.x&&this.y==pair.y) return true;\n return false;\n }\n\n @Override\n public String toString() {\n return String.format(\"(%d,%d)\", x, y);\n }\n }\n final static private class Tuple<T,V>{\n //immutabl1でないことに注意(T,Vがmutableの場合変更可能)\n final private T t;\n final private V v;\n Tuple(T t,V v){\n this.t=t;\n this.v=v;\n }\n\n public T getT() {\n return t;\n }\n\n public V getV() {\n return v;\n }\n\n @Override\n public int hashCode() {\n return (t.hashCode()+v.hashCode());\n }\n\n @Override\n @SuppressWarnings(\"unchecked\")\n public boolean equals(Object obj) {\n if(obj.getClass()!=this.getClass()){\n return false;\n }\n Tuple<T,V> tuple=(Tuple<T, V>) obj;\n return tuple.t.equals(this.t)&&tuple.v.equals(this.v);\n }\n\n @Override\n public String toString() {\n return String.format(\"<Tuple>=<%s,%s>\",t,v);\n }\n }\n final static private class Util {\n static long gcd(long a,long b){\n //最大公約数 \n if(a%b==0)return b;\n return gcd(b,a%b);\n }\n static long lcm(long a,long b){\n //最小公倍数\n long gcd=gcd(a,b);\n long result=b/gcd;\n return a*result;\n }\n static long kaijoMod(int n,int mod){\n if(n<1) return -1;\n long result=1;\n for(int i=n;i>1;i--){\n result*=i;\n result%=mod;\n }\n return result;\n }\n static <T extends Comparable<T>> Map<T,Integer> count(List<T> list){\n //副作用\n Collections.sort(list);\n Map<T,Integer> result=new HashMap<>();\n int l=0,r=0;\n while(l<list.size()){\n while(r<list.size()-1&&list.get(r).equals(r+1)){\n r++;\n }\n result.put(list.get(r),r-l+1);\n r++;\n l=r;\n }\n return result;\n\n }\n static Map<Integer,Integer> count(int[] array){\n //副作用\n Arrays.sort(array);\n Map<Integer,Integer> result=new HashMap<>();\n int l=0,r=0;\n while(l<array.length){\n while(r<array.length-1&&array[r]==array[r+1]){\n r++;\n }\n result.put(array[l],r-l+1);\n r++;\n l=r;\n }\n return result;\n }\n static <T> String toStringBWS(Iterable<T> iterable){\n Iterator<T> ite=iterable.iterator();\n return toStringBWS(ite);\n }\n static <T> String toStringBWS(Iterator<T> ite){\n StringBuilder sb=new StringBuilder();\n sb.append(ite.next());\n while(ite.hasNext()){\n sb.append(\" \");\n sb.append(ite.next());\n }\n return sb.toString();\n }\n static int[] factoringInPrimeNumbers(long n,int size){\n //素因数分解\n //sizeがnに比べて小さい場合完全に素因数分解出来ていない可能性がある\n int[] result=new int[size];\n for(int i=2;n>1&&i< result.length;i++){\n while(n%i==0){\n result[i]++;\n n/=i;\n }\n }\n return result;\n\n }\n }\n}",
"Main"
]
|
import java.io.IOException;
import java.io.InputStream;
import java.util.*;
import java.util.List;
import java.util.jar.JarEntry;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
import static java.lang.Math.max;
import static java.lang.Math.min;
import static java.lang.Math.pow;
import static java.lang.String.format;
public class Main {
public static void main(String[] args) {
Scanner scanner=new Scanner();
final String s = scanner.next();
final String t = scanner.next();
int ans=Integer.MAX_VALUE;
for (int i = 0; i <= s.length() - t.length(); i++) {
int count=0;
for (int j = 0; j < t.length(); j++) {
if(s.charAt(i+j)!=t.charAt(j)){
count++;
}
}
ans = min(count, ans);
}
put(ans);
}
public static int upper_bound(int[] a,int val){
return upper_bound(a,0,a.length,val);
}
public static int upper_bound(int[] a,int l,int r,int val){
if(r-l==1){
if(a[l]>val) return l;
return r;
}
int mid=(l+r)/2;
if(a[mid]>val){
return upper_bound(a,l,mid,val);
}else{
return upper_bound(a,mid,r,val);
}
}
public static <T> int upper_bound(T[] a,int l,int r,T val,Comparator<T> comparator){
if(r-l==1){
if(comparator.compare(a[l],val)>0) return l;
return r;
}
int mid=(l+r)/2;
if(comparator.compare(a[mid],val)>0){
return upper_bound(a,l,mid,val,comparator);
}else{
return upper_bound(a,mid,r,val,comparator);
}
}
public static int lower_bound(int[] a,int val){
return lower_bound(a,0,a.length,val);
}
public static int lower_bound(int[] a,int l,int r,int val){
if(r-l==1){
if(a[l]<val) return r;
return l;
}
int mid=(l+r)/2;
if(a[mid]<val){
return lower_bound(a,mid,r,val);
}else{
return lower_bound(a,l,mid,val);
}
}
public static <T> int lower_bound(T[] a,int l,int r,T val,Comparator<T> comparator){
if(r-l==1){
if(comparator.compare(a[l],val)<0) return r;
return l;
}
int mid=(l+r)/2;
if(comparator.compare(a[mid],val)<0){
return lower_bound(a,mid,r,val,comparator);
}else{
return lower_bound(a,l,mid,val,comparator);
}
}
public static void print(Object object){
System.out.print(object);
}
public static void put(Object object) {
System.out.println(object);
}
public static void put(){
System.out.println();
}
final static private class Scanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte())
return buffer[ptr++];
else
return -1;
}
private boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[ptr]))
ptr++;
return hasNextByte();
}
public String next() {
if (!hasNext())
throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext())
throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() {
return Double.parseDouble(next());
}
}
final static private class FixedPair {
final private long x, y;
final static public FixedPair ZEROS=new FixedPair(0,0);
FixedPair(long x, long y) {
this.x = x;
this.y = y;
}
public long getX() {
return x;
}
public long getY() {
return y;
}
@Override
public int hashCode() {
return (int)x+(int)y;
}
@Override
public boolean equals(Object obj) {
boolean result=super.equals(obj);
if(obj.getClass()!=this.getClass()){
return false;
}
FixedPair pair=(FixedPair)obj;
if(this.x==pair.x&&this.y==pair.y) return true;
return false;
}
@Override
public String toString() {
return String.format("(%d,%d)", x, y);
}
}
final static private class Tuple<T,V>{
//immutabl1でないことに注意(T,Vがmutableの場合変更可能)
final private T t;
final private V v;
Tuple(T t,V v){
this.t=t;
this.v=v;
}
public T getT() {
return t;
}
public V getV() {
return v;
}
@Override
public int hashCode() {
return (t.hashCode()+v.hashCode());
}
@Override
@SuppressWarnings("unchecked")
public boolean equals(Object obj) {
if(obj.getClass()!=this.getClass()){
return false;
}
Tuple<T,V> tuple=(Tuple<T, V>) obj;
return tuple.t.equals(this.t)&&tuple.v.equals(this.v);
}
@Override
public String toString() {
return String.format("<Tuple>=<%s,%s>",t,v);
}
}
final static private class Util {
static long gcd(long a,long b){
//最大公約数
if(a%b==0)return b;
return gcd(b,a%b);
}
static long lcm(long a,long b){
//最小公倍数
long gcd=gcd(a,b);
long result=b/gcd;
return a*result;
}
static long kaijoMod(int n,int mod){
if(n<1) return -1;
long result=1;
for(int i=n;i>1;i--){
result*=i;
result%=mod;
}
return result;
}
static <T extends Comparable<T>> Map<T,Integer> count(List<T> list){
//副作用
Collections.sort(list);
Map<T,Integer> result=new HashMap<>();
int l=0,r=0;
while(l<list.size()){
while(r<list.size()-1&&list.get(r).equals(r+1)){
r++;
}
result.put(list.get(r),r-l+1);
r++;
l=r;
}
return result;
}
static Map<Integer,Integer> count(int[] array){
//副作用
Arrays.sort(array);
Map<Integer,Integer> result=new HashMap<>();
int l=0,r=0;
while(l<array.length){
while(r<array.length-1&&array[r]==array[r+1]){
r++;
}
result.put(array[l],r-l+1);
r++;
l=r;
}
return result;
}
static <T> String toStringBWS(Iterable<T> iterable){
Iterator<T> ite=iterable.iterator();
return toStringBWS(ite);
}
static <T> String toStringBWS(Iterator<T> ite){
StringBuilder sb=new StringBuilder();
sb.append(ite.next());
while(ite.hasNext()){
sb.append(" ");
sb.append(ite.next());
}
return sb.toString();
}
static int[] factoringInPrimeNumbers(long n,int size){
//素因数分解
//sizeがnに比べて小さい場合完全に素因数分解出来ていない可能性がある
int[] result=new int[size];
for(int i=2;n>1&&i< result.length;i++){
while(n%i==0){
result[i]++;
n/=i;
}
}
return result;
}
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
41,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
2,
18,
13,
13,
18,
13,
13,
17,
1,
40,
13,
30,
30,
0,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
14,
2,
18,
13,
2,
13,
13,
18,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
2,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
101,
5
],
[
101,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
16,
17
],
[
17,
18
],
[
8,
19
],
[
19,
20
],
[
19,
21
],
[
21,
22
],
[
22,
23
],
[
23,
24
],
[
24,
25
],
[
8,
26
],
[
26,
27
],
[
8,
28
],
[
28,
29
],
[
28,
30
],
[
8,
31
],
[
31,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
31,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
39,
43
],
[
43,
44
],
[
43,
45
],
[
38,
46
],
[
31,
47
],
[
47,
48
],
[
48,
49
],
[
31,
50
],
[
51,
51
],
[
51,
52
],
[
52,
53
],
[
52,
54
],
[
51,
55
],
[
55,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
55,
60
],
[
60,
61
],
[
60,
62
],
[
62,
63
],
[
62,
64
],
[
55,
65
],
[
65,
66
],
[
66,
67
],
[
55,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
73,
74
],
[
73,
75
],
[
70,
76
],
[
76,
77
],
[
76,
78
],
[
69,
79
],
[
79,
80
],
[
51,
81
],
[
81,
82
],
[
81,
83
],
[
83,
84
],
[
84,
85
],
[
83,
86
],
[
83,
87
],
[
8,
88
],
[
88,
89
],
[
89,
90
],
[
90,
91
],
[
90,
92
],
[
88,
93
],
[
93,
94
],
[
94,
95
],
[
94,
96
],
[
93,
97
],
[
6,
98
],
[
98,
99
],
[
0,
100
],
[
100,
101
],
[
100,
102
]
]
| [
"import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tchar[] S = sc.next().toCharArray();\n\t\tchar[] T = sc.next().toCharArray();\n\t\tint c, max= 0;\n\t\tfor(int i = 0; i < S.length - T.length + 1; i++) {\n\t\t\tc = 0;\n\t\t\tfor(int j = 0; j < T.length; j++)\n\t\t\t\tif(S[i+j] == T[j])\n\t\t\t\t\tc++;\n\t\t\tmax = Math.max(max, c);\n\t\t}\n\t\tSystem.out.println(T.length - max);\n\t}\n\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tchar[] S = sc.next().toCharArray();\n\t\tchar[] T = sc.next().toCharArray();\n\t\tint c, max= 0;\n\t\tfor(int i = 0; i < S.length - T.length + 1; i++) {\n\t\t\tc = 0;\n\t\t\tfor(int j = 0; j < T.length; j++)\n\t\t\t\tif(S[i+j] == T[j])\n\t\t\t\t\tc++;\n\t\t\tmax = Math.max(max, c);\n\t\t}\n\t\tSystem.out.println(T.length - max);\n\t}\n\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tchar[] S = sc.next().toCharArray();\n\t\tchar[] T = sc.next().toCharArray();\n\t\tint c, max= 0;\n\t\tfor(int i = 0; i < S.length - T.length + 1; i++) {\n\t\t\tc = 0;\n\t\t\tfor(int j = 0; j < T.length; j++)\n\t\t\t\tif(S[i+j] == T[j])\n\t\t\t\t\tc++;\n\t\t\tmax = Math.max(max, c);\n\t\t}\n\t\tSystem.out.println(T.length - max);\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tchar[] S = sc.next().toCharArray();\n\t\tchar[] T = sc.next().toCharArray();\n\t\tint c, max= 0;\n\t\tfor(int i = 0; i < S.length - T.length + 1; i++) {\n\t\t\tc = 0;\n\t\t\tfor(int j = 0; j < T.length; j++)\n\t\t\t\tif(S[i+j] == T[j])\n\t\t\t\t\tc++;\n\t\t\tmax = Math.max(max, c);\n\t\t}\n\t\tSystem.out.println(T.length - max);\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"char[] S = sc.next().toCharArray();",
"S",
"sc.next().toCharArray()",
"sc.next().toCharArray",
"sc.next()",
"sc.next",
"sc",
"char[] T = sc.next().toCharArray();",
"T",
"sc.next().toCharArray()",
"sc.next().toCharArray",
"sc.next()",
"sc.next",
"sc",
"int c",
"c",
"max= 0;",
"max",
"0",
"for(int i = 0; i < S.length - T.length + 1; i++) {\n\t\t\tc = 0;\n\t\t\tfor(int j = 0; j < T.length; j++)\n\t\t\t\tif(S[i+j] == T[j])\n\t\t\t\t\tc++;\n\t\t\tmax = Math.max(max, c);\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < S.length - T.length + 1",
"i",
"S.length - T.length + 1",
"S.length - T.length",
"S.length",
"S",
"S.length",
"T.length",
"T",
"T.length",
"1",
"i++",
"i++",
"i",
"{\n\t\t\tc = 0;\n\t\t\tfor(int j = 0; j < T.length; j++)\n\t\t\t\tif(S[i+j] == T[j])\n\t\t\t\t\tc++;\n\t\t\tmax = Math.max(max, c);\n\t\t}",
"{\n\t\t\tc = 0;\n\t\t\tfor(int j = 0; j < T.length; j++)\n\t\t\t\tif(S[i+j] == T[j])\n\t\t\t\t\tc++;\n\t\t\tmax = Math.max(max, c);\n\t\t}",
"c = 0",
"c",
"0",
"for(int j = 0; j < T.length; j++)\n\t\t\t\tif(S[i+j] == T[j])\n\t\t\t\t\tc++;",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < T.length",
"j",
"T.length",
"T",
"T.length",
"j++",
"j++",
"j",
"if(S[i+j] == T[j])\n\t\t\t\t\tc++;",
"if(S[i+j] == T[j])\n\t\t\t\t\tc++;",
"S[i+j] == T[j]",
"S[i+j]",
"S",
"i+j",
"i",
"j",
"T[j]",
"T",
"j",
"c++",
"c",
"max = Math.max(max, c)",
"max",
"Math.max(max, c)",
"Math.max",
"Math",
"max",
"c",
"System.out.println(T.length - max)",
"System.out.println",
"System.out",
"System",
"System.out",
"T.length - max",
"T.length",
"T",
"T.length",
"max",
"String[] args",
"args",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tchar[] S = sc.next().toCharArray();\n\t\tchar[] T = sc.next().toCharArray();\n\t\tint c, max= 0;\n\t\tfor(int i = 0; i < S.length - T.length + 1; i++) {\n\t\t\tc = 0;\n\t\t\tfor(int j = 0; j < T.length; j++)\n\t\t\t\tif(S[i+j] == T[j])\n\t\t\t\t\tc++;\n\t\t\tmax = Math.max(max, c);\n\t\t}\n\t\tSystem.out.println(T.length - max);\n\t}\n\n}",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tchar[] S = sc.next().toCharArray();\n\t\tchar[] T = sc.next().toCharArray();\n\t\tint c, max= 0;\n\t\tfor(int i = 0; i < S.length - T.length + 1; i++) {\n\t\t\tc = 0;\n\t\t\tfor(int j = 0; j < T.length; j++)\n\t\t\t\tif(S[i+j] == T[j])\n\t\t\t\t\tc++;\n\t\t\tmax = Math.max(max, c);\n\t\t}\n\t\tSystem.out.println(T.length - max);\n\t}\n\n}",
"Main"
]
| import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
char[] S = sc.next().toCharArray();
char[] T = sc.next().toCharArray();
int c, max= 0;
for(int i = 0; i < S.length - T.length + 1; i++) {
c = 0;
for(int j = 0; j < T.length; j++)
if(S[i+j] == T[j])
c++;
max = Math.max(max, c);
}
System.out.println(T.length - max);
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
20,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
2,
13,
4,
18,
13,
0,
13,
4,
18,
13,
13,
4,
13,
13,
13,
4,
18,
13,
13,
4,
18,
13,
23,
13,
12,
13,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
30,
40,
13,
29,
13,
23,
13,
23,
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,
13,
13,
13,
30,
0,
13,
2,
13,
17,
30,
0,
13,
13,
29,
2,
4,
18,
13,
13,
17,
23,
13,
23,
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,
13,
13,
13,
30,
0,
13,
2,
13,
17,
30,
0,
13,
13,
14,
2,
13,
4,
18,
13,
30,
29,
40,
17,
29,
13,
23,
13,
23,
13,
6,
13,
41,
13,
20,
41,
13,
20,
12,
13,
30,
42,
40,
4,
18,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
29,
4,
18,
13,
29,
17,
12,
13,
30,
41,
13,
17,
38,
5,
13,
30,
30,
0,
13,
4,
18,
13,
14,
2,
2,
13,
17,
2,
4,
18,
13,
17,
30,
29,
17,
0,
13,
20,
29,
17,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
338,
8
],
[
338,
9
],
[
9,
10
],
[
9,
11
],
[
338,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
14,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
14,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
26,
27
],
[
14,
28
],
[
28,
29
],
[
28,
30
],
[
14,
31
],
[
31,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
31,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
38,
42
],
[
42,
43
],
[
43,
44
],
[
31,
45
],
[
45,
46
],
[
46,
47
],
[
31,
48
],
[
49,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
52,
53
],
[
53,
54
],
[
52,
55
],
[
52,
56
],
[
56,
57
],
[
56,
58
],
[
58,
59
],
[
59,
60
],
[
49,
61
],
[
61,
62
],
[
61,
63
],
[
63,
64
],
[
64,
65
],
[
63,
66
],
[
63,
67
],
[
67,
68
],
[
67,
69
],
[
67,
70
],
[
14,
71
],
[
71,
72
],
[
72,
73
],
[
71,
74
],
[
14,
75
],
[
75,
76
],
[
76,
77
],
[
12,
78
],
[
78,
79
],
[
338,
80
],
[
80,
81
],
[
80,
82
],
[
82,
83
],
[
83,
84
],
[
83,
85
],
[
82,
86
],
[
86,
87
],
[
87,
88
],
[
88,
89
],
[
88,
90
],
[
86,
91
],
[
91,
92
],
[
91,
93
],
[
93,
94
],
[
94,
95
],
[
86,
96
],
[
96,
97
],
[
97,
98
],
[
86,
99
],
[
100,
100
],
[
100,
101
],
[
101,
102
],
[
102,
103
],
[
103,
104
],
[
104,
105
],
[
103,
106
],
[
102,
107
],
[
107,
108
],
[
108,
109
],
[
107,
110
],
[
101,
111
],
[
111,
112
],
[
112,
113
],
[
82,
114
],
[
114,
115
],
[
80,
116
],
[
116,
117
],
[
80,
118
],
[
118,
119
],
[
338,
120
],
[
120,
121
],
[
120,
122
],
[
122,
123
],
[
123,
124
],
[
123,
125
],
[
122,
126
],
[
126,
127
],
[
126,
128
],
[
128,
129
],
[
129,
130
],
[
122,
131
],
[
131,
132
],
[
132,
133
],
[
132,
134
],
[
131,
135
],
[
135,
136
],
[
136,
137
],
[
136,
138
],
[
138,
139
],
[
139,
140
],
[
139,
141
],
[
138,
142
],
[
135,
143
],
[
143,
144
],
[
144,
145
],
[
145,
146
],
[
146,
147
],
[
145,
148
],
[
144,
149
],
[
143,
150
],
[
150,
151
],
[
151,
152
],
[
151,
153
],
[
153,
154
],
[
153,
155
],
[
143,
156
],
[
156,
157
],
[
157,
158
],
[
157,
159
],
[
122,
160
],
[
160,
161
],
[
161,
162
],
[
162,
163
],
[
163,
164
],
[
162,
165
],
[
161,
166
],
[
120,
167
],
[
167,
168
],
[
120,
169
],
[
169,
170
],
[
338,
171
],
[
171,
172
],
[
171,
173
],
[
173,
174
],
[
174,
175
],
[
174,
176
],
[
173,
177
],
[
177,
178
],
[
177,
179
],
[
179,
180
],
[
180,
181
],
[
173,
182
],
[
182,
183
],
[
183,
184
],
[
183,
185
],
[
182,
186
],
[
186,
187
],
[
187,
188
],
[
187,
189
],
[
189,
190
],
[
190,
191
],
[
190,
192
],
[
189,
193
],
[
186,
194
],
[
194,
195
],
[
195,
196
],
[
196,
197
],
[
197,
198
],
[
196,
199
],
[
195,
200
],
[
194,
201
],
[
201,
202
],
[
202,
203
],
[
202,
204
],
[
204,
205
],
[
204,
206
],
[
194,
207
],
[
207,
208
],
[
208,
209
],
[
208,
210
],
[
173,
211
],
[
211,
212
],
[
212,
213
],
[
212,
214
],
[
214,
215
],
[
215,
216
],
[
211,
217
],
[
217,
218
],
[
218,
219
],
[
219,
220
],
[
173,
221
],
[
221,
222
],
[
171,
223
],
[
223,
224
],
[
171,
225
],
[
225,
226
],
[
338,
227
],
[
227,
228
],
[
227,
229
],
[
229,
230
],
[
229,
231
],
[
227,
232
],
[
232,
233
],
[
232,
234
],
[
227,
235
],
[
235,
236
],
[
235,
237
],
[
237,
238
],
[
238,
239
],
[
239,
240
],
[
240,
241
],
[
241,
242
],
[
238,
243
],
[
243,
244
],
[
244,
245
],
[
245,
246
],
[
245,
247
],
[
247,
248
],
[
248,
249
],
[
249,
250
],
[
244,
251
],
[
251,
252
],
[
252,
253
],
[
252,
254
],
[
237,
255
],
[
255,
256
],
[
256,
257
],
[
257,
258
],
[
227,
259
],
[
259,
260
],
[
259,
261
],
[
261,
262
],
[
262,
263
],
[
263,
264
],
[
264,
265
],
[
263,
266
],
[
266,
267
],
[
227,
268
],
[
268,
269
],
[
268,
270
],
[
270,
271
],
[
271,
272
],
[
272,
273
],
[
273,
274
],
[
272,
275
],
[
275,
276
],
[
227,
277
],
[
277,
278
],
[
277,
279
],
[
279,
280
],
[
280,
281
],
[
281,
282
],
[
282,
283
],
[
281,
284
],
[
284,
285
],
[
227,
286
],
[
286,
287
],
[
286,
288
],
[
288,
289
],
[
289,
290
],
[
290,
291
],
[
290,
292
],
[
292,
293
],
[
293,
294
],
[
294,
295
],
[
289,
296
],
[
296,
297
],
[
297,
298
],
[
298,
299
],
[
299,
300
],
[
288,
301
],
[
301,
302
],
[
227,
303
],
[
303,
304
],
[
303,
305
],
[
305,
306
],
[
306,
307
],
[
306,
308
],
[
305,
309
],
[
309,
310
],
[
310,
311
],
[
310,
312
],
[
309,
313
],
[
313,
314
],
[
314,
315
],
[
314,
316
],
[
316,
317
],
[
317,
318
],
[
305,
319
],
[
319,
320
],
[
320,
321
],
[
321,
322
],
[
321,
323
],
[
320,
324
],
[
324,
325
],
[
325,
326
],
[
326,
327
],
[
324,
328
],
[
319,
329
],
[
329,
330
],
[
330,
331
],
[
305,
332
],
[
332,
333
],
[
332,
334
],
[
305,
335
],
[
335,
336
],
[
0,
337
],
[
337,
338
],
[
337,
339
]
]
| [
"/*\n Author: @__goku__\n [email protected]\n\n `\\-. `\n \\ `. `\n \\ \\ |\n __.._ | \\. S O N - G O K U\n ..---~~ ~ . | Y\n ~-. `| |\n `. `~~--.\n \\ ~.\n \\ \\__. . -- - .\n .-~~~~~ , , ~~~~~~---...._\n .-~___ ,'/ ,'/ ,'\\ __...---~~~\n ~-. /._\\_( ,(/_. 7,-. ~~---...__\n _...>- P\"\"6=`_/\"6\"~ 6) ___...--~~~\n ~~--._ \\`--') `---' 9' _..--~~~\n ~\\ ~~/_ ~~~ /`-.--~~\n `. --- .' \\_\n `. \" _.-' | ~-.,-------._\n ..._../~~ ./ .-' .-~~~-.\n ,--~~~ ,'...\\` _./.----~~.'/ /' `-\n _.-( |\\ `/~ _____..-' / / _.-~~`.\n / | /. ^---~~~~ ' / / ,' ~. \\\n ( / ( . _ ' /' / ,/ \\ )\n (`. | `\\ - - - - ~ /' ( / . |\n \\.\\| \\ /' \\ |`. /\n /.'\\\\ `\\ /' ~-\\ . /\\\n /, ( `\\ /' `.___..- \\\n | | \\ `\\_/' // \\. |\n | | | _Seal_ /' | | |\n */\n\nimport java.io.*;\nimport java.util.*;\n\npublic class Main\n{\n static PrintWriter out = new PrintWriter((System.out));\n\n public static void main(String args[]) throws IOException\n {\n Kioken sc = new Kioken();\n String s=sc.next();\n String t=sc.next();\n int ans=(int)1e9;\n for(int x=0;x<=s.length()-t.length();x++)\n {\n String a=s.substring(x,x+t.length());\n ans=Math.min(ans,kamehameha(a,t));\n }\n out.println(ans);\n out.close();\n }\n\n public static int kamehameha(String a, String t)\n {\n int ans=0;\n for(int x=0;x<a.length();x++)\n {\n if(a.charAt(x)!=t.charAt(x))\n {\n ans++;\n }\n }\n return ans;\n }\n\n public static int lower_bound(ArrayList<Integer> ar, int k)\n {\n int s = 0, e = ar.size();\n while (s != e)\n {\n int mid = s + e >> 1;\n if (ar.get(mid) <= k)\n {\n s = mid + 1;\n }\n else\n {\n e = mid;\n }\n }\n return Math.abs(s) - 1;\n }\n\n public static int upper_bound(ArrayList<Integer> ar, int k)\n {\n int s = 0;\n int e = ar.size();\n while (s != e)\n {\n int mid = s + e >> 1;\n if (ar.get(mid) < k)\n {\n s = mid + 1;\n }\n else\n {\n e = mid;\n }\n }\n if (s == ar.size())\n {\n return -1;\n }\n return s;\n }\n\n static class Kioken\n {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(\"\");\n\n public String next()\n {\n while (!st.hasMoreTokens())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n public int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n public long nextLong()\n {\n return Long.parseLong(next());\n }\n\n public double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n public String nextLine()\n {\n try\n {\n return br.readLine();\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }\n return null;\n }\n\n public boolean hasNext()\n {\n String next = null;\n try\n {\n next = br.readLine();\n }\n catch (Exception e)\n {\n }\n if (next == null || next.length() == 0)\n {\n return false;\n }\n st = new StringTokenizer(next);\n return true;\n }\n }\n}",
"import java.io.*;",
"io.*",
"java",
"import java.util.*;",
"util.*",
"java",
"public class Main\n{\n static PrintWriter out = new PrintWriter((System.out));\n\n public static void main(String args[]) throws IOException\n {\n Kioken sc = new Kioken();\n String s=sc.next();\n String t=sc.next();\n int ans=(int)1e9;\n for(int x=0;x<=s.length()-t.length();x++)\n {\n String a=s.substring(x,x+t.length());\n ans=Math.min(ans,kamehameha(a,t));\n }\n out.println(ans);\n out.close();\n }\n\n public static int kamehameha(String a, String t)\n {\n int ans=0;\n for(int x=0;x<a.length();x++)\n {\n if(a.charAt(x)!=t.charAt(x))\n {\n ans++;\n }\n }\n return ans;\n }\n\n public static int lower_bound(ArrayList<Integer> ar, int k)\n {\n int s = 0, e = ar.size();\n while (s != e)\n {\n int mid = s + e >> 1;\n if (ar.get(mid) <= k)\n {\n s = mid + 1;\n }\n else\n {\n e = mid;\n }\n }\n return Math.abs(s) - 1;\n }\n\n public static int upper_bound(ArrayList<Integer> ar, int k)\n {\n int s = 0;\n int e = ar.size();\n while (s != e)\n {\n int mid = s + e >> 1;\n if (ar.get(mid) < k)\n {\n s = mid + 1;\n }\n else\n {\n e = mid;\n }\n }\n if (s == ar.size())\n {\n return -1;\n }\n return s;\n }\n\n static class Kioken\n {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(\"\");\n\n public String next()\n {\n while (!st.hasMoreTokens())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n public int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n public long nextLong()\n {\n return Long.parseLong(next());\n }\n\n public double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n public String nextLine()\n {\n try\n {\n return br.readLine();\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }\n return null;\n }\n\n public boolean hasNext()\n {\n String next = null;\n try\n {\n next = br.readLine();\n }\n catch (Exception e)\n {\n }\n if (next == null || next.length() == 0)\n {\n return false;\n }\n st = new StringTokenizer(next);\n return true;\n }\n }\n}",
"Main",
"static PrintWriter out = new PrintWriter((System.out));",
"out",
"new PrintWriter((System.out))",
"public static void main(String args[]) throws IOException\n {\n Kioken sc = new Kioken();\n String s=sc.next();\n String t=sc.next();\n int ans=(int)1e9;\n for(int x=0;x<=s.length()-t.length();x++)\n {\n String a=s.substring(x,x+t.length());\n ans=Math.min(ans,kamehameha(a,t));\n }\n out.println(ans);\n out.close();\n }",
"main",
"{\n Kioken sc = new Kioken();\n String s=sc.next();\n String t=sc.next();\n int ans=(int)1e9;\n for(int x=0;x<=s.length()-t.length();x++)\n {\n String a=s.substring(x,x+t.length());\n ans=Math.min(ans,kamehameha(a,t));\n }\n out.println(ans);\n out.close();\n }",
"Kioken sc = new Kioken();",
"sc",
"new Kioken()",
"String s=sc.next();",
"s",
"sc.next()",
"sc.next",
"sc",
"String t=sc.next();",
"t",
"sc.next()",
"sc.next",
"sc",
"int ans=(int)1e9;",
"ans",
"(int)1e9",
"for(int x=0;x<=s.length()-t.length();x++)\n {\n String a=s.substring(x,x+t.length());\n ans=Math.min(ans,kamehameha(a,t));\n }",
"int x=0;",
"int x=0;",
"x",
"0",
"x<=s.length()-t.length()",
"x",
"s.length()-t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"x++",
"x++",
"x",
"{\n String a=s.substring(x,x+t.length());\n ans=Math.min(ans,kamehameha(a,t));\n }",
"{\n String a=s.substring(x,x+t.length());\n ans=Math.min(ans,kamehameha(a,t));\n }",
"String a=s.substring(x,x+t.length());",
"a",
"s.substring(x,x+t.length())",
"s.substring",
"s",
"x",
"x+t.length()",
"x",
"t.length()",
"t.length",
"t",
"ans=Math.min(ans,kamehameha(a,t))",
"ans",
"Math.min(ans,kamehameha(a,t))",
"Math.min",
"Math",
"ans",
"kamehameha(a,t)",
"kamehameha",
"a",
"t",
"out.println(ans)",
"out.println",
"out",
"ans",
"out.close()",
"out.close",
"out",
"String args[]",
"args",
"public static int kamehameha(String a, String t)\n {\n int ans=0;\n for(int x=0;x<a.length();x++)\n {\n if(a.charAt(x)!=t.charAt(x))\n {\n ans++;\n }\n }\n return ans;\n }",
"kamehameha",
"{\n int ans=0;\n for(int x=0;x<a.length();x++)\n {\n if(a.charAt(x)!=t.charAt(x))\n {\n ans++;\n }\n }\n return ans;\n }",
"int ans=0;",
"ans",
"0",
"for(int x=0;x<a.length();x++)\n {\n if(a.charAt(x)!=t.charAt(x))\n {\n ans++;\n }\n }",
"int x=0;",
"int x=0;",
"x",
"0",
"x<a.length()",
"x",
"a.length()",
"a.length",
"a",
"x++",
"x++",
"x",
"{\n if(a.charAt(x)!=t.charAt(x))\n {\n ans++;\n }\n }",
"{\n if(a.charAt(x)!=t.charAt(x))\n {\n ans++;\n }\n }",
"if(a.charAt(x)!=t.charAt(x))\n {\n ans++;\n }",
"a.charAt(x)!=t.charAt(x)",
"a.charAt(x)",
"a.charAt",
"a",
"x",
"t.charAt(x)",
"t.charAt",
"t",
"x",
"{\n ans++;\n }",
"ans++",
"ans",
"return ans;",
"ans",
"String a",
"a",
"String t",
"t",
"public static int lower_bound(ArrayList<Integer> ar, int k)\n {\n int s = 0, e = ar.size();\n while (s != e)\n {\n int mid = s + e >> 1;\n if (ar.get(mid) <= k)\n {\n s = mid + 1;\n }\n else\n {\n e = mid;\n }\n }\n return Math.abs(s) - 1;\n }",
"lower_bound",
"{\n int s = 0, e = ar.size();\n while (s != e)\n {\n int mid = s + e >> 1;\n if (ar.get(mid) <= k)\n {\n s = mid + 1;\n }\n else\n {\n e = mid;\n }\n }\n return Math.abs(s) - 1;\n }",
"int s = 0",
"s",
"0",
"e = ar.size();",
"e",
"ar.size()",
"ar.size",
"ar",
"while (s != e)\n {\n int mid = s + e >> 1;\n if (ar.get(mid) <= k)\n {\n s = mid + 1;\n }\n else\n {\n e = mid;\n }\n }",
"s != e",
"s",
"e",
"{\n int mid = s + e >> 1;\n if (ar.get(mid) <= k)\n {\n s = mid + 1;\n }\n else\n {\n e = mid;\n }\n }",
"int mid = s + e >> 1;",
"mid",
"s + e >> 1",
"s + e",
"s",
"e",
"1",
"if (ar.get(mid) <= k)\n {\n s = mid + 1;\n }\n else\n {\n e = mid;\n }",
"ar.get(mid) <= k",
"ar.get(mid)",
"ar.get",
"ar",
"mid",
"k",
"{\n s = mid + 1;\n }",
"s = mid + 1",
"s",
"mid + 1",
"mid",
"1",
"{\n e = mid;\n }",
"e = mid",
"e",
"mid",
"return Math.abs(s) - 1;",
"Math.abs(s) - 1",
"Math.abs(s)",
"Math.abs",
"Math",
"s",
"1",
"ArrayList<Integer> ar",
"ar",
"int k",
"k",
"public static int upper_bound(ArrayList<Integer> ar, int k)\n {\n int s = 0;\n int e = ar.size();\n while (s != e)\n {\n int mid = s + e >> 1;\n if (ar.get(mid) < k)\n {\n s = mid + 1;\n }\n else\n {\n e = mid;\n }\n }\n if (s == ar.size())\n {\n return -1;\n }\n return s;\n }",
"upper_bound",
"{\n int s = 0;\n int e = ar.size();\n while (s != e)\n {\n int mid = s + e >> 1;\n if (ar.get(mid) < k)\n {\n s = mid + 1;\n }\n else\n {\n e = mid;\n }\n }\n if (s == ar.size())\n {\n return -1;\n }\n return s;\n }",
"int s = 0;",
"s",
"0",
"int e = ar.size();",
"e",
"ar.size()",
"ar.size",
"ar",
"while (s != e)\n {\n int mid = s + e >> 1;\n if (ar.get(mid) < k)\n {\n s = mid + 1;\n }\n else\n {\n e = mid;\n }\n }",
"s != e",
"s",
"e",
"{\n int mid = s + e >> 1;\n if (ar.get(mid) < k)\n {\n s = mid + 1;\n }\n else\n {\n e = mid;\n }\n }",
"int mid = s + e >> 1;",
"mid",
"s + e >> 1",
"s + e",
"s",
"e",
"1",
"if (ar.get(mid) < k)\n {\n s = mid + 1;\n }\n else\n {\n e = mid;\n }",
"ar.get(mid) < k",
"ar.get(mid)",
"ar.get",
"ar",
"mid",
"k",
"{\n s = mid + 1;\n }",
"s = mid + 1",
"s",
"mid + 1",
"mid",
"1",
"{\n e = mid;\n }",
"e = mid",
"e",
"mid",
"if (s == ar.size())\n {\n return -1;\n }",
"s == ar.size()",
"s",
"ar.size()",
"ar.size",
"ar",
"{\n return -1;\n }",
"return -1;",
"-1",
"1",
"return s;",
"s",
"ArrayList<Integer> ar",
"ar",
"int k",
"k",
"static class Kioken\n {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(\"\");\n\n public String next()\n {\n while (!st.hasMoreTokens())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n public int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n public long nextLong()\n {\n return Long.parseLong(next());\n }\n\n public double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n public String nextLine()\n {\n try\n {\n return br.readLine();\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }\n return null;\n }\n\n public boolean hasNext()\n {\n String next = null;\n try\n {\n next = br.readLine();\n }\n catch (Exception e)\n {\n }\n if (next == null || next.length() == 0)\n {\n return false;\n }\n st = new StringTokenizer(next);\n return true;\n }\n }",
"Kioken",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"StringTokenizer st = new StringTokenizer(\"\");",
"st",
"new StringTokenizer(\"\")",
"public String next()\n {\n while (!st.hasMoreTokens())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }",
"next",
"{\n while (!st.hasMoreTokens())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }",
"while (!st.hasMoreTokens())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }\n }",
"!st.hasMoreTokens()",
"st.hasMoreTokens()",
"st.hasMoreTokens",
"st",
"{\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }\n }",
"try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }",
"catch (Exception e)\n {\n e.printStackTrace();\n }",
"Exception e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n st = new StringTokenizer(br.readLine());\n }",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"public int nextInt()\n {\n return Integer.parseInt(next());\n }",
"nextInt",
"{\n return Integer.parseInt(next());\n }",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"public long nextLong()\n {\n return Long.parseLong(next());\n }",
"nextLong",
"{\n return Long.parseLong(next());\n }",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"public double nextDouble()\n {\n return Double.parseDouble(next());\n }",
"nextDouble",
"{\n return Double.parseDouble(next());\n }",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"public String nextLine()\n {\n try\n {\n return br.readLine();\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }\n return null;\n }",
"nextLine",
"{\n try\n {\n return br.readLine();\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }\n return null;\n }",
"try\n {\n return br.readLine();\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }",
"catch (Exception e)\n {\n e.printStackTrace();\n }",
"Exception e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n return br.readLine();\n }",
"return br.readLine();",
"br.readLine()",
"br.readLine",
"br",
"return null;",
"null",
"public boolean hasNext()\n {\n String next = null;\n try\n {\n next = br.readLine();\n }\n catch (Exception e)\n {\n }\n if (next == null || next.length() == 0)\n {\n return false;\n }\n st = new StringTokenizer(next);\n return true;\n }",
"hasNext",
"{\n String next = null;\n try\n {\n next = br.readLine();\n }\n catch (Exception e)\n {\n }\n if (next == null || next.length() == 0)\n {\n return false;\n }\n st = new StringTokenizer(next);\n return true;\n }",
"String next = null;",
"next",
"null",
"try\n {\n next = br.readLine();\n }\n catch (Exception e)\n {\n }",
"catch (Exception e)\n {\n }",
"Exception e",
"{\n }",
"{\n next = br.readLine();\n }",
"next = br.readLine()",
"next",
"br.readLine()",
"br.readLine",
"br",
"if (next == null || next.length() == 0)\n {\n return false;\n }",
"next == null || next.length() == 0",
"next == null",
"next",
"null",
"next.length() == 0",
"next.length()",
"next.length",
"next",
"0",
"{\n return false;\n }",
"return false;",
"false",
"st = new StringTokenizer(next)",
"st",
"new StringTokenizer(next)",
"return true;",
"true",
"public class Main\n{\n static PrintWriter out = new PrintWriter((System.out));\n\n public static void main(String args[]) throws IOException\n {\n Kioken sc = new Kioken();\n String s=sc.next();\n String t=sc.next();\n int ans=(int)1e9;\n for(int x=0;x<=s.length()-t.length();x++)\n {\n String a=s.substring(x,x+t.length());\n ans=Math.min(ans,kamehameha(a,t));\n }\n out.println(ans);\n out.close();\n }\n\n public static int kamehameha(String a, String t)\n {\n int ans=0;\n for(int x=0;x<a.length();x++)\n {\n if(a.charAt(x)!=t.charAt(x))\n {\n ans++;\n }\n }\n return ans;\n }\n\n public static int lower_bound(ArrayList<Integer> ar, int k)\n {\n int s = 0, e = ar.size();\n while (s != e)\n {\n int mid = s + e >> 1;\n if (ar.get(mid) <= k)\n {\n s = mid + 1;\n }\n else\n {\n e = mid;\n }\n }\n return Math.abs(s) - 1;\n }\n\n public static int upper_bound(ArrayList<Integer> ar, int k)\n {\n int s = 0;\n int e = ar.size();\n while (s != e)\n {\n int mid = s + e >> 1;\n if (ar.get(mid) < k)\n {\n s = mid + 1;\n }\n else\n {\n e = mid;\n }\n }\n if (s == ar.size())\n {\n return -1;\n }\n return s;\n }\n\n static class Kioken\n {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(\"\");\n\n public String next()\n {\n while (!st.hasMoreTokens())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n public int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n public long nextLong()\n {\n return Long.parseLong(next());\n }\n\n public double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n public String nextLine()\n {\n try\n {\n return br.readLine();\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }\n return null;\n }\n\n public boolean hasNext()\n {\n String next = null;\n try\n {\n next = br.readLine();\n }\n catch (Exception e)\n {\n }\n if (next == null || next.length() == 0)\n {\n return false;\n }\n st = new StringTokenizer(next);\n return true;\n }\n }\n}",
"public class Main\n{\n static PrintWriter out = new PrintWriter((System.out));\n\n public static void main(String args[]) throws IOException\n {\n Kioken sc = new Kioken();\n String s=sc.next();\n String t=sc.next();\n int ans=(int)1e9;\n for(int x=0;x<=s.length()-t.length();x++)\n {\n String a=s.substring(x,x+t.length());\n ans=Math.min(ans,kamehameha(a,t));\n }\n out.println(ans);\n out.close();\n }\n\n public static int kamehameha(String a, String t)\n {\n int ans=0;\n for(int x=0;x<a.length();x++)\n {\n if(a.charAt(x)!=t.charAt(x))\n {\n ans++;\n }\n }\n return ans;\n }\n\n public static int lower_bound(ArrayList<Integer> ar, int k)\n {\n int s = 0, e = ar.size();\n while (s != e)\n {\n int mid = s + e >> 1;\n if (ar.get(mid) <= k)\n {\n s = mid + 1;\n }\n else\n {\n e = mid;\n }\n }\n return Math.abs(s) - 1;\n }\n\n public static int upper_bound(ArrayList<Integer> ar, int k)\n {\n int s = 0;\n int e = ar.size();\n while (s != e)\n {\n int mid = s + e >> 1;\n if (ar.get(mid) < k)\n {\n s = mid + 1;\n }\n else\n {\n e = mid;\n }\n }\n if (s == ar.size())\n {\n return -1;\n }\n return s;\n }\n\n static class Kioken\n {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(\"\");\n\n public String next()\n {\n while (!st.hasMoreTokens())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n public int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n public long nextLong()\n {\n return Long.parseLong(next());\n }\n\n public double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n public String nextLine()\n {\n try\n {\n return br.readLine();\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }\n return null;\n }\n\n public boolean hasNext()\n {\n String next = null;\n try\n {\n next = br.readLine();\n }\n catch (Exception e)\n {\n }\n if (next == null || next.length() == 0)\n {\n return false;\n }\n st = new StringTokenizer(next);\n return true;\n }\n }\n}",
"Main"
]
| /*
Author: @__goku__
[email protected]
`\-. `
\ `. `
\ \ |
__.._ | \. S O N - G O K U
..---~~ ~ . | Y
~-. `| |
`. `~~--.
\ ~.
\ \__. . -- - .
.-~~~~~ , , ~~~~~~---...._
.-~___ ,'/ ,'/ ,'\ __...---~~~
~-. /._\_( ,(/_. 7,-. ~~---...__
_...>- P""6=`_/"6"~ 6) ___...--~~~
~~--._ \`--') `---' 9' _..--~~~
~\ ~~/_ ~~~ /`-.--~~
`. --- .' \_
`. " _.-' | ~-.,-------._
..._../~~ ./ .-' .-~~~-.
,--~~~ ,'...\` _./.----~~.'/ /' `-
_.-( |\ `/~ _____..-' / / _.-~~`.
/ | /. ^---~~~~ ' / / ,' ~. \
( / ( . _ ' /' / ,/ \ )
(`. | `\ - - - - ~ /' ( / . |
\.\| \ /' \ |`. /
/.'\\ `\ /' ~-\ . /\
/, ( `\ /' `.___..- \
| | \ `\_/' // \. |
| | | _Seal_ /' | | |
*/
import java.io.*;
import java.util.*;
public class Main
{
static PrintWriter out = new PrintWriter((System.out));
public static void main(String args[]) throws IOException
{
Kioken sc = new Kioken();
String s=sc.next();
String t=sc.next();
int ans=(int)1e9;
for(int x=0;x<=s.length()-t.length();x++)
{
String a=s.substring(x,x+t.length());
ans=Math.min(ans,kamehameha(a,t));
}
out.println(ans);
out.close();
}
public static int kamehameha(String a, String t)
{
int ans=0;
for(int x=0;x<a.length();x++)
{
if(a.charAt(x)!=t.charAt(x))
{
ans++;
}
}
return ans;
}
public static int lower_bound(ArrayList<Integer> ar, int k)
{
int s = 0, e = ar.size();
while (s != e)
{
int mid = s + e >> 1;
if (ar.get(mid) <= k)
{
s = mid + 1;
}
else
{
e = mid;
}
}
return Math.abs(s) - 1;
}
public static int upper_bound(ArrayList<Integer> ar, int k)
{
int s = 0;
int e = ar.size();
while (s != e)
{
int mid = s + e >> 1;
if (ar.get(mid) < k)
{
s = mid + 1;
}
else
{
e = mid;
}
}
if (s == ar.size())
{
return -1;
}
return s;
}
static class Kioken
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
public String next()
{
while (!st.hasMoreTokens())
{
try
{
st = new StringTokenizer(br.readLine());
}
catch (Exception e)
{
e.printStackTrace();
}
}
return st.nextToken();
}
public int nextInt()
{
return Integer.parseInt(next());
}
public long nextLong()
{
return Long.parseLong(next());
}
public double nextDouble()
{
return Double.parseDouble(next());
}
public String nextLine()
{
try
{
return br.readLine();
}
catch (Exception e)
{
e.printStackTrace();
}
return null;
}
public boolean hasNext()
{
String next = null;
try
{
next = br.readLine();
}
catch (Exception e)
{
}
if (next == null || next.length() == 0)
{
return false;
}
st = new StringTokenizer(next);
return true;
}
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
2,
4,
18,
13,
4,
18,
13,
17,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
2,
4,
18,
13,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
2,
4,
18,
13,
13,
4,
18,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
110,
5
],
[
110,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
8,
25
],
[
25,
26
],
[
26,
27
],
[
27,
28
],
[
27,
29
],
[
25,
30
],
[
30,
31
],
[
30,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
35,
36
],
[
33,
37
],
[
37,
38
],
[
38,
39
],
[
32,
40
],
[
25,
41
],
[
41,
42
],
[
42,
43
],
[
25,
44
],
[
45,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
48,
49
],
[
49,
50
],
[
48,
51
],
[
48,
52
],
[
52,
53
],
[
53,
54
],
[
54,
55
],
[
52,
56
],
[
45,
57
],
[
57,
58
],
[
57,
59
],
[
45,
60
],
[
60,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
60,
65
],
[
65,
66
],
[
65,
67
],
[
67,
68
],
[
68,
69
],
[
60,
70
],
[
70,
71
],
[
71,
72
],
[
60,
73
],
[
74,
74
],
[
74,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
78,
79
],
[
77,
80
],
[
76,
81
],
[
81,
82
],
[
82,
83
],
[
81,
84
],
[
75,
85
],
[
85,
86
],
[
45,
87
],
[
87,
88
],
[
87,
89
],
[
89,
90
],
[
90,
91
],
[
89,
92
],
[
89,
93
],
[
8,
94
],
[
94,
95
],
[
95,
96
],
[
96,
97
],
[
96,
98
],
[
94,
99
],
[
99,
100
],
[
100,
101
],
[
101,
102
],
[
99,
103
],
[
8,
104
],
[
104,
105
],
[
105,
106
],
[
6,
107
],
[
107,
108
],
[
0,
109
],
[
109,
110
],
[
109,
111
]
]
| [
"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\tString t = sc.next();\n\n\t\tint max = 0;\n\t\tfor (int i = 0; i < s.length() - t.length() + 1; i++) {\n\t\t\tString a = s.substring(i, t.length() + i);\n\t\t\tint cnt = 0;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (a.charAt(j) == t.charAt(j)) cnt++;\n\t\t\t}\n\t\t\tmax = Math.max(max, cnt);\n\t\t}\n\n\t\tSystem.out.println(t.length() - max);\n\n\t\tsc.close();\n\n\t}\n\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\tString t = sc.next();\n\n\t\tint max = 0;\n\t\tfor (int i = 0; i < s.length() - t.length() + 1; i++) {\n\t\t\tString a = s.substring(i, t.length() + i);\n\t\t\tint cnt = 0;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (a.charAt(j) == t.charAt(j)) cnt++;\n\t\t\t}\n\t\t\tmax = Math.max(max, cnt);\n\t\t}\n\n\t\tSystem.out.println(t.length() - max);\n\n\t\tsc.close();\n\n\t}\n\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\tString t = sc.next();\n\n\t\tint max = 0;\n\t\tfor (int i = 0; i < s.length() - t.length() + 1; i++) {\n\t\t\tString a = s.substring(i, t.length() + i);\n\t\t\tint cnt = 0;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (a.charAt(j) == t.charAt(j)) cnt++;\n\t\t\t}\n\t\t\tmax = Math.max(max, cnt);\n\t\t}\n\n\t\tSystem.out.println(t.length() - max);\n\n\t\tsc.close();\n\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\tString t = sc.next();\n\n\t\tint max = 0;\n\t\tfor (int i = 0; i < s.length() - t.length() + 1; i++) {\n\t\t\tString a = s.substring(i, t.length() + i);\n\t\t\tint cnt = 0;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (a.charAt(j) == t.charAt(j)) cnt++;\n\t\t\t}\n\t\t\tmax = Math.max(max, cnt);\n\t\t}\n\n\t\tSystem.out.println(t.length() - max);\n\n\t\tsc.close();\n\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String s = sc.next();",
"s",
"sc.next()",
"sc.next",
"sc",
"String t = sc.next();",
"t",
"sc.next()",
"sc.next",
"sc",
"int max = 0;",
"max",
"0",
"for (int i = 0; i < s.length() - t.length() + 1; i++) {\n\t\t\tString a = s.substring(i, t.length() + i);\n\t\t\tint cnt = 0;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (a.charAt(j) == t.charAt(j)) cnt++;\n\t\t\t}\n\t\t\tmax = Math.max(max, cnt);\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < s.length() - t.length() + 1",
"i",
"s.length() - t.length() + 1",
"s.length() - t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"1",
"i++",
"i++",
"i",
"{\n\t\t\tString a = s.substring(i, t.length() + i);\n\t\t\tint cnt = 0;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (a.charAt(j) == t.charAt(j)) cnt++;\n\t\t\t}\n\t\t\tmax = Math.max(max, cnt);\n\t\t}",
"{\n\t\t\tString a = s.substring(i, t.length() + i);\n\t\t\tint cnt = 0;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (a.charAt(j) == t.charAt(j)) cnt++;\n\t\t\t}\n\t\t\tmax = Math.max(max, cnt);\n\t\t}",
"String a = s.substring(i, t.length() + i);",
"a",
"s.substring(i, t.length() + i)",
"s.substring",
"s",
"i",
"t.length() + i",
"t.length()",
"t.length",
"t",
"i",
"int cnt = 0;",
"cnt",
"0",
"for (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (a.charAt(j) == t.charAt(j)) cnt++;\n\t\t\t}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n\t\t\t\tif (a.charAt(j) == t.charAt(j)) cnt++;\n\t\t\t}",
"{\n\t\t\t\tif (a.charAt(j) == t.charAt(j)) cnt++;\n\t\t\t}",
"if (a.charAt(j) == t.charAt(j)) cnt++;",
"a.charAt(j) == t.charAt(j)",
"a.charAt(j)",
"a.charAt",
"a",
"j",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"cnt++",
"cnt",
"max = Math.max(max, cnt)",
"max",
"Math.max(max, cnt)",
"Math.max",
"Math",
"max",
"cnt",
"System.out.println(t.length() - max)",
"System.out.println",
"System.out",
"System",
"System.out",
"t.length() - max",
"t.length()",
"t.length",
"t",
"max",
"sc.close()",
"sc.close",
"sc",
"String[] args",
"args",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\tString t = sc.next();\n\n\t\tint max = 0;\n\t\tfor (int i = 0; i < s.length() - t.length() + 1; i++) {\n\t\t\tString a = s.substring(i, t.length() + i);\n\t\t\tint cnt = 0;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (a.charAt(j) == t.charAt(j)) cnt++;\n\t\t\t}\n\t\t\tmax = Math.max(max, cnt);\n\t\t}\n\n\t\tSystem.out.println(t.length() - max);\n\n\t\tsc.close();\n\n\t}\n\n}",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\tString t = sc.next();\n\n\t\tint max = 0;\n\t\tfor (int i = 0; i < s.length() - t.length() + 1; i++) {\n\t\t\tString a = s.substring(i, t.length() + i);\n\t\t\tint cnt = 0;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (a.charAt(j) == t.charAt(j)) cnt++;\n\t\t\t}\n\t\t\tmax = Math.max(max, cnt);\n\t\t}\n\n\t\tSystem.out.println(t.length() - max);\n\n\t\tsc.close();\n\n\t}\n\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
String t = sc.next();
int max = 0;
for (int i = 0; i < s.length() - t.length() + 1; i++) {
String a = s.substring(i, t.length() + i);
int cnt = 0;
for (int j = 0; j < t.length(); j++) {
if (a.charAt(j) == t.charAt(j)) cnt++;
}
max = Math.max(max, cnt);
}
System.out.println(t.length() - max);
sc.close();
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
30,
40,
13,
29,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
2,
13,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
2,
13,
4,
18,
13,
41,
13,
4,
13,
13,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
12,
13,
30,
23,
13,
23,
13,
23,
13,
23,
13,
23,
13,
23,
13,
12,
13,
30,
23,
13,
23,
13,
12,
13,
30,
4,
13,
23,
13,
6,
13,
41,
13,
41,
13,
6,
13,
41,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
13,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
12,
13,
30,
0,
18,
36,
13,
13,
23,
13,
12,
13,
30,
0,
18,
36,
13,
13,
0,
18,
36,
13,
13,
23,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
210,
11
],
[
210,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
14,
18
],
[
18,
19
],
[
19,
20
],
[
20,
21
],
[
20,
22
],
[
18,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
26,
27
],
[
18,
28
],
[
28,
29
],
[
29,
30
],
[
18,
31
],
[
32,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
35,
36
],
[
36,
37
],
[
35,
38
],
[
34,
39
],
[
39,
40
],
[
40,
41
],
[
39,
42
],
[
33,
43
],
[
43,
44
],
[
44,
45
],
[
14,
46
],
[
46,
47
],
[
12,
48
],
[
48,
49
],
[
12,
50
],
[
50,
51
],
[
210,
52
],
[
52,
53
],
[
52,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
54,
58
],
[
58,
59
],
[
58,
60
],
[
60,
61
],
[
61,
62
],
[
54,
63
],
[
63,
64
],
[
63,
65
],
[
65,
66
],
[
66,
67
],
[
54,
68
],
[
68,
69
],
[
68,
70
],
[
70,
71
],
[
71,
72
],
[
54,
73
],
[
73,
74
],
[
74,
75
],
[
75,
76
],
[
75,
77
],
[
73,
78
],
[
78,
79
],
[
79,
80
],
[
79,
81
],
[
81,
82
],
[
82,
83
],
[
78,
84
],
[
84,
85
],
[
85,
86
],
[
73,
87
],
[
87,
88
],
[
88,
89
],
[
73,
90
],
[
91,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
94,
95
],
[
95,
96
],
[
94,
97
],
[
94,
98
],
[
98,
99
],
[
98,
100
],
[
100,
101
],
[
101,
102
],
[
91,
103
],
[
103,
104
],
[
103,
105
],
[
105,
106
],
[
105,
107
],
[
105,
108
],
[
91,
109
],
[
109,
110
],
[
109,
111
],
[
111,
112
],
[
112,
113
],
[
111,
114
],
[
111,
115
],
[
54,
116
],
[
116,
117
],
[
117,
118
],
[
118,
119
],
[
118,
120
],
[
116,
121
],
[
210,
122
],
[
122,
123
],
[
122,
124
],
[
122,
125
],
[
125,
126
],
[
122,
127
],
[
127,
128
],
[
122,
129
],
[
129,
130
],
[
122,
131
],
[
131,
132
],
[
122,
133
],
[
133,
134
],
[
122,
135
],
[
135,
136
],
[
210,
137
],
[
137,
138
],
[
137,
139
],
[
137,
140
],
[
140,
141
],
[
137,
142
],
[
142,
143
],
[
210,
144
],
[
144,
145
],
[
144,
146
],
[
146,
147
],
[
147,
148
],
[
144,
149
],
[
149,
150
],
[
210,
151
],
[
151,
152
],
[
151,
153
],
[
153,
154
],
[
151,
155
],
[
155,
156
],
[
210,
157
],
[
157,
158
],
[
157,
159
],
[
159,
160
],
[
157,
161
],
[
161,
162
],
[
157,
163
],
[
163,
164
],
[
157,
165
],
[
165,
166
],
[
165,
167
],
[
167,
168
],
[
168,
169
],
[
168,
170
],
[
165,
171
],
[
171,
172
],
[
210,
173
],
[
173,
174
],
[
173,
175
],
[
175,
176
],
[
173,
177
],
[
177,
178
],
[
173,
179
],
[
179,
180
],
[
179,
181
],
[
173,
182
],
[
182,
183
],
[
182,
184
],
[
184,
185
],
[
185,
186
],
[
186,
187
],
[
186,
188
],
[
185,
189
],
[
182,
190
],
[
190,
191
],
[
173,
192
],
[
192,
193
],
[
192,
194
],
[
194,
195
],
[
195,
196
],
[
196,
197
],
[
196,
198
],
[
195,
199
],
[
194,
200
],
[
200,
201
],
[
201,
202
],
[
201,
203
],
[
200,
204
],
[
192,
205
],
[
205,
206
],
[
192,
207
],
[
207,
208
],
[
0,
209
],
[
209,
210
],
[
209,
211
]
]
| [
"import java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Scanner;\n\n\npublic class Main {\n\n static int res(String ss, String t) {\n int cnt = 0;\n for(int i=0;i<ss.length();i++) {\n if(ss.charAt(i) != t.charAt(i)) {\n cnt++;\n }\n }\n return cnt;\n }\n\n\n static void solve() {\n Scanner scan = new Scanner(System.in);\n\n String s = scan.next();\n String t = scan.next();\n int min = t.length();\n for(int i = 0; i + t.length() <= s.length(); i++) {\n String ss = s.substring(i, i+t.length());\n int cnt = res(ss, t);\n min = Math.min(cnt, min);\n }\n System.out.println(min);\n\n// int t = scan.nextInt();\n// for (int i = 0; i < t; i++) {\n//// solveCase();\n// }\n\n\n// long t = scan.nextLong();\n\n// for (int i = 0; i < t; i++) {\n// int n = scan.nextInt();\n//// scase(n);\n// }\n }\n\n\n static void solveCase(int zero1, int one1, int two1, int zero2, int one2, int two2) {\n\n }\n\n static void scase(int[] arr1, int[] arr2) {\n }\n\n\n public static void main(String[] args) {\n\n solve();\n }\n\n\n static class LoggerNode {\n String message;\n int ts;\n }\n\n\n static class TreeNode {\n int val;\n TreeNode left;\n TreeNode right;\n\n TreeNode(int x) {\n val = x;\n }\n }\n\n static class ListNode {\n int val;\n ListNode next;\n\n ListNode() {\n }\n\n ListNode(int val) {\n this.val = val;\n }\n\n ListNode(int val, ListNode next) {\n this.val = val;\n this.next = next;\n }\n }\n}",
"import java.util.Arrays;",
"Arrays",
"java.util",
"import java.util.Comparator;",
"Comparator",
"java.util",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n static int res(String ss, String t) {\n int cnt = 0;\n for(int i=0;i<ss.length();i++) {\n if(ss.charAt(i) != t.charAt(i)) {\n cnt++;\n }\n }\n return cnt;\n }\n\n\n static void solve() {\n Scanner scan = new Scanner(System.in);\n\n String s = scan.next();\n String t = scan.next();\n int min = t.length();\n for(int i = 0; i + t.length() <= s.length(); i++) {\n String ss = s.substring(i, i+t.length());\n int cnt = res(ss, t);\n min = Math.min(cnt, min);\n }\n System.out.println(min);\n\n// int t = scan.nextInt();\n// for (int i = 0; i < t; i++) {\n//// solveCase();\n// }\n\n\n// long t = scan.nextLong();\n\n// for (int i = 0; i < t; i++) {\n// int n = scan.nextInt();\n//// scase(n);\n// }\n }\n\n\n static void solveCase(int zero1, int one1, int two1, int zero2, int one2, int two2) {\n\n }\n\n static void scase(int[] arr1, int[] arr2) {\n }\n\n\n public static void main(String[] args) {\n\n solve();\n }\n\n\n static class LoggerNode {\n String message;\n int ts;\n }\n\n\n static class TreeNode {\n int val;\n TreeNode left;\n TreeNode right;\n\n TreeNode(int x) {\n val = x;\n }\n }\n\n static class ListNode {\n int val;\n ListNode next;\n\n ListNode() {\n }\n\n ListNode(int val) {\n this.val = val;\n }\n\n ListNode(int val, ListNode next) {\n this.val = val;\n this.next = next;\n }\n }\n}",
"Main",
"static int res(String ss, String t) {\n int cnt = 0;\n for(int i=0;i<ss.length();i++) {\n if(ss.charAt(i) != t.charAt(i)) {\n cnt++;\n }\n }\n return cnt;\n }",
"res",
"{\n int cnt = 0;\n for(int i=0;i<ss.length();i++) {\n if(ss.charAt(i) != t.charAt(i)) {\n cnt++;\n }\n }\n return cnt;\n }",
"int cnt = 0;",
"cnt",
"0",
"for(int i=0;i<ss.length();i++) {\n if(ss.charAt(i) != t.charAt(i)) {\n cnt++;\n }\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<ss.length()",
"i",
"ss.length()",
"ss.length",
"ss",
"i++",
"i++",
"i",
"{\n if(ss.charAt(i) != t.charAt(i)) {\n cnt++;\n }\n }",
"{\n if(ss.charAt(i) != t.charAt(i)) {\n cnt++;\n }\n }",
"if(ss.charAt(i) != t.charAt(i)) {\n cnt++;\n }",
"ss.charAt(i) != t.charAt(i)",
"ss.charAt(i)",
"ss.charAt",
"ss",
"i",
"t.charAt(i)",
"t.charAt",
"t",
"i",
"{\n cnt++;\n }",
"cnt++",
"cnt",
"return cnt;",
"cnt",
"String ss",
"ss",
"String t",
"t",
"static void solve() {\n Scanner scan = new Scanner(System.in);\n\n String s = scan.next();\n String t = scan.next();\n int min = t.length();\n for(int i = 0; i + t.length() <= s.length(); i++) {\n String ss = s.substring(i, i+t.length());\n int cnt = res(ss, t);\n min = Math.min(cnt, min);\n }\n System.out.println(min);\n\n// int t = scan.nextInt();\n// for (int i = 0; i < t; i++) {\n//// solveCase();\n// }\n\n\n// long t = scan.nextLong();\n\n// for (int i = 0; i < t; i++) {\n// int n = scan.nextInt();\n//// scase(n);\n// }\n }",
"solve",
"{\n Scanner scan = new Scanner(System.in);\n\n String s = scan.next();\n String t = scan.next();\n int min = t.length();\n for(int i = 0; i + t.length() <= s.length(); i++) {\n String ss = s.substring(i, i+t.length());\n int cnt = res(ss, t);\n min = Math.min(cnt, min);\n }\n System.out.println(min);\n\n// int t = scan.nextInt();\n// for (int i = 0; i < t; i++) {\n//// solveCase();\n// }\n\n\n// long t = scan.nextLong();\n\n// for (int i = 0; i < t; i++) {\n// int n = scan.nextInt();\n//// scase(n);\n// }\n }",
"Scanner scan = new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"String s = scan.next();",
"s",
"scan.next()",
"scan.next",
"scan",
"String t = scan.next();",
"t",
"scan.next()",
"scan.next",
"scan",
"int min = t.length();",
"min",
"t.length()",
"t.length",
"t",
"for(int i = 0; i + t.length() <= s.length(); i++) {\n String ss = s.substring(i, i+t.length());\n int cnt = res(ss, t);\n min = Math.min(cnt, min);\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i + t.length() <= s.length()",
"i + t.length()",
"i",
"t.length()",
"t.length",
"t",
"s.length()",
"s.length",
"s",
"i++",
"i++",
"i",
"{\n String ss = s.substring(i, i+t.length());\n int cnt = res(ss, t);\n min = Math.min(cnt, min);\n }",
"{\n String ss = s.substring(i, i+t.length());\n int cnt = res(ss, t);\n min = Math.min(cnt, min);\n }",
"String ss = s.substring(i, i+t.length());",
"ss",
"s.substring(i, i+t.length())",
"s.substring",
"s",
"i",
"i+t.length()",
"i",
"t.length()",
"t.length",
"t",
"int cnt = res(ss, t);",
"cnt",
"res(ss, t)",
"res",
"ss",
"t",
"min = Math.min(cnt, min)",
"min",
"Math.min(cnt, min)",
"Math.min",
"Math",
"cnt",
"min",
"System.out.println(min)",
"System.out.println",
"System.out",
"System",
"System.out",
"min",
"static void solveCase(int zero1, int one1, int two1, int zero2, int one2, int two2) {\n\n }",
"solveCase",
"{\n\n }",
"int zero1",
"zero1",
"int one1",
"one1",
"int two1",
"two1",
"int zero2",
"zero2",
"int one2",
"one2",
"int two2",
"two2",
"static void scase(int[] arr1, int[] arr2) {\n }",
"scase",
"{\n }",
"int[] arr1",
"arr1",
"int[] arr2",
"arr2",
"public static void main(String[] args) {\n\n solve();\n }",
"main",
"{\n\n solve();\n }",
"solve()",
"solve",
"String[] args",
"args",
"static class LoggerNode {\n String message;\n int ts;\n }",
"LoggerNode",
"String message;",
"message",
"int ts;",
"ts",
"static class TreeNode {\n int val;\n TreeNode left;\n TreeNode right;\n\n TreeNode(int x) {\n val = x;\n }\n }",
"TreeNode",
"int val;",
"val",
"TreeNode left;",
"left",
"TreeNode right;",
"right",
"TreeNode(int x) {\n val = x;\n }",
"TreeNode",
"{\n val = x;\n }",
"val = x",
"val",
"x",
"int x",
"x",
"static class ListNode {\n int val;\n ListNode next;\n\n ListNode() {\n }\n\n ListNode(int val) {\n this.val = val;\n }\n\n ListNode(int val, ListNode next) {\n this.val = val;\n this.next = next;\n }\n }",
"ListNode",
"int val;",
"val",
"ListNode next;",
"next",
"ListNode() {\n }",
"ListNode",
"{\n }",
"ListNode(int val) {\n this.val = val;\n }",
"ListNode",
"{\n this.val = val;\n }",
"this.val = val",
"this.val",
"this",
"this.val",
"val",
"int val",
"val",
"ListNode(int val, ListNode next) {\n this.val = val;\n this.next = next;\n }",
"ListNode",
"{\n this.val = val;\n this.next = next;\n }",
"this.val = val",
"this.val",
"this",
"this.val",
"val",
"this.next = next",
"this.next",
"this",
"this.next",
"next",
"int val",
"val",
"ListNode next",
"next",
"public class Main {\n\n static int res(String ss, String t) {\n int cnt = 0;\n for(int i=0;i<ss.length();i++) {\n if(ss.charAt(i) != t.charAt(i)) {\n cnt++;\n }\n }\n return cnt;\n }\n\n\n static void solve() {\n Scanner scan = new Scanner(System.in);\n\n String s = scan.next();\n String t = scan.next();\n int min = t.length();\n for(int i = 0; i + t.length() <= s.length(); i++) {\n String ss = s.substring(i, i+t.length());\n int cnt = res(ss, t);\n min = Math.min(cnt, min);\n }\n System.out.println(min);\n\n// int t = scan.nextInt();\n// for (int i = 0; i < t; i++) {\n//// solveCase();\n// }\n\n\n// long t = scan.nextLong();\n\n// for (int i = 0; i < t; i++) {\n// int n = scan.nextInt();\n//// scase(n);\n// }\n }\n\n\n static void solveCase(int zero1, int one1, int two1, int zero2, int one2, int two2) {\n\n }\n\n static void scase(int[] arr1, int[] arr2) {\n }\n\n\n public static void main(String[] args) {\n\n solve();\n }\n\n\n static class LoggerNode {\n String message;\n int ts;\n }\n\n\n static class TreeNode {\n int val;\n TreeNode left;\n TreeNode right;\n\n TreeNode(int x) {\n val = x;\n }\n }\n\n static class ListNode {\n int val;\n ListNode next;\n\n ListNode() {\n }\n\n ListNode(int val) {\n this.val = val;\n }\n\n ListNode(int val, ListNode next) {\n this.val = val;\n this.next = next;\n }\n }\n}",
"public class Main {\n\n static int res(String ss, String t) {\n int cnt = 0;\n for(int i=0;i<ss.length();i++) {\n if(ss.charAt(i) != t.charAt(i)) {\n cnt++;\n }\n }\n return cnt;\n }\n\n\n static void solve() {\n Scanner scan = new Scanner(System.in);\n\n String s = scan.next();\n String t = scan.next();\n int min = t.length();\n for(int i = 0; i + t.length() <= s.length(); i++) {\n String ss = s.substring(i, i+t.length());\n int cnt = res(ss, t);\n min = Math.min(cnt, min);\n }\n System.out.println(min);\n\n// int t = scan.nextInt();\n// for (int i = 0; i < t; i++) {\n//// solveCase();\n// }\n\n\n// long t = scan.nextLong();\n\n// for (int i = 0; i < t; i++) {\n// int n = scan.nextInt();\n//// scase(n);\n// }\n }\n\n\n static void solveCase(int zero1, int one1, int two1, int zero2, int one2, int two2) {\n\n }\n\n static void scase(int[] arr1, int[] arr2) {\n }\n\n\n public static void main(String[] args) {\n\n solve();\n }\n\n\n static class LoggerNode {\n String message;\n int ts;\n }\n\n\n static class TreeNode {\n int val;\n TreeNode left;\n TreeNode right;\n\n TreeNode(int x) {\n val = x;\n }\n }\n\n static class ListNode {\n int val;\n ListNode next;\n\n ListNode() {\n }\n\n ListNode(int val) {\n this.val = val;\n }\n\n ListNode(int val, ListNode next) {\n this.val = val;\n this.next = next;\n }\n }\n}",
"Main"
]
| import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
public class Main {
static int res(String ss, String t) {
int cnt = 0;
for(int i=0;i<ss.length();i++) {
if(ss.charAt(i) != t.charAt(i)) {
cnt++;
}
}
return cnt;
}
static void solve() {
Scanner scan = new Scanner(System.in);
String s = scan.next();
String t = scan.next();
int min = t.length();
for(int i = 0; i + t.length() <= s.length(); i++) {
String ss = s.substring(i, i+t.length());
int cnt = res(ss, t);
min = Math.min(cnt, min);
}
System.out.println(min);
// int t = scan.nextInt();
// for (int i = 0; i < t; i++) {
//// solveCase();
// }
// long t = scan.nextLong();
// for (int i = 0; i < t; i++) {
// int n = scan.nextInt();
//// scase(n);
// }
}
static void solveCase(int zero1, int one1, int two1, int zero2, int one2, int two2) {
}
static void scase(int[] arr1, int[] arr2) {
}
public static void main(String[] args) {
solve();
}
static class LoggerNode {
String message;
int ts;
}
static class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) {
val = x;
}
}
static class ListNode {
int val;
ListNode next;
ListNode() {
}
ListNode(int val) {
this.val = val;
}
ListNode(int val, ListNode next) {
this.val = val;
this.next = next;
}
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
41,
13,
17,
14,
2,
4,
18,
13,
4,
18,
13,
30,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
30,
40,
13,
30,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
30,
40,
13,
14,
2,
13,
13,
30,
0,
13,
13,
0,
13,
17,
4,
18,
18,
13,
13,
2,
4,
18,
13,
13,
4,
18,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
142,
5
],
[
142,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
8,
25
],
[
25,
26
],
[
25,
27
],
[
8,
28
],
[
28,
29
],
[
29,
30
],
[
30,
31
],
[
31,
32
],
[
29,
33
],
[
33,
34
],
[
34,
35
],
[
28,
36
],
[
36,
37
],
[
37,
38
],
[
38,
39
],
[
39,
40
],
[
39,
41
],
[
37,
42
],
[
42,
43
],
[
42,
44
],
[
44,
45
],
[
45,
46
],
[
37,
47
],
[
47,
48
],
[
48,
49
],
[
37,
50
],
[
51,
51
],
[
51,
52
],
[
52,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
54,
57
],
[
53,
58
],
[
58,
59
],
[
59,
60
],
[
58,
61
],
[
52,
62
],
[
62,
63
],
[
63,
64
],
[
28,
65
],
[
65,
66
],
[
66,
67
],
[
67,
68
],
[
68,
69
],
[
68,
70
],
[
66,
71
],
[
71,
72
],
[
71,
73
],
[
73,
74
],
[
74,
75
],
[
75,
76
],
[
73,
77
],
[
77,
78
],
[
78,
79
],
[
66,
80
],
[
80,
81
],
[
81,
82
],
[
66,
83
],
[
84,
84
],
[
84,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
87,
89
],
[
85,
90
],
[
90,
91
],
[
90,
92
],
[
92,
93
],
[
93,
94
],
[
85,
95
],
[
95,
96
],
[
96,
97
],
[
85,
98
],
[
99,
99
],
[
99,
100
],
[
100,
101
],
[
101,
102
],
[
102,
103
],
[
103,
104
],
[
102,
105
],
[
105,
106
],
[
105,
107
],
[
101,
108
],
[
108,
109
],
[
109,
110
],
[
108,
111
],
[
100,
112
],
[
112,
113
],
[
113,
114
],
[
84,
115
],
[
115,
116
],
[
116,
117
],
[
116,
118
],
[
115,
119
],
[
119,
120
],
[
120,
121
],
[
120,
122
],
[
84,
123
],
[
123,
124
],
[
123,
125
],
[
8,
126
],
[
126,
127
],
[
127,
128
],
[
128,
129
],
[
128,
130
],
[
126,
131
],
[
131,
132
],
[
132,
133
],
[
133,
134
],
[
131,
135
],
[
8,
136
],
[
136,
137
],
[
137,
138
],
[
6,
139
],
[
139,
140
],
[
0,
141
],
[
141,
142
],
[
141,
143
]
]
| [
"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner scan = new Scanner(System.in);\n\n\t\tString S = scan.next();\n\t\tString T = scan.next();\n\n\t\tint count = 0;\n\t\tint maxCount = 0;\n\n\t if(S.length() == T.length())\n\t {\n\t\t for(int i = 0; i < S.length(); i++) {\n\t\t\t\tif((S.charAt(i) == T.charAt(i)))\n\t\t\t\t{\n\t\t\t\t\tmaxCount++;\n\t\t\t\t}\n\t\t\t}\n\t }\n\t else\n\t {\n for(int x = 0; x < S.length() - T.length(); x++) {\n\t\tfor(int i = 0; i < T.length(); i++) {\n\t\t\tif((S.charAt(i + x) == T.charAt(i)))\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif(count > maxCount) {\n\t\t\tmaxCount = count;\n\t\t}\n\t\tcount = 0;\n \t}\n }\n\t\tSystem.out.println(T.length() - maxCount);\n\t\tscan.close();\n\t}\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner scan = new Scanner(System.in);\n\n\t\tString S = scan.next();\n\t\tString T = scan.next();\n\n\t\tint count = 0;\n\t\tint maxCount = 0;\n\n\t if(S.length() == T.length())\n\t {\n\t\t for(int i = 0; i < S.length(); i++) {\n\t\t\t\tif((S.charAt(i) == T.charAt(i)))\n\t\t\t\t{\n\t\t\t\t\tmaxCount++;\n\t\t\t\t}\n\t\t\t}\n\t }\n\t else\n\t {\n for(int x = 0; x < S.length() - T.length(); x++) {\n\t\tfor(int i = 0; i < T.length(); i++) {\n\t\t\tif((S.charAt(i + x) == T.charAt(i)))\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif(count > maxCount) {\n\t\t\tmaxCount = count;\n\t\t}\n\t\tcount = 0;\n \t}\n }\n\t\tSystem.out.println(T.length() - maxCount);\n\t\tscan.close();\n\t}\n}",
"Main",
"public static void main(String[] args) {\n\n\t\tScanner scan = new Scanner(System.in);\n\n\t\tString S = scan.next();\n\t\tString T = scan.next();\n\n\t\tint count = 0;\n\t\tint maxCount = 0;\n\n\t if(S.length() == T.length())\n\t {\n\t\t for(int i = 0; i < S.length(); i++) {\n\t\t\t\tif((S.charAt(i) == T.charAt(i)))\n\t\t\t\t{\n\t\t\t\t\tmaxCount++;\n\t\t\t\t}\n\t\t\t}\n\t }\n\t else\n\t {\n for(int x = 0; x < S.length() - T.length(); x++) {\n\t\tfor(int i = 0; i < T.length(); i++) {\n\t\t\tif((S.charAt(i + x) == T.charAt(i)))\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif(count > maxCount) {\n\t\t\tmaxCount = count;\n\t\t}\n\t\tcount = 0;\n \t}\n }\n\t\tSystem.out.println(T.length() - maxCount);\n\t\tscan.close();\n\t}",
"main",
"{\n\n\t\tScanner scan = new Scanner(System.in);\n\n\t\tString S = scan.next();\n\t\tString T = scan.next();\n\n\t\tint count = 0;\n\t\tint maxCount = 0;\n\n\t if(S.length() == T.length())\n\t {\n\t\t for(int i = 0; i < S.length(); i++) {\n\t\t\t\tif((S.charAt(i) == T.charAt(i)))\n\t\t\t\t{\n\t\t\t\t\tmaxCount++;\n\t\t\t\t}\n\t\t\t}\n\t }\n\t else\n\t {\n for(int x = 0; x < S.length() - T.length(); x++) {\n\t\tfor(int i = 0; i < T.length(); i++) {\n\t\t\tif((S.charAt(i + x) == T.charAt(i)))\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif(count > maxCount) {\n\t\t\tmaxCount = count;\n\t\t}\n\t\tcount = 0;\n \t}\n }\n\t\tSystem.out.println(T.length() - maxCount);\n\t\tscan.close();\n\t}",
"Scanner scan = new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"String S = scan.next();",
"S",
"scan.next()",
"scan.next",
"scan",
"String T = scan.next();",
"T",
"scan.next()",
"scan.next",
"scan",
"int count = 0;",
"count",
"0",
"int maxCount = 0;",
"maxCount",
"0",
"if(S.length() == T.length())\n\t {\n\t\t for(int i = 0; i < S.length(); i++) {\n\t\t\t\tif((S.charAt(i) == T.charAt(i)))\n\t\t\t\t{\n\t\t\t\t\tmaxCount++;\n\t\t\t\t}\n\t\t\t}\n\t }\n\t else\n\t {\n for(int x = 0; x < S.length() - T.length(); x++) {\n\t\tfor(int i = 0; i < T.length(); i++) {\n\t\t\tif((S.charAt(i + x) == T.charAt(i)))\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif(count > maxCount) {\n\t\t\tmaxCount = count;\n\t\t}\n\t\tcount = 0;\n \t}\n }",
"S.length() == T.length()",
"S.length()",
"S.length",
"S",
"T.length()",
"T.length",
"T",
"{\n\t\t for(int i = 0; i < S.length(); i++) {\n\t\t\t\tif((S.charAt(i) == T.charAt(i)))\n\t\t\t\t{\n\t\t\t\t\tmaxCount++;\n\t\t\t\t}\n\t\t\t}\n\t }",
"for(int i = 0; i < S.length(); i++) {\n\t\t\t\tif((S.charAt(i) == T.charAt(i)))\n\t\t\t\t{\n\t\t\t\t\tmaxCount++;\n\t\t\t\t}\n\t\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < S.length()",
"i",
"S.length()",
"S.length",
"S",
"i++",
"i++",
"i",
"{\n\t\t\t\tif((S.charAt(i) == T.charAt(i)))\n\t\t\t\t{\n\t\t\t\t\tmaxCount++;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif((S.charAt(i) == T.charAt(i)))\n\t\t\t\t{\n\t\t\t\t\tmaxCount++;\n\t\t\t\t}\n\t\t\t}",
"if((S.charAt(i) == T.charAt(i)))\n\t\t\t\t{\n\t\t\t\t\tmaxCount++;\n\t\t\t\t}",
"(S.charAt(i) == T.charAt(i))",
"S.charAt(i)",
"S.charAt",
"S",
"i",
"T.charAt(i)",
"T.charAt",
"T",
"i",
"{\n\t\t\t\t\tmaxCount++;\n\t\t\t\t}",
"maxCount++",
"maxCount",
"{\n for(int x = 0; x < S.length() - T.length(); x++) {\n\t\tfor(int i = 0; i < T.length(); i++) {\n\t\t\tif((S.charAt(i + x) == T.charAt(i)))\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif(count > maxCount) {\n\t\t\tmaxCount = count;\n\t\t}\n\t\tcount = 0;\n \t}\n }",
"for(int x = 0; x < S.length() - T.length(); x++) {\n\t\tfor(int i = 0; i < T.length(); i++) {\n\t\t\tif((S.charAt(i + x) == T.charAt(i)))\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif(count > maxCount) {\n\t\t\tmaxCount = count;\n\t\t}\n\t\tcount = 0;\n \t}",
"int x = 0;",
"int x = 0;",
"x",
"0",
"x < S.length() - T.length()",
"x",
"S.length() - T.length()",
"S.length()",
"S.length",
"S",
"T.length()",
"T.length",
"T",
"x++",
"x++",
"x",
"{\n\t\tfor(int i = 0; i < T.length(); i++) {\n\t\t\tif((S.charAt(i + x) == T.charAt(i)))\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif(count > maxCount) {\n\t\t\tmaxCount = count;\n\t\t}\n\t\tcount = 0;\n \t}",
"{\n\t\tfor(int i = 0; i < T.length(); i++) {\n\t\t\tif((S.charAt(i + x) == T.charAt(i)))\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif(count > maxCount) {\n\t\t\tmaxCount = count;\n\t\t}\n\t\tcount = 0;\n \t}",
"for(int i = 0; i < T.length(); i++) {\n\t\t\tif((S.charAt(i + x) == T.charAt(i)))\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < T.length()",
"i",
"T.length()",
"T.length",
"T",
"i++",
"i++",
"i",
"{\n\t\t\tif((S.charAt(i + x) == T.charAt(i)))\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"{\n\t\t\tif((S.charAt(i + x) == T.charAt(i)))\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}",
"if((S.charAt(i + x) == T.charAt(i)))\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}",
"(S.charAt(i + x) == T.charAt(i))",
"S.charAt(i + x)",
"S.charAt",
"S",
"i + x",
"i",
"x",
"T.charAt(i)",
"T.charAt",
"T",
"i",
"{\n\t\t\t\tcount++;\n\t\t\t}",
"count++",
"count",
"if(count > maxCount) {\n\t\t\tmaxCount = count;\n\t\t}",
"count > maxCount",
"count",
"maxCount",
"{\n\t\t\tmaxCount = count;\n\t\t}",
"maxCount = count",
"maxCount",
"count",
"count = 0",
"count",
"0",
"System.out.println(T.length() - maxCount)",
"System.out.println",
"System.out",
"System",
"System.out",
"T.length() - maxCount",
"T.length()",
"T.length",
"T",
"maxCount",
"scan.close()",
"scan.close",
"scan",
"String[] args",
"args",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner scan = new Scanner(System.in);\n\n\t\tString S = scan.next();\n\t\tString T = scan.next();\n\n\t\tint count = 0;\n\t\tint maxCount = 0;\n\n\t if(S.length() == T.length())\n\t {\n\t\t for(int i = 0; i < S.length(); i++) {\n\t\t\t\tif((S.charAt(i) == T.charAt(i)))\n\t\t\t\t{\n\t\t\t\t\tmaxCount++;\n\t\t\t\t}\n\t\t\t}\n\t }\n\t else\n\t {\n for(int x = 0; x < S.length() - T.length(); x++) {\n\t\tfor(int i = 0; i < T.length(); i++) {\n\t\t\tif((S.charAt(i + x) == T.charAt(i)))\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif(count > maxCount) {\n\t\t\tmaxCount = count;\n\t\t}\n\t\tcount = 0;\n \t}\n }\n\t\tSystem.out.println(T.length() - maxCount);\n\t\tscan.close();\n\t}\n}",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner scan = new Scanner(System.in);\n\n\t\tString S = scan.next();\n\t\tString T = scan.next();\n\n\t\tint count = 0;\n\t\tint maxCount = 0;\n\n\t if(S.length() == T.length())\n\t {\n\t\t for(int i = 0; i < S.length(); i++) {\n\t\t\t\tif((S.charAt(i) == T.charAt(i)))\n\t\t\t\t{\n\t\t\t\t\tmaxCount++;\n\t\t\t\t}\n\t\t\t}\n\t }\n\t else\n\t {\n for(int x = 0; x < S.length() - T.length(); x++) {\n\t\tfor(int i = 0; i < T.length(); i++) {\n\t\t\tif((S.charAt(i + x) == T.charAt(i)))\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif(count > maxCount) {\n\t\t\tmaxCount = count;\n\t\t}\n\t\tcount = 0;\n \t}\n }\n\t\tSystem.out.println(T.length() - maxCount);\n\t\tscan.close();\n\t}\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String S = scan.next();
String T = scan.next();
int count = 0;
int maxCount = 0;
if(S.length() == T.length())
{
for(int i = 0; i < S.length(); i++) {
if((S.charAt(i) == T.charAt(i)))
{
maxCount++;
}
}
}
else
{
for(int x = 0; x < S.length() - T.length(); x++) {
for(int i = 0; i < T.length(); i++) {
if((S.charAt(i + x) == T.charAt(i)))
{
count++;
}
}
if(count > maxCount) {
maxCount = count;
}
count = 0;
}
}
System.out.println(T.length() - maxCount);
scan.close();
}
} |
[
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,
4,
18,
13,
41,
13,
17,
41,
13,
2,
2,
4,
18,
13,
4,
18,
13,
17,
14,
4,
18,
13,
13,
30,
4,
18,
18,
13,
13,
17,
30,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
41,
13,
4,
18,
13,
13,
2,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
30,
40,
13,
14,
2,
13,
13,
30,
0,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
127,
11
],
[
127,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
14,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
14,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
26,
27
],
[
14,
28
],
[
28,
29
],
[
28,
30
],
[
14,
31
],
[
31,
32
],
[
31,
33
],
[
33,
34
],
[
34,
35
],
[
35,
36
],
[
36,
37
],
[
34,
38
],
[
38,
39
],
[
39,
40
],
[
33,
41
],
[
14,
42
],
[
42,
43
],
[
43,
44
],
[
44,
45
],
[
43,
46
],
[
42,
47
],
[
47,
48
],
[
48,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
48,
53
],
[
42,
54
],
[
54,
55
],
[
55,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
55,
60
],
[
60,
61
],
[
60,
62
],
[
55,
63
],
[
63,
64
],
[
64,
65
],
[
55,
66
],
[
67,
67
],
[
67,
68
],
[
68,
69
],
[
68,
70
],
[
67,
71
],
[
71,
72
],
[
71,
73
],
[
73,
74
],
[
74,
75
],
[
73,
76
],
[
73,
77
],
[
77,
78
],
[
77,
79
],
[
79,
80
],
[
80,
81
],
[
67,
82
],
[
82,
83
],
[
83,
84
],
[
84,
85
],
[
84,
86
],
[
82,
87
],
[
87,
88
],
[
87,
89
],
[
89,
90
],
[
90,
91
],
[
82,
92
],
[
92,
93
],
[
93,
94
],
[
82,
95
],
[
96,
96
],
[
96,
97
],
[
97,
98
],
[
98,
99
],
[
99,
100
],
[
100,
101
],
[
99,
102
],
[
98,
103
],
[
103,
104
],
[
104,
105
],
[
103,
106
],
[
97,
107
],
[
107,
108
],
[
108,
109
],
[
67,
110
],
[
110,
111
],
[
111,
112
],
[
111,
113
],
[
110,
114
],
[
114,
115
],
[
115,
116
],
[
115,
117
],
[
54,
118
],
[
118,
119
],
[
119,
120
],
[
120,
121
],
[
120,
122
],
[
118,
123
],
[
12,
124
],
[
124,
125
],
[
0,
126
],
[
126,
127
],
[
126,
128
]
]
| [
"import java.util.Scanner;\nimport java.util.List;\nimport java.util.ArrayList;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n// int a = sc.nextInt(); // input Integer\n String a = sc.next(); // input String\n String b = sc.next(); // input String\n int ans = 10000;\n int loop = a.length() - b.length() + 1;\n if (a.contains(b)){\n System.out.println(0);\n } else {\n for (int i=0; i<loop ;i++){\n int tmp=0;\n String sub = a.substring(i,i+b.length());\n for (int j=0 ; j<sub.length();j++){\n if(sub.charAt(j) != b.charAt(j)){\n tmp++;\n }\n }\n if(ans>tmp){\n ans=tmp;\n }\n }\n System.out.println(ans);\n }\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"import java.util.List;",
"List",
"java.util",
"import java.util.ArrayList;",
"ArrayList",
"java.util",
"public class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n// int a = sc.nextInt(); // input Integer\n String a = sc.next(); // input String\n String b = sc.next(); // input String\n int ans = 10000;\n int loop = a.length() - b.length() + 1;\n if (a.contains(b)){\n System.out.println(0);\n } else {\n for (int i=0; i<loop ;i++){\n int tmp=0;\n String sub = a.substring(i,i+b.length());\n for (int j=0 ; j<sub.length();j++){\n if(sub.charAt(j) != b.charAt(j)){\n tmp++;\n }\n }\n if(ans>tmp){\n ans=tmp;\n }\n }\n System.out.println(ans);\n }\n }\n}",
"Main",
"public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n// int a = sc.nextInt(); // input Integer\n String a = sc.next(); // input String\n String b = sc.next(); // input String\n int ans = 10000;\n int loop = a.length() - b.length() + 1;\n if (a.contains(b)){\n System.out.println(0);\n } else {\n for (int i=0; i<loop ;i++){\n int tmp=0;\n String sub = a.substring(i,i+b.length());\n for (int j=0 ; j<sub.length();j++){\n if(sub.charAt(j) != b.charAt(j)){\n tmp++;\n }\n }\n if(ans>tmp){\n ans=tmp;\n }\n }\n System.out.println(ans);\n }\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n// int a = sc.nextInt(); // input Integer\n String a = sc.next(); // input String\n String b = sc.next(); // input String\n int ans = 10000;\n int loop = a.length() - b.length() + 1;\n if (a.contains(b)){\n System.out.println(0);\n } else {\n for (int i=0; i<loop ;i++){\n int tmp=0;\n String sub = a.substring(i,i+b.length());\n for (int j=0 ; j<sub.length();j++){\n if(sub.charAt(j) != b.charAt(j)){\n tmp++;\n }\n }\n if(ans>tmp){\n ans=tmp;\n }\n }\n System.out.println(ans);\n }\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String a = sc.next();",
"a",
"sc.next()",
"sc.next",
"sc",
"String b = sc.next();",
"b",
"sc.next()",
"sc.next",
"sc",
"int ans = 10000;",
"ans",
"10000",
"int loop = a.length() - b.length() + 1;",
"loop",
"a.length() - b.length() + 1",
"a.length() - b.length()",
"a.length()",
"a.length",
"a",
"b.length()",
"b.length",
"b",
"1",
"if (a.contains(b)){\n System.out.println(0);\n } else {\n for (int i=0; i<loop ;i++){\n int tmp=0;\n String sub = a.substring(i,i+b.length());\n for (int j=0 ; j<sub.length();j++){\n if(sub.charAt(j) != b.charAt(j)){\n tmp++;\n }\n }\n if(ans>tmp){\n ans=tmp;\n }\n }\n System.out.println(ans);\n }",
"a.contains(b)",
"a.contains",
"a",
"b",
"{\n System.out.println(0);\n }",
"System.out.println(0)",
"System.out.println",
"System.out",
"System",
"System.out",
"0",
"{\n for (int i=0; i<loop ;i++){\n int tmp=0;\n String sub = a.substring(i,i+b.length());\n for (int j=0 ; j<sub.length();j++){\n if(sub.charAt(j) != b.charAt(j)){\n tmp++;\n }\n }\n if(ans>tmp){\n ans=tmp;\n }\n }\n System.out.println(ans);\n }",
"for (int i=0; i<loop ;i++){\n int tmp=0;\n String sub = a.substring(i,i+b.length());\n for (int j=0 ; j<sub.length();j++){\n if(sub.charAt(j) != b.charAt(j)){\n tmp++;\n }\n }\n if(ans>tmp){\n ans=tmp;\n }\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<loop",
"i",
"loop",
"i++",
"i++",
"i",
"{\n int tmp=0;\n String sub = a.substring(i,i+b.length());\n for (int j=0 ; j<sub.length();j++){\n if(sub.charAt(j) != b.charAt(j)){\n tmp++;\n }\n }\n if(ans>tmp){\n ans=tmp;\n }\n }",
"{\n int tmp=0;\n String sub = a.substring(i,i+b.length());\n for (int j=0 ; j<sub.length();j++){\n if(sub.charAt(j) != b.charAt(j)){\n tmp++;\n }\n }\n if(ans>tmp){\n ans=tmp;\n }\n }",
"int tmp=0;",
"tmp",
"0",
"String sub = a.substring(i,i+b.length());",
"sub",
"a.substring(i,i+b.length())",
"a.substring",
"a",
"i",
"i+b.length()",
"i",
"b.length()",
"b.length",
"b",
"for (int j=0 ; j<sub.length();j++){\n if(sub.charAt(j) != b.charAt(j)){\n tmp++;\n }\n }",
"int j=0 ;",
"int j=0 ;",
"j",
"0",
"j<sub.length()",
"j",
"sub.length()",
"sub.length",
"sub",
"j++",
"j++",
"j",
"{\n if(sub.charAt(j) != b.charAt(j)){\n tmp++;\n }\n }",
"{\n if(sub.charAt(j) != b.charAt(j)){\n tmp++;\n }\n }",
"if(sub.charAt(j) != b.charAt(j)){\n tmp++;\n }",
"sub.charAt(j) != b.charAt(j)",
"sub.charAt(j)",
"sub.charAt",
"sub",
"j",
"b.charAt(j)",
"b.charAt",
"b",
"j",
"{\n tmp++;\n }",
"tmp++",
"tmp",
"if(ans>tmp){\n ans=tmp;\n }",
"ans>tmp",
"ans",
"tmp",
"{\n ans=tmp;\n }",
"ans=tmp",
"ans",
"tmp",
"System.out.println(ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"ans",
"String[] args",
"args",
"public class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n// int a = sc.nextInt(); // input Integer\n String a = sc.next(); // input String\n String b = sc.next(); // input String\n int ans = 10000;\n int loop = a.length() - b.length() + 1;\n if (a.contains(b)){\n System.out.println(0);\n } else {\n for (int i=0; i<loop ;i++){\n int tmp=0;\n String sub = a.substring(i,i+b.length());\n for (int j=0 ; j<sub.length();j++){\n if(sub.charAt(j) != b.charAt(j)){\n tmp++;\n }\n }\n if(ans>tmp){\n ans=tmp;\n }\n }\n System.out.println(ans);\n }\n }\n}",
"public class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n// int a = sc.nextInt(); // input Integer\n String a = sc.next(); // input String\n String b = sc.next(); // input String\n int ans = 10000;\n int loop = a.length() - b.length() + 1;\n if (a.contains(b)){\n System.out.println(0);\n } else {\n for (int i=0; i<loop ;i++){\n int tmp=0;\n String sub = a.substring(i,i+b.length());\n for (int j=0 ; j<sub.length();j++){\n if(sub.charAt(j) != b.charAt(j)){\n tmp++;\n }\n }\n if(ans>tmp){\n ans=tmp;\n }\n }\n System.out.println(ans);\n }\n }\n}",
"Main"
]
| import java.util.Scanner;
import java.util.List;
import java.util.ArrayList;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
// int a = sc.nextInt(); // input Integer
String a = sc.next(); // input String
String b = sc.next(); // input String
int ans = 10000;
int loop = a.length() - b.length() + 1;
if (a.contains(b)){
System.out.println(0);
} else {
for (int i=0; i<loop ;i++){
int tmp=0;
String sub = a.substring(i,i+b.length());
for (int j=0 ; j<sub.length();j++){
if(sub.charAt(j) != b.charAt(j)){
tmp++;
}
}
if(ans>tmp){
ans=tmp;
}
}
System.out.println(ans);
}
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
2,
13,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
2,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
106,
5
],
[
106,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
8,
25
],
[
25,
26
],
[
25,
27
],
[
27,
28
],
[
28,
29
],
[
8,
30
],
[
30,
31
],
[
30,
32
],
[
32,
33
],
[
33,
34
],
[
8,
35
],
[
35,
36
],
[
36,
37
],
[
37,
38
],
[
37,
39
],
[
35,
40
],
[
40,
41
],
[
41,
42
],
[
41,
43
],
[
40,
44
],
[
35,
45
],
[
45,
46
],
[
46,
47
],
[
35,
48
],
[
49,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
52,
53
],
[
53,
54
],
[
52,
55
],
[
52,
56
],
[
56,
57
],
[
56,
58
],
[
49,
59
],
[
59,
60
],
[
59,
61
],
[
49,
62
],
[
62,
63
],
[
63,
64
],
[
64,
65
],
[
64,
66
],
[
62,
67
],
[
67,
68
],
[
67,
69
],
[
62,
70
],
[
70,
71
],
[
71,
72
],
[
62,
73
],
[
74,
74
],
[
74,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
78,
79
],
[
77,
80
],
[
76,
81
],
[
81,
82
],
[
82,
83
],
[
81,
84
],
[
75,
85
],
[
85,
86
],
[
86,
87
],
[
49,
88
],
[
88,
89
],
[
88,
90
],
[
90,
91
],
[
91,
92
],
[
90,
93
],
[
90,
94
],
[
8,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
97,
99
],
[
95,
100
],
[
100,
101
],
[
100,
102
],
[
6,
103
],
[
103,
104
],
[
0,
105
],
[
105,
106
],
[
105,
107
]
]
| [
"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n \n int maxMatch = 0;\n int slen = s.length();\n int tlen = t.length();\n for(int i=0; i+tlen <= slen; i++) {\n String ssub = s.substring(i, i+tlen);\n int match = 0;\n for(int j=0; j<tlen; j++) {\n if(t.charAt(j) == ssub.charAt(j)) {\n match++;\n }\n }\n maxMatch = Math.max(maxMatch, match);\n }\n System.out.println(tlen - maxMatch);\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n \n int maxMatch = 0;\n int slen = s.length();\n int tlen = t.length();\n for(int i=0; i+tlen <= slen; i++) {\n String ssub = s.substring(i, i+tlen);\n int match = 0;\n for(int j=0; j<tlen; j++) {\n if(t.charAt(j) == ssub.charAt(j)) {\n match++;\n }\n }\n maxMatch = Math.max(maxMatch, match);\n }\n System.out.println(tlen - maxMatch);\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n \n int maxMatch = 0;\n int slen = s.length();\n int tlen = t.length();\n for(int i=0; i+tlen <= slen; i++) {\n String ssub = s.substring(i, i+tlen);\n int match = 0;\n for(int j=0; j<tlen; j++) {\n if(t.charAt(j) == ssub.charAt(j)) {\n match++;\n }\n }\n maxMatch = Math.max(maxMatch, match);\n }\n System.out.println(tlen - maxMatch);\n }",
"main",
"{\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n \n int maxMatch = 0;\n int slen = s.length();\n int tlen = t.length();\n for(int i=0; i+tlen <= slen; i++) {\n String ssub = s.substring(i, i+tlen);\n int match = 0;\n for(int j=0; j<tlen; j++) {\n if(t.charAt(j) == ssub.charAt(j)) {\n match++;\n }\n }\n maxMatch = Math.max(maxMatch, match);\n }\n System.out.println(tlen - maxMatch);\n }",
"Scanner in = new Scanner(System.in);",
"in",
"new Scanner(System.in)",
"String s = in.next();",
"s",
"in.next()",
"in.next",
"in",
"String t = in.next();",
"t",
"in.next()",
"in.next",
"in",
"int maxMatch = 0;",
"maxMatch",
"0",
"int slen = s.length();",
"slen",
"s.length()",
"s.length",
"s",
"int tlen = t.length();",
"tlen",
"t.length()",
"t.length",
"t",
"for(int i=0; i+tlen <= slen; i++) {\n String ssub = s.substring(i, i+tlen);\n int match = 0;\n for(int j=0; j<tlen; j++) {\n if(t.charAt(j) == ssub.charAt(j)) {\n match++;\n }\n }\n maxMatch = Math.max(maxMatch, match);\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i+tlen <= slen",
"i+tlen",
"i",
"tlen",
"slen",
"i++",
"i++",
"i",
"{\n String ssub = s.substring(i, i+tlen);\n int match = 0;\n for(int j=0; j<tlen; j++) {\n if(t.charAt(j) == ssub.charAt(j)) {\n match++;\n }\n }\n maxMatch = Math.max(maxMatch, match);\n }",
"{\n String ssub = s.substring(i, i+tlen);\n int match = 0;\n for(int j=0; j<tlen; j++) {\n if(t.charAt(j) == ssub.charAt(j)) {\n match++;\n }\n }\n maxMatch = Math.max(maxMatch, match);\n }",
"String ssub = s.substring(i, i+tlen);",
"ssub",
"s.substring(i, i+tlen)",
"s.substring",
"s",
"i",
"i+tlen",
"i",
"tlen",
"int match = 0;",
"match",
"0",
"for(int j=0; j<tlen; j++) {\n if(t.charAt(j) == ssub.charAt(j)) {\n match++;\n }\n }",
"int j=0;",
"int j=0;",
"j",
"0",
"j<tlen",
"j",
"tlen",
"j++",
"j++",
"j",
"{\n if(t.charAt(j) == ssub.charAt(j)) {\n match++;\n }\n }",
"{\n if(t.charAt(j) == ssub.charAt(j)) {\n match++;\n }\n }",
"if(t.charAt(j) == ssub.charAt(j)) {\n match++;\n }",
"t.charAt(j) == ssub.charAt(j)",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"ssub.charAt(j)",
"ssub.charAt",
"ssub",
"j",
"{\n match++;\n }",
"match++",
"match",
"maxMatch = Math.max(maxMatch, match)",
"maxMatch",
"Math.max(maxMatch, match)",
"Math.max",
"Math",
"maxMatch",
"match",
"System.out.println(tlen - maxMatch)",
"System.out.println",
"System.out",
"System",
"System.out",
"tlen - maxMatch",
"tlen",
"maxMatch",
"String[] args",
"args",
"public class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n \n int maxMatch = 0;\n int slen = s.length();\n int tlen = t.length();\n for(int i=0; i+tlen <= slen; i++) {\n String ssub = s.substring(i, i+tlen);\n int match = 0;\n for(int j=0; j<tlen; j++) {\n if(t.charAt(j) == ssub.charAt(j)) {\n match++;\n }\n }\n maxMatch = Math.max(maxMatch, match);\n }\n System.out.println(tlen - maxMatch);\n }\n}",
"public class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n \n int maxMatch = 0;\n int slen = s.length();\n int tlen = t.length();\n for(int i=0; i+tlen <= slen; i++) {\n String ssub = s.substring(i, i+tlen);\n int match = 0;\n for(int j=0; j<tlen; j++) {\n if(t.charAt(j) == ssub.charAt(j)) {\n match++;\n }\n }\n maxMatch = Math.max(maxMatch, match);\n }\n System.out.println(tlen - maxMatch);\n }\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String s = in.next();
String t = in.next();
int maxMatch = 0;
int slen = s.length();
int tlen = t.length();
for(int i=0; i+tlen <= slen; i++) {
String ssub = s.substring(i, i+tlen);
int match = 0;
for(int j=0; j<tlen; j++) {
if(t.charAt(j) == ssub.charAt(j)) {
match++;
}
}
maxMatch = Math.max(maxMatch, match);
}
System.out.println(tlen - maxMatch);
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
4,
13,
14,
2,
13,
17,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
38,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
2,
4,
18,
13,
4,
18,
13,
17,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
2,
13,
4,
18,
13,
41,
13,
17,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
13,
18,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
29,
13,
6,
13,
12,
13,
30,
41,
13,
20,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
30,
4,
18,
13,
13,
14,
2,
2,
13,
13,
13,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
29,
13,
23,
13,
6,
13,
12,
13,
30,
29,
4,
18,
13,
13,
23,
13,
12,
13,
30,
29,
2,
17,
2,
13,
2,
17,
13,
23,
13,
23,
13,
12,
13,
30,
29,
0,
13,
2,
17,
13,
23,
13,
23,
13,
12,
13,
30,
29,
0,
13,
40,
2,
17,
13,
23,
13,
23,
13,
12,
13,
30,
29,
8,
4,
13,
13,
13,
4,
13,
13,
13,
4,
13,
13,
13,
23,
13,
23,
13,
12,
13,
30,
29,
40,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
273,
14
],
[
273,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
17,
22
],
[
22,
23
],
[
23,
24
],
[
23,
25
],
[
22,
26
],
[
26,
27
],
[
27,
28
],
[
28,
29
],
[
28,
30
],
[
26,
31
],
[
15,
32
],
[
32,
33
],
[
273,
34
],
[
34,
35
],
[
34,
36
],
[
36,
37
],
[
37,
38
],
[
38,
39
],
[
39,
40
],
[
39,
41
],
[
38,
42
],
[
42,
43
],
[
42,
44
],
[
44,
45
],
[
45,
46
],
[
38,
47
],
[
47,
48
],
[
47,
49
],
[
49,
50
],
[
50,
51
],
[
38,
52
],
[
52,
53
],
[
52,
54
],
[
38,
55
],
[
55,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
55,
60
],
[
60,
61
],
[
60,
62
],
[
62,
63
],
[
63,
64
],
[
64,
65
],
[
65,
66
],
[
63,
67
],
[
67,
68
],
[
68,
69
],
[
62,
70
],
[
55,
71
],
[
71,
72
],
[
72,
73
],
[
55,
74
],
[
75,
75
],
[
75,
76
],
[
76,
77
],
[
76,
78
],
[
78,
79
],
[
79,
80
],
[
78,
81
],
[
78,
82
],
[
82,
83
],
[
82,
84
],
[
84,
85
],
[
85,
86
],
[
75,
87
],
[
87,
88
],
[
87,
89
],
[
75,
90
],
[
90,
91
],
[
90,
92
],
[
92,
93
],
[
93,
94
],
[
75,
95
],
[
95,
96
],
[
95,
97
],
[
97,
98
],
[
98,
99
],
[
75,
100
],
[
100,
101
],
[
101,
102
],
[
102,
103
],
[
102,
104
],
[
100,
105
],
[
105,
106
],
[
105,
107
],
[
107,
108
],
[
108,
109
],
[
100,
110
],
[
110,
111
],
[
111,
112
],
[
100,
113
],
[
114,
114
],
[
114,
115
],
[
115,
116
],
[
116,
117
],
[
117,
118
],
[
117,
119
],
[
116,
120
],
[
120,
121
],
[
120,
122
],
[
115,
123
],
[
123,
124
],
[
124,
125
],
[
75,
126
],
[
126,
127
],
[
126,
128
],
[
128,
129
],
[
129,
130
],
[
128,
131
],
[
128,
132
],
[
38,
133
],
[
133,
134
],
[
0,
135
],
[
135,
136
],
[
135,
137
],
[
137,
138
],
[
137,
139
],
[
139,
140
],
[
140,
141
],
[
140,
142
],
[
139,
143
],
[
143,
144
],
[
144,
145
],
[
145,
146
],
[
145,
147
],
[
143,
148
],
[
148,
149
],
[
149,
150
],
[
149,
151
],
[
148,
152
],
[
143,
153
],
[
153,
154
],
[
154,
155
],
[
143,
156
],
[
157,
157
],
[
157,
158
],
[
158,
159
],
[
159,
160
],
[
160,
161
],
[
160,
162
],
[
159,
163
],
[
158,
164
],
[
164,
165
],
[
165,
166
],
[
166,
167
],
[
165,
168
],
[
164,
169
],
[
169,
170
],
[
170,
171
],
[
171,
172
],
[
171,
173
],
[
170,
174
],
[
169,
175
],
[
175,
176
],
[
176,
177
],
[
175,
178
],
[
178,
179
],
[
178,
180
],
[
139,
181
],
[
181,
182
],
[
182,
183
],
[
181,
184
],
[
139,
185
],
[
185,
186
],
[
137,
187
],
[
187,
188
],
[
0,
189
],
[
189,
190
],
[
189,
191
],
[
191,
192
],
[
191,
193
],
[
193,
194
],
[
194,
195
],
[
195,
196
],
[
196,
197
],
[
195,
198
],
[
191,
199
],
[
199,
200
],
[
189,
201
],
[
201,
202
],
[
201,
203
],
[
203,
204
],
[
204,
205
],
[
205,
206
],
[
205,
207
],
[
207,
208
],
[
207,
209
],
[
209,
210
],
[
209,
211
],
[
201,
212
],
[
212,
213
],
[
201,
214
],
[
214,
215
],
[
189,
216
],
[
216,
217
],
[
216,
218
],
[
218,
219
],
[
219,
220
],
[
220,
221
],
[
220,
222
],
[
222,
223
],
[
222,
224
],
[
216,
225
],
[
225,
226
],
[
216,
227
],
[
227,
228
],
[
189,
229
],
[
229,
230
],
[
229,
231
],
[
231,
232
],
[
232,
233
],
[
233,
234
],
[
233,
235
],
[
235,
236
],
[
236,
237
],
[
236,
238
],
[
229,
239
],
[
239,
240
],
[
229,
241
],
[
241,
242
],
[
189,
243
],
[
243,
244
],
[
243,
245
],
[
245,
246
],
[
246,
247
],
[
247,
248
],
[
248,
249
],
[
248,
250
],
[
248,
251
],
[
247,
252
],
[
252,
253
],
[
252,
254
],
[
252,
255
],
[
247,
256
],
[
256,
257
],
[
256,
258
],
[
256,
259
],
[
243,
260
],
[
260,
261
],
[
243,
262
],
[
262,
263
],
[
189,
264
],
[
264,
265
],
[
264,
266
],
[
266,
267
],
[
267,
268
],
[
268,
269
],
[
264,
270
],
[
270,
271
],
[
0,
272
],
[
272,
273
],
[
272,
274
]
]
| [
"import java.util.ArrayList;\nimport java.util.Collection;\nimport java.util.Collections;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Object o = run();\n if (o != null)\n System.out.println(o);\n }\n\n static Object run() {\n try (Scanner sc = new Scanner(System.in)) {\n String s = sc.next();\n String t = sc.next();\n int resultMin = 10000;\n for (int i = 0; i < s.length() - t.length() + 1; i++) {\n String sSub = s.substring(i, i + t.length());\n int result = 0;\n\n char[] sa = sSub.toCharArray();\n char[] ta = t.toCharArray();\n\n for (int j = 0; j < sSub.length(); j++) {\n if (sa[j] != ta[j]) {\n result++;\n }\n }\n resultMin = Math.min(result, resultMin);\n }\n return resultMin;\n }\n }\n}\n\nclass ChenNumberUtil {\n static Collection<Integer> getDivisors(int n) {\n ArrayList<Integer> al = new ArrayList<>();\n for (int i = 1; i * i <= n; i++) {\n if (n % i == 0) {\n al.add(i);\n if (n / i != i)\n al.add(n / i);\n }\n }\n Collections.sort(al);\n return al;\n }\n}\n\nclass ChenBitUtil {\n static int popCount(int bit) {\n return Integer.bitCount(bit);\n }\n\n static boolean isFlag(int bit, int i) {\n return 0 != (bit & (1 << i));\n }\n\n static int setTrue(int bit, int i) {\n return bit |= (1 << i);\n }\n\n static int setFalse(int bit, int i) {\n return bit &= ~(1 << i);\n }\n\n static int setReverse(int bit, int i) {\n return isFlag(bit, i) ? setFalse(bit, i) : setTrue(bit, i);\n }\n\n static int reverseAll(int bit) {\n return ~bit;\n }\n}",
"import java.util.ArrayList;",
"ArrayList",
"java.util",
"import java.util.Collection;",
"Collection",
"java.util",
"import java.util.Collections;",
"Collections",
"java.util",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n public static void main(String[] args) {\n Object o = run();\n if (o != null)\n System.out.println(o);\n }\n\n static Object run() {\n try (Scanner sc = new Scanner(System.in)) {\n String s = sc.next();\n String t = sc.next();\n int resultMin = 10000;\n for (int i = 0; i < s.length() - t.length() + 1; i++) {\n String sSub = s.substring(i, i + t.length());\n int result = 0;\n\n char[] sa = sSub.toCharArray();\n char[] ta = t.toCharArray();\n\n for (int j = 0; j < sSub.length(); j++) {\n if (sa[j] != ta[j]) {\n result++;\n }\n }\n resultMin = Math.min(result, resultMin);\n }\n return resultMin;\n }\n }\n}",
"Main",
"public static void main(String[] args) {\n Object o = run();\n if (o != null)\n System.out.println(o);\n }",
"main",
"{\n Object o = run();\n if (o != null)\n System.out.println(o);\n }",
"Object o = run();",
"o",
"run()",
"run",
"if (o != null)\n System.out.println(o);",
"o != null",
"o",
"null",
"System.out.println(o)",
"System.out.println",
"System.out",
"System",
"System.out",
"o",
"String[] args",
"args",
"static Object run() {\n try (Scanner sc = new Scanner(System.in)) {\n String s = sc.next();\n String t = sc.next();\n int resultMin = 10000;\n for (int i = 0; i < s.length() - t.length() + 1; i++) {\n String sSub = s.substring(i, i + t.length());\n int result = 0;\n\n char[] sa = sSub.toCharArray();\n char[] ta = t.toCharArray();\n\n for (int j = 0; j < sSub.length(); j++) {\n if (sa[j] != ta[j]) {\n result++;\n }\n }\n resultMin = Math.min(result, resultMin);\n }\n return resultMin;\n }\n }",
"run",
"{\n try (Scanner sc = new Scanner(System.in)) {\n String s = sc.next();\n String t = sc.next();\n int resultMin = 10000;\n for (int i = 0; i < s.length() - t.length() + 1; i++) {\n String sSub = s.substring(i, i + t.length());\n int result = 0;\n\n char[] sa = sSub.toCharArray();\n char[] ta = t.toCharArray();\n\n for (int j = 0; j < sSub.length(); j++) {\n if (sa[j] != ta[j]) {\n result++;\n }\n }\n resultMin = Math.min(result, resultMin);\n }\n return resultMin;\n }\n }",
"try (Scanner sc = new Scanner(System.in)) {\n String s = sc.next();\n String t = sc.next();\n int resultMin = 10000;\n for (int i = 0; i < s.length() - t.length() + 1; i++) {\n String sSub = s.substring(i, i + t.length());\n int result = 0;\n\n char[] sa = sSub.toCharArray();\n char[] ta = t.toCharArray();\n\n for (int j = 0; j < sSub.length(); j++) {\n if (sa[j] != ta[j]) {\n result++;\n }\n }\n resultMin = Math.min(result, resultMin);\n }\n return resultMin;\n }",
"{\n String s = sc.next();\n String t = sc.next();\n int resultMin = 10000;\n for (int i = 0; i < s.length() - t.length() + 1; i++) {\n String sSub = s.substring(i, i + t.length());\n int result = 0;\n\n char[] sa = sSub.toCharArray();\n char[] ta = t.toCharArray();\n\n for (int j = 0; j < sSub.length(); j++) {\n if (sa[j] != ta[j]) {\n result++;\n }\n }\n resultMin = Math.min(result, resultMin);\n }\n return resultMin;\n }",
"Scanner sc = new Scanner(System.in)",
"Scanner sc = new Scanner(System.in)",
"new Scanner(System.in)",
"String s = sc.next();",
"s",
"sc.next()",
"sc.next",
"sc",
"String t = sc.next();",
"t",
"sc.next()",
"sc.next",
"sc",
"int resultMin = 10000;",
"resultMin",
"10000",
"for (int i = 0; i < s.length() - t.length() + 1; i++) {\n String sSub = s.substring(i, i + t.length());\n int result = 0;\n\n char[] sa = sSub.toCharArray();\n char[] ta = t.toCharArray();\n\n for (int j = 0; j < sSub.length(); j++) {\n if (sa[j] != ta[j]) {\n result++;\n }\n }\n resultMin = Math.min(result, resultMin);\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < s.length() - t.length() + 1",
"i",
"s.length() - t.length() + 1",
"s.length() - t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"1",
"i++",
"i++",
"i",
"{\n String sSub = s.substring(i, i + t.length());\n int result = 0;\n\n char[] sa = sSub.toCharArray();\n char[] ta = t.toCharArray();\n\n for (int j = 0; j < sSub.length(); j++) {\n if (sa[j] != ta[j]) {\n result++;\n }\n }\n resultMin = Math.min(result, resultMin);\n }",
"{\n String sSub = s.substring(i, i + t.length());\n int result = 0;\n\n char[] sa = sSub.toCharArray();\n char[] ta = t.toCharArray();\n\n for (int j = 0; j < sSub.length(); j++) {\n if (sa[j] != ta[j]) {\n result++;\n }\n }\n resultMin = Math.min(result, resultMin);\n }",
"String sSub = s.substring(i, i + t.length());",
"sSub",
"s.substring(i, i + t.length())",
"s.substring",
"s",
"i",
"i + t.length()",
"i",
"t.length()",
"t.length",
"t",
"int result = 0;",
"result",
"0",
"char[] sa = sSub.toCharArray();",
"sa",
"sSub.toCharArray()",
"sSub.toCharArray",
"sSub",
"char[] ta = t.toCharArray();",
"ta",
"t.toCharArray()",
"t.toCharArray",
"t",
"for (int j = 0; j < sSub.length(); j++) {\n if (sa[j] != ta[j]) {\n result++;\n }\n }",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < sSub.length()",
"j",
"sSub.length()",
"sSub.length",
"sSub",
"j++",
"j++",
"j",
"{\n if (sa[j] != ta[j]) {\n result++;\n }\n }",
"{\n if (sa[j] != ta[j]) {\n result++;\n }\n }",
"if (sa[j] != ta[j]) {\n result++;\n }",
"sa[j] != ta[j]",
"sa[j]",
"sa",
"j",
"ta[j]",
"ta",
"j",
"{\n result++;\n }",
"result++",
"result",
"resultMin = Math.min(result, resultMin)",
"resultMin",
"Math.min(result, resultMin)",
"Math.min",
"Math",
"result",
"resultMin",
"return resultMin;",
"resultMin",
"class ChenNumberUtil {\n static Collection<Integer> getDivisors(int n) {\n ArrayList<Integer> al = new ArrayList<>();\n for (int i = 1; i * i <= n; i++) {\n if (n % i == 0) {\n al.add(i);\n if (n / i != i)\n al.add(n / i);\n }\n }\n Collections.sort(al);\n return al;\n }\n}",
"ChenNumberUtil",
"static Collection<Integer> getDivisors(int n) {\n ArrayList<Integer> al = new ArrayList<>();\n for (int i = 1; i * i <= n; i++) {\n if (n % i == 0) {\n al.add(i);\n if (n / i != i)\n al.add(n / i);\n }\n }\n Collections.sort(al);\n return al;\n }",
"getDivisors",
"{\n ArrayList<Integer> al = new ArrayList<>();\n for (int i = 1; i * i <= n; i++) {\n if (n % i == 0) {\n al.add(i);\n if (n / i != i)\n al.add(n / i);\n }\n }\n Collections.sort(al);\n return al;\n }",
"ArrayList<Integer> al = new ArrayList<>();",
"al",
"new ArrayList<>()",
"for (int i = 1; i * i <= n; i++) {\n if (n % i == 0) {\n al.add(i);\n if (n / i != i)\n al.add(n / i);\n }\n }",
"int i = 1;",
"int i = 1;",
"i",
"1",
"i * i <= n",
"i * i",
"i",
"i",
"n",
"i++",
"i++",
"i",
"{\n if (n % i == 0) {\n al.add(i);\n if (n / i != i)\n al.add(n / i);\n }\n }",
"{\n if (n % i == 0) {\n al.add(i);\n if (n / i != i)\n al.add(n / i);\n }\n }",
"if (n % i == 0) {\n al.add(i);\n if (n / i != i)\n al.add(n / i);\n }",
"n % i == 0",
"n % i",
"n",
"i",
"0",
"{\n al.add(i);\n if (n / i != i)\n al.add(n / i);\n }",
"al.add(i)",
"al.add",
"al",
"i",
"if (n / i != i)\n al.add(n / i);",
"n / i != i",
"n / i",
"n",
"i",
"i",
"al.add(n / i)",
"al.add",
"al",
"n / i",
"n",
"i",
"Collections.sort(al)",
"Collections.sort",
"Collections",
"al",
"return al;",
"al",
"int n",
"n",
"class ChenBitUtil {\n static int popCount(int bit) {\n return Integer.bitCount(bit);\n }\n\n static boolean isFlag(int bit, int i) {\n return 0 != (bit & (1 << i));\n }\n\n static int setTrue(int bit, int i) {\n return bit |= (1 << i);\n }\n\n static int setFalse(int bit, int i) {\n return bit &= ~(1 << i);\n }\n\n static int setReverse(int bit, int i) {\n return isFlag(bit, i) ? setFalse(bit, i) : setTrue(bit, i);\n }\n\n static int reverseAll(int bit) {\n return ~bit;\n }\n}",
"ChenBitUtil",
"static int popCount(int bit) {\n return Integer.bitCount(bit);\n }",
"popCount",
"{\n return Integer.bitCount(bit);\n }",
"return Integer.bitCount(bit);",
"Integer.bitCount(bit)",
"Integer.bitCount",
"Integer",
"bit",
"int bit",
"bit",
"static boolean isFlag(int bit, int i) {\n return 0 != (bit & (1 << i));\n }",
"isFlag",
"{\n return 0 != (bit & (1 << i));\n }",
"return 0 != (bit & (1 << i));",
"0 != (bit & (1 << i))",
"0",
"(bit & (1 << i))",
"bit",
"(1 << i)",
"1",
"i",
"int bit",
"bit",
"int i",
"i",
"static int setTrue(int bit, int i) {\n return bit |= (1 << i);\n }",
"setTrue",
"{\n return bit |= (1 << i);\n }",
"return bit |= (1 << i);",
"bit |= (1 << i)",
"bit",
"(1 << i)",
"1",
"i",
"int bit",
"bit",
"int i",
"i",
"static int setFalse(int bit, int i) {\n return bit &= ~(1 << i);\n }",
"setFalse",
"{\n return bit &= ~(1 << i);\n }",
"return bit &= ~(1 << i);",
"bit &= ~(1 << i)",
"bit",
"~(1 << i)",
"(1 << i)",
"1",
"i",
"int bit",
"bit",
"int i",
"i",
"static int setReverse(int bit, int i) {\n return isFlag(bit, i) ? setFalse(bit, i) : setTrue(bit, i);\n }",
"setReverse",
"{\n return isFlag(bit, i) ? setFalse(bit, i) : setTrue(bit, i);\n }",
"return isFlag(bit, i) ? setFalse(bit, i) : setTrue(bit, i);",
"isFlag(bit, i) ? setFalse(bit, i) : setTrue(bit, i)",
"isFlag(bit, i)",
"isFlag",
"bit",
"i",
"setFalse(bit, i)",
"setFalse",
"bit",
"i",
"setTrue(bit, i)",
"setTrue",
"bit",
"i",
"int bit",
"bit",
"int i",
"i",
"static int reverseAll(int bit) {\n return ~bit;\n }",
"reverseAll",
"{\n return ~bit;\n }",
"return ~bit;",
"~bit",
"bit",
"int bit",
"bit",
"public class Main {\n public static void main(String[] args) {\n Object o = run();\n if (o != null)\n System.out.println(o);\n }\n\n static Object run() {\n try (Scanner sc = new Scanner(System.in)) {\n String s = sc.next();\n String t = sc.next();\n int resultMin = 10000;\n for (int i = 0; i < s.length() - t.length() + 1; i++) {\n String sSub = s.substring(i, i + t.length());\n int result = 0;\n\n char[] sa = sSub.toCharArray();\n char[] ta = t.toCharArray();\n\n for (int j = 0; j < sSub.length(); j++) {\n if (sa[j] != ta[j]) {\n result++;\n }\n }\n resultMin = Math.min(result, resultMin);\n }\n return resultMin;\n }\n }\n}",
"public class Main {\n public static void main(String[] args) {\n Object o = run();\n if (o != null)\n System.out.println(o);\n }\n\n static Object run() {\n try (Scanner sc = new Scanner(System.in)) {\n String s = sc.next();\n String t = sc.next();\n int resultMin = 10000;\n for (int i = 0; i < s.length() - t.length() + 1; i++) {\n String sSub = s.substring(i, i + t.length());\n int result = 0;\n\n char[] sa = sSub.toCharArray();\n char[] ta = t.toCharArray();\n\n for (int j = 0; j < sSub.length(); j++) {\n if (sa[j] != ta[j]) {\n result++;\n }\n }\n resultMin = Math.min(result, resultMin);\n }\n return resultMin;\n }\n }\n}",
"Main"
]
| import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Object o = run();
if (o != null)
System.out.println(o);
}
static Object run() {
try (Scanner sc = new Scanner(System.in)) {
String s = sc.next();
String t = sc.next();
int resultMin = 10000;
for (int i = 0; i < s.length() - t.length() + 1; i++) {
String sSub = s.substring(i, i + t.length());
int result = 0;
char[] sa = sSub.toCharArray();
char[] ta = t.toCharArray();
for (int j = 0; j < sSub.length(); j++) {
if (sa[j] != ta[j]) {
result++;
}
}
resultMin = Math.min(result, resultMin);
}
return resultMin;
}
}
}
class ChenNumberUtil {
static Collection<Integer> getDivisors(int n) {
ArrayList<Integer> al = new ArrayList<>();
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
al.add(i);
if (n / i != i)
al.add(n / i);
}
}
Collections.sort(al);
return al;
}
}
class ChenBitUtil {
static int popCount(int bit) {
return Integer.bitCount(bit);
}
static boolean isFlag(int bit, int i) {
return 0 != (bit & (1 << i));
}
static int setTrue(int bit, int i) {
return bit |= (1 << i);
}
static int setFalse(int bit, int i) {
return bit &= ~(1 << i);
}
static int setReverse(int bit, int i) {
return isFlag(bit, i) ? setFalse(bit, i) : setTrue(bit, i);
}
static int reverseAll(int bit) {
return ~bit;
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
40,
4,
18,
4,
18,
13,
4,
18,
13,
2,
13,
13,
4,
18,
13,
4,
18,
13,
13,
30,
40,
13,
14,
2,
13,
13,
30,
0,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
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
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
25,
26
],
[
8,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
29,
31
],
[
27,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
35,
36
],
[
36,
37
],
[
34,
38
],
[
38,
39
],
[
39,
40
],
[
27,
41
],
[
41,
42
],
[
42,
43
],
[
27,
44
],
[
45,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
45,
49
],
[
49,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
49,
54
],
[
54,
55
],
[
54,
56
],
[
56,
57
],
[
57,
58
],
[
49,
59
],
[
59,
60
],
[
60,
61
],
[
49,
62
],
[
63,
63
],
[
63,
64
],
[
64,
65
],
[
65,
66
],
[
66,
67
],
[
67,
68
],
[
68,
69
],
[
69,
70
],
[
68,
71
],
[
71,
72
],
[
72,
73
],
[
71,
74
],
[
74,
75
],
[
74,
76
],
[
66,
77
],
[
77,
78
],
[
78,
79
],
[
77,
80
],
[
80,
81
],
[
81,
82
],
[
80,
83
],
[
64,
84
],
[
84,
85
],
[
85,
86
],
[
45,
87
],
[
87,
88
],
[
88,
89
],
[
88,
90
],
[
87,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
8,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
97,
99
],
[
95,
100
],
[
6,
101
],
[
101,
102
],
[
0,
103
],
[
103,
104
],
[
103,
105
]
]
| [
"import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n String line = sc.nextLine();\n String str = sc.nextLine();\n int min = line.length();\n for(int i = 0;i <= line.length() - str.length();i++){\n int temp = 0;\n for(int j = 0;j < str.length();j++){\n if(!String.valueOf(line.charAt(i + j)).equals(String.valueOf(str.charAt(j)))){\n temp++;\n }\n }\n if(temp < min){\n min = temp;\n }\n }\n System.out.println(min);\n }\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n String line = sc.nextLine();\n String str = sc.nextLine();\n int min = line.length();\n for(int i = 0;i <= line.length() - str.length();i++){\n int temp = 0;\n for(int j = 0;j < str.length();j++){\n if(!String.valueOf(line.charAt(i + j)).equals(String.valueOf(str.charAt(j)))){\n temp++;\n }\n }\n if(temp < min){\n min = temp;\n }\n }\n System.out.println(min);\n }\n}",
"Main",
"public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n String line = sc.nextLine();\n String str = sc.nextLine();\n int min = line.length();\n for(int i = 0;i <= line.length() - str.length();i++){\n int temp = 0;\n for(int j = 0;j < str.length();j++){\n if(!String.valueOf(line.charAt(i + j)).equals(String.valueOf(str.charAt(j)))){\n temp++;\n }\n }\n if(temp < min){\n min = temp;\n }\n }\n System.out.println(min);\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n String line = sc.nextLine();\n String str = sc.nextLine();\n int min = line.length();\n for(int i = 0;i <= line.length() - str.length();i++){\n int temp = 0;\n for(int j = 0;j < str.length();j++){\n if(!String.valueOf(line.charAt(i + j)).equals(String.valueOf(str.charAt(j)))){\n temp++;\n }\n }\n if(temp < min){\n min = temp;\n }\n }\n System.out.println(min);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String line = sc.nextLine();",
"line",
"sc.nextLine()",
"sc.nextLine",
"sc",
"String str = sc.nextLine();",
"str",
"sc.nextLine()",
"sc.nextLine",
"sc",
"int min = line.length();",
"min",
"line.length()",
"line.length",
"line",
"for(int i = 0;i <= line.length() - str.length();i++){\n int temp = 0;\n for(int j = 0;j < str.length();j++){\n if(!String.valueOf(line.charAt(i + j)).equals(String.valueOf(str.charAt(j)))){\n temp++;\n }\n }\n if(temp < min){\n min = temp;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= line.length() - str.length()",
"i",
"line.length() - str.length()",
"line.length()",
"line.length",
"line",
"str.length()",
"str.length",
"str",
"i++",
"i++",
"i",
"{\n int temp = 0;\n for(int j = 0;j < str.length();j++){\n if(!String.valueOf(line.charAt(i + j)).equals(String.valueOf(str.charAt(j)))){\n temp++;\n }\n }\n if(temp < min){\n min = temp;\n }\n }",
"{\n int temp = 0;\n for(int j = 0;j < str.length();j++){\n if(!String.valueOf(line.charAt(i + j)).equals(String.valueOf(str.charAt(j)))){\n temp++;\n }\n }\n if(temp < min){\n min = temp;\n }\n }",
"int temp = 0;",
"temp",
"0",
"for(int j = 0;j < str.length();j++){\n if(!String.valueOf(line.charAt(i + j)).equals(String.valueOf(str.charAt(j)))){\n temp++;\n }\n }",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < str.length()",
"j",
"str.length()",
"str.length",
"str",
"j++",
"j++",
"j",
"{\n if(!String.valueOf(line.charAt(i + j)).equals(String.valueOf(str.charAt(j)))){\n temp++;\n }\n }",
"{\n if(!String.valueOf(line.charAt(i + j)).equals(String.valueOf(str.charAt(j)))){\n temp++;\n }\n }",
"if(!String.valueOf(line.charAt(i + j)).equals(String.valueOf(str.charAt(j)))){\n temp++;\n }",
"!String.valueOf(line.charAt(i + j)).equals(String.valueOf(str.charAt(j)))",
"String.valueOf(line.charAt(i + j)).equals(String.valueOf(str.charAt(j)))",
"String.valueOf(line.charAt(i + j)).equals",
"String.valueOf(line.charAt(i + j))",
"String.valueOf",
"String",
"line.charAt(i + j)",
"line.charAt",
"line",
"i + j",
"i",
"j",
"String.valueOf(str.charAt(j))",
"String.valueOf",
"String",
"str.charAt(j)",
"str.charAt",
"str",
"j",
"{\n temp++;\n }",
"temp++",
"temp",
"if(temp < min){\n min = temp;\n }",
"temp < min",
"temp",
"min",
"{\n min = temp;\n }",
"min = temp",
"min",
"temp",
"System.out.println(min)",
"System.out.println",
"System.out",
"System",
"System.out",
"min",
"String[] args",
"args",
"public class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n String line = sc.nextLine();\n String str = sc.nextLine();\n int min = line.length();\n for(int i = 0;i <= line.length() - str.length();i++){\n int temp = 0;\n for(int j = 0;j < str.length();j++){\n if(!String.valueOf(line.charAt(i + j)).equals(String.valueOf(str.charAt(j)))){\n temp++;\n }\n }\n if(temp < min){\n min = temp;\n }\n }\n System.out.println(min);\n }\n}",
"public class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n String line = sc.nextLine();\n String str = sc.nextLine();\n int min = line.length();\n for(int i = 0;i <= line.length() - str.length();i++){\n int temp = 0;\n for(int j = 0;j < str.length();j++){\n if(!String.valueOf(line.charAt(i + j)).equals(String.valueOf(str.charAt(j)))){\n temp++;\n }\n }\n if(temp < min){\n min = temp;\n }\n }\n System.out.println(min);\n }\n}",
"Main"
]
| import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
String line = sc.nextLine();
String str = sc.nextLine();
int min = line.length();
for(int i = 0;i <= line.length() - str.length();i++){
int temp = 0;
for(int j = 0;j < str.length();j++){
if(!String.valueOf(line.charAt(i + j)).equals(String.valueOf(str.charAt(j)))){
temp++;
}
}
if(temp < min){
min = temp;
}
}
System.out.println(min);
}
} |
[
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,
17,
0,
13,
2,
13,
13,
42,
2,
13,
17,
30,
14,
2,
2,
13,
17,
17,
0,
13,
2,
2,
13,
13,
13,
0,
13,
2,
13,
17,
0,
13,
2,
2,
13,
13,
13,
29,
13,
23,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
17,
41,
13,
2,
13,
17,
41,
13,
13,
42,
2,
13,
13,
30,
41,
13,
2,
13,
2,
2,
13,
13,
17,
14,
2,
18,
13,
13,
13,
30,
0,
13,
13,
0,
13,
2,
13,
17,
0,
13,
2,
13,
17,
29,
2,
13,
13,
23,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
17,
41,
13,
2,
13,
17,
41,
13,
13,
42,
2,
13,
13,
30,
41,
13,
2,
13,
2,
2,
13,
13,
17,
14,
2,
18,
13,
13,
13,
30,
0,
13,
13,
0,
13,
2,
13,
17,
0,
13,
2,
13,
17,
29,
13,
23,
13,
23,
13,
23,
13,
12,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
41,
13,
20,
41,
13,
20,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
0,
13,
4,
18,
13,
0,
13,
4,
18,
13,
0,
13,
4,
18,
13,
0,
13,
4,
18,
13,
0,
13,
17,
0,
13,
18,
13,
13,
11,
1,
0,
13,
17,
2,
13,
2,
13,
13,
1,
40,
13,
30,
30,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
40,
13,
14,
2,
13,
13,
0,
13,
13,
0,
13,
17,
4,
18,
13,
2,
13,
17,
4,
18,
13,
17,
4,
18,
13,
23,
13,
6,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
20,
12,
13,
30,
0,
18,
36,
13,
13,
0,
18,
36,
13,
17,
23,
13,
6,
13,
41,
13,
41,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
13,
0,
13,
20,
13,
0,
13,
20,
13,
0,
18,
36,
13,
13,
4,
13,
23,
13,
12,
13,
30,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
13,
0,
18,
13,
13,
17,
12,
13,
30,
14,
2,
18,
13,
13,
13,
30,
0,
18,
13,
13,
4,
13,
18,
13,
13,
29,
18,
13,
13,
23,
13,
12,
13,
30,
41,
13,
4,
13,
13,
29,
18,
13,
13,
23,
13,
12,
13,
30,
41,
13,
4,
13,
13,
41,
13,
4,
13,
13,
14,
2,
13,
13,
29,
14,
2,
18,
13,
13,
18,
13,
13,
30,
0,
18,
13,
13,
13,
0,
18,
13,
13,
2,
18,
13,
13,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
30,
0,
18,
13,
13,
13,
0,
18,
13,
13,
2,
18,
13,
13,
18,
13,
13,
30,
0,
18,
13,
13,
13,
0,
18,
13,
13,
2,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
2,
18,
13,
13,
17,
23,
13,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
29,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
16,
17
],
[
16,
18
],
[
0,
19
],
[
19,
20
],
[
19,
21
],
[
0,
22
],
[
22,
23
],
[
22,
24
],
[
0,
25
],
[
25,
26
],
[
25,
27
],
[
0,
28
],
[
28,
29
],
[
28,
30
],
[
0,
31
],
[
31,
32
],
[
31,
33
],
[
0,
34
],
[
34,
35
],
[
34,
36
],
[
0,
37
],
[
37,
38
],
[
37,
39
],
[
0,
40
],
[
737,
41
],
[
737,
42
],
[
42,
43
],
[
42,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
44,
48
],
[
48,
49
],
[
48,
50
],
[
50,
51
],
[
50,
52
],
[
44,
53
],
[
53,
54
],
[
54,
55
],
[
54,
56
],
[
53,
57
],
[
57,
58
],
[
58,
59
],
[
59,
60
],
[
60,
61
],
[
60,
62
],
[
59,
63
],
[
58,
64
],
[
64,
65
],
[
64,
66
],
[
66,
67
],
[
67,
68
],
[
67,
69
],
[
66,
70
],
[
57,
71
],
[
71,
72
],
[
71,
73
],
[
73,
74
],
[
73,
75
],
[
57,
76
],
[
76,
77
],
[
76,
78
],
[
78,
79
],
[
79,
80
],
[
79,
81
],
[
78,
82
],
[
44,
83
],
[
83,
84
],
[
42,
85
],
[
85,
86
],
[
42,
87
],
[
87,
88
],
[
42,
89
],
[
89,
90
],
[
737,
91
],
[
91,
92
],
[
91,
93
],
[
93,
94
],
[
94,
95
],
[
94,
96
],
[
93,
97
],
[
97,
98
],
[
97,
99
],
[
99,
100
],
[
99,
101
],
[
93,
102
],
[
102,
103
],
[
102,
104
],
[
93,
105
],
[
105,
106
],
[
106,
107
],
[
106,
108
],
[
105,
109
],
[
109,
110
],
[
110,
111
],
[
110,
112
],
[
112,
113
],
[
112,
114
],
[
114,
115
],
[
115,
116
],
[
115,
117
],
[
114,
118
],
[
109,
119
],
[
119,
120
],
[
120,
121
],
[
121,
122
],
[
121,
123
],
[
120,
124
],
[
119,
125
],
[
125,
126
],
[
126,
127
],
[
126,
128
],
[
125,
129
],
[
129,
130
],
[
129,
131
],
[
131,
132
],
[
131,
133
],
[
119,
134
],
[
134,
135
],
[
134,
136
],
[
136,
137
],
[
136,
138
],
[
93,
139
],
[
139,
140
],
[
140,
141
],
[
140,
142
],
[
91,
143
],
[
143,
144
],
[
91,
145
],
[
145,
146
],
[
91,
147
],
[
147,
148
],
[
737,
149
],
[
149,
150
],
[
149,
151
],
[
151,
152
],
[
152,
153
],
[
152,
154
],
[
151,
155
],
[
155,
156
],
[
155,
157
],
[
157,
158
],
[
157,
159
],
[
151,
160
],
[
160,
161
],
[
160,
162
],
[
151,
163
],
[
163,
164
],
[
164,
165
],
[
164,
166
],
[
163,
167
],
[
167,
168
],
[
168,
169
],
[
168,
170
],
[
170,
171
],
[
170,
172
],
[
172,
173
],
[
173,
174
],
[
173,
175
],
[
172,
176
],
[
167,
177
],
[
177,
178
],
[
178,
179
],
[
179,
180
],
[
179,
181
],
[
178,
182
],
[
177,
183
],
[
183,
184
],
[
184,
185
],
[
184,
186
],
[
183,
187
],
[
187,
188
],
[
187,
189
],
[
189,
190
],
[
189,
191
],
[
177,
192
],
[
192,
193
],
[
192,
194
],
[
194,
195
],
[
194,
196
],
[
151,
197
],
[
197,
198
],
[
149,
199
],
[
199,
200
],
[
149,
201
],
[
201,
202
],
[
149,
203
],
[
203,
204
],
[
737,
205
],
[
205,
206
],
[
205,
207
],
[
207,
208
],
[
208,
209
],
[
209,
210
],
[
209,
211
],
[
211,
212
],
[
212,
213
],
[
213,
214
],
[
208,
215
],
[
215,
216
],
[
216,
217
],
[
216,
218
],
[
215,
219
],
[
219,
220
],
[
219,
221
],
[
215,
222
],
[
222,
223
],
[
215,
224
],
[
224,
225
],
[
215,
226
],
[
226,
227
],
[
215,
228
],
[
228,
229
],
[
215,
230
],
[
230,
231
],
[
215,
232
],
[
232,
233
],
[
215,
234
],
[
234,
235
],
[
215,
236
],
[
236,
237
],
[
215,
238
],
[
238,
239
],
[
215,
240
],
[
240,
241
],
[
215,
242
],
[
242,
243
],
[
215,
244
],
[
244,
245
],
[
215,
246
],
[
246,
247
],
[
215,
248
],
[
248,
249
],
[
215,
250
],
[
250,
251
],
[
215,
252
],
[
252,
253
],
[
215,
254
],
[
254,
255
],
[
215,
256
],
[
256,
257
],
[
215,
258
],
[
258,
259
],
[
215,
260
],
[
260,
261
],
[
215,
262
],
[
262,
263
],
[
215,
264
],
[
264,
265
],
[
215,
266
],
[
266,
267
],
[
215,
268
],
[
268,
269
],
[
215,
270
],
[
270,
271
],
[
215,
272
],
[
272,
273
],
[
215,
274
],
[
274,
275
],
[
215,
276
],
[
276,
277
],
[
215,
278
],
[
278,
279
],
[
215,
280
],
[
280,
281
],
[
215,
282
],
[
282,
283
],
[
215,
284
],
[
284,
285
],
[
215,
286
],
[
286,
287
],
[
215,
288
],
[
288,
289
],
[
215,
290
],
[
290,
291
],
[
215,
292
],
[
292,
293
],
[
215,
294
],
[
294,
295
],
[
215,
296
],
[
296,
297
],
[
215,
298
],
[
298,
299
],
[
215,
300
],
[
300,
301
],
[
215,
302
],
[
302,
303
],
[
215,
304
],
[
304,
305
],
[
215,
306
],
[
306,
307
],
[
215,
308
],
[
308,
309
],
[
215,
310
],
[
310,
311
],
[
215,
312
],
[
312,
313
],
[
215,
314
],
[
314,
315
],
[
215,
316
],
[
316,
317
],
[
215,
318
],
[
318,
319
],
[
215,
320
],
[
320,
321
],
[
215,
322
],
[
322,
323
],
[
215,
324
],
[
324,
325
],
[
215,
326
],
[
326,
327
],
[
326,
328
],
[
328,
329
],
[
329,
330
],
[
215,
331
],
[
331,
332
],
[
331,
333
],
[
333,
334
],
[
334,
335
],
[
215,
336
],
[
336,
337
],
[
336,
338
],
[
338,
339
],
[
339,
340
],
[
215,
341
],
[
341,
342
],
[
341,
343
],
[
343,
344
],
[
344,
345
],
[
215,
346
],
[
346,
347
],
[
346,
348
],
[
215,
349
],
[
349,
350
],
[
349,
351
],
[
351,
352
],
[
351,
353
],
[
215,
354
],
[
354,
355
],
[
355,
356
],
[
356,
357
],
[
356,
358
],
[
354,
359
],
[
359,
360
],
[
359,
361
],
[
361,
362
],
[
361,
363
],
[
354,
364
],
[
364,
365
],
[
365,
366
],
[
354,
367
],
[
368,
368
],
[
368,
369
],
[
369,
370
],
[
370,
371
],
[
371,
372
],
[
371,
373
],
[
369,
374
],
[
374,
375
],
[
374,
376
],
[
369,
377
],
[
377,
378
],
[
378,
379
],
[
369,
380
],
[
381,
381
],
[
381,
382
],
[
382,
383
],
[
383,
384
],
[
384,
385
],
[
385,
386
],
[
384,
387
],
[
387,
388
],
[
387,
389
],
[
383,
390
],
[
390,
391
],
[
391,
392
],
[
390,
393
],
[
382,
394
],
[
394,
395
],
[
368,
396
],
[
396,
397
],
[
397,
398
],
[
397,
399
],
[
396,
400
],
[
400,
401
],
[
400,
402
],
[
368,
403
],
[
403,
404
],
[
403,
405
],
[
215,
406
],
[
406,
407
],
[
407,
408
],
[
406,
409
],
[
409,
410
],
[
409,
411
],
[
215,
412
],
[
412,
413
],
[
413,
414
],
[
412,
415
],
[
215,
416
],
[
416,
417
],
[
417,
418
],
[
205,
419
],
[
419,
420
],
[
737,
421
],
[
421,
422
],
[
421,
423
],
[
423,
424
],
[
421,
425
],
[
425,
426
],
[
421,
427
],
[
427,
428
],
[
421,
429
],
[
429,
430
],
[
421,
431
],
[
431,
432
],
[
421,
433
],
[
433,
434
],
[
433,
435
],
[
421,
436
],
[
436,
437
],
[
436,
438
],
[
438,
439
],
[
439,
440
],
[
440,
441
],
[
440,
442
],
[
439,
443
],
[
438,
444
],
[
444,
445
],
[
445,
446
],
[
445,
447
],
[
444,
448
],
[
436,
449
],
[
449,
450
],
[
737,
451
],
[
451,
452
],
[
451,
453
],
[
453,
454
],
[
451,
455
],
[
455,
456
],
[
451,
457
],
[
457,
458
],
[
451,
459
],
[
459,
460
],
[
451,
461
],
[
461,
462
],
[
461,
463
],
[
463,
464
],
[
464,
465
],
[
464,
466
],
[
463,
468
],
[
468,
469
],
[
468,
470
],
[
463,
472
],
[
472,
473
],
[
472,
474
],
[
463,
476
],
[
476,
477
],
[
477,
478
],
[
477,
479
],
[
476,
480
],
[
463,
481
],
[
481,
482
],
[
461,
483
],
[
483,
484
],
[
451,
485
],
[
485,
486
],
[
485,
487
],
[
487,
488
],
[
488,
489
],
[
489,
490
],
[
490,
491
],
[
490,
492
],
[
488,
493
],
[
493,
494
],
[
493,
495
],
[
488,
496
],
[
496,
497
],
[
497,
498
],
[
488,
499
],
[
500,
500
],
[
500,
501
],
[
501,
502
],
[
502,
503
],
[
502,
504
],
[
501,
505
],
[
500,
506
],
[
506,
507
],
[
507,
508
],
[
507,
509
],
[
506,
510
],
[
451,
511
],
[
511,
512
],
[
511,
513
],
[
513,
514
],
[
514,
515
],
[
515,
516
],
[
516,
517
],
[
516,
518
],
[
515,
519
],
[
514,
520
],
[
520,
521
],
[
521,
522
],
[
522,
523
],
[
522,
524
],
[
521,
525
],
[
525,
526
],
[
525,
527
],
[
527,
528
],
[
527,
529
],
[
513,
530
],
[
530,
531
],
[
531,
532
],
[
531,
533
],
[
511,
534
],
[
534,
535
],
[
451,
536
],
[
536,
537
],
[
536,
538
],
[
538,
539
],
[
539,
540
],
[
539,
541
],
[
541,
542
],
[
541,
543
],
[
538,
544
],
[
544,
545
],
[
545,
546
],
[
545,
547
],
[
536,
548
],
[
548,
549
],
[
451,
550
],
[
550,
551
],
[
550,
552
],
[
552,
553
],
[
553,
554
],
[
553,
555
],
[
555,
556
],
[
555,
557
],
[
552,
558
],
[
558,
559
],
[
558,
560
],
[
560,
561
],
[
560,
562
],
[
552,
563
],
[
563,
564
],
[
564,
565
],
[
564,
566
],
[
563,
567
],
[
552,
568
],
[
568,
569
],
[
569,
570
],
[
570,
571
],
[
570,
572
],
[
569,
573
],
[
573,
574
],
[
573,
575
],
[
568,
576
],
[
576,
577
],
[
577,
578
],
[
578,
579
],
[
578,
580
],
[
577,
581
],
[
576,
582
],
[
582,
583
],
[
583,
584
],
[
583,
585
],
[
582,
586
],
[
586,
587
],
[
587,
588
],
[
587,
589
],
[
586,
590
],
[
590,
591
],
[
590,
592
],
[
568,
593
],
[
593,
594
],
[
594,
595
],
[
595,
596
],
[
595,
597
],
[
594,
598
],
[
598,
599
],
[
598,
600
],
[
593,
601
],
[
601,
602
],
[
602,
603
],
[
603,
604
],
[
603,
605
],
[
602,
606
],
[
601,
607
],
[
607,
608
],
[
608,
609
],
[
608,
610
],
[
607,
611
],
[
611,
612
],
[
612,
613
],
[
612,
614
],
[
611,
615
],
[
615,
616
],
[
615,
617
],
[
593,
618
],
[
618,
619
],
[
619,
620
],
[
620,
621
],
[
620,
622
],
[
619,
623
],
[
618,
624
],
[
624,
625
],
[
625,
626
],
[
625,
627
],
[
624,
628
],
[
628,
629
],
[
629,
630
],
[
629,
631
],
[
628,
632
],
[
632,
633
],
[
632,
634
],
[
618,
635
],
[
635,
636
],
[
636,
637
],
[
636,
638
],
[
635,
639
],
[
639,
640
],
[
640,
641
],
[
640,
642
],
[
639,
643
],
[
550,
644
],
[
644,
645
],
[
550,
646
],
[
646,
647
],
[
0,
648
],
[
648,
649
],
[
648,
650
],
[
650,
651
],
[
648,
652
],
[
652,
653
],
[
648,
654
],
[
654,
655
],
[
654,
656
],
[
656,
657
],
[
657,
658
],
[
657,
659
],
[
648,
660
],
[
660,
661
],
[
660,
662
],
[
662,
663
],
[
663,
664
],
[
664,
665
],
[
665,
666
],
[
665,
667
],
[
664,
668
],
[
668,
669
],
[
669,
670
],
[
670,
671
],
[
663,
672
],
[
672,
673
],
[
673,
674
],
[
674,
675
],
[
674,
676
],
[
676,
677
],
[
677,
678
],
[
678,
679
],
[
673,
680
],
[
680,
681
],
[
681,
682
],
[
681,
683
],
[
662,
684
],
[
684,
685
],
[
685,
686
],
[
686,
687
],
[
648,
688
],
[
688,
689
],
[
688,
690
],
[
690,
691
],
[
691,
692
],
[
692,
693
],
[
693,
694
],
[
692,
695
],
[
695,
696
],
[
648,
697
],
[
697,
698
],
[
697,
699
],
[
699,
700
],
[
700,
701
],
[
701,
702
],
[
702,
703
],
[
701,
704
],
[
704,
705
],
[
648,
706
],
[
706,
707
],
[
706,
708
],
[
708,
709
],
[
709,
710
],
[
710,
711
],
[
711,
712
],
[
710,
713
],
[
713,
714
],
[
648,
715
],
[
715,
716
],
[
715,
717
],
[
717,
718
],
[
718,
719
],
[
718,
720
],
[
717,
721
],
[
721,
722
],
[
722,
723
],
[
722,
724
],
[
724,
725
],
[
725,
726
],
[
726,
727
],
[
721,
728
],
[
728,
729
],
[
729,
730
],
[
729,
731
],
[
731,
732
],
[
732,
733
],
[
717,
734
],
[
734,
735
],
[
0,
736
],
[
736,
737
],
[
736,
738
]
]
| [
"////////////////////////////////////////////////////\n// //\n// For her who keeps the fire kindling in me... //\n// //\n////////////////////////////////////////////////////\n\n\nimport java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.FileOutputStream;\nimport java.io.IOException; \nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.OutputStreamWriter;\nimport java.io.PrintWriter;\n// import java.util.Scanner;\n// import java.util.Arrays;\n// import java.util.ArrayList;\n// import java.util.Collections; \n// import java.util.StringTokenizer;\nimport java.util.*;\nimport java.lang.Math;\nimport java.sql.Array;\nimport java.awt.Point; \n\nimport java.awt.geom.*;\n\npublic class Main{\n\n static class Node{\n int x;\n int rank;\n int level;\n int fnodecount;\n char type;\n\n ArrayList<Node> children = new ArrayList<Node>(); \n\n public Node(int x){\n this.x = x;\n // this.rank = 0;\n this.type = 'f';\n }\n }\n\n\n\n static class DisjointUnionSets { \n int[] rank, parent, ele_count; \n int n; \n \n // Constructor \n public DisjointUnionSets(int n) \n { \n rank = new int[n]; \n parent = new int[n];\n ele_count = new int[n];\n this.n = n; \n makeSet(); \n } \n \n // Creates n sets with single item in each \n void makeSet() \n { \n for (int i = 0; i < n; i++) { \n // Initially, all elements are in \n // their own set. \n parent[i] = i; \n ele_count[i] = 1;\n } \n } \n \n // Returns representative of x's set \n int find(int x) \n { \n // Finds the representative of the set \n // that x is an element of \n if (parent[x] != x) { \n // if x is not the parent of itself \n // Then x is not the representative of \n // his set,\n\n parent[x] = find(parent[x]); \n \n // so we recursively call Find on its parent \n // and move i's node directly under the \n // representative of this set \n } \n \n return parent[x]; \n }\n\n\n\n int setSize(int x){\n int par = find(x);\n return ele_count[par];\n }\n \n\n\n // Unites the set that includes x and the set \n // that includes x \n void union(int x, int y) \n { \n // Find representatives of two sets \n int xRoot = find(x), yRoot = find(y); \n \n // Elements are in the same set, no need \n // to unite anything. \n if (xRoot == yRoot) \n return; \n \n // If x's rank is less than y's rank \n if (rank[xRoot] < rank[yRoot]){ \n \n // Then move x under y so that depth \n // of tree remains less \n parent[xRoot] = yRoot;\n \n ele_count[yRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n // Else if y's rank is less than x's rank \n }else if (rank[yRoot] < rank[xRoot]) {\n \n // Then move y under x so that depth of \n // tree remains less \n parent[yRoot] = xRoot; \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n } else // if ranks are the same \n { \n // Then move y under x (doesn't matter \n // which one goes where) \n parent[yRoot] = xRoot; \n \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n\n // And increment the result tree's \n // rank by 1 \n rank[xRoot] = rank[xRoot] + 1; \n } \n } \n } \n\n\n static long power(long x, long y, long p) \n { \n // Initialize result \n long res = 1l; \n \n // Update x if it is more \n // than or equal to p \n x = x % p; \n \n while (y > 0) \n { \n // If y is odd, multiply x \n // with result \n if((y & 1)==1) \n res = (res * x) % p; \n \n // y must be even now \n // y = y / 2 \n y = y >> 1; \n x = (x * x) % p; \n } \n return res; \n } \n\n\n\nstatic int countGreater(int arr[], int n, int k) \n{ \nint l = 0; \nint r = n - 1; \n\n// Stores the index of the left most element \n// from the array which is greater than k \nint leftGreater = n; \n\n// Finds number of elements greater than k \nwhile (l <= r) { \n int m = l + (r - l) / 2; \n\n // If mid element is greater than \n // k update leftGreater and r \n if (arr[m] > k) { \n leftGreater = m; \n r = m - 1; \n } \n\n // If mid element is less than \n // or equal to k update l \n else\n l = m + 1; \n} \n\n// Return the count of elements greater than k \nreturn (n - leftGreater); \n} \n\n\n\nstatic int countLessEqual(int arr[], int n, int k) \n{ \nint l = 0; \nint r = n - 1; \n\n// Stores the index of the left most element \n// from the array which is greater than k \nint leftGreater = n; \n\n// Finds number of elements greater than k \nwhile (l <= r) { \n int m = l + (r - l) / 2; \n\n // If mid element is greater than \n // k update leftGreater and r \n if (arr[m] > k) { \n leftGreater = m; \n r = m - 1; \n } \n\n // If mid element is less than \n // or equal to k update l \n else\n l = m + 1; \n} \n\n// Return the count of elements greater than k \nreturn (leftGreater); \n} \n\n\n public static void main(String args[]){\n try{\n FastReader s = new FastReader();\n // Scanner s = new Scanner(System.in);\n BufferedWriter w = new BufferedWriter(new OutputStreamWriter(System.out));\n int i, q, j, k, x, y, t, n, ind, count, diff, key, l, r, a, b, c, d, size, Pairer, max, min, sec_max, minglob, minloc, beg, end, begl, endr, ld, up, down, maxele, minele, case_count;\n long ans, sqrt, sum, maxup, maxdown, m, X, Y, Q, MOD;//, sum2;\n boolean flag, flag2, streak;;\n boolean l2r;\n\n double avg;\n String str1, str2;\n\n \n // t = s.nextInt();\n // for(; t>0; t--){\n \n str1 = s.nextLine();\n str2 = s.nextLine();\n\n x = str1.length();\n y = str2.length();\n\n count = 0; min = Integer.MAX_VALUE;\n for(i=0; i<=(x-y); i++){\n for(j=0; j<y; j++){\n if(str1.charAt(i+j) != str2.charAt(j))\n count++;\n }\n if(count < min)\n min = count;\n count = 0;\n }\n\n\n \n\n w.write((min)+\"\"); \n w.write(\"\\n\");\n \n \n // }\n w.close();\n }catch(Exception e){\n e.printStackTrace();\n }\n }\n}\n \n \n//========================================### FAST IO ###=========================================//\nclass FastReader \n{ \n BufferedReader br; \n StringTokenizer st; \n\n public FastReader() \n { \n br = new BufferedReader(new\n InputStreamReader(System.in)); \n } \n\n String next() \n { \n while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n } \n\n int nextInt() \n { \n return Integer.parseInt(next()); \n } \n\n long nextLong() \n { \n return Long.parseLong(next()); \n } \n\n Double nextDouble() \n { \n return Double.parseDouble(next());\n } \n\n String nextLine() \n { \n String str = \"\"; \n try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n return str;\n } \n}\n //====================================================================================================//",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.BufferedWriter;",
"BufferedWriter",
"java.io",
"import java.io.FileOutputStream;",
"FileOutputStream",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.io.OutputStream;",
"OutputStream",
"java.io",
"import java.io.OutputStreamWriter;",
"OutputStreamWriter",
"java.io",
"import java.io.PrintWriter;",
"PrintWriter",
"java.io",
"import java.util.*;",
"util.*",
"java",
"import java.lang.Math;",
"Math",
"java.lang",
"import java.sql.Array;",
"Array",
"java.sql",
"import java.awt.Point;",
"Point",
"java.awt",
"import java.awt.geom.*;",
"geom.*",
"java.awt",
"public class Main{\n\n static class Node{\n int x;\n int rank;\n int level;\n int fnodecount;\n char type;\n\n ArrayList<Node> children = new ArrayList<Node>(); \n\n public Node(int x){\n this.x = x;\n // this.rank = 0;\n this.type = 'f';\n }\n }\n\n\n\n static class DisjointUnionSets { \n int[] rank, parent, ele_count; \n int n; \n \n // Constructor \n public DisjointUnionSets(int n) \n { \n rank = new int[n]; \n parent = new int[n];\n ele_count = new int[n];\n this.n = n; \n makeSet(); \n } \n \n // Creates n sets with single item in each \n void makeSet() \n { \n for (int i = 0; i < n; i++) { \n // Initially, all elements are in \n // their own set. \n parent[i] = i; \n ele_count[i] = 1;\n } \n } \n \n // Returns representative of x's set \n int find(int x) \n { \n // Finds the representative of the set \n // that x is an element of \n if (parent[x] != x) { \n // if x is not the parent of itself \n // Then x is not the representative of \n // his set,\n\n parent[x] = find(parent[x]); \n \n // so we recursively call Find on its parent \n // and move i's node directly under the \n // representative of this set \n } \n \n return parent[x]; \n }\n\n\n\n int setSize(int x){\n int par = find(x);\n return ele_count[par];\n }\n \n\n\n // Unites the set that includes x and the set \n // that includes x \n void union(int x, int y) \n { \n // Find representatives of two sets \n int xRoot = find(x), yRoot = find(y); \n \n // Elements are in the same set, no need \n // to unite anything. \n if (xRoot == yRoot) \n return; \n \n // If x's rank is less than y's rank \n if (rank[xRoot] < rank[yRoot]){ \n \n // Then move x under y so that depth \n // of tree remains less \n parent[xRoot] = yRoot;\n \n ele_count[yRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n // Else if y's rank is less than x's rank \n }else if (rank[yRoot] < rank[xRoot]) {\n \n // Then move y under x so that depth of \n // tree remains less \n parent[yRoot] = xRoot; \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n } else // if ranks are the same \n { \n // Then move y under x (doesn't matter \n // which one goes where) \n parent[yRoot] = xRoot; \n \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n\n // And increment the result tree's \n // rank by 1 \n rank[xRoot] = rank[xRoot] + 1; \n } \n } \n } \n\n\n static long power(long x, long y, long p) \n { \n // Initialize result \n long res = 1l; \n \n // Update x if it is more \n // than or equal to p \n x = x % p; \n \n while (y > 0) \n { \n // If y is odd, multiply x \n // with result \n if((y & 1)==1) \n res = (res * x) % p; \n \n // y must be even now \n // y = y / 2 \n y = y >> 1; \n x = (x * x) % p; \n } \n return res; \n } \n\n\n\nstatic int countGreater(int arr[], int n, int k) \n{ \nint l = 0; \nint r = n - 1; \n\n// Stores the index of the left most element \n// from the array which is greater than k \nint leftGreater = n; \n\n// Finds number of elements greater than k \nwhile (l <= r) { \n int m = l + (r - l) / 2; \n\n // If mid element is greater than \n // k update leftGreater and r \n if (arr[m] > k) { \n leftGreater = m; \n r = m - 1; \n } \n\n // If mid element is less than \n // or equal to k update l \n else\n l = m + 1; \n} \n\n// Return the count of elements greater than k \nreturn (n - leftGreater); \n} \n\n\n\nstatic int countLessEqual(int arr[], int n, int k) \n{ \nint l = 0; \nint r = n - 1; \n\n// Stores the index of the left most element \n// from the array which is greater than k \nint leftGreater = n; \n\n// Finds number of elements greater than k \nwhile (l <= r) { \n int m = l + (r - l) / 2; \n\n // If mid element is greater than \n // k update leftGreater and r \n if (arr[m] > k) { \n leftGreater = m; \n r = m - 1; \n } \n\n // If mid element is less than \n // or equal to k update l \n else\n l = m + 1; \n} \n\n// Return the count of elements greater than k \nreturn (leftGreater); \n} \n\n\n public static void main(String args[]){\n try{\n FastReader s = new FastReader();\n // Scanner s = new Scanner(System.in);\n BufferedWriter w = new BufferedWriter(new OutputStreamWriter(System.out));\n int i, q, j, k, x, y, t, n, ind, count, diff, key, l, r, a, b, c, d, size, Pairer, max, min, sec_max, minglob, minloc, beg, end, begl, endr, ld, up, down, maxele, minele, case_count;\n long ans, sqrt, sum, maxup, maxdown, m, X, Y, Q, MOD;//, sum2;\n boolean flag, flag2, streak;;\n boolean l2r;\n\n double avg;\n String str1, str2;\n\n \n // t = s.nextInt();\n // for(; t>0; t--){\n \n str1 = s.nextLine();\n str2 = s.nextLine();\n\n x = str1.length();\n y = str2.length();\n\n count = 0; min = Integer.MAX_VALUE;\n for(i=0; i<=(x-y); i++){\n for(j=0; j<y; j++){\n if(str1.charAt(i+j) != str2.charAt(j))\n count++;\n }\n if(count < min)\n min = count;\n count = 0;\n }\n\n\n \n\n w.write((min)+\"\"); \n w.write(\"\\n\");\n \n \n // }\n w.close();\n }catch(Exception e){\n e.printStackTrace();\n }\n }\n}",
"Main",
"static long power(long x, long y, long p) \n { \n // Initialize result \n long res = 1l; \n \n // Update x if it is more \n // than or equal to p \n x = x % p; \n \n while (y > 0) \n { \n // If y is odd, multiply x \n // with result \n if((y & 1)==1) \n res = (res * x) % p; \n \n // y must be even now \n // y = y / 2 \n y = y >> 1; \n x = (x * x) % p; \n } \n return res; \n }",
"power",
"{ \n // Initialize result \n long res = 1l; \n \n // Update x if it is more \n // than or equal to p \n x = x % p; \n \n while (y > 0) \n { \n // If y is odd, multiply x \n // with result \n if((y & 1)==1) \n res = (res * x) % p; \n \n // y must be even now \n // y = y / 2 \n y = y >> 1; \n x = (x * x) % p; \n } \n return res; \n }",
"long res = 1l;",
"res",
"1l",
"x = x % p",
"x",
"x % p",
"x",
"p",
"while (y > 0) \n { \n // If y is odd, multiply x \n // with result \n if((y & 1)==1) \n res = (res * x) % p; \n \n // y must be even now \n // y = y / 2 \n y = y >> 1; \n x = (x * x) % p; \n }",
"y > 0",
"y",
"0",
"{ \n // If y is odd, multiply x \n // with result \n if((y & 1)==1) \n res = (res * x) % p; \n \n // y must be even now \n // y = y / 2 \n y = y >> 1; \n x = (x * x) % p; \n }",
"if((y & 1)==1) \n res = (res * x) % p;",
"(y & 1)==1",
"(y & 1)",
"y",
"1",
"1",
"res = (res * x) % p",
"res",
"(res * x) % p",
"(res * x)",
"res",
"x",
"p",
"y = y >> 1",
"y",
"y >> 1",
"y",
"1",
"x = (x * x) % p",
"x",
"(x * x) % p",
"(x * x)",
"x",
"x",
"p",
"return res;",
"res",
"long x",
"x",
"long y",
"y",
"long p",
"p",
"static int countGreater(int arr[], int n, int k) \n{ \nint l = 0; \nint r = n - 1; \n\n// Stores the index of the left most element \n// from the array which is greater than k \nint leftGreater = n; \n\n// Finds number of elements greater than k \nwhile (l <= r) { \n int m = l + (r - l) / 2; \n\n // If mid element is greater than \n // k update leftGreater and r \n if (arr[m] > k) { \n leftGreater = m; \n r = m - 1; \n } \n\n // If mid element is less than \n // or equal to k update l \n else\n l = m + 1; \n} \n\n// Return the count of elements greater than k \nreturn (n - leftGreater); \n}",
"countGreater",
"{ \nint l = 0; \nint r = n - 1; \n\n// Stores the index of the left most element \n// from the array which is greater than k \nint leftGreater = n; \n\n// Finds number of elements greater than k \nwhile (l <= r) { \n int m = l + (r - l) / 2; \n\n // If mid element is greater than \n // k update leftGreater and r \n if (arr[m] > k) { \n leftGreater = m; \n r = m - 1; \n } \n\n // If mid element is less than \n // or equal to k update l \n else\n l = m + 1; \n} \n\n// Return the count of elements greater than k \nreturn (n - leftGreater); \n}",
"int l = 0;",
"l",
"0",
"int r = n - 1;",
"r",
"n - 1",
"n",
"1",
"int leftGreater = n;",
"leftGreater",
"n",
"while (l <= r) { \n int m = l + (r - l) / 2; \n\n // If mid element is greater than \n // k update leftGreater and r \n if (arr[m] > k) { \n leftGreater = m; \n r = m - 1; \n } \n\n // If mid element is less than \n // or equal to k update l \n else\n l = m + 1; \n}",
"l <= r",
"l",
"r",
"{ \n int m = l + (r - l) / 2; \n\n // If mid element is greater than \n // k update leftGreater and r \n if (arr[m] > k) { \n leftGreater = m; \n r = m - 1; \n } \n\n // If mid element is less than \n // or equal to k update l \n else\n l = m + 1; \n}",
"int m = l + (r - l) / 2;",
"m",
"l + (r - l) / 2",
"l",
"(r - l) / 2",
"(r - l)",
"r",
"l",
"2",
"if (arr[m] > k) { \n leftGreater = m; \n r = m - 1; \n } \n\n // If mid element is less than \n // or equal to k update l \n else\n l = m + 1;",
"arr[m] > k",
"arr[m]",
"arr",
"m",
"k",
"{ \n leftGreater = m; \n r = m - 1; \n }",
"leftGreater = m",
"leftGreater",
"m",
"r = m - 1",
"r",
"m - 1",
"m",
"1",
"l = m + 1",
"l",
"m + 1",
"m",
"1",
"return (n - leftGreater);",
"(n - leftGreater)",
"n",
"leftGreater",
"int arr[]",
"arr",
"int n",
"n",
"int k",
"k",
"static int countLessEqual(int arr[], int n, int k) \n{ \nint l = 0; \nint r = n - 1; \n\n// Stores the index of the left most element \n// from the array which is greater than k \nint leftGreater = n; \n\n// Finds number of elements greater than k \nwhile (l <= r) { \n int m = l + (r - l) / 2; \n\n // If mid element is greater than \n // k update leftGreater and r \n if (arr[m] > k) { \n leftGreater = m; \n r = m - 1; \n } \n\n // If mid element is less than \n // or equal to k update l \n else\n l = m + 1; \n} \n\n// Return the count of elements greater than k \nreturn (leftGreater); \n}",
"countLessEqual",
"{ \nint l = 0; \nint r = n - 1; \n\n// Stores the index of the left most element \n// from the array which is greater than k \nint leftGreater = n; \n\n// Finds number of elements greater than k \nwhile (l <= r) { \n int m = l + (r - l) / 2; \n\n // If mid element is greater than \n // k update leftGreater and r \n if (arr[m] > k) { \n leftGreater = m; \n r = m - 1; \n } \n\n // If mid element is less than \n // or equal to k update l \n else\n l = m + 1; \n} \n\n// Return the count of elements greater than k \nreturn (leftGreater); \n}",
"int l = 0;",
"l",
"0",
"int r = n - 1;",
"r",
"n - 1",
"n",
"1",
"int leftGreater = n;",
"leftGreater",
"n",
"while (l <= r) { \n int m = l + (r - l) / 2; \n\n // If mid element is greater than \n // k update leftGreater and r \n if (arr[m] > k) { \n leftGreater = m; \n r = m - 1; \n } \n\n // If mid element is less than \n // or equal to k update l \n else\n l = m + 1; \n}",
"l <= r",
"l",
"r",
"{ \n int m = l + (r - l) / 2; \n\n // If mid element is greater than \n // k update leftGreater and r \n if (arr[m] > k) { \n leftGreater = m; \n r = m - 1; \n } \n\n // If mid element is less than \n // or equal to k update l \n else\n l = m + 1; \n}",
"int m = l + (r - l) / 2;",
"m",
"l + (r - l) / 2",
"l",
"(r - l) / 2",
"(r - l)",
"r",
"l",
"2",
"if (arr[m] > k) { \n leftGreater = m; \n r = m - 1; \n } \n\n // If mid element is less than \n // or equal to k update l \n else\n l = m + 1;",
"arr[m] > k",
"arr[m]",
"arr",
"m",
"k",
"{ \n leftGreater = m; \n r = m - 1; \n }",
"leftGreater = m",
"leftGreater",
"m",
"r = m - 1",
"r",
"m - 1",
"m",
"1",
"l = m + 1",
"l",
"m + 1",
"m",
"1",
"return (leftGreater);",
"(leftGreater)",
"int arr[]",
"arr",
"int n",
"n",
"int k",
"k",
"public static void main(String args[]){\n try{\n FastReader s = new FastReader();\n // Scanner s = new Scanner(System.in);\n BufferedWriter w = new BufferedWriter(new OutputStreamWriter(System.out));\n int i, q, j, k, x, y, t, n, ind, count, diff, key, l, r, a, b, c, d, size, Pairer, max, min, sec_max, minglob, minloc, beg, end, begl, endr, ld, up, down, maxele, minele, case_count;\n long ans, sqrt, sum, maxup, maxdown, m, X, Y, Q, MOD;//, sum2;\n boolean flag, flag2, streak;;\n boolean l2r;\n\n double avg;\n String str1, str2;\n\n \n // t = s.nextInt();\n // for(; t>0; t--){\n \n str1 = s.nextLine();\n str2 = s.nextLine();\n\n x = str1.length();\n y = str2.length();\n\n count = 0; min = Integer.MAX_VALUE;\n for(i=0; i<=(x-y); i++){\n for(j=0; j<y; j++){\n if(str1.charAt(i+j) != str2.charAt(j))\n count++;\n }\n if(count < min)\n min = count;\n count = 0;\n }\n\n\n \n\n w.write((min)+\"\"); \n w.write(\"\\n\");\n \n \n // }\n w.close();\n }catch(Exception e){\n e.printStackTrace();\n }\n }",
"main",
"{\n try{\n FastReader s = new FastReader();\n // Scanner s = new Scanner(System.in);\n BufferedWriter w = new BufferedWriter(new OutputStreamWriter(System.out));\n int i, q, j, k, x, y, t, n, ind, count, diff, key, l, r, a, b, c, d, size, Pairer, max, min, sec_max, minglob, minloc, beg, end, begl, endr, ld, up, down, maxele, minele, case_count;\n long ans, sqrt, sum, maxup, maxdown, m, X, Y, Q, MOD;//, sum2;\n boolean flag, flag2, streak;;\n boolean l2r;\n\n double avg;\n String str1, str2;\n\n \n // t = s.nextInt();\n // for(; t>0; t--){\n \n str1 = s.nextLine();\n str2 = s.nextLine();\n\n x = str1.length();\n y = str2.length();\n\n count = 0; min = Integer.MAX_VALUE;\n for(i=0; i<=(x-y); i++){\n for(j=0; j<y; j++){\n if(str1.charAt(i+j) != str2.charAt(j))\n count++;\n }\n if(count < min)\n min = count;\n count = 0;\n }\n\n\n \n\n w.write((min)+\"\"); \n w.write(\"\\n\");\n \n \n // }\n w.close();\n }catch(Exception e){\n e.printStackTrace();\n }\n }",
"try{\n FastReader s = new FastReader();\n // Scanner s = new Scanner(System.in);\n BufferedWriter w = new BufferedWriter(new OutputStreamWriter(System.out));\n int i, q, j, k, x, y, t, n, ind, count, diff, key, l, r, a, b, c, d, size, Pairer, max, min, sec_max, minglob, minloc, beg, end, begl, endr, ld, up, down, maxele, minele, case_count;\n long ans, sqrt, sum, maxup, maxdown, m, X, Y, Q, MOD;//, sum2;\n boolean flag, flag2, streak;;\n boolean l2r;\n\n double avg;\n String str1, str2;\n\n \n // t = s.nextInt();\n // for(; t>0; t--){\n \n str1 = s.nextLine();\n str2 = s.nextLine();\n\n x = str1.length();\n y = str2.length();\n\n count = 0; min = Integer.MAX_VALUE;\n for(i=0; i<=(x-y); i++){\n for(j=0; j<y; j++){\n if(str1.charAt(i+j) != str2.charAt(j))\n count++;\n }\n if(count < min)\n min = count;\n count = 0;\n }\n\n\n \n\n w.write((min)+\"\"); \n w.write(\"\\n\");\n \n \n // }\n w.close();\n }catch(Exception e){\n e.printStackTrace();\n }",
"catch(Exception e){\n e.printStackTrace();\n }",
"Exception e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n FastReader s = new FastReader();\n // Scanner s = new Scanner(System.in);\n BufferedWriter w = new BufferedWriter(new OutputStreamWriter(System.out));\n int i, q, j, k, x, y, t, n, ind, count, diff, key, l, r, a, b, c, d, size, Pairer, max, min, sec_max, minglob, minloc, beg, end, begl, endr, ld, up, down, maxele, minele, case_count;\n long ans, sqrt, sum, maxup, maxdown, m, X, Y, Q, MOD;//, sum2;\n boolean flag, flag2, streak;;\n boolean l2r;\n\n double avg;\n String str1, str2;\n\n \n // t = s.nextInt();\n // for(; t>0; t--){\n \n str1 = s.nextLine();\n str2 = s.nextLine();\n\n x = str1.length();\n y = str2.length();\n\n count = 0; min = Integer.MAX_VALUE;\n for(i=0; i<=(x-y); i++){\n for(j=0; j<y; j++){\n if(str1.charAt(i+j) != str2.charAt(j))\n count++;\n }\n if(count < min)\n min = count;\n count = 0;\n }\n\n\n \n\n w.write((min)+\"\"); \n w.write(\"\\n\");\n \n \n // }\n w.close();\n }",
"FastReader s = new FastReader();",
"s",
"new FastReader()",
"BufferedWriter w = new BufferedWriter(new OutputStreamWriter(System.out));",
"w",
"new BufferedWriter(new OutputStreamWriter(System.out))",
"int i",
"i",
"q",
"q",
"j",
"j",
"k",
"k",
"x",
"x",
"y",
"y",
"t",
"t",
"n",
"n",
"ind",
"ind",
"count",
"count",
"diff",
"diff",
"key",
"key",
"l",
"l",
"r",
"r",
"a",
"a",
"b",
"b",
"c",
"c",
"d",
"d",
"size",
"size",
"Pairer",
"Pairer",
"max",
"max",
"min",
"min",
"sec_max",
"sec_max",
"minglob",
"minglob",
"minloc",
"minloc",
"beg",
"beg",
"end",
"end",
"begl",
"begl",
"endr",
"endr",
"ld",
"ld",
"up",
"up",
"down",
"down",
"maxele",
"maxele",
"minele",
"minele",
"case_count;",
"case_count",
"long ans",
"ans",
"sqrt",
"sqrt",
"sum",
"sum",
"maxup",
"maxup",
"maxdown",
"maxdown",
"m",
"m",
"X",
"X",
"Y",
"Y",
"Q",
"Q",
"MOD;",
"MOD",
"boolean flag",
"flag",
"flag2",
"flag2",
"streak;",
"streak",
"boolean l2r;",
"l2r",
"double avg;",
"avg",
"String str1",
"str1",
"str2;",
"str2",
"str1 = s.nextLine()",
"str1",
"s.nextLine()",
"s.nextLine",
"s",
"str2 = s.nextLine()",
"str2",
"s.nextLine()",
"s.nextLine",
"s",
"x = str1.length()",
"x",
"str1.length()",
"str1.length",
"str1",
"y = str2.length()",
"y",
"str2.length()",
"str2.length",
"str2",
"count = 0",
"count",
"0",
"min = Integer.MAX_VALUE",
"min",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"for(i=0; i<=(x-y); i++){\n for(j=0; j<y; j++){\n if(str1.charAt(i+j) != str2.charAt(j))\n count++;\n }\n if(count < min)\n min = count;\n count = 0;\n }",
"i=0;",
"i=0",
"i",
"0",
"i<=(x-y)",
"i",
"(x-y)",
"x",
"y",
"i++",
"i++",
"i",
"{\n for(j=0; j<y; j++){\n if(str1.charAt(i+j) != str2.charAt(j))\n count++;\n }\n if(count < min)\n min = count;\n count = 0;\n }",
"{\n for(j=0; j<y; j++){\n if(str1.charAt(i+j) != str2.charAt(j))\n count++;\n }\n if(count < min)\n min = count;\n count = 0;\n }",
"for(j=0; j<y; j++){\n if(str1.charAt(i+j) != str2.charAt(j))\n count++;\n }",
"j=0;",
"j=0",
"j",
"0",
"j<y",
"j",
"y",
"j++",
"j++",
"j",
"{\n if(str1.charAt(i+j) != str2.charAt(j))\n count++;\n }",
"{\n if(str1.charAt(i+j) != str2.charAt(j))\n count++;\n }",
"if(str1.charAt(i+j) != str2.charAt(j))\n count++;",
"str1.charAt(i+j) != str2.charAt(j)",
"str1.charAt(i+j)",
"str1.charAt",
"str1",
"i+j",
"i",
"j",
"str2.charAt(j)",
"str2.charAt",
"str2",
"j",
"count++",
"count",
"if(count < min)\n min = count;",
"count < min",
"count",
"min",
"min = count",
"min",
"count",
"count = 0",
"count",
"0",
"w.write((min)+\"\")",
"w.write",
"w",
"(min)+\"\"",
"(min)",
"\"\"",
"w.write(\"\\n\")",
"w.write",
"w",
"\"\\n\"",
"w.close()",
"w.close",
"w",
"String args[]",
"args",
"static class Node{\n int x;\n int rank;\n int level;\n int fnodecount;\n char type;\n\n ArrayList<Node> children = new ArrayList<Node>(); \n\n public Node(int x){\n this.x = x;\n // this.rank = 0;\n this.type = 'f';\n }\n }",
"Node",
"int x;",
"x",
"int rank;",
"rank",
"int level;",
"level",
"int fnodecount;",
"fnodecount",
"char type;",
"type",
"ArrayList<Node> children = new ArrayList<Node>();",
"children",
"new ArrayList<Node>()",
"public Node(int x){\n this.x = x;\n // this.rank = 0;\n this.type = 'f';\n }",
"Node",
"{\n this.x = x;\n // this.rank = 0;\n this.type = 'f';\n }",
"this.x = x",
"this.x",
"this",
"this.x",
"x",
"this.type = 'f'",
"this.type",
"this",
"this.type",
"'f'",
"int x",
"x",
"static class DisjointUnionSets { \n int[] rank, parent, ele_count; \n int n; \n \n // Constructor \n public DisjointUnionSets(int n) \n { \n rank = new int[n]; \n parent = new int[n];\n ele_count = new int[n];\n this.n = n; \n makeSet(); \n } \n \n // Creates n sets with single item in each \n void makeSet() \n { \n for (int i = 0; i < n; i++) { \n // Initially, all elements are in \n // their own set. \n parent[i] = i; \n ele_count[i] = 1;\n } \n } \n \n // Returns representative of x's set \n int find(int x) \n { \n // Finds the representative of the set \n // that x is an element of \n if (parent[x] != x) { \n // if x is not the parent of itself \n // Then x is not the representative of \n // his set,\n\n parent[x] = find(parent[x]); \n \n // so we recursively call Find on its parent \n // and move i's node directly under the \n // representative of this set \n } \n \n return parent[x]; \n }\n\n\n\n int setSize(int x){\n int par = find(x);\n return ele_count[par];\n }\n \n\n\n // Unites the set that includes x and the set \n // that includes x \n void union(int x, int y) \n { \n // Find representatives of two sets \n int xRoot = find(x), yRoot = find(y); \n \n // Elements are in the same set, no need \n // to unite anything. \n if (xRoot == yRoot) \n return; \n \n // If x's rank is less than y's rank \n if (rank[xRoot] < rank[yRoot]){ \n \n // Then move x under y so that depth \n // of tree remains less \n parent[xRoot] = yRoot;\n \n ele_count[yRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n // Else if y's rank is less than x's rank \n }else if (rank[yRoot] < rank[xRoot]) {\n \n // Then move y under x so that depth of \n // tree remains less \n parent[yRoot] = xRoot; \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n } else // if ranks are the same \n { \n // Then move y under x (doesn't matter \n // which one goes where) \n parent[yRoot] = xRoot; \n \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n\n // And increment the result tree's \n // rank by 1 \n rank[xRoot] = rank[xRoot] + 1; \n } \n } \n }",
"DisjointUnionSets",
"int[] rank",
"rank",
"parent",
"parent",
"ele_count;",
"ele_count",
"int n;",
"n",
"// Constructor \n public DisjointUnionSets(int n) \n { \n rank = new int[n]; \n parent = new int[n];\n ele_count = new int[n];\n this.n = n; \n makeSet(); \n }",
"DisjointUnionSets",
"{ \n rank = new int[n]; \n parent = new int[n];\n ele_count = new int[n];\n this.n = n; \n makeSet(); \n }",
"rank = new int[n]",
"rank",
"new int[n]",
"n",
"parent = new int[n]",
"parent",
"new int[n]",
"n",
"ele_count = new int[n]",
"ele_count",
"new int[n]",
"n",
"this.n = n",
"this.n",
"this",
"this.n",
"n",
"makeSet()",
"makeSet",
"int n",
"n",
"// Creates n sets with single item in each \n void makeSet() \n { \n for (int i = 0; i < n; i++) { \n // Initially, all elements are in \n // their own set. \n parent[i] = i; \n ele_count[i] = 1;\n } \n }",
"makeSet",
"{ \n for (int i = 0; i < n; i++) { \n // Initially, all elements are in \n // their own set. \n parent[i] = i; \n ele_count[i] = 1;\n } \n }",
"for (int i = 0; i < n; i++) { \n // Initially, all elements are in \n // their own set. \n parent[i] = i; \n ele_count[i] = 1;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{ \n // Initially, all elements are in \n // their own set. \n parent[i] = i; \n ele_count[i] = 1;\n }",
"{ \n // Initially, all elements are in \n // their own set. \n parent[i] = i; \n ele_count[i] = 1;\n }",
"parent[i] = i",
"parent[i]",
"parent",
"i",
"i",
"ele_count[i] = 1",
"ele_count[i]",
"ele_count",
"i",
"1",
"// Returns representative of x's set \n int find(int x) \n { \n // Finds the representative of the set \n // that x is an element of \n if (parent[x] != x) { \n // if x is not the parent of itself \n // Then x is not the representative of \n // his set,\n\n parent[x] = find(parent[x]); \n \n // so we recursively call Find on its parent \n // and move i's node directly under the \n // representative of this set \n } \n \n return parent[x]; \n }",
"find",
"{ \n // Finds the representative of the set \n // that x is an element of \n if (parent[x] != x) { \n // if x is not the parent of itself \n // Then x is not the representative of \n // his set,\n\n parent[x] = find(parent[x]); \n \n // so we recursively call Find on its parent \n // and move i's node directly under the \n // representative of this set \n } \n \n return parent[x]; \n }",
"if (parent[x] != x) { \n // if x is not the parent of itself \n // Then x is not the representative of \n // his set,\n\n parent[x] = find(parent[x]); \n \n // so we recursively call Find on its parent \n // and move i's node directly under the \n // representative of this set \n }",
"parent[x] != x",
"parent[x]",
"parent",
"x",
"x",
"{ \n // if x is not the parent of itself \n // Then x is not the representative of \n // his set,\n\n parent[x] = find(parent[x]); \n \n // so we recursively call Find on its parent \n // and move i's node directly under the \n // representative of this set \n }",
"parent[x] = find(parent[x])",
"parent[x]",
"parent",
"x",
"find(parent[x])",
"find",
"parent[x]",
"parent",
"x",
"return parent[x];",
"parent[x]",
"parent",
"x",
"int x",
"x",
"int setSize(int x){\n int par = find(x);\n return ele_count[par];\n }",
"setSize",
"{\n int par = find(x);\n return ele_count[par];\n }",
"int par = find(x);",
"par",
"find(x)",
"find",
"x",
"return ele_count[par];",
"ele_count[par]",
"ele_count",
"par",
"int x",
"x",
"// Unites the set that includes x and the set \n // that includes x \n void union(int x, int y) \n { \n // Find representatives of two sets \n int xRoot = find(x), yRoot = find(y); \n \n // Elements are in the same set, no need \n // to unite anything. \n if (xRoot == yRoot) \n return; \n \n // If x's rank is less than y's rank \n if (rank[xRoot] < rank[yRoot]){ \n \n // Then move x under y so that depth \n // of tree remains less \n parent[xRoot] = yRoot;\n \n ele_count[yRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n // Else if y's rank is less than x's rank \n }else if (rank[yRoot] < rank[xRoot]) {\n \n // Then move y under x so that depth of \n // tree remains less \n parent[yRoot] = xRoot; \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n } else // if ranks are the same \n { \n // Then move y under x (doesn't matter \n // which one goes where) \n parent[yRoot] = xRoot; \n \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n\n // And increment the result tree's \n // rank by 1 \n rank[xRoot] = rank[xRoot] + 1; \n } \n }",
"union",
"{ \n // Find representatives of two sets \n int xRoot = find(x), yRoot = find(y); \n \n // Elements are in the same set, no need \n // to unite anything. \n if (xRoot == yRoot) \n return; \n \n // If x's rank is less than y's rank \n if (rank[xRoot] < rank[yRoot]){ \n \n // Then move x under y so that depth \n // of tree remains less \n parent[xRoot] = yRoot;\n \n ele_count[yRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n // Else if y's rank is less than x's rank \n }else if (rank[yRoot] < rank[xRoot]) {\n \n // Then move y under x so that depth of \n // tree remains less \n parent[yRoot] = xRoot; \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n } else // if ranks are the same \n { \n // Then move y under x (doesn't matter \n // which one goes where) \n parent[yRoot] = xRoot; \n \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n\n // And increment the result tree's \n // rank by 1 \n rank[xRoot] = rank[xRoot] + 1; \n } \n }",
"int xRoot = find(x)",
"xRoot",
"find(x)",
"find",
"x",
"yRoot = find(y);",
"yRoot",
"find(y)",
"find",
"y",
"if (xRoot == yRoot) \n return;",
"xRoot == yRoot",
"xRoot",
"yRoot",
"return;",
"if (rank[xRoot] < rank[yRoot]){ \n \n // Then move x under y so that depth \n // of tree remains less \n parent[xRoot] = yRoot;\n \n ele_count[yRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n // Else if y's rank is less than x's rank \n }else if (rank[yRoot] < rank[xRoot]) {\n \n // Then move y under x so that depth of \n // tree remains less \n parent[yRoot] = xRoot; \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n } else // if ranks are the same \n { \n // Then move y under x (doesn't matter \n // which one goes where) \n parent[yRoot] = xRoot; \n \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n\n // And increment the result tree's \n // rank by 1 \n rank[xRoot] = rank[xRoot] + 1; \n }",
"rank[xRoot] < rank[yRoot]",
"rank[xRoot]",
"rank",
"xRoot",
"rank[yRoot]",
"rank",
"yRoot",
"{ \n \n // Then move x under y so that depth \n // of tree remains less \n parent[xRoot] = yRoot;\n \n ele_count[yRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n // Else if y's rank is less than x's rank \n }",
"parent[xRoot] = yRoot",
"parent[xRoot]",
"parent",
"xRoot",
"yRoot",
"ele_count[yRoot] = ele_count[yRoot] + ele_count[xRoot]",
"ele_count[yRoot]",
"ele_count",
"yRoot",
"ele_count[yRoot] + ele_count[xRoot]",
"ele_count[yRoot]",
"ele_count",
"yRoot",
"ele_count[xRoot]",
"ele_count",
"xRoot",
"if (rank[yRoot] < rank[xRoot]) {\n \n // Then move y under x so that depth of \n // tree remains less \n parent[yRoot] = xRoot; \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n } else // if ranks are the same \n { \n // Then move y under x (doesn't matter \n // which one goes where) \n parent[yRoot] = xRoot; \n \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n\n // And increment the result tree's \n // rank by 1 \n rank[xRoot] = rank[xRoot] + 1; \n }",
"rank[yRoot] < rank[xRoot]",
"rank[yRoot]",
"rank",
"yRoot",
"rank[xRoot]",
"rank",
"xRoot",
"{\n \n // Then move y under x so that depth of \n // tree remains less \n parent[yRoot] = xRoot; \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n }",
"parent[yRoot] = xRoot",
"parent[yRoot]",
"parent",
"yRoot",
"xRoot",
"ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot]",
"ele_count[xRoot]",
"ele_count",
"xRoot",
"ele_count[yRoot] + ele_count[xRoot]",
"ele_count[yRoot]",
"ele_count",
"yRoot",
"ele_count[xRoot]",
"ele_count",
"xRoot",
"{ \n // Then move y under x (doesn't matter \n // which one goes where) \n parent[yRoot] = xRoot; \n \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n\n // And increment the result tree's \n // rank by 1 \n rank[xRoot] = rank[xRoot] + 1; \n }",
"parent[yRoot] = xRoot",
"parent[yRoot]",
"parent",
"yRoot",
"xRoot",
"ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot]",
"ele_count[xRoot]",
"ele_count",
"xRoot",
"ele_count[yRoot] + ele_count[xRoot]",
"ele_count[yRoot]",
"ele_count",
"yRoot",
"ele_count[xRoot]",
"ele_count",
"xRoot",
"rank[xRoot] = rank[xRoot] + 1",
"rank[xRoot]",
"rank",
"xRoot",
"rank[xRoot] + 1",
"rank[xRoot]",
"rank",
"xRoot",
"1",
"int x",
"x",
"int y",
"y",
"class FastReader \n{ \n BufferedReader br; \n StringTokenizer st; \n\n public FastReader() \n { \n br = new BufferedReader(new\n InputStreamReader(System.in)); \n } \n\n String next() \n { \n while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n } \n\n int nextInt() \n { \n return Integer.parseInt(next()); \n } \n\n long nextLong() \n { \n return Long.parseLong(next()); \n } \n\n Double nextDouble() \n { \n return Double.parseDouble(next());\n } \n\n String nextLine() \n { \n String str = \"\"; \n try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n return str;\n } \n}",
"FastReader",
"BufferedReader br;",
"br",
"StringTokenizer st;",
"st",
"public FastReader() \n { \n br = new BufferedReader(new\n InputStreamReader(System.in)); \n }",
"FastReader",
"{ \n br = new BufferedReader(new\n InputStreamReader(System.in)); \n }",
"br = new BufferedReader(new\n InputStreamReader(System.in))",
"br",
"new BufferedReader(new\n InputStreamReader(System.in))",
"String next() \n { \n while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n }",
"next",
"{ \n while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n }",
"while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n }",
"st == null || !st.hasMoreElements()",
"st == null",
"st",
"null",
"!st.hasMoreElements()",
"st.hasMoreElements()",
"st.hasMoreElements",
"st",
"{ \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n }",
"try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n }",
"catch (IOException e) \n { \n e.printStackTrace(); \n }",
"IOException e",
"{ \n e.printStackTrace(); \n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{ \n st = new StringTokenizer(br.readLine()); \n }",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"int nextInt() \n { \n return Integer.parseInt(next()); \n }",
"nextInt",
"{ \n return Integer.parseInt(next()); \n }",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"long nextLong() \n { \n return Long.parseLong(next()); \n }",
"nextLong",
"{ \n return Long.parseLong(next()); \n }",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"Double nextDouble() \n { \n return Double.parseDouble(next());\n }",
"nextDouble",
"{ \n return Double.parseDouble(next());\n }",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"String nextLine() \n { \n String str = \"\"; \n try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n return str;\n }",
"nextLine",
"{ \n String str = \"\"; \n try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n return str;\n }",
"String str = \"\";",
"str",
"\"\"",
"try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n }",
"catch (IOException e) \n { \n e.printStackTrace(); \n }",
"IOException e",
"{ \n e.printStackTrace(); \n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{ \n str = br.readLine(); \n }",
"str = br.readLine()",
"str",
"br.readLine()",
"br.readLine",
"br",
"return str;",
"str",
"public class Main{\n\n static class Node{\n int x;\n int rank;\n int level;\n int fnodecount;\n char type;\n\n ArrayList<Node> children = new ArrayList<Node>(); \n\n public Node(int x){\n this.x = x;\n // this.rank = 0;\n this.type = 'f';\n }\n }\n\n\n\n static class DisjointUnionSets { \n int[] rank, parent, ele_count; \n int n; \n \n // Constructor \n public DisjointUnionSets(int n) \n { \n rank = new int[n]; \n parent = new int[n];\n ele_count = new int[n];\n this.n = n; \n makeSet(); \n } \n \n // Creates n sets with single item in each \n void makeSet() \n { \n for (int i = 0; i < n; i++) { \n // Initially, all elements are in \n // their own set. \n parent[i] = i; \n ele_count[i] = 1;\n } \n } \n \n // Returns representative of x's set \n int find(int x) \n { \n // Finds the representative of the set \n // that x is an element of \n if (parent[x] != x) { \n // if x is not the parent of itself \n // Then x is not the representative of \n // his set,\n\n parent[x] = find(parent[x]); \n \n // so we recursively call Find on its parent \n // and move i's node directly under the \n // representative of this set \n } \n \n return parent[x]; \n }\n\n\n\n int setSize(int x){\n int par = find(x);\n return ele_count[par];\n }\n \n\n\n // Unites the set that includes x and the set \n // that includes x \n void union(int x, int y) \n { \n // Find representatives of two sets \n int xRoot = find(x), yRoot = find(y); \n \n // Elements are in the same set, no need \n // to unite anything. \n if (xRoot == yRoot) \n return; \n \n // If x's rank is less than y's rank \n if (rank[xRoot] < rank[yRoot]){ \n \n // Then move x under y so that depth \n // of tree remains less \n parent[xRoot] = yRoot;\n \n ele_count[yRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n // Else if y's rank is less than x's rank \n }else if (rank[yRoot] < rank[xRoot]) {\n \n // Then move y under x so that depth of \n // tree remains less \n parent[yRoot] = xRoot; \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n } else // if ranks are the same \n { \n // Then move y under x (doesn't matter \n // which one goes where) \n parent[yRoot] = xRoot; \n \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n\n // And increment the result tree's \n // rank by 1 \n rank[xRoot] = rank[xRoot] + 1; \n } \n } \n } \n\n\n static long power(long x, long y, long p) \n { \n // Initialize result \n long res = 1l; \n \n // Update x if it is more \n // than or equal to p \n x = x % p; \n \n while (y > 0) \n { \n // If y is odd, multiply x \n // with result \n if((y & 1)==1) \n res = (res * x) % p; \n \n // y must be even now \n // y = y / 2 \n y = y >> 1; \n x = (x * x) % p; \n } \n return res; \n } \n\n\n\nstatic int countGreater(int arr[], int n, int k) \n{ \nint l = 0; \nint r = n - 1; \n\n// Stores the index of the left most element \n// from the array which is greater than k \nint leftGreater = n; \n\n// Finds number of elements greater than k \nwhile (l <= r) { \n int m = l + (r - l) / 2; \n\n // If mid element is greater than \n // k update leftGreater and r \n if (arr[m] > k) { \n leftGreater = m; \n r = m - 1; \n } \n\n // If mid element is less than \n // or equal to k update l \n else\n l = m + 1; \n} \n\n// Return the count of elements greater than k \nreturn (n - leftGreater); \n} \n\n\n\nstatic int countLessEqual(int arr[], int n, int k) \n{ \nint l = 0; \nint r = n - 1; \n\n// Stores the index of the left most element \n// from the array which is greater than k \nint leftGreater = n; \n\n// Finds number of elements greater than k \nwhile (l <= r) { \n int m = l + (r - l) / 2; \n\n // If mid element is greater than \n // k update leftGreater and r \n if (arr[m] > k) { \n leftGreater = m; \n r = m - 1; \n } \n\n // If mid element is less than \n // or equal to k update l \n else\n l = m + 1; \n} \n\n// Return the count of elements greater than k \nreturn (leftGreater); \n} \n\n\n public static void main(String args[]){\n try{\n FastReader s = new FastReader();\n // Scanner s = new Scanner(System.in);\n BufferedWriter w = new BufferedWriter(new OutputStreamWriter(System.out));\n int i, q, j, k, x, y, t, n, ind, count, diff, key, l, r, a, b, c, d, size, Pairer, max, min, sec_max, minglob, minloc, beg, end, begl, endr, ld, up, down, maxele, minele, case_count;\n long ans, sqrt, sum, maxup, maxdown, m, X, Y, Q, MOD;//, sum2;\n boolean flag, flag2, streak;;\n boolean l2r;\n\n double avg;\n String str1, str2;\n\n \n // t = s.nextInt();\n // for(; t>0; t--){\n \n str1 = s.nextLine();\n str2 = s.nextLine();\n\n x = str1.length();\n y = str2.length();\n\n count = 0; min = Integer.MAX_VALUE;\n for(i=0; i<=(x-y); i++){\n for(j=0; j<y; j++){\n if(str1.charAt(i+j) != str2.charAt(j))\n count++;\n }\n if(count < min)\n min = count;\n count = 0;\n }\n\n\n \n\n w.write((min)+\"\"); \n w.write(\"\\n\");\n \n \n // }\n w.close();\n }catch(Exception e){\n e.printStackTrace();\n }\n }\n}",
"public class Main{\n\n static class Node{\n int x;\n int rank;\n int level;\n int fnodecount;\n char type;\n\n ArrayList<Node> children = new ArrayList<Node>(); \n\n public Node(int x){\n this.x = x;\n // this.rank = 0;\n this.type = 'f';\n }\n }\n\n\n\n static class DisjointUnionSets { \n int[] rank, parent, ele_count; \n int n; \n \n // Constructor \n public DisjointUnionSets(int n) \n { \n rank = new int[n]; \n parent = new int[n];\n ele_count = new int[n];\n this.n = n; \n makeSet(); \n } \n \n // Creates n sets with single item in each \n void makeSet() \n { \n for (int i = 0; i < n; i++) { \n // Initially, all elements are in \n // their own set. \n parent[i] = i; \n ele_count[i] = 1;\n } \n } \n \n // Returns representative of x's set \n int find(int x) \n { \n // Finds the representative of the set \n // that x is an element of \n if (parent[x] != x) { \n // if x is not the parent of itself \n // Then x is not the representative of \n // his set,\n\n parent[x] = find(parent[x]); \n \n // so we recursively call Find on its parent \n // and move i's node directly under the \n // representative of this set \n } \n \n return parent[x]; \n }\n\n\n\n int setSize(int x){\n int par = find(x);\n return ele_count[par];\n }\n \n\n\n // Unites the set that includes x and the set \n // that includes x \n void union(int x, int y) \n { \n // Find representatives of two sets \n int xRoot = find(x), yRoot = find(y); \n \n // Elements are in the same set, no need \n // to unite anything. \n if (xRoot == yRoot) \n return; \n \n // If x's rank is less than y's rank \n if (rank[xRoot] < rank[yRoot]){ \n \n // Then move x under y so that depth \n // of tree remains less \n parent[xRoot] = yRoot;\n \n ele_count[yRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n // Else if y's rank is less than x's rank \n }else if (rank[yRoot] < rank[xRoot]) {\n \n // Then move y under x so that depth of \n // tree remains less \n parent[yRoot] = xRoot; \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n \n } else // if ranks are the same \n { \n // Then move y under x (doesn't matter \n // which one goes where) \n parent[yRoot] = xRoot; \n \n ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];\n\n // And increment the result tree's \n // rank by 1 \n rank[xRoot] = rank[xRoot] + 1; \n } \n } \n } \n\n\n static long power(long x, long y, long p) \n { \n // Initialize result \n long res = 1l; \n \n // Update x if it is more \n // than or equal to p \n x = x % p; \n \n while (y > 0) \n { \n // If y is odd, multiply x \n // with result \n if((y & 1)==1) \n res = (res * x) % p; \n \n // y must be even now \n // y = y / 2 \n y = y >> 1; \n x = (x * x) % p; \n } \n return res; \n } \n\n\n\nstatic int countGreater(int arr[], int n, int k) \n{ \nint l = 0; \nint r = n - 1; \n\n// Stores the index of the left most element \n// from the array which is greater than k \nint leftGreater = n; \n\n// Finds number of elements greater than k \nwhile (l <= r) { \n int m = l + (r - l) / 2; \n\n // If mid element is greater than \n // k update leftGreater and r \n if (arr[m] > k) { \n leftGreater = m; \n r = m - 1; \n } \n\n // If mid element is less than \n // or equal to k update l \n else\n l = m + 1; \n} \n\n// Return the count of elements greater than k \nreturn (n - leftGreater); \n} \n\n\n\nstatic int countLessEqual(int arr[], int n, int k) \n{ \nint l = 0; \nint r = n - 1; \n\n// Stores the index of the left most element \n// from the array which is greater than k \nint leftGreater = n; \n\n// Finds number of elements greater than k \nwhile (l <= r) { \n int m = l + (r - l) / 2; \n\n // If mid element is greater than \n // k update leftGreater and r \n if (arr[m] > k) { \n leftGreater = m; \n r = m - 1; \n } \n\n // If mid element is less than \n // or equal to k update l \n else\n l = m + 1; \n} \n\n// Return the count of elements greater than k \nreturn (leftGreater); \n} \n\n\n public static void main(String args[]){\n try{\n FastReader s = new FastReader();\n // Scanner s = new Scanner(System.in);\n BufferedWriter w = new BufferedWriter(new OutputStreamWriter(System.out));\n int i, q, j, k, x, y, t, n, ind, count, diff, key, l, r, a, b, c, d, size, Pairer, max, min, sec_max, minglob, minloc, beg, end, begl, endr, ld, up, down, maxele, minele, case_count;\n long ans, sqrt, sum, maxup, maxdown, m, X, Y, Q, MOD;//, sum2;\n boolean flag, flag2, streak;;\n boolean l2r;\n\n double avg;\n String str1, str2;\n\n \n // t = s.nextInt();\n // for(; t>0; t--){\n \n str1 = s.nextLine();\n str2 = s.nextLine();\n\n x = str1.length();\n y = str2.length();\n\n count = 0; min = Integer.MAX_VALUE;\n for(i=0; i<=(x-y); i++){\n for(j=0; j<y; j++){\n if(str1.charAt(i+j) != str2.charAt(j))\n count++;\n }\n if(count < min)\n min = count;\n count = 0;\n }\n\n\n \n\n w.write((min)+\"\"); \n w.write(\"\\n\");\n \n \n // }\n w.close();\n }catch(Exception e){\n e.printStackTrace();\n }\n }\n}",
"Main"
]
| ////////////////////////////////////////////////////
// //
// For her who keeps the fire kindling in me... //
// //
////////////////////////////////////////////////////
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
// import java.util.Scanner;
// import java.util.Arrays;
// import java.util.ArrayList;
// import java.util.Collections;
// import java.util.StringTokenizer;
import java.util.*;
import java.lang.Math;
import java.sql.Array;
import java.awt.Point;
import java.awt.geom.*;
public class Main{
static class Node{
int x;
int rank;
int level;
int fnodecount;
char type;
ArrayList<Node> children = new ArrayList<Node>();
public Node(int x){
this.x = x;
// this.rank = 0;
this.type = 'f';
}
}
static class DisjointUnionSets {
int[] rank, parent, ele_count;
int n;
// Constructor
public DisjointUnionSets(int n)
{
rank = new int[n];
parent = new int[n];
ele_count = new int[n];
this.n = n;
makeSet();
}
// Creates n sets with single item in each
void makeSet()
{
for (int i = 0; i < n; i++) {
// Initially, all elements are in
// their own set.
parent[i] = i;
ele_count[i] = 1;
}
}
// Returns representative of x's set
int find(int x)
{
// Finds the representative of the set
// that x is an element of
if (parent[x] != x) {
// if x is not the parent of itself
// Then x is not the representative of
// his set,
parent[x] = find(parent[x]);
// so we recursively call Find on its parent
// and move i's node directly under the
// representative of this set
}
return parent[x];
}
int setSize(int x){
int par = find(x);
return ele_count[par];
}
// Unites the set that includes x and the set
// that includes x
void union(int x, int y)
{
// Find representatives of two sets
int xRoot = find(x), yRoot = find(y);
// Elements are in the same set, no need
// to unite anything.
if (xRoot == yRoot)
return;
// If x's rank is less than y's rank
if (rank[xRoot] < rank[yRoot]){
// Then move x under y so that depth
// of tree remains less
parent[xRoot] = yRoot;
ele_count[yRoot] = ele_count[yRoot] + ele_count[xRoot];
// Else if y's rank is less than x's rank
}else if (rank[yRoot] < rank[xRoot]) {
// Then move y under x so that depth of
// tree remains less
parent[yRoot] = xRoot;
ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];
} else // if ranks are the same
{
// Then move y under x (doesn't matter
// which one goes where)
parent[yRoot] = xRoot;
ele_count[xRoot] = ele_count[yRoot] + ele_count[xRoot];
// And increment the result tree's
// rank by 1
rank[xRoot] = rank[xRoot] + 1;
}
}
}
static long power(long x, long y, long p)
{
// Initialize result
long res = 1l;
// Update x if it is more
// than or equal to p
x = x % p;
while (y > 0)
{
// If y is odd, multiply x
// with result
if((y & 1)==1)
res = (res * x) % p;
// y must be even now
// y = y / 2
y = y >> 1;
x = (x * x) % p;
}
return res;
}
static int countGreater(int arr[], int n, int k)
{
int l = 0;
int r = n - 1;
// Stores the index of the left most element
// from the array which is greater than k
int leftGreater = n;
// Finds number of elements greater than k
while (l <= r) {
int m = l + (r - l) / 2;
// If mid element is greater than
// k update leftGreater and r
if (arr[m] > k) {
leftGreater = m;
r = m - 1;
}
// If mid element is less than
// or equal to k update l
else
l = m + 1;
}
// Return the count of elements greater than k
return (n - leftGreater);
}
static int countLessEqual(int arr[], int n, int k)
{
int l = 0;
int r = n - 1;
// Stores the index of the left most element
// from the array which is greater than k
int leftGreater = n;
// Finds number of elements greater than k
while (l <= r) {
int m = l + (r - l) / 2;
// If mid element is greater than
// k update leftGreater and r
if (arr[m] > k) {
leftGreater = m;
r = m - 1;
}
// If mid element is less than
// or equal to k update l
else
l = m + 1;
}
// Return the count of elements greater than k
return (leftGreater);
}
public static void main(String args[]){
try{
FastReader s = new FastReader();
// Scanner s = new Scanner(System.in);
BufferedWriter w = new BufferedWriter(new OutputStreamWriter(System.out));
int i, q, j, k, x, y, t, n, ind, count, diff, key, l, r, a, b, c, d, size, Pairer, max, min, sec_max, minglob, minloc, beg, end, begl, endr, ld, up, down, maxele, minele, case_count;
long ans, sqrt, sum, maxup, maxdown, m, X, Y, Q, MOD;//, sum2;
boolean flag, flag2, streak;;
boolean l2r;
double avg;
String str1, str2;
// t = s.nextInt();
// for(; t>0; t--){
str1 = s.nextLine();
str2 = s.nextLine();
x = str1.length();
y = str2.length();
count = 0; min = Integer.MAX_VALUE;
for(i=0; i<=(x-y); i++){
for(j=0; j<y; j++){
if(str1.charAt(i+j) != str2.charAt(j))
count++;
}
if(count < min)
min = count;
count = 0;
}
w.write((min)+"");
w.write("\n");
// }
w.close();
}catch(Exception e){
e.printStackTrace();
}
}
}
//========================================### FAST IO ###=========================================//
class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements())
{
try
{
st = new StringTokenizer(br.readLine());
}
catch (IOException e)
{
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt()
{
return Integer.parseInt(next());
}
long nextLong()
{
return Long.parseLong(next());
}
Double nextDouble()
{
return Double.parseDouble(next());
}
String nextLine()
{
String str = "";
try
{
str = br.readLine();
}
catch (IOException e)
{
e.printStackTrace();
}
return str;
}
}
//====================================================================================================//
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
20,
4,
18,
13,
41,
13,
20,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
13,
41,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
2,
17,
18,
13,
13,
18,
13,
13,
1,
40,
13,
30,
30,
0,
13,
17,
41,
13,
13,
41,
13,
17,
42,
2,
13,
18,
13,
13,
30,
14,
2,
18,
13,
13,
18,
13,
13,
40,
13,
40,
13,
40,
13,
14,
2,
13,
13,
0,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
25,
26
],
[
26,
27
],
[
8,
28
],
[
28,
29
],
[
28,
30
],
[
31,
32
],
[
32,
33
],
[
8,
34
],
[
34,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
34,
39
],
[
39,
40
],
[
39,
41
],
[
41,
42
],
[
41,
43
],
[
34,
44
],
[
44,
45
],
[
45,
46
],
[
34,
47
],
[
48,
48
],
[
48,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
49,
53
],
[
53,
54
],
[
54,
55
],
[
53,
56
],
[
8,
57
],
[
57,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
57,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
64,
66
],
[
57,
67
],
[
67,
68
],
[
68,
69
],
[
57,
70
],
[
71,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
73,
75
],
[
72,
76
],
[
76,
77
],
[
77,
78
],
[
76,
79
],
[
8,
80
],
[
80,
81
],
[
8,
82
],
[
82,
83
],
[
82,
84
],
[
84,
85
],
[
84,
86
],
[
8,
87
],
[
87,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
87,
92
],
[
92,
93
],
[
92,
94
],
[
94,
95
],
[
95,
96
],
[
95,
97
],
[
97,
98
],
[
97,
99
],
[
94,
100
],
[
100,
101
],
[
100,
102
],
[
87,
103
],
[
103,
104
],
[
104,
105
],
[
87,
106
],
[
107,
107
],
[
107,
108
],
[
108,
109
],
[
108,
110
],
[
107,
111
],
[
111,
112
],
[
111,
113
],
[
107,
114
],
[
114,
115
],
[
114,
116
],
[
107,
117
],
[
117,
118
],
[
118,
119
],
[
118,
120
],
[
120,
121
],
[
120,
122
],
[
117,
123
],
[
123,
124
],
[
124,
125
],
[
125,
126
],
[
126,
127
],
[
126,
128
],
[
125,
129
],
[
129,
130
],
[
129,
131
],
[
124,
132
],
[
132,
133
],
[
123,
134
],
[
134,
135
],
[
123,
136
],
[
136,
137
],
[
107,
138
],
[
138,
139
],
[
139,
140
],
[
139,
141
],
[
138,
142
],
[
142,
143
],
[
142,
144
],
[
8,
145
],
[
145,
146
],
[
146,
147
],
[
147,
148
],
[
147,
149
],
[
145,
150
],
[
6,
151
],
[
151,
152
]
]
| [
"import java.util.*;\nclass Main{\n public static void main(String[] args){\n Scanner sc=new Scanner(System.in);\n String s=sc.next();\n String t=sc.next();\n char[] ss=new char[s.length()];\n char[] tt=new char[t.length()];\n for(int i=0;i<ss.length;i++){\n ss[i]=s.charAt(i);\n }\n for(int i=0;i<tt.length;i++){\n tt[i]=t.charAt(i);\n }\n int count;\n int min=tt.length;\n for(int i=0;i<1+ss.length-tt.length;i++){\n count=0;\n int j=i,k=0;\n while(k<tt.length){\n if(ss[j]!=tt[k]) count++;\n j++;k++;\n }\n if(min>count)min=count;\n }\n System.out.println(min);\n }\n}",
"import java.util.*;",
"util.*",
"java",
"class Main{\n public static void main(String[] args){\n Scanner sc=new Scanner(System.in);\n String s=sc.next();\n String t=sc.next();\n char[] ss=new char[s.length()];\n char[] tt=new char[t.length()];\n for(int i=0;i<ss.length;i++){\n ss[i]=s.charAt(i);\n }\n for(int i=0;i<tt.length;i++){\n tt[i]=t.charAt(i);\n }\n int count;\n int min=tt.length;\n for(int i=0;i<1+ss.length-tt.length;i++){\n count=0;\n int j=i,k=0;\n while(k<tt.length){\n if(ss[j]!=tt[k]) count++;\n j++;k++;\n }\n if(min>count)min=count;\n }\n System.out.println(min);\n }\n}",
"Main",
"public static void main(String[] args){\n Scanner sc=new Scanner(System.in);\n String s=sc.next();\n String t=sc.next();\n char[] ss=new char[s.length()];\n char[] tt=new char[t.length()];\n for(int i=0;i<ss.length;i++){\n ss[i]=s.charAt(i);\n }\n for(int i=0;i<tt.length;i++){\n tt[i]=t.charAt(i);\n }\n int count;\n int min=tt.length;\n for(int i=0;i<1+ss.length-tt.length;i++){\n count=0;\n int j=i,k=0;\n while(k<tt.length){\n if(ss[j]!=tt[k]) count++;\n j++;k++;\n }\n if(min>count)min=count;\n }\n System.out.println(min);\n }",
"main",
"{\n Scanner sc=new Scanner(System.in);\n String s=sc.next();\n String t=sc.next();\n char[] ss=new char[s.length()];\n char[] tt=new char[t.length()];\n for(int i=0;i<ss.length;i++){\n ss[i]=s.charAt(i);\n }\n for(int i=0;i<tt.length;i++){\n tt[i]=t.charAt(i);\n }\n int count;\n int min=tt.length;\n for(int i=0;i<1+ss.length-tt.length;i++){\n count=0;\n int j=i,k=0;\n while(k<tt.length){\n if(ss[j]!=tt[k]) count++;\n j++;k++;\n }\n if(min>count)min=count;\n }\n System.out.println(min);\n }",
"Scanner sc=new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String s=sc.next();",
"s",
"sc.next()",
"sc.next",
"sc",
"String t=sc.next();",
"t",
"sc.next()",
"sc.next",
"sc",
"char[] ss=new char[s.length()];",
"ss",
"new char[s.length()]",
"s.length()",
"s.length",
"s",
"char[] tt=new char[t.length()];",
"tt",
"new char[t.length()]",
"t.length()",
"t.length",
"t",
"for(int i=0;i<ss.length;i++){\n ss[i]=s.charAt(i);\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<ss.length",
"i",
"ss.length",
"ss",
"ss.length",
"i++",
"i++",
"i",
"{\n ss[i]=s.charAt(i);\n }",
"{\n ss[i]=s.charAt(i);\n }",
"ss[i]=s.charAt(i)",
"ss[i]",
"ss",
"i",
"s.charAt(i)",
"s.charAt",
"s",
"i",
"for(int i=0;i<tt.length;i++){\n tt[i]=t.charAt(i);\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<tt.length",
"i",
"tt.length",
"tt",
"tt.length",
"i++",
"i++",
"i",
"{\n tt[i]=t.charAt(i);\n }",
"{\n tt[i]=t.charAt(i);\n }",
"tt[i]=t.charAt(i)",
"tt[i]",
"tt",
"i",
"t.charAt(i)",
"t.charAt",
"t",
"i",
"int count;",
"count",
"int min=tt.length;",
"min",
"tt.length",
"tt",
"tt.length",
"for(int i=0;i<1+ss.length-tt.length;i++){\n count=0;\n int j=i,k=0;\n while(k<tt.length){\n if(ss[j]!=tt[k]) count++;\n j++;k++;\n }\n if(min>count)min=count;\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<1+ss.length-tt.length",
"i",
"1+ss.length-tt.length",
"1+ss.length",
"1",
"ss.length",
"ss",
"ss.length",
"tt.length",
"tt",
"tt.length",
"i++",
"i++",
"i",
"{\n count=0;\n int j=i,k=0;\n while(k<tt.length){\n if(ss[j]!=tt[k]) count++;\n j++;k++;\n }\n if(min>count)min=count;\n }",
"{\n count=0;\n int j=i,k=0;\n while(k<tt.length){\n if(ss[j]!=tt[k]) count++;\n j++;k++;\n }\n if(min>count)min=count;\n }",
"count=0",
"count",
"0",
"int j=i",
"j",
"i",
"k=0;",
"k",
"0",
"while(k<tt.length){\n if(ss[j]!=tt[k]) count++;\n j++;k++;\n }",
"k<tt.length",
"k",
"tt.length",
"tt",
"tt.length",
"{\n if(ss[j]!=tt[k]) count++;\n j++;k++;\n }",
"if(ss[j]!=tt[k]) count++;",
"ss[j]!=tt[k]",
"ss[j]",
"ss",
"j",
"tt[k]",
"tt",
"k",
"count++",
"count",
"j++",
"j",
"k++",
"k",
"if(min>count)min=count;",
"min>count",
"min",
"count",
"min=count",
"min",
"count",
"System.out.println(min)",
"System.out.println",
"System.out",
"System",
"System.out",
"min",
"String[] args",
"args"
]
| import java.util.*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
String s=sc.next();
String t=sc.next();
char[] ss=new char[s.length()];
char[] tt=new char[t.length()];
for(int i=0;i<ss.length;i++){
ss[i]=s.charAt(i);
}
for(int i=0;i<tt.length;i++){
tt[i]=t.charAt(i);
}
int count;
int min=tt.length;
for(int i=0;i<1+ss.length-tt.length;i++){
count=0;
int j=i,k=0;
while(k<tt.length){
if(ss[j]!=tt[k]) count++;
j++;k++;
}
if(min>count)min=count;
}
System.out.println(min);
}
} |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
41,
13,
41,
13,
17,
41,
13,
17,
41,
13,
20,
13,
41,
13,
20,
13,
41,
13,
20,
13,
12,
13,
30,
0,
13,
20,
0,
13,
20,
41,
13,
4,
18,
4,
13,
41,
13,
4,
18,
4,
13,
41,
13,
2,
18,
13,
13,
18,
13,
13,
41,
13,
18,
13,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
2,
13,
13,
18,
13,
13,
30,
40,
13,
14,
2,
13,
13,
30,
0,
13,
13,
4,
18,
18,
13,
13,
13,
4,
18,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
13,
23,
13,
23,
13,
12,
13,
30,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
18,
13,
12,
13,
30,
4,
18,
18,
13,
13,
17,
12,
13,
30,
4,
18,
18,
13,
13,
17,
12,
13,
30,
4,
18,
18,
13,
13,
17,
12,
13,
30,
4,
18,
18,
13,
13,
17,
12,
13,
30,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
2,
2,
2,
13,
13,
2,
13,
13,
2,
2,
13,
13,
2,
13,
13,
23,
13,
23,
13,
23,
13,
23,
13,
12,
13,
30,
0,
18,
13,
17,
0,
18,
13,
17,
17,
0,
18,
13,
17,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
2,
2,
18,
13,
2,
13,
17,
13,
13,
0,
18,
13,
13,
2,
13,
2,
2,
18,
13,
2,
13,
13,
2,
13,
13,
13,
0,
18,
13,
13,
2,
2,
18,
13,
2,
13,
17,
18,
13,
13,
13,
12,
13,
30,
14,
2,
2,
2,
13,
13,
2,
13,
17,
2,
13,
17,
29,
17,
29,
2,
2,
18,
13,
13,
2,
2,
18,
13,
13,
18,
13,
2,
13,
13,
13,
13,
23,
13,
23,
13,
12,
13,
30,
29,
8,
2,
13,
17,
17,
2,
13,
4,
13,
2,
13,
17,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
434,
8
],
[
434,
9
],
[
9,
10
],
[
434,
11
],
[
11,
12
],
[
434,
13
],
[
13,
14
],
[
13,
15
],
[
434,
16
],
[
16,
17
],
[
16,
18
],
[
434,
19
],
[
19,
20
],
[
19,
21
],
[
434,
23
],
[
23,
24
],
[
23,
25
],
[
434,
27
],
[
27,
28
],
[
27,
29
],
[
434,
31
],
[
31,
32
],
[
31,
33
],
[
33,
34
],
[
34,
35
],
[
34,
36
],
[
33,
37
],
[
37,
38
],
[
37,
39
],
[
33,
40
],
[
40,
41
],
[
40,
42
],
[
42,
43
],
[
43,
44
],
[
44,
45
],
[
33,
46
],
[
46,
47
],
[
46,
48
],
[
48,
49
],
[
49,
50
],
[
50,
51
],
[
33,
52
],
[
52,
53
],
[
52,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
54,
58
],
[
58,
59
],
[
58,
60
],
[
33,
61
],
[
61,
62
],
[
61,
63
],
[
63,
64
],
[
63,
65
],
[
33,
66
],
[
66,
67
],
[
66,
68
],
[
68,
69
],
[
68,
70
],
[
33,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
73,
75
],
[
71,
76
],
[
76,
77
],
[
76,
78
],
[
71,
79
],
[
79,
80
],
[
80,
81
],
[
71,
82
],
[
83,
83
],
[
83,
84
],
[
84,
85
],
[
84,
86
],
[
83,
87
],
[
87,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
87,
92
],
[
92,
93
],
[
92,
94
],
[
87,
95
],
[
95,
96
],
[
96,
97
],
[
87,
98
],
[
99,
99
],
[
99,
100
],
[
100,
101
],
[
101,
102
],
[
102,
103
],
[
102,
104
],
[
104,
105
],
[
104,
106
],
[
101,
107
],
[
107,
108
],
[
107,
109
],
[
100,
110
],
[
110,
111
],
[
111,
112
],
[
83,
113
],
[
113,
114
],
[
114,
115
],
[
114,
116
],
[
113,
117
],
[
117,
118
],
[
118,
119
],
[
118,
120
],
[
33,
121
],
[
121,
122
],
[
122,
123
],
[
123,
124
],
[
123,
125
],
[
121,
126
],
[
33,
127
],
[
127,
128
],
[
128,
129
],
[
31,
130
],
[
130,
131
],
[
434,
132
],
[
132,
133
],
[
132,
134
],
[
134,
135
],
[
135,
136
],
[
136,
137
],
[
135,
138
],
[
132,
139
],
[
139,
140
],
[
434,
141
],
[
141,
142
],
[
141,
143
],
[
143,
144
],
[
144,
145
],
[
145,
146
],
[
144,
147
],
[
141,
148
],
[
148,
149
],
[
434,
150
],
[
150,
151
],
[
150,
152
],
[
152,
153
],
[
153,
154
],
[
154,
155
],
[
153,
156
],
[
153,
157
],
[
150,
158
],
[
158,
159
],
[
150,
160
],
[
160,
161
],
[
434,
162
],
[
162,
163
],
[
162,
164
],
[
164,
165
],
[
165,
166
],
[
166,
167
],
[
167,
168
],
[
434,
169
],
[
169,
170
],
[
169,
171
],
[
171,
172
],
[
172,
173
],
[
173,
174
],
[
174,
175
],
[
173,
176
],
[
176,
177
],
[
177,
178
],
[
434,
179
],
[
179,
180
],
[
179,
181
],
[
181,
182
],
[
182,
183
],
[
183,
184
],
[
184,
185
],
[
183,
186
],
[
186,
187
],
[
187,
188
],
[
434,
189
],
[
189,
190
],
[
189,
191
],
[
191,
192
],
[
192,
193
],
[
193,
194
],
[
194,
195
],
[
193,
196
],
[
196,
197
],
[
197,
198
],
[
434,
199
],
[
199,
200
],
[
199,
201
],
[
201,
202
],
[
202,
203
],
[
203,
204
],
[
204,
205
],
[
203,
206
],
[
206,
207
],
[
207,
208
],
[
434,
209
],
[
209,
210
],
[
209,
211
],
[
211,
212
],
[
212,
213
],
[
213,
214
],
[
214,
215
],
[
213,
216
],
[
216,
217
],
[
217,
218
],
[
434,
219
],
[
219,
220
],
[
219,
221
],
[
221,
222
],
[
222,
223
],
[
223,
224
],
[
224,
225
],
[
224,
226
],
[
222,
227
],
[
434,
228
],
[
228,
229
],
[
228,
230
],
[
230,
231
],
[
231,
232
],
[
232,
233
],
[
233,
234
],
[
233,
235
],
[
231,
236
],
[
434,
237
],
[
237,
238
],
[
237,
239
],
[
239,
240
],
[
240,
241
],
[
241,
242
],
[
242,
243
],
[
242,
244
],
[
240,
245
],
[
434,
246
],
[
246,
247
],
[
246,
248
],
[
248,
249
],
[
249,
250
],
[
250,
251
],
[
251,
252
],
[
251,
253
],
[
249,
254
],
[
434,
255
],
[
255,
256
],
[
255,
257
],
[
257,
258
],
[
258,
259
],
[
259,
260
],
[
260,
261
],
[
434,
262
],
[
262,
263
],
[
262,
264
],
[
264,
265
],
[
265,
266
],
[
266,
267
],
[
267,
268
],
[
266,
269
],
[
269,
270
],
[
270,
271
],
[
271,
272
],
[
271,
273
],
[
270,
274
],
[
274,
275
],
[
274,
276
],
[
269,
277
],
[
277,
278
],
[
278,
279
],
[
278,
280
],
[
277,
281
],
[
281,
282
],
[
281,
283
],
[
262,
284
],
[
284,
285
],
[
262,
286
],
[
286,
287
],
[
262,
288
],
[
288,
289
],
[
262,
290
],
[
290,
291
],
[
434,
292
],
[
292,
293
],
[
292,
294
],
[
294,
295
],
[
295,
296
],
[
296,
297
],
[
296,
298
],
[
295,
299
],
[
299,
300
],
[
300,
301
],
[
300,
302
],
[
299,
303
],
[
294,
304
],
[
304,
305
],
[
305,
306
],
[
305,
307
],
[
304,
308
],
[
308,
309
],
[
309,
310
],
[
309,
311
],
[
308,
312
],
[
294,
313
],
[
313,
314
],
[
314,
315
],
[
314,
316
],
[
313,
317
],
[
294,
318
],
[
318,
319
],
[
319,
320
],
[
320,
321
],
[
320,
322
],
[
318,
323
],
[
323,
324
],
[
323,
325
],
[
318,
326
],
[
326,
327
],
[
327,
328
],
[
318,
329
],
[
330,
330
],
[
330,
331
],
[
331,
332
],
[
332,
333
],
[
332,
334
],
[
331,
335
],
[
335,
336
],
[
336,
337
],
[
337,
338
],
[
337,
339
],
[
339,
340
],
[
339,
341
],
[
336,
342
],
[
335,
343
],
[
330,
344
],
[
344,
345
],
[
345,
346
],
[
345,
347
],
[
344,
348
],
[
348,
349
],
[
348,
350
],
[
350,
351
],
[
351,
352
],
[
352,
353
],
[
352,
354
],
[
354,
355
],
[
354,
356
],
[
351,
357
],
[
357,
358
],
[
357,
359
],
[
350,
360
],
[
330,
361
],
[
361,
362
],
[
362,
363
],
[
362,
364
],
[
361,
365
],
[
365,
366
],
[
366,
367
],
[
367,
368
],
[
367,
369
],
[
369,
370
],
[
369,
371
],
[
366,
372
],
[
372,
373
],
[
372,
374
],
[
365,
375
],
[
434,
376
],
[
376,
377
],
[
376,
378
],
[
378,
379
],
[
379,
380
],
[
381,
381
],
[
381,
382
],
[
382,
383
],
[
382,
384
],
[
381,
385
],
[
385,
386
],
[
385,
387
],
[
381,
388
],
[
388,
389
],
[
388,
390
],
[
379,
391
],
[
391,
392
],
[
378,
393
],
[
393,
394
],
[
394,
395
],
[
395,
396
],
[
396,
397
],
[
396,
398
],
[
395,
399
],
[
399,
400
],
[
400,
401
],
[
401,
402
],
[
401,
403
],
[
400,
404
],
[
404,
405
],
[
404,
406
],
[
406,
407
],
[
406,
408
],
[
399,
409
],
[
394,
410
],
[
376,
411
],
[
411,
412
],
[
376,
413
],
[
413,
414
],
[
434,
415
],
[
415,
416
],
[
415,
417
],
[
417,
418
],
[
418,
419
],
[
419,
420
],
[
420,
421
],
[
420,
422
],
[
419,
423
],
[
419,
424
],
[
424,
425
],
[
424,
426
],
[
426,
427
],
[
426,
428
],
[
428,
429
],
[
428,
430
],
[
415,
431
],
[
431,
432
],
[
0,
433
],
[
433,
434
],
[
433,
435
]
]
| [
"\nimport java.io.PrintWriter;\nimport java.util.*;\n\npublic class Main {\n static Scanner scanner;\n static PrintWriter out;\n public static void main(String[] args) {\n scanner = new Scanner(System.in);\n out = new PrintWriter(System.out);\n\n char[] line = nextLine().toCharArray();\n\n char[] second = nextLine().toCharArray();\n int in = line.length - second.length;\n\n int min = Integer.MAX_VALUE;\n\n int in2 = second.length;\n\n for (int i = 0; i <= in; i++) {\n int a = 0;\n for (int j = 0; j < in2; j++) {\n if (line[j+i] != second[j]) {\n a++;\n }\n }\n if (min >= a) {\n min = a;\n }\n }\n System.out.println(min);\n\n out.flush();\n }\n\n public static void println(Object o) {\n out.println(o);\n }\n\n public static void print(Object o) {\n out.print(o);\n }\n\n public static void printf(String format, Object... o) {\n out.printf(format, o);\n }\n\n public static String next() {\n return scanner.next();\n }\n\n public static int nextInt() {\n return Integer.parseInt(scanner.next());\n }\n\n public static long nextLong() {\n return Long.parseLong(scanner.next());\n }\n\n public static double nextDouble() {\n return Double.parseDouble(scanner.next());\n }\n\n public static short nextShort() {\n return Short.parseShort(scanner.next());\n }\n\n public static float nextFloat() {\n return Float.parseFloat(scanner.next());\n }\n\n public static void printYes() {\n System.out.println(\"Yes\");\n }\n\n public static void printYES() {\n System.out.println(\"YES\");\n }\n\n public static void printNo() {\n System.out.println(\"No\");\n }\n\n public static void printNO() {\n System.out.println(\"NO\");\n }\n\n public static String nextLine() {\n return scanner.nextLine();\n }\n\n public static double distance(double x, double y, double x2, double y2) {\n return Math.sqrt((x2 - x) * (x2 - x) + (y2 - y) * (y2 - y));\n }\n\n public static int MOD = 1_000_000_007;\n public static int MAX = 100000;\n public static long[] fac = new long[MAX];\n public static long[] finv = new long[MAX];\n public static long[] inv = new long[MAX];\n\n public static void combinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++) {\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n }\n\n public static long combination(int n, int k) {\n if (n < k || n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n }\n\n public static long factorial(long n) {\n return n <= 0 ? 1 : n * factorial(n - 1);\n }\n}",
"import java.io.PrintWriter;",
"PrintWriter",
"java.io",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n static Scanner scanner;\n static PrintWriter out;\n public static void main(String[] args) {\n scanner = new Scanner(System.in);\n out = new PrintWriter(System.out);\n\n char[] line = nextLine().toCharArray();\n\n char[] second = nextLine().toCharArray();\n int in = line.length - second.length;\n\n int min = Integer.MAX_VALUE;\n\n int in2 = second.length;\n\n for (int i = 0; i <= in; i++) {\n int a = 0;\n for (int j = 0; j < in2; j++) {\n if (line[j+i] != second[j]) {\n a++;\n }\n }\n if (min >= a) {\n min = a;\n }\n }\n System.out.println(min);\n\n out.flush();\n }\n\n public static void println(Object o) {\n out.println(o);\n }\n\n public static void print(Object o) {\n out.print(o);\n }\n\n public static void printf(String format, Object... o) {\n out.printf(format, o);\n }\n\n public static String next() {\n return scanner.next();\n }\n\n public static int nextInt() {\n return Integer.parseInt(scanner.next());\n }\n\n public static long nextLong() {\n return Long.parseLong(scanner.next());\n }\n\n public static double nextDouble() {\n return Double.parseDouble(scanner.next());\n }\n\n public static short nextShort() {\n return Short.parseShort(scanner.next());\n }\n\n public static float nextFloat() {\n return Float.parseFloat(scanner.next());\n }\n\n public static void printYes() {\n System.out.println(\"Yes\");\n }\n\n public static void printYES() {\n System.out.println(\"YES\");\n }\n\n public static void printNo() {\n System.out.println(\"No\");\n }\n\n public static void printNO() {\n System.out.println(\"NO\");\n }\n\n public static String nextLine() {\n return scanner.nextLine();\n }\n\n public static double distance(double x, double y, double x2, double y2) {\n return Math.sqrt((x2 - x) * (x2 - x) + (y2 - y) * (y2 - y));\n }\n\n public static int MOD = 1_000_000_007;\n public static int MAX = 100000;\n public static long[] fac = new long[MAX];\n public static long[] finv = new long[MAX];\n public static long[] inv = new long[MAX];\n\n public static void combinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++) {\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n }\n\n public static long combination(int n, int k) {\n if (n < k || n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n }\n\n public static long factorial(long n) {\n return n <= 0 ? 1 : n * factorial(n - 1);\n }\n}",
"Main",
"static Scanner scanner;",
"scanner",
"static PrintWriter out;",
"out",
"public static int MOD = 1_000_000_007;",
"MOD",
"1_000_000_007",
"public static int MAX = 100000;",
"MAX",
"100000",
"public static long[] fac = new long[MAX];",
"fac",
"new long[MAX]",
"MAX",
"public static long[] finv = new long[MAX];",
"finv",
"new long[MAX]",
"MAX",
"public static long[] inv = new long[MAX];",
"inv",
"new long[MAX]",
"MAX",
"public static void main(String[] args) {\n scanner = new Scanner(System.in);\n out = new PrintWriter(System.out);\n\n char[] line = nextLine().toCharArray();\n\n char[] second = nextLine().toCharArray();\n int in = line.length - second.length;\n\n int min = Integer.MAX_VALUE;\n\n int in2 = second.length;\n\n for (int i = 0; i <= in; i++) {\n int a = 0;\n for (int j = 0; j < in2; j++) {\n if (line[j+i] != second[j]) {\n a++;\n }\n }\n if (min >= a) {\n min = a;\n }\n }\n System.out.println(min);\n\n out.flush();\n }",
"main",
"{\n scanner = new Scanner(System.in);\n out = new PrintWriter(System.out);\n\n char[] line = nextLine().toCharArray();\n\n char[] second = nextLine().toCharArray();\n int in = line.length - second.length;\n\n int min = Integer.MAX_VALUE;\n\n int in2 = second.length;\n\n for (int i = 0; i <= in; i++) {\n int a = 0;\n for (int j = 0; j < in2; j++) {\n if (line[j+i] != second[j]) {\n a++;\n }\n }\n if (min >= a) {\n min = a;\n }\n }\n System.out.println(min);\n\n out.flush();\n }",
"scanner = new Scanner(System.in)",
"scanner",
"new Scanner(System.in)",
"out = new PrintWriter(System.out)",
"out",
"new PrintWriter(System.out)",
"char[] line = nextLine().toCharArray();",
"line",
"nextLine().toCharArray()",
"nextLine().toCharArray",
"nextLine()",
"nextLine",
"char[] second = nextLine().toCharArray();",
"second",
"nextLine().toCharArray()",
"nextLine().toCharArray",
"nextLine()",
"nextLine",
"int in = line.length - second.length;",
"in",
"line.length - second.length",
"line.length",
"line",
"line.length",
"second.length",
"second",
"second.length",
"int min = Integer.MAX_VALUE;",
"min",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"int in2 = second.length;",
"in2",
"second.length",
"second",
"second.length",
"for (int i = 0; i <= in; i++) {\n int a = 0;\n for (int j = 0; j < in2; j++) {\n if (line[j+i] != second[j]) {\n a++;\n }\n }\n if (min >= a) {\n min = a;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= in",
"i",
"in",
"i++",
"i++",
"i",
"{\n int a = 0;\n for (int j = 0; j < in2; j++) {\n if (line[j+i] != second[j]) {\n a++;\n }\n }\n if (min >= a) {\n min = a;\n }\n }",
"{\n int a = 0;\n for (int j = 0; j < in2; j++) {\n if (line[j+i] != second[j]) {\n a++;\n }\n }\n if (min >= a) {\n min = a;\n }\n }",
"int a = 0;",
"a",
"0",
"for (int j = 0; j < in2; j++) {\n if (line[j+i] != second[j]) {\n a++;\n }\n }",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < in2",
"j",
"in2",
"j++",
"j++",
"j",
"{\n if (line[j+i] != second[j]) {\n a++;\n }\n }",
"{\n if (line[j+i] != second[j]) {\n a++;\n }\n }",
"if (line[j+i] != second[j]) {\n a++;\n }",
"line[j+i] != second[j]",
"line[j+i]",
"line",
"j+i",
"j",
"i",
"second[j]",
"second",
"j",
"{\n a++;\n }",
"a++",
"a",
"if (min >= a) {\n min = a;\n }",
"min >= a",
"min",
"a",
"{\n min = a;\n }",
"min = a",
"min",
"a",
"System.out.println(min)",
"System.out.println",
"System.out",
"System",
"System.out",
"min",
"out.flush()",
"out.flush",
"out",
"String[] args",
"args",
"public static void println(Object o) {\n out.println(o);\n }",
"println",
"{\n out.println(o);\n }",
"out.println(o)",
"out.println",
"out",
"o",
"Object o",
"o",
"public static void print(Object o) {\n out.print(o);\n }",
"print",
"{\n out.print(o);\n }",
"out.print(o)",
"out.print",
"out",
"o",
"Object o",
"o",
"public static void printf(String format, Object... o) {\n out.printf(format, o);\n }",
"printf",
"{\n out.printf(format, o);\n }",
"out.printf(format, o)",
"out.printf",
"out",
"format",
"o",
"String format",
"format",
"Object... o",
"o",
"public static String next() {\n return scanner.next();\n }",
"next",
"{\n return scanner.next();\n }",
"return scanner.next();",
"scanner.next()",
"scanner.next",
"scanner",
"public static int nextInt() {\n return Integer.parseInt(scanner.next());\n }",
"nextInt",
"{\n return Integer.parseInt(scanner.next());\n }",
"return Integer.parseInt(scanner.next());",
"Integer.parseInt(scanner.next())",
"Integer.parseInt",
"Integer",
"scanner.next()",
"scanner.next",
"scanner",
"public static long nextLong() {\n return Long.parseLong(scanner.next());\n }",
"nextLong",
"{\n return Long.parseLong(scanner.next());\n }",
"return Long.parseLong(scanner.next());",
"Long.parseLong(scanner.next())",
"Long.parseLong",
"Long",
"scanner.next()",
"scanner.next",
"scanner",
"public static double nextDouble() {\n return Double.parseDouble(scanner.next());\n }",
"nextDouble",
"{\n return Double.parseDouble(scanner.next());\n }",
"return Double.parseDouble(scanner.next());",
"Double.parseDouble(scanner.next())",
"Double.parseDouble",
"Double",
"scanner.next()",
"scanner.next",
"scanner",
"public static short nextShort() {\n return Short.parseShort(scanner.next());\n }",
"nextShort",
"{\n return Short.parseShort(scanner.next());\n }",
"return Short.parseShort(scanner.next());",
"Short.parseShort(scanner.next())",
"Short.parseShort",
"Short",
"scanner.next()",
"scanner.next",
"scanner",
"public static float nextFloat() {\n return Float.parseFloat(scanner.next());\n }",
"nextFloat",
"{\n return Float.parseFloat(scanner.next());\n }",
"return Float.parseFloat(scanner.next());",
"Float.parseFloat(scanner.next())",
"Float.parseFloat",
"Float",
"scanner.next()",
"scanner.next",
"scanner",
"public static void printYes() {\n System.out.println(\"Yes\");\n }",
"printYes",
"{\n System.out.println(\"Yes\");\n }",
"System.out.println(\"Yes\")",
"System.out.println",
"System.out",
"System",
"System.out",
"\"Yes\"",
"public static void printYES() {\n System.out.println(\"YES\");\n }",
"printYES",
"{\n System.out.println(\"YES\");\n }",
"System.out.println(\"YES\")",
"System.out.println",
"System.out",
"System",
"System.out",
"\"YES\"",
"public static void printNo() {\n System.out.println(\"No\");\n }",
"printNo",
"{\n System.out.println(\"No\");\n }",
"System.out.println(\"No\")",
"System.out.println",
"System.out",
"System",
"System.out",
"\"No\"",
"public static void printNO() {\n System.out.println(\"NO\");\n }",
"printNO",
"{\n System.out.println(\"NO\");\n }",
"System.out.println(\"NO\")",
"System.out.println",
"System.out",
"System",
"System.out",
"\"NO\"",
"public static String nextLine() {\n return scanner.nextLine();\n }",
"nextLine",
"{\n return scanner.nextLine();\n }",
"return scanner.nextLine();",
"scanner.nextLine()",
"scanner.nextLine",
"scanner",
"public static double distance(double x, double y, double x2, double y2) {\n return Math.sqrt((x2 - x) * (x2 - x) + (y2 - y) * (y2 - y));\n }",
"distance",
"{\n return Math.sqrt((x2 - x) * (x2 - x) + (y2 - y) * (y2 - y));\n }",
"return Math.sqrt((x2 - x) * (x2 - x) + (y2 - y) * (y2 - y));",
"Math.sqrt((x2 - x) * (x2 - x) + (y2 - y) * (y2 - y))",
"Math.sqrt",
"Math",
"(x2 - x) * (x2 - x) + (y2 - y) * (y2 - y)",
"(x2 - x) * (x2 - x)",
"(x2 - x)",
"x2",
"x",
"(x2 - x)",
"x2",
"x",
"(y2 - y) * (y2 - y)",
"(y2 - y)",
"y2",
"y",
"(y2 - y)",
"y2",
"y",
"double x",
"x",
"double y",
"y",
"double x2",
"x2",
"double y2",
"y2",
"public static void combinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++) {\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n }",
"combinit",
"{\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++) {\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n }",
"fac[0] = fac[1] = 1",
"fac[0]",
"fac",
"0",
"fac[1] = 1",
"fac[1]",
"fac",
"1",
"1",
"finv[0] = finv[1] = 1",
"finv[0]",
"finv",
"0",
"finv[1] = 1",
"finv[1]",
"finv",
"1",
"1",
"inv[1] = 1",
"inv[1]",
"inv",
"1",
"1",
"for (int i = 2; i < MAX; i++) {\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }",
"int i = 2;",
"int i = 2;",
"i",
"2",
"i < MAX",
"i",
"MAX",
"i++",
"i++",
"i",
"{\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }",
"{\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }",
"fac[i] = fac[i - 1] * i % MOD",
"fac[i]",
"fac",
"i",
"fac[i - 1] * i % MOD",
"fac[i - 1] * i",
"fac[i - 1]",
"fac",
"i - 1",
"i",
"1",
"i",
"MOD",
"inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD",
"inv[i]",
"inv",
"i",
"MOD - inv[MOD % i] * (MOD / i) % MOD",
"MOD",
"inv[MOD % i] * (MOD / i) % MOD",
"inv[MOD % i] * (MOD / i)",
"inv[MOD % i]",
"inv",
"MOD % i",
"MOD",
"i",
"(MOD / i)",
"MOD",
"i",
"MOD",
"finv[i] = finv[i - 1] * inv[i] % MOD",
"finv[i]",
"finv",
"i",
"finv[i - 1] * inv[i] % MOD",
"finv[i - 1] * inv[i]",
"finv[i - 1]",
"finv",
"i - 1",
"i",
"1",
"inv[i]",
"inv",
"i",
"MOD",
"public static long combination(int n, int k) {\n if (n < k || n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n }",
"combination",
"{\n if (n < k || n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n }",
"if (n < k || n < 0 || k < 0) return 0;",
"n < k || n < 0 || k < 0",
"n < k || n < 0 || k < 0",
"n < k",
"n",
"k",
"n < 0",
"n",
"0",
"k < 0",
"k",
"0",
"return 0;",
"0",
"return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;",
"fac[n] * (finv[k] * finv[n - k] % MOD) % MOD",
"fac[n] * (finv[k] * finv[n - k] % MOD)",
"fac[n]",
"fac",
"n",
"(finv[k] * finv[n - k] % MOD)",
"finv[k] * finv[n - k]",
"finv[k]",
"finv",
"k",
"finv[n - k]",
"finv",
"n - k",
"n",
"k",
"MOD",
"MOD",
"int n",
"n",
"int k",
"k",
"public static long factorial(long n) {\n return n <= 0 ? 1 : n * factorial(n - 1);\n }",
"factorial",
"{\n return n <= 0 ? 1 : n * factorial(n - 1);\n }",
"return n <= 0 ? 1 : n * factorial(n - 1);",
"n <= 0 ? 1 : n * factorial(n - 1)",
"n <= 0",
"n",
"0",
"1",
"n * factorial(n - 1)",
"n",
"factorial(n - 1)",
"factorial",
"n - 1",
"n",
"1",
"long n",
"n",
"public class Main {\n static Scanner scanner;\n static PrintWriter out;\n public static void main(String[] args) {\n scanner = new Scanner(System.in);\n out = new PrintWriter(System.out);\n\n char[] line = nextLine().toCharArray();\n\n char[] second = nextLine().toCharArray();\n int in = line.length - second.length;\n\n int min = Integer.MAX_VALUE;\n\n int in2 = second.length;\n\n for (int i = 0; i <= in; i++) {\n int a = 0;\n for (int j = 0; j < in2; j++) {\n if (line[j+i] != second[j]) {\n a++;\n }\n }\n if (min >= a) {\n min = a;\n }\n }\n System.out.println(min);\n\n out.flush();\n }\n\n public static void println(Object o) {\n out.println(o);\n }\n\n public static void print(Object o) {\n out.print(o);\n }\n\n public static void printf(String format, Object... o) {\n out.printf(format, o);\n }\n\n public static String next() {\n return scanner.next();\n }\n\n public static int nextInt() {\n return Integer.parseInt(scanner.next());\n }\n\n public static long nextLong() {\n return Long.parseLong(scanner.next());\n }\n\n public static double nextDouble() {\n return Double.parseDouble(scanner.next());\n }\n\n public static short nextShort() {\n return Short.parseShort(scanner.next());\n }\n\n public static float nextFloat() {\n return Float.parseFloat(scanner.next());\n }\n\n public static void printYes() {\n System.out.println(\"Yes\");\n }\n\n public static void printYES() {\n System.out.println(\"YES\");\n }\n\n public static void printNo() {\n System.out.println(\"No\");\n }\n\n public static void printNO() {\n System.out.println(\"NO\");\n }\n\n public static String nextLine() {\n return scanner.nextLine();\n }\n\n public static double distance(double x, double y, double x2, double y2) {\n return Math.sqrt((x2 - x) * (x2 - x) + (y2 - y) * (y2 - y));\n }\n\n public static int MOD = 1_000_000_007;\n public static int MAX = 100000;\n public static long[] fac = new long[MAX];\n public static long[] finv = new long[MAX];\n public static long[] inv = new long[MAX];\n\n public static void combinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++) {\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n }\n\n public static long combination(int n, int k) {\n if (n < k || n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n }\n\n public static long factorial(long n) {\n return n <= 0 ? 1 : n * factorial(n - 1);\n }\n}",
"public class Main {\n static Scanner scanner;\n static PrintWriter out;\n public static void main(String[] args) {\n scanner = new Scanner(System.in);\n out = new PrintWriter(System.out);\n\n char[] line = nextLine().toCharArray();\n\n char[] second = nextLine().toCharArray();\n int in = line.length - second.length;\n\n int min = Integer.MAX_VALUE;\n\n int in2 = second.length;\n\n for (int i = 0; i <= in; i++) {\n int a = 0;\n for (int j = 0; j < in2; j++) {\n if (line[j+i] != second[j]) {\n a++;\n }\n }\n if (min >= a) {\n min = a;\n }\n }\n System.out.println(min);\n\n out.flush();\n }\n\n public static void println(Object o) {\n out.println(o);\n }\n\n public static void print(Object o) {\n out.print(o);\n }\n\n public static void printf(String format, Object... o) {\n out.printf(format, o);\n }\n\n public static String next() {\n return scanner.next();\n }\n\n public static int nextInt() {\n return Integer.parseInt(scanner.next());\n }\n\n public static long nextLong() {\n return Long.parseLong(scanner.next());\n }\n\n public static double nextDouble() {\n return Double.parseDouble(scanner.next());\n }\n\n public static short nextShort() {\n return Short.parseShort(scanner.next());\n }\n\n public static float nextFloat() {\n return Float.parseFloat(scanner.next());\n }\n\n public static void printYes() {\n System.out.println(\"Yes\");\n }\n\n public static void printYES() {\n System.out.println(\"YES\");\n }\n\n public static void printNo() {\n System.out.println(\"No\");\n }\n\n public static void printNO() {\n System.out.println(\"NO\");\n }\n\n public static String nextLine() {\n return scanner.nextLine();\n }\n\n public static double distance(double x, double y, double x2, double y2) {\n return Math.sqrt((x2 - x) * (x2 - x) + (y2 - y) * (y2 - y));\n }\n\n public static int MOD = 1_000_000_007;\n public static int MAX = 100000;\n public static long[] fac = new long[MAX];\n public static long[] finv = new long[MAX];\n public static long[] inv = new long[MAX];\n\n public static void combinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++) {\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n }\n\n public static long combination(int n, int k) {\n if (n < k || n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n }\n\n public static long factorial(long n) {\n return n <= 0 ? 1 : n * factorial(n - 1);\n }\n}",
"Main"
]
|
import java.io.PrintWriter;
import java.util.*;
public class Main {
static Scanner scanner;
static PrintWriter out;
public static void main(String[] args) {
scanner = new Scanner(System.in);
out = new PrintWriter(System.out);
char[] line = nextLine().toCharArray();
char[] second = nextLine().toCharArray();
int in = line.length - second.length;
int min = Integer.MAX_VALUE;
int in2 = second.length;
for (int i = 0; i <= in; i++) {
int a = 0;
for (int j = 0; j < in2; j++) {
if (line[j+i] != second[j]) {
a++;
}
}
if (min >= a) {
min = a;
}
}
System.out.println(min);
out.flush();
}
public static void println(Object o) {
out.println(o);
}
public static void print(Object o) {
out.print(o);
}
public static void printf(String format, Object... o) {
out.printf(format, o);
}
public static String next() {
return scanner.next();
}
public static int nextInt() {
return Integer.parseInt(scanner.next());
}
public static long nextLong() {
return Long.parseLong(scanner.next());
}
public static double nextDouble() {
return Double.parseDouble(scanner.next());
}
public static short nextShort() {
return Short.parseShort(scanner.next());
}
public static float nextFloat() {
return Float.parseFloat(scanner.next());
}
public static void printYes() {
System.out.println("Yes");
}
public static void printYES() {
System.out.println("YES");
}
public static void printNo() {
System.out.println("No");
}
public static void printNO() {
System.out.println("NO");
}
public static String nextLine() {
return scanner.nextLine();
}
public static double distance(double x, double y, double x2, double y2) {
return Math.sqrt((x2 - x) * (x2 - x) + (y2 - y) * (y2 - y));
}
public static int MOD = 1_000_000_007;
public static int MAX = 100000;
public static long[] fac = new long[MAX];
public static long[] finv = new long[MAX];
public static long[] inv = new long[MAX];
public static void combinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
public static long combination(int n, int k) {
if (n < k || n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
public static long factorial(long n) {
return n <= 0 ? 1 : n * factorial(n - 1);
}
} |
[
7,
15,
13,
17,
6,
13,
41,
13,
20,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
2,
13,
13,
17,
30,
29,
13,
30,
29,
4,
13,
13,
2,
13,
13,
23,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
121,
5
],
[
121,
6
],
[
6,
7
],
[
6,
8
],
[
121,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
11,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
11,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
25,
26
],
[
11,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
29,
31
],
[
27,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
35,
36
],
[
36,
37
],
[
34,
38
],
[
38,
39
],
[
39,
40
],
[
27,
41
],
[
41,
42
],
[
42,
43
],
[
27,
44
],
[
45,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
48,
49
],
[
49,
50
],
[
45,
51
],
[
51,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
51,
56
],
[
56,
57
],
[
56,
58
],
[
58,
59
],
[
59,
60
],
[
51,
61
],
[
61,
62
],
[
62,
63
],
[
51,
64
],
[
65,
65
],
[
65,
66
],
[
66,
67
],
[
67,
68
],
[
68,
69
],
[
69,
70
],
[
68,
71
],
[
71,
72
],
[
71,
73
],
[
67,
74
],
[
74,
75
],
[
75,
76
],
[
74,
77
],
[
66,
78
],
[
78,
79
],
[
79,
80
],
[
45,
81
],
[
81,
82
],
[
81,
83
],
[
83,
84
],
[
84,
85
],
[
83,
86
],
[
83,
87
],
[
11,
88
],
[
88,
89
],
[
89,
90
],
[
90,
91
],
[
90,
92
],
[
88,
93
],
[
9,
94
],
[
94,
95
],
[
121,
96
],
[
96,
97
],
[
96,
98
],
[
98,
99
],
[
99,
100
],
[
100,
101
],
[
101,
102
],
[
101,
103
],
[
100,
104
],
[
99,
105
],
[
105,
106
],
[
106,
107
],
[
99,
108
],
[
108,
109
],
[
109,
110
],
[
110,
111
],
[
110,
112
],
[
110,
113
],
[
113,
114
],
[
113,
115
],
[
96,
116
],
[
116,
117
],
[
96,
118
],
[
118,
119
],
[
0,
120
],
[
120,
121
],
[
120,
122
]
]
| [
"import java.util.*;\n\npublic class Main {\n\tstatic Scanner scan = new Scanner(System.in);\n\t\n\tpublic static void main(String[] args) {\n\t\tString s = scan.next();\n\t\tString t = scan.next();\n\t\tint ans = t.length();\n\t\t\n\t\tfor(int i=0;i<=s.length()-t.length();i++) {\n\t\t\tint now_ans = t.length();\n\t\t\tfor(int j=0;j<t.length();j++) {\n\t\t\t\tif(s.charAt(i+j) == t.charAt(j)) {\n\t\t\t\t\tnow_ans--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans, now_ans);\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t\t\n\t\t\n\t\t\n\t}\n\t\n\t\n\tpublic static int gcd(int x,int y) {\n\t\tif(x%y == 0) {\n\t\t\treturn y;\n\t\t}else {\n\t\t\treturn gcd(y,x%y);\n\t\t}\n\t}\n}\n \n\n\n",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n\tstatic Scanner scan = new Scanner(System.in);\n\t\n\tpublic static void main(String[] args) {\n\t\tString s = scan.next();\n\t\tString t = scan.next();\n\t\tint ans = t.length();\n\t\t\n\t\tfor(int i=0;i<=s.length()-t.length();i++) {\n\t\t\tint now_ans = t.length();\n\t\t\tfor(int j=0;j<t.length();j++) {\n\t\t\t\tif(s.charAt(i+j) == t.charAt(j)) {\n\t\t\t\t\tnow_ans--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans, now_ans);\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t\t\n\t\t\n\t\t\n\t}\n\t\n\t\n\tpublic static int gcd(int x,int y) {\n\t\tif(x%y == 0) {\n\t\t\treturn y;\n\t\t}else {\n\t\t\treturn gcd(y,x%y);\n\t\t}\n\t}\n}",
"Main",
"static Scanner scan = new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"public static void main(String[] args) {\n\t\tString s = scan.next();\n\t\tString t = scan.next();\n\t\tint ans = t.length();\n\t\t\n\t\tfor(int i=0;i<=s.length()-t.length();i++) {\n\t\t\tint now_ans = t.length();\n\t\t\tfor(int j=0;j<t.length();j++) {\n\t\t\t\tif(s.charAt(i+j) == t.charAt(j)) {\n\t\t\t\t\tnow_ans--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans, now_ans);\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t\t\n\t\t\n\t\t\n\t}",
"main",
"{\n\t\tString s = scan.next();\n\t\tString t = scan.next();\n\t\tint ans = t.length();\n\t\t\n\t\tfor(int i=0;i<=s.length()-t.length();i++) {\n\t\t\tint now_ans = t.length();\n\t\t\tfor(int j=0;j<t.length();j++) {\n\t\t\t\tif(s.charAt(i+j) == t.charAt(j)) {\n\t\t\t\t\tnow_ans--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans, now_ans);\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t\t\n\t\t\n\t\t\n\t}",
"String s = scan.next();",
"s",
"scan.next()",
"scan.next",
"scan",
"String t = scan.next();",
"t",
"scan.next()",
"scan.next",
"scan",
"int ans = t.length();",
"ans",
"t.length()",
"t.length",
"t",
"for(int i=0;i<=s.length()-t.length();i++) {\n\t\t\tint now_ans = t.length();\n\t\t\tfor(int j=0;j<t.length();j++) {\n\t\t\t\tif(s.charAt(i+j) == t.charAt(j)) {\n\t\t\t\t\tnow_ans--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans, now_ans);\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<=s.length()-t.length()",
"i",
"s.length()-t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"i++",
"i++",
"i",
"{\n\t\t\tint now_ans = t.length();\n\t\t\tfor(int j=0;j<t.length();j++) {\n\t\t\t\tif(s.charAt(i+j) == t.charAt(j)) {\n\t\t\t\t\tnow_ans--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans, now_ans);\n\t\t}",
"{\n\t\t\tint now_ans = t.length();\n\t\t\tfor(int j=0;j<t.length();j++) {\n\t\t\t\tif(s.charAt(i+j) == t.charAt(j)) {\n\t\t\t\t\tnow_ans--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans, now_ans);\n\t\t}",
"int now_ans = t.length();",
"now_ans",
"t.length()",
"t.length",
"t",
"for(int j=0;j<t.length();j++) {\n\t\t\t\tif(s.charAt(i+j) == t.charAt(j)) {\n\t\t\t\t\tnow_ans--;\n\t\t\t\t}\n\t\t\t}",
"int j=0;",
"int j=0;",
"j",
"0",
"j<t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n\t\t\t\tif(s.charAt(i+j) == t.charAt(j)) {\n\t\t\t\t\tnow_ans--;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif(s.charAt(i+j) == t.charAt(j)) {\n\t\t\t\t\tnow_ans--;\n\t\t\t\t}\n\t\t\t}",
"if(s.charAt(i+j) == t.charAt(j)) {\n\t\t\t\t\tnow_ans--;\n\t\t\t\t}",
"s.charAt(i+j) == t.charAt(j)",
"s.charAt(i+j)",
"s.charAt",
"s",
"i+j",
"i",
"j",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"{\n\t\t\t\t\tnow_ans--;\n\t\t\t\t}",
"now_ans--",
"now_ans",
"ans = Math.min(ans, now_ans)",
"ans",
"Math.min(ans, now_ans)",
"Math.min",
"Math",
"ans",
"now_ans",
"System.out.println(ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"ans",
"String[] args",
"args",
"public static int gcd(int x,int y) {\n\t\tif(x%y == 0) {\n\t\t\treturn y;\n\t\t}else {\n\t\t\treturn gcd(y,x%y);\n\t\t}\n\t}",
"gcd",
"{\n\t\tif(x%y == 0) {\n\t\t\treturn y;\n\t\t}else {\n\t\t\treturn gcd(y,x%y);\n\t\t}\n\t}",
"if(x%y == 0) {\n\t\t\treturn y;\n\t\t}else {\n\t\t\treturn gcd(y,x%y);\n\t\t}",
"x%y == 0",
"x%y",
"x",
"y",
"0",
"{\n\t\t\treturn y;\n\t\t}",
"return y;",
"y",
"{\n\t\t\treturn gcd(y,x%y);\n\t\t}",
"return gcd(y,x%y);",
"gcd(y,x%y)",
"gcd",
"y",
"x%y",
"x",
"y",
"int x",
"x",
"int y",
"y",
"public class Main {\n\tstatic Scanner scan = new Scanner(System.in);\n\t\n\tpublic static void main(String[] args) {\n\t\tString s = scan.next();\n\t\tString t = scan.next();\n\t\tint ans = t.length();\n\t\t\n\t\tfor(int i=0;i<=s.length()-t.length();i++) {\n\t\t\tint now_ans = t.length();\n\t\t\tfor(int j=0;j<t.length();j++) {\n\t\t\t\tif(s.charAt(i+j) == t.charAt(j)) {\n\t\t\t\t\tnow_ans--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans, now_ans);\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t\t\n\t\t\n\t\t\n\t}\n\t\n\t\n\tpublic static int gcd(int x,int y) {\n\t\tif(x%y == 0) {\n\t\t\treturn y;\n\t\t}else {\n\t\t\treturn gcd(y,x%y);\n\t\t}\n\t}\n}",
"public class Main {\n\tstatic Scanner scan = new Scanner(System.in);\n\t\n\tpublic static void main(String[] args) {\n\t\tString s = scan.next();\n\t\tString t = scan.next();\n\t\tint ans = t.length();\n\t\t\n\t\tfor(int i=0;i<=s.length()-t.length();i++) {\n\t\t\tint now_ans = t.length();\n\t\t\tfor(int j=0;j<t.length();j++) {\n\t\t\t\tif(s.charAt(i+j) == t.charAt(j)) {\n\t\t\t\t\tnow_ans--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans, now_ans);\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t\t\n\t\t\n\t\t\n\t}\n\t\n\t\n\tpublic static int gcd(int x,int y) {\n\t\tif(x%y == 0) {\n\t\t\treturn y;\n\t\t}else {\n\t\t\treturn gcd(y,x%y);\n\t\t}\n\t}\n}",
"Main"
]
| import java.util.*;
public class Main {
static Scanner scan = new Scanner(System.in);
public static void main(String[] args) {
String s = scan.next();
String t = scan.next();
int ans = t.length();
for(int i=0;i<=s.length()-t.length();i++) {
int now_ans = t.length();
for(int j=0;j<t.length();j++) {
if(s.charAt(i+j) == t.charAt(j)) {
now_ans--;
}
}
ans = Math.min(ans, now_ans);
}
System.out.println(ans);
}
public static int gcd(int x,int y) {
if(x%y == 0) {
return y;
}else {
return gcd(y,x%y);
}
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
20,
12,
13,
30,
4,
13,
23,
13,
12,
13,
30,
41,
13,
4,
18,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
41,
13,
18,
13,
13,
41,
13,
18,
13,
13,
41,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
2,
13,
13,
17,
1,
40,
13,
30,
30,
41,
13,
17,
41,
13,
17,
11,
1,
41,
13,
13,
2,
13,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
13,
18,
13,
13,
40,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
29,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
230,
8
],
[
230,
9
],
[
9,
10
],
[
9,
11
],
[
230,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
12,
17
],
[
17,
18
],
[
230,
19
],
[
19,
20
],
[
19,
21
],
[
21,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
25,
26
],
[
26,
27
],
[
27,
28
],
[
21,
29
],
[
29,
30
],
[
29,
31
],
[
31,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
21,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
38,
40
],
[
21,
41
],
[
41,
42
],
[
41,
43
],
[
43,
44
],
[
43,
45
],
[
21,
46
],
[
46,
47
],
[
46,
48
],
[
21,
49
],
[
49,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
49,
54
],
[
54,
55
],
[
54,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
56,
60
],
[
49,
61
],
[
61,
62
],
[
62,
63
],
[
49,
64
],
[
65,
65
],
[
65,
66
],
[
66,
67
],
[
66,
68
],
[
65,
69
],
[
69,
70
],
[
69,
71
],
[
65,
72
],
[
72,
73
],
[
73,
74
],
[
74,
75
],
[
74,
76
],
[
72,
77
],
[
77,
78
],
[
77,
79
],
[
79,
80
],
[
79,
81
],
[
72,
82
],
[
82,
83
],
[
83,
84
],
[
72,
85
],
[
86,
86
],
[
86,
87
],
[
87,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
88,
92
],
[
92,
93
],
[
92,
94
],
[
87,
95
],
[
95,
96
],
[
86,
97
],
[
97,
98
],
[
65,
99
],
[
99,
100
],
[
99,
101
],
[
101,
102
],
[
102,
103
],
[
101,
104
],
[
101,
105
],
[
21,
106
],
[
106,
107
],
[
107,
108
],
[
108,
109
],
[
108,
110
],
[
106,
111
],
[
230,
112
],
[
112,
113
],
[
112,
114
],
[
114,
115
],
[
112,
116
],
[
116,
117
],
[
112,
118
],
[
118,
119
],
[
118,
120
],
[
120,
121
],
[
121,
122
],
[
121,
123
],
[
112,
124
],
[
124,
125
],
[
124,
126
],
[
126,
127
],
[
127,
128
],
[
128,
129
],
[
129,
130
],
[
129,
131
],
[
128,
132
],
[
132,
133
],
[
133,
134
],
[
134,
135
],
[
127,
136
],
[
136,
137
],
[
137,
138
],
[
138,
139
],
[
138,
140
],
[
140,
141
],
[
141,
142
],
[
142,
143
],
[
137,
144
],
[
144,
145
],
[
145,
146
],
[
145,
147
],
[
126,
148
],
[
148,
149
],
[
149,
150
],
[
150,
151
],
[
112,
152
],
[
152,
153
],
[
152,
154
],
[
154,
155
],
[
155,
156
],
[
156,
157
],
[
157,
158
],
[
156,
159
],
[
159,
160
],
[
112,
161
],
[
161,
162
],
[
161,
163
],
[
163,
164
],
[
164,
165
],
[
165,
166
],
[
166,
167
],
[
165,
168
],
[
168,
169
],
[
112,
170
],
[
170,
171
],
[
170,
172
],
[
172,
173
],
[
173,
174
],
[
174,
175
],
[
175,
176
],
[
174,
177
],
[
177,
178
],
[
112,
179
],
[
179,
180
],
[
179,
181
],
[
181,
182
],
[
182,
183
],
[
182,
184
],
[
181,
185
],
[
185,
186
],
[
186,
187
],
[
186,
188
],
[
188,
189
],
[
189,
190
],
[
190,
191
],
[
185,
192
],
[
192,
193
],
[
193,
194
],
[
193,
195
],
[
195,
196
],
[
196,
197
],
[
181,
198
],
[
198,
199
],
[
112,
200
],
[
200,
201
],
[
200,
202
],
[
202,
203
],
[
203,
204
],
[
203,
205
],
[
202,
207
],
[
207,
208
],
[
208,
209
],
[
209,
210
],
[
209,
211
],
[
207,
212
],
[
212,
213
],
[
212,
214
],
[
207,
215
],
[
215,
216
],
[
216,
217
],
[
207,
218
],
[
218,
219
],
[
219,
220
],
[
220,
221
],
[
220,
222
],
[
219,
223
],
[
223,
224
],
[
202,
225
],
[
225,
226
],
[
200,
227
],
[
227,
228
],
[
0,
229
],
[
229,
230
],
[
229,
231
]
]
| [
"\n\nimport java.util.*;\nimport java.io.*;\n\npublic class Main {\n\tstatic FastReader in = new FastReader();\n\n\tpublic static void main(String[] args) {\n\t\tsolve();\n\t}\n\n\tstatic void solve() {\n\t\tchar[] s = in.nextLine().toCharArray();\n\t\tchar[] t = in.nextLine().toCharArray();\n\t\t\n\t\t\n\t\tint n = s.length;\n\t\tint n2 = t.length;\n\t\t\n\t\tint min = n2;\n\t\tfor(int i = 0; i < n - n2 + 1; i++)\n\t\t{\n\t\t\tint curr = 0;\n\t\t\tint count = 0;\n\t\t\tfor(int j = i; j < i + n2; j++)\n\t\t\t{\n\t\t\t\tif(s[j] != t[count]) curr++;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tmin = Math.min(curr, min);\n\t\t}\n\t\t\n\t\tSystem.out.println(min);\n\t}\n\n\tstatic class FastReader {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastReader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\n\t\tint[] readarr(int abc) {\n\t\t\tint[] a = new int[abc];\n\t\t\tfor (int i = 0; i < abc; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\t}\n}\n\n\n",
"import java.util.*;",
"util.*",
"java",
"import java.io.*;",
"io.*",
"java",
"public class Main {\n\tstatic FastReader in = new FastReader();\n\n\tpublic static void main(String[] args) {\n\t\tsolve();\n\t}\n\n\tstatic void solve() {\n\t\tchar[] s = in.nextLine().toCharArray();\n\t\tchar[] t = in.nextLine().toCharArray();\n\t\t\n\t\t\n\t\tint n = s.length;\n\t\tint n2 = t.length;\n\t\t\n\t\tint min = n2;\n\t\tfor(int i = 0; i < n - n2 + 1; i++)\n\t\t{\n\t\t\tint curr = 0;\n\t\t\tint count = 0;\n\t\t\tfor(int j = i; j < i + n2; j++)\n\t\t\t{\n\t\t\t\tif(s[j] != t[count]) curr++;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tmin = Math.min(curr, min);\n\t\t}\n\t\t\n\t\tSystem.out.println(min);\n\t}\n\n\tstatic class FastReader {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastReader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\n\t\tint[] readarr(int abc) {\n\t\t\tint[] a = new int[abc];\n\t\t\tfor (int i = 0; i < abc; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\t}\n}",
"Main",
"static FastReader in = new FastReader();",
"in",
"new FastReader()",
"public static void main(String[] args) {\n\t\tsolve();\n\t}",
"main",
"{\n\t\tsolve();\n\t}",
"solve()",
"solve",
"String[] args",
"args",
"static void solve() {\n\t\tchar[] s = in.nextLine().toCharArray();\n\t\tchar[] t = in.nextLine().toCharArray();\n\t\t\n\t\t\n\t\tint n = s.length;\n\t\tint n2 = t.length;\n\t\t\n\t\tint min = n2;\n\t\tfor(int i = 0; i < n - n2 + 1; i++)\n\t\t{\n\t\t\tint curr = 0;\n\t\t\tint count = 0;\n\t\t\tfor(int j = i; j < i + n2; j++)\n\t\t\t{\n\t\t\t\tif(s[j] != t[count]) curr++;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tmin = Math.min(curr, min);\n\t\t}\n\t\t\n\t\tSystem.out.println(min);\n\t}",
"solve",
"{\n\t\tchar[] s = in.nextLine().toCharArray();\n\t\tchar[] t = in.nextLine().toCharArray();\n\t\t\n\t\t\n\t\tint n = s.length;\n\t\tint n2 = t.length;\n\t\t\n\t\tint min = n2;\n\t\tfor(int i = 0; i < n - n2 + 1; i++)\n\t\t{\n\t\t\tint curr = 0;\n\t\t\tint count = 0;\n\t\t\tfor(int j = i; j < i + n2; j++)\n\t\t\t{\n\t\t\t\tif(s[j] != t[count]) curr++;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tmin = Math.min(curr, min);\n\t\t}\n\t\t\n\t\tSystem.out.println(min);\n\t}",
"char[] s = in.nextLine().toCharArray();",
"s",
"in.nextLine().toCharArray()",
"in.nextLine().toCharArray",
"in.nextLine()",
"in.nextLine",
"in",
"char[] t = in.nextLine().toCharArray();",
"t",
"in.nextLine().toCharArray()",
"in.nextLine().toCharArray",
"in.nextLine()",
"in.nextLine",
"in",
"int n = s.length;",
"n",
"s.length",
"s",
"s.length",
"int n2 = t.length;",
"n2",
"t.length",
"t",
"t.length",
"int min = n2;",
"min",
"n2",
"for(int i = 0; i < n - n2 + 1; i++)\n\t\t{\n\t\t\tint curr = 0;\n\t\t\tint count = 0;\n\t\t\tfor(int j = i; j < i + n2; j++)\n\t\t\t{\n\t\t\t\tif(s[j] != t[count]) curr++;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tmin = Math.min(curr, min);\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n - n2 + 1",
"i",
"n - n2 + 1",
"n - n2",
"n",
"n2",
"1",
"i++",
"i++",
"i",
"{\n\t\t\tint curr = 0;\n\t\t\tint count = 0;\n\t\t\tfor(int j = i; j < i + n2; j++)\n\t\t\t{\n\t\t\t\tif(s[j] != t[count]) curr++;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tmin = Math.min(curr, min);\n\t\t}",
"{\n\t\t\tint curr = 0;\n\t\t\tint count = 0;\n\t\t\tfor(int j = i; j < i + n2; j++)\n\t\t\t{\n\t\t\t\tif(s[j] != t[count]) curr++;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tmin = Math.min(curr, min);\n\t\t}",
"int curr = 0;",
"curr",
"0",
"int count = 0;",
"count",
"0",
"for(int j = i; j < i + n2; j++)\n\t\t\t{\n\t\t\t\tif(s[j] != t[count]) curr++;\n\t\t\t\tcount++;\n\t\t\t}",
"int j = i;",
"int j = i;",
"j",
"i",
"j < i + n2",
"j",
"i + n2",
"i",
"n2",
"j++",
"j++",
"j",
"{\n\t\t\t\tif(s[j] != t[count]) curr++;\n\t\t\t\tcount++;\n\t\t\t}",
"{\n\t\t\t\tif(s[j] != t[count]) curr++;\n\t\t\t\tcount++;\n\t\t\t}",
"if(s[j] != t[count]) curr++;",
"s[j] != t[count]",
"s[j]",
"s",
"j",
"t[count]",
"t",
"count",
"curr++",
"curr",
"count++",
"count",
"min = Math.min(curr, min)",
"min",
"Math.min(curr, min)",
"Math.min",
"Math",
"curr",
"min",
"System.out.println(min)",
"System.out.println",
"System.out",
"System",
"System.out",
"min",
"static class FastReader {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastReader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\n\t\tint[] readarr(int abc) {\n\t\t\tint[] a = new int[abc];\n\t\t\tfor (int i = 0; i < abc; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\t}",
"FastReader",
"BufferedReader br;",
"br",
"StringTokenizer st;",
"st",
"public FastReader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}",
"FastReader",
"{\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}",
"br = new BufferedReader(new InputStreamReader(System.in))",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"String next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}",
"next",
"{\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}",
"while (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}",
"st == null || !st.hasMoreElements()",
"st == null",
"st",
"null",
"!st.hasMoreElements()",
"st.hasMoreElements()",
"st.hasMoreElements",
"st",
"{\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}",
"try {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}",
"catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}",
"IOException e",
"{\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t}",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}",
"nextInt",
"{\n\t\t\treturn Integer.parseInt(next());\n\t\t}",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}",
"nextLong",
"{\n\t\t\treturn Long.parseLong(next());\n\t\t}",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}",
"nextDouble",
"{\n\t\t\treturn Double.parseDouble(next());\n\t\t}",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"String nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}",
"nextLine",
"{\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}",
"String str = \"\";",
"str",
"\"\"",
"try {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}",
"catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}",
"IOException e",
"{\n\t\t\t\te.printStackTrace();\n\t\t\t}",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n\t\t\t\tstr = br.readLine();\n\t\t\t}",
"str = br.readLine()",
"str",
"br.readLine()",
"br.readLine",
"br",
"return str;",
"str",
"int[] readarr(int abc) {\n\t\t\tint[] a = new int[abc];\n\t\t\tfor (int i = 0; i < abc; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}",
"readarr",
"{\n\t\t\tint[] a = new int[abc];\n\t\t\tfor (int i = 0; i < abc; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}",
"int[] a = new int[abc];",
"a",
"new int[abc]",
"abc",
"for (int i = 0; i < abc; i++)\n\t\t\t\ta[i] = nextInt();",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < abc",
"i",
"abc",
"i++",
"i++",
"i",
"a[i] = nextInt();",
"a[i] = nextInt()",
"a[i]",
"a",
"i",
"nextInt()",
"nextInt",
"return a;",
"a",
"int abc",
"abc",
"public class Main {\n\tstatic FastReader in = new FastReader();\n\n\tpublic static void main(String[] args) {\n\t\tsolve();\n\t}\n\n\tstatic void solve() {\n\t\tchar[] s = in.nextLine().toCharArray();\n\t\tchar[] t = in.nextLine().toCharArray();\n\t\t\n\t\t\n\t\tint n = s.length;\n\t\tint n2 = t.length;\n\t\t\n\t\tint min = n2;\n\t\tfor(int i = 0; i < n - n2 + 1; i++)\n\t\t{\n\t\t\tint curr = 0;\n\t\t\tint count = 0;\n\t\t\tfor(int j = i; j < i + n2; j++)\n\t\t\t{\n\t\t\t\tif(s[j] != t[count]) curr++;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tmin = Math.min(curr, min);\n\t\t}\n\t\t\n\t\tSystem.out.println(min);\n\t}\n\n\tstatic class FastReader {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastReader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\n\t\tint[] readarr(int abc) {\n\t\t\tint[] a = new int[abc];\n\t\t\tfor (int i = 0; i < abc; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\t}\n}",
"public class Main {\n\tstatic FastReader in = new FastReader();\n\n\tpublic static void main(String[] args) {\n\t\tsolve();\n\t}\n\n\tstatic void solve() {\n\t\tchar[] s = in.nextLine().toCharArray();\n\t\tchar[] t = in.nextLine().toCharArray();\n\t\t\n\t\t\n\t\tint n = s.length;\n\t\tint n2 = t.length;\n\t\t\n\t\tint min = n2;\n\t\tfor(int i = 0; i < n - n2 + 1; i++)\n\t\t{\n\t\t\tint curr = 0;\n\t\t\tint count = 0;\n\t\t\tfor(int j = i; j < i + n2; j++)\n\t\t\t{\n\t\t\t\tif(s[j] != t[count]) curr++;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tmin = Math.min(curr, min);\n\t\t}\n\t\t\n\t\tSystem.out.println(min);\n\t}\n\n\tstatic class FastReader {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastReader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\n\t\tint[] readarr(int abc) {\n\t\t\tint[] a = new int[abc];\n\t\t\tfor (int i = 0; i < abc; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\t}\n}",
"Main"
]
|
import java.util.*;
import java.io.*;
public class Main {
static FastReader in = new FastReader();
public static void main(String[] args) {
solve();
}
static void solve() {
char[] s = in.nextLine().toCharArray();
char[] t = in.nextLine().toCharArray();
int n = s.length;
int n2 = t.length;
int min = n2;
for(int i = 0; i < n - n2 + 1; i++)
{
int curr = 0;
int count = 0;
for(int j = i; j < i + n2; j++)
{
if(s[j] != t[count]) curr++;
count++;
}
min = Math.min(curr, min);
}
System.out.println(min);
}
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
int[] readarr(int abc) {
int[] a = new int[abc];
for (int i = 0; i < abc; i++)
a[i] = nextInt();
return a;
}
}
}
|
[
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,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
4,
13,
13,
4,
18,
18,
13,
13,
2,
4,
18,
13,
13,
23,
13,
12,
13,
30,
41,
13,
4,
18,
13,
13,
2,
13,
4,
18,
13,
4,
13,
13,
23,
13,
12,
13,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
30,
40,
13,
14,
2,
13,
13,
30,
0,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
127,
5
],
[
127,
6
],
[
6,
7
],
[
127,
8
],
[
8,
9
],
[
127,
10
],
[
10,
11
],
[
10,
12
],
[
127,
13
],
[
13,
14
],
[
13,
15
],
[
15,
16
],
[
16,
17
],
[
16,
18
],
[
15,
19
],
[
19,
20
],
[
19,
21
],
[
21,
22
],
[
22,
23
],
[
15,
24
],
[
24,
25
],
[
24,
26
],
[
26,
27
],
[
27,
28
],
[
15,
29
],
[
29,
30
],
[
30,
31
],
[
31,
32
],
[
31,
33
],
[
29,
34
],
[
34,
35
],
[
34,
36
],
[
36,
37
],
[
37,
38
],
[
38,
39
],
[
36,
40
],
[
40,
41
],
[
41,
42
],
[
29,
43
],
[
43,
44
],
[
44,
45
],
[
29,
46
],
[
47,
47
],
[
47,
48
],
[
48,
49
],
[
48,
50
],
[
15,
51
],
[
51,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
51,
56
],
[
56,
57
],
[
57,
58
],
[
58,
59
],
[
56,
60
],
[
13,
61
],
[
61,
62
],
[
127,
63
],
[
63,
64
],
[
63,
65
],
[
65,
66
],
[
66,
67
],
[
66,
68
],
[
68,
69
],
[
69,
70
],
[
68,
71
],
[
68,
72
],
[
72,
73
],
[
72,
74
],
[
74,
75
],
[
75,
76
],
[
65,
77
],
[
77,
78
],
[
77,
79
],
[
63,
80
],
[
80,
81
],
[
127,
82
],
[
82,
83
],
[
82,
84
],
[
84,
85
],
[
85,
86
],
[
85,
87
],
[
84,
88
],
[
88,
89
],
[
89,
90
],
[
90,
91
],
[
90,
92
],
[
88,
93
],
[
93,
94
],
[
93,
95
],
[
95,
96
],
[
96,
97
],
[
88,
98
],
[
98,
99
],
[
99,
100
],
[
88,
101
],
[
102,
102
],
[
102,
103
],
[
103,
104
],
[
104,
105
],
[
105,
106
],
[
106,
107
],
[
105,
108
],
[
104,
109
],
[
109,
110
],
[
110,
111
],
[
109,
112
],
[
103,
113
],
[
113,
114
],
[
114,
115
],
[
84,
116
],
[
116,
117
],
[
117,
118
],
[
117,
119
],
[
116,
120
],
[
120,
121
],
[
121,
122
],
[
121,
123
],
[
82,
124
],
[
124,
125
],
[
0,
126
],
[
126,
127
],
[
126,
128
]
]
| [
"import java.util.*;\n\npublic class Main {\n public static String mainString;\n public static String subString;\n public static int maxLength = 0;\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n mainString = sc.nextLine();\n subString = sc.nextLine();\n\n for (int i = 0; i <= mainString.length() - subString.length(); i++) {\n loop(i);\n }\n\n System.out.println(subString.length() - maxLength);\n }\n\n public static void loop(int start) {\n String ms = mainString.substring(start, start + subString.length());\n check(ms);\n }\n\n public static void check(String ms) {\n int count = 0;\n for (int i = 0; i < subString.length(); i++) {\n if (ms.charAt(i) == subString.charAt(i)) {\n count++;\n }\n }\n if (maxLength < count) {\n maxLength = count;\n }\n }\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n public static String mainString;\n public static String subString;\n public static int maxLength = 0;\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n mainString = sc.nextLine();\n subString = sc.nextLine();\n\n for (int i = 0; i <= mainString.length() - subString.length(); i++) {\n loop(i);\n }\n\n System.out.println(subString.length() - maxLength);\n }\n\n public static void loop(int start) {\n String ms = mainString.substring(start, start + subString.length());\n check(ms);\n }\n\n public static void check(String ms) {\n int count = 0;\n for (int i = 0; i < subString.length(); i++) {\n if (ms.charAt(i) == subString.charAt(i)) {\n count++;\n }\n }\n if (maxLength < count) {\n maxLength = count;\n }\n }\n}",
"Main",
"public static String mainString;",
"mainString",
"public static String subString;",
"subString",
"public static int maxLength = 0;",
"maxLength",
"0",
"public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n mainString = sc.nextLine();\n subString = sc.nextLine();\n\n for (int i = 0; i <= mainString.length() - subString.length(); i++) {\n loop(i);\n }\n\n System.out.println(subString.length() - maxLength);\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n mainString = sc.nextLine();\n subString = sc.nextLine();\n\n for (int i = 0; i <= mainString.length() - subString.length(); i++) {\n loop(i);\n }\n\n System.out.println(subString.length() - maxLength);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"mainString = sc.nextLine()",
"mainString",
"sc.nextLine()",
"sc.nextLine",
"sc",
"subString = sc.nextLine()",
"subString",
"sc.nextLine()",
"sc.nextLine",
"sc",
"for (int i = 0; i <= mainString.length() - subString.length(); i++) {\n loop(i);\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= mainString.length() - subString.length()",
"i",
"mainString.length() - subString.length()",
"mainString.length()",
"mainString.length",
"mainString",
"subString.length()",
"subString.length",
"subString",
"i++",
"i++",
"i",
"{\n loop(i);\n }",
"{\n loop(i);\n }",
"loop(i)",
"loop",
"i",
"System.out.println(subString.length() - maxLength)",
"System.out.println",
"System.out",
"System",
"System.out",
"subString.length() - maxLength",
"subString.length()",
"subString.length",
"subString",
"maxLength",
"String[] args",
"args",
"public static void loop(int start) {\n String ms = mainString.substring(start, start + subString.length());\n check(ms);\n }",
"loop",
"{\n String ms = mainString.substring(start, start + subString.length());\n check(ms);\n }",
"String ms = mainString.substring(start, start + subString.length());",
"ms",
"mainString.substring(start, start + subString.length())",
"mainString.substring",
"mainString",
"start",
"start + subString.length()",
"start",
"subString.length()",
"subString.length",
"subString",
"check(ms)",
"check",
"ms",
"int start",
"start",
"public static void check(String ms) {\n int count = 0;\n for (int i = 0; i < subString.length(); i++) {\n if (ms.charAt(i) == subString.charAt(i)) {\n count++;\n }\n }\n if (maxLength < count) {\n maxLength = count;\n }\n }",
"check",
"{\n int count = 0;\n for (int i = 0; i < subString.length(); i++) {\n if (ms.charAt(i) == subString.charAt(i)) {\n count++;\n }\n }\n if (maxLength < count) {\n maxLength = count;\n }\n }",
"int count = 0;",
"count",
"0",
"for (int i = 0; i < subString.length(); i++) {\n if (ms.charAt(i) == subString.charAt(i)) {\n count++;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < subString.length()",
"i",
"subString.length()",
"subString.length",
"subString",
"i++",
"i++",
"i",
"{\n if (ms.charAt(i) == subString.charAt(i)) {\n count++;\n }\n }",
"{\n if (ms.charAt(i) == subString.charAt(i)) {\n count++;\n }\n }",
"if (ms.charAt(i) == subString.charAt(i)) {\n count++;\n }",
"ms.charAt(i) == subString.charAt(i)",
"ms.charAt(i)",
"ms.charAt",
"ms",
"i",
"subString.charAt(i)",
"subString.charAt",
"subString",
"i",
"{\n count++;\n }",
"count++",
"count",
"if (maxLength < count) {\n maxLength = count;\n }",
"maxLength < count",
"maxLength",
"count",
"{\n maxLength = count;\n }",
"maxLength = count",
"maxLength",
"count",
"String ms",
"ms",
"public class Main {\n public static String mainString;\n public static String subString;\n public static int maxLength = 0;\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n mainString = sc.nextLine();\n subString = sc.nextLine();\n\n for (int i = 0; i <= mainString.length() - subString.length(); i++) {\n loop(i);\n }\n\n System.out.println(subString.length() - maxLength);\n }\n\n public static void loop(int start) {\n String ms = mainString.substring(start, start + subString.length());\n check(ms);\n }\n\n public static void check(String ms) {\n int count = 0;\n for (int i = 0; i < subString.length(); i++) {\n if (ms.charAt(i) == subString.charAt(i)) {\n count++;\n }\n }\n if (maxLength < count) {\n maxLength = count;\n }\n }\n}",
"public class Main {\n public static String mainString;\n public static String subString;\n public static int maxLength = 0;\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n mainString = sc.nextLine();\n subString = sc.nextLine();\n\n for (int i = 0; i <= mainString.length() - subString.length(); i++) {\n loop(i);\n }\n\n System.out.println(subString.length() - maxLength);\n }\n\n public static void loop(int start) {\n String ms = mainString.substring(start, start + subString.length());\n check(ms);\n }\n\n public static void check(String ms) {\n int count = 0;\n for (int i = 0; i < subString.length(); i++) {\n if (ms.charAt(i) == subString.charAt(i)) {\n count++;\n }\n }\n if (maxLength < count) {\n maxLength = count;\n }\n }\n}",
"Main"
]
| import java.util.*;
public class Main {
public static String mainString;
public static String subString;
public static int maxLength = 0;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
mainString = sc.nextLine();
subString = sc.nextLine();
for (int i = 0; i <= mainString.length() - subString.length(); i++) {
loop(i);
}
System.out.println(subString.length() - maxLength);
}
public static void loop(int start) {
String ms = mainString.substring(start, start + subString.length());
check(ms);
}
public static void check(String ms) {
int count = 0;
for (int i = 0; i < subString.length(); i++) {
if (ms.charAt(i) == subString.charAt(i)) {
count++;
}
}
if (maxLength < count) {
maxLength = count;
}
}
} |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
20,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
4,
18,
13,
4,
18,
13,
13,
2,
13,
4,
18,
13,
41,
13,
17,
28,
13,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
30,
0,
13,
17,
14,
2,
13,
13,
30,
9,
14,
2,
13,
13,
30,
0,
13,
13,
4,
18,
18,
13,
13,
2,
4,
18,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
126,
8
],
[
126,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
11,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
11,
20
],
[
20,
21
],
[
20,
22
],
[
22,
23
],
[
23,
24
],
[
11,
25
],
[
25,
26
],
[
25,
27
],
[
11,
28
],
[
28,
29
],
[
29,
30
],
[
30,
31
],
[
30,
32
],
[
28,
33
],
[
33,
34
],
[
33,
35
],
[
35,
36
],
[
36,
37
],
[
37,
38
],
[
35,
39
],
[
39,
40
],
[
40,
41
],
[
28,
42
],
[
42,
43
],
[
43,
44
],
[
28,
45
],
[
46,
46
],
[
46,
47
],
[
47,
48
],
[
48,
49
],
[
47,
50
],
[
50,
51
],
[
51,
52
],
[
50,
53
],
[
50,
54
],
[
54,
55
],
[
54,
56
],
[
56,
57
],
[
57,
58
],
[
11,
59
],
[
59,
60
],
[
59,
61
],
[
11,
62
],
[
62,
63
],
[
62,
64
],
[
62,
65
],
[
66,
66
],
[
66,
67
],
[
67,
68
],
[
67,
69
],
[
66,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
70,
75
],
[
75,
76
],
[
75,
77
],
[
77,
78
],
[
78,
79
],
[
70,
80
],
[
80,
81
],
[
81,
82
],
[
70,
83
],
[
84,
84
],
[
84,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
88,
89
],
[
87,
90
],
[
86,
91
],
[
91,
92
],
[
92,
93
],
[
91,
94
],
[
85,
95
],
[
95,
96
],
[
96,
97
],
[
96,
98
],
[
95,
99
],
[
99,
100
],
[
100,
101
],
[
100,
102
],
[
99,
103
],
[
103,
104
],
[
84,
105
],
[
105,
106
],
[
106,
107
],
[
106,
108
],
[
105,
109
],
[
109,
110
],
[
110,
111
],
[
110,
112
],
[
11,
113
],
[
113,
114
],
[
114,
115
],
[
115,
116
],
[
115,
117
],
[
113,
118
],
[
118,
119
],
[
119,
120
],
[
120,
121
],
[
118,
122
],
[
9,
123
],
[
123,
124
],
[
0,
125
],
[
125,
126
],
[
125,
127
]
]
| [
"import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n String s = scanner.next();\n String t = scanner.next();\n\n ArrayList<String> aL = new ArrayList<>();\n\n for (int i = 0; i <= s.length() - t.length(); i++) {\n aL.add(s.substring(i, i + t.length()));\n }\n\n int ir = 0;\n\n for (String a : aL) {\n int c = 0;\n for (int i = 0; i < t.length(); i++) {\n if (a.charAt(i) == t.charAt(i)) {\n c += 1;\n if (ir > c) {\n continue;\n }\n }\n if (ir < c) {\n ir = c;\n }\n }\n }\n\n System.out.println(t.length() - ir);\n }\n}",
"import java.util.ArrayList;",
"ArrayList",
"java.util",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n String s = scanner.next();\n String t = scanner.next();\n\n ArrayList<String> aL = new ArrayList<>();\n\n for (int i = 0; i <= s.length() - t.length(); i++) {\n aL.add(s.substring(i, i + t.length()));\n }\n\n int ir = 0;\n\n for (String a : aL) {\n int c = 0;\n for (int i = 0; i < t.length(); i++) {\n if (a.charAt(i) == t.charAt(i)) {\n c += 1;\n if (ir > c) {\n continue;\n }\n }\n if (ir < c) {\n ir = c;\n }\n }\n }\n\n System.out.println(t.length() - ir);\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n String s = scanner.next();\n String t = scanner.next();\n\n ArrayList<String> aL = new ArrayList<>();\n\n for (int i = 0; i <= s.length() - t.length(); i++) {\n aL.add(s.substring(i, i + t.length()));\n }\n\n int ir = 0;\n\n for (String a : aL) {\n int c = 0;\n for (int i = 0; i < t.length(); i++) {\n if (a.charAt(i) == t.charAt(i)) {\n c += 1;\n if (ir > c) {\n continue;\n }\n }\n if (ir < c) {\n ir = c;\n }\n }\n }\n\n System.out.println(t.length() - ir);\n }",
"main",
"{\n Scanner scanner = new Scanner(System.in);\n String s = scanner.next();\n String t = scanner.next();\n\n ArrayList<String> aL = new ArrayList<>();\n\n for (int i = 0; i <= s.length() - t.length(); i++) {\n aL.add(s.substring(i, i + t.length()));\n }\n\n int ir = 0;\n\n for (String a : aL) {\n int c = 0;\n for (int i = 0; i < t.length(); i++) {\n if (a.charAt(i) == t.charAt(i)) {\n c += 1;\n if (ir > c) {\n continue;\n }\n }\n if (ir < c) {\n ir = c;\n }\n }\n }\n\n System.out.println(t.length() - ir);\n }",
"Scanner scanner = new Scanner(System.in);",
"scanner",
"new Scanner(System.in)",
"String s = scanner.next();",
"s",
"scanner.next()",
"scanner.next",
"scanner",
"String t = scanner.next();",
"t",
"scanner.next()",
"scanner.next",
"scanner",
"ArrayList<String> aL = new ArrayList<>();",
"aL",
"new ArrayList<>()",
"for (int i = 0; i <= s.length() - t.length(); i++) {\n aL.add(s.substring(i, i + t.length()));\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= s.length() - t.length()",
"i",
"s.length() - t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"i++",
"i++",
"i",
"{\n aL.add(s.substring(i, i + t.length()));\n }",
"{\n aL.add(s.substring(i, i + t.length()));\n }",
"aL.add(s.substring(i, i + t.length()))",
"aL.add",
"aL",
"s.substring(i, i + t.length())",
"s.substring",
"s",
"i",
"i + t.length()",
"i",
"t.length()",
"t.length",
"t",
"int ir = 0;",
"ir",
"0",
"for (String a : aL) {\n int c = 0;\n for (int i = 0; i < t.length(); i++) {\n if (a.charAt(i) == t.charAt(i)) {\n c += 1;\n if (ir > c) {\n continue;\n }\n }\n if (ir < c) {\n ir = c;\n }\n }\n }",
"String a",
"aL",
"{\n int c = 0;\n for (int i = 0; i < t.length(); i++) {\n if (a.charAt(i) == t.charAt(i)) {\n c += 1;\n if (ir > c) {\n continue;\n }\n }\n if (ir < c) {\n ir = c;\n }\n }\n }",
"{\n int c = 0;\n for (int i = 0; i < t.length(); i++) {\n if (a.charAt(i) == t.charAt(i)) {\n c += 1;\n if (ir > c) {\n continue;\n }\n }\n if (ir < c) {\n ir = c;\n }\n }\n }",
"int c = 0;",
"c",
"0",
"for (int i = 0; i < t.length(); i++) {\n if (a.charAt(i) == t.charAt(i)) {\n c += 1;\n if (ir > c) {\n continue;\n }\n }\n if (ir < c) {\n ir = c;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < t.length()",
"i",
"t.length()",
"t.length",
"t",
"i++",
"i++",
"i",
"{\n if (a.charAt(i) == t.charAt(i)) {\n c += 1;\n if (ir > c) {\n continue;\n }\n }\n if (ir < c) {\n ir = c;\n }\n }",
"{\n if (a.charAt(i) == t.charAt(i)) {\n c += 1;\n if (ir > c) {\n continue;\n }\n }\n if (ir < c) {\n ir = c;\n }\n }",
"if (a.charAt(i) == t.charAt(i)) {\n c += 1;\n if (ir > c) {\n continue;\n }\n }",
"a.charAt(i) == t.charAt(i)",
"a.charAt(i)",
"a.charAt",
"a",
"i",
"t.charAt(i)",
"t.charAt",
"t",
"i",
"{\n c += 1;\n if (ir > c) {\n continue;\n }\n }",
"c += 1",
"c",
"1",
"if (ir > c) {\n continue;\n }",
"ir > c",
"ir",
"c",
"{\n continue;\n }",
"continue;",
"if (ir < c) {\n ir = c;\n }",
"ir < c",
"ir",
"c",
"{\n ir = c;\n }",
"ir = c",
"ir",
"c",
"System.out.println(t.length() - ir)",
"System.out.println",
"System.out",
"System",
"System.out",
"t.length() - ir",
"t.length()",
"t.length",
"t",
"ir",
"String[] args",
"args",
"public class Main {\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n String s = scanner.next();\n String t = scanner.next();\n\n ArrayList<String> aL = new ArrayList<>();\n\n for (int i = 0; i <= s.length() - t.length(); i++) {\n aL.add(s.substring(i, i + t.length()));\n }\n\n int ir = 0;\n\n for (String a : aL) {\n int c = 0;\n for (int i = 0; i < t.length(); i++) {\n if (a.charAt(i) == t.charAt(i)) {\n c += 1;\n if (ir > c) {\n continue;\n }\n }\n if (ir < c) {\n ir = c;\n }\n }\n }\n\n System.out.println(t.length() - ir);\n }\n}",
"public class Main {\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n String s = scanner.next();\n String t = scanner.next();\n\n ArrayList<String> aL = new ArrayList<>();\n\n for (int i = 0; i <= s.length() - t.length(); i++) {\n aL.add(s.substring(i, i + t.length()));\n }\n\n int ir = 0;\n\n for (String a : aL) {\n int c = 0;\n for (int i = 0; i < t.length(); i++) {\n if (a.charAt(i) == t.charAt(i)) {\n c += 1;\n if (ir > c) {\n continue;\n }\n }\n if (ir < c) {\n ir = c;\n }\n }\n }\n\n System.out.println(t.length() - ir);\n }\n}",
"Main"
]
| import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String s = scanner.next();
String t = scanner.next();
ArrayList<String> aL = new ArrayList<>();
for (int i = 0; i <= s.length() - t.length(); i++) {
aL.add(s.substring(i, i + t.length()));
}
int ir = 0;
for (String a : aL) {
int c = 0;
for (int i = 0; i < t.length(); i++) {
if (a.charAt(i) == t.charAt(i)) {
c += 1;
if (ir > c) {
continue;
}
}
if (ir < c) {
ir = c;
}
}
}
System.out.println(t.length() - ir);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
2,
4,
18,
13,
4,
18,
13,
17,
1,
40,
13,
30,
30,
41,
13,
17,
41,
13,
4,
18,
13,
13,
2,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
30,
40,
13,
14,
2,
13,
13,
30,
0,
13,
13,
4,
18,
18,
13,
13,
2,
4,
18,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
109,
5
],
[
109,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
8,
25
],
[
25,
26
],
[
26,
27
],
[
27,
28
],
[
27,
29
],
[
25,
30
],
[
30,
31
],
[
30,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
35,
36
],
[
33,
37
],
[
37,
38
],
[
38,
39
],
[
32,
40
],
[
25,
41
],
[
41,
42
],
[
42,
43
],
[
25,
44
],
[
45,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
45,
49
],
[
49,
50
],
[
49,
51
],
[
51,
52
],
[
52,
53
],
[
51,
54
],
[
51,
55
],
[
55,
56
],
[
55,
57
],
[
57,
58
],
[
58,
59
],
[
45,
60
],
[
60,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
60,
65
],
[
65,
66
],
[
65,
67
],
[
67,
68
],
[
68,
69
],
[
60,
70
],
[
70,
71
],
[
71,
72
],
[
60,
73
],
[
74,
74
],
[
74,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
78,
79
],
[
77,
80
],
[
76,
81
],
[
81,
82
],
[
82,
83
],
[
81,
84
],
[
75,
85
],
[
85,
86
],
[
86,
87
],
[
45,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
88,
92
],
[
92,
93
],
[
93,
94
],
[
93,
95
],
[
8,
96
],
[
96,
97
],
[
97,
98
],
[
98,
99
],
[
98,
100
],
[
96,
101
],
[
101,
102
],
[
102,
103
],
[
103,
104
],
[
101,
105
],
[
6,
106
],
[
106,
107
],
[
0,
108
],
[
108,
109
],
[
108,
110
]
]
| [
"import java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.next();\n String T = sc.next();\n int max = 0;\n for (int i = 0;i < S.length()-T.length()+1 ; i++){\n int cnt = 0;\n String test = S.substring(i,i+T.length());\n for (int ind = 0; ind<T.length();ind++){\n if (test.charAt(ind)==T.charAt(ind)){\n cnt++;\n }\n }\n if (max<cnt){\n max=cnt;\n }\n }\n System.out.println(T.length()-max);\n }\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.next();\n String T = sc.next();\n int max = 0;\n for (int i = 0;i < S.length()-T.length()+1 ; i++){\n int cnt = 0;\n String test = S.substring(i,i+T.length());\n for (int ind = 0; ind<T.length();ind++){\n if (test.charAt(ind)==T.charAt(ind)){\n cnt++;\n }\n }\n if (max<cnt){\n max=cnt;\n }\n }\n System.out.println(T.length()-max);\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.next();\n String T = sc.next();\n int max = 0;\n for (int i = 0;i < S.length()-T.length()+1 ; i++){\n int cnt = 0;\n String test = S.substring(i,i+T.length());\n for (int ind = 0; ind<T.length();ind++){\n if (test.charAt(ind)==T.charAt(ind)){\n cnt++;\n }\n }\n if (max<cnt){\n max=cnt;\n }\n }\n System.out.println(T.length()-max);\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n String S = sc.next();\n String T = sc.next();\n int max = 0;\n for (int i = 0;i < S.length()-T.length()+1 ; i++){\n int cnt = 0;\n String test = S.substring(i,i+T.length());\n for (int ind = 0; ind<T.length();ind++){\n if (test.charAt(ind)==T.charAt(ind)){\n cnt++;\n }\n }\n if (max<cnt){\n max=cnt;\n }\n }\n System.out.println(T.length()-max);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String S = sc.next();",
"S",
"sc.next()",
"sc.next",
"sc",
"String T = sc.next();",
"T",
"sc.next()",
"sc.next",
"sc",
"int max = 0;",
"max",
"0",
"for (int i = 0;i < S.length()-T.length()+1 ; i++){\n int cnt = 0;\n String test = S.substring(i,i+T.length());\n for (int ind = 0; ind<T.length();ind++){\n if (test.charAt(ind)==T.charAt(ind)){\n cnt++;\n }\n }\n if (max<cnt){\n max=cnt;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < S.length()-T.length()+1",
"i",
"S.length()-T.length()+1",
"S.length()-T.length()",
"S.length()",
"S.length",
"S",
"T.length()",
"T.length",
"T",
"1",
"i++",
"i++",
"i",
"{\n int cnt = 0;\n String test = S.substring(i,i+T.length());\n for (int ind = 0; ind<T.length();ind++){\n if (test.charAt(ind)==T.charAt(ind)){\n cnt++;\n }\n }\n if (max<cnt){\n max=cnt;\n }\n }",
"{\n int cnt = 0;\n String test = S.substring(i,i+T.length());\n for (int ind = 0; ind<T.length();ind++){\n if (test.charAt(ind)==T.charAt(ind)){\n cnt++;\n }\n }\n if (max<cnt){\n max=cnt;\n }\n }",
"int cnt = 0;",
"cnt",
"0",
"String test = S.substring(i,i+T.length());",
"test",
"S.substring(i,i+T.length())",
"S.substring",
"S",
"i",
"i+T.length()",
"i",
"T.length()",
"T.length",
"T",
"for (int ind = 0; ind<T.length();ind++){\n if (test.charAt(ind)==T.charAt(ind)){\n cnt++;\n }\n }",
"int ind = 0;",
"int ind = 0;",
"ind",
"0",
"ind<T.length()",
"ind",
"T.length()",
"T.length",
"T",
"ind++",
"ind++",
"ind",
"{\n if (test.charAt(ind)==T.charAt(ind)){\n cnt++;\n }\n }",
"{\n if (test.charAt(ind)==T.charAt(ind)){\n cnt++;\n }\n }",
"if (test.charAt(ind)==T.charAt(ind)){\n cnt++;\n }",
"test.charAt(ind)==T.charAt(ind)",
"test.charAt(ind)",
"test.charAt",
"test",
"ind",
"T.charAt(ind)",
"T.charAt",
"T",
"ind",
"{\n cnt++;\n }",
"cnt++",
"cnt",
"if (max<cnt){\n max=cnt;\n }",
"max<cnt",
"max",
"cnt",
"{\n max=cnt;\n }",
"max=cnt",
"max",
"cnt",
"System.out.println(T.length()-max)",
"System.out.println",
"System.out",
"System",
"System.out",
"T.length()-max",
"T.length()",
"T.length",
"T",
"max",
"String[] args",
"args",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.next();\n String T = sc.next();\n int max = 0;\n for (int i = 0;i < S.length()-T.length()+1 ; i++){\n int cnt = 0;\n String test = S.substring(i,i+T.length());\n for (int ind = 0; ind<T.length();ind++){\n if (test.charAt(ind)==T.charAt(ind)){\n cnt++;\n }\n }\n if (max<cnt){\n max=cnt;\n }\n }\n System.out.println(T.length()-max);\n }\n}",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.next();\n String T = sc.next();\n int max = 0;\n for (int i = 0;i < S.length()-T.length()+1 ; i++){\n int cnt = 0;\n String test = S.substring(i,i+T.length());\n for (int ind = 0; ind<T.length();ind++){\n if (test.charAt(ind)==T.charAt(ind)){\n cnt++;\n }\n }\n if (max<cnt){\n max=cnt;\n }\n }\n System.out.println(T.length()-max);\n }\n}",
"Main"
]
| import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String S = sc.next();
String T = sc.next();
int max = 0;
for (int i = 0;i < S.length()-T.length()+1 ; i++){
int cnt = 0;
String test = S.substring(i,i+T.length());
for (int ind = 0; ind<T.length();ind++){
if (test.charAt(ind)==T.charAt(ind)){
cnt++;
}
}
if (max<cnt){
max=cnt;
}
}
System.out.println(T.length()-max);
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
17,
14,
2,
2,
13,
4,
18,
13,
4,
18,
13,
3,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
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
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
24,
26
],
[
8,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
29,
31
],
[
27,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
35,
36
],
[
27,
37
],
[
37,
38
],
[
38,
39
],
[
27,
40
],
[
41,
41
],
[
41,
42
],
[
42,
43
],
[
42,
44
],
[
41,
45
],
[
45,
46
],
[
46,
47
],
[
47,
48
],
[
47,
49
],
[
49,
50
],
[
50,
51
],
[
46,
52
],
[
52,
53
],
[
53,
54
],
[
45,
55
],
[
41,
56
],
[
56,
57
],
[
57,
58
],
[
58,
59
],
[
58,
60
],
[
56,
61
],
[
61,
62
],
[
61,
63
],
[
63,
64
],
[
64,
65
],
[
56,
66
],
[
66,
67
],
[
67,
68
],
[
56,
69
],
[
70,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
74,
75
],
[
73,
76
],
[
76,
77
],
[
76,
78
],
[
72,
79
],
[
79,
80
],
[
80,
81
],
[
79,
82
],
[
71,
83
],
[
83,
84
],
[
41,
85
],
[
85,
86
],
[
85,
87
],
[
87,
88
],
[
88,
89
],
[
87,
90
],
[
87,
91
],
[
8,
92
],
[
92,
93
],
[
93,
94
],
[
8,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
97,
99
],
[
95,
100
],
[
6,
101
],
[
101,
102
],
[
0,
103
],
[
103,
104
],
[
103,
105
]
]
| [
"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String s = sc.next(), t = sc.next();\n long min_different = Long.MAX_VALUE;\n for (int i = 0; i < s.length(); i++) {\n long diff = 0;\n if (i + t.length() > s.length())\n break;\n for (int j = 0; j < t.length(); j++) {\n if (s.charAt(i + j) != t.charAt(j))\n diff++;\n }\n min_different = Math.min(min_different, diff);\n }\n\n sc.close();\n System.out.println(min_different);\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String s = sc.next(), t = sc.next();\n long min_different = Long.MAX_VALUE;\n for (int i = 0; i < s.length(); i++) {\n long diff = 0;\n if (i + t.length() > s.length())\n break;\n for (int j = 0; j < t.length(); j++) {\n if (s.charAt(i + j) != t.charAt(j))\n diff++;\n }\n min_different = Math.min(min_different, diff);\n }\n\n sc.close();\n System.out.println(min_different);\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String s = sc.next(), t = sc.next();\n long min_different = Long.MAX_VALUE;\n for (int i = 0; i < s.length(); i++) {\n long diff = 0;\n if (i + t.length() > s.length())\n break;\n for (int j = 0; j < t.length(); j++) {\n if (s.charAt(i + j) != t.charAt(j))\n diff++;\n }\n min_different = Math.min(min_different, diff);\n }\n\n sc.close();\n System.out.println(min_different);\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n String s = sc.next(), t = sc.next();\n long min_different = Long.MAX_VALUE;\n for (int i = 0; i < s.length(); i++) {\n long diff = 0;\n if (i + t.length() > s.length())\n break;\n for (int j = 0; j < t.length(); j++) {\n if (s.charAt(i + j) != t.charAt(j))\n diff++;\n }\n min_different = Math.min(min_different, diff);\n }\n\n sc.close();\n System.out.println(min_different);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String s = sc.next()",
"s",
"sc.next()",
"sc.next",
"sc",
"t = sc.next();",
"t",
"sc.next()",
"sc.next",
"sc",
"long min_different = Long.MAX_VALUE;",
"min_different",
"Long.MAX_VALUE",
"Long",
"Long.MAX_VALUE",
"for (int i = 0; i < s.length(); i++) {\n long diff = 0;\n if (i + t.length() > s.length())\n break;\n for (int j = 0; j < t.length(); j++) {\n if (s.charAt(i + j) != t.charAt(j))\n diff++;\n }\n min_different = Math.min(min_different, diff);\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < s.length()",
"i",
"s.length()",
"s.length",
"s",
"i++",
"i++",
"i",
"{\n long diff = 0;\n if (i + t.length() > s.length())\n break;\n for (int j = 0; j < t.length(); j++) {\n if (s.charAt(i + j) != t.charAt(j))\n diff++;\n }\n min_different = Math.min(min_different, diff);\n }",
"{\n long diff = 0;\n if (i + t.length() > s.length())\n break;\n for (int j = 0; j < t.length(); j++) {\n if (s.charAt(i + j) != t.charAt(j))\n diff++;\n }\n min_different = Math.min(min_different, diff);\n }",
"long diff = 0;",
"diff",
"0",
"if (i + t.length() > s.length())\n break;",
"i + t.length() > s.length()",
"i + t.length()",
"i",
"t.length()",
"t.length",
"t",
"s.length()",
"s.length",
"s",
"break;",
"for (int j = 0; j < t.length(); j++) {\n if (s.charAt(i + j) != t.charAt(j))\n diff++;\n }",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n if (s.charAt(i + j) != t.charAt(j))\n diff++;\n }",
"{\n if (s.charAt(i + j) != t.charAt(j))\n diff++;\n }",
"if (s.charAt(i + j) != t.charAt(j))\n diff++;",
"s.charAt(i + j) != t.charAt(j)",
"s.charAt(i + j)",
"s.charAt",
"s",
"i + j",
"i",
"j",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"diff++",
"diff",
"min_different = Math.min(min_different, diff)",
"min_different",
"Math.min(min_different, diff)",
"Math.min",
"Math",
"min_different",
"diff",
"sc.close()",
"sc.close",
"sc",
"System.out.println(min_different)",
"System.out.println",
"System.out",
"System",
"System.out",
"min_different",
"String[] args",
"args",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String s = sc.next(), t = sc.next();\n long min_different = Long.MAX_VALUE;\n for (int i = 0; i < s.length(); i++) {\n long diff = 0;\n if (i + t.length() > s.length())\n break;\n for (int j = 0; j < t.length(); j++) {\n if (s.charAt(i + j) != t.charAt(j))\n diff++;\n }\n min_different = Math.min(min_different, diff);\n }\n\n sc.close();\n System.out.println(min_different);\n }\n}",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String s = sc.next(), t = sc.next();\n long min_different = Long.MAX_VALUE;\n for (int i = 0; i < s.length(); i++) {\n long diff = 0;\n if (i + t.length() > s.length())\n break;\n for (int j = 0; j < t.length(); j++) {\n if (s.charAt(i + j) != t.charAt(j))\n diff++;\n }\n min_different = Math.min(min_different, diff);\n }\n\n sc.close();\n System.out.println(min_different);\n }\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next(), t = sc.next();
long min_different = Long.MAX_VALUE;
for (int i = 0; i < s.length(); i++) {
long diff = 0;
if (i + t.length() > s.length())
break;
for (int j = 0; j < t.length(); j++) {
if (s.charAt(i + j) != t.charAt(j))
diff++;
}
min_different = Math.min(min_different, diff);
}
sc.close();
System.out.println(min_different);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
40,
17,
14,
4,
18,
13,
13,
30,
4,
18,
18,
13,
13,
17,
30,
11,
1,
41,
13,
4,
18,
13,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
2,
13,
4,
18,
13,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
2,
4,
18,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
118,
5
],
[
118,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
8,
26
],
[
26,
27
],
[
27,
28
],
[
28,
29
],
[
27,
30
],
[
26,
31
],
[
31,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
34,
36
],
[
32,
37
],
[
26,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
41,
42
],
[
41,
43
],
[
43,
44
],
[
44,
45
],
[
39,
46
],
[
46,
47
],
[
46,
48
],
[
48,
49
],
[
49,
50
],
[
39,
51
],
[
51,
52
],
[
52,
53
],
[
39,
54
],
[
55,
55
],
[
55,
56
],
[
56,
57
],
[
56,
58
],
[
58,
59
],
[
59,
60
],
[
58,
61
],
[
61,
62
],
[
61,
63
],
[
63,
64
],
[
64,
65
],
[
58,
66
],
[
55,
67
],
[
67,
68
],
[
67,
69
],
[
55,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
70,
75
],
[
75,
76
],
[
75,
77
],
[
77,
78
],
[
78,
79
],
[
70,
80
],
[
80,
81
],
[
81,
82
],
[
70,
83
],
[
84,
84
],
[
84,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
88,
89
],
[
87,
90
],
[
86,
91
],
[
91,
92
],
[
92,
93
],
[
91,
94
],
[
85,
95
],
[
95,
96
],
[
96,
97
],
[
55,
98
],
[
98,
99
],
[
98,
100
],
[
100,
101
],
[
101,
102
],
[
100,
103
],
[
100,
104
],
[
38,
105
],
[
105,
106
],
[
106,
107
],
[
107,
108
],
[
107,
109
],
[
105,
110
],
[
110,
111
],
[
111,
112
],
[
112,
113
],
[
110,
114
],
[
6,
115
],
[
115,
116
],
[
0,
117
],
[
117,
118
],
[
117,
119
]
]
| [
"import java.util.Scanner;\n\n\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\t\tint min = -1;\n\n\t\tif (S.equals(T)) {\n\t\t\tSystem.out.println(0);\n\t\t}else {\n\t\t\tfor (int i = T.length(); i <= S.length(); i++) {\n\t\t\t\tString string = S.substring(i - T.length(),i);\n\t\t\t\tint let = 0;\n\t\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\t\tif (string.charAt(j) == T.charAt(j)) {\n\t\t\t\t\t\tlet++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.max(min, let);\n\t\t\t}\n\n\t\t\tSystem.out.println(T.length() - min);\n\t\t}\n\t}\n\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\t\tint min = -1;\n\n\t\tif (S.equals(T)) {\n\t\t\tSystem.out.println(0);\n\t\t}else {\n\t\t\tfor (int i = T.length(); i <= S.length(); i++) {\n\t\t\t\tString string = S.substring(i - T.length(),i);\n\t\t\t\tint let = 0;\n\t\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\t\tif (string.charAt(j) == T.charAt(j)) {\n\t\t\t\t\t\tlet++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.max(min, let);\n\t\t\t}\n\n\t\t\tSystem.out.println(T.length() - min);\n\t\t}\n\t}\n\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\t\tint min = -1;\n\n\t\tif (S.equals(T)) {\n\t\t\tSystem.out.println(0);\n\t\t}else {\n\t\t\tfor (int i = T.length(); i <= S.length(); i++) {\n\t\t\t\tString string = S.substring(i - T.length(),i);\n\t\t\t\tint let = 0;\n\t\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\t\tif (string.charAt(j) == T.charAt(j)) {\n\t\t\t\t\t\tlet++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.max(min, let);\n\t\t\t}\n\n\t\t\tSystem.out.println(T.length() - min);\n\t\t}\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\t\tint min = -1;\n\n\t\tif (S.equals(T)) {\n\t\t\tSystem.out.println(0);\n\t\t}else {\n\t\t\tfor (int i = T.length(); i <= S.length(); i++) {\n\t\t\t\tString string = S.substring(i - T.length(),i);\n\t\t\t\tint let = 0;\n\t\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\t\tif (string.charAt(j) == T.charAt(j)) {\n\t\t\t\t\t\tlet++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.max(min, let);\n\t\t\t}\n\n\t\t\tSystem.out.println(T.length() - min);\n\t\t}\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String S = sc.next();",
"S",
"sc.next()",
"sc.next",
"sc",
"String T = sc.next();",
"T",
"sc.next()",
"sc.next",
"sc",
"int min = -1;",
"min",
"-1",
"1",
"if (S.equals(T)) {\n\t\t\tSystem.out.println(0);\n\t\t}else {\n\t\t\tfor (int i = T.length(); i <= S.length(); i++) {\n\t\t\t\tString string = S.substring(i - T.length(),i);\n\t\t\t\tint let = 0;\n\t\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\t\tif (string.charAt(j) == T.charAt(j)) {\n\t\t\t\t\t\tlet++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.max(min, let);\n\t\t\t}\n\n\t\t\tSystem.out.println(T.length() - min);\n\t\t}",
"S.equals(T)",
"S.equals",
"S",
"T",
"{\n\t\t\tSystem.out.println(0);\n\t\t}",
"System.out.println(0)",
"System.out.println",
"System.out",
"System",
"System.out",
"0",
"{\n\t\t\tfor (int i = T.length(); i <= S.length(); i++) {\n\t\t\t\tString string = S.substring(i - T.length(),i);\n\t\t\t\tint let = 0;\n\t\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\t\tif (string.charAt(j) == T.charAt(j)) {\n\t\t\t\t\t\tlet++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.max(min, let);\n\t\t\t}\n\n\t\t\tSystem.out.println(T.length() - min);\n\t\t}",
"for (int i = T.length(); i <= S.length(); i++) {\n\t\t\t\tString string = S.substring(i - T.length(),i);\n\t\t\t\tint let = 0;\n\t\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\t\tif (string.charAt(j) == T.charAt(j)) {\n\t\t\t\t\t\tlet++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.max(min, let);\n\t\t\t}",
"int i = T.length();",
"int i = T.length();",
"i",
"T.length()",
"T.length",
"T",
"i <= S.length()",
"i",
"S.length()",
"S.length",
"S",
"i++",
"i++",
"i",
"{\n\t\t\t\tString string = S.substring(i - T.length(),i);\n\t\t\t\tint let = 0;\n\t\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\t\tif (string.charAt(j) == T.charAt(j)) {\n\t\t\t\t\t\tlet++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.max(min, let);\n\t\t\t}",
"{\n\t\t\t\tString string = S.substring(i - T.length(),i);\n\t\t\t\tint let = 0;\n\t\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\t\tif (string.charAt(j) == T.charAt(j)) {\n\t\t\t\t\t\tlet++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.max(min, let);\n\t\t\t}",
"String string = S.substring(i - T.length(),i);",
"string",
"S.substring(i - T.length(),i)",
"S.substring",
"S",
"i - T.length()",
"i",
"T.length()",
"T.length",
"T",
"i",
"int let = 0;",
"let",
"0",
"for (int j = 0; j < T.length(); j++) {\n\t\t\t\t\tif (string.charAt(j) == T.charAt(j)) {\n\t\t\t\t\t\tlet++;\n\t\t\t\t\t}\n\t\t\t\t}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < T.length()",
"j",
"T.length()",
"T.length",
"T",
"j++",
"j++",
"j",
"{\n\t\t\t\t\tif (string.charAt(j) == T.charAt(j)) {\n\t\t\t\t\t\tlet++;\n\t\t\t\t\t}\n\t\t\t\t}",
"{\n\t\t\t\t\tif (string.charAt(j) == T.charAt(j)) {\n\t\t\t\t\t\tlet++;\n\t\t\t\t\t}\n\t\t\t\t}",
"if (string.charAt(j) == T.charAt(j)) {\n\t\t\t\t\t\tlet++;\n\t\t\t\t\t}",
"string.charAt(j) == T.charAt(j)",
"string.charAt(j)",
"string.charAt",
"string",
"j",
"T.charAt(j)",
"T.charAt",
"T",
"j",
"{\n\t\t\t\t\t\tlet++;\n\t\t\t\t\t}",
"let++",
"let",
"min = Math.max(min, let)",
"min",
"Math.max(min, let)",
"Math.max",
"Math",
"min",
"let",
"System.out.println(T.length() - min)",
"System.out.println",
"System.out",
"System",
"System.out",
"T.length() - min",
"T.length()",
"T.length",
"T",
"min",
"String[] args",
"args",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\t\tint min = -1;\n\n\t\tif (S.equals(T)) {\n\t\t\tSystem.out.println(0);\n\t\t}else {\n\t\t\tfor (int i = T.length(); i <= S.length(); i++) {\n\t\t\t\tString string = S.substring(i - T.length(),i);\n\t\t\t\tint let = 0;\n\t\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\t\tif (string.charAt(j) == T.charAt(j)) {\n\t\t\t\t\t\tlet++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.max(min, let);\n\t\t\t}\n\n\t\t\tSystem.out.println(T.length() - min);\n\t\t}\n\t}\n\n}",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\t\tint min = -1;\n\n\t\tif (S.equals(T)) {\n\t\t\tSystem.out.println(0);\n\t\t}else {\n\t\t\tfor (int i = T.length(); i <= S.length(); i++) {\n\t\t\t\tString string = S.substring(i - T.length(),i);\n\t\t\t\tint let = 0;\n\t\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\t\tif (string.charAt(j) == T.charAt(j)) {\n\t\t\t\t\t\tlet++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.max(min, let);\n\t\t\t}\n\n\t\t\tSystem.out.println(T.length() - min);\n\t\t}\n\t}\n\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String S = sc.next();
String T = sc.next();
int min = -1;
if (S.equals(T)) {
System.out.println(0);
}else {
for (int i = T.length(); i <= S.length(); i++) {
String string = S.substring(i - T.length(),i);
int let = 0;
for (int j = 0; j < T.length(); j++) {
if (string.charAt(j) == T.charAt(j)) {
let++;
}
}
min = Math.max(min, let);
}
System.out.println(T.length() - min);
}
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
18,
13,
13,
18,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
2,
13,
13,
18,
13,
13,
30,
40,
13,
14,
2,
13,
13,
30,
3,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
107,
5
],
[
107,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
25,
26
],
[
8,
27
],
[
27,
28
],
[
27,
29
],
[
29,
30
],
[
30,
31
],
[
8,
32
],
[
32,
33
],
[
32,
34
],
[
8,
35
],
[
35,
36
],
[
36,
37
],
[
37,
38
],
[
37,
39
],
[
35,
40
],
[
40,
41
],
[
40,
42
],
[
42,
43
],
[
43,
44
],
[
43,
45
],
[
42,
46
],
[
46,
47
],
[
46,
48
],
[
35,
49
],
[
49,
50
],
[
50,
51
],
[
35,
52
],
[
53,
53
],
[
53,
54
],
[
54,
55
],
[
54,
56
],
[
53,
57
],
[
57,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
57,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
64,
66
],
[
57,
67
],
[
67,
68
],
[
68,
69
],
[
57,
70
],
[
71,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
74,
75
],
[
74,
76
],
[
76,
77
],
[
76,
78
],
[
73,
79
],
[
79,
80
],
[
79,
81
],
[
72,
82
],
[
82,
83
],
[
83,
84
],
[
71,
85
],
[
85,
86
],
[
86,
87
],
[
86,
88
],
[
85,
89
],
[
89,
90
],
[
53,
91
],
[
91,
92
],
[
91,
93
],
[
93,
94
],
[
94,
95
],
[
93,
96
],
[
93,
97
],
[
8,
98
],
[
98,
99
],
[
99,
100
],
[
100,
101
],
[
100,
102
],
[
98,
103
],
[
6,
104
],
[
104,
105
],
[
0,
106
],
[
106,
107
],
[
106,
108
]
]
| [
"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tString S = stdIn.nextLine();\n\t\tString T = stdIn.nextLine();\n\t\t\n\t\tchar[] s = S.toCharArray();\n\t\tchar[] t = T.toCharArray();\n\t\t\n\t\tint minCount = 1000;\n\t\t\n\t\tfor(int i = 0; i <= s.length - t.length; i ++) {\n\t\t\tint counter = 0;\n\t\t\tfor(int j = 0; j < t.length; j ++) {\n\t\t\t\tif(s[i + j] != t[j]) {\n\t\t\t\t\tcounter ++;\n\t\t\t\t}\n\t\t\t\tif(minCount <= counter) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tminCount = Math.min(minCount, counter);\n\t\t}\n\t\t\n\t\tSystem.out.println(minCount);\n\t}\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tString S = stdIn.nextLine();\n\t\tString T = stdIn.nextLine();\n\t\t\n\t\tchar[] s = S.toCharArray();\n\t\tchar[] t = T.toCharArray();\n\t\t\n\t\tint minCount = 1000;\n\t\t\n\t\tfor(int i = 0; i <= s.length - t.length; i ++) {\n\t\t\tint counter = 0;\n\t\t\tfor(int j = 0; j < t.length; j ++) {\n\t\t\t\tif(s[i + j] != t[j]) {\n\t\t\t\t\tcounter ++;\n\t\t\t\t}\n\t\t\t\tif(minCount <= counter) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tminCount = Math.min(minCount, counter);\n\t\t}\n\t\t\n\t\tSystem.out.println(minCount);\n\t}\n}",
"Main",
"public static void main(String args[]) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tString S = stdIn.nextLine();\n\t\tString T = stdIn.nextLine();\n\t\t\n\t\tchar[] s = S.toCharArray();\n\t\tchar[] t = T.toCharArray();\n\t\t\n\t\tint minCount = 1000;\n\t\t\n\t\tfor(int i = 0; i <= s.length - t.length; i ++) {\n\t\t\tint counter = 0;\n\t\t\tfor(int j = 0; j < t.length; j ++) {\n\t\t\t\tif(s[i + j] != t[j]) {\n\t\t\t\t\tcounter ++;\n\t\t\t\t}\n\t\t\t\tif(minCount <= counter) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tminCount = Math.min(minCount, counter);\n\t\t}\n\t\t\n\t\tSystem.out.println(minCount);\n\t}",
"main",
"{\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tString S = stdIn.nextLine();\n\t\tString T = stdIn.nextLine();\n\t\t\n\t\tchar[] s = S.toCharArray();\n\t\tchar[] t = T.toCharArray();\n\t\t\n\t\tint minCount = 1000;\n\t\t\n\t\tfor(int i = 0; i <= s.length - t.length; i ++) {\n\t\t\tint counter = 0;\n\t\t\tfor(int j = 0; j < t.length; j ++) {\n\t\t\t\tif(s[i + j] != t[j]) {\n\t\t\t\t\tcounter ++;\n\t\t\t\t}\n\t\t\t\tif(minCount <= counter) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tminCount = Math.min(minCount, counter);\n\t\t}\n\t\t\n\t\tSystem.out.println(minCount);\n\t}",
"Scanner stdIn = new Scanner(System.in);",
"stdIn",
"new Scanner(System.in)",
"String S = stdIn.nextLine();",
"S",
"stdIn.nextLine()",
"stdIn.nextLine",
"stdIn",
"String T = stdIn.nextLine();",
"T",
"stdIn.nextLine()",
"stdIn.nextLine",
"stdIn",
"char[] s = S.toCharArray();",
"s",
"S.toCharArray()",
"S.toCharArray",
"S",
"char[] t = T.toCharArray();",
"t",
"T.toCharArray()",
"T.toCharArray",
"T",
"int minCount = 1000;",
"minCount",
"1000",
"for(int i = 0; i <= s.length - t.length; i ++) {\n\t\t\tint counter = 0;\n\t\t\tfor(int j = 0; j < t.length; j ++) {\n\t\t\t\tif(s[i + j] != t[j]) {\n\t\t\t\t\tcounter ++;\n\t\t\t\t}\n\t\t\t\tif(minCount <= counter) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tminCount = Math.min(minCount, counter);\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= s.length - t.length",
"i",
"s.length - t.length",
"s.length",
"s",
"s.length",
"t.length",
"t",
"t.length",
"i ++",
"i ++",
"i",
"{\n\t\t\tint counter = 0;\n\t\t\tfor(int j = 0; j < t.length; j ++) {\n\t\t\t\tif(s[i + j] != t[j]) {\n\t\t\t\t\tcounter ++;\n\t\t\t\t}\n\t\t\t\tif(minCount <= counter) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tminCount = Math.min(minCount, counter);\n\t\t}",
"{\n\t\t\tint counter = 0;\n\t\t\tfor(int j = 0; j < t.length; j ++) {\n\t\t\t\tif(s[i + j] != t[j]) {\n\t\t\t\t\tcounter ++;\n\t\t\t\t}\n\t\t\t\tif(minCount <= counter) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tminCount = Math.min(minCount, counter);\n\t\t}",
"int counter = 0;",
"counter",
"0",
"for(int j = 0; j < t.length; j ++) {\n\t\t\t\tif(s[i + j] != t[j]) {\n\t\t\t\t\tcounter ++;\n\t\t\t\t}\n\t\t\t\tif(minCount <= counter) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < t.length",
"j",
"t.length",
"t",
"t.length",
"j ++",
"j ++",
"j",
"{\n\t\t\t\tif(s[i + j] != t[j]) {\n\t\t\t\t\tcounter ++;\n\t\t\t\t}\n\t\t\t\tif(minCount <= counter) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif(s[i + j] != t[j]) {\n\t\t\t\t\tcounter ++;\n\t\t\t\t}\n\t\t\t\tif(minCount <= counter) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}",
"if(s[i + j] != t[j]) {\n\t\t\t\t\tcounter ++;\n\t\t\t\t}",
"s[i + j] != t[j]",
"s[i + j]",
"s",
"i + j",
"i",
"j",
"t[j]",
"t",
"j",
"{\n\t\t\t\t\tcounter ++;\n\t\t\t\t}",
"counter ++",
"counter",
"if(minCount <= counter) {\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"minCount <= counter",
"minCount",
"counter",
"{\n\t\t\t\t\tbreak;\n\t\t\t\t}",
"break;",
"minCount = Math.min(minCount, counter)",
"minCount",
"Math.min(minCount, counter)",
"Math.min",
"Math",
"minCount",
"counter",
"System.out.println(minCount)",
"System.out.println",
"System.out",
"System",
"System.out",
"minCount",
"String args[]",
"args",
"public class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tString S = stdIn.nextLine();\n\t\tString T = stdIn.nextLine();\n\t\t\n\t\tchar[] s = S.toCharArray();\n\t\tchar[] t = T.toCharArray();\n\t\t\n\t\tint minCount = 1000;\n\t\t\n\t\tfor(int i = 0; i <= s.length - t.length; i ++) {\n\t\t\tint counter = 0;\n\t\t\tfor(int j = 0; j < t.length; j ++) {\n\t\t\t\tif(s[i + j] != t[j]) {\n\t\t\t\t\tcounter ++;\n\t\t\t\t}\n\t\t\t\tif(minCount <= counter) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tminCount = Math.min(minCount, counter);\n\t\t}\n\t\t\n\t\tSystem.out.println(minCount);\n\t}\n}",
"public class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tString S = stdIn.nextLine();\n\t\tString T = stdIn.nextLine();\n\t\t\n\t\tchar[] s = S.toCharArray();\n\t\tchar[] t = T.toCharArray();\n\t\t\n\t\tint minCount = 1000;\n\t\t\n\t\tfor(int i = 0; i <= s.length - t.length; i ++) {\n\t\t\tint counter = 0;\n\t\t\tfor(int j = 0; j < t.length; j ++) {\n\t\t\t\tif(s[i + j] != t[j]) {\n\t\t\t\t\tcounter ++;\n\t\t\t\t}\n\t\t\t\tif(minCount <= counter) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tminCount = Math.min(minCount, counter);\n\t\t}\n\t\t\n\t\tSystem.out.println(minCount);\n\t}\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner stdIn = new Scanner(System.in);
String S = stdIn.nextLine();
String T = stdIn.nextLine();
char[] s = S.toCharArray();
char[] t = T.toCharArray();
int minCount = 1000;
for(int i = 0; i <= s.length - t.length; i ++) {
int counter = 0;
for(int j = 0; j < t.length; j ++) {
if(s[i + j] != t[j]) {
counter ++;
}
if(minCount <= counter) {
break;
}
}
minCount = Math.min(minCount, counter);
}
System.out.println(minCount);
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
4,
18,
18,
13,
13,
4,
13,
13,
13,
23,
13,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
2,
13,
13,
17,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
2,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
29,
13,
23,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
113,
5
],
[
113,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
23,
24
],
[
24,
25
],
[
24,
26
],
[
22,
27
],
[
27,
28
],
[
27,
29
],
[
27,
30
],
[
6,
31
],
[
31,
32
],
[
113,
33
],
[
33,
34
],
[
33,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
35,
41
],
[
41,
42
],
[
41,
43
],
[
43,
44
],
[
44,
45
],
[
35,
46
],
[
46,
47
],
[
46,
48
],
[
48,
49
],
[
48,
50
],
[
35,
51
],
[
51,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
51,
56
],
[
56,
57
],
[
56,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
58,
62
],
[
51,
63
],
[
63,
64
],
[
64,
65
],
[
51,
66
],
[
67,
67
],
[
67,
68
],
[
68,
69
],
[
68,
70
],
[
67,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
73,
75
],
[
71,
76
],
[
76,
77
],
[
76,
78
],
[
71,
79
],
[
79,
80
],
[
80,
81
],
[
71,
82
],
[
83,
83
],
[
83,
84
],
[
84,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
86,
89
],
[
85,
90
],
[
90,
91
],
[
91,
92
],
[
90,
93
],
[
93,
94
],
[
93,
95
],
[
84,
96
],
[
96,
97
],
[
97,
98
],
[
67,
99
],
[
99,
100
],
[
99,
101
],
[
101,
102
],
[
102,
103
],
[
101,
104
],
[
101,
105
],
[
35,
106
],
[
106,
107
],
[
33,
108
],
[
108,
109
],
[
33,
110
],
[
110,
111
],
[
0,
112
],
[
112,
113
],
[
112,
114
]
]
| [
"import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n System.out.println(minimumChar(t, s));\n }\n\n static int minimumChar(String S1, String S2) {\n int n = S1.length();\n int m = S2.length();\n int ans = Integer.MAX_VALUE;\n for (int i = 0; i < m - n + 1; i++) {\n int minRemovedChar = 0;\n for (int j = 0; j < n; j++) {\n if (S1.charAt(j) != S2.charAt(i + j)) {\n minRemovedChar++;\n }\n }\n ans = Math.min(minRemovedChar, ans);\n }\n return ans;\n }\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n System.out.println(minimumChar(t, s));\n }\n\n static int minimumChar(String S1, String S2) {\n int n = S1.length();\n int m = S2.length();\n int ans = Integer.MAX_VALUE;\n for (int i = 0; i < m - n + 1; i++) {\n int minRemovedChar = 0;\n for (int j = 0; j < n; j++) {\n if (S1.charAt(j) != S2.charAt(i + j)) {\n minRemovedChar++;\n }\n }\n ans = Math.min(minRemovedChar, ans);\n }\n return ans;\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n System.out.println(minimumChar(t, s));\n }",
"main",
"{\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n System.out.println(minimumChar(t, s));\n }",
"Scanner in = new Scanner(System.in);",
"in",
"new Scanner(System.in)",
"String s = in.next();",
"s",
"in.next()",
"in.next",
"in",
"String t = in.next();",
"t",
"in.next()",
"in.next",
"in",
"System.out.println(minimumChar(t, s))",
"System.out.println",
"System.out",
"System",
"System.out",
"minimumChar(t, s)",
"minimumChar",
"t",
"s",
"String[] args",
"args",
"static int minimumChar(String S1, String S2) {\n int n = S1.length();\n int m = S2.length();\n int ans = Integer.MAX_VALUE;\n for (int i = 0; i < m - n + 1; i++) {\n int minRemovedChar = 0;\n for (int j = 0; j < n; j++) {\n if (S1.charAt(j) != S2.charAt(i + j)) {\n minRemovedChar++;\n }\n }\n ans = Math.min(minRemovedChar, ans);\n }\n return ans;\n }",
"minimumChar",
"{\n int n = S1.length();\n int m = S2.length();\n int ans = Integer.MAX_VALUE;\n for (int i = 0; i < m - n + 1; i++) {\n int minRemovedChar = 0;\n for (int j = 0; j < n; j++) {\n if (S1.charAt(j) != S2.charAt(i + j)) {\n minRemovedChar++;\n }\n }\n ans = Math.min(minRemovedChar, ans);\n }\n return ans;\n }",
"int n = S1.length();",
"n",
"S1.length()",
"S1.length",
"S1",
"int m = S2.length();",
"m",
"S2.length()",
"S2.length",
"S2",
"int ans = Integer.MAX_VALUE;",
"ans",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"for (int i = 0; i < m - n + 1; i++) {\n int minRemovedChar = 0;\n for (int j = 0; j < n; j++) {\n if (S1.charAt(j) != S2.charAt(i + j)) {\n minRemovedChar++;\n }\n }\n ans = Math.min(minRemovedChar, ans);\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < m - n + 1",
"i",
"m - n + 1",
"m - n",
"m",
"n",
"1",
"i++",
"i++",
"i",
"{\n int minRemovedChar = 0;\n for (int j = 0; j < n; j++) {\n if (S1.charAt(j) != S2.charAt(i + j)) {\n minRemovedChar++;\n }\n }\n ans = Math.min(minRemovedChar, ans);\n }",
"{\n int minRemovedChar = 0;\n for (int j = 0; j < n; j++) {\n if (S1.charAt(j) != S2.charAt(i + j)) {\n minRemovedChar++;\n }\n }\n ans = Math.min(minRemovedChar, ans);\n }",
"int minRemovedChar = 0;",
"minRemovedChar",
"0",
"for (int j = 0; j < n; j++) {\n if (S1.charAt(j) != S2.charAt(i + j)) {\n minRemovedChar++;\n }\n }",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < n",
"j",
"n",
"j++",
"j++",
"j",
"{\n if (S1.charAt(j) != S2.charAt(i + j)) {\n minRemovedChar++;\n }\n }",
"{\n if (S1.charAt(j) != S2.charAt(i + j)) {\n minRemovedChar++;\n }\n }",
"if (S1.charAt(j) != S2.charAt(i + j)) {\n minRemovedChar++;\n }",
"S1.charAt(j) != S2.charAt(i + j)",
"S1.charAt(j)",
"S1.charAt",
"S1",
"j",
"S2.charAt(i + j)",
"S2.charAt",
"S2",
"i + j",
"i",
"j",
"{\n minRemovedChar++;\n }",
"minRemovedChar++",
"minRemovedChar",
"ans = Math.min(minRemovedChar, ans)",
"ans",
"Math.min(minRemovedChar, ans)",
"Math.min",
"Math",
"minRemovedChar",
"ans",
"return ans;",
"ans",
"String S1",
"S1",
"String S2",
"S2",
"public class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n System.out.println(minimumChar(t, s));\n }\n\n static int minimumChar(String S1, String S2) {\n int n = S1.length();\n int m = S2.length();\n int ans = Integer.MAX_VALUE;\n for (int i = 0; i < m - n + 1; i++) {\n int minRemovedChar = 0;\n for (int j = 0; j < n; j++) {\n if (S1.charAt(j) != S2.charAt(i + j)) {\n minRemovedChar++;\n }\n }\n ans = Math.min(minRemovedChar, ans);\n }\n return ans;\n }\n}",
"public class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n System.out.println(minimumChar(t, s));\n }\n\n static int minimumChar(String S1, String S2) {\n int n = S1.length();\n int m = S2.length();\n int ans = Integer.MAX_VALUE;\n for (int i = 0; i < m - n + 1; i++) {\n int minRemovedChar = 0;\n for (int j = 0; j < n; j++) {\n if (S1.charAt(j) != S2.charAt(i + j)) {\n minRemovedChar++;\n }\n }\n ans = Math.min(minRemovedChar, ans);\n }\n return ans;\n }\n}",
"Main"
]
| import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String s = in.next();
String t = in.next();
System.out.println(minimumChar(t, s));
}
static int minimumChar(String S1, String S2) {
int n = S1.length();
int m = S2.length();
int ans = Integer.MAX_VALUE;
for (int i = 0; i < m - n + 1; i++) {
int minRemovedChar = 0;
for (int j = 0; j < n; j++) {
if (S1.charAt(j) != S2.charAt(i + j)) {
minRemovedChar++;
}
}
ans = Math.min(minRemovedChar, ans);
}
return ans;
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
41,
13,
41,
13,
18,
13,
13,
12,
13,
30,
41,
13,
20,
0,
13,
4,
18,
13,
0,
13,
4,
18,
13,
4,
18,
18,
13,
13,
4,
13,
23,
13,
12,
13,
30,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
2,
13,
13,
2,
2,
13,
13,
17,
41,
13,
4,
18,
13,
13,
2,
13,
17,
14,
40,
4,
18,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
29,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
123,
8
],
[
123,
9
],
[
9,
10
],
[
123,
11
],
[
11,
12
],
[
123,
13
],
[
13,
14
],
[
13,
15
],
[
15,
16
],
[
15,
17
],
[
123,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
21,
23
],
[
20,
24
],
[
24,
25
],
[
24,
26
],
[
26,
27
],
[
27,
28
],
[
20,
29
],
[
29,
30
],
[
29,
31
],
[
31,
32
],
[
32,
33
],
[
20,
34
],
[
34,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
34,
39
],
[
39,
40
],
[
18,
41
],
[
41,
42
],
[
123,
43
],
[
43,
44
],
[
43,
45
],
[
45,
46
],
[
46,
47
],
[
47,
48
],
[
48,
49
],
[
48,
50
],
[
46,
51
],
[
51,
52
],
[
51,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
53,
57
],
[
57,
58
],
[
58,
59
],
[
46,
60
],
[
60,
61
],
[
61,
62
],
[
46,
63
],
[
64,
64
],
[
64,
65
],
[
65,
66
],
[
65,
67
],
[
64,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
70,
72
],
[
68,
73
],
[
73,
74
],
[
73,
75
],
[
75,
76
],
[
76,
77
],
[
68,
78
],
[
78,
79
],
[
79,
80
],
[
68,
81
],
[
82,
82
],
[
82,
83
],
[
83,
84
],
[
83,
85
],
[
85,
86
],
[
86,
87
],
[
85,
88
],
[
88,
89
],
[
88,
90
],
[
85,
91
],
[
92,
92
],
[
92,
93
],
[
92,
94
],
[
92,
95
],
[
82,
96
],
[
96,
97
],
[
96,
98
],
[
98,
99
],
[
99,
100
],
[
98,
101
],
[
98,
102
],
[
102,
103
],
[
102,
104
],
[
82,
105
],
[
105,
106
],
[
106,
107
],
[
107,
108
],
[
108,
109
],
[
107,
110
],
[
105,
111
],
[
111,
112
],
[
64,
113
],
[
113,
114
],
[
113,
115
],
[
115,
116
],
[
116,
117
],
[
115,
118
],
[
115,
119
],
[
45,
120
],
[
120,
121
],
[
0,
122
],
[
122,
123
],
[
122,
124
]
]
| [
"import java.util.Scanner;\nimport java.util.*;\npublic class Main {\n\tpublic static String S;\n\tpublic static String T;\n\tpublic static int sub = Integer.MAX_VALUE;\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tS = scan.next();\n\t\tT = scan.next();\n\t\tSystem.out.println(search());\n\t}\n\n\tprivate static int search() {\n\t\tfor (int i = 0;i <= S.length() - T.length() ;i++ ) {\n\t\t\tint count = 0;\n\t\t\tfor (int j = 0;j < T.length() ;j++ ) {\n\t\t\t\tString s_i = S.substring(i + j,i + j + 1);\n\t\t\t\tString t_i = T.substring(j,j + 1);\n\t\t\t\tif (!s_i.equals(t_i)) count++;\n\t\t\t}\n\t\t\tsub = Math.min(sub,count);\n\t\t}\n\t\treturn sub;\n\t}\n\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n\tpublic static String S;\n\tpublic static String T;\n\tpublic static int sub = Integer.MAX_VALUE;\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tS = scan.next();\n\t\tT = scan.next();\n\t\tSystem.out.println(search());\n\t}\n\n\tprivate static int search() {\n\t\tfor (int i = 0;i <= S.length() - T.length() ;i++ ) {\n\t\t\tint count = 0;\n\t\t\tfor (int j = 0;j < T.length() ;j++ ) {\n\t\t\t\tString s_i = S.substring(i + j,i + j + 1);\n\t\t\t\tString t_i = T.substring(j,j + 1);\n\t\t\t\tif (!s_i.equals(t_i)) count++;\n\t\t\t}\n\t\t\tsub = Math.min(sub,count);\n\t\t}\n\t\treturn sub;\n\t}\n\n}",
"Main",
"public static String S;",
"S",
"public static String T;",
"T",
"public static int sub = Integer.MAX_VALUE;",
"sub",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"public static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tS = scan.next();\n\t\tT = scan.next();\n\t\tSystem.out.println(search());\n\t}",
"main",
"{\n\t\tScanner scan = new Scanner(System.in);\n\t\tS = scan.next();\n\t\tT = scan.next();\n\t\tSystem.out.println(search());\n\t}",
"Scanner scan = new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"S = scan.next()",
"S",
"scan.next()",
"scan.next",
"scan",
"T = scan.next()",
"T",
"scan.next()",
"scan.next",
"scan",
"System.out.println(search())",
"System.out.println",
"System.out",
"System",
"System.out",
"search()",
"search",
"String[] args",
"args",
"private static int search() {\n\t\tfor (int i = 0;i <= S.length() - T.length() ;i++ ) {\n\t\t\tint count = 0;\n\t\t\tfor (int j = 0;j < T.length() ;j++ ) {\n\t\t\t\tString s_i = S.substring(i + j,i + j + 1);\n\t\t\t\tString t_i = T.substring(j,j + 1);\n\t\t\t\tif (!s_i.equals(t_i)) count++;\n\t\t\t}\n\t\t\tsub = Math.min(sub,count);\n\t\t}\n\t\treturn sub;\n\t}",
"search",
"{\n\t\tfor (int i = 0;i <= S.length() - T.length() ;i++ ) {\n\t\t\tint count = 0;\n\t\t\tfor (int j = 0;j < T.length() ;j++ ) {\n\t\t\t\tString s_i = S.substring(i + j,i + j + 1);\n\t\t\t\tString t_i = T.substring(j,j + 1);\n\t\t\t\tif (!s_i.equals(t_i)) count++;\n\t\t\t}\n\t\t\tsub = Math.min(sub,count);\n\t\t}\n\t\treturn sub;\n\t}",
"for (int i = 0;i <= S.length() - T.length() ;i++ ) {\n\t\t\tint count = 0;\n\t\t\tfor (int j = 0;j < T.length() ;j++ ) {\n\t\t\t\tString s_i = S.substring(i + j,i + j + 1);\n\t\t\t\tString t_i = T.substring(j,j + 1);\n\t\t\t\tif (!s_i.equals(t_i)) count++;\n\t\t\t}\n\t\t\tsub = Math.min(sub,count);\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= S.length() - T.length()",
"i",
"S.length() - T.length()",
"S.length()",
"S.length",
"S",
"T.length()",
"T.length",
"T",
"i++",
"i++",
"i",
"{\n\t\t\tint count = 0;\n\t\t\tfor (int j = 0;j < T.length() ;j++ ) {\n\t\t\t\tString s_i = S.substring(i + j,i + j + 1);\n\t\t\t\tString t_i = T.substring(j,j + 1);\n\t\t\t\tif (!s_i.equals(t_i)) count++;\n\t\t\t}\n\t\t\tsub = Math.min(sub,count);\n\t\t}",
"{\n\t\t\tint count = 0;\n\t\t\tfor (int j = 0;j < T.length() ;j++ ) {\n\t\t\t\tString s_i = S.substring(i + j,i + j + 1);\n\t\t\t\tString t_i = T.substring(j,j + 1);\n\t\t\t\tif (!s_i.equals(t_i)) count++;\n\t\t\t}\n\t\t\tsub = Math.min(sub,count);\n\t\t}",
"int count = 0;",
"count",
"0",
"for (int j = 0;j < T.length() ;j++ ) {\n\t\t\t\tString s_i = S.substring(i + j,i + j + 1);\n\t\t\t\tString t_i = T.substring(j,j + 1);\n\t\t\t\tif (!s_i.equals(t_i)) count++;\n\t\t\t}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < T.length()",
"j",
"T.length()",
"T.length",
"T",
"j++",
"j++",
"j",
"{\n\t\t\t\tString s_i = S.substring(i + j,i + j + 1);\n\t\t\t\tString t_i = T.substring(j,j + 1);\n\t\t\t\tif (!s_i.equals(t_i)) count++;\n\t\t\t}",
"{\n\t\t\t\tString s_i = S.substring(i + j,i + j + 1);\n\t\t\t\tString t_i = T.substring(j,j + 1);\n\t\t\t\tif (!s_i.equals(t_i)) count++;\n\t\t\t}",
"String s_i = S.substring(i + j,i + j + 1);",
"s_i",
"S.substring(i + j,i + j + 1)",
"S.substring",
"S",
"i + j",
"i",
"j",
"i + j + 1",
"i + j + 1",
"i",
"j",
"1",
"String t_i = T.substring(j,j + 1);",
"t_i",
"T.substring(j,j + 1)",
"T.substring",
"T",
"j",
"j + 1",
"j",
"1",
"if (!s_i.equals(t_i)) count++;",
"!s_i.equals(t_i)",
"s_i.equals(t_i)",
"s_i.equals",
"s_i",
"t_i",
"count++",
"count",
"sub = Math.min(sub,count)",
"sub",
"Math.min(sub,count)",
"Math.min",
"Math",
"sub",
"count",
"return sub;",
"sub",
"public class Main {\n\tpublic static String S;\n\tpublic static String T;\n\tpublic static int sub = Integer.MAX_VALUE;\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tS = scan.next();\n\t\tT = scan.next();\n\t\tSystem.out.println(search());\n\t}\n\n\tprivate static int search() {\n\t\tfor (int i = 0;i <= S.length() - T.length() ;i++ ) {\n\t\t\tint count = 0;\n\t\t\tfor (int j = 0;j < T.length() ;j++ ) {\n\t\t\t\tString s_i = S.substring(i + j,i + j + 1);\n\t\t\t\tString t_i = T.substring(j,j + 1);\n\t\t\t\tif (!s_i.equals(t_i)) count++;\n\t\t\t}\n\t\t\tsub = Math.min(sub,count);\n\t\t}\n\t\treturn sub;\n\t}\n\n}",
"public class Main {\n\tpublic static String S;\n\tpublic static String T;\n\tpublic static int sub = Integer.MAX_VALUE;\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tS = scan.next();\n\t\tT = scan.next();\n\t\tSystem.out.println(search());\n\t}\n\n\tprivate static int search() {\n\t\tfor (int i = 0;i <= S.length() - T.length() ;i++ ) {\n\t\t\tint count = 0;\n\t\t\tfor (int j = 0;j < T.length() ;j++ ) {\n\t\t\t\tString s_i = S.substring(i + j,i + j + 1);\n\t\t\t\tString t_i = T.substring(j,j + 1);\n\t\t\t\tif (!s_i.equals(t_i)) count++;\n\t\t\t}\n\t\t\tsub = Math.min(sub,count);\n\t\t}\n\t\treturn sub;\n\t}\n\n}",
"Main"
]
| import java.util.Scanner;
import java.util.*;
public class Main {
public static String S;
public static String T;
public static int sub = Integer.MAX_VALUE;
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
S = scan.next();
T = scan.next();
System.out.println(search());
}
private static int search() {
for (int i = 0;i <= S.length() - T.length() ;i++ ) {
int count = 0;
for (int j = 0;j < T.length() ;j++ ) {
String s_i = S.substring(i + j,i + j + 1);
String t_i = T.substring(j,j + 1);
if (!s_i.equals(t_i)) count++;
}
sub = Math.min(sub,count);
}
return sub;
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
2,
4,
18,
13,
13,
17,
1,
40,
13,
30,
30,
41,
13,
17,
41,
13,
4,
18,
13,
13,
2,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
2,
13,
13,
23,
13,
10,
6,
13
]
| [
[
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
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
25,
26
],
[
8,
27
],
[
27,
28
],
[
27,
29
],
[
8,
30
],
[
30,
31
],
[
31,
32
],
[
32,
33
],
[
32,
34
],
[
30,
35
],
[
35,
36
],
[
35,
37
],
[
37,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
38,
42
],
[
37,
43
],
[
30,
44
],
[
44,
45
],
[
45,
46
],
[
30,
47
],
[
48,
48
],
[
48,
49
],
[
49,
50
],
[
49,
51
],
[
48,
52
],
[
52,
53
],
[
52,
54
],
[
54,
55
],
[
55,
56
],
[
54,
57
],
[
54,
58
],
[
58,
59
],
[
58,
60
],
[
48,
61
],
[
61,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
61,
66
],
[
66,
67
],
[
66,
68
],
[
61,
69
],
[
69,
70
],
[
70,
71
],
[
61,
72
],
[
73,
73
],
[
73,
74
],
[
74,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
76,
79
],
[
75,
80
],
[
80,
81
],
[
81,
82
],
[
80,
83
],
[
74,
84
],
[
84,
85
],
[
48,
86
],
[
86,
87
],
[
86,
88
],
[
88,
89
],
[
89,
90
],
[
88,
91
],
[
88,
92
],
[
8,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
95,
97
],
[
93,
98
],
[
98,
99
],
[
98,
100
],
[
6,
101
],
[
101,
102
],
[
0,
103
],
[
103,
104
],
[
103,
105
]
]
| [
"import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n\n int wsize = t.length();\n int mcount = 0;\n for(int i = 0 ; i < s.length() - wsize + 1; i++){\n int temp = 0;\n String k = s.substring(i, wsize + i);\n for(int j = 0 ; j < wsize ; j++){\n if(t.charAt(j) == k.charAt(j)) temp++;\n }\n mcount = Math.max(temp,mcount);\n }\n\n System.out.println(wsize - mcount);\n\n }\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n\n int wsize = t.length();\n int mcount = 0;\n for(int i = 0 ; i < s.length() - wsize + 1; i++){\n int temp = 0;\n String k = s.substring(i, wsize + i);\n for(int j = 0 ; j < wsize ; j++){\n if(t.charAt(j) == k.charAt(j)) temp++;\n }\n mcount = Math.max(temp,mcount);\n }\n\n System.out.println(wsize - mcount);\n\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n\n int wsize = t.length();\n int mcount = 0;\n for(int i = 0 ; i < s.length() - wsize + 1; i++){\n int temp = 0;\n String k = s.substring(i, wsize + i);\n for(int j = 0 ; j < wsize ; j++){\n if(t.charAt(j) == k.charAt(j)) temp++;\n }\n mcount = Math.max(temp,mcount);\n }\n\n System.out.println(wsize - mcount);\n\n }",
"main",
"{\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n\n int wsize = t.length();\n int mcount = 0;\n for(int i = 0 ; i < s.length() - wsize + 1; i++){\n int temp = 0;\n String k = s.substring(i, wsize + i);\n for(int j = 0 ; j < wsize ; j++){\n if(t.charAt(j) == k.charAt(j)) temp++;\n }\n mcount = Math.max(temp,mcount);\n }\n\n System.out.println(wsize - mcount);\n\n }",
"Scanner in = new Scanner(System.in);",
"in",
"new Scanner(System.in)",
"String s = in.next();",
"s",
"in.next()",
"in.next",
"in",
"String t = in.next();",
"t",
"in.next()",
"in.next",
"in",
"int wsize = t.length();",
"wsize",
"t.length()",
"t.length",
"t",
"int mcount = 0;",
"mcount",
"0",
"for(int i = 0 ; i < s.length() - wsize + 1; i++){\n int temp = 0;\n String k = s.substring(i, wsize + i);\n for(int j = 0 ; j < wsize ; j++){\n if(t.charAt(j) == k.charAt(j)) temp++;\n }\n mcount = Math.max(temp,mcount);\n }",
"int i = 0 ;",
"int i = 0 ;",
"i",
"0",
"i < s.length() - wsize + 1",
"i",
"s.length() - wsize + 1",
"s.length() - wsize",
"s.length()",
"s.length",
"s",
"wsize",
"1",
"i++",
"i++",
"i",
"{\n int temp = 0;\n String k = s.substring(i, wsize + i);\n for(int j = 0 ; j < wsize ; j++){\n if(t.charAt(j) == k.charAt(j)) temp++;\n }\n mcount = Math.max(temp,mcount);\n }",
"{\n int temp = 0;\n String k = s.substring(i, wsize + i);\n for(int j = 0 ; j < wsize ; j++){\n if(t.charAt(j) == k.charAt(j)) temp++;\n }\n mcount = Math.max(temp,mcount);\n }",
"int temp = 0;",
"temp",
"0",
"String k = s.substring(i, wsize + i);",
"k",
"s.substring(i, wsize + i)",
"s.substring",
"s",
"i",
"wsize + i",
"wsize",
"i",
"for(int j = 0 ; j < wsize ; j++){\n if(t.charAt(j) == k.charAt(j)) temp++;\n }",
"int j = 0 ;",
"int j = 0 ;",
"j",
"0",
"j < wsize",
"j",
"wsize",
"j++",
"j++",
"j",
"{\n if(t.charAt(j) == k.charAt(j)) temp++;\n }",
"{\n if(t.charAt(j) == k.charAt(j)) temp++;\n }",
"if(t.charAt(j) == k.charAt(j)) temp++;",
"t.charAt(j) == k.charAt(j)",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"k.charAt(j)",
"k.charAt",
"k",
"j",
"temp++",
"temp",
"mcount = Math.max(temp,mcount)",
"mcount",
"Math.max(temp,mcount)",
"Math.max",
"Math",
"temp",
"mcount",
"System.out.println(wsize - mcount)",
"System.out.println",
"System.out",
"System",
"System.out",
"wsize - mcount",
"wsize",
"mcount",
"String[] args",
"args",
"public class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n\n int wsize = t.length();\n int mcount = 0;\n for(int i = 0 ; i < s.length() - wsize + 1; i++){\n int temp = 0;\n String k = s.substring(i, wsize + i);\n for(int j = 0 ; j < wsize ; j++){\n if(t.charAt(j) == k.charAt(j)) temp++;\n }\n mcount = Math.max(temp,mcount);\n }\n\n System.out.println(wsize - mcount);\n\n }\n}",
"public class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n\n int wsize = t.length();\n int mcount = 0;\n for(int i = 0 ; i < s.length() - wsize + 1; i++){\n int temp = 0;\n String k = s.substring(i, wsize + i);\n for(int j = 0 ; j < wsize ; j++){\n if(t.charAt(j) == k.charAt(j)) temp++;\n }\n mcount = Math.max(temp,mcount);\n }\n\n System.out.println(wsize - mcount);\n\n }\n}",
"Main"
]
| import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String s = in.next();
String t = in.next();
int wsize = t.length();
int mcount = 0;
for(int i = 0 ; i < s.length() - wsize + 1; i++){
int temp = 0;
String k = s.substring(i, wsize + i);
for(int j = 0 ; j < wsize ; j++){
if(t.charAt(j) == k.charAt(j)) temp++;
}
mcount = Math.max(temp,mcount);
}
System.out.println(wsize - mcount);
}
} |
[
7,
15,
13,
17,
6,
13,
41,
13,
12,
13,
30,
0,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
17,
41,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
2,
13,
13,
41,
13,
4,
18,
13,
17,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
18,
13,
13,
41,
13,
18,
13,
13,
14,
40,
4,
18,
13,
13,
30,
40,
13,
14,
2,
13,
13,
30,
0,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
127,
5
],
[
127,
6
],
[
6,
7
],
[
127,
8
],
[
8,
9
],
[
8,
10
],
[
10,
11
],
[
11,
12
],
[
11,
13
],
[
10,
14
],
[
14,
15
],
[
14,
16
],
[
16,
17
],
[
17,
18
],
[
10,
19
],
[
19,
20
],
[
19,
21
],
[
21,
22
],
[
22,
23
],
[
10,
24
],
[
24,
25
],
[
24,
26
],
[
26,
27
],
[
27,
28
],
[
10,
29
],
[
29,
30
],
[
29,
31
],
[
31,
32
],
[
32,
33
],
[
10,
34
],
[
34,
35
],
[
34,
36
],
[
36,
37
],
[
37,
38
],
[
36,
39
],
[
10,
40
],
[
40,
41
],
[
40,
42
],
[
10,
43
],
[
43,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
43,
48
],
[
48,
49
],
[
48,
50
],
[
50,
51
],
[
50,
52
],
[
43,
53
],
[
53,
54
],
[
54,
55
],
[
43,
56
],
[
57,
57
],
[
57,
58
],
[
58,
59
],
[
58,
60
],
[
60,
61
],
[
61,
62
],
[
60,
63
],
[
60,
64
],
[
64,
65
],
[
64,
66
],
[
57,
67
],
[
67,
68
],
[
67,
69
],
[
69,
70
],
[
70,
71
],
[
69,
72
],
[
57,
73
],
[
73,
74
],
[
73,
75
],
[
57,
76
],
[
76,
77
],
[
77,
78
],
[
78,
79
],
[
78,
80
],
[
76,
81
],
[
81,
82
],
[
81,
83
],
[
83,
84
],
[
84,
85
],
[
76,
86
],
[
86,
87
],
[
87,
88
],
[
76,
89
],
[
90,
90
],
[
90,
91
],
[
91,
92
],
[
91,
93
],
[
93,
94
],
[
93,
95
],
[
90,
96
],
[
96,
97
],
[
96,
98
],
[
98,
99
],
[
98,
100
],
[
90,
101
],
[
101,
102
],
[
102,
103
],
[
103,
104
],
[
104,
105
],
[
103,
106
],
[
101,
107
],
[
107,
108
],
[
108,
109
],
[
57,
110
],
[
110,
111
],
[
111,
112
],
[
111,
113
],
[
110,
114
],
[
114,
115
],
[
115,
116
],
[
115,
117
],
[
10,
118
],
[
118,
119
],
[
119,
120
],
[
120,
121
],
[
120,
122
],
[
118,
123
],
[
8,
124
],
[
124,
125
],
[
0,
126
],
[
126,
127
],
[
126,
128
]
]
| [
"import java.util.Scanner;\n\npublic class Main {\n\tprivate static Scanner sc;\n\n\tpublic static void main(String[] args) {\n\t\tsc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\t//部分文字列対象\n\t\tString t = sc.next();\n\t\t\n\t\tint slength = s.length();\n\t\tint tlength = t.length();\n\t\t\n\t\tString[] tArray = t.split(\"\");\n\t\tint result = slength;\n\t\tfor (int i = 0; i<= (slength - tlength); i++) {\n\t\t\tString subS = s.substring(i,tlength + i);\n\t\t\tString[] subSArray = subS.split(\"\");\n\t\t\tint innerResult = 0;\n\t\t\tfor (int j = 0; j<subS.length(); j++) {\n\t\t\t\tString subTChar = tArray[j];\n\t\t\t\tString subSChar = subSArray[j];\n\t\t\t\t//異なったら変換が必要\n\t\t\t\tif (!subTChar.equals(subSChar)) {\n\t\t\t\t\tinnerResult++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (innerResult <= result) {\n\t\t\t\tresult = innerResult;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(result);\n\t}\t\n\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\tprivate static Scanner sc;\n\n\tpublic static void main(String[] args) {\n\t\tsc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\t//部分文字列対象\n\t\tString t = sc.next();\n\t\t\n\t\tint slength = s.length();\n\t\tint tlength = t.length();\n\t\t\n\t\tString[] tArray = t.split(\"\");\n\t\tint result = slength;\n\t\tfor (int i = 0; i<= (slength - tlength); i++) {\n\t\t\tString subS = s.substring(i,tlength + i);\n\t\t\tString[] subSArray = subS.split(\"\");\n\t\t\tint innerResult = 0;\n\t\t\tfor (int j = 0; j<subS.length(); j++) {\n\t\t\t\tString subTChar = tArray[j];\n\t\t\t\tString subSChar = subSArray[j];\n\t\t\t\t//異なったら変換が必要\n\t\t\t\tif (!subTChar.equals(subSChar)) {\n\t\t\t\t\tinnerResult++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (innerResult <= result) {\n\t\t\t\tresult = innerResult;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(result);\n\t}\t\n\n}",
"Main",
"private static Scanner sc;",
"sc",
"public static void main(String[] args) {\n\t\tsc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\t//部分文字列対象\n\t\tString t = sc.next();\n\t\t\n\t\tint slength = s.length();\n\t\tint tlength = t.length();\n\t\t\n\t\tString[] tArray = t.split(\"\");\n\t\tint result = slength;\n\t\tfor (int i = 0; i<= (slength - tlength); i++) {\n\t\t\tString subS = s.substring(i,tlength + i);\n\t\t\tString[] subSArray = subS.split(\"\");\n\t\t\tint innerResult = 0;\n\t\t\tfor (int j = 0; j<subS.length(); j++) {\n\t\t\t\tString subTChar = tArray[j];\n\t\t\t\tString subSChar = subSArray[j];\n\t\t\t\t//異なったら変換が必要\n\t\t\t\tif (!subTChar.equals(subSChar)) {\n\t\t\t\t\tinnerResult++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (innerResult <= result) {\n\t\t\t\tresult = innerResult;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(result);\n\t}",
"main",
"{\n\t\tsc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\t//部分文字列対象\n\t\tString t = sc.next();\n\t\t\n\t\tint slength = s.length();\n\t\tint tlength = t.length();\n\t\t\n\t\tString[] tArray = t.split(\"\");\n\t\tint result = slength;\n\t\tfor (int i = 0; i<= (slength - tlength); i++) {\n\t\t\tString subS = s.substring(i,tlength + i);\n\t\t\tString[] subSArray = subS.split(\"\");\n\t\t\tint innerResult = 0;\n\t\t\tfor (int j = 0; j<subS.length(); j++) {\n\t\t\t\tString subTChar = tArray[j];\n\t\t\t\tString subSChar = subSArray[j];\n\t\t\t\t//異なったら変換が必要\n\t\t\t\tif (!subTChar.equals(subSChar)) {\n\t\t\t\t\tinnerResult++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (innerResult <= result) {\n\t\t\t\tresult = innerResult;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(result);\n\t}",
"sc = new Scanner(System.in)",
"sc",
"new Scanner(System.in)",
"String s = sc.next();",
"s",
"sc.next()",
"sc.next",
"sc",
"String t = sc.next();",
"t",
"sc.next()",
"sc.next",
"sc",
"int slength = s.length();",
"slength",
"s.length()",
"s.length",
"s",
"int tlength = t.length();",
"tlength",
"t.length()",
"t.length",
"t",
"String[] tArray = t.split(\"\");",
"tArray",
"t.split(\"\")",
"t.split",
"t",
"\"\"",
"int result = slength;",
"result",
"slength",
"for (int i = 0; i<= (slength - tlength); i++) {\n\t\t\tString subS = s.substring(i,tlength + i);\n\t\t\tString[] subSArray = subS.split(\"\");\n\t\t\tint innerResult = 0;\n\t\t\tfor (int j = 0; j<subS.length(); j++) {\n\t\t\t\tString subTChar = tArray[j];\n\t\t\t\tString subSChar = subSArray[j];\n\t\t\t\t//異なったら変換が必要\n\t\t\t\tif (!subTChar.equals(subSChar)) {\n\t\t\t\t\tinnerResult++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (innerResult <= result) {\n\t\t\t\tresult = innerResult;\n\t\t\t}\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i<= (slength - tlength)",
"i",
"(slength - tlength)",
"slength",
"tlength",
"i++",
"i++",
"i",
"{\n\t\t\tString subS = s.substring(i,tlength + i);\n\t\t\tString[] subSArray = subS.split(\"\");\n\t\t\tint innerResult = 0;\n\t\t\tfor (int j = 0; j<subS.length(); j++) {\n\t\t\t\tString subTChar = tArray[j];\n\t\t\t\tString subSChar = subSArray[j];\n\t\t\t\t//異なったら変換が必要\n\t\t\t\tif (!subTChar.equals(subSChar)) {\n\t\t\t\t\tinnerResult++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (innerResult <= result) {\n\t\t\t\tresult = innerResult;\n\t\t\t}\n\t\t}",
"{\n\t\t\tString subS = s.substring(i,tlength + i);\n\t\t\tString[] subSArray = subS.split(\"\");\n\t\t\tint innerResult = 0;\n\t\t\tfor (int j = 0; j<subS.length(); j++) {\n\t\t\t\tString subTChar = tArray[j];\n\t\t\t\tString subSChar = subSArray[j];\n\t\t\t\t//異なったら変換が必要\n\t\t\t\tif (!subTChar.equals(subSChar)) {\n\t\t\t\t\tinnerResult++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (innerResult <= result) {\n\t\t\t\tresult = innerResult;\n\t\t\t}\n\t\t}",
"String subS = s.substring(i,tlength + i);",
"subS",
"s.substring(i,tlength + i)",
"s.substring",
"s",
"i",
"tlength + i",
"tlength",
"i",
"String[] subSArray = subS.split(\"\");",
"subSArray",
"subS.split(\"\")",
"subS.split",
"subS",
"\"\"",
"int innerResult = 0;",
"innerResult",
"0",
"for (int j = 0; j<subS.length(); j++) {\n\t\t\t\tString subTChar = tArray[j];\n\t\t\t\tString subSChar = subSArray[j];\n\t\t\t\t//異なったら変換が必要\n\t\t\t\tif (!subTChar.equals(subSChar)) {\n\t\t\t\t\tinnerResult++;\n\t\t\t\t}\n\t\t\t}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j<subS.length()",
"j",
"subS.length()",
"subS.length",
"subS",
"j++",
"j++",
"j",
"{\n\t\t\t\tString subTChar = tArray[j];\n\t\t\t\tString subSChar = subSArray[j];\n\t\t\t\t//異なったら変換が必要\n\t\t\t\tif (!subTChar.equals(subSChar)) {\n\t\t\t\t\tinnerResult++;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tString subTChar = tArray[j];\n\t\t\t\tString subSChar = subSArray[j];\n\t\t\t\t//異なったら変換が必要\n\t\t\t\tif (!subTChar.equals(subSChar)) {\n\t\t\t\t\tinnerResult++;\n\t\t\t\t}\n\t\t\t}",
"String subTChar = tArray[j];",
"subTChar",
"tArray[j]",
"tArray",
"j",
"String subSChar = subSArray[j];",
"subSChar",
"subSArray[j]",
"subSArray",
"j",
"if (!subTChar.equals(subSChar)) {\n\t\t\t\t\tinnerResult++;\n\t\t\t\t}",
"!subTChar.equals(subSChar)",
"subTChar.equals(subSChar)",
"subTChar.equals",
"subTChar",
"subSChar",
"{\n\t\t\t\t\tinnerResult++;\n\t\t\t\t}",
"innerResult++",
"innerResult",
"if (innerResult <= result) {\n\t\t\t\tresult = innerResult;\n\t\t\t}",
"innerResult <= result",
"innerResult",
"result",
"{\n\t\t\t\tresult = innerResult;\n\t\t\t}",
"result = innerResult",
"result",
"innerResult",
"System.out.println(result)",
"System.out.println",
"System.out",
"System",
"System.out",
"result",
"String[] args",
"args",
"public class Main {\n\tprivate static Scanner sc;\n\n\tpublic static void main(String[] args) {\n\t\tsc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\t//部分文字列対象\n\t\tString t = sc.next();\n\t\t\n\t\tint slength = s.length();\n\t\tint tlength = t.length();\n\t\t\n\t\tString[] tArray = t.split(\"\");\n\t\tint result = slength;\n\t\tfor (int i = 0; i<= (slength - tlength); i++) {\n\t\t\tString subS = s.substring(i,tlength + i);\n\t\t\tString[] subSArray = subS.split(\"\");\n\t\t\tint innerResult = 0;\n\t\t\tfor (int j = 0; j<subS.length(); j++) {\n\t\t\t\tString subTChar = tArray[j];\n\t\t\t\tString subSChar = subSArray[j];\n\t\t\t\t//異なったら変換が必要\n\t\t\t\tif (!subTChar.equals(subSChar)) {\n\t\t\t\t\tinnerResult++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (innerResult <= result) {\n\t\t\t\tresult = innerResult;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(result);\n\t}\t\n\n}",
"public class Main {\n\tprivate static Scanner sc;\n\n\tpublic static void main(String[] args) {\n\t\tsc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\t//部分文字列対象\n\t\tString t = sc.next();\n\t\t\n\t\tint slength = s.length();\n\t\tint tlength = t.length();\n\t\t\n\t\tString[] tArray = t.split(\"\");\n\t\tint result = slength;\n\t\tfor (int i = 0; i<= (slength - tlength); i++) {\n\t\t\tString subS = s.substring(i,tlength + i);\n\t\t\tString[] subSArray = subS.split(\"\");\n\t\t\tint innerResult = 0;\n\t\t\tfor (int j = 0; j<subS.length(); j++) {\n\t\t\t\tString subTChar = tArray[j];\n\t\t\t\tString subSChar = subSArray[j];\n\t\t\t\t//異なったら変換が必要\n\t\t\t\tif (!subTChar.equals(subSChar)) {\n\t\t\t\t\tinnerResult++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (innerResult <= result) {\n\t\t\t\tresult = innerResult;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(result);\n\t}\t\n\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
private static Scanner sc;
public static void main(String[] args) {
sc = new Scanner(System.in);
String s = sc.next();
//部分文字列対象
String t = sc.next();
int slength = s.length();
int tlength = t.length();
String[] tArray = t.split("");
int result = slength;
for (int i = 0; i<= (slength - tlength); i++) {
String subS = s.substring(i,tlength + i);
String[] subSArray = subS.split("");
int innerResult = 0;
for (int j = 0; j<subS.length(); j++) {
String subTChar = tArray[j];
String subSChar = subSArray[j];
//異なったら変換が必要
if (!subTChar.equals(subSChar)) {
innerResult++;
}
}
if (innerResult <= result) {
result = innerResult;
}
}
System.out.println(result);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
40,
4,
18,
4,
18,
13,
2,
13,
13,
2,
2,
13,
13,
17,
4,
18,
13,
13,
2,
13,
17,
30,
40,
13,
14,
2,
13,
13,
30,
0,
13,
13,
4,
18,
18,
13,
13,
13,
4,
18,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
107,
5
],
[
107,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
8,
25
],
[
25,
26
],
[
26,
27
],
[
27,
28
],
[
27,
29
],
[
25,
30
],
[
30,
31
],
[
30,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
32,
36
],
[
36,
37
],
[
37,
38
],
[
25,
39
],
[
39,
40
],
[
40,
41
],
[
25,
42
],
[
43,
43
],
[
43,
44
],
[
44,
45
],
[
44,
46
],
[
43,
47
],
[
47,
48
],
[
48,
49
],
[
49,
50
],
[
49,
51
],
[
47,
52
],
[
52,
53
],
[
52,
54
],
[
54,
55
],
[
55,
56
],
[
47,
57
],
[
57,
58
],
[
58,
59
],
[
47,
60
],
[
61,
61
],
[
61,
62
],
[
62,
63
],
[
63,
64
],
[
64,
65
],
[
65,
66
],
[
66,
67
],
[
67,
68
],
[
66,
69
],
[
69,
70
],
[
69,
71
],
[
66,
72
],
[
73,
73
],
[
73,
74
],
[
73,
75
],
[
73,
76
],
[
64,
77
],
[
77,
78
],
[
78,
79
],
[
77,
80
],
[
77,
81
],
[
81,
82
],
[
81,
83
],
[
62,
84
],
[
84,
85
],
[
85,
86
],
[
43,
87
],
[
87,
88
],
[
88,
89
],
[
88,
90
],
[
87,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
8,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
97,
99
],
[
95,
100
],
[
8,
101
],
[
101,
102
],
[
102,
103
],
[
6,
104
],
[
104,
105
],
[
0,
106
],
[
106,
107
],
[
106,
108
]
]
| [
"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 s = sc.nextLine();\n\t\tString t = sc.nextLine();\n\n\t\tint ans = 1000;\n\n\t\tfor (int i = 0; i <= s.length() - t.length(); i++) {\n\t\t\tint tmp = 0;\n\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (!(s.substring(i + j, i + j + 1).equals(t.substring(j, j + 1)))) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (tmp < ans) {\n\t\t\t\tans = tmp;\n\t\t\t}\n\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\t\tsc.close();\n\t}\n\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.nextLine();\n\t\tString t = sc.nextLine();\n\n\t\tint ans = 1000;\n\n\t\tfor (int i = 0; i <= s.length() - t.length(); i++) {\n\t\t\tint tmp = 0;\n\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (!(s.substring(i + j, i + j + 1).equals(t.substring(j, j + 1)))) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (tmp < ans) {\n\t\t\t\tans = tmp;\n\t\t\t}\n\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\t\tsc.close();\n\t}\n\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.nextLine();\n\t\tString t = sc.nextLine();\n\n\t\tint ans = 1000;\n\n\t\tfor (int i = 0; i <= s.length() - t.length(); i++) {\n\t\t\tint tmp = 0;\n\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (!(s.substring(i + j, i + j + 1).equals(t.substring(j, j + 1)))) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (tmp < ans) {\n\t\t\t\tans = tmp;\n\t\t\t}\n\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\t\tsc.close();\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.nextLine();\n\t\tString t = sc.nextLine();\n\n\t\tint ans = 1000;\n\n\t\tfor (int i = 0; i <= s.length() - t.length(); i++) {\n\t\t\tint tmp = 0;\n\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (!(s.substring(i + j, i + j + 1).equals(t.substring(j, j + 1)))) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (tmp < ans) {\n\t\t\t\tans = tmp;\n\t\t\t}\n\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\t\tsc.close();\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String s = sc.nextLine();",
"s",
"sc.nextLine()",
"sc.nextLine",
"sc",
"String t = sc.nextLine();",
"t",
"sc.nextLine()",
"sc.nextLine",
"sc",
"int ans = 1000;",
"ans",
"1000",
"for (int i = 0; i <= s.length() - t.length(); i++) {\n\t\t\tint tmp = 0;\n\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (!(s.substring(i + j, i + j + 1).equals(t.substring(j, j + 1)))) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (tmp < ans) {\n\t\t\t\tans = tmp;\n\t\t\t}\n\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= s.length() - t.length()",
"i",
"s.length() - t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"i++",
"i++",
"i",
"{\n\t\t\tint tmp = 0;\n\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (!(s.substring(i + j, i + j + 1).equals(t.substring(j, j + 1)))) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (tmp < ans) {\n\t\t\t\tans = tmp;\n\t\t\t}\n\n\t\t}",
"{\n\t\t\tint tmp = 0;\n\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (!(s.substring(i + j, i + j + 1).equals(t.substring(j, j + 1)))) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (tmp < ans) {\n\t\t\t\tans = tmp;\n\t\t\t}\n\n\t\t}",
"int tmp = 0;",
"tmp",
"0",
"for (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (!(s.substring(i + j, i + j + 1).equals(t.substring(j, j + 1)))) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n\t\t\t\tif (!(s.substring(i + j, i + j + 1).equals(t.substring(j, j + 1)))) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif (!(s.substring(i + j, i + j + 1).equals(t.substring(j, j + 1)))) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}",
"if (!(s.substring(i + j, i + j + 1).equals(t.substring(j, j + 1)))) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}",
"!(s.substring(i + j, i + j + 1).equals(t.substring(j, j + 1)))",
"(s.substring(i + j, i + j + 1).equals(t.substring(j, j + 1)))",
"s.substring(i + j, i + j + 1).equals",
"s.substring(i + j, i + j + 1)",
"s.substring",
"s",
"i + j",
"i",
"j",
"i + j + 1",
"i + j + 1",
"i",
"j",
"1",
"t.substring(j, j + 1)",
"t.substring",
"t",
"j",
"j + 1",
"j",
"1",
"{\n\t\t\t\t\ttmp++;\n\t\t\t\t}",
"tmp++",
"tmp",
"if (tmp < ans) {\n\t\t\t\tans = tmp;\n\t\t\t}",
"tmp < ans",
"tmp",
"ans",
"{\n\t\t\t\tans = tmp;\n\t\t\t}",
"ans = tmp",
"ans",
"tmp",
"System.out.println(ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"ans",
"sc.close()",
"sc.close",
"sc",
"String[] args",
"args",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.nextLine();\n\t\tString t = sc.nextLine();\n\n\t\tint ans = 1000;\n\n\t\tfor (int i = 0; i <= s.length() - t.length(); i++) {\n\t\t\tint tmp = 0;\n\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (!(s.substring(i + j, i + j + 1).equals(t.substring(j, j + 1)))) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (tmp < ans) {\n\t\t\t\tans = tmp;\n\t\t\t}\n\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\t\tsc.close();\n\t}\n\n}",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.nextLine();\n\t\tString t = sc.nextLine();\n\n\t\tint ans = 1000;\n\n\t\tfor (int i = 0; i <= s.length() - t.length(); i++) {\n\t\t\tint tmp = 0;\n\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (!(s.substring(i + j, i + j + 1).equals(t.substring(j, j + 1)))) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (tmp < ans) {\n\t\t\t\tans = tmp;\n\t\t\t}\n\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\t\tsc.close();\n\t}\n\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.nextLine();
String t = sc.nextLine();
int ans = 1000;
for (int i = 0; i <= s.length() - t.length(); i++) {
int tmp = 0;
for (int j = 0; j < t.length(); j++) {
if (!(s.substring(i + j, i + j + 1).equals(t.substring(j, j + 1)))) {
tmp++;
}
}
if (tmp < ans) {
ans = tmp;
}
}
System.out.println(ans);
sc.close();
}
} |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
0,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
30,
30,
40,
13,
14,
2,
13,
13,
30,
0,
13,
13,
14,
4,
18,
13,
13,
30,
4,
18,
18,
13,
13,
17,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
113,
8
],
[
113,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
11,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
11,
20
],
[
20,
21
],
[
20,
22
],
[
22,
23
],
[
23,
24
],
[
11,
25
],
[
25,
26
],
[
25,
27
],
[
11,
28
],
[
28,
29
],
[
28,
30
],
[
11,
31
],
[
31,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
31,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
38,
42
],
[
42,
43
],
[
43,
44
],
[
31,
45
],
[
45,
46
],
[
46,
47
],
[
31,
48
],
[
49,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
49,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
53,
58
],
[
58,
59
],
[
58,
60
],
[
60,
61
],
[
61,
62
],
[
53,
63
],
[
63,
64
],
[
64,
65
],
[
53,
66
],
[
67,
67
],
[
67,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
70,
73
],
[
73,
74
],
[
73,
75
],
[
69,
76
],
[
76,
77
],
[
77,
78
],
[
76,
79
],
[
68,
80
],
[
68,
81
],
[
81,
82
],
[
82,
83
],
[
49,
84
],
[
84,
85
],
[
85,
86
],
[
85,
87
],
[
84,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
11,
92
],
[
92,
93
],
[
93,
94
],
[
94,
95
],
[
93,
96
],
[
92,
97
],
[
97,
98
],
[
98,
99
],
[
99,
100
],
[
100,
101
],
[
100,
102
],
[
98,
103
],
[
92,
104
],
[
104,
105
],
[
105,
106
],
[
106,
107
],
[
106,
108
],
[
104,
109
],
[
9,
110
],
[
110,
111
],
[
0,
112
],
[
112,
113
],
[
112,
114
]
]
| [
"\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next(); // s muss t enthaalen\n int count = 0;\n int min = 9999;\n for (int i = 0; i <= s.length()-t.length(); i++) {\n count = 0;\n for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)==t.charAt(j)){\n \n } else {\n count++;\n \n }\n \n }\n if(min>count){\n min = count;\n }\n }\n if(s.contains(t)){\n System.out.println(0);\n } else\n System.out.println(min);\n }\n}",
"import java.util.Arrays;",
"Arrays",
"java.util",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next(); // s muss t enthaalen\n int count = 0;\n int min = 9999;\n for (int i = 0; i <= s.length()-t.length(); i++) {\n count = 0;\n for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)==t.charAt(j)){\n \n } else {\n count++;\n \n }\n \n }\n if(min>count){\n min = count;\n }\n }\n if(s.contains(t)){\n System.out.println(0);\n } else\n System.out.println(min);\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next(); // s muss t enthaalen\n int count = 0;\n int min = 9999;\n for (int i = 0; i <= s.length()-t.length(); i++) {\n count = 0;\n for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)==t.charAt(j)){\n \n } else {\n count++;\n \n }\n \n }\n if(min>count){\n min = count;\n }\n }\n if(s.contains(t)){\n System.out.println(0);\n } else\n System.out.println(min);\n }",
"main",
"{\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next(); // s muss t enthaalen\n int count = 0;\n int min = 9999;\n for (int i = 0; i <= s.length()-t.length(); i++) {\n count = 0;\n for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)==t.charAt(j)){\n \n } else {\n count++;\n \n }\n \n }\n if(min>count){\n min = count;\n }\n }\n if(s.contains(t)){\n System.out.println(0);\n } else\n System.out.println(min);\n }",
"Scanner in = new Scanner(System.in);",
"in",
"new Scanner(System.in)",
"String s = in.next();",
"s",
"in.next()",
"in.next",
"in",
"String t = in.next();",
"t",
"in.next()",
"in.next",
"in",
"int count = 0;",
"count",
"0",
"int min = 9999;",
"min",
"9999",
"for (int i = 0; i <= s.length()-t.length(); i++) {\n count = 0;\n for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)==t.charAt(j)){\n \n } else {\n count++;\n \n }\n \n }\n if(min>count){\n min = count;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= s.length()-t.length()",
"i",
"s.length()-t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"i++",
"i++",
"i",
"{\n count = 0;\n for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)==t.charAt(j)){\n \n } else {\n count++;\n \n }\n \n }\n if(min>count){\n min = count;\n }\n }",
"{\n count = 0;\n for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)==t.charAt(j)){\n \n } else {\n count++;\n \n }\n \n }\n if(min>count){\n min = count;\n }\n }",
"count = 0",
"count",
"0",
"for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)==t.charAt(j)){\n \n } else {\n count++;\n \n }\n \n }",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n if(s.charAt(i+j)==t.charAt(j)){\n \n } else {\n count++;\n \n }\n \n }",
"{\n if(s.charAt(i+j)==t.charAt(j)){\n \n } else {\n count++;\n \n }\n \n }",
"if(s.charAt(i+j)==t.charAt(j)){\n \n } else {\n count++;\n \n }",
"s.charAt(i+j)==t.charAt(j)",
"s.charAt(i+j)",
"s.charAt",
"s",
"i+j",
"i",
"j",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"{\n \n }",
"{\n count++;\n \n }",
"count++",
"count",
"if(min>count){\n min = count;\n }",
"min>count",
"min",
"count",
"{\n min = count;\n }",
"min = count",
"min",
"count",
"if(s.contains(t)){\n System.out.println(0);\n } else\n System.out.println(min);",
"s.contains(t)",
"s.contains",
"s",
"t",
"{\n System.out.println(0);\n }",
"System.out.println(0)",
"System.out.println",
"System.out",
"System",
"System.out",
"0",
"System.out.println(min)",
"System.out.println",
"System.out",
"System",
"System.out",
"min",
"String[] args",
"args",
"public class Main {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next(); // s muss t enthaalen\n int count = 0;\n int min = 9999;\n for (int i = 0; i <= s.length()-t.length(); i++) {\n count = 0;\n for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)==t.charAt(j)){\n \n } else {\n count++;\n \n }\n \n }\n if(min>count){\n min = count;\n }\n }\n if(s.contains(t)){\n System.out.println(0);\n } else\n System.out.println(min);\n }\n}",
"public class Main {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next(); // s muss t enthaalen\n int count = 0;\n int min = 9999;\n for (int i = 0; i <= s.length()-t.length(); i++) {\n count = 0;\n for (int j = 0; j < t.length(); j++) {\n if(s.charAt(i+j)==t.charAt(j)){\n \n } else {\n count++;\n \n }\n \n }\n if(min>count){\n min = count;\n }\n }\n if(s.contains(t)){\n System.out.println(0);\n } else\n System.out.println(min);\n }\n}",
"Main"
]
|
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String s = in.next();
String t = in.next(); // s muss t enthaalen
int count = 0;
int min = 9999;
for (int i = 0; i <= s.length()-t.length(); i++) {
count = 0;
for (int j = 0; j < t.length(); j++) {
if(s.charAt(i+j)==t.charAt(j)){
} else {
count++;
}
}
if(min>count){
min = count;
}
}
if(s.contains(t)){
System.out.println(0);
} else
System.out.println(min);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
41,
13,
18,
13,
13,
41,
13,
18,
13,
13,
41,
13,
13,
11,
1,
41,
13,
17,
2,
2,
2,
13,
13,
17,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
2,
13,
13,
18,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
101,
5
],
[
101,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
16,
17
],
[
17,
18
],
[
8,
19
],
[
19,
20
],
[
19,
21
],
[
21,
22
],
[
22,
23
],
[
23,
24
],
[
24,
25
],
[
8,
26
],
[
26,
27
],
[
26,
28
],
[
28,
29
],
[
28,
30
],
[
8,
31
],
[
31,
32
],
[
31,
33
],
[
33,
34
],
[
33,
35
],
[
8,
36
],
[
36,
37
],
[
36,
38
],
[
8,
39
],
[
39,
40
],
[
40,
41
],
[
41,
42
],
[
41,
43
],
[
39,
44
],
[
44,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
45,
49
],
[
44,
50
],
[
39,
51
],
[
51,
52
],
[
52,
53
],
[
39,
54
],
[
55,
55
],
[
55,
56
],
[
56,
57
],
[
56,
58
],
[
55,
59
],
[
59,
60
],
[
60,
61
],
[
61,
62
],
[
61,
63
],
[
59,
64
],
[
64,
65
],
[
64,
66
],
[
59,
67
],
[
67,
68
],
[
68,
69
],
[
59,
70
],
[
71,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
74,
75
],
[
74,
76
],
[
76,
77
],
[
76,
78
],
[
73,
79
],
[
79,
80
],
[
79,
81
],
[
72,
82
],
[
82,
83
],
[
83,
84
],
[
55,
85
],
[
85,
86
],
[
85,
87
],
[
87,
88
],
[
88,
89
],
[
87,
90
],
[
87,
91
],
[
8,
92
],
[
92,
93
],
[
93,
94
],
[
94,
95
],
[
94,
96
],
[
92,
97
],
[
6,
98
],
[
98,
99
],
[
0,
100
],
[
100,
101
],
[
100,
102
]
]
| [
"import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n char[] s = sc.next().toCharArray();\n char[] t = sc.next().toCharArray();\n\n int n = s.length;\n int m = t.length;\n\n int min = m;\n for(int i=0; i+m-1<n; i++) {\n int a = 0;\n for(int j=0; j<m; j++) {\n if(s[i+j] != t[j]) {\n a++;\n }\n }\n min = Math.min(min, a);\n\n }\n\n System.out.println(min);\n\n }\n\n\n\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n char[] s = sc.next().toCharArray();\n char[] t = sc.next().toCharArray();\n\n int n = s.length;\n int m = t.length;\n\n int min = m;\n for(int i=0; i+m-1<n; i++) {\n int a = 0;\n for(int j=0; j<m; j++) {\n if(s[i+j] != t[j]) {\n a++;\n }\n }\n min = Math.min(min, a);\n\n }\n\n System.out.println(min);\n\n }\n\n\n\n}",
"Main",
"public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n char[] s = sc.next().toCharArray();\n char[] t = sc.next().toCharArray();\n\n int n = s.length;\n int m = t.length;\n\n int min = m;\n for(int i=0; i+m-1<n; i++) {\n int a = 0;\n for(int j=0; j<m; j++) {\n if(s[i+j] != t[j]) {\n a++;\n }\n }\n min = Math.min(min, a);\n\n }\n\n System.out.println(min);\n\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n char[] s = sc.next().toCharArray();\n char[] t = sc.next().toCharArray();\n\n int n = s.length;\n int m = t.length;\n\n int min = m;\n for(int i=0; i+m-1<n; i++) {\n int a = 0;\n for(int j=0; j<m; j++) {\n if(s[i+j] != t[j]) {\n a++;\n }\n }\n min = Math.min(min, a);\n\n }\n\n System.out.println(min);\n\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"char[] s = sc.next().toCharArray();",
"s",
"sc.next().toCharArray()",
"sc.next().toCharArray",
"sc.next()",
"sc.next",
"sc",
"char[] t = sc.next().toCharArray();",
"t",
"sc.next().toCharArray()",
"sc.next().toCharArray",
"sc.next()",
"sc.next",
"sc",
"int n = s.length;",
"n",
"s.length",
"s",
"s.length",
"int m = t.length;",
"m",
"t.length",
"t",
"t.length",
"int min = m;",
"min",
"m",
"for(int i=0; i+m-1<n; i++) {\n int a = 0;\n for(int j=0; j<m; j++) {\n if(s[i+j] != t[j]) {\n a++;\n }\n }\n min = Math.min(min, a);\n\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i+m-1<n",
"i+m-1",
"i+m",
"i",
"m",
"1",
"n",
"i++",
"i++",
"i",
"{\n int a = 0;\n for(int j=0; j<m; j++) {\n if(s[i+j] != t[j]) {\n a++;\n }\n }\n min = Math.min(min, a);\n\n }",
"{\n int a = 0;\n for(int j=0; j<m; j++) {\n if(s[i+j] != t[j]) {\n a++;\n }\n }\n min = Math.min(min, a);\n\n }",
"int a = 0;",
"a",
"0",
"for(int j=0; j<m; j++) {\n if(s[i+j] != t[j]) {\n a++;\n }\n }",
"int j=0;",
"int j=0;",
"j",
"0",
"j<m",
"j",
"m",
"j++",
"j++",
"j",
"{\n if(s[i+j] != t[j]) {\n a++;\n }\n }",
"{\n if(s[i+j] != t[j]) {\n a++;\n }\n }",
"if(s[i+j] != t[j]) {\n a++;\n }",
"s[i+j] != t[j]",
"s[i+j]",
"s",
"i+j",
"i",
"j",
"t[j]",
"t",
"j",
"{\n a++;\n }",
"a++",
"a",
"min = Math.min(min, a)",
"min",
"Math.min(min, a)",
"Math.min",
"Math",
"min",
"a",
"System.out.println(min)",
"System.out.println",
"System.out",
"System",
"System.out",
"min",
"String[] args",
"args",
"public class Main {\n\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n char[] s = sc.next().toCharArray();\n char[] t = sc.next().toCharArray();\n\n int n = s.length;\n int m = t.length;\n\n int min = m;\n for(int i=0; i+m-1<n; i++) {\n int a = 0;\n for(int j=0; j<m; j++) {\n if(s[i+j] != t[j]) {\n a++;\n }\n }\n min = Math.min(min, a);\n\n }\n\n System.out.println(min);\n\n }\n\n\n\n}",
"public class Main {\n\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n char[] s = sc.next().toCharArray();\n char[] t = sc.next().toCharArray();\n\n int n = s.length;\n int m = t.length;\n\n int min = m;\n for(int i=0; i+m-1<n; i++) {\n int a = 0;\n for(int j=0; j<m; j++) {\n if(s[i+j] != t[j]) {\n a++;\n }\n }\n min = Math.min(min, a);\n\n }\n\n System.out.println(min);\n\n }\n\n\n\n}",
"Main"
]
| import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
char[] s = sc.next().toCharArray();
char[] t = sc.next().toCharArray();
int n = s.length;
int m = t.length;
int min = m;
for(int i=0; i+m-1<n; i++) {
int a = 0;
for(int j=0; j<m; j++) {
if(s[i+j] != t[j]) {
a++;
}
}
min = Math.min(min, a);
}
System.out.println(min);
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
30,
40,
13,
29,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
18,
13,
13,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
2,
13,
13,
0,
13,
4,
18,
13,
13,
4,
13,
13,
13,
4,
13,
13,
23,
13,
12,
13,
30,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
4,
18,
18,
13,
13,
12,
13,
30,
4,
18,
18,
13,
13,
13,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
18,
13,
13,
28,
13,
13,
30,
0,
13,
4,
18,
13,
13,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
18,
13,
13,
13,
4,
13,
29,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
29,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
397,
11
],
[
397,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
14,
18
],
[
18,
19
],
[
19,
20
],
[
20,
21
],
[
20,
22
],
[
18,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
26,
27
],
[
18,
28
],
[
28,
29
],
[
29,
30
],
[
18,
31
],
[
32,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
35,
36
],
[
36,
37
],
[
35,
38
],
[
34,
39
],
[
39,
40
],
[
40,
41
],
[
39,
42
],
[
33,
43
],
[
43,
44
],
[
44,
45
],
[
14,
46
],
[
46,
47
],
[
12,
48
],
[
48,
49
],
[
12,
50
],
[
50,
51
],
[
397,
52
],
[
52,
53
],
[
52,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
54,
58
],
[
58,
59
],
[
58,
60
],
[
60,
61
],
[
61,
62
],
[
54,
63
],
[
63,
64
],
[
63,
65
],
[
65,
66
],
[
66,
67
],
[
54,
68
],
[
68,
69
],
[
68,
70
],
[
70,
71
],
[
71,
72
],
[
54,
73
],
[
73,
74
],
[
73,
75
],
[
75,
76
],
[
75,
77
],
[
54,
78
],
[
78,
79
],
[
78,
80
],
[
80,
81
],
[
81,
82
],
[
54,
83
],
[
83,
84
],
[
84,
85
],
[
85,
86
],
[
85,
87
],
[
83,
88
],
[
88,
89
],
[
88,
90
],
[
90,
91
],
[
90,
92
],
[
83,
93
],
[
93,
94
],
[
94,
95
],
[
83,
96
],
[
97,
97
],
[
97,
98
],
[
98,
99
],
[
98,
100
],
[
100,
101
],
[
101,
102
],
[
100,
103
],
[
100,
104
],
[
104,
105
],
[
104,
106
],
[
97,
107
],
[
107,
108
],
[
107,
109
],
[
109,
110
],
[
110,
111
],
[
109,
112
],
[
109,
113
],
[
113,
114
],
[
113,
115
],
[
113,
116
],
[
54,
117
],
[
117,
118
],
[
117,
119
],
[
52,
120
],
[
120,
121
],
[
397,
122
],
[
122,
123
],
[
122,
124
],
[
124,
125
],
[
125,
126
],
[
126,
127
],
[
127,
128
],
[
127,
129
],
[
125,
130
],
[
122,
131
],
[
131,
132
],
[
397,
133
],
[
133,
134
],
[
133,
135
],
[
135,
136
],
[
136,
137
],
[
137,
138
],
[
138,
139
],
[
138,
140
],
[
397,
141
],
[
141,
142
],
[
141,
143
],
[
143,
144
],
[
144,
145
],
[
145,
146
],
[
146,
147
],
[
146,
148
],
[
144,
149
],
[
141,
150
],
[
150,
151
],
[
397,
152
],
[
152,
153
],
[
152,
154
],
[
154,
155
],
[
152,
156
],
[
156,
157
],
[
152,
158
],
[
158,
159
],
[
158,
160
],
[
160,
161
],
[
161,
162
],
[
161,
163
],
[
152,
164
],
[
164,
165
],
[
164,
166
],
[
166,
167
],
[
167,
168
],
[
168,
169
],
[
169,
170
],
[
169,
171
],
[
168,
172
],
[
172,
173
],
[
173,
174
],
[
174,
175
],
[
167,
176
],
[
176,
177
],
[
177,
178
],
[
178,
179
],
[
178,
180
],
[
180,
181
],
[
181,
182
],
[
182,
183
],
[
177,
184
],
[
184,
185
],
[
185,
186
],
[
185,
187
],
[
166,
188
],
[
188,
189
],
[
189,
190
],
[
190,
191
],
[
152,
192
],
[
192,
193
],
[
192,
194
],
[
194,
195
],
[
195,
196
],
[
196,
197
],
[
197,
198
],
[
196,
199
],
[
199,
200
],
[
152,
201
],
[
201,
202
],
[
201,
203
],
[
203,
204
],
[
204,
205
],
[
205,
206
],
[
206,
207
],
[
205,
208
],
[
208,
209
],
[
152,
210
],
[
210,
211
],
[
210,
212
],
[
212,
213
],
[
213,
214
],
[
213,
215
],
[
215,
216
],
[
215,
217
],
[
212,
218
],
[
218,
219
],
[
218,
220
],
[
218,
221
],
[
221,
222
],
[
222,
223
],
[
222,
224
],
[
224,
225
],
[
225,
226
],
[
224,
227
],
[
224,
228
],
[
212,
229
],
[
229,
230
],
[
210,
231
],
[
231,
232
],
[
152,
233
],
[
233,
234
],
[
233,
235
],
[
235,
236
],
[
236,
237
],
[
236,
238
],
[
235,
240
],
[
240,
241
],
[
241,
242
],
[
242,
243
],
[
242,
244
],
[
240,
245
],
[
245,
246
],
[
245,
247
],
[
240,
248
],
[
248,
249
],
[
249,
250
],
[
240,
251
],
[
251,
252
],
[
252,
253
],
[
253,
254
],
[
253,
255
],
[
252,
256
],
[
256,
257
],
[
235,
258
],
[
258,
259
],
[
233,
260
],
[
260,
261
],
[
152,
262
],
[
262,
263
],
[
262,
264
],
[
264,
265
],
[
265,
266
],
[
265,
267
],
[
264,
269
],
[
269,
270
],
[
270,
271
],
[
271,
272
],
[
271,
273
],
[
269,
274
],
[
274,
275
],
[
274,
276
],
[
269,
277
],
[
277,
278
],
[
278,
279
],
[
269,
280
],
[
280,
281
],
[
281,
282
],
[
282,
283
],
[
282,
284
],
[
281,
285
],
[
285,
286
],
[
264,
287
],
[
287,
288
],
[
262,
289
],
[
289,
290
],
[
152,
291
],
[
291,
292
],
[
291,
293
],
[
293,
294
],
[
294,
295
],
[
294,
296
],
[
293,
299
],
[
299,
300
],
[
300,
301
],
[
301,
302
],
[
301,
303
],
[
299,
304
],
[
304,
305
],
[
304,
306
],
[
299,
307
],
[
307,
308
],
[
308,
309
],
[
299,
310
],
[
310,
311
],
[
311,
312
],
[
312,
313
],
[
313,
314
],
[
313,
315
],
[
311,
316
],
[
316,
317
],
[
316,
318
],
[
311,
319
],
[
319,
320
],
[
320,
321
],
[
311,
322
],
[
322,
323
],
[
323,
324
],
[
324,
325
],
[
325,
326
],
[
325,
327
],
[
324,
328
],
[
323,
329
],
[
329,
330
],
[
293,
331
],
[
331,
332
],
[
291,
333
],
[
333,
334
],
[
291,
335
],
[
335,
336
],
[
152,
337
],
[
337,
338
],
[
337,
339
],
[
339,
340
],
[
340,
341
],
[
340,
342
],
[
339,
344
],
[
344,
345
],
[
345,
346
],
[
346,
347
],
[
346,
348
],
[
344,
349
],
[
349,
350
],
[
349,
351
],
[
344,
352
],
[
352,
353
],
[
353,
354
],
[
344,
355
],
[
355,
356
],
[
356,
357
],
[
357,
358
],
[
357,
359
],
[
356,
360
],
[
360,
361
],
[
339,
362
],
[
362,
363
],
[
337,
364
],
[
364,
365
],
[
152,
366
],
[
366,
367
],
[
366,
368
],
[
368,
369
],
[
369,
370
],
[
370,
371
],
[
371,
372
],
[
370,
373
],
[
373,
374
],
[
152,
375
],
[
375,
376
],
[
375,
377
],
[
377,
378
],
[
378,
379
],
[
378,
380
],
[
377,
381
],
[
381,
382
],
[
382,
383
],
[
382,
384
],
[
384,
385
],
[
385,
386
],
[
386,
387
],
[
381,
388
],
[
388,
389
],
[
389,
390
],
[
389,
391
],
[
391,
392
],
[
392,
393
],
[
377,
394
],
[
394,
395
],
[
0,
396
],
[
396,
397
],
[
396,
398
]
]
| [
"import java.util.*;\nimport java.io.*;\nimport java.math.*;\n\t public class Main {\n\t \tstatic int check(String s, String t) {\n\t \t\tint count = 0;\n\t \t\tfor(int i = 0;i<s.length();i++) {\n\t \t\t\tif(s.charAt(i) != t.charAt(i)) {\n\t \t\t\t\tcount++;\n\t \t\t\t}\n\t \t\t}\n\t \t\treturn count;\n\t \t}\n\t public static void main(String args[]) throws IOException {\n\t \tFastReader sc = new FastReader();\n\t \t\n\t \tString s = sc.next();\n\t \tString t = sc.next();\n\t \tint n = s.length();\n\t \tint min = Integer.MAX_VALUE;\n\t \tint nt = t.length();\n\t \tfor(int i = 0;i<=n-nt;i++) {\n\t \t\tString res = s.substring(i, i + nt);\n\t \t\tmin = Math.min(min, check(res, t));\n\t \t}\n\t \tpn(min);\n\t }\n\t static void p(Object p){System.out.print(p);}\n\t static void pn(){System.out.println();}\n\t static void pn(Object o){System.out.println(o);}\n\t \n\t static class FastReader {\n\t static BufferedReader br;\n\t StringTokenizer st;\n\t public FastReader() {\n\t br = new BufferedReader(new InputStreamReader(System.in));\n\t }\n\t \n\t String next(){\n\t while (st == null || !st.hasMoreElements()) {\n\t try{\n\t st = new StringTokenizer(br.readLine());\n\t }\n\t catch (IOException e) {\n\t e.printStackTrace();\n\t }}\n\t return st.nextToken();\n\t }\n\t \n\t int nextInt(){ \n\t return Integer.parseInt(next());\n\t }\n\t \n\t long nextLong(){ \n\t return Long.parseLong(next());\n\t }\n\t \n\t static int max(int[] a){\n\t int max = Integer.MIN_VALUE;\n\t for(int i : a) max = Math.max(max, i);\n\t return max;\n\t }\n\t \n\t public int[] readIntArray(int n) {\n\t int[] arr = new int[n];\n\t for(int i=0; i<n; ++i) arr[i]=nextInt();\n\t return arr;\n\t }\n\t \n\t public long[] readLongArray(int n){\n\t long[] arr = new long[n];\n\t for(int i=0; i<n; ++i) arr[i]=nextLong();\n\t return arr;\n\t }\n\t \n\t public int[][] readIntArray(int m, int n){\n\t int[][] arr = new int[m][n];\n\t for(int i = 0;i<m;i++) \n\t for(int j = 0;j<n;j++) arr[i][j] = nextInt();\n\t return arr;\n\t }\n\t \n\t public String[] readStringArray(int n) {\n\t String[] arr = new String[n];\n\t for(int i=0; i<n; ++i) arr[i]= nextLine();\n\t return arr;\n\t }\n\t \n\t double nextDouble() {return Double.parseDouble(next());}\n\t \n\t String nextLine() {\n\t String str = \"\";\n\t try{str = br.readLine();}\n\t catch (IOException e) {e.printStackTrace();}\n\t return str;}}\n\t }",
"import java.util.*;",
"util.*",
"java",
"import java.io.*;",
"io.*",
"java",
"import java.math.*;",
"math.*",
"java",
"public class Main {\n\t \tstatic int check(String s, String t) {\n\t \t\tint count = 0;\n\t \t\tfor(int i = 0;i<s.length();i++) {\n\t \t\t\tif(s.charAt(i) != t.charAt(i)) {\n\t \t\t\t\tcount++;\n\t \t\t\t}\n\t \t\t}\n\t \t\treturn count;\n\t \t}\n\t public static void main(String args[]) throws IOException {\n\t \tFastReader sc = new FastReader();\n\t \t\n\t \tString s = sc.next();\n\t \tString t = sc.next();\n\t \tint n = s.length();\n\t \tint min = Integer.MAX_VALUE;\n\t \tint nt = t.length();\n\t \tfor(int i = 0;i<=n-nt;i++) {\n\t \t\tString res = s.substring(i, i + nt);\n\t \t\tmin = Math.min(min, check(res, t));\n\t \t}\n\t \tpn(min);\n\t }\n\t static void p(Object p){System.out.print(p);}\n\t static void pn(){System.out.println();}\n\t static void pn(Object o){System.out.println(o);}\n\t \n\t static class FastReader {\n\t static BufferedReader br;\n\t StringTokenizer st;\n\t public FastReader() {\n\t br = new BufferedReader(new InputStreamReader(System.in));\n\t }\n\t \n\t String next(){\n\t while (st == null || !st.hasMoreElements()) {\n\t try{\n\t st = new StringTokenizer(br.readLine());\n\t }\n\t catch (IOException e) {\n\t e.printStackTrace();\n\t }}\n\t return st.nextToken();\n\t }\n\t \n\t int nextInt(){ \n\t return Integer.parseInt(next());\n\t }\n\t \n\t long nextLong(){ \n\t return Long.parseLong(next());\n\t }\n\t \n\t static int max(int[] a){\n\t int max = Integer.MIN_VALUE;\n\t for(int i : a) max = Math.max(max, i);\n\t return max;\n\t }\n\t \n\t public int[] readIntArray(int n) {\n\t int[] arr = new int[n];\n\t for(int i=0; i<n; ++i) arr[i]=nextInt();\n\t return arr;\n\t }\n\t \n\t public long[] readLongArray(int n){\n\t long[] arr = new long[n];\n\t for(int i=0; i<n; ++i) arr[i]=nextLong();\n\t return arr;\n\t }\n\t \n\t public int[][] readIntArray(int m, int n){\n\t int[][] arr = new int[m][n];\n\t for(int i = 0;i<m;i++) \n\t for(int j = 0;j<n;j++) arr[i][j] = nextInt();\n\t return arr;\n\t }\n\t \n\t public String[] readStringArray(int n) {\n\t String[] arr = new String[n];\n\t for(int i=0; i<n; ++i) arr[i]= nextLine();\n\t return arr;\n\t }\n\t \n\t double nextDouble() {return Double.parseDouble(next());}\n\t \n\t String nextLine() {\n\t String str = \"\";\n\t try{str = br.readLine();}\n\t catch (IOException e) {e.printStackTrace();}\n\t return str;}}\n\t }",
"Main",
"static int check(String s, String t) {\n\t \t\tint count = 0;\n\t \t\tfor(int i = 0;i<s.length();i++) {\n\t \t\t\tif(s.charAt(i) != t.charAt(i)) {\n\t \t\t\t\tcount++;\n\t \t\t\t}\n\t \t\t}\n\t \t\treturn count;\n\t \t}",
"check",
"{\n\t \t\tint count = 0;\n\t \t\tfor(int i = 0;i<s.length();i++) {\n\t \t\t\tif(s.charAt(i) != t.charAt(i)) {\n\t \t\t\t\tcount++;\n\t \t\t\t}\n\t \t\t}\n\t \t\treturn count;\n\t \t}",
"int count = 0;",
"count",
"0",
"for(int i = 0;i<s.length();i++) {\n\t \t\t\tif(s.charAt(i) != t.charAt(i)) {\n\t \t\t\t\tcount++;\n\t \t\t\t}\n\t \t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i<s.length()",
"i",
"s.length()",
"s.length",
"s",
"i++",
"i++",
"i",
"{\n\t \t\t\tif(s.charAt(i) != t.charAt(i)) {\n\t \t\t\t\tcount++;\n\t \t\t\t}\n\t \t\t}",
"{\n\t \t\t\tif(s.charAt(i) != t.charAt(i)) {\n\t \t\t\t\tcount++;\n\t \t\t\t}\n\t \t\t}",
"if(s.charAt(i) != t.charAt(i)) {\n\t \t\t\t\tcount++;\n\t \t\t\t}",
"s.charAt(i) != t.charAt(i)",
"s.charAt(i)",
"s.charAt",
"s",
"i",
"t.charAt(i)",
"t.charAt",
"t",
"i",
"{\n\t \t\t\t\tcount++;\n\t \t\t\t}",
"count++",
"count",
"return count;",
"count",
"String s",
"s",
"String t",
"t",
"public static void main(String args[]) throws IOException {\n\t \tFastReader sc = new FastReader();\n\t \t\n\t \tString s = sc.next();\n\t \tString t = sc.next();\n\t \tint n = s.length();\n\t \tint min = Integer.MAX_VALUE;\n\t \tint nt = t.length();\n\t \tfor(int i = 0;i<=n-nt;i++) {\n\t \t\tString res = s.substring(i, i + nt);\n\t \t\tmin = Math.min(min, check(res, t));\n\t \t}\n\t \tpn(min);\n\t }",
"main",
"{\n\t \tFastReader sc = new FastReader();\n\t \t\n\t \tString s = sc.next();\n\t \tString t = sc.next();\n\t \tint n = s.length();\n\t \tint min = Integer.MAX_VALUE;\n\t \tint nt = t.length();\n\t \tfor(int i = 0;i<=n-nt;i++) {\n\t \t\tString res = s.substring(i, i + nt);\n\t \t\tmin = Math.min(min, check(res, t));\n\t \t}\n\t \tpn(min);\n\t }",
"FastReader sc = new FastReader();",
"sc",
"new FastReader()",
"String s = sc.next();",
"s",
"sc.next()",
"sc.next",
"sc",
"String t = sc.next();",
"t",
"sc.next()",
"sc.next",
"sc",
"int n = s.length();",
"n",
"s.length()",
"s.length",
"s",
"int min = Integer.MAX_VALUE;",
"min",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"int nt = t.length();",
"nt",
"t.length()",
"t.length",
"t",
"for(int i = 0;i<=n-nt;i++) {\n\t \t\tString res = s.substring(i, i + nt);\n\t \t\tmin = Math.min(min, check(res, t));\n\t \t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i<=n-nt",
"i",
"n-nt",
"n",
"nt",
"i++",
"i++",
"i",
"{\n\t \t\tString res = s.substring(i, i + nt);\n\t \t\tmin = Math.min(min, check(res, t));\n\t \t}",
"{\n\t \t\tString res = s.substring(i, i + nt);\n\t \t\tmin = Math.min(min, check(res, t));\n\t \t}",
"String res = s.substring(i, i + nt);",
"res",
"s.substring(i, i + nt)",
"s.substring",
"s",
"i",
"i + nt",
"i",
"nt",
"min = Math.min(min, check(res, t))",
"min",
"Math.min(min, check(res, t))",
"Math.min",
"Math",
"min",
"check(res, t)",
"check",
"res",
"t",
"pn(min)",
"pn",
"min",
"String args[]",
"args",
"static void p(Object p){System.out.print(p);}",
"p",
"{System.out.print(p);}",
"System.out.print(p)",
"System.out.print",
"System.out",
"System",
"System.out",
"p",
"Object p",
"p",
"static void pn(){System.out.println();}",
"pn",
"{System.out.println();}",
"System.out.println()",
"System.out.println",
"System.out",
"System",
"System.out",
"static void pn(Object o){System.out.println(o);}",
"pn",
"{System.out.println(o);}",
"System.out.println(o)",
"System.out.println",
"System.out",
"System",
"System.out",
"o",
"Object o",
"o",
"static class FastReader {\n\t static BufferedReader br;\n\t StringTokenizer st;\n\t public FastReader() {\n\t br = new BufferedReader(new InputStreamReader(System.in));\n\t }\n\t \n\t String next(){\n\t while (st == null || !st.hasMoreElements()) {\n\t try{\n\t st = new StringTokenizer(br.readLine());\n\t }\n\t catch (IOException e) {\n\t e.printStackTrace();\n\t }}\n\t return st.nextToken();\n\t }\n\t \n\t int nextInt(){ \n\t return Integer.parseInt(next());\n\t }\n\t \n\t long nextLong(){ \n\t return Long.parseLong(next());\n\t }\n\t \n\t static int max(int[] a){\n\t int max = Integer.MIN_VALUE;\n\t for(int i : a) max = Math.max(max, i);\n\t return max;\n\t }\n\t \n\t public int[] readIntArray(int n) {\n\t int[] arr = new int[n];\n\t for(int i=0; i<n; ++i) arr[i]=nextInt();\n\t return arr;\n\t }\n\t \n\t public long[] readLongArray(int n){\n\t long[] arr = new long[n];\n\t for(int i=0; i<n; ++i) arr[i]=nextLong();\n\t return arr;\n\t }\n\t \n\t public int[][] readIntArray(int m, int n){\n\t int[][] arr = new int[m][n];\n\t for(int i = 0;i<m;i++) \n\t for(int j = 0;j<n;j++) arr[i][j] = nextInt();\n\t return arr;\n\t }\n\t \n\t public String[] readStringArray(int n) {\n\t String[] arr = new String[n];\n\t for(int i=0; i<n; ++i) arr[i]= nextLine();\n\t return arr;\n\t }\n\t \n\t double nextDouble() {return Double.parseDouble(next());}\n\t \n\t String nextLine() {\n\t String str = \"\";\n\t try{str = br.readLine();}\n\t catch (IOException e) {e.printStackTrace();}\n\t return str;}}",
"FastReader",
"static BufferedReader br;",
"br",
"StringTokenizer st;",
"st",
"public FastReader() {\n\t br = new BufferedReader(new InputStreamReader(System.in));\n\t }",
"FastReader",
"{\n\t br = new BufferedReader(new InputStreamReader(System.in));\n\t }",
"br = new BufferedReader(new InputStreamReader(System.in))",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"String next(){\n\t while (st == null || !st.hasMoreElements()) {\n\t try{\n\t st = new StringTokenizer(br.readLine());\n\t }\n\t catch (IOException e) {\n\t e.printStackTrace();\n\t }}\n\t return st.nextToken();\n\t }",
"next",
"{\n\t while (st == null || !st.hasMoreElements()) {\n\t try{\n\t st = new StringTokenizer(br.readLine());\n\t }\n\t catch (IOException e) {\n\t e.printStackTrace();\n\t }}\n\t return st.nextToken();\n\t }",
"while (st == null || !st.hasMoreElements()) {\n\t try{\n\t st = new StringTokenizer(br.readLine());\n\t }\n\t catch (IOException e) {\n\t e.printStackTrace();\n\t }}",
"st == null || !st.hasMoreElements()",
"st == null",
"st",
"null",
"!st.hasMoreElements()",
"st.hasMoreElements()",
"st.hasMoreElements",
"st",
"{\n\t try{\n\t st = new StringTokenizer(br.readLine());\n\t }\n\t catch (IOException e) {\n\t e.printStackTrace();\n\t }}",
"try{\n\t st = new StringTokenizer(br.readLine());\n\t }\n\t catch (IOException e) {\n\t e.printStackTrace();\n\t }",
"catch (IOException e) {\n\t e.printStackTrace();\n\t }",
"IOException e",
"{\n\t e.printStackTrace();\n\t }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n\t st = new StringTokenizer(br.readLine());\n\t }",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"int nextInt(){ \n\t return Integer.parseInt(next());\n\t }",
"nextInt",
"{ \n\t return Integer.parseInt(next());\n\t }",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"long nextLong(){ \n\t return Long.parseLong(next());\n\t }",
"nextLong",
"{ \n\t return Long.parseLong(next());\n\t }",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"static int max(int[] a){\n\t int max = Integer.MIN_VALUE;\n\t for(int i : a) max = Math.max(max, i);\n\t return max;\n\t }",
"max",
"{\n\t int max = Integer.MIN_VALUE;\n\t for(int i : a) max = Math.max(max, i);\n\t return max;\n\t }",
"int max = Integer.MIN_VALUE;",
"max",
"Integer.MIN_VALUE",
"Integer",
"Integer.MIN_VALUE",
"for(int i : a) max = Math.max(max, i);",
"int i",
"a",
"max = Math.max(max, i);",
"max = Math.max(max, i)",
"max",
"Math.max(max, i)",
"Math.max",
"Math",
"max",
"i",
"return max;",
"max",
"int[] a",
"a",
"public int[] readIntArray(int n) {\n\t int[] arr = new int[n];\n\t for(int i=0; i<n; ++i) arr[i]=nextInt();\n\t return arr;\n\t }",
"readIntArray",
"{\n\t int[] arr = new int[n];\n\t for(int i=0; i<n; ++i) arr[i]=nextInt();\n\t return arr;\n\t }",
"int[] arr = new int[n];",
"arr",
"new int[n]",
"n",
"for(int i=0; i<n; ++i) arr[i]=nextInt();",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"++i",
"++i",
"i",
"arr[i]=nextInt();",
"arr[i]=nextInt()",
"arr[i]",
"arr",
"i",
"nextInt()",
"nextInt",
"return arr;",
"arr",
"int n",
"n",
"public long[] readLongArray(int n){\n\t long[] arr = new long[n];\n\t for(int i=0; i<n; ++i) arr[i]=nextLong();\n\t return arr;\n\t }",
"readLongArray",
"{\n\t long[] arr = new long[n];\n\t for(int i=0; i<n; ++i) arr[i]=nextLong();\n\t return arr;\n\t }",
"long[] arr = new long[n];",
"arr",
"new long[n]",
"n",
"for(int i=0; i<n; ++i) arr[i]=nextLong();",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"++i",
"++i",
"i",
"arr[i]=nextLong();",
"arr[i]=nextLong()",
"arr[i]",
"arr",
"i",
"nextLong()",
"nextLong",
"return arr;",
"arr",
"int n",
"n",
"public int[][] readIntArray(int m, int n){\n\t int[][] arr = new int[m][n];\n\t for(int i = 0;i<m;i++) \n\t for(int j = 0;j<n;j++) arr[i][j] = nextInt();\n\t return arr;\n\t }",
"readIntArray",
"{\n\t int[][] arr = new int[m][n];\n\t for(int i = 0;i<m;i++) \n\t for(int j = 0;j<n;j++) arr[i][j] = nextInt();\n\t return arr;\n\t }",
"int[][] arr = new int[m][n];",
"arr",
"new int[m][n]",
"m",
"n",
"for(int i = 0;i<m;i++) \n\t for(int j = 0;j<n;j++) arr[i][j] = nextInt();",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i<m",
"i",
"m",
"i++",
"i++",
"i",
"for(int j = 0;j<n;j++) arr[i][j] = nextInt();",
"for(int j = 0;j<n;j++) arr[i][j] = nextInt();",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j<n",
"j",
"n",
"j++",
"j++",
"j",
"arr[i][j] = nextInt();",
"arr[i][j] = nextInt()",
"arr[i][j]",
"arr[i]",
"arr",
"i",
"j",
"nextInt()",
"nextInt",
"return arr;",
"arr",
"int m",
"m",
"int n",
"n",
"public String[] readStringArray(int n) {\n\t String[] arr = new String[n];\n\t for(int i=0; i<n; ++i) arr[i]= nextLine();\n\t return arr;\n\t }",
"readStringArray",
"{\n\t String[] arr = new String[n];\n\t for(int i=0; i<n; ++i) arr[i]= nextLine();\n\t return arr;\n\t }",
"String[] arr = new String[n];",
"arr",
"new String[n]",
"n",
"for(int i=0; i<n; ++i) arr[i]= nextLine();",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"++i",
"++i",
"i",
"arr[i]= nextLine();",
"arr[i]= nextLine()",
"arr[i]",
"arr",
"i",
"nextLine()",
"nextLine",
"return arr;",
"arr",
"int n",
"n",
"double nextDouble() {return Double.parseDouble(next());}",
"nextDouble",
"{return Double.parseDouble(next());}",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"String nextLine() {\n\t String str = \"\";\n\t try{str = br.readLine();}\n\t catch (IOException e) {e.printStackTrace();}\n\t return str;}",
"nextLine",
"{\n\t String str = \"\";\n\t try{str = br.readLine();}\n\t catch (IOException e) {e.printStackTrace();}\n\t return str;}",
"String str = \"\";",
"str",
"\"\"",
"try{str = br.readLine();}\n\t catch (IOException e) {e.printStackTrace();}",
"catch (IOException e) {e.printStackTrace();}",
"IOException e",
"{e.printStackTrace();}",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{str = br.readLine();}",
"str = br.readLine()",
"str",
"br.readLine()",
"br.readLine",
"br",
"return str;",
"str",
"public class Main {\n\t \tstatic int check(String s, String t) {\n\t \t\tint count = 0;\n\t \t\tfor(int i = 0;i<s.length();i++) {\n\t \t\t\tif(s.charAt(i) != t.charAt(i)) {\n\t \t\t\t\tcount++;\n\t \t\t\t}\n\t \t\t}\n\t \t\treturn count;\n\t \t}\n\t public static void main(String args[]) throws IOException {\n\t \tFastReader sc = new FastReader();\n\t \t\n\t \tString s = sc.next();\n\t \tString t = sc.next();\n\t \tint n = s.length();\n\t \tint min = Integer.MAX_VALUE;\n\t \tint nt = t.length();\n\t \tfor(int i = 0;i<=n-nt;i++) {\n\t \t\tString res = s.substring(i, i + nt);\n\t \t\tmin = Math.min(min, check(res, t));\n\t \t}\n\t \tpn(min);\n\t }\n\t static void p(Object p){System.out.print(p);}\n\t static void pn(){System.out.println();}\n\t static void pn(Object o){System.out.println(o);}\n\t \n\t static class FastReader {\n\t static BufferedReader br;\n\t StringTokenizer st;\n\t public FastReader() {\n\t br = new BufferedReader(new InputStreamReader(System.in));\n\t }\n\t \n\t String next(){\n\t while (st == null || !st.hasMoreElements()) {\n\t try{\n\t st = new StringTokenizer(br.readLine());\n\t }\n\t catch (IOException e) {\n\t e.printStackTrace();\n\t }}\n\t return st.nextToken();\n\t }\n\t \n\t int nextInt(){ \n\t return Integer.parseInt(next());\n\t }\n\t \n\t long nextLong(){ \n\t return Long.parseLong(next());\n\t }\n\t \n\t static int max(int[] a){\n\t int max = Integer.MIN_VALUE;\n\t for(int i : a) max = Math.max(max, i);\n\t return max;\n\t }\n\t \n\t public int[] readIntArray(int n) {\n\t int[] arr = new int[n];\n\t for(int i=0; i<n; ++i) arr[i]=nextInt();\n\t return arr;\n\t }\n\t \n\t public long[] readLongArray(int n){\n\t long[] arr = new long[n];\n\t for(int i=0; i<n; ++i) arr[i]=nextLong();\n\t return arr;\n\t }\n\t \n\t public int[][] readIntArray(int m, int n){\n\t int[][] arr = new int[m][n];\n\t for(int i = 0;i<m;i++) \n\t for(int j = 0;j<n;j++) arr[i][j] = nextInt();\n\t return arr;\n\t }\n\t \n\t public String[] readStringArray(int n) {\n\t String[] arr = new String[n];\n\t for(int i=0; i<n; ++i) arr[i]= nextLine();\n\t return arr;\n\t }\n\t \n\t double nextDouble() {return Double.parseDouble(next());}\n\t \n\t String nextLine() {\n\t String str = \"\";\n\t try{str = br.readLine();}\n\t catch (IOException e) {e.printStackTrace();}\n\t return str;}}\n\t }",
"public class Main {\n\t \tstatic int check(String s, String t) {\n\t \t\tint count = 0;\n\t \t\tfor(int i = 0;i<s.length();i++) {\n\t \t\t\tif(s.charAt(i) != t.charAt(i)) {\n\t \t\t\t\tcount++;\n\t \t\t\t}\n\t \t\t}\n\t \t\treturn count;\n\t \t}\n\t public static void main(String args[]) throws IOException {\n\t \tFastReader sc = new FastReader();\n\t \t\n\t \tString s = sc.next();\n\t \tString t = sc.next();\n\t \tint n = s.length();\n\t \tint min = Integer.MAX_VALUE;\n\t \tint nt = t.length();\n\t \tfor(int i = 0;i<=n-nt;i++) {\n\t \t\tString res = s.substring(i, i + nt);\n\t \t\tmin = Math.min(min, check(res, t));\n\t \t}\n\t \tpn(min);\n\t }\n\t static void p(Object p){System.out.print(p);}\n\t static void pn(){System.out.println();}\n\t static void pn(Object o){System.out.println(o);}\n\t \n\t static class FastReader {\n\t static BufferedReader br;\n\t StringTokenizer st;\n\t public FastReader() {\n\t br = new BufferedReader(new InputStreamReader(System.in));\n\t }\n\t \n\t String next(){\n\t while (st == null || !st.hasMoreElements()) {\n\t try{\n\t st = new StringTokenizer(br.readLine());\n\t }\n\t catch (IOException e) {\n\t e.printStackTrace();\n\t }}\n\t return st.nextToken();\n\t }\n\t \n\t int nextInt(){ \n\t return Integer.parseInt(next());\n\t }\n\t \n\t long nextLong(){ \n\t return Long.parseLong(next());\n\t }\n\t \n\t static int max(int[] a){\n\t int max = Integer.MIN_VALUE;\n\t for(int i : a) max = Math.max(max, i);\n\t return max;\n\t }\n\t \n\t public int[] readIntArray(int n) {\n\t int[] arr = new int[n];\n\t for(int i=0; i<n; ++i) arr[i]=nextInt();\n\t return arr;\n\t }\n\t \n\t public long[] readLongArray(int n){\n\t long[] arr = new long[n];\n\t for(int i=0; i<n; ++i) arr[i]=nextLong();\n\t return arr;\n\t }\n\t \n\t public int[][] readIntArray(int m, int n){\n\t int[][] arr = new int[m][n];\n\t for(int i = 0;i<m;i++) \n\t for(int j = 0;j<n;j++) arr[i][j] = nextInt();\n\t return arr;\n\t }\n\t \n\t public String[] readStringArray(int n) {\n\t String[] arr = new String[n];\n\t for(int i=0; i<n; ++i) arr[i]= nextLine();\n\t return arr;\n\t }\n\t \n\t double nextDouble() {return Double.parseDouble(next());}\n\t \n\t String nextLine() {\n\t String str = \"\";\n\t try{str = br.readLine();}\n\t catch (IOException e) {e.printStackTrace();}\n\t return str;}}\n\t }",
"Main"
]
| import java.util.*;
import java.io.*;
import java.math.*;
public class Main {
static int check(String s, String t) {
int count = 0;
for(int i = 0;i<s.length();i++) {
if(s.charAt(i) != t.charAt(i)) {
count++;
}
}
return count;
}
public static void main(String args[]) throws IOException {
FastReader sc = new FastReader();
String s = sc.next();
String t = sc.next();
int n = s.length();
int min = Integer.MAX_VALUE;
int nt = t.length();
for(int i = 0;i<=n-nt;i++) {
String res = s.substring(i, i + nt);
min = Math.min(min, check(res, t));
}
pn(min);
}
static void p(Object p){System.out.print(p);}
static void pn(){System.out.println();}
static void pn(Object o){System.out.println(o);}
static class FastReader {
static BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next(){
while (st == null || !st.hasMoreElements()) {
try{
st = new StringTokenizer(br.readLine());
}
catch (IOException e) {
e.printStackTrace();
}}
return st.nextToken();
}
int nextInt(){
return Integer.parseInt(next());
}
long nextLong(){
return Long.parseLong(next());
}
static int max(int[] a){
int max = Integer.MIN_VALUE;
for(int i : a) max = Math.max(max, i);
return max;
}
public int[] readIntArray(int n) {
int[] arr = new int[n];
for(int i=0; i<n; ++i) arr[i]=nextInt();
return arr;
}
public long[] readLongArray(int n){
long[] arr = new long[n];
for(int i=0; i<n; ++i) arr[i]=nextLong();
return arr;
}
public int[][] readIntArray(int m, int n){
int[][] arr = new int[m][n];
for(int i = 0;i<m;i++)
for(int j = 0;j<n;j++) arr[i][j] = nextInt();
return arr;
}
public String[] readStringArray(int n) {
String[] arr = new String[n];
for(int i=0; i<n; ++i) arr[i]= nextLine();
return arr;
}
double nextDouble() {return Double.parseDouble(next());}
String nextLine() {
String str = "";
try{str = br.readLine();}
catch (IOException e) {e.printStackTrace();}
return str;}}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
18,
13,
13,
18,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
13,
18,
13,
2,
13,
13,
30,
40,
13,
0,
13,
8,
2,
13,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
98,
5
],
[
98,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
16,
17
],
[
17,
18
],
[
8,
19
],
[
19,
20
],
[
19,
21
],
[
21,
22
],
[
22,
23
],
[
23,
24
],
[
24,
25
],
[
8,
26
],
[
26,
27
],
[
26,
28
],
[
28,
29
],
[
28,
30
],
[
8,
31
],
[
31,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
31,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
39,
41
],
[
38,
42
],
[
42,
43
],
[
42,
44
],
[
31,
45
],
[
45,
46
],
[
46,
47
],
[
31,
48
],
[
49,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
49,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
53,
58
],
[
58,
59
],
[
58,
60
],
[
60,
61
],
[
60,
62
],
[
53,
63
],
[
63,
64
],
[
64,
65
],
[
53,
66
],
[
67,
67
],
[
67,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
70,
72
],
[
69,
73
],
[
73,
74
],
[
73,
75
],
[
75,
76
],
[
75,
77
],
[
68,
78
],
[
78,
79
],
[
79,
80
],
[
49,
81
],
[
81,
82
],
[
81,
83
],
[
83,
84
],
[
84,
85
],
[
84,
86
],
[
83,
87
],
[
83,
88
],
[
8,
89
],
[
89,
90
],
[
90,
91
],
[
91,
92
],
[
91,
93
],
[
89,
94
],
[
6,
95
],
[
95,
96
],
[
0,
97
],
[
97,
98
],
[
97,
99
]
]
| [
"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args){\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tchar[] s = sc.next().toCharArray();\n\t\tchar[] t = sc.next().toCharArray();\n\n\t\tint ans = t.length;\n\n\t\tfor(int i = 0; i <= s.length - t.length; i++) {\n\t\t\tint diff = 0;\n\t\t\tfor(int x = 0; x < t.length; x++) {\n\t\t\t\tif(t[x] != s[i+x]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = ans <= diff ? ans : diff;\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n\tpublic static void main(String[] args){\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tchar[] s = sc.next().toCharArray();\n\t\tchar[] t = sc.next().toCharArray();\n\n\t\tint ans = t.length;\n\n\t\tfor(int i = 0; i <= s.length - t.length; i++) {\n\t\t\tint diff = 0;\n\t\t\tfor(int x = 0; x < t.length; x++) {\n\t\t\t\tif(t[x] != s[i+x]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = ans <= diff ? ans : diff;\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}\n}",
"Main",
"public static void main(String[] args){\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tchar[] s = sc.next().toCharArray();\n\t\tchar[] t = sc.next().toCharArray();\n\n\t\tint ans = t.length;\n\n\t\tfor(int i = 0; i <= s.length - t.length; i++) {\n\t\t\tint diff = 0;\n\t\t\tfor(int x = 0; x < t.length; x++) {\n\t\t\t\tif(t[x] != s[i+x]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = ans <= diff ? ans : diff;\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}",
"main",
"{\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tchar[] s = sc.next().toCharArray();\n\t\tchar[] t = sc.next().toCharArray();\n\n\t\tint ans = t.length;\n\n\t\tfor(int i = 0; i <= s.length - t.length; i++) {\n\t\t\tint diff = 0;\n\t\t\tfor(int x = 0; x < t.length; x++) {\n\t\t\t\tif(t[x] != s[i+x]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = ans <= diff ? ans : diff;\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"char[] s = sc.next().toCharArray();",
"s",
"sc.next().toCharArray()",
"sc.next().toCharArray",
"sc.next()",
"sc.next",
"sc",
"char[] t = sc.next().toCharArray();",
"t",
"sc.next().toCharArray()",
"sc.next().toCharArray",
"sc.next()",
"sc.next",
"sc",
"int ans = t.length;",
"ans",
"t.length",
"t",
"t.length",
"for(int i = 0; i <= s.length - t.length; i++) {\n\t\t\tint diff = 0;\n\t\t\tfor(int x = 0; x < t.length; x++) {\n\t\t\t\tif(t[x] != s[i+x]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = ans <= diff ? ans : diff;\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= s.length - t.length",
"i",
"s.length - t.length",
"s.length",
"s",
"s.length",
"t.length",
"t",
"t.length",
"i++",
"i++",
"i",
"{\n\t\t\tint diff = 0;\n\t\t\tfor(int x = 0; x < t.length; x++) {\n\t\t\t\tif(t[x] != s[i+x]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = ans <= diff ? ans : diff;\n\t\t}",
"{\n\t\t\tint diff = 0;\n\t\t\tfor(int x = 0; x < t.length; x++) {\n\t\t\t\tif(t[x] != s[i+x]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = ans <= diff ? ans : diff;\n\t\t}",
"int diff = 0;",
"diff",
"0",
"for(int x = 0; x < t.length; x++) {\n\t\t\t\tif(t[x] != s[i+x]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}",
"int x = 0;",
"int x = 0;",
"x",
"0",
"x < t.length",
"x",
"t.length",
"t",
"t.length",
"x++",
"x++",
"x",
"{\n\t\t\t\tif(t[x] != s[i+x]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif(t[x] != s[i+x]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}",
"if(t[x] != s[i+x]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}",
"t[x] != s[i+x]",
"t[x]",
"t",
"x",
"s[i+x]",
"s",
"i+x",
"i",
"x",
"{\n\t\t\t\t\tdiff++;\n\t\t\t\t}",
"diff++",
"diff",
"ans = ans <= diff ? ans : diff",
"ans",
"ans <= diff ? ans : diff",
"ans <= diff",
"ans",
"diff",
"ans",
"diff",
"System.out.println(ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"ans",
"String[] args",
"args",
"public class Main {\n\n\tpublic static void main(String[] args){\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tchar[] s = sc.next().toCharArray();\n\t\tchar[] t = sc.next().toCharArray();\n\n\t\tint ans = t.length;\n\n\t\tfor(int i = 0; i <= s.length - t.length; i++) {\n\t\t\tint diff = 0;\n\t\t\tfor(int x = 0; x < t.length; x++) {\n\t\t\t\tif(t[x] != s[i+x]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = ans <= diff ? ans : diff;\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}\n}",
"public class Main {\n\n\tpublic static void main(String[] args){\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tchar[] s = sc.next().toCharArray();\n\t\tchar[] t = sc.next().toCharArray();\n\n\t\tint ans = t.length;\n\n\t\tfor(int i = 0; i <= s.length - t.length; i++) {\n\t\t\tint diff = 0;\n\t\t\tfor(int x = 0; x < t.length; x++) {\n\t\t\t\tif(t[x] != s[i+x]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = ans <= diff ? ans : diff;\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
char[] s = sc.next().toCharArray();
char[] t = sc.next().toCharArray();
int ans = t.length;
for(int i = 0; i <= s.length - t.length; i++) {
int diff = 0;
for(int x = 0; x < t.length; x++) {
if(t[x] != s[i+x]) {
diff++;
}
}
ans = ans <= diff ? ans : diff;
}
System.out.println(ans);
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
20,
12,
13,
30,
4,
13,
41,
13,
4,
18,
13,
4,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
2,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
40,
13,
14,
2,
13,
13,
3,
14,
2,
13,
13,
0,
13,
13,
14,
2,
13,
17,
3,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
4,
18,
13,
17,
42,
17,
30,
38,
5,
13,
30,
3,
30,
41,
13,
4,
18,
18,
13,
13,
14,
2,
2,
2,
13,
17,
2,
13,
17,
2,
13,
40,
17,
30,
3,
30,
4,
18,
13,
13,
12,
13,
30,
4,
13,
29,
4,
18,
13,
4,
18,
13,
12,
13,
30,
4,
13,
29,
4,
18,
13,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
13,
29,
4,
18,
13,
4,
18,
13,
12,
13,
30,
4,
13,
29,
4,
18,
13,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
13,
29,
20,
12,
13,
30,
4,
13,
29,
20,
23,
13,
12,
13,
30,
4,
13,
29,
4,
18,
13,
4,
18,
13,
12,
13,
30,
4,
13,
29,
20,
12,
13,
30,
4,
13,
29,
4,
18,
13,
4,
18,
13,
12,
13,
30,
42,
17,
30,
38,
5,
13,
30,
3,
30,
41,
13,
4,
18,
18,
13,
13,
14,
2,
2,
13,
17,
2,
13,
40,
17,
30,
3,
12,
13,
30,
42,
17,
30,
38,
5,
13,
30,
3,
30,
41,
13,
4,
18,
18,
13,
13,
14,
2,
2,
2,
13,
17,
2,
13,
17,
2,
13,
40,
17,
3,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
333,
14
],
[
333,
15
],
[
15,
16
],
[
15,
17
],
[
333,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
20,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
26,
27
],
[
20,
28
],
[
28,
29
],
[
20,
30
],
[
30,
31
],
[
30,
32
],
[
32,
33
],
[
33,
34
],
[
20,
35
],
[
35,
36
],
[
35,
37
],
[
37,
38
],
[
38,
39
],
[
20,
40
],
[
40,
41
],
[
41,
42
],
[
42,
43
],
[
42,
44
],
[
40,
45
],
[
45,
46
],
[
45,
47
],
[
47,
48
],
[
48,
49
],
[
49,
50
],
[
47,
51
],
[
51,
52
],
[
52,
53
],
[
40,
54
],
[
54,
55
],
[
55,
56
],
[
40,
57
],
[
58,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
61,
62
],
[
62,
63
],
[
61,
64
],
[
61,
65
],
[
65,
66
],
[
65,
67
],
[
67,
68
],
[
68,
69
],
[
58,
70
],
[
70,
71
],
[
70,
72
],
[
58,
73
],
[
73,
74
],
[
74,
75
],
[
75,
76
],
[
75,
77
],
[
73,
78
],
[
78,
79
],
[
78,
80
],
[
80,
81
],
[
81,
82
],
[
73,
83
],
[
83,
84
],
[
84,
85
],
[
73,
86
],
[
87,
87
],
[
87,
88
],
[
88,
89
],
[
89,
90
],
[
90,
91
],
[
91,
92
],
[
90,
93
],
[
89,
94
],
[
94,
95
],
[
95,
96
],
[
94,
97
],
[
88,
98
],
[
98,
99
],
[
87,
100
],
[
100,
101
],
[
101,
102
],
[
101,
103
],
[
100,
104
],
[
58,
105
],
[
105,
106
],
[
106,
107
],
[
106,
108
],
[
105,
109
],
[
109,
110
],
[
109,
111
],
[
58,
112
],
[
112,
113
],
[
113,
114
],
[
113,
115
],
[
112,
116
],
[
20,
117
],
[
117,
118
],
[
118,
119
],
[
119,
120
],
[
119,
121
],
[
117,
122
],
[
18,
123
],
[
123,
124
],
[
333,
125
],
[
125,
126
],
[
125,
127
],
[
127,
128
],
[
128,
129
],
[
129,
130
],
[
128,
131
],
[
127,
132
],
[
132,
133
],
[
132,
134
],
[
134,
135
],
[
135,
136
],
[
136,
137
],
[
136,
138
],
[
138,
139
],
[
135,
140
],
[
140,
141
],
[
141,
142
],
[
141,
143
],
[
143,
144
],
[
144,
145
],
[
145,
146
],
[
145,
147
],
[
140,
148
],
[
148,
149
],
[
150,
150
],
[
150,
151
],
[
151,
152
],
[
151,
153
],
[
150,
154
],
[
154,
155
],
[
154,
156
],
[
150,
157
],
[
157,
158
],
[
157,
159
],
[
159,
160
],
[
148,
161
],
[
161,
162
],
[
148,
163
],
[
163,
164
],
[
164,
165
],
[
165,
166
],
[
164,
167
],
[
333,
168
],
[
168,
169
],
[
168,
170
],
[
170,
171
],
[
171,
172
],
[
170,
173
],
[
173,
174
],
[
174,
175
],
[
175,
176
],
[
174,
177
],
[
177,
178
],
[
178,
179
],
[
333,
180
],
[
180,
181
],
[
180,
182
],
[
182,
183
],
[
183,
184
],
[
182,
185
],
[
185,
186
],
[
186,
187
],
[
187,
188
],
[
186,
189
],
[
189,
190
],
[
190,
191
],
[
186,
192
],
[
180,
193
],
[
193,
194
],
[
333,
195
],
[
195,
196
],
[
195,
197
],
[
197,
198
],
[
198,
199
],
[
197,
200
],
[
200,
201
],
[
201,
202
],
[
202,
203
],
[
201,
204
],
[
204,
205
],
[
205,
206
],
[
333,
207
],
[
207,
208
],
[
207,
209
],
[
209,
210
],
[
210,
211
],
[
209,
212
],
[
212,
213
],
[
213,
214
],
[
214,
215
],
[
213,
216
],
[
216,
217
],
[
217,
218
],
[
213,
219
],
[
207,
220
],
[
220,
221
],
[
333,
222
],
[
222,
223
],
[
222,
224
],
[
224,
225
],
[
225,
226
],
[
224,
227
],
[
227,
228
],
[
333,
229
],
[
229,
230
],
[
229,
231
],
[
231,
232
],
[
232,
233
],
[
231,
234
],
[
234,
235
],
[
229,
236
],
[
236,
237
],
[
333,
238
],
[
238,
239
],
[
238,
240
],
[
240,
241
],
[
241,
242
],
[
240,
243
],
[
243,
244
],
[
244,
245
],
[
245,
246
],
[
244,
247
],
[
247,
248
],
[
248,
249
],
[
333,
250
],
[
250,
251
],
[
250,
252
],
[
252,
253
],
[
253,
254
],
[
252,
255
],
[
255,
256
],
[
333,
257
],
[
257,
258
],
[
257,
259
],
[
259,
260
],
[
260,
261
],
[
259,
262
],
[
262,
263
],
[
263,
264
],
[
264,
265
],
[
263,
266
],
[
266,
267
],
[
267,
268
],
[
333,
269
],
[
269,
270
],
[
269,
271
],
[
271,
272
],
[
272,
273
],
[
272,
274
],
[
274,
275
],
[
275,
276
],
[
276,
277
],
[
276,
278
],
[
278,
279
],
[
275,
280
],
[
280,
281
],
[
281,
282
],
[
281,
283
],
[
283,
284
],
[
284,
285
],
[
285,
286
],
[
285,
287
],
[
280,
288
],
[
288,
289
],
[
289,
290
],
[
290,
291
],
[
290,
292
],
[
289,
293
],
[
293,
294
],
[
293,
295
],
[
295,
296
],
[
288,
297
],
[
297,
298
],
[
333,
299
],
[
299,
300
],
[
299,
301
],
[
301,
302
],
[
302,
303
],
[
302,
304
],
[
304,
305
],
[
305,
306
],
[
306,
307
],
[
306,
308
],
[
308,
309
],
[
305,
310
],
[
310,
311
],
[
311,
312
],
[
311,
313
],
[
313,
314
],
[
314,
315
],
[
315,
316
],
[
315,
317
],
[
310,
318
],
[
318,
319
],
[
320,
320
],
[
320,
321
],
[
321,
322
],
[
321,
323
],
[
320,
324
],
[
324,
325
],
[
324,
326
],
[
320,
327
],
[
327,
328
],
[
327,
329
],
[
329,
330
],
[
318,
331
],
[
0,
332
],
[
332,
333
],
[
332,
334
]
]
| [
"import java.io.IOException;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.util.ArrayList;\n\npublic class Main {\n private static final StringBuilder builder = new StringBuilder();\n public static void main(String[] args) {\n read();\n String s = builder.toString();\n read();\n String t = builder.toString();\n\n int min = t.length();\n for (int i = 0; i <= s.length() - t.length(); i++) {\n String sub = s.substring(i, i + t.length());\n int diff = 0;\n for (int j = 0; j < t.length(); j++) {\n if (sub.charAt(j) != t.charAt(j)) diff++;\n if (diff > min) break;\n }\n\n if (diff < min) min = diff;\n if (min == 0) break;\n }\n\n System.out.print(min);\n }\n\n private static void read() {\n builder.setLength(0);\n while (true) {\n try {\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) {\n break;\n } else {\n builder.appendCodePoint(b);\n }\n } catch (IOException e) {\n break;\n }\n }\n }\n\n private static int readInt() {\n read();\n return Integer.parseInt(builder.toString());\n }\n\n private static int readInt(int radix) {\n read();\n return Integer.parseInt(builder.toString(), radix);\n }\n\n private static long readLong() {\n read();\n return Long.parseLong(builder.toString());\n }\n\n private static long readLong(int radix) {\n read();\n return Long.parseLong(builder.toString(), radix);\n }\n\n private static BigInteger readBigInteger() {\n read();\n return new BigInteger(builder.toString());\n }\n\n private static BigInteger readBigInteger(int radix) {\n read();\n return new BigInteger(builder.toString(), radix);\n }\n\n private static double readDouble() {\n read();\n return Double.parseDouble(builder.toString());\n }\n\n private static BigDecimal readBigDecimal() {\n read();\n return new BigDecimal(builder.toString());\n }\n\n private static float readFloat() {\n read();\n return Float.parseFloat(builder.toString());\n }\n\n private static void skipLine() {\n while (true) {\n try {\n int b = System.in.read();\n if (b == '\\n' || b == -1) {\n break;\n }\n } catch (IOException e) {\n break;\n }\n }\n }\n\n private static void skip() {\n while (true) {\n try {\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) break;\n } catch (IOException e) {\n break;\n }\n }\n }\n\n}",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.math.BigDecimal;",
"BigDecimal",
"java.math",
"import java.math.BigInteger;",
"BigInteger",
"java.math",
"import java.util.ArrayList;",
"ArrayList",
"java.util",
"public class Main {\n private static final StringBuilder builder = new StringBuilder();\n public static void main(String[] args) {\n read();\n String s = builder.toString();\n read();\n String t = builder.toString();\n\n int min = t.length();\n for (int i = 0; i <= s.length() - t.length(); i++) {\n String sub = s.substring(i, i + t.length());\n int diff = 0;\n for (int j = 0; j < t.length(); j++) {\n if (sub.charAt(j) != t.charAt(j)) diff++;\n if (diff > min) break;\n }\n\n if (diff < min) min = diff;\n if (min == 0) break;\n }\n\n System.out.print(min);\n }\n\n private static void read() {\n builder.setLength(0);\n while (true) {\n try {\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) {\n break;\n } else {\n builder.appendCodePoint(b);\n }\n } catch (IOException e) {\n break;\n }\n }\n }\n\n private static int readInt() {\n read();\n return Integer.parseInt(builder.toString());\n }\n\n private static int readInt(int radix) {\n read();\n return Integer.parseInt(builder.toString(), radix);\n }\n\n private static long readLong() {\n read();\n return Long.parseLong(builder.toString());\n }\n\n private static long readLong(int radix) {\n read();\n return Long.parseLong(builder.toString(), radix);\n }\n\n private static BigInteger readBigInteger() {\n read();\n return new BigInteger(builder.toString());\n }\n\n private static BigInteger readBigInteger(int radix) {\n read();\n return new BigInteger(builder.toString(), radix);\n }\n\n private static double readDouble() {\n read();\n return Double.parseDouble(builder.toString());\n }\n\n private static BigDecimal readBigDecimal() {\n read();\n return new BigDecimal(builder.toString());\n }\n\n private static float readFloat() {\n read();\n return Float.parseFloat(builder.toString());\n }\n\n private static void skipLine() {\n while (true) {\n try {\n int b = System.in.read();\n if (b == '\\n' || b == -1) {\n break;\n }\n } catch (IOException e) {\n break;\n }\n }\n }\n\n private static void skip() {\n while (true) {\n try {\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) break;\n } catch (IOException e) {\n break;\n }\n }\n }\n\n}",
"Main",
"private static final StringBuilder builder = new StringBuilder();",
"builder",
"new StringBuilder()",
"public static void main(String[] args) {\n read();\n String s = builder.toString();\n read();\n String t = builder.toString();\n\n int min = t.length();\n for (int i = 0; i <= s.length() - t.length(); i++) {\n String sub = s.substring(i, i + t.length());\n int diff = 0;\n for (int j = 0; j < t.length(); j++) {\n if (sub.charAt(j) != t.charAt(j)) diff++;\n if (diff > min) break;\n }\n\n if (diff < min) min = diff;\n if (min == 0) break;\n }\n\n System.out.print(min);\n }",
"main",
"{\n read();\n String s = builder.toString();\n read();\n String t = builder.toString();\n\n int min = t.length();\n for (int i = 0; i <= s.length() - t.length(); i++) {\n String sub = s.substring(i, i + t.length());\n int diff = 0;\n for (int j = 0; j < t.length(); j++) {\n if (sub.charAt(j) != t.charAt(j)) diff++;\n if (diff > min) break;\n }\n\n if (diff < min) min = diff;\n if (min == 0) break;\n }\n\n System.out.print(min);\n }",
"read()",
"read",
"String s = builder.toString();",
"s",
"builder.toString()",
"builder.toString",
"builder",
"read()",
"read",
"String t = builder.toString();",
"t",
"builder.toString()",
"builder.toString",
"builder",
"int min = t.length();",
"min",
"t.length()",
"t.length",
"t",
"for (int i = 0; i <= s.length() - t.length(); i++) {\n String sub = s.substring(i, i + t.length());\n int diff = 0;\n for (int j = 0; j < t.length(); j++) {\n if (sub.charAt(j) != t.charAt(j)) diff++;\n if (diff > min) break;\n }\n\n if (diff < min) min = diff;\n if (min == 0) break;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= s.length() - t.length()",
"i",
"s.length() - t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"i++",
"i++",
"i",
"{\n String sub = s.substring(i, i + t.length());\n int diff = 0;\n for (int j = 0; j < t.length(); j++) {\n if (sub.charAt(j) != t.charAt(j)) diff++;\n if (diff > min) break;\n }\n\n if (diff < min) min = diff;\n if (min == 0) break;\n }",
"{\n String sub = s.substring(i, i + t.length());\n int diff = 0;\n for (int j = 0; j < t.length(); j++) {\n if (sub.charAt(j) != t.charAt(j)) diff++;\n if (diff > min) break;\n }\n\n if (diff < min) min = diff;\n if (min == 0) break;\n }",
"String sub = s.substring(i, i + t.length());",
"sub",
"s.substring(i, i + t.length())",
"s.substring",
"s",
"i",
"i + t.length()",
"i",
"t.length()",
"t.length",
"t",
"int diff = 0;",
"diff",
"0",
"for (int j = 0; j < t.length(); j++) {\n if (sub.charAt(j) != t.charAt(j)) diff++;\n if (diff > min) break;\n }",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n if (sub.charAt(j) != t.charAt(j)) diff++;\n if (diff > min) break;\n }",
"{\n if (sub.charAt(j) != t.charAt(j)) diff++;\n if (diff > min) break;\n }",
"if (sub.charAt(j) != t.charAt(j)) diff++;",
"sub.charAt(j) != t.charAt(j)",
"sub.charAt(j)",
"sub.charAt",
"sub",
"j",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"diff++",
"diff",
"if (diff > min) break;",
"diff > min",
"diff",
"min",
"break;",
"if (diff < min) min = diff;",
"diff < min",
"diff",
"min",
"min = diff",
"min",
"diff",
"if (min == 0) break;",
"min == 0",
"min",
"0",
"break;",
"System.out.print(min)",
"System.out.print",
"System.out",
"System",
"System.out",
"min",
"String[] args",
"args",
"private static void read() {\n builder.setLength(0);\n while (true) {\n try {\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) {\n break;\n } else {\n builder.appendCodePoint(b);\n }\n } catch (IOException e) {\n break;\n }\n }\n }",
"read",
"{\n builder.setLength(0);\n while (true) {\n try {\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) {\n break;\n } else {\n builder.appendCodePoint(b);\n }\n } catch (IOException e) {\n break;\n }\n }\n }",
"builder.setLength(0)",
"builder.setLength",
"builder",
"0",
"while (true) {\n try {\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) {\n break;\n } else {\n builder.appendCodePoint(b);\n }\n } catch (IOException e) {\n break;\n }\n }",
"true",
"{\n try {\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) {\n break;\n } else {\n builder.appendCodePoint(b);\n }\n } catch (IOException e) {\n break;\n }\n }",
"try {\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) {\n break;\n } else {\n builder.appendCodePoint(b);\n }\n } catch (IOException e) {\n break;\n }",
"catch (IOException e) {\n break;\n }",
"IOException e",
"{\n break;\n }",
"break;",
"{\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) {\n break;\n } else {\n builder.appendCodePoint(b);\n }\n }",
"int b = System.in.read();",
"b",
"System.in.read()",
"System.in.read",
"System.in",
"System",
"System.in",
"if (b == ' ' || b == '\\n' || b == -1) {\n break;\n } else {\n builder.appendCodePoint(b);\n }",
"b == ' ' || b == '\\n' || b == -1",
"b == ' ' || b == '\\n' || b == -1",
"b == ' '",
"b",
"' '",
"b == '\\n'",
"b",
"'\\n'",
"b == -1",
"b",
"-1",
"1",
"{\n break;\n }",
"break;",
"{\n builder.appendCodePoint(b);\n }",
"builder.appendCodePoint(b)",
"builder.appendCodePoint",
"builder",
"b",
"private static int readInt() {\n read();\n return Integer.parseInt(builder.toString());\n }",
"readInt",
"{\n read();\n return Integer.parseInt(builder.toString());\n }",
"read()",
"read",
"return Integer.parseInt(builder.toString());",
"Integer.parseInt(builder.toString())",
"Integer.parseInt",
"Integer",
"builder.toString()",
"builder.toString",
"builder",
"private static int readInt(int radix) {\n read();\n return Integer.parseInt(builder.toString(), radix);\n }",
"readInt",
"{\n read();\n return Integer.parseInt(builder.toString(), radix);\n }",
"read()",
"read",
"return Integer.parseInt(builder.toString(), radix);",
"Integer.parseInt(builder.toString(), radix)",
"Integer.parseInt",
"Integer",
"builder.toString()",
"builder.toString",
"builder",
"radix",
"int radix",
"radix",
"private static long readLong() {\n read();\n return Long.parseLong(builder.toString());\n }",
"readLong",
"{\n read();\n return Long.parseLong(builder.toString());\n }",
"read()",
"read",
"return Long.parseLong(builder.toString());",
"Long.parseLong(builder.toString())",
"Long.parseLong",
"Long",
"builder.toString()",
"builder.toString",
"builder",
"private static long readLong(int radix) {\n read();\n return Long.parseLong(builder.toString(), radix);\n }",
"readLong",
"{\n read();\n return Long.parseLong(builder.toString(), radix);\n }",
"read()",
"read",
"return Long.parseLong(builder.toString(), radix);",
"Long.parseLong(builder.toString(), radix)",
"Long.parseLong",
"Long",
"builder.toString()",
"builder.toString",
"builder",
"radix",
"int radix",
"radix",
"private static BigInteger readBigInteger() {\n read();\n return new BigInteger(builder.toString());\n }",
"readBigInteger",
"{\n read();\n return new BigInteger(builder.toString());\n }",
"read()",
"read",
"return new BigInteger(builder.toString());",
"new BigInteger(builder.toString())",
"private static BigInteger readBigInteger(int radix) {\n read();\n return new BigInteger(builder.toString(), radix);\n }",
"readBigInteger",
"{\n read();\n return new BigInteger(builder.toString(), radix);\n }",
"read()",
"read",
"return new BigInteger(builder.toString(), radix);",
"new BigInteger(builder.toString(), radix)",
"int radix",
"radix",
"private static double readDouble() {\n read();\n return Double.parseDouble(builder.toString());\n }",
"readDouble",
"{\n read();\n return Double.parseDouble(builder.toString());\n }",
"read()",
"read",
"return Double.parseDouble(builder.toString());",
"Double.parseDouble(builder.toString())",
"Double.parseDouble",
"Double",
"builder.toString()",
"builder.toString",
"builder",
"private static BigDecimal readBigDecimal() {\n read();\n return new BigDecimal(builder.toString());\n }",
"readBigDecimal",
"{\n read();\n return new BigDecimal(builder.toString());\n }",
"read()",
"read",
"return new BigDecimal(builder.toString());",
"new BigDecimal(builder.toString())",
"private static float readFloat() {\n read();\n return Float.parseFloat(builder.toString());\n }",
"readFloat",
"{\n read();\n return Float.parseFloat(builder.toString());\n }",
"read()",
"read",
"return Float.parseFloat(builder.toString());",
"Float.parseFloat(builder.toString())",
"Float.parseFloat",
"Float",
"builder.toString()",
"builder.toString",
"builder",
"private static void skipLine() {\n while (true) {\n try {\n int b = System.in.read();\n if (b == '\\n' || b == -1) {\n break;\n }\n } catch (IOException e) {\n break;\n }\n }\n }",
"skipLine",
"{\n while (true) {\n try {\n int b = System.in.read();\n if (b == '\\n' || b == -1) {\n break;\n }\n } catch (IOException e) {\n break;\n }\n }\n }",
"while (true) {\n try {\n int b = System.in.read();\n if (b == '\\n' || b == -1) {\n break;\n }\n } catch (IOException e) {\n break;\n }\n }",
"true",
"{\n try {\n int b = System.in.read();\n if (b == '\\n' || b == -1) {\n break;\n }\n } catch (IOException e) {\n break;\n }\n }",
"try {\n int b = System.in.read();\n if (b == '\\n' || b == -1) {\n break;\n }\n } catch (IOException e) {\n break;\n }",
"catch (IOException e) {\n break;\n }",
"IOException e",
"{\n break;\n }",
"break;",
"{\n int b = System.in.read();\n if (b == '\\n' || b == -1) {\n break;\n }\n }",
"int b = System.in.read();",
"b",
"System.in.read()",
"System.in.read",
"System.in",
"System",
"System.in",
"if (b == '\\n' || b == -1) {\n break;\n }",
"b == '\\n' || b == -1",
"b == '\\n'",
"b",
"'\\n'",
"b == -1",
"b",
"-1",
"1",
"{\n break;\n }",
"break;",
"private static void skip() {\n while (true) {\n try {\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) break;\n } catch (IOException e) {\n break;\n }\n }\n }",
"skip",
"{\n while (true) {\n try {\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) break;\n } catch (IOException e) {\n break;\n }\n }\n }",
"while (true) {\n try {\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) break;\n } catch (IOException e) {\n break;\n }\n }",
"true",
"{\n try {\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) break;\n } catch (IOException e) {\n break;\n }\n }",
"try {\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) break;\n } catch (IOException e) {\n break;\n }",
"catch (IOException e) {\n break;\n }",
"IOException e",
"{\n break;\n }",
"break;",
"{\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) break;\n }",
"int b = System.in.read();",
"b",
"System.in.read()",
"System.in.read",
"System.in",
"System",
"System.in",
"if (b == ' ' || b == '\\n' || b == -1) break;",
"b == ' ' || b == '\\n' || b == -1",
"b == ' ' || b == '\\n' || b == -1",
"b == ' '",
"b",
"' '",
"b == '\\n'",
"b",
"'\\n'",
"b == -1",
"b",
"-1",
"1",
"break;",
"public class Main {\n private static final StringBuilder builder = new StringBuilder();\n public static void main(String[] args) {\n read();\n String s = builder.toString();\n read();\n String t = builder.toString();\n\n int min = t.length();\n for (int i = 0; i <= s.length() - t.length(); i++) {\n String sub = s.substring(i, i + t.length());\n int diff = 0;\n for (int j = 0; j < t.length(); j++) {\n if (sub.charAt(j) != t.charAt(j)) diff++;\n if (diff > min) break;\n }\n\n if (diff < min) min = diff;\n if (min == 0) break;\n }\n\n System.out.print(min);\n }\n\n private static void read() {\n builder.setLength(0);\n while (true) {\n try {\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) {\n break;\n } else {\n builder.appendCodePoint(b);\n }\n } catch (IOException e) {\n break;\n }\n }\n }\n\n private static int readInt() {\n read();\n return Integer.parseInt(builder.toString());\n }\n\n private static int readInt(int radix) {\n read();\n return Integer.parseInt(builder.toString(), radix);\n }\n\n private static long readLong() {\n read();\n return Long.parseLong(builder.toString());\n }\n\n private static long readLong(int radix) {\n read();\n return Long.parseLong(builder.toString(), radix);\n }\n\n private static BigInteger readBigInteger() {\n read();\n return new BigInteger(builder.toString());\n }\n\n private static BigInteger readBigInteger(int radix) {\n read();\n return new BigInteger(builder.toString(), radix);\n }\n\n private static double readDouble() {\n read();\n return Double.parseDouble(builder.toString());\n }\n\n private static BigDecimal readBigDecimal() {\n read();\n return new BigDecimal(builder.toString());\n }\n\n private static float readFloat() {\n read();\n return Float.parseFloat(builder.toString());\n }\n\n private static void skipLine() {\n while (true) {\n try {\n int b = System.in.read();\n if (b == '\\n' || b == -1) {\n break;\n }\n } catch (IOException e) {\n break;\n }\n }\n }\n\n private static void skip() {\n while (true) {\n try {\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) break;\n } catch (IOException e) {\n break;\n }\n }\n }\n\n}",
"public class Main {\n private static final StringBuilder builder = new StringBuilder();\n public static void main(String[] args) {\n read();\n String s = builder.toString();\n read();\n String t = builder.toString();\n\n int min = t.length();\n for (int i = 0; i <= s.length() - t.length(); i++) {\n String sub = s.substring(i, i + t.length());\n int diff = 0;\n for (int j = 0; j < t.length(); j++) {\n if (sub.charAt(j) != t.charAt(j)) diff++;\n if (diff > min) break;\n }\n\n if (diff < min) min = diff;\n if (min == 0) break;\n }\n\n System.out.print(min);\n }\n\n private static void read() {\n builder.setLength(0);\n while (true) {\n try {\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) {\n break;\n } else {\n builder.appendCodePoint(b);\n }\n } catch (IOException e) {\n break;\n }\n }\n }\n\n private static int readInt() {\n read();\n return Integer.parseInt(builder.toString());\n }\n\n private static int readInt(int radix) {\n read();\n return Integer.parseInt(builder.toString(), radix);\n }\n\n private static long readLong() {\n read();\n return Long.parseLong(builder.toString());\n }\n\n private static long readLong(int radix) {\n read();\n return Long.parseLong(builder.toString(), radix);\n }\n\n private static BigInteger readBigInteger() {\n read();\n return new BigInteger(builder.toString());\n }\n\n private static BigInteger readBigInteger(int radix) {\n read();\n return new BigInteger(builder.toString(), radix);\n }\n\n private static double readDouble() {\n read();\n return Double.parseDouble(builder.toString());\n }\n\n private static BigDecimal readBigDecimal() {\n read();\n return new BigDecimal(builder.toString());\n }\n\n private static float readFloat() {\n read();\n return Float.parseFloat(builder.toString());\n }\n\n private static void skipLine() {\n while (true) {\n try {\n int b = System.in.read();\n if (b == '\\n' || b == -1) {\n break;\n }\n } catch (IOException e) {\n break;\n }\n }\n }\n\n private static void skip() {\n while (true) {\n try {\n int b = System.in.read();\n if (b == ' ' || b == '\\n' || b == -1) break;\n } catch (IOException e) {\n break;\n }\n }\n }\n\n}",
"Main"
]
| import java.io.IOException;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.ArrayList;
public class Main {
private static final StringBuilder builder = new StringBuilder();
public static void main(String[] args) {
read();
String s = builder.toString();
read();
String t = builder.toString();
int min = t.length();
for (int i = 0; i <= s.length() - t.length(); i++) {
String sub = s.substring(i, i + t.length());
int diff = 0;
for (int j = 0; j < t.length(); j++) {
if (sub.charAt(j) != t.charAt(j)) diff++;
if (diff > min) break;
}
if (diff < min) min = diff;
if (min == 0) break;
}
System.out.print(min);
}
private static void read() {
builder.setLength(0);
while (true) {
try {
int b = System.in.read();
if (b == ' ' || b == '\n' || b == -1) {
break;
} else {
builder.appendCodePoint(b);
}
} catch (IOException e) {
break;
}
}
}
private static int readInt() {
read();
return Integer.parseInt(builder.toString());
}
private static int readInt(int radix) {
read();
return Integer.parseInt(builder.toString(), radix);
}
private static long readLong() {
read();
return Long.parseLong(builder.toString());
}
private static long readLong(int radix) {
read();
return Long.parseLong(builder.toString(), radix);
}
private static BigInteger readBigInteger() {
read();
return new BigInteger(builder.toString());
}
private static BigInteger readBigInteger(int radix) {
read();
return new BigInteger(builder.toString(), radix);
}
private static double readDouble() {
read();
return Double.parseDouble(builder.toString());
}
private static BigDecimal readBigDecimal() {
read();
return new BigDecimal(builder.toString());
}
private static float readFloat() {
read();
return Float.parseFloat(builder.toString());
}
private static void skipLine() {
while (true) {
try {
int b = System.in.read();
if (b == '\n' || b == -1) {
break;
}
} catch (IOException e) {
break;
}
}
}
private static void skip() {
while (true) {
try {
int b = System.in.read();
if (b == ' ' || b == '\n' || b == -1) break;
} catch (IOException e) {
break;
}
}
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
2,
4,
18,
13,
4,
18,
13,
17,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
2,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
99,
8
],
[
99,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
11,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
11,
20
],
[
20,
21
],
[
20,
22
],
[
22,
23
],
[
23,
24
],
[
11,
25
],
[
25,
26
],
[
25,
27
],
[
27,
28
],
[
27,
29
],
[
11,
30
],
[
30,
31
],
[
31,
32
],
[
32,
33
],
[
32,
34
],
[
30,
35
],
[
35,
36
],
[
35,
37
],
[
37,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
38,
42
],
[
42,
43
],
[
43,
44
],
[
37,
45
],
[
30,
46
],
[
46,
47
],
[
47,
48
],
[
30,
49
],
[
50,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
50,
54
],
[
54,
55
],
[
55,
56
],
[
56,
57
],
[
56,
58
],
[
54,
59
],
[
59,
60
],
[
59,
61
],
[
61,
62
],
[
62,
63
],
[
54,
64
],
[
64,
65
],
[
65,
66
],
[
54,
67
],
[
68,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
71,
74
],
[
70,
75
],
[
75,
76
],
[
76,
77
],
[
75,
78
],
[
78,
79
],
[
78,
80
],
[
69,
81
],
[
81,
82
],
[
50,
83
],
[
83,
84
],
[
83,
85
],
[
85,
86
],
[
86,
87
],
[
85,
88
],
[
85,
89
],
[
11,
90
],
[
90,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
90,
95
],
[
9,
96
],
[
96,
97
],
[
0,
98
],
[
98,
99
],
[
98,
100
]
]
| [
"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n BufferedReader buffer = new BufferedReader(new InputStreamReader(System.in));\n String S = buffer.readLine();\n String T = buffer.readLine();\n int minLen = Integer.MAX_VALUE;\n for (int pos = 0; pos < S.length()-T.length()+1; pos++) {\n int currLen = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i)!=S.charAt(pos+i))currLen++;\n }\n minLen = Math.min(minLen, currLen);\n }\n System.out.println(minLen);\n }\n}",
"import java.io.*;",
"io.*",
"java",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n public static void main(String[] args) throws Exception {\n BufferedReader buffer = new BufferedReader(new InputStreamReader(System.in));\n String S = buffer.readLine();\n String T = buffer.readLine();\n int minLen = Integer.MAX_VALUE;\n for (int pos = 0; pos < S.length()-T.length()+1; pos++) {\n int currLen = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i)!=S.charAt(pos+i))currLen++;\n }\n minLen = Math.min(minLen, currLen);\n }\n System.out.println(minLen);\n }\n}",
"Main",
"public static void main(String[] args) throws Exception {\n BufferedReader buffer = new BufferedReader(new InputStreamReader(System.in));\n String S = buffer.readLine();\n String T = buffer.readLine();\n int minLen = Integer.MAX_VALUE;\n for (int pos = 0; pos < S.length()-T.length()+1; pos++) {\n int currLen = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i)!=S.charAt(pos+i))currLen++;\n }\n minLen = Math.min(minLen, currLen);\n }\n System.out.println(minLen);\n }",
"main",
"{\n BufferedReader buffer = new BufferedReader(new InputStreamReader(System.in));\n String S = buffer.readLine();\n String T = buffer.readLine();\n int minLen = Integer.MAX_VALUE;\n for (int pos = 0; pos < S.length()-T.length()+1; pos++) {\n int currLen = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i)!=S.charAt(pos+i))currLen++;\n }\n minLen = Math.min(minLen, currLen);\n }\n System.out.println(minLen);\n }",
"BufferedReader buffer = new BufferedReader(new InputStreamReader(System.in));",
"buffer",
"new BufferedReader(new InputStreamReader(System.in))",
"String S = buffer.readLine();",
"S",
"buffer.readLine()",
"buffer.readLine",
"buffer",
"String T = buffer.readLine();",
"T",
"buffer.readLine()",
"buffer.readLine",
"buffer",
"int minLen = Integer.MAX_VALUE;",
"minLen",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"for (int pos = 0; pos < S.length()-T.length()+1; pos++) {\n int currLen = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i)!=S.charAt(pos+i))currLen++;\n }\n minLen = Math.min(minLen, currLen);\n }",
"int pos = 0;",
"int pos = 0;",
"pos",
"0",
"pos < S.length()-T.length()+1",
"pos",
"S.length()-T.length()+1",
"S.length()-T.length()",
"S.length()",
"S.length",
"S",
"T.length()",
"T.length",
"T",
"1",
"pos++",
"pos++",
"pos",
"{\n int currLen = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i)!=S.charAt(pos+i))currLen++;\n }\n minLen = Math.min(minLen, currLen);\n }",
"{\n int currLen = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i)!=S.charAt(pos+i))currLen++;\n }\n minLen = Math.min(minLen, currLen);\n }",
"int currLen = 0;",
"currLen",
"0",
"for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i)!=S.charAt(pos+i))currLen++;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < T.length()",
"i",
"T.length()",
"T.length",
"T",
"i++",
"i++",
"i",
"{\n if (T.charAt(i)!=S.charAt(pos+i))currLen++;\n }",
"{\n if (T.charAt(i)!=S.charAt(pos+i))currLen++;\n }",
"if (T.charAt(i)!=S.charAt(pos+i))currLen++;",
"T.charAt(i)!=S.charAt(pos+i)",
"T.charAt(i)",
"T.charAt",
"T",
"i",
"S.charAt(pos+i)",
"S.charAt",
"S",
"pos+i",
"pos",
"i",
"currLen++",
"currLen",
"minLen = Math.min(minLen, currLen)",
"minLen",
"Math.min(minLen, currLen)",
"Math.min",
"Math",
"minLen",
"currLen",
"System.out.println(minLen)",
"System.out.println",
"System.out",
"System",
"System.out",
"minLen",
"String[] args",
"args",
"public class Main {\n public static void main(String[] args) throws Exception {\n BufferedReader buffer = new BufferedReader(new InputStreamReader(System.in));\n String S = buffer.readLine();\n String T = buffer.readLine();\n int minLen = Integer.MAX_VALUE;\n for (int pos = 0; pos < S.length()-T.length()+1; pos++) {\n int currLen = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i)!=S.charAt(pos+i))currLen++;\n }\n minLen = Math.min(minLen, currLen);\n }\n System.out.println(minLen);\n }\n}",
"public class Main {\n public static void main(String[] args) throws Exception {\n BufferedReader buffer = new BufferedReader(new InputStreamReader(System.in));\n String S = buffer.readLine();\n String T = buffer.readLine();\n int minLen = Integer.MAX_VALUE;\n for (int pos = 0; pos < S.length()-T.length()+1; pos++) {\n int currLen = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i)!=S.charAt(pos+i))currLen++;\n }\n minLen = Math.min(minLen, currLen);\n }\n System.out.println(minLen);\n }\n}",
"Main"
]
| import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader buffer = new BufferedReader(new InputStreamReader(System.in));
String S = buffer.readLine();
String T = buffer.readLine();
int minLen = Integer.MAX_VALUE;
for (int pos = 0; pos < S.length()-T.length()+1; pos++) {
int currLen = 0;
for (int i = 0; i < T.length(); i++) {
if (T.charAt(i)!=S.charAt(pos+i))currLen++;
}
minLen = Math.min(minLen, currLen);
}
System.out.println(minLen);
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
2,
2,
4,
18,
13,
4,
18,
13,
17,
41,
13,
0,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
30,
40,
18,
13,
13,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
13,
13,
30,
0,
13,
18,
13,
13,
30,
4,
18,
18,
13,
13,
2,
4,
18,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
130,
8
],
[
130,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
11,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
11,
20
],
[
20,
21
],
[
20,
22
],
[
22,
23
],
[
23,
24
],
[
11,
25
],
[
25,
26
],
[
25,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
30,
31
],
[
28,
32
],
[
32,
33
],
[
33,
34
],
[
27,
35
],
[
11,
36
],
[
36,
37
],
[
11,
38
],
[
38,
39
],
[
38,
40
],
[
11,
42
],
[
42,
43
],
[
43,
44
],
[
44,
45
],
[
44,
46
],
[
42,
47
],
[
47,
48
],
[
47,
49
],
[
42,
50
],
[
50,
51
],
[
51,
52
],
[
42,
53
],
[
54,
54
],
[
54,
55
],
[
55,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
55,
60
],
[
60,
61
],
[
60,
62
],
[
62,
63
],
[
63,
64
],
[
55,
65
],
[
65,
66
],
[
66,
67
],
[
55,
68
],
[
69,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
72,
75
],
[
75,
76
],
[
75,
77
],
[
71,
78
],
[
78,
79
],
[
79,
80
],
[
78,
81
],
[
70,
82
],
[
82,
83
],
[
83,
84
],
[
84,
85
],
[
84,
86
],
[
70,
87
],
[
11,
88
],
[
88,
89
],
[
88,
90
],
[
11,
91
],
[
91,
92
],
[
92,
93
],
[
93,
94
],
[
93,
95
],
[
91,
96
],
[
96,
97
],
[
96,
98
],
[
91,
99
],
[
99,
100
],
[
100,
101
],
[
91,
102
],
[
103,
103
],
[
103,
104
],
[
104,
105
],
[
105,
106
],
[
106,
107
],
[
106,
108
],
[
105,
109
],
[
104,
110
],
[
110,
111
],
[
111,
112
],
[
111,
113
],
[
113,
114
],
[
113,
115
],
[
104,
116
],
[
11,
117
],
[
117,
118
],
[
118,
119
],
[
119,
120
],
[
119,
121
],
[
117,
122
],
[
122,
123
],
[
123,
124
],
[
124,
125
],
[
122,
126
],
[
9,
127
],
[
127,
128
],
[
0,
129
],
[
129,
130
],
[
129,
131
]
]
| [
"import java.util.Scanner;\nimport java.util.ArrayList;\n\n\npublic class Main{\n public static void main(String args[]){\n Scanner scanner = new Scanner(System.in);\n String esu = scanner.next();\n String t = scanner.next(); \n int kaisu = esu.length() - t.length() + 1;\n \n //ArrayList<Integer> mat = new ArrayList<Integer>(); \n int mat[];\n mat = new int[kaisu];\n \n for(int i=0;i<kaisu;i++){\n for(int j=0;j<t.length();j++){\n if(esu.charAt(i+j)==t.charAt(j)){\n mat[i]++;\n }else{\n }\n } \n }\n int min =0;\n for(int i=0;i<kaisu;i++){\n if(mat[i]>min){\n min = mat[i];\n }else{\n }\n } \n\n System.out.println(t.length()-min);\n \n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"import java.util.ArrayList;",
"ArrayList",
"java.util",
"public class Main{\n public static void main(String args[]){\n Scanner scanner = new Scanner(System.in);\n String esu = scanner.next();\n String t = scanner.next(); \n int kaisu = esu.length() - t.length() + 1;\n \n //ArrayList<Integer> mat = new ArrayList<Integer>(); \n int mat[];\n mat = new int[kaisu];\n \n for(int i=0;i<kaisu;i++){\n for(int j=0;j<t.length();j++){\n if(esu.charAt(i+j)==t.charAt(j)){\n mat[i]++;\n }else{\n }\n } \n }\n int min =0;\n for(int i=0;i<kaisu;i++){\n if(mat[i]>min){\n min = mat[i];\n }else{\n }\n } \n\n System.out.println(t.length()-min);\n \n }\n}",
"Main",
"public static void main(String args[]){\n Scanner scanner = new Scanner(System.in);\n String esu = scanner.next();\n String t = scanner.next(); \n int kaisu = esu.length() - t.length() + 1;\n \n //ArrayList<Integer> mat = new ArrayList<Integer>(); \n int mat[];\n mat = new int[kaisu];\n \n for(int i=0;i<kaisu;i++){\n for(int j=0;j<t.length();j++){\n if(esu.charAt(i+j)==t.charAt(j)){\n mat[i]++;\n }else{\n }\n } \n }\n int min =0;\n for(int i=0;i<kaisu;i++){\n if(mat[i]>min){\n min = mat[i];\n }else{\n }\n } \n\n System.out.println(t.length()-min);\n \n }",
"main",
"{\n Scanner scanner = new Scanner(System.in);\n String esu = scanner.next();\n String t = scanner.next(); \n int kaisu = esu.length() - t.length() + 1;\n \n //ArrayList<Integer> mat = new ArrayList<Integer>(); \n int mat[];\n mat = new int[kaisu];\n \n for(int i=0;i<kaisu;i++){\n for(int j=0;j<t.length();j++){\n if(esu.charAt(i+j)==t.charAt(j)){\n mat[i]++;\n }else{\n }\n } \n }\n int min =0;\n for(int i=0;i<kaisu;i++){\n if(mat[i]>min){\n min = mat[i];\n }else{\n }\n } \n\n System.out.println(t.length()-min);\n \n }",
"Scanner scanner = new Scanner(System.in);",
"scanner",
"new Scanner(System.in)",
"String esu = scanner.next();",
"esu",
"scanner.next()",
"scanner.next",
"scanner",
"String t = scanner.next();",
"t",
"scanner.next()",
"scanner.next",
"scanner",
"int kaisu = esu.length() - t.length() + 1;",
"kaisu",
"esu.length() - t.length() + 1",
"esu.length() - t.length()",
"esu.length()",
"esu.length",
"esu",
"t.length()",
"t.length",
"t",
"1",
"int mat[];",
"mat",
"mat = new int[kaisu]",
"mat",
"new int[kaisu]",
"kaisu",
"for(int i=0;i<kaisu;i++){\n for(int j=0;j<t.length();j++){\n if(esu.charAt(i+j)==t.charAt(j)){\n mat[i]++;\n }else{\n }\n } \n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<kaisu",
"i",
"kaisu",
"i++",
"i++",
"i",
"{\n for(int j=0;j<t.length();j++){\n if(esu.charAt(i+j)==t.charAt(j)){\n mat[i]++;\n }else{\n }\n } \n }",
"{\n for(int j=0;j<t.length();j++){\n if(esu.charAt(i+j)==t.charAt(j)){\n mat[i]++;\n }else{\n }\n } \n }",
"for(int j=0;j<t.length();j++){\n if(esu.charAt(i+j)==t.charAt(j)){\n mat[i]++;\n }else{\n }\n }",
"int j=0;",
"int j=0;",
"j",
"0",
"j<t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n if(esu.charAt(i+j)==t.charAt(j)){\n mat[i]++;\n }else{\n }\n }",
"{\n if(esu.charAt(i+j)==t.charAt(j)){\n mat[i]++;\n }else{\n }\n }",
"if(esu.charAt(i+j)==t.charAt(j)){\n mat[i]++;\n }else{\n }",
"esu.charAt(i+j)==t.charAt(j)",
"esu.charAt(i+j)",
"esu.charAt",
"esu",
"i+j",
"i",
"j",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"{\n mat[i]++;\n }",
"mat[i]++",
"mat[i]",
"mat",
"i",
"{\n }",
"int min =0;",
"min",
"0",
"for(int i=0;i<kaisu;i++){\n if(mat[i]>min){\n min = mat[i];\n }else{\n }\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<kaisu",
"i",
"kaisu",
"i++",
"i++",
"i",
"{\n if(mat[i]>min){\n min = mat[i];\n }else{\n }\n }",
"{\n if(mat[i]>min){\n min = mat[i];\n }else{\n }\n }",
"if(mat[i]>min){\n min = mat[i];\n }else{\n }",
"mat[i]>min",
"mat[i]",
"mat",
"i",
"min",
"{\n min = mat[i];\n }",
"min = mat[i]",
"min",
"mat[i]",
"mat",
"i",
"{\n }",
"System.out.println(t.length()-min)",
"System.out.println",
"System.out",
"System",
"System.out",
"t.length()-min",
"t.length()",
"t.length",
"t",
"min",
"String args[]",
"args",
"public class Main{\n public static void main(String args[]){\n Scanner scanner = new Scanner(System.in);\n String esu = scanner.next();\n String t = scanner.next(); \n int kaisu = esu.length() - t.length() + 1;\n \n //ArrayList<Integer> mat = new ArrayList<Integer>(); \n int mat[];\n mat = new int[kaisu];\n \n for(int i=0;i<kaisu;i++){\n for(int j=0;j<t.length();j++){\n if(esu.charAt(i+j)==t.charAt(j)){\n mat[i]++;\n }else{\n }\n } \n }\n int min =0;\n for(int i=0;i<kaisu;i++){\n if(mat[i]>min){\n min = mat[i];\n }else{\n }\n } \n\n System.out.println(t.length()-min);\n \n }\n}",
"public class Main{\n public static void main(String args[]){\n Scanner scanner = new Scanner(System.in);\n String esu = scanner.next();\n String t = scanner.next(); \n int kaisu = esu.length() - t.length() + 1;\n \n //ArrayList<Integer> mat = new ArrayList<Integer>(); \n int mat[];\n mat = new int[kaisu];\n \n for(int i=0;i<kaisu;i++){\n for(int j=0;j<t.length();j++){\n if(esu.charAt(i+j)==t.charAt(j)){\n mat[i]++;\n }else{\n }\n } \n }\n int min =0;\n for(int i=0;i<kaisu;i++){\n if(mat[i]>min){\n min = mat[i];\n }else{\n }\n } \n\n System.out.println(t.length()-min);\n \n }\n}",
"Main"
]
| import java.util.Scanner;
import java.util.ArrayList;
public class Main{
public static void main(String args[]){
Scanner scanner = new Scanner(System.in);
String esu = scanner.next();
String t = scanner.next();
int kaisu = esu.length() - t.length() + 1;
//ArrayList<Integer> mat = new ArrayList<Integer>();
int mat[];
mat = new int[kaisu];
for(int i=0;i<kaisu;i++){
for(int j=0;j<t.length();j++){
if(esu.charAt(i+j)==t.charAt(j)){
mat[i]++;
}else{
}
}
}
int min =0;
for(int i=0;i<kaisu;i++){
if(mat[i]>min){
min = mat[i];
}else{
}
}
System.out.println(t.length()-min);
}
} |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
2,
17,
17,
41,
13,
2,
18,
13,
13,
17,
41,
13,
2,
18,
13,
13,
17,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
0,
13,
4,
18,
13,
13,
4,
13,
4,
18,
13,
13,
2,
13,
4,
18,
13,
13,
4,
18,
13,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
40,
13,
29,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
20,
4,
13,
13,
13,
4,
18,
13,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
0,
13,
17,
23,
13,
12,
13,
30,
14,
2,
2,
13,
17,
40,
4,
18,
13,
30,
38,
5,
13,
30,
37,
20,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
18,
4,
18,
4,
13,
17,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
318,
8
],
[
318,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
11,
13
],
[
318,
14
],
[
14,
15
],
[
14,
16
],
[
16,
17
],
[
17,
18
],
[
17,
19
],
[
16,
20
],
[
318,
21
],
[
21,
22
],
[
21,
23
],
[
23,
24
],
[
24,
25
],
[
24,
26
],
[
23,
27
],
[
318,
28
],
[
28,
29
],
[
28,
30
],
[
30,
31
],
[
31,
32
],
[
31,
33
],
[
33,
34
],
[
34,
35
],
[
30,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
30,
41
],
[
41,
42
],
[
41,
43
],
[
30,
44
],
[
44,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
44,
49
],
[
49,
50
],
[
49,
51
],
[
51,
52
],
[
52,
53
],
[
53,
54
],
[
51,
55
],
[
55,
56
],
[
56,
57
],
[
44,
58
],
[
58,
59
],
[
59,
60
],
[
44,
61
],
[
62,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
65,
66
],
[
66,
67
],
[
65,
68
],
[
65,
69
],
[
69,
70
],
[
69,
71
],
[
71,
72
],
[
72,
73
],
[
71,
74
],
[
71,
75
],
[
75,
76
],
[
75,
77
],
[
77,
78
],
[
78,
79
],
[
69,
80
],
[
30,
81
],
[
81,
82
],
[
82,
83
],
[
81,
84
],
[
28,
85
],
[
85,
86
],
[
28,
87
],
[
87,
88
],
[
318,
89
],
[
89,
90
],
[
89,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
91,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
97,
99
],
[
95,
100
],
[
100,
101
],
[
100,
102
],
[
102,
103
],
[
103,
104
],
[
95,
105
],
[
105,
106
],
[
106,
107
],
[
95,
108
],
[
109,
109
],
[
109,
110
],
[
110,
111
],
[
111,
112
],
[
112,
113
],
[
113,
114
],
[
112,
115
],
[
111,
116
],
[
116,
117
],
[
117,
118
],
[
116,
119
],
[
110,
120
],
[
120,
121
],
[
91,
122
],
[
122,
123
],
[
89,
124
],
[
124,
125
],
[
89,
126
],
[
126,
127
],
[
318,
128
],
[
128,
129
],
[
128,
130
],
[
130,
131
],
[
131,
132
],
[
131,
133
],
[
130,
134
],
[
134,
135
],
[
134,
136
],
[
130,
137
],
[
137,
138
],
[
137,
139
],
[
137,
140
],
[
130,
141
],
[
141,
142
],
[
142,
143
],
[
128,
144
],
[
144,
145
],
[
318,
146
],
[
146,
147
],
[
146,
148
],
[
148,
149
],
[
146,
150
],
[
150,
151
],
[
146,
152
],
[
152,
153
],
[
152,
154
],
[
154,
155
],
[
155,
156
],
[
155,
157
],
[
154,
158
],
[
158,
159
],
[
158,
160
],
[
152,
161
],
[
161,
162
],
[
146,
163
],
[
163,
164
],
[
163,
165
],
[
165,
166
],
[
166,
167
],
[
167,
168
],
[
168,
169
],
[
168,
170
],
[
167,
171
],
[
171,
172
],
[
172,
173
],
[
173,
174
],
[
166,
175
],
[
175,
176
],
[
176,
177
],
[
177,
178
],
[
177,
179
],
[
179,
180
],
[
180,
181
],
[
176,
182
],
[
182,
183
],
[
183,
184
],
[
183,
185
],
[
165,
186
],
[
186,
187
],
[
187,
188
],
[
188,
189
],
[
146,
190
],
[
190,
191
],
[
190,
192
],
[
192,
193
],
[
193,
194
],
[
194,
195
],
[
195,
196
],
[
194,
197
],
[
197,
198
],
[
146,
199
],
[
199,
200
],
[
199,
201
],
[
201,
202
],
[
202,
203
],
[
203,
204
],
[
204,
205
],
[
203,
206
],
[
206,
207
],
[
146,
208
],
[
208,
209
],
[
208,
210
],
[
210,
211
],
[
211,
212
],
[
212,
213
],
[
213,
214
],
[
212,
215
],
[
215,
216
],
[
146,
217
],
[
217,
218
],
[
217,
219
],
[
219,
220
],
[
220,
221
],
[
221,
222
],
[
222,
223
],
[
223,
224
],
[
224,
225
],
[
221,
226
],
[
146,
227
],
[
227,
228
],
[
227,
229
],
[
229,
230
],
[
230,
231
],
[
230,
232
],
[
229,
234
],
[
234,
235
],
[
235,
236
],
[
236,
237
],
[
236,
238
],
[
234,
239
],
[
239,
240
],
[
239,
241
],
[
234,
242
],
[
242,
243
],
[
243,
244
],
[
234,
245
],
[
246,
246
],
[
246,
247
],
[
247,
248
],
[
248,
249
],
[
248,
250
],
[
247,
251
],
[
251,
252
],
[
229,
253
],
[
253,
254
],
[
227,
255
],
[
255,
256
],
[
146,
257
],
[
257,
258
],
[
257,
259
],
[
259,
260
],
[
260,
261
],
[
260,
262
],
[
259,
264
],
[
264,
265
],
[
265,
266
],
[
266,
267
],
[
266,
268
],
[
264,
269
],
[
269,
270
],
[
269,
271
],
[
264,
272
],
[
272,
273
],
[
273,
274
],
[
264,
275
],
[
276,
276
],
[
276,
277
],
[
277,
278
],
[
278,
279
],
[
278,
280
],
[
277,
281
],
[
281,
282
],
[
259,
283
],
[
283,
284
],
[
257,
285
],
[
285,
286
],
[
146,
287
],
[
287,
288
],
[
287,
289
],
[
289,
290
],
[
290,
291
],
[
290,
292
],
[
289,
294
],
[
294,
295
],
[
295,
296
],
[
296,
297
],
[
296,
298
],
[
294,
299
],
[
299,
300
],
[
299,
301
],
[
294,
302
],
[
302,
303
],
[
303,
304
],
[
294,
305
],
[
306,
306
],
[
306,
307
],
[
307,
308
],
[
308,
309
],
[
308,
310
],
[
307,
311
],
[
311,
312
],
[
289,
313
],
[
313,
314
],
[
287,
315
],
[
315,
316
],
[
0,
317
],
[
317,
318
],
[
317,
319
]
]
| [
"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n public static final long mod = (long)1e9+7;\n public static final long INF = Long.MAX_VALUE/2;\n public static final int inf = Integer.MAX_VALUE/2;\n\n static void solve(InputReader in, PrintWriter out){\n String s = in.ns();\n String t = in.ns();\n int min = 10000;\n for (int i = 0; i <= s.length()-t.length(); i++) {\n min = Math.min(min, not_same(s.substring(i, i+t.length()), t));\n }\n out.println(min);\n }\n public static int not_same(String s, String t){\n int res = 0;\n for (int i = 0; i < s.length(); i++) {\n if(s.charAt(i)!=t.charAt(i)) res++;\n }\n return res;\n }\n\n public static void main(String[] args){\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n solve(in, out);\n out.close();\n }\n public static class InputReader{\n private BufferedReader br;\n private StringTokenizer st;\n public InputReader(InputStream is){\n br = new BufferedReader(new InputStreamReader(is));\n st = null;\n }\n public String ns(){\n if(st == null || !st.hasMoreTokens()){\n try{\n st = new StringTokenizer(br.readLine());\n }catch (Exception e){\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n public int ni(){\n return Integer.parseInt(ns());\n }\n public long nl(){\n return Long.parseLong(ns());\n }\n public double nd(){\n return Double.parseDouble(ns());\n }\n public char nc(){\n return ns().toCharArray()[0];\n }\n public int[] ni(int n){\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = ni();\n }\n return a;\n }\n public long[] nl(int n){\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nl();\n }\n return a;\n }\n public double[] nd(int n){\n double[] a = new double[n];\n for (int i = 0; i < n; i++) {\n a[i] = nd();\n }\n return a;\n }\n }\n}",
"import java.io.*;",
"io.*",
"java",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n public static final long mod = (long)1e9+7;\n public static final long INF = Long.MAX_VALUE/2;\n public static final int inf = Integer.MAX_VALUE/2;\n\n static void solve(InputReader in, PrintWriter out){\n String s = in.ns();\n String t = in.ns();\n int min = 10000;\n for (int i = 0; i <= s.length()-t.length(); i++) {\n min = Math.min(min, not_same(s.substring(i, i+t.length()), t));\n }\n out.println(min);\n }\n public static int not_same(String s, String t){\n int res = 0;\n for (int i = 0; i < s.length(); i++) {\n if(s.charAt(i)!=t.charAt(i)) res++;\n }\n return res;\n }\n\n public static void main(String[] args){\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n solve(in, out);\n out.close();\n }\n public static class InputReader{\n private BufferedReader br;\n private StringTokenizer st;\n public InputReader(InputStream is){\n br = new BufferedReader(new InputStreamReader(is));\n st = null;\n }\n public String ns(){\n if(st == null || !st.hasMoreTokens()){\n try{\n st = new StringTokenizer(br.readLine());\n }catch (Exception e){\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n public int ni(){\n return Integer.parseInt(ns());\n }\n public long nl(){\n return Long.parseLong(ns());\n }\n public double nd(){\n return Double.parseDouble(ns());\n }\n public char nc(){\n return ns().toCharArray()[0];\n }\n public int[] ni(int n){\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = ni();\n }\n return a;\n }\n public long[] nl(int n){\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nl();\n }\n return a;\n }\n public double[] nd(int n){\n double[] a = new double[n];\n for (int i = 0; i < n; i++) {\n a[i] = nd();\n }\n return a;\n }\n }\n}",
"Main",
"public static final long mod = (long)1e9+7;",
"mod",
"(long)1e9+7",
"(long)1e9",
"7",
"public static final long INF = Long.MAX_VALUE/2;",
"INF",
"Long.MAX_VALUE/2",
"Long.MAX_VALUE",
"Long",
"Long.MAX_VALUE",
"2",
"public static final int inf = Integer.MAX_VALUE/2;",
"inf",
"Integer.MAX_VALUE/2",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"2",
"static void solve(InputReader in, PrintWriter out){\n String s = in.ns();\n String t = in.ns();\n int min = 10000;\n for (int i = 0; i <= s.length()-t.length(); i++) {\n min = Math.min(min, not_same(s.substring(i, i+t.length()), t));\n }\n out.println(min);\n }",
"solve",
"{\n String s = in.ns();\n String t = in.ns();\n int min = 10000;\n for (int i = 0; i <= s.length()-t.length(); i++) {\n min = Math.min(min, not_same(s.substring(i, i+t.length()), t));\n }\n out.println(min);\n }",
"String s = in.ns();",
"s",
"in.ns()",
"in.ns",
"in",
"String t = in.ns();",
"t",
"in.ns()",
"in.ns",
"in",
"int min = 10000;",
"min",
"10000",
"for (int i = 0; i <= s.length()-t.length(); i++) {\n min = Math.min(min, not_same(s.substring(i, i+t.length()), t));\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= s.length()-t.length()",
"i",
"s.length()-t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"i++",
"i++",
"i",
"{\n min = Math.min(min, not_same(s.substring(i, i+t.length()), t));\n }",
"{\n min = Math.min(min, not_same(s.substring(i, i+t.length()), t));\n }",
"min = Math.min(min, not_same(s.substring(i, i+t.length()), t))",
"min",
"Math.min(min, not_same(s.substring(i, i+t.length()), t))",
"Math.min",
"Math",
"min",
"not_same(s.substring(i, i+t.length()), t)",
"not_same",
"s.substring(i, i+t.length())",
"s.substring",
"s",
"i",
"i+t.length()",
"i",
"t.length()",
"t.length",
"t",
"t",
"out.println(min)",
"out.println",
"out",
"min",
"InputReader in",
"in",
"PrintWriter out",
"out",
"public static int not_same(String s, String t){\n int res = 0;\n for (int i = 0; i < s.length(); i++) {\n if(s.charAt(i)!=t.charAt(i)) res++;\n }\n return res;\n }",
"not_same",
"{\n int res = 0;\n for (int i = 0; i < s.length(); i++) {\n if(s.charAt(i)!=t.charAt(i)) res++;\n }\n return res;\n }",
"int res = 0;",
"res",
"0",
"for (int i = 0; i < s.length(); i++) {\n if(s.charAt(i)!=t.charAt(i)) res++;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < s.length()",
"i",
"s.length()",
"s.length",
"s",
"i++",
"i++",
"i",
"{\n if(s.charAt(i)!=t.charAt(i)) res++;\n }",
"{\n if(s.charAt(i)!=t.charAt(i)) res++;\n }",
"if(s.charAt(i)!=t.charAt(i)) res++;",
"s.charAt(i)!=t.charAt(i)",
"s.charAt(i)",
"s.charAt",
"s",
"i",
"t.charAt(i)",
"t.charAt",
"t",
"i",
"res++",
"res",
"return res;",
"res",
"String s",
"s",
"String t",
"t",
"public static void main(String[] args){\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n solve(in, out);\n out.close();\n }",
"main",
"{\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n solve(in, out);\n out.close();\n }",
"InputReader in = new InputReader(System.in);",
"in",
"new InputReader(System.in)",
"PrintWriter out = new PrintWriter(System.out);",
"out",
"new PrintWriter(System.out)",
"solve(in, out)",
"solve",
"in",
"out",
"out.close()",
"out.close",
"out",
"String[] args",
"args",
"public static class InputReader{\n private BufferedReader br;\n private StringTokenizer st;\n public InputReader(InputStream is){\n br = new BufferedReader(new InputStreamReader(is));\n st = null;\n }\n public String ns(){\n if(st == null || !st.hasMoreTokens()){\n try{\n st = new StringTokenizer(br.readLine());\n }catch (Exception e){\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n public int ni(){\n return Integer.parseInt(ns());\n }\n public long nl(){\n return Long.parseLong(ns());\n }\n public double nd(){\n return Double.parseDouble(ns());\n }\n public char nc(){\n return ns().toCharArray()[0];\n }\n public int[] ni(int n){\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = ni();\n }\n return a;\n }\n public long[] nl(int n){\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nl();\n }\n return a;\n }\n public double[] nd(int n){\n double[] a = new double[n];\n for (int i = 0; i < n; i++) {\n a[i] = nd();\n }\n return a;\n }\n }",
"InputReader",
"private BufferedReader br;",
"br",
"private StringTokenizer st;",
"st",
"public InputReader(InputStream is){\n br = new BufferedReader(new InputStreamReader(is));\n st = null;\n }",
"InputReader",
"{\n br = new BufferedReader(new InputStreamReader(is));\n st = null;\n }",
"br = new BufferedReader(new InputStreamReader(is))",
"br",
"new BufferedReader(new InputStreamReader(is))",
"st = null",
"st",
"null",
"InputStream is",
"is",
"public String ns(){\n if(st == null || !st.hasMoreTokens()){\n try{\n st = new StringTokenizer(br.readLine());\n }catch (Exception e){\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }",
"ns",
"{\n if(st == null || !st.hasMoreTokens()){\n try{\n st = new StringTokenizer(br.readLine());\n }catch (Exception e){\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }",
"if(st == null || !st.hasMoreTokens()){\n try{\n st = new StringTokenizer(br.readLine());\n }catch (Exception e){\n throw new RuntimeException(e);\n }\n }",
"st == null || !st.hasMoreTokens()",
"st == null",
"st",
"null",
"!st.hasMoreTokens()",
"st.hasMoreTokens()",
"st.hasMoreTokens",
"st",
"{\n try{\n st = new StringTokenizer(br.readLine());\n }catch (Exception e){\n throw new RuntimeException(e);\n }\n }",
"try{\n st = new StringTokenizer(br.readLine());\n }catch (Exception e){\n throw new RuntimeException(e);\n }",
"catch (Exception e){\n throw new RuntimeException(e);\n }",
"Exception e",
"{\n throw new RuntimeException(e);\n }",
"throw new RuntimeException(e);",
"new RuntimeException(e)",
"{\n st = new StringTokenizer(br.readLine());\n }",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"public int ni(){\n return Integer.parseInt(ns());\n }",
"ni",
"{\n return Integer.parseInt(ns());\n }",
"return Integer.parseInt(ns());",
"Integer.parseInt(ns())",
"Integer.parseInt",
"Integer",
"ns()",
"ns",
"public long nl(){\n return Long.parseLong(ns());\n }",
"nl",
"{\n return Long.parseLong(ns());\n }",
"return Long.parseLong(ns());",
"Long.parseLong(ns())",
"Long.parseLong",
"Long",
"ns()",
"ns",
"public double nd(){\n return Double.parseDouble(ns());\n }",
"nd",
"{\n return Double.parseDouble(ns());\n }",
"return Double.parseDouble(ns());",
"Double.parseDouble(ns())",
"Double.parseDouble",
"Double",
"ns()",
"ns",
"public char nc(){\n return ns().toCharArray()[0];\n }",
"nc",
"{\n return ns().toCharArray()[0];\n }",
"return ns().toCharArray()[0];",
"ns().toCharArray()[0]",
"ns().toCharArray()",
"ns().toCharArray",
"ns()",
"ns",
"0",
"public int[] ni(int n){\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = ni();\n }\n return a;\n }",
"ni",
"{\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = ni();\n }\n return a;\n }",
"int[] a = new int[n];",
"a",
"new int[n]",
"n",
"for (int i = 0; i < n; i++) {\n a[i] = ni();\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n a[i] = ni();\n }",
"{\n a[i] = ni();\n }",
"a[i] = ni()",
"a[i]",
"a",
"i",
"ni()",
"ni",
"return a;",
"a",
"int n",
"n",
"public long[] nl(int n){\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nl();\n }\n return a;\n }",
"nl",
"{\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nl();\n }\n return a;\n }",
"long[] a = new long[n];",
"a",
"new long[n]",
"n",
"for (int i = 0; i < n; i++) {\n a[i] = nl();\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n a[i] = nl();\n }",
"{\n a[i] = nl();\n }",
"a[i] = nl()",
"a[i]",
"a",
"i",
"nl()",
"nl",
"return a;",
"a",
"int n",
"n",
"public double[] nd(int n){\n double[] a = new double[n];\n for (int i = 0; i < n; i++) {\n a[i] = nd();\n }\n return a;\n }",
"nd",
"{\n double[] a = new double[n];\n for (int i = 0; i < n; i++) {\n a[i] = nd();\n }\n return a;\n }",
"double[] a = new double[n];",
"a",
"new double[n]",
"n",
"for (int i = 0; i < n; i++) {\n a[i] = nd();\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n a[i] = nd();\n }",
"{\n a[i] = nd();\n }",
"a[i] = nd()",
"a[i]",
"a",
"i",
"nd()",
"nd",
"return a;",
"a",
"int n",
"n",
"public class Main {\n public static final long mod = (long)1e9+7;\n public static final long INF = Long.MAX_VALUE/2;\n public static final int inf = Integer.MAX_VALUE/2;\n\n static void solve(InputReader in, PrintWriter out){\n String s = in.ns();\n String t = in.ns();\n int min = 10000;\n for (int i = 0; i <= s.length()-t.length(); i++) {\n min = Math.min(min, not_same(s.substring(i, i+t.length()), t));\n }\n out.println(min);\n }\n public static int not_same(String s, String t){\n int res = 0;\n for (int i = 0; i < s.length(); i++) {\n if(s.charAt(i)!=t.charAt(i)) res++;\n }\n return res;\n }\n\n public static void main(String[] args){\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n solve(in, out);\n out.close();\n }\n public static class InputReader{\n private BufferedReader br;\n private StringTokenizer st;\n public InputReader(InputStream is){\n br = new BufferedReader(new InputStreamReader(is));\n st = null;\n }\n public String ns(){\n if(st == null || !st.hasMoreTokens()){\n try{\n st = new StringTokenizer(br.readLine());\n }catch (Exception e){\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n public int ni(){\n return Integer.parseInt(ns());\n }\n public long nl(){\n return Long.parseLong(ns());\n }\n public double nd(){\n return Double.parseDouble(ns());\n }\n public char nc(){\n return ns().toCharArray()[0];\n }\n public int[] ni(int n){\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = ni();\n }\n return a;\n }\n public long[] nl(int n){\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nl();\n }\n return a;\n }\n public double[] nd(int n){\n double[] a = new double[n];\n for (int i = 0; i < n; i++) {\n a[i] = nd();\n }\n return a;\n }\n }\n}",
"public class Main {\n public static final long mod = (long)1e9+7;\n public static final long INF = Long.MAX_VALUE/2;\n public static final int inf = Integer.MAX_VALUE/2;\n\n static void solve(InputReader in, PrintWriter out){\n String s = in.ns();\n String t = in.ns();\n int min = 10000;\n for (int i = 0; i <= s.length()-t.length(); i++) {\n min = Math.min(min, not_same(s.substring(i, i+t.length()), t));\n }\n out.println(min);\n }\n public static int not_same(String s, String t){\n int res = 0;\n for (int i = 0; i < s.length(); i++) {\n if(s.charAt(i)!=t.charAt(i)) res++;\n }\n return res;\n }\n\n public static void main(String[] args){\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n solve(in, out);\n out.close();\n }\n public static class InputReader{\n private BufferedReader br;\n private StringTokenizer st;\n public InputReader(InputStream is){\n br = new BufferedReader(new InputStreamReader(is));\n st = null;\n }\n public String ns(){\n if(st == null || !st.hasMoreTokens()){\n try{\n st = new StringTokenizer(br.readLine());\n }catch (Exception e){\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n public int ni(){\n return Integer.parseInt(ns());\n }\n public long nl(){\n return Long.parseLong(ns());\n }\n public double nd(){\n return Double.parseDouble(ns());\n }\n public char nc(){\n return ns().toCharArray()[0];\n }\n public int[] ni(int n){\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = ni();\n }\n return a;\n }\n public long[] nl(int n){\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nl();\n }\n return a;\n }\n public double[] nd(int n){\n double[] a = new double[n];\n for (int i = 0; i < n; i++) {\n a[i] = nd();\n }\n return a;\n }\n }\n}",
"Main"
]
| import java.io.*;
import java.util.*;
public class Main {
public static final long mod = (long)1e9+7;
public static final long INF = Long.MAX_VALUE/2;
public static final int inf = Integer.MAX_VALUE/2;
static void solve(InputReader in, PrintWriter out){
String s = in.ns();
String t = in.ns();
int min = 10000;
for (int i = 0; i <= s.length()-t.length(); i++) {
min = Math.min(min, not_same(s.substring(i, i+t.length()), t));
}
out.println(min);
}
public static int not_same(String s, String t){
int res = 0;
for (int i = 0; i < s.length(); i++) {
if(s.charAt(i)!=t.charAt(i)) res++;
}
return res;
}
public static void main(String[] args){
InputReader in = new InputReader(System.in);
PrintWriter out = new PrintWriter(System.out);
solve(in, out);
out.close();
}
public static class InputReader{
private BufferedReader br;
private StringTokenizer st;
public InputReader(InputStream is){
br = new BufferedReader(new InputStreamReader(is));
st = null;
}
public String ns(){
if(st == null || !st.hasMoreTokens()){
try{
st = new StringTokenizer(br.readLine());
}catch (Exception e){
throw new RuntimeException(e);
}
}
return st.nextToken();
}
public int ni(){
return Integer.parseInt(ns());
}
public long nl(){
return Long.parseLong(ns());
}
public double nd(){
return Double.parseDouble(ns());
}
public char nc(){
return ns().toCharArray()[0];
}
public int[] ni(int n){
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = ni();
}
return a;
}
public long[] nl(int n){
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = nl();
}
return a;
}
public double[] nd(int n){
double[] a = new double[n];
for (int i = 0; i < n; i++) {
a[i] = nd();
}
return a;
}
}
} |
[
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,
13,
4,
18,
13,
23,
13,
6,
13,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
2,
13,
13,
14,
2,
2,
13,
13,
13,
30,
4,
18,
13,
17,
30,
4,
18,
13,
17,
23,
13,
23,
13,
6,
13,
12,
13,
30,
41,
13,
4,
18,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
18,
13,
13,
18,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
13,
18,
13,
2,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
13,
13,
23,
13,
23,
13,
6,
13,
41,
13,
41,
13,
41,
13,
12,
13,
30,
0,
18,
36,
13,
20,
0,
18,
36,
13,
17,
0,
18,
36,
13,
20,
23,
13,
12,
13,
30,
42,
40,
4,
18,
13,
30,
38,
5,
13,
30,
37,
20,
30,
41,
13,
4,
18,
13,
14,
2,
13,
17,
29,
17,
0,
13,
20,
29,
17,
12,
13,
30,
4,
13,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
16,
17
],
[
16,
18
],
[
0,
19
],
[
19,
20
],
[
19,
21
],
[
0,
22
],
[
22,
23
],
[
22,
24
],
[
0,
25
],
[
272,
26
],
[
272,
27
],
[
27,
28
],
[
27,
29
],
[
29,
30
],
[
30,
31
],
[
30,
32
],
[
32,
33
],
[
32,
34
],
[
29,
35
],
[
35,
36
],
[
35,
37
],
[
37,
38
],
[
37,
39
],
[
29,
40
],
[
40,
41
],
[
40,
42
],
[
29,
43
],
[
43,
44
],
[
43,
45
],
[
29,
46
],
[
46,
47
],
[
46,
48
],
[
29,
49
],
[
49,
50
],
[
50,
51
],
[
49,
52
],
[
49,
53
],
[
29,
54
],
[
54,
55
],
[
55,
56
],
[
27,
57
],
[
57,
58
],
[
0,
59
],
[
59,
60
],
[
59,
61
],
[
61,
62
],
[
61,
63
],
[
63,
64
],
[
64,
65
],
[
64,
66
],
[
66,
67
],
[
67,
68
],
[
63,
69
],
[
69,
70
],
[
69,
71
],
[
71,
72
],
[
72,
73
],
[
63,
74
],
[
74,
75
],
[
74,
76
],
[
76,
77
],
[
77,
78
],
[
63,
79
],
[
79,
80
],
[
79,
81
],
[
81,
82
],
[
81,
83
],
[
63,
84
],
[
84,
85
],
[
85,
86
],
[
86,
87
],
[
86,
88
],
[
85,
89
],
[
84,
90
],
[
90,
91
],
[
91,
92
],
[
92,
93
],
[
91,
94
],
[
84,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
96,
99
],
[
61,
100
],
[
100,
101
],
[
61,
102
],
[
102,
103
],
[
0,
104
],
[
104,
105
],
[
104,
106
],
[
106,
107
],
[
106,
108
],
[
108,
109
],
[
109,
110
],
[
109,
111
],
[
111,
112
],
[
112,
113
],
[
113,
114
],
[
114,
115
],
[
108,
116
],
[
116,
117
],
[
116,
118
],
[
118,
119
],
[
119,
120
],
[
120,
121
],
[
121,
122
],
[
108,
123
],
[
123,
124
],
[
123,
125
],
[
125,
126
],
[
125,
127
],
[
108,
128
],
[
128,
129
],
[
129,
130
],
[
130,
131
],
[
130,
132
],
[
128,
133
],
[
133,
134
],
[
133,
135
],
[
135,
136
],
[
136,
137
],
[
136,
138
],
[
135,
139
],
[
139,
140
],
[
139,
141
],
[
128,
142
],
[
142,
143
],
[
143,
144
],
[
128,
145
],
[
146,
146
],
[
146,
147
],
[
147,
148
],
[
147,
149
],
[
146,
150
],
[
150,
151
],
[
151,
152
],
[
152,
153
],
[
152,
154
],
[
150,
155
],
[
155,
156
],
[
155,
157
],
[
157,
158
],
[
157,
159
],
[
150,
160
],
[
160,
161
],
[
161,
162
],
[
150,
163
],
[
164,
164
],
[
164,
165
],
[
165,
166
],
[
166,
167
],
[
167,
168
],
[
167,
169
],
[
166,
170
],
[
170,
171
],
[
170,
172
],
[
172,
173
],
[
172,
174
],
[
165,
175
],
[
175,
176
],
[
176,
177
],
[
146,
178
],
[
178,
179
],
[
178,
180
],
[
180,
181
],
[
181,
182
],
[
180,
183
],
[
180,
184
],
[
108,
185
],
[
185,
186
],
[
186,
187
],
[
185,
188
],
[
106,
189
],
[
189,
190
],
[
106,
191
],
[
191,
192
],
[
0,
193
],
[
193,
194
],
[
193,
195
],
[
195,
196
],
[
193,
197
],
[
197,
198
],
[
193,
199
],
[
199,
200
],
[
193,
201
],
[
201,
202
],
[
201,
203
],
[
203,
204
],
[
204,
205
],
[
205,
206
],
[
205,
207
],
[
204,
208
],
[
203,
209
],
[
209,
210
],
[
210,
211
],
[
210,
212
],
[
209,
213
],
[
203,
214
],
[
214,
215
],
[
215,
216
],
[
215,
217
],
[
214,
218
],
[
201,
219
],
[
219,
220
],
[
193,
221
],
[
221,
222
],
[
221,
223
],
[
223,
224
],
[
224,
225
],
[
225,
226
],
[
226,
227
],
[
227,
228
],
[
224,
229
],
[
229,
230
],
[
230,
231
],
[
231,
232
],
[
231,
233
],
[
233,
234
],
[
234,
235
],
[
230,
236
],
[
236,
237
],
[
237,
238
],
[
237,
239
],
[
239,
240
],
[
240,
241
],
[
236,
242
],
[
242,
243
],
[
243,
244
],
[
243,
245
],
[
242,
246
],
[
246,
247
],
[
236,
248
],
[
248,
249
],
[
248,
250
],
[
223,
251
],
[
251,
252
],
[
193,
253
],
[
253,
254
],
[
253,
255
],
[
255,
256
],
[
256,
257
],
[
255,
258
],
[
258,
259
],
[
259,
260
],
[
260,
261
],
[
193,
262
],
[
262,
263
],
[
262,
264
],
[
264,
265
],
[
265,
266
],
[
266,
267
],
[
267,
268
],
[
266,
269
],
[
269,
270
],
[
0,
271
],
[
271,
272
],
[
271,
273
]
]
| [
"import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.InputMismatchException;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n QuickScanner in = new QuickScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(in, out);\n out.close();\n }\n}\n\nclass Task {\n public void solve(QuickScanner in, PrintWriter out) {\n int D = in.nextInt();\n int T = in.nextInt();\n int S = in.nextInt();\n double time = (double)D/(double)T;\n if(T*S >= D) {\n \tout.print(\"Yes\"); \t\n }else {\n \tout.print(\"No\");\n }\n }\n}\nclass TaskB {\n public void solve(QuickScanner in, PrintWriter out) {\n char[] S = in.next().toCharArray();\n char[] T = in.next().toCharArray();\n int ans = T.length;\n for(int start = 0; start <= S.length - T.length; start++) {\n \tint diff = 0;\n \tfor(int i = 0; i < T.length; i++) {\n \t\tif(T[i] != S[start + i]) {\n \t\t\tdiff++;\n \t\t}\n \t}\n \tans = Math.min(ans,diff);\n }\n out.print(ans);\n }\n}\n\n\nclass QuickScanner {\n BufferedReader in;\n StringTokenizer token;\n String delim;\n public QuickScanner(InputStream inputStream)\n {\n this.in=new BufferedReader(new InputStreamReader(inputStream));\n this.delim=\" \\n\\t\";\n this.token=new StringTokenizer(\"\",delim);\n }\n\n public boolean hasNext()\n {\n while(!token.hasMoreTokens())\n {\n try {\n String s=in.readLine();\n if(s==null) return false;\n token=new StringTokenizer(s,delim);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n return true;\n }\n\n public String next()\n {\n hasNext();\n return token.nextToken();\n }\n\n public int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n}",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.util.InputMismatchException;",
"InputMismatchException",
"java.util",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.OutputStream;",
"OutputStream",
"java.io",
"import java.io.PrintWriter;",
"PrintWriter",
"java.io",
"import java.util.StringTokenizer;",
"StringTokenizer",
"java.util",
"import java.io.InputStream;",
"InputStream",
"java.io",
"public class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n QuickScanner in = new QuickScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(in, out);\n out.close();\n }\n}",
"Main",
"public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n QuickScanner in = new QuickScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(in, out);\n out.close();\n }",
"main",
"{\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n QuickScanner in = new QuickScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(in, out);\n out.close();\n }",
"InputStream inputStream = System.in;",
"inputStream",
"System.in",
"System",
"System.in",
"OutputStream outputStream = System.out;",
"outputStream",
"System.out",
"System",
"System.out",
"QuickScanner in = new QuickScanner(inputStream);",
"in",
"new QuickScanner(inputStream)",
"PrintWriter out = new PrintWriter(outputStream);",
"out",
"new PrintWriter(outputStream)",
"TaskB solver = new TaskB();",
"solver",
"new TaskB()",
"solver.solve(in, out)",
"solver.solve",
"solver",
"in",
"out",
"out.close()",
"out.close",
"out",
"String[] args",
"args",
"class Task {\n public void solve(QuickScanner in, PrintWriter out) {\n int D = in.nextInt();\n int T = in.nextInt();\n int S = in.nextInt();\n double time = (double)D/(double)T;\n if(T*S >= D) {\n \tout.print(\"Yes\"); \t\n }else {\n \tout.print(\"No\");\n }\n }\n}",
"Task",
"public void solve(QuickScanner in, PrintWriter out) {\n int D = in.nextInt();\n int T = in.nextInt();\n int S = in.nextInt();\n double time = (double)D/(double)T;\n if(T*S >= D) {\n \tout.print(\"Yes\"); \t\n }else {\n \tout.print(\"No\");\n }\n }",
"solve",
"{\n int D = in.nextInt();\n int T = in.nextInt();\n int S = in.nextInt();\n double time = (double)D/(double)T;\n if(T*S >= D) {\n \tout.print(\"Yes\"); \t\n }else {\n \tout.print(\"No\");\n }\n }",
"int D = in.nextInt();",
"D",
"in.nextInt()",
"in.nextInt",
"in",
"int T = in.nextInt();",
"T",
"in.nextInt()",
"in.nextInt",
"in",
"int S = in.nextInt();",
"S",
"in.nextInt()",
"in.nextInt",
"in",
"double time = (double)D/(double)T;",
"time",
"(double)D/(double)T",
"(double)D",
"(double)T",
"if(T*S >= D) {\n \tout.print(\"Yes\"); \t\n }else {\n \tout.print(\"No\");\n }",
"T*S >= D",
"T*S",
"T",
"S",
"D",
"{\n \tout.print(\"Yes\"); \t\n }",
"out.print(\"Yes\")",
"out.print",
"out",
"\"Yes\"",
"{\n \tout.print(\"No\");\n }",
"out.print(\"No\")",
"out.print",
"out",
"\"No\"",
"QuickScanner in",
"in",
"PrintWriter out",
"out",
"class TaskB {\n public void solve(QuickScanner in, PrintWriter out) {\n char[] S = in.next().toCharArray();\n char[] T = in.next().toCharArray();\n int ans = T.length;\n for(int start = 0; start <= S.length - T.length; start++) {\n \tint diff = 0;\n \tfor(int i = 0; i < T.length; i++) {\n \t\tif(T[i] != S[start + i]) {\n \t\t\tdiff++;\n \t\t}\n \t}\n \tans = Math.min(ans,diff);\n }\n out.print(ans);\n }\n}",
"TaskB",
"public void solve(QuickScanner in, PrintWriter out) {\n char[] S = in.next().toCharArray();\n char[] T = in.next().toCharArray();\n int ans = T.length;\n for(int start = 0; start <= S.length - T.length; start++) {\n \tint diff = 0;\n \tfor(int i = 0; i < T.length; i++) {\n \t\tif(T[i] != S[start + i]) {\n \t\t\tdiff++;\n \t\t}\n \t}\n \tans = Math.min(ans,diff);\n }\n out.print(ans);\n }",
"solve",
"{\n char[] S = in.next().toCharArray();\n char[] T = in.next().toCharArray();\n int ans = T.length;\n for(int start = 0; start <= S.length - T.length; start++) {\n \tint diff = 0;\n \tfor(int i = 0; i < T.length; i++) {\n \t\tif(T[i] != S[start + i]) {\n \t\t\tdiff++;\n \t\t}\n \t}\n \tans = Math.min(ans,diff);\n }\n out.print(ans);\n }",
"char[] S = in.next().toCharArray();",
"S",
"in.next().toCharArray()",
"in.next().toCharArray",
"in.next()",
"in.next",
"in",
"char[] T = in.next().toCharArray();",
"T",
"in.next().toCharArray()",
"in.next().toCharArray",
"in.next()",
"in.next",
"in",
"int ans = T.length;",
"ans",
"T.length",
"T",
"T.length",
"for(int start = 0; start <= S.length - T.length; start++) {\n \tint diff = 0;\n \tfor(int i = 0; i < T.length; i++) {\n \t\tif(T[i] != S[start + i]) {\n \t\t\tdiff++;\n \t\t}\n \t}\n \tans = Math.min(ans,diff);\n }",
"int start = 0;",
"int start = 0;",
"start",
"0",
"start <= S.length - T.length",
"start",
"S.length - T.length",
"S.length",
"S",
"S.length",
"T.length",
"T",
"T.length",
"start++",
"start++",
"start",
"{\n \tint diff = 0;\n \tfor(int i = 0; i < T.length; i++) {\n \t\tif(T[i] != S[start + i]) {\n \t\t\tdiff++;\n \t\t}\n \t}\n \tans = Math.min(ans,diff);\n }",
"{\n \tint diff = 0;\n \tfor(int i = 0; i < T.length; i++) {\n \t\tif(T[i] != S[start + i]) {\n \t\t\tdiff++;\n \t\t}\n \t}\n \tans = Math.min(ans,diff);\n }",
"int diff = 0;",
"diff",
"0",
"for(int i = 0; i < T.length; i++) {\n \t\tif(T[i] != S[start + i]) {\n \t\t\tdiff++;\n \t\t}\n \t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < T.length",
"i",
"T.length",
"T",
"T.length",
"i++",
"i++",
"i",
"{\n \t\tif(T[i] != S[start + i]) {\n \t\t\tdiff++;\n \t\t}\n \t}",
"{\n \t\tif(T[i] != S[start + i]) {\n \t\t\tdiff++;\n \t\t}\n \t}",
"if(T[i] != S[start + i]) {\n \t\t\tdiff++;\n \t\t}",
"T[i] != S[start + i]",
"T[i]",
"T",
"i",
"S[start + i]",
"S",
"start + i",
"start",
"i",
"{\n \t\t\tdiff++;\n \t\t}",
"diff++",
"diff",
"ans = Math.min(ans,diff)",
"ans",
"Math.min(ans,diff)",
"Math.min",
"Math",
"ans",
"diff",
"out.print(ans)",
"out.print",
"out",
"ans",
"QuickScanner in",
"in",
"PrintWriter out",
"out",
"class QuickScanner {\n BufferedReader in;\n StringTokenizer token;\n String delim;\n public QuickScanner(InputStream inputStream)\n {\n this.in=new BufferedReader(new InputStreamReader(inputStream));\n this.delim=\" \\n\\t\";\n this.token=new StringTokenizer(\"\",delim);\n }\n\n public boolean hasNext()\n {\n while(!token.hasMoreTokens())\n {\n try {\n String s=in.readLine();\n if(s==null) return false;\n token=new StringTokenizer(s,delim);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n return true;\n }\n\n public String next()\n {\n hasNext();\n return token.nextToken();\n }\n\n public int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n}",
"QuickScanner",
"BufferedReader in;",
"in",
"StringTokenizer token;",
"token",
"String delim;",
"delim",
"public QuickScanner(InputStream inputStream)\n {\n this.in=new BufferedReader(new InputStreamReader(inputStream));\n this.delim=\" \\n\\t\";\n this.token=new StringTokenizer(\"\",delim);\n }",
"QuickScanner",
"{\n this.in=new BufferedReader(new InputStreamReader(inputStream));\n this.delim=\" \\n\\t\";\n this.token=new StringTokenizer(\"\",delim);\n }",
"this.in=new BufferedReader(new InputStreamReader(inputStream))",
"this.in",
"this",
"this.in",
"new BufferedReader(new InputStreamReader(inputStream))",
"this.delim=\" \\n\\t\"",
"this.delim",
"this",
"this.delim",
"\" \\n\\t\"",
"this.token=new StringTokenizer(\"\",delim)",
"this.token",
"this",
"this.token",
"new StringTokenizer(\"\",delim)",
"InputStream inputStream",
"inputStream",
"public boolean hasNext()\n {\n while(!token.hasMoreTokens())\n {\n try {\n String s=in.readLine();\n if(s==null) return false;\n token=new StringTokenizer(s,delim);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n return true;\n }",
"hasNext",
"{\n while(!token.hasMoreTokens())\n {\n try {\n String s=in.readLine();\n if(s==null) return false;\n token=new StringTokenizer(s,delim);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n return true;\n }",
"while(!token.hasMoreTokens())\n {\n try {\n String s=in.readLine();\n if(s==null) return false;\n token=new StringTokenizer(s,delim);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }",
"!token.hasMoreTokens()",
"token.hasMoreTokens()",
"token.hasMoreTokens",
"token",
"{\n try {\n String s=in.readLine();\n if(s==null) return false;\n token=new StringTokenizer(s,delim);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }",
"try {\n String s=in.readLine();\n if(s==null) return false;\n token=new StringTokenizer(s,delim);\n } catch (IOException e) {\n throw new InputMismatchException();\n }",
"catch (IOException e) {\n throw new InputMismatchException();\n }",
"IOException e",
"{\n throw new InputMismatchException();\n }",
"throw new InputMismatchException();",
"new InputMismatchException()",
"{\n String s=in.readLine();\n if(s==null) return false;\n token=new StringTokenizer(s,delim);\n }",
"String s=in.readLine();",
"s",
"in.readLine()",
"in.readLine",
"in",
"if(s==null) return false;",
"s==null",
"s",
"null",
"return false;",
"false",
"token=new StringTokenizer(s,delim)",
"token",
"new StringTokenizer(s,delim)",
"return true;",
"true",
"public String next()\n {\n hasNext();\n return token.nextToken();\n }",
"next",
"{\n hasNext();\n return token.nextToken();\n }",
"hasNext()",
"hasNext",
"return token.nextToken();",
"token.nextToken()",
"token.nextToken",
"token",
"public int nextInt()\n {\n return Integer.parseInt(next());\n }",
"nextInt",
"{\n return Integer.parseInt(next());\n }",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"public class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n QuickScanner in = new QuickScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(in, out);\n out.close();\n }\n}",
"public class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n QuickScanner in = new QuickScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(in, out);\n out.close();\n }\n}",
"Main"
]
| import java.io.InputStreamReader;
import java.io.IOException;
import java.util.InputMismatchException;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
QuickScanner in = new QuickScanner(inputStream);
PrintWriter out = new PrintWriter(outputStream);
TaskB solver = new TaskB();
solver.solve(in, out);
out.close();
}
}
class Task {
public void solve(QuickScanner in, PrintWriter out) {
int D = in.nextInt();
int T = in.nextInt();
int S = in.nextInt();
double time = (double)D/(double)T;
if(T*S >= D) {
out.print("Yes");
}else {
out.print("No");
}
}
}
class TaskB {
public void solve(QuickScanner in, PrintWriter out) {
char[] S = in.next().toCharArray();
char[] T = in.next().toCharArray();
int ans = T.length;
for(int start = 0; start <= S.length - T.length; start++) {
int diff = 0;
for(int i = 0; i < T.length; i++) {
if(T[i] != S[start + i]) {
diff++;
}
}
ans = Math.min(ans,diff);
}
out.print(ans);
}
}
class QuickScanner {
BufferedReader in;
StringTokenizer token;
String delim;
public QuickScanner(InputStream inputStream)
{
this.in=new BufferedReader(new InputStreamReader(inputStream));
this.delim=" \n\t";
this.token=new StringTokenizer("",delim);
}
public boolean hasNext()
{
while(!token.hasMoreTokens())
{
try {
String s=in.readLine();
if(s==null) return false;
token=new StringTokenizer(s,delim);
} catch (IOException e) {
throw new InputMismatchException();
}
}
return true;
}
public String next()
{
hasNext();
return token.nextToken();
}
public int nextInt()
{
return Integer.parseInt(next());
}
}
|
[
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,
18,
13,
13,
41,
13,
18,
13,
13,
41,
13,
20,
41,
13,
20,
41,
13,
20,
4,
18,
13,
17,
13,
13,
4,
18,
13,
23,
13,
6,
13,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
18,
13,
13,
18,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
2,
13,
13,
18,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
13,
13,
23,
13,
23,
13,
23,
13,
6,
13,
41,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
4,
18,
13,
0,
13,
4,
18,
13,
0,
13,
4,
18,
13,
4,
18,
13,
8,
2,
13,
2,
13,
13,
17,
17,
23,
13,
23,
13,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
23,
13,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
38,
5,
13,
30,
29,
17,
30,
41,
13,
4,
18,
13,
14,
2,
13,
17,
30,
29,
17,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
16,
17
],
[
16,
18
],
[
0,
19
],
[
19,
20
],
[
19,
21
],
[
0,
22
],
[
259,
23
],
[
259,
24
],
[
24,
25
],
[
24,
26
],
[
26,
27
],
[
27,
28
],
[
27,
29
],
[
29,
30
],
[
29,
31
],
[
26,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
34,
36
],
[
26,
37
],
[
37,
38
],
[
37,
39
],
[
26,
40
],
[
40,
41
],
[
40,
42
],
[
26,
43
],
[
43,
44
],
[
43,
45
],
[
26,
46
],
[
46,
47
],
[
47,
48
],
[
46,
49
],
[
46,
50
],
[
46,
51
],
[
26,
52
],
[
52,
53
],
[
53,
54
],
[
24,
55
],
[
55,
56
],
[
259,
57
],
[
57,
58
],
[
57,
59
],
[
59,
60
],
[
59,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
65,
66
],
[
61,
67
],
[
67,
68
],
[
67,
69
],
[
69,
70
],
[
70,
71
],
[
61,
72
],
[
72,
73
],
[
72,
74
],
[
74,
75
],
[
75,
76
],
[
61,
77
],
[
77,
78
],
[
77,
79
],
[
79,
80
],
[
80,
81
],
[
61,
82
],
[
82,
83
],
[
82,
84
],
[
84,
85
],
[
84,
86
],
[
61,
87
],
[
87,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
87,
92
],
[
92,
93
],
[
92,
94
],
[
94,
95
],
[
95,
96
],
[
95,
97
],
[
94,
98
],
[
98,
99
],
[
98,
100
],
[
87,
101
],
[
101,
102
],
[
102,
103
],
[
87,
104
],
[
105,
105
],
[
105,
106
],
[
106,
107
],
[
106,
108
],
[
105,
109
],
[
109,
110
],
[
110,
111
],
[
111,
112
],
[
111,
113
],
[
109,
114
],
[
114,
115
],
[
114,
116
],
[
116,
117
],
[
116,
118
],
[
109,
119
],
[
119,
120
],
[
120,
121
],
[
109,
122
],
[
123,
123
],
[
123,
124
],
[
124,
125
],
[
125,
126
],
[
126,
127
],
[
126,
128
],
[
128,
129
],
[
128,
130
],
[
125,
131
],
[
131,
132
],
[
131,
133
],
[
124,
134
],
[
134,
135
],
[
105,
136
],
[
136,
137
],
[
136,
138
],
[
138,
139
],
[
139,
140
],
[
138,
141
],
[
138,
142
],
[
61,
143
],
[
143,
144
],
[
144,
145
],
[
143,
146
],
[
59,
147
],
[
147,
148
],
[
59,
149
],
[
149,
150
],
[
59,
151
],
[
151,
152
],
[
259,
153
],
[
153,
154
],
[
153,
155
],
[
155,
156
],
[
153,
157
],
[
157,
158
],
[
153,
159
],
[
159,
160
],
[
153,
161
],
[
161,
162
],
[
161,
163
],
[
163,
164
],
[
164,
165
],
[
164,
166
],
[
166,
167
],
[
167,
168
],
[
163,
169
],
[
169,
170
],
[
169,
171
],
[
171,
172
],
[
172,
173
],
[
163,
174
],
[
174,
175
],
[
174,
176
],
[
176,
177
],
[
177,
178
],
[
163,
179
],
[
179,
180
],
[
180,
181
],
[
179,
182
],
[
182,
183
],
[
183,
184
],
[
183,
185
],
[
185,
186
],
[
185,
187
],
[
182,
188
],
[
182,
189
],
[
161,
190
],
[
190,
191
],
[
161,
192
],
[
192,
193
],
[
161,
194
],
[
194,
195
],
[
259,
196
],
[
196,
197
],
[
196,
198
],
[
198,
199
],
[
196,
200
],
[
200,
201
],
[
196,
202
],
[
202,
203
],
[
202,
204
],
[
204,
205
],
[
205,
206
],
[
205,
207
],
[
202,
208
],
[
208,
209
],
[
196,
210
],
[
210,
211
],
[
210,
212
],
[
212,
213
],
[
213,
214
],
[
214,
215
],
[
215,
216
],
[
215,
217
],
[
214,
218
],
[
218,
219
],
[
219,
220
],
[
220,
221
],
[
213,
222
],
[
222,
223
],
[
223,
224
],
[
224,
225
],
[
224,
226
],
[
226,
227
],
[
227,
228
],
[
223,
229
],
[
229,
230
],
[
230,
231
],
[
230,
232
],
[
232,
233
],
[
233,
234
],
[
229,
235
],
[
235,
236
],
[
236,
237
],
[
236,
238
],
[
235,
239
],
[
239,
240
],
[
240,
241
],
[
229,
242
],
[
242,
243
],
[
242,
244
],
[
212,
245
],
[
245,
246
],
[
246,
247
],
[
247,
248
],
[
196,
249
],
[
249,
250
],
[
249,
251
],
[
251,
252
],
[
252,
253
],
[
253,
254
],
[
254,
255
],
[
253,
256
],
[
256,
257
],
[
0,
258
],
[
258,
259
],
[
258,
260
]
]
| [
"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.StringTokenizer;\n\npublic class Main\n{\n\tpublic static void main(String[] args)\n\t{\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tMyScanner in = new MyScanner(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tB solver = new B();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\t\n\tstatic class B\n\t{\n\t\tpublic void solve(int n, MyScanner in, PrintWriter out)\n\t\t{\n\t\t\tString S = in.next();\n\t\t\tString T = in.next();\n\n\t\t\tchar[] s = S.toCharArray();\n\t\t\tchar[] t = T.toCharArray();\n\t\t\t\n\t\t\tint min = t.length;\n\t\t\tfor( int i=0; i<=s.length - t.length; i++ )\n\t\t\t{\n\t\t\t\tint cnt = 0;\n\t\t\t\tfor( int j=0; j<t.length; j++ )\n\t\t\t\t{\n\t\t\t\t\tif( s[i+j] != t[j] ) cnt++;\n\t\t\t\t}\n\t\t\t\tmin = Math.min(min, cnt);\n\t\t\t}\n\t\t\tout.println(min);\n\t\t}\n\t}\n\t\n\tstatic class A\n\t{\n\t\tint D;\n\t\tint T;\n\t\tint S;\n\t\t\n\t\tpublic void solve(int testNumber, MyScanner in, PrintWriter out)\n\t\t{\n\t\t\tD = in.Int();\n\t\t\tT = in.Int();\n\t\t\tS = in.Int();\n\t\t\tout.println(D <= T*S ? \"Yes\" : \"No\");\n\t\t}\n\t}\n\t\n\tstatic class MyScanner\n\t{\n\t\tprivate BufferedReader in;\n\t\tprivate StringTokenizer st;\n\t\t\n\t\tpublic MyScanner(InputStream stream)\n\t\t{\n\t\t\tin = new BufferedReader(new InputStreamReader(stream));\n\t\t}\n\t\t\n\t\tpublic String next()\n\t\t{\n\t\t\twhile( st == null || !st.hasMoreTokens() )\n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tString rl = in.readLine();\n\t\t\t\t\tif( rl == null )\n\t\t\t\t\t{\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}\n\t\t\t\t\tst = new StringTokenizer(rl);\n\t\t\t\t}\n\t\t\t\tcatch( IOException e )\n\t\t\t\t{\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tpublic int Int()\n\t\t{\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t}\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStream;",
"InputStream",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.io.OutputStream;",
"OutputStream",
"java.io",
"import java.io.PrintWriter;",
"PrintWriter",
"java.io",
"import java.util.StringTokenizer;",
"StringTokenizer",
"java.util",
"public class Main\n{\n\tpublic static void main(String[] args)\n\t{\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tMyScanner in = new MyScanner(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tB solver = new B();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\t\n\tstatic class B\n\t{\n\t\tpublic void solve(int n, MyScanner in, PrintWriter out)\n\t\t{\n\t\t\tString S = in.next();\n\t\t\tString T = in.next();\n\n\t\t\tchar[] s = S.toCharArray();\n\t\t\tchar[] t = T.toCharArray();\n\t\t\t\n\t\t\tint min = t.length;\n\t\t\tfor( int i=0; i<=s.length - t.length; i++ )\n\t\t\t{\n\t\t\t\tint cnt = 0;\n\t\t\t\tfor( int j=0; j<t.length; j++ )\n\t\t\t\t{\n\t\t\t\t\tif( s[i+j] != t[j] ) cnt++;\n\t\t\t\t}\n\t\t\t\tmin = Math.min(min, cnt);\n\t\t\t}\n\t\t\tout.println(min);\n\t\t}\n\t}\n\t\n\tstatic class A\n\t{\n\t\tint D;\n\t\tint T;\n\t\tint S;\n\t\t\n\t\tpublic void solve(int testNumber, MyScanner in, PrintWriter out)\n\t\t{\n\t\t\tD = in.Int();\n\t\t\tT = in.Int();\n\t\t\tS = in.Int();\n\t\t\tout.println(D <= T*S ? \"Yes\" : \"No\");\n\t\t}\n\t}\n\t\n\tstatic class MyScanner\n\t{\n\t\tprivate BufferedReader in;\n\t\tprivate StringTokenizer st;\n\t\t\n\t\tpublic MyScanner(InputStream stream)\n\t\t{\n\t\t\tin = new BufferedReader(new InputStreamReader(stream));\n\t\t}\n\t\t\n\t\tpublic String next()\n\t\t{\n\t\t\twhile( st == null || !st.hasMoreTokens() )\n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tString rl = in.readLine();\n\t\t\t\t\tif( rl == null )\n\t\t\t\t\t{\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}\n\t\t\t\t\tst = new StringTokenizer(rl);\n\t\t\t\t}\n\t\t\t\tcatch( IOException e )\n\t\t\t\t{\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tpublic int Int()\n\t\t{\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t}\n}",
"Main",
"public static void main(String[] args)\n\t{\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tMyScanner in = new MyScanner(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tB solver = new B();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}",
"main",
"{\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tMyScanner in = new MyScanner(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tB solver = new B();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}",
"InputStream inputStream = System.in;",
"inputStream",
"System.in",
"System",
"System.in",
"OutputStream outputStream = System.out;",
"outputStream",
"System.out",
"System",
"System.out",
"MyScanner in = new MyScanner(inputStream);",
"in",
"new MyScanner(inputStream)",
"PrintWriter out = new PrintWriter(outputStream);",
"out",
"new PrintWriter(outputStream)",
"B solver = new B();",
"solver",
"new B()",
"solver.solve(1, in, out)",
"solver.solve",
"solver",
"1",
"in",
"out",
"out.close()",
"out.close",
"out",
"String[] args",
"args",
"static class B\n\t{\n\t\tpublic void solve(int n, MyScanner in, PrintWriter out)\n\t\t{\n\t\t\tString S = in.next();\n\t\t\tString T = in.next();\n\n\t\t\tchar[] s = S.toCharArray();\n\t\t\tchar[] t = T.toCharArray();\n\t\t\t\n\t\t\tint min = t.length;\n\t\t\tfor( int i=0; i<=s.length - t.length; i++ )\n\t\t\t{\n\t\t\t\tint cnt = 0;\n\t\t\t\tfor( int j=0; j<t.length; j++ )\n\t\t\t\t{\n\t\t\t\t\tif( s[i+j] != t[j] ) cnt++;\n\t\t\t\t}\n\t\t\t\tmin = Math.min(min, cnt);\n\t\t\t}\n\t\t\tout.println(min);\n\t\t}\n\t}",
"B",
"public void solve(int n, MyScanner in, PrintWriter out)\n\t\t{\n\t\t\tString S = in.next();\n\t\t\tString T = in.next();\n\n\t\t\tchar[] s = S.toCharArray();\n\t\t\tchar[] t = T.toCharArray();\n\t\t\t\n\t\t\tint min = t.length;\n\t\t\tfor( int i=0; i<=s.length - t.length; i++ )\n\t\t\t{\n\t\t\t\tint cnt = 0;\n\t\t\t\tfor( int j=0; j<t.length; j++ )\n\t\t\t\t{\n\t\t\t\t\tif( s[i+j] != t[j] ) cnt++;\n\t\t\t\t}\n\t\t\t\tmin = Math.min(min, cnt);\n\t\t\t}\n\t\t\tout.println(min);\n\t\t}",
"solve",
"{\n\t\t\tString S = in.next();\n\t\t\tString T = in.next();\n\n\t\t\tchar[] s = S.toCharArray();\n\t\t\tchar[] t = T.toCharArray();\n\t\t\t\n\t\t\tint min = t.length;\n\t\t\tfor( int i=0; i<=s.length - t.length; i++ )\n\t\t\t{\n\t\t\t\tint cnt = 0;\n\t\t\t\tfor( int j=0; j<t.length; j++ )\n\t\t\t\t{\n\t\t\t\t\tif( s[i+j] != t[j] ) cnt++;\n\t\t\t\t}\n\t\t\t\tmin = Math.min(min, cnt);\n\t\t\t}\n\t\t\tout.println(min);\n\t\t}",
"String S = in.next();",
"S",
"in.next()",
"in.next",
"in",
"String T = in.next();",
"T",
"in.next()",
"in.next",
"in",
"char[] s = S.toCharArray();",
"s",
"S.toCharArray()",
"S.toCharArray",
"S",
"char[] t = T.toCharArray();",
"t",
"T.toCharArray()",
"T.toCharArray",
"T",
"int min = t.length;",
"min",
"t.length",
"t",
"t.length",
"for( int i=0; i<=s.length - t.length; i++ )\n\t\t\t{\n\t\t\t\tint cnt = 0;\n\t\t\t\tfor( int j=0; j<t.length; j++ )\n\t\t\t\t{\n\t\t\t\t\tif( s[i+j] != t[j] ) cnt++;\n\t\t\t\t}\n\t\t\t\tmin = Math.min(min, cnt);\n\t\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<=s.length - t.length",
"i",
"s.length - t.length",
"s.length",
"s",
"s.length",
"t.length",
"t",
"t.length",
"i++",
"i++",
"i",
"{\n\t\t\t\tint cnt = 0;\n\t\t\t\tfor( int j=0; j<t.length; j++ )\n\t\t\t\t{\n\t\t\t\t\tif( s[i+j] != t[j] ) cnt++;\n\t\t\t\t}\n\t\t\t\tmin = Math.min(min, cnt);\n\t\t\t}",
"{\n\t\t\t\tint cnt = 0;\n\t\t\t\tfor( int j=0; j<t.length; j++ )\n\t\t\t\t{\n\t\t\t\t\tif( s[i+j] != t[j] ) cnt++;\n\t\t\t\t}\n\t\t\t\tmin = Math.min(min, cnt);\n\t\t\t}",
"int cnt = 0;",
"cnt",
"0",
"for( int j=0; j<t.length; j++ )\n\t\t\t\t{\n\t\t\t\t\tif( s[i+j] != t[j] ) cnt++;\n\t\t\t\t}",
"int j=0;",
"int j=0;",
"j",
"0",
"j<t.length",
"j",
"t.length",
"t",
"t.length",
"j++",
"j++",
"j",
"{\n\t\t\t\t\tif( s[i+j] != t[j] ) cnt++;\n\t\t\t\t}",
"{\n\t\t\t\t\tif( s[i+j] != t[j] ) cnt++;\n\t\t\t\t}",
"if( s[i+j] != t[j] ) cnt++;",
"s[i+j] != t[j]",
"s[i+j]",
"s",
"i+j",
"i",
"j",
"t[j]",
"t",
"j",
"cnt++",
"cnt",
"min = Math.min(min, cnt)",
"min",
"Math.min(min, cnt)",
"Math.min",
"Math",
"min",
"cnt",
"out.println(min)",
"out.println",
"out",
"min",
"int n",
"n",
"MyScanner in",
"in",
"PrintWriter out",
"out",
"static class A\n\t{\n\t\tint D;\n\t\tint T;\n\t\tint S;\n\t\t\n\t\tpublic void solve(int testNumber, MyScanner in, PrintWriter out)\n\t\t{\n\t\t\tD = in.Int();\n\t\t\tT = in.Int();\n\t\t\tS = in.Int();\n\t\t\tout.println(D <= T*S ? \"Yes\" : \"No\");\n\t\t}\n\t}",
"A",
"int D;",
"D",
"int T;",
"T",
"int S;",
"S",
"public void solve(int testNumber, MyScanner in, PrintWriter out)\n\t\t{\n\t\t\tD = in.Int();\n\t\t\tT = in.Int();\n\t\t\tS = in.Int();\n\t\t\tout.println(D <= T*S ? \"Yes\" : \"No\");\n\t\t}",
"solve",
"{\n\t\t\tD = in.Int();\n\t\t\tT = in.Int();\n\t\t\tS = in.Int();\n\t\t\tout.println(D <= T*S ? \"Yes\" : \"No\");\n\t\t}",
"D = in.Int()",
"D",
"in.Int()",
"in.Int",
"in",
"T = in.Int()",
"T",
"in.Int()",
"in.Int",
"in",
"S = in.Int()",
"S",
"in.Int()",
"in.Int",
"in",
"out.println(D <= T*S ? \"Yes\" : \"No\")",
"out.println",
"out",
"D <= T*S ? \"Yes\" : \"No\"",
"D <= T*S",
"D",
"T*S",
"T",
"S",
"\"Yes\"",
"\"No\"",
"int testNumber",
"testNumber",
"MyScanner in",
"in",
"PrintWriter out",
"out",
"static class MyScanner\n\t{\n\t\tprivate BufferedReader in;\n\t\tprivate StringTokenizer st;\n\t\t\n\t\tpublic MyScanner(InputStream stream)\n\t\t{\n\t\t\tin = new BufferedReader(new InputStreamReader(stream));\n\t\t}\n\t\t\n\t\tpublic String next()\n\t\t{\n\t\t\twhile( st == null || !st.hasMoreTokens() )\n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tString rl = in.readLine();\n\t\t\t\t\tif( rl == null )\n\t\t\t\t\t{\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}\n\t\t\t\t\tst = new StringTokenizer(rl);\n\t\t\t\t}\n\t\t\t\tcatch( IOException e )\n\t\t\t\t{\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tpublic int Int()\n\t\t{\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t}",
"MyScanner",
"private BufferedReader in;",
"in",
"private StringTokenizer st;",
"st",
"public MyScanner(InputStream stream)\n\t\t{\n\t\t\tin = new BufferedReader(new InputStreamReader(stream));\n\t\t}",
"MyScanner",
"{\n\t\t\tin = new BufferedReader(new InputStreamReader(stream));\n\t\t}",
"in = new BufferedReader(new InputStreamReader(stream))",
"in",
"new BufferedReader(new InputStreamReader(stream))",
"InputStream stream",
"stream",
"public String next()\n\t\t{\n\t\t\twhile( st == null || !st.hasMoreTokens() )\n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tString rl = in.readLine();\n\t\t\t\t\tif( rl == null )\n\t\t\t\t\t{\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}\n\t\t\t\t\tst = new StringTokenizer(rl);\n\t\t\t\t}\n\t\t\t\tcatch( IOException e )\n\t\t\t\t{\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}",
"next",
"{\n\t\t\twhile( st == null || !st.hasMoreTokens() )\n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tString rl = in.readLine();\n\t\t\t\t\tif( rl == null )\n\t\t\t\t\t{\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}\n\t\t\t\t\tst = new StringTokenizer(rl);\n\t\t\t\t}\n\t\t\t\tcatch( IOException e )\n\t\t\t\t{\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}",
"while( st == null || !st.hasMoreTokens() )\n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tString rl = in.readLine();\n\t\t\t\t\tif( rl == null )\n\t\t\t\t\t{\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}\n\t\t\t\t\tst = new StringTokenizer(rl);\n\t\t\t\t}\n\t\t\t\tcatch( IOException e )\n\t\t\t\t{\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\t\t\t}",
"st == null || !st.hasMoreTokens()",
"st == null",
"st",
"null",
"!st.hasMoreTokens()",
"st.hasMoreTokens()",
"st.hasMoreTokens",
"st",
"{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tString rl = in.readLine();\n\t\t\t\t\tif( rl == null )\n\t\t\t\t\t{\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}\n\t\t\t\t\tst = new StringTokenizer(rl);\n\t\t\t\t}\n\t\t\t\tcatch( IOException e )\n\t\t\t\t{\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\t\t\t}",
"try\n\t\t\t\t{\n\t\t\t\t\tString rl = in.readLine();\n\t\t\t\t\tif( rl == null )\n\t\t\t\t\t{\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}\n\t\t\t\t\tst = new StringTokenizer(rl);\n\t\t\t\t}\n\t\t\t\tcatch( IOException e )\n\t\t\t\t{\n\t\t\t\t\treturn null;\n\t\t\t\t}",
"catch( IOException e )\n\t\t\t\t{\n\t\t\t\t\treturn null;\n\t\t\t\t}",
"IOException e",
"{\n\t\t\t\t\treturn null;\n\t\t\t\t}",
"return null;",
"null",
"{\n\t\t\t\t\tString rl = in.readLine();\n\t\t\t\t\tif( rl == null )\n\t\t\t\t\t{\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}\n\t\t\t\t\tst = new StringTokenizer(rl);\n\t\t\t\t}",
"String rl = in.readLine();",
"rl",
"in.readLine()",
"in.readLine",
"in",
"if( rl == null )\n\t\t\t\t\t{\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}",
"rl == null",
"rl",
"null",
"{\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}",
"return null;",
"null",
"st = new StringTokenizer(rl)",
"st",
"new StringTokenizer(rl)",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"public int Int()\n\t\t{\n\t\t\treturn Integer.parseInt(next());\n\t\t}",
"Int",
"{\n\t\t\treturn Integer.parseInt(next());\n\t\t}",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"public class Main\n{\n\tpublic static void main(String[] args)\n\t{\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tMyScanner in = new MyScanner(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tB solver = new B();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\t\n\tstatic class B\n\t{\n\t\tpublic void solve(int n, MyScanner in, PrintWriter out)\n\t\t{\n\t\t\tString S = in.next();\n\t\t\tString T = in.next();\n\n\t\t\tchar[] s = S.toCharArray();\n\t\t\tchar[] t = T.toCharArray();\n\t\t\t\n\t\t\tint min = t.length;\n\t\t\tfor( int i=0; i<=s.length - t.length; i++ )\n\t\t\t{\n\t\t\t\tint cnt = 0;\n\t\t\t\tfor( int j=0; j<t.length; j++ )\n\t\t\t\t{\n\t\t\t\t\tif( s[i+j] != t[j] ) cnt++;\n\t\t\t\t}\n\t\t\t\tmin = Math.min(min, cnt);\n\t\t\t}\n\t\t\tout.println(min);\n\t\t}\n\t}\n\t\n\tstatic class A\n\t{\n\t\tint D;\n\t\tint T;\n\t\tint S;\n\t\t\n\t\tpublic void solve(int testNumber, MyScanner in, PrintWriter out)\n\t\t{\n\t\t\tD = in.Int();\n\t\t\tT = in.Int();\n\t\t\tS = in.Int();\n\t\t\tout.println(D <= T*S ? \"Yes\" : \"No\");\n\t\t}\n\t}\n\t\n\tstatic class MyScanner\n\t{\n\t\tprivate BufferedReader in;\n\t\tprivate StringTokenizer st;\n\t\t\n\t\tpublic MyScanner(InputStream stream)\n\t\t{\n\t\t\tin = new BufferedReader(new InputStreamReader(stream));\n\t\t}\n\t\t\n\t\tpublic String next()\n\t\t{\n\t\t\twhile( st == null || !st.hasMoreTokens() )\n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tString rl = in.readLine();\n\t\t\t\t\tif( rl == null )\n\t\t\t\t\t{\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}\n\t\t\t\t\tst = new StringTokenizer(rl);\n\t\t\t\t}\n\t\t\t\tcatch( IOException e )\n\t\t\t\t{\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tpublic int Int()\n\t\t{\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t}\n}",
"public class Main\n{\n\tpublic static void main(String[] args)\n\t{\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tMyScanner in = new MyScanner(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tB solver = new B();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\t\n\tstatic class B\n\t{\n\t\tpublic void solve(int n, MyScanner in, PrintWriter out)\n\t\t{\n\t\t\tString S = in.next();\n\t\t\tString T = in.next();\n\n\t\t\tchar[] s = S.toCharArray();\n\t\t\tchar[] t = T.toCharArray();\n\t\t\t\n\t\t\tint min = t.length;\n\t\t\tfor( int i=0; i<=s.length - t.length; i++ )\n\t\t\t{\n\t\t\t\tint cnt = 0;\n\t\t\t\tfor( int j=0; j<t.length; j++ )\n\t\t\t\t{\n\t\t\t\t\tif( s[i+j] != t[j] ) cnt++;\n\t\t\t\t}\n\t\t\t\tmin = Math.min(min, cnt);\n\t\t\t}\n\t\t\tout.println(min);\n\t\t}\n\t}\n\t\n\tstatic class A\n\t{\n\t\tint D;\n\t\tint T;\n\t\tint S;\n\t\t\n\t\tpublic void solve(int testNumber, MyScanner in, PrintWriter out)\n\t\t{\n\t\t\tD = in.Int();\n\t\t\tT = in.Int();\n\t\t\tS = in.Int();\n\t\t\tout.println(D <= T*S ? \"Yes\" : \"No\");\n\t\t}\n\t}\n\t\n\tstatic class MyScanner\n\t{\n\t\tprivate BufferedReader in;\n\t\tprivate StringTokenizer st;\n\t\t\n\t\tpublic MyScanner(InputStream stream)\n\t\t{\n\t\t\tin = new BufferedReader(new InputStreamReader(stream));\n\t\t}\n\t\t\n\t\tpublic String next()\n\t\t{\n\t\t\twhile( st == null || !st.hasMoreTokens() )\n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tString rl = in.readLine();\n\t\t\t\t\tif( rl == null )\n\t\t\t\t\t{\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}\n\t\t\t\t\tst = new StringTokenizer(rl);\n\t\t\t\t}\n\t\t\t\tcatch( IOException e )\n\t\t\t\t{\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tpublic int Int()\n\t\t{\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t}\n}",
"Main"
]
| import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main
{
public static void main(String[] args)
{
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
MyScanner in = new MyScanner(inputStream);
PrintWriter out = new PrintWriter(outputStream);
B solver = new B();
solver.solve(1, in, out);
out.close();
}
static class B
{
public void solve(int n, MyScanner in, PrintWriter out)
{
String S = in.next();
String T = in.next();
char[] s = S.toCharArray();
char[] t = T.toCharArray();
int min = t.length;
for( int i=0; i<=s.length - t.length; i++ )
{
int cnt = 0;
for( int j=0; j<t.length; j++ )
{
if( s[i+j] != t[j] ) cnt++;
}
min = Math.min(min, cnt);
}
out.println(min);
}
}
static class A
{
int D;
int T;
int S;
public void solve(int testNumber, MyScanner in, PrintWriter out)
{
D = in.Int();
T = in.Int();
S = in.Int();
out.println(D <= T*S ? "Yes" : "No");
}
}
static class MyScanner
{
private BufferedReader in;
private StringTokenizer st;
public MyScanner(InputStream stream)
{
in = new BufferedReader(new InputStreamReader(stream));
}
public String next()
{
while( st == null || !st.hasMoreTokens() )
{
try
{
String rl = in.readLine();
if( rl == null )
{
return null;
}
st = new StringTokenizer(rl);
}
catch( IOException e )
{
return null;
}
}
return st.nextToken();
}
public int Int()
{
return Integer.parseInt(next());
}
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
4,
18,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
18,
13,
13,
18,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
2,
13,
13,
18,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
13,
13,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
17,
42,
2,
40,
13,
17,
30,
4,
13,
13,
23,
13,
12,
13,
30,
4,
18,
18,
13,
13,
12,
13,
30,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
4,
18,
18,
13,
13,
13,
23,
13,
12,
13,
30,
4,
18,
18,
13,
13,
13,
23,
13,
6,
13,
41,
13,
20,
41,
13,
20,
12,
13,
30,
42,
40,
4,
18,
13,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
258,
14
],
[
258,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
22,
23
],
[
23,
24
],
[
17,
25
],
[
25,
26
],
[
25,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
30,
31
],
[
17,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
34,
36
],
[
17,
37
],
[
37,
38
],
[
38,
39
],
[
39,
40
],
[
39,
41
],
[
37,
42
],
[
42,
43
],
[
42,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
44,
48
],
[
48,
49
],
[
48,
50
],
[
37,
51
],
[
51,
52
],
[
52,
53
],
[
37,
54
],
[
55,
55
],
[
55,
56
],
[
56,
57
],
[
56,
58
],
[
55,
59
],
[
59,
60
],
[
60,
61
],
[
61,
62
],
[
61,
63
],
[
59,
64
],
[
64,
65
],
[
64,
66
],
[
66,
67
],
[
66,
68
],
[
59,
69
],
[
69,
70
],
[
70,
71
],
[
59,
72
],
[
73,
73
],
[
73,
74
],
[
74,
75
],
[
75,
76
],
[
76,
77
],
[
76,
78
],
[
78,
79
],
[
78,
80
],
[
75,
81
],
[
81,
82
],
[
81,
83
],
[
74,
84
],
[
84,
85
],
[
55,
86
],
[
86,
87
],
[
86,
88
],
[
88,
89
],
[
89,
90
],
[
88,
91
],
[
88,
92
],
[
17,
93
],
[
93,
94
],
[
93,
95
],
[
15,
96
],
[
96,
97
],
[
258,
98
],
[
98,
99
],
[
98,
100
],
[
100,
101
],
[
101,
102
],
[
101,
103
],
[
100,
104
],
[
104,
105
],
[
104,
106
],
[
100,
107
],
[
107,
108
],
[
108,
109
],
[
109,
110
],
[
108,
111
],
[
107,
112
],
[
112,
113
],
[
113,
114
],
[
113,
115
],
[
98,
116
],
[
116,
117
],
[
258,
118
],
[
118,
119
],
[
118,
120
],
[
120,
121
],
[
121,
122
],
[
122,
123
],
[
123,
124
],
[
123,
125
],
[
258,
126
],
[
126,
127
],
[
126,
128
],
[
128,
129
],
[
129,
130
],
[
130,
131
],
[
131,
132
],
[
131,
133
],
[
129,
134
],
[
126,
135
],
[
135,
136
],
[
258,
137
],
[
137,
138
],
[
137,
139
],
[
139,
140
],
[
140,
141
],
[
141,
142
],
[
142,
143
],
[
142,
144
],
[
140,
145
],
[
137,
146
],
[
146,
147
],
[
258,
148
],
[
148,
149
],
[
148,
150
],
[
150,
151
],
[
151,
152
],
[
152,
153
],
[
153,
154
],
[
153,
155
],
[
151,
156
],
[
148,
157
],
[
157,
158
],
[
258,
159
],
[
159,
160
],
[
159,
161
],
[
161,
162
],
[
162,
163
],
[
163,
164
],
[
164,
165
],
[
164,
166
],
[
162,
167
],
[
159,
168
],
[
168,
169
],
[
258,
170
],
[
170,
171
],
[
170,
172
],
[
172,
173
],
[
172,
174
],
[
170,
175
],
[
175,
176
],
[
175,
177
],
[
170,
178
],
[
178,
179
],
[
178,
180
],
[
180,
181
],
[
181,
182
],
[
182,
183
],
[
183,
184
],
[
184,
185
],
[
181,
186
],
[
186,
187
],
[
187,
188
],
[
187,
189
],
[
189,
190
],
[
190,
191
],
[
191,
192
],
[
186,
193
],
[
193,
194
],
[
194,
195
],
[
194,
196
],
[
180,
197
],
[
197,
198
],
[
198,
199
],
[
199,
200
],
[
170,
201
],
[
201,
202
],
[
201,
203
],
[
203,
204
],
[
204,
205
],
[
204,
206
],
[
203,
208
],
[
208,
209
],
[
209,
210
],
[
210,
211
],
[
210,
212
],
[
208,
213
],
[
213,
214
],
[
213,
215
],
[
208,
216
],
[
216,
217
],
[
217,
218
],
[
208,
219
],
[
219,
220
],
[
220,
221
],
[
221,
222
],
[
221,
223
],
[
220,
224
],
[
224,
225
],
[
203,
226
],
[
226,
227
],
[
201,
228
],
[
228,
229
],
[
170,
230
],
[
230,
231
],
[
230,
232
],
[
232,
233
],
[
233,
234
],
[
234,
235
],
[
235,
236
],
[
234,
237
],
[
237,
238
],
[
170,
239
],
[
239,
240
],
[
239,
241
],
[
241,
242
],
[
242,
243
],
[
243,
244
],
[
244,
245
],
[
243,
246
],
[
246,
247
],
[
170,
248
],
[
248,
249
],
[
248,
250
],
[
250,
251
],
[
251,
252
],
[
252,
253
],
[
253,
254
],
[
252,
255
],
[
255,
256
],
[
0,
257
],
[
257,
258
],
[
257,
259
]
]
| [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.*;\n\npublic class Main\n{\n\tprivate static void solve(FastScanner fr) {\n\t\tchar[] s = fr.next().toCharArray();\n\t\tchar[] t = fr.next().toCharArray();\n\n\t\tint min = t.length;\n\t\tfor(int i=0; i<=s.length - t.length; i++) {\n\t\t\tint lmin = 0;\n\t\t\tfor(int j=0; j<t.length; j++){\n\t\t\t\tif(s[i+j]!=t[j])\tlmin++;\n\t\t\t}\n\t\t\tmin = Math.min(min, lmin);\n\t\t}\n\t\tsout(min);\n\t}\n public static void main(String[] args) {\n\t\tFastScanner fs = new FastScanner();\n\t\tint n = 1;\n\t\t// int n = fs.nextInt();\n\t\twhile (n-- > 0)\t{\n\t\t\tsolve(fs);\n }\n }\n\n private static void sout() { System.out.println(); }\n private static void sout(String s) { System.out.println(s); }\n private static void sout(int s) { System.out.println(s); }\n private static void sout(long s) { System.out.println(s); }\n private static void sout(double s) { System.out.println(s); }\n \n\tstatic class FastScanner {\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st=new StringTokenizer(\"\");\n\t\tString next() {\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry { st=new StringTokenizer(br.readLine()); } catch (IOException e) { e.printStackTrace(); }\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tint[] readArray(int n) {\n\t\t\tint[] a=new int[n];\n\t\t\tfor (int i=0; i<n; i++) a[i]=nextInt();\n\t\t\treturn a;\n\t\t}\n\t\tint nextInt() {\treturn Integer.parseInt(next()); }\n\t\tlong nextLong() { return Long.parseLong(next()); }\n\t\tdouble nextDouble() { return Double.parseDouble(next()); }\n\t}\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.util.*;",
"util.*",
"java",
"public class Main\n{\n\tprivate static void solve(FastScanner fr) {\n\t\tchar[] s = fr.next().toCharArray();\n\t\tchar[] t = fr.next().toCharArray();\n\n\t\tint min = t.length;\n\t\tfor(int i=0; i<=s.length - t.length; i++) {\n\t\t\tint lmin = 0;\n\t\t\tfor(int j=0; j<t.length; j++){\n\t\t\t\tif(s[i+j]!=t[j])\tlmin++;\n\t\t\t}\n\t\t\tmin = Math.min(min, lmin);\n\t\t}\n\t\tsout(min);\n\t}\n public static void main(String[] args) {\n\t\tFastScanner fs = new FastScanner();\n\t\tint n = 1;\n\t\t// int n = fs.nextInt();\n\t\twhile (n-- > 0)\t{\n\t\t\tsolve(fs);\n }\n }\n\n private static void sout() { System.out.println(); }\n private static void sout(String s) { System.out.println(s); }\n private static void sout(int s) { System.out.println(s); }\n private static void sout(long s) { System.out.println(s); }\n private static void sout(double s) { System.out.println(s); }\n \n\tstatic class FastScanner {\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st=new StringTokenizer(\"\");\n\t\tString next() {\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry { st=new StringTokenizer(br.readLine()); } catch (IOException e) { e.printStackTrace(); }\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tint[] readArray(int n) {\n\t\t\tint[] a=new int[n];\n\t\t\tfor (int i=0; i<n; i++) a[i]=nextInt();\n\t\t\treturn a;\n\t\t}\n\t\tint nextInt() {\treturn Integer.parseInt(next()); }\n\t\tlong nextLong() { return Long.parseLong(next()); }\n\t\tdouble nextDouble() { return Double.parseDouble(next()); }\n\t}\n}",
"Main",
"private static void solve(FastScanner fr) {\n\t\tchar[] s = fr.next().toCharArray();\n\t\tchar[] t = fr.next().toCharArray();\n\n\t\tint min = t.length;\n\t\tfor(int i=0; i<=s.length - t.length; i++) {\n\t\t\tint lmin = 0;\n\t\t\tfor(int j=0; j<t.length; j++){\n\t\t\t\tif(s[i+j]!=t[j])\tlmin++;\n\t\t\t}\n\t\t\tmin = Math.min(min, lmin);\n\t\t}\n\t\tsout(min);\n\t}",
"solve",
"{\n\t\tchar[] s = fr.next().toCharArray();\n\t\tchar[] t = fr.next().toCharArray();\n\n\t\tint min = t.length;\n\t\tfor(int i=0; i<=s.length - t.length; i++) {\n\t\t\tint lmin = 0;\n\t\t\tfor(int j=0; j<t.length; j++){\n\t\t\t\tif(s[i+j]!=t[j])\tlmin++;\n\t\t\t}\n\t\t\tmin = Math.min(min, lmin);\n\t\t}\n\t\tsout(min);\n\t}",
"char[] s = fr.next().toCharArray();",
"s",
"fr.next().toCharArray()",
"fr.next().toCharArray",
"fr.next()",
"fr.next",
"fr",
"char[] t = fr.next().toCharArray();",
"t",
"fr.next().toCharArray()",
"fr.next().toCharArray",
"fr.next()",
"fr.next",
"fr",
"int min = t.length;",
"min",
"t.length",
"t",
"t.length",
"for(int i=0; i<=s.length - t.length; i++) {\n\t\t\tint lmin = 0;\n\t\t\tfor(int j=0; j<t.length; j++){\n\t\t\t\tif(s[i+j]!=t[j])\tlmin++;\n\t\t\t}\n\t\t\tmin = Math.min(min, lmin);\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<=s.length - t.length",
"i",
"s.length - t.length",
"s.length",
"s",
"s.length",
"t.length",
"t",
"t.length",
"i++",
"i++",
"i",
"{\n\t\t\tint lmin = 0;\n\t\t\tfor(int j=0; j<t.length; j++){\n\t\t\t\tif(s[i+j]!=t[j])\tlmin++;\n\t\t\t}\n\t\t\tmin = Math.min(min, lmin);\n\t\t}",
"{\n\t\t\tint lmin = 0;\n\t\t\tfor(int j=0; j<t.length; j++){\n\t\t\t\tif(s[i+j]!=t[j])\tlmin++;\n\t\t\t}\n\t\t\tmin = Math.min(min, lmin);\n\t\t}",
"int lmin = 0;",
"lmin",
"0",
"for(int j=0; j<t.length; j++){\n\t\t\t\tif(s[i+j]!=t[j])\tlmin++;\n\t\t\t}",
"int j=0;",
"int j=0;",
"j",
"0",
"j<t.length",
"j",
"t.length",
"t",
"t.length",
"j++",
"j++",
"j",
"{\n\t\t\t\tif(s[i+j]!=t[j])\tlmin++;\n\t\t\t}",
"{\n\t\t\t\tif(s[i+j]!=t[j])\tlmin++;\n\t\t\t}",
"if(s[i+j]!=t[j])\tlmin++;",
"s[i+j]!=t[j]",
"s[i+j]",
"s",
"i+j",
"i",
"j",
"t[j]",
"t",
"j",
"lmin++",
"lmin",
"min = Math.min(min, lmin)",
"min",
"Math.min(min, lmin)",
"Math.min",
"Math",
"min",
"lmin",
"sout(min)",
"sout",
"min",
"FastScanner fr",
"fr",
"public static void main(String[] args) {\n\t\tFastScanner fs = new FastScanner();\n\t\tint n = 1;\n\t\t// int n = fs.nextInt();\n\t\twhile (n-- > 0)\t{\n\t\t\tsolve(fs);\n }\n }",
"main",
"{\n\t\tFastScanner fs = new FastScanner();\n\t\tint n = 1;\n\t\t// int n = fs.nextInt();\n\t\twhile (n-- > 0)\t{\n\t\t\tsolve(fs);\n }\n }",
"FastScanner fs = new FastScanner();",
"fs",
"new FastScanner()",
"int n = 1;",
"n",
"1",
"while (n-- > 0)\t{\n\t\t\tsolve(fs);\n }",
"n-- > 0",
"n--",
"n",
"0",
"{\n\t\t\tsolve(fs);\n }",
"solve(fs)",
"solve",
"fs",
"String[] args",
"args",
"private static void sout() { System.out.println(); }",
"sout",
"{ System.out.println(); }",
"System.out.println()",
"System.out.println",
"System.out",
"System",
"System.out",
"private static void sout(String s) { System.out.println(s); }",
"sout",
"{ System.out.println(s); }",
"System.out.println(s)",
"System.out.println",
"System.out",
"System",
"System.out",
"s",
"String s",
"s",
"private static void sout(int s) { System.out.println(s); }",
"sout",
"{ System.out.println(s); }",
"System.out.println(s)",
"System.out.println",
"System.out",
"System",
"System.out",
"s",
"int s",
"s",
"private static void sout(long s) { System.out.println(s); }",
"sout",
"{ System.out.println(s); }",
"System.out.println(s)",
"System.out.println",
"System.out",
"System",
"System.out",
"s",
"long s",
"s",
"private static void sout(double s) { System.out.println(s); }",
"sout",
"{ System.out.println(s); }",
"System.out.println(s)",
"System.out.println",
"System.out",
"System",
"System.out",
"s",
"double s",
"s",
"static class FastScanner {\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st=new StringTokenizer(\"\");\n\t\tString next() {\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry { st=new StringTokenizer(br.readLine()); } catch (IOException e) { e.printStackTrace(); }\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tint[] readArray(int n) {\n\t\t\tint[] a=new int[n];\n\t\t\tfor (int i=0; i<n; i++) a[i]=nextInt();\n\t\t\treturn a;\n\t\t}\n\t\tint nextInt() {\treturn Integer.parseInt(next()); }\n\t\tlong nextLong() { return Long.parseLong(next()); }\n\t\tdouble nextDouble() { return Double.parseDouble(next()); }\n\t}",
"FastScanner",
"BufferedReader br=new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"StringTokenizer st=new StringTokenizer(\"\");",
"st",
"new StringTokenizer(\"\")",
"String next() {\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry { st=new StringTokenizer(br.readLine()); } catch (IOException e) { e.printStackTrace(); }\n\t\t\treturn st.nextToken();\n\t\t}",
"next",
"{\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry { st=new StringTokenizer(br.readLine()); } catch (IOException e) { e.printStackTrace(); }\n\t\t\treturn st.nextToken();\n\t\t}",
"while (!st.hasMoreTokens())\n\t\t\t\ttry { st=new StringTokenizer(br.readLine()); } catch (IOException e) { e.printStackTrace(); }",
"!st.hasMoreTokens()",
"st.hasMoreTokens()",
"st.hasMoreTokens",
"st",
"try { st=new StringTokenizer(br.readLine()); } catch (IOException e) { e.printStackTrace(); }",
"catch (IOException e) { e.printStackTrace(); }",
"IOException e",
"{ e.printStackTrace(); }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{ st=new StringTokenizer(br.readLine()); }",
"st=new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"int[] readArray(int n) {\n\t\t\tint[] a=new int[n];\n\t\t\tfor (int i=0; i<n; i++) a[i]=nextInt();\n\t\t\treturn a;\n\t\t}",
"readArray",
"{\n\t\t\tint[] a=new int[n];\n\t\t\tfor (int i=0; i<n; i++) a[i]=nextInt();\n\t\t\treturn a;\n\t\t}",
"int[] a=new int[n];",
"a",
"new int[n]",
"n",
"for (int i=0; i<n; i++) a[i]=nextInt();",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"a[i]=nextInt();",
"a[i]=nextInt()",
"a[i]",
"a",
"i",
"nextInt()",
"nextInt",
"return a;",
"a",
"int n",
"n",
"int nextInt() {\treturn Integer.parseInt(next()); }",
"nextInt",
"{\treturn Integer.parseInt(next()); }",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"long nextLong() { return Long.parseLong(next()); }",
"nextLong",
"{ return Long.parseLong(next()); }",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"double nextDouble() { return Double.parseDouble(next()); }",
"nextDouble",
"{ return Double.parseDouble(next()); }",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"public class Main\n{\n\tprivate static void solve(FastScanner fr) {\n\t\tchar[] s = fr.next().toCharArray();\n\t\tchar[] t = fr.next().toCharArray();\n\n\t\tint min = t.length;\n\t\tfor(int i=0; i<=s.length - t.length; i++) {\n\t\t\tint lmin = 0;\n\t\t\tfor(int j=0; j<t.length; j++){\n\t\t\t\tif(s[i+j]!=t[j])\tlmin++;\n\t\t\t}\n\t\t\tmin = Math.min(min, lmin);\n\t\t}\n\t\tsout(min);\n\t}\n public static void main(String[] args) {\n\t\tFastScanner fs = new FastScanner();\n\t\tint n = 1;\n\t\t// int n = fs.nextInt();\n\t\twhile (n-- > 0)\t{\n\t\t\tsolve(fs);\n }\n }\n\n private static void sout() { System.out.println(); }\n private static void sout(String s) { System.out.println(s); }\n private static void sout(int s) { System.out.println(s); }\n private static void sout(long s) { System.out.println(s); }\n private static void sout(double s) { System.out.println(s); }\n \n\tstatic class FastScanner {\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st=new StringTokenizer(\"\");\n\t\tString next() {\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry { st=new StringTokenizer(br.readLine()); } catch (IOException e) { e.printStackTrace(); }\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tint[] readArray(int n) {\n\t\t\tint[] a=new int[n];\n\t\t\tfor (int i=0; i<n; i++) a[i]=nextInt();\n\t\t\treturn a;\n\t\t}\n\t\tint nextInt() {\treturn Integer.parseInt(next()); }\n\t\tlong nextLong() { return Long.parseLong(next()); }\n\t\tdouble nextDouble() { return Double.parseDouble(next()); }\n\t}\n}",
"public class Main\n{\n\tprivate static void solve(FastScanner fr) {\n\t\tchar[] s = fr.next().toCharArray();\n\t\tchar[] t = fr.next().toCharArray();\n\n\t\tint min = t.length;\n\t\tfor(int i=0; i<=s.length - t.length; i++) {\n\t\t\tint lmin = 0;\n\t\t\tfor(int j=0; j<t.length; j++){\n\t\t\t\tif(s[i+j]!=t[j])\tlmin++;\n\t\t\t}\n\t\t\tmin = Math.min(min, lmin);\n\t\t}\n\t\tsout(min);\n\t}\n public static void main(String[] args) {\n\t\tFastScanner fs = new FastScanner();\n\t\tint n = 1;\n\t\t// int n = fs.nextInt();\n\t\twhile (n-- > 0)\t{\n\t\t\tsolve(fs);\n }\n }\n\n private static void sout() { System.out.println(); }\n private static void sout(String s) { System.out.println(s); }\n private static void sout(int s) { System.out.println(s); }\n private static void sout(long s) { System.out.println(s); }\n private static void sout(double s) { System.out.println(s); }\n \n\tstatic class FastScanner {\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st=new StringTokenizer(\"\");\n\t\tString next() {\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry { st=new StringTokenizer(br.readLine()); } catch (IOException e) { e.printStackTrace(); }\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tint[] readArray(int n) {\n\t\t\tint[] a=new int[n];\n\t\t\tfor (int i=0; i<n; i++) a[i]=nextInt();\n\t\t\treturn a;\n\t\t}\n\t\tint nextInt() {\treturn Integer.parseInt(next()); }\n\t\tlong nextLong() { return Long.parseLong(next()); }\n\t\tdouble nextDouble() { return Double.parseDouble(next()); }\n\t}\n}",
"Main"
]
| import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Main
{
private static void solve(FastScanner fr) {
char[] s = fr.next().toCharArray();
char[] t = fr.next().toCharArray();
int min = t.length;
for(int i=0; i<=s.length - t.length; i++) {
int lmin = 0;
for(int j=0; j<t.length; j++){
if(s[i+j]!=t[j]) lmin++;
}
min = Math.min(min, lmin);
}
sout(min);
}
public static void main(String[] args) {
FastScanner fs = new FastScanner();
int n = 1;
// int n = fs.nextInt();
while (n-- > 0) {
solve(fs);
}
}
private static void sout() { System.out.println(); }
private static void sout(String s) { System.out.println(s); }
private static void sout(int s) { System.out.println(s); }
private static void sout(long s) { System.out.println(s); }
private static void sout(double s) { System.out.println(s); }
static class FastScanner {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st=new StringTokenizer("");
String next() {
while (!st.hasMoreTokens())
try { st=new StringTokenizer(br.readLine()); } catch (IOException e) { e.printStackTrace(); }
return st.nextToken();
}
int[] readArray(int n) {
int[] a=new int[n];
for (int i=0; i<n; i++) a[i]=nextInt();
return a;
}
int nextInt() { return Integer.parseInt(next()); }
long nextLong() { return Long.parseLong(next()); }
double nextDouble() { return Double.parseDouble(next()); }
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
2,
13,
13,
30,
40,
13,
14,
2,
13,
13,
30,
0,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
94,
5
],
[
94,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
8,
25
],
[
25,
26
],
[
26,
27
],
[
27,
28
],
[
27,
29
],
[
25,
30
],
[
30,
31
],
[
30,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
32,
36
],
[
36,
37
],
[
37,
38
],
[
25,
39
],
[
39,
40
],
[
40,
41
],
[
25,
42
],
[
43,
43
],
[
43,
44
],
[
44,
45
],
[
44,
46
],
[
43,
47
],
[
47,
48
],
[
48,
49
],
[
49,
50
],
[
49,
51
],
[
47,
52
],
[
52,
53
],
[
52,
54
],
[
54,
55
],
[
55,
56
],
[
47,
57
],
[
57,
58
],
[
58,
59
],
[
47,
60
],
[
61,
61
],
[
61,
62
],
[
62,
63
],
[
63,
64
],
[
64,
65
],
[
65,
66
],
[
64,
67
],
[
63,
68
],
[
68,
69
],
[
69,
70
],
[
68,
71
],
[
71,
72
],
[
71,
73
],
[
62,
74
],
[
74,
75
],
[
75,
76
],
[
43,
77
],
[
77,
78
],
[
78,
79
],
[
78,
80
],
[
77,
81
],
[
81,
82
],
[
82,
83
],
[
82,
84
],
[
8,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
87,
89
],
[
85,
90
],
[
6,
91
],
[
91,
92
],
[
0,
93
],
[
93,
94
],
[
93,
95
]
]
| [
"import java.util.Scanner;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.nextLine();\n String T = sc.nextLine();\n int maxcnt = 1000;\n for(int i=0; i<=S.length()-T.length(); i++){\n int cnt = 0;\n for(int j=0; j<T.length(); j++){\n if(T.charAt(j) != S.charAt(i+j)){\n cnt++;\n }\n }\n if(cnt<=maxcnt) {\n maxcnt=cnt;\n }\n }\n System.out.println(maxcnt);\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.nextLine();\n String T = sc.nextLine();\n int maxcnt = 1000;\n for(int i=0; i<=S.length()-T.length(); i++){\n int cnt = 0;\n for(int j=0; j<T.length(); j++){\n if(T.charAt(j) != S.charAt(i+j)){\n cnt++;\n }\n }\n if(cnt<=maxcnt) {\n maxcnt=cnt;\n }\n }\n System.out.println(maxcnt);\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.nextLine();\n String T = sc.nextLine();\n int maxcnt = 1000;\n for(int i=0; i<=S.length()-T.length(); i++){\n int cnt = 0;\n for(int j=0; j<T.length(); j++){\n if(T.charAt(j) != S.charAt(i+j)){\n cnt++;\n }\n }\n if(cnt<=maxcnt) {\n maxcnt=cnt;\n }\n }\n System.out.println(maxcnt);\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n String S = sc.nextLine();\n String T = sc.nextLine();\n int maxcnt = 1000;\n for(int i=0; i<=S.length()-T.length(); i++){\n int cnt = 0;\n for(int j=0; j<T.length(); j++){\n if(T.charAt(j) != S.charAt(i+j)){\n cnt++;\n }\n }\n if(cnt<=maxcnt) {\n maxcnt=cnt;\n }\n }\n System.out.println(maxcnt);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String S = sc.nextLine();",
"S",
"sc.nextLine()",
"sc.nextLine",
"sc",
"String T = sc.nextLine();",
"T",
"sc.nextLine()",
"sc.nextLine",
"sc",
"int maxcnt = 1000;",
"maxcnt",
"1000",
"for(int i=0; i<=S.length()-T.length(); i++){\n int cnt = 0;\n for(int j=0; j<T.length(); j++){\n if(T.charAt(j) != S.charAt(i+j)){\n cnt++;\n }\n }\n if(cnt<=maxcnt) {\n maxcnt=cnt;\n }\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<=S.length()-T.length()",
"i",
"S.length()-T.length()",
"S.length()",
"S.length",
"S",
"T.length()",
"T.length",
"T",
"i++",
"i++",
"i",
"{\n int cnt = 0;\n for(int j=0; j<T.length(); j++){\n if(T.charAt(j) != S.charAt(i+j)){\n cnt++;\n }\n }\n if(cnt<=maxcnt) {\n maxcnt=cnt;\n }\n }",
"{\n int cnt = 0;\n for(int j=0; j<T.length(); j++){\n if(T.charAt(j) != S.charAt(i+j)){\n cnt++;\n }\n }\n if(cnt<=maxcnt) {\n maxcnt=cnt;\n }\n }",
"int cnt = 0;",
"cnt",
"0",
"for(int j=0; j<T.length(); j++){\n if(T.charAt(j) != S.charAt(i+j)){\n cnt++;\n }\n }",
"int j=0;",
"int j=0;",
"j",
"0",
"j<T.length()",
"j",
"T.length()",
"T.length",
"T",
"j++",
"j++",
"j",
"{\n if(T.charAt(j) != S.charAt(i+j)){\n cnt++;\n }\n }",
"{\n if(T.charAt(j) != S.charAt(i+j)){\n cnt++;\n }\n }",
"if(T.charAt(j) != S.charAt(i+j)){\n cnt++;\n }",
"T.charAt(j) != S.charAt(i+j)",
"T.charAt(j)",
"T.charAt",
"T",
"j",
"S.charAt(i+j)",
"S.charAt",
"S",
"i+j",
"i",
"j",
"{\n cnt++;\n }",
"cnt++",
"cnt",
"if(cnt<=maxcnt) {\n maxcnt=cnt;\n }",
"cnt<=maxcnt",
"cnt",
"maxcnt",
"{\n maxcnt=cnt;\n }",
"maxcnt=cnt",
"maxcnt",
"cnt",
"System.out.println(maxcnt)",
"System.out.println",
"System.out",
"System",
"System.out",
"maxcnt",
"String[] args",
"args",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.nextLine();\n String T = sc.nextLine();\n int maxcnt = 1000;\n for(int i=0; i<=S.length()-T.length(); i++){\n int cnt = 0;\n for(int j=0; j<T.length(); j++){\n if(T.charAt(j) != S.charAt(i+j)){\n cnt++;\n }\n }\n if(cnt<=maxcnt) {\n maxcnt=cnt;\n }\n }\n System.out.println(maxcnt);\n }\n}",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.nextLine();\n String T = sc.nextLine();\n int maxcnt = 1000;\n for(int i=0; i<=S.length()-T.length(); i++){\n int cnt = 0;\n for(int j=0; j<T.length(); j++){\n if(T.charAt(j) != S.charAt(i+j)){\n cnt++;\n }\n }\n if(cnt<=maxcnt) {\n maxcnt=cnt;\n }\n }\n System.out.println(maxcnt);\n }\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String S = sc.nextLine();
String T = sc.nextLine();
int maxcnt = 1000;
for(int i=0; i<=S.length()-T.length(); i++){
int cnt = 0;
for(int j=0; j<T.length(); j++){
if(T.charAt(j) != S.charAt(i+j)){
cnt++;
}
}
if(cnt<=maxcnt) {
maxcnt=cnt;
}
}
System.out.println(maxcnt);
}
} |
[
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,
13,
13,
4,
18,
13,
23,
13,
6,
13,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
2,
13,
13,
17,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
13,
13,
23,
13,
23,
13,
23,
13,
6,
13,
41,
13,
41,
13,
41,
13,
17,
12,
13,
30,
0,
13,
20,
23,
13,
12,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
29,
4,
18,
13,
29,
17,
12,
13,
30,
42,
2,
2,
13,
17,
2,
13,
18,
13,
13,
30,
0,
13,
4,
18,
4,
13,
17,
0,
13,
17,
29,
18,
13,
40,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
20,
12,
13,
30,
29,
20,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
18,
13,
13,
13,
4,
13,
29,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
18,
13,
13,
13,
4,
13,
29,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
13,
0,
18,
13,
13,
4,
18,
13,
29,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
16,
17
],
[
16,
18
],
[
0,
19
],
[
19,
20
],
[
19,
21
],
[
0,
22
],
[
22,
23
],
[
22,
24
],
[
0,
25
],
[
475,
26
],
[
475,
27
],
[
27,
28
],
[
27,
29
],
[
29,
30
],
[
30,
31
],
[
30,
32
],
[
32,
33
],
[
32,
34
],
[
29,
35
],
[
35,
36
],
[
35,
37
],
[
37,
38
],
[
37,
39
],
[
29,
40
],
[
40,
41
],
[
40,
42
],
[
29,
43
],
[
43,
44
],
[
43,
45
],
[
29,
46
],
[
46,
47
],
[
46,
48
],
[
29,
49
],
[
49,
50
],
[
50,
51
],
[
49,
52
],
[
49,
53
],
[
49,
54
],
[
29,
55
],
[
55,
56
],
[
56,
57
],
[
27,
58
],
[
58,
59
],
[
475,
60
],
[
60,
61
],
[
60,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
65,
66
],
[
65,
67
],
[
67,
68
],
[
68,
69
],
[
64,
70
],
[
70,
71
],
[
70,
72
],
[
72,
73
],
[
73,
74
],
[
64,
75
],
[
75,
76
],
[
75,
77
],
[
77,
78
],
[
78,
79
],
[
64,
80
],
[
80,
81
],
[
80,
82
],
[
82,
83
],
[
83,
84
],
[
64,
85
],
[
85,
86
],
[
85,
87
],
[
64,
88
],
[
88,
89
],
[
89,
90
],
[
90,
91
],
[
90,
92
],
[
88,
93
],
[
93,
94
],
[
93,
95
],
[
95,
96
],
[
96,
97
],
[
96,
98
],
[
95,
99
],
[
88,
100
],
[
100,
101
],
[
101,
102
],
[
88,
103
],
[
104,
104
],
[
104,
105
],
[
105,
106
],
[
105,
107
],
[
104,
108
],
[
108,
109
],
[
109,
110
],
[
110,
111
],
[
110,
112
],
[
108,
113
],
[
113,
114
],
[
113,
115
],
[
108,
116
],
[
116,
117
],
[
117,
118
],
[
108,
119
],
[
120,
120
],
[
120,
121
],
[
121,
122
],
[
122,
123
],
[
123,
124
],
[
124,
125
],
[
123,
126
],
[
126,
127
],
[
126,
128
],
[
122,
129
],
[
129,
130
],
[
130,
131
],
[
129,
132
],
[
121,
133
],
[
133,
134
],
[
134,
135
],
[
104,
136
],
[
136,
137
],
[
136,
138
],
[
138,
139
],
[
139,
140
],
[
138,
141
],
[
138,
142
],
[
64,
143
],
[
143,
144
],
[
144,
145
],
[
143,
146
],
[
62,
147
],
[
147,
148
],
[
62,
149
],
[
149,
150
],
[
62,
151
],
[
151,
152
],
[
475,
153
],
[
153,
154
],
[
153,
155
],
[
155,
156
],
[
153,
157
],
[
157,
158
],
[
153,
159
],
[
159,
160
],
[
159,
161
],
[
153,
162
],
[
162,
163
],
[
162,
164
],
[
164,
165
],
[
165,
166
],
[
165,
167
],
[
162,
168
],
[
168,
169
],
[
153,
170
],
[
170,
171
],
[
170,
172
],
[
172,
173
],
[
173,
174
],
[
174,
175
],
[
174,
176
],
[
176,
177
],
[
177,
178
],
[
178,
179
],
[
173,
180
],
[
180,
181
],
[
181,
182
],
[
182,
183
],
[
183,
184
],
[
172,
185
],
[
185,
186
],
[
153,
187
],
[
187,
188
],
[
187,
189
],
[
189,
190
],
[
190,
191
],
[
191,
192
],
[
192,
193
],
[
192,
194
],
[
191,
195
],
[
195,
196
],
[
195,
197
],
[
197,
198
],
[
197,
199
],
[
190,
200
],
[
200,
201
],
[
201,
202
],
[
201,
203
],
[
203,
204
],
[
204,
205
],
[
205,
206
],
[
203,
207
],
[
200,
208
],
[
208,
209
],
[
208,
210
],
[
189,
211
],
[
211,
212
],
[
212,
213
],
[
212,
214
],
[
214,
215
],
[
153,
216
],
[
216,
217
],
[
216,
218
],
[
218,
219
],
[
219,
220
],
[
220,
221
],
[
221,
222
],
[
220,
223
],
[
223,
224
],
[
153,
225
],
[
225,
226
],
[
225,
227
],
[
227,
228
],
[
228,
229
],
[
229,
230
],
[
230,
231
],
[
229,
232
],
[
232,
233
],
[
153,
234
],
[
234,
235
],
[
234,
236
],
[
236,
237
],
[
237,
238
],
[
238,
239
],
[
239,
240
],
[
238,
241
],
[
241,
242
],
[
153,
243
],
[
243,
244
],
[
243,
245
],
[
245,
246
],
[
246,
247
],
[
153,
248
],
[
248,
249
],
[
248,
250
],
[
250,
251
],
[
251,
252
],
[
153,
253
],
[
253,
254
],
[
253,
255
],
[
255,
256
],
[
256,
257
],
[
256,
258
],
[
255,
260
],
[
260,
261
],
[
261,
262
],
[
262,
263
],
[
262,
264
],
[
260,
265
],
[
265,
266
],
[
265,
267
],
[
260,
268
],
[
268,
269
],
[
269,
270
],
[
260,
271
],
[
272,
272
],
[
272,
273
],
[
273,
274
],
[
274,
275
],
[
274,
276
],
[
273,
277
],
[
277,
278
],
[
255,
279
],
[
279,
280
],
[
253,
281
],
[
281,
282
],
[
153,
283
],
[
283,
284
],
[
283,
285
],
[
285,
286
],
[
286,
287
],
[
286,
288
],
[
285,
290
],
[
290,
291
],
[
291,
292
],
[
292,
293
],
[
292,
294
],
[
290,
295
],
[
295,
296
],
[
295,
297
],
[
290,
298
],
[
298,
299
],
[
299,
300
],
[
290,
301
],
[
302,
302
],
[
302,
303
],
[
303,
304
],
[
304,
305
],
[
304,
306
],
[
303,
307
],
[
307,
308
],
[
285,
309
],
[
309,
310
],
[
283,
311
],
[
311,
312
],
[
153,
313
],
[
313,
314
],
[
313,
315
],
[
315,
316
],
[
316,
317
],
[
316,
318
],
[
315,
320
],
[
320,
321
],
[
321,
322
],
[
322,
323
],
[
322,
324
],
[
320,
325
],
[
325,
326
],
[
325,
327
],
[
320,
328
],
[
328,
329
],
[
329,
330
],
[
320,
331
],
[
332,
332
],
[
332,
333
],
[
333,
334
],
[
334,
335
],
[
334,
336
],
[
333,
337
],
[
337,
338
],
[
315,
339
],
[
339,
340
],
[
313,
341
],
[
341,
342
],
[
153,
343
],
[
343,
344
],
[
343,
345
],
[
345,
346
],
[
346,
347
],
[
346,
348
],
[
345,
351
],
[
351,
352
],
[
352,
353
],
[
353,
354
],
[
353,
355
],
[
351,
356
],
[
356,
357
],
[
356,
358
],
[
351,
359
],
[
359,
360
],
[
360,
361
],
[
351,
362
],
[
363,
363
],
[
363,
364
],
[
364,
365
],
[
365,
366
],
[
366,
367
],
[
366,
368
],
[
364,
369
],
[
369,
370
],
[
369,
371
],
[
364,
372
],
[
372,
373
],
[
373,
374
],
[
364,
375
],
[
376,
376
],
[
376,
377
],
[
377,
378
],
[
378,
379
],
[
379,
380
],
[
379,
381
],
[
378,
382
],
[
377,
383
],
[
383,
384
],
[
345,
385
],
[
385,
386
],
[
343,
387
],
[
387,
388
],
[
343,
389
],
[
389,
390
],
[
153,
391
],
[
391,
392
],
[
391,
393
],
[
393,
394
],
[
394,
395
],
[
394,
396
],
[
393,
399
],
[
399,
400
],
[
400,
401
],
[
401,
402
],
[
401,
403
],
[
399,
404
],
[
404,
405
],
[
404,
406
],
[
399,
407
],
[
407,
408
],
[
408,
409
],
[
399,
410
],
[
411,
411
],
[
411,
412
],
[
412,
413
],
[
413,
414
],
[
414,
415
],
[
414,
416
],
[
412,
417
],
[
417,
418
],
[
417,
419
],
[
412,
420
],
[
420,
421
],
[
421,
422
],
[
412,
423
],
[
424,
424
],
[
424,
425
],
[
425,
426
],
[
426,
427
],
[
427,
428
],
[
427,
429
],
[
426,
430
],
[
425,
431
],
[
431,
432
],
[
393,
433
],
[
433,
434
],
[
391,
435
],
[
435,
436
],
[
391,
437
],
[
437,
438
],
[
153,
439
],
[
439,
440
],
[
439,
441
],
[
441,
442
],
[
442,
443
],
[
442,
444
],
[
441,
446
],
[
446,
447
],
[
447,
448
],
[
448,
449
],
[
448,
450
],
[
446,
451
],
[
451,
452
],
[
451,
453
],
[
446,
454
],
[
454,
455
],
[
455,
456
],
[
446,
457
],
[
458,
458
],
[
458,
459
],
[
459,
460
],
[
459,
461
],
[
461,
462
],
[
458,
463
],
[
463,
464
],
[
464,
465
],
[
464,
466
],
[
463,
467
],
[
467,
468
],
[
468,
469
],
[
441,
470
],
[
470,
471
],
[
439,
472
],
[
472,
473
],
[
0,
474
],
[
474,
475
],
[
474,
476
]
]
| [
"\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\n\npublic class Main {\n \n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastInput in = new FastInput(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tSample solver = new Sample();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\t\n\tstatic class Sample {\n\t\n\t\tpublic void solve(int testNum, FastInput in, PrintWriter out) {\n\t\t\t\n\t\t\tString s = in.next();\n\t\t\tString t = in.next();\n\t\t\t\n\t\t\tint n = s.length();\n\t\t\tint m = t.length();\n\t\t\t\n\t\t\tint min = m;\n\t\t\tfor(int i = 0 ; i < n - m + 1 ;i++) {\n\t\t\t\tint tmp = 0;\n\t\t\t\tfor(int j = 0 ; j < m ; j++) {\n\t\t\t\t\tif(s.charAt(i+j) != t.charAt(j)) {\n\t\t\t\t\t\ttmp++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.min(tmp,min);\n\t\t\t}\n\t\t\t\n\t\t\tout.println(min);\n\t\t\t\n\t\n\t\t}\n\t\n\t}\n\tstatic class FastInput{\n\t\tprivate final BufferedReader in;\n\t\tprivate String[] buff;\n\t\tprivate int index = 0;\n\t\t\n\t\tpublic FastInput(InputStream is) {\n\t\t\tin = new BufferedReader(new InputStreamReader(is));\n\t\t}\n\t\tString nextLine() {\n\t\t\ttry {\n\t\t\t\treturn in.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn null;\n\t\t}\n\t\tString next() {\n\t\t\twhile (buff == null || index >= buff.length) {\n\t\t\t\tbuff = nextLine().split(\" \");\n\t\t\t\tindex = 0;\n\t\t\t}\n\t\t\treturn buff[index++];\n\t\t}\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\t\n\t\tDouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\t\n\t\tBigInteger nextBigInteger() {\n\t\t\treturn new BigInteger(next());\n\t\t}\n\t\t\n\t\tBigDecimal nextBigDecimal() {\n\t\t\treturn new BigDecimal(next());\n\t\t}\n\t\t\n\t\tpublic int[] nextIntArray(final int n) {\n\t\t\tfinal int[] res = new int [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic long[] nextLongArray(final int n) {\n\t\t\tfinal long[] res= new long [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic double[] nextDoubleArray(final int n ) {\n\t\t\tfinal double[] res = new double [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextDouble();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\t\n\t\tpublic int[][] nextInt2DArray(final int n , final int m){\n\t\t\tint [][]res = new int [n][m];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextInt();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\tpublic long[][] nextLong2DArray(final int n , final int m){\n\t\t\tlong [][]res = new long [n][m];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextLong();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic char[][] nextChar2DArray(final int n){\n\t\t\tchar [][]res = new char [n][];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tString s = next();\n\t\t\t\tres[i] = s.toCharArray();\n\t\t\t}\n\t\t\t\n\t\t\treturn res;\n\t\t}\n\t}\n\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStream;",
"InputStream",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.io.OutputStream;",
"OutputStream",
"java.io",
"import java.io.PrintWriter;",
"PrintWriter",
"java.io",
"import java.math.BigDecimal;",
"BigDecimal",
"java.math",
"import java.math.BigInteger;",
"BigInteger",
"java.math",
"public class Main {\n \n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastInput in = new FastInput(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tSample solver = new Sample();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\t\n\tstatic class Sample {\n\t\n\t\tpublic void solve(int testNum, FastInput in, PrintWriter out) {\n\t\t\t\n\t\t\tString s = in.next();\n\t\t\tString t = in.next();\n\t\t\t\n\t\t\tint n = s.length();\n\t\t\tint m = t.length();\n\t\t\t\n\t\t\tint min = m;\n\t\t\tfor(int i = 0 ; i < n - m + 1 ;i++) {\n\t\t\t\tint tmp = 0;\n\t\t\t\tfor(int j = 0 ; j < m ; j++) {\n\t\t\t\t\tif(s.charAt(i+j) != t.charAt(j)) {\n\t\t\t\t\t\ttmp++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.min(tmp,min);\n\t\t\t}\n\t\t\t\n\t\t\tout.println(min);\n\t\t\t\n\t\n\t\t}\n\t\n\t}\n\tstatic class FastInput{\n\t\tprivate final BufferedReader in;\n\t\tprivate String[] buff;\n\t\tprivate int index = 0;\n\t\t\n\t\tpublic FastInput(InputStream is) {\n\t\t\tin = new BufferedReader(new InputStreamReader(is));\n\t\t}\n\t\tString nextLine() {\n\t\t\ttry {\n\t\t\t\treturn in.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn null;\n\t\t}\n\t\tString next() {\n\t\t\twhile (buff == null || index >= buff.length) {\n\t\t\t\tbuff = nextLine().split(\" \");\n\t\t\t\tindex = 0;\n\t\t\t}\n\t\t\treturn buff[index++];\n\t\t}\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\t\n\t\tDouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\t\n\t\tBigInteger nextBigInteger() {\n\t\t\treturn new BigInteger(next());\n\t\t}\n\t\t\n\t\tBigDecimal nextBigDecimal() {\n\t\t\treturn new BigDecimal(next());\n\t\t}\n\t\t\n\t\tpublic int[] nextIntArray(final int n) {\n\t\t\tfinal int[] res = new int [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic long[] nextLongArray(final int n) {\n\t\t\tfinal long[] res= new long [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic double[] nextDoubleArray(final int n ) {\n\t\t\tfinal double[] res = new double [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextDouble();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\t\n\t\tpublic int[][] nextInt2DArray(final int n , final int m){\n\t\t\tint [][]res = new int [n][m];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextInt();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\tpublic long[][] nextLong2DArray(final int n , final int m){\n\t\t\tlong [][]res = new long [n][m];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextLong();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic char[][] nextChar2DArray(final int n){\n\t\t\tchar [][]res = new char [n][];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tString s = next();\n\t\t\t\tres[i] = s.toCharArray();\n\t\t\t}\n\t\t\t\n\t\t\treturn res;\n\t\t}\n\t}\n\n}",
"Main",
"public static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastInput in = new FastInput(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tSample solver = new Sample();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}",
"main",
"{\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastInput in = new FastInput(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tSample solver = new Sample();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}",
"InputStream inputStream = System.in;",
"inputStream",
"System.in",
"System",
"System.in",
"OutputStream outputStream = System.out;",
"outputStream",
"System.out",
"System",
"System.out",
"FastInput in = new FastInput(inputStream);",
"in",
"new FastInput(inputStream)",
"PrintWriter out = new PrintWriter(outputStream);",
"out",
"new PrintWriter(outputStream)",
"Sample solver = new Sample();",
"solver",
"new Sample()",
"solver.solve(1, in, out)",
"solver.solve",
"solver",
"1",
"in",
"out",
"out.close()",
"out.close",
"out",
"String[] args",
"args",
"static class Sample {\n\t\n\t\tpublic void solve(int testNum, FastInput in, PrintWriter out) {\n\t\t\t\n\t\t\tString s = in.next();\n\t\t\tString t = in.next();\n\t\t\t\n\t\t\tint n = s.length();\n\t\t\tint m = t.length();\n\t\t\t\n\t\t\tint min = m;\n\t\t\tfor(int i = 0 ; i < n - m + 1 ;i++) {\n\t\t\t\tint tmp = 0;\n\t\t\t\tfor(int j = 0 ; j < m ; j++) {\n\t\t\t\t\tif(s.charAt(i+j) != t.charAt(j)) {\n\t\t\t\t\t\ttmp++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.min(tmp,min);\n\t\t\t}\n\t\t\t\n\t\t\tout.println(min);\n\t\t\t\n\t\n\t\t}\n\t\n\t}",
"Sample",
"public void solve(int testNum, FastInput in, PrintWriter out) {\n\t\t\t\n\t\t\tString s = in.next();\n\t\t\tString t = in.next();\n\t\t\t\n\t\t\tint n = s.length();\n\t\t\tint m = t.length();\n\t\t\t\n\t\t\tint min = m;\n\t\t\tfor(int i = 0 ; i < n - m + 1 ;i++) {\n\t\t\t\tint tmp = 0;\n\t\t\t\tfor(int j = 0 ; j < m ; j++) {\n\t\t\t\t\tif(s.charAt(i+j) != t.charAt(j)) {\n\t\t\t\t\t\ttmp++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.min(tmp,min);\n\t\t\t}\n\t\t\t\n\t\t\tout.println(min);\n\t\t\t\n\t\n\t\t}",
"solve",
"{\n\t\t\t\n\t\t\tString s = in.next();\n\t\t\tString t = in.next();\n\t\t\t\n\t\t\tint n = s.length();\n\t\t\tint m = t.length();\n\t\t\t\n\t\t\tint min = m;\n\t\t\tfor(int i = 0 ; i < n - m + 1 ;i++) {\n\t\t\t\tint tmp = 0;\n\t\t\t\tfor(int j = 0 ; j < m ; j++) {\n\t\t\t\t\tif(s.charAt(i+j) != t.charAt(j)) {\n\t\t\t\t\t\ttmp++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.min(tmp,min);\n\t\t\t}\n\t\t\t\n\t\t\tout.println(min);\n\t\t\t\n\t\n\t\t}",
"String s = in.next();",
"s",
"in.next()",
"in.next",
"in",
"String t = in.next();",
"t",
"in.next()",
"in.next",
"in",
"int n = s.length();",
"n",
"s.length()",
"s.length",
"s",
"int m = t.length();",
"m",
"t.length()",
"t.length",
"t",
"int min = m;",
"min",
"m",
"for(int i = 0 ; i < n - m + 1 ;i++) {\n\t\t\t\tint tmp = 0;\n\t\t\t\tfor(int j = 0 ; j < m ; j++) {\n\t\t\t\t\tif(s.charAt(i+j) != t.charAt(j)) {\n\t\t\t\t\t\ttmp++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.min(tmp,min);\n\t\t\t}",
"int i = 0 ;",
"int i = 0 ;",
"i",
"0",
"i < n - m + 1",
"i",
"n - m + 1",
"n - m",
"n",
"m",
"1",
"i++",
"i++",
"i",
"{\n\t\t\t\tint tmp = 0;\n\t\t\t\tfor(int j = 0 ; j < m ; j++) {\n\t\t\t\t\tif(s.charAt(i+j) != t.charAt(j)) {\n\t\t\t\t\t\ttmp++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.min(tmp,min);\n\t\t\t}",
"{\n\t\t\t\tint tmp = 0;\n\t\t\t\tfor(int j = 0 ; j < m ; j++) {\n\t\t\t\t\tif(s.charAt(i+j) != t.charAt(j)) {\n\t\t\t\t\t\ttmp++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.min(tmp,min);\n\t\t\t}",
"int tmp = 0;",
"tmp",
"0",
"for(int j = 0 ; j < m ; j++) {\n\t\t\t\t\tif(s.charAt(i+j) != t.charAt(j)) {\n\t\t\t\t\t\ttmp++;\n\t\t\t\t\t}\n\t\t\t\t}",
"int j = 0 ;",
"int j = 0 ;",
"j",
"0",
"j < m",
"j",
"m",
"j++",
"j++",
"j",
"{\n\t\t\t\t\tif(s.charAt(i+j) != t.charAt(j)) {\n\t\t\t\t\t\ttmp++;\n\t\t\t\t\t}\n\t\t\t\t}",
"{\n\t\t\t\t\tif(s.charAt(i+j) != t.charAt(j)) {\n\t\t\t\t\t\ttmp++;\n\t\t\t\t\t}\n\t\t\t\t}",
"if(s.charAt(i+j) != t.charAt(j)) {\n\t\t\t\t\t\ttmp++;\n\t\t\t\t\t}",
"s.charAt(i+j) != t.charAt(j)",
"s.charAt(i+j)",
"s.charAt",
"s",
"i+j",
"i",
"j",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"{\n\t\t\t\t\t\ttmp++;\n\t\t\t\t\t}",
"tmp++",
"tmp",
"min = Math.min(tmp,min)",
"min",
"Math.min(tmp,min)",
"Math.min",
"Math",
"tmp",
"min",
"out.println(min)",
"out.println",
"out",
"min",
"int testNum",
"testNum",
"FastInput in",
"in",
"PrintWriter out",
"out",
"static class FastInput{\n\t\tprivate final BufferedReader in;\n\t\tprivate String[] buff;\n\t\tprivate int index = 0;\n\t\t\n\t\tpublic FastInput(InputStream is) {\n\t\t\tin = new BufferedReader(new InputStreamReader(is));\n\t\t}\n\t\tString nextLine() {\n\t\t\ttry {\n\t\t\t\treturn in.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn null;\n\t\t}\n\t\tString next() {\n\t\t\twhile (buff == null || index >= buff.length) {\n\t\t\t\tbuff = nextLine().split(\" \");\n\t\t\t\tindex = 0;\n\t\t\t}\n\t\t\treturn buff[index++];\n\t\t}\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\t\n\t\tDouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\t\n\t\tBigInteger nextBigInteger() {\n\t\t\treturn new BigInteger(next());\n\t\t}\n\t\t\n\t\tBigDecimal nextBigDecimal() {\n\t\t\treturn new BigDecimal(next());\n\t\t}\n\t\t\n\t\tpublic int[] nextIntArray(final int n) {\n\t\t\tfinal int[] res = new int [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic long[] nextLongArray(final int n) {\n\t\t\tfinal long[] res= new long [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic double[] nextDoubleArray(final int n ) {\n\t\t\tfinal double[] res = new double [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextDouble();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\t\n\t\tpublic int[][] nextInt2DArray(final int n , final int m){\n\t\t\tint [][]res = new int [n][m];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextInt();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\tpublic long[][] nextLong2DArray(final int n , final int m){\n\t\t\tlong [][]res = new long [n][m];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextLong();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic char[][] nextChar2DArray(final int n){\n\t\t\tchar [][]res = new char [n][];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tString s = next();\n\t\t\t\tres[i] = s.toCharArray();\n\t\t\t}\n\t\t\t\n\t\t\treturn res;\n\t\t}\n\t}",
"FastInput",
"private final BufferedReader in;",
"in",
"private String[] buff;",
"buff",
"private int index = 0;",
"index",
"0",
"public FastInput(InputStream is) {\n\t\t\tin = new BufferedReader(new InputStreamReader(is));\n\t\t}",
"FastInput",
"{\n\t\t\tin = new BufferedReader(new InputStreamReader(is));\n\t\t}",
"in = new BufferedReader(new InputStreamReader(is))",
"in",
"new BufferedReader(new InputStreamReader(is))",
"InputStream is",
"is",
"String nextLine() {\n\t\t\ttry {\n\t\t\t\treturn in.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn null;\n\t\t}",
"nextLine",
"{\n\t\t\ttry {\n\t\t\t\treturn in.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn null;\n\t\t}",
"try {\n\t\t\t\treturn in.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}",
"catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}",
"IOException e",
"{\n\t\t\t\te.printStackTrace();\n\t\t\t}",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n\t\t\t\treturn in.readLine();\n\t\t\t}",
"return in.readLine();",
"in.readLine()",
"in.readLine",
"in",
"return null;",
"null",
"String next() {\n\t\t\twhile (buff == null || index >= buff.length) {\n\t\t\t\tbuff = nextLine().split(\" \");\n\t\t\t\tindex = 0;\n\t\t\t}\n\t\t\treturn buff[index++];\n\t\t}",
"next",
"{\n\t\t\twhile (buff == null || index >= buff.length) {\n\t\t\t\tbuff = nextLine().split(\" \");\n\t\t\t\tindex = 0;\n\t\t\t}\n\t\t\treturn buff[index++];\n\t\t}",
"while (buff == null || index >= buff.length) {\n\t\t\t\tbuff = nextLine().split(\" \");\n\t\t\t\tindex = 0;\n\t\t\t}",
"buff == null || index >= buff.length",
"buff == null",
"buff",
"null",
"index >= buff.length",
"index",
"buff.length",
"buff",
"buff.length",
"{\n\t\t\t\tbuff = nextLine().split(\" \");\n\t\t\t\tindex = 0;\n\t\t\t}",
"buff = nextLine().split(\" \")",
"buff",
"nextLine().split(\" \")",
"nextLine().split",
"nextLine()",
"nextLine",
"\" \"",
"index = 0",
"index",
"0",
"return buff[index++];",
"buff[index++]",
"buff",
"index++",
"index",
"int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}",
"nextInt",
"{\n\t\t\treturn Integer.parseInt(next());\n\t\t}",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}",
"nextLong",
"{\n\t\t\treturn Long.parseLong(next());\n\t\t}",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"Double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}",
"nextDouble",
"{\n\t\t\treturn Double.parseDouble(next());\n\t\t}",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"BigInteger nextBigInteger() {\n\t\t\treturn new BigInteger(next());\n\t\t}",
"nextBigInteger",
"{\n\t\t\treturn new BigInteger(next());\n\t\t}",
"return new BigInteger(next());",
"new BigInteger(next())",
"BigDecimal nextBigDecimal() {\n\t\t\treturn new BigDecimal(next());\n\t\t}",
"nextBigDecimal",
"{\n\t\t\treturn new BigDecimal(next());\n\t\t}",
"return new BigDecimal(next());",
"new BigDecimal(next())",
"public int[] nextIntArray(final int n) {\n\t\t\tfinal int[] res = new int [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}",
"nextIntArray",
"{\n\t\t\tfinal int[] res = new int [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}",
"final int[] res = new int [n];",
"res",
"new int [n]",
"n",
"for(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}",
"int i = 0 ;",
"int i = 0 ;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\t\tres[i] = nextInt();\n\t\t\t}",
"{\n\t\t\t\tres[i] = nextInt();\n\t\t\t}",
"res[i] = nextInt()",
"res[i]",
"res",
"i",
"nextInt()",
"nextInt",
"return res;",
"res",
"final int n",
"n",
"public long[] nextLongArray(final int n) {\n\t\t\tfinal long[] res= new long [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}",
"nextLongArray",
"{\n\t\t\tfinal long[] res= new long [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}",
"final long[] res= new long [n];",
"res",
"new long [n]",
"n",
"for(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}",
"int i = 0 ;",
"int i = 0 ;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\t\tres[i] = nextLong();\n\t\t\t}",
"{\n\t\t\t\tres[i] = nextLong();\n\t\t\t}",
"res[i] = nextLong()",
"res[i]",
"res",
"i",
"nextLong()",
"nextLong",
"return res;",
"res",
"final int n",
"n",
"public double[] nextDoubleArray(final int n ) {\n\t\t\tfinal double[] res = new double [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextDouble();\n\t\t\t}\n\t\t\treturn res;\n\t\t}",
"nextDoubleArray",
"{\n\t\t\tfinal double[] res = new double [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextDouble();\n\t\t\t}\n\t\t\treturn res;\n\t\t}",
"final double[] res = new double [n];",
"res",
"new double [n]",
"n",
"for(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextDouble();\n\t\t\t}",
"int i = 0 ;",
"int i = 0 ;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\t\tres[i] = nextDouble();\n\t\t\t}",
"{\n\t\t\t\tres[i] = nextDouble();\n\t\t\t}",
"res[i] = nextDouble()",
"res[i]",
"res",
"i",
"nextDouble()",
"nextDouble",
"return res;",
"res",
"final int n",
"n",
"public int[][] nextInt2DArray(final int n , final int m){\n\t\t\tint [][]res = new int [n][m];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextInt();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}",
"nextInt2DArray",
"{\n\t\t\tint [][]res = new int [n][m];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextInt();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}",
"int [][]res = new int [n][m];",
"res",
"new int [n][m]",
"n",
"m",
"for(int i = 0 ; i < n ;i++) {\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextInt();\n\t\t\t\t}\n\t\t\t}",
"int i = 0 ;",
"int i = 0 ;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextInt();\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextInt();\n\t\t\t\t}\n\t\t\t}",
"for(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextInt();\n\t\t\t\t}",
"int j = 0 ;",
"int j = 0 ;",
"j",
"0",
"j < m",
"j",
"m",
"j++",
"j++",
"j",
"{\n\t\t\t\t\tres[i][j] = nextInt();\n\t\t\t\t}",
"{\n\t\t\t\t\tres[i][j] = nextInt();\n\t\t\t\t}",
"res[i][j] = nextInt()",
"res[i][j]",
"res[i]",
"res",
"i",
"j",
"nextInt()",
"nextInt",
"return res;",
"res",
"final int n",
"n",
"final int m",
"m",
"public long[][] nextLong2DArray(final int n , final int m){\n\t\t\tlong [][]res = new long [n][m];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextLong();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}",
"nextLong2DArray",
"{\n\t\t\tlong [][]res = new long [n][m];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextLong();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}",
"long [][]res = new long [n][m];",
"res",
"new long [n][m]",
"n",
"m",
"for(int i = 0 ; i < n ;i++) {\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextLong();\n\t\t\t\t}\n\t\t\t}",
"int i = 0 ;",
"int i = 0 ;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextLong();\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextLong();\n\t\t\t\t}\n\t\t\t}",
"for(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextLong();\n\t\t\t\t}",
"int j = 0 ;",
"int j = 0 ;",
"j",
"0",
"j < m",
"j",
"m",
"j++",
"j++",
"j",
"{\n\t\t\t\t\tres[i][j] = nextLong();\n\t\t\t\t}",
"{\n\t\t\t\t\tres[i][j] = nextLong();\n\t\t\t\t}",
"res[i][j] = nextLong()",
"res[i][j]",
"res[i]",
"res",
"i",
"j",
"nextLong()",
"nextLong",
"return res;",
"res",
"final int n",
"n",
"final int m",
"m",
"public char[][] nextChar2DArray(final int n){\n\t\t\tchar [][]res = new char [n][];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tString s = next();\n\t\t\t\tres[i] = s.toCharArray();\n\t\t\t}\n\t\t\t\n\t\t\treturn res;\n\t\t}",
"nextChar2DArray",
"{\n\t\t\tchar [][]res = new char [n][];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tString s = next();\n\t\t\t\tres[i] = s.toCharArray();\n\t\t\t}\n\t\t\t\n\t\t\treturn res;\n\t\t}",
"char [][]res = new char [n][];",
"res",
"new char [n][]",
"n",
"for(int i = 0 ; i < n ;i++) {\n\t\t\t\tString s = next();\n\t\t\t\tres[i] = s.toCharArray();\n\t\t\t}",
"int i = 0 ;",
"int i = 0 ;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\t\tString s = next();\n\t\t\t\tres[i] = s.toCharArray();\n\t\t\t}",
"{\n\t\t\t\tString s = next();\n\t\t\t\tres[i] = s.toCharArray();\n\t\t\t}",
"String s = next();",
"s",
"next()",
"next",
"res[i] = s.toCharArray()",
"res[i]",
"res",
"i",
"s.toCharArray()",
"s.toCharArray",
"s",
"return res;",
"res",
"final int n",
"n",
"public class Main {\n \n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastInput in = new FastInput(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tSample solver = new Sample();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\t\n\tstatic class Sample {\n\t\n\t\tpublic void solve(int testNum, FastInput in, PrintWriter out) {\n\t\t\t\n\t\t\tString s = in.next();\n\t\t\tString t = in.next();\n\t\t\t\n\t\t\tint n = s.length();\n\t\t\tint m = t.length();\n\t\t\t\n\t\t\tint min = m;\n\t\t\tfor(int i = 0 ; i < n - m + 1 ;i++) {\n\t\t\t\tint tmp = 0;\n\t\t\t\tfor(int j = 0 ; j < m ; j++) {\n\t\t\t\t\tif(s.charAt(i+j) != t.charAt(j)) {\n\t\t\t\t\t\ttmp++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.min(tmp,min);\n\t\t\t}\n\t\t\t\n\t\t\tout.println(min);\n\t\t\t\n\t\n\t\t}\n\t\n\t}\n\tstatic class FastInput{\n\t\tprivate final BufferedReader in;\n\t\tprivate String[] buff;\n\t\tprivate int index = 0;\n\t\t\n\t\tpublic FastInput(InputStream is) {\n\t\t\tin = new BufferedReader(new InputStreamReader(is));\n\t\t}\n\t\tString nextLine() {\n\t\t\ttry {\n\t\t\t\treturn in.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn null;\n\t\t}\n\t\tString next() {\n\t\t\twhile (buff == null || index >= buff.length) {\n\t\t\t\tbuff = nextLine().split(\" \");\n\t\t\t\tindex = 0;\n\t\t\t}\n\t\t\treturn buff[index++];\n\t\t}\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\t\n\t\tDouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\t\n\t\tBigInteger nextBigInteger() {\n\t\t\treturn new BigInteger(next());\n\t\t}\n\t\t\n\t\tBigDecimal nextBigDecimal() {\n\t\t\treturn new BigDecimal(next());\n\t\t}\n\t\t\n\t\tpublic int[] nextIntArray(final int n) {\n\t\t\tfinal int[] res = new int [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic long[] nextLongArray(final int n) {\n\t\t\tfinal long[] res= new long [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic double[] nextDoubleArray(final int n ) {\n\t\t\tfinal double[] res = new double [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextDouble();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\t\n\t\tpublic int[][] nextInt2DArray(final int n , final int m){\n\t\t\tint [][]res = new int [n][m];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextInt();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\tpublic long[][] nextLong2DArray(final int n , final int m){\n\t\t\tlong [][]res = new long [n][m];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextLong();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic char[][] nextChar2DArray(final int n){\n\t\t\tchar [][]res = new char [n][];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tString s = next();\n\t\t\t\tres[i] = s.toCharArray();\n\t\t\t}\n\t\t\t\n\t\t\treturn res;\n\t\t}\n\t}\n\n}",
"public class Main {\n \n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastInput in = new FastInput(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tSample solver = new Sample();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\t\n\tstatic class Sample {\n\t\n\t\tpublic void solve(int testNum, FastInput in, PrintWriter out) {\n\t\t\t\n\t\t\tString s = in.next();\n\t\t\tString t = in.next();\n\t\t\t\n\t\t\tint n = s.length();\n\t\t\tint m = t.length();\n\t\t\t\n\t\t\tint min = m;\n\t\t\tfor(int i = 0 ; i < n - m + 1 ;i++) {\n\t\t\t\tint tmp = 0;\n\t\t\t\tfor(int j = 0 ; j < m ; j++) {\n\t\t\t\t\tif(s.charAt(i+j) != t.charAt(j)) {\n\t\t\t\t\t\ttmp++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmin = Math.min(tmp,min);\n\t\t\t}\n\t\t\t\n\t\t\tout.println(min);\n\t\t\t\n\t\n\t\t}\n\t\n\t}\n\tstatic class FastInput{\n\t\tprivate final BufferedReader in;\n\t\tprivate String[] buff;\n\t\tprivate int index = 0;\n\t\t\n\t\tpublic FastInput(InputStream is) {\n\t\t\tin = new BufferedReader(new InputStreamReader(is));\n\t\t}\n\t\tString nextLine() {\n\t\t\ttry {\n\t\t\t\treturn in.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn null;\n\t\t}\n\t\tString next() {\n\t\t\twhile (buff == null || index >= buff.length) {\n\t\t\t\tbuff = nextLine().split(\" \");\n\t\t\t\tindex = 0;\n\t\t\t}\n\t\t\treturn buff[index++];\n\t\t}\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\t\n\t\tDouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\t\n\t\tBigInteger nextBigInteger() {\n\t\t\treturn new BigInteger(next());\n\t\t}\n\t\t\n\t\tBigDecimal nextBigDecimal() {\n\t\t\treturn new BigDecimal(next());\n\t\t}\n\t\t\n\t\tpublic int[] nextIntArray(final int n) {\n\t\t\tfinal int[] res = new int [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic long[] nextLongArray(final int n) {\n\t\t\tfinal long[] res= new long [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic double[] nextDoubleArray(final int n ) {\n\t\t\tfinal double[] res = new double [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextDouble();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\t\n\t\tpublic int[][] nextInt2DArray(final int n , final int m){\n\t\t\tint [][]res = new int [n][m];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextInt();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\tpublic long[][] nextLong2DArray(final int n , final int m){\n\t\t\tlong [][]res = new long [n][m];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextLong();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic char[][] nextChar2DArray(final int n){\n\t\t\tchar [][]res = new char [n][];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tString s = next();\n\t\t\t\tres[i] = s.toCharArray();\n\t\t\t}\n\t\t\t\n\t\t\treturn res;\n\t\t}\n\t}\n\n}",
"Main"
]
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.BigInteger;
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
FastInput in = new FastInput(inputStream);
PrintWriter out = new PrintWriter(outputStream);
Sample solver = new Sample();
solver.solve(1, in, out);
out.close();
}
static class Sample {
public void solve(int testNum, FastInput in, PrintWriter out) {
String s = in.next();
String t = in.next();
int n = s.length();
int m = t.length();
int min = m;
for(int i = 0 ; i < n - m + 1 ;i++) {
int tmp = 0;
for(int j = 0 ; j < m ; j++) {
if(s.charAt(i+j) != t.charAt(j)) {
tmp++;
}
}
min = Math.min(tmp,min);
}
out.println(min);
}
}
static class FastInput{
private final BufferedReader in;
private String[] buff;
private int index = 0;
public FastInput(InputStream is) {
in = new BufferedReader(new InputStreamReader(is));
}
String nextLine() {
try {
return in.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return null;
}
String next() {
while (buff == null || index >= buff.length) {
buff = nextLine().split(" ");
index = 0;
}
return buff[index++];
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
Double nextDouble() {
return Double.parseDouble(next());
}
BigInteger nextBigInteger() {
return new BigInteger(next());
}
BigDecimal nextBigDecimal() {
return new BigDecimal(next());
}
public int[] nextIntArray(final int n) {
final int[] res = new int [n];
for(int i = 0 ; i < n ;i++) {
res[i] = nextInt();
}
return res;
}
public long[] nextLongArray(final int n) {
final long[] res= new long [n];
for(int i = 0 ; i < n ;i++) {
res[i] = nextLong();
}
return res;
}
public double[] nextDoubleArray(final int n ) {
final double[] res = new double [n];
for(int i = 0 ; i < n ;i++) {
res[i] = nextDouble();
}
return res;
}
public int[][] nextInt2DArray(final int n , final int m){
int [][]res = new int [n][m];
for(int i = 0 ; i < n ;i++) {
for(int j = 0 ; j < m ;j++) {
res[i][j] = nextInt();
}
}
return res;
}
public long[][] nextLong2DArray(final int n , final int m){
long [][]res = new long [n][m];
for(int i = 0 ; i < n ;i++) {
for(int j = 0 ; j < m ;j++) {
res[i][j] = nextLong();
}
}
return res;
}
public char[][] nextChar2DArray(final int n){
char [][]res = new char [n][];
for(int i = 0 ; i < n ;i++) {
String s = next();
res[i] = s.toCharArray();
}
return res;
}
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
20,
41,
13,
4,
18,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
41,
13,
18,
13,
13,
41,
13,
18,
13,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
13,
18,
13,
2,
13,
13,
9,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
13,
13,
4,
18,
13,
23,
13,
12,
13,
30,
41,
13,
18,
13,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
13,
18,
13,
13,
30,
0,
13,
17,
3,
29,
13,
23,
13,
23,
13,
12,
13,
30,
29,
2,
2,
13,
13,
4,
13,
13,
13,
23,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
29,
13,
29,
4,
13,
13,
2,
13,
13,
23,
13,
23,
13,
6,
13,
41,
13,
20,
41,
13,
20,
12,
13,
30,
42,
40,
4,
18,
13,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
297,
8
],
[
297,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
11,
15
],
[
15,
16
],
[
15,
17
],
[
11,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
22,
23
],
[
23,
24
],
[
11,
25
],
[
25,
26
],
[
25,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
30,
31
],
[
11,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
34,
36
],
[
11,
37
],
[
37,
38
],
[
37,
39
],
[
39,
40
],
[
39,
41
],
[
11,
42
],
[
42,
43
],
[
42,
44
],
[
44,
45
],
[
44,
46
],
[
11,
47
],
[
47,
48
],
[
48,
49
],
[
49,
50
],
[
49,
51
],
[
47,
52
],
[
52,
53
],
[
52,
54
],
[
54,
55
],
[
54,
56
],
[
47,
57
],
[
57,
58
],
[
58,
59
],
[
47,
60
],
[
61,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
61,
65
],
[
65,
66
],
[
66,
67
],
[
67,
68
],
[
67,
69
],
[
65,
70
],
[
70,
71
],
[
70,
72
],
[
65,
73
],
[
73,
74
],
[
74,
75
],
[
65,
76
],
[
77,
77
],
[
77,
78
],
[
78,
79
],
[
79,
80
],
[
80,
81
],
[
80,
82
],
[
79,
83
],
[
83,
84
],
[
83,
85
],
[
85,
86
],
[
85,
87
],
[
78,
88
],
[
78,
89
],
[
89,
90
],
[
90,
91
],
[
61,
92
],
[
92,
93
],
[
92,
94
],
[
94,
95
],
[
95,
96
],
[
94,
97
],
[
94,
98
],
[
11,
99
],
[
99,
100
],
[
100,
101
],
[
99,
102
],
[
11,
103
],
[
103,
104
],
[
104,
105
],
[
9,
106
],
[
106,
107
],
[
297,
108
],
[
108,
109
],
[
108,
110
],
[
110,
111
],
[
111,
112
],
[
111,
113
],
[
113,
114
],
[
113,
115
],
[
110,
116
],
[
116,
117
],
[
116,
118
],
[
110,
119
],
[
119,
120
],
[
120,
121
],
[
121,
122
],
[
121,
123
],
[
119,
124
],
[
124,
125
],
[
124,
126
],
[
119,
127
],
[
127,
128
],
[
128,
129
],
[
119,
130
],
[
131,
131
],
[
131,
132
],
[
132,
133
],
[
133,
134
],
[
134,
135
],
[
134,
136
],
[
133,
137
],
[
137,
138
],
[
137,
139
],
[
132,
140
],
[
140,
141
],
[
141,
142
],
[
141,
143
],
[
140,
144
],
[
110,
145
],
[
145,
146
],
[
108,
147
],
[
147,
148
],
[
108,
149
],
[
149,
150
],
[
297,
151
],
[
151,
152
],
[
151,
153
],
[
153,
154
],
[
154,
155
],
[
155,
156
],
[
156,
157
],
[
156,
158
],
[
155,
159
],
[
159,
160
],
[
159,
161
],
[
159,
162
],
[
151,
163
],
[
163,
164
],
[
151,
165
],
[
165,
166
],
[
297,
167
],
[
167,
168
],
[
167,
169
],
[
169,
170
],
[
170,
171
],
[
171,
172
],
[
171,
173
],
[
170,
174
],
[
174,
175
],
[
170,
176
],
[
176,
177
],
[
177,
178
],
[
177,
179
],
[
177,
180
],
[
180,
181
],
[
180,
182
],
[
167,
183
],
[
183,
184
],
[
167,
185
],
[
185,
186
],
[
297,
187
],
[
187,
188
],
[
187,
189
],
[
189,
190
],
[
189,
191
],
[
187,
192
],
[
192,
193
],
[
192,
194
],
[
187,
195
],
[
195,
196
],
[
195,
197
],
[
197,
198
],
[
198,
199
],
[
199,
200
],
[
200,
201
],
[
201,
202
],
[
198,
203
],
[
203,
204
],
[
204,
205
],
[
204,
206
],
[
206,
207
],
[
207,
208
],
[
208,
209
],
[
203,
210
],
[
210,
211
],
[
211,
212
],
[
211,
213
],
[
197,
214
],
[
214,
215
],
[
215,
216
],
[
216,
217
],
[
187,
218
],
[
218,
219
],
[
218,
220
],
[
220,
221
],
[
221,
222
],
[
222,
223
],
[
223,
224
],
[
222,
225
],
[
225,
226
],
[
187,
227
],
[
227,
228
],
[
227,
229
],
[
229,
230
],
[
230,
231
],
[
231,
232
],
[
232,
233
],
[
231,
234
],
[
234,
235
],
[
187,
236
],
[
236,
237
],
[
236,
238
],
[
238,
239
],
[
239,
240
],
[
239,
241
],
[
238,
243
],
[
243,
244
],
[
244,
245
],
[
245,
246
],
[
245,
247
],
[
243,
248
],
[
248,
249
],
[
248,
250
],
[
243,
251
],
[
251,
252
],
[
252,
253
],
[
243,
254
],
[
254,
255
],
[
255,
256
],
[
256,
257
],
[
256,
258
],
[
255,
259
],
[
259,
260
],
[
238,
261
],
[
261,
262
],
[
236,
263
],
[
263,
264
],
[
187,
265
],
[
265,
266
],
[
265,
267
],
[
267,
268
],
[
268,
269
],
[
268,
270
],
[
267,
272
],
[
272,
273
],
[
273,
274
],
[
274,
275
],
[
274,
276
],
[
272,
277
],
[
277,
278
],
[
277,
279
],
[
272,
280
],
[
280,
281
],
[
281,
282
],
[
272,
283
],
[
283,
284
],
[
284,
285
],
[
285,
286
],
[
285,
287
],
[
284,
288
],
[
288,
289
],
[
267,
290
],
[
290,
291
],
[
265,
292
],
[
292,
293
],
[
265,
294
],
[
294,
295
],
[
0,
296
],
[
296,
297
],
[
296,
298
]
]
| [
"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n FastScanner in = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n char s[] = in.next().toCharArray();\n char t[] = in.next().toCharArray();\n int n = s.length, m = t.length;\n int min = Integer.MAX_VALUE;\n for(int i=0;i<=n-m;i++) {\n \tint cnt = 0;\n \tfor(int j=0;j<m;j++) {\n \t\tif(t[j]==s[j+i]) continue;\n \t\telse {\n \t\t\tcnt++;\n \t\t}\n \t}\n \tmin = Math.min(min, cnt);\n }\n out.println(min);\n out.flush();\n\t}\n\t\n\tstatic class FastScanner {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(\"\");\n\t\t\n\t\tString next() {\n\t\t\twhile(!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t}catch(IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\t\n\t\tint[] readArray(int n) {\n\t\t\tint a[] = new int[n];\n\t\t\tfor(int i=0;i<n;i++) a[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\t\t\n\t\tlong[] readArray(int n,long x) {\n\t\t\tlong a[] = new long[n];\n\t\t\tfor(int i=0;i<n;i++) a[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\t\t\n\t}\n\t\n\tstatic boolean arrayEquals(char a[], char b[]) {\n\t\tint n = a.length;\n\t\tboolean verdict = true;\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tif(a[i]!=b[i]) {\n\t\t\t\tverdict = false;break;\n\t\t\t}\n\t\t}\n\t\treturn verdict;\n\t}\n\t\n\tstatic long lcm(long a, long b) {\n\t\treturn (a*b)/gcd(a,b);\n\t}\n\t\n\tstatic long gcd(long a, long b) {\n\t\tif(b==0) return a;\n\t\telse return gcd(b,a%b);\n\t}\n}\n\n\n\n\n\n\n",
"import java.io.*;",
"io.*",
"java",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n\n\tpublic static void main(String[] args) {\n FastScanner in = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n char s[] = in.next().toCharArray();\n char t[] = in.next().toCharArray();\n int n = s.length, m = t.length;\n int min = Integer.MAX_VALUE;\n for(int i=0;i<=n-m;i++) {\n \tint cnt = 0;\n \tfor(int j=0;j<m;j++) {\n \t\tif(t[j]==s[j+i]) continue;\n \t\telse {\n \t\t\tcnt++;\n \t\t}\n \t}\n \tmin = Math.min(min, cnt);\n }\n out.println(min);\n out.flush();\n\t}\n\t\n\tstatic class FastScanner {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(\"\");\n\t\t\n\t\tString next() {\n\t\t\twhile(!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t}catch(IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\t\n\t\tint[] readArray(int n) {\n\t\t\tint a[] = new int[n];\n\t\t\tfor(int i=0;i<n;i++) a[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\t\t\n\t\tlong[] readArray(int n,long x) {\n\t\t\tlong a[] = new long[n];\n\t\t\tfor(int i=0;i<n;i++) a[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\t\t\n\t}\n\t\n\tstatic boolean arrayEquals(char a[], char b[]) {\n\t\tint n = a.length;\n\t\tboolean verdict = true;\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tif(a[i]!=b[i]) {\n\t\t\t\tverdict = false;break;\n\t\t\t}\n\t\t}\n\t\treturn verdict;\n\t}\n\t\n\tstatic long lcm(long a, long b) {\n\t\treturn (a*b)/gcd(a,b);\n\t}\n\t\n\tstatic long gcd(long a, long b) {\n\t\tif(b==0) return a;\n\t\telse return gcd(b,a%b);\n\t}\n}",
"Main",
"public static void main(String[] args) {\n FastScanner in = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n char s[] = in.next().toCharArray();\n char t[] = in.next().toCharArray();\n int n = s.length, m = t.length;\n int min = Integer.MAX_VALUE;\n for(int i=0;i<=n-m;i++) {\n \tint cnt = 0;\n \tfor(int j=0;j<m;j++) {\n \t\tif(t[j]==s[j+i]) continue;\n \t\telse {\n \t\t\tcnt++;\n \t\t}\n \t}\n \tmin = Math.min(min, cnt);\n }\n out.println(min);\n out.flush();\n\t}",
"main",
"{\n FastScanner in = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n char s[] = in.next().toCharArray();\n char t[] = in.next().toCharArray();\n int n = s.length, m = t.length;\n int min = Integer.MAX_VALUE;\n for(int i=0;i<=n-m;i++) {\n \tint cnt = 0;\n \tfor(int j=0;j<m;j++) {\n \t\tif(t[j]==s[j+i]) continue;\n \t\telse {\n \t\t\tcnt++;\n \t\t}\n \t}\n \tmin = Math.min(min, cnt);\n }\n out.println(min);\n out.flush();\n\t}",
"FastScanner in = new FastScanner();",
"in",
"new FastScanner()",
"PrintWriter out = new PrintWriter(System.out);",
"out",
"new PrintWriter(System.out)",
"char s[] = in.next().toCharArray();",
"s",
"in.next().toCharArray()",
"in.next().toCharArray",
"in.next()",
"in.next",
"in",
"char t[] = in.next().toCharArray();",
"t",
"in.next().toCharArray()",
"in.next().toCharArray",
"in.next()",
"in.next",
"in",
"int n = s.length",
"n",
"s.length",
"s",
"s.length",
"m = t.length;",
"m",
"t.length",
"t",
"t.length",
"int min = Integer.MAX_VALUE;",
"min",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"for(int i=0;i<=n-m;i++) {\n \tint cnt = 0;\n \tfor(int j=0;j<m;j++) {\n \t\tif(t[j]==s[j+i]) continue;\n \t\telse {\n \t\t\tcnt++;\n \t\t}\n \t}\n \tmin = Math.min(min, cnt);\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<=n-m",
"i",
"n-m",
"n",
"m",
"i++",
"i++",
"i",
"{\n \tint cnt = 0;\n \tfor(int j=0;j<m;j++) {\n \t\tif(t[j]==s[j+i]) continue;\n \t\telse {\n \t\t\tcnt++;\n \t\t}\n \t}\n \tmin = Math.min(min, cnt);\n }",
"{\n \tint cnt = 0;\n \tfor(int j=0;j<m;j++) {\n \t\tif(t[j]==s[j+i]) continue;\n \t\telse {\n \t\t\tcnt++;\n \t\t}\n \t}\n \tmin = Math.min(min, cnt);\n }",
"int cnt = 0;",
"cnt",
"0",
"for(int j=0;j<m;j++) {\n \t\tif(t[j]==s[j+i]) continue;\n \t\telse {\n \t\t\tcnt++;\n \t\t}\n \t}",
"int j=0;",
"int j=0;",
"j",
"0",
"j<m",
"j",
"m",
"j++",
"j++",
"j",
"{\n \t\tif(t[j]==s[j+i]) continue;\n \t\telse {\n \t\t\tcnt++;\n \t\t}\n \t}",
"{\n \t\tif(t[j]==s[j+i]) continue;\n \t\telse {\n \t\t\tcnt++;\n \t\t}\n \t}",
"if(t[j]==s[j+i]) continue;\n \t\telse {\n \t\t\tcnt++;\n \t\t}",
"t[j]==s[j+i]",
"t[j]",
"t",
"j",
"s[j+i]",
"s",
"j+i",
"j",
"i",
"continue;",
"{\n \t\t\tcnt++;\n \t\t}",
"cnt++",
"cnt",
"min = Math.min(min, cnt)",
"min",
"Math.min(min, cnt)",
"Math.min",
"Math",
"min",
"cnt",
"out.println(min)",
"out.println",
"out",
"min",
"out.flush()",
"out.flush",
"out",
"String[] args",
"args",
"static boolean arrayEquals(char a[], char b[]) {\n\t\tint n = a.length;\n\t\tboolean verdict = true;\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tif(a[i]!=b[i]) {\n\t\t\t\tverdict = false;break;\n\t\t\t}\n\t\t}\n\t\treturn verdict;\n\t}",
"arrayEquals",
"{\n\t\tint n = a.length;\n\t\tboolean verdict = true;\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tif(a[i]!=b[i]) {\n\t\t\t\tverdict = false;break;\n\t\t\t}\n\t\t}\n\t\treturn verdict;\n\t}",
"int n = a.length;",
"n",
"a.length",
"a",
"a.length",
"boolean verdict = true;",
"verdict",
"true",
"for(int i=0;i<n;i++) {\n\t\t\tif(a[i]!=b[i]) {\n\t\t\t\tverdict = false;break;\n\t\t\t}\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\tif(a[i]!=b[i]) {\n\t\t\t\tverdict = false;break;\n\t\t\t}\n\t\t}",
"{\n\t\t\tif(a[i]!=b[i]) {\n\t\t\t\tverdict = false;break;\n\t\t\t}\n\t\t}",
"if(a[i]!=b[i]) {\n\t\t\t\tverdict = false;break;\n\t\t\t}",
"a[i]!=b[i]",
"a[i]",
"a",
"i",
"b[i]",
"b",
"i",
"{\n\t\t\t\tverdict = false;break;\n\t\t\t}",
"verdict = false",
"verdict",
"false",
"break;",
"return verdict;",
"verdict",
"char a[]",
"a",
"char b[]",
"b",
"static long lcm(long a, long b) {\n\t\treturn (a*b)/gcd(a,b);\n\t}",
"lcm",
"{\n\t\treturn (a*b)/gcd(a,b);\n\t}",
"return (a*b)/gcd(a,b);",
"(a*b)/gcd(a,b)",
"(a*b)",
"a",
"b",
"gcd(a,b)",
"gcd",
"a",
"b",
"long a",
"a",
"long b",
"b",
"static long gcd(long a, long b) {\n\t\tif(b==0) return a;\n\t\telse return gcd(b,a%b);\n\t}",
"gcd",
"{\n\t\tif(b==0) return a;\n\t\telse return gcd(b,a%b);\n\t}",
"if(b==0) return a;\n\t\telse return gcd(b,a%b);",
"b==0",
"b",
"0",
"return a;",
"a",
"return gcd(b,a%b);",
"gcd(b,a%b)",
"gcd",
"b",
"a%b",
"a",
"b",
"long a",
"a",
"long b",
"b",
"static class FastScanner {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(\"\");\n\t\t\n\t\tString next() {\n\t\t\twhile(!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t}catch(IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\t\n\t\tint[] readArray(int n) {\n\t\t\tint a[] = new int[n];\n\t\t\tfor(int i=0;i<n;i++) a[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\t\t\n\t\tlong[] readArray(int n,long x) {\n\t\t\tlong a[] = new long[n];\n\t\t\tfor(int i=0;i<n;i++) a[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\t\t\n\t}",
"FastScanner",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"StringTokenizer st = new StringTokenizer(\"\");",
"st",
"new StringTokenizer(\"\")",
"String next() {\n\t\t\twhile(!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t}catch(IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}",
"next",
"{\n\t\t\twhile(!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t}catch(IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}",
"while(!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t}catch(IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}",
"!st.hasMoreTokens()",
"st.hasMoreTokens()",
"st.hasMoreTokens",
"st",
"try {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t}catch(IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}",
"catch(IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}",
"IOException e",
"{\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t}",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}",
"nextInt",
"{\n\t\t\treturn Integer.parseInt(next());\n\t\t}",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}",
"nextLong",
"{\n\t\t\treturn Long.parseLong(next());\n\t\t}",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"int[] readArray(int n) {\n\t\t\tint a[] = new int[n];\n\t\t\tfor(int i=0;i<n;i++) a[i] = nextInt();\n\t\t\treturn a;\n\t\t}",
"readArray",
"{\n\t\t\tint a[] = new int[n];\n\t\t\tfor(int i=0;i<n;i++) a[i] = nextInt();\n\t\t\treturn a;\n\t\t}",
"int a[] = new int[n];",
"a",
"new int[n]",
"n",
"for(int i=0;i<n;i++) a[i] = nextInt();",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"a[i] = nextInt();",
"a[i] = nextInt()",
"a[i]",
"a",
"i",
"nextInt()",
"nextInt",
"return a;",
"a",
"int n",
"n",
"long[] readArray(int n,long x) {\n\t\t\tlong a[] = new long[n];\n\t\t\tfor(int i=0;i<n;i++) a[i] = nextLong();\n\t\t\treturn a;\n\t\t}",
"readArray",
"{\n\t\t\tlong a[] = new long[n];\n\t\t\tfor(int i=0;i<n;i++) a[i] = nextLong();\n\t\t\treturn a;\n\t\t}",
"long a[] = new long[n];",
"a",
"new long[n]",
"n",
"for(int i=0;i<n;i++) a[i] = nextLong();",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"a[i] = nextLong();",
"a[i] = nextLong()",
"a[i]",
"a",
"i",
"nextLong()",
"nextLong",
"return a;",
"a",
"int n",
"n",
"long x",
"x",
"public class Main {\n\n\tpublic static void main(String[] args) {\n FastScanner in = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n char s[] = in.next().toCharArray();\n char t[] = in.next().toCharArray();\n int n = s.length, m = t.length;\n int min = Integer.MAX_VALUE;\n for(int i=0;i<=n-m;i++) {\n \tint cnt = 0;\n \tfor(int j=0;j<m;j++) {\n \t\tif(t[j]==s[j+i]) continue;\n \t\telse {\n \t\t\tcnt++;\n \t\t}\n \t}\n \tmin = Math.min(min, cnt);\n }\n out.println(min);\n out.flush();\n\t}\n\t\n\tstatic class FastScanner {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(\"\");\n\t\t\n\t\tString next() {\n\t\t\twhile(!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t}catch(IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\t\n\t\tint[] readArray(int n) {\n\t\t\tint a[] = new int[n];\n\t\t\tfor(int i=0;i<n;i++) a[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\t\t\n\t\tlong[] readArray(int n,long x) {\n\t\t\tlong a[] = new long[n];\n\t\t\tfor(int i=0;i<n;i++) a[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\t\t\n\t}\n\t\n\tstatic boolean arrayEquals(char a[], char b[]) {\n\t\tint n = a.length;\n\t\tboolean verdict = true;\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tif(a[i]!=b[i]) {\n\t\t\t\tverdict = false;break;\n\t\t\t}\n\t\t}\n\t\treturn verdict;\n\t}\n\t\n\tstatic long lcm(long a, long b) {\n\t\treturn (a*b)/gcd(a,b);\n\t}\n\t\n\tstatic long gcd(long a, long b) {\n\t\tif(b==0) return a;\n\t\telse return gcd(b,a%b);\n\t}\n}",
"public class Main {\n\n\tpublic static void main(String[] args) {\n FastScanner in = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n char s[] = in.next().toCharArray();\n char t[] = in.next().toCharArray();\n int n = s.length, m = t.length;\n int min = Integer.MAX_VALUE;\n for(int i=0;i<=n-m;i++) {\n \tint cnt = 0;\n \tfor(int j=0;j<m;j++) {\n \t\tif(t[j]==s[j+i]) continue;\n \t\telse {\n \t\t\tcnt++;\n \t\t}\n \t}\n \tmin = Math.min(min, cnt);\n }\n out.println(min);\n out.flush();\n\t}\n\t\n\tstatic class FastScanner {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(\"\");\n\t\t\n\t\tString next() {\n\t\t\twhile(!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t}catch(IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\t\n\t\tint[] readArray(int n) {\n\t\t\tint a[] = new int[n];\n\t\t\tfor(int i=0;i<n;i++) a[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\t\t\n\t\tlong[] readArray(int n,long x) {\n\t\t\tlong a[] = new long[n];\n\t\t\tfor(int i=0;i<n;i++) a[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\t\t\n\t}\n\t\n\tstatic boolean arrayEquals(char a[], char b[]) {\n\t\tint n = a.length;\n\t\tboolean verdict = true;\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tif(a[i]!=b[i]) {\n\t\t\t\tverdict = false;break;\n\t\t\t}\n\t\t}\n\t\treturn verdict;\n\t}\n\t\n\tstatic long lcm(long a, long b) {\n\t\treturn (a*b)/gcd(a,b);\n\t}\n\t\n\tstatic long gcd(long a, long b) {\n\t\tif(b==0) return a;\n\t\telse return gcd(b,a%b);\n\t}\n}",
"Main"
]
| import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
FastScanner in = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
char s[] = in.next().toCharArray();
char t[] = in.next().toCharArray();
int n = s.length, m = t.length;
int min = Integer.MAX_VALUE;
for(int i=0;i<=n-m;i++) {
int cnt = 0;
for(int j=0;j<m;j++) {
if(t[j]==s[j+i]) continue;
else {
cnt++;
}
}
min = Math.min(min, cnt);
}
out.println(min);
out.flush();
}
static class FastScanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
String next() {
while(!st.hasMoreTokens())
try {
st = new StringTokenizer(br.readLine());
}catch(IOException e) {
e.printStackTrace();
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
int[] readArray(int n) {
int a[] = new int[n];
for(int i=0;i<n;i++) a[i] = nextInt();
return a;
}
long[] readArray(int n,long x) {
long a[] = new long[n];
for(int i=0;i<n;i++) a[i] = nextLong();
return a;
}
}
static boolean arrayEquals(char a[], char b[]) {
int n = a.length;
boolean verdict = true;
for(int i=0;i<n;i++) {
if(a[i]!=b[i]) {
verdict = false;break;
}
}
return verdict;
}
static long lcm(long a, long b) {
return (a*b)/gcd(a,b);
}
static long gcd(long a, long b) {
if(b==0) return a;
else return gcd(b,a%b);
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
2,
17,
17,
41,
13,
41,
13,
12,
13,
30,
41,
13,
4,
18,
4,
13,
41,
13,
4,
18,
4,
13,
41,
13,
18,
13,
13,
41,
13,
18,
13,
13,
41,
13,
17,
41,
13,
17,
11,
1,
41,
13,
17,
2,
2,
2,
13,
13,
17,
13,
1,
40,
13,
30,
30,
0,
13,
17,
11,
1,
41,
13,
17,
41,
13,
13,
2,
2,
13,
13,
2,
13,
13,
1,
40,
13,
40,
13,
30,
30,
14,
2,
18,
13,
13,
18,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
13,
13,
23,
13,
12,
13,
30,
0,
13,
20,
0,
13,
20,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
4,
13,
13,
4,
18,
13,
4,
18,
18,
13,
13,
2,
2,
4,
18,
13,
13,
17,
23,
13,
12,
13,
30,
4,
18,
18,
13,
13,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
23,
13,
12,
13,
30,
29,
4,
18,
13,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
12,
13,
30,
29,
8,
2,
13,
17,
13,
4,
13,
13,
2,
13,
13,
23,
13,
23,
13,
12,
13,
30,
29,
8,
2,
13,
17,
13,
4,
13,
13,
2,
13,
13,
23,
13,
23,
13,
12,
13,
30,
29,
8,
2,
13,
17,
17,
2,
17,
4,
13,
2,
13,
2,
13,
17,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
41,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
29,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
354,
11
],
[
354,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
14,
16
],
[
354,
17
],
[
17,
18
],
[
354,
19
],
[
19,
20
],
[
354,
21
],
[
21,
22
],
[
21,
23
],
[
23,
24
],
[
24,
25
],
[
24,
26
],
[
26,
27
],
[
27,
28
],
[
28,
29
],
[
23,
30
],
[
30,
31
],
[
30,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
23,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
38,
40
],
[
23,
41
],
[
41,
42
],
[
41,
43
],
[
43,
44
],
[
43,
45
],
[
23,
46
],
[
46,
47
],
[
46,
48
],
[
23,
49
],
[
49,
50
],
[
49,
51
],
[
23,
52
],
[
52,
53
],
[
53,
54
],
[
54,
55
],
[
54,
56
],
[
52,
57
],
[
57,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
58,
62
],
[
57,
63
],
[
52,
64
],
[
64,
65
],
[
65,
66
],
[
52,
67
],
[
68,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
68,
72
],
[
72,
73
],
[
73,
74
],
[
74,
75
],
[
74,
76
],
[
73,
77
],
[
77,
78
],
[
77,
79
],
[
72,
80
],
[
80,
81
],
[
81,
82
],
[
81,
83
],
[
80,
84
],
[
84,
85
],
[
84,
86
],
[
72,
87
],
[
87,
88
],
[
88,
89
],
[
87,
90
],
[
90,
91
],
[
72,
92
],
[
93,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
96,
97
],
[
96,
98
],
[
95,
99
],
[
99,
100
],
[
99,
101
],
[
94,
102
],
[
102,
103
],
[
68,
104
],
[
104,
105
],
[
104,
106
],
[
106,
107
],
[
107,
108
],
[
106,
109
],
[
106,
110
],
[
23,
111
],
[
111,
112
],
[
111,
113
],
[
21,
114
],
[
114,
115
],
[
354,
116
],
[
116,
117
],
[
116,
118
],
[
118,
119
],
[
119,
120
],
[
119,
121
],
[
118,
122
],
[
122,
123
],
[
122,
124
],
[
118,
125
],
[
125,
126
],
[
125,
127
],
[
127,
128
],
[
128,
129
],
[
118,
130
],
[
130,
131
],
[
130,
132
],
[
118,
133
],
[
133,
134
],
[
134,
135
],
[
135,
136
],
[
135,
137
],
[
133,
138
],
[
138,
139
],
[
138,
140
],
[
133,
141
],
[
141,
142
],
[
142,
143
],
[
133,
144
],
[
144,
145
],
[
145,
146
],
[
145,
147
],
[
118,
148
],
[
148,
149
],
[
149,
150
],
[
118,
151
],
[
151,
152
],
[
152,
153
],
[
153,
154
],
[
153,
155
],
[
151,
156
],
[
156,
157
],
[
157,
158
],
[
158,
159
],
[
159,
160
],
[
157,
161
],
[
156,
162
],
[
116,
163
],
[
163,
164
],
[
354,
165
],
[
165,
166
],
[
165,
167
],
[
167,
168
],
[
168,
169
],
[
169,
170
],
[
170,
171
],
[
170,
172
],
[
168,
173
],
[
173,
174
],
[
174,
175
],
[
173,
176
],
[
165,
177
],
[
177,
178
],
[
354,
179
],
[
179,
180
],
[
179,
181
],
[
181,
182
],
[
182,
183
],
[
183,
184
],
[
182,
185
],
[
179,
186
],
[
186,
187
],
[
354,
188
],
[
188,
189
],
[
188,
190
],
[
190,
191
],
[
191,
192
],
[
192,
193
],
[
191,
194
],
[
188,
195
],
[
195,
196
],
[
354,
197
],
[
197,
198
],
[
197,
199
],
[
199,
200
],
[
200,
201
],
[
201,
202
],
[
202,
203
],
[
201,
204
],
[
204,
205
],
[
205,
206
],
[
354,
207
],
[
207,
208
],
[
207,
209
],
[
209,
210
],
[
210,
211
],
[
211,
212
],
[
212,
213
],
[
211,
214
],
[
214,
215
],
[
215,
216
],
[
354,
217
],
[
217,
218
],
[
217,
219
],
[
219,
220
],
[
220,
221
],
[
221,
222
],
[
222,
223
],
[
221,
224
],
[
224,
225
],
[
225,
226
],
[
354,
227
],
[
227,
228
],
[
227,
229
],
[
229,
230
],
[
230,
231
],
[
231,
232
],
[
232,
233
],
[
354,
234
],
[
234,
235
],
[
234,
236
],
[
236,
237
],
[
237,
238
],
[
238,
239
],
[
239,
240
],
[
239,
241
],
[
238,
242
],
[
238,
243
],
[
243,
244
],
[
243,
245
],
[
243,
246
],
[
246,
247
],
[
246,
248
],
[
234,
249
],
[
249,
250
],
[
234,
251
],
[
251,
252
],
[
354,
253
],
[
253,
254
],
[
253,
255
],
[
255,
256
],
[
256,
257
],
[
257,
258
],
[
258,
259
],
[
258,
260
],
[
257,
261
],
[
257,
262
],
[
262,
263
],
[
262,
264
],
[
262,
265
],
[
265,
266
],
[
265,
267
],
[
253,
268
],
[
268,
269
],
[
253,
270
],
[
270,
271
],
[
354,
272
],
[
272,
273
],
[
272,
274
],
[
274,
275
],
[
275,
276
],
[
276,
277
],
[
277,
278
],
[
277,
279
],
[
276,
280
],
[
276,
281
],
[
281,
282
],
[
281,
283
],
[
283,
284
],
[
283,
285
],
[
285,
286
],
[
285,
287
],
[
287,
288
],
[
287,
289
],
[
272,
290
],
[
290,
291
],
[
354,
292
],
[
292,
293
],
[
292,
294
],
[
294,
295
],
[
292,
296
],
[
296,
297
],
[
292,
298
],
[
298,
299
],
[
298,
300
],
[
300,
301
],
[
301,
302
],
[
301,
303
],
[
292,
304
],
[
304,
305
],
[
304,
306
],
[
306,
307
],
[
307,
308
],
[
308,
309
],
[
309,
310
],
[
309,
311
],
[
308,
312
],
[
312,
313
],
[
313,
314
],
[
314,
315
],
[
307,
316
],
[
316,
317
],
[
317,
318
],
[
318,
319
],
[
318,
320
],
[
320,
321
],
[
321,
322
],
[
322,
323
],
[
317,
324
],
[
324,
325
],
[
325,
326
],
[
325,
327
],
[
306,
328
],
[
328,
329
],
[
329,
330
],
[
330,
331
],
[
292,
332
],
[
332,
333
],
[
332,
334
],
[
334,
335
],
[
335,
336
],
[
335,
337
],
[
334,
338
],
[
338,
339
],
[
339,
340
],
[
339,
341
],
[
341,
342
],
[
342,
343
],
[
343,
344
],
[
338,
345
],
[
345,
346
],
[
346,
347
],
[
346,
348
],
[
348,
349
],
[
349,
350
],
[
334,
351
],
[
351,
352
],
[
0,
353
],
[
353,
354
],
[
353,
355
]
]
| [
"import java.util.*;\nimport java.io.*;\nimport java.math.*;\n \npublic class Main\n{\n public static void process(int test_number)throws IOException\n {\n char s[] = nln().toCharArray(), t[] = nln().toCharArray();\n int n = s.length, m = t.length;\n int res = 123456, cnt = 0;\n\n for(int i = 0; i + m - 1 < n; i++){\n cnt = 0;\n for(int j = 0, k = i; j < m && k < n; j++, k++){\n if(s[k] != t[j])\n cnt++;\n }\n\n res = Math.min(res, cnt);\n } \n\n pn(res);\n }\n \n static final long mod = (long)1e9+7l;\n \n static FastReader sc;\n static PrintWriter out;\n public static void main(String[]args)throws IOException\n {\n out = new PrintWriter(System.out);\n sc = new FastReader();\n \n long s = System.currentTimeMillis();\n int t = 1;\n //t = ni();\n for(int i = 1; i <= t; i++)\n process(i);\n \n out.flush();\n System.err.println(System.currentTimeMillis()-s+\"ms\");\n }\n\n static void trace(Object... o){ System.err.println(Arrays.deepToString(o)); };\n static void pn(Object o){ out.println(o); }\n static void p(Object o){ out.print(o); }\n static int ni()throws IOException{ return Integer.parseInt(sc.next()); }\n static long nl()throws IOException{ return Long.parseLong(sc.next()); }\n static double nd()throws IOException{ return Double.parseDouble(sc.next()); }\n static String nln()throws IOException{ return sc.nextLine(); }\n static long gcd(long a, long b)throws IOException{ return (b==0)?a:gcd(b,a%b);}\n static int gcd(int a, int b)throws IOException{ return (b==0)?a:gcd(b,a%b); }\n static int bit(long n)throws IOException{ return (n==0)?0:(1+bit(n&(n-1))); }\n \n static class FastReader{ \n BufferedReader br; \n StringTokenizer st; \n \n public FastReader(){ \n br = new BufferedReader(new InputStreamReader(System.in)); \n } \n \n String next(){ \n while (st == null || !st.hasMoreElements()){ \n try{ st = new StringTokenizer(br.readLine()); } catch (IOException e){ e.printStackTrace(); } \n } \n return st.nextToken(); \n } \n \n String nextLine(){ \n String str = \"\"; \n try{ str = br.readLine(); } catch (IOException e) { e.printStackTrace(); } \n return str; \n } \n } \n}",
"import java.util.*;",
"util.*",
"java",
"import java.io.*;",
"io.*",
"java",
"import java.math.*;",
"math.*",
"java",
"public class Main\n{\n public static void process(int test_number)throws IOException\n {\n char s[] = nln().toCharArray(), t[] = nln().toCharArray();\n int n = s.length, m = t.length;\n int res = 123456, cnt = 0;\n\n for(int i = 0; i + m - 1 < n; i++){\n cnt = 0;\n for(int j = 0, k = i; j < m && k < n; j++, k++){\n if(s[k] != t[j])\n cnt++;\n }\n\n res = Math.min(res, cnt);\n } \n\n pn(res);\n }\n \n static final long mod = (long)1e9+7l;\n \n static FastReader sc;\n static PrintWriter out;\n public static void main(String[]args)throws IOException\n {\n out = new PrintWriter(System.out);\n sc = new FastReader();\n \n long s = System.currentTimeMillis();\n int t = 1;\n //t = ni();\n for(int i = 1; i <= t; i++)\n process(i);\n \n out.flush();\n System.err.println(System.currentTimeMillis()-s+\"ms\");\n }\n\n static void trace(Object... o){ System.err.println(Arrays.deepToString(o)); };\n static void pn(Object o){ out.println(o); }\n static void p(Object o){ out.print(o); }\n static int ni()throws IOException{ return Integer.parseInt(sc.next()); }\n static long nl()throws IOException{ return Long.parseLong(sc.next()); }\n static double nd()throws IOException{ return Double.parseDouble(sc.next()); }\n static String nln()throws IOException{ return sc.nextLine(); }\n static long gcd(long a, long b)throws IOException{ return (b==0)?a:gcd(b,a%b);}\n static int gcd(int a, int b)throws IOException{ return (b==0)?a:gcd(b,a%b); }\n static int bit(long n)throws IOException{ return (n==0)?0:(1+bit(n&(n-1))); }\n \n static class FastReader{ \n BufferedReader br; \n StringTokenizer st; \n \n public FastReader(){ \n br = new BufferedReader(new InputStreamReader(System.in)); \n } \n \n String next(){ \n while (st == null || !st.hasMoreElements()){ \n try{ st = new StringTokenizer(br.readLine()); } catch (IOException e){ e.printStackTrace(); } \n } \n return st.nextToken(); \n } \n \n String nextLine(){ \n String str = \"\"; \n try{ str = br.readLine(); } catch (IOException e) { e.printStackTrace(); } \n return str; \n } \n } \n}",
"Main",
"static final long mod = (long)1e9+7l;",
"mod",
"(long)1e9+7l",
"(long)1e9",
"7l",
"static FastReader sc;",
"sc",
"static PrintWriter out;",
"out",
"public static void process(int test_number)throws IOException\n {\n char s[] = nln().toCharArray(), t[] = nln().toCharArray();\n int n = s.length, m = t.length;\n int res = 123456, cnt = 0;\n\n for(int i = 0; i + m - 1 < n; i++){\n cnt = 0;\n for(int j = 0, k = i; j < m && k < n; j++, k++){\n if(s[k] != t[j])\n cnt++;\n }\n\n res = Math.min(res, cnt);\n } \n\n pn(res);\n }",
"process",
"{\n char s[] = nln().toCharArray(), t[] = nln().toCharArray();\n int n = s.length, m = t.length;\n int res = 123456, cnt = 0;\n\n for(int i = 0; i + m - 1 < n; i++){\n cnt = 0;\n for(int j = 0, k = i; j < m && k < n; j++, k++){\n if(s[k] != t[j])\n cnt++;\n }\n\n res = Math.min(res, cnt);\n } \n\n pn(res);\n }",
"char s[] = nln().toCharArray()",
"s",
"nln().toCharArray()",
"nln().toCharArray",
"nln()",
"nln",
"t[] = nln().toCharArray();",
"t",
"nln().toCharArray()",
"nln().toCharArray",
"nln()",
"nln",
"int n = s.length",
"n",
"s.length",
"s",
"s.length",
"m = t.length;",
"m",
"t.length",
"t",
"t.length",
"int res = 123456",
"res",
"123456",
"cnt = 0;",
"cnt",
"0",
"for(int i = 0; i + m - 1 < n; i++){\n cnt = 0;\n for(int j = 0, k = i; j < m && k < n; j++, k++){\n if(s[k] != t[j])\n cnt++;\n }\n\n res = Math.min(res, cnt);\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i + m - 1 < n",
"i + m - 1",
"i + m",
"i",
"m",
"1",
"n",
"i++",
"i++",
"i",
"{\n cnt = 0;\n for(int j = 0, k = i; j < m && k < n; j++, k++){\n if(s[k] != t[j])\n cnt++;\n }\n\n res = Math.min(res, cnt);\n }",
"{\n cnt = 0;\n for(int j = 0, k = i; j < m && k < n; j++, k++){\n if(s[k] != t[j])\n cnt++;\n }\n\n res = Math.min(res, cnt);\n }",
"cnt = 0",
"cnt",
"0",
"for(int j = 0, k = i; j < m && k < n; j++, k++){\n if(s[k] != t[j])\n cnt++;\n }",
"int j = 0, k = i;",
"int j = 0",
"j",
"0",
"k = i;",
"k",
"i",
"j < m && k < n",
"j < m",
"j",
"m",
"k < n",
"k",
"n",
"j++, k++",
"j++",
"j",
"k++",
"k",
"{\n if(s[k] != t[j])\n cnt++;\n }",
"{\n if(s[k] != t[j])\n cnt++;\n }",
"if(s[k] != t[j])\n cnt++;",
"s[k] != t[j]",
"s[k]",
"s",
"k",
"t[j]",
"t",
"j",
"cnt++",
"cnt",
"res = Math.min(res, cnt)",
"res",
"Math.min(res, cnt)",
"Math.min",
"Math",
"res",
"cnt",
"pn(res)",
"pn",
"res",
"int test_number",
"test_number",
"public static void main(String[]args)throws IOException\n {\n out = new PrintWriter(System.out);\n sc = new FastReader();\n \n long s = System.currentTimeMillis();\n int t = 1;\n //t = ni();\n for(int i = 1; i <= t; i++)\n process(i);\n \n out.flush();\n System.err.println(System.currentTimeMillis()-s+\"ms\");\n }",
"main",
"{\n out = new PrintWriter(System.out);\n sc = new FastReader();\n \n long s = System.currentTimeMillis();\n int t = 1;\n //t = ni();\n for(int i = 1; i <= t; i++)\n process(i);\n \n out.flush();\n System.err.println(System.currentTimeMillis()-s+\"ms\");\n }",
"out = new PrintWriter(System.out)",
"out",
"new PrintWriter(System.out)",
"sc = new FastReader()",
"sc",
"new FastReader()",
"long s = System.currentTimeMillis();",
"s",
"System.currentTimeMillis()",
"System.currentTimeMillis",
"System",
"int t = 1;",
"t",
"1",
"for(int i = 1; i <= t; i++)\n process(i);",
"int i = 1;",
"int i = 1;",
"i",
"1",
"i <= t",
"i",
"t",
"i++",
"i++",
"i",
"process(i);",
"process(i)",
"process",
"i",
"out.flush()",
"out.flush",
"out",
"System.err.println(System.currentTimeMillis()-s+\"ms\")",
"System.err.println",
"System.err",
"System",
"System.err",
"System.currentTimeMillis()-s+\"ms\"",
"System.currentTimeMillis()-s",
"System.currentTimeMillis()",
"System.currentTimeMillis",
"System",
"s",
"\"ms\"",
"String[]args",
"args",
"static void trace(Object... o){ System.err.println(Arrays.deepToString(o)); }",
"trace",
"{ System.err.println(Arrays.deepToString(o)); }",
"System.err.println(Arrays.deepToString(o))",
"System.err.println",
"System.err",
"System",
"System.err",
"Arrays.deepToString(o)",
"Arrays.deepToString",
"Arrays",
"o",
"Object... o",
"o",
"static void pn(Object o){ out.println(o); }",
"pn",
"{ out.println(o); }",
"out.println(o)",
"out.println",
"out",
"o",
"Object o",
"o",
"static void p(Object o){ out.print(o); }",
"p",
"{ out.print(o); }",
"out.print(o)",
"out.print",
"out",
"o",
"Object o",
"o",
"static int ni()throws IOException{ return Integer.parseInt(sc.next()); }",
"ni",
"{ return Integer.parseInt(sc.next()); }",
"return Integer.parseInt(sc.next());",
"Integer.parseInt(sc.next())",
"Integer.parseInt",
"Integer",
"sc.next()",
"sc.next",
"sc",
"static long nl()throws IOException{ return Long.parseLong(sc.next()); }",
"nl",
"{ return Long.parseLong(sc.next()); }",
"return Long.parseLong(sc.next());",
"Long.parseLong(sc.next())",
"Long.parseLong",
"Long",
"sc.next()",
"sc.next",
"sc",
"static double nd()throws IOException{ return Double.parseDouble(sc.next()); }",
"nd",
"{ return Double.parseDouble(sc.next()); }",
"return Double.parseDouble(sc.next());",
"Double.parseDouble(sc.next())",
"Double.parseDouble",
"Double",
"sc.next()",
"sc.next",
"sc",
"static String nln()throws IOException{ return sc.nextLine(); }",
"nln",
"{ return sc.nextLine(); }",
"return sc.nextLine();",
"sc.nextLine()",
"sc.nextLine",
"sc",
"static long gcd(long a, long b)throws IOException{ return (b==0)?a:gcd(b,a%b);}",
"gcd",
"{ return (b==0)?a:gcd(b,a%b);}",
"return (b==0)?a:gcd(b,a%b);",
"(b==0)?a:gcd(b,a%b)",
"(b==0)",
"b",
"0",
"a",
"gcd(b,a%b)",
"gcd",
"b",
"a%b",
"a",
"b",
"long a",
"a",
"long b",
"b",
"static int gcd(int a, int b)throws IOException{ return (b==0)?a:gcd(b,a%b); }",
"gcd",
"{ return (b==0)?a:gcd(b,a%b); }",
"return (b==0)?a:gcd(b,a%b);",
"(b==0)?a:gcd(b,a%b)",
"(b==0)",
"b",
"0",
"a",
"gcd(b,a%b)",
"gcd",
"b",
"a%b",
"a",
"b",
"int a",
"a",
"int b",
"b",
"static int bit(long n)throws IOException{ return (n==0)?0:(1+bit(n&(n-1))); }",
"bit",
"{ return (n==0)?0:(1+bit(n&(n-1))); }",
"return (n==0)?0:(1+bit(n&(n-1)));",
"(n==0)?0:(1+bit(n&(n-1)))",
"(n==0)",
"n",
"0",
"0",
"(1+bit(n&(n-1)))",
"1",
"bit(n&(n-1))",
"bit",
"n&(n-1)",
"n",
"(n-1)",
"n",
"1",
"long n",
"n",
"static class FastReader{ \n BufferedReader br; \n StringTokenizer st; \n \n public FastReader(){ \n br = new BufferedReader(new InputStreamReader(System.in)); \n } \n \n String next(){ \n while (st == null || !st.hasMoreElements()){ \n try{ st = new StringTokenizer(br.readLine()); } catch (IOException e){ e.printStackTrace(); } \n } \n return st.nextToken(); \n } \n \n String nextLine(){ \n String str = \"\"; \n try{ str = br.readLine(); } catch (IOException e) { e.printStackTrace(); } \n return str; \n } \n }",
"FastReader",
"BufferedReader br;",
"br",
"StringTokenizer st;",
"st",
"public FastReader(){ \n br = new BufferedReader(new InputStreamReader(System.in)); \n }",
"FastReader",
"{ \n br = new BufferedReader(new InputStreamReader(System.in)); \n }",
"br = new BufferedReader(new InputStreamReader(System.in))",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"String next(){ \n while (st == null || !st.hasMoreElements()){ \n try{ st = new StringTokenizer(br.readLine()); } catch (IOException e){ e.printStackTrace(); } \n } \n return st.nextToken(); \n }",
"next",
"{ \n while (st == null || !st.hasMoreElements()){ \n try{ st = new StringTokenizer(br.readLine()); } catch (IOException e){ e.printStackTrace(); } \n } \n return st.nextToken(); \n }",
"while (st == null || !st.hasMoreElements()){ \n try{ st = new StringTokenizer(br.readLine()); } catch (IOException e){ e.printStackTrace(); } \n }",
"st == null || !st.hasMoreElements()",
"st == null",
"st",
"null",
"!st.hasMoreElements()",
"st.hasMoreElements()",
"st.hasMoreElements",
"st",
"{ \n try{ st = new StringTokenizer(br.readLine()); } catch (IOException e){ e.printStackTrace(); } \n }",
"try{ st = new StringTokenizer(br.readLine()); } catch (IOException e){ e.printStackTrace(); }",
"catch (IOException e){ e.printStackTrace(); }",
"IOException e",
"{ e.printStackTrace(); }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{ st = new StringTokenizer(br.readLine()); }",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"String nextLine(){ \n String str = \"\"; \n try{ str = br.readLine(); } catch (IOException e) { e.printStackTrace(); } \n return str; \n }",
"nextLine",
"{ \n String str = \"\"; \n try{ str = br.readLine(); } catch (IOException e) { e.printStackTrace(); } \n return str; \n }",
"String str = \"\";",
"str",
"\"\"",
"try{ str = br.readLine(); } catch (IOException e) { e.printStackTrace(); }",
"catch (IOException e) { e.printStackTrace(); }",
"IOException e",
"{ e.printStackTrace(); }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{ str = br.readLine(); }",
"str = br.readLine()",
"str",
"br.readLine()",
"br.readLine",
"br",
"return str;",
"str",
"public class Main\n{\n public static void process(int test_number)throws IOException\n {\n char s[] = nln().toCharArray(), t[] = nln().toCharArray();\n int n = s.length, m = t.length;\n int res = 123456, cnt = 0;\n\n for(int i = 0; i + m - 1 < n; i++){\n cnt = 0;\n for(int j = 0, k = i; j < m && k < n; j++, k++){\n if(s[k] != t[j])\n cnt++;\n }\n\n res = Math.min(res, cnt);\n } \n\n pn(res);\n }\n \n static final long mod = (long)1e9+7l;\n \n static FastReader sc;\n static PrintWriter out;\n public static void main(String[]args)throws IOException\n {\n out = new PrintWriter(System.out);\n sc = new FastReader();\n \n long s = System.currentTimeMillis();\n int t = 1;\n //t = ni();\n for(int i = 1; i <= t; i++)\n process(i);\n \n out.flush();\n System.err.println(System.currentTimeMillis()-s+\"ms\");\n }\n\n static void trace(Object... o){ System.err.println(Arrays.deepToString(o)); };\n static void pn(Object o){ out.println(o); }\n static void p(Object o){ out.print(o); }\n static int ni()throws IOException{ return Integer.parseInt(sc.next()); }\n static long nl()throws IOException{ return Long.parseLong(sc.next()); }\n static double nd()throws IOException{ return Double.parseDouble(sc.next()); }\n static String nln()throws IOException{ return sc.nextLine(); }\n static long gcd(long a, long b)throws IOException{ return (b==0)?a:gcd(b,a%b);}\n static int gcd(int a, int b)throws IOException{ return (b==0)?a:gcd(b,a%b); }\n static int bit(long n)throws IOException{ return (n==0)?0:(1+bit(n&(n-1))); }\n \n static class FastReader{ \n BufferedReader br; \n StringTokenizer st; \n \n public FastReader(){ \n br = new BufferedReader(new InputStreamReader(System.in)); \n } \n \n String next(){ \n while (st == null || !st.hasMoreElements()){ \n try{ st = new StringTokenizer(br.readLine()); } catch (IOException e){ e.printStackTrace(); } \n } \n return st.nextToken(); \n } \n \n String nextLine(){ \n String str = \"\"; \n try{ str = br.readLine(); } catch (IOException e) { e.printStackTrace(); } \n return str; \n } \n } \n}",
"public class Main\n{\n public static void process(int test_number)throws IOException\n {\n char s[] = nln().toCharArray(), t[] = nln().toCharArray();\n int n = s.length, m = t.length;\n int res = 123456, cnt = 0;\n\n for(int i = 0; i + m - 1 < n; i++){\n cnt = 0;\n for(int j = 0, k = i; j < m && k < n; j++, k++){\n if(s[k] != t[j])\n cnt++;\n }\n\n res = Math.min(res, cnt);\n } \n\n pn(res);\n }\n \n static final long mod = (long)1e9+7l;\n \n static FastReader sc;\n static PrintWriter out;\n public static void main(String[]args)throws IOException\n {\n out = new PrintWriter(System.out);\n sc = new FastReader();\n \n long s = System.currentTimeMillis();\n int t = 1;\n //t = ni();\n for(int i = 1; i <= t; i++)\n process(i);\n \n out.flush();\n System.err.println(System.currentTimeMillis()-s+\"ms\");\n }\n\n static void trace(Object... o){ System.err.println(Arrays.deepToString(o)); };\n static void pn(Object o){ out.println(o); }\n static void p(Object o){ out.print(o); }\n static int ni()throws IOException{ return Integer.parseInt(sc.next()); }\n static long nl()throws IOException{ return Long.parseLong(sc.next()); }\n static double nd()throws IOException{ return Double.parseDouble(sc.next()); }\n static String nln()throws IOException{ return sc.nextLine(); }\n static long gcd(long a, long b)throws IOException{ return (b==0)?a:gcd(b,a%b);}\n static int gcd(int a, int b)throws IOException{ return (b==0)?a:gcd(b,a%b); }\n static int bit(long n)throws IOException{ return (n==0)?0:(1+bit(n&(n-1))); }\n \n static class FastReader{ \n BufferedReader br; \n StringTokenizer st; \n \n public FastReader(){ \n br = new BufferedReader(new InputStreamReader(System.in)); \n } \n \n String next(){ \n while (st == null || !st.hasMoreElements()){ \n try{ st = new StringTokenizer(br.readLine()); } catch (IOException e){ e.printStackTrace(); } \n } \n return st.nextToken(); \n } \n \n String nextLine(){ \n String str = \"\"; \n try{ str = br.readLine(); } catch (IOException e) { e.printStackTrace(); } \n return str; \n } \n } \n}",
"Main"
]
| import java.util.*;
import java.io.*;
import java.math.*;
public class Main
{
public static void process(int test_number)throws IOException
{
char s[] = nln().toCharArray(), t[] = nln().toCharArray();
int n = s.length, m = t.length;
int res = 123456, cnt = 0;
for(int i = 0; i + m - 1 < n; i++){
cnt = 0;
for(int j = 0, k = i; j < m && k < n; j++, k++){
if(s[k] != t[j])
cnt++;
}
res = Math.min(res, cnt);
}
pn(res);
}
static final long mod = (long)1e9+7l;
static FastReader sc;
static PrintWriter out;
public static void main(String[]args)throws IOException
{
out = new PrintWriter(System.out);
sc = new FastReader();
long s = System.currentTimeMillis();
int t = 1;
//t = ni();
for(int i = 1; i <= t; i++)
process(i);
out.flush();
System.err.println(System.currentTimeMillis()-s+"ms");
}
static void trace(Object... o){ System.err.println(Arrays.deepToString(o)); };
static void pn(Object o){ out.println(o); }
static void p(Object o){ out.print(o); }
static int ni()throws IOException{ return Integer.parseInt(sc.next()); }
static long nl()throws IOException{ return Long.parseLong(sc.next()); }
static double nd()throws IOException{ return Double.parseDouble(sc.next()); }
static String nln()throws IOException{ return sc.nextLine(); }
static long gcd(long a, long b)throws IOException{ return (b==0)?a:gcd(b,a%b);}
static int gcd(int a, int b)throws IOException{ return (b==0)?a:gcd(b,a%b); }
static int bit(long n)throws IOException{ return (n==0)?0:(1+bit(n&(n-1))); }
static class FastReader{
BufferedReader br;
StringTokenizer st;
public FastReader(){
br = new BufferedReader(new InputStreamReader(System.in));
}
String next(){
while (st == null || !st.hasMoreElements()){
try{ st = new StringTokenizer(br.readLine()); } catch (IOException e){ e.printStackTrace(); }
}
return st.nextToken();
}
String nextLine(){
String str = "";
try{ str = br.readLine(); } catch (IOException e) { e.printStackTrace(); }
return str;
}
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
20,
4,
18,
13,
41,
13,
20,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
13,
14,
2,
4,
18,
13,
4,
18,
13,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
13,
18,
13,
13,
30,
40,
13,
4,
18,
18,
13,
13,
2,
4,
18,
13,
13,
29,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
2,
13,
13,
18,
13,
13,
30,
40,
13,
14,
2,
13,
13,
0,
13,
13,
4,
18,
18,
13,
13,
2,
4,
18,
13,
13,
23,
13,
10,
6,
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
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
25,
26
],
[
26,
27
],
[
8,
28
],
[
28,
29
],
[
28,
30
],
[
31,
32
],
[
32,
33
],
[
8,
34
],
[
34,
35
],
[
34,
36
],
[
8,
37
],
[
37,
38
],
[
38,
39
],
[
39,
40
],
[
39,
41
],
[
37,
42
],
[
42,
43
],
[
42,
44
],
[
44,
45
],
[
45,
46
],
[
37,
47
],
[
47,
48
],
[
48,
49
],
[
37,
50
],
[
51,
51
],
[
51,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
52,
56
],
[
56,
57
],
[
57,
58
],
[
56,
59
],
[
8,
60
],
[
60,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
60,
65
],
[
65,
66
],
[
65,
67
],
[
67,
68
],
[
68,
69
],
[
60,
70
],
[
70,
71
],
[
71,
72
],
[
60,
73
],
[
74,
74
],
[
74,
75
],
[
75,
76
],
[
76,
77
],
[
76,
78
],
[
75,
79
],
[
79,
80
],
[
80,
81
],
[
79,
82
],
[
8,
83
],
[
83,
84
],
[
84,
85
],
[
85,
86
],
[
86,
87
],
[
84,
88
],
[
88,
89
],
[
89,
90
],
[
83,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
91,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
97,
99
],
[
95,
100
],
[
100,
101
],
[
100,
102
],
[
102,
103
],
[
103,
104
],
[
95,
105
],
[
105,
106
],
[
106,
107
],
[
95,
108
],
[
109,
109
],
[
109,
110
],
[
110,
111
],
[
111,
112
],
[
112,
113
],
[
112,
114
],
[
111,
115
],
[
115,
116
],
[
115,
117
],
[
110,
118
],
[
118,
119
],
[
119,
120
],
[
91,
121
],
[
121,
122
],
[
122,
123
],
[
123,
124
],
[
123,
125
],
[
121,
126
],
[
126,
127
],
[
127,
128
],
[
128,
129
],
[
126,
130
],
[
91,
131
],
[
8,
132
],
[
132,
133
],
[
133,
134
],
[
134,
135
],
[
134,
136
],
[
132,
137
],
[
137,
138
],
[
137,
139
],
[
139,
140
],
[
140,
141
],
[
141,
142
],
[
139,
143
],
[
143,
144
],
[
144,
145
],
[
132,
146
],
[
146,
147
],
[
147,
148
],
[
132,
149
],
[
150,
150
],
[
150,
151
],
[
151,
152
],
[
151,
153
],
[
150,
154
],
[
154,
155
],
[
155,
156
],
[
156,
157
],
[
156,
158
],
[
154,
159
],
[
159,
160
],
[
159,
161
],
[
161,
162
],
[
162,
163
],
[
154,
164
],
[
164,
165
],
[
165,
166
],
[
154,
167
],
[
168,
168
],
[
168,
169
],
[
169,
170
],
[
170,
171
],
[
171,
172
],
[
171,
173
],
[
173,
174
],
[
173,
175
],
[
170,
176
],
[
176,
177
],
[
176,
178
],
[
169,
179
],
[
179,
180
],
[
180,
181
],
[
150,
182
],
[
182,
183
],
[
183,
184
],
[
183,
185
],
[
182,
186
],
[
186,
187
],
[
186,
188
],
[
8,
189
],
[
189,
190
],
[
190,
191
],
[
191,
192
],
[
191,
193
],
[
189,
194
],
[
194,
195
],
[
195,
196
],
[
196,
197
],
[
194,
198
],
[
6,
199
],
[
199,
200
],
[
0,
201
],
[
201,
202
],
[
201,
203
]
]
| [
"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.next();\n String T = sc.next();\n char[] s = new char[S.length()];\n char[] t = new char[T.length()];\n int max = 0;\n for(int i=0;i<S.length();i++){\n s[i] = S.charAt(i);\n }\n for(int i=0;i<T.length();i++){\n t[i] = T.charAt(i);\n }\n if(S.length() == T.length()){\n int count = 0;\n for(int j=0;j<T.length();j++){\n if(s[j] == t[j]){\n count++;\n }\n }\n System.out.println(T.length() - count);\n return;\n }\n for(int i=0;i<S.length()-T.length();i++){\n int count = 0;\n for(int j=0;j<T.length();j++){\n if(s[i+j] == t[j]){\n count++;\n }\n }\n if(count > max)max = count;\n }\n System.out.println(T.length() - max);\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.next();\n String T = sc.next();\n char[] s = new char[S.length()];\n char[] t = new char[T.length()];\n int max = 0;\n for(int i=0;i<S.length();i++){\n s[i] = S.charAt(i);\n }\n for(int i=0;i<T.length();i++){\n t[i] = T.charAt(i);\n }\n if(S.length() == T.length()){\n int count = 0;\n for(int j=0;j<T.length();j++){\n if(s[j] == t[j]){\n count++;\n }\n }\n System.out.println(T.length() - count);\n return;\n }\n for(int i=0;i<S.length()-T.length();i++){\n int count = 0;\n for(int j=0;j<T.length();j++){\n if(s[i+j] == t[j]){\n count++;\n }\n }\n if(count > max)max = count;\n }\n System.out.println(T.length() - max);\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.next();\n String T = sc.next();\n char[] s = new char[S.length()];\n char[] t = new char[T.length()];\n int max = 0;\n for(int i=0;i<S.length();i++){\n s[i] = S.charAt(i);\n }\n for(int i=0;i<T.length();i++){\n t[i] = T.charAt(i);\n }\n if(S.length() == T.length()){\n int count = 0;\n for(int j=0;j<T.length();j++){\n if(s[j] == t[j]){\n count++;\n }\n }\n System.out.println(T.length() - count);\n return;\n }\n for(int i=0;i<S.length()-T.length();i++){\n int count = 0;\n for(int j=0;j<T.length();j++){\n if(s[i+j] == t[j]){\n count++;\n }\n }\n if(count > max)max = count;\n }\n System.out.println(T.length() - max);\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n String S = sc.next();\n String T = sc.next();\n char[] s = new char[S.length()];\n char[] t = new char[T.length()];\n int max = 0;\n for(int i=0;i<S.length();i++){\n s[i] = S.charAt(i);\n }\n for(int i=0;i<T.length();i++){\n t[i] = T.charAt(i);\n }\n if(S.length() == T.length()){\n int count = 0;\n for(int j=0;j<T.length();j++){\n if(s[j] == t[j]){\n count++;\n }\n }\n System.out.println(T.length() - count);\n return;\n }\n for(int i=0;i<S.length()-T.length();i++){\n int count = 0;\n for(int j=0;j<T.length();j++){\n if(s[i+j] == t[j]){\n count++;\n }\n }\n if(count > max)max = count;\n }\n System.out.println(T.length() - max);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String S = sc.next();",
"S",
"sc.next()",
"sc.next",
"sc",
"String T = sc.next();",
"T",
"sc.next()",
"sc.next",
"sc",
"char[] s = new char[S.length()];",
"s",
"new char[S.length()]",
"S.length()",
"S.length",
"S",
"char[] t = new char[T.length()];",
"t",
"new char[T.length()]",
"T.length()",
"T.length",
"T",
"int max = 0;",
"max",
"0",
"for(int i=0;i<S.length();i++){\n s[i] = S.charAt(i);\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<S.length()",
"i",
"S.length()",
"S.length",
"S",
"i++",
"i++",
"i",
"{\n s[i] = S.charAt(i);\n }",
"{\n s[i] = S.charAt(i);\n }",
"s[i] = S.charAt(i)",
"s[i]",
"s",
"i",
"S.charAt(i)",
"S.charAt",
"S",
"i",
"for(int i=0;i<T.length();i++){\n t[i] = T.charAt(i);\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<T.length()",
"i",
"T.length()",
"T.length",
"T",
"i++",
"i++",
"i",
"{\n t[i] = T.charAt(i);\n }",
"{\n t[i] = T.charAt(i);\n }",
"t[i] = T.charAt(i)",
"t[i]",
"t",
"i",
"T.charAt(i)",
"T.charAt",
"T",
"i",
"if(S.length() == T.length()){\n int count = 0;\n for(int j=0;j<T.length();j++){\n if(s[j] == t[j]){\n count++;\n }\n }\n System.out.println(T.length() - count);\n return;\n }",
"S.length() == T.length()",
"S.length()",
"S.length",
"S",
"T.length()",
"T.length",
"T",
"{\n int count = 0;\n for(int j=0;j<T.length();j++){\n if(s[j] == t[j]){\n count++;\n }\n }\n System.out.println(T.length() - count);\n return;\n }",
"int count = 0;",
"count",
"0",
"for(int j=0;j<T.length();j++){\n if(s[j] == t[j]){\n count++;\n }\n }",
"int j=0;",
"int j=0;",
"j",
"0",
"j<T.length()",
"j",
"T.length()",
"T.length",
"T",
"j++",
"j++",
"j",
"{\n if(s[j] == t[j]){\n count++;\n }\n }",
"{\n if(s[j] == t[j]){\n count++;\n }\n }",
"if(s[j] == t[j]){\n count++;\n }",
"s[j] == t[j]",
"s[j]",
"s",
"j",
"t[j]",
"t",
"j",
"{\n count++;\n }",
"count++",
"count",
"System.out.println(T.length() - count)",
"System.out.println",
"System.out",
"System",
"System.out",
"T.length() - count",
"T.length()",
"T.length",
"T",
"count",
"return;",
"for(int i=0;i<S.length()-T.length();i++){\n int count = 0;\n for(int j=0;j<T.length();j++){\n if(s[i+j] == t[j]){\n count++;\n }\n }\n if(count > max)max = count;\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<S.length()-T.length()",
"i",
"S.length()-T.length()",
"S.length()",
"S.length",
"S",
"T.length()",
"T.length",
"T",
"i++",
"i++",
"i",
"{\n int count = 0;\n for(int j=0;j<T.length();j++){\n if(s[i+j] == t[j]){\n count++;\n }\n }\n if(count > max)max = count;\n }",
"{\n int count = 0;\n for(int j=0;j<T.length();j++){\n if(s[i+j] == t[j]){\n count++;\n }\n }\n if(count > max)max = count;\n }",
"int count = 0;",
"count",
"0",
"for(int j=0;j<T.length();j++){\n if(s[i+j] == t[j]){\n count++;\n }\n }",
"int j=0;",
"int j=0;",
"j",
"0",
"j<T.length()",
"j",
"T.length()",
"T.length",
"T",
"j++",
"j++",
"j",
"{\n if(s[i+j] == t[j]){\n count++;\n }\n }",
"{\n if(s[i+j] == t[j]){\n count++;\n }\n }",
"if(s[i+j] == t[j]){\n count++;\n }",
"s[i+j] == t[j]",
"s[i+j]",
"s",
"i+j",
"i",
"j",
"t[j]",
"t",
"j",
"{\n count++;\n }",
"count++",
"count",
"if(count > max)max = count;",
"count > max",
"count",
"max",
"max = count",
"max",
"count",
"System.out.println(T.length() - max)",
"System.out.println",
"System.out",
"System",
"System.out",
"T.length() - max",
"T.length()",
"T.length",
"T",
"max",
"String[] args",
"args",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.next();\n String T = sc.next();\n char[] s = new char[S.length()];\n char[] t = new char[T.length()];\n int max = 0;\n for(int i=0;i<S.length();i++){\n s[i] = S.charAt(i);\n }\n for(int i=0;i<T.length();i++){\n t[i] = T.charAt(i);\n }\n if(S.length() == T.length()){\n int count = 0;\n for(int j=0;j<T.length();j++){\n if(s[j] == t[j]){\n count++;\n }\n }\n System.out.println(T.length() - count);\n return;\n }\n for(int i=0;i<S.length()-T.length();i++){\n int count = 0;\n for(int j=0;j<T.length();j++){\n if(s[i+j] == t[j]){\n count++;\n }\n }\n if(count > max)max = count;\n }\n System.out.println(T.length() - max);\n }\n}",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.next();\n String T = sc.next();\n char[] s = new char[S.length()];\n char[] t = new char[T.length()];\n int max = 0;\n for(int i=0;i<S.length();i++){\n s[i] = S.charAt(i);\n }\n for(int i=0;i<T.length();i++){\n t[i] = T.charAt(i);\n }\n if(S.length() == T.length()){\n int count = 0;\n for(int j=0;j<T.length();j++){\n if(s[j] == t[j]){\n count++;\n }\n }\n System.out.println(T.length() - count);\n return;\n }\n for(int i=0;i<S.length()-T.length();i++){\n int count = 0;\n for(int j=0;j<T.length();j++){\n if(s[i+j] == t[j]){\n count++;\n }\n }\n if(count > max)max = count;\n }\n System.out.println(T.length() - max);\n }\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String S = sc.next();
String T = sc.next();
char[] s = new char[S.length()];
char[] t = new char[T.length()];
int max = 0;
for(int i=0;i<S.length();i++){
s[i] = S.charAt(i);
}
for(int i=0;i<T.length();i++){
t[i] = T.charAt(i);
}
if(S.length() == T.length()){
int count = 0;
for(int j=0;j<T.length();j++){
if(s[j] == t[j]){
count++;
}
}
System.out.println(T.length() - count);
return;
}
for(int i=0;i<S.length()-T.length();i++){
int count = 0;
for(int j=0;j<T.length();j++){
if(s[i+j] == t[j]){
count++;
}
}
if(count > max)max = count;
}
System.out.println(T.length() - max);
}
} |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
2,
17,
17,
41,
13,
17,
41,
13,
17,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
41,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
18,
13,
13,
18,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
41,
13,
17,
11,
1,
41,
13,
13,
2,
13,
2,
2,
13,
18,
13,
13,
17,
1,
40,
13,
30,
30,
14,
2,
18,
13,
13,
18,
13,
13,
30,
40,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
6,
13,
41,
13,
20,
41,
13,
20,
12,
13,
30,
42,
40,
4,
18,
13,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
41,
13,
17,
42,
2,
13,
17,
30,
14,
2,
2,
13,
17,
17,
30,
0,
13,
2,
13,
13,
40,
13,
30,
0,
13,
2,
13,
13,
0,
13,
17,
29,
13,
23,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
13,
29,
4,
13,
13,
2,
13,
13,
23,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
13,
29,
4,
13,
13,
2,
13,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
20,
28,
13,
13,
30,
4,
18,
13,
13,
4,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
28,
13,
13,
30,
4,
18,
13,
13,
4,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
28,
13,
13,
30,
4,
18,
13,
13,
4,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
13,
29,
13,
23,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
440,
8
],
[
440,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
11,
13
],
[
440,
14
],
[
14,
15
],
[
14,
16
],
[
440,
17
],
[
17,
18
],
[
17,
19
],
[
440,
20
],
[
20,
21
],
[
20,
22
],
[
22,
23
],
[
23,
24
],
[
23,
25
],
[
22,
26
],
[
26,
27
],
[
26,
28
],
[
28,
29
],
[
29,
30
],
[
30,
31
],
[
31,
32
],
[
22,
33
],
[
33,
34
],
[
33,
35
],
[
35,
36
],
[
36,
37
],
[
37,
38
],
[
38,
39
],
[
22,
40
],
[
40,
41
],
[
40,
42
],
[
22,
43
],
[
43,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
43,
48
],
[
48,
49
],
[
48,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
50,
54
],
[
54,
55
],
[
54,
56
],
[
43,
57
],
[
57,
58
],
[
58,
59
],
[
43,
60
],
[
61,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
61,
65
],
[
65,
66
],
[
65,
67
],
[
61,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
70,
72
],
[
68,
73
],
[
73,
74
],
[
73,
75
],
[
75,
76
],
[
76,
77
],
[
76,
78
],
[
78,
79
],
[
78,
80
],
[
75,
81
],
[
68,
82
],
[
82,
83
],
[
83,
84
],
[
68,
85
],
[
86,
86
],
[
86,
87
],
[
87,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
88,
92
],
[
92,
93
],
[
92,
94
],
[
87,
95
],
[
95,
96
],
[
96,
97
],
[
86,
98
],
[
98,
99
],
[
61,
100
],
[
100,
101
],
[
100,
102
],
[
102,
103
],
[
103,
104
],
[
102,
105
],
[
102,
106
],
[
22,
107
],
[
107,
108
],
[
108,
109
],
[
109,
110
],
[
109,
111
],
[
107,
112
],
[
20,
113
],
[
113,
114
],
[
0,
115
],
[
115,
116
],
[
115,
117
],
[
117,
118
],
[
117,
119
],
[
115,
120
],
[
120,
121
],
[
120,
122
],
[
115,
123
],
[
123,
124
],
[
123,
125
],
[
125,
126
],
[
126,
127
],
[
127,
128
],
[
128,
129
],
[
129,
130
],
[
126,
131
],
[
131,
132
],
[
132,
133
],
[
132,
134
],
[
134,
135
],
[
135,
136
],
[
136,
137
],
[
131,
138
],
[
138,
139
],
[
139,
140
],
[
139,
141
],
[
125,
142
],
[
142,
143
],
[
143,
144
],
[
144,
145
],
[
115,
146
],
[
146,
147
],
[
146,
148
],
[
148,
149
],
[
149,
150
],
[
149,
151
],
[
148,
152
],
[
152,
153
],
[
153,
154
],
[
153,
155
],
[
152,
156
],
[
156,
157
],
[
157,
158
],
[
158,
159
],
[
159,
160
],
[
159,
161
],
[
158,
162
],
[
157,
163
],
[
163,
164
],
[
164,
165
],
[
164,
166
],
[
166,
167
],
[
166,
168
],
[
163,
169
],
[
169,
170
],
[
157,
171
],
[
171,
172
],
[
172,
173
],
[
172,
174
],
[
174,
175
],
[
174,
176
],
[
171,
177
],
[
177,
178
],
[
177,
179
],
[
148,
180
],
[
180,
181
],
[
146,
182
],
[
182,
183
],
[
146,
184
],
[
184,
185
],
[
115,
186
],
[
186,
187
],
[
186,
188
],
[
188,
189
],
[
189,
190
],
[
190,
191
],
[
190,
192
],
[
189,
193
],
[
193,
194
],
[
194,
195
],
[
188,
196
],
[
196,
197
],
[
197,
198
],
[
197,
199
],
[
197,
200
],
[
200,
201
],
[
200,
202
],
[
186,
203
],
[
203,
204
],
[
186,
205
],
[
205,
206
],
[
115,
207
],
[
207,
208
],
[
207,
209
],
[
209,
210
],
[
210,
211
],
[
211,
212
],
[
211,
213
],
[
210,
214
],
[
214,
215
],
[
215,
216
],
[
209,
217
],
[
217,
218
],
[
218,
219
],
[
218,
220
],
[
218,
221
],
[
221,
222
],
[
221,
223
],
[
207,
224
],
[
224,
225
],
[
207,
226
],
[
226,
227
],
[
115,
228
],
[
228,
229
],
[
228,
230
],
[
230,
231
],
[
231,
232
],
[
231,
233
],
[
230,
234
],
[
234,
235
],
[
234,
236
],
[
234,
237
],
[
237,
238
],
[
238,
239
],
[
239,
240
],
[
238,
241
],
[
230,
242
],
[
242,
243
],
[
243,
244
],
[
242,
245
],
[
230,
246
],
[
246,
247
],
[
247,
248
],
[
248,
249
],
[
248,
250
],
[
246,
251
],
[
251,
252
],
[
251,
253
],
[
253,
254
],
[
253,
255
],
[
246,
256
],
[
256,
257
],
[
257,
258
],
[
246,
259
],
[
260,
260
],
[
260,
261
],
[
261,
262
],
[
262,
263
],
[
262,
264
],
[
261,
265
],
[
265,
266
],
[
266,
267
],
[
265,
268
],
[
230,
269
],
[
269,
270
],
[
228,
271
],
[
271,
272
],
[
115,
273
],
[
273,
274
],
[
273,
275
],
[
275,
276
],
[
276,
277
],
[
276,
278
],
[
275,
279
],
[
279,
280
],
[
279,
281
],
[
279,
282
],
[
282,
283
],
[
283,
284
],
[
284,
285
],
[
283,
286
],
[
275,
287
],
[
287,
288
],
[
288,
289
],
[
287,
290
],
[
275,
291
],
[
291,
292
],
[
292,
293
],
[
293,
294
],
[
293,
295
],
[
291,
296
],
[
296,
297
],
[
296,
298
],
[
298,
299
],
[
299,
300
],
[
291,
301
],
[
301,
302
],
[
302,
303
],
[
291,
304
],
[
305,
305
],
[
305,
306
],
[
306,
307
],
[
307,
308
],
[
307,
309
],
[
306,
310
],
[
310,
311
],
[
311,
312
],
[
310,
313
],
[
275,
314
],
[
314,
315
],
[
273,
316
],
[
316,
317
],
[
115,
318
],
[
318,
319
],
[
318,
320
],
[
320,
321
],
[
321,
322
],
[
321,
323
],
[
320,
324
],
[
324,
325
],
[
324,
326
],
[
324,
327
],
[
327,
328
],
[
328,
329
],
[
329,
330
],
[
328,
331
],
[
320,
332
],
[
332,
333
],
[
333,
334
],
[
332,
335
],
[
320,
336
],
[
336,
337
],
[
337,
338
],
[
338,
339
],
[
338,
340
],
[
336,
341
],
[
341,
342
],
[
341,
343
],
[
343,
344
],
[
343,
345
],
[
336,
346
],
[
346,
347
],
[
347,
348
],
[
336,
349
],
[
350,
350
],
[
350,
351
],
[
351,
352
],
[
352,
353
],
[
352,
354
],
[
351,
355
],
[
355,
356
],
[
356,
357
],
[
355,
358
],
[
320,
359
],
[
359,
360
],
[
318,
361
],
[
361,
362
],
[
115,
363
],
[
363,
364
],
[
363,
365
],
[
365,
366
],
[
366,
367
],
[
367,
368
],
[
368,
369
],
[
367,
370
],
[
370,
371
],
[
115,
372
],
[
372,
373
],
[
372,
374
],
[
374,
375
],
[
375,
376
],
[
375,
377
],
[
374,
379
],
[
379,
380
],
[
380,
381
],
[
381,
382
],
[
381,
383
],
[
379,
384
],
[
384,
385
],
[
384,
386
],
[
379,
387
],
[
387,
388
],
[
388,
389
],
[
379,
390
],
[
390,
391
],
[
391,
392
],
[
392,
393
],
[
392,
394
],
[
391,
395
],
[
395,
396
],
[
374,
397
],
[
397,
398
],
[
372,
399
],
[
399,
400
],
[
115,
401
],
[
401,
402
],
[
401,
403
],
[
403,
404
],
[
404,
405
],
[
405,
406
],
[
406,
407
],
[
405,
408
],
[
408,
409
],
[
115,
410
],
[
410,
411
],
[
410,
412
],
[
412,
413
],
[
413,
414
],
[
413,
415
],
[
412,
417
],
[
417,
418
],
[
418,
419
],
[
419,
420
],
[
419,
421
],
[
417,
422
],
[
422,
423
],
[
422,
424
],
[
417,
425
],
[
425,
426
],
[
426,
427
],
[
417,
428
],
[
428,
429
],
[
429,
430
],
[
430,
431
],
[
430,
432
],
[
429,
433
],
[
433,
434
],
[
412,
435
],
[
435,
436
],
[
410,
437
],
[
437,
438
],
[
0,
439
],
[
439,
440
],
[
439,
441
]
]
| [
"//package Atcoder;\n\nimport java.util.*;\nimport java.io.*;\npublic class Main\n{\n\tstatic final int mod=(int)1e9+7;\n\tstatic final int inf=(int)1e9;\n\tstatic final long INF=(long)1e18;\n\tpublic static void main(String[] args)\n\t{\n\t\tFastScanner fs=new FastScanner();\n\t\tchar arr[]=fs.next().toCharArray();\n\t\tchar second[]=fs.next().toCharArray();\n\t\tint min=inf;\n\t\tfor(int i=0;i<=arr.length-second.length;i++)\n\t\t{\n\t\t\tint cnt=0,index=0;\n\t\t\tfor(int j=i;j<=i+second.length-1;j++)\n\t\t\t{\n\t\t\t\tif(arr[j]!=second[index])\n\t\t\t\t{\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t\tindex++;\n\t\t\t}\n\t\t\tmin=Math.min(min,cnt);\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n}\nclass FastScanner \n{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(\"\");\n\t\tpublic String next() \n\t\t{\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst=new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t\t\n\t\t}\n\t\t\n\t\tlong pow(long x,long n)\n\t\t{\n\t\t\tlong res=1;\n\t\t\twhile(n>0)\n\t\t\t{\n\t\t\t \tif(n%2!=0)\n\t\t\t \t{\n\t\t\t \t\tres=(res*x);n--;\n\t\t\t \t}\n\t\t\t \telse\n\t\t\t \t{\n\t\t\t \t\tx=(x*x);n/=2;\n\t\t\t \t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\tint gcd(int a,int b)\n\t\t{\n\t\t\tif(b==0)\n\t\t\t{\n\t\t\t\treturn a;\n\t\t\t}\n\t\t\treturn gcd(b,a%b);\n\t\t}\n\t\tlong longgcd(long a,long b)\n\t\t{\n\t\t\tif(b==0)\n\t\t\t{\n\t\t\t\treturn a;\n\t\t\t}\n\t\t\treturn longgcd(b,a%b);\n\t\t}\n\t\tint[] sort(int arr[])\n\t\t{\n\t\t\tArrayList<Integer> list = new ArrayList<Integer>();\n\t\t\tfor(int i:arr)list.add(i);\n\t\t\tCollections.sort(list);\n\t\t\tfor(int i=0;i<arr.length;i++)\n\t\t\t{\n\t\t\t\tarr[i]=list.get(i);\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\t\tchar[] charsort(char arr[])\n\t {\n\t \tArrayList<Character> list = new ArrayList<>();\n\t \tfor(char c:arr)list.add(c);\n\t \tCollections.sort(list);\n\t \tfor(int i=0;i<list.size();i++)\n\t \t{\n\t \t\tarr[i]=list.get(i);\n\t \t}\n\t \treturn arr;\n\t }\n\t\tlong[] longsort(long arr[])\n\t\t{\n\t\t\tArrayList<Long> list = new ArrayList<Long>();\n\t\t\tfor(long i:arr)list.add(i);\n\t\t\tCollections.sort(list);\n\t\t\tfor(int i=0;i<arr.length;i++)\n\t\t\t{\n\t\t\t\tarr[i]=list.get(i);\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\t\tpublic int nextInt() \n\t\t{\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\tpublic int[] readArray(int n)\n\t\t{\n\t\t\tint[] arr=new int[n];\n\t\t\tfor (int i=0; i<n; i++) arr[i]=nextInt();\n\t\t\treturn arr;\n\t\t}\t\n\t\tpublic long nextLong()\n\t\t{\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\tpublic long[] longreadArray(int n) \n\t\t{\n\t\t\tlong[] a=new long[n];\n\t\t\tfor (int i=0; i<n; i++) a[i]=nextLong();\n\t\t\treturn a;\n\t\t}\n}",
"import java.util.*;",
"util.*",
"java",
"import java.io.*;",
"io.*",
"java",
"public class Main\n{\n\tstatic final int mod=(int)1e9+7;\n\tstatic final int inf=(int)1e9;\n\tstatic final long INF=(long)1e18;\n\tpublic static void main(String[] args)\n\t{\n\t\tFastScanner fs=new FastScanner();\n\t\tchar arr[]=fs.next().toCharArray();\n\t\tchar second[]=fs.next().toCharArray();\n\t\tint min=inf;\n\t\tfor(int i=0;i<=arr.length-second.length;i++)\n\t\t{\n\t\t\tint cnt=0,index=0;\n\t\t\tfor(int j=i;j<=i+second.length-1;j++)\n\t\t\t{\n\t\t\t\tif(arr[j]!=second[index])\n\t\t\t\t{\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t\tindex++;\n\t\t\t}\n\t\t\tmin=Math.min(min,cnt);\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n}",
"Main",
"static final int mod=(int)1e9+7;",
"mod",
"(int)1e9+7",
"(int)1e9",
"7",
"static final int inf=(int)1e9;",
"inf",
"(int)1e9",
"static final long INF=(long)1e18;",
"INF",
"(long)1e18",
"public static void main(String[] args)\n\t{\n\t\tFastScanner fs=new FastScanner();\n\t\tchar arr[]=fs.next().toCharArray();\n\t\tchar second[]=fs.next().toCharArray();\n\t\tint min=inf;\n\t\tfor(int i=0;i<=arr.length-second.length;i++)\n\t\t{\n\t\t\tint cnt=0,index=0;\n\t\t\tfor(int j=i;j<=i+second.length-1;j++)\n\t\t\t{\n\t\t\t\tif(arr[j]!=second[index])\n\t\t\t\t{\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t\tindex++;\n\t\t\t}\n\t\t\tmin=Math.min(min,cnt);\n\t\t}\n\t\tSystem.out.println(min);\n\t}",
"main",
"{\n\t\tFastScanner fs=new FastScanner();\n\t\tchar arr[]=fs.next().toCharArray();\n\t\tchar second[]=fs.next().toCharArray();\n\t\tint min=inf;\n\t\tfor(int i=0;i<=arr.length-second.length;i++)\n\t\t{\n\t\t\tint cnt=0,index=0;\n\t\t\tfor(int j=i;j<=i+second.length-1;j++)\n\t\t\t{\n\t\t\t\tif(arr[j]!=second[index])\n\t\t\t\t{\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t\tindex++;\n\t\t\t}\n\t\t\tmin=Math.min(min,cnt);\n\t\t}\n\t\tSystem.out.println(min);\n\t}",
"FastScanner fs=new FastScanner();",
"fs",
"new FastScanner()",
"char arr[]=fs.next().toCharArray();",
"arr",
"fs.next().toCharArray()",
"fs.next().toCharArray",
"fs.next()",
"fs.next",
"fs",
"char second[]=fs.next().toCharArray();",
"second",
"fs.next().toCharArray()",
"fs.next().toCharArray",
"fs.next()",
"fs.next",
"fs",
"int min=inf;",
"min",
"inf",
"for(int i=0;i<=arr.length-second.length;i++)\n\t\t{\n\t\t\tint cnt=0,index=0;\n\t\t\tfor(int j=i;j<=i+second.length-1;j++)\n\t\t\t{\n\t\t\t\tif(arr[j]!=second[index])\n\t\t\t\t{\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t\tindex++;\n\t\t\t}\n\t\t\tmin=Math.min(min,cnt);\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<=arr.length-second.length",
"i",
"arr.length-second.length",
"arr.length",
"arr",
"arr.length",
"second.length",
"second",
"second.length",
"i++",
"i++",
"i",
"{\n\t\t\tint cnt=0,index=0;\n\t\t\tfor(int j=i;j<=i+second.length-1;j++)\n\t\t\t{\n\t\t\t\tif(arr[j]!=second[index])\n\t\t\t\t{\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t\tindex++;\n\t\t\t}\n\t\t\tmin=Math.min(min,cnt);\n\t\t}",
"{\n\t\t\tint cnt=0,index=0;\n\t\t\tfor(int j=i;j<=i+second.length-1;j++)\n\t\t\t{\n\t\t\t\tif(arr[j]!=second[index])\n\t\t\t\t{\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t\tindex++;\n\t\t\t}\n\t\t\tmin=Math.min(min,cnt);\n\t\t}",
"int cnt=0",
"cnt",
"0",
"index=0;",
"index",
"0",
"for(int j=i;j<=i+second.length-1;j++)\n\t\t\t{\n\t\t\t\tif(arr[j]!=second[index])\n\t\t\t\t{\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t\tindex++;\n\t\t\t}",
"int j=i;",
"int j=i;",
"j",
"i",
"j<=i+second.length-1",
"j",
"i+second.length-1",
"i+second.length",
"i",
"second.length",
"second",
"second.length",
"1",
"j++",
"j++",
"j",
"{\n\t\t\t\tif(arr[j]!=second[index])\n\t\t\t\t{\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t\tindex++;\n\t\t\t}",
"{\n\t\t\t\tif(arr[j]!=second[index])\n\t\t\t\t{\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t\tindex++;\n\t\t\t}",
"if(arr[j]!=second[index])\n\t\t\t\t{\n\t\t\t\t\tcnt++;\n\t\t\t\t}",
"arr[j]!=second[index]",
"arr[j]",
"arr",
"j",
"second[index]",
"second",
"index",
"{\n\t\t\t\t\tcnt++;\n\t\t\t\t}",
"cnt++",
"cnt",
"index++",
"index",
"min=Math.min(min,cnt)",
"min",
"Math.min(min,cnt)",
"Math.min",
"Math",
"min",
"cnt",
"System.out.println(min)",
"System.out.println",
"System.out",
"System",
"System.out",
"min",
"String[] args",
"args",
"class FastScanner \n{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(\"\");\n\t\tpublic String next() \n\t\t{\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst=new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t\t\n\t\t}\n\t\t\n\t\tlong pow(long x,long n)\n\t\t{\n\t\t\tlong res=1;\n\t\t\twhile(n>0)\n\t\t\t{\n\t\t\t \tif(n%2!=0)\n\t\t\t \t{\n\t\t\t \t\tres=(res*x);n--;\n\t\t\t \t}\n\t\t\t \telse\n\t\t\t \t{\n\t\t\t \t\tx=(x*x);n/=2;\n\t\t\t \t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\tint gcd(int a,int b)\n\t\t{\n\t\t\tif(b==0)\n\t\t\t{\n\t\t\t\treturn a;\n\t\t\t}\n\t\t\treturn gcd(b,a%b);\n\t\t}\n\t\tlong longgcd(long a,long b)\n\t\t{\n\t\t\tif(b==0)\n\t\t\t{\n\t\t\t\treturn a;\n\t\t\t}\n\t\t\treturn longgcd(b,a%b);\n\t\t}\n\t\tint[] sort(int arr[])\n\t\t{\n\t\t\tArrayList<Integer> list = new ArrayList<Integer>();\n\t\t\tfor(int i:arr)list.add(i);\n\t\t\tCollections.sort(list);\n\t\t\tfor(int i=0;i<arr.length;i++)\n\t\t\t{\n\t\t\t\tarr[i]=list.get(i);\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\t\tchar[] charsort(char arr[])\n\t {\n\t \tArrayList<Character> list = new ArrayList<>();\n\t \tfor(char c:arr)list.add(c);\n\t \tCollections.sort(list);\n\t \tfor(int i=0;i<list.size();i++)\n\t \t{\n\t \t\tarr[i]=list.get(i);\n\t \t}\n\t \treturn arr;\n\t }\n\t\tlong[] longsort(long arr[])\n\t\t{\n\t\t\tArrayList<Long> list = new ArrayList<Long>();\n\t\t\tfor(long i:arr)list.add(i);\n\t\t\tCollections.sort(list);\n\t\t\tfor(int i=0;i<arr.length;i++)\n\t\t\t{\n\t\t\t\tarr[i]=list.get(i);\n\t\t\t}\n\t\t\treturn arr;\n\t\t}\n\t\tpublic int nextInt() \n\t\t{\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\tpublic int[] readArray(int n)\n\t\t{\n\t\t\tint[] arr=new int[n];\n\t\t\tfor (int i=0; i<n; i++) arr[i]=nextInt();\n\t\t\treturn arr;\n\t\t}\t\n\t\tpublic long nextLong()\n\t\t{\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\tpublic long[] longreadArray(int n) \n\t\t{\n\t\t\tlong[] a=new long[n];\n\t\t\tfor (int i=0; i<n; i++) a[i]=nextLong();\n\t\t\treturn a;\n\t\t}\n}",
"FastScanner",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"StringTokenizer st = new StringTokenizer(\"\");",
"st",
"new StringTokenizer(\"\")",
"public String next() \n\t\t{\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst=new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t\t\n\t\t}",
"next",
"{\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst=new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t\t\n\t\t}",
"while (!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst=new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}",
"!st.hasMoreTokens()",
"st.hasMoreTokens()",
"st.hasMoreTokens",
"st",
"try {\n\t\t\t\t\tst=new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}",
"catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}",
"IOException e",
"{\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n\t\t\t\t\tst=new StringTokenizer(br.readLine());\n\t\t\t\t}",
"st=new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"long pow(long x,long n)\n\t\t{\n\t\t\tlong res=1;\n\t\t\twhile(n>0)\n\t\t\t{\n\t\t\t \tif(n%2!=0)\n\t\t\t \t{\n\t\t\t \t\tres=(res*x);n--;\n\t\t\t \t}\n\t\t\t \telse\n\t\t\t \t{\n\t\t\t \t\tx=(x*x);n/=2;\n\t\t\t \t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}",
"pow",
"{\n\t\t\tlong res=1;\n\t\t\twhile(n>0)\n\t\t\t{\n\t\t\t \tif(n%2!=0)\n\t\t\t \t{\n\t\t\t \t\tres=(res*x);n--;\n\t\t\t \t}\n\t\t\t \telse\n\t\t\t \t{\n\t\t\t \t\tx=(x*x);n/=2;\n\t\t\t \t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}",
"long res=1;",
"res",
"1",
"while(n>0)\n\t\t\t{\n\t\t\t \tif(n%2!=0)\n\t\t\t \t{\n\t\t\t \t\tres=(res*x);n--;\n\t\t\t \t}\n\t\t\t \telse\n\t\t\t \t{\n\t\t\t \t\tx=(x*x);n/=2;\n\t\t\t \t}\n\t\t\t}",
"n>0",
"n",
"0",
"{\n\t\t\t \tif(n%2!=0)\n\t\t\t \t{\n\t\t\t \t\tres=(res*x);n--;\n\t\t\t \t}\n\t\t\t \telse\n\t\t\t \t{\n\t\t\t \t\tx=(x*x);n/=2;\n\t\t\t \t}\n\t\t\t}",
"if(n%2!=0)\n\t\t\t \t{\n\t\t\t \t\tres=(res*x);n--;\n\t\t\t \t}\n\t\t\t \telse\n\t\t\t \t{\n\t\t\t \t\tx=(x*x);n/=2;\n\t\t\t \t}",
"n%2!=0",
"n%2",
"n",
"2",
"0",
"{\n\t\t\t \t\tres=(res*x);n--;\n\t\t\t \t}",
"res=(res*x)",
"res",
"(res*x)",
"res",
"x",
"n--",
"n",
"{\n\t\t\t \t\tx=(x*x);n/=2;\n\t\t\t \t}",
"x=(x*x)",
"x",
"(x*x)",
"x",
"x",
"n/=2",
"n",
"2",
"return res;",
"res",
"long x",
"x",
"long n",
"n",
"int gcd(int a,int b)\n\t\t{\n\t\t\tif(b==0)\n\t\t\t{\n\t\t\t\treturn a;\n\t\t\t}\n\t\t\treturn gcd(b,a%b);\n\t\t}",
"gcd",
"{\n\t\t\tif(b==0)\n\t\t\t{\n\t\t\t\treturn a;\n\t\t\t}\n\t\t\treturn gcd(b,a%b);\n\t\t}",
"if(b==0)\n\t\t\t{\n\t\t\t\treturn a;\n\t\t\t}",
"b==0",
"b",
"0",
"{\n\t\t\t\treturn a;\n\t\t\t}",
"return a;",
"a",
"return gcd(b,a%b);",
"gcd(b,a%b)",
"gcd",
"b",
"a%b",
"a",
"b",
"int a",
"a",
"int b",
"b",
"long longgcd(long a,long b)\n\t\t{\n\t\t\tif(b==0)\n\t\t\t{\n\t\t\t\treturn a;\n\t\t\t}\n\t\t\treturn longgcd(b,a%b);\n\t\t}",
"longgcd",
"{\n\t\t\tif(b==0)\n\t\t\t{\n\t\t\t\treturn a;\n\t\t\t}\n\t\t\treturn longgcd(b,a%b);\n\t\t}",
"if(b==0)\n\t\t\t{\n\t\t\t\treturn a;\n\t\t\t}",
"b==0",
"b",
"0",
"{\n\t\t\t\treturn a;\n\t\t\t}",
"return a;",
"a",
"return longgcd(b,a%b);",
"longgcd(b,a%b)",
"longgcd",
"b",
"a%b",
"a",
"b",
"long a",
"a",
"long b",
"b",
"int[] sort(int arr[])\n\t\t{\n\t\t\tArrayList<Integer> list = new ArrayList<Integer>();\n\t\t\tfor(int i:arr)list.add(i);\n\t\t\tCollections.sort(list);\n\t\t\tfor(int i=0;i<arr.length;i++)\n\t\t\t{\n\t\t\t\tarr[i]=list.get(i);\n\t\t\t}\n\t\t\treturn arr;\n\t\t}",
"sort",
"{\n\t\t\tArrayList<Integer> list = new ArrayList<Integer>();\n\t\t\tfor(int i:arr)list.add(i);\n\t\t\tCollections.sort(list);\n\t\t\tfor(int i=0;i<arr.length;i++)\n\t\t\t{\n\t\t\t\tarr[i]=list.get(i);\n\t\t\t}\n\t\t\treturn arr;\n\t\t}",
"ArrayList<Integer> list = new ArrayList<Integer>();",
"list",
"new ArrayList<Integer>()",
"for(int i:arr)list.add(i);",
"int i",
"arr",
"list.add(i);",
"list.add(i)",
"list.add",
"list",
"i",
"Collections.sort(list)",
"Collections.sort",
"Collections",
"list",
"for(int i=0;i<arr.length;i++)\n\t\t\t{\n\t\t\t\tarr[i]=list.get(i);\n\t\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<arr.length",
"i",
"arr.length",
"arr",
"arr.length",
"i++",
"i++",
"i",
"{\n\t\t\t\tarr[i]=list.get(i);\n\t\t\t}",
"{\n\t\t\t\tarr[i]=list.get(i);\n\t\t\t}",
"arr[i]=list.get(i)",
"arr[i]",
"arr",
"i",
"list.get(i)",
"list.get",
"list",
"i",
"return arr;",
"arr",
"int arr[]",
"arr",
"char[] charsort(char arr[])\n\t {\n\t \tArrayList<Character> list = new ArrayList<>();\n\t \tfor(char c:arr)list.add(c);\n\t \tCollections.sort(list);\n\t \tfor(int i=0;i<list.size();i++)\n\t \t{\n\t \t\tarr[i]=list.get(i);\n\t \t}\n\t \treturn arr;\n\t }",
"charsort",
"{\n\t \tArrayList<Character> list = new ArrayList<>();\n\t \tfor(char c:arr)list.add(c);\n\t \tCollections.sort(list);\n\t \tfor(int i=0;i<list.size();i++)\n\t \t{\n\t \t\tarr[i]=list.get(i);\n\t \t}\n\t \treturn arr;\n\t }",
"ArrayList<Character> list = new ArrayList<>();",
"list",
"new ArrayList<>()",
"for(char c:arr)list.add(c);",
"char c",
"arr",
"list.add(c);",
"list.add(c)",
"list.add",
"list",
"c",
"Collections.sort(list)",
"Collections.sort",
"Collections",
"list",
"for(int i=0;i<list.size();i++)\n\t \t{\n\t \t\tarr[i]=list.get(i);\n\t \t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<list.size()",
"i",
"list.size()",
"list.size",
"list",
"i++",
"i++",
"i",
"{\n\t \t\tarr[i]=list.get(i);\n\t \t}",
"{\n\t \t\tarr[i]=list.get(i);\n\t \t}",
"arr[i]=list.get(i)",
"arr[i]",
"arr",
"i",
"list.get(i)",
"list.get",
"list",
"i",
"return arr;",
"arr",
"char arr[]",
"arr",
"long[] longsort(long arr[])\n\t\t{\n\t\t\tArrayList<Long> list = new ArrayList<Long>();\n\t\t\tfor(long i:arr)list.add(i);\n\t\t\tCollections.sort(list);\n\t\t\tfor(int i=0;i<arr.length;i++)\n\t\t\t{\n\t\t\t\tarr[i]=list.get(i);\n\t\t\t}\n\t\t\treturn arr;\n\t\t}",
"longsort",
"{\n\t\t\tArrayList<Long> list = new ArrayList<Long>();\n\t\t\tfor(long i:arr)list.add(i);\n\t\t\tCollections.sort(list);\n\t\t\tfor(int i=0;i<arr.length;i++)\n\t\t\t{\n\t\t\t\tarr[i]=list.get(i);\n\t\t\t}\n\t\t\treturn arr;\n\t\t}",
"ArrayList<Long> list = new ArrayList<Long>();",
"list",
"new ArrayList<Long>()",
"for(long i:arr)list.add(i);",
"long i",
"arr",
"list.add(i);",
"list.add(i)",
"list.add",
"list",
"i",
"Collections.sort(list)",
"Collections.sort",
"Collections",
"list",
"for(int i=0;i<arr.length;i++)\n\t\t\t{\n\t\t\t\tarr[i]=list.get(i);\n\t\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<arr.length",
"i",
"arr.length",
"arr",
"arr.length",
"i++",
"i++",
"i",
"{\n\t\t\t\tarr[i]=list.get(i);\n\t\t\t}",
"{\n\t\t\t\tarr[i]=list.get(i);\n\t\t\t}",
"arr[i]=list.get(i)",
"arr[i]",
"arr",
"i",
"list.get(i)",
"list.get",
"list",
"i",
"return arr;",
"arr",
"long arr[]",
"arr",
"public int nextInt() \n\t\t{\n\t\t\treturn Integer.parseInt(next());\n\t\t}",
"nextInt",
"{\n\t\t\treturn Integer.parseInt(next());\n\t\t}",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"public int[] readArray(int n)\n\t\t{\n\t\t\tint[] arr=new int[n];\n\t\t\tfor (int i=0; i<n; i++) arr[i]=nextInt();\n\t\t\treturn arr;\n\t\t}",
"readArray",
"{\n\t\t\tint[] arr=new int[n];\n\t\t\tfor (int i=0; i<n; i++) arr[i]=nextInt();\n\t\t\treturn arr;\n\t\t}",
"int[] arr=new int[n];",
"arr",
"new int[n]",
"n",
"for (int i=0; i<n; i++) arr[i]=nextInt();",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"arr[i]=nextInt();",
"arr[i]=nextInt()",
"arr[i]",
"arr",
"i",
"nextInt()",
"nextInt",
"return arr;",
"arr",
"int n",
"n",
"public long nextLong()\n\t\t{\n\t\t\treturn Long.parseLong(next());\n\t\t}",
"nextLong",
"{\n\t\t\treturn Long.parseLong(next());\n\t\t}",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"public long[] longreadArray(int n) \n\t\t{\n\t\t\tlong[] a=new long[n];\n\t\t\tfor (int i=0; i<n; i++) a[i]=nextLong();\n\t\t\treturn a;\n\t\t}",
"longreadArray",
"{\n\t\t\tlong[] a=new long[n];\n\t\t\tfor (int i=0; i<n; i++) a[i]=nextLong();\n\t\t\treturn a;\n\t\t}",
"long[] a=new long[n];",
"a",
"new long[n]",
"n",
"for (int i=0; i<n; i++) a[i]=nextLong();",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"a[i]=nextLong();",
"a[i]=nextLong()",
"a[i]",
"a",
"i",
"nextLong()",
"nextLong",
"return a;",
"a",
"int n",
"n",
"public class Main\n{\n\tstatic final int mod=(int)1e9+7;\n\tstatic final int inf=(int)1e9;\n\tstatic final long INF=(long)1e18;\n\tpublic static void main(String[] args)\n\t{\n\t\tFastScanner fs=new FastScanner();\n\t\tchar arr[]=fs.next().toCharArray();\n\t\tchar second[]=fs.next().toCharArray();\n\t\tint min=inf;\n\t\tfor(int i=0;i<=arr.length-second.length;i++)\n\t\t{\n\t\t\tint cnt=0,index=0;\n\t\t\tfor(int j=i;j<=i+second.length-1;j++)\n\t\t\t{\n\t\t\t\tif(arr[j]!=second[index])\n\t\t\t\t{\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t\tindex++;\n\t\t\t}\n\t\t\tmin=Math.min(min,cnt);\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n}",
"public class Main\n{\n\tstatic final int mod=(int)1e9+7;\n\tstatic final int inf=(int)1e9;\n\tstatic final long INF=(long)1e18;\n\tpublic static void main(String[] args)\n\t{\n\t\tFastScanner fs=new FastScanner();\n\t\tchar arr[]=fs.next().toCharArray();\n\t\tchar second[]=fs.next().toCharArray();\n\t\tint min=inf;\n\t\tfor(int i=0;i<=arr.length-second.length;i++)\n\t\t{\n\t\t\tint cnt=0,index=0;\n\t\t\tfor(int j=i;j<=i+second.length-1;j++)\n\t\t\t{\n\t\t\t\tif(arr[j]!=second[index])\n\t\t\t\t{\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t\tindex++;\n\t\t\t}\n\t\t\tmin=Math.min(min,cnt);\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n}",
"Main"
]
| //package Atcoder;
import java.util.*;
import java.io.*;
public class Main
{
static final int mod=(int)1e9+7;
static final int inf=(int)1e9;
static final long INF=(long)1e18;
public static void main(String[] args)
{
FastScanner fs=new FastScanner();
char arr[]=fs.next().toCharArray();
char second[]=fs.next().toCharArray();
int min=inf;
for(int i=0;i<=arr.length-second.length;i++)
{
int cnt=0,index=0;
for(int j=i;j<=i+second.length-1;j++)
{
if(arr[j]!=second[index])
{
cnt++;
}
index++;
}
min=Math.min(min,cnt);
}
System.out.println(min);
}
}
class FastScanner
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
public String next()
{
while (!st.hasMoreTokens())
try {
st=new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
return st.nextToken();
}
long pow(long x,long n)
{
long res=1;
while(n>0)
{
if(n%2!=0)
{
res=(res*x);n--;
}
else
{
x=(x*x);n/=2;
}
}
return res;
}
int gcd(int a,int b)
{
if(b==0)
{
return a;
}
return gcd(b,a%b);
}
long longgcd(long a,long b)
{
if(b==0)
{
return a;
}
return longgcd(b,a%b);
}
int[] sort(int arr[])
{
ArrayList<Integer> list = new ArrayList<Integer>();
for(int i:arr)list.add(i);
Collections.sort(list);
for(int i=0;i<arr.length;i++)
{
arr[i]=list.get(i);
}
return arr;
}
char[] charsort(char arr[])
{
ArrayList<Character> list = new ArrayList<>();
for(char c:arr)list.add(c);
Collections.sort(list);
for(int i=0;i<list.size();i++)
{
arr[i]=list.get(i);
}
return arr;
}
long[] longsort(long arr[])
{
ArrayList<Long> list = new ArrayList<Long>();
for(long i:arr)list.add(i);
Collections.sort(list);
for(int i=0;i<arr.length;i++)
{
arr[i]=list.get(i);
}
return arr;
}
public int nextInt()
{
return Integer.parseInt(next());
}
public int[] readArray(int n)
{
int[] arr=new int[n];
for (int i=0; i<n; i++) arr[i]=nextInt();
return arr;
}
public long nextLong()
{
return Long.parseLong(next());
}
public long[] longreadArray(int n)
{
long[] a=new long[n];
for (int i=0; i<n; i++) a[i]=nextLong();
return a;
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
2,
4,
18,
13,
4,
18,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
13,
17,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
102,
5
],
[
102,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
25,
26
],
[
26,
27
],
[
24,
28
],
[
28,
29
],
[
29,
30
],
[
8,
31
],
[
31,
32
],
[
31,
33
],
[
33,
34
],
[
33,
35
],
[
8,
36
],
[
36,
37
],
[
37,
38
],
[
38,
39
],
[
38,
40
],
[
36,
41
],
[
41,
42
],
[
41,
43
],
[
43,
44
],
[
43,
45
],
[
36,
46
],
[
46,
47
],
[
47,
48
],
[
36,
49
],
[
50,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
53,
54
],
[
54,
55
],
[
50,
56
],
[
56,
57
],
[
57,
58
],
[
58,
59
],
[
58,
60
],
[
56,
61
],
[
61,
62
],
[
61,
63
],
[
63,
64
],
[
64,
65
],
[
56,
66
],
[
66,
67
],
[
67,
68
],
[
56,
69
],
[
70,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
74,
75
],
[
73,
76
],
[
76,
77
],
[
76,
78
],
[
72,
79
],
[
79,
80
],
[
80,
81
],
[
79,
82
],
[
71,
83
],
[
83,
84
],
[
84,
85
],
[
50,
86
],
[
86,
87
],
[
86,
88
],
[
88,
89
],
[
89,
90
],
[
88,
91
],
[
88,
92
],
[
8,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
95,
97
],
[
93,
98
],
[
6,
99
],
[
99,
100
],
[
0,
101
],
[
101,
102
],
[
101,
103
]
]
| [
"import java.util.*;\n\npublic class Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.nextLine();\n String T = sc.nextLine();\n int diff = S.length() - T.length();\n int min = Integer.MAX_VALUE;\n for(int i = 0;i<diff+1;i++){\n int temp = T.length();\n for(int j = 0;j<T.length();j++){\n if(S.charAt(i+j) == T.charAt(j)){\n temp--;\n }\n }\n min = Math.min(min,temp);\n }\n System.out.println(min);\n }\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.nextLine();\n String T = sc.nextLine();\n int diff = S.length() - T.length();\n int min = Integer.MAX_VALUE;\n for(int i = 0;i<diff+1;i++){\n int temp = T.length();\n for(int j = 0;j<T.length();j++){\n if(S.charAt(i+j) == T.charAt(j)){\n temp--;\n }\n }\n min = Math.min(min,temp);\n }\n System.out.println(min);\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.nextLine();\n String T = sc.nextLine();\n int diff = S.length() - T.length();\n int min = Integer.MAX_VALUE;\n for(int i = 0;i<diff+1;i++){\n int temp = T.length();\n for(int j = 0;j<T.length();j++){\n if(S.charAt(i+j) == T.charAt(j)){\n temp--;\n }\n }\n min = Math.min(min,temp);\n }\n System.out.println(min);\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n String S = sc.nextLine();\n String T = sc.nextLine();\n int diff = S.length() - T.length();\n int min = Integer.MAX_VALUE;\n for(int i = 0;i<diff+1;i++){\n int temp = T.length();\n for(int j = 0;j<T.length();j++){\n if(S.charAt(i+j) == T.charAt(j)){\n temp--;\n }\n }\n min = Math.min(min,temp);\n }\n System.out.println(min);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String S = sc.nextLine();",
"S",
"sc.nextLine()",
"sc.nextLine",
"sc",
"String T = sc.nextLine();",
"T",
"sc.nextLine()",
"sc.nextLine",
"sc",
"int diff = S.length() - T.length();",
"diff",
"S.length() - T.length()",
"S.length()",
"S.length",
"S",
"T.length()",
"T.length",
"T",
"int min = Integer.MAX_VALUE;",
"min",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"for(int i = 0;i<diff+1;i++){\n int temp = T.length();\n for(int j = 0;j<T.length();j++){\n if(S.charAt(i+j) == T.charAt(j)){\n temp--;\n }\n }\n min = Math.min(min,temp);\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i<diff+1",
"i",
"diff+1",
"diff",
"1",
"i++",
"i++",
"i",
"{\n int temp = T.length();\n for(int j = 0;j<T.length();j++){\n if(S.charAt(i+j) == T.charAt(j)){\n temp--;\n }\n }\n min = Math.min(min,temp);\n }",
"{\n int temp = T.length();\n for(int j = 0;j<T.length();j++){\n if(S.charAt(i+j) == T.charAt(j)){\n temp--;\n }\n }\n min = Math.min(min,temp);\n }",
"int temp = T.length();",
"temp",
"T.length()",
"T.length",
"T",
"for(int j = 0;j<T.length();j++){\n if(S.charAt(i+j) == T.charAt(j)){\n temp--;\n }\n }",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j<T.length()",
"j",
"T.length()",
"T.length",
"T",
"j++",
"j++",
"j",
"{\n if(S.charAt(i+j) == T.charAt(j)){\n temp--;\n }\n }",
"{\n if(S.charAt(i+j) == T.charAt(j)){\n temp--;\n }\n }",
"if(S.charAt(i+j) == T.charAt(j)){\n temp--;\n }",
"S.charAt(i+j) == T.charAt(j)",
"S.charAt(i+j)",
"S.charAt",
"S",
"i+j",
"i",
"j",
"T.charAt(j)",
"T.charAt",
"T",
"j",
"{\n temp--;\n }",
"temp--",
"temp",
"min = Math.min(min,temp)",
"min",
"Math.min(min,temp)",
"Math.min",
"Math",
"min",
"temp",
"System.out.println(min)",
"System.out.println",
"System.out",
"System",
"System.out",
"min",
"String[] args",
"args",
"public class Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.nextLine();\n String T = sc.nextLine();\n int diff = S.length() - T.length();\n int min = Integer.MAX_VALUE;\n for(int i = 0;i<diff+1;i++){\n int temp = T.length();\n for(int j = 0;j<T.length();j++){\n if(S.charAt(i+j) == T.charAt(j)){\n temp--;\n }\n }\n min = Math.min(min,temp);\n }\n System.out.println(min);\n }\n}",
"public class Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String S = sc.nextLine();\n String T = sc.nextLine();\n int diff = S.length() - T.length();\n int min = Integer.MAX_VALUE;\n for(int i = 0;i<diff+1;i++){\n int temp = T.length();\n for(int j = 0;j<T.length();j++){\n if(S.charAt(i+j) == T.charAt(j)){\n temp--;\n }\n }\n min = Math.min(min,temp);\n }\n System.out.println(min);\n }\n}",
"Main"
]
| import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String S = sc.nextLine();
String T = sc.nextLine();
int diff = S.length() - T.length();
int min = Integer.MAX_VALUE;
for(int i = 0;i<diff+1;i++){
int temp = T.length();
for(int j = 0;j<T.length();j++){
if(S.charAt(i+j) == T.charAt(j)){
temp--;
}
}
min = Math.min(min,temp);
}
System.out.println(min);
}
} |
[
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,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
2,
4,
18,
13,
4,
18,
13,
17,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
30,
40,
13,
14,
2,
13,
13,
30,
0,
13,
13,
4,
18,
18,
13,
13,
2,
4,
18,
13,
13,
23,
13,
6,
13,
41,
13,
18,
13,
13,
41,
13,
20,
17,
41,
13,
17,
41,
13,
17,
12,
13,
30,
14,
2,
13,
13,
30,
29,
17,
30,
0,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
13,
14,
2,
13,
17,
30,
29,
17,
29,
17,
12,
13,
30,
14,
4,
13,
29,
18,
13,
40,
13,
29,
40,
17,
12,
13,
30,
29,
2,
2,
17,
13,
2,
13,
17,
23,
13,
12,
13,
30,
42,
2,
4,
13,
40,
4,
13,
18,
13,
13,
40,
13,
29,
4,
13,
12,
13,
30,
14,
40,
4,
13,
37,
20,
41,
13,
20,
41,
13,
4,
13,
42,
4,
13,
13,
30,
4,
18,
13,
13,
0,
13,
4,
13,
29,
4,
18,
13,
12,
13,
30,
14,
40,
4,
13,
37,
20,
41,
13,
17,
41,
13,
17,
41,
13,
4,
13,
14,
2,
13,
17,
30,
0,
13,
17,
0,
13,
4,
13,
14,
2,
2,
13,
17,
2,
17,
13,
30,
37,
20,
42,
17,
30,
14,
2,
2,
17,
13,
2,
13,
17,
30,
0,
13,
17,
0,
13,
2,
13,
17,
14,
2,
2,
13,
40,
17,
40,
4,
13,
13,
30,
29,
8,
13,
40,
13,
13,
30,
37,
20,
0,
13,
4,
13,
12,
13,
30,
41,
13,
4,
13,
14,
2,
2,
13,
18,
13,
13,
2,
13,
18,
13,
13,
37,
20,
29,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
356,
11
],
[
356,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
14,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
14,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
26,
27
],
[
14,
28
],
[
28,
29
],
[
28,
30
],
[
14,
31
],
[
31,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
31,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
41,
42
],
[
39,
43
],
[
43,
44
],
[
44,
45
],
[
38,
46
],
[
31,
47
],
[
47,
48
],
[
48,
49
],
[
31,
50
],
[
51,
51
],
[
51,
52
],
[
52,
53
],
[
52,
54
],
[
51,
55
],
[
55,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
55,
60
],
[
60,
61
],
[
60,
62
],
[
62,
63
],
[
63,
64
],
[
55,
65
],
[
65,
66
],
[
66,
67
],
[
55,
68
],
[
69,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
72,
75
],
[
75,
76
],
[
75,
77
],
[
71,
78
],
[
78,
79
],
[
79,
80
],
[
78,
81
],
[
70,
82
],
[
82,
83
],
[
83,
84
],
[
51,
85
],
[
85,
86
],
[
86,
87
],
[
86,
88
],
[
85,
89
],
[
89,
90
],
[
90,
91
],
[
90,
92
],
[
14,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
95,
97
],
[
93,
98
],
[
98,
99
],
[
99,
100
],
[
100,
101
],
[
98,
102
],
[
12,
103
],
[
103,
104
],
[
0,
105
],
[
105,
106
],
[
105,
107
],
[
107,
108
],
[
107,
109
],
[
109,
110
],
[
109,
111
],
[
105,
112
],
[
112,
113
],
[
112,
114
],
[
105,
116
],
[
116,
117
],
[
116,
118
],
[
105,
119
],
[
119,
120
],
[
119,
121
],
[
105,
122
],
[
122,
123
],
[
122,
124
],
[
124,
125
],
[
125,
126
],
[
126,
127
],
[
126,
128
],
[
125,
129
],
[
129,
130
],
[
130,
131
],
[
125,
132
],
[
132,
133
],
[
133,
134
],
[
133,
135
],
[
132,
136
],
[
136,
137
],
[
137,
138
],
[
137,
139
],
[
139,
140
],
[
140,
141
],
[
141,
142
],
[
136,
143
],
[
143,
144
],
[
144,
145
],
[
144,
146
],
[
146,
147
],
[
147,
148
],
[
146,
149
],
[
132,
150
],
[
150,
151
],
[
151,
152
],
[
151,
153
],
[
150,
154
],
[
154,
155
],
[
155,
156
],
[
124,
157
],
[
157,
158
],
[
105,
159
],
[
159,
160
],
[
159,
161
],
[
161,
162
],
[
162,
163
],
[
163,
164
],
[
162,
165
],
[
165,
166
],
[
166,
167
],
[
166,
168
],
[
168,
169
],
[
162,
170
],
[
170,
171
],
[
171,
172
],
[
105,
173
],
[
173,
174
],
[
173,
175
],
[
175,
176
],
[
176,
177
],
[
177,
178
],
[
178,
179
],
[
178,
180
],
[
177,
181
],
[
181,
182
],
[
181,
183
],
[
173,
184
],
[
184,
185
],
[
105,
186
],
[
186,
187
],
[
186,
188
],
[
188,
189
],
[
189,
190
],
[
190,
191
],
[
191,
192
],
[
190,
193
],
[
193,
194
],
[
194,
195
],
[
194,
196
],
[
196,
197
],
[
196,
198
],
[
189,
199
],
[
199,
200
],
[
188,
201
],
[
201,
202
],
[
202,
203
],
[
105,
204
],
[
204,
205
],
[
204,
206
],
[
206,
207
],
[
207,
208
],
[
208,
209
],
[
209,
210
],
[
207,
211
],
[
211,
212
],
[
206,
213
],
[
213,
214
],
[
213,
215
],
[
206,
216
],
[
216,
217
],
[
216,
218
],
[
218,
219
],
[
206,
220
],
[
220,
221
],
[
221,
222
],
[
221,
223
],
[
220,
224
],
[
224,
225
],
[
225,
226
],
[
226,
227
],
[
225,
228
],
[
224,
229
],
[
229,
230
],
[
229,
231
],
[
231,
232
],
[
206,
233
],
[
233,
234
],
[
234,
235
],
[
235,
236
],
[
105,
237
],
[
237,
238
],
[
237,
239
],
[
239,
240
],
[
240,
241
],
[
241,
242
],
[
242,
243
],
[
240,
244
],
[
244,
245
],
[
239,
246
],
[
246,
247
],
[
246,
248
],
[
239,
249
],
[
249,
250
],
[
249,
251
],
[
239,
252
],
[
252,
253
],
[
252,
254
],
[
254,
255
],
[
239,
256
],
[
256,
257
],
[
257,
258
],
[
257,
259
],
[
256,
260
],
[
260,
261
],
[
261,
262
],
[
261,
263
],
[
260,
264
],
[
264,
265
],
[
264,
266
],
[
266,
267
],
[
239,
268
],
[
268,
269
],
[
269,
270
],
[
270,
271
],
[
270,
272
],
[
269,
273
],
[
273,
274
],
[
273,
275
],
[
268,
276
],
[
276,
277
],
[
277,
278
],
[
239,
279
],
[
279,
280
],
[
279,
281
],
[
281,
282
],
[
282,
283
],
[
283,
284
],
[
284,
285
],
[
284,
286
],
[
283,
287
],
[
287,
288
],
[
287,
289
],
[
282,
290
],
[
290,
291
],
[
291,
292
],
[
291,
293
],
[
290,
294
],
[
294,
295
],
[
294,
296
],
[
296,
297
],
[
296,
298
],
[
282,
299
],
[
299,
300
],
[
300,
301
],
[
301,
302
],
[
301,
303
],
[
303,
304
],
[
300,
305
],
[
305,
306
],
[
306,
307
],
[
306,
308
],
[
299,
309
],
[
309,
310
],
[
310,
311
],
[
311,
312
],
[
311,
313
],
[
313,
314
],
[
311,
315
],
[
299,
316
],
[
316,
317
],
[
317,
318
],
[
281,
319
],
[
319,
320
],
[
319,
321
],
[
321,
322
],
[
105,
323
],
[
323,
324
],
[
323,
325
],
[
325,
326
],
[
326,
327
],
[
326,
328
],
[
328,
329
],
[
325,
330
],
[
330,
331
],
[
331,
332
],
[
332,
333
],
[
332,
334
],
[
334,
335
],
[
334,
336
],
[
331,
337
],
[
337,
338
],
[
337,
339
],
[
339,
340
],
[
339,
341
],
[
330,
342
],
[
342,
343
],
[
325,
344
],
[
344,
345
],
[
105,
346
],
[
346,
347
],
[
346,
348
],
[
348,
349
],
[
349,
350
],
[
350,
351
],
[
351,
352
],
[
350,
353
],
[
353,
354
],
[
0,
355
],
[
355,
356
],
[
355,
357
]
]
| [
"import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner();\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\t\tint maxMatch = 0;\n\t\tfor (int i = 0; i < S.length() - T.length() + 1; i++) {\n\t\t\tint tmp = 0;\n\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (S.charAt(i + j) == T.charAt(j)) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (tmp > maxMatch) {\n\t\t\t\tmaxMatch = tmp;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(T.length() - maxMatch);\n\t}\n\n}\n\nclass FastScanner {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\n\tprivate boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tprivate int readByte() {\n\t\tif (hasNextByte())\n\t\t\treturn buffer[ptr++];\n\t\telse\n\t\t\treturn -1;\n\t}\n\n\tprivate static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <= 126;\n\t}\n\n\tpublic boolean hasNext() {\n\t\twhile (hasNextByte() && !isPrintableChar(buffer[ptr]))\n\t\t\tptr++;\n\t\treturn hasNextByte();\n\t}\n\n\tpublic String next() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tpublic long nextLong() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n\t\t\tthrow new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n}",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStream;",
"InputStream",
"java.io",
"import java.util.NoSuchElementException;",
"NoSuchElementException",
"java.util",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner();\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\t\tint maxMatch = 0;\n\t\tfor (int i = 0; i < S.length() - T.length() + 1; i++) {\n\t\t\tint tmp = 0;\n\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (S.charAt(i + j) == T.charAt(j)) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (tmp > maxMatch) {\n\t\t\t\tmaxMatch = tmp;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(T.length() - maxMatch);\n\t}\n\n}",
"Main",
"public static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner();\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\t\tint maxMatch = 0;\n\t\tfor (int i = 0; i < S.length() - T.length() + 1; i++) {\n\t\t\tint tmp = 0;\n\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (S.charAt(i + j) == T.charAt(j)) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (tmp > maxMatch) {\n\t\t\t\tmaxMatch = tmp;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(T.length() - maxMatch);\n\t}",
"main",
"{\n\t\tFastScanner sc = new FastScanner();\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\t\tint maxMatch = 0;\n\t\tfor (int i = 0; i < S.length() - T.length() + 1; i++) {\n\t\t\tint tmp = 0;\n\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (S.charAt(i + j) == T.charAt(j)) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (tmp > maxMatch) {\n\t\t\t\tmaxMatch = tmp;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(T.length() - maxMatch);\n\t}",
"FastScanner sc = new FastScanner();",
"sc",
"new FastScanner()",
"String S = sc.next();",
"S",
"sc.next()",
"sc.next",
"sc",
"String T = sc.next();",
"T",
"sc.next()",
"sc.next",
"sc",
"int maxMatch = 0;",
"maxMatch",
"0",
"for (int i = 0; i < S.length() - T.length() + 1; i++) {\n\t\t\tint tmp = 0;\n\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (S.charAt(i + j) == T.charAt(j)) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (tmp > maxMatch) {\n\t\t\t\tmaxMatch = tmp;\n\t\t\t}\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < S.length() - T.length() + 1",
"i",
"S.length() - T.length() + 1",
"S.length() - T.length()",
"S.length()",
"S.length",
"S",
"T.length()",
"T.length",
"T",
"1",
"i++",
"i++",
"i",
"{\n\t\t\tint tmp = 0;\n\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (S.charAt(i + j) == T.charAt(j)) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (tmp > maxMatch) {\n\t\t\t\tmaxMatch = tmp;\n\t\t\t}\n\t\t}",
"{\n\t\t\tint tmp = 0;\n\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (S.charAt(i + j) == T.charAt(j)) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (tmp > maxMatch) {\n\t\t\t\tmaxMatch = tmp;\n\t\t\t}\n\t\t}",
"int tmp = 0;",
"tmp",
"0",
"for (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (S.charAt(i + j) == T.charAt(j)) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < T.length()",
"j",
"T.length()",
"T.length",
"T",
"j++",
"j++",
"j",
"{\n\t\t\t\tif (S.charAt(i + j) == T.charAt(j)) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif (S.charAt(i + j) == T.charAt(j)) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}",
"if (S.charAt(i + j) == T.charAt(j)) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}",
"S.charAt(i + j) == T.charAt(j)",
"S.charAt(i + j)",
"S.charAt",
"S",
"i + j",
"i",
"j",
"T.charAt(j)",
"T.charAt",
"T",
"j",
"{\n\t\t\t\t\ttmp++;\n\t\t\t\t}",
"tmp++",
"tmp",
"if (tmp > maxMatch) {\n\t\t\t\tmaxMatch = tmp;\n\t\t\t}",
"tmp > maxMatch",
"tmp",
"maxMatch",
"{\n\t\t\t\tmaxMatch = tmp;\n\t\t\t}",
"maxMatch = tmp",
"maxMatch",
"tmp",
"System.out.println(T.length() - maxMatch)",
"System.out.println",
"System.out",
"System",
"System.out",
"T.length() - maxMatch",
"T.length()",
"T.length",
"T",
"maxMatch",
"String[] args",
"args",
"class FastScanner {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\n\tprivate boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tprivate int readByte() {\n\t\tif (hasNextByte())\n\t\t\treturn buffer[ptr++];\n\t\telse\n\t\t\treturn -1;\n\t}\n\n\tprivate static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <= 126;\n\t}\n\n\tpublic boolean hasNext() {\n\t\twhile (hasNextByte() && !isPrintableChar(buffer[ptr]))\n\t\t\tptr++;\n\t\treturn hasNextByte();\n\t}\n\n\tpublic String next() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tpublic long nextLong() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n\t\t\tthrow new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n}",
"FastScanner",
"private final InputStream in = System.in;",
"in",
"System.in",
"System",
"System.in",
"private final byte[] buffer = new byte[1024];",
"buffer",
"new byte[1024]",
"1024",
"private int ptr = 0;",
"ptr",
"0",
"private int buflen = 0;",
"buflen",
"0",
"private boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}",
"hasNextByte",
"{\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}",
"if (ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}",
"ptr < buflen",
"ptr",
"buflen",
"{\n\t\t\treturn true;\n\t\t}",
"return true;",
"true",
"{\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}",
"ptr = 0",
"ptr",
"0",
"try {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}",
"catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}",
"IOException e",
"{\n\t\t\t\te.printStackTrace();\n\t\t\t}",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t}",
"buflen = in.read(buffer)",
"buflen",
"in.read(buffer)",
"in.read",
"in",
"buffer",
"if (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}",
"buflen <= 0",
"buflen",
"0",
"{\n\t\t\t\treturn false;\n\t\t\t}",
"return false;",
"false",
"return true;",
"true",
"private int readByte() {\n\t\tif (hasNextByte())\n\t\t\treturn buffer[ptr++];\n\t\telse\n\t\t\treturn -1;\n\t}",
"readByte",
"{\n\t\tif (hasNextByte())\n\t\t\treturn buffer[ptr++];\n\t\telse\n\t\t\treturn -1;\n\t}",
"if (hasNextByte())\n\t\t\treturn buffer[ptr++];\n\t\telse\n\t\t\treturn -1;",
"hasNextByte()",
"hasNextByte",
"return buffer[ptr++];",
"buffer[ptr++]",
"buffer",
"ptr++",
"ptr",
"return -1;",
"-1",
"1",
"private static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <= 126;\n\t}",
"isPrintableChar",
"{\n\t\treturn 33 <= c && c <= 126;\n\t}",
"return 33 <= c && c <= 126;",
"33 <= c && c <= 126",
"33 <= c",
"33",
"c",
"c <= 126",
"c",
"126",
"int c",
"c",
"public boolean hasNext() {\n\t\twhile (hasNextByte() && !isPrintableChar(buffer[ptr]))\n\t\t\tptr++;\n\t\treturn hasNextByte();\n\t}",
"hasNext",
"{\n\t\twhile (hasNextByte() && !isPrintableChar(buffer[ptr]))\n\t\t\tptr++;\n\t\treturn hasNextByte();\n\t}",
"while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n\t\t\tptr++;",
"hasNextByte() && !isPrintableChar(buffer[ptr])",
"hasNextByte()",
"hasNextByte",
"!isPrintableChar(buffer[ptr])",
"isPrintableChar(buffer[ptr])",
"isPrintableChar",
"buffer[ptr]",
"buffer",
"ptr",
"ptr++",
"ptr",
"return hasNextByte();",
"hasNextByte()",
"hasNextByte",
"public String next() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}",
"next",
"{\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}",
"if (!hasNext())\n\t\t\tthrow new NoSuchElementException();",
"!hasNext()",
"hasNext()",
"hasNext",
"throw new NoSuchElementException();",
"new NoSuchElementException()",
"StringBuilder sb = new StringBuilder();",
"sb",
"new StringBuilder()",
"int b = readByte();",
"b",
"readByte()",
"readByte",
"while (isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}",
"isPrintableChar(b)",
"isPrintableChar",
"b",
"{\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}",
"sb.appendCodePoint(b)",
"sb.appendCodePoint",
"sb",
"b",
"b = readByte()",
"b",
"readByte()",
"readByte",
"return sb.toString();",
"sb.toString()",
"sb.toString",
"sb",
"public long nextLong() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}",
"nextLong",
"{\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}",
"if (!hasNext())\n\t\t\tthrow new NoSuchElementException();",
"!hasNext()",
"hasNext()",
"hasNext",
"throw new NoSuchElementException();",
"new NoSuchElementException()",
"long n = 0;",
"n",
"0",
"boolean minus = false;",
"minus",
"false",
"int b = readByte();",
"b",
"readByte()",
"readByte",
"if (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}",
"b == '-'",
"b",
"'-'",
"{\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}",
"minus = true",
"minus",
"true",
"b = readByte()",
"b",
"readByte()",
"readByte",
"if (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}",
"b < '0' || '9' < b",
"b < '0'",
"b",
"'0'",
"'9' < b",
"'9'",
"b",
"{\n\t\t\tthrow new NumberFormatException();\n\t\t}",
"throw new NumberFormatException();",
"new NumberFormatException()",
"while (true) {\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}",
"true",
"{\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}",
"if ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}",
"'0' <= b && b <= '9'",
"'0' <= b",
"'0'",
"b",
"b <= '9'",
"b",
"'9'",
"{\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t}",
"n *= 10",
"n",
"10",
"n += b - '0'",
"n",
"b - '0'",
"b",
"'0'",
"if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}",
"b == -1 || !isPrintableChar(b)",
"b == -1",
"b",
"-1",
"1",
"!isPrintableChar(b)",
"isPrintableChar(b)",
"isPrintableChar",
"b",
"{\n\t\t\t\treturn minus ? -n : n;\n\t\t\t}",
"return minus ? -n : n;",
"minus ? -n : n",
"minus",
"-n",
"n",
"n",
"{\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}",
"throw new NumberFormatException();",
"new NumberFormatException()",
"b = readByte()",
"b",
"readByte()",
"readByte",
"public int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n\t\t\tthrow new NumberFormatException();\n\t\treturn (int) nl;\n\t}",
"nextInt",
"{\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n\t\t\tthrow new NumberFormatException();\n\t\treturn (int) nl;\n\t}",
"long nl = nextLong();",
"nl",
"nextLong()",
"nextLong",
"if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n\t\t\tthrow new NumberFormatException();",
"nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE",
"nl < Integer.MIN_VALUE",
"nl",
"Integer.MIN_VALUE",
"Integer",
"Integer.MIN_VALUE",
"nl > Integer.MAX_VALUE",
"nl",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"throw new NumberFormatException();",
"new NumberFormatException()",
"return (int) nl;",
"(int) nl",
"public double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}",
"nextDouble",
"{\n\t\treturn Double.parseDouble(next());\n\t}",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner();\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\t\tint maxMatch = 0;\n\t\tfor (int i = 0; i < S.length() - T.length() + 1; i++) {\n\t\t\tint tmp = 0;\n\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (S.charAt(i + j) == T.charAt(j)) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (tmp > maxMatch) {\n\t\t\t\tmaxMatch = tmp;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(T.length() - maxMatch);\n\t}\n\n}",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner();\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\t\tint maxMatch = 0;\n\t\tfor (int i = 0; i < S.length() - T.length() + 1; i++) {\n\t\t\tint tmp = 0;\n\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (S.charAt(i + j) == T.charAt(j)) {\n\t\t\t\t\ttmp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (tmp > maxMatch) {\n\t\t\t\tmaxMatch = tmp;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(T.length() - maxMatch);\n\t}\n\n}",
"Main"
]
| import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) {
FastScanner sc = new FastScanner();
String S = sc.next();
String T = sc.next();
int maxMatch = 0;
for (int i = 0; i < S.length() - T.length() + 1; i++) {
int tmp = 0;
for (int j = 0; j < T.length(); j++) {
if (S.charAt(i + j) == T.charAt(j)) {
tmp++;
}
}
if (tmp > maxMatch) {
maxMatch = tmp;
}
}
System.out.println(T.length() - maxMatch);
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte())
return buffer[ptr++];
else
return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[ptr]))
ptr++;
return hasNextByte();
}
public String next() {
if (!hasNext())
throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext())
throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() {
return Double.parseDouble(next());
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
17,
42,
2,
40,
13,
17,
30,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
29,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
16,
17
],
[
16,
18
],
[
0,
19
],
[
19,
20
],
[
19,
21
],
[
0,
22
],
[
22,
23
],
[
22,
24
],
[
0,
25
],
[
25,
26
],
[
25,
27
],
[
0,
28
],
[
213,
29
],
[
213,
30
],
[
30,
31
],
[
30,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
32,
36
],
[
36,
37
],
[
36,
38
],
[
32,
39
],
[
39,
40
],
[
40,
41
],
[
41,
42
],
[
40,
43
],
[
39,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
47,
48
],
[
48,
49
],
[
44,
50
],
[
50,
51
],
[
50,
52
],
[
52,
53
],
[
53,
54
],
[
44,
55
],
[
55,
56
],
[
55,
57
],
[
44,
58
],
[
58,
59
],
[
59,
60
],
[
60,
61
],
[
60,
62
],
[
58,
63
],
[
63,
64
],
[
63,
65
],
[
65,
66
],
[
66,
67
],
[
67,
68
],
[
65,
69
],
[
69,
70
],
[
70,
71
],
[
58,
72
],
[
72,
73
],
[
73,
74
],
[
58,
75
],
[
76,
76
],
[
76,
77
],
[
77,
78
],
[
77,
79
],
[
76,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
82,
84
],
[
80,
85
],
[
85,
86
],
[
85,
87
],
[
87,
88
],
[
88,
89
],
[
80,
90
],
[
90,
91
],
[
91,
92
],
[
80,
93
],
[
94,
94
],
[
94,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
98,
99
],
[
97,
100
],
[
100,
101
],
[
100,
102
],
[
96,
103
],
[
103,
104
],
[
104,
105
],
[
103,
106
],
[
95,
107
],
[
107,
108
],
[
76,
109
],
[
109,
110
],
[
109,
111
],
[
111,
112
],
[
112,
113
],
[
111,
114
],
[
111,
115
],
[
44,
116
],
[
116,
117
],
[
117,
118
],
[
118,
119
],
[
118,
120
],
[
116,
121
],
[
30,
122
],
[
122,
123
],
[
213,
124
],
[
124,
125
],
[
124,
126
],
[
126,
127
],
[
124,
128
],
[
128,
129
],
[
124,
130
],
[
130,
131
],
[
130,
132
],
[
132,
133
],
[
133,
134
],
[
133,
135
],
[
124,
136
],
[
136,
137
],
[
136,
138
],
[
138,
139
],
[
139,
140
],
[
140,
141
],
[
141,
142
],
[
141,
143
],
[
140,
144
],
[
144,
145
],
[
145,
146
],
[
146,
147
],
[
139,
148
],
[
148,
149
],
[
149,
150
],
[
150,
151
],
[
150,
152
],
[
152,
153
],
[
153,
154
],
[
154,
155
],
[
149,
156
],
[
156,
157
],
[
157,
158
],
[
157,
159
],
[
138,
160
],
[
160,
161
],
[
161,
162
],
[
162,
163
],
[
124,
164
],
[
164,
165
],
[
164,
166
],
[
166,
167
],
[
167,
168
],
[
168,
169
],
[
169,
170
],
[
168,
171
],
[
171,
172
],
[
124,
173
],
[
173,
174
],
[
173,
175
],
[
175,
176
],
[
176,
177
],
[
177,
178
],
[
178,
179
],
[
177,
180
],
[
180,
181
],
[
124,
182
],
[
182,
183
],
[
182,
184
],
[
184,
185
],
[
185,
186
],
[
186,
187
],
[
187,
188
],
[
186,
189
],
[
189,
190
],
[
124,
191
],
[
191,
192
],
[
191,
193
],
[
193,
194
],
[
194,
195
],
[
194,
196
],
[
193,
197
],
[
197,
198
],
[
198,
199
],
[
198,
200
],
[
200,
201
],
[
201,
202
],
[
202,
203
],
[
197,
204
],
[
204,
205
],
[
205,
206
],
[
205,
207
],
[
207,
208
],
[
208,
209
],
[
193,
210
],
[
210,
211
],
[
0,
212
],
[
212,
213
],
[
212,
214
]
]
| [
"import java.util.*;\nimport java.util.Scanner;\nimport java.io.*;\nimport java.io.BufferedReader; \nimport java.io.IOException; \nimport java.io.InputStreamReader; \nimport java.util.Scanner; \nimport java.util.StringTokenizer;\n\nimport javax.lang.model.util.ElementScanner6; \n\npublic class Main\n{\n static class FastReader\n { \n BufferedReader br; \n StringTokenizer st; \n\n public FastReader() \n { \n br = new BufferedReader(new\n InputStreamReader(System.in)); \n } \n\n String next() \n { \n while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n } \n\n int nextInt() \n { \n return Integer.parseInt(next()); \n } \n\n long nextLong() \n { \n return Long.parseLong(next()); \n } \n\n double nextDouble() \n { \n return Double.parseDouble(next()); \n } \n\n String nextLine() \n { \n String str = \"\"; \n try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n return str; \n } \n } \n \n\n \n public static void main(String args[])\n { \n FastReader in=new FastReader();\n int t=1;\n //t=in.nextInt();\n while(t-->0)\n {\n String S=in.nextLine();\n String T=in.nextLine();\n\n \n int min=10001;\n for(int i=0;i<=S.length()-T.length();i++)\n {\n int count=0;\n for(int j=0;j<T.length();j++)\n {\n if(S.charAt(i+j)!=T.charAt(j))\n count++;\n }\n min=Math.min(count,min);\n }\n System.out.println(min);\n \n }\n }\n}",
"import java.util.*;",
"util.*",
"java",
"import java.util.Scanner;",
"Scanner",
"java.util",
"import java.io.*;",
"io.*",
"java",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.util.Scanner;",
"Scanner",
"java.util",
"import java.util.StringTokenizer;",
"StringTokenizer",
"java.util",
"import javax.lang.model.util.ElementScanner6;",
"ElementScanner6",
"javax.lang.model.util",
"public class Main\n{\n static class FastReader\n { \n BufferedReader br; \n StringTokenizer st; \n\n public FastReader() \n { \n br = new BufferedReader(new\n InputStreamReader(System.in)); \n } \n\n String next() \n { \n while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n } \n\n int nextInt() \n { \n return Integer.parseInt(next()); \n } \n\n long nextLong() \n { \n return Long.parseLong(next()); \n } \n\n double nextDouble() \n { \n return Double.parseDouble(next()); \n } \n\n String nextLine() \n { \n String str = \"\"; \n try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n return str; \n } \n } \n \n\n \n public static void main(String args[])\n { \n FastReader in=new FastReader();\n int t=1;\n //t=in.nextInt();\n while(t-->0)\n {\n String S=in.nextLine();\n String T=in.nextLine();\n\n \n int min=10001;\n for(int i=0;i<=S.length()-T.length();i++)\n {\n int count=0;\n for(int j=0;j<T.length();j++)\n {\n if(S.charAt(i+j)!=T.charAt(j))\n count++;\n }\n min=Math.min(count,min);\n }\n System.out.println(min);\n \n }\n }\n}",
"Main",
"public static void main(String args[])\n { \n FastReader in=new FastReader();\n int t=1;\n //t=in.nextInt();\n while(t-->0)\n {\n String S=in.nextLine();\n String T=in.nextLine();\n\n \n int min=10001;\n for(int i=0;i<=S.length()-T.length();i++)\n {\n int count=0;\n for(int j=0;j<T.length();j++)\n {\n if(S.charAt(i+j)!=T.charAt(j))\n count++;\n }\n min=Math.min(count,min);\n }\n System.out.println(min);\n \n }\n }",
"main",
"{ \n FastReader in=new FastReader();\n int t=1;\n //t=in.nextInt();\n while(t-->0)\n {\n String S=in.nextLine();\n String T=in.nextLine();\n\n \n int min=10001;\n for(int i=0;i<=S.length()-T.length();i++)\n {\n int count=0;\n for(int j=0;j<T.length();j++)\n {\n if(S.charAt(i+j)!=T.charAt(j))\n count++;\n }\n min=Math.min(count,min);\n }\n System.out.println(min);\n \n }\n }",
"FastReader in=new FastReader();",
"in",
"new FastReader()",
"int t=1;",
"t",
"1",
"while(t-->0)\n {\n String S=in.nextLine();\n String T=in.nextLine();\n\n \n int min=10001;\n for(int i=0;i<=S.length()-T.length();i++)\n {\n int count=0;\n for(int j=0;j<T.length();j++)\n {\n if(S.charAt(i+j)!=T.charAt(j))\n count++;\n }\n min=Math.min(count,min);\n }\n System.out.println(min);\n \n }",
"t-->0",
"t--",
"t",
"0",
"{\n String S=in.nextLine();\n String T=in.nextLine();\n\n \n int min=10001;\n for(int i=0;i<=S.length()-T.length();i++)\n {\n int count=0;\n for(int j=0;j<T.length();j++)\n {\n if(S.charAt(i+j)!=T.charAt(j))\n count++;\n }\n min=Math.min(count,min);\n }\n System.out.println(min);\n \n }",
"String S=in.nextLine();",
"S",
"in.nextLine()",
"in.nextLine",
"in",
"String T=in.nextLine();",
"T",
"in.nextLine()",
"in.nextLine",
"in",
"int min=10001;",
"min",
"10001",
"for(int i=0;i<=S.length()-T.length();i++)\n {\n int count=0;\n for(int j=0;j<T.length();j++)\n {\n if(S.charAt(i+j)!=T.charAt(j))\n count++;\n }\n min=Math.min(count,min);\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<=S.length()-T.length()",
"i",
"S.length()-T.length()",
"S.length()",
"S.length",
"S",
"T.length()",
"T.length",
"T",
"i++",
"i++",
"i",
"{\n int count=0;\n for(int j=0;j<T.length();j++)\n {\n if(S.charAt(i+j)!=T.charAt(j))\n count++;\n }\n min=Math.min(count,min);\n }",
"{\n int count=0;\n for(int j=0;j<T.length();j++)\n {\n if(S.charAt(i+j)!=T.charAt(j))\n count++;\n }\n min=Math.min(count,min);\n }",
"int count=0;",
"count",
"0",
"for(int j=0;j<T.length();j++)\n {\n if(S.charAt(i+j)!=T.charAt(j))\n count++;\n }",
"int j=0;",
"int j=0;",
"j",
"0",
"j<T.length()",
"j",
"T.length()",
"T.length",
"T",
"j++",
"j++",
"j",
"{\n if(S.charAt(i+j)!=T.charAt(j))\n count++;\n }",
"{\n if(S.charAt(i+j)!=T.charAt(j))\n count++;\n }",
"if(S.charAt(i+j)!=T.charAt(j))\n count++;",
"S.charAt(i+j)!=T.charAt(j)",
"S.charAt(i+j)",
"S.charAt",
"S",
"i+j",
"i",
"j",
"T.charAt(j)",
"T.charAt",
"T",
"j",
"count++",
"count",
"min=Math.min(count,min)",
"min",
"Math.min(count,min)",
"Math.min",
"Math",
"count",
"min",
"System.out.println(min)",
"System.out.println",
"System.out",
"System",
"System.out",
"min",
"String args[]",
"args",
"static class FastReader\n { \n BufferedReader br; \n StringTokenizer st; \n\n public FastReader() \n { \n br = new BufferedReader(new\n InputStreamReader(System.in)); \n } \n\n String next() \n { \n while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n } \n\n int nextInt() \n { \n return Integer.parseInt(next()); \n } \n\n long nextLong() \n { \n return Long.parseLong(next()); \n } \n\n double nextDouble() \n { \n return Double.parseDouble(next()); \n } \n\n String nextLine() \n { \n String str = \"\"; \n try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n return str; \n } \n }",
"FastReader",
"BufferedReader br;",
"br",
"StringTokenizer st;",
"st",
"public FastReader() \n { \n br = new BufferedReader(new\n InputStreamReader(System.in)); \n }",
"FastReader",
"{ \n br = new BufferedReader(new\n InputStreamReader(System.in)); \n }",
"br = new BufferedReader(new\n InputStreamReader(System.in))",
"br",
"new BufferedReader(new\n InputStreamReader(System.in))",
"String next() \n { \n while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n }",
"next",
"{ \n while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n }",
"while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n }",
"st == null || !st.hasMoreElements()",
"st == null",
"st",
"null",
"!st.hasMoreElements()",
"st.hasMoreElements()",
"st.hasMoreElements",
"st",
"{ \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n }",
"try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n }",
"catch (IOException e) \n { \n e.printStackTrace(); \n }",
"IOException e",
"{ \n e.printStackTrace(); \n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{ \n st = new StringTokenizer(br.readLine()); \n }",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"int nextInt() \n { \n return Integer.parseInt(next()); \n }",
"nextInt",
"{ \n return Integer.parseInt(next()); \n }",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"long nextLong() \n { \n return Long.parseLong(next()); \n }",
"nextLong",
"{ \n return Long.parseLong(next()); \n }",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"double nextDouble() \n { \n return Double.parseDouble(next()); \n }",
"nextDouble",
"{ \n return Double.parseDouble(next()); \n }",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"String nextLine() \n { \n String str = \"\"; \n try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n return str; \n }",
"nextLine",
"{ \n String str = \"\"; \n try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n return str; \n }",
"String str = \"\";",
"str",
"\"\"",
"try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n }",
"catch (IOException e) \n { \n e.printStackTrace(); \n }",
"IOException e",
"{ \n e.printStackTrace(); \n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{ \n str = br.readLine(); \n }",
"str = br.readLine()",
"str",
"br.readLine()",
"br.readLine",
"br",
"return str;",
"str",
"public class Main\n{\n static class FastReader\n { \n BufferedReader br; \n StringTokenizer st; \n\n public FastReader() \n { \n br = new BufferedReader(new\n InputStreamReader(System.in)); \n } \n\n String next() \n { \n while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n } \n\n int nextInt() \n { \n return Integer.parseInt(next()); \n } \n\n long nextLong() \n { \n return Long.parseLong(next()); \n } \n\n double nextDouble() \n { \n return Double.parseDouble(next()); \n } \n\n String nextLine() \n { \n String str = \"\"; \n try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n return str; \n } \n } \n \n\n \n public static void main(String args[])\n { \n FastReader in=new FastReader();\n int t=1;\n //t=in.nextInt();\n while(t-->0)\n {\n String S=in.nextLine();\n String T=in.nextLine();\n\n \n int min=10001;\n for(int i=0;i<=S.length()-T.length();i++)\n {\n int count=0;\n for(int j=0;j<T.length();j++)\n {\n if(S.charAt(i+j)!=T.charAt(j))\n count++;\n }\n min=Math.min(count,min);\n }\n System.out.println(min);\n \n }\n }\n}",
"public class Main\n{\n static class FastReader\n { \n BufferedReader br; \n StringTokenizer st; \n\n public FastReader() \n { \n br = new BufferedReader(new\n InputStreamReader(System.in)); \n } \n\n String next() \n { \n while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n } \n\n int nextInt() \n { \n return Integer.parseInt(next()); \n } \n\n long nextLong() \n { \n return Long.parseLong(next()); \n } \n\n double nextDouble() \n { \n return Double.parseDouble(next()); \n } \n\n String nextLine() \n { \n String str = \"\"; \n try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n return str; \n } \n } \n \n\n \n public static void main(String args[])\n { \n FastReader in=new FastReader();\n int t=1;\n //t=in.nextInt();\n while(t-->0)\n {\n String S=in.nextLine();\n String T=in.nextLine();\n\n \n int min=10001;\n for(int i=0;i<=S.length()-T.length();i++)\n {\n int count=0;\n for(int j=0;j<T.length();j++)\n {\n if(S.charAt(i+j)!=T.charAt(j))\n count++;\n }\n min=Math.min(count,min);\n }\n System.out.println(min);\n \n }\n }\n}",
"Main"
]
| import java.util.*;
import java.util.Scanner;
import java.io.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;
import javax.lang.model.util.ElementScanner6;
public class Main
{
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements())
{
try
{
st = new StringTokenizer(br.readLine());
}
catch (IOException e)
{
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt()
{
return Integer.parseInt(next());
}
long nextLong()
{
return Long.parseLong(next());
}
double nextDouble()
{
return Double.parseDouble(next());
}
String nextLine()
{
String str = "";
try
{
str = br.readLine();
}
catch (IOException e)
{
e.printStackTrace();
}
return str;
}
}
public static void main(String args[])
{
FastReader in=new FastReader();
int t=1;
//t=in.nextInt();
while(t-->0)
{
String S=in.nextLine();
String T=in.nextLine();
int min=10001;
for(int i=0;i<=S.length()-T.length();i++)
{
int count=0;
for(int j=0;j<T.length();j++)
{
if(S.charAt(i+j)!=T.charAt(j))
count++;
}
min=Math.min(count,min);
}
System.out.println(min);
}
}
} |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
17,
41,
13,
20,
41,
13,
20,
41,
13,
4,
18,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
2,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
13,
13,
4,
18,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
108,
8
],
[
108,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
11,
15
],
[
15,
16
],
[
15,
17
],
[
11,
18
],
[
18,
19
],
[
18,
20
],
[
11,
21
],
[
21,
22
],
[
21,
23
],
[
23,
24
],
[
24,
25
],
[
25,
26
],
[
26,
27
],
[
11,
28
],
[
28,
29
],
[
28,
30
],
[
30,
31
],
[
31,
32
],
[
32,
33
],
[
33,
34
],
[
11,
35
],
[
35,
36
],
[
35,
37
],
[
37,
38
],
[
37,
39
],
[
11,
40
],
[
40,
41
],
[
41,
42
],
[
42,
43
],
[
42,
44
],
[
40,
45
],
[
45,
46
],
[
45,
47
],
[
47,
48
],
[
48,
49
],
[
49,
50
],
[
47,
51
],
[
51,
52
],
[
52,
53
],
[
40,
54
],
[
54,
55
],
[
55,
56
],
[
40,
57
],
[
58,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
58,
62
],
[
62,
63
],
[
63,
64
],
[
64,
65
],
[
64,
66
],
[
62,
67
],
[
67,
68
],
[
67,
69
],
[
69,
70
],
[
70,
71
],
[
62,
72
],
[
72,
73
],
[
73,
74
],
[
62,
75
],
[
76,
76
],
[
76,
77
],
[
77,
78
],
[
78,
79
],
[
79,
80
],
[
80,
81
],
[
79,
82
],
[
78,
83
],
[
83,
84
],
[
84,
85
],
[
83,
86
],
[
86,
87
],
[
86,
88
],
[
77,
89
],
[
89,
90
],
[
58,
91
],
[
91,
92
],
[
91,
93
],
[
93,
94
],
[
94,
95
],
[
93,
96
],
[
93,
97
],
[
11,
98
],
[
98,
99
],
[
99,
100
],
[
98,
101
],
[
11,
102
],
[
102,
103
],
[
103,
104
],
[
9,
105
],
[
105,
106
],
[
0,
107
],
[
107,
108
],
[
107,
109
]
]
| [
"import java.util.*;\nimport java.io.*;\npublic class Main {\n\n\tpublic static void main(String[] args) throws Exception{\n\t\tint num = 998244353;\n\n\t\t// TODO Auto-generated method stub\n \t\tBufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n \t\tPrintWriter out = new PrintWriter(System.out);\n \t\tString s = bf.readLine().trim();\n \t\tString t = bf.readLine().trim();\n \t\tint min = Integer.MAX_VALUE;\n \t\tfor(int j = 0;j<=s.length()-t.length();j++){\n \t\t\tint count = 0;\n \t\t\tfor(int k = 0;k<t.length();k++){\n \t\t\t\tif (t.charAt(k) != s.charAt(j+k))\n \t\t\t\t\tcount++;\n \t\t\t}\n \t\t\tmin = Math.min(count, min);\n \t\t}\n \t\t\n \t\t\n \t\tout.println(min);\n\t \t\t\n \t\tout.close();\n \t\t\n \t\t\n \t\t\n \t}\n}\n \t\n \n//StringJoiner sj = new StringJoiner(\" \"); \n//sj.add(strings)\n//sj.toString() gives string of those stuff w spaces or whatever that sequence is\n\n \t\t\n \t\t\n \t\t\n \t\t\n\t\n\n",
"import java.util.*;",
"util.*",
"java",
"import java.io.*;",
"io.*",
"java",
"public class Main {\n\n\tpublic static void main(String[] args) throws Exception{\n\t\tint num = 998244353;\n\n\t\t// TODO Auto-generated method stub\n \t\tBufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n \t\tPrintWriter out = new PrintWriter(System.out);\n \t\tString s = bf.readLine().trim();\n \t\tString t = bf.readLine().trim();\n \t\tint min = Integer.MAX_VALUE;\n \t\tfor(int j = 0;j<=s.length()-t.length();j++){\n \t\t\tint count = 0;\n \t\t\tfor(int k = 0;k<t.length();k++){\n \t\t\t\tif (t.charAt(k) != s.charAt(j+k))\n \t\t\t\t\tcount++;\n \t\t\t}\n \t\t\tmin = Math.min(count, min);\n \t\t}\n \t\t\n \t\t\n \t\tout.println(min);\n\t \t\t\n \t\tout.close();\n \t\t\n \t\t\n \t\t\n \t}\n}",
"Main",
"public static void main(String[] args) throws Exception{\n\t\tint num = 998244353;\n\n\t\t// TODO Auto-generated method stub\n \t\tBufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n \t\tPrintWriter out = new PrintWriter(System.out);\n \t\tString s = bf.readLine().trim();\n \t\tString t = bf.readLine().trim();\n \t\tint min = Integer.MAX_VALUE;\n \t\tfor(int j = 0;j<=s.length()-t.length();j++){\n \t\t\tint count = 0;\n \t\t\tfor(int k = 0;k<t.length();k++){\n \t\t\t\tif (t.charAt(k) != s.charAt(j+k))\n \t\t\t\t\tcount++;\n \t\t\t}\n \t\t\tmin = Math.min(count, min);\n \t\t}\n \t\t\n \t\t\n \t\tout.println(min);\n\t \t\t\n \t\tout.close();\n \t\t\n \t\t\n \t\t\n \t}",
"main",
"{\n\t\tint num = 998244353;\n\n\t\t// TODO Auto-generated method stub\n \t\tBufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n \t\tPrintWriter out = new PrintWriter(System.out);\n \t\tString s = bf.readLine().trim();\n \t\tString t = bf.readLine().trim();\n \t\tint min = Integer.MAX_VALUE;\n \t\tfor(int j = 0;j<=s.length()-t.length();j++){\n \t\t\tint count = 0;\n \t\t\tfor(int k = 0;k<t.length();k++){\n \t\t\t\tif (t.charAt(k) != s.charAt(j+k))\n \t\t\t\t\tcount++;\n \t\t\t}\n \t\t\tmin = Math.min(count, min);\n \t\t}\n \t\t\n \t\t\n \t\tout.println(min);\n\t \t\t\n \t\tout.close();\n \t\t\n \t\t\n \t\t\n \t}",
"int num = 998244353;",
"num",
"998244353",
"BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));",
"bf",
"new BufferedReader(new InputStreamReader(System.in))",
"PrintWriter out = new PrintWriter(System.out);",
"out",
"new PrintWriter(System.out)",
"String s = bf.readLine().trim();",
"s",
"bf.readLine().trim()",
"bf.readLine().trim",
"bf.readLine()",
"bf.readLine",
"bf",
"String t = bf.readLine().trim();",
"t",
"bf.readLine().trim()",
"bf.readLine().trim",
"bf.readLine()",
"bf.readLine",
"bf",
"int min = Integer.MAX_VALUE;",
"min",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"for(int j = 0;j<=s.length()-t.length();j++){\n \t\t\tint count = 0;\n \t\t\tfor(int k = 0;k<t.length();k++){\n \t\t\t\tif (t.charAt(k) != s.charAt(j+k))\n \t\t\t\t\tcount++;\n \t\t\t}\n \t\t\tmin = Math.min(count, min);\n \t\t}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j<=s.length()-t.length()",
"j",
"s.length()-t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n \t\t\tint count = 0;\n \t\t\tfor(int k = 0;k<t.length();k++){\n \t\t\t\tif (t.charAt(k) != s.charAt(j+k))\n \t\t\t\t\tcount++;\n \t\t\t}\n \t\t\tmin = Math.min(count, min);\n \t\t}",
"{\n \t\t\tint count = 0;\n \t\t\tfor(int k = 0;k<t.length();k++){\n \t\t\t\tif (t.charAt(k) != s.charAt(j+k))\n \t\t\t\t\tcount++;\n \t\t\t}\n \t\t\tmin = Math.min(count, min);\n \t\t}",
"int count = 0;",
"count",
"0",
"for(int k = 0;k<t.length();k++){\n \t\t\t\tif (t.charAt(k) != s.charAt(j+k))\n \t\t\t\t\tcount++;\n \t\t\t}",
"int k = 0;",
"int k = 0;",
"k",
"0",
"k<t.length()",
"k",
"t.length()",
"t.length",
"t",
"k++",
"k++",
"k",
"{\n \t\t\t\tif (t.charAt(k) != s.charAt(j+k))\n \t\t\t\t\tcount++;\n \t\t\t}",
"{\n \t\t\t\tif (t.charAt(k) != s.charAt(j+k))\n \t\t\t\t\tcount++;\n \t\t\t}",
"if (t.charAt(k) != s.charAt(j+k))\n \t\t\t\t\tcount++;",
"t.charAt(k) != s.charAt(j+k)",
"t.charAt(k)",
"t.charAt",
"t",
"k",
"s.charAt(j+k)",
"s.charAt",
"s",
"j+k",
"j",
"k",
"count++",
"count",
"min = Math.min(count, min)",
"min",
"Math.min(count, min)",
"Math.min",
"Math",
"count",
"min",
"out.println(min)",
"out.println",
"out",
"min",
"out.close()",
"out.close",
"out",
"String[] args",
"args",
"public class Main {\n\n\tpublic static void main(String[] args) throws Exception{\n\t\tint num = 998244353;\n\n\t\t// TODO Auto-generated method stub\n \t\tBufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n \t\tPrintWriter out = new PrintWriter(System.out);\n \t\tString s = bf.readLine().trim();\n \t\tString t = bf.readLine().trim();\n \t\tint min = Integer.MAX_VALUE;\n \t\tfor(int j = 0;j<=s.length()-t.length();j++){\n \t\t\tint count = 0;\n \t\t\tfor(int k = 0;k<t.length();k++){\n \t\t\t\tif (t.charAt(k) != s.charAt(j+k))\n \t\t\t\t\tcount++;\n \t\t\t}\n \t\t\tmin = Math.min(count, min);\n \t\t}\n \t\t\n \t\t\n \t\tout.println(min);\n\t \t\t\n \t\tout.close();\n \t\t\n \t\t\n \t\t\n \t}\n}",
"public class Main {\n\n\tpublic static void main(String[] args) throws Exception{\n\t\tint num = 998244353;\n\n\t\t// TODO Auto-generated method stub\n \t\tBufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n \t\tPrintWriter out = new PrintWriter(System.out);\n \t\tString s = bf.readLine().trim();\n \t\tString t = bf.readLine().trim();\n \t\tint min = Integer.MAX_VALUE;\n \t\tfor(int j = 0;j<=s.length()-t.length();j++){\n \t\t\tint count = 0;\n \t\t\tfor(int k = 0;k<t.length();k++){\n \t\t\t\tif (t.charAt(k) != s.charAt(j+k))\n \t\t\t\t\tcount++;\n \t\t\t}\n \t\t\tmin = Math.min(count, min);\n \t\t}\n \t\t\n \t\t\n \t\tout.println(min);\n\t \t\t\n \t\tout.close();\n \t\t\n \t\t\n \t\t\n \t}\n}",
"Main"
]
| import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) throws Exception{
int num = 998244353;
// TODO Auto-generated method stub
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(System.out);
String s = bf.readLine().trim();
String t = bf.readLine().trim();
int min = Integer.MAX_VALUE;
for(int j = 0;j<=s.length()-t.length();j++){
int count = 0;
for(int k = 0;k<t.length();k++){
if (t.charAt(k) != s.charAt(j+k))
count++;
}
min = Math.min(count, min);
}
out.println(min);
out.close();
}
}
//StringJoiner sj = new StringJoiner(" ");
//sj.add(strings)
//sj.toString() gives string of those stuff w spaces or whatever that sequence is
|
[
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,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
2,
4,
18,
13,
4,
18,
13,
17,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
40,
13,
0,
13,
4,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
23,
13,
12,
13,
30,
42,
40,
4,
13,
0,
13,
20,
12,
13,
30,
29,
2,
2,
13,
17,
4,
18,
13,
12,
13,
30,
4,
13,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
170,
11
],
[
170,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
14,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
14,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
26,
27
],
[
14,
28
],
[
28,
29
],
[
28,
30
],
[
14,
31
],
[
31,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
31,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
41,
42
],
[
39,
43
],
[
43,
44
],
[
44,
45
],
[
38,
46
],
[
31,
47
],
[
47,
48
],
[
48,
49
],
[
31,
50
],
[
51,
51
],
[
51,
52
],
[
52,
53
],
[
52,
54
],
[
51,
55
],
[
55,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
55,
60
],
[
60,
61
],
[
60,
62
],
[
62,
63
],
[
63,
64
],
[
55,
65
],
[
65,
66
],
[
66,
67
],
[
55,
68
],
[
69,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
72,
75
],
[
75,
76
],
[
75,
77
],
[
71,
78
],
[
78,
79
],
[
79,
80
],
[
78,
81
],
[
70,
82
],
[
82,
83
],
[
51,
84
],
[
84,
85
],
[
84,
86
],
[
86,
87
],
[
86,
88
],
[
86,
89
],
[
14,
90
],
[
90,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
90,
95
],
[
12,
96
],
[
96,
97
],
[
170,
98
],
[
98,
99
],
[
98,
100
],
[
100,
101
],
[
98,
102
],
[
102,
103
],
[
98,
104
],
[
104,
105
],
[
104,
106
],
[
106,
107
],
[
107,
108
],
[
107,
109
],
[
104,
110
],
[
110,
111
],
[
98,
112
],
[
112,
113
],
[
112,
114
],
[
114,
115
],
[
115,
116
],
[
116,
117
],
[
117,
118
],
[
115,
119
],
[
119,
120
],
[
119,
121
],
[
98,
122
],
[
122,
123
],
[
122,
124
],
[
124,
125
],
[
125,
126
],
[
126,
127
],
[
127,
128
],
[
127,
129
],
[
126,
130
],
[
130,
131
],
[
131,
132
],
[
98,
133
],
[
133,
134
],
[
133,
135
],
[
135,
136
],
[
136,
137
],
[
135,
138
],
[
138,
139
],
[
139,
140
],
[
140,
141
],
[
98,
142
],
[
142,
143
],
[
142,
144
],
[
144,
145
],
[
145,
146
],
[
146,
147
],
[
147,
148
],
[
146,
149
],
[
149,
150
],
[
98,
151
],
[
151,
152
],
[
151,
153
],
[
153,
154
],
[
154,
155
],
[
155,
156
],
[
156,
157
],
[
155,
158
],
[
158,
159
],
[
98,
160
],
[
160,
161
],
[
160,
162
],
[
162,
163
],
[
163,
164
],
[
164,
165
],
[
165,
166
],
[
164,
167
],
[
167,
168
],
[
0,
169
],
[
169,
170
],
[
169,
171
]
]
| [
"import java.util.*;\nimport java.io.*;\nimport static java.lang.Math.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\t// 入力\n\t\tString s = sc.next();\n\t\tString t = sc.next();\n\t\t\n\t\t// 計算\n\t\tint result = 100000;\n\t\tfor(int i = 0; i < s.length()-t.length()+1; i++){\n\t\t int tmp = 0;\n\t\t for(int j = 0; j < t.length(); j++){\n\t\t if(s.charAt(i+j) != t.charAt(j)) tmp++;\n\t\t }\n\t\t result = min(result, tmp);\n\t\t}\n\t\t\n\t\t\n\t\t// 出力\n\t\tSystem.out.println(result);\n\t}\n\t\n\tpublic static class Scanner {\n\t\tprivate BufferedReader br; private StringTokenizer tok;\n\t\tpublic Scanner(InputStream is) throws IOException { br = new BufferedReader(new InputStreamReader(is));}\n\t\tprivate void getLine() throws IOException { while(!hasNext()) tok = new StringTokenizer(br.readLine());}\n\t\tprivate boolean hasNext() { return tok != null && tok.hasMoreTokens();}\n\t\tpublic String next() throws IOException { getLine(); return tok.nextToken();}\n\t\tpublic int nextInt() throws IOException { return Integer.parseInt(next());}\n\t\tpublic long nextLong() throws IOException { return Long.parseLong(next());}\n\t\tpublic double nextDouble() throws IOException { return Double.parseDouble(next());}\n\t}\n}",
"import java.util.*;",
"util.*",
"java",
"import java.io.*;",
"io.*",
"java",
"import static java.lang.Math.*;",
"import static java.lang.Math.*;",
"import static java.lang.Math.*;",
"public class Main {\n public static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\t// 入力\n\t\tString s = sc.next();\n\t\tString t = sc.next();\n\t\t\n\t\t// 計算\n\t\tint result = 100000;\n\t\tfor(int i = 0; i < s.length()-t.length()+1; i++){\n\t\t int tmp = 0;\n\t\t for(int j = 0; j < t.length(); j++){\n\t\t if(s.charAt(i+j) != t.charAt(j)) tmp++;\n\t\t }\n\t\t result = min(result, tmp);\n\t\t}\n\t\t\n\t\t\n\t\t// 出力\n\t\tSystem.out.println(result);\n\t}\n\t\n\tpublic static class Scanner {\n\t\tprivate BufferedReader br; private StringTokenizer tok;\n\t\tpublic Scanner(InputStream is) throws IOException { br = new BufferedReader(new InputStreamReader(is));}\n\t\tprivate void getLine() throws IOException { while(!hasNext()) tok = new StringTokenizer(br.readLine());}\n\t\tprivate boolean hasNext() { return tok != null && tok.hasMoreTokens();}\n\t\tpublic String next() throws IOException { getLine(); return tok.nextToken();}\n\t\tpublic int nextInt() throws IOException { return Integer.parseInt(next());}\n\t\tpublic long nextLong() throws IOException { return Long.parseLong(next());}\n\t\tpublic double nextDouble() throws IOException { return Double.parseDouble(next());}\n\t}\n}",
"Main",
"public static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\t// 入力\n\t\tString s = sc.next();\n\t\tString t = sc.next();\n\t\t\n\t\t// 計算\n\t\tint result = 100000;\n\t\tfor(int i = 0; i < s.length()-t.length()+1; i++){\n\t\t int tmp = 0;\n\t\t for(int j = 0; j < t.length(); j++){\n\t\t if(s.charAt(i+j) != t.charAt(j)) tmp++;\n\t\t }\n\t\t result = min(result, tmp);\n\t\t}\n\t\t\n\t\t\n\t\t// 出力\n\t\tSystem.out.println(result);\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\t// 入力\n\t\tString s = sc.next();\n\t\tString t = sc.next();\n\t\t\n\t\t// 計算\n\t\tint result = 100000;\n\t\tfor(int i = 0; i < s.length()-t.length()+1; i++){\n\t\t int tmp = 0;\n\t\t for(int j = 0; j < t.length(); j++){\n\t\t if(s.charAt(i+j) != t.charAt(j)) tmp++;\n\t\t }\n\t\t result = min(result, tmp);\n\t\t}\n\t\t\n\t\t\n\t\t// 出力\n\t\tSystem.out.println(result);\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String s = sc.next();",
"s",
"sc.next()",
"sc.next",
"sc",
"String t = sc.next();",
"t",
"sc.next()",
"sc.next",
"sc",
"int result = 100000;",
"result",
"100000",
"for(int i = 0; i < s.length()-t.length()+1; i++){\n\t\t int tmp = 0;\n\t\t for(int j = 0; j < t.length(); j++){\n\t\t if(s.charAt(i+j) != t.charAt(j)) tmp++;\n\t\t }\n\t\t result = min(result, tmp);\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < s.length()-t.length()+1",
"i",
"s.length()-t.length()+1",
"s.length()-t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"1",
"i++",
"i++",
"i",
"{\n\t\t int tmp = 0;\n\t\t for(int j = 0; j < t.length(); j++){\n\t\t if(s.charAt(i+j) != t.charAt(j)) tmp++;\n\t\t }\n\t\t result = min(result, tmp);\n\t\t}",
"{\n\t\t int tmp = 0;\n\t\t for(int j = 0; j < t.length(); j++){\n\t\t if(s.charAt(i+j) != t.charAt(j)) tmp++;\n\t\t }\n\t\t result = min(result, tmp);\n\t\t}",
"int tmp = 0;",
"tmp",
"0",
"for(int j = 0; j < t.length(); j++){\n\t\t if(s.charAt(i+j) != t.charAt(j)) tmp++;\n\t\t }",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n\t\t if(s.charAt(i+j) != t.charAt(j)) tmp++;\n\t\t }",
"{\n\t\t if(s.charAt(i+j) != t.charAt(j)) tmp++;\n\t\t }",
"if(s.charAt(i+j) != t.charAt(j)) tmp++;",
"s.charAt(i+j) != t.charAt(j)",
"s.charAt(i+j)",
"s.charAt",
"s",
"i+j",
"i",
"j",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"tmp++",
"tmp",
"result = min(result, tmp)",
"result",
"min(result, tmp)",
"min",
"result",
"tmp",
"System.out.println(result)",
"System.out.println",
"System.out",
"System",
"System.out",
"result",
"String[] args",
"args",
"public static class Scanner {\n\t\tprivate BufferedReader br; private StringTokenizer tok;\n\t\tpublic Scanner(InputStream is) throws IOException { br = new BufferedReader(new InputStreamReader(is));}\n\t\tprivate void getLine() throws IOException { while(!hasNext()) tok = new StringTokenizer(br.readLine());}\n\t\tprivate boolean hasNext() { return tok != null && tok.hasMoreTokens();}\n\t\tpublic String next() throws IOException { getLine(); return tok.nextToken();}\n\t\tpublic int nextInt() throws IOException { return Integer.parseInt(next());}\n\t\tpublic long nextLong() throws IOException { return Long.parseLong(next());}\n\t\tpublic double nextDouble() throws IOException { return Double.parseDouble(next());}\n\t}",
"Scanner",
"private BufferedReader br;",
"br",
"private StringTokenizer tok;",
"tok",
"public Scanner(InputStream is) throws IOException { br = new BufferedReader(new InputStreamReader(is));}",
"Scanner",
"{ br = new BufferedReader(new InputStreamReader(is));}",
"br = new BufferedReader(new InputStreamReader(is))",
"br",
"new BufferedReader(new InputStreamReader(is))",
"InputStream is",
"is",
"private void getLine() throws IOException { while(!hasNext()) tok = new StringTokenizer(br.readLine());}",
"getLine",
"{ while(!hasNext()) tok = new StringTokenizer(br.readLine());}",
"while(!hasNext()) tok = new StringTokenizer(br.readLine());",
"!hasNext()",
"hasNext()",
"hasNext",
"tok = new StringTokenizer(br.readLine())",
"tok",
"new StringTokenizer(br.readLine())",
"private boolean hasNext() { return tok != null && tok.hasMoreTokens();}",
"hasNext",
"{ return tok != null && tok.hasMoreTokens();}",
"return tok != null && tok.hasMoreTokens();",
"tok != null && tok.hasMoreTokens()",
"tok != null",
"tok",
"null",
"tok.hasMoreTokens()",
"tok.hasMoreTokens",
"tok",
"public String next() throws IOException { getLine(); return tok.nextToken();}",
"next",
"{ getLine(); return tok.nextToken();}",
"getLine()",
"getLine",
"return tok.nextToken();",
"tok.nextToken()",
"tok.nextToken",
"tok",
"public int nextInt() throws IOException { return Integer.parseInt(next());}",
"nextInt",
"{ return Integer.parseInt(next());}",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"public long nextLong() throws IOException { return Long.parseLong(next());}",
"nextLong",
"{ return Long.parseLong(next());}",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"public double nextDouble() throws IOException { return Double.parseDouble(next());}",
"nextDouble",
"{ return Double.parseDouble(next());}",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"public class Main {\n public static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\t// 入力\n\t\tString s = sc.next();\n\t\tString t = sc.next();\n\t\t\n\t\t// 計算\n\t\tint result = 100000;\n\t\tfor(int i = 0; i < s.length()-t.length()+1; i++){\n\t\t int tmp = 0;\n\t\t for(int j = 0; j < t.length(); j++){\n\t\t if(s.charAt(i+j) != t.charAt(j)) tmp++;\n\t\t }\n\t\t result = min(result, tmp);\n\t\t}\n\t\t\n\t\t\n\t\t// 出力\n\t\tSystem.out.println(result);\n\t}\n\t\n\tpublic static class Scanner {\n\t\tprivate BufferedReader br; private StringTokenizer tok;\n\t\tpublic Scanner(InputStream is) throws IOException { br = new BufferedReader(new InputStreamReader(is));}\n\t\tprivate void getLine() throws IOException { while(!hasNext()) tok = new StringTokenizer(br.readLine());}\n\t\tprivate boolean hasNext() { return tok != null && tok.hasMoreTokens();}\n\t\tpublic String next() throws IOException { getLine(); return tok.nextToken();}\n\t\tpublic int nextInt() throws IOException { return Integer.parseInt(next());}\n\t\tpublic long nextLong() throws IOException { return Long.parseLong(next());}\n\t\tpublic double nextDouble() throws IOException { return Double.parseDouble(next());}\n\t}\n}",
"public class Main {\n public static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\t// 入力\n\t\tString s = sc.next();\n\t\tString t = sc.next();\n\t\t\n\t\t// 計算\n\t\tint result = 100000;\n\t\tfor(int i = 0; i < s.length()-t.length()+1; i++){\n\t\t int tmp = 0;\n\t\t for(int j = 0; j < t.length(); j++){\n\t\t if(s.charAt(i+j) != t.charAt(j)) tmp++;\n\t\t }\n\t\t result = min(result, tmp);\n\t\t}\n\t\t\n\t\t\n\t\t// 出力\n\t\tSystem.out.println(result);\n\t}\n\t\n\tpublic static class Scanner {\n\t\tprivate BufferedReader br; private StringTokenizer tok;\n\t\tpublic Scanner(InputStream is) throws IOException { br = new BufferedReader(new InputStreamReader(is));}\n\t\tprivate void getLine() throws IOException { while(!hasNext()) tok = new StringTokenizer(br.readLine());}\n\t\tprivate boolean hasNext() { return tok != null && tok.hasMoreTokens();}\n\t\tpublic String next() throws IOException { getLine(); return tok.nextToken();}\n\t\tpublic int nextInt() throws IOException { return Integer.parseInt(next());}\n\t\tpublic long nextLong() throws IOException { return Long.parseLong(next());}\n\t\tpublic double nextDouble() throws IOException { return Double.parseDouble(next());}\n\t}\n}",
"Main"
]
| import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
// 入力
String s = sc.next();
String t = sc.next();
// 計算
int result = 100000;
for(int i = 0; i < s.length()-t.length()+1; i++){
int tmp = 0;
for(int j = 0; j < t.length(); j++){
if(s.charAt(i+j) != t.charAt(j)) tmp++;
}
result = min(result, tmp);
}
// 出力
System.out.println(result);
}
public static class Scanner {
private BufferedReader br; private StringTokenizer tok;
public Scanner(InputStream is) throws IOException { br = new BufferedReader(new InputStreamReader(is));}
private void getLine() throws IOException { while(!hasNext()) tok = new StringTokenizer(br.readLine());}
private boolean hasNext() { return tok != null && tok.hasMoreTokens();}
public String next() throws IOException { getLine(); return tok.nextToken();}
public int nextInt() throws IOException { return Integer.parseInt(next());}
public long nextLong() throws IOException { return Long.parseLong(next());}
public double nextDouble() throws IOException { return Double.parseDouble(next());}
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
41,
13,
2,
2,
4,
18,
13,
4,
18,
13,
17,
41,
13,
17,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
4,
18,
13,
13,
2,
13,
4,
18,
13,
0,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
40,
13,
14,
2,
13,
13,
0,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
113,
5
],
[
113,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
8,
24
],
[
24,
25
],
[
24,
26
],
[
26,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
27,
31
],
[
31,
32
],
[
32,
33
],
[
26,
34
],
[
8,
35
],
[
35,
36
],
[
35,
37
],
[
8,
38
],
[
38,
39
],
[
38,
40
],
[
40,
41
],
[
41,
42
],
[
8,
43
],
[
43,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
43,
48
],
[
48,
49
],
[
48,
50
],
[
43,
51
],
[
51,
52
],
[
52,
53
],
[
43,
54
],
[
55,
55
],
[
55,
56
],
[
56,
57
],
[
56,
58
],
[
58,
59
],
[
59,
60
],
[
58,
61
],
[
58,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
65,
66
],
[
55,
67
],
[
67,
68
],
[
67,
69
],
[
55,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
70,
75
],
[
75,
76
],
[
75,
77
],
[
77,
78
],
[
78,
79
],
[
70,
80
],
[
80,
81
],
[
81,
82
],
[
70,
83
],
[
84,
84
],
[
84,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
88,
89
],
[
87,
90
],
[
86,
91
],
[
91,
92
],
[
92,
93
],
[
91,
94
],
[
85,
95
],
[
95,
96
],
[
55,
97
],
[
97,
98
],
[
98,
99
],
[
98,
100
],
[
97,
101
],
[
101,
102
],
[
101,
103
],
[
8,
104
],
[
104,
105
],
[
105,
106
],
[
106,
107
],
[
106,
108
],
[
104,
109
],
[
6,
110
],
[
110,
111
],
[
0,
112
],
[
112,
113
],
[
112,
114
]
]
| [
"import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception{\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n \tString t = sc.next();\n \tString ss;\n \tint lim = s.length()-t.length()+1;\n \tint cnt=0;\n \tint cnt_min = t.length();\n \n \tfor(int i = 0;i < lim;i++){\n ss = s.substring(i,i+t.length());\n cnt = 0;\n for(int j = 0; j < t.length();j++){\n if(ss.charAt(j) != t.charAt(j)) cnt++;\n }\n if(cnt_min > cnt) cnt_min = cnt;\n }\n \n \tSystem.out.println(cnt_min);\n\t}\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n\tpublic static void main(String[] args) throws Exception{\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n \tString t = sc.next();\n \tString ss;\n \tint lim = s.length()-t.length()+1;\n \tint cnt=0;\n \tint cnt_min = t.length();\n \n \tfor(int i = 0;i < lim;i++){\n ss = s.substring(i,i+t.length());\n cnt = 0;\n for(int j = 0; j < t.length();j++){\n if(ss.charAt(j) != t.charAt(j)) cnt++;\n }\n if(cnt_min > cnt) cnt_min = cnt;\n }\n \n \tSystem.out.println(cnt_min);\n\t}\n}",
"Main",
"public static void main(String[] args) throws Exception{\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n \tString t = sc.next();\n \tString ss;\n \tint lim = s.length()-t.length()+1;\n \tint cnt=0;\n \tint cnt_min = t.length();\n \n \tfor(int i = 0;i < lim;i++){\n ss = s.substring(i,i+t.length());\n cnt = 0;\n for(int j = 0; j < t.length();j++){\n if(ss.charAt(j) != t.charAt(j)) cnt++;\n }\n if(cnt_min > cnt) cnt_min = cnt;\n }\n \n \tSystem.out.println(cnt_min);\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n \tString t = sc.next();\n \tString ss;\n \tint lim = s.length()-t.length()+1;\n \tint cnt=0;\n \tint cnt_min = t.length();\n \n \tfor(int i = 0;i < lim;i++){\n ss = s.substring(i,i+t.length());\n cnt = 0;\n for(int j = 0; j < t.length();j++){\n if(ss.charAt(j) != t.charAt(j)) cnt++;\n }\n if(cnt_min > cnt) cnt_min = cnt;\n }\n \n \tSystem.out.println(cnt_min);\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String s = sc.next();",
"s",
"sc.next()",
"sc.next",
"sc",
"String t = sc.next();",
"t",
"sc.next()",
"sc.next",
"sc",
"String ss;",
"ss",
"int lim = s.length()-t.length()+1;",
"lim",
"s.length()-t.length()+1",
"s.length()-t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"1",
"int cnt=0;",
"cnt",
"0",
"int cnt_min = t.length();",
"cnt_min",
"t.length()",
"t.length",
"t",
"for(int i = 0;i < lim;i++){\n ss = s.substring(i,i+t.length());\n cnt = 0;\n for(int j = 0; j < t.length();j++){\n if(ss.charAt(j) != t.charAt(j)) cnt++;\n }\n if(cnt_min > cnt) cnt_min = cnt;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < lim",
"i",
"lim",
"i++",
"i++",
"i",
"{\n ss = s.substring(i,i+t.length());\n cnt = 0;\n for(int j = 0; j < t.length();j++){\n if(ss.charAt(j) != t.charAt(j)) cnt++;\n }\n if(cnt_min > cnt) cnt_min = cnt;\n }",
"{\n ss = s.substring(i,i+t.length());\n cnt = 0;\n for(int j = 0; j < t.length();j++){\n if(ss.charAt(j) != t.charAt(j)) cnt++;\n }\n if(cnt_min > cnt) cnt_min = cnt;\n }",
"ss = s.substring(i,i+t.length())",
"ss",
"s.substring(i,i+t.length())",
"s.substring",
"s",
"i",
"i+t.length()",
"i",
"t.length()",
"t.length",
"t",
"cnt = 0",
"cnt",
"0",
"for(int j = 0; j < t.length();j++){\n if(ss.charAt(j) != t.charAt(j)) cnt++;\n }",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n if(ss.charAt(j) != t.charAt(j)) cnt++;\n }",
"{\n if(ss.charAt(j) != t.charAt(j)) cnt++;\n }",
"if(ss.charAt(j) != t.charAt(j)) cnt++;",
"ss.charAt(j) != t.charAt(j)",
"ss.charAt(j)",
"ss.charAt",
"ss",
"j",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"cnt++",
"cnt",
"if(cnt_min > cnt) cnt_min = cnt;",
"cnt_min > cnt",
"cnt_min",
"cnt",
"cnt_min = cnt",
"cnt_min",
"cnt",
"System.out.println(cnt_min)",
"System.out.println",
"System.out",
"System",
"System.out",
"cnt_min",
"String[] args",
"args",
"public class Main {\n\tpublic static void main(String[] args) throws Exception{\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n \tString t = sc.next();\n \tString ss;\n \tint lim = s.length()-t.length()+1;\n \tint cnt=0;\n \tint cnt_min = t.length();\n \n \tfor(int i = 0;i < lim;i++){\n ss = s.substring(i,i+t.length());\n cnt = 0;\n for(int j = 0; j < t.length();j++){\n if(ss.charAt(j) != t.charAt(j)) cnt++;\n }\n if(cnt_min > cnt) cnt_min = cnt;\n }\n \n \tSystem.out.println(cnt_min);\n\t}\n}",
"public class Main {\n\tpublic static void main(String[] args) throws Exception{\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n \tString t = sc.next();\n \tString ss;\n \tint lim = s.length()-t.length()+1;\n \tint cnt=0;\n \tint cnt_min = t.length();\n \n \tfor(int i = 0;i < lim;i++){\n ss = s.substring(i,i+t.length());\n cnt = 0;\n for(int j = 0; j < t.length();j++){\n if(ss.charAt(j) != t.charAt(j)) cnt++;\n }\n if(cnt_min > cnt) cnt_min = cnt;\n }\n \n \tSystem.out.println(cnt_min);\n\t}\n}",
"Main"
]
| import java.util.*;
public class Main {
public static void main(String[] args) throws Exception{
Scanner sc = new Scanner(System.in);
String s = sc.next();
String t = sc.next();
String ss;
int lim = s.length()-t.length()+1;
int cnt=0;
int cnt_min = t.length();
for(int i = 0;i < lim;i++){
ss = s.substring(i,i+t.length());
cnt = 0;
for(int j = 0; j < t.length();j++){
if(ss.charAt(j) != t.charAt(j)) cnt++;
}
if(cnt_min > cnt) cnt_min = cnt;
}
System.out.println(cnt_min);
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
13,
11,
1,
41,
13,
17,
2,
2,
13,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
8,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
17,
17,
0,
13,
4,
18,
13,
13,
13,
4,
18,
13,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
20,
4,
18,
20,
13,
13,
4,
18,
13,
4,
18,
13,
4,
18,
13,
23,
13,
6,
13,
41,
13,
2,
17,
17,
41,
13,
41,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
0,
13,
20,
13,
0,
13,
0,
13,
17,
12,
13,
30,
0,
13,
20,
0,
13,
20,
13,
0,
13,
0,
13,
17,
23,
13,
12,
13,
30,
41,
13,
20,
17,
41,
13,
17,
41,
13,
42,
2,
0,
13,
4,
13,
40,
17,
30,
14,
2,
13,
17,
3,
0,
18,
13,
40,
13,
13,
29,
20,
12,
13,
30,
41,
13,
17,
41,
13,
4,
13,
42,
2,
13,
17,
0,
13,
4,
13,
41,
13,
2,
13,
17,
14,
13,
0,
13,
4,
13,
42,
2,
2,
0,
13,
4,
13,
17,
2,
13,
17,
30,
0,
13,
2,
2,
2,
13,
17,
13,
17,
14,
13,
29,
40,
13,
29,
13,
12,
13,
30,
41,
13,
17,
41,
13,
4,
13,
42,
2,
13,
17,
0,
13,
4,
13,
41,
13,
2,
13,
17,
14,
13,
0,
13,
4,
13,
42,
2,
2,
0,
13,
4,
13,
17,
2,
13,
17,
30,
0,
13,
2,
2,
2,
13,
17,
13,
17,
14,
13,
29,
40,
13,
29,
13,
12,
13,
30,
41,
13,
17,
41,
13,
17,
41,
13,
4,
13,
42,
2,
13,
17,
0,
13,
4,
13,
41,
13,
2,
13,
17,
14,
13,
0,
13,
4,
13,
42,
2,
2,
0,
13,
4,
13,
17,
2,
13,
17,
30,
0,
13,
2,
2,
2,
13,
17,
13,
17,
14,
2,
13,
17,
30,
42,
2,
2,
0,
13,
4,
13,
17,
2,
13,
17,
30,
0,
13,
2,
2,
13,
17,
0,
13,
17,
14,
13,
29,
40,
13,
29,
13,
12,
13,
30,
0,
13,
4,
18,
13,
13,
0,
13,
17,
13,
14,
2,
13,
40,
17,
0,
18,
13,
17,
40,
17,
12,
13,
30,
14,
2,
13,
13,
4,
13,
29,
18,
13,
40,
13,
12,
13,
30,
14,
2,
13,
17,
29,
4,
18,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
456,
14
],
[
456,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
17,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
26,
27
],
[
17,
28
],
[
28,
29
],
[
28,
30
],
[
30,
31
],
[
31,
32
],
[
17,
33
],
[
33,
34
],
[
33,
35
],
[
17,
36
],
[
36,
37
],
[
37,
38
],
[
38,
39
],
[
38,
40
],
[
36,
41
],
[
41,
42
],
[
42,
43
],
[
42,
44
],
[
41,
45
],
[
45,
46
],
[
46,
47
],
[
36,
48
],
[
48,
49
],
[
49,
50
],
[
36,
51
],
[
52,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
52,
56
],
[
56,
57
],
[
57,
58
],
[
58,
59
],
[
58,
60
],
[
56,
61
],
[
61,
62
],
[
61,
63
],
[
56,
64
],
[
64,
65
],
[
65,
66
],
[
56,
67
],
[
68,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
74,
75
],
[
73,
76
],
[
76,
77
],
[
76,
78
],
[
72,
79
],
[
79,
80
],
[
80,
81
],
[
79,
82
],
[
71,
83
],
[
71,
84
],
[
52,
85
],
[
85,
86
],
[
85,
87
],
[
87,
88
],
[
88,
89
],
[
87,
90
],
[
87,
91
],
[
17,
92
],
[
92,
93
],
[
93,
94
],
[
92,
95
],
[
15,
96
],
[
96,
97
],
[
15,
98
],
[
98,
99
],
[
456,
100
],
[
100,
101
],
[
100,
102
],
[
102,
103
],
[
103,
104
],
[
103,
105
],
[
102,
106
],
[
106,
107
],
[
106,
108
],
[
102,
109
],
[
109,
110
],
[
110,
111
],
[
109,
112
],
[
109,
113
],
[
102,
114
],
[
114,
115
],
[
115,
116
],
[
102,
117
],
[
117,
118
],
[
118,
119
],
[
102,
120
],
[
120,
121
],
[
121,
122
],
[
100,
123
],
[
123,
124
],
[
456,
125
],
[
125,
126
],
[
125,
127
],
[
127,
128
],
[
127,
129
],
[
129,
130
],
[
129,
131
],
[
125,
132
],
[
132,
133
],
[
125,
134
],
[
134,
135
],
[
125,
136
],
[
136,
137
],
[
125,
138
],
[
138,
139
],
[
125,
140
],
[
140,
141
],
[
140,
142
],
[
142,
143
],
[
143,
144
],
[
143,
145
],
[
142,
146
],
[
146,
147
],
[
146,
148
],
[
142,
150
],
[
150,
151
],
[
150,
152
],
[
152,
153
],
[
152,
154
],
[
125,
155
],
[
155,
156
],
[
155,
157
],
[
157,
158
],
[
158,
159
],
[
158,
160
],
[
157,
161
],
[
161,
162
],
[
161,
163
],
[
157,
165
],
[
165,
166
],
[
165,
167
],
[
167,
168
],
[
167,
169
],
[
155,
170
],
[
170,
171
],
[
125,
172
],
[
172,
173
],
[
172,
174
],
[
174,
175
],
[
175,
176
],
[
175,
177
],
[
174,
179
],
[
179,
180
],
[
179,
181
],
[
174,
182
],
[
182,
183
],
[
174,
184
],
[
184,
185
],
[
185,
186
],
[
186,
187
],
[
186,
188
],
[
188,
189
],
[
185,
190
],
[
190,
191
],
[
184,
192
],
[
192,
193
],
[
193,
194
],
[
194,
195
],
[
194,
196
],
[
193,
197
],
[
192,
198
],
[
198,
199
],
[
199,
200
],
[
199,
201
],
[
201,
202
],
[
198,
203
],
[
174,
204
],
[
204,
205
],
[
125,
206
],
[
206,
207
],
[
206,
208
],
[
208,
209
],
[
209,
210
],
[
209,
211
],
[
208,
212
],
[
212,
213
],
[
212,
214
],
[
214,
215
],
[
208,
216
],
[
216,
217
],
[
217,
218
],
[
217,
219
],
[
216,
220
],
[
220,
221
],
[
220,
222
],
[
222,
223
],
[
208,
224
],
[
224,
225
],
[
224,
226
],
[
226,
227
],
[
226,
228
],
[
208,
229
],
[
229,
230
],
[
229,
231
],
[
231,
232
],
[
231,
233
],
[
233,
234
],
[
208,
235
],
[
235,
236
],
[
236,
237
],
[
237,
238
],
[
238,
239
],
[
238,
240
],
[
240,
241
],
[
237,
242
],
[
236,
243
],
[
243,
244
],
[
243,
245
],
[
235,
246
],
[
246,
247
],
[
247,
248
],
[
247,
249
],
[
249,
250
],
[
250,
251
],
[
251,
252
],
[
251,
253
],
[
250,
254
],
[
249,
255
],
[
208,
256
],
[
256,
257
],
[
256,
258
],
[
258,
259
],
[
259,
260
],
[
208,
261
],
[
261,
262
],
[
125,
263
],
[
263,
264
],
[
263,
265
],
[
265,
266
],
[
266,
267
],
[
266,
268
],
[
265,
269
],
[
269,
270
],
[
269,
271
],
[
271,
272
],
[
265,
273
],
[
273,
274
],
[
274,
275
],
[
274,
276
],
[
273,
277
],
[
277,
278
],
[
277,
279
],
[
279,
280
],
[
265,
281
],
[
281,
282
],
[
281,
283
],
[
283,
284
],
[
283,
285
],
[
265,
286
],
[
286,
287
],
[
286,
288
],
[
288,
289
],
[
288,
290
],
[
290,
291
],
[
265,
292
],
[
292,
293
],
[
293,
294
],
[
294,
295
],
[
295,
296
],
[
295,
297
],
[
297,
298
],
[
294,
299
],
[
293,
300
],
[
300,
301
],
[
300,
302
],
[
292,
303
],
[
303,
304
],
[
304,
305
],
[
304,
306
],
[
306,
307
],
[
307,
308
],
[
308,
309
],
[
308,
310
],
[
307,
311
],
[
306,
312
],
[
265,
313
],
[
313,
314
],
[
313,
315
],
[
315,
316
],
[
316,
317
],
[
265,
318
],
[
318,
319
],
[
125,
320
],
[
320,
321
],
[
320,
322
],
[
322,
323
],
[
323,
324
],
[
323,
325
],
[
322,
326
],
[
326,
327
],
[
326,
328
],
[
322,
329
],
[
329,
330
],
[
329,
331
],
[
331,
332
],
[
322,
333
],
[
333,
334
],
[
334,
335
],
[
334,
336
],
[
333,
337
],
[
337,
338
],
[
337,
339
],
[
339,
340
],
[
322,
341
],
[
341,
342
],
[
341,
343
],
[
343,
344
],
[
343,
345
],
[
322,
346
],
[
346,
347
],
[
346,
348
],
[
348,
349
],
[
348,
350
],
[
350,
351
],
[
322,
352
],
[
352,
353
],
[
353,
354
],
[
354,
355
],
[
355,
356
],
[
355,
357
],
[
357,
358
],
[
354,
359
],
[
353,
360
],
[
360,
361
],
[
360,
362
],
[
352,
363
],
[
363,
364
],
[
364,
365
],
[
364,
366
],
[
366,
367
],
[
367,
368
],
[
368,
369
],
[
368,
370
],
[
367,
371
],
[
366,
372
],
[
322,
373
],
[
373,
374
],
[
374,
375
],
[
374,
376
],
[
373,
377
],
[
377,
378
],
[
378,
379
],
[
379,
380
],
[
380,
381
],
[
381,
382
],
[
381,
383
],
[
383,
384
],
[
380,
385
],
[
379,
386
],
[
386,
387
],
[
386,
388
],
[
378,
389
],
[
389,
390
],
[
390,
391
],
[
390,
392
],
[
392,
393
],
[
393,
394
],
[
393,
395
],
[
392,
396
],
[
396,
397
],
[
396,
398
],
[
322,
399
],
[
399,
400
],
[
399,
401
],
[
401,
402
],
[
402,
403
],
[
322,
404
],
[
404,
405
],
[
125,
406
],
[
406,
407
],
[
406,
408
],
[
408,
409
],
[
409,
410
],
[
409,
411
],
[
411,
412
],
[
412,
413
],
[
411,
414
],
[
411,
415
],
[
415,
416
],
[
415,
417
],
[
411,
418
],
[
408,
419
],
[
419,
420
],
[
420,
421
],
[
420,
422
],
[
422,
423
],
[
419,
424
],
[
424,
425
],
[
425,
426
],
[
425,
427
],
[
424,
428
],
[
428,
429
],
[
125,
430
],
[
430,
431
],
[
430,
432
],
[
432,
433
],
[
433,
434
],
[
434,
435
],
[
434,
436
],
[
433,
437
],
[
437,
438
],
[
432,
439
],
[
439,
440
],
[
440,
441
],
[
440,
442
],
[
442,
443
],
[
125,
444
],
[
444,
445
],
[
444,
446
],
[
446,
447
],
[
447,
448
],
[
448,
449
],
[
448,
450
],
[
447,
451
],
[
446,
452
],
[
452,
453
],
[
453,
454
],
[
0,
455
],
[
455,
456
],
[
455,
457
]
]
| [
"import java.io.DataInputStream;\nimport java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.PrintWriter;\n\npublic class Main {\n static class Reader\n {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader()\n {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException\n {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException\n {\n byte[] buf = new byte[1_000_010]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1)\n {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException\n {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do\n {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg)\n return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException\n {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException\n {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.')\n {\n while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg)\n return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException\n {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n\n private byte read() throws IOException\n {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException\n {\n if (din == null)\n return;\n din.close();\n }\n }\n void solve(Reader sc, PrintWriter pw) throws IOException {\n String S = sc.readLine();\n String T = sc.readLine();\n int lenT = T.length();\n int result = lenT;\n for (int i = 0; i + lenT <= S.length(); i++) {\n int delta = 0;\n for (int d = 0; d < lenT; d++) {\n delta += S.charAt(i + d) == T.charAt(d) ? 0 : 1;\n }\n result = Math.min(result, delta);\n }\n pw.println(result);\n }\n public static void main(String[] args) throws IOException {\n Reader sc = new Reader();\n PrintWriter pw = new PrintWriter(System.out);\n// PrintWriter pw = new PrintWriter(System.out, true);\n new Main().solve(sc, pw);\n pw.flush();\n pw.close();\n sc.close();\n }\n}\n\n",
"import java.io.DataInputStream;",
"DataInputStream",
"java.io",
"import java.io.FileInputStream;",
"FileInputStream",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.PrintWriter;",
"PrintWriter",
"java.io",
"public class Main {\n static class Reader\n {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader()\n {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException\n {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException\n {\n byte[] buf = new byte[1_000_010]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1)\n {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException\n {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do\n {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg)\n return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException\n {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException\n {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.')\n {\n while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg)\n return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException\n {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n\n private byte read() throws IOException\n {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException\n {\n if (din == null)\n return;\n din.close();\n }\n }\n void solve(Reader sc, PrintWriter pw) throws IOException {\n String S = sc.readLine();\n String T = sc.readLine();\n int lenT = T.length();\n int result = lenT;\n for (int i = 0; i + lenT <= S.length(); i++) {\n int delta = 0;\n for (int d = 0; d < lenT; d++) {\n delta += S.charAt(i + d) == T.charAt(d) ? 0 : 1;\n }\n result = Math.min(result, delta);\n }\n pw.println(result);\n }\n public static void main(String[] args) throws IOException {\n Reader sc = new Reader();\n PrintWriter pw = new PrintWriter(System.out);\n// PrintWriter pw = new PrintWriter(System.out, true);\n new Main().solve(sc, pw);\n pw.flush();\n pw.close();\n sc.close();\n }\n}",
"Main",
"void solve(Reader sc, PrintWriter pw) throws IOException {\n String S = sc.readLine();\n String T = sc.readLine();\n int lenT = T.length();\n int result = lenT;\n for (int i = 0; i + lenT <= S.length(); i++) {\n int delta = 0;\n for (int d = 0; d < lenT; d++) {\n delta += S.charAt(i + d) == T.charAt(d) ? 0 : 1;\n }\n result = Math.min(result, delta);\n }\n pw.println(result);\n }",
"solve",
"{\n String S = sc.readLine();\n String T = sc.readLine();\n int lenT = T.length();\n int result = lenT;\n for (int i = 0; i + lenT <= S.length(); i++) {\n int delta = 0;\n for (int d = 0; d < lenT; d++) {\n delta += S.charAt(i + d) == T.charAt(d) ? 0 : 1;\n }\n result = Math.min(result, delta);\n }\n pw.println(result);\n }",
"String S = sc.readLine();",
"S",
"sc.readLine()",
"sc.readLine",
"sc",
"String T = sc.readLine();",
"T",
"sc.readLine()",
"sc.readLine",
"sc",
"int lenT = T.length();",
"lenT",
"T.length()",
"T.length",
"T",
"int result = lenT;",
"result",
"lenT",
"for (int i = 0; i + lenT <= S.length(); i++) {\n int delta = 0;\n for (int d = 0; d < lenT; d++) {\n delta += S.charAt(i + d) == T.charAt(d) ? 0 : 1;\n }\n result = Math.min(result, delta);\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i + lenT <= S.length()",
"i + lenT",
"i",
"lenT",
"S.length()",
"S.length",
"S",
"i++",
"i++",
"i",
"{\n int delta = 0;\n for (int d = 0; d < lenT; d++) {\n delta += S.charAt(i + d) == T.charAt(d) ? 0 : 1;\n }\n result = Math.min(result, delta);\n }",
"{\n int delta = 0;\n for (int d = 0; d < lenT; d++) {\n delta += S.charAt(i + d) == T.charAt(d) ? 0 : 1;\n }\n result = Math.min(result, delta);\n }",
"int delta = 0;",
"delta",
"0",
"for (int d = 0; d < lenT; d++) {\n delta += S.charAt(i + d) == T.charAt(d) ? 0 : 1;\n }",
"int d = 0;",
"int d = 0;",
"d",
"0",
"d < lenT",
"d",
"lenT",
"d++",
"d++",
"d",
"{\n delta += S.charAt(i + d) == T.charAt(d) ? 0 : 1;\n }",
"{\n delta += S.charAt(i + d) == T.charAt(d) ? 0 : 1;\n }",
"delta += S.charAt(i + d) == T.charAt(d) ? 0 : 1",
"delta",
"S.charAt(i + d) == T.charAt(d) ? 0 : 1",
"S.charAt(i + d) == T.charAt(d)",
"S.charAt(i + d)",
"S.charAt",
"S",
"i + d",
"i",
"d",
"T.charAt(d)",
"T.charAt",
"T",
"d",
"0",
"1",
"result = Math.min(result, delta)",
"result",
"Math.min(result, delta)",
"Math.min",
"Math",
"result",
"delta",
"pw.println(result)",
"pw.println",
"pw",
"result",
"Reader sc",
"sc",
"PrintWriter pw",
"pw",
"public static void main(String[] args) throws IOException {\n Reader sc = new Reader();\n PrintWriter pw = new PrintWriter(System.out);\n// PrintWriter pw = new PrintWriter(System.out, true);\n new Main().solve(sc, pw);\n pw.flush();\n pw.close();\n sc.close();\n }",
"main",
"{\n Reader sc = new Reader();\n PrintWriter pw = new PrintWriter(System.out);\n// PrintWriter pw = new PrintWriter(System.out, true);\n new Main().solve(sc, pw);\n pw.flush();\n pw.close();\n sc.close();\n }",
"Reader sc = new Reader();",
"sc",
"new Reader()",
"PrintWriter pw = new PrintWriter(System.out);",
"pw",
"new PrintWriter(System.out)",
"new Main().solve(sc, pw)",
"new Main().solve",
"new Main()",
"sc",
"pw",
"pw.flush()",
"pw.flush",
"pw",
"pw.close()",
"pw.close",
"pw",
"sc.close()",
"sc.close",
"sc",
"String[] args",
"args",
"static class Reader\n {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader()\n {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException\n {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException\n {\n byte[] buf = new byte[1_000_010]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1)\n {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException\n {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do\n {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg)\n return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException\n {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException\n {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.')\n {\n while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg)\n return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException\n {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n\n private byte read() throws IOException\n {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException\n {\n if (din == null)\n return;\n din.close();\n }\n }",
"Reader",
"final private int BUFFER_SIZE = 1 << 16;",
"BUFFER_SIZE",
"1 << 16",
"1",
"16",
"private DataInputStream din;",
"din",
"private byte[] buffer;",
"buffer",
"private int bufferPointer",
"bufferPointer",
"bytesRead;",
"bytesRead",
"public Reader()\n {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }",
"Reader",
"{\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }",
"din = new DataInputStream(System.in)",
"din",
"new DataInputStream(System.in)",
"buffer = new byte[BUFFER_SIZE]",
"buffer",
"new byte[BUFFER_SIZE]",
"BUFFER_SIZE",
"bufferPointer = bytesRead = 0",
"bufferPointer",
"bytesRead = 0",
"bytesRead",
"0",
"public Reader(String file_name) throws IOException\n {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }",
"Reader",
"{\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }",
"din = new DataInputStream(new FileInputStream(file_name))",
"din",
"new DataInputStream(new FileInputStream(file_name))",
"buffer = new byte[BUFFER_SIZE]",
"buffer",
"new byte[BUFFER_SIZE]",
"BUFFER_SIZE",
"bufferPointer = bytesRead = 0",
"bufferPointer",
"bytesRead = 0",
"bytesRead",
"0",
"String file_name",
"file_name",
"public String readLine() throws IOException\n {\n byte[] buf = new byte[1_000_010]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1)\n {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }",
"readLine",
"{\n byte[] buf = new byte[1_000_010]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1)\n {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }",
"byte[] buf = new byte[1_000_010];",
"buf",
"new byte[1_000_010]",
"1_000_010",
"int cnt = 0",
"cnt",
"0",
"c;",
"c",
"while ((c = read()) != -1)\n {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }",
"(c = read()) != -1",
"(c = read())",
"c",
"read()",
"read",
"-1",
"1",
"{\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }",
"if (c == '\\n')\n break;",
"c == '\\n'",
"c",
"'\\n'",
"break;",
"buf[cnt++] = (byte) c",
"buf[cnt++]",
"buf",
"cnt++",
"cnt",
"(byte) c",
"return new String(buf, 0, cnt);",
"new String(buf, 0, cnt)",
"public int nextInt() throws IOException\n {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do\n {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg)\n return -ret;\n return ret;\n }",
"nextInt",
"{\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do\n {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg)\n return -ret;\n return ret;\n }",
"int ret = 0;",
"ret",
"0",
"byte c = read();",
"c",
"read()",
"read",
"while (c <= ' ')\n c = read();",
"c <= ' '",
"c",
"' '",
"c = read()",
"c",
"read()",
"read",
"boolean neg = (c == '-');",
"neg",
"(c == '-')",
"c",
"'-'",
"if (neg)\n c = read();",
"neg",
"c = read()",
"c",
"read()",
"read",
"do\n {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');",
"(c = read()) >= '0' && c <= '9'",
"(c = read()) >= '0'",
"(c = read())",
"c",
"read()",
"read",
"'0'",
"c <= '9'",
"c",
"'9'",
"{\n ret = ret * 10 + c - '0';\n }",
"ret = ret * 10 + c - '0'",
"ret",
"ret * 10 + c - '0'",
"ret * 10 + c",
"ret * 10",
"ret",
"10",
"c",
"'0'",
"if (neg)\n return -ret;",
"neg",
"return -ret;",
"-ret",
"ret",
"return ret;",
"ret",
"public long nextLong() throws IOException\n {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }",
"nextLong",
"{\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }",
"long ret = 0;",
"ret",
"0",
"byte c = read();",
"c",
"read()",
"read",
"while (c <= ' ')\n c = read();",
"c <= ' '",
"c",
"' '",
"c = read()",
"c",
"read()",
"read",
"boolean neg = (c == '-');",
"neg",
"(c == '-')",
"c",
"'-'",
"if (neg)\n c = read();",
"neg",
"c = read()",
"c",
"read()",
"read",
"do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');",
"(c = read()) >= '0' && c <= '9'",
"(c = read()) >= '0'",
"(c = read())",
"c",
"read()",
"read",
"'0'",
"c <= '9'",
"c",
"'9'",
"{\n ret = ret * 10 + c - '0';\n }",
"ret = ret * 10 + c - '0'",
"ret",
"ret * 10 + c - '0'",
"ret * 10 + c",
"ret * 10",
"ret",
"10",
"c",
"'0'",
"if (neg)\n return -ret;",
"neg",
"return -ret;",
"-ret",
"ret",
"return ret;",
"ret",
"public double nextDouble() throws IOException\n {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.')\n {\n while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg)\n return -ret;\n return ret;\n }",
"nextDouble",
"{\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.')\n {\n while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg)\n return -ret;\n return ret;\n }",
"double ret = 0",
"ret",
"0",
"div = 1;",
"div",
"1",
"byte c = read();",
"c",
"read()",
"read",
"while (c <= ' ')\n c = read();",
"c <= ' '",
"c",
"' '",
"c = read()",
"c",
"read()",
"read",
"boolean neg = (c == '-');",
"neg",
"(c == '-')",
"c",
"'-'",
"if (neg)\n c = read();",
"neg",
"c = read()",
"c",
"read()",
"read",
"do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');",
"(c = read()) >= '0' && c <= '9'",
"(c = read()) >= '0'",
"(c = read())",
"c",
"read()",
"read",
"'0'",
"c <= '9'",
"c",
"'9'",
"{\n ret = ret * 10 + c - '0';\n }",
"ret = ret * 10 + c - '0'",
"ret",
"ret * 10 + c - '0'",
"ret * 10 + c",
"ret * 10",
"ret",
"10",
"c",
"'0'",
"if (c == '.')\n {\n while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }\n }",
"c == '.'",
"c",
"'.'",
"{\n while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }\n }",
"while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }",
"(c = read()) >= '0' && c <= '9'",
"(c = read()) >= '0'",
"(c = read())",
"c",
"read()",
"read",
"'0'",
"c <= '9'",
"c",
"'9'",
"{\n ret += (c - '0') / (div *= 10);\n }",
"ret += (c - '0') / (div *= 10)",
"ret",
"(c - '0') / (div *= 10)",
"(c - '0')",
"c",
"'0'",
"(div *= 10)",
"div",
"10",
"if (neg)\n return -ret;",
"neg",
"return -ret;",
"-ret",
"ret",
"return ret;",
"ret",
"private void fillBuffer() throws IOException\n {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }",
"fillBuffer",
"{\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }",
"bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE)",
"bytesRead",
"din.read(buffer, bufferPointer = 0, BUFFER_SIZE)",
"din.read",
"din",
"buffer",
"bufferPointer = 0",
"bufferPointer",
"0",
"BUFFER_SIZE",
"if (bytesRead == -1)\n buffer[0] = -1;",
"bytesRead == -1",
"bytesRead",
"-1",
"1",
"buffer[0] = -1",
"buffer[0]",
"buffer",
"0",
"-1",
"1",
"private byte read() throws IOException\n {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }",
"read",
"{\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }",
"if (bufferPointer == bytesRead)\n fillBuffer();",
"bufferPointer == bytesRead",
"bufferPointer",
"bytesRead",
"fillBuffer()",
"fillBuffer",
"return buffer[bufferPointer++];",
"buffer[bufferPointer++]",
"buffer",
"bufferPointer++",
"bufferPointer",
"public void close() throws IOException\n {\n if (din == null)\n return;\n din.close();\n }",
"close",
"{\n if (din == null)\n return;\n din.close();\n }",
"if (din == null)\n return;",
"din == null",
"din",
"null",
"return;",
"din.close()",
"din.close",
"din",
"public class Main {\n static class Reader\n {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader()\n {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException\n {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException\n {\n byte[] buf = new byte[1_000_010]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1)\n {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException\n {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do\n {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg)\n return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException\n {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException\n {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.')\n {\n while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg)\n return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException\n {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n\n private byte read() throws IOException\n {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException\n {\n if (din == null)\n return;\n din.close();\n }\n }\n void solve(Reader sc, PrintWriter pw) throws IOException {\n String S = sc.readLine();\n String T = sc.readLine();\n int lenT = T.length();\n int result = lenT;\n for (int i = 0; i + lenT <= S.length(); i++) {\n int delta = 0;\n for (int d = 0; d < lenT; d++) {\n delta += S.charAt(i + d) == T.charAt(d) ? 0 : 1;\n }\n result = Math.min(result, delta);\n }\n pw.println(result);\n }\n public static void main(String[] args) throws IOException {\n Reader sc = new Reader();\n PrintWriter pw = new PrintWriter(System.out);\n// PrintWriter pw = new PrintWriter(System.out, true);\n new Main().solve(sc, pw);\n pw.flush();\n pw.close();\n sc.close();\n }\n}",
"public class Main {\n static class Reader\n {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader()\n {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException\n {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException\n {\n byte[] buf = new byte[1_000_010]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1)\n {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException\n {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do\n {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg)\n return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException\n {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException\n {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.')\n {\n while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg)\n return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException\n {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n\n private byte read() throws IOException\n {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException\n {\n if (din == null)\n return;\n din.close();\n }\n }\n void solve(Reader sc, PrintWriter pw) throws IOException {\n String S = sc.readLine();\n String T = sc.readLine();\n int lenT = T.length();\n int result = lenT;\n for (int i = 0; i + lenT <= S.length(); i++) {\n int delta = 0;\n for (int d = 0; d < lenT; d++) {\n delta += S.charAt(i + d) == T.charAt(d) ? 0 : 1;\n }\n result = Math.min(result, delta);\n }\n pw.println(result);\n }\n public static void main(String[] args) throws IOException {\n Reader sc = new Reader();\n PrintWriter pw = new PrintWriter(System.out);\n// PrintWriter pw = new PrintWriter(System.out, true);\n new Main().solve(sc, pw);\n pw.flush();\n pw.close();\n sc.close();\n }\n}",
"Main"
]
| import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.PrintWriter;
public class Main {
static class Reader
{
final private int BUFFER_SIZE = 1 << 16;
private DataInputStream din;
private byte[] buffer;
private int bufferPointer, bytesRead;
public Reader()
{
din = new DataInputStream(System.in);
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}
public Reader(String file_name) throws IOException
{
din = new DataInputStream(new FileInputStream(file_name));
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}
public String readLine() throws IOException
{
byte[] buf = new byte[1_000_010]; // line length
int cnt = 0, c;
while ((c = read()) != -1)
{
if (c == '\n')
break;
buf[cnt++] = (byte) c;
}
return new String(buf, 0, cnt);
}
public int nextInt() throws IOException
{
int ret = 0;
byte c = read();
while (c <= ' ')
c = read();
boolean neg = (c == '-');
if (neg)
c = read();
do
{
ret = ret * 10 + c - '0';
} while ((c = read()) >= '0' && c <= '9');
if (neg)
return -ret;
return ret;
}
public long nextLong() throws IOException
{
long ret = 0;
byte c = read();
while (c <= ' ')
c = read();
boolean neg = (c == '-');
if (neg)
c = read();
do {
ret = ret * 10 + c - '0';
}
while ((c = read()) >= '0' && c <= '9');
if (neg)
return -ret;
return ret;
}
public double nextDouble() throws IOException
{
double ret = 0, div = 1;
byte c = read();
while (c <= ' ')
c = read();
boolean neg = (c == '-');
if (neg)
c = read();
do {
ret = ret * 10 + c - '0';
}
while ((c = read()) >= '0' && c <= '9');
if (c == '.')
{
while ((c = read()) >= '0' && c <= '9')
{
ret += (c - '0') / (div *= 10);
}
}
if (neg)
return -ret;
return ret;
}
private void fillBuffer() throws IOException
{
bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
if (bytesRead == -1)
buffer[0] = -1;
}
private byte read() throws IOException
{
if (bufferPointer == bytesRead)
fillBuffer();
return buffer[bufferPointer++];
}
public void close() throws IOException
{
if (din == null)
return;
din.close();
}
}
void solve(Reader sc, PrintWriter pw) throws IOException {
String S = sc.readLine();
String T = sc.readLine();
int lenT = T.length();
int result = lenT;
for (int i = 0; i + lenT <= S.length(); i++) {
int delta = 0;
for (int d = 0; d < lenT; d++) {
delta += S.charAt(i + d) == T.charAt(d) ? 0 : 1;
}
result = Math.min(result, delta);
}
pw.println(result);
}
public static void main(String[] args) throws IOException {
Reader sc = new Reader();
PrintWriter pw = new PrintWriter(System.out);
// PrintWriter pw = new PrintWriter(System.out, true);
new Main().solve(sc, pw);
pw.flush();
pw.close();
sc.close();
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
12,
13,
30,
41,
13,
20,
0,
13,
19,
18,
13,
4,
18,
13,
23,
13,
12,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
2,
4,
18,
13,
13,
17,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
30,
40,
13,
14,
2,
13,
13,
30,
0,
13,
13,
4,
18,
18,
13,
13,
2,
13,
13,
6,
13,
41,
13,
41,
13,
41,
13,
41,
13,
17,
12,
13,
30,
0,
13,
20,
17,
0,
13,
17,
0,
13,
20,
12,
13,
30,
38,
30,
4,
13,
30,
4,
18,
33,
12,
13,
30,
14,
2,
13,
17,
4,
18,
13,
12,
13,
30,
14,
2,
13,
18,
13,
13,
29,
18,
13,
40,
13,
41,
13,
4,
18,
13,
42,
2,
13,
17,
0,
13,
4,
18,
13,
0,
13,
4,
18,
13,
13,
17,
0,
13,
17,
29,
18,
13,
40,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
241,
11
],
[
241,
12
],
[
12,
13
],
[
241,
14
],
[
14,
15
],
[
14,
16
],
[
16,
17
],
[
17,
18
],
[
17,
19
],
[
16,
20
],
[
20,
21
],
[
20,
22
],
[
22,
23
],
[
23,
24
],
[
16,
25
],
[
25,
26
],
[
26,
27
],
[
14,
28
],
[
28,
29
],
[
241,
30
],
[
30,
31
],
[
30,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
34,
36
],
[
36,
37
],
[
37,
38
],
[
38,
39
],
[
33,
40
],
[
40,
41
],
[
41,
42
],
[
41,
43
],
[
43,
44
],
[
44,
45
],
[
40,
46
],
[
46,
47
],
[
46,
48
],
[
48,
49
],
[
49,
50
],
[
40,
51
],
[
51,
52
],
[
51,
53
],
[
53,
54
],
[
54,
55
],
[
40,
56
],
[
56,
57
],
[
56,
58
],
[
40,
59
],
[
59,
60
],
[
60,
61
],
[
61,
62
],
[
61,
63
],
[
59,
64
],
[
64,
65
],
[
64,
66
],
[
66,
67
],
[
67,
68
],
[
68,
69
],
[
69,
70
],
[
67,
71
],
[
66,
72
],
[
59,
73
],
[
73,
74
],
[
74,
75
],
[
59,
76
],
[
77,
77
],
[
77,
78
],
[
78,
79
],
[
78,
80
],
[
77,
81
],
[
81,
82
],
[
82,
83
],
[
83,
84
],
[
83,
85
],
[
81,
86
],
[
86,
87
],
[
86,
88
],
[
81,
89
],
[
89,
90
],
[
90,
91
],
[
81,
92
],
[
93,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
96,
99
],
[
99,
100
],
[
99,
101
],
[
95,
102
],
[
102,
103
],
[
103,
104
],
[
102,
105
],
[
94,
106
],
[
106,
107
],
[
107,
108
],
[
77,
109
],
[
109,
110
],
[
110,
111
],
[
110,
112
],
[
109,
113
],
[
113,
114
],
[
114,
115
],
[
114,
116
],
[
40,
117
],
[
117,
118
],
[
118,
119
],
[
119,
120
],
[
119,
121
],
[
117,
122
],
[
122,
123
],
[
122,
124
],
[
241,
125
],
[
125,
126
],
[
125,
127
],
[
127,
128
],
[
125,
129
],
[
129,
130
],
[
125,
131
],
[
131,
132
],
[
125,
133
],
[
133,
134
],
[
133,
135
],
[
125,
136
],
[
136,
137
],
[
136,
138
],
[
138,
139
],
[
139,
140
],
[
139,
141
],
[
138,
143
],
[
143,
144
],
[
143,
145
],
[
138,
146
],
[
146,
147
],
[
146,
148
],
[
125,
149
],
[
149,
150
],
[
149,
151
],
[
151,
152
],
[
152,
153
],
[
153,
154
],
[
154,
155
],
[
152,
156
],
[
156,
157
],
[
157,
158
],
[
158,
159
],
[
125,
160
],
[
160,
161
],
[
160,
162
],
[
162,
163
],
[
163,
164
],
[
164,
165
],
[
164,
166
],
[
163,
167
],
[
167,
168
],
[
168,
169
],
[
125,
170
],
[
170,
171
],
[
170,
172
],
[
172,
173
],
[
173,
174
],
[
174,
175
],
[
174,
176
],
[
176,
177
],
[
176,
178
],
[
173,
179
],
[
179,
180
],
[
180,
181
],
[
180,
182
],
[
182,
183
],
[
172,
184
],
[
184,
185
],
[
184,
186
],
[
186,
187
],
[
187,
188
],
[
172,
189
],
[
189,
190
],
[
190,
191
],
[
190,
192
],
[
189,
193
],
[
193,
194
],
[
193,
195
],
[
195,
196
],
[
196,
197
],
[
172,
198
],
[
198,
199
],
[
198,
200
],
[
200,
201
],
[
201,
202
],
[
200,
203
],
[
200,
204
],
[
172,
205
],
[
205,
206
],
[
205,
207
],
[
172,
208
],
[
208,
209
],
[
209,
210
],
[
209,
211
],
[
211,
212
],
[
125,
213
],
[
213,
214
],
[
213,
215
],
[
215,
216
],
[
216,
217
],
[
217,
218
],
[
218,
219
],
[
217,
220
],
[
220,
221
],
[
125,
222
],
[
222,
223
],
[
222,
224
],
[
224,
225
],
[
225,
226
],
[
226,
227
],
[
227,
228
],
[
226,
229
],
[
229,
230
],
[
125,
231
],
[
231,
232
],
[
231,
233
],
[
233,
234
],
[
234,
235
],
[
235,
236
],
[
236,
237
],
[
235,
238
],
[
238,
239
],
[
0,
240
],
[
240,
241
],
[
240,
242
]
]
| [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n private static Scanner sc;\n\n public static void main(String[] args) {\n Main instance = new Main();\n sc = instance.new Scanner();\n instance.solve();\n }\n\n private void solve() {\n try {\n String S = sc.next();\n String T = sc.next();\n int l = T.length();\n int cc = 0;\n for (int i = 0; i < S.length() - l + 1; i++) {\n \tint c = 0;\n \tfor (int j = 0; j < l; j++) {\n \t\tif (S.charAt(i + j) == T.charAt(j)) {\n \t\t\tc++;\n \t\t}\n \t}\n \tif (c > cc) {\n \t\tcc = c;\n \t}\n }\n System.out.println(l - cc);\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n\n private class Scanner {\n String[] s;\n int i;\n BufferedReader br;\n String regex = \" \";\n\n public Scanner() {\n s = new String[0];\n i = 0;\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n @Override\n protected void finalize() throws Throwable {\n try {\n super.finalize();\n } finally {\n destruction();\n }\n }\n\n private void destruction() throws IOException {\n if (br != null) br.close();\n }\n\n public String next() throws IOException {\n if (i < s.length) return s[i++];\n String st = br.readLine();\n while (st == \"\") st = br.readLine();\n s = st.split(regex, 0);\n i = 0;\n return s[i++];\n }\n\n public int nextInt() throws NumberFormatException, IOException {\n return Integer.parseInt(next());\n }\n\n public Long nextLong() throws NumberFormatException, IOException {\n return Long.parseLong(next());\n }\n\n public Double nextDouble() throws NumberFormatException, IOException {\n return Double.parseDouble(next());\n }\n }\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"public class Main {\n\n private static Scanner sc;\n\n public static void main(String[] args) {\n Main instance = new Main();\n sc = instance.new Scanner();\n instance.solve();\n }\n\n private void solve() {\n try {\n String S = sc.next();\n String T = sc.next();\n int l = T.length();\n int cc = 0;\n for (int i = 0; i < S.length() - l + 1; i++) {\n \tint c = 0;\n \tfor (int j = 0; j < l; j++) {\n \t\tif (S.charAt(i + j) == T.charAt(j)) {\n \t\t\tc++;\n \t\t}\n \t}\n \tif (c > cc) {\n \t\tcc = c;\n \t}\n }\n System.out.println(l - cc);\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n\n private class Scanner {\n String[] s;\n int i;\n BufferedReader br;\n String regex = \" \";\n\n public Scanner() {\n s = new String[0];\n i = 0;\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n @Override\n protected void finalize() throws Throwable {\n try {\n super.finalize();\n } finally {\n destruction();\n }\n }\n\n private void destruction() throws IOException {\n if (br != null) br.close();\n }\n\n public String next() throws IOException {\n if (i < s.length) return s[i++];\n String st = br.readLine();\n while (st == \"\") st = br.readLine();\n s = st.split(regex, 0);\n i = 0;\n return s[i++];\n }\n\n public int nextInt() throws NumberFormatException, IOException {\n return Integer.parseInt(next());\n }\n\n public Long nextLong() throws NumberFormatException, IOException {\n return Long.parseLong(next());\n }\n\n public Double nextDouble() throws NumberFormatException, IOException {\n return Double.parseDouble(next());\n }\n }\n}",
"Main",
"private static Scanner sc;",
"sc",
"public static void main(String[] args) {\n Main instance = new Main();\n sc = instance.new Scanner();\n instance.solve();\n }",
"main",
"{\n Main instance = new Main();\n sc = instance.new Scanner();\n instance.solve();\n }",
"Main instance = new Main();",
"instance",
"new Main()",
"sc = instance.new Scanner()",
"sc",
"instance.new Scanner()",
"instance",
"instance",
"instance.solve()",
"instance.solve",
"instance",
"String[] args",
"args",
"private void solve() {\n try {\n String S = sc.next();\n String T = sc.next();\n int l = T.length();\n int cc = 0;\n for (int i = 0; i < S.length() - l + 1; i++) {\n \tint c = 0;\n \tfor (int j = 0; j < l; j++) {\n \t\tif (S.charAt(i + j) == T.charAt(j)) {\n \t\t\tc++;\n \t\t}\n \t}\n \tif (c > cc) {\n \t\tcc = c;\n \t}\n }\n System.out.println(l - cc);\n } catch (Exception e) {\n e.printStackTrace();\n }\n }",
"solve",
"{\n try {\n String S = sc.next();\n String T = sc.next();\n int l = T.length();\n int cc = 0;\n for (int i = 0; i < S.length() - l + 1; i++) {\n \tint c = 0;\n \tfor (int j = 0; j < l; j++) {\n \t\tif (S.charAt(i + j) == T.charAt(j)) {\n \t\t\tc++;\n \t\t}\n \t}\n \tif (c > cc) {\n \t\tcc = c;\n \t}\n }\n System.out.println(l - cc);\n } catch (Exception e) {\n e.printStackTrace();\n }\n }",
"try {\n String S = sc.next();\n String T = sc.next();\n int l = T.length();\n int cc = 0;\n for (int i = 0; i < S.length() - l + 1; i++) {\n \tint c = 0;\n \tfor (int j = 0; j < l; j++) {\n \t\tif (S.charAt(i + j) == T.charAt(j)) {\n \t\t\tc++;\n \t\t}\n \t}\n \tif (c > cc) {\n \t\tcc = c;\n \t}\n }\n System.out.println(l - cc);\n } catch (Exception e) {\n e.printStackTrace();\n }",
"catch (Exception e) {\n e.printStackTrace();\n }",
"Exception e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n String S = sc.next();\n String T = sc.next();\n int l = T.length();\n int cc = 0;\n for (int i = 0; i < S.length() - l + 1; i++) {\n \tint c = 0;\n \tfor (int j = 0; j < l; j++) {\n \t\tif (S.charAt(i + j) == T.charAt(j)) {\n \t\t\tc++;\n \t\t}\n \t}\n \tif (c > cc) {\n \t\tcc = c;\n \t}\n }\n System.out.println(l - cc);\n }",
"String S = sc.next();",
"S",
"sc.next()",
"sc.next",
"sc",
"String T = sc.next();",
"T",
"sc.next()",
"sc.next",
"sc",
"int l = T.length();",
"l",
"T.length()",
"T.length",
"T",
"int cc = 0;",
"cc",
"0",
"for (int i = 0; i < S.length() - l + 1; i++) {\n \tint c = 0;\n \tfor (int j = 0; j < l; j++) {\n \t\tif (S.charAt(i + j) == T.charAt(j)) {\n \t\t\tc++;\n \t\t}\n \t}\n \tif (c > cc) {\n \t\tcc = c;\n \t}\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < S.length() - l + 1",
"i",
"S.length() - l + 1",
"S.length() - l",
"S.length()",
"S.length",
"S",
"l",
"1",
"i++",
"i++",
"i",
"{\n \tint c = 0;\n \tfor (int j = 0; j < l; j++) {\n \t\tif (S.charAt(i + j) == T.charAt(j)) {\n \t\t\tc++;\n \t\t}\n \t}\n \tif (c > cc) {\n \t\tcc = c;\n \t}\n }",
"{\n \tint c = 0;\n \tfor (int j = 0; j < l; j++) {\n \t\tif (S.charAt(i + j) == T.charAt(j)) {\n \t\t\tc++;\n \t\t}\n \t}\n \tif (c > cc) {\n \t\tcc = c;\n \t}\n }",
"int c = 0;",
"c",
"0",
"for (int j = 0; j < l; j++) {\n \t\tif (S.charAt(i + j) == T.charAt(j)) {\n \t\t\tc++;\n \t\t}\n \t}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < l",
"j",
"l",
"j++",
"j++",
"j",
"{\n \t\tif (S.charAt(i + j) == T.charAt(j)) {\n \t\t\tc++;\n \t\t}\n \t}",
"{\n \t\tif (S.charAt(i + j) == T.charAt(j)) {\n \t\t\tc++;\n \t\t}\n \t}",
"if (S.charAt(i + j) == T.charAt(j)) {\n \t\t\tc++;\n \t\t}",
"S.charAt(i + j) == T.charAt(j)",
"S.charAt(i + j)",
"S.charAt",
"S",
"i + j",
"i",
"j",
"T.charAt(j)",
"T.charAt",
"T",
"j",
"{\n \t\t\tc++;\n \t\t}",
"c++",
"c",
"if (c > cc) {\n \t\tcc = c;\n \t}",
"c > cc",
"c",
"cc",
"{\n \t\tcc = c;\n \t}",
"cc = c",
"cc",
"c",
"System.out.println(l - cc)",
"System.out.println",
"System.out",
"System",
"System.out",
"l - cc",
"l",
"cc",
"private class Scanner {\n String[] s;\n int i;\n BufferedReader br;\n String regex = \" \";\n\n public Scanner() {\n s = new String[0];\n i = 0;\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n @Override\n protected void finalize() throws Throwable {\n try {\n super.finalize();\n } finally {\n destruction();\n }\n }\n\n private void destruction() throws IOException {\n if (br != null) br.close();\n }\n\n public String next() throws IOException {\n if (i < s.length) return s[i++];\n String st = br.readLine();\n while (st == \"\") st = br.readLine();\n s = st.split(regex, 0);\n i = 0;\n return s[i++];\n }\n\n public int nextInt() throws NumberFormatException, IOException {\n return Integer.parseInt(next());\n }\n\n public Long nextLong() throws NumberFormatException, IOException {\n return Long.parseLong(next());\n }\n\n public Double nextDouble() throws NumberFormatException, IOException {\n return Double.parseDouble(next());\n }\n }",
"Scanner",
"String[] s;",
"s",
"int i;",
"i",
"BufferedReader br;",
"br",
"String regex = \" \";",
"regex",
"\" \"",
"public Scanner() {\n s = new String[0];\n i = 0;\n br = new BufferedReader(new InputStreamReader(System.in));\n }",
"Scanner",
"{\n s = new String[0];\n i = 0;\n br = new BufferedReader(new InputStreamReader(System.in));\n }",
"s = new String[0]",
"s",
"new String[0]",
"0",
"i = 0",
"i",
"0",
"br = new BufferedReader(new InputStreamReader(System.in))",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"@Override\n protected void finalize() throws Throwable {\n try {\n super.finalize();\n } finally {\n destruction();\n }\n }",
"finalize",
"{\n try {\n super.finalize();\n } finally {\n destruction();\n }\n }",
"try {\n super.finalize();\n } finally {\n destruction();\n }",
"{\n destruction();\n }",
"destruction()",
"destruction",
"{\n super.finalize();\n }",
"super.finalize()",
"super.finalize",
"super",
"private void destruction() throws IOException {\n if (br != null) br.close();\n }",
"destruction",
"{\n if (br != null) br.close();\n }",
"if (br != null) br.close();",
"br != null",
"br",
"null",
"br.close()",
"br.close",
"br",
"public String next() throws IOException {\n if (i < s.length) return s[i++];\n String st = br.readLine();\n while (st == \"\") st = br.readLine();\n s = st.split(regex, 0);\n i = 0;\n return s[i++];\n }",
"next",
"{\n if (i < s.length) return s[i++];\n String st = br.readLine();\n while (st == \"\") st = br.readLine();\n s = st.split(regex, 0);\n i = 0;\n return s[i++];\n }",
"if (i < s.length) return s[i++];",
"i < s.length",
"i",
"s.length",
"s",
"s.length",
"return s[i++];",
"s[i++]",
"s",
"i++",
"i",
"String st = br.readLine();",
"st",
"br.readLine()",
"br.readLine",
"br",
"while (st == \"\") st = br.readLine();",
"st == \"\"",
"st",
"\"\"",
"st = br.readLine()",
"st",
"br.readLine()",
"br.readLine",
"br",
"s = st.split(regex, 0)",
"s",
"st.split(regex, 0)",
"st.split",
"st",
"regex",
"0",
"i = 0",
"i",
"0",
"return s[i++];",
"s[i++]",
"s",
"i++",
"i",
"public int nextInt() throws NumberFormatException, IOException {\n return Integer.parseInt(next());\n }",
"nextInt",
"{\n return Integer.parseInt(next());\n }",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"public Long nextLong() throws NumberFormatException, IOException {\n return Long.parseLong(next());\n }",
"nextLong",
"{\n return Long.parseLong(next());\n }",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"public Double nextDouble() throws NumberFormatException, IOException {\n return Double.parseDouble(next());\n }",
"nextDouble",
"{\n return Double.parseDouble(next());\n }",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"public class Main {\n\n private static Scanner sc;\n\n public static void main(String[] args) {\n Main instance = new Main();\n sc = instance.new Scanner();\n instance.solve();\n }\n\n private void solve() {\n try {\n String S = sc.next();\n String T = sc.next();\n int l = T.length();\n int cc = 0;\n for (int i = 0; i < S.length() - l + 1; i++) {\n \tint c = 0;\n \tfor (int j = 0; j < l; j++) {\n \t\tif (S.charAt(i + j) == T.charAt(j)) {\n \t\t\tc++;\n \t\t}\n \t}\n \tif (c > cc) {\n \t\tcc = c;\n \t}\n }\n System.out.println(l - cc);\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n\n private class Scanner {\n String[] s;\n int i;\n BufferedReader br;\n String regex = \" \";\n\n public Scanner() {\n s = new String[0];\n i = 0;\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n @Override\n protected void finalize() throws Throwable {\n try {\n super.finalize();\n } finally {\n destruction();\n }\n }\n\n private void destruction() throws IOException {\n if (br != null) br.close();\n }\n\n public String next() throws IOException {\n if (i < s.length) return s[i++];\n String st = br.readLine();\n while (st == \"\") st = br.readLine();\n s = st.split(regex, 0);\n i = 0;\n return s[i++];\n }\n\n public int nextInt() throws NumberFormatException, IOException {\n return Integer.parseInt(next());\n }\n\n public Long nextLong() throws NumberFormatException, IOException {\n return Long.parseLong(next());\n }\n\n public Double nextDouble() throws NumberFormatException, IOException {\n return Double.parseDouble(next());\n }\n }\n}",
"public class Main {\n\n private static Scanner sc;\n\n public static void main(String[] args) {\n Main instance = new Main();\n sc = instance.new Scanner();\n instance.solve();\n }\n\n private void solve() {\n try {\n String S = sc.next();\n String T = sc.next();\n int l = T.length();\n int cc = 0;\n for (int i = 0; i < S.length() - l + 1; i++) {\n \tint c = 0;\n \tfor (int j = 0; j < l; j++) {\n \t\tif (S.charAt(i + j) == T.charAt(j)) {\n \t\t\tc++;\n \t\t}\n \t}\n \tif (c > cc) {\n \t\tcc = c;\n \t}\n }\n System.out.println(l - cc);\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n\n private class Scanner {\n String[] s;\n int i;\n BufferedReader br;\n String regex = \" \";\n\n public Scanner() {\n s = new String[0];\n i = 0;\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n @Override\n protected void finalize() throws Throwable {\n try {\n super.finalize();\n } finally {\n destruction();\n }\n }\n\n private void destruction() throws IOException {\n if (br != null) br.close();\n }\n\n public String next() throws IOException {\n if (i < s.length) return s[i++];\n String st = br.readLine();\n while (st == \"\") st = br.readLine();\n s = st.split(regex, 0);\n i = 0;\n return s[i++];\n }\n\n public int nextInt() throws NumberFormatException, IOException {\n return Integer.parseInt(next());\n }\n\n public Long nextLong() throws NumberFormatException, IOException {\n return Long.parseLong(next());\n }\n\n public Double nextDouble() throws NumberFormatException, IOException {\n return Double.parseDouble(next());\n }\n }\n}",
"Main"
]
| import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
private static Scanner sc;
public static void main(String[] args) {
Main instance = new Main();
sc = instance.new Scanner();
instance.solve();
}
private void solve() {
try {
String S = sc.next();
String T = sc.next();
int l = T.length();
int cc = 0;
for (int i = 0; i < S.length() - l + 1; i++) {
int c = 0;
for (int j = 0; j < l; j++) {
if (S.charAt(i + j) == T.charAt(j)) {
c++;
}
}
if (c > cc) {
cc = c;
}
}
System.out.println(l - cc);
} catch (Exception e) {
e.printStackTrace();
}
}
private class Scanner {
String[] s;
int i;
BufferedReader br;
String regex = " ";
public Scanner() {
s = new String[0];
i = 0;
br = new BufferedReader(new InputStreamReader(System.in));
}
@Override
protected void finalize() throws Throwable {
try {
super.finalize();
} finally {
destruction();
}
}
private void destruction() throws IOException {
if (br != null) br.close();
}
public String next() throws IOException {
if (i < s.length) return s[i++];
String st = br.readLine();
while (st == "") st = br.readLine();
s = st.split(regex, 0);
i = 0;
return s[i++];
}
public int nextInt() throws NumberFormatException, IOException {
return Integer.parseInt(next());
}
public Long nextLong() throws NumberFormatException, IOException {
return Long.parseLong(next());
}
public Double nextDouble() throws NumberFormatException, IOException {
return Double.parseDouble(next());
}
}
} |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
20,
41,
13,
41,
13,
41,
13,
2,
17,
17,
12,
13,
30,
0,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
2,
4,
18,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
4,
13,
13,
4,
13,
13,
13,
13,
4,
18,
13,
13,
4,
18,
13,
23,
13,
12,
13,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
2,
13,
13,
40,
13,
29,
13,
23,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
18,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
13,
13,
0,
13,
18,
13,
13,
29,
13,
23,
13,
6,
13,
41,
13,
2,
17,
17,
41,
13,
12,
13,
30,
0,
13,
20,
12,
13,
30,
4,
18,
13,
13,
29,
36,
23,
13,
12,
13,
30,
4,
18,
13,
4,
18,
13,
13,
13,
29,
36,
23,
13,
23,
13,
12,
13,
30,
28,
13,
13,
30,
30,
4,
18,
4,
18,
13,
13,
17,
4,
18,
13,
17,
29,
36,
23,
13,
12,
13,
30,
28,
13,
13,
30,
30,
4,
18,
4,
18,
13,
13,
17,
4,
18,
13,
17,
29,
36,
23,
13,
12,
13,
30,
28,
13,
13,
30,
30,
4,
18,
4,
18,
13,
13,
17,
4,
18,
13,
17,
29,
36,
23,
13,
12,
13,
30,
28,
13,
13,
30,
30,
4,
18,
4,
18,
13,
13,
17,
4,
18,
13,
17,
29,
36,
23,
13,
12,
13,
30,
4,
18,
4,
18,
13,
4,
18,
13,
13,
17,
23,
13,
12,
13,
30,
4,
18,
4,
18,
13,
4,
18,
13,
13,
17,
23,
13,
12,
13,
30,
4,
18,
4,
18,
13,
4,
18,
13,
13,
17,
23,
13,
12,
13,
30,
4,
18,
4,
18,
13,
4,
18,
13,
13,
17,
23,
13,
12,
13,
30,
4,
18,
4,
18,
13,
4,
18,
13,
13,
17,
23,
13,
12,
13,
30,
4,
18,
4,
18,
13,
4,
18,
13,
13,
17,
23,
13,
12,
13,
30,
28,
13,
13,
30,
4,
18,
4,
18,
13,
4,
18,
13,
13,
17,
23,
13,
12,
13,
30,
28,
13,
13,
30,
4,
18,
4,
18,
13,
4,
18,
13,
13,
17,
23,
13,
12,
13,
30,
28,
13,
13,
30,
4,
18,
4,
18,
13,
4,
18,
13,
13,
17,
23,
13,
12,
13,
30,
28,
13,
13,
30,
4,
18,
4,
18,
13,
4,
18,
13,
13,
17,
23,
13,
12,
13,
30,
28,
13,
13,
30,
4,
18,
4,
18,
13,
4,
18,
13,
13,
17,
23,
13,
12,
13,
30,
4,
18,
4,
18,
13,
13,
17,
29,
36,
23,
13,
12,
13,
30,
41,
13,
20,
4,
18,
13,
4,
18,
13,
4,
18,
13,
23,
13,
12,
13,
30,
4,
18,
18,
13,
13,
13,
6,
13,
41,
13,
18,
13,
13,
41,
13,
20,
17,
41,
13,
17,
41,
13,
17,
12,
13,
30,
12,
13,
30,
41,
13,
20,
0,
13,
20,
23,
13,
12,
13,
30,
14,
2,
13,
13,
30,
29,
17,
30,
0,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
13,
14,
2,
13,
17,
30,
29,
17,
29,
17,
12,
13,
30,
14,
4,
13,
29,
18,
13,
40,
13,
29,
40,
17,
12,
13,
30,
29,
2,
2,
17,
13,
2,
13,
17,
23,
13,
12,
13,
30,
42,
2,
4,
13,
40,
4,
13,
18,
13,
13,
40,
13,
29,
4,
13,
12,
13,
30,
14,
40,
4,
13,
37,
20,
41,
13,
20,
41,
13,
4,
13,
42,
4,
13,
13,
30,
4,
18,
13,
13,
0,
13,
4,
13,
29,
4,
18,
13,
12,
13,
30,
14,
40,
4,
13,
37,
20,
41,
13,
17,
41,
13,
17,
41,
13,
4,
13,
14,
2,
13,
17,
30,
0,
13,
17,
0,
13,
4,
13,
14,
2,
2,
13,
17,
2,
17,
13,
30,
37,
20,
42,
17,
30,
14,
2,
2,
17,
13,
2,
13,
17,
30,
0,
13,
17,
0,
13,
2,
13,
17,
14,
2,
2,
2,
13,
40,
17,
40,
4,
13,
13,
2,
13,
17,
30,
29,
8,
13,
40,
13,
13,
30,
37,
20,
0,
13,
4,
13,
12,
13,
30,
41,
13,
4,
13,
14,
2,
2,
13,
18,
13,
13,
2,
13,
18,
13,
13,
37,
20,
29,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
2,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
20,
29,
13,
23,
13,
12,
13,
30,
29,
4,
13,
13,
13,
17,
23,
13,
23,
13,
12,
13,
30,
0,
13,
4,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
13,
41,
13,
4,
13,
4,
18,
18,
13,
13,
13,
14,
40,
13,
4,
18,
18,
13,
13,
13,
29,
13,
23,
13,
23,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
980,
8
],
[
980,
9
],
[
9,
10
],
[
9,
11
],
[
980,
12
],
[
12,
13
],
[
980,
14
],
[
14,
15
],
[
980,
16
],
[
16,
17
],
[
16,
18
],
[
18,
19
],
[
18,
20
],
[
980,
21
],
[
21,
22
],
[
21,
23
],
[
23,
24
],
[
24,
25
],
[
24,
26
],
[
23,
27
],
[
27,
28
],
[
27,
29
],
[
29,
30
],
[
30,
31
],
[
23,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
35,
36
],
[
23,
37
],
[
37,
38
],
[
37,
39
],
[
39,
40
],
[
40,
41
],
[
41,
42
],
[
39,
43
],
[
43,
44
],
[
44,
45
],
[
23,
46
],
[
46,
47
],
[
46,
48
],
[
48,
49
],
[
49,
50
],
[
23,
51
],
[
51,
52
],
[
51,
53
],
[
53,
54
],
[
53,
55
],
[
23,
56
],
[
56,
57
],
[
57,
58
],
[
58,
59
],
[
58,
60
],
[
56,
61
],
[
61,
62
],
[
61,
63
],
[
56,
64
],
[
64,
65
],
[
65,
66
],
[
56,
67
],
[
68,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
71,
72
],
[
71,
73
],
[
71,
74
],
[
74,
75
],
[
74,
76
],
[
74,
77
],
[
74,
78
],
[
23,
79
],
[
79,
80
],
[
80,
81
],
[
79,
82
],
[
23,
83
],
[
83,
84
],
[
84,
85
],
[
21,
86
],
[
86,
87
],
[
980,
88
],
[
88,
89
],
[
88,
90
],
[
90,
91
],
[
91,
92
],
[
91,
93
],
[
90,
94
],
[
94,
95
],
[
95,
96
],
[
96,
97
],
[
96,
98
],
[
94,
99
],
[
99,
100
],
[
99,
101
],
[
101,
102
],
[
102,
103
],
[
94,
104
],
[
104,
105
],
[
105,
106
],
[
94,
107
],
[
108,
108
],
[
108,
109
],
[
109,
110
],
[
110,
111
],
[
111,
112
],
[
112,
113
],
[
111,
114
],
[
110,
115
],
[
115,
116
],
[
116,
117
],
[
115,
118
],
[
118,
119
],
[
118,
120
],
[
109,
121
],
[
121,
122
],
[
90,
123
],
[
123,
124
],
[
88,
125
],
[
125,
126
],
[
88,
127
],
[
127,
128
],
[
88,
129
],
[
129,
130
],
[
980,
131
],
[
131,
132
],
[
131,
133
],
[
133,
134
],
[
134,
135
],
[
134,
136
],
[
136,
137
],
[
136,
138
],
[
133,
139
],
[
139,
140
],
[
140,
141
],
[
141,
142
],
[
141,
143
],
[
139,
144
],
[
144,
145
],
[
144,
146
],
[
146,
147
],
[
146,
148
],
[
139,
149
],
[
149,
150
],
[
150,
151
],
[
139,
152
],
[
153,
153
],
[
153,
154
],
[
154,
155
],
[
155,
156
],
[
156,
157
],
[
156,
158
],
[
155,
159
],
[
154,
160
],
[
160,
161
],
[
160,
162
],
[
162,
163
],
[
162,
164
],
[
133,
165
],
[
165,
166
],
[
131,
167
],
[
167,
168
],
[
980,
169
],
[
169,
170
],
[
169,
171
],
[
171,
172
],
[
171,
173
],
[
173,
174
],
[
173,
175
],
[
169,
176
],
[
176,
177
],
[
169,
178
],
[
178,
179
],
[
178,
180
],
[
180,
181
],
[
181,
182
],
[
181,
183
],
[
169,
184
],
[
184,
185
],
[
184,
186
],
[
186,
187
],
[
187,
188
],
[
188,
189
],
[
187,
190
],
[
186,
191
],
[
191,
192
],
[
184,
193
],
[
193,
194
],
[
169,
195
],
[
195,
196
],
[
195,
197
],
[
197,
198
],
[
198,
199
],
[
199,
200
],
[
198,
201
],
[
201,
202
],
[
202,
203
],
[
201,
204
],
[
201,
205
],
[
197,
206
],
[
206,
207
],
[
195,
208
],
[
208,
209
],
[
195,
210
],
[
210,
211
],
[
169,
212
],
[
212,
213
],
[
212,
214
],
[
214,
215
],
[
215,
216
],
[
215,
217
],
[
215,
218
],
[
219,
219
],
[
219,
220
],
[
220,
221
],
[
221,
222
],
[
222,
223
],
[
223,
224
],
[
222,
225
],
[
220,
226
],
[
214,
227
],
[
227,
228
],
[
228,
229
],
[
227,
230
],
[
214,
231
],
[
231,
232
],
[
212,
233
],
[
233,
234
],
[
169,
235
],
[
235,
236
],
[
235,
237
],
[
237,
238
],
[
238,
239
],
[
238,
240
],
[
238,
241
],
[
242,
242
],
[
242,
243
],
[
243,
244
],
[
244,
245
],
[
245,
246
],
[
246,
247
],
[
245,
248
],
[
243,
249
],
[
237,
250
],
[
250,
251
],
[
251,
252
],
[
250,
253
],
[
237,
254
],
[
254,
255
],
[
235,
256
],
[
256,
257
],
[
169,
258
],
[
258,
259
],
[
258,
260
],
[
260,
261
],
[
261,
262
],
[
261,
263
],
[
261,
264
],
[
265,
265
],
[
265,
266
],
[
266,
267
],
[
267,
268
],
[
268,
269
],
[
269,
270
],
[
268,
271
],
[
266,
272
],
[
260,
273
],
[
273,
274
],
[
274,
275
],
[
273,
276
],
[
260,
277
],
[
277,
278
],
[
258,
279
],
[
279,
280
],
[
169,
281
],
[
281,
282
],
[
281,
283
],
[
283,
284
],
[
284,
285
],
[
284,
286
],
[
284,
287
],
[
288,
288
],
[
288,
289
],
[
289,
290
],
[
290,
291
],
[
291,
292
],
[
292,
293
],
[
291,
294
],
[
289,
295
],
[
283,
296
],
[
296,
297
],
[
297,
298
],
[
296,
299
],
[
283,
300
],
[
300,
301
],
[
281,
302
],
[
302,
303
],
[
169,
304
],
[
304,
305
],
[
304,
306
],
[
306,
307
],
[
307,
308
],
[
308,
309
],
[
309,
310
],
[
310,
311
],
[
309,
312
],
[
312,
313
],
[
313,
314
],
[
312,
315
],
[
307,
316
],
[
304,
317
],
[
317,
318
],
[
169,
319
],
[
319,
320
],
[
319,
321
],
[
321,
322
],
[
322,
323
],
[
323,
324
],
[
324,
325
],
[
325,
326
],
[
324,
327
],
[
327,
328
],
[
328,
329
],
[
327,
330
],
[
322,
331
],
[
319,
332
],
[
332,
333
],
[
169,
334
],
[
334,
335
],
[
334,
336
],
[
336,
337
],
[
337,
338
],
[
338,
339
],
[
339,
340
],
[
340,
341
],
[
339,
342
],
[
342,
343
],
[
343,
344
],
[
342,
345
],
[
337,
346
],
[
334,
347
],
[
347,
348
],
[
169,
349
],
[
349,
350
],
[
349,
351
],
[
351,
352
],
[
352,
353
],
[
353,
354
],
[
354,
355
],
[
355,
356
],
[
354,
357
],
[
357,
358
],
[
358,
359
],
[
357,
360
],
[
352,
361
],
[
349,
362
],
[
362,
363
],
[
169,
364
],
[
364,
365
],
[
364,
366
],
[
366,
367
],
[
367,
368
],
[
368,
369
],
[
369,
370
],
[
370,
371
],
[
369,
372
],
[
372,
373
],
[
373,
374
],
[
372,
375
],
[
367,
376
],
[
364,
377
],
[
377,
378
],
[
169,
379
],
[
379,
380
],
[
379,
381
],
[
381,
382
],
[
382,
383
],
[
383,
384
],
[
384,
385
],
[
385,
386
],
[
384,
387
],
[
387,
388
],
[
388,
389
],
[
387,
390
],
[
382,
391
],
[
379,
392
],
[
392,
393
],
[
169,
394
],
[
394,
395
],
[
394,
396
],
[
396,
397
],
[
397,
398
],
[
397,
399
],
[
397,
400
],
[
400,
401
],
[
401,
402
],
[
402,
403
],
[
403,
404
],
[
404,
405
],
[
403,
406
],
[
406,
407
],
[
407,
408
],
[
406,
409
],
[
401,
410
],
[
394,
411
],
[
411,
412
],
[
169,
413
],
[
413,
414
],
[
413,
415
],
[
415,
416
],
[
416,
417
],
[
416,
418
],
[
416,
419
],
[
419,
420
],
[
420,
421
],
[
421,
422
],
[
422,
423
],
[
423,
424
],
[
422,
425
],
[
425,
426
],
[
426,
427
],
[
425,
428
],
[
420,
429
],
[
413,
430
],
[
430,
431
],
[
169,
432
],
[
432,
433
],
[
432,
434
],
[
434,
435
],
[
435,
436
],
[
435,
437
],
[
435,
438
],
[
438,
439
],
[
439,
440
],
[
440,
441
],
[
441,
442
],
[
442,
443
],
[
441,
444
],
[
444,
445
],
[
445,
446
],
[
444,
447
],
[
439,
448
],
[
432,
449
],
[
449,
450
],
[
169,
451
],
[
451,
452
],
[
451,
453
],
[
453,
454
],
[
454,
455
],
[
454,
456
],
[
454,
457
],
[
457,
458
],
[
458,
459
],
[
459,
460
],
[
460,
461
],
[
461,
462
],
[
460,
463
],
[
463,
464
],
[
464,
465
],
[
463,
466
],
[
458,
467
],
[
451,
468
],
[
468,
469
],
[
169,
470
],
[
470,
471
],
[
470,
472
],
[
472,
473
],
[
473,
474
],
[
473,
475
],
[
473,
476
],
[
476,
477
],
[
477,
478
],
[
478,
479
],
[
479,
480
],
[
480,
481
],
[
479,
482
],
[
482,
483
],
[
483,
484
],
[
482,
485
],
[
477,
486
],
[
470,
487
],
[
487,
488
],
[
169,
489
],
[
489,
490
],
[
489,
491
],
[
491,
492
],
[
492,
493
],
[
493,
494
],
[
494,
495
],
[
495,
496
],
[
494,
497
],
[
492,
498
],
[
491,
499
],
[
499,
500
],
[
489,
501
],
[
501,
502
],
[
169,
503
],
[
503,
504
],
[
503,
505
],
[
505,
506
],
[
506,
507
],
[
506,
508
],
[
505,
509
],
[
509,
510
],
[
510,
511
],
[
509,
512
],
[
512,
513
],
[
513,
514
],
[
505,
515
],
[
515,
516
],
[
516,
517
],
[
503,
518
],
[
518,
519
],
[
169,
520
],
[
520,
521
],
[
520,
522
],
[
522,
523
],
[
523,
524
],
[
524,
525
],
[
525,
526
],
[
525,
527
],
[
523,
528
],
[
980,
529
],
[
529,
530
],
[
529,
531
],
[
531,
532
],
[
531,
533
],
[
533,
534
],
[
533,
535
],
[
529,
536
],
[
536,
537
],
[
536,
538
],
[
529,
540
],
[
540,
541
],
[
540,
542
],
[
529,
543
],
[
543,
544
],
[
543,
545
],
[
529,
546
],
[
546,
547
],
[
546,
548
],
[
529,
549
],
[
549,
550
],
[
549,
551
],
[
551,
552
],
[
552,
553
],
[
552,
554
],
[
551,
555
],
[
555,
556
],
[
555,
557
],
[
549,
558
],
[
558,
559
],
[
529,
560
],
[
560,
561
],
[
560,
562
],
[
562,
563
],
[
563,
564
],
[
564,
565
],
[
564,
566
],
[
563,
567
],
[
567,
568
],
[
568,
569
],
[
563,
570
],
[
570,
571
],
[
571,
572
],
[
571,
573
],
[
570,
574
],
[
574,
575
],
[
575,
576
],
[
575,
577
],
[
577,
578
],
[
578,
579
],
[
579,
580
],
[
574,
581
],
[
581,
582
],
[
582,
583
],
[
582,
584
],
[
584,
585
],
[
585,
586
],
[
584,
587
],
[
570,
588
],
[
588,
589
],
[
589,
590
],
[
589,
591
],
[
588,
592
],
[
592,
593
],
[
593,
594
],
[
562,
595
],
[
595,
596
],
[
529,
597
],
[
597,
598
],
[
597,
599
],
[
599,
600
],
[
600,
601
],
[
601,
602
],
[
600,
603
],
[
603,
604
],
[
604,
605
],
[
604,
606
],
[
606,
607
],
[
600,
608
],
[
608,
609
],
[
609,
610
],
[
529,
611
],
[
611,
612
],
[
611,
613
],
[
613,
614
],
[
614,
615
],
[
615,
616
],
[
616,
617
],
[
616,
618
],
[
615,
619
],
[
619,
620
],
[
619,
621
],
[
611,
622
],
[
622,
623
],
[
529,
624
],
[
624,
625
],
[
624,
626
],
[
626,
627
],
[
627,
628
],
[
628,
629
],
[
629,
630
],
[
628,
631
],
[
631,
632
],
[
632,
633
],
[
632,
634
],
[
634,
635
],
[
634,
636
],
[
627,
637
],
[
637,
638
],
[
626,
639
],
[
639,
640
],
[
640,
641
],
[
529,
642
],
[
642,
643
],
[
642,
644
],
[
644,
645
],
[
645,
646
],
[
646,
647
],
[
647,
648
],
[
645,
649
],
[
649,
650
],
[
644,
651
],
[
651,
652
],
[
651,
653
],
[
644,
654
],
[
654,
655
],
[
654,
656
],
[
656,
657
],
[
644,
658
],
[
658,
659
],
[
659,
660
],
[
659,
661
],
[
658,
662
],
[
662,
663
],
[
663,
664
],
[
664,
665
],
[
663,
666
],
[
662,
667
],
[
667,
668
],
[
667,
669
],
[
669,
670
],
[
644,
671
],
[
671,
672
],
[
672,
673
],
[
673,
674
],
[
529,
675
],
[
675,
676
],
[
675,
677
],
[
677,
678
],
[
678,
679
],
[
679,
680
],
[
680,
681
],
[
678,
682
],
[
682,
683
],
[
677,
684
],
[
684,
685
],
[
684,
686
],
[
677,
687
],
[
687,
688
],
[
687,
689
],
[
677,
690
],
[
690,
691
],
[
690,
692
],
[
692,
693
],
[
677,
694
],
[
694,
695
],
[
695,
696
],
[
695,
697
],
[
694,
698
],
[
698,
699
],
[
699,
700
],
[
699,
701
],
[
698,
702
],
[
702,
703
],
[
702,
704
],
[
704,
705
],
[
677,
706
],
[
706,
707
],
[
707,
708
],
[
708,
709
],
[
708,
710
],
[
707,
711
],
[
711,
712
],
[
711,
713
],
[
706,
714
],
[
714,
715
],
[
715,
716
],
[
677,
717
],
[
717,
718
],
[
717,
719
],
[
719,
720
],
[
720,
721
],
[
721,
722
],
[
722,
723
],
[
722,
724
],
[
721,
725
],
[
725,
726
],
[
725,
727
],
[
720,
728
],
[
728,
729
],
[
729,
730
],
[
729,
731
],
[
728,
732
],
[
732,
733
],
[
732,
734
],
[
734,
735
],
[
734,
736
],
[
720,
737
],
[
737,
738
],
[
739,
739
],
[
739,
740
],
[
740,
741
],
[
740,
742
],
[
742,
743
],
[
739,
744
],
[
744,
745
],
[
745,
746
],
[
745,
747
],
[
739,
748
],
[
748,
749
],
[
748,
750
],
[
737,
751
],
[
751,
752
],
[
752,
753
],
[
753,
754
],
[
753,
755
],
[
755,
756
],
[
753,
757
],
[
737,
758
],
[
758,
759
],
[
759,
760
],
[
719,
761
],
[
761,
762
],
[
761,
763
],
[
763,
764
],
[
529,
765
],
[
765,
766
],
[
765,
767
],
[
767,
768
],
[
768,
769
],
[
768,
770
],
[
770,
771
],
[
767,
772
],
[
772,
773
],
[
773,
774
],
[
774,
775
],
[
774,
776
],
[
776,
777
],
[
776,
778
],
[
773,
779
],
[
779,
780
],
[
779,
781
],
[
781,
782
],
[
781,
783
],
[
772,
784
],
[
784,
785
],
[
767,
786
],
[
786,
787
],
[
529,
788
],
[
788,
789
],
[
788,
790
],
[
790,
791
],
[
791,
792
],
[
792,
793
],
[
793,
794
],
[
792,
795
],
[
795,
796
],
[
529,
797
],
[
797,
798
],
[
797,
799
],
[
799,
800
],
[
800,
801
],
[
800,
802
],
[
799,
804
],
[
804,
805
],
[
805,
806
],
[
806,
807
],
[
806,
808
],
[
804,
809
],
[
809,
810
],
[
809,
811
],
[
804,
812
],
[
812,
813
],
[
813,
814
],
[
804,
815
],
[
815,
816
],
[
816,
817
],
[
817,
818
],
[
817,
819
],
[
816,
820
],
[
820,
821
],
[
799,
822
],
[
822,
823
],
[
797,
824
],
[
824,
825
],
[
529,
826
],
[
826,
827
],
[
826,
828
],
[
828,
829
],
[
829,
830
],
[
829,
831
],
[
828,
833
],
[
833,
834
],
[
834,
835
],
[
835,
836
],
[
835,
837
],
[
833,
838
],
[
838,
839
],
[
838,
840
],
[
833,
841
],
[
841,
842
],
[
842,
843
],
[
833,
844
],
[
844,
845
],
[
845,
846
],
[
846,
847
],
[
846,
848
],
[
845,
849
],
[
849,
850
],
[
828,
851
],
[
851,
852
],
[
826,
853
],
[
853,
854
],
[
529,
855
],
[
855,
856
],
[
855,
857
],
[
857,
858
],
[
858,
859
],
[
858,
860
],
[
857,
862
],
[
862,
863
],
[
863,
864
],
[
864,
865
],
[
864,
866
],
[
862,
867
],
[
867,
868
],
[
867,
869
],
[
862,
870
],
[
870,
871
],
[
871,
872
],
[
862,
873
],
[
873,
874
],
[
874,
875
],
[
875,
876
],
[
875,
877
],
[
874,
878
],
[
878,
879
],
[
857,
880
],
[
880,
881
],
[
855,
882
],
[
882,
883
],
[
529,
884
],
[
884,
885
],
[
884,
886
],
[
886,
887
],
[
887,
888
],
[
887,
889
],
[
890,
891
],
[
890,
892
],
[
886,
893
],
[
893,
894
],
[
894,
895
],
[
895,
896
],
[
895,
897
],
[
893,
898
],
[
898,
899
],
[
898,
900
],
[
893,
901
],
[
901,
902
],
[
902,
903
],
[
893,
904
],
[
904,
905
],
[
905,
906
],
[
906,
907
],
[
906,
908
],
[
905,
909
],
[
886,
910
],
[
910,
911
],
[
884,
912
],
[
912,
913
],
[
529,
914
],
[
914,
915
],
[
914,
916
],
[
916,
917
],
[
917,
918
],
[
918,
919
],
[
918,
920
],
[
918,
921
],
[
918,
922
],
[
914,
923
],
[
923,
924
],
[
914,
925
],
[
925,
926
],
[
529,
927
],
[
927,
928
],
[
927,
929
],
[
929,
930
],
[
930,
931
],
[
930,
932
],
[
932,
933
],
[
932,
934
],
[
929,
935
],
[
935,
936
],
[
936,
937
],
[
937,
938
],
[
937,
939
],
[
935,
940
],
[
940,
941
],
[
940,
942
],
[
935,
943
],
[
943,
944
],
[
944,
945
],
[
935,
946
],
[
947,
947
],
[
947,
948
],
[
948,
949
],
[
948,
950
],
[
950,
951
],
[
947,
952
],
[
952,
953
],
[
952,
954
],
[
954,
955
],
[
947,
956
],
[
956,
957
],
[
957,
958
],
[
958,
959
],
[
958,
960
],
[
956,
961
],
[
947,
962
],
[
962,
963
],
[
963,
964
],
[
962,
965
],
[
965,
966
],
[
966,
967
],
[
967,
968
],
[
967,
969
],
[
965,
970
],
[
929,
971
],
[
971,
972
],
[
927,
973
],
[
973,
974
],
[
927,
975
],
[
975,
976
],
[
927,
977
],
[
977,
978
],
[
0,
979
],
[
979,
980
],
[
979,
981
]
]
| [
"/*\n Author: Anthony Ngene\n Created: 29/08/2020 - 13:08\n*/\n\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n// A man who views the world the same at 50 as he did at 20 has wasted 30 years of his life. - Muhammad Ali\n public static void main(String[] args) throws IOException {\n in = new FastScanner();\n\n String longS = in.next();\n String shortS = in.next();\n\n int stop = longS.length() - shortS.length();\n int n = shortS.length();\n int ans = Integer.MAX_VALUE;\n for (int i = 0; i <= stop; i++) {\n ans = min(ans, check(i, shortS, longS));\n }\n out.println(ans);\n\n out.close();\n }\n\n static int check(int start, String s, String l) {\n int diff = 0;\n for (int i = 0; i < s.length(); i++) {\n if (s.charAt(i) != l.charAt(start + i)) diff++;\n }\n return diff;\n }\n\n// checks: 1. edge cases 2. overflow 3. possible errors (e.g 1/0, arr[out]) 4. time/space complexity\n// Generated Code Below:\nprivate static final FastWriter out = new FastWriter();\nprivate static FastScanner in;\nstatic ArrayList<Integer>[] adj;\nprivate static long e97 = (long)1e9 + 7;\nstatic class FastWriter {\n private static final int IO_BUFFERS = 128 * 1024;\n private final StringBuilder out;\n public FastWriter() { out = new StringBuilder(IO_BUFFERS); }\n public FastWriter p(Object object) { out.append(object); return this; }\n public FastWriter p(String format, Object... args) { out.append(String.format(format, args)); return this; }\n public FastWriter pp(Object... args) { for (Object ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public FastWriter pp(int[] args) { for (int ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public FastWriter pp(long[] args) { for (long ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public FastWriter pp(char[] args) { for (char ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public void println(long[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(int[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(char[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(double[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(boolean[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public <T>void println(T[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(long[][] arr) { for (long[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public void println(int[][] arr) { for (int[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public void println(char[][] arr) { for (char[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public void println(double[][] arr) { for (double[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public <T>void println(T[][] arr) { for (T[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public FastWriter println(Object object) { out.append(object).append(\"\\n\"); return this; }\n public void toFile(String fileName) throws IOException {\n BufferedWriter writer = new BufferedWriter(new FileWriter(fileName));\n writer.write(out.toString());\n writer.close();\n }\n public void close() throws IOException { System.out.print(out); }\n}\nstatic class FastScanner {\n private InputStream sin = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n public FastScanner(){}\n public FastScanner(String filename) throws FileNotFoundException {\n File file = new File(filename);\n sin = new FileInputStream(file);\n }\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = sin.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long longNext() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b) || b == ':'){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int intNext() {\n long nl = longNext();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double doubleNext() { return Double.parseDouble(next());}\n public long[] nextLongArray(final int n){\n final long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = longNext();\n return a;\n }\n public int[] nextIntArray(final int n){\n final int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = intNext();\n return a;\n }\n public double[] nextDoubleArray(final int n){\n final double[] a = new double[n];\n for (int i = 0; i < n; i++)\n a[i] = doubleNext();\n return a;\n }\n public ArrayList<Integer>[] getAdj(int n) {\n ArrayList<Integer>[] adj = new ArrayList[n + 1];\n for (int i = 1; i <= n; i++) adj[i] = new ArrayList<>();\n return adj;\n }\n public ArrayList<Integer>[] adjacencyList(int nodes, int edges) throws IOException {\n return adjacencyList(nodes, edges, false);\n }\n public ArrayList<Integer>[] adjacencyList(int nodes, int edges, boolean isDirected) throws IOException {\n adj = getAdj(nodes);\n for (int i = 0; i < edges; i++) {\n int a = intNext(), b = intNext();\n adj[a].add(b);\n if (!isDirected) adj[b].add(a);\n }\n return adj;\n }\n}\nprivate static int min(int... ins){ int min = ins[0]; for(int i=1; i<ins.length; i++){ if(ins[i] < min) min = ins[i]; } return min; }\n\n}",
"import java.io.*;",
"io.*",
"java",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n// A man who views the world the same at 50 as he did at 20 has wasted 30 years of his life. - Muhammad Ali\n public static void main(String[] args) throws IOException {\n in = new FastScanner();\n\n String longS = in.next();\n String shortS = in.next();\n\n int stop = longS.length() - shortS.length();\n int n = shortS.length();\n int ans = Integer.MAX_VALUE;\n for (int i = 0; i <= stop; i++) {\n ans = min(ans, check(i, shortS, longS));\n }\n out.println(ans);\n\n out.close();\n }\n\n static int check(int start, String s, String l) {\n int diff = 0;\n for (int i = 0; i < s.length(); i++) {\n if (s.charAt(i) != l.charAt(start + i)) diff++;\n }\n return diff;\n }\n\n// checks: 1. edge cases 2. overflow 3. possible errors (e.g 1/0, arr[out]) 4. time/space complexity\n// Generated Code Below:\nprivate static final FastWriter out = new FastWriter();\nprivate static FastScanner in;\nstatic ArrayList<Integer>[] adj;\nprivate static long e97 = (long)1e9 + 7;\nstatic class FastWriter {\n private static final int IO_BUFFERS = 128 * 1024;\n private final StringBuilder out;\n public FastWriter() { out = new StringBuilder(IO_BUFFERS); }\n public FastWriter p(Object object) { out.append(object); return this; }\n public FastWriter p(String format, Object... args) { out.append(String.format(format, args)); return this; }\n public FastWriter pp(Object... args) { for (Object ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public FastWriter pp(int[] args) { for (int ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public FastWriter pp(long[] args) { for (long ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public FastWriter pp(char[] args) { for (char ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public void println(long[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(int[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(char[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(double[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(boolean[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public <T>void println(T[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(long[][] arr) { for (long[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public void println(int[][] arr) { for (int[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public void println(char[][] arr) { for (char[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public void println(double[][] arr) { for (double[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public <T>void println(T[][] arr) { for (T[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public FastWriter println(Object object) { out.append(object).append(\"\\n\"); return this; }\n public void toFile(String fileName) throws IOException {\n BufferedWriter writer = new BufferedWriter(new FileWriter(fileName));\n writer.write(out.toString());\n writer.close();\n }\n public void close() throws IOException { System.out.print(out); }\n}\nstatic class FastScanner {\n private InputStream sin = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n public FastScanner(){}\n public FastScanner(String filename) throws FileNotFoundException {\n File file = new File(filename);\n sin = new FileInputStream(file);\n }\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = sin.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long longNext() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b) || b == ':'){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int intNext() {\n long nl = longNext();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double doubleNext() { return Double.parseDouble(next());}\n public long[] nextLongArray(final int n){\n final long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = longNext();\n return a;\n }\n public int[] nextIntArray(final int n){\n final int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = intNext();\n return a;\n }\n public double[] nextDoubleArray(final int n){\n final double[] a = new double[n];\n for (int i = 0; i < n; i++)\n a[i] = doubleNext();\n return a;\n }\n public ArrayList<Integer>[] getAdj(int n) {\n ArrayList<Integer>[] adj = new ArrayList[n + 1];\n for (int i = 1; i <= n; i++) adj[i] = new ArrayList<>();\n return adj;\n }\n public ArrayList<Integer>[] adjacencyList(int nodes, int edges) throws IOException {\n return adjacencyList(nodes, edges, false);\n }\n public ArrayList<Integer>[] adjacencyList(int nodes, int edges, boolean isDirected) throws IOException {\n adj = getAdj(nodes);\n for (int i = 0; i < edges; i++) {\n int a = intNext(), b = intNext();\n adj[a].add(b);\n if (!isDirected) adj[b].add(a);\n }\n return adj;\n }\n}\nprivate static int min(int... ins){ int min = ins[0]; for(int i=1; i<ins.length; i++){ if(ins[i] < min) min = ins[i]; } return min; }\n\n}",
"Main",
"// checks: 1. edge cases 2. overflow 3. possible errors (e.g 1/0, arr[out]) 4. time/space complexity\n// Generated Code Below:\nprivate static final FastWriter out = new FastWriter();",
"out",
"new FastWriter()",
"private static FastScanner in;",
"in",
"static ArrayList<Integer>[] adj;",
"adj",
"private static long e97 = (long)1e9 + 7;",
"e97",
"(long)1e9 + 7",
"(long)1e9",
"7",
"// A man who views the world the same at 50 as he did at 20 has wasted 30 years of his life. - Muhammad Ali\n public static void main(String[] args) throws IOException {\n in = new FastScanner();\n\n String longS = in.next();\n String shortS = in.next();\n\n int stop = longS.length() - shortS.length();\n int n = shortS.length();\n int ans = Integer.MAX_VALUE;\n for (int i = 0; i <= stop; i++) {\n ans = min(ans, check(i, shortS, longS));\n }\n out.println(ans);\n\n out.close();\n }",
"main",
"{\n in = new FastScanner();\n\n String longS = in.next();\n String shortS = in.next();\n\n int stop = longS.length() - shortS.length();\n int n = shortS.length();\n int ans = Integer.MAX_VALUE;\n for (int i = 0; i <= stop; i++) {\n ans = min(ans, check(i, shortS, longS));\n }\n out.println(ans);\n\n out.close();\n }",
"in = new FastScanner()",
"in",
"new FastScanner()",
"String longS = in.next();",
"longS",
"in.next()",
"in.next",
"in",
"String shortS = in.next();",
"shortS",
"in.next()",
"in.next",
"in",
"int stop = longS.length() - shortS.length();",
"stop",
"longS.length() - shortS.length()",
"longS.length()",
"longS.length",
"longS",
"shortS.length()",
"shortS.length",
"shortS",
"int n = shortS.length();",
"n",
"shortS.length()",
"shortS.length",
"shortS",
"int ans = Integer.MAX_VALUE;",
"ans",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"for (int i = 0; i <= stop; i++) {\n ans = min(ans, check(i, shortS, longS));\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= stop",
"i",
"stop",
"i++",
"i++",
"i",
"{\n ans = min(ans, check(i, shortS, longS));\n }",
"{\n ans = min(ans, check(i, shortS, longS));\n }",
"ans = min(ans, check(i, shortS, longS))",
"ans",
"min(ans, check(i, shortS, longS))",
"min",
"ans",
"check(i, shortS, longS)",
"check",
"i",
"shortS",
"longS",
"out.println(ans)",
"out.println",
"out",
"ans",
"out.close()",
"out.close",
"out",
"String[] args",
"args",
"static int check(int start, String s, String l) {\n int diff = 0;\n for (int i = 0; i < s.length(); i++) {\n if (s.charAt(i) != l.charAt(start + i)) diff++;\n }\n return diff;\n }",
"check",
"{\n int diff = 0;\n for (int i = 0; i < s.length(); i++) {\n if (s.charAt(i) != l.charAt(start + i)) diff++;\n }\n return diff;\n }",
"int diff = 0;",
"diff",
"0",
"for (int i = 0; i < s.length(); i++) {\n if (s.charAt(i) != l.charAt(start + i)) diff++;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < s.length()",
"i",
"s.length()",
"s.length",
"s",
"i++",
"i++",
"i",
"{\n if (s.charAt(i) != l.charAt(start + i)) diff++;\n }",
"{\n if (s.charAt(i) != l.charAt(start + i)) diff++;\n }",
"if (s.charAt(i) != l.charAt(start + i)) diff++;",
"s.charAt(i) != l.charAt(start + i)",
"s.charAt(i)",
"s.charAt",
"s",
"i",
"l.charAt(start + i)",
"l.charAt",
"l",
"start + i",
"start",
"i",
"diff++",
"diff",
"return diff;",
"diff",
"int start",
"start",
"String s",
"s",
"String l",
"l",
"private static int min(int... ins){ int min = ins[0]; for(int i=1; i<ins.length; i++){ if(ins[i] < min) min = ins[i]; } return min; }",
"min",
"{ int min = ins[0]; for(int i=1; i<ins.length; i++){ if(ins[i] < min) min = ins[i]; } return min; }",
"int min = ins[0];",
"min",
"ins[0]",
"ins",
"0",
"for(int i=1; i<ins.length; i++){ if(ins[i] < min) min = ins[i]; }",
"int i=1;",
"int i=1;",
"i",
"1",
"i<ins.length",
"i",
"ins.length",
"ins",
"ins.length",
"i++",
"i++",
"i",
"{ if(ins[i] < min) min = ins[i]; }",
"{ if(ins[i] < min) min = ins[i]; }",
"if(ins[i] < min) min = ins[i];",
"ins[i] < min",
"ins[i]",
"ins",
"i",
"min",
"min = ins[i]",
"min",
"ins[i]",
"ins",
"i",
"return min;",
"min",
"int... ins",
"ins",
"static class FastWriter {\n private static final int IO_BUFFERS = 128 * 1024;\n private final StringBuilder out;\n public FastWriter() { out = new StringBuilder(IO_BUFFERS); }\n public FastWriter p(Object object) { out.append(object); return this; }\n public FastWriter p(String format, Object... args) { out.append(String.format(format, args)); return this; }\n public FastWriter pp(Object... args) { for (Object ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public FastWriter pp(int[] args) { for (int ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public FastWriter pp(long[] args) { for (long ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public FastWriter pp(char[] args) { for (char ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public void println(long[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(int[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(char[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(double[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(boolean[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public <T>void println(T[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(long[][] arr) { for (long[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public void println(int[][] arr) { for (int[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public void println(char[][] arr) { for (char[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public void println(double[][] arr) { for (double[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public <T>void println(T[][] arr) { for (T[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public FastWriter println(Object object) { out.append(object).append(\"\\n\"); return this; }\n public void toFile(String fileName) throws IOException {\n BufferedWriter writer = new BufferedWriter(new FileWriter(fileName));\n writer.write(out.toString());\n writer.close();\n }\n public void close() throws IOException { System.out.print(out); }\n}",
"FastWriter",
"private static final int IO_BUFFERS = 128 * 1024;",
"IO_BUFFERS",
"128 * 1024",
"128",
"1024",
"private final StringBuilder out;",
"out",
"public FastWriter() { out = new StringBuilder(IO_BUFFERS); }",
"FastWriter",
"{ out = new StringBuilder(IO_BUFFERS); }",
"out = new StringBuilder(IO_BUFFERS)",
"out",
"new StringBuilder(IO_BUFFERS)",
"public FastWriter p(Object object) { out.append(object); return this; }",
"p",
"{ out.append(object); return this; }",
"out.append(object)",
"out.append",
"out",
"object",
"return this;",
"this",
"Object object",
"object",
"public FastWriter p(String format, Object... args) { out.append(String.format(format, args)); return this; }",
"p",
"{ out.append(String.format(format, args)); return this; }",
"out.append(String.format(format, args))",
"out.append",
"out",
"String.format(format, args)",
"String.format",
"String",
"format",
"args",
"return this;",
"this",
"String format",
"format",
"Object... args",
"args",
"public FastWriter pp(Object... args) { for (Object ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }",
"pp",
"{ for (Object ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }",
"for (Object ob : args) { out.append(ob).append(\" \"); }",
"Object ob",
"args",
"{ out.append(ob).append(\" \"); }",
"{ out.append(ob).append(\" \"); }",
"out.append(ob).append(\" \")",
"out.append(ob).append",
"out.append(ob)",
"out.append",
"out",
"ob",
"\" \"",
"out.append(\"\\n\")",
"out.append",
"out",
"\"\\n\"",
"return this;",
"this",
"Object... args",
"args",
"public FastWriter pp(int[] args) { for (int ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }",
"pp",
"{ for (int ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }",
"for (int ob : args) { out.append(ob).append(\" \"); }",
"int ob",
"args",
"{ out.append(ob).append(\" \"); }",
"{ out.append(ob).append(\" \"); }",
"out.append(ob).append(\" \")",
"out.append(ob).append",
"out.append(ob)",
"out.append",
"out",
"ob",
"\" \"",
"out.append(\"\\n\")",
"out.append",
"out",
"\"\\n\"",
"return this;",
"this",
"int[] args",
"args",
"public FastWriter pp(long[] args) { for (long ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }",
"pp",
"{ for (long ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }",
"for (long ob : args) { out.append(ob).append(\" \"); }",
"long ob",
"args",
"{ out.append(ob).append(\" \"); }",
"{ out.append(ob).append(\" \"); }",
"out.append(ob).append(\" \")",
"out.append(ob).append",
"out.append(ob)",
"out.append",
"out",
"ob",
"\" \"",
"out.append(\"\\n\")",
"out.append",
"out",
"\"\\n\"",
"return this;",
"this",
"long[] args",
"args",
"public FastWriter pp(char[] args) { for (char ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }",
"pp",
"{ for (char ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }",
"for (char ob : args) { out.append(ob).append(\" \"); }",
"char ob",
"args",
"{ out.append(ob).append(\" \"); }",
"{ out.append(ob).append(\" \"); }",
"out.append(ob).append(\" \")",
"out.append(ob).append",
"out.append(ob)",
"out.append",
"out",
"ob",
"\" \"",
"out.append(\"\\n\")",
"out.append",
"out",
"\"\\n\"",
"return this;",
"this",
"char[] args",
"args",
"public void println(long[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }",
"println",
"{ out.append(Arrays.toString(arr)).append(\"\\n\"); }",
"out.append(Arrays.toString(arr)).append(\"\\n\")",
"out.append(Arrays.toString(arr)).append",
"out.append(Arrays.toString(arr))",
"out.append",
"out",
"Arrays.toString(arr)",
"Arrays.toString",
"Arrays",
"arr",
"\"\\n\"",
"long[] arr",
"arr",
"public void println(int[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }",
"println",
"{ out.append(Arrays.toString(arr)).append(\"\\n\"); }",
"out.append(Arrays.toString(arr)).append(\"\\n\")",
"out.append(Arrays.toString(arr)).append",
"out.append(Arrays.toString(arr))",
"out.append",
"out",
"Arrays.toString(arr)",
"Arrays.toString",
"Arrays",
"arr",
"\"\\n\"",
"int[] arr",
"arr",
"public void println(char[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }",
"println",
"{ out.append(Arrays.toString(arr)).append(\"\\n\"); }",
"out.append(Arrays.toString(arr)).append(\"\\n\")",
"out.append(Arrays.toString(arr)).append",
"out.append(Arrays.toString(arr))",
"out.append",
"out",
"Arrays.toString(arr)",
"Arrays.toString",
"Arrays",
"arr",
"\"\\n\"",
"char[] arr",
"arr",
"public void println(double[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }",
"println",
"{ out.append(Arrays.toString(arr)).append(\"\\n\"); }",
"out.append(Arrays.toString(arr)).append(\"\\n\")",
"out.append(Arrays.toString(arr)).append",
"out.append(Arrays.toString(arr))",
"out.append",
"out",
"Arrays.toString(arr)",
"Arrays.toString",
"Arrays",
"arr",
"\"\\n\"",
"double[] arr",
"arr",
"public void println(boolean[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }",
"println",
"{ out.append(Arrays.toString(arr)).append(\"\\n\"); }",
"out.append(Arrays.toString(arr)).append(\"\\n\")",
"out.append(Arrays.toString(arr)).append",
"out.append(Arrays.toString(arr))",
"out.append",
"out",
"Arrays.toString(arr)",
"Arrays.toString",
"Arrays",
"arr",
"\"\\n\"",
"boolean[] arr",
"arr",
"public <T>void println(T[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }",
"println",
"{ out.append(Arrays.toString(arr)).append(\"\\n\"); }",
"out.append(Arrays.toString(arr)).append(\"\\n\")",
"out.append(Arrays.toString(arr)).append",
"out.append(Arrays.toString(arr))",
"out.append",
"out",
"Arrays.toString(arr)",
"Arrays.toString",
"Arrays",
"arr",
"\"\\n\"",
"T[] arr",
"arr",
"public void println(long[][] arr) { for (long[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }",
"println",
"{ for (long[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }",
"for (long[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\");",
"long[] row",
"arr",
"out.append(Arrays.toString(row)).append(\"\\n\");",
"out.append(Arrays.toString(row)).append(\"\\n\")",
"out.append(Arrays.toString(row)).append",
"out.append(Arrays.toString(row))",
"out.append",
"out",
"Arrays.toString(row)",
"Arrays.toString",
"Arrays",
"row",
"\"\\n\"",
"long[][] arr",
"arr",
"public void println(int[][] arr) { for (int[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }",
"println",
"{ for (int[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }",
"for (int[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\");",
"int[] row",
"arr",
"out.append(Arrays.toString(row)).append(\"\\n\");",
"out.append(Arrays.toString(row)).append(\"\\n\")",
"out.append(Arrays.toString(row)).append",
"out.append(Arrays.toString(row))",
"out.append",
"out",
"Arrays.toString(row)",
"Arrays.toString",
"Arrays",
"row",
"\"\\n\"",
"int[][] arr",
"arr",
"public void println(char[][] arr) { for (char[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }",
"println",
"{ for (char[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }",
"for (char[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\");",
"char[] row",
"arr",
"out.append(Arrays.toString(row)).append(\"\\n\");",
"out.append(Arrays.toString(row)).append(\"\\n\")",
"out.append(Arrays.toString(row)).append",
"out.append(Arrays.toString(row))",
"out.append",
"out",
"Arrays.toString(row)",
"Arrays.toString",
"Arrays",
"row",
"\"\\n\"",
"char[][] arr",
"arr",
"public void println(double[][] arr) { for (double[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }",
"println",
"{ for (double[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }",
"for (double[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\");",
"double[] row",
"arr",
"out.append(Arrays.toString(row)).append(\"\\n\");",
"out.append(Arrays.toString(row)).append(\"\\n\")",
"out.append(Arrays.toString(row)).append",
"out.append(Arrays.toString(row))",
"out.append",
"out",
"Arrays.toString(row)",
"Arrays.toString",
"Arrays",
"row",
"\"\\n\"",
"double[][] arr",
"arr",
"public <T>void println(T[][] arr) { for (T[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }",
"println",
"{ for (T[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }",
"for (T[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\");",
"T[] row",
"arr",
"out.append(Arrays.toString(row)).append(\"\\n\");",
"out.append(Arrays.toString(row)).append(\"\\n\")",
"out.append(Arrays.toString(row)).append",
"out.append(Arrays.toString(row))",
"out.append",
"out",
"Arrays.toString(row)",
"Arrays.toString",
"Arrays",
"row",
"\"\\n\"",
"T[][] arr",
"arr",
"public FastWriter println(Object object) { out.append(object).append(\"\\n\"); return this; }",
"println",
"{ out.append(object).append(\"\\n\"); return this; }",
"out.append(object).append(\"\\n\")",
"out.append(object).append",
"out.append(object)",
"out.append",
"out",
"object",
"\"\\n\"",
"return this;",
"this",
"Object object",
"object",
"public void toFile(String fileName) throws IOException {\n BufferedWriter writer = new BufferedWriter(new FileWriter(fileName));\n writer.write(out.toString());\n writer.close();\n }",
"toFile",
"{\n BufferedWriter writer = new BufferedWriter(new FileWriter(fileName));\n writer.write(out.toString());\n writer.close();\n }",
"BufferedWriter writer = new BufferedWriter(new FileWriter(fileName));",
"writer",
"new BufferedWriter(new FileWriter(fileName))",
"writer.write(out.toString())",
"writer.write",
"writer",
"out.toString()",
"out.toString",
"out",
"writer.close()",
"writer.close",
"writer",
"String fileName",
"fileName",
"public void close() throws IOException { System.out.print(out); }",
"close",
"{ System.out.print(out); }",
"System.out.print(out)",
"System.out.print",
"System.out",
"System",
"System.out",
"out",
"static class FastScanner {\n private InputStream sin = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n public FastScanner(){}\n public FastScanner(String filename) throws FileNotFoundException {\n File file = new File(filename);\n sin = new FileInputStream(file);\n }\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = sin.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long longNext() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b) || b == ':'){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int intNext() {\n long nl = longNext();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double doubleNext() { return Double.parseDouble(next());}\n public long[] nextLongArray(final int n){\n final long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = longNext();\n return a;\n }\n public int[] nextIntArray(final int n){\n final int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = intNext();\n return a;\n }\n public double[] nextDoubleArray(final int n){\n final double[] a = new double[n];\n for (int i = 0; i < n; i++)\n a[i] = doubleNext();\n return a;\n }\n public ArrayList<Integer>[] getAdj(int n) {\n ArrayList<Integer>[] adj = new ArrayList[n + 1];\n for (int i = 1; i <= n; i++) adj[i] = new ArrayList<>();\n return adj;\n }\n public ArrayList<Integer>[] adjacencyList(int nodes, int edges) throws IOException {\n return adjacencyList(nodes, edges, false);\n }\n public ArrayList<Integer>[] adjacencyList(int nodes, int edges, boolean isDirected) throws IOException {\n adj = getAdj(nodes);\n for (int i = 0; i < edges; i++) {\n int a = intNext(), b = intNext();\n adj[a].add(b);\n if (!isDirected) adj[b].add(a);\n }\n return adj;\n }\n}",
"FastScanner",
"private InputStream sin = System.in;",
"sin",
"System.in",
"System",
"System.in",
"private final byte[] buffer = new byte[1024];",
"buffer",
"new byte[1024]",
"1024",
"private int ptr = 0;",
"ptr",
"0",
"private int buflen = 0;",
"buflen",
"0",
"public FastScanner(){}",
"FastScanner",
"{}",
"public FastScanner(String filename) throws FileNotFoundException {\n File file = new File(filename);\n sin = new FileInputStream(file);\n }",
"FastScanner",
"{\n File file = new File(filename);\n sin = new FileInputStream(file);\n }",
"File file = new File(filename);",
"file",
"new File(filename)",
"sin = new FileInputStream(file)",
"sin",
"new FileInputStream(file)",
"String filename",
"filename",
"private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = sin.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }",
"hasNextByte",
"{\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = sin.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }",
"if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = sin.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }",
"ptr < buflen",
"ptr",
"buflen",
"{\n return true;\n }",
"return true;",
"true",
"{\n ptr = 0;\n try {\n buflen = sin.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }",
"ptr = 0",
"ptr",
"0",
"try {\n buflen = sin.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }",
"catch (IOException e) {\n e.printStackTrace();\n }",
"IOException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n buflen = sin.read(buffer);\n }",
"buflen = sin.read(buffer)",
"buflen",
"sin.read(buffer)",
"sin.read",
"sin",
"buffer",
"if (buflen <= 0) {\n return false;\n }",
"buflen <= 0",
"buflen",
"0",
"{\n return false;\n }",
"return false;",
"false",
"return true;",
"true",
"private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}",
"readByte",
"{ if (hasNextByte()) return buffer[ptr++]; else return -1;}",
"if (hasNextByte()) return buffer[ptr++]; else return -1;",
"hasNextByte()",
"hasNextByte",
"return buffer[ptr++];",
"buffer[ptr++]",
"buffer",
"ptr++",
"ptr",
"return -1;",
"-1",
"1",
"private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}",
"isPrintableChar",
"{ return 33 <= c && c <= 126;}",
"return 33 <= c && c <= 126;",
"33 <= c && c <= 126",
"33 <= c",
"33",
"c",
"c <= 126",
"c",
"126",
"int c",
"c",
"public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}",
"hasNext",
"{ while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}",
"while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;",
"hasNextByte() && !isPrintableChar(buffer[ptr])",
"hasNextByte()",
"hasNextByte",
"!isPrintableChar(buffer[ptr])",
"isPrintableChar(buffer[ptr])",
"isPrintableChar",
"buffer[ptr]",
"buffer",
"ptr",
"ptr++",
"ptr",
"return hasNextByte();",
"hasNextByte()",
"hasNextByte",
"public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }",
"next",
"{\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }",
"if (!hasNext()) throw new NoSuchElementException();",
"!hasNext()",
"hasNext()",
"hasNext",
"throw new NoSuchElementException();",
"new NoSuchElementException()",
"StringBuilder sb = new StringBuilder();",
"sb",
"new StringBuilder()",
"int b = readByte();",
"b",
"readByte()",
"readByte",
"while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }",
"isPrintableChar(b)",
"isPrintableChar",
"b",
"{\n sb.appendCodePoint(b);\n b = readByte();\n }",
"sb.appendCodePoint(b)",
"sb.appendCodePoint",
"sb",
"b",
"b = readByte()",
"b",
"readByte()",
"readByte",
"return sb.toString();",
"sb.toString()",
"sb.toString",
"sb",
"public long longNext() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b) || b == ':'){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }",
"longNext",
"{\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b) || b == ':'){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }",
"if (!hasNext()) throw new NoSuchElementException();",
"!hasNext()",
"hasNext()",
"hasNext",
"throw new NoSuchElementException();",
"new NoSuchElementException()",
"long n = 0;",
"n",
"0",
"boolean minus = false;",
"minus",
"false",
"int b = readByte();",
"b",
"readByte()",
"readByte",
"if (b == '-') {\n minus = true;\n b = readByte();\n }",
"b == '-'",
"b",
"'-'",
"{\n minus = true;\n b = readByte();\n }",
"minus = true",
"minus",
"true",
"b = readByte()",
"b",
"readByte()",
"readByte",
"if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }",
"b < '0' || '9' < b",
"b < '0'",
"b",
"'0'",
"'9' < b",
"'9'",
"b",
"{\n throw new NumberFormatException();\n }",
"throw new NumberFormatException();",
"new NumberFormatException()",
"while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b) || b == ':'){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }",
"true",
"{\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b) || b == ':'){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }",
"if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b) || b == ':'){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }",
"'0' <= b && b <= '9'",
"'0' <= b",
"'0'",
"b",
"b <= '9'",
"b",
"'9'",
"{\n n *= 10;\n n += b - '0';\n }",
"n *= 10",
"n",
"10",
"n += b - '0'",
"n",
"b - '0'",
"b",
"'0'",
"if(b == -1 || !isPrintableChar(b) || b == ':'){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }",
"b == -1 || !isPrintableChar(b) || b == ':'",
"b == -1 || !isPrintableChar(b) || b == ':'",
"b == -1",
"b",
"-1",
"1",
"!isPrintableChar(b)",
"isPrintableChar(b)",
"isPrintableChar",
"b",
"b == ':'",
"b",
"':'",
"{\n return minus ? -n : n;\n }",
"return minus ? -n : n;",
"minus ? -n : n",
"minus",
"-n",
"n",
"n",
"{\n throw new NumberFormatException();\n }",
"throw new NumberFormatException();",
"new NumberFormatException()",
"b = readByte()",
"b",
"readByte()",
"readByte",
"public int intNext() {\n long nl = longNext();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }",
"intNext",
"{\n long nl = longNext();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }",
"long nl = longNext();",
"nl",
"longNext()",
"longNext",
"if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();",
"nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE",
"nl < Integer.MIN_VALUE",
"nl",
"Integer.MIN_VALUE",
"Integer",
"Integer.MIN_VALUE",
"nl > Integer.MAX_VALUE",
"nl",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"throw new NumberFormatException();",
"new NumberFormatException()",
"return (int) nl;",
"(int) nl",
"public double doubleNext() { return Double.parseDouble(next());}",
"doubleNext",
"{ return Double.parseDouble(next());}",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"public long[] nextLongArray(final int n){\n final long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = longNext();\n return a;\n }",
"nextLongArray",
"{\n final long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = longNext();\n return a;\n }",
"final long[] a = new long[n];",
"a",
"new long[n]",
"n",
"for (int i = 0; i < n; i++)\n a[i] = longNext();",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"a[i] = longNext();",
"a[i] = longNext()",
"a[i]",
"a",
"i",
"longNext()",
"longNext",
"return a;",
"a",
"final int n",
"n",
"public int[] nextIntArray(final int n){\n final int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = intNext();\n return a;\n }",
"nextIntArray",
"{\n final int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = intNext();\n return a;\n }",
"final int[] a = new int[n];",
"a",
"new int[n]",
"n",
"for (int i = 0; i < n; i++)\n a[i] = intNext();",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"a[i] = intNext();",
"a[i] = intNext()",
"a[i]",
"a",
"i",
"intNext()",
"intNext",
"return a;",
"a",
"final int n",
"n",
"public double[] nextDoubleArray(final int n){\n final double[] a = new double[n];\n for (int i = 0; i < n; i++)\n a[i] = doubleNext();\n return a;\n }",
"nextDoubleArray",
"{\n final double[] a = new double[n];\n for (int i = 0; i < n; i++)\n a[i] = doubleNext();\n return a;\n }",
"final double[] a = new double[n];",
"a",
"new double[n]",
"n",
"for (int i = 0; i < n; i++)\n a[i] = doubleNext();",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"a[i] = doubleNext();",
"a[i] = doubleNext()",
"a[i]",
"a",
"i",
"doubleNext()",
"doubleNext",
"return a;",
"a",
"final int n",
"n",
"public ArrayList<Integer>[] getAdj(int n) {\n ArrayList<Integer>[] adj = new ArrayList[n + 1];\n for (int i = 1; i <= n; i++) adj[i] = new ArrayList<>();\n return adj;\n }",
"getAdj",
"{\n ArrayList<Integer>[] adj = new ArrayList[n + 1];\n for (int i = 1; i <= n; i++) adj[i] = new ArrayList<>();\n return adj;\n }",
"ArrayList<Integer>[] adj = new ArrayList[n + 1];",
"adj",
"new ArrayList[n + 1]",
"n + 1",
"n",
"1",
"for (int i = 1; i <= n; i++) adj[i] = new ArrayList<>();",
"int i = 1;",
"int i = 1;",
"i",
"1",
"i <= n",
"i",
"n",
"i++",
"i++",
"i",
"adj[i] = new ArrayList<>();",
"adj[i] = new ArrayList<>()",
"adj[i]",
"adj",
"i",
"new ArrayList<>()",
"return adj;",
"adj",
"int n",
"n",
"public ArrayList<Integer>[] adjacencyList(int nodes, int edges) throws IOException {\n return adjacencyList(nodes, edges, false);\n }",
"adjacencyList",
"{\n return adjacencyList(nodes, edges, false);\n }",
"return adjacencyList(nodes, edges, false);",
"adjacencyList(nodes, edges, false)",
"adjacencyList",
"nodes",
"edges",
"false",
"int nodes",
"nodes",
"int edges",
"edges",
"public ArrayList<Integer>[] adjacencyList(int nodes, int edges, boolean isDirected) throws IOException {\n adj = getAdj(nodes);\n for (int i = 0; i < edges; i++) {\n int a = intNext(), b = intNext();\n adj[a].add(b);\n if (!isDirected) adj[b].add(a);\n }\n return adj;\n }",
"adjacencyList",
"{\n adj = getAdj(nodes);\n for (int i = 0; i < edges; i++) {\n int a = intNext(), b = intNext();\n adj[a].add(b);\n if (!isDirected) adj[b].add(a);\n }\n return adj;\n }",
"adj = getAdj(nodes)",
"adj",
"getAdj(nodes)",
"getAdj",
"nodes",
"for (int i = 0; i < edges; i++) {\n int a = intNext(), b = intNext();\n adj[a].add(b);\n if (!isDirected) adj[b].add(a);\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < edges",
"i",
"edges",
"i++",
"i++",
"i",
"{\n int a = intNext(), b = intNext();\n adj[a].add(b);\n if (!isDirected) adj[b].add(a);\n }",
"{\n int a = intNext(), b = intNext();\n adj[a].add(b);\n if (!isDirected) adj[b].add(a);\n }",
"int a = intNext()",
"a",
"intNext()",
"intNext",
"b = intNext();",
"b",
"intNext()",
"intNext",
"adj[a].add(b)",
"adj[a].add",
"adj[a]",
"adj",
"a",
"b",
"if (!isDirected) adj[b].add(a);",
"!isDirected",
"isDirected",
"adj[b].add(a)",
"adj[b].add",
"adj[b]",
"adj",
"b",
"a",
"return adj;",
"adj",
"int nodes",
"nodes",
"int edges",
"edges",
"boolean isDirected",
"isDirected",
"public class Main {\n// A man who views the world the same at 50 as he did at 20 has wasted 30 years of his life. - Muhammad Ali\n public static void main(String[] args) throws IOException {\n in = new FastScanner();\n\n String longS = in.next();\n String shortS = in.next();\n\n int stop = longS.length() - shortS.length();\n int n = shortS.length();\n int ans = Integer.MAX_VALUE;\n for (int i = 0; i <= stop; i++) {\n ans = min(ans, check(i, shortS, longS));\n }\n out.println(ans);\n\n out.close();\n }\n\n static int check(int start, String s, String l) {\n int diff = 0;\n for (int i = 0; i < s.length(); i++) {\n if (s.charAt(i) != l.charAt(start + i)) diff++;\n }\n return diff;\n }\n\n// checks: 1. edge cases 2. overflow 3. possible errors (e.g 1/0, arr[out]) 4. time/space complexity\n// Generated Code Below:\nprivate static final FastWriter out = new FastWriter();\nprivate static FastScanner in;\nstatic ArrayList<Integer>[] adj;\nprivate static long e97 = (long)1e9 + 7;\nstatic class FastWriter {\n private static final int IO_BUFFERS = 128 * 1024;\n private final StringBuilder out;\n public FastWriter() { out = new StringBuilder(IO_BUFFERS); }\n public FastWriter p(Object object) { out.append(object); return this; }\n public FastWriter p(String format, Object... args) { out.append(String.format(format, args)); return this; }\n public FastWriter pp(Object... args) { for (Object ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public FastWriter pp(int[] args) { for (int ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public FastWriter pp(long[] args) { for (long ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public FastWriter pp(char[] args) { for (char ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public void println(long[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(int[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(char[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(double[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(boolean[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public <T>void println(T[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(long[][] arr) { for (long[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public void println(int[][] arr) { for (int[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public void println(char[][] arr) { for (char[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public void println(double[][] arr) { for (double[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public <T>void println(T[][] arr) { for (T[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public FastWriter println(Object object) { out.append(object).append(\"\\n\"); return this; }\n public void toFile(String fileName) throws IOException {\n BufferedWriter writer = new BufferedWriter(new FileWriter(fileName));\n writer.write(out.toString());\n writer.close();\n }\n public void close() throws IOException { System.out.print(out); }\n}\nstatic class FastScanner {\n private InputStream sin = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n public FastScanner(){}\n public FastScanner(String filename) throws FileNotFoundException {\n File file = new File(filename);\n sin = new FileInputStream(file);\n }\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = sin.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long longNext() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b) || b == ':'){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int intNext() {\n long nl = longNext();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double doubleNext() { return Double.parseDouble(next());}\n public long[] nextLongArray(final int n){\n final long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = longNext();\n return a;\n }\n public int[] nextIntArray(final int n){\n final int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = intNext();\n return a;\n }\n public double[] nextDoubleArray(final int n){\n final double[] a = new double[n];\n for (int i = 0; i < n; i++)\n a[i] = doubleNext();\n return a;\n }\n public ArrayList<Integer>[] getAdj(int n) {\n ArrayList<Integer>[] adj = new ArrayList[n + 1];\n for (int i = 1; i <= n; i++) adj[i] = new ArrayList<>();\n return adj;\n }\n public ArrayList<Integer>[] adjacencyList(int nodes, int edges) throws IOException {\n return adjacencyList(nodes, edges, false);\n }\n public ArrayList<Integer>[] adjacencyList(int nodes, int edges, boolean isDirected) throws IOException {\n adj = getAdj(nodes);\n for (int i = 0; i < edges; i++) {\n int a = intNext(), b = intNext();\n adj[a].add(b);\n if (!isDirected) adj[b].add(a);\n }\n return adj;\n }\n}\nprivate static int min(int... ins){ int min = ins[0]; for(int i=1; i<ins.length; i++){ if(ins[i] < min) min = ins[i]; } return min; }\n\n}",
"public class Main {\n// A man who views the world the same at 50 as he did at 20 has wasted 30 years of his life. - Muhammad Ali\n public static void main(String[] args) throws IOException {\n in = new FastScanner();\n\n String longS = in.next();\n String shortS = in.next();\n\n int stop = longS.length() - shortS.length();\n int n = shortS.length();\n int ans = Integer.MAX_VALUE;\n for (int i = 0; i <= stop; i++) {\n ans = min(ans, check(i, shortS, longS));\n }\n out.println(ans);\n\n out.close();\n }\n\n static int check(int start, String s, String l) {\n int diff = 0;\n for (int i = 0; i < s.length(); i++) {\n if (s.charAt(i) != l.charAt(start + i)) diff++;\n }\n return diff;\n }\n\n// checks: 1. edge cases 2. overflow 3. possible errors (e.g 1/0, arr[out]) 4. time/space complexity\n// Generated Code Below:\nprivate static final FastWriter out = new FastWriter();\nprivate static FastScanner in;\nstatic ArrayList<Integer>[] adj;\nprivate static long e97 = (long)1e9 + 7;\nstatic class FastWriter {\n private static final int IO_BUFFERS = 128 * 1024;\n private final StringBuilder out;\n public FastWriter() { out = new StringBuilder(IO_BUFFERS); }\n public FastWriter p(Object object) { out.append(object); return this; }\n public FastWriter p(String format, Object... args) { out.append(String.format(format, args)); return this; }\n public FastWriter pp(Object... args) { for (Object ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public FastWriter pp(int[] args) { for (int ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public FastWriter pp(long[] args) { for (long ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public FastWriter pp(char[] args) { for (char ob : args) { out.append(ob).append(\" \"); } out.append(\"\\n\"); return this; }\n public void println(long[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(int[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(char[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(double[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(boolean[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public <T>void println(T[] arr) { out.append(Arrays.toString(arr)).append(\"\\n\"); }\n public void println(long[][] arr) { for (long[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public void println(int[][] arr) { for (int[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public void println(char[][] arr) { for (char[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public void println(double[][] arr) { for (double[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public <T>void println(T[][] arr) { for (T[] row: arr) out.append(Arrays.toString(row)).append(\"\\n\"); }\n public FastWriter println(Object object) { out.append(object).append(\"\\n\"); return this; }\n public void toFile(String fileName) throws IOException {\n BufferedWriter writer = new BufferedWriter(new FileWriter(fileName));\n writer.write(out.toString());\n writer.close();\n }\n public void close() throws IOException { System.out.print(out); }\n}\nstatic class FastScanner {\n private InputStream sin = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n public FastScanner(){}\n public FastScanner(String filename) throws FileNotFoundException {\n File file = new File(filename);\n sin = new FileInputStream(file);\n }\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = sin.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long longNext() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b) || b == ':'){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int intNext() {\n long nl = longNext();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double doubleNext() { return Double.parseDouble(next());}\n public long[] nextLongArray(final int n){\n final long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = longNext();\n return a;\n }\n public int[] nextIntArray(final int n){\n final int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = intNext();\n return a;\n }\n public double[] nextDoubleArray(final int n){\n final double[] a = new double[n];\n for (int i = 0; i < n; i++)\n a[i] = doubleNext();\n return a;\n }\n public ArrayList<Integer>[] getAdj(int n) {\n ArrayList<Integer>[] adj = new ArrayList[n + 1];\n for (int i = 1; i <= n; i++) adj[i] = new ArrayList<>();\n return adj;\n }\n public ArrayList<Integer>[] adjacencyList(int nodes, int edges) throws IOException {\n return adjacencyList(nodes, edges, false);\n }\n public ArrayList<Integer>[] adjacencyList(int nodes, int edges, boolean isDirected) throws IOException {\n adj = getAdj(nodes);\n for (int i = 0; i < edges; i++) {\n int a = intNext(), b = intNext();\n adj[a].add(b);\n if (!isDirected) adj[b].add(a);\n }\n return adj;\n }\n}\nprivate static int min(int... ins){ int min = ins[0]; for(int i=1; i<ins.length; i++){ if(ins[i] < min) min = ins[i]; } return min; }\n\n}",
"Main"
]
| /*
Author: Anthony Ngene
Created: 29/08/2020 - 13:08
*/
import java.io.*;
import java.util.*;
public class Main {
// A man who views the world the same at 50 as he did at 20 has wasted 30 years of his life. - Muhammad Ali
public static void main(String[] args) throws IOException {
in = new FastScanner();
String longS = in.next();
String shortS = in.next();
int stop = longS.length() - shortS.length();
int n = shortS.length();
int ans = Integer.MAX_VALUE;
for (int i = 0; i <= stop; i++) {
ans = min(ans, check(i, shortS, longS));
}
out.println(ans);
out.close();
}
static int check(int start, String s, String l) {
int diff = 0;
for (int i = 0; i < s.length(); i++) {
if (s.charAt(i) != l.charAt(start + i)) diff++;
}
return diff;
}
// checks: 1. edge cases 2. overflow 3. possible errors (e.g 1/0, arr[out]) 4. time/space complexity
// Generated Code Below:
private static final FastWriter out = new FastWriter();
private static FastScanner in;
static ArrayList<Integer>[] adj;
private static long e97 = (long)1e9 + 7;
static class FastWriter {
private static final int IO_BUFFERS = 128 * 1024;
private final StringBuilder out;
public FastWriter() { out = new StringBuilder(IO_BUFFERS); }
public FastWriter p(Object object) { out.append(object); return this; }
public FastWriter p(String format, Object... args) { out.append(String.format(format, args)); return this; }
public FastWriter pp(Object... args) { for (Object ob : args) { out.append(ob).append(" "); } out.append("\n"); return this; }
public FastWriter pp(int[] args) { for (int ob : args) { out.append(ob).append(" "); } out.append("\n"); return this; }
public FastWriter pp(long[] args) { for (long ob : args) { out.append(ob).append(" "); } out.append("\n"); return this; }
public FastWriter pp(char[] args) { for (char ob : args) { out.append(ob).append(" "); } out.append("\n"); return this; }
public void println(long[] arr) { out.append(Arrays.toString(arr)).append("\n"); }
public void println(int[] arr) { out.append(Arrays.toString(arr)).append("\n"); }
public void println(char[] arr) { out.append(Arrays.toString(arr)).append("\n"); }
public void println(double[] arr) { out.append(Arrays.toString(arr)).append("\n"); }
public void println(boolean[] arr) { out.append(Arrays.toString(arr)).append("\n"); }
public <T>void println(T[] arr) { out.append(Arrays.toString(arr)).append("\n"); }
public void println(long[][] arr) { for (long[] row: arr) out.append(Arrays.toString(row)).append("\n"); }
public void println(int[][] arr) { for (int[] row: arr) out.append(Arrays.toString(row)).append("\n"); }
public void println(char[][] arr) { for (char[] row: arr) out.append(Arrays.toString(row)).append("\n"); }
public void println(double[][] arr) { for (double[] row: arr) out.append(Arrays.toString(row)).append("\n"); }
public <T>void println(T[][] arr) { for (T[] row: arr) out.append(Arrays.toString(row)).append("\n"); }
public FastWriter println(Object object) { out.append(object).append("\n"); return this; }
public void toFile(String fileName) throws IOException {
BufferedWriter writer = new BufferedWriter(new FileWriter(fileName));
writer.write(out.toString());
writer.close();
}
public void close() throws IOException { System.out.print(out); }
}
static class FastScanner {
private InputStream sin = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
public FastScanner(){}
public FastScanner(String filename) throws FileNotFoundException {
File file = new File(filename);
sin = new FileInputStream(file);
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = sin.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long longNext() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b) || b == ':'){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int intNext() {
long nl = longNext();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double doubleNext() { return Double.parseDouble(next());}
public long[] nextLongArray(final int n){
final long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = longNext();
return a;
}
public int[] nextIntArray(final int n){
final int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = intNext();
return a;
}
public double[] nextDoubleArray(final int n){
final double[] a = new double[n];
for (int i = 0; i < n; i++)
a[i] = doubleNext();
return a;
}
public ArrayList<Integer>[] getAdj(int n) {
ArrayList<Integer>[] adj = new ArrayList[n + 1];
for (int i = 1; i <= n; i++) adj[i] = new ArrayList<>();
return adj;
}
public ArrayList<Integer>[] adjacencyList(int nodes, int edges) throws IOException {
return adjacencyList(nodes, edges, false);
}
public ArrayList<Integer>[] adjacencyList(int nodes, int edges, boolean isDirected) throws IOException {
adj = getAdj(nodes);
for (int i = 0; i < edges; i++) {
int a = intNext(), b = intNext();
adj[a].add(b);
if (!isDirected) adj[b].add(a);
}
return adj;
}
}
private static int min(int... ins){ int min = ins[0]; for(int i=1; i<ins.length; i++){ if(ins[i] < min) min = ins[i]; } return min; }
}
|
[
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,
14,
2,
13,
17,
29,
13,
29,
4,
13,
13,
2,
13,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
41,
13,
18,
13,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
0,
13,
17,
41,
13,
13,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
40,
13,
4,
18,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
29,
13,
12,
13,
30,
29,
17,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
16,
17
],
[
16,
18
],
[
0,
19
],
[
19,
20
],
[
19,
21
],
[
0,
22
],
[
22,
23
],
[
22,
24
],
[
0,
25
],
[
25,
26
],
[
25,
27
],
[
0,
28
],
[
28,
29
],
[
28,
30
],
[
0,
31
],
[
31,
32
],
[
31,
33
],
[
0,
34
],
[
34,
35
],
[
34,
36
],
[
0,
37
],
[
37,
38
],
[
37,
39
],
[
0,
40
],
[
253,
41
],
[
253,
42
],
[
42,
43
],
[
42,
44
],
[
44,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
45,
49
],
[
49,
50
],
[
44,
51
],
[
51,
52
],
[
52,
53
],
[
52,
54
],
[
52,
55
],
[
55,
56
],
[
55,
57
],
[
42,
58
],
[
58,
59
],
[
42,
60
],
[
60,
61
],
[
253,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
65,
66
],
[
65,
67
],
[
64,
68
],
[
68,
69
],
[
68,
70
],
[
70,
71
],
[
71,
72
],
[
64,
73
],
[
73,
74
],
[
73,
75
],
[
75,
76
],
[
76,
77
],
[
64,
78
],
[
78,
79
],
[
78,
80
],
[
64,
81
],
[
81,
82
],
[
81,
83
],
[
83,
84
],
[
83,
85
],
[
64,
86
],
[
86,
87
],
[
86,
88
],
[
64,
89
],
[
89,
90
],
[
90,
91
],
[
91,
92
],
[
91,
93
],
[
89,
94
],
[
94,
95
],
[
94,
96
],
[
96,
97
],
[
97,
98
],
[
98,
99
],
[
96,
100
],
[
100,
101
],
[
101,
102
],
[
89,
103
],
[
103,
104
],
[
104,
105
],
[
89,
106
],
[
107,
107
],
[
107,
108
],
[
108,
109
],
[
108,
110
],
[
107,
111
],
[
111,
112
],
[
111,
113
],
[
107,
114
],
[
114,
115
],
[
115,
116
],
[
116,
117
],
[
116,
118
],
[
114,
119
],
[
119,
120
],
[
119,
121
],
[
121,
122
],
[
122,
123
],
[
114,
124
],
[
124,
125
],
[
125,
126
],
[
114,
127
],
[
128,
128
],
[
128,
129
],
[
129,
130
],
[
130,
131
],
[
131,
132
],
[
132,
133
],
[
131,
134
],
[
134,
135
],
[
130,
136
],
[
136,
137
],
[
137,
138
],
[
136,
139
],
[
129,
140
],
[
140,
141
],
[
107,
142
],
[
142,
143
],
[
142,
144
],
[
144,
145
],
[
145,
146
],
[
144,
147
],
[
144,
148
],
[
64,
149
],
[
149,
150
],
[
150,
151
],
[
151,
152
],
[
151,
153
],
[
149,
154
],
[
62,
155
],
[
155,
156
],
[
253,
157
],
[
157,
158
],
[
157,
159
],
[
159,
160
],
[
157,
161
],
[
161,
162
],
[
157,
163
],
[
163,
164
],
[
163,
165
],
[
165,
166
],
[
166,
167
],
[
166,
168
],
[
157,
169
],
[
169,
170
],
[
169,
171
],
[
171,
172
],
[
172,
173
],
[
173,
174
],
[
174,
175
],
[
174,
176
],
[
173,
177
],
[
177,
178
],
[
178,
179
],
[
179,
180
],
[
172,
181
],
[
181,
182
],
[
182,
183
],
[
183,
184
],
[
183,
185
],
[
185,
186
],
[
186,
187
],
[
187,
188
],
[
182,
189
],
[
189,
190
],
[
190,
191
],
[
190,
192
],
[
171,
193
],
[
193,
194
],
[
194,
195
],
[
195,
196
],
[
157,
197
],
[
197,
198
],
[
197,
199
],
[
199,
200
],
[
200,
201
],
[
201,
202
],
[
202,
203
],
[
201,
204
],
[
204,
205
],
[
157,
206
],
[
206,
207
],
[
206,
208
],
[
208,
209
],
[
209,
210
],
[
210,
211
],
[
211,
212
],
[
210,
213
],
[
213,
214
],
[
157,
215
],
[
215,
216
],
[
215,
217
],
[
217,
218
],
[
218,
219
],
[
219,
220
],
[
220,
221
],
[
219,
222
],
[
222,
223
],
[
157,
224
],
[
224,
225
],
[
224,
226
],
[
226,
227
],
[
227,
228
],
[
227,
229
],
[
226,
230
],
[
230,
231
],
[
231,
232
],
[
231,
233
],
[
233,
234
],
[
234,
235
],
[
235,
236
],
[
230,
237
],
[
237,
238
],
[
238,
239
],
[
238,
240
],
[
240,
241
],
[
241,
242
],
[
226,
243
],
[
243,
244
],
[
157,
245
],
[
245,
246
],
[
245,
247
],
[
247,
248
],
[
248,
249
],
[
245,
250
],
[
250,
251
],
[
0,
252
],
[
252,
253
],
[
252,
254
]
]
| [
"\n\nimport java.io.BufferedReader;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\nimport java.util.Set;\nimport java.util.StringTokenizer;\n\n\npublic class Main {\n\t static class FastReader \n\t { \n\t BufferedReader br; \n\t StringTokenizer st; \n\t \n\t \n\t public FastReader() \n\t { \n\t br = new BufferedReader(new\n\t InputStreamReader(System.in)); \n\t } \n\t \n\t String next() \n\t { \n\t while (st == null || !st.hasMoreTokens()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t } \n\t return st.nextToken();\n\t \n\t } \n\t \n\t int nextInt() \n\t { \n\t return Integer.parseInt(next()); \n\t } \n\t \n\t long nextLong() \n\t { \n\t return Long.parseLong(next()); \n\t } \n\t \n\t double nextDouble() \n\t { \n\t return Double.parseDouble(next()); \n\t } \n\t \n\t String nextLine() \n\t { \n\t String str = \"\"; \n\t try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t return str; \n\t }\n\n\t\t\tpublic Character charAt(int i) {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\treturn null;\n\t\t\t} \n\t }\n\n\t static int gcd(int a , int b) {\n\t\t if(b==0)return a;\n\t\t return gcd(b,a%b);\n\t }\n\n\t/**\n\t * @param args\n\t * @throws IOException\n\t */\n\t \n\n\tpublic static void main(String[] args)throws IOException {\n\t\tFastReader s=new FastReader();\t\t\n\t\tString se = s.next();\n\t\tString a = s.next();\n\t\tint k=0,max=Integer.MAX_VALUE,c=0;\n\t\t\n\t\tfor(int i=0;i<=se.length()-a.length();i++) {\n\t\t\tk=0;\n\t\t\tint p=i;\n\t\t\tfor(int j=0;j<a.length();j++) {\n\t\t\t\tif(se.charAt(p++)!=a.charAt(j))k++;\n\t\t\t}\n//\t\t\tSystem.out.println(k);\n\t\t\tmax = Math.min(max, k);\n\t\t}\n\t\tSystem.out.println(max);\n\t}\n}\n\t\n",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.util.ArrayList;",
"ArrayList",
"java.util",
"import java.util.Arrays;",
"Arrays",
"java.util",
"import java.util.Collections;",
"Collections",
"java.util",
"import java.util.HashMap;",
"HashMap",
"java.util",
"import java.util.HashSet;",
"HashSet",
"java.util",
"import java.util.List;",
"List",
"java.util",
"import java.util.Map;",
"Map",
"java.util",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.util.Scanner;",
"Scanner",
"java.util",
"import java.util.Set;",
"Set",
"java.util",
"import java.util.StringTokenizer;",
"StringTokenizer",
"java.util",
"public class Main {\n\t static class FastReader \n\t { \n\t BufferedReader br; \n\t StringTokenizer st; \n\t \n\t \n\t public FastReader() \n\t { \n\t br = new BufferedReader(new\n\t InputStreamReader(System.in)); \n\t } \n\t \n\t String next() \n\t { \n\t while (st == null || !st.hasMoreTokens()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t } \n\t return st.nextToken();\n\t \n\t } \n\t \n\t int nextInt() \n\t { \n\t return Integer.parseInt(next()); \n\t } \n\t \n\t long nextLong() \n\t { \n\t return Long.parseLong(next()); \n\t } \n\t \n\t double nextDouble() \n\t { \n\t return Double.parseDouble(next()); \n\t } \n\t \n\t String nextLine() \n\t { \n\t String str = \"\"; \n\t try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t return str; \n\t }\n\n\t\t\tpublic Character charAt(int i) {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\treturn null;\n\t\t\t} \n\t }\n\n\t static int gcd(int a , int b) {\n\t\t if(b==0)return a;\n\t\t return gcd(b,a%b);\n\t }\n\n\t/**\n\t * @param args\n\t * @throws IOException\n\t */\n\t \n\n\tpublic static void main(String[] args)throws IOException {\n\t\tFastReader s=new FastReader();\t\t\n\t\tString se = s.next();\n\t\tString a = s.next();\n\t\tint k=0,max=Integer.MAX_VALUE,c=0;\n\t\t\n\t\tfor(int i=0;i<=se.length()-a.length();i++) {\n\t\t\tk=0;\n\t\t\tint p=i;\n\t\t\tfor(int j=0;j<a.length();j++) {\n\t\t\t\tif(se.charAt(p++)!=a.charAt(j))k++;\n\t\t\t}\n//\t\t\tSystem.out.println(k);\n\t\t\tmax = Math.min(max, k);\n\t\t}\n\t\tSystem.out.println(max);\n\t}\n}",
"Main",
"static int gcd(int a , int b) {\n\t\t if(b==0)return a;\n\t\t return gcd(b,a%b);\n\t }",
"gcd",
"{\n\t\t if(b==0)return a;\n\t\t return gcd(b,a%b);\n\t }",
"if(b==0)return a;",
"b==0",
"b",
"0",
"return a;",
"a",
"return gcd(b,a%b);",
"gcd(b,a%b)",
"gcd",
"b",
"a%b",
"a",
"b",
"int a",
"a",
"int b",
"b",
"/**\n\t * @param args\n\t * @throws IOException\n\t */\n\t \n\n\tpublic static void main(String[] args)throws IOException {\n\t\tFastReader s=new FastReader();\t\t\n\t\tString se = s.next();\n\t\tString a = s.next();\n\t\tint k=0,max=Integer.MAX_VALUE,c=0;\n\t\t\n\t\tfor(int i=0;i<=se.length()-a.length();i++) {\n\t\t\tk=0;\n\t\t\tint p=i;\n\t\t\tfor(int j=0;j<a.length();j++) {\n\t\t\t\tif(se.charAt(p++)!=a.charAt(j))k++;\n\t\t\t}\n//\t\t\tSystem.out.println(k);\n\t\t\tmax = Math.min(max, k);\n\t\t}\n\t\tSystem.out.println(max);\n\t}",
"main",
"{\n\t\tFastReader s=new FastReader();\t\t\n\t\tString se = s.next();\n\t\tString a = s.next();\n\t\tint k=0,max=Integer.MAX_VALUE,c=0;\n\t\t\n\t\tfor(int i=0;i<=se.length()-a.length();i++) {\n\t\t\tk=0;\n\t\t\tint p=i;\n\t\t\tfor(int j=0;j<a.length();j++) {\n\t\t\t\tif(se.charAt(p++)!=a.charAt(j))k++;\n\t\t\t}\n//\t\t\tSystem.out.println(k);\n\t\t\tmax = Math.min(max, k);\n\t\t}\n\t\tSystem.out.println(max);\n\t}",
"FastReader s=new FastReader();",
"s",
"new FastReader()",
"String se = s.next();",
"se",
"s.next()",
"s.next",
"s",
"String a = s.next();",
"a",
"s.next()",
"s.next",
"s",
"int k=0",
"k",
"0",
"max=Integer.MAX_VALUE",
"max",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"c=0;",
"c",
"0",
"for(int i=0;i<=se.length()-a.length();i++) {\n\t\t\tk=0;\n\t\t\tint p=i;\n\t\t\tfor(int j=0;j<a.length();j++) {\n\t\t\t\tif(se.charAt(p++)!=a.charAt(j))k++;\n\t\t\t}\n//\t\t\tSystem.out.println(k);\n\t\t\tmax = Math.min(max, k);\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<=se.length()-a.length()",
"i",
"se.length()-a.length()",
"se.length()",
"se.length",
"se",
"a.length()",
"a.length",
"a",
"i++",
"i++",
"i",
"{\n\t\t\tk=0;\n\t\t\tint p=i;\n\t\t\tfor(int j=0;j<a.length();j++) {\n\t\t\t\tif(se.charAt(p++)!=a.charAt(j))k++;\n\t\t\t}\n//\t\t\tSystem.out.println(k);\n\t\t\tmax = Math.min(max, k);\n\t\t}",
"{\n\t\t\tk=0;\n\t\t\tint p=i;\n\t\t\tfor(int j=0;j<a.length();j++) {\n\t\t\t\tif(se.charAt(p++)!=a.charAt(j))k++;\n\t\t\t}\n//\t\t\tSystem.out.println(k);\n\t\t\tmax = Math.min(max, k);\n\t\t}",
"k=0",
"k",
"0",
"int p=i;",
"p",
"i",
"for(int j=0;j<a.length();j++) {\n\t\t\t\tif(se.charAt(p++)!=a.charAt(j))k++;\n\t\t\t}",
"int j=0;",
"int j=0;",
"j",
"0",
"j<a.length()",
"j",
"a.length()",
"a.length",
"a",
"j++",
"j++",
"j",
"{\n\t\t\t\tif(se.charAt(p++)!=a.charAt(j))k++;\n\t\t\t}",
"{\n\t\t\t\tif(se.charAt(p++)!=a.charAt(j))k++;\n\t\t\t}",
"if(se.charAt(p++)!=a.charAt(j))k++;",
"se.charAt(p++)!=a.charAt(j)",
"se.charAt(p++)",
"se.charAt",
"se",
"p++",
"p",
"a.charAt(j)",
"a.charAt",
"a",
"j",
"k++",
"k",
"max = Math.min(max, k)",
"max",
"Math.min(max, k)",
"Math.min",
"Math",
"max",
"k",
"System.out.println(max)",
"System.out.println",
"System.out",
"System",
"System.out",
"max",
"String[] args",
"args",
"static class FastReader \n\t { \n\t BufferedReader br; \n\t StringTokenizer st; \n\t \n\t \n\t public FastReader() \n\t { \n\t br = new BufferedReader(new\n\t InputStreamReader(System.in)); \n\t } \n\t \n\t String next() \n\t { \n\t while (st == null || !st.hasMoreTokens()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t } \n\t return st.nextToken();\n\t \n\t } \n\t \n\t int nextInt() \n\t { \n\t return Integer.parseInt(next()); \n\t } \n\t \n\t long nextLong() \n\t { \n\t return Long.parseLong(next()); \n\t } \n\t \n\t double nextDouble() \n\t { \n\t return Double.parseDouble(next()); \n\t } \n\t \n\t String nextLine() \n\t { \n\t String str = \"\"; \n\t try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t return str; \n\t }\n\n\t\t\tpublic Character charAt(int i) {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\treturn null;\n\t\t\t} \n\t }",
"FastReader",
"BufferedReader br;",
"br",
"StringTokenizer st;",
"st",
"public FastReader() \n\t { \n\t br = new BufferedReader(new\n\t InputStreamReader(System.in)); \n\t }",
"FastReader",
"{ \n\t br = new BufferedReader(new\n\t InputStreamReader(System.in)); \n\t }",
"br = new BufferedReader(new\n\t InputStreamReader(System.in))",
"br",
"new BufferedReader(new\n\t InputStreamReader(System.in))",
"String next() \n\t { \n\t while (st == null || !st.hasMoreTokens()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t } \n\t return st.nextToken();\n\t \n\t }",
"next",
"{ \n\t while (st == null || !st.hasMoreTokens()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t } \n\t return st.nextToken();\n\t \n\t }",
"while (st == null || !st.hasMoreTokens()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t }",
"st == null || !st.hasMoreTokens()",
"st == null",
"st",
"null",
"!st.hasMoreTokens()",
"st.hasMoreTokens()",
"st.hasMoreTokens",
"st",
"{ \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t }",
"try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t }",
"catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t }",
"IOException e",
"{ \n\t e.printStackTrace(); \n\t }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{ \n\t st = new StringTokenizer(br.readLine()); \n\t }",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"int nextInt() \n\t { \n\t return Integer.parseInt(next()); \n\t }",
"nextInt",
"{ \n\t return Integer.parseInt(next()); \n\t }",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"long nextLong() \n\t { \n\t return Long.parseLong(next()); \n\t }",
"nextLong",
"{ \n\t return Long.parseLong(next()); \n\t }",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"double nextDouble() \n\t { \n\t return Double.parseDouble(next()); \n\t }",
"nextDouble",
"{ \n\t return Double.parseDouble(next()); \n\t }",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"String nextLine() \n\t { \n\t String str = \"\"; \n\t try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t return str; \n\t }",
"nextLine",
"{ \n\t String str = \"\"; \n\t try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t return str; \n\t }",
"String str = \"\";",
"str",
"\"\"",
"try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t }",
"catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t }",
"IOException e",
"{ \n\t e.printStackTrace(); \n\t }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{ \n\t str = br.readLine(); \n\t }",
"str = br.readLine()",
"str",
"br.readLine()",
"br.readLine",
"br",
"return str;",
"str",
"public Character charAt(int i) {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\treturn null;\n\t\t\t}",
"charAt",
"{\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\treturn null;\n\t\t\t}",
"return null;",
"null",
"int i",
"i",
"public class Main {\n\t static class FastReader \n\t { \n\t BufferedReader br; \n\t StringTokenizer st; \n\t \n\t \n\t public FastReader() \n\t { \n\t br = new BufferedReader(new\n\t InputStreamReader(System.in)); \n\t } \n\t \n\t String next() \n\t { \n\t while (st == null || !st.hasMoreTokens()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t } \n\t return st.nextToken();\n\t \n\t } \n\t \n\t int nextInt() \n\t { \n\t return Integer.parseInt(next()); \n\t } \n\t \n\t long nextLong() \n\t { \n\t return Long.parseLong(next()); \n\t } \n\t \n\t double nextDouble() \n\t { \n\t return Double.parseDouble(next()); \n\t } \n\t \n\t String nextLine() \n\t { \n\t String str = \"\"; \n\t try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t return str; \n\t }\n\n\t\t\tpublic Character charAt(int i) {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\treturn null;\n\t\t\t} \n\t }\n\n\t static int gcd(int a , int b) {\n\t\t if(b==0)return a;\n\t\t return gcd(b,a%b);\n\t }\n\n\t/**\n\t * @param args\n\t * @throws IOException\n\t */\n\t \n\n\tpublic static void main(String[] args)throws IOException {\n\t\tFastReader s=new FastReader();\t\t\n\t\tString se = s.next();\n\t\tString a = s.next();\n\t\tint k=0,max=Integer.MAX_VALUE,c=0;\n\t\t\n\t\tfor(int i=0;i<=se.length()-a.length();i++) {\n\t\t\tk=0;\n\t\t\tint p=i;\n\t\t\tfor(int j=0;j<a.length();j++) {\n\t\t\t\tif(se.charAt(p++)!=a.charAt(j))k++;\n\t\t\t}\n//\t\t\tSystem.out.println(k);\n\t\t\tmax = Math.min(max, k);\n\t\t}\n\t\tSystem.out.println(max);\n\t}\n}",
"public class Main {\n\t static class FastReader \n\t { \n\t BufferedReader br; \n\t StringTokenizer st; \n\t \n\t \n\t public FastReader() \n\t { \n\t br = new BufferedReader(new\n\t InputStreamReader(System.in)); \n\t } \n\t \n\t String next() \n\t { \n\t while (st == null || !st.hasMoreTokens()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t } \n\t return st.nextToken();\n\t \n\t } \n\t \n\t int nextInt() \n\t { \n\t return Integer.parseInt(next()); \n\t } \n\t \n\t long nextLong() \n\t { \n\t return Long.parseLong(next()); \n\t } \n\t \n\t double nextDouble() \n\t { \n\t return Double.parseDouble(next()); \n\t } \n\t \n\t String nextLine() \n\t { \n\t String str = \"\"; \n\t try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t return str; \n\t }\n\n\t\t\tpublic Character charAt(int i) {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\treturn null;\n\t\t\t} \n\t }\n\n\t static int gcd(int a , int b) {\n\t\t if(b==0)return a;\n\t\t return gcd(b,a%b);\n\t }\n\n\t/**\n\t * @param args\n\t * @throws IOException\n\t */\n\t \n\n\tpublic static void main(String[] args)throws IOException {\n\t\tFastReader s=new FastReader();\t\t\n\t\tString se = s.next();\n\t\tString a = s.next();\n\t\tint k=0,max=Integer.MAX_VALUE,c=0;\n\t\t\n\t\tfor(int i=0;i<=se.length()-a.length();i++) {\n\t\t\tk=0;\n\t\t\tint p=i;\n\t\t\tfor(int j=0;j<a.length();j++) {\n\t\t\t\tif(se.charAt(p++)!=a.charAt(j))k++;\n\t\t\t}\n//\t\t\tSystem.out.println(k);\n\t\t\tmax = Math.min(max, k);\n\t\t}\n\t\tSystem.out.println(max);\n\t}\n}",
"Main"
]
|
import java.io.BufferedReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.Set;
import java.util.StringTokenizer;
public class Main {
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreTokens())
{
try
{
st = new StringTokenizer(br.readLine());
}
catch (IOException e)
{
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt()
{
return Integer.parseInt(next());
}
long nextLong()
{
return Long.parseLong(next());
}
double nextDouble()
{
return Double.parseDouble(next());
}
String nextLine()
{
String str = "";
try
{
str = br.readLine();
}
catch (IOException e)
{
e.printStackTrace();
}
return str;
}
public Character charAt(int i) {
// TODO Auto-generated method stub
return null;
}
}
static int gcd(int a , int b) {
if(b==0)return a;
return gcd(b,a%b);
}
/**
* @param args
* @throws IOException
*/
public static void main(String[] args)throws IOException {
FastReader s=new FastReader();
String se = s.next();
String a = s.next();
int k=0,max=Integer.MAX_VALUE,c=0;
for(int i=0;i<=se.length()-a.length();i++) {
k=0;
int p=i;
for(int j=0;j<a.length();j++) {
if(se.charAt(p++)!=a.charAt(j))k++;
}
// System.out.println(k);
max = Math.min(max, k);
}
System.out.println(max);
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
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,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
2,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
2,
4,
18,
13,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
17,
0,
13,
20,
12,
13,
30,
14,
2,
2,
13,
17,
40,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
0,
13,
17,
41,
13,
17,
0,
13,
4,
18,
13,
29,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
4,
18,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
250,
14
],
[
250,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
18,
20
],
[
17,
21
],
[
21,
22
],
[
22,
23
],
[
15,
24
],
[
24,
25
],
[
250,
26
],
[
26,
27
],
[
26,
28
],
[
28,
29
],
[
29,
30
],
[
29,
31
],
[
28,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
35,
36
],
[
28,
37
],
[
37,
38
],
[
37,
39
],
[
39,
40
],
[
40,
41
],
[
28,
42
],
[
42,
43
],
[
42,
44
],
[
28,
45
],
[
45,
46
],
[
46,
47
],
[
47,
48
],
[
47,
49
],
[
45,
50
],
[
50,
51
],
[
50,
52
],
[
52,
53
],
[
53,
54
],
[
54,
55
],
[
52,
56
],
[
56,
57
],
[
57,
58
],
[
45,
59
],
[
59,
60
],
[
60,
61
],
[
45,
62
],
[
63,
63
],
[
63,
64
],
[
64,
65
],
[
64,
66
],
[
63,
67
],
[
67,
68
],
[
68,
69
],
[
69,
70
],
[
69,
71
],
[
67,
72
],
[
72,
73
],
[
72,
74
],
[
74,
75
],
[
75,
76
],
[
67,
77
],
[
77,
78
],
[
78,
79
],
[
67,
80
],
[
81,
81
],
[
81,
82
],
[
82,
83
],
[
83,
84
],
[
84,
85
],
[
85,
86
],
[
84,
87
],
[
83,
88
],
[
88,
89
],
[
89,
90
],
[
88,
91
],
[
91,
92
],
[
91,
93
],
[
82,
94
],
[
94,
95
],
[
95,
96
],
[
63,
97
],
[
97,
98
],
[
97,
99
],
[
99,
100
],
[
100,
101
],
[
99,
102
],
[
99,
103
],
[
28,
104
],
[
104,
105
],
[
105,
106
],
[
106,
107
],
[
106,
108
],
[
104,
109
],
[
109,
110
],
[
110,
111
],
[
111,
112
],
[
109,
113
],
[
250,
114
],
[
114,
115
],
[
114,
116
],
[
116,
117
],
[
114,
118
],
[
118,
119
],
[
114,
120
],
[
120,
121
],
[
120,
122
],
[
122,
123
],
[
123,
124
],
[
123,
125
],
[
122,
126
],
[
126,
127
],
[
126,
128
],
[
114,
129
],
[
129,
130
],
[
129,
131
],
[
131,
132
],
[
132,
133
],
[
133,
134
],
[
134,
135
],
[
134,
136
],
[
133,
137
],
[
137,
138
],
[
138,
139
],
[
139,
140
],
[
132,
141
],
[
141,
142
],
[
142,
143
],
[
142,
144
],
[
131,
145
],
[
145,
146
],
[
146,
147
],
[
147,
148
],
[
114,
149
],
[
149,
150
],
[
149,
151
],
[
151,
152
],
[
152,
153
],
[
152,
154
],
[
151,
155
],
[
155,
156
],
[
155,
157
],
[
151,
158
],
[
158,
159
],
[
158,
160
],
[
160,
161
],
[
161,
162
],
[
151,
163
],
[
163,
164
],
[
114,
165
],
[
165,
166
],
[
165,
167
],
[
167,
168
],
[
168,
169
],
[
169,
170
],
[
170,
171
],
[
169,
172
],
[
172,
173
],
[
114,
174
],
[
174,
175
],
[
174,
176
],
[
176,
177
],
[
177,
178
],
[
178,
179
],
[
179,
180
],
[
178,
181
],
[
181,
182
],
[
114,
183
],
[
183,
184
],
[
183,
185
],
[
185,
186
],
[
186,
187
],
[
186,
188
],
[
185,
190
],
[
190,
191
],
[
191,
192
],
[
192,
193
],
[
192,
194
],
[
190,
195
],
[
195,
196
],
[
195,
197
],
[
190,
198
],
[
198,
199
],
[
199,
200
],
[
190,
201
],
[
202,
202
],
[
202,
203
],
[
203,
204
],
[
204,
205
],
[
204,
206
],
[
203,
207
],
[
207,
208
],
[
185,
209
],
[
209,
210
],
[
183,
211
],
[
211,
212
],
[
114,
213
],
[
213,
214
],
[
213,
215
],
[
215,
216
],
[
216,
217
],
[
216,
218
],
[
215,
220
],
[
220,
221
],
[
221,
222
],
[
222,
223
],
[
222,
224
],
[
220,
225
],
[
225,
226
],
[
225,
227
],
[
220,
228
],
[
228,
229
],
[
229,
230
],
[
220,
231
],
[
232,
232
],
[
232,
233
],
[
233,
234
],
[
234,
235
],
[
234,
236
],
[
233,
237
],
[
237,
238
],
[
215,
239
],
[
239,
240
],
[
213,
241
],
[
241,
242
],
[
114,
243
],
[
243,
244
],
[
243,
245
],
[
245,
246
],
[
246,
247
],
[
247,
248
],
[
0,
249
],
[
249,
250
],
[
249,
251
]
]
| [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tMain mainObj = new Main();\n\t\tmainObj.solve();\n\t}\n\n\tpublic void solve() throws IOException {\n\t\tFastScanner fs = new FastScanner();\n\t\t\n\t\tString s = fs.next();\n\t\tString t = fs.next();\n\t\t\n\t\tint maxkaburi = 0;\n\t\tfor(int i = 0; i <= s.length() - t.length(); i++) {\n\t\t\tint kaburi = 0;\n\t\t\tfor(int j = 0; j < t.length();j++) {\n\t\t\t\tif(t.charAt(j) == s.charAt(i+j)) {\n\t\t\t\t\tkaburi++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tmaxkaburi = Math.max(maxkaburi, kaburi);\n\t\t}\n\t\t\n\t\t\n\t\tSystem.out.println(t.length() - maxkaburi);\n\t}\n\n\t\n\n\tpublic class FastScanner {\n\n\t\tBufferedReader reader;\n\t\tprivate StringTokenizer st;\n\n\t\tpublic FastScanner() {\n\t\t\tst = null;\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\tif (st == null || !st.hasMoreElements()) {\n\t\t\t\tst = new StringTokenizer(reader.readLine());\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\tst = null;\n\t\t\tString readLine = null;\n\t\t\treadLine = reader.readLine();\n\t\t\treturn readLine;\n\t\t}\n\n\t\tpublic int nextInt() throws NumberFormatException, IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws NumberFormatException, IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic int[] nextIntArr(int n) throws NumberFormatException, IOException {\n\t\t\tint[] retArr = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextInt();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}\n\n\t\tpublic long[] nextLongArr(int n) throws NumberFormatException, IOException {\n\t\t\tlong[] retArr = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextLong();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}\n\n\t\tpublic void close() throws IOException {\n\t\t\treader.close();\n\t\t}\n\t}\n\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.util.StringTokenizer;",
"StringTokenizer",
"java.util",
"public class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tMain mainObj = new Main();\n\t\tmainObj.solve();\n\t}\n\n\tpublic void solve() throws IOException {\n\t\tFastScanner fs = new FastScanner();\n\t\t\n\t\tString s = fs.next();\n\t\tString t = fs.next();\n\t\t\n\t\tint maxkaburi = 0;\n\t\tfor(int i = 0; i <= s.length() - t.length(); i++) {\n\t\t\tint kaburi = 0;\n\t\t\tfor(int j = 0; j < t.length();j++) {\n\t\t\t\tif(t.charAt(j) == s.charAt(i+j)) {\n\t\t\t\t\tkaburi++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tmaxkaburi = Math.max(maxkaburi, kaburi);\n\t\t}\n\t\t\n\t\t\n\t\tSystem.out.println(t.length() - maxkaburi);\n\t}\n\n\t\n\n\tpublic class FastScanner {\n\n\t\tBufferedReader reader;\n\t\tprivate StringTokenizer st;\n\n\t\tpublic FastScanner() {\n\t\t\tst = null;\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\tif (st == null || !st.hasMoreElements()) {\n\t\t\t\tst = new StringTokenizer(reader.readLine());\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\tst = null;\n\t\t\tString readLine = null;\n\t\t\treadLine = reader.readLine();\n\t\t\treturn readLine;\n\t\t}\n\n\t\tpublic int nextInt() throws NumberFormatException, IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws NumberFormatException, IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic int[] nextIntArr(int n) throws NumberFormatException, IOException {\n\t\t\tint[] retArr = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextInt();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}\n\n\t\tpublic long[] nextLongArr(int n) throws NumberFormatException, IOException {\n\t\t\tlong[] retArr = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextLong();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}\n\n\t\tpublic void close() throws IOException {\n\t\t\treader.close();\n\t\t}\n\t}\n\n}",
"Main",
"public static void main(String[] args) throws IOException {\n\t\tMain mainObj = new Main();\n\t\tmainObj.solve();\n\t}",
"main",
"{\n\t\tMain mainObj = new Main();\n\t\tmainObj.solve();\n\t}",
"Main mainObj = new Main();",
"mainObj",
"new Main()",
"mainObj.solve()",
"mainObj.solve",
"mainObj",
"String[] args",
"args",
"public void solve() throws IOException {\n\t\tFastScanner fs = new FastScanner();\n\t\t\n\t\tString s = fs.next();\n\t\tString t = fs.next();\n\t\t\n\t\tint maxkaburi = 0;\n\t\tfor(int i = 0; i <= s.length() - t.length(); i++) {\n\t\t\tint kaburi = 0;\n\t\t\tfor(int j = 0; j < t.length();j++) {\n\t\t\t\tif(t.charAt(j) == s.charAt(i+j)) {\n\t\t\t\t\tkaburi++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tmaxkaburi = Math.max(maxkaburi, kaburi);\n\t\t}\n\t\t\n\t\t\n\t\tSystem.out.println(t.length() - maxkaburi);\n\t}",
"solve",
"{\n\t\tFastScanner fs = new FastScanner();\n\t\t\n\t\tString s = fs.next();\n\t\tString t = fs.next();\n\t\t\n\t\tint maxkaburi = 0;\n\t\tfor(int i = 0; i <= s.length() - t.length(); i++) {\n\t\t\tint kaburi = 0;\n\t\t\tfor(int j = 0; j < t.length();j++) {\n\t\t\t\tif(t.charAt(j) == s.charAt(i+j)) {\n\t\t\t\t\tkaburi++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tmaxkaburi = Math.max(maxkaburi, kaburi);\n\t\t}\n\t\t\n\t\t\n\t\tSystem.out.println(t.length() - maxkaburi);\n\t}",
"FastScanner fs = new FastScanner();",
"fs",
"new FastScanner()",
"String s = fs.next();",
"s",
"fs.next()",
"fs.next",
"fs",
"String t = fs.next();",
"t",
"fs.next()",
"fs.next",
"fs",
"int maxkaburi = 0;",
"maxkaburi",
"0",
"for(int i = 0; i <= s.length() - t.length(); i++) {\n\t\t\tint kaburi = 0;\n\t\t\tfor(int j = 0; j < t.length();j++) {\n\t\t\t\tif(t.charAt(j) == s.charAt(i+j)) {\n\t\t\t\t\tkaburi++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tmaxkaburi = Math.max(maxkaburi, kaburi);\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= s.length() - t.length()",
"i",
"s.length() - t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"i++",
"i++",
"i",
"{\n\t\t\tint kaburi = 0;\n\t\t\tfor(int j = 0; j < t.length();j++) {\n\t\t\t\tif(t.charAt(j) == s.charAt(i+j)) {\n\t\t\t\t\tkaburi++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tmaxkaburi = Math.max(maxkaburi, kaburi);\n\t\t}",
"{\n\t\t\tint kaburi = 0;\n\t\t\tfor(int j = 0; j < t.length();j++) {\n\t\t\t\tif(t.charAt(j) == s.charAt(i+j)) {\n\t\t\t\t\tkaburi++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tmaxkaburi = Math.max(maxkaburi, kaburi);\n\t\t}",
"int kaburi = 0;",
"kaburi",
"0",
"for(int j = 0; j < t.length();j++) {\n\t\t\t\tif(t.charAt(j) == s.charAt(i+j)) {\n\t\t\t\t\tkaburi++;\n\t\t\t\t}\n\t\t\t}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n\t\t\t\tif(t.charAt(j) == s.charAt(i+j)) {\n\t\t\t\t\tkaburi++;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif(t.charAt(j) == s.charAt(i+j)) {\n\t\t\t\t\tkaburi++;\n\t\t\t\t}\n\t\t\t}",
"if(t.charAt(j) == s.charAt(i+j)) {\n\t\t\t\t\tkaburi++;\n\t\t\t\t}",
"t.charAt(j) == s.charAt(i+j)",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"s.charAt(i+j)",
"s.charAt",
"s",
"i+j",
"i",
"j",
"{\n\t\t\t\t\tkaburi++;\n\t\t\t\t}",
"kaburi++",
"kaburi",
"maxkaburi = Math.max(maxkaburi, kaburi)",
"maxkaburi",
"Math.max(maxkaburi, kaburi)",
"Math.max",
"Math",
"maxkaburi",
"kaburi",
"System.out.println(t.length() - maxkaburi)",
"System.out.println",
"System.out",
"System",
"System.out",
"t.length() - maxkaburi",
"t.length()",
"t.length",
"t",
"maxkaburi",
"public class FastScanner {\n\n\t\tBufferedReader reader;\n\t\tprivate StringTokenizer st;\n\n\t\tpublic FastScanner() {\n\t\t\tst = null;\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\tif (st == null || !st.hasMoreElements()) {\n\t\t\t\tst = new StringTokenizer(reader.readLine());\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\tst = null;\n\t\t\tString readLine = null;\n\t\t\treadLine = reader.readLine();\n\t\t\treturn readLine;\n\t\t}\n\n\t\tpublic int nextInt() throws NumberFormatException, IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws NumberFormatException, IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic int[] nextIntArr(int n) throws NumberFormatException, IOException {\n\t\t\tint[] retArr = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextInt();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}\n\n\t\tpublic long[] nextLongArr(int n) throws NumberFormatException, IOException {\n\t\t\tlong[] retArr = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextLong();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}\n\n\t\tpublic void close() throws IOException {\n\t\t\treader.close();\n\t\t}\n\t}",
"FastScanner",
"BufferedReader reader;",
"reader",
"private StringTokenizer st;",
"st",
"public FastScanner() {\n\t\t\tst = null;\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\t}",
"FastScanner",
"{\n\t\t\tst = null;\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\t}",
"st = null",
"st",
"null",
"reader = new BufferedReader(new InputStreamReader(System.in))",
"reader",
"new BufferedReader(new InputStreamReader(System.in))",
"public String next() throws IOException {\n\t\t\tif (st == null || !st.hasMoreElements()) {\n\t\t\t\tst = new StringTokenizer(reader.readLine());\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}",
"next",
"{\n\t\t\tif (st == null || !st.hasMoreElements()) {\n\t\t\t\tst = new StringTokenizer(reader.readLine());\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}",
"if (st == null || !st.hasMoreElements()) {\n\t\t\t\tst = new StringTokenizer(reader.readLine());\n\t\t\t}",
"st == null || !st.hasMoreElements()",
"st == null",
"st",
"null",
"!st.hasMoreElements()",
"st.hasMoreElements()",
"st.hasMoreElements",
"st",
"{\n\t\t\t\tst = new StringTokenizer(reader.readLine());\n\t\t\t}",
"st = new StringTokenizer(reader.readLine())",
"st",
"new StringTokenizer(reader.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"public String nextLine() throws IOException {\n\t\t\tst = null;\n\t\t\tString readLine = null;\n\t\t\treadLine = reader.readLine();\n\t\t\treturn readLine;\n\t\t}",
"nextLine",
"{\n\t\t\tst = null;\n\t\t\tString readLine = null;\n\t\t\treadLine = reader.readLine();\n\t\t\treturn readLine;\n\t\t}",
"st = null",
"st",
"null",
"String readLine = null;",
"readLine",
"null",
"readLine = reader.readLine()",
"readLine",
"reader.readLine()",
"reader.readLine",
"reader",
"return readLine;",
"readLine",
"public int nextInt() throws NumberFormatException, IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}",
"nextInt",
"{\n\t\t\treturn Integer.parseInt(next());\n\t\t}",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"public long nextLong() throws NumberFormatException, IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}",
"nextLong",
"{\n\t\t\treturn Long.parseLong(next());\n\t\t}",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"public int[] nextIntArr(int n) throws NumberFormatException, IOException {\n\t\t\tint[] retArr = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextInt();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}",
"nextIntArr",
"{\n\t\t\tint[] retArr = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextInt();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}",
"int[] retArr = new int[n];",
"retArr",
"new int[n]",
"n",
"for (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextInt();\n\t\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\t\tretArr[i] = nextInt();\n\t\t\t}",
"{\n\t\t\t\tretArr[i] = nextInt();\n\t\t\t}",
"retArr[i] = nextInt()",
"retArr[i]",
"retArr",
"i",
"nextInt()",
"nextInt",
"return retArr;",
"retArr",
"int n",
"n",
"public long[] nextLongArr(int n) throws NumberFormatException, IOException {\n\t\t\tlong[] retArr = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextLong();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}",
"nextLongArr",
"{\n\t\t\tlong[] retArr = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextLong();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}",
"long[] retArr = new long[n];",
"retArr",
"new long[n]",
"n",
"for (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextLong();\n\t\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n\t\t\t\tretArr[i] = nextLong();\n\t\t\t}",
"{\n\t\t\t\tretArr[i] = nextLong();\n\t\t\t}",
"retArr[i] = nextLong()",
"retArr[i]",
"retArr",
"i",
"nextLong()",
"nextLong",
"return retArr;",
"retArr",
"int n",
"n",
"public void close() throws IOException {\n\t\t\treader.close();\n\t\t}",
"close",
"{\n\t\t\treader.close();\n\t\t}",
"reader.close()",
"reader.close",
"reader",
"public class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tMain mainObj = new Main();\n\t\tmainObj.solve();\n\t}\n\n\tpublic void solve() throws IOException {\n\t\tFastScanner fs = new FastScanner();\n\t\t\n\t\tString s = fs.next();\n\t\tString t = fs.next();\n\t\t\n\t\tint maxkaburi = 0;\n\t\tfor(int i = 0; i <= s.length() - t.length(); i++) {\n\t\t\tint kaburi = 0;\n\t\t\tfor(int j = 0; j < t.length();j++) {\n\t\t\t\tif(t.charAt(j) == s.charAt(i+j)) {\n\t\t\t\t\tkaburi++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tmaxkaburi = Math.max(maxkaburi, kaburi);\n\t\t}\n\t\t\n\t\t\n\t\tSystem.out.println(t.length() - maxkaburi);\n\t}\n\n\t\n\n\tpublic class FastScanner {\n\n\t\tBufferedReader reader;\n\t\tprivate StringTokenizer st;\n\n\t\tpublic FastScanner() {\n\t\t\tst = null;\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\tif (st == null || !st.hasMoreElements()) {\n\t\t\t\tst = new StringTokenizer(reader.readLine());\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\tst = null;\n\t\t\tString readLine = null;\n\t\t\treadLine = reader.readLine();\n\t\t\treturn readLine;\n\t\t}\n\n\t\tpublic int nextInt() throws NumberFormatException, IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws NumberFormatException, IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic int[] nextIntArr(int n) throws NumberFormatException, IOException {\n\t\t\tint[] retArr = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextInt();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}\n\n\t\tpublic long[] nextLongArr(int n) throws NumberFormatException, IOException {\n\t\t\tlong[] retArr = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextLong();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}\n\n\t\tpublic void close() throws IOException {\n\t\t\treader.close();\n\t\t}\n\t}\n\n}",
"public class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tMain mainObj = new Main();\n\t\tmainObj.solve();\n\t}\n\n\tpublic void solve() throws IOException {\n\t\tFastScanner fs = new FastScanner();\n\t\t\n\t\tString s = fs.next();\n\t\tString t = fs.next();\n\t\t\n\t\tint maxkaburi = 0;\n\t\tfor(int i = 0; i <= s.length() - t.length(); i++) {\n\t\t\tint kaburi = 0;\n\t\t\tfor(int j = 0; j < t.length();j++) {\n\t\t\t\tif(t.charAt(j) == s.charAt(i+j)) {\n\t\t\t\t\tkaburi++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tmaxkaburi = Math.max(maxkaburi, kaburi);\n\t\t}\n\t\t\n\t\t\n\t\tSystem.out.println(t.length() - maxkaburi);\n\t}\n\n\t\n\n\tpublic class FastScanner {\n\n\t\tBufferedReader reader;\n\t\tprivate StringTokenizer st;\n\n\t\tpublic FastScanner() {\n\t\t\tst = null;\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\tif (st == null || !st.hasMoreElements()) {\n\t\t\t\tst = new StringTokenizer(reader.readLine());\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\tst = null;\n\t\t\tString readLine = null;\n\t\t\treadLine = reader.readLine();\n\t\t\treturn readLine;\n\t\t}\n\n\t\tpublic int nextInt() throws NumberFormatException, IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws NumberFormatException, IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic int[] nextIntArr(int n) throws NumberFormatException, IOException {\n\t\t\tint[] retArr = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextInt();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}\n\n\t\tpublic long[] nextLongArr(int n) throws NumberFormatException, IOException {\n\t\t\tlong[] retArr = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextLong();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}\n\n\t\tpublic void close() throws IOException {\n\t\t\treader.close();\n\t\t}\n\t}\n\n}",
"Main"
]
| import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
Main mainObj = new Main();
mainObj.solve();
}
public void solve() throws IOException {
FastScanner fs = new FastScanner();
String s = fs.next();
String t = fs.next();
int maxkaburi = 0;
for(int i = 0; i <= s.length() - t.length(); i++) {
int kaburi = 0;
for(int j = 0; j < t.length();j++) {
if(t.charAt(j) == s.charAt(i+j)) {
kaburi++;
}
}
maxkaburi = Math.max(maxkaburi, kaburi);
}
System.out.println(t.length() - maxkaburi);
}
public class FastScanner {
BufferedReader reader;
private StringTokenizer st;
public FastScanner() {
st = null;
reader = new BufferedReader(new InputStreamReader(System.in));
}
public String next() throws IOException {
if (st == null || !st.hasMoreElements()) {
st = new StringTokenizer(reader.readLine());
}
return st.nextToken();
}
public String nextLine() throws IOException {
st = null;
String readLine = null;
readLine = reader.readLine();
return readLine;
}
public int nextInt() throws NumberFormatException, IOException {
return Integer.parseInt(next());
}
public long nextLong() throws NumberFormatException, IOException {
return Long.parseLong(next());
}
public int[] nextIntArr(int n) throws NumberFormatException, IOException {
int[] retArr = new int[n];
for (int i = 0; i < n; i++) {
retArr[i] = nextInt();
}
return retArr;
}
public long[] nextLongArr(int n) throws NumberFormatException, IOException {
long[] retArr = new long[n];
for (int i = 0; i < n; i++) {
retArr[i] = nextLong();
}
return retArr;
}
public void close() throws IOException {
reader.close();
}
}
}
|
[
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,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
20,
41,
13,
20,
12,
13,
30,
41,
13,
20,
4,
18,
13,
4,
18,
18,
13,
13,
23,
13,
12,
13,
30,
41,
13,
4,
18,
4,
13,
41,
13,
4,
18,
4,
13,
41,
13,
17,
41,
13,
11,
1,
41,
13,
17,
2,
13,
2,
18,
13,
13,
18,
13,
13,
1,
40,
13,
30,
30,
0,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
2,
13,
13,
18,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
13,
13,
12,
13,
30,
29,
4,
18,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
18,
13,
13,
13,
4,
13,
29,
13,
23,
13,
23,
13,
12,
13,
30,
29,
4,
18,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
18,
13,
13,
13,
4,
13,
29,
13,
23,
13,
23,
13,
12,
13,
30,
29,
4,
18,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
18,
13,
13,
13,
4,
13,
29,
13,
23,
13,
23,
13,
6,
13,
41,
13,
18,
13,
13,
41,
13,
20,
17,
41,
13,
17,
41,
13,
17,
12,
13,
30,
14,
2,
13,
13,
30,
29,
17,
30,
0,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
13,
14,
2,
13,
17,
30,
29,
17,
29,
17,
12,
13,
30,
14,
4,
13,
29,
18,
13,
40,
13,
29,
40,
17,
12,
13,
30,
29,
2,
2,
17,
13,
2,
13,
17,
23,
13,
12,
13,
30,
42,
2,
4,
13,
40,
4,
13,
18,
13,
13,
40,
13,
29,
4,
13,
12,
13,
30,
14,
40,
4,
13,
37,
20,
41,
13,
20,
41,
13,
4,
13,
42,
4,
13,
13,
30,
4,
18,
13,
13,
0,
13,
4,
13,
29,
4,
18,
13,
12,
13,
30,
14,
40,
4,
13,
37,
20,
41,
13,
17,
41,
13,
17,
41,
13,
4,
13,
14,
2,
13,
17,
30,
0,
13,
17,
0,
13,
4,
13,
14,
2,
2,
13,
17,
2,
17,
13,
30,
37,
20,
42,
17,
30,
14,
2,
2,
17,
13,
2,
13,
17,
30,
0,
13,
17,
0,
13,
2,
13,
17,
14,
2,
2,
13,
40,
17,
40,
4,
13,
13,
30,
29,
8,
13,
40,
13,
13,
30,
37,
20,
0,
13,
4,
13,
12,
13,
30,
41,
13,
4,
13,
14,
2,
2,
13,
18,
13,
13,
2,
13,
18,
13,
13,
37,
20,
29,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
16,
17
],
[
16,
18
],
[
0,
19
],
[
19,
20
],
[
19,
21
],
[
0,
22
],
[
22,
23
],
[
22,
24
],
[
0,
25
],
[
25,
26
],
[
25,
27
],
[
0,
28
],
[
28,
29
],
[
28,
30
],
[
0,
31
],
[
31,
32
],
[
31,
33
],
[
0,
34
],
[
34,
35
],
[
34,
36
],
[
0,
37
],
[
37,
38
],
[
37,
39
],
[
0,
40
],
[
40,
41
],
[
40,
42
],
[
0,
43
],
[
43,
44
],
[
43,
45
],
[
0,
46
],
[
46,
47
],
[
46,
48
],
[
0,
49
],
[
49,
50
],
[
49,
51
],
[
0,
52
],
[
52,
53
],
[
52,
54
],
[
0,
55
],
[
55,
56
],
[
55,
57
],
[
0,
58
],
[
58,
59
],
[
58,
60
],
[
0,
61
],
[
61,
62
],
[
61,
63
],
[
0,
64
],
[
674,
65
],
[
674,
66
],
[
66,
67
],
[
66,
68
],
[
674,
69
],
[
69,
70
],
[
69,
71
],
[
674,
72
],
[
72,
73
],
[
72,
74
],
[
74,
75
],
[
75,
76
],
[
75,
77
],
[
74,
78
],
[
78,
79
],
[
79,
80
],
[
74,
81
],
[
81,
82
],
[
82,
83
],
[
83,
84
],
[
83,
85
],
[
72,
86
],
[
86,
87
],
[
674,
88
],
[
88,
89
],
[
88,
90
],
[
90,
91
],
[
91,
92
],
[
91,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
90,
97
],
[
97,
98
],
[
97,
99
],
[
99,
100
],
[
100,
101
],
[
101,
102
],
[
90,
103
],
[
103,
104
],
[
103,
105
],
[
90,
106
],
[
106,
107
],
[
90,
108
],
[
108,
109
],
[
109,
110
],
[
110,
111
],
[
110,
112
],
[
108,
113
],
[
113,
114
],
[
113,
115
],
[
115,
116
],
[
116,
117
],
[
116,
118
],
[
115,
119
],
[
119,
120
],
[
119,
121
],
[
108,
122
],
[
122,
123
],
[
123,
124
],
[
108,
125
],
[
126,
126
],
[
126,
127
],
[
127,
128
],
[
127,
129
],
[
126,
130
],
[
130,
131
],
[
131,
132
],
[
132,
133
],
[
132,
134
],
[
130,
135
],
[
135,
136
],
[
135,
137
],
[
137,
138
],
[
137,
139
],
[
130,
140
],
[
140,
141
],
[
141,
142
],
[
130,
143
],
[
144,
144
],
[
144,
145
],
[
145,
146
],
[
146,
147
],
[
147,
148
],
[
147,
149
],
[
149,
150
],
[
149,
151
],
[
146,
152
],
[
152,
153
],
[
152,
154
],
[
145,
155
],
[
155,
156
],
[
126,
157
],
[
157,
158
],
[
157,
159
],
[
159,
160
],
[
160,
161
],
[
159,
162
],
[
159,
163
],
[
90,
164
],
[
164,
165
],
[
165,
166
],
[
164,
167
],
[
674,
168
],
[
168,
169
],
[
168,
170
],
[
170,
171
],
[
171,
172
],
[
172,
173
],
[
173,
174
],
[
674,
175
],
[
175,
176
],
[
175,
177
],
[
177,
178
],
[
178,
179
],
[
178,
180
],
[
177,
182
],
[
182,
183
],
[
183,
184
],
[
184,
185
],
[
184,
186
],
[
182,
187
],
[
187,
188
],
[
187,
189
],
[
182,
190
],
[
190,
191
],
[
191,
192
],
[
182,
193
],
[
194,
194
],
[
194,
195
],
[
195,
196
],
[
196,
197
],
[
196,
198
],
[
195,
199
],
[
199,
200
],
[
177,
201
],
[
201,
202
],
[
175,
203
],
[
203,
204
],
[
674,
205
],
[
205,
206
],
[
205,
207
],
[
207,
208
],
[
208,
209
],
[
208,
210
],
[
207,
213
],
[
213,
214
],
[
214,
215
],
[
215,
216
],
[
215,
217
],
[
213,
218
],
[
218,
219
],
[
218,
220
],
[
213,
221
],
[
221,
222
],
[
222,
223
],
[
213,
224
],
[
225,
225
],
[
225,
226
],
[
226,
227
],
[
227,
228
],
[
228,
229
],
[
228,
230
],
[
226,
231
],
[
231,
232
],
[
231,
233
],
[
226,
234
],
[
234,
235
],
[
235,
236
],
[
226,
237
],
[
238,
238
],
[
238,
239
],
[
239,
240
],
[
240,
241
],
[
241,
242
],
[
241,
243
],
[
240,
244
],
[
239,
245
],
[
245,
246
],
[
207,
247
],
[
247,
248
],
[
205,
249
],
[
249,
250
],
[
205,
251
],
[
251,
252
],
[
674,
253
],
[
253,
254
],
[
253,
255
],
[
255,
256
],
[
256,
257
],
[
257,
258
],
[
258,
259
],
[
674,
260
],
[
260,
261
],
[
260,
262
],
[
262,
263
],
[
263,
264
],
[
263,
265
],
[
262,
267
],
[
267,
268
],
[
268,
269
],
[
269,
270
],
[
269,
271
],
[
267,
272
],
[
272,
273
],
[
272,
274
],
[
267,
275
],
[
275,
276
],
[
276,
277
],
[
267,
278
],
[
279,
279
],
[
279,
280
],
[
280,
281
],
[
281,
282
],
[
281,
283
],
[
280,
284
],
[
284,
285
],
[
262,
286
],
[
286,
287
],
[
260,
288
],
[
288,
289
],
[
674,
290
],
[
290,
291
],
[
290,
292
],
[
292,
293
],
[
293,
294
],
[
293,
295
],
[
292,
298
],
[
298,
299
],
[
299,
300
],
[
300,
301
],
[
300,
302
],
[
298,
303
],
[
303,
304
],
[
303,
305
],
[
298,
306
],
[
306,
307
],
[
307,
308
],
[
298,
309
],
[
310,
310
],
[
310,
311
],
[
311,
312
],
[
312,
313
],
[
313,
314
],
[
313,
315
],
[
311,
316
],
[
316,
317
],
[
316,
318
],
[
311,
319
],
[
319,
320
],
[
320,
321
],
[
311,
322
],
[
323,
323
],
[
323,
324
],
[
324,
325
],
[
325,
326
],
[
326,
327
],
[
326,
328
],
[
325,
329
],
[
324,
330
],
[
330,
331
],
[
292,
332
],
[
332,
333
],
[
290,
334
],
[
334,
335
],
[
290,
336
],
[
336,
337
],
[
674,
338
],
[
338,
339
],
[
338,
340
],
[
340,
341
],
[
341,
342
],
[
342,
343
],
[
343,
344
],
[
674,
345
],
[
345,
346
],
[
345,
347
],
[
347,
348
],
[
348,
349
],
[
348,
350
],
[
347,
352
],
[
352,
353
],
[
353,
354
],
[
354,
355
],
[
354,
356
],
[
352,
357
],
[
357,
358
],
[
357,
359
],
[
352,
360
],
[
360,
361
],
[
361,
362
],
[
352,
363
],
[
364,
364
],
[
364,
365
],
[
365,
366
],
[
366,
367
],
[
366,
368
],
[
365,
369
],
[
369,
370
],
[
347,
371
],
[
371,
372
],
[
345,
373
],
[
373,
374
],
[
674,
375
],
[
375,
376
],
[
375,
377
],
[
377,
378
],
[
378,
379
],
[
378,
380
],
[
377,
383
],
[
383,
384
],
[
384,
385
],
[
385,
386
],
[
385,
387
],
[
383,
388
],
[
388,
389
],
[
388,
390
],
[
383,
391
],
[
391,
392
],
[
392,
393
],
[
383,
394
],
[
395,
395
],
[
395,
396
],
[
396,
397
],
[
397,
398
],
[
398,
399
],
[
398,
400
],
[
396,
401
],
[
401,
402
],
[
401,
403
],
[
396,
404
],
[
404,
405
],
[
405,
406
],
[
396,
407
],
[
408,
408
],
[
408,
409
],
[
409,
410
],
[
410,
411
],
[
411,
412
],
[
411,
413
],
[
410,
414
],
[
409,
415
],
[
415,
416
],
[
377,
417
],
[
417,
418
],
[
375,
419
],
[
419,
420
],
[
375,
421
],
[
421,
422
],
[
0,
423
],
[
423,
424
],
[
423,
425
],
[
425,
426
],
[
425,
427
],
[
427,
428
],
[
427,
429
],
[
423,
430
],
[
430,
431
],
[
430,
432
],
[
423,
434
],
[
434,
435
],
[
434,
436
],
[
423,
437
],
[
437,
438
],
[
437,
439
],
[
423,
440
],
[
440,
441
],
[
440,
442
],
[
442,
443
],
[
443,
444
],
[
444,
445
],
[
444,
446
],
[
443,
447
],
[
447,
448
],
[
448,
449
],
[
443,
450
],
[
450,
451
],
[
451,
452
],
[
451,
453
],
[
450,
454
],
[
454,
455
],
[
455,
456
],
[
455,
457
],
[
457,
458
],
[
458,
459
],
[
459,
460
],
[
454,
461
],
[
461,
462
],
[
462,
463
],
[
462,
464
],
[
464,
465
],
[
465,
466
],
[
464,
467
],
[
450,
468
],
[
468,
469
],
[
469,
470
],
[
469,
471
],
[
468,
472
],
[
472,
473
],
[
473,
474
],
[
442,
475
],
[
475,
476
],
[
423,
477
],
[
477,
478
],
[
477,
479
],
[
479,
480
],
[
480,
481
],
[
481,
482
],
[
480,
483
],
[
483,
484
],
[
484,
485
],
[
484,
486
],
[
486,
487
],
[
480,
488
],
[
488,
489
],
[
489,
490
],
[
423,
491
],
[
491,
492
],
[
491,
493
],
[
493,
494
],
[
494,
495
],
[
495,
496
],
[
496,
497
],
[
496,
498
],
[
495,
499
],
[
499,
500
],
[
499,
501
],
[
491,
502
],
[
502,
503
],
[
423,
504
],
[
504,
505
],
[
504,
506
],
[
506,
507
],
[
507,
508
],
[
508,
509
],
[
509,
510
],
[
508,
511
],
[
511,
512
],
[
512,
513
],
[
512,
514
],
[
514,
515
],
[
514,
516
],
[
507,
517
],
[
517,
518
],
[
506,
519
],
[
519,
520
],
[
520,
521
],
[
423,
522
],
[
522,
523
],
[
522,
524
],
[
524,
525
],
[
525,
526
],
[
526,
527
],
[
527,
528
],
[
525,
529
],
[
529,
530
],
[
524,
531
],
[
531,
532
],
[
531,
533
],
[
524,
534
],
[
534,
535
],
[
534,
536
],
[
536,
537
],
[
524,
538
],
[
538,
539
],
[
539,
540
],
[
539,
541
],
[
538,
542
],
[
542,
543
],
[
543,
544
],
[
544,
545
],
[
543,
546
],
[
542,
547
],
[
547,
548
],
[
547,
549
],
[
549,
550
],
[
524,
551
],
[
551,
552
],
[
552,
553
],
[
553,
554
],
[
423,
555
],
[
555,
556
],
[
555,
557
],
[
557,
558
],
[
558,
559
],
[
559,
560
],
[
560,
561
],
[
558,
562
],
[
562,
563
],
[
557,
564
],
[
564,
565
],
[
564,
566
],
[
557,
567
],
[
567,
568
],
[
567,
569
],
[
557,
570
],
[
570,
571
],
[
570,
572
],
[
572,
573
],
[
557,
574
],
[
574,
575
],
[
575,
576
],
[
575,
577
],
[
574,
578
],
[
578,
579
],
[
579,
580
],
[
579,
581
],
[
578,
582
],
[
582,
583
],
[
582,
584
],
[
584,
585
],
[
557,
586
],
[
586,
587
],
[
587,
588
],
[
588,
589
],
[
588,
590
],
[
587,
591
],
[
591,
592
],
[
591,
593
],
[
586,
594
],
[
594,
595
],
[
595,
596
],
[
557,
597
],
[
597,
598
],
[
597,
599
],
[
599,
600
],
[
600,
601
],
[
601,
602
],
[
602,
603
],
[
602,
604
],
[
601,
605
],
[
605,
606
],
[
605,
607
],
[
600,
608
],
[
608,
609
],
[
609,
610
],
[
609,
611
],
[
608,
612
],
[
612,
613
],
[
612,
614
],
[
614,
615
],
[
614,
616
],
[
600,
617
],
[
617,
618
],
[
618,
619
],
[
619,
620
],
[
619,
621
],
[
621,
622
],
[
618,
623
],
[
623,
624
],
[
624,
625
],
[
624,
626
],
[
617,
627
],
[
627,
628
],
[
628,
629
],
[
629,
630
],
[
629,
631
],
[
631,
632
],
[
629,
633
],
[
617,
634
],
[
634,
635
],
[
635,
636
],
[
599,
637
],
[
637,
638
],
[
637,
639
],
[
639,
640
],
[
423,
641
],
[
641,
642
],
[
641,
643
],
[
643,
644
],
[
644,
645
],
[
644,
646
],
[
646,
647
],
[
643,
648
],
[
648,
649
],
[
649,
650
],
[
650,
651
],
[
650,
652
],
[
652,
653
],
[
652,
654
],
[
649,
655
],
[
655,
656
],
[
655,
657
],
[
657,
658
],
[
657,
659
],
[
648,
660
],
[
660,
661
],
[
643,
662
],
[
662,
663
],
[
423,
664
],
[
664,
665
],
[
664,
666
],
[
666,
667
],
[
667,
668
],
[
668,
669
],
[
669,
670
],
[
668,
671
],
[
671,
672
],
[
0,
673
],
[
673,
674
],
[
673,
675
]
]
| [
"import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.net.ConnectException;\nimport java.rmi.dgc.Lease;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.Deque;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.NoSuchElementException;\nimport java.util.Objects;\nimport java.util.Set;\nimport java.util.Stack;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\nimport static java.util.Comparator.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.solve();\n\t\tmain.out.close();\n\t}\n\t// ======================================================================\n\tpublic void solve() {\n\t\tchar[] S = ns().toCharArray();\n\t\tchar[] T = ns().toCharArray();\n\t\tint ans = 1001, cnt;\n\t\tfor (int i = 0; i <= S.length-T.length; i++) {\n\t\t\tcnt = 0;\n\t\t\tfor (int j = 0; j < T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j])\tcnt++;\n\t\t\t}\n\t\t\tans = Math.min(ans, cnt);\n\t\t}\n\t\tout.println(ans);\n\t}\n\n\t// ------------------------------------------\n\t// ライブラリ\n\t// ------------------------------------------\n\t// Print\n\tprivate PrintWriter out = new PrintWriter(System.out);\n\t\n\t// Scanner\n\tprivate FastScanner scan = new FastScanner();\n\tint ni(){ return scan.nextInt();}\n\tint[] ni(int n){int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}\n\tint[][] ni(int y, int x){int[][] a = new int[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}\n\tlong nl(){return scan.nextLong();}\n\tlong[] nl(int n){long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}\n\tlong[][] nl(int y, int x){long[][] a = new long[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}\n\tString ns(){return scan.next();}\n\tString[] ns(int n){String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}\n\tString[][] ns(int y, int x){String[][] a = new String[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}\n}\nclass FastScanner {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\tprivate boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t}else{\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\tprivate int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n\tprivate static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n\tpublic boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n\tpublic String next() {\n\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile(isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\tpublic long nextLong() {\n\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile(true){\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t}else if(b == -1 || !isPrintableChar(b)){\n\t\t\t\treturn minus ? -n : n;\n\t\t\t}else{\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\tpublic double nextDouble() { return Double.parseDouble(next());}\n}",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStream;",
"InputStream",
"java.io",
"import java.io.PrintWriter;",
"PrintWriter",
"java.io",
"import java.net.ConnectException;",
"ConnectException",
"java.net",
"import java.rmi.dgc.Lease;",
"Lease",
"java.rmi.dgc",
"import java.util.ArrayDeque;",
"ArrayDeque",
"java.util",
"import java.util.ArrayList;",
"ArrayList",
"java.util",
"import java.util.Arrays;",
"Arrays",
"java.util",
"import java.util.Collections;",
"Collections",
"java.util",
"import java.util.Deque;",
"Deque",
"java.util",
"import java.util.HashMap;",
"HashMap",
"java.util",
"import java.util.HashSet;",
"HashSet",
"java.util",
"import java.util.List;",
"List",
"java.util",
"import java.util.Map;",
"Map",
"java.util",
"import java.util.NoSuchElementException;",
"NoSuchElementException",
"java.util",
"import java.util.Objects;",
"Objects",
"java.util",
"import java.util.Set;",
"Set",
"java.util",
"import java.util.Stack;",
"Stack",
"java.util",
"import java.util.TreeMap;",
"TreeMap",
"java.util",
"import java.util.TreeSet;",
"TreeSet",
"java.util",
"import static java.util.Comparator.*;",
"import static java.util.Comparator.*;",
"import static java.util.Comparator.*;",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.solve();\n\t\tmain.out.close();\n\t}\n\t// ======================================================================\n\tpublic void solve() {\n\t\tchar[] S = ns().toCharArray();\n\t\tchar[] T = ns().toCharArray();\n\t\tint ans = 1001, cnt;\n\t\tfor (int i = 0; i <= S.length-T.length; i++) {\n\t\t\tcnt = 0;\n\t\t\tfor (int j = 0; j < T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j])\tcnt++;\n\t\t\t}\n\t\t\tans = Math.min(ans, cnt);\n\t\t}\n\t\tout.println(ans);\n\t}\n\n\t// ------------------------------------------\n\t// ライブラリ\n\t// ------------------------------------------\n\t// Print\n\tprivate PrintWriter out = new PrintWriter(System.out);\n\t\n\t// Scanner\n\tprivate FastScanner scan = new FastScanner();\n\tint ni(){ return scan.nextInt();}\n\tint[] ni(int n){int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}\n\tint[][] ni(int y, int x){int[][] a = new int[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}\n\tlong nl(){return scan.nextLong();}\n\tlong[] nl(int n){long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}\n\tlong[][] nl(int y, int x){long[][] a = new long[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}\n\tString ns(){return scan.next();}\n\tString[] ns(int n){String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}\n\tString[][] ns(int y, int x){String[][] a = new String[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}\n}",
"Main",
"// ------------------------------------------\n\t// ライブラリ\n\t// ------------------------------------------\n\t// Print\n\tprivate PrintWriter out = new PrintWriter(System.out);",
"out",
"new PrintWriter(System.out)",
"// Scanner\n\tprivate FastScanner scan = new FastScanner();",
"scan",
"new FastScanner()",
"public static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.solve();\n\t\tmain.out.close();\n\t}",
"main",
"{\n\t\tMain main = new Main();\n\t\tmain.solve();\n\t\tmain.out.close();\n\t}",
"Main main = new Main();",
"main",
"new Main()",
"main.solve()",
"main.solve",
"main",
"main.out.close()",
"main.out.close",
"main.out",
"main",
"main.out",
"String[] args",
"args",
"// ======================================================================\n\tpublic void solve() {\n\t\tchar[] S = ns().toCharArray();\n\t\tchar[] T = ns().toCharArray();\n\t\tint ans = 1001, cnt;\n\t\tfor (int i = 0; i <= S.length-T.length; i++) {\n\t\t\tcnt = 0;\n\t\t\tfor (int j = 0; j < T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j])\tcnt++;\n\t\t\t}\n\t\t\tans = Math.min(ans, cnt);\n\t\t}\n\t\tout.println(ans);\n\t}",
"solve",
"{\n\t\tchar[] S = ns().toCharArray();\n\t\tchar[] T = ns().toCharArray();\n\t\tint ans = 1001, cnt;\n\t\tfor (int i = 0; i <= S.length-T.length; i++) {\n\t\t\tcnt = 0;\n\t\t\tfor (int j = 0; j < T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j])\tcnt++;\n\t\t\t}\n\t\t\tans = Math.min(ans, cnt);\n\t\t}\n\t\tout.println(ans);\n\t}",
"char[] S = ns().toCharArray();",
"S",
"ns().toCharArray()",
"ns().toCharArray",
"ns()",
"ns",
"char[] T = ns().toCharArray();",
"T",
"ns().toCharArray()",
"ns().toCharArray",
"ns()",
"ns",
"int ans = 1001",
"ans",
"1001",
"cnt;",
"cnt",
"for (int i = 0; i <= S.length-T.length; i++) {\n\t\t\tcnt = 0;\n\t\t\tfor (int j = 0; j < T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j])\tcnt++;\n\t\t\t}\n\t\t\tans = Math.min(ans, cnt);\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= S.length-T.length",
"i",
"S.length-T.length",
"S.length",
"S",
"S.length",
"T.length",
"T",
"T.length",
"i++",
"i++",
"i",
"{\n\t\t\tcnt = 0;\n\t\t\tfor (int j = 0; j < T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j])\tcnt++;\n\t\t\t}\n\t\t\tans = Math.min(ans, cnt);\n\t\t}",
"{\n\t\t\tcnt = 0;\n\t\t\tfor (int j = 0; j < T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j])\tcnt++;\n\t\t\t}\n\t\t\tans = Math.min(ans, cnt);\n\t\t}",
"cnt = 0",
"cnt",
"0",
"for (int j = 0; j < T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j])\tcnt++;\n\t\t\t}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < T.length",
"j",
"T.length",
"T",
"T.length",
"j++",
"j++",
"j",
"{\n\t\t\t\tif(S[i+j] != T[j])\tcnt++;\n\t\t\t}",
"{\n\t\t\t\tif(S[i+j] != T[j])\tcnt++;\n\t\t\t}",
"if(S[i+j] != T[j])\tcnt++;",
"S[i+j] != T[j]",
"S[i+j]",
"S",
"i+j",
"i",
"j",
"T[j]",
"T",
"j",
"cnt++",
"cnt",
"ans = Math.min(ans, cnt)",
"ans",
"Math.min(ans, cnt)",
"Math.min",
"Math",
"ans",
"cnt",
"out.println(ans)",
"out.println",
"out",
"ans",
"int ni(){ return scan.nextInt();}",
"ni",
"{ return scan.nextInt();}",
"return scan.nextInt();",
"scan.nextInt()",
"scan.nextInt",
"scan",
"int[] ni(int n){int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}",
"ni",
"{int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}",
"int[] a = new int[n];",
"a",
"new int[n]",
"n",
"for(int i = 0; i < n; i++){a[i] = ni();}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{a[i] = ni();}",
"{a[i] = ni();}",
"a[i] = ni()",
"a[i]",
"a",
"i",
"ni()",
"ni",
"return a;",
"a",
"int n",
"n",
"int[][] ni(int y, int x){int[][] a = new int[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}",
"ni",
"{int[][] a = new int[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}",
"int[][] a = new int[y][x];",
"a",
"new int[y][x]",
"y",
"x",
"for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < y",
"i",
"y",
"i++",
"i++",
"i",
"{for(int j = 0; j < x; j++){a[i][j] = ni();}}",
"{for(int j = 0; j < x; j++){a[i][j] = ni();}}",
"for(int j = 0; j < x; j++){a[i][j] = ni();}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < x",
"j",
"x",
"j++",
"j++",
"j",
"{a[i][j] = ni();}",
"{a[i][j] = ni();}",
"a[i][j] = ni()",
"a[i][j]",
"a[i]",
"a",
"i",
"j",
"ni()",
"ni",
"return a;",
"a",
"int y",
"y",
"int x",
"x",
"long nl(){return scan.nextLong();}",
"nl",
"{return scan.nextLong();}",
"return scan.nextLong();",
"scan.nextLong()",
"scan.nextLong",
"scan",
"long[] nl(int n){long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}",
"nl",
"{long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}",
"long[] a = new long[n];",
"a",
"new long[n]",
"n",
"for(int i = 0; i < n; i++){a[i] = nl();}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{a[i] = nl();}",
"{a[i] = nl();}",
"a[i] = nl()",
"a[i]",
"a",
"i",
"nl()",
"nl",
"return a;",
"a",
"int n",
"n",
"long[][] nl(int y, int x){long[][] a = new long[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}",
"nl",
"{long[][] a = new long[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}",
"long[][] a = new long[y][x];",
"a",
"new long[y][x]",
"y",
"x",
"for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < y",
"i",
"y",
"i++",
"i++",
"i",
"{for(int j = 0; j < x; j++){a[i][j] = nl();}}",
"{for(int j = 0; j < x; j++){a[i][j] = nl();}}",
"for(int j = 0; j < x; j++){a[i][j] = nl();}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < x",
"j",
"x",
"j++",
"j++",
"j",
"{a[i][j] = nl();}",
"{a[i][j] = nl();}",
"a[i][j] = nl()",
"a[i][j]",
"a[i]",
"a",
"i",
"j",
"nl()",
"nl",
"return a;",
"a",
"int y",
"y",
"int x",
"x",
"String ns(){return scan.next();}",
"ns",
"{return scan.next();}",
"return scan.next();",
"scan.next()",
"scan.next",
"scan",
"String[] ns(int n){String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}",
"ns",
"{String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}",
"String[] a = new String[n];",
"a",
"new String[n]",
"n",
"for(int i = 0; i < n; i++){a[i] = ns();}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{a[i] = ns();}",
"{a[i] = ns();}",
"a[i] = ns()",
"a[i]",
"a",
"i",
"ns()",
"ns",
"return a;",
"a",
"int n",
"n",
"String[][] ns(int y, int x){String[][] a = new String[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}",
"ns",
"{String[][] a = new String[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}",
"String[][] a = new String[y][x];",
"a",
"new String[y][x]",
"y",
"x",
"for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < y",
"i",
"y",
"i++",
"i++",
"i",
"{for(int j = 0; j < x; j++){a[i][j] = ns();}}",
"{for(int j = 0; j < x; j++){a[i][j] = ns();}}",
"for(int j = 0; j < x; j++){a[i][j] = ns();}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < x",
"j",
"x",
"j++",
"j++",
"j",
"{a[i][j] = ns();}",
"{a[i][j] = ns();}",
"a[i][j] = ns()",
"a[i][j]",
"a[i]",
"a",
"i",
"j",
"ns()",
"ns",
"return a;",
"a",
"int y",
"y",
"int x",
"x",
"class FastScanner {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\tprivate boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t}else{\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\tprivate int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n\tprivate static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n\tpublic boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n\tpublic String next() {\n\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile(isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\tpublic long nextLong() {\n\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile(true){\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t}else if(b == -1 || !isPrintableChar(b)){\n\t\t\t\treturn minus ? -n : n;\n\t\t\t}else{\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\tpublic double nextDouble() { return Double.parseDouble(next());}\n}",
"FastScanner",
"private final InputStream in = System.in;",
"in",
"System.in",
"System",
"System.in",
"private final byte[] buffer = new byte[1024];",
"buffer",
"new byte[1024]",
"1024",
"private int ptr = 0;",
"ptr",
"0",
"private int buflen = 0;",
"buflen",
"0",
"private boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t}else{\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}",
"hasNextByte",
"{\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t}else{\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}",
"if (ptr < buflen) {\n\t\t\treturn true;\n\t\t}else{\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}",
"ptr < buflen",
"ptr",
"buflen",
"{\n\t\t\treturn true;\n\t\t}",
"return true;",
"true",
"{\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}",
"ptr = 0",
"ptr",
"0",
"try {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}",
"catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}",
"IOException e",
"{\n\t\t\t\te.printStackTrace();\n\t\t\t}",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t}",
"buflen = in.read(buffer)",
"buflen",
"in.read(buffer)",
"in.read",
"in",
"buffer",
"if (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}",
"buflen <= 0",
"buflen",
"0",
"{\n\t\t\t\treturn false;\n\t\t\t}",
"return false;",
"false",
"return true;",
"true",
"private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}",
"readByte",
"{ if (hasNextByte()) return buffer[ptr++]; else return -1;}",
"if (hasNextByte()) return buffer[ptr++]; else return -1;",
"hasNextByte()",
"hasNextByte",
"return buffer[ptr++];",
"buffer[ptr++]",
"buffer",
"ptr++",
"ptr",
"return -1;",
"-1",
"1",
"private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}",
"isPrintableChar",
"{ return 33 <= c && c <= 126;}",
"return 33 <= c && c <= 126;",
"33 <= c && c <= 126",
"33 <= c",
"33",
"c",
"c <= 126",
"c",
"126",
"int c",
"c",
"public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}",
"hasNext",
"{ while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}",
"while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;",
"hasNextByte() && !isPrintableChar(buffer[ptr])",
"hasNextByte()",
"hasNextByte",
"!isPrintableChar(buffer[ptr])",
"isPrintableChar(buffer[ptr])",
"isPrintableChar",
"buffer[ptr]",
"buffer",
"ptr",
"ptr++",
"ptr",
"return hasNextByte();",
"hasNextByte()",
"hasNextByte",
"public String next() {\n\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile(isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}",
"next",
"{\n\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile(isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}",
"if (!hasNext()) throw new NoSuchElementException();",
"!hasNext()",
"hasNext()",
"hasNext",
"throw new NoSuchElementException();",
"new NoSuchElementException()",
"StringBuilder sb = new StringBuilder();",
"sb",
"new StringBuilder()",
"int b = readByte();",
"b",
"readByte()",
"readByte",
"while(isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}",
"isPrintableChar(b)",
"isPrintableChar",
"b",
"{\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}",
"sb.appendCodePoint(b)",
"sb.appendCodePoint",
"sb",
"b",
"b = readByte()",
"b",
"readByte()",
"readByte",
"return sb.toString();",
"sb.toString()",
"sb.toString",
"sb",
"public long nextLong() {\n\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile(true){\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t}else if(b == -1 || !isPrintableChar(b)){\n\t\t\t\treturn minus ? -n : n;\n\t\t\t}else{\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}",
"nextLong",
"{\n\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile(true){\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t}else if(b == -1 || !isPrintableChar(b)){\n\t\t\t\treturn minus ? -n : n;\n\t\t\t}else{\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}",
"if (!hasNext()) throw new NoSuchElementException();",
"!hasNext()",
"hasNext()",
"hasNext",
"throw new NoSuchElementException();",
"new NoSuchElementException()",
"long n = 0;",
"n",
"0",
"boolean minus = false;",
"minus",
"false",
"int b = readByte();",
"b",
"readByte()",
"readByte",
"if (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}",
"b == '-'",
"b",
"'-'",
"{\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}",
"minus = true",
"minus",
"true",
"b = readByte()",
"b",
"readByte()",
"readByte",
"if (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}",
"b < '0' || '9' < b",
"b < '0'",
"b",
"'0'",
"'9' < b",
"'9'",
"b",
"{\n\t\t\tthrow new NumberFormatException();\n\t\t}",
"throw new NumberFormatException();",
"new NumberFormatException()",
"while(true){\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t}else if(b == -1 || !isPrintableChar(b)){\n\t\t\t\treturn minus ? -n : n;\n\t\t\t}else{\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}",
"true",
"{\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t}else if(b == -1 || !isPrintableChar(b)){\n\t\t\t\treturn minus ? -n : n;\n\t\t\t}else{\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}",
"if ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t}else if(b == -1 || !isPrintableChar(b)){\n\t\t\t\treturn minus ? -n : n;\n\t\t\t}else{\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}",
"'0' <= b && b <= '9'",
"'0' <= b",
"'0'",
"b",
"b <= '9'",
"b",
"'9'",
"{\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t}",
"n *= 10",
"n",
"10",
"n += b - '0'",
"n",
"b - '0'",
"b",
"'0'",
"if(b == -1 || !isPrintableChar(b)){\n\t\t\t\treturn minus ? -n : n;\n\t\t\t}else{\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}",
"b == -1 || !isPrintableChar(b)",
"b == -1",
"b",
"-1",
"1",
"!isPrintableChar(b)",
"isPrintableChar(b)",
"isPrintableChar",
"b",
"{\n\t\t\t\treturn minus ? -n : n;\n\t\t\t}",
"return minus ? -n : n;",
"minus ? -n : n",
"minus",
"-n",
"n",
"n",
"{\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}",
"throw new NumberFormatException();",
"new NumberFormatException()",
"b = readByte()",
"b",
"readByte()",
"readByte",
"public int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n\t\treturn (int) nl;\n\t}",
"nextInt",
"{\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n\t\treturn (int) nl;\n\t}",
"long nl = nextLong();",
"nl",
"nextLong()",
"nextLong",
"if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();",
"nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE",
"nl < Integer.MIN_VALUE",
"nl",
"Integer.MIN_VALUE",
"Integer",
"Integer.MIN_VALUE",
"nl > Integer.MAX_VALUE",
"nl",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"throw new NumberFormatException();",
"new NumberFormatException()",
"return (int) nl;",
"(int) nl",
"public double nextDouble() { return Double.parseDouble(next());}",
"nextDouble",
"{ return Double.parseDouble(next());}",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.solve();\n\t\tmain.out.close();\n\t}\n\t// ======================================================================\n\tpublic void solve() {\n\t\tchar[] S = ns().toCharArray();\n\t\tchar[] T = ns().toCharArray();\n\t\tint ans = 1001, cnt;\n\t\tfor (int i = 0; i <= S.length-T.length; i++) {\n\t\t\tcnt = 0;\n\t\t\tfor (int j = 0; j < T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j])\tcnt++;\n\t\t\t}\n\t\t\tans = Math.min(ans, cnt);\n\t\t}\n\t\tout.println(ans);\n\t}\n\n\t// ------------------------------------------\n\t// ライブラリ\n\t// ------------------------------------------\n\t// Print\n\tprivate PrintWriter out = new PrintWriter(System.out);\n\t\n\t// Scanner\n\tprivate FastScanner scan = new FastScanner();\n\tint ni(){ return scan.nextInt();}\n\tint[] ni(int n){int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}\n\tint[][] ni(int y, int x){int[][] a = new int[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}\n\tlong nl(){return scan.nextLong();}\n\tlong[] nl(int n){long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}\n\tlong[][] nl(int y, int x){long[][] a = new long[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}\n\tString ns(){return scan.next();}\n\tString[] ns(int n){String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}\n\tString[][] ns(int y, int x){String[][] a = new String[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}\n}",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.solve();\n\t\tmain.out.close();\n\t}\n\t// ======================================================================\n\tpublic void solve() {\n\t\tchar[] S = ns().toCharArray();\n\t\tchar[] T = ns().toCharArray();\n\t\tint ans = 1001, cnt;\n\t\tfor (int i = 0; i <= S.length-T.length; i++) {\n\t\t\tcnt = 0;\n\t\t\tfor (int j = 0; j < T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j])\tcnt++;\n\t\t\t}\n\t\t\tans = Math.min(ans, cnt);\n\t\t}\n\t\tout.println(ans);\n\t}\n\n\t// ------------------------------------------\n\t// ライブラリ\n\t// ------------------------------------------\n\t// Print\n\tprivate PrintWriter out = new PrintWriter(System.out);\n\t\n\t// Scanner\n\tprivate FastScanner scan = new FastScanner();\n\tint ni(){ return scan.nextInt();}\n\tint[] ni(int n){int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}\n\tint[][] ni(int y, int x){int[][] a = new int[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}\n\tlong nl(){return scan.nextLong();}\n\tlong[] nl(int n){long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}\n\tlong[][] nl(int y, int x){long[][] a = new long[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}\n\tString ns(){return scan.next();}\n\tString[] ns(int n){String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}\n\tString[][] ns(int y, int x){String[][] a = new String[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}\n}",
"Main"
]
| import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.net.ConnectException;
import java.rmi.dgc.Lease;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;
import static java.util.Comparator.*;
public class Main {
public static void main(String[] args) {
Main main = new Main();
main.solve();
main.out.close();
}
// ======================================================================
public void solve() {
char[] S = ns().toCharArray();
char[] T = ns().toCharArray();
int ans = 1001, cnt;
for (int i = 0; i <= S.length-T.length; i++) {
cnt = 0;
for (int j = 0; j < T.length; j++) {
if(S[i+j] != T[j]) cnt++;
}
ans = Math.min(ans, cnt);
}
out.println(ans);
}
// ------------------------------------------
// ライブラリ
// ------------------------------------------
// Print
private PrintWriter out = new PrintWriter(System.out);
// Scanner
private FastScanner scan = new FastScanner();
int ni(){ return scan.nextInt();}
int[] ni(int n){int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}
int[][] ni(int y, int x){int[][] a = new int[y][x];
for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}
long nl(){return scan.nextLong();}
long[] nl(int n){long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}
long[][] nl(int y, int x){long[][] a = new long[y][x];
for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}
String ns(){return scan.next();}
String[] ns(int n){String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}
String[][] ns(int y, int x){String[][] a = new String[y][x];
for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() { return Double.parseDouble(next());}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
4,
18,
18,
13,
13,
4,
13,
13,
13,
23,
13,
12,
13,
30,
14,
2,
4,
18,
13,
4,
18,
13,
30,
29,
40,
17,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
2,
4,
18,
13,
4,
18,
13,
17,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
2,
13,
4,
18,
13,
41,
13,
4,
13,
13,
13,
14,
2,
13,
13,
30,
0,
13,
13,
29,
2,
4,
18,
13,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
41,
13,
4,
18,
13,
13,
14,
2,
13,
13,
30,
40,
13,
29,
13,
23,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
154,
5
],
[
154,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
23,
24
],
[
24,
25
],
[
24,
26
],
[
22,
27
],
[
27,
28
],
[
27,
29
],
[
27,
30
],
[
6,
31
],
[
31,
32
],
[
154,
33
],
[
33,
34
],
[
33,
35
],
[
35,
36
],
[
36,
37
],
[
37,
38
],
[
38,
39
],
[
39,
40
],
[
37,
41
],
[
41,
42
],
[
42,
43
],
[
36,
44
],
[
44,
45
],
[
45,
46
],
[
46,
47
],
[
35,
48
],
[
48,
49
],
[
48,
50
],
[
35,
51
],
[
51,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
51,
56
],
[
56,
57
],
[
56,
58
],
[
58,
59
],
[
59,
60
],
[
60,
61
],
[
61,
62
],
[
59,
63
],
[
63,
64
],
[
64,
65
],
[
58,
66
],
[
51,
67
],
[
67,
68
],
[
68,
69
],
[
51,
70
],
[
71,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
74,
75
],
[
75,
76
],
[
74,
77
],
[
74,
78
],
[
78,
79
],
[
78,
80
],
[
80,
81
],
[
81,
82
],
[
71,
83
],
[
83,
84
],
[
83,
85
],
[
85,
86
],
[
85,
87
],
[
85,
88
],
[
71,
89
],
[
89,
90
],
[
90,
91
],
[
90,
92
],
[
89,
93
],
[
93,
94
],
[
94,
95
],
[
94,
96
],
[
35,
97
],
[
97,
98
],
[
98,
99
],
[
99,
100
],
[
100,
101
],
[
98,
102
],
[
33,
103
],
[
103,
104
],
[
33,
105
],
[
105,
106
],
[
154,
107
],
[
107,
108
],
[
107,
109
],
[
109,
110
],
[
110,
111
],
[
110,
112
],
[
109,
113
],
[
113,
114
],
[
114,
115
],
[
115,
116
],
[
115,
117
],
[
113,
118
],
[
118,
119
],
[
118,
120
],
[
120,
121
],
[
121,
122
],
[
113,
123
],
[
123,
124
],
[
124,
125
],
[
113,
126
],
[
127,
127
],
[
127,
128
],
[
128,
129
],
[
128,
130
],
[
130,
131
],
[
131,
132
],
[
130,
133
],
[
127,
134
],
[
134,
135
],
[
134,
136
],
[
136,
137
],
[
137,
138
],
[
136,
139
],
[
127,
140
],
[
140,
141
],
[
141,
142
],
[
141,
143
],
[
140,
144
],
[
144,
145
],
[
145,
146
],
[
109,
147
],
[
147,
148
],
[
107,
149
],
[
149,
150
],
[
107,
151
],
[
151,
152
],
[
0,
153
],
[
153,
154
],
[
153,
155
]
]
| [
"import java.util.*;\n\npublic class Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String complete = sc.nextLine();\n String part = sc.nextLine();\n System.out.println(solve(complete, part));\n }\n\n public static int solve(String complete, String part) {\n if (part.length() > complete.length()) {\n return -1;\n }\n int count = 0;\n for(int i = 0; i < (complete.length() - part.length())+ 1; i++) {\n String substr = complete.substring(i, i + part.length());\n int value = calc(substr, part);\n if(value > count){\n count = value;\n }\n }\n return (part.length() - count);\n }\n\n public static int calc(String substr, String part) {\n int similar = 0;\n for(int i = 0; i < substr.length(); i++) {\n char ch1 = substr.charAt(i);\n char ch2 = part.charAt(i);\n if(ch1 == ch2) {\n similar++;\n }\n }\n return similar;\n }\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String complete = sc.nextLine();\n String part = sc.nextLine();\n System.out.println(solve(complete, part));\n }\n\n public static int solve(String complete, String part) {\n if (part.length() > complete.length()) {\n return -1;\n }\n int count = 0;\n for(int i = 0; i < (complete.length() - part.length())+ 1; i++) {\n String substr = complete.substring(i, i + part.length());\n int value = calc(substr, part);\n if(value > count){\n count = value;\n }\n }\n return (part.length() - count);\n }\n\n public static int calc(String substr, String part) {\n int similar = 0;\n for(int i = 0; i < substr.length(); i++) {\n char ch1 = substr.charAt(i);\n char ch2 = part.charAt(i);\n if(ch1 == ch2) {\n similar++;\n }\n }\n return similar;\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String complete = sc.nextLine();\n String part = sc.nextLine();\n System.out.println(solve(complete, part));\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n String complete = sc.nextLine();\n String part = sc.nextLine();\n System.out.println(solve(complete, part));\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String complete = sc.nextLine();",
"complete",
"sc.nextLine()",
"sc.nextLine",
"sc",
"String part = sc.nextLine();",
"part",
"sc.nextLine()",
"sc.nextLine",
"sc",
"System.out.println(solve(complete, part))",
"System.out.println",
"System.out",
"System",
"System.out",
"solve(complete, part)",
"solve",
"complete",
"part",
"String[] args",
"args",
"public static int solve(String complete, String part) {\n if (part.length() > complete.length()) {\n return -1;\n }\n int count = 0;\n for(int i = 0; i < (complete.length() - part.length())+ 1; i++) {\n String substr = complete.substring(i, i + part.length());\n int value = calc(substr, part);\n if(value > count){\n count = value;\n }\n }\n return (part.length() - count);\n }",
"solve",
"{\n if (part.length() > complete.length()) {\n return -1;\n }\n int count = 0;\n for(int i = 0; i < (complete.length() - part.length())+ 1; i++) {\n String substr = complete.substring(i, i + part.length());\n int value = calc(substr, part);\n if(value > count){\n count = value;\n }\n }\n return (part.length() - count);\n }",
"if (part.length() > complete.length()) {\n return -1;\n }",
"part.length() > complete.length()",
"part.length()",
"part.length",
"part",
"complete.length()",
"complete.length",
"complete",
"{\n return -1;\n }",
"return -1;",
"-1",
"1",
"int count = 0;",
"count",
"0",
"for(int i = 0; i < (complete.length() - part.length())+ 1; i++) {\n String substr = complete.substring(i, i + part.length());\n int value = calc(substr, part);\n if(value > count){\n count = value;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < (complete.length() - part.length())+ 1",
"i",
"(complete.length() - part.length())+ 1",
"(complete.length() - part.length())",
"complete.length()",
"complete.length",
"complete",
"part.length()",
"part.length",
"part",
"1",
"i++",
"i++",
"i",
"{\n String substr = complete.substring(i, i + part.length());\n int value = calc(substr, part);\n if(value > count){\n count = value;\n }\n }",
"{\n String substr = complete.substring(i, i + part.length());\n int value = calc(substr, part);\n if(value > count){\n count = value;\n }\n }",
"String substr = complete.substring(i, i + part.length());",
"substr",
"complete.substring(i, i + part.length())",
"complete.substring",
"complete",
"i",
"i + part.length()",
"i",
"part.length()",
"part.length",
"part",
"int value = calc(substr, part);",
"value",
"calc(substr, part)",
"calc",
"substr",
"part",
"if(value > count){\n count = value;\n }",
"value > count",
"value",
"count",
"{\n count = value;\n }",
"count = value",
"count",
"value",
"return (part.length() - count);",
"(part.length() - count)",
"part.length()",
"part.length",
"part",
"count",
"String complete",
"complete",
"String part",
"part",
"public static int calc(String substr, String part) {\n int similar = 0;\n for(int i = 0; i < substr.length(); i++) {\n char ch1 = substr.charAt(i);\n char ch2 = part.charAt(i);\n if(ch1 == ch2) {\n similar++;\n }\n }\n return similar;\n }",
"calc",
"{\n int similar = 0;\n for(int i = 0; i < substr.length(); i++) {\n char ch1 = substr.charAt(i);\n char ch2 = part.charAt(i);\n if(ch1 == ch2) {\n similar++;\n }\n }\n return similar;\n }",
"int similar = 0;",
"similar",
"0",
"for(int i = 0; i < substr.length(); i++) {\n char ch1 = substr.charAt(i);\n char ch2 = part.charAt(i);\n if(ch1 == ch2) {\n similar++;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < substr.length()",
"i",
"substr.length()",
"substr.length",
"substr",
"i++",
"i++",
"i",
"{\n char ch1 = substr.charAt(i);\n char ch2 = part.charAt(i);\n if(ch1 == ch2) {\n similar++;\n }\n }",
"{\n char ch1 = substr.charAt(i);\n char ch2 = part.charAt(i);\n if(ch1 == ch2) {\n similar++;\n }\n }",
"char ch1 = substr.charAt(i);",
"ch1",
"substr.charAt(i)",
"substr.charAt",
"substr",
"i",
"char ch2 = part.charAt(i);",
"ch2",
"part.charAt(i)",
"part.charAt",
"part",
"i",
"if(ch1 == ch2) {\n similar++;\n }",
"ch1 == ch2",
"ch1",
"ch2",
"{\n similar++;\n }",
"similar++",
"similar",
"return similar;",
"similar",
"String substr",
"substr",
"String part",
"part",
"public class Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String complete = sc.nextLine();\n String part = sc.nextLine();\n System.out.println(solve(complete, part));\n }\n\n public static int solve(String complete, String part) {\n if (part.length() > complete.length()) {\n return -1;\n }\n int count = 0;\n for(int i = 0; i < (complete.length() - part.length())+ 1; i++) {\n String substr = complete.substring(i, i + part.length());\n int value = calc(substr, part);\n if(value > count){\n count = value;\n }\n }\n return (part.length() - count);\n }\n\n public static int calc(String substr, String part) {\n int similar = 0;\n for(int i = 0; i < substr.length(); i++) {\n char ch1 = substr.charAt(i);\n char ch2 = part.charAt(i);\n if(ch1 == ch2) {\n similar++;\n }\n }\n return similar;\n }\n}",
"public class Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String complete = sc.nextLine();\n String part = sc.nextLine();\n System.out.println(solve(complete, part));\n }\n\n public static int solve(String complete, String part) {\n if (part.length() > complete.length()) {\n return -1;\n }\n int count = 0;\n for(int i = 0; i < (complete.length() - part.length())+ 1; i++) {\n String substr = complete.substring(i, i + part.length());\n int value = calc(substr, part);\n if(value > count){\n count = value;\n }\n }\n return (part.length() - count);\n }\n\n public static int calc(String substr, String part) {\n int similar = 0;\n for(int i = 0; i < substr.length(); i++) {\n char ch1 = substr.charAt(i);\n char ch2 = part.charAt(i);\n if(ch1 == ch2) {\n similar++;\n }\n }\n return similar;\n }\n}",
"Main"
]
| import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String complete = sc.nextLine();
String part = sc.nextLine();
System.out.println(solve(complete, part));
}
public static int solve(String complete, String part) {
if (part.length() > complete.length()) {
return -1;
}
int count = 0;
for(int i = 0; i < (complete.length() - part.length())+ 1; i++) {
String substr = complete.substring(i, i + part.length());
int value = calc(substr, part);
if(value > count){
count = value;
}
}
return (part.length() - count);
}
public static int calc(String substr, String part) {
int similar = 0;
for(int i = 0; i < substr.length(); i++) {
char ch1 = substr.charAt(i);
char ch2 = part.charAt(i);
if(ch1 == ch2) {
similar++;
}
}
return similar;
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
95,
5
],
[
95,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
25,
26
],
[
8,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
29,
31
],
[
27,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
35,
36
],
[
36,
37
],
[
34,
38
],
[
38,
39
],
[
39,
40
],
[
27,
41
],
[
41,
42
],
[
42,
43
],
[
27,
44
],
[
45,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
45,
49
],
[
49,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
49,
54
],
[
54,
55
],
[
54,
56
],
[
56,
57
],
[
57,
58
],
[
49,
59
],
[
59,
60
],
[
60,
61
],
[
49,
62
],
[
63,
63
],
[
63,
64
],
[
64,
65
],
[
65,
66
],
[
66,
67
],
[
67,
68
],
[
66,
69
],
[
69,
70
],
[
69,
71
],
[
65,
72
],
[
72,
73
],
[
73,
74
],
[
72,
75
],
[
64,
76
],
[
76,
77
],
[
77,
78
],
[
45,
79
],
[
79,
80
],
[
79,
81
],
[
81,
82
],
[
82,
83
],
[
81,
84
],
[
81,
85
],
[
8,
86
],
[
86,
87
],
[
87,
88
],
[
88,
89
],
[
88,
90
],
[
86,
91
],
[
6,
92
],
[
92,
93
],
[
0,
94
],
[
94,
95
],
[
94,
96
]
]
| [
"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tString s = scan.next();\n\t\tString t = scan.next();\n\n\t\tint ans = t.length();\n\n\t\tfor (int i = 0; i <= s.length()-t.length(); i++) {\n\t\t\tint diff=0;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif(s.charAt(i+j) != t.charAt(j) ) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans,diff);\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\n\t}\n\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tString s = scan.next();\n\t\tString t = scan.next();\n\n\t\tint ans = t.length();\n\n\t\tfor (int i = 0; i <= s.length()-t.length(); i++) {\n\t\t\tint diff=0;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif(s.charAt(i+j) != t.charAt(j) ) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans,diff);\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\n\t}\n\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tString s = scan.next();\n\t\tString t = scan.next();\n\n\t\tint ans = t.length();\n\n\t\tfor (int i = 0; i <= s.length()-t.length(); i++) {\n\t\t\tint diff=0;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif(s.charAt(i+j) != t.charAt(j) ) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans,diff);\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\n\t}",
"main",
"{\n\t\tScanner scan = new Scanner(System.in);\n\t\tString s = scan.next();\n\t\tString t = scan.next();\n\n\t\tint ans = t.length();\n\n\t\tfor (int i = 0; i <= s.length()-t.length(); i++) {\n\t\t\tint diff=0;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif(s.charAt(i+j) != t.charAt(j) ) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans,diff);\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\n\t}",
"Scanner scan = new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"String s = scan.next();",
"s",
"scan.next()",
"scan.next",
"scan",
"String t = scan.next();",
"t",
"scan.next()",
"scan.next",
"scan",
"int ans = t.length();",
"ans",
"t.length()",
"t.length",
"t",
"for (int i = 0; i <= s.length()-t.length(); i++) {\n\t\t\tint diff=0;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif(s.charAt(i+j) != t.charAt(j) ) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans,diff);\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= s.length()-t.length()",
"i",
"s.length()-t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"i++",
"i++",
"i",
"{\n\t\t\tint diff=0;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif(s.charAt(i+j) != t.charAt(j) ) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans,diff);\n\t\t}",
"{\n\t\t\tint diff=0;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif(s.charAt(i+j) != t.charAt(j) ) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans,diff);\n\t\t}",
"int diff=0;",
"diff",
"0",
"for (int j = 0; j < t.length(); j++) {\n\t\t\t\tif(s.charAt(i+j) != t.charAt(j) ) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n\t\t\t\tif(s.charAt(i+j) != t.charAt(j) ) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif(s.charAt(i+j) != t.charAt(j) ) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}",
"if(s.charAt(i+j) != t.charAt(j) ) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}",
"s.charAt(i+j) != t.charAt(j)",
"s.charAt(i+j)",
"s.charAt",
"s",
"i+j",
"i",
"j",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"{\n\t\t\t\t\tdiff++;\n\t\t\t\t}",
"diff++",
"diff",
"ans = Math.min(ans,diff)",
"ans",
"Math.min(ans,diff)",
"Math.min",
"Math",
"ans",
"diff",
"System.out.println(ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"ans",
"String[] args",
"args",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tString s = scan.next();\n\t\tString t = scan.next();\n\n\t\tint ans = t.length();\n\n\t\tfor (int i = 0; i <= s.length()-t.length(); i++) {\n\t\t\tint diff=0;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif(s.charAt(i+j) != t.charAt(j) ) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans,diff);\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\n\t}\n\n}",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tString s = scan.next();\n\t\tString t = scan.next();\n\n\t\tint ans = t.length();\n\n\t\tfor (int i = 0; i <= s.length()-t.length(); i++) {\n\t\t\tint diff=0;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif(s.charAt(i+j) != t.charAt(j) ) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans,diff);\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\n\t}\n\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String s = scan.next();
String t = scan.next();
int ans = t.length();
for (int i = 0; i <= s.length()-t.length(); i++) {
int diff=0;
for (int j = 0; j < t.length(); j++) {
if(s.charAt(i+j) != t.charAt(j) ) {
diff++;
}
}
ans = Math.min(ans,diff);
}
System.out.println(ans);
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
2,
2,
4,
18,
13,
4,
18,
13,
17,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
2,
4,
18,
13,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
30,
40,
13,
14,
2,
13,
13,
30,
0,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
110,
5
],
[
110,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
23,
24
],
[
8,
25
],
[
25,
26
],
[
25,
27
],
[
27,
28
],
[
28,
29
],
[
8,
30
],
[
30,
31
],
[
31,
32
],
[
32,
33
],
[
32,
34
],
[
30,
35
],
[
35,
36
],
[
35,
37
],
[
37,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
38,
42
],
[
42,
43
],
[
43,
44
],
[
37,
45
],
[
30,
46
],
[
46,
47
],
[
47,
48
],
[
30,
49
],
[
50,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
53,
54
],
[
54,
55
],
[
53,
56
],
[
53,
57
],
[
57,
58
],
[
58,
59
],
[
59,
60
],
[
57,
61
],
[
50,
62
],
[
62,
63
],
[
62,
64
],
[
50,
65
],
[
65,
66
],
[
66,
67
],
[
67,
68
],
[
67,
69
],
[
65,
70
],
[
70,
71
],
[
70,
72
],
[
72,
73
],
[
73,
74
],
[
65,
75
],
[
75,
76
],
[
76,
77
],
[
65,
78
],
[
79,
79
],
[
79,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
83,
84
],
[
82,
85
],
[
81,
86
],
[
86,
87
],
[
87,
88
],
[
86,
89
],
[
80,
90
],
[
90,
91
],
[
91,
92
],
[
50,
93
],
[
93,
94
],
[
94,
95
],
[
94,
96
],
[
93,
97
],
[
97,
98
],
[
98,
99
],
[
98,
100
],
[
8,
101
],
[
101,
102
],
[
102,
103
],
[
103,
104
],
[
103,
105
],
[
101,
106
],
[
6,
107
],
[
107,
108
],
[
0,
109
],
[
109,
110
],
[
109,
111
]
]
| [
"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\n\t\tsc.close();\n\n\t\tint result = T.length();\n\n\t\tfor (int i = 0; i < S.length() - T.length() + 1; i++) {\n\t\t\tString SS = S.substring(i, T.length() + i);\n\t\t\tint temp = 0;\n\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (SS.charAt(j) != T.charAt(j)) {\n\t\t\t\t\ttemp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (temp < result) {\n\t\t\t\tresult = temp;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.print(result);\n\t}\n\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\n\t\tsc.close();\n\n\t\tint result = T.length();\n\n\t\tfor (int i = 0; i < S.length() - T.length() + 1; i++) {\n\t\t\tString SS = S.substring(i, T.length() + i);\n\t\t\tint temp = 0;\n\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (SS.charAt(j) != T.charAt(j)) {\n\t\t\t\t\ttemp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (temp < result) {\n\t\t\t\tresult = temp;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.print(result);\n\t}\n\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\n\t\tsc.close();\n\n\t\tint result = T.length();\n\n\t\tfor (int i = 0; i < S.length() - T.length() + 1; i++) {\n\t\t\tString SS = S.substring(i, T.length() + i);\n\t\t\tint temp = 0;\n\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (SS.charAt(j) != T.charAt(j)) {\n\t\t\t\t\ttemp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (temp < result) {\n\t\t\t\tresult = temp;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.print(result);\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\n\t\tsc.close();\n\n\t\tint result = T.length();\n\n\t\tfor (int i = 0; i < S.length() - T.length() + 1; i++) {\n\t\t\tString SS = S.substring(i, T.length() + i);\n\t\t\tint temp = 0;\n\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (SS.charAt(j) != T.charAt(j)) {\n\t\t\t\t\ttemp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (temp < result) {\n\t\t\t\tresult = temp;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.print(result);\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String S = sc.next();",
"S",
"sc.next()",
"sc.next",
"sc",
"String T = sc.next();",
"T",
"sc.next()",
"sc.next",
"sc",
"sc.close()",
"sc.close",
"sc",
"int result = T.length();",
"result",
"T.length()",
"T.length",
"T",
"for (int i = 0; i < S.length() - T.length() + 1; i++) {\n\t\t\tString SS = S.substring(i, T.length() + i);\n\t\t\tint temp = 0;\n\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (SS.charAt(j) != T.charAt(j)) {\n\t\t\t\t\ttemp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (temp < result) {\n\t\t\t\tresult = temp;\n\t\t\t}\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < S.length() - T.length() + 1",
"i",
"S.length() - T.length() + 1",
"S.length() - T.length()",
"S.length()",
"S.length",
"S",
"T.length()",
"T.length",
"T",
"1",
"i++",
"i++",
"i",
"{\n\t\t\tString SS = S.substring(i, T.length() + i);\n\t\t\tint temp = 0;\n\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (SS.charAt(j) != T.charAt(j)) {\n\t\t\t\t\ttemp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (temp < result) {\n\t\t\t\tresult = temp;\n\t\t\t}\n\t\t}",
"{\n\t\t\tString SS = S.substring(i, T.length() + i);\n\t\t\tint temp = 0;\n\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (SS.charAt(j) != T.charAt(j)) {\n\t\t\t\t\ttemp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (temp < result) {\n\t\t\t\tresult = temp;\n\t\t\t}\n\t\t}",
"String SS = S.substring(i, T.length() + i);",
"SS",
"S.substring(i, T.length() + i)",
"S.substring",
"S",
"i",
"T.length() + i",
"T.length()",
"T.length",
"T",
"i",
"int temp = 0;",
"temp",
"0",
"for (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (SS.charAt(j) != T.charAt(j)) {\n\t\t\t\t\ttemp++;\n\t\t\t\t}\n\t\t\t}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < T.length()",
"j",
"T.length()",
"T.length",
"T",
"j++",
"j++",
"j",
"{\n\t\t\t\tif (SS.charAt(j) != T.charAt(j)) {\n\t\t\t\t\ttemp++;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif (SS.charAt(j) != T.charAt(j)) {\n\t\t\t\t\ttemp++;\n\t\t\t\t}\n\t\t\t}",
"if (SS.charAt(j) != T.charAt(j)) {\n\t\t\t\t\ttemp++;\n\t\t\t\t}",
"SS.charAt(j) != T.charAt(j)",
"SS.charAt(j)",
"SS.charAt",
"SS",
"j",
"T.charAt(j)",
"T.charAt",
"T",
"j",
"{\n\t\t\t\t\ttemp++;\n\t\t\t\t}",
"temp++",
"temp",
"if (temp < result) {\n\t\t\t\tresult = temp;\n\t\t\t}",
"temp < result",
"temp",
"result",
"{\n\t\t\t\tresult = temp;\n\t\t\t}",
"result = temp",
"result",
"temp",
"System.out.print(result)",
"System.out.print",
"System.out",
"System",
"System.out",
"result",
"String[] args",
"args",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\n\t\tsc.close();\n\n\t\tint result = T.length();\n\n\t\tfor (int i = 0; i < S.length() - T.length() + 1; i++) {\n\t\t\tString SS = S.substring(i, T.length() + i);\n\t\t\tint temp = 0;\n\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (SS.charAt(j) != T.charAt(j)) {\n\t\t\t\t\ttemp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (temp < result) {\n\t\t\t\tresult = temp;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.print(result);\n\t}\n\n}",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\n\t\tsc.close();\n\n\t\tint result = T.length();\n\n\t\tfor (int i = 0; i < S.length() - T.length() + 1; i++) {\n\t\t\tString SS = S.substring(i, T.length() + i);\n\t\t\tint temp = 0;\n\t\t\tfor (int j = 0; j < T.length(); j++) {\n\t\t\t\tif (SS.charAt(j) != T.charAt(j)) {\n\t\t\t\t\ttemp++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (temp < result) {\n\t\t\t\tresult = temp;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.print(result);\n\t}\n\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String S = sc.next();
String T = sc.next();
sc.close();
int result = T.length();
for (int i = 0; i < S.length() - T.length() + 1; i++) {
String SS = S.substring(i, T.length() + i);
int temp = 0;
for (int j = 0; j < T.length(); j++) {
if (SS.charAt(j) != T.charAt(j)) {
temp++;
}
}
if (temp < result) {
result = temp;
}
}
System.out.print(result);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
2,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
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
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
25,
26
],
[
8,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
29,
31
],
[
27,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
35,
36
],
[
36,
37
],
[
34,
38
],
[
38,
39
],
[
39,
40
],
[
27,
41
],
[
41,
42
],
[
42,
43
],
[
27,
44
],
[
45,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
48,
49
],
[
49,
50
],
[
48,
51
],
[
48,
52
],
[
52,
53
],
[
52,
54
],
[
54,
55
],
[
55,
56
],
[
45,
57
],
[
57,
58
],
[
57,
59
],
[
45,
60
],
[
60,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
60,
65
],
[
65,
66
],
[
65,
67
],
[
67,
68
],
[
68,
69
],
[
60,
70
],
[
70,
71
],
[
71,
72
],
[
60,
73
],
[
74,
74
],
[
74,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
78,
79
],
[
77,
80
],
[
76,
81
],
[
81,
82
],
[
82,
83
],
[
81,
84
],
[
75,
85
],
[
85,
86
],
[
86,
87
],
[
45,
88
],
[
88,
89
],
[
88,
90
],
[
90,
91
],
[
91,
92
],
[
90,
93
],
[
90,
94
],
[
8,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
97,
99
],
[
95,
100
],
[
6,
101
],
[
101,
102
],
[
0,
103
],
[
103,
104
],
[
103,
105
]
]
| [
"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String s = sc.next();\n String t = sc.next();\n\n int min = t.length();\n for (int i = 0; i <= s.length() - t.length(); i++) {\n String ss = s.substring(i, i + t.length());\n\n int count = 0;\n for (int j = 0; j < t.length(); j++) {\n if (ss.charAt(j) != t.charAt(j)) {\n count++;\n }\n }\n min = Math.min(count, min);\n }\n System.out.println(min);\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String s = sc.next();\n String t = sc.next();\n\n int min = t.length();\n for (int i = 0; i <= s.length() - t.length(); i++) {\n String ss = s.substring(i, i + t.length());\n\n int count = 0;\n for (int j = 0; j < t.length(); j++) {\n if (ss.charAt(j) != t.charAt(j)) {\n count++;\n }\n }\n min = Math.min(count, min);\n }\n System.out.println(min);\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String s = sc.next();\n String t = sc.next();\n\n int min = t.length();\n for (int i = 0; i <= s.length() - t.length(); i++) {\n String ss = s.substring(i, i + t.length());\n\n int count = 0;\n for (int j = 0; j < t.length(); j++) {\n if (ss.charAt(j) != t.charAt(j)) {\n count++;\n }\n }\n min = Math.min(count, min);\n }\n System.out.println(min);\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n String s = sc.next();\n String t = sc.next();\n\n int min = t.length();\n for (int i = 0; i <= s.length() - t.length(); i++) {\n String ss = s.substring(i, i + t.length());\n\n int count = 0;\n for (int j = 0; j < t.length(); j++) {\n if (ss.charAt(j) != t.charAt(j)) {\n count++;\n }\n }\n min = Math.min(count, min);\n }\n System.out.println(min);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String s = sc.next();",
"s",
"sc.next()",
"sc.next",
"sc",
"String t = sc.next();",
"t",
"sc.next()",
"sc.next",
"sc",
"int min = t.length();",
"min",
"t.length()",
"t.length",
"t",
"for (int i = 0; i <= s.length() - t.length(); i++) {\n String ss = s.substring(i, i + t.length());\n\n int count = 0;\n for (int j = 0; j < t.length(); j++) {\n if (ss.charAt(j) != t.charAt(j)) {\n count++;\n }\n }\n min = Math.min(count, min);\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= s.length() - t.length()",
"i",
"s.length() - t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"i++",
"i++",
"i",
"{\n String ss = s.substring(i, i + t.length());\n\n int count = 0;\n for (int j = 0; j < t.length(); j++) {\n if (ss.charAt(j) != t.charAt(j)) {\n count++;\n }\n }\n min = Math.min(count, min);\n }",
"{\n String ss = s.substring(i, i + t.length());\n\n int count = 0;\n for (int j = 0; j < t.length(); j++) {\n if (ss.charAt(j) != t.charAt(j)) {\n count++;\n }\n }\n min = Math.min(count, min);\n }",
"String ss = s.substring(i, i + t.length());",
"ss",
"s.substring(i, i + t.length())",
"s.substring",
"s",
"i",
"i + t.length()",
"i",
"t.length()",
"t.length",
"t",
"int count = 0;",
"count",
"0",
"for (int j = 0; j < t.length(); j++) {\n if (ss.charAt(j) != t.charAt(j)) {\n count++;\n }\n }",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n if (ss.charAt(j) != t.charAt(j)) {\n count++;\n }\n }",
"{\n if (ss.charAt(j) != t.charAt(j)) {\n count++;\n }\n }",
"if (ss.charAt(j) != t.charAt(j)) {\n count++;\n }",
"ss.charAt(j) != t.charAt(j)",
"ss.charAt(j)",
"ss.charAt",
"ss",
"j",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"{\n count++;\n }",
"count++",
"count",
"min = Math.min(count, min)",
"min",
"Math.min(count, min)",
"Math.min",
"Math",
"count",
"min",
"System.out.println(min)",
"System.out.println",
"System.out",
"System",
"System.out",
"min",
"String[] args",
"args",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String s = sc.next();\n String t = sc.next();\n\n int min = t.length();\n for (int i = 0; i <= s.length() - t.length(); i++) {\n String ss = s.substring(i, i + t.length());\n\n int count = 0;\n for (int j = 0; j < t.length(); j++) {\n if (ss.charAt(j) != t.charAt(j)) {\n count++;\n }\n }\n min = Math.min(count, min);\n }\n System.out.println(min);\n }\n}",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String s = sc.next();\n String t = sc.next();\n\n int min = t.length();\n for (int i = 0; i <= s.length() - t.length(); i++) {\n String ss = s.substring(i, i + t.length());\n\n int count = 0;\n for (int j = 0; j < t.length(); j++) {\n if (ss.charAt(j) != t.charAt(j)) {\n count++;\n }\n }\n min = Math.min(count, min);\n }\n System.out.println(min);\n }\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
String t = sc.next();
int min = t.length();
for (int i = 0; i <= s.length() - t.length(); i++) {
String ss = s.substring(i, i + t.length());
int count = 0;
for (int j = 0; j < t.length(); j++) {
if (ss.charAt(j) != t.charAt(j)) {
count++;
}
}
min = Math.min(count, min);
}
System.out.println(min);
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
2,
4,
18,
13,
4,
18,
13,
17,
1,
40,
13,
30,
30,
0,
13,
4,
18,
13,
13,
2,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
30,
40,
13,
14,
2,
13,
13,
30,
0,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
16,
17
],
[
16,
18
],
[
0,
19
],
[
19,
20
],
[
19,
21
],
[
0,
22
],
[
22,
23
],
[
22,
24
],
[
0,
25
],
[
25,
26
],
[
25,
27
],
[
0,
28
],
[
131,
29
],
[
131,
30
],
[
30,
31
],
[
30,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
32,
36
],
[
36,
37
],
[
36,
38
],
[
38,
39
],
[
39,
40
],
[
32,
41
],
[
41,
42
],
[
41,
43
],
[
43,
44
],
[
44,
45
],
[
32,
46
],
[
46,
47
],
[
32,
48
],
[
48,
49
],
[
48,
50
],
[
32,
51
],
[
51,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
51,
56
],
[
56,
57
],
[
56,
58
],
[
58,
59
],
[
59,
60
],
[
60,
61
],
[
61,
62
],
[
59,
63
],
[
63,
64
],
[
64,
65
],
[
58,
66
],
[
51,
67
],
[
67,
68
],
[
68,
69
],
[
51,
70
],
[
71,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
74,
75
],
[
75,
76
],
[
74,
77
],
[
74,
78
],
[
78,
79
],
[
78,
80
],
[
80,
81
],
[
81,
82
],
[
71,
83
],
[
83,
84
],
[
83,
85
],
[
71,
86
],
[
86,
87
],
[
87,
88
],
[
88,
89
],
[
88,
90
],
[
86,
91
],
[
91,
92
],
[
91,
93
],
[
93,
94
],
[
94,
95
],
[
86,
96
],
[
96,
97
],
[
97,
98
],
[
86,
99
],
[
100,
100
],
[
100,
101
],
[
101,
102
],
[
102,
103
],
[
103,
104
],
[
104,
105
],
[
103,
106
],
[
102,
107
],
[
107,
108
],
[
108,
109
],
[
107,
110
],
[
101,
111
],
[
111,
112
],
[
112,
113
],
[
71,
114
],
[
114,
115
],
[
115,
116
],
[
115,
117
],
[
114,
118
],
[
118,
119
],
[
119,
120
],
[
119,
121
],
[
32,
122
],
[
122,
123
],
[
123,
124
],
[
124,
125
],
[
124,
126
],
[
122,
127
],
[
30,
128
],
[
128,
129
],
[
0,
130
],
[
130,
131
],
[
130,
132
]
]
| [
"import java.util.Map.Entry;\nimport java.lang.reflect.Method;\nimport java.util.*;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.ArrayDeque;\nimport java.util.Arrays;\nimport java.util.Deque;\nimport java.util.ArrayList;\n\n//import org.w3c.dom.css.Counter;\n\n\npublic class Main {\n\tpublic static void main(String[] args)throws Exception{\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n String T = sc.next();\n String hoge;\n int ans =999999;\n\t\tfor(int i=0;i<S.length()-T.length()+1;i++){\n\t\t\thoge=S.substring(i,i+T.length());\n\t\t\tint tmp=0;\n\t\t\tfor(int i2=0;i2<T.length();i2++){\n\t\t\t\tif(T.charAt(i2)!=hoge.charAt(i2)){\n tmp++;\n }\n\t\t\t}\n\t\t\tif(ans>tmp){ans=tmp;}\n\t\t}\n System.out.println(ans);\n }\n\n}",
"import java.util.Map.Entry;",
"Entry",
"java.util.Map",
"import java.lang.reflect.Method;",
"Method",
"java.lang.reflect",
"import java.util.*;",
"util.*",
"java",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.util.ArrayDeque;",
"ArrayDeque",
"java.util",
"import java.util.Arrays;",
"Arrays",
"java.util",
"import java.util.Deque;",
"Deque",
"java.util",
"import java.util.ArrayList;",
"ArrayList",
"java.util",
"public class Main {\n\tpublic static void main(String[] args)throws Exception{\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n String T = sc.next();\n String hoge;\n int ans =999999;\n\t\tfor(int i=0;i<S.length()-T.length()+1;i++){\n\t\t\thoge=S.substring(i,i+T.length());\n\t\t\tint tmp=0;\n\t\t\tfor(int i2=0;i2<T.length();i2++){\n\t\t\t\tif(T.charAt(i2)!=hoge.charAt(i2)){\n tmp++;\n }\n\t\t\t}\n\t\t\tif(ans>tmp){ans=tmp;}\n\t\t}\n System.out.println(ans);\n }\n\n}",
"Main",
"public static void main(String[] args)throws Exception{\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n String T = sc.next();\n String hoge;\n int ans =999999;\n\t\tfor(int i=0;i<S.length()-T.length()+1;i++){\n\t\t\thoge=S.substring(i,i+T.length());\n\t\t\tint tmp=0;\n\t\t\tfor(int i2=0;i2<T.length();i2++){\n\t\t\t\tif(T.charAt(i2)!=hoge.charAt(i2)){\n tmp++;\n }\n\t\t\t}\n\t\t\tif(ans>tmp){ans=tmp;}\n\t\t}\n System.out.println(ans);\n }",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n String T = sc.next();\n String hoge;\n int ans =999999;\n\t\tfor(int i=0;i<S.length()-T.length()+1;i++){\n\t\t\thoge=S.substring(i,i+T.length());\n\t\t\tint tmp=0;\n\t\t\tfor(int i2=0;i2<T.length();i2++){\n\t\t\t\tif(T.charAt(i2)!=hoge.charAt(i2)){\n tmp++;\n }\n\t\t\t}\n\t\t\tif(ans>tmp){ans=tmp;}\n\t\t}\n System.out.println(ans);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String S = sc.next();",
"S",
"sc.next()",
"sc.next",
"sc",
"String T = sc.next();",
"T",
"sc.next()",
"sc.next",
"sc",
"String hoge;",
"hoge",
"int ans =999999;",
"ans",
"999999",
"for(int i=0;i<S.length()-T.length()+1;i++){\n\t\t\thoge=S.substring(i,i+T.length());\n\t\t\tint tmp=0;\n\t\t\tfor(int i2=0;i2<T.length();i2++){\n\t\t\t\tif(T.charAt(i2)!=hoge.charAt(i2)){\n tmp++;\n }\n\t\t\t}\n\t\t\tif(ans>tmp){ans=tmp;}\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<S.length()-T.length()+1",
"i",
"S.length()-T.length()+1",
"S.length()-T.length()",
"S.length()",
"S.length",
"S",
"T.length()",
"T.length",
"T",
"1",
"i++",
"i++",
"i",
"{\n\t\t\thoge=S.substring(i,i+T.length());\n\t\t\tint tmp=0;\n\t\t\tfor(int i2=0;i2<T.length();i2++){\n\t\t\t\tif(T.charAt(i2)!=hoge.charAt(i2)){\n tmp++;\n }\n\t\t\t}\n\t\t\tif(ans>tmp){ans=tmp;}\n\t\t}",
"{\n\t\t\thoge=S.substring(i,i+T.length());\n\t\t\tint tmp=0;\n\t\t\tfor(int i2=0;i2<T.length();i2++){\n\t\t\t\tif(T.charAt(i2)!=hoge.charAt(i2)){\n tmp++;\n }\n\t\t\t}\n\t\t\tif(ans>tmp){ans=tmp;}\n\t\t}",
"hoge=S.substring(i,i+T.length())",
"hoge",
"S.substring(i,i+T.length())",
"S.substring",
"S",
"i",
"i+T.length()",
"i",
"T.length()",
"T.length",
"T",
"int tmp=0;",
"tmp",
"0",
"for(int i2=0;i2<T.length();i2++){\n\t\t\t\tif(T.charAt(i2)!=hoge.charAt(i2)){\n tmp++;\n }\n\t\t\t}",
"int i2=0;",
"int i2=0;",
"i2",
"0",
"i2<T.length()",
"i2",
"T.length()",
"T.length",
"T",
"i2++",
"i2++",
"i2",
"{\n\t\t\t\tif(T.charAt(i2)!=hoge.charAt(i2)){\n tmp++;\n }\n\t\t\t}",
"{\n\t\t\t\tif(T.charAt(i2)!=hoge.charAt(i2)){\n tmp++;\n }\n\t\t\t}",
"if(T.charAt(i2)!=hoge.charAt(i2)){\n tmp++;\n }",
"T.charAt(i2)!=hoge.charAt(i2)",
"T.charAt(i2)",
"T.charAt",
"T",
"i2",
"hoge.charAt(i2)",
"hoge.charAt",
"hoge",
"i2",
"{\n tmp++;\n }",
"tmp++",
"tmp",
"if(ans>tmp){ans=tmp;}",
"ans>tmp",
"ans",
"tmp",
"{ans=tmp;}",
"ans=tmp",
"ans",
"tmp",
"System.out.println(ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"ans",
"String[] args",
"args",
"public class Main {\n\tpublic static void main(String[] args)throws Exception{\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n String T = sc.next();\n String hoge;\n int ans =999999;\n\t\tfor(int i=0;i<S.length()-T.length()+1;i++){\n\t\t\thoge=S.substring(i,i+T.length());\n\t\t\tint tmp=0;\n\t\t\tfor(int i2=0;i2<T.length();i2++){\n\t\t\t\tif(T.charAt(i2)!=hoge.charAt(i2)){\n tmp++;\n }\n\t\t\t}\n\t\t\tif(ans>tmp){ans=tmp;}\n\t\t}\n System.out.println(ans);\n }\n\n}",
"public class Main {\n\tpublic static void main(String[] args)throws Exception{\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n String T = sc.next();\n String hoge;\n int ans =999999;\n\t\tfor(int i=0;i<S.length()-T.length()+1;i++){\n\t\t\thoge=S.substring(i,i+T.length());\n\t\t\tint tmp=0;\n\t\t\tfor(int i2=0;i2<T.length();i2++){\n\t\t\t\tif(T.charAt(i2)!=hoge.charAt(i2)){\n tmp++;\n }\n\t\t\t}\n\t\t\tif(ans>tmp){ans=tmp;}\n\t\t}\n System.out.println(ans);\n }\n\n}",
"Main"
]
| import java.util.Map.Entry;
import java.lang.reflect.Method;
import java.util.*;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.ArrayList;
//import org.w3c.dom.css.Counter;
public class Main {
public static void main(String[] args)throws Exception{
Scanner sc = new Scanner(System.in);
String S = sc.next();
String T = sc.next();
String hoge;
int ans =999999;
for(int i=0;i<S.length()-T.length()+1;i++){
hoge=S.substring(i,i+T.length());
int tmp=0;
for(int i2=0;i2<T.length();i2++){
if(T.charAt(i2)!=hoge.charAt(i2)){
tmp++;
}
}
if(ans>tmp){ans=tmp;}
}
System.out.println(ans);
}
} |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
13,
1,
40,
13,
30,
30,
41,
13,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
40,
13,
14,
2,
13,
13,
0,
13,
13,
0,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
11,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
11,
20
],
[
20,
21
],
[
20,
22
],
[
22,
23
],
[
23,
24
],
[
11,
25
],
[
25,
26
],
[
25,
27
],
[
27,
28
],
[
28,
29
],
[
11,
30
],
[
30,
31
],
[
30,
32
],
[
32,
33
],
[
32,
34
],
[
11,
35
],
[
35,
36
],
[
36,
37
],
[
37,
38
],
[
37,
39
],
[
35,
40
],
[
40,
41
],
[
40,
42
],
[
42,
43
],
[
43,
44
],
[
44,
45
],
[
42,
46
],
[
35,
47
],
[
47,
48
],
[
48,
49
],
[
35,
50
],
[
51,
51
],
[
51,
52
],
[
52,
53
],
[
52,
54
],
[
51,
55
],
[
55,
56
],
[
55,
57
],
[
51,
58
],
[
58,
59
],
[
59,
60
],
[
60,
61
],
[
60,
62
],
[
58,
63
],
[
63,
64
],
[
63,
65
],
[
65,
66
],
[
66,
67
],
[
58,
68
],
[
68,
69
],
[
69,
70
],
[
68,
71
],
[
71,
72
],
[
58,
73
],
[
74,
74
],
[
74,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
78,
79
],
[
77,
80
],
[
76,
81
],
[
81,
82
],
[
82,
83
],
[
81,
84
],
[
75,
85
],
[
85,
86
],
[
51,
87
],
[
87,
88
],
[
88,
89
],
[
88,
90
],
[
87,
91
],
[
91,
92
],
[
91,
93
],
[
51,
94
],
[
94,
95
],
[
94,
96
],
[
11,
97
],
[
97,
98
],
[
98,
99
],
[
99,
100
],
[
99,
101
],
[
97,
102
],
[
9,
103
],
[
103,
104
]
]
| [
"import java.io.*;\nimport java.util.*;\n\nclass Main {\n \tpublic static void main(String args[]) throws IOException {\n \tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n \tString S = br.readLine();\n \tString T = br.readLine();\n \tint size = T.length();\n \tint ans = Integer.MAX_VALUE;\n \tfor(int i=0;i<=S.length()-size;i++) {\n \tint tmp = i;\n \tint count = 0;\n \tfor(int j=0;j<T.length();j++,i++) {\n \t if(S.charAt(i) != T.charAt(j))\n count++;\n }\n if(count < ans)\n \tans = count;\n \ti = tmp;\n }\n System.out.println(ans);\n }\n}",
"import java.io.*;",
"io.*",
"java",
"import java.util.*;",
"util.*",
"java",
"class Main {\n \tpublic static void main(String args[]) throws IOException {\n \tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n \tString S = br.readLine();\n \tString T = br.readLine();\n \tint size = T.length();\n \tint ans = Integer.MAX_VALUE;\n \tfor(int i=0;i<=S.length()-size;i++) {\n \tint tmp = i;\n \tint count = 0;\n \tfor(int j=0;j<T.length();j++,i++) {\n \t if(S.charAt(i) != T.charAt(j))\n count++;\n }\n if(count < ans)\n \tans = count;\n \ti = tmp;\n }\n System.out.println(ans);\n }\n}",
"Main",
"public static void main(String args[]) throws IOException {\n \tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n \tString S = br.readLine();\n \tString T = br.readLine();\n \tint size = T.length();\n \tint ans = Integer.MAX_VALUE;\n \tfor(int i=0;i<=S.length()-size;i++) {\n \tint tmp = i;\n \tint count = 0;\n \tfor(int j=0;j<T.length();j++,i++) {\n \t if(S.charAt(i) != T.charAt(j))\n count++;\n }\n if(count < ans)\n \tans = count;\n \ti = tmp;\n }\n System.out.println(ans);\n }",
"main",
"{\n \tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n \tString S = br.readLine();\n \tString T = br.readLine();\n \tint size = T.length();\n \tint ans = Integer.MAX_VALUE;\n \tfor(int i=0;i<=S.length()-size;i++) {\n \tint tmp = i;\n \tint count = 0;\n \tfor(int j=0;j<T.length();j++,i++) {\n \t if(S.charAt(i) != T.charAt(j))\n count++;\n }\n if(count < ans)\n \tans = count;\n \ti = tmp;\n }\n System.out.println(ans);\n }",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"String S = br.readLine();",
"S",
"br.readLine()",
"br.readLine",
"br",
"String T = br.readLine();",
"T",
"br.readLine()",
"br.readLine",
"br",
"int size = T.length();",
"size",
"T.length()",
"T.length",
"T",
"int ans = Integer.MAX_VALUE;",
"ans",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"for(int i=0;i<=S.length()-size;i++) {\n \tint tmp = i;\n \tint count = 0;\n \tfor(int j=0;j<T.length();j++,i++) {\n \t if(S.charAt(i) != T.charAt(j))\n count++;\n }\n if(count < ans)\n \tans = count;\n \ti = tmp;\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<=S.length()-size",
"i",
"S.length()-size",
"S.length()",
"S.length",
"S",
"size",
"i++",
"i++",
"i",
"{\n \tint tmp = i;\n \tint count = 0;\n \tfor(int j=0;j<T.length();j++,i++) {\n \t if(S.charAt(i) != T.charAt(j))\n count++;\n }\n if(count < ans)\n \tans = count;\n \ti = tmp;\n }",
"{\n \tint tmp = i;\n \tint count = 0;\n \tfor(int j=0;j<T.length();j++,i++) {\n \t if(S.charAt(i) != T.charAt(j))\n count++;\n }\n if(count < ans)\n \tans = count;\n \ti = tmp;\n }",
"int tmp = i;",
"tmp",
"i",
"int count = 0;",
"count",
"0",
"for(int j=0;j<T.length();j++,i++) {\n \t if(S.charAt(i) != T.charAt(j))\n count++;\n }",
"int j=0;",
"int j=0;",
"j",
"0",
"j<T.length()",
"j",
"T.length()",
"T.length",
"T",
"j++,i++",
"j++",
"j",
"i++",
"i",
"{\n \t if(S.charAt(i) != T.charAt(j))\n count++;\n }",
"{\n \t if(S.charAt(i) != T.charAt(j))\n count++;\n }",
"if(S.charAt(i) != T.charAt(j))\n count++;",
"S.charAt(i) != T.charAt(j)",
"S.charAt(i)",
"S.charAt",
"S",
"i",
"T.charAt(j)",
"T.charAt",
"T",
"j",
"count++",
"count",
"if(count < ans)\n \tans = count;",
"count < ans",
"count",
"ans",
"ans = count",
"ans",
"count",
"i = tmp",
"i",
"tmp",
"System.out.println(ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"ans",
"String args[]",
"args"
]
| import java.io.*;
import java.util.*;
class Main {
public static void main(String args[]) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String S = br.readLine();
String T = br.readLine();
int size = T.length();
int ans = Integer.MAX_VALUE;
for(int i=0;i<=S.length()-size;i++) {
int tmp = i;
int count = 0;
for(int j=0;j<T.length();j++,i++) {
if(S.charAt(i) != T.charAt(j))
count++;
}
if(count < ans)
ans = count;
i = tmp;
}
System.out.println(ans);
}
} |
[
7,
6,
12,
13,
30,
14,
2,
18,
13,
13,
18,
13,
13,
29,
17,
29,
40,
17,
23,
13,
23,
13,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
17,
41,
13,
17,
41,
13,
41,
13,
41,
13,
12,
13,
30,
14,
2,
13,
17,
29,
13,
29,
4,
13,
2,
13,
13,
13,
23,
13,
23,
13,
12,
13,
30,
29,
2,
2,
13,
13,
4,
13,
13,
13,
23,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
20,
23,
13,
23,
13,
12,
13,
30,
41,
13,
18,
13,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
2,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
4,
18,
13,
18,
13,
13,
2,
13,
18,
13,
13,
0,
13,
4,
18,
13,
13,
13,
29,
13,
23,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
20,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
18,
13,
13,
41,
13,
18,
13,
13,
0,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
13,
23,
13,
12,
13,
30,
41,
13,
18,
13,
13,
41,
13,
18,
13,
13,
41,
13,
20,
41,
13,
20,
41,
13,
41,
13,
41,
13,
0,
13,
17,
42,
2,
40,
13,
17,
30,
41,
13,
41,
13,
0,
13,
4,
18,
13,
0,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
20,
41,
13,
20,
41,
13,
17,
41,
13,
17,
41,
13,
17,
11,
1,
0,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
17,
0,
13,
17,
14,
2,
4,
18,
13,
2,
13,
17,
30,
4,
18,
13,
18,
13,
13,
0,
13,
17,
0,
13,
17,
42,
40,
4,
18,
13,
30,
41,
13,
4,
18,
13,
14,
2,
18,
13,
13,
13,
30,
40,
13,
14,
2,
13,
13,
30,
0,
13,
13,
40,
13,
4,
18,
13,
13,
14,
4,
18,
13,
30,
3,
0,
13,
13,
0,
13,
20,
4,
18,
13,
30,
4,
18,
13,
18,
13,
13,
4,
18,
13,
2,
13,
13,
4,
18,
13,
23,
13,
6,
13,
41,
13,
41,
13,
20,
17,
41,
13,
41,
13,
41,
13,
41,
13,
20,
12,
13,
30,
0,
18,
36,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
40,
17,
37,
20,
14,
2,
13,
13,
30,
0,
13,
17,
38,
5,
13,
30,
37,
20,
30,
0,
13,
4,
18,
13,
13,
14,
2,
13,
17,
29,
40,
17,
29,
18,
13,
40,
13,
12,
13,
30,
41,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
29,
13,
12,
13,
30,
41,
13,
4,
13,
42,
4,
13,
13,
0,
13,
4,
13,
41,
13,
17,
14,
2,
13,
17,
30,
0,
13,
40,
17,
0,
13,
4,
13,
41,
13,
17,
42,
40,
4,
13,
13,
30,
14,
2,
2,
13,
17,
2,
13,
17,
37,
20,
0,
13,
17,
0,
13,
2,
13,
17,
0,
13,
4,
13,
29,
2,
13,
13,
12,
13,
30,
41,
13,
4,
13,
42,
4,
13,
13,
0,
13,
4,
13,
41,
13,
17,
14,
2,
13,
17,
30,
0,
13,
40,
17,
0,
13,
4,
13,
41,
13,
17,
42,
40,
4,
13,
13,
30,
14,
2,
2,
13,
17,
2,
13,
17,
37,
20,
0,
13,
17,
0,
13,
2,
13,
17,
0,
13,
4,
13,
29,
2,
13,
13,
12,
13,
30,
41,
13,
4,
13,
42,
4,
13,
13,
0,
13,
4,
13,
41,
13,
17,
14,
2,
13,
17,
30,
0,
13,
40,
17,
0,
13,
4,
13,
41,
13,
17,
42,
2,
40,
4,
13,
13,
2,
13,
17,
30,
14,
2,
2,
13,
17,
2,
13,
17,
29,
2,
13,
4,
18,
13,
17,
4,
13,
14,
2,
2,
13,
17,
2,
13,
17,
37,
20,
0,
13,
17,
0,
13,
2,
13,
17,
0,
13,
4,
13,
14,
2,
13,
17,
30,
0,
13,
4,
13,
41,
13,
17,
42,
40,
4,
13,
13,
30,
14,
2,
2,
13,
17,
2,
13,
17,
29,
2,
13,
4,
18,
13,
17,
4,
13,
14,
2,
2,
13,
17,
2,
13,
17,
37,
20,
0,
13,
17,
0,
13,
2,
2,
13,
17,
13,
0,
13,
4,
13,
29,
2,
13,
13,
12,
13,
30,
41,
13,
4,
13,
42,
4,
13,
13,
0,
13,
4,
13,
41,
13,
20,
42,
40,
4,
13,
13,
30,
4,
18,
13,
13,
0,
13,
4,
13,
29,
4,
18,
13,
12,
13,
30,
14,
2,
13,
17,
29,
4,
18,
13,
13,
29,
2,
2,
2,
2,
2,
13,
17,
2,
13,
17,
2,
13,
17,
2,
13,
17,
2,
13,
40,
17,
23,
13,
12,
13,
30,
29,
4,
13,
6,
13,
12,
13,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
18,
36,
13,
13,
0,
18,
36,
13,
13,
23,
13,
23,
13,
12,
13,
30,
29,
2,
8,
2,
13,
17,
17,
2,
4,
18,
13,
17,
8,
2,
13,
17,
17,
4,
18,
13,
12,
13,
30,
14,
2,
36,
13,
29,
17,
14,
2,
2,
13,
17,
2,
4,
13,
4,
18,
13,
29,
17,
41,
13,
13,
29,
2,
8,
2,
13,
17,
2,
18,
13,
13,
17,
4,
18,
13,
18,
13,
13,
8,
2,
13,
17,
2,
18,
13,
13,
17,
4,
18,
13,
18,
13,
13,
23,
13,
12,
13,
30,
41,
13,
4,
18,
13,
18,
13,
13,
29,
8,
2,
13,
17,
13,
4,
18,
13,
18,
13,
13,
23,
13,
12,
13,
30,
29,
4,
18,
13,
17,
4,
18,
13,
4,
18,
13,
13,
6,
13,
41,
13,
17,
41,
13,
12,
13,
30,
0,
13,
20,
12,
13,
30,
4,
18,
13,
13,
2,
4,
18,
13,
13,
17,
17,
40,
13,
23,
13,
12,
13,
30,
14,
2,
4,
18,
13,
13,
17,
4,
18,
13,
13,
4,
18,
13,
13,
2,
4,
18,
13,
13,
17,
40,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
2,
3
],
[
2,
4
],
[
4,
5
],
[
5,
6
],
[
6,
7
],
[
7,
8
],
[
7,
9
],
[
6,
10
],
[
10,
11
],
[
10,
12
],
[
5,
13
],
[
13,
14
],
[
5,
15
],
[
15,
16
],
[
16,
17
],
[
2,
18
],
[
18,
19
],
[
2,
20
],
[
20,
21
],
[
0,
22
],
[
22,
23
],
[
22,
24
],
[
0,
25
],
[
25,
26
],
[
25,
27
],
[
0,
28
],
[
28,
29
],
[
28,
30
],
[
0,
31
],
[
31,
32
],
[
31,
33
],
[
0,
34
],
[
34,
35
],
[
34,
36
],
[
0,
37
],
[
37,
38
],
[
37,
39
],
[
0,
40
],
[
40,
41
],
[
40,
42
],
[
0,
43
],
[
43,
44
],
[
43,
45
],
[
0,
46
],
[
1059,
47
],
[
1059,
48
],
[
48,
49
],
[
48,
50
],
[
1059,
51
],
[
51,
52
],
[
51,
53
],
[
1059,
54
],
[
54,
55
],
[
1059,
56
],
[
56,
57
],
[
1059,
58
],
[
58,
59
],
[
1059,
60
],
[
60,
61
],
[
60,
62
],
[
62,
63
],
[
63,
64
],
[
64,
65
],
[
64,
66
],
[
63,
67
],
[
67,
68
],
[
62,
69
],
[
69,
70
],
[
70,
71
],
[
70,
72
],
[
72,
73
],
[
72,
74
],
[
70,
75
],
[
60,
76
],
[
76,
77
],
[
60,
78
],
[
78,
79
],
[
1059,
80
],
[
80,
81
],
[
80,
82
],
[
82,
83
],
[
83,
84
],
[
84,
85
],
[
85,
86
],
[
85,
87
],
[
84,
88
],
[
88,
89
],
[
88,
90
],
[
88,
91
],
[
80,
92
],
[
92,
93
],
[
80,
94
],
[
94,
95
],
[
1059,
96
],
[
96,
97
],
[
96,
98
],
[
98,
99
],
[
99,
100
],
[
100,
101
],
[
99,
102
],
[
99,
103
],
[
96,
104
],
[
104,
105
],
[
96,
106
],
[
106,
107
],
[
1059,
108
],
[
108,
109
],
[
108,
110
],
[
110,
111
],
[
111,
112
],
[
111,
113
],
[
113,
114
],
[
113,
115
],
[
110,
116
],
[
116,
117
],
[
116,
118
],
[
118,
119
],
[
118,
120
],
[
110,
121
],
[
121,
122
],
[
122,
123
],
[
123,
124
],
[
123,
125
],
[
125,
126
],
[
125,
127
],
[
121,
128
],
[
128,
129
],
[
128,
130
],
[
121,
131
],
[
131,
132
],
[
132,
133
],
[
121,
134
],
[
135,
135
],
[
135,
136
],
[
136,
137
],
[
136,
138
],
[
138,
139
],
[
139,
140
],
[
138,
141
],
[
141,
142
],
[
141,
143
],
[
138,
144
],
[
144,
145
],
[
144,
146
],
[
146,
147
],
[
146,
148
],
[
135,
149
],
[
149,
150
],
[
149,
151
],
[
151,
152
],
[
152,
153
],
[
151,
154
],
[
151,
155
],
[
110,
156
],
[
156,
157
],
[
108,
158
],
[
158,
159
],
[
108,
160
],
[
160,
161
],
[
108,
162
],
[
162,
163
],
[
1059,
164
],
[
164,
165
],
[
164,
166
],
[
166,
167
],
[
167,
168
],
[
167,
169
],
[
166,
170
],
[
170,
171
],
[
171,
172
],
[
172,
173
],
[
172,
174
],
[
170,
175
],
[
175,
176
],
[
175,
177
],
[
177,
178
],
[
177,
179
],
[
170,
180
],
[
180,
181
],
[
181,
182
],
[
170,
183
],
[
184,
184
],
[
184,
185
],
[
185,
186
],
[
185,
187
],
[
187,
188
],
[
188,
189
],
[
187,
190
],
[
190,
191
],
[
190,
192
],
[
184,
193
],
[
193,
194
],
[
193,
195
],
[
195,
196
],
[
195,
197
],
[
184,
198
],
[
198,
199
],
[
199,
200
],
[
199,
201
],
[
198,
202
],
[
202,
203
],
[
202,
204
],
[
184,
205
],
[
205,
206
],
[
206,
207
],
[
206,
208
],
[
205,
209
],
[
164,
210
],
[
210,
211
],
[
1059,
212
],
[
212,
213
],
[
212,
214
],
[
214,
215
],
[
215,
216
],
[
215,
217
],
[
217,
218
],
[
217,
219
],
[
214,
220
],
[
220,
221
],
[
220,
222
],
[
222,
223
],
[
222,
224
],
[
214,
225
],
[
225,
226
],
[
225,
227
],
[
214,
228
],
[
228,
229
],
[
228,
230
],
[
214,
231
],
[
231,
232
],
[
214,
233
],
[
233,
234
],
[
214,
235
],
[
235,
236
],
[
214,
237
],
[
237,
238
],
[
237,
239
],
[
214,
240
],
[
240,
241
],
[
241,
242
],
[
242,
243
],
[
241,
244
],
[
240,
245
],
[
245,
246
],
[
246,
247
],
[
245,
248
],
[
248,
249
],
[
245,
250
],
[
250,
251
],
[
250,
252
],
[
252,
253
],
[
253,
254
],
[
245,
255
],
[
255,
256
],
[
255,
257
],
[
257,
258
],
[
258,
259
],
[
245,
260
],
[
260,
261
],
[
260,
262
],
[
262,
263
],
[
263,
264
],
[
245,
265
],
[
265,
266
],
[
265,
267
],
[
267,
268
],
[
268,
269
],
[
245,
270
],
[
270,
271
],
[
270,
272
],
[
272,
273
],
[
273,
274
],
[
245,
275
],
[
275,
276
],
[
275,
277
],
[
277,
278
],
[
278,
279
],
[
245,
280
],
[
280,
281
],
[
280,
282
],
[
245,
283
],
[
283,
284
],
[
283,
285
],
[
245,
286
],
[
286,
287
],
[
286,
288
],
[
245,
289
],
[
289,
290
],
[
289,
291
],
[
245,
292
],
[
292,
293
],
[
292,
294
],
[
245,
295
],
[
295,
296
],
[
296,
297
],
[
297,
298
],
[
297,
299
],
[
295,
300
],
[
300,
301
],
[
300,
302
],
[
295,
303
],
[
303,
304
],
[
304,
305
],
[
295,
306
],
[
307,
307
],
[
307,
308
],
[
308,
309
],
[
308,
310
],
[
307,
311
],
[
311,
312
],
[
311,
313
],
[
307,
314
],
[
314,
315
],
[
315,
316
],
[
316,
317
],
[
317,
318
],
[
315,
319
],
[
319,
320
],
[
319,
321
],
[
314,
322
],
[
322,
323
],
[
323,
324
],
[
324,
325
],
[
323,
326
],
[
326,
327
],
[
326,
328
],
[
322,
329
],
[
329,
330
],
[
329,
331
],
[
322,
332
],
[
332,
333
],
[
332,
334
],
[
322,
335
],
[
335,
336
],
[
336,
337
],
[
337,
338
],
[
338,
339
],
[
335,
340
],
[
340,
341
],
[
341,
342
],
[
341,
343
],
[
343,
344
],
[
344,
345
],
[
340,
346
],
[
346,
347
],
[
347,
348
],
[
348,
349
],
[
348,
350
],
[
347,
351
],
[
346,
352
],
[
352,
353
],
[
353,
354
],
[
352,
355
],
[
355,
356
],
[
356,
357
],
[
356,
358
],
[
355,
359
],
[
359,
360
],
[
360,
361
],
[
360,
362
],
[
340,
363
],
[
363,
364
],
[
340,
365
],
[
365,
366
],
[
366,
367
],
[
365,
368
],
[
340,
369
],
[
369,
370
],
[
370,
371
],
[
371,
372
],
[
369,
373
],
[
373,
374
],
[
322,
375
],
[
375,
376
],
[
375,
377
],
[
322,
378
],
[
378,
379
],
[
378,
380
],
[
322,
381
],
[
381,
382
],
[
382,
383
],
[
314,
384
],
[
384,
385
],
[
385,
386
],
[
386,
387
],
[
385,
388
],
[
388,
389
],
[
388,
390
],
[
245,
391
],
[
391,
392
],
[
392,
393
],
[
391,
394
],
[
394,
395
],
[
394,
396
],
[
214,
397
],
[
397,
398
],
[
398,
399
],
[
212,
400
],
[
400,
401
],
[
1059,
402
],
[
402,
403
],
[
402,
404
],
[
404,
405
],
[
402,
406
],
[
406,
407
],
[
406,
408
],
[
402,
410
],
[
410,
411
],
[
402,
412
],
[
412,
413
],
[
402,
414
],
[
414,
415
],
[
402,
416
],
[
416,
417
],
[
416,
418
],
[
402,
419
],
[
419,
420
],
[
419,
421
],
[
421,
422
],
[
422,
423
],
[
423,
424
],
[
423,
425
],
[
422,
426
],
[
419,
427
],
[
427,
428
],
[
402,
429
],
[
429,
430
],
[
429,
431
],
[
431,
432
],
[
432,
433
],
[
433,
434
],
[
433,
435
],
[
435,
436
],
[
432,
437
],
[
437,
438
],
[
431,
439
],
[
439,
440
],
[
440,
441
],
[
440,
442
],
[
439,
443
],
[
443,
444
],
[
444,
445
],
[
444,
446
],
[
443,
447
],
[
447,
448
],
[
448,
449
],
[
448,
450
],
[
450,
451
],
[
451,
452
],
[
447,
453
],
[
453,
454
],
[
454,
455
],
[
454,
456
],
[
456,
457
],
[
457,
458
],
[
456,
459
],
[
443,
460
],
[
460,
461
],
[
461,
462
],
[
461,
463
],
[
460,
464
],
[
464,
465
],
[
465,
466
],
[
431,
467
],
[
467,
468
],
[
468,
469
],
[
468,
470
],
[
470,
471
],
[
402,
472
],
[
472,
473
],
[
472,
474
],
[
474,
475
],
[
475,
476
],
[
475,
477
],
[
474,
478
],
[
478,
479
],
[
479,
480
],
[
479,
481
],
[
481,
482
],
[
482,
483
],
[
483,
484
],
[
478,
485
],
[
485,
486
],
[
486,
487
],
[
486,
488
],
[
488,
489
],
[
489,
490
],
[
474,
491
],
[
491,
492
],
[
402,
493
],
[
493,
494
],
[
493,
495
],
[
495,
496
],
[
496,
497
],
[
496,
498
],
[
498,
499
],
[
495,
500
],
[
500,
501
],
[
501,
502
],
[
501,
503
],
[
500,
504
],
[
504,
505
],
[
504,
506
],
[
506,
507
],
[
495,
508
],
[
508,
509
],
[
508,
510
],
[
495,
511
],
[
511,
512
],
[
512,
513
],
[
512,
514
],
[
511,
515
],
[
515,
516
],
[
516,
517
],
[
516,
518
],
[
518,
519
],
[
515,
520
],
[
520,
521
],
[
520,
522
],
[
522,
523
],
[
495,
524
],
[
524,
525
],
[
524,
526
],
[
495,
527
],
[
527,
528
],
[
528,
529
],
[
529,
530
],
[
529,
531
],
[
527,
532
],
[
532,
533
],
[
533,
534
],
[
534,
535
],
[
535,
536
],
[
535,
537
],
[
534,
538
],
[
538,
539
],
[
538,
540
],
[
533,
541
],
[
541,
542
],
[
532,
543
],
[
543,
544
],
[
543,
545
],
[
532,
546
],
[
546,
547
],
[
546,
548
],
[
548,
549
],
[
548,
550
],
[
532,
551
],
[
551,
552
],
[
551,
553
],
[
553,
554
],
[
495,
555
],
[
555,
556
],
[
556,
557
],
[
556,
558
],
[
402,
559
],
[
559,
560
],
[
559,
561
],
[
561,
562
],
[
562,
563
],
[
562,
564
],
[
564,
565
],
[
561,
566
],
[
566,
567
],
[
567,
568
],
[
567,
569
],
[
566,
570
],
[
570,
571
],
[
570,
572
],
[
572,
573
],
[
561,
574
],
[
574,
575
],
[
574,
576
],
[
561,
577
],
[
577,
578
],
[
578,
579
],
[
578,
580
],
[
577,
581
],
[
581,
582
],
[
582,
583
],
[
582,
584
],
[
584,
585
],
[
581,
586
],
[
586,
587
],
[
586,
588
],
[
588,
589
],
[
561,
590
],
[
590,
591
],
[
590,
592
],
[
561,
593
],
[
593,
594
],
[
594,
595
],
[
595,
596
],
[
595,
597
],
[
593,
598
],
[
598,
599
],
[
599,
600
],
[
600,
601
],
[
601,
602
],
[
601,
603
],
[
600,
604
],
[
604,
605
],
[
604,
606
],
[
599,
607
],
[
607,
608
],
[
598,
609
],
[
609,
610
],
[
609,
611
],
[
598,
612
],
[
612,
613
],
[
612,
614
],
[
614,
615
],
[
614,
616
],
[
598,
617
],
[
617,
618
],
[
617,
619
],
[
619,
620
],
[
561,
621
],
[
621,
622
],
[
622,
623
],
[
622,
624
],
[
402,
625
],
[
625,
626
],
[
625,
627
],
[
627,
628
],
[
628,
629
],
[
628,
630
],
[
630,
631
],
[
627,
632
],
[
632,
633
],
[
633,
634
],
[
633,
635
],
[
632,
636
],
[
636,
637
],
[
636,
638
],
[
638,
639
],
[
627,
640
],
[
640,
641
],
[
640,
642
],
[
627,
643
],
[
643,
644
],
[
644,
645
],
[
644,
646
],
[
643,
647
],
[
647,
648
],
[
648,
649
],
[
648,
650
],
[
650,
651
],
[
647,
652
],
[
652,
653
],
[
652,
654
],
[
654,
655
],
[
627,
656
],
[
656,
657
],
[
656,
658
],
[
627,
659
],
[
659,
660
],
[
660,
661
],
[
661,
662
],
[
662,
663
],
[
662,
664
],
[
660,
665
],
[
665,
666
],
[
665,
667
],
[
659,
668
],
[
668,
669
],
[
669,
670
],
[
670,
671
],
[
671,
672
],
[
671,
673
],
[
670,
674
],
[
674,
675
],
[
674,
676
],
[
669,
677
],
[
677,
678
],
[
678,
679
],
[
678,
680
],
[
680,
681
],
[
681,
682
],
[
680,
683
],
[
680,
684
],
[
684,
685
],
[
668,
686
],
[
686,
687
],
[
687,
688
],
[
688,
689
],
[
688,
690
],
[
687,
691
],
[
691,
692
],
[
691,
693
],
[
686,
694
],
[
694,
695
],
[
668,
696
],
[
696,
697
],
[
696,
698
],
[
668,
699
],
[
699,
700
],
[
699,
701
],
[
701,
702
],
[
701,
703
],
[
668,
704
],
[
704,
705
],
[
704,
706
],
[
706,
707
],
[
627,
708
],
[
708,
709
],
[
709,
710
],
[
709,
711
],
[
708,
712
],
[
712,
713
],
[
713,
714
],
[
713,
715
],
[
715,
716
],
[
712,
717
],
[
717,
718
],
[
717,
719
],
[
712,
720
],
[
720,
721
],
[
721,
722
],
[
722,
723
],
[
722,
724
],
[
720,
725
],
[
725,
726
],
[
726,
727
],
[
727,
728
],
[
728,
729
],
[
728,
730
],
[
727,
731
],
[
731,
732
],
[
731,
733
],
[
726,
734
],
[
734,
735
],
[
735,
736
],
[
735,
737
],
[
737,
738
],
[
738,
739
],
[
737,
740
],
[
737,
741
],
[
741,
742
],
[
725,
743
],
[
743,
744
],
[
744,
745
],
[
745,
746
],
[
745,
747
],
[
744,
748
],
[
748,
749
],
[
748,
750
],
[
743,
751
],
[
751,
752
],
[
725,
753
],
[
753,
754
],
[
753,
755
],
[
725,
756
],
[
756,
757
],
[
756,
758
],
[
758,
759
],
[
759,
760
],
[
759,
761
],
[
758,
762
],
[
725,
763
],
[
763,
764
],
[
763,
765
],
[
765,
766
],
[
627,
767
],
[
767,
768
],
[
768,
769
],
[
768,
770
],
[
402,
771
],
[
771,
772
],
[
771,
773
],
[
773,
774
],
[
774,
775
],
[
774,
776
],
[
776,
777
],
[
773,
778
],
[
778,
779
],
[
779,
780
],
[
779,
781
],
[
778,
782
],
[
782,
783
],
[
782,
784
],
[
784,
785
],
[
773,
786
],
[
786,
787
],
[
786,
788
],
[
773,
789
],
[
789,
790
],
[
790,
791
],
[
791,
792
],
[
791,
793
],
[
789,
794
],
[
794,
795
],
[
795,
796
],
[
796,
797
],
[
795,
798
],
[
794,
799
],
[
799,
800
],
[
799,
801
],
[
801,
802
],
[
773,
803
],
[
803,
804
],
[
804,
805
],
[
805,
806
],
[
402,
807
],
[
807,
808
],
[
807,
809
],
[
809,
810
],
[
810,
811
],
[
811,
812
],
[
811,
813
],
[
810,
814
],
[
814,
815
],
[
815,
816
],
[
816,
817
],
[
815,
818
],
[
809,
819
],
[
819,
820
],
[
823,
821
],
[
833,
822
],
[
830,
823
],
[
823,
824
],
[
824,
825
],
[
824,
826
],
[
823,
827
],
[
827,
828
],
[
827,
829
],
[
830,
830
],
[
830,
831
],
[
830,
832
],
[
833,
833
],
[
833,
834
],
[
833,
835
],
[
823,
836
],
[
836,
837
],
[
836,
838
],
[
838,
839
],
[
807,
840
],
[
840,
841
],
[
402,
842
],
[
842,
843
],
[
842,
844
],
[
844,
845
],
[
845,
846
],
[
846,
847
],
[
402,
848
],
[
848,
849
],
[
848,
850
],
[
850,
851
],
[
850,
852
],
[
852,
853
],
[
1059,
854
],
[
854,
855
],
[
854,
856
],
[
856,
857
],
[
854,
858
],
[
858,
859
],
[
854,
860
],
[
860,
861
],
[
860,
862
],
[
862,
863
],
[
863,
864
],
[
864,
865
],
[
864,
866
],
[
863,
867
],
[
862,
868
],
[
868,
869
],
[
869,
870
],
[
869,
871
],
[
868,
872
],
[
860,
873
],
[
873,
874
],
[
860,
875
],
[
875,
876
],
[
854,
877
],
[
877,
878
],
[
877,
879
],
[
879,
880
],
[
880,
881
],
[
881,
882
],
[
882,
883
],
[
883,
884
],
[
883,
885
],
[
882,
886
],
[
882,
887
],
[
887,
888
],
[
888,
889
],
[
889,
890
],
[
887,
891
],
[
881,
892
],
[
892,
893
],
[
893,
894
],
[
893,
895
],
[
892,
896
],
[
892,
897
],
[
897,
898
],
[
898,
899
],
[
854,
900
],
[
900,
901
],
[
900,
902
],
[
902,
903
],
[
903,
904
],
[
904,
905
],
[
904,
906
],
[
903,
907
],
[
907,
908
],
[
902,
909
],
[
909,
910
],
[
910,
911
],
[
911,
912
],
[
911,
913
],
[
910,
914
],
[
914,
915
],
[
915,
916
],
[
914,
917
],
[
917,
918
],
[
918,
919
],
[
909,
920
],
[
920,
921
],
[
902,
922
],
[
922,
923
],
[
922,
924
],
[
902,
925
],
[
925,
926
],
[
926,
927
],
[
927,
928
],
[
928,
929
],
[
928,
930
],
[
927,
931
],
[
931,
932
],
[
932,
933
],
[
932,
934
],
[
931,
935
],
[
927,
936
],
[
936,
937
],
[
937,
938
],
[
936,
939
],
[
939,
940
],
[
939,
941
],
[
926,
942
],
[
942,
943
],
[
943,
944
],
[
943,
945
],
[
942,
946
],
[
946,
947
],
[
947,
948
],
[
947,
949
],
[
946,
950
],
[
942,
951
],
[
951,
952
],
[
952,
953
],
[
951,
954
],
[
954,
955
],
[
954,
956
],
[
900,
957
],
[
957,
958
],
[
854,
959
],
[
959,
960
],
[
959,
961
],
[
961,
962
],
[
962,
963
],
[
962,
964
],
[
964,
965
],
[
965,
966
],
[
964,
967
],
[
967,
968
],
[
967,
969
],
[
961,
970
],
[
970,
971
],
[
971,
972
],
[
972,
973
],
[
972,
974
],
[
971,
975
],
[
971,
976
],
[
976,
977
],
[
977,
978
],
[
976,
979
],
[
979,
980
],
[
979,
981
],
[
959,
982
],
[
982,
983
],
[
854,
984
],
[
984,
985
],
[
984,
986
],
[
986,
987
],
[
987,
988
],
[
988,
989
],
[
989,
990
],
[
988,
991
],
[
988,
992
],
[
992,
993
],
[
993,
994
],
[
988,
995
],
[
995,
996
],
[
996,
997
],
[
854,
998
],
[
1059,
999
],
[
999,
1000
],
[
999,
1001
],
[
1001,
1002
],
[
1001,
1003
],
[
999,
1004
],
[
1004,
1005
],
[
999,
1006
],
[
1006,
1007
],
[
1006,
1008
],
[
1008,
1009
],
[
1009,
1010
],
[
1009,
1011
],
[
999,
1012
],
[
1012,
1013
],
[
1012,
1014
],
[
1014,
1015
],
[
1015,
1016
],
[
1016,
1017
],
[
1015,
1018
],
[
1015,
1019
],
[
1019,
1020
],
[
1020,
1021
],
[
1021,
1022
],
[
1020,
1023
],
[
1020,
1024
],
[
1019,
1025
],
[
1014,
1026
],
[
1026,
1027
],
[
1012,
1028
],
[
1028,
1029
],
[
999,
1030
],
[
1030,
1031
],
[
1030,
1032
],
[
1032,
1033
],
[
1033,
1034
],
[
1034,
1035
],
[
1035,
1036
],
[
1036,
1037
],
[
1035,
1038
],
[
1034,
1039
],
[
1033,
1040
],
[
1040,
1041
],
[
1041,
1042
],
[
1040,
1043
],
[
1033,
1044
],
[
1044,
1045
],
[
1045,
1046
],
[
1044,
1047
],
[
1044,
1048
],
[
1048,
1049
],
[
1049,
1050
],
[
1050,
1051
],
[
1049,
1052
],
[
1048,
1053
],
[
1032,
1054
],
[
1054,
1055
],
[
1030,
1056
],
[
1056,
1057
],
[
0,
1058
],
[
1058,
1059
],
[
1058,
1060
]
]
| [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.InputMismatchException;\nimport java.util.*;\nimport java.io.*;\nimport java.lang.*;\npublic class Main{\n public static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n \n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n \n public int read() {\n if (numChars==-1)\n throw new InputMismatchException();\n \n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n }\n catch (IOException e) {\n throw new InputMismatchException();\n }\n \n if(numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n \n public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n public int nextInt() {\n int c = read();\n \n while(isSpaceChar(c))\n c = read();\n \n int sgn = 1;\n \n if (c == '-') {\n sgn = -1;\n c = read();\n }\n \n int res = 0;\n do {\n if(c<'0'||c>'9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n \n return res * sgn;\n }\n \n public long nextLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n \n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n \n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n \n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n \n return res.toString();\n }\n \n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n \n public String next() {\n return readString();\n }\n \n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n \n static long gcd(long a, long b){\n if (a == 0)\n return b; \n return gcd(b % a, a); \n }\n static long lcm(long a, long b) {\n return (a*b)/gcd(a, b); \n }\n public static void sortbyColumn(int arr[][], int col) \n { \n \n Arrays.sort(arr, new Comparator<int[]>() { \n \n @Override \n \n public int compare(final int[] entry1, \n final int[] entry2) { \n \n \n if (entry1[col] > entry2[col]) \n return 1; \n else\n return -1; \n } \n }); \n } \n static long func(long a[],long size,int s){\n long max1=a[s];\n long maxc=a[s];\n for(int i=s+1;i<size;i++){\n maxc=Math.max(a[i],maxc+a[i]);\n max1=Math.max(maxc,max1);\n }\n return max1;\n }\n public static class Pair<U extends Comparable<U>, V extends Comparable<V>> implements Comparable<Pair<U, V>> {\n public U x;\n public V y;\n \n public Pair(U x, V y) {\n this.x = x;\n this.y = y;\n }\n \n public int hashCode() {\n return (x == null ? 0 : x.hashCode() * 31) + (y == null ? 0 : y.hashCode());\n }\n \n public boolean equals(Object o) {\n if (this == o)\n return true;\n if (o == null || getClass() != o.getClass())\n return false;\n Pair<U, V> p = (Pair<U, V>) o;\n return (x == null ? p.x == null : x.equals(p.x)) && (y == null ? p.y == null : y.equals(p.y));\n }\n \n public int compareTo(Pair<U, V> b) {\n int cmpU = x.compareTo(b.x);\n return cmpU != 0 ? cmpU : y.compareTo(b.y);\n }\n \n public String toString() {\n return String.format(\"(%s, %s)\", x.toString(), y.toString());\n }\n \n }\n static class MultiSet<U extends Comparable<U>> {\n public int sz = 0;\n public TreeMap<U, Integer> t;\n \n public MultiSet() {\n t = new TreeMap<>();\n }\n \n public void add(U x) {\n t.put(x, t.getOrDefault(x, 0) + 1);\n sz++;\n }\n \n public void remove(U x) {\n if (t.get(x) == 1) t.remove(x);\n else t.put(x, t.get(x) - 1);\n sz--;\n }\n \n }\n static void shuffle(long[] a) {\n Random get = new Random();\n for (int i = 0; i < a.length; i++) {\n int r = get.nextInt(a.length);\n long temp = a[i];\n a[i] = a[r];\n a[r] = temp;\n }\n }\n //static LinkedList<Integer> li;\n //static LinkedList<Integer> ans;\n static int ans1=0,ans2=0;\n static long dist[];\n static int visited[];\n static ArrayList<Integer> adj[];\n \n \n public static void main(String args[]){\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter w = new PrintWriter(outputStream);\n int t,i,j;\n \n t=1;\n while(t-->0){\n String s1,s2;\n s1=in.next();\n s2=in.next();\n char ch1[]=s1.toCharArray();\n char ch2[]=s2.toCharArray();\n int n=s1.length(),m=s2.length(); \n LinkedList<Character> li=new LinkedList<>();\n LinkedList<Character> li1=new LinkedList<>();\n int max=0,c=0,count=0;\n for(i=0;i<n;i++){\n c=0;\n count=0;\n //System.out.println(i+\" \"+li.size());\n if(li.size()==m-1){\n li.add(ch1[i]);\n count=0;\n //System.out.println(li);\n c=0;\n while(!li.isEmpty()){\n char temp=li.removeFirst();\n //System.out.println(\"LinkedList \"+li);\n // System.out.println(c);\n if(ch2[c]==temp){\n count++;\n if(count>max){\n max=count;\n }\n }\n c++;\n li1.add(temp);\n if(li.isEmpty()){\n break;\n }\n }\n //System.out.println(max);\n li=li1;\n li1=new LinkedList<>();\n li.removeFirst();\n //System.out.println(li);\n }else{\n li.add(ch1[i]);\n }\n }\n w.println(m-max);\n }\n w.close();\n }\n}",
"Comparator<int[]>() { \n \n @Override \n \n public int compare(final int[] entry1, \n final int[] entry2) { \n \n \n if (entry1[col] > entry2[col]) \n return 1; \n else\n return -1; \n } \n }",
"@Override \n \n public int compare(final int[] entry1, \n final int[] entry2) { \n \n \n if (entry1[col] > entry2[col]) \n return 1; \n else\n return -1; \n }",
"compare",
"{ \n \n \n if (entry1[col] > entry2[col]) \n return 1; \n else\n return -1; \n }",
"if (entry1[col] > entry2[col]) \n return 1; \n else\n return -1;",
"entry1[col] > entry2[col]",
"entry1[col]",
"entry1",
"col",
"entry2[col]",
"entry2",
"col",
"return 1;",
"1",
"return -1;",
"-1",
"1",
"final int[] entry1",
"entry1",
"final int[] entry2",
"entry2",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStream;",
"InputStream",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.util.InputMismatchException;",
"InputMismatchException",
"java.util",
"import java.util.*;",
"util.*",
"java",
"import java.io.*;",
"io.*",
"java",
"import java.lang.*;",
"lang.*",
"java",
"public class Main{\n public static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n \n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n \n public int read() {\n if (numChars==-1)\n throw new InputMismatchException();\n \n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n }\n catch (IOException e) {\n throw new InputMismatchException();\n }\n \n if(numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n \n public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n public int nextInt() {\n int c = read();\n \n while(isSpaceChar(c))\n c = read();\n \n int sgn = 1;\n \n if (c == '-') {\n sgn = -1;\n c = read();\n }\n \n int res = 0;\n do {\n if(c<'0'||c>'9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n \n return res * sgn;\n }\n \n public long nextLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n \n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n \n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n \n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n \n return res.toString();\n }\n \n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n \n public String next() {\n return readString();\n }\n \n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n \n static long gcd(long a, long b){\n if (a == 0)\n return b; \n return gcd(b % a, a); \n }\n static long lcm(long a, long b) {\n return (a*b)/gcd(a, b); \n }\n public static void sortbyColumn(int arr[][], int col) \n { \n \n Arrays.sort(arr, new Comparator<int[]>() { \n \n @Override \n \n public int compare(final int[] entry1, \n final int[] entry2) { \n \n \n if (entry1[col] > entry2[col]) \n return 1; \n else\n return -1; \n } \n }); \n } \n static long func(long a[],long size,int s){\n long max1=a[s];\n long maxc=a[s];\n for(int i=s+1;i<size;i++){\n maxc=Math.max(a[i],maxc+a[i]);\n max1=Math.max(maxc,max1);\n }\n return max1;\n }\n public static class Pair<U extends Comparable<U>, V extends Comparable<V>> implements Comparable<Pair<U, V>> {\n public U x;\n public V y;\n \n public Pair(U x, V y) {\n this.x = x;\n this.y = y;\n }\n \n public int hashCode() {\n return (x == null ? 0 : x.hashCode() * 31) + (y == null ? 0 : y.hashCode());\n }\n \n public boolean equals(Object o) {\n if (this == o)\n return true;\n if (o == null || getClass() != o.getClass())\n return false;\n Pair<U, V> p = (Pair<U, V>) o;\n return (x == null ? p.x == null : x.equals(p.x)) && (y == null ? p.y == null : y.equals(p.y));\n }\n \n public int compareTo(Pair<U, V> b) {\n int cmpU = x.compareTo(b.x);\n return cmpU != 0 ? cmpU : y.compareTo(b.y);\n }\n \n public String toString() {\n return String.format(\"(%s, %s)\", x.toString(), y.toString());\n }\n \n }\n static class MultiSet<U extends Comparable<U>> {\n public int sz = 0;\n public TreeMap<U, Integer> t;\n \n public MultiSet() {\n t = new TreeMap<>();\n }\n \n public void add(U x) {\n t.put(x, t.getOrDefault(x, 0) + 1);\n sz++;\n }\n \n public void remove(U x) {\n if (t.get(x) == 1) t.remove(x);\n else t.put(x, t.get(x) - 1);\n sz--;\n }\n \n }\n static void shuffle(long[] a) {\n Random get = new Random();\n for (int i = 0; i < a.length; i++) {\n int r = get.nextInt(a.length);\n long temp = a[i];\n a[i] = a[r];\n a[r] = temp;\n }\n }\n //static LinkedList<Integer> li;\n //static LinkedList<Integer> ans;\n static int ans1=0,ans2=0;\n static long dist[];\n static int visited[];\n static ArrayList<Integer> adj[];\n \n \n public static void main(String args[]){\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter w = new PrintWriter(outputStream);\n int t,i,j;\n \n t=1;\n while(t-->0){\n String s1,s2;\n s1=in.next();\n s2=in.next();\n char ch1[]=s1.toCharArray();\n char ch2[]=s2.toCharArray();\n int n=s1.length(),m=s2.length(); \n LinkedList<Character> li=new LinkedList<>();\n LinkedList<Character> li1=new LinkedList<>();\n int max=0,c=0,count=0;\n for(i=0;i<n;i++){\n c=0;\n count=0;\n //System.out.println(i+\" \"+li.size());\n if(li.size()==m-1){\n li.add(ch1[i]);\n count=0;\n //System.out.println(li);\n c=0;\n while(!li.isEmpty()){\n char temp=li.removeFirst();\n //System.out.println(\"LinkedList \"+li);\n // System.out.println(c);\n if(ch2[c]==temp){\n count++;\n if(count>max){\n max=count;\n }\n }\n c++;\n li1.add(temp);\n if(li.isEmpty()){\n break;\n }\n }\n //System.out.println(max);\n li=li1;\n li1=new LinkedList<>();\n li.removeFirst();\n //System.out.println(li);\n }else{\n li.add(ch1[i]);\n }\n }\n w.println(m-max);\n }\n w.close();\n }\n}",
"Main",
"//static LinkedList<Integer> li;\n //static LinkedList<Integer> ans;\n static int ans1=0",
"ans1",
"0",
"ans2=0;",
"ans2",
"0",
"static long dist[];",
"dist",
"static int visited[];",
"visited",
"static ArrayList<Integer> adj[];",
"adj",
"static long gcd(long a, long b){\n if (a == 0)\n return b; \n return gcd(b % a, a); \n }",
"gcd",
"{\n if (a == 0)\n return b; \n return gcd(b % a, a); \n }",
"if (a == 0)\n return b;",
"a == 0",
"a",
"0",
"return b;",
"b",
"return gcd(b % a, a);",
"gcd(b % a, a)",
"gcd",
"b % a",
"b",
"a",
"a",
"long a",
"a",
"long b",
"b",
"static long lcm(long a, long b) {\n return (a*b)/gcd(a, b); \n }",
"lcm",
"{\n return (a*b)/gcd(a, b); \n }",
"return (a*b)/gcd(a, b);",
"(a*b)/gcd(a, b)",
"(a*b)",
"a",
"b",
"gcd(a, b)",
"gcd",
"a",
"b",
"long a",
"a",
"long b",
"b",
"public static void sortbyColumn(int arr[][], int col) \n { \n \n Arrays.sort(arr, new Comparator<int[]>() { \n \n @Override \n \n public int compare(final int[] entry1, \n final int[] entry2) { \n \n \n if (entry1[col] > entry2[col]) \n return 1; \n else\n return -1; \n } \n }); \n }",
"sortbyColumn",
"{ \n \n Arrays.sort(arr, new Comparator<int[]>() { \n \n @Override \n \n public int compare(final int[] entry1, \n final int[] entry2) { \n \n \n if (entry1[col] > entry2[col]) \n return 1; \n else\n return -1; \n } \n }); \n }",
"Arrays.sort(arr, new Comparator<int[]>() { \n \n @Override \n \n public int compare(final int[] entry1, \n final int[] entry2) { \n \n \n if (entry1[col] > entry2[col]) \n return 1; \n else\n return -1; \n } \n })",
"Arrays.sort",
"Arrays",
"arr",
"new Comparator<int[]>() { \n \n @Override \n \n public int compare(final int[] entry1, \n final int[] entry2) { \n \n \n if (entry1[col] > entry2[col]) \n return 1; \n else\n return -1; \n } \n }",
"int arr[][]",
"arr",
"int col",
"col",
"static long func(long a[],long size,int s){\n long max1=a[s];\n long maxc=a[s];\n for(int i=s+1;i<size;i++){\n maxc=Math.max(a[i],maxc+a[i]);\n max1=Math.max(maxc,max1);\n }\n return max1;\n }",
"func",
"{\n long max1=a[s];\n long maxc=a[s];\n for(int i=s+1;i<size;i++){\n maxc=Math.max(a[i],maxc+a[i]);\n max1=Math.max(maxc,max1);\n }\n return max1;\n }",
"long max1=a[s];",
"max1",
"a[s]",
"a",
"s",
"long maxc=a[s];",
"maxc",
"a[s]",
"a",
"s",
"for(int i=s+1;i<size;i++){\n maxc=Math.max(a[i],maxc+a[i]);\n max1=Math.max(maxc,max1);\n }",
"int i=s+1;",
"int i=s+1;",
"i",
"s+1",
"s",
"1",
"i<size",
"i",
"size",
"i++",
"i++",
"i",
"{\n maxc=Math.max(a[i],maxc+a[i]);\n max1=Math.max(maxc,max1);\n }",
"{\n maxc=Math.max(a[i],maxc+a[i]);\n max1=Math.max(maxc,max1);\n }",
"maxc=Math.max(a[i],maxc+a[i])",
"maxc",
"Math.max(a[i],maxc+a[i])",
"Math.max",
"Math",
"a[i]",
"a",
"i",
"maxc+a[i]",
"maxc",
"a[i]",
"a",
"i",
"max1=Math.max(maxc,max1)",
"max1",
"Math.max(maxc,max1)",
"Math.max",
"Math",
"maxc",
"max1",
"return max1;",
"max1",
"long a[]",
"a",
"long size",
"size",
"int s",
"s",
"static void shuffle(long[] a) {\n Random get = new Random();\n for (int i = 0; i < a.length; i++) {\n int r = get.nextInt(a.length);\n long temp = a[i];\n a[i] = a[r];\n a[r] = temp;\n }\n }",
"shuffle",
"{\n Random get = new Random();\n for (int i = 0; i < a.length; i++) {\n int r = get.nextInt(a.length);\n long temp = a[i];\n a[i] = a[r];\n a[r] = temp;\n }\n }",
"Random get = new Random();",
"get",
"new Random()",
"for (int i = 0; i < a.length; i++) {\n int r = get.nextInt(a.length);\n long temp = a[i];\n a[i] = a[r];\n a[r] = temp;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < a.length",
"i",
"a.length",
"a",
"a.length",
"i++",
"i++",
"i",
"{\n int r = get.nextInt(a.length);\n long temp = a[i];\n a[i] = a[r];\n a[r] = temp;\n }",
"{\n int r = get.nextInt(a.length);\n long temp = a[i];\n a[i] = a[r];\n a[r] = temp;\n }",
"int r = get.nextInt(a.length);",
"r",
"get.nextInt(a.length)",
"get.nextInt",
"get",
"a.length",
"a",
"a.length",
"long temp = a[i];",
"temp",
"a[i]",
"a",
"i",
"a[i] = a[r]",
"a[i]",
"a",
"i",
"a[r]",
"a",
"r",
"a[r] = temp",
"a[r]",
"a",
"r",
"temp",
"long[] a",
"a",
"public static void main(String args[]){\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter w = new PrintWriter(outputStream);\n int t,i,j;\n \n t=1;\n while(t-->0){\n String s1,s2;\n s1=in.next();\n s2=in.next();\n char ch1[]=s1.toCharArray();\n char ch2[]=s2.toCharArray();\n int n=s1.length(),m=s2.length(); \n LinkedList<Character> li=new LinkedList<>();\n LinkedList<Character> li1=new LinkedList<>();\n int max=0,c=0,count=0;\n for(i=0;i<n;i++){\n c=0;\n count=0;\n //System.out.println(i+\" \"+li.size());\n if(li.size()==m-1){\n li.add(ch1[i]);\n count=0;\n //System.out.println(li);\n c=0;\n while(!li.isEmpty()){\n char temp=li.removeFirst();\n //System.out.println(\"LinkedList \"+li);\n // System.out.println(c);\n if(ch2[c]==temp){\n count++;\n if(count>max){\n max=count;\n }\n }\n c++;\n li1.add(temp);\n if(li.isEmpty()){\n break;\n }\n }\n //System.out.println(max);\n li=li1;\n li1=new LinkedList<>();\n li.removeFirst();\n //System.out.println(li);\n }else{\n li.add(ch1[i]);\n }\n }\n w.println(m-max);\n }\n w.close();\n }",
"main",
"{\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter w = new PrintWriter(outputStream);\n int t,i,j;\n \n t=1;\n while(t-->0){\n String s1,s2;\n s1=in.next();\n s2=in.next();\n char ch1[]=s1.toCharArray();\n char ch2[]=s2.toCharArray();\n int n=s1.length(),m=s2.length(); \n LinkedList<Character> li=new LinkedList<>();\n LinkedList<Character> li1=new LinkedList<>();\n int max=0,c=0,count=0;\n for(i=0;i<n;i++){\n c=0;\n count=0;\n //System.out.println(i+\" \"+li.size());\n if(li.size()==m-1){\n li.add(ch1[i]);\n count=0;\n //System.out.println(li);\n c=0;\n while(!li.isEmpty()){\n char temp=li.removeFirst();\n //System.out.println(\"LinkedList \"+li);\n // System.out.println(c);\n if(ch2[c]==temp){\n count++;\n if(count>max){\n max=count;\n }\n }\n c++;\n li1.add(temp);\n if(li.isEmpty()){\n break;\n }\n }\n //System.out.println(max);\n li=li1;\n li1=new LinkedList<>();\n li.removeFirst();\n //System.out.println(li);\n }else{\n li.add(ch1[i]);\n }\n }\n w.println(m-max);\n }\n w.close();\n }",
"InputStream inputStream = System.in;",
"inputStream",
"System.in",
"System",
"System.in",
"OutputStream outputStream = System.out;",
"outputStream",
"System.out",
"System",
"System.out",
"InputReader in = new InputReader(inputStream);",
"in",
"new InputReader(inputStream)",
"PrintWriter w = new PrintWriter(outputStream);",
"w",
"new PrintWriter(outputStream)",
"int t",
"t",
"i",
"i",
"j;",
"j",
"t=1",
"t",
"1",
"while(t-->0){\n String s1,s2;\n s1=in.next();\n s2=in.next();\n char ch1[]=s1.toCharArray();\n char ch2[]=s2.toCharArray();\n int n=s1.length(),m=s2.length(); \n LinkedList<Character> li=new LinkedList<>();\n LinkedList<Character> li1=new LinkedList<>();\n int max=0,c=0,count=0;\n for(i=0;i<n;i++){\n c=0;\n count=0;\n //System.out.println(i+\" \"+li.size());\n if(li.size()==m-1){\n li.add(ch1[i]);\n count=0;\n //System.out.println(li);\n c=0;\n while(!li.isEmpty()){\n char temp=li.removeFirst();\n //System.out.println(\"LinkedList \"+li);\n // System.out.println(c);\n if(ch2[c]==temp){\n count++;\n if(count>max){\n max=count;\n }\n }\n c++;\n li1.add(temp);\n if(li.isEmpty()){\n break;\n }\n }\n //System.out.println(max);\n li=li1;\n li1=new LinkedList<>();\n li.removeFirst();\n //System.out.println(li);\n }else{\n li.add(ch1[i]);\n }\n }\n w.println(m-max);\n }",
"t-->0",
"t--",
"t",
"0",
"{\n String s1,s2;\n s1=in.next();\n s2=in.next();\n char ch1[]=s1.toCharArray();\n char ch2[]=s2.toCharArray();\n int n=s1.length(),m=s2.length(); \n LinkedList<Character> li=new LinkedList<>();\n LinkedList<Character> li1=new LinkedList<>();\n int max=0,c=0,count=0;\n for(i=0;i<n;i++){\n c=0;\n count=0;\n //System.out.println(i+\" \"+li.size());\n if(li.size()==m-1){\n li.add(ch1[i]);\n count=0;\n //System.out.println(li);\n c=0;\n while(!li.isEmpty()){\n char temp=li.removeFirst();\n //System.out.println(\"LinkedList \"+li);\n // System.out.println(c);\n if(ch2[c]==temp){\n count++;\n if(count>max){\n max=count;\n }\n }\n c++;\n li1.add(temp);\n if(li.isEmpty()){\n break;\n }\n }\n //System.out.println(max);\n li=li1;\n li1=new LinkedList<>();\n li.removeFirst();\n //System.out.println(li);\n }else{\n li.add(ch1[i]);\n }\n }\n w.println(m-max);\n }",
"String s1",
"s1",
"s2;",
"s2",
"s1=in.next()",
"s1",
"in.next()",
"in.next",
"in",
"s2=in.next()",
"s2",
"in.next()",
"in.next",
"in",
"char ch1[]=s1.toCharArray();",
"ch1",
"s1.toCharArray()",
"s1.toCharArray",
"s1",
"char ch2[]=s2.toCharArray();",
"ch2",
"s2.toCharArray()",
"s2.toCharArray",
"s2",
"int n=s1.length()",
"n",
"s1.length()",
"s1.length",
"s1",
"m=s2.length();",
"m",
"s2.length()",
"s2.length",
"s2",
"LinkedList<Character> li=new LinkedList<>();",
"li",
"new LinkedList<>()",
"LinkedList<Character> li1=new LinkedList<>();",
"li1",
"new LinkedList<>()",
"int max=0",
"max",
"0",
"c=0",
"c",
"0",
"count=0;",
"count",
"0",
"for(i=0;i<n;i++){\n c=0;\n count=0;\n //System.out.println(i+\" \"+li.size());\n if(li.size()==m-1){\n li.add(ch1[i]);\n count=0;\n //System.out.println(li);\n c=0;\n while(!li.isEmpty()){\n char temp=li.removeFirst();\n //System.out.println(\"LinkedList \"+li);\n // System.out.println(c);\n if(ch2[c]==temp){\n count++;\n if(count>max){\n max=count;\n }\n }\n c++;\n li1.add(temp);\n if(li.isEmpty()){\n break;\n }\n }\n //System.out.println(max);\n li=li1;\n li1=new LinkedList<>();\n li.removeFirst();\n //System.out.println(li);\n }else{\n li.add(ch1[i]);\n }\n }",
"i=0;",
"i=0",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n c=0;\n count=0;\n //System.out.println(i+\" \"+li.size());\n if(li.size()==m-1){\n li.add(ch1[i]);\n count=0;\n //System.out.println(li);\n c=0;\n while(!li.isEmpty()){\n char temp=li.removeFirst();\n //System.out.println(\"LinkedList \"+li);\n // System.out.println(c);\n if(ch2[c]==temp){\n count++;\n if(count>max){\n max=count;\n }\n }\n c++;\n li1.add(temp);\n if(li.isEmpty()){\n break;\n }\n }\n //System.out.println(max);\n li=li1;\n li1=new LinkedList<>();\n li.removeFirst();\n //System.out.println(li);\n }else{\n li.add(ch1[i]);\n }\n }",
"{\n c=0;\n count=0;\n //System.out.println(i+\" \"+li.size());\n if(li.size()==m-1){\n li.add(ch1[i]);\n count=0;\n //System.out.println(li);\n c=0;\n while(!li.isEmpty()){\n char temp=li.removeFirst();\n //System.out.println(\"LinkedList \"+li);\n // System.out.println(c);\n if(ch2[c]==temp){\n count++;\n if(count>max){\n max=count;\n }\n }\n c++;\n li1.add(temp);\n if(li.isEmpty()){\n break;\n }\n }\n //System.out.println(max);\n li=li1;\n li1=new LinkedList<>();\n li.removeFirst();\n //System.out.println(li);\n }else{\n li.add(ch1[i]);\n }\n }",
"c=0",
"c",
"0",
"count=0",
"count",
"0",
"if(li.size()==m-1){\n li.add(ch1[i]);\n count=0;\n //System.out.println(li);\n c=0;\n while(!li.isEmpty()){\n char temp=li.removeFirst();\n //System.out.println(\"LinkedList \"+li);\n // System.out.println(c);\n if(ch2[c]==temp){\n count++;\n if(count>max){\n max=count;\n }\n }\n c++;\n li1.add(temp);\n if(li.isEmpty()){\n break;\n }\n }\n //System.out.println(max);\n li=li1;\n li1=new LinkedList<>();\n li.removeFirst();\n //System.out.println(li);\n }else{\n li.add(ch1[i]);\n }",
"li.size()==m-1",
"li.size()",
"li.size",
"li",
"m-1",
"m",
"1",
"{\n li.add(ch1[i]);\n count=0;\n //System.out.println(li);\n c=0;\n while(!li.isEmpty()){\n char temp=li.removeFirst();\n //System.out.println(\"LinkedList \"+li);\n // System.out.println(c);\n if(ch2[c]==temp){\n count++;\n if(count>max){\n max=count;\n }\n }\n c++;\n li1.add(temp);\n if(li.isEmpty()){\n break;\n }\n }\n //System.out.println(max);\n li=li1;\n li1=new LinkedList<>();\n li.removeFirst();\n //System.out.println(li);\n }",
"li.add(ch1[i])",
"li.add",
"li",
"ch1[i]",
"ch1",
"i",
"count=0",
"count",
"0",
"c=0",
"c",
"0",
"while(!li.isEmpty()){\n char temp=li.removeFirst();\n //System.out.println(\"LinkedList \"+li);\n // System.out.println(c);\n if(ch2[c]==temp){\n count++;\n if(count>max){\n max=count;\n }\n }\n c++;\n li1.add(temp);\n if(li.isEmpty()){\n break;\n }\n }",
"!li.isEmpty()",
"li.isEmpty()",
"li.isEmpty",
"li",
"{\n char temp=li.removeFirst();\n //System.out.println(\"LinkedList \"+li);\n // System.out.println(c);\n if(ch2[c]==temp){\n count++;\n if(count>max){\n max=count;\n }\n }\n c++;\n li1.add(temp);\n if(li.isEmpty()){\n break;\n }\n }",
"char temp=li.removeFirst();",
"temp",
"li.removeFirst()",
"li.removeFirst",
"li",
"if(ch2[c]==temp){\n count++;\n if(count>max){\n max=count;\n }\n }",
"ch2[c]==temp",
"ch2[c]",
"ch2",
"c",
"temp",
"{\n count++;\n if(count>max){\n max=count;\n }\n }",
"count++",
"count",
"if(count>max){\n max=count;\n }",
"count>max",
"count",
"max",
"{\n max=count;\n }",
"max=count",
"max",
"count",
"c++",
"c",
"li1.add(temp)",
"li1.add",
"li1",
"temp",
"if(li.isEmpty()){\n break;\n }",
"li.isEmpty()",
"li.isEmpty",
"li",
"{\n break;\n }",
"break;",
"li=li1",
"li",
"li1",
"li1=new LinkedList<>()",
"li1",
"new LinkedList<>()",
"li.removeFirst()",
"li.removeFirst",
"li",
"{\n li.add(ch1[i]);\n }",
"li.add(ch1[i])",
"li.add",
"li",
"ch1[i]",
"ch1",
"i",
"w.println(m-max)",
"w.println",
"w",
"m-max",
"m",
"max",
"w.close()",
"w.close",
"w",
"String args[]",
"args",
"public static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n \n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n \n public int read() {\n if (numChars==-1)\n throw new InputMismatchException();\n \n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n }\n catch (IOException e) {\n throw new InputMismatchException();\n }\n \n if(numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n \n public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n public int nextInt() {\n int c = read();\n \n while(isSpaceChar(c))\n c = read();\n \n int sgn = 1;\n \n if (c == '-') {\n sgn = -1;\n c = read();\n }\n \n int res = 0;\n do {\n if(c<'0'||c>'9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n \n return res * sgn;\n }\n \n public long nextLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n \n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n \n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n \n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n \n return res.toString();\n }\n \n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n \n public String next() {\n return readString();\n }\n \n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }",
"InputReader",
"private InputStream stream;",
"stream",
"private byte[] buf = new byte[1024];",
"buf",
"new byte[1024]",
"1024",
"private int curChar;",
"curChar",
"private int numChars;",
"numChars",
"private InputReader.SpaceCharFilter filter;",
"filter",
"private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"public InputReader(InputStream stream) {\n this.stream = stream;\n }",
"InputReader",
"{\n this.stream = stream;\n }",
"this.stream = stream",
"this.stream",
"this",
"this.stream",
"stream",
"InputStream stream",
"stream",
"public int read() {\n if (numChars==-1)\n throw new InputMismatchException();\n \n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n }\n catch (IOException e) {\n throw new InputMismatchException();\n }\n \n if(numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }",
"read",
"{\n if (numChars==-1)\n throw new InputMismatchException();\n \n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n }\n catch (IOException e) {\n throw new InputMismatchException();\n }\n \n if(numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }",
"if (numChars==-1)\n throw new InputMismatchException();",
"numChars==-1",
"numChars",
"-1",
"1",
"throw new InputMismatchException();",
"new InputMismatchException()",
"if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n }\n catch (IOException e) {\n throw new InputMismatchException();\n }\n \n if(numChars <= 0)\n return -1;\n }",
"curChar >= numChars",
"curChar",
"numChars",
"{\n curChar = 0;\n try {\n numChars = stream.read(buf);\n }\n catch (IOException e) {\n throw new InputMismatchException();\n }\n \n if(numChars <= 0)\n return -1;\n }",
"curChar = 0",
"curChar",
"0",
"try {\n numChars = stream.read(buf);\n }\n catch (IOException e) {\n throw new InputMismatchException();\n }",
"catch (IOException e) {\n throw new InputMismatchException();\n }",
"IOException e",
"{\n throw new InputMismatchException();\n }",
"throw new InputMismatchException();",
"new InputMismatchException()",
"{\n numChars = stream.read(buf);\n }",
"numChars = stream.read(buf)",
"numChars",
"stream.read(buf)",
"stream.read",
"stream",
"buf",
"if(numChars <= 0)\n return -1;",
"numChars <= 0",
"numChars",
"0",
"return -1;",
"-1",
"1",
"return buf[curChar++];",
"buf[curChar++]",
"buf",
"curChar++",
"curChar",
"public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }",
"nextLine",
"{\n String str = \"\";\n try {\n str = br.readLine();\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }",
"String str = \"\";",
"str",
"\"\"",
"try {\n str = br.readLine();\n }\n catch (IOException e) {\n e.printStackTrace();\n }",
"catch (IOException e) {\n e.printStackTrace();\n }",
"IOException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n str = br.readLine();\n }",
"str = br.readLine()",
"str",
"br.readLine()",
"br.readLine",
"br",
"return str;",
"str",
"public int nextInt() {\n int c = read();\n \n while(isSpaceChar(c))\n c = read();\n \n int sgn = 1;\n \n if (c == '-') {\n sgn = -1;\n c = read();\n }\n \n int res = 0;\n do {\n if(c<'0'||c>'9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n \n return res * sgn;\n }",
"nextInt",
"{\n int c = read();\n \n while(isSpaceChar(c))\n c = read();\n \n int sgn = 1;\n \n if (c == '-') {\n sgn = -1;\n c = read();\n }\n \n int res = 0;\n do {\n if(c<'0'||c>'9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n \n return res * sgn;\n }",
"int c = read();",
"c",
"read()",
"read",
"while(isSpaceChar(c))\n c = read();",
"isSpaceChar(c)",
"isSpaceChar",
"c",
"c = read()",
"c",
"read()",
"read",
"int sgn = 1;",
"sgn",
"1",
"if (c == '-') {\n sgn = -1;\n c = read();\n }",
"c == '-'",
"c",
"'-'",
"{\n sgn = -1;\n c = read();\n }",
"sgn = -1",
"sgn",
"-1",
"1",
"c = read()",
"c",
"read()",
"read",
"int res = 0;",
"res",
"0",
"do {\n if(c<'0'||c>'9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));",
"!isSpaceChar(c)",
"isSpaceChar(c)",
"isSpaceChar",
"c",
"{\n if(c<'0'||c>'9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }",
"if(c<'0'||c>'9')\n throw new InputMismatchException();",
"c<'0'||c>'9'",
"c<'0'",
"c",
"'0'",
"c>'9'",
"c",
"'9'",
"throw new InputMismatchException();",
"new InputMismatchException()",
"res *= 10",
"res",
"10",
"res += c - '0'",
"res",
"c - '0'",
"c",
"'0'",
"c = read()",
"c",
"read()",
"read",
"return res * sgn;",
"res * sgn",
"res",
"sgn",
"public long nextLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n \n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }",
"nextLong",
"{\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n \n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }",
"int c = read();",
"c",
"read()",
"read",
"while (isSpaceChar(c))\n c = read();",
"isSpaceChar(c)",
"isSpaceChar",
"c",
"c = read()",
"c",
"read()",
"read",
"int sgn = 1;",
"sgn",
"1",
"if (c == '-') {\n sgn = -1;\n c = read();\n }",
"c == '-'",
"c",
"'-'",
"{\n sgn = -1;\n c = read();\n }",
"sgn = -1",
"sgn",
"-1",
"1",
"c = read()",
"c",
"read()",
"read",
"long res = 0;",
"res",
"0",
"do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));",
"!isSpaceChar(c)",
"isSpaceChar(c)",
"isSpaceChar",
"c",
"{\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }",
"if (c < '0' || c > '9')\n throw new InputMismatchException();",
"c < '0' || c > '9'",
"c < '0'",
"c",
"'0'",
"c > '9'",
"c",
"'9'",
"throw new InputMismatchException();",
"new InputMismatchException()",
"res *= 10",
"res",
"10",
"res += c - '0'",
"res",
"c - '0'",
"c",
"'0'",
"c = read()",
"c",
"read()",
"read",
"return res * sgn;",
"res * sgn",
"res",
"sgn",
"public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }",
"nextDouble",
"{\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }",
"int c = read();",
"c",
"read()",
"read",
"while (isSpaceChar(c))\n c = read();",
"isSpaceChar(c)",
"isSpaceChar",
"c",
"c = read()",
"c",
"read()",
"read",
"int sgn = 1;",
"sgn",
"1",
"if (c == '-') {\n sgn = -1;\n c = read();\n }",
"c == '-'",
"c",
"'-'",
"{\n sgn = -1;\n c = read();\n }",
"sgn = -1",
"sgn",
"-1",
"1",
"c = read()",
"c",
"read()",
"read",
"double res = 0;",
"res",
"0",
"while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }",
"!isSpaceChar(c) && c != '.'",
"!isSpaceChar(c)",
"isSpaceChar(c)",
"isSpaceChar",
"c",
"c != '.'",
"c",
"'.'",
"{\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }",
"if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());",
"c == 'e' || c == 'E'",
"c == 'e'",
"c",
"'e'",
"c == 'E'",
"c",
"'E'",
"return res * Math.pow(10, nextInt());",
"res * Math.pow(10, nextInt())",
"res",
"Math.pow(10, nextInt())",
"Math.pow",
"Math",
"10",
"nextInt()",
"nextInt",
"if (c < '0' || c > '9')\n throw new InputMismatchException();",
"c < '0' || c > '9'",
"c < '0'",
"c",
"'0'",
"c > '9'",
"c",
"'9'",
"throw new InputMismatchException();",
"new InputMismatchException()",
"res *= 10",
"res",
"10",
"res += c - '0'",
"res",
"c - '0'",
"c",
"'0'",
"c = read()",
"c",
"read()",
"read",
"if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }",
"c == '.'",
"c",
"'.'",
"{\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }",
"c = read()",
"c",
"read()",
"read",
"double m = 1;",
"m",
"1",
"while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }",
"!isSpaceChar(c)",
"isSpaceChar(c)",
"isSpaceChar",
"c",
"{\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }",
"if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());",
"c == 'e' || c == 'E'",
"c == 'e'",
"c",
"'e'",
"c == 'E'",
"c",
"'E'",
"return res * Math.pow(10, nextInt());",
"res * Math.pow(10, nextInt())",
"res",
"Math.pow(10, nextInt())",
"Math.pow",
"Math",
"10",
"nextInt()",
"nextInt",
"if (c < '0' || c > '9')\n throw new InputMismatchException();",
"c < '0' || c > '9'",
"c < '0'",
"c",
"'0'",
"c > '9'",
"c",
"'9'",
"throw new InputMismatchException();",
"new InputMismatchException()",
"m /= 10",
"m",
"10",
"res += (c - '0') * m",
"res",
"(c - '0') * m",
"(c - '0')",
"c",
"'0'",
"m",
"c = read()",
"c",
"read()",
"read",
"return res * sgn;",
"res * sgn",
"res",
"sgn",
"public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n \n return res.toString();\n }",
"readString",
"{\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n \n return res.toString();\n }",
"int c = read();",
"c",
"read()",
"read",
"while (isSpaceChar(c))\n c = read();",
"isSpaceChar(c)",
"isSpaceChar",
"c",
"c = read()",
"c",
"read()",
"read",
"StringBuilder res = new StringBuilder();",
"res",
"new StringBuilder()",
"do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));",
"!isSpaceChar(c)",
"isSpaceChar(c)",
"isSpaceChar",
"c",
"{\n res.appendCodePoint(c);\n c = read();\n }",
"res.appendCodePoint(c)",
"res.appendCodePoint",
"res",
"c",
"c = read()",
"c",
"read()",
"read",
"return res.toString();",
"res.toString()",
"res.toString",
"res",
"public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }",
"isSpaceChar",
"{\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }",
"if (filter != null)\n return filter.isSpaceChar(c);",
"filter != null",
"filter",
"null",
"return filter.isSpaceChar(c);",
"filter.isSpaceChar(c)",
"filter.isSpaceChar",
"filter",
"c",
"return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;",
"c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1",
"c == '\\t'",
"c == '\\r'",
"c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1",
"c == ' '",
"c",
"' '",
"c == '\\n'",
"c",
"'\\n'",
"c == '\\r'",
"c",
"'\\r'",
"c == '\\t'",
"c",
"'\\t'",
"c == -1",
"c",
"-1",
"1",
"int c",
"c",
"public String next() {\n return readString();\n }",
"next",
"{\n return readString();\n }",
"return readString();",
"readString()",
"readString",
"public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }",
"SpaceCharFilter",
"public boolean isSpaceChar(int ch);",
"isSpaceChar",
"int ch",
"ch",
"public static class Pair<U extends Comparable<U>, V extends Comparable<V>> implements Comparable<Pair<U, V>> {\n public U x;\n public V y;\n \n public Pair(U x, V y) {\n this.x = x;\n this.y = y;\n }\n \n public int hashCode() {\n return (x == null ? 0 : x.hashCode() * 31) + (y == null ? 0 : y.hashCode());\n }\n \n public boolean equals(Object o) {\n if (this == o)\n return true;\n if (o == null || getClass() != o.getClass())\n return false;\n Pair<U, V> p = (Pair<U, V>) o;\n return (x == null ? p.x == null : x.equals(p.x)) && (y == null ? p.y == null : y.equals(p.y));\n }\n \n public int compareTo(Pair<U, V> b) {\n int cmpU = x.compareTo(b.x);\n return cmpU != 0 ? cmpU : y.compareTo(b.y);\n }\n \n public String toString() {\n return String.format(\"(%s, %s)\", x.toString(), y.toString());\n }\n \n }",
"Pair",
"public U x;",
"x",
"public V y;",
"y",
"public Pair(U x, V y) {\n this.x = x;\n this.y = y;\n }",
"Pair",
"{\n this.x = x;\n this.y = y;\n }",
"this.x = x",
"this.x",
"this",
"this.x",
"x",
"this.y = y",
"this.y",
"this",
"this.y",
"y",
"U x",
"x",
"V y",
"y",
"public int hashCode() {\n return (x == null ? 0 : x.hashCode() * 31) + (y == null ? 0 : y.hashCode());\n }",
"hashCode",
"{\n return (x == null ? 0 : x.hashCode() * 31) + (y == null ? 0 : y.hashCode());\n }",
"return (x == null ? 0 : x.hashCode() * 31) + (y == null ? 0 : y.hashCode());",
"(x == null ? 0 : x.hashCode() * 31) + (y == null ? 0 : y.hashCode())",
"(x == null ? 0 : x.hashCode() * 31)",
"x == null",
"x",
"null",
"0",
"x.hashCode() * 31",
"x.hashCode()",
"x.hashCode",
"x",
"31",
"(y == null ? 0 : y.hashCode())",
"y == null",
"y",
"null",
"0",
"y.hashCode()",
"y.hashCode",
"y",
"public boolean equals(Object o) {\n if (this == o)\n return true;\n if (o == null || getClass() != o.getClass())\n return false;\n Pair<U, V> p = (Pair<U, V>) o;\n return (x == null ? p.x == null : x.equals(p.x)) && (y == null ? p.y == null : y.equals(p.y));\n }",
"equals",
"{\n if (this == o)\n return true;\n if (o == null || getClass() != o.getClass())\n return false;\n Pair<U, V> p = (Pair<U, V>) o;\n return (x == null ? p.x == null : x.equals(p.x)) && (y == null ? p.y == null : y.equals(p.y));\n }",
"if (this == o)\n return true;",
"this == o",
"this",
"o",
"return true;",
"true",
"if (o == null || getClass() != o.getClass())\n return false;",
"o == null || getClass() != o.getClass()",
"o == null",
"o",
"null",
"getClass() != o.getClass()",
"getClass()",
"getClass",
"o.getClass()",
"o.getClass",
"o",
"return false;",
"false",
"Pair<U, V> p = (Pair<U, V>) o;",
"p",
"(Pair<U, V>) o",
"return (x == null ? p.x == null : x.equals(p.x)) && (y == null ? p.y == null : y.equals(p.y));",
"(x == null ? p.x == null : x.equals(p.x)) && (y == null ? p.y == null : y.equals(p.y))",
"(x == null ? p.x == null : x.equals(p.x))",
"x == null",
"x",
"null",
"p.x == null",
"p.x",
"p",
"p.x",
"null",
"x.equals(p.x)",
"x.equals",
"x",
"p.x",
"p",
"p.x",
"(y == null ? p.y == null : y.equals(p.y))",
"y == null",
"y",
"null",
"p.y == null",
"p.y",
"p",
"p.y",
"null",
"y.equals(p.y)",
"y.equals",
"y",
"p.y",
"p",
"p.y",
"Object o",
"o",
"public int compareTo(Pair<U, V> b) {\n int cmpU = x.compareTo(b.x);\n return cmpU != 0 ? cmpU : y.compareTo(b.y);\n }",
"compareTo",
"{\n int cmpU = x.compareTo(b.x);\n return cmpU != 0 ? cmpU : y.compareTo(b.y);\n }",
"int cmpU = x.compareTo(b.x);",
"cmpU",
"x.compareTo(b.x)",
"x.compareTo",
"x",
"b.x",
"b",
"b.x",
"return cmpU != 0 ? cmpU : y.compareTo(b.y);",
"cmpU != 0 ? cmpU : y.compareTo(b.y)",
"cmpU != 0",
"cmpU",
"0",
"cmpU",
"y.compareTo(b.y)",
"y.compareTo",
"y",
"b.y",
"b",
"b.y",
"Pair<U, V> b",
"b",
"public String toString() {\n return String.format(\"(%s, %s)\", x.toString(), y.toString());\n }",
"toString",
"{\n return String.format(\"(%s, %s)\", x.toString(), y.toString());\n }",
"return String.format(\"(%s, %s)\", x.toString(), y.toString());",
"String.format(\"(%s, %s)\", x.toString(), y.toString())",
"String.format",
"String",
"\"(%s, %s)\"",
"x.toString()",
"x.toString",
"x",
"y.toString()",
"y.toString",
"y",
"Comparable",
"static class MultiSet<U extends Comparable<U>> {\n public int sz = 0;\n public TreeMap<U, Integer> t;\n \n public MultiSet() {\n t = new TreeMap<>();\n }\n \n public void add(U x) {\n t.put(x, t.getOrDefault(x, 0) + 1);\n sz++;\n }\n \n public void remove(U x) {\n if (t.get(x) == 1) t.remove(x);\n else t.put(x, t.get(x) - 1);\n sz--;\n }\n \n }",
"MultiSet",
"public int sz = 0;",
"sz",
"0",
"public TreeMap<U, Integer> t;",
"t",
"public MultiSet() {\n t = new TreeMap<>();\n }",
"MultiSet",
"{\n t = new TreeMap<>();\n }",
"t = new TreeMap<>()",
"t",
"new TreeMap<>()",
"public void add(U x) {\n t.put(x, t.getOrDefault(x, 0) + 1);\n sz++;\n }",
"add",
"{\n t.put(x, t.getOrDefault(x, 0) + 1);\n sz++;\n }",
"t.put(x, t.getOrDefault(x, 0) + 1)",
"t.put",
"t",
"x",
"t.getOrDefault(x, 0) + 1",
"t.getOrDefault(x, 0)",
"t.getOrDefault",
"t",
"x",
"0",
"1",
"sz++",
"sz",
"U x",
"x",
"public void remove(U x) {\n if (t.get(x) == 1) t.remove(x);\n else t.put(x, t.get(x) - 1);\n sz--;\n }",
"remove",
"{\n if (t.get(x) == 1) t.remove(x);\n else t.put(x, t.get(x) - 1);\n sz--;\n }",
"if (t.get(x) == 1) t.remove(x);\n else t.put(x, t.get(x) - 1);",
"t.get(x) == 1",
"t.get(x)",
"t.get",
"t",
"x",
"1",
"t.remove(x)",
"t.remove",
"t",
"x",
"t.put(x, t.get(x) - 1)",
"t.put",
"t",
"x",
"t.get(x) - 1",
"t.get(x)",
"t.get",
"t",
"x",
"1",
"sz--",
"sz",
"U x",
"x",
"public class Main{\n public static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n \n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n \n public int read() {\n if (numChars==-1)\n throw new InputMismatchException();\n \n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n }\n catch (IOException e) {\n throw new InputMismatchException();\n }\n \n if(numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n \n public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n public int nextInt() {\n int c = read();\n \n while(isSpaceChar(c))\n c = read();\n \n int sgn = 1;\n \n if (c == '-') {\n sgn = -1;\n c = read();\n }\n \n int res = 0;\n do {\n if(c<'0'||c>'9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n \n return res * sgn;\n }\n \n public long nextLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n \n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n \n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n \n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n \n return res.toString();\n }\n \n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n \n public String next() {\n return readString();\n }\n \n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n \n static long gcd(long a, long b){\n if (a == 0)\n return b; \n return gcd(b % a, a); \n }\n static long lcm(long a, long b) {\n return (a*b)/gcd(a, b); \n }\n public static void sortbyColumn(int arr[][], int col) \n { \n \n Arrays.sort(arr, new Comparator<int[]>() { \n \n @Override \n \n public int compare(final int[] entry1, \n final int[] entry2) { \n \n \n if (entry1[col] > entry2[col]) \n return 1; \n else\n return -1; \n } \n }); \n } \n static long func(long a[],long size,int s){\n long max1=a[s];\n long maxc=a[s];\n for(int i=s+1;i<size;i++){\n maxc=Math.max(a[i],maxc+a[i]);\n max1=Math.max(maxc,max1);\n }\n return max1;\n }\n public static class Pair<U extends Comparable<U>, V extends Comparable<V>> implements Comparable<Pair<U, V>> {\n public U x;\n public V y;\n \n public Pair(U x, V y) {\n this.x = x;\n this.y = y;\n }\n \n public int hashCode() {\n return (x == null ? 0 : x.hashCode() * 31) + (y == null ? 0 : y.hashCode());\n }\n \n public boolean equals(Object o) {\n if (this == o)\n return true;\n if (o == null || getClass() != o.getClass())\n return false;\n Pair<U, V> p = (Pair<U, V>) o;\n return (x == null ? p.x == null : x.equals(p.x)) && (y == null ? p.y == null : y.equals(p.y));\n }\n \n public int compareTo(Pair<U, V> b) {\n int cmpU = x.compareTo(b.x);\n return cmpU != 0 ? cmpU : y.compareTo(b.y);\n }\n \n public String toString() {\n return String.format(\"(%s, %s)\", x.toString(), y.toString());\n }\n \n }\n static class MultiSet<U extends Comparable<U>> {\n public int sz = 0;\n public TreeMap<U, Integer> t;\n \n public MultiSet() {\n t = new TreeMap<>();\n }\n \n public void add(U x) {\n t.put(x, t.getOrDefault(x, 0) + 1);\n sz++;\n }\n \n public void remove(U x) {\n if (t.get(x) == 1) t.remove(x);\n else t.put(x, t.get(x) - 1);\n sz--;\n }\n \n }\n static void shuffle(long[] a) {\n Random get = new Random();\n for (int i = 0; i < a.length; i++) {\n int r = get.nextInt(a.length);\n long temp = a[i];\n a[i] = a[r];\n a[r] = temp;\n }\n }\n //static LinkedList<Integer> li;\n //static LinkedList<Integer> ans;\n static int ans1=0,ans2=0;\n static long dist[];\n static int visited[];\n static ArrayList<Integer> adj[];\n \n \n public static void main(String args[]){\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter w = new PrintWriter(outputStream);\n int t,i,j;\n \n t=1;\n while(t-->0){\n String s1,s2;\n s1=in.next();\n s2=in.next();\n char ch1[]=s1.toCharArray();\n char ch2[]=s2.toCharArray();\n int n=s1.length(),m=s2.length(); \n LinkedList<Character> li=new LinkedList<>();\n LinkedList<Character> li1=new LinkedList<>();\n int max=0,c=0,count=0;\n for(i=0;i<n;i++){\n c=0;\n count=0;\n //System.out.println(i+\" \"+li.size());\n if(li.size()==m-1){\n li.add(ch1[i]);\n count=0;\n //System.out.println(li);\n c=0;\n while(!li.isEmpty()){\n char temp=li.removeFirst();\n //System.out.println(\"LinkedList \"+li);\n // System.out.println(c);\n if(ch2[c]==temp){\n count++;\n if(count>max){\n max=count;\n }\n }\n c++;\n li1.add(temp);\n if(li.isEmpty()){\n break;\n }\n }\n //System.out.println(max);\n li=li1;\n li1=new LinkedList<>();\n li.removeFirst();\n //System.out.println(li);\n }else{\n li.add(ch1[i]);\n }\n }\n w.println(m-max);\n }\n w.close();\n }\n}",
"public class Main{\n public static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n \n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n \n public int read() {\n if (numChars==-1)\n throw new InputMismatchException();\n \n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n }\n catch (IOException e) {\n throw new InputMismatchException();\n }\n \n if(numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n \n public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n public int nextInt() {\n int c = read();\n \n while(isSpaceChar(c))\n c = read();\n \n int sgn = 1;\n \n if (c == '-') {\n sgn = -1;\n c = read();\n }\n \n int res = 0;\n do {\n if(c<'0'||c>'9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n \n return res * sgn;\n }\n \n public long nextLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n \n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n \n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n \n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n \n return res.toString();\n }\n \n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n \n public String next() {\n return readString();\n }\n \n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n \n static long gcd(long a, long b){\n if (a == 0)\n return b; \n return gcd(b % a, a); \n }\n static long lcm(long a, long b) {\n return (a*b)/gcd(a, b); \n }\n public static void sortbyColumn(int arr[][], int col) \n { \n \n Arrays.sort(arr, new Comparator<int[]>() { \n \n @Override \n \n public int compare(final int[] entry1, \n final int[] entry2) { \n \n \n if (entry1[col] > entry2[col]) \n return 1; \n else\n return -1; \n } \n }); \n } \n static long func(long a[],long size,int s){\n long max1=a[s];\n long maxc=a[s];\n for(int i=s+1;i<size;i++){\n maxc=Math.max(a[i],maxc+a[i]);\n max1=Math.max(maxc,max1);\n }\n return max1;\n }\n public static class Pair<U extends Comparable<U>, V extends Comparable<V>> implements Comparable<Pair<U, V>> {\n public U x;\n public V y;\n \n public Pair(U x, V y) {\n this.x = x;\n this.y = y;\n }\n \n public int hashCode() {\n return (x == null ? 0 : x.hashCode() * 31) + (y == null ? 0 : y.hashCode());\n }\n \n public boolean equals(Object o) {\n if (this == o)\n return true;\n if (o == null || getClass() != o.getClass())\n return false;\n Pair<U, V> p = (Pair<U, V>) o;\n return (x == null ? p.x == null : x.equals(p.x)) && (y == null ? p.y == null : y.equals(p.y));\n }\n \n public int compareTo(Pair<U, V> b) {\n int cmpU = x.compareTo(b.x);\n return cmpU != 0 ? cmpU : y.compareTo(b.y);\n }\n \n public String toString() {\n return String.format(\"(%s, %s)\", x.toString(), y.toString());\n }\n \n }\n static class MultiSet<U extends Comparable<U>> {\n public int sz = 0;\n public TreeMap<U, Integer> t;\n \n public MultiSet() {\n t = new TreeMap<>();\n }\n \n public void add(U x) {\n t.put(x, t.getOrDefault(x, 0) + 1);\n sz++;\n }\n \n public void remove(U x) {\n if (t.get(x) == 1) t.remove(x);\n else t.put(x, t.get(x) - 1);\n sz--;\n }\n \n }\n static void shuffle(long[] a) {\n Random get = new Random();\n for (int i = 0; i < a.length; i++) {\n int r = get.nextInt(a.length);\n long temp = a[i];\n a[i] = a[r];\n a[r] = temp;\n }\n }\n //static LinkedList<Integer> li;\n //static LinkedList<Integer> ans;\n static int ans1=0,ans2=0;\n static long dist[];\n static int visited[];\n static ArrayList<Integer> adj[];\n \n \n public static void main(String args[]){\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter w = new PrintWriter(outputStream);\n int t,i,j;\n \n t=1;\n while(t-->0){\n String s1,s2;\n s1=in.next();\n s2=in.next();\n char ch1[]=s1.toCharArray();\n char ch2[]=s2.toCharArray();\n int n=s1.length(),m=s2.length(); \n LinkedList<Character> li=new LinkedList<>();\n LinkedList<Character> li1=new LinkedList<>();\n int max=0,c=0,count=0;\n for(i=0;i<n;i++){\n c=0;\n count=0;\n //System.out.println(i+\" \"+li.size());\n if(li.size()==m-1){\n li.add(ch1[i]);\n count=0;\n //System.out.println(li);\n c=0;\n while(!li.isEmpty()){\n char temp=li.removeFirst();\n //System.out.println(\"LinkedList \"+li);\n // System.out.println(c);\n if(ch2[c]==temp){\n count++;\n if(count>max){\n max=count;\n }\n }\n c++;\n li1.add(temp);\n if(li.isEmpty()){\n break;\n }\n }\n //System.out.println(max);\n li=li1;\n li1=new LinkedList<>();\n li.removeFirst();\n //System.out.println(li);\n }else{\n li.add(ch1[i]);\n }\n }\n w.println(m-max);\n }\n w.close();\n }\n}",
"Main"
]
| import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.InputMismatchException;
import java.util.*;
import java.io.*;
import java.lang.*;
public class Main{
public static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private InputReader.SpaceCharFilter filter;
private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
public InputReader(InputStream stream) {
this.stream = stream;
}
public int read() {
if (numChars==-1)
throw new InputMismatchException();
if (curChar >= numChars) {
curChar = 0;
try {
numChars = stream.read(buf);
}
catch (IOException e) {
throw new InputMismatchException();
}
if(numChars <= 0)
return -1;
}
return buf[curChar++];
}
public String nextLine() {
String str = "";
try {
str = br.readLine();
}
catch (IOException e) {
e.printStackTrace();
}
return str;
}
public int nextInt() {
int c = read();
while(isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
int res = 0;
do {
if(c<'0'||c>'9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
}
while (!isSpaceChar(c));
return res * sgn;
}
public long nextLong() {
int c = read();
while (isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
long res = 0;
do {
if (c < '0' || c > '9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
}
while (!isSpaceChar(c));
return res * sgn;
}
public double nextDouble() {
int c = read();
while (isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
double res = 0;
while (!isSpaceChar(c) && c != '.') {
if (c == 'e' || c == 'E')
return res * Math.pow(10, nextInt());
if (c < '0' || c > '9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
}
if (c == '.') {
c = read();
double m = 1;
while (!isSpaceChar(c)) {
if (c == 'e' || c == 'E')
return res * Math.pow(10, nextInt());
if (c < '0' || c > '9')
throw new InputMismatchException();
m /= 10;
res += (c - '0') * m;
c = read();
}
}
return res * sgn;
}
public String readString() {
int c = read();
while (isSpaceChar(c))
c = read();
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
}
while (!isSpaceChar(c));
return res.toString();
}
public boolean isSpaceChar(int c) {
if (filter != null)
return filter.isSpaceChar(c);
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public String next() {
return readString();
}
public interface SpaceCharFilter {
public boolean isSpaceChar(int ch);
}
}
static long gcd(long a, long b){
if (a == 0)
return b;
return gcd(b % a, a);
}
static long lcm(long a, long b) {
return (a*b)/gcd(a, b);
}
public static void sortbyColumn(int arr[][], int col)
{
Arrays.sort(arr, new Comparator<int[]>() {
@Override
public int compare(final int[] entry1,
final int[] entry2) {
if (entry1[col] > entry2[col])
return 1;
else
return -1;
}
});
}
static long func(long a[],long size,int s){
long max1=a[s];
long maxc=a[s];
for(int i=s+1;i<size;i++){
maxc=Math.max(a[i],maxc+a[i]);
max1=Math.max(maxc,max1);
}
return max1;
}
public static class Pair<U extends Comparable<U>, V extends Comparable<V>> implements Comparable<Pair<U, V>> {
public U x;
public V y;
public Pair(U x, V y) {
this.x = x;
this.y = y;
}
public int hashCode() {
return (x == null ? 0 : x.hashCode() * 31) + (y == null ? 0 : y.hashCode());
}
public boolean equals(Object o) {
if (this == o)
return true;
if (o == null || getClass() != o.getClass())
return false;
Pair<U, V> p = (Pair<U, V>) o;
return (x == null ? p.x == null : x.equals(p.x)) && (y == null ? p.y == null : y.equals(p.y));
}
public int compareTo(Pair<U, V> b) {
int cmpU = x.compareTo(b.x);
return cmpU != 0 ? cmpU : y.compareTo(b.y);
}
public String toString() {
return String.format("(%s, %s)", x.toString(), y.toString());
}
}
static class MultiSet<U extends Comparable<U>> {
public int sz = 0;
public TreeMap<U, Integer> t;
public MultiSet() {
t = new TreeMap<>();
}
public void add(U x) {
t.put(x, t.getOrDefault(x, 0) + 1);
sz++;
}
public void remove(U x) {
if (t.get(x) == 1) t.remove(x);
else t.put(x, t.get(x) - 1);
sz--;
}
}
static void shuffle(long[] a) {
Random get = new Random();
for (int i = 0; i < a.length; i++) {
int r = get.nextInt(a.length);
long temp = a[i];
a[i] = a[r];
a[r] = temp;
}
}
//static LinkedList<Integer> li;
//static LinkedList<Integer> ans;
static int ans1=0,ans2=0;
static long dist[];
static int visited[];
static ArrayList<Integer> adj[];
public static void main(String args[]){
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
PrintWriter w = new PrintWriter(outputStream);
int t,i,j;
t=1;
while(t-->0){
String s1,s2;
s1=in.next();
s2=in.next();
char ch1[]=s1.toCharArray();
char ch2[]=s2.toCharArray();
int n=s1.length(),m=s2.length();
LinkedList<Character> li=new LinkedList<>();
LinkedList<Character> li1=new LinkedList<>();
int max=0,c=0,count=0;
for(i=0;i<n;i++){
c=0;
count=0;
//System.out.println(i+" "+li.size());
if(li.size()==m-1){
li.add(ch1[i]);
count=0;
//System.out.println(li);
c=0;
while(!li.isEmpty()){
char temp=li.removeFirst();
//System.out.println("LinkedList "+li);
// System.out.println(c);
if(ch2[c]==temp){
count++;
if(count>max){
max=count;
}
}
c++;
li1.add(temp);
if(li.isEmpty()){
break;
}
}
//System.out.println(max);
li=li1;
li1=new LinkedList<>();
li.removeFirst();
//System.out.println(li);
}else{
li.add(ch1[i]);
}
}
w.println(m-max);
}
w.close();
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
41,
13,
18,
13,
13,
41,
13,
18,
13,
13,
41,
13,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
2,
13,
13,
17,
1,
40,
13,
30,
30,
0,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
2,
13,
13,
18,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
103,
5
],
[
103,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
16,
17
],
[
17,
18
],
[
8,
19
],
[
19,
20
],
[
19,
21
],
[
21,
22
],
[
22,
23
],
[
23,
24
],
[
24,
25
],
[
8,
26
],
[
26,
27
],
[
26,
28
],
[
28,
29
],
[
28,
30
],
[
8,
31
],
[
31,
32
],
[
31,
33
],
[
33,
34
],
[
33,
35
],
[
8,
36
],
[
36,
37
],
[
36,
38
],
[
8,
39
],
[
39,
40
],
[
39,
41
],
[
8,
42
],
[
42,
43
],
[
43,
44
],
[
44,
45
],
[
44,
46
],
[
42,
47
],
[
47,
48
],
[
47,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
49,
53
],
[
42,
54
],
[
54,
55
],
[
55,
56
],
[
42,
57
],
[
58,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
58,
62
],
[
62,
63
],
[
63,
64
],
[
64,
65
],
[
64,
66
],
[
62,
67
],
[
67,
68
],
[
67,
69
],
[
62,
70
],
[
70,
71
],
[
71,
72
],
[
62,
73
],
[
74,
74
],
[
74,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
77,
79
],
[
79,
80
],
[
79,
81
],
[
76,
82
],
[
82,
83
],
[
82,
84
],
[
75,
85
],
[
85,
86
],
[
58,
87
],
[
87,
88
],
[
87,
89
],
[
89,
90
],
[
90,
91
],
[
89,
92
],
[
89,
93
],
[
8,
94
],
[
94,
95
],
[
95,
96
],
[
96,
97
],
[
96,
98
],
[
94,
99
],
[
6,
100
],
[
100,
101
],
[
0,
102
],
[
102,
103
],
[
102,
104
]
]
| [
"import java.util.*;\npublic class Main {\n public static void main(String args[]) {\n Scanner in=new Scanner(System.in);\n char s[]=in.next().toCharArray(),t[]=in.next().toCharArray();;\n int n=s.length,l=t.length,max=l,cnt=0;\n for(int i=0;i<n-l+1;i++){\n cnt=0;\n for(int j=0;j<l;j++){\n if(s[i+j]!=t[j]) cnt++;\n }\n max=Math.min(max,cnt);\n }\n System.out.println(max);\n }\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n public static void main(String args[]) {\n Scanner in=new Scanner(System.in);\n char s[]=in.next().toCharArray(),t[]=in.next().toCharArray();;\n int n=s.length,l=t.length,max=l,cnt=0;\n for(int i=0;i<n-l+1;i++){\n cnt=0;\n for(int j=0;j<l;j++){\n if(s[i+j]!=t[j]) cnt++;\n }\n max=Math.min(max,cnt);\n }\n System.out.println(max);\n }\n}",
"Main",
"public static void main(String args[]) {\n Scanner in=new Scanner(System.in);\n char s[]=in.next().toCharArray(),t[]=in.next().toCharArray();;\n int n=s.length,l=t.length,max=l,cnt=0;\n for(int i=0;i<n-l+1;i++){\n cnt=0;\n for(int j=0;j<l;j++){\n if(s[i+j]!=t[j]) cnt++;\n }\n max=Math.min(max,cnt);\n }\n System.out.println(max);\n }",
"main",
"{\n Scanner in=new Scanner(System.in);\n char s[]=in.next().toCharArray(),t[]=in.next().toCharArray();;\n int n=s.length,l=t.length,max=l,cnt=0;\n for(int i=0;i<n-l+1;i++){\n cnt=0;\n for(int j=0;j<l;j++){\n if(s[i+j]!=t[j]) cnt++;\n }\n max=Math.min(max,cnt);\n }\n System.out.println(max);\n }",
"Scanner in=new Scanner(System.in);",
"in",
"new Scanner(System.in)",
"char s[]=in.next().toCharArray()",
"s",
"in.next().toCharArray()",
"in.next().toCharArray",
"in.next()",
"in.next",
"in",
"t[]=in.next().toCharArray();",
"t",
"in.next().toCharArray()",
"in.next().toCharArray",
"in.next()",
"in.next",
"in",
"int n=s.length",
"n",
"s.length",
"s",
"s.length",
"l=t.length",
"l",
"t.length",
"t",
"t.length",
"max=l",
"max",
"l",
"cnt=0;",
"cnt",
"0",
"for(int i=0;i<n-l+1;i++){\n cnt=0;\n for(int j=0;j<l;j++){\n if(s[i+j]!=t[j]) cnt++;\n }\n max=Math.min(max,cnt);\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n-l+1",
"i",
"n-l+1",
"n-l",
"n",
"l",
"1",
"i++",
"i++",
"i",
"{\n cnt=0;\n for(int j=0;j<l;j++){\n if(s[i+j]!=t[j]) cnt++;\n }\n max=Math.min(max,cnt);\n }",
"{\n cnt=0;\n for(int j=0;j<l;j++){\n if(s[i+j]!=t[j]) cnt++;\n }\n max=Math.min(max,cnt);\n }",
"cnt=0",
"cnt",
"0",
"for(int j=0;j<l;j++){\n if(s[i+j]!=t[j]) cnt++;\n }",
"int j=0;",
"int j=0;",
"j",
"0",
"j<l",
"j",
"l",
"j++",
"j++",
"j",
"{\n if(s[i+j]!=t[j]) cnt++;\n }",
"{\n if(s[i+j]!=t[j]) cnt++;\n }",
"if(s[i+j]!=t[j]) cnt++;",
"s[i+j]!=t[j]",
"s[i+j]",
"s",
"i+j",
"i",
"j",
"t[j]",
"t",
"j",
"cnt++",
"cnt",
"max=Math.min(max,cnt)",
"max",
"Math.min(max,cnt)",
"Math.min",
"Math",
"max",
"cnt",
"System.out.println(max)",
"System.out.println",
"System.out",
"System",
"System.out",
"max",
"String args[]",
"args",
"public class Main {\n public static void main(String args[]) {\n Scanner in=new Scanner(System.in);\n char s[]=in.next().toCharArray(),t[]=in.next().toCharArray();;\n int n=s.length,l=t.length,max=l,cnt=0;\n for(int i=0;i<n-l+1;i++){\n cnt=0;\n for(int j=0;j<l;j++){\n if(s[i+j]!=t[j]) cnt++;\n }\n max=Math.min(max,cnt);\n }\n System.out.println(max);\n }\n}",
"public class Main {\n public static void main(String args[]) {\n Scanner in=new Scanner(System.in);\n char s[]=in.next().toCharArray(),t[]=in.next().toCharArray();;\n int n=s.length,l=t.length,max=l,cnt=0;\n for(int i=0;i<n-l+1;i++){\n cnt=0;\n for(int j=0;j<l;j++){\n if(s[i+j]!=t[j]) cnt++;\n }\n max=Math.min(max,cnt);\n }\n System.out.println(max);\n }\n}",
"Main"
]
| import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner in=new Scanner(System.in);
char s[]=in.next().toCharArray(),t[]=in.next().toCharArray();;
int n=s.length,l=t.length,max=l,cnt=0;
for(int i=0;i<n-l+1;i++){
cnt=0;
for(int j=0;j<l;j++){
if(s[i+j]!=t[j]) cnt++;
}
max=Math.min(max,cnt);
}
System.out.println(max);
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
41,
13,
17,
41,
13,
17,
41,
13,
13,
41,
13,
17,
41,
13,
41,
13,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
11,
1,
41,
13,
2,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
13,
14,
2,
4,
18,
13,
4,
18,
13,
9,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
12,
13,
30,
14,
2,
13,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
4,
18,
18,
13,
13,
17,
30,
0,
13,
18,
13,
13,
0,
13,
20,
0,
13,
20,
4,
13,
12,
13,
30,
4,
18,
20,
23,
13,
6,
13,
41,
13,
41,
13,
20,
17,
41,
13,
41,
13,
12,
13,
30,
0,
18,
36,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
40,
17,
37,
20,
14,
2,
13,
13,
30,
0,
13,
17,
38,
5,
13,
30,
37,
20,
30,
0,
13,
4,
18,
13,
13,
14,
2,
13,
17,
29,
40,
17,
29,
18,
13,
40,
13,
12,
13,
30,
29,
2,
2,
2,
2,
2,
13,
17,
2,
13,
17,
2,
13,
17,
2,
13,
17,
2,
13,
40,
17,
23,
13,
12,
13,
30,
29,
2,
2,
2,
13,
17,
2,
13,
17,
2,
13,
40,
17,
23,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
13,
29,
13,
23,
13,
23,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
13,
29,
13,
23,
13,
23,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
13,
29,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
4,
13,
42,
4,
13,
13,
0,
13,
4,
13,
41,
13,
20,
42,
40,
4,
13,
13,
30,
4,
18,
13,
13,
0,
13,
4,
13,
29,
4,
18,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
4,
13,
42,
4,
13,
13,
0,
13,
4,
13,
41,
13,
20,
42,
40,
4,
13,
13,
30,
4,
18,
13,
13,
0,
13,
4,
13,
29,
4,
18,
13,
12,
13,
30,
41,
13,
20,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
18,
13,
13,
13,
4,
13,
29,
13,
23,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
16,
17
],
[
16,
18
],
[
0,
19
],
[
670,
20
],
[
670,
21
],
[
21,
22
],
[
670,
23
],
[
23,
24
],
[
23,
25
],
[
670,
26
],
[
26,
27
],
[
26,
28
],
[
670,
29
],
[
29,
30
],
[
29,
31
],
[
670,
32
],
[
32,
33
],
[
32,
34
],
[
670,
35
],
[
35,
36
],
[
670,
37
],
[
37,
38
],
[
670,
39
],
[
39,
40
],
[
39,
41
],
[
41,
42
],
[
42,
43
],
[
42,
44
],
[
44,
45
],
[
45,
46
],
[
41,
47
],
[
47,
48
],
[
47,
49
],
[
49,
50
],
[
50,
51
],
[
41,
52
],
[
52,
53
],
[
52,
54
],
[
54,
55
],
[
55,
56
],
[
41,
57
],
[
57,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
57,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
65,
66
],
[
57,
67
],
[
67,
68
],
[
68,
69
],
[
57,
70
],
[
71,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
74,
75
],
[
74,
76
],
[
76,
77
],
[
76,
78
],
[
72,
79
],
[
79,
80
],
[
79,
81
],
[
81,
82
],
[
82,
83
],
[
72,
84
],
[
84,
85
],
[
85,
86
],
[
72,
87
],
[
88,
88
],
[
88,
89
],
[
89,
90
],
[
89,
91
],
[
91,
92
],
[
92,
93
],
[
91,
94
],
[
91,
95
],
[
88,
96
],
[
96,
97
],
[
97,
98
],
[
98,
99
],
[
99,
100
],
[
97,
101
],
[
101,
102
],
[
102,
103
],
[
96,
104
],
[
88,
105
],
[
105,
106
],
[
105,
107
],
[
88,
108
],
[
108,
109
],
[
109,
110
],
[
110,
111
],
[
110,
112
],
[
108,
113
],
[
113,
114
],
[
113,
115
],
[
115,
116
],
[
116,
117
],
[
108,
118
],
[
118,
119
],
[
119,
120
],
[
108,
121
],
[
122,
122
],
[
122,
123
],
[
123,
124
],
[
124,
125
],
[
125,
126
],
[
126,
127
],
[
125,
128
],
[
124,
129
],
[
129,
130
],
[
130,
131
],
[
129,
132
],
[
123,
133
],
[
133,
134
],
[
88,
135
],
[
135,
136
],
[
135,
137
],
[
137,
138
],
[
138,
139
],
[
137,
140
],
[
137,
141
],
[
41,
142
],
[
142,
143
],
[
143,
144
],
[
144,
145
],
[
144,
146
],
[
142,
147
],
[
670,
148
],
[
148,
149
],
[
148,
150
],
[
150,
151
],
[
151,
152
],
[
152,
153
],
[
152,
154
],
[
151,
155
],
[
155,
156
],
[
156,
157
],
[
157,
158
],
[
157,
159
],
[
159,
160
],
[
160,
161
],
[
161,
162
],
[
156,
163
],
[
163,
164
],
[
164,
165
],
[
164,
166
],
[
155,
167
],
[
167,
168
],
[
168,
169
],
[
169,
170
],
[
169,
171
],
[
167,
172
],
[
151,
173
],
[
173,
174
],
[
174,
175
],
[
174,
176
],
[
176,
177
],
[
176,
178
],
[
150,
179
],
[
179,
180
],
[
179,
181
],
[
150,
182
],
[
182,
183
],
[
182,
184
],
[
150,
185
],
[
185,
186
],
[
670,
187
],
[
187,
188
],
[
187,
189
],
[
189,
190
],
[
190,
191
],
[
191,
192
],
[
187,
193
],
[
193,
194
],
[
0,
195
],
[
195,
196
],
[
195,
197
],
[
197,
198
],
[
195,
199
],
[
199,
200
],
[
199,
201
],
[
195,
203
],
[
203,
204
],
[
195,
205
],
[
205,
206
],
[
195,
207
],
[
207,
208
],
[
207,
209
],
[
209,
210
],
[
210,
211
],
[
211,
212
],
[
211,
213
],
[
210,
214
],
[
207,
215
],
[
215,
216
],
[
195,
217
],
[
217,
218
],
[
217,
219
],
[
219,
220
],
[
220,
221
],
[
221,
222
],
[
221,
223
],
[
223,
224
],
[
220,
225
],
[
225,
226
],
[
219,
227
],
[
227,
228
],
[
228,
229
],
[
228,
230
],
[
227,
231
],
[
231,
232
],
[
232,
233
],
[
232,
234
],
[
231,
235
],
[
235,
236
],
[
236,
237
],
[
236,
238
],
[
238,
239
],
[
239,
240
],
[
235,
241
],
[
241,
242
],
[
242,
243
],
[
242,
244
],
[
244,
245
],
[
245,
246
],
[
244,
247
],
[
231,
248
],
[
248,
249
],
[
249,
250
],
[
249,
251
],
[
248,
252
],
[
252,
253
],
[
253,
254
],
[
219,
255
],
[
255,
256
],
[
256,
257
],
[
256,
258
],
[
258,
259
],
[
195,
260
],
[
260,
261
],
[
260,
262
],
[
262,
263
],
[
263,
264
],
[
267,
265
],
[
277,
266
],
[
274,
267
],
[
267,
268
],
[
268,
269
],
[
268,
270
],
[
267,
271
],
[
271,
272
],
[
271,
273
],
[
274,
274
],
[
274,
275
],
[
274,
276
],
[
277,
277
],
[
277,
278
],
[
277,
279
],
[
267,
280
],
[
280,
281
],
[
280,
282
],
[
282,
283
],
[
260,
284
],
[
284,
285
],
[
195,
286
],
[
286,
287
],
[
286,
288
],
[
288,
289
],
[
289,
290
],
[
291,
291
],
[
291,
292
],
[
292,
293
],
[
292,
294
],
[
291,
295
],
[
295,
296
],
[
295,
297
],
[
291,
298
],
[
298,
299
],
[
298,
300
],
[
300,
301
],
[
286,
302
],
[
302,
303
],
[
195,
304
],
[
304,
305
],
[
304,
306
],
[
306,
307
],
[
307,
308
],
[
308,
309
],
[
309,
310
],
[
308,
311
],
[
311,
312
],
[
195,
313
],
[
313,
314
],
[
313,
315
],
[
315,
316
],
[
316,
317
],
[
316,
318
],
[
315,
320
],
[
320,
321
],
[
321,
322
],
[
322,
323
],
[
322,
324
],
[
320,
325
],
[
325,
326
],
[
325,
327
],
[
320,
328
],
[
328,
329
],
[
329,
330
],
[
320,
331
],
[
331,
332
],
[
332,
333
],
[
333,
334
],
[
333,
335
],
[
332,
336
],
[
336,
337
],
[
315,
338
],
[
338,
339
],
[
313,
340
],
[
340,
341
],
[
195,
342
],
[
342,
343
],
[
342,
344
],
[
344,
345
],
[
345,
346
],
[
345,
347
],
[
344,
350
],
[
350,
351
],
[
351,
352
],
[
352,
353
],
[
352,
354
],
[
350,
355
],
[
355,
356
],
[
355,
357
],
[
350,
358
],
[
358,
359
],
[
359,
360
],
[
350,
361
],
[
362,
362
],
[
362,
363
],
[
363,
364
],
[
364,
365
],
[
364,
366
],
[
363,
367
],
[
367,
368
],
[
367,
369
],
[
344,
370
],
[
370,
371
],
[
342,
372
],
[
372,
373
],
[
342,
374
],
[
374,
375
],
[
195,
376
],
[
376,
377
],
[
376,
378
],
[
378,
379
],
[
379,
380
],
[
380,
381
],
[
381,
382
],
[
380,
383
],
[
383,
384
],
[
195,
385
],
[
385,
386
],
[
385,
387
],
[
387,
388
],
[
388,
389
],
[
388,
390
],
[
387,
392
],
[
392,
393
],
[
393,
394
],
[
394,
395
],
[
394,
396
],
[
392,
397
],
[
397,
398
],
[
397,
399
],
[
392,
400
],
[
400,
401
],
[
401,
402
],
[
392,
403
],
[
403,
404
],
[
404,
405
],
[
405,
406
],
[
405,
407
],
[
404,
408
],
[
408,
409
],
[
387,
410
],
[
410,
411
],
[
385,
412
],
[
412,
413
],
[
195,
414
],
[
414,
415
],
[
414,
416
],
[
416,
417
],
[
417,
418
],
[
417,
419
],
[
416,
422
],
[
422,
423
],
[
423,
424
],
[
424,
425
],
[
424,
426
],
[
422,
427
],
[
427,
428
],
[
427,
429
],
[
422,
430
],
[
430,
431
],
[
431,
432
],
[
422,
433
],
[
434,
434
],
[
434,
435
],
[
435,
436
],
[
436,
437
],
[
436,
438
],
[
435,
439
],
[
439,
440
],
[
439,
441
],
[
416,
442
],
[
442,
443
],
[
414,
444
],
[
444,
445
],
[
414,
446
],
[
446,
447
],
[
195,
448
],
[
448,
449
],
[
448,
450
],
[
450,
451
],
[
451,
452
],
[
452,
453
],
[
453,
454
],
[
452,
455
],
[
455,
456
],
[
195,
457
],
[
457,
458
],
[
457,
459
],
[
459,
460
],
[
460,
461
],
[
460,
462
],
[
459,
464
],
[
464,
465
],
[
465,
466
],
[
466,
467
],
[
466,
468
],
[
464,
469
],
[
469,
470
],
[
469,
471
],
[
464,
472
],
[
472,
473
],
[
473,
474
],
[
464,
475
],
[
475,
476
],
[
476,
477
],
[
477,
478
],
[
477,
479
],
[
476,
480
],
[
480,
481
],
[
459,
482
],
[
482,
483
],
[
457,
484
],
[
484,
485
],
[
195,
486
],
[
486,
487
],
[
486,
488
],
[
488,
489
],
[
489,
490
],
[
489,
491
],
[
488,
494
],
[
494,
495
],
[
495,
496
],
[
496,
497
],
[
496,
498
],
[
494,
499
],
[
499,
500
],
[
499,
501
],
[
494,
502
],
[
502,
503
],
[
503,
504
],
[
494,
505
],
[
506,
506
],
[
506,
507
],
[
507,
508
],
[
508,
509
],
[
508,
510
],
[
507,
511
],
[
511,
512
],
[
511,
513
],
[
488,
514
],
[
514,
515
],
[
486,
516
],
[
516,
517
],
[
486,
518
],
[
518,
519
],
[
195,
520
],
[
520,
521
],
[
520,
522
],
[
522,
523
],
[
523,
524
],
[
523,
525
],
[
525,
526
],
[
522,
527
],
[
527,
528
],
[
528,
529
],
[
528,
530
],
[
527,
531
],
[
531,
532
],
[
531,
533
],
[
533,
534
],
[
522,
535
],
[
535,
536
],
[
535,
537
],
[
522,
538
],
[
538,
539
],
[
539,
540
],
[
540,
541
],
[
540,
542
],
[
538,
543
],
[
543,
544
],
[
544,
545
],
[
545,
546
],
[
544,
547
],
[
543,
548
],
[
548,
549
],
[
548,
550
],
[
550,
551
],
[
522,
552
],
[
552,
553
],
[
553,
554
],
[
554,
555
],
[
195,
556
],
[
556,
557
],
[
556,
558
],
[
558,
559
],
[
559,
560
],
[
559,
561
],
[
558,
563
],
[
563,
564
],
[
564,
565
],
[
565,
566
],
[
565,
567
],
[
563,
568
],
[
568,
569
],
[
568,
570
],
[
563,
571
],
[
571,
572
],
[
572,
573
],
[
563,
574
],
[
574,
575
],
[
575,
576
],
[
576,
577
],
[
576,
578
],
[
575,
579
],
[
579,
580
],
[
558,
581
],
[
581,
582
],
[
556,
583
],
[
583,
584
],
[
195,
585
],
[
585,
586
],
[
585,
587
],
[
587,
588
],
[
588,
589
],
[
588,
590
],
[
590,
591
],
[
587,
592
],
[
592,
593
],
[
593,
594
],
[
593,
595
],
[
592,
596
],
[
596,
597
],
[
596,
598
],
[
598,
599
],
[
587,
600
],
[
600,
601
],
[
600,
602
],
[
587,
603
],
[
603,
604
],
[
604,
605
],
[
605,
606
],
[
605,
607
],
[
603,
608
],
[
608,
609
],
[
609,
610
],
[
610,
611
],
[
609,
612
],
[
608,
613
],
[
613,
614
],
[
613,
615
],
[
615,
616
],
[
587,
617
],
[
617,
618
],
[
618,
619
],
[
619,
620
],
[
195,
621
],
[
621,
622
],
[
621,
623
],
[
623,
624
],
[
624,
625
],
[
624,
626
],
[
623,
629
],
[
629,
630
],
[
630,
631
],
[
631,
632
],
[
631,
633
],
[
629,
634
],
[
634,
635
],
[
634,
636
],
[
629,
637
],
[
637,
638
],
[
638,
639
],
[
629,
640
],
[
641,
641
],
[
641,
642
],
[
642,
643
],
[
643,
644
],
[
644,
645
],
[
644,
646
],
[
642,
647
],
[
647,
648
],
[
647,
649
],
[
642,
650
],
[
650,
651
],
[
651,
652
],
[
642,
653
],
[
654,
654
],
[
654,
655
],
[
655,
656
],
[
656,
657
],
[
657,
658
],
[
657,
659
],
[
656,
660
],
[
655,
661
],
[
661,
662
],
[
623,
663
],
[
663,
664
],
[
621,
665
],
[
665,
666
],
[
621,
667
],
[
667,
668
],
[
0,
669
],
[
669,
670
],
[
669,
671
]
]
| [
"import java.io.PrintWriter;\nimport java.io.FileNotFoundException;\nimport java.util.InputMismatchException;\nimport java.io.InputStream;\nimport java.io.FileInputStream;\nimport java.io.IOException;\n\npublic class Main {\n InputStream is;\n\n int __t__ = 1;\n int __f__ = 0;\n int __FILE_DEBUG_FLAG__ = __f__;\n String __DEBUG_FILE_NAME__ = \"src/main/java/A1\";\n\n FastScanner in;\n PrintWriter out;\n\n public void solve() {\n String s = in.next();\n String t = in.next();\n int res = t.length();\n for (int i = 0; i < s.length(); i++) {\n for (int j = i + 1; j <= s.length(); j++) {\n String u = s.substring(i, j);\n if (u.length() != t.length()) continue;\n\n int cnt = 0;\n for (int k = 0; k < u.length(); k++) {\n if (u.charAt(k) != t.charAt(k)) cnt++;\n }\n res = Math.min(res, cnt);\n }\n }\n System.out.println(res);\n }\n\n public void run() {\n if (__FILE_DEBUG_FLAG__ == __t__) {\n try {\n is = new FileInputStream(__DEBUG_FILE_NAME__);\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n System.out.println(\"FILE_INPUT!\");\n } else {\n is = System.in;\n }\n in = new FastScanner(is);\n out = new PrintWriter(System.out);\n\n solve();\n }\n\n public static void main(final String[] args) {\n new Main().run();\n }\n}\n\n\nclass FastScanner {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public FastScanner(InputStream stream) {\n this.stream = stream;\n // stream = new FileInputStream(new File(\"dec.in\"));\n }\n\n int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public boolean isEndline(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public int[] nextIntArray(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++)\n array[i] = nextInt();\n\n return array;\n }\n\n public int[][] nextIntMap(int n, int m) {\n int[][] map = new int[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = nextIntArray(m);\n }\n return map;\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public long[] nextLongArray(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++)\n array[i] = nextLong();\n\n return array;\n }\n\n public long[][] nextLongMap(int n, int m) {\n long[][] map = new long[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = nextLongArray(m);\n }\n return map;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public double[] nextDoubleArray(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++)\n array[i] = nextDouble();\n\n return array;\n }\n\n public double[][] nextDoubleMap(int n, int m) {\n double[][] map = new double[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = nextDoubleArray(m);\n }\n return map;\n }\n\n public String next() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public String[] nextStringArray(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++)\n array[i] = next();\n\n return array;\n }\n\n public String nextLine() {\n int c = read();\n while (isEndline(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isEndline(c));\n return res.toString();\n }\n\n public int[][] nextPackedIntArrays(int packN, int size) {\n int[][] res = new int[packN][size];\n for (int i = 0; i < size; i++) {\n for (int j = 0; j < packN; j++) {\n res[j][i] = nextInt();\n }\n }\n return res;\n }\n}",
"import java.io.PrintWriter;",
"PrintWriter",
"java.io",
"import java.io.FileNotFoundException;",
"FileNotFoundException",
"java.io",
"import java.util.InputMismatchException;",
"InputMismatchException",
"java.util",
"import java.io.InputStream;",
"InputStream",
"java.io",
"import java.io.FileInputStream;",
"FileInputStream",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"public class Main {\n InputStream is;\n\n int __t__ = 1;\n int __f__ = 0;\n int __FILE_DEBUG_FLAG__ = __f__;\n String __DEBUG_FILE_NAME__ = \"src/main/java/A1\";\n\n FastScanner in;\n PrintWriter out;\n\n public void solve() {\n String s = in.next();\n String t = in.next();\n int res = t.length();\n for (int i = 0; i < s.length(); i++) {\n for (int j = i + 1; j <= s.length(); j++) {\n String u = s.substring(i, j);\n if (u.length() != t.length()) continue;\n\n int cnt = 0;\n for (int k = 0; k < u.length(); k++) {\n if (u.charAt(k) != t.charAt(k)) cnt++;\n }\n res = Math.min(res, cnt);\n }\n }\n System.out.println(res);\n }\n\n public void run() {\n if (__FILE_DEBUG_FLAG__ == __t__) {\n try {\n is = new FileInputStream(__DEBUG_FILE_NAME__);\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n System.out.println(\"FILE_INPUT!\");\n } else {\n is = System.in;\n }\n in = new FastScanner(is);\n out = new PrintWriter(System.out);\n\n solve();\n }\n\n public static void main(final String[] args) {\n new Main().run();\n }\n}",
"Main",
"InputStream is;",
"is",
"int __t__ = 1;",
"__t__",
"1",
"int __f__ = 0;",
"__f__",
"0",
"int __FILE_DEBUG_FLAG__ = __f__;",
"__FILE_DEBUG_FLAG__",
"__f__",
"String __DEBUG_FILE_NAME__ = \"src/main/java/A1\";",
"__DEBUG_FILE_NAME__",
"\"src/main/java/A1\"",
"FastScanner in;",
"in",
"PrintWriter out;",
"out",
"public void solve() {\n String s = in.next();\n String t = in.next();\n int res = t.length();\n for (int i = 0; i < s.length(); i++) {\n for (int j = i + 1; j <= s.length(); j++) {\n String u = s.substring(i, j);\n if (u.length() != t.length()) continue;\n\n int cnt = 0;\n for (int k = 0; k < u.length(); k++) {\n if (u.charAt(k) != t.charAt(k)) cnt++;\n }\n res = Math.min(res, cnt);\n }\n }\n System.out.println(res);\n }",
"solve",
"{\n String s = in.next();\n String t = in.next();\n int res = t.length();\n for (int i = 0; i < s.length(); i++) {\n for (int j = i + 1; j <= s.length(); j++) {\n String u = s.substring(i, j);\n if (u.length() != t.length()) continue;\n\n int cnt = 0;\n for (int k = 0; k < u.length(); k++) {\n if (u.charAt(k) != t.charAt(k)) cnt++;\n }\n res = Math.min(res, cnt);\n }\n }\n System.out.println(res);\n }",
"String s = in.next();",
"s",
"in.next()",
"in.next",
"in",
"String t = in.next();",
"t",
"in.next()",
"in.next",
"in",
"int res = t.length();",
"res",
"t.length()",
"t.length",
"t",
"for (int i = 0; i < s.length(); i++) {\n for (int j = i + 1; j <= s.length(); j++) {\n String u = s.substring(i, j);\n if (u.length() != t.length()) continue;\n\n int cnt = 0;\n for (int k = 0; k < u.length(); k++) {\n if (u.charAt(k) != t.charAt(k)) cnt++;\n }\n res = Math.min(res, cnt);\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < s.length()",
"i",
"s.length()",
"s.length",
"s",
"i++",
"i++",
"i",
"{\n for (int j = i + 1; j <= s.length(); j++) {\n String u = s.substring(i, j);\n if (u.length() != t.length()) continue;\n\n int cnt = 0;\n for (int k = 0; k < u.length(); k++) {\n if (u.charAt(k) != t.charAt(k)) cnt++;\n }\n res = Math.min(res, cnt);\n }\n }",
"{\n for (int j = i + 1; j <= s.length(); j++) {\n String u = s.substring(i, j);\n if (u.length() != t.length()) continue;\n\n int cnt = 0;\n for (int k = 0; k < u.length(); k++) {\n if (u.charAt(k) != t.charAt(k)) cnt++;\n }\n res = Math.min(res, cnt);\n }\n }",
"for (int j = i + 1; j <= s.length(); j++) {\n String u = s.substring(i, j);\n if (u.length() != t.length()) continue;\n\n int cnt = 0;\n for (int k = 0; k < u.length(); k++) {\n if (u.charAt(k) != t.charAt(k)) cnt++;\n }\n res = Math.min(res, cnt);\n }",
"int j = i + 1;",
"int j = i + 1;",
"j",
"i + 1",
"i",
"1",
"j <= s.length()",
"j",
"s.length()",
"s.length",
"s",
"j++",
"j++",
"j",
"{\n String u = s.substring(i, j);\n if (u.length() != t.length()) continue;\n\n int cnt = 0;\n for (int k = 0; k < u.length(); k++) {\n if (u.charAt(k) != t.charAt(k)) cnt++;\n }\n res = Math.min(res, cnt);\n }",
"{\n String u = s.substring(i, j);\n if (u.length() != t.length()) continue;\n\n int cnt = 0;\n for (int k = 0; k < u.length(); k++) {\n if (u.charAt(k) != t.charAt(k)) cnt++;\n }\n res = Math.min(res, cnt);\n }",
"String u = s.substring(i, j);",
"u",
"s.substring(i, j)",
"s.substring",
"s",
"i",
"j",
"if (u.length() != t.length()) continue;",
"u.length() != t.length()",
"u.length()",
"u.length",
"u",
"t.length()",
"t.length",
"t",
"continue;",
"int cnt = 0;",
"cnt",
"0",
"for (int k = 0; k < u.length(); k++) {\n if (u.charAt(k) != t.charAt(k)) cnt++;\n }",
"int k = 0;",
"int k = 0;",
"k",
"0",
"k < u.length()",
"k",
"u.length()",
"u.length",
"u",
"k++",
"k++",
"k",
"{\n if (u.charAt(k) != t.charAt(k)) cnt++;\n }",
"{\n if (u.charAt(k) != t.charAt(k)) cnt++;\n }",
"if (u.charAt(k) != t.charAt(k)) cnt++;",
"u.charAt(k) != t.charAt(k)",
"u.charAt(k)",
"u.charAt",
"u",
"k",
"t.charAt(k)",
"t.charAt",
"t",
"k",
"cnt++",
"cnt",
"res = Math.min(res, cnt)",
"res",
"Math.min(res, cnt)",
"Math.min",
"Math",
"res",
"cnt",
"System.out.println(res)",
"System.out.println",
"System.out",
"System",
"System.out",
"res",
"public void run() {\n if (__FILE_DEBUG_FLAG__ == __t__) {\n try {\n is = new FileInputStream(__DEBUG_FILE_NAME__);\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n System.out.println(\"FILE_INPUT!\");\n } else {\n is = System.in;\n }\n in = new FastScanner(is);\n out = new PrintWriter(System.out);\n\n solve();\n }",
"run",
"{\n if (__FILE_DEBUG_FLAG__ == __t__) {\n try {\n is = new FileInputStream(__DEBUG_FILE_NAME__);\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n System.out.println(\"FILE_INPUT!\");\n } else {\n is = System.in;\n }\n in = new FastScanner(is);\n out = new PrintWriter(System.out);\n\n solve();\n }",
"if (__FILE_DEBUG_FLAG__ == __t__) {\n try {\n is = new FileInputStream(__DEBUG_FILE_NAME__);\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n System.out.println(\"FILE_INPUT!\");\n } else {\n is = System.in;\n }",
"__FILE_DEBUG_FLAG__ == __t__",
"__FILE_DEBUG_FLAG__",
"__t__",
"{\n try {\n is = new FileInputStream(__DEBUG_FILE_NAME__);\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n System.out.println(\"FILE_INPUT!\");\n }",
"try {\n is = new FileInputStream(__DEBUG_FILE_NAME__);\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }",
"catch (FileNotFoundException e) {\n e.printStackTrace();\n }",
"FileNotFoundException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n is = new FileInputStream(__DEBUG_FILE_NAME__);\n }",
"is = new FileInputStream(__DEBUG_FILE_NAME__)",
"is",
"new FileInputStream(__DEBUG_FILE_NAME__)",
"System.out.println(\"FILE_INPUT!\")",
"System.out.println",
"System.out",
"System",
"System.out",
"\"FILE_INPUT!\"",
"{\n is = System.in;\n }",
"is = System.in",
"is",
"System.in",
"System",
"System.in",
"in = new FastScanner(is)",
"in",
"new FastScanner(is)",
"out = new PrintWriter(System.out)",
"out",
"new PrintWriter(System.out)",
"solve()",
"solve",
"public static void main(final String[] args) {\n new Main().run();\n }",
"main",
"{\n new Main().run();\n }",
"new Main().run()",
"new Main().run",
"new Main()",
"final String[] args",
"args",
"class FastScanner {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public FastScanner(InputStream stream) {\n this.stream = stream;\n // stream = new FileInputStream(new File(\"dec.in\"));\n }\n\n int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public boolean isEndline(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public int[] nextIntArray(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++)\n array[i] = nextInt();\n\n return array;\n }\n\n public int[][] nextIntMap(int n, int m) {\n int[][] map = new int[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = nextIntArray(m);\n }\n return map;\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public long[] nextLongArray(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++)\n array[i] = nextLong();\n\n return array;\n }\n\n public long[][] nextLongMap(int n, int m) {\n long[][] map = new long[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = nextLongArray(m);\n }\n return map;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public double[] nextDoubleArray(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++)\n array[i] = nextDouble();\n\n return array;\n }\n\n public double[][] nextDoubleMap(int n, int m) {\n double[][] map = new double[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = nextDoubleArray(m);\n }\n return map;\n }\n\n public String next() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public String[] nextStringArray(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++)\n array[i] = next();\n\n return array;\n }\n\n public String nextLine() {\n int c = read();\n while (isEndline(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isEndline(c));\n return res.toString();\n }\n\n public int[][] nextPackedIntArrays(int packN, int size) {\n int[][] res = new int[packN][size];\n for (int i = 0; i < size; i++) {\n for (int j = 0; j < packN; j++) {\n res[j][i] = nextInt();\n }\n }\n return res;\n }\n}",
"FastScanner",
"private InputStream stream;",
"stream",
"private byte[] buf = new byte[1024];",
"buf",
"new byte[1024]",
"1024",
"private int curChar;",
"curChar",
"private int numChars;",
"numChars",
"public FastScanner(InputStream stream) {\n this.stream = stream;\n // stream = new FileInputStream(new File(\"dec.in\"));\n }",
"FastScanner",
"{\n this.stream = stream;\n // stream = new FileInputStream(new File(\"dec.in\"));\n }",
"this.stream = stream",
"this.stream",
"this",
"this.stream",
"stream",
"InputStream stream",
"stream",
"int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }",
"read",
"{\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }",
"if (numChars == -1)\n throw new InputMismatchException();",
"numChars == -1",
"numChars",
"-1",
"1",
"throw new InputMismatchException();",
"new InputMismatchException()",
"if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }",
"curChar >= numChars",
"curChar",
"numChars",
"{\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }",
"curChar = 0",
"curChar",
"0",
"try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }",
"catch (IOException e) {\n throw new InputMismatchException();\n }",
"IOException e",
"{\n throw new InputMismatchException();\n }",
"throw new InputMismatchException();",
"new InputMismatchException()",
"{\n numChars = stream.read(buf);\n }",
"numChars = stream.read(buf)",
"numChars",
"stream.read(buf)",
"stream.read",
"stream",
"buf",
"if (numChars <= 0)\n return -1;",
"numChars <= 0",
"numChars",
"0",
"return -1;",
"-1",
"1",
"return buf[curChar++];",
"buf[curChar++]",
"buf",
"curChar++",
"curChar",
"public boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }",
"isSpaceChar",
"{\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }",
"return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;",
"c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1",
"c == '\\t'",
"c == '\\r'",
"c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1",
"c == ' '",
"c",
"' '",
"c == '\\n'",
"c",
"'\\n'",
"c == '\\r'",
"c",
"'\\r'",
"c == '\\t'",
"c",
"'\\t'",
"c == -1",
"c",
"-1",
"1",
"int c",
"c",
"public boolean isEndline(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }",
"isEndline",
"{\n return c == '\\n' || c == '\\r' || c == -1;\n }",
"return c == '\\n' || c == '\\r' || c == -1;",
"c == '\\n' || c == '\\r' || c == -1",
"c == '\\n' || c == '\\r' || c == -1",
"c == '\\n'",
"c",
"'\\n'",
"c == '\\r'",
"c",
"'\\r'",
"c == -1",
"c",
"-1",
"1",
"int c",
"c",
"public int nextInt() {\n return Integer.parseInt(next());\n }",
"nextInt",
"{\n return Integer.parseInt(next());\n }",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"public int[] nextIntArray(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++)\n array[i] = nextInt();\n\n return array;\n }",
"nextIntArray",
"{\n int[] array = new int[n];\n for (int i = 0; i < n; i++)\n array[i] = nextInt();\n\n return array;\n }",
"int[] array = new int[n];",
"array",
"new int[n]",
"n",
"for (int i = 0; i < n; i++)\n array[i] = nextInt();",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"array[i] = nextInt();",
"array[i] = nextInt()",
"array[i]",
"array",
"i",
"nextInt()",
"nextInt",
"return array;",
"array",
"int n",
"n",
"public int[][] nextIntMap(int n, int m) {\n int[][] map = new int[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = nextIntArray(m);\n }\n return map;\n }",
"nextIntMap",
"{\n int[][] map = new int[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = nextIntArray(m);\n }\n return map;\n }",
"int[][] map = new int[n][m];",
"map",
"new int[n][m]",
"n",
"m",
"for (int i = 0; i < n; i++) {\n map[i] = nextIntArray(m);\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n map[i] = nextIntArray(m);\n }",
"{\n map[i] = nextIntArray(m);\n }",
"map[i] = nextIntArray(m)",
"map[i]",
"map",
"i",
"nextIntArray(m)",
"nextIntArray",
"m",
"return map;",
"map",
"int n",
"n",
"int m",
"m",
"public long nextLong() {\n return Long.parseLong(next());\n }",
"nextLong",
"{\n return Long.parseLong(next());\n }",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"public long[] nextLongArray(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++)\n array[i] = nextLong();\n\n return array;\n }",
"nextLongArray",
"{\n long[] array = new long[n];\n for (int i = 0; i < n; i++)\n array[i] = nextLong();\n\n return array;\n }",
"long[] array = new long[n];",
"array",
"new long[n]",
"n",
"for (int i = 0; i < n; i++)\n array[i] = nextLong();",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"array[i] = nextLong();",
"array[i] = nextLong()",
"array[i]",
"array",
"i",
"nextLong()",
"nextLong",
"return array;",
"array",
"int n",
"n",
"public long[][] nextLongMap(int n, int m) {\n long[][] map = new long[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = nextLongArray(m);\n }\n return map;\n }",
"nextLongMap",
"{\n long[][] map = new long[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = nextLongArray(m);\n }\n return map;\n }",
"long[][] map = new long[n][m];",
"map",
"new long[n][m]",
"n",
"m",
"for (int i = 0; i < n; i++) {\n map[i] = nextLongArray(m);\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n map[i] = nextLongArray(m);\n }",
"{\n map[i] = nextLongArray(m);\n }",
"map[i] = nextLongArray(m)",
"map[i]",
"map",
"i",
"nextLongArray(m)",
"nextLongArray",
"m",
"return map;",
"map",
"int n",
"n",
"int m",
"m",
"public double nextDouble() {\n return Double.parseDouble(next());\n }",
"nextDouble",
"{\n return Double.parseDouble(next());\n }",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"public double[] nextDoubleArray(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++)\n array[i] = nextDouble();\n\n return array;\n }",
"nextDoubleArray",
"{\n double[] array = new double[n];\n for (int i = 0; i < n; i++)\n array[i] = nextDouble();\n\n return array;\n }",
"double[] array = new double[n];",
"array",
"new double[n]",
"n",
"for (int i = 0; i < n; i++)\n array[i] = nextDouble();",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"array[i] = nextDouble();",
"array[i] = nextDouble()",
"array[i]",
"array",
"i",
"nextDouble()",
"nextDouble",
"return array;",
"array",
"int n",
"n",
"public double[][] nextDoubleMap(int n, int m) {\n double[][] map = new double[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = nextDoubleArray(m);\n }\n return map;\n }",
"nextDoubleMap",
"{\n double[][] map = new double[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = nextDoubleArray(m);\n }\n return map;\n }",
"double[][] map = new double[n][m];",
"map",
"new double[n][m]",
"n",
"m",
"for (int i = 0; i < n; i++) {\n map[i] = nextDoubleArray(m);\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n map[i] = nextDoubleArray(m);\n }",
"{\n map[i] = nextDoubleArray(m);\n }",
"map[i] = nextDoubleArray(m)",
"map[i]",
"map",
"i",
"nextDoubleArray(m)",
"nextDoubleArray",
"m",
"return map;",
"map",
"int n",
"n",
"int m",
"m",
"public String next() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }",
"next",
"{\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }",
"int c = read();",
"c",
"read()",
"read",
"while (isSpaceChar(c))\n c = read();",
"isSpaceChar(c)",
"isSpaceChar",
"c",
"c = read()",
"c",
"read()",
"read",
"StringBuilder res = new StringBuilder();",
"res",
"new StringBuilder()",
"do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));",
"!isSpaceChar(c)",
"isSpaceChar(c)",
"isSpaceChar",
"c",
"{\n res.appendCodePoint(c);\n c = read();\n }",
"res.appendCodePoint(c)",
"res.appendCodePoint",
"res",
"c",
"c = read()",
"c",
"read()",
"read",
"return res.toString();",
"res.toString()",
"res.toString",
"res",
"public String[] nextStringArray(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++)\n array[i] = next();\n\n return array;\n }",
"nextStringArray",
"{\n String[] array = new String[n];\n for (int i = 0; i < n; i++)\n array[i] = next();\n\n return array;\n }",
"String[] array = new String[n];",
"array",
"new String[n]",
"n",
"for (int i = 0; i < n; i++)\n array[i] = next();",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"array[i] = next();",
"array[i] = next()",
"array[i]",
"array",
"i",
"next()",
"next",
"return array;",
"array",
"int n",
"n",
"public String nextLine() {\n int c = read();\n while (isEndline(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isEndline(c));\n return res.toString();\n }",
"nextLine",
"{\n int c = read();\n while (isEndline(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isEndline(c));\n return res.toString();\n }",
"int c = read();",
"c",
"read()",
"read",
"while (isEndline(c))\n c = read();",
"isEndline(c)",
"isEndline",
"c",
"c = read()",
"c",
"read()",
"read",
"StringBuilder res = new StringBuilder();",
"res",
"new StringBuilder()",
"do {\n res.appendCodePoint(c);\n c = read();\n } while (!isEndline(c));",
"!isEndline(c)",
"isEndline(c)",
"isEndline",
"c",
"{\n res.appendCodePoint(c);\n c = read();\n }",
"res.appendCodePoint(c)",
"res.appendCodePoint",
"res",
"c",
"c = read()",
"c",
"read()",
"read",
"return res.toString();",
"res.toString()",
"res.toString",
"res",
"public int[][] nextPackedIntArrays(int packN, int size) {\n int[][] res = new int[packN][size];\n for (int i = 0; i < size; i++) {\n for (int j = 0; j < packN; j++) {\n res[j][i] = nextInt();\n }\n }\n return res;\n }",
"nextPackedIntArrays",
"{\n int[][] res = new int[packN][size];\n for (int i = 0; i < size; i++) {\n for (int j = 0; j < packN; j++) {\n res[j][i] = nextInt();\n }\n }\n return res;\n }",
"int[][] res = new int[packN][size];",
"res",
"new int[packN][size]",
"packN",
"size",
"for (int i = 0; i < size; i++) {\n for (int j = 0; j < packN; j++) {\n res[j][i] = nextInt();\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < size",
"i",
"size",
"i++",
"i++",
"i",
"{\n for (int j = 0; j < packN; j++) {\n res[j][i] = nextInt();\n }\n }",
"{\n for (int j = 0; j < packN; j++) {\n res[j][i] = nextInt();\n }\n }",
"for (int j = 0; j < packN; j++) {\n res[j][i] = nextInt();\n }",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < packN",
"j",
"packN",
"j++",
"j++",
"j",
"{\n res[j][i] = nextInt();\n }",
"{\n res[j][i] = nextInt();\n }",
"res[j][i] = nextInt()",
"res[j][i]",
"res[j]",
"res",
"j",
"i",
"nextInt()",
"nextInt",
"return res;",
"res",
"int packN",
"packN",
"int size",
"size",
"public class Main {\n InputStream is;\n\n int __t__ = 1;\n int __f__ = 0;\n int __FILE_DEBUG_FLAG__ = __f__;\n String __DEBUG_FILE_NAME__ = \"src/main/java/A1\";\n\n FastScanner in;\n PrintWriter out;\n\n public void solve() {\n String s = in.next();\n String t = in.next();\n int res = t.length();\n for (int i = 0; i < s.length(); i++) {\n for (int j = i + 1; j <= s.length(); j++) {\n String u = s.substring(i, j);\n if (u.length() != t.length()) continue;\n\n int cnt = 0;\n for (int k = 0; k < u.length(); k++) {\n if (u.charAt(k) != t.charAt(k)) cnt++;\n }\n res = Math.min(res, cnt);\n }\n }\n System.out.println(res);\n }\n\n public void run() {\n if (__FILE_DEBUG_FLAG__ == __t__) {\n try {\n is = new FileInputStream(__DEBUG_FILE_NAME__);\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n System.out.println(\"FILE_INPUT!\");\n } else {\n is = System.in;\n }\n in = new FastScanner(is);\n out = new PrintWriter(System.out);\n\n solve();\n }\n\n public static void main(final String[] args) {\n new Main().run();\n }\n}",
"public class Main {\n InputStream is;\n\n int __t__ = 1;\n int __f__ = 0;\n int __FILE_DEBUG_FLAG__ = __f__;\n String __DEBUG_FILE_NAME__ = \"src/main/java/A1\";\n\n FastScanner in;\n PrintWriter out;\n\n public void solve() {\n String s = in.next();\n String t = in.next();\n int res = t.length();\n for (int i = 0; i < s.length(); i++) {\n for (int j = i + 1; j <= s.length(); j++) {\n String u = s.substring(i, j);\n if (u.length() != t.length()) continue;\n\n int cnt = 0;\n for (int k = 0; k < u.length(); k++) {\n if (u.charAt(k) != t.charAt(k)) cnt++;\n }\n res = Math.min(res, cnt);\n }\n }\n System.out.println(res);\n }\n\n public void run() {\n if (__FILE_DEBUG_FLAG__ == __t__) {\n try {\n is = new FileInputStream(__DEBUG_FILE_NAME__);\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n System.out.println(\"FILE_INPUT!\");\n } else {\n is = System.in;\n }\n in = new FastScanner(is);\n out = new PrintWriter(System.out);\n\n solve();\n }\n\n public static void main(final String[] args) {\n new Main().run();\n }\n}",
"Main"
]
| import java.io.PrintWriter;
import java.io.FileNotFoundException;
import java.util.InputMismatchException;
import java.io.InputStream;
import java.io.FileInputStream;
import java.io.IOException;
public class Main {
InputStream is;
int __t__ = 1;
int __f__ = 0;
int __FILE_DEBUG_FLAG__ = __f__;
String __DEBUG_FILE_NAME__ = "src/main/java/A1";
FastScanner in;
PrintWriter out;
public void solve() {
String s = in.next();
String t = in.next();
int res = t.length();
for (int i = 0; i < s.length(); i++) {
for (int j = i + 1; j <= s.length(); j++) {
String u = s.substring(i, j);
if (u.length() != t.length()) continue;
int cnt = 0;
for (int k = 0; k < u.length(); k++) {
if (u.charAt(k) != t.charAt(k)) cnt++;
}
res = Math.min(res, cnt);
}
}
System.out.println(res);
}
public void run() {
if (__FILE_DEBUG_FLAG__ == __t__) {
try {
is = new FileInputStream(__DEBUG_FILE_NAME__);
} catch (FileNotFoundException e) {
e.printStackTrace();
}
System.out.println("FILE_INPUT!");
} else {
is = System.in;
}
in = new FastScanner(is);
out = new PrintWriter(System.out);
solve();
}
public static void main(final String[] args) {
new Main().run();
}
}
class FastScanner {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
public FastScanner(InputStream stream) {
this.stream = stream;
// stream = new FileInputStream(new File("dec.in"));
}
int read() {
if (numChars == -1)
throw new InputMismatchException();
if (curChar >= numChars) {
curChar = 0;
try {
numChars = stream.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (numChars <= 0)
return -1;
}
return buf[curChar++];
}
public boolean isSpaceChar(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public boolean isEndline(int c) {
return c == '\n' || c == '\r' || c == -1;
}
public int nextInt() {
return Integer.parseInt(next());
}
public int[] nextIntArray(int n) {
int[] array = new int[n];
for (int i = 0; i < n; i++)
array[i] = nextInt();
return array;
}
public int[][] nextIntMap(int n, int m) {
int[][] map = new int[n][m];
for (int i = 0; i < n; i++) {
map[i] = nextIntArray(m);
}
return map;
}
public long nextLong() {
return Long.parseLong(next());
}
public long[] nextLongArray(int n) {
long[] array = new long[n];
for (int i = 0; i < n; i++)
array[i] = nextLong();
return array;
}
public long[][] nextLongMap(int n, int m) {
long[][] map = new long[n][m];
for (int i = 0; i < n; i++) {
map[i] = nextLongArray(m);
}
return map;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public double[] nextDoubleArray(int n) {
double[] array = new double[n];
for (int i = 0; i < n; i++)
array[i] = nextDouble();
return array;
}
public double[][] nextDoubleMap(int n, int m) {
double[][] map = new double[n][m];
for (int i = 0; i < n; i++) {
map[i] = nextDoubleArray(m);
}
return map;
}
public String next() {
int c = read();
while (isSpaceChar(c))
c = read();
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
} while (!isSpaceChar(c));
return res.toString();
}
public String[] nextStringArray(int n) {
String[] array = new String[n];
for (int i = 0; i < n; i++)
array[i] = next();
return array;
}
public String nextLine() {
int c = read();
while (isEndline(c))
c = read();
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
} while (!isEndline(c));
return res.toString();
}
public int[][] nextPackedIntArrays(int packN, int size) {
int[][] res = new int[packN][size];
for (int i = 0; i < size; i++) {
for (int j = 0; j < packN; j++) {
res[j][i] = nextInt();
}
}
return res;
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
2,
4,
18,
13,
4,
18,
13,
17,
1,
40,
13,
30,
30,
41,
13,
17,
0,
13,
4,
18,
13,
13,
2,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
24,
26
],
[
8,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
29,
31
],
[
27,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
35,
36
],
[
36,
37
],
[
37,
38
],
[
35,
39
],
[
39,
40
],
[
40,
41
],
[
34,
42
],
[
27,
43
],
[
43,
44
],
[
44,
45
],
[
27,
46
],
[
47,
47
],
[
47,
48
],
[
48,
49
],
[
48,
50
],
[
47,
51
],
[
51,
52
],
[
51,
53
],
[
53,
54
],
[
54,
55
],
[
53,
56
],
[
53,
57
],
[
57,
58
],
[
57,
59
],
[
59,
60
],
[
60,
61
],
[
47,
62
],
[
62,
63
],
[
62,
64
],
[
47,
65
],
[
65,
66
],
[
66,
67
],
[
67,
68
],
[
67,
69
],
[
65,
70
],
[
70,
71
],
[
70,
72
],
[
72,
73
],
[
73,
74
],
[
65,
75
],
[
75,
76
],
[
76,
77
],
[
65,
78
],
[
79,
79
],
[
79,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
83,
84
],
[
82,
85
],
[
81,
86
],
[
86,
87
],
[
87,
88
],
[
86,
89
],
[
80,
90
],
[
90,
91
],
[
47,
92
],
[
92,
93
],
[
92,
94
],
[
94,
95
],
[
95,
96
],
[
94,
97
],
[
94,
98
],
[
8,
99
],
[
99,
100
],
[
100,
101
],
[
101,
102
],
[
101,
103
],
[
99,
104
],
[
6,
105
],
[
105,
106
]
]
| [
"import java.util.*;\nclass Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc= new Scanner(System.in);\n\t\tString s=sc.nextLine(),t=sc.nextLine();\n\t\tint max=Integer.MAX_VALUE;\n\t\t\n\t\t\t for(int i=0;i<s.length()-t.length()+1;i++)\n\t\t {\n\t\t String x=\"\";\n\t\t \t\tx+=s.substring(i, i+t.length());\n\t\t int c=0;\n\t\t for(int j=0;j<t.length();j++)\n\t\t {\n\t\t if(x.charAt(j)!=t.charAt(j))c++;\n\t\t }\n\t\t max=Math.min(max,c);\n\t\t }\n\t\tSystem.out.println(max);\n\n\t}\n\n}",
"import java.util.*;",
"util.*",
"java",
"class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc= new Scanner(System.in);\n\t\tString s=sc.nextLine(),t=sc.nextLine();\n\t\tint max=Integer.MAX_VALUE;\n\t\t\n\t\t\t for(int i=0;i<s.length()-t.length()+1;i++)\n\t\t {\n\t\t String x=\"\";\n\t\t \t\tx+=s.substring(i, i+t.length());\n\t\t int c=0;\n\t\t for(int j=0;j<t.length();j++)\n\t\t {\n\t\t if(x.charAt(j)!=t.charAt(j))c++;\n\t\t }\n\t\t max=Math.min(max,c);\n\t\t }\n\t\tSystem.out.println(max);\n\n\t}\n\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner sc= new Scanner(System.in);\n\t\tString s=sc.nextLine(),t=sc.nextLine();\n\t\tint max=Integer.MAX_VALUE;\n\t\t\n\t\t\t for(int i=0;i<s.length()-t.length()+1;i++)\n\t\t {\n\t\t String x=\"\";\n\t\t \t\tx+=s.substring(i, i+t.length());\n\t\t int c=0;\n\t\t for(int j=0;j<t.length();j++)\n\t\t {\n\t\t if(x.charAt(j)!=t.charAt(j))c++;\n\t\t }\n\t\t max=Math.min(max,c);\n\t\t }\n\t\tSystem.out.println(max);\n\n\t}",
"main",
"{\n\t\tScanner sc= new Scanner(System.in);\n\t\tString s=sc.nextLine(),t=sc.nextLine();\n\t\tint max=Integer.MAX_VALUE;\n\t\t\n\t\t\t for(int i=0;i<s.length()-t.length()+1;i++)\n\t\t {\n\t\t String x=\"\";\n\t\t \t\tx+=s.substring(i, i+t.length());\n\t\t int c=0;\n\t\t for(int j=0;j<t.length();j++)\n\t\t {\n\t\t if(x.charAt(j)!=t.charAt(j))c++;\n\t\t }\n\t\t max=Math.min(max,c);\n\t\t }\n\t\tSystem.out.println(max);\n\n\t}",
"Scanner sc= new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String s=sc.nextLine()",
"s",
"sc.nextLine()",
"sc.nextLine",
"sc",
"t=sc.nextLine();",
"t",
"sc.nextLine()",
"sc.nextLine",
"sc",
"int max=Integer.MAX_VALUE;",
"max",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"for(int i=0;i<s.length()-t.length()+1;i++)\n\t\t {\n\t\t String x=\"\";\n\t\t \t\tx+=s.substring(i, i+t.length());\n\t\t int c=0;\n\t\t for(int j=0;j<t.length();j++)\n\t\t {\n\t\t if(x.charAt(j)!=t.charAt(j))c++;\n\t\t }\n\t\t max=Math.min(max,c);\n\t\t }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<s.length()-t.length()+1",
"i",
"s.length()-t.length()+1",
"s.length()-t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"1",
"i++",
"i++",
"i",
"{\n\t\t String x=\"\";\n\t\t \t\tx+=s.substring(i, i+t.length());\n\t\t int c=0;\n\t\t for(int j=0;j<t.length();j++)\n\t\t {\n\t\t if(x.charAt(j)!=t.charAt(j))c++;\n\t\t }\n\t\t max=Math.min(max,c);\n\t\t }",
"{\n\t\t String x=\"\";\n\t\t \t\tx+=s.substring(i, i+t.length());\n\t\t int c=0;\n\t\t for(int j=0;j<t.length();j++)\n\t\t {\n\t\t if(x.charAt(j)!=t.charAt(j))c++;\n\t\t }\n\t\t max=Math.min(max,c);\n\t\t }",
"String x=\"\";",
"x",
"\"\"",
"x+=s.substring(i, i+t.length())",
"x",
"s.substring(i, i+t.length())",
"s.substring",
"s",
"i",
"i+t.length()",
"i",
"t.length()",
"t.length",
"t",
"int c=0;",
"c",
"0",
"for(int j=0;j<t.length();j++)\n\t\t {\n\t\t if(x.charAt(j)!=t.charAt(j))c++;\n\t\t }",
"int j=0;",
"int j=0;",
"j",
"0",
"j<t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n\t\t if(x.charAt(j)!=t.charAt(j))c++;\n\t\t }",
"{\n\t\t if(x.charAt(j)!=t.charAt(j))c++;\n\t\t }",
"if(x.charAt(j)!=t.charAt(j))c++;",
"x.charAt(j)!=t.charAt(j)",
"x.charAt(j)",
"x.charAt",
"x",
"j",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"c++",
"c",
"max=Math.min(max,c)",
"max",
"Math.min(max,c)",
"Math.min",
"Math",
"max",
"c",
"System.out.println(max)",
"System.out.println",
"System.out",
"System",
"System.out",
"max",
"String[] args",
"args"
]
| import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc= new Scanner(System.in);
String s=sc.nextLine(),t=sc.nextLine();
int max=Integer.MAX_VALUE;
for(int i=0;i<s.length()-t.length()+1;i++)
{
String x="";
x+=s.substring(i, i+t.length());
int c=0;
for(int j=0;j<t.length();j++)
{
if(x.charAt(j)!=t.charAt(j))c++;
}
max=Math.min(max,c);
}
System.out.println(max);
}
}
|
[
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,
4,
18,
13,
41,
13,
18,
13,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
2,
4,
18,
13,
4,
18,
13,
17,
1,
40,
13,
30,
30,
41,
13,
4,
18,
13,
13,
2,
13,
4,
18,
13,
14,
2,
13,
4,
13,
13,
13,
30,
0,
13,
4,
13,
13,
13,
0,
13,
13,
4,
18,
18,
13,
13,
2,
4,
18,
13,
4,
13,
13,
13,
23,
13,
12,
13,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
40,
13,
29,
13,
23,
13,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
41,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
29,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
231,
14
],
[
231,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
18,
20
],
[
17,
21
],
[
21,
22
],
[
21,
23
],
[
23,
24
],
[
24,
25
],
[
17,
26
],
[
26,
27
],
[
26,
28
],
[
28,
29
],
[
29,
30
],
[
17,
31
],
[
31,
32
],
[
31,
33
],
[
33,
34
],
[
33,
35
],
[
17,
36
],
[
36,
37
],
[
36,
38
],
[
17,
39
],
[
39,
40
],
[
40,
41
],
[
41,
42
],
[
41,
43
],
[
39,
44
],
[
44,
45
],
[
44,
46
],
[
46,
47
],
[
47,
48
],
[
48,
49
],
[
49,
50
],
[
47,
51
],
[
51,
52
],
[
52,
53
],
[
46,
54
],
[
39,
55
],
[
55,
56
],
[
56,
57
],
[
39,
58
],
[
59,
59
],
[
59,
60
],
[
60,
61
],
[
60,
62
],
[
62,
63
],
[
63,
64
],
[
62,
65
],
[
62,
66
],
[
66,
67
],
[
66,
68
],
[
68,
69
],
[
69,
70
],
[
59,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
74,
75
],
[
74,
76
],
[
74,
77
],
[
71,
78
],
[
78,
79
],
[
79,
80
],
[
79,
81
],
[
81,
82
],
[
81,
83
],
[
81,
84
],
[
78,
85
],
[
85,
86
],
[
85,
87
],
[
17,
88
],
[
88,
89
],
[
89,
90
],
[
90,
91
],
[
90,
92
],
[
88,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
93,
97
],
[
97,
98
],
[
97,
99
],
[
97,
100
],
[
15,
101
],
[
101,
102
],
[
231,
103
],
[
103,
104
],
[
103,
105
],
[
105,
106
],
[
106,
107
],
[
106,
108
],
[
105,
109
],
[
109,
110
],
[
110,
111
],
[
111,
112
],
[
111,
113
],
[
109,
114
],
[
114,
115
],
[
114,
116
],
[
116,
117
],
[
117,
118
],
[
109,
119
],
[
119,
120
],
[
120,
121
],
[
109,
122
],
[
123,
123
],
[
123,
124
],
[
124,
125
],
[
125,
126
],
[
126,
127
],
[
127,
128
],
[
126,
129
],
[
125,
130
],
[
130,
131
],
[
131,
132
],
[
130,
133
],
[
124,
134
],
[
134,
135
],
[
105,
136
],
[
136,
137
],
[
103,
138
],
[
138,
139
],
[
103,
140
],
[
140,
141
],
[
231,
142
],
[
142,
143
],
[
142,
144
],
[
144,
145
],
[
142,
146
],
[
146,
147
],
[
142,
148
],
[
148,
149
],
[
148,
150
],
[
150,
151
],
[
151,
152
],
[
151,
153
],
[
142,
154
],
[
154,
155
],
[
154,
156
],
[
156,
157
],
[
157,
158
],
[
158,
159
],
[
159,
160
],
[
158,
161
],
[
161,
162
],
[
142,
163
],
[
163,
164
],
[
163,
165
],
[
165,
166
],
[
166,
167
],
[
167,
168
],
[
168,
169
],
[
167,
170
],
[
170,
171
],
[
142,
172
],
[
172,
173
],
[
172,
174
],
[
174,
175
],
[
175,
176
],
[
176,
177
],
[
177,
178
],
[
176,
179
],
[
179,
180
],
[
142,
181
],
[
181,
182
],
[
181,
183
],
[
183,
184
],
[
184,
185
],
[
185,
186
],
[
186,
187
],
[
186,
188
],
[
185,
189
],
[
189,
190
],
[
190,
191
],
[
191,
192
],
[
184,
193
],
[
193,
194
],
[
194,
195
],
[
195,
196
],
[
195,
197
],
[
197,
198
],
[
198,
199
],
[
199,
200
],
[
194,
201
],
[
201,
202
],
[
202,
203
],
[
202,
204
],
[
183,
205
],
[
205,
206
],
[
206,
207
],
[
207,
208
],
[
142,
209
],
[
209,
210
],
[
209,
211
],
[
211,
212
],
[
212,
213
],
[
212,
214
],
[
211,
215
],
[
215,
216
],
[
216,
217
],
[
216,
218
],
[
218,
219
],
[
219,
220
],
[
220,
221
],
[
215,
222
],
[
222,
223
],
[
223,
224
],
[
223,
225
],
[
225,
226
],
[
226,
227
],
[
211,
228
],
[
228,
229
],
[
0,
230
],
[
230,
231
],
[
230,
232
]
]
| [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n public static void main(String[] args) {\n CP sc = new CP();\n String S = sc.nextLine(), T = sc.nextLine();\n int max = Integer.MIN_VALUE;\n String p = \"\";\n for (int i = 0; i < S.length() - T.length() + 1; i++) {\n String j = S.substring(i, i + T.length());\n if (max < charMatch(T, j)) {\n max = charMatch(T, j);\n p = j;\n }\n }\n System.out.println(T.length() - charMatch(T, p));\n }\n\n static int charMatch(String A, String B) {\n int c = 0;\n for (int i = 0; i < A.length(); i++) {\n if (A.charAt(i) == B.charAt(i))\n c++;\n }\n return c;\n }\n\n /*****************************************************************************/\n static class CP {\n BufferedReader bufferedReader;\n StringTokenizer stringTokenizer;\n\n public CP() {\n bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n }\n\n int nextInt() {\n return Integer.parseInt(NNNN());\n }\n\n long nextLong() {\n return Long.parseLong(NNNN());\n }\n\n double nextDouble() {\n return Double.parseDouble(NNNN());\n }\n\n String NNNN() {\n while (stringTokenizer == null || !stringTokenizer.hasMoreElements()) {\n try {\n stringTokenizer = new StringTokenizer(bufferedReader.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return stringTokenizer.nextToken();\n }\n\n String nextLine() {\n String spl = \"\";\n try {\n spl = bufferedReader.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return spl;\n }\n }\n /*****************************************************************************/\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.util.StringTokenizer;",
"StringTokenizer",
"java.util",
"public class Main {\n public static void main(String[] args) {\n CP sc = new CP();\n String S = sc.nextLine(), T = sc.nextLine();\n int max = Integer.MIN_VALUE;\n String p = \"\";\n for (int i = 0; i < S.length() - T.length() + 1; i++) {\n String j = S.substring(i, i + T.length());\n if (max < charMatch(T, j)) {\n max = charMatch(T, j);\n p = j;\n }\n }\n System.out.println(T.length() - charMatch(T, p));\n }\n\n static int charMatch(String A, String B) {\n int c = 0;\n for (int i = 0; i < A.length(); i++) {\n if (A.charAt(i) == B.charAt(i))\n c++;\n }\n return c;\n }\n\n /*****************************************************************************/\n static class CP {\n BufferedReader bufferedReader;\n StringTokenizer stringTokenizer;\n\n public CP() {\n bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n }\n\n int nextInt() {\n return Integer.parseInt(NNNN());\n }\n\n long nextLong() {\n return Long.parseLong(NNNN());\n }\n\n double nextDouble() {\n return Double.parseDouble(NNNN());\n }\n\n String NNNN() {\n while (stringTokenizer == null || !stringTokenizer.hasMoreElements()) {\n try {\n stringTokenizer = new StringTokenizer(bufferedReader.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return stringTokenizer.nextToken();\n }\n\n String nextLine() {\n String spl = \"\";\n try {\n spl = bufferedReader.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return spl;\n }\n }\n /*****************************************************************************/\n}",
"Main",
"public static void main(String[] args) {\n CP sc = new CP();\n String S = sc.nextLine(), T = sc.nextLine();\n int max = Integer.MIN_VALUE;\n String p = \"\";\n for (int i = 0; i < S.length() - T.length() + 1; i++) {\n String j = S.substring(i, i + T.length());\n if (max < charMatch(T, j)) {\n max = charMatch(T, j);\n p = j;\n }\n }\n System.out.println(T.length() - charMatch(T, p));\n }",
"main",
"{\n CP sc = new CP();\n String S = sc.nextLine(), T = sc.nextLine();\n int max = Integer.MIN_VALUE;\n String p = \"\";\n for (int i = 0; i < S.length() - T.length() + 1; i++) {\n String j = S.substring(i, i + T.length());\n if (max < charMatch(T, j)) {\n max = charMatch(T, j);\n p = j;\n }\n }\n System.out.println(T.length() - charMatch(T, p));\n }",
"CP sc = new CP();",
"sc",
"new CP()",
"String S = sc.nextLine()",
"S",
"sc.nextLine()",
"sc.nextLine",
"sc",
"T = sc.nextLine();",
"T",
"sc.nextLine()",
"sc.nextLine",
"sc",
"int max = Integer.MIN_VALUE;",
"max",
"Integer.MIN_VALUE",
"Integer",
"Integer.MIN_VALUE",
"String p = \"\";",
"p",
"\"\"",
"for (int i = 0; i < S.length() - T.length() + 1; i++) {\n String j = S.substring(i, i + T.length());\n if (max < charMatch(T, j)) {\n max = charMatch(T, j);\n p = j;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < S.length() - T.length() + 1",
"i",
"S.length() - T.length() + 1",
"S.length() - T.length()",
"S.length()",
"S.length",
"S",
"T.length()",
"T.length",
"T",
"1",
"i++",
"i++",
"i",
"{\n String j = S.substring(i, i + T.length());\n if (max < charMatch(T, j)) {\n max = charMatch(T, j);\n p = j;\n }\n }",
"{\n String j = S.substring(i, i + T.length());\n if (max < charMatch(T, j)) {\n max = charMatch(T, j);\n p = j;\n }\n }",
"String j = S.substring(i, i + T.length());",
"j",
"S.substring(i, i + T.length())",
"S.substring",
"S",
"i",
"i + T.length()",
"i",
"T.length()",
"T.length",
"T",
"if (max < charMatch(T, j)) {\n max = charMatch(T, j);\n p = j;\n }",
"max < charMatch(T, j)",
"max",
"charMatch(T, j)",
"charMatch",
"T",
"j",
"{\n max = charMatch(T, j);\n p = j;\n }",
"max = charMatch(T, j)",
"max",
"charMatch(T, j)",
"charMatch",
"T",
"j",
"p = j",
"p",
"j",
"System.out.println(T.length() - charMatch(T, p))",
"System.out.println",
"System.out",
"System",
"System.out",
"T.length() - charMatch(T, p)",
"T.length()",
"T.length",
"T",
"charMatch(T, p)",
"charMatch",
"T",
"p",
"String[] args",
"args",
"static int charMatch(String A, String B) {\n int c = 0;\n for (int i = 0; i < A.length(); i++) {\n if (A.charAt(i) == B.charAt(i))\n c++;\n }\n return c;\n }",
"charMatch",
"{\n int c = 0;\n for (int i = 0; i < A.length(); i++) {\n if (A.charAt(i) == B.charAt(i))\n c++;\n }\n return c;\n }",
"int c = 0;",
"c",
"0",
"for (int i = 0; i < A.length(); i++) {\n if (A.charAt(i) == B.charAt(i))\n c++;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < A.length()",
"i",
"A.length()",
"A.length",
"A",
"i++",
"i++",
"i",
"{\n if (A.charAt(i) == B.charAt(i))\n c++;\n }",
"{\n if (A.charAt(i) == B.charAt(i))\n c++;\n }",
"if (A.charAt(i) == B.charAt(i))\n c++;",
"A.charAt(i) == B.charAt(i)",
"A.charAt(i)",
"A.charAt",
"A",
"i",
"B.charAt(i)",
"B.charAt",
"B",
"i",
"c++",
"c",
"return c;",
"c",
"String A",
"A",
"String B",
"B",
"static class CP {\n BufferedReader bufferedReader;\n StringTokenizer stringTokenizer;\n\n public CP() {\n bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n }\n\n int nextInt() {\n return Integer.parseInt(NNNN());\n }\n\n long nextLong() {\n return Long.parseLong(NNNN());\n }\n\n double nextDouble() {\n return Double.parseDouble(NNNN());\n }\n\n String NNNN() {\n while (stringTokenizer == null || !stringTokenizer.hasMoreElements()) {\n try {\n stringTokenizer = new StringTokenizer(bufferedReader.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return stringTokenizer.nextToken();\n }\n\n String nextLine() {\n String spl = \"\";\n try {\n spl = bufferedReader.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return spl;\n }\n }",
"CP",
"BufferedReader bufferedReader;",
"bufferedReader",
"StringTokenizer stringTokenizer;",
"stringTokenizer",
"public CP() {\n bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n }",
"CP",
"{\n bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n }",
"bufferedReader = new BufferedReader(new InputStreamReader(System.in))",
"bufferedReader",
"new BufferedReader(new InputStreamReader(System.in))",
"int nextInt() {\n return Integer.parseInt(NNNN());\n }",
"nextInt",
"{\n return Integer.parseInt(NNNN());\n }",
"return Integer.parseInt(NNNN());",
"Integer.parseInt(NNNN())",
"Integer.parseInt",
"Integer",
"NNNN()",
"NNNN",
"long nextLong() {\n return Long.parseLong(NNNN());\n }",
"nextLong",
"{\n return Long.parseLong(NNNN());\n }",
"return Long.parseLong(NNNN());",
"Long.parseLong(NNNN())",
"Long.parseLong",
"Long",
"NNNN()",
"NNNN",
"double nextDouble() {\n return Double.parseDouble(NNNN());\n }",
"nextDouble",
"{\n return Double.parseDouble(NNNN());\n }",
"return Double.parseDouble(NNNN());",
"Double.parseDouble(NNNN())",
"Double.parseDouble",
"Double",
"NNNN()",
"NNNN",
"String NNNN() {\n while (stringTokenizer == null || !stringTokenizer.hasMoreElements()) {\n try {\n stringTokenizer = new StringTokenizer(bufferedReader.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return stringTokenizer.nextToken();\n }",
"NNNN",
"{\n while (stringTokenizer == null || !stringTokenizer.hasMoreElements()) {\n try {\n stringTokenizer = new StringTokenizer(bufferedReader.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return stringTokenizer.nextToken();\n }",
"while (stringTokenizer == null || !stringTokenizer.hasMoreElements()) {\n try {\n stringTokenizer = new StringTokenizer(bufferedReader.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }",
"stringTokenizer == null || !stringTokenizer.hasMoreElements()",
"stringTokenizer == null",
"stringTokenizer",
"null",
"!stringTokenizer.hasMoreElements()",
"stringTokenizer.hasMoreElements()",
"stringTokenizer.hasMoreElements",
"stringTokenizer",
"{\n try {\n stringTokenizer = new StringTokenizer(bufferedReader.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }",
"try {\n stringTokenizer = new StringTokenizer(bufferedReader.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }",
"catch (IOException e) {\n e.printStackTrace();\n }",
"IOException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n stringTokenizer = new StringTokenizer(bufferedReader.readLine());\n }",
"stringTokenizer = new StringTokenizer(bufferedReader.readLine())",
"stringTokenizer",
"new StringTokenizer(bufferedReader.readLine())",
"return stringTokenizer.nextToken();",
"stringTokenizer.nextToken()",
"stringTokenizer.nextToken",
"stringTokenizer",
"String nextLine() {\n String spl = \"\";\n try {\n spl = bufferedReader.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return spl;\n }",
"nextLine",
"{\n String spl = \"\";\n try {\n spl = bufferedReader.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return spl;\n }",
"String spl = \"\";",
"spl",
"\"\"",
"try {\n spl = bufferedReader.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }",
"catch (IOException e) {\n e.printStackTrace();\n }",
"IOException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n spl = bufferedReader.readLine();\n }",
"spl = bufferedReader.readLine()",
"spl",
"bufferedReader.readLine()",
"bufferedReader.readLine",
"bufferedReader",
"return spl;",
"spl",
"public class Main {\n public static void main(String[] args) {\n CP sc = new CP();\n String S = sc.nextLine(), T = sc.nextLine();\n int max = Integer.MIN_VALUE;\n String p = \"\";\n for (int i = 0; i < S.length() - T.length() + 1; i++) {\n String j = S.substring(i, i + T.length());\n if (max < charMatch(T, j)) {\n max = charMatch(T, j);\n p = j;\n }\n }\n System.out.println(T.length() - charMatch(T, p));\n }\n\n static int charMatch(String A, String B) {\n int c = 0;\n for (int i = 0; i < A.length(); i++) {\n if (A.charAt(i) == B.charAt(i))\n c++;\n }\n return c;\n }\n\n /*****************************************************************************/\n static class CP {\n BufferedReader bufferedReader;\n StringTokenizer stringTokenizer;\n\n public CP() {\n bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n }\n\n int nextInt() {\n return Integer.parseInt(NNNN());\n }\n\n long nextLong() {\n return Long.parseLong(NNNN());\n }\n\n double nextDouble() {\n return Double.parseDouble(NNNN());\n }\n\n String NNNN() {\n while (stringTokenizer == null || !stringTokenizer.hasMoreElements()) {\n try {\n stringTokenizer = new StringTokenizer(bufferedReader.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return stringTokenizer.nextToken();\n }\n\n String nextLine() {\n String spl = \"\";\n try {\n spl = bufferedReader.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return spl;\n }\n }\n /*****************************************************************************/\n}",
"public class Main {\n public static void main(String[] args) {\n CP sc = new CP();\n String S = sc.nextLine(), T = sc.nextLine();\n int max = Integer.MIN_VALUE;\n String p = \"\";\n for (int i = 0; i < S.length() - T.length() + 1; i++) {\n String j = S.substring(i, i + T.length());\n if (max < charMatch(T, j)) {\n max = charMatch(T, j);\n p = j;\n }\n }\n System.out.println(T.length() - charMatch(T, p));\n }\n\n static int charMatch(String A, String B) {\n int c = 0;\n for (int i = 0; i < A.length(); i++) {\n if (A.charAt(i) == B.charAt(i))\n c++;\n }\n return c;\n }\n\n /*****************************************************************************/\n static class CP {\n BufferedReader bufferedReader;\n StringTokenizer stringTokenizer;\n\n public CP() {\n bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n }\n\n int nextInt() {\n return Integer.parseInt(NNNN());\n }\n\n long nextLong() {\n return Long.parseLong(NNNN());\n }\n\n double nextDouble() {\n return Double.parseDouble(NNNN());\n }\n\n String NNNN() {\n while (stringTokenizer == null || !stringTokenizer.hasMoreElements()) {\n try {\n stringTokenizer = new StringTokenizer(bufferedReader.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return stringTokenizer.nextToken();\n }\n\n String nextLine() {\n String spl = \"\";\n try {\n spl = bufferedReader.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return spl;\n }\n }\n /*****************************************************************************/\n}",
"Main"
]
| import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) {
CP sc = new CP();
String S = sc.nextLine(), T = sc.nextLine();
int max = Integer.MIN_VALUE;
String p = "";
for (int i = 0; i < S.length() - T.length() + 1; i++) {
String j = S.substring(i, i + T.length());
if (max < charMatch(T, j)) {
max = charMatch(T, j);
p = j;
}
}
System.out.println(T.length() - charMatch(T, p));
}
static int charMatch(String A, String B) {
int c = 0;
for (int i = 0; i < A.length(); i++) {
if (A.charAt(i) == B.charAt(i))
c++;
}
return c;
}
/*****************************************************************************/
static class CP {
BufferedReader bufferedReader;
StringTokenizer stringTokenizer;
public CP() {
bufferedReader = new BufferedReader(new InputStreamReader(System.in));
}
int nextInt() {
return Integer.parseInt(NNNN());
}
long nextLong() {
return Long.parseLong(NNNN());
}
double nextDouble() {
return Double.parseDouble(NNNN());
}
String NNNN() {
while (stringTokenizer == null || !stringTokenizer.hasMoreElements()) {
try {
stringTokenizer = new StringTokenizer(bufferedReader.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return stringTokenizer.nextToken();
}
String nextLine() {
String spl = "";
try {
spl = bufferedReader.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return spl;
}
}
/*****************************************************************************/
} |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
41,
13,
41,
13,
41,
13,
2,
17,
17,
41,
13,
18,
13,
13,
41,
13,
18,
13,
13,
41,
13,
2,
17,
17,
41,
13,
41,
13,
20,
12,
13,
30,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
4,
18,
18,
13,
13,
2,
18,
13,
13,
17,
4,
18,
18,
13,
13,
23,
13,
12,
13,
30,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
4,
18,
18,
13,
13,
2,
18,
13,
13,
17,
4,
18,
18,
13,
13,
23,
13,
12,
13,
30,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
4,
18,
18,
13,
13,
2,
18,
13,
13,
17,
4,
18,
18,
13,
13,
23,
13,
12,
13,
30,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
4,
18,
18,
13,
13,
2,
18,
13,
13,
17,
4,
18,
18,
13,
13,
23,
13,
12,
13,
30,
4,
18,
18,
13,
13,
17,
12,
13,
30,
4,
18,
18,
13,
13,
17,
12,
13,
30,
41,
13,
40,
17,
41,
13,
13,
42,
2,
2,
13,
17,
13,
30,
41,
13,
2,
2,
13,
13,
17,
14,
2,
18,
13,
13,
13,
30,
0,
13,
13,
30,
0,
13,
13,
29,
13,
23,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
40,
17,
41,
13,
13,
42,
2,
2,
13,
17,
13,
30,
41,
13,
2,
2,
13,
13,
17,
14,
2,
18,
13,
13,
13,
30,
0,
13,
13,
0,
13,
13,
29,
13,
23,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
17,
41,
13,
2,
13,
17,
41,
13,
40,
17,
42,
2,
13,
13,
30,
41,
13,
2,
2,
13,
13,
17,
14,
2,
18,
13,
13,
13,
30,
0,
13,
2,
13,
17,
14,
2,
18,
13,
13,
13,
30,
0,
13,
2,
13,
17,
30,
0,
13,
13,
3,
29,
13,
23,
13,
23,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
29,
13,
29,
4,
13,
13,
2,
13,
13,
23,
13,
23,
13,
12,
13,
30,
29,
2,
2,
13,
4,
13,
13,
13,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
17,
41,
13,
4,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
30,
40,
13,
0,
13,
17,
14,
2,
2,
13,
13,
13,
40,
13,
29,
13,
23,
13,
12,
13,
30,
0,
13,
20,
2,
13,
17,
4,
18,
13,
13,
17,
0,
18,
13,
17,
0,
18,
13,
17,
17,
11,
1,
41,
13,
17,
2,
2,
13,
13,
13,
1,
40,
13,
30,
14,
18,
13,
13,
11,
1,
41,
13,
2,
13,
13,
2,
13,
13,
1,
0,
13,
13,
30,
0,
18,
13,
13,
17,
23,
13,
12,
13,
30,
0,
13,
20,
18,
13,
13,
0,
18,
13,
17,
18,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
2,
18,
13,
13,
18,
13,
2,
13,
17,
23,
13,
12,
13,
30,
29,
2,
2,
13,
17,
17,
23,
13,
12,
13,
30,
41,
13,
17,
41,
13,
4,
18,
13,
13,
14,
2,
13,
17,
29,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
13,
17,
30,
0,
13,
17,
3,
29,
13,
23,
13,
12,
13,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
13,
13,
29,
13,
23,
13,
12,
13,
30,
14,
2,
13,
17,
30,
29,
17,
41,
13,
4,
13,
13,
2,
13,
17,
14,
2,
2,
13,
17,
17,
30,
29,
2,
2,
13,
13,
13,
29,
2,
13,
13,
23,
13,
23,
13,
12,
13,
30,
0,
13,
4,
18,
13,
30,
4,
13,
0,
13,
4,
18,
13,
41,
13,
2,
13,
13,
23,
13,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
13,
13,
1,
40,
13,
30,
30,
0,
13,
17,
41,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
30,
40,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
2,
13,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
29,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
880,
8
],
[
880,
9
],
[
9,
10
],
[
880,
11
],
[
11,
12
],
[
880,
13
],
[
13,
14
],
[
880,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
17,
19
],
[
880,
20
],
[
20,
21
],
[
20,
22
],
[
22,
23
],
[
22,
24
],
[
880,
25
],
[
25,
26
],
[
25,
27
],
[
27,
28
],
[
27,
29
],
[
880,
30
],
[
30,
31
],
[
30,
32
],
[
32,
33
],
[
32,
34
],
[
880,
35
],
[
35,
36
],
[
880,
37
],
[
37,
38
],
[
37,
39
],
[
880,
40
],
[
40,
41
],
[
40,
42
],
[
42,
43
],
[
43,
44
],
[
43,
45
],
[
45,
46
],
[
45,
47
],
[
42,
48
],
[
48,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
48,
53
],
[
53,
54
],
[
53,
55
],
[
48,
56
],
[
56,
57
],
[
57,
58
],
[
48,
59
],
[
59,
60
],
[
60,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
60,
65
],
[
65,
66
],
[
66,
67
],
[
66,
68
],
[
65,
69
],
[
42,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
40,
75
],
[
75,
76
],
[
880,
77
],
[
77,
78
],
[
77,
79
],
[
79,
80
],
[
80,
81
],
[
80,
82
],
[
82,
83
],
[
82,
84
],
[
79,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
87,
89
],
[
85,
90
],
[
90,
91
],
[
90,
92
],
[
85,
93
],
[
93,
94
],
[
94,
95
],
[
85,
96
],
[
96,
97
],
[
97,
98
],
[
98,
99
],
[
99,
100
],
[
99,
101
],
[
97,
102
],
[
102,
103
],
[
103,
104
],
[
103,
105
],
[
102,
106
],
[
79,
107
],
[
107,
108
],
[
108,
109
],
[
109,
110
],
[
109,
111
],
[
77,
112
],
[
112,
113
],
[
880,
114
],
[
114,
115
],
[
114,
116
],
[
116,
117
],
[
117,
118
],
[
117,
119
],
[
119,
120
],
[
119,
121
],
[
116,
122
],
[
122,
123
],
[
123,
124
],
[
124,
125
],
[
124,
126
],
[
122,
127
],
[
127,
128
],
[
127,
129
],
[
122,
130
],
[
130,
131
],
[
131,
132
],
[
122,
133
],
[
133,
134
],
[
134,
135
],
[
135,
136
],
[
136,
137
],
[
136,
138
],
[
134,
139
],
[
139,
140
],
[
140,
141
],
[
140,
142
],
[
139,
143
],
[
116,
144
],
[
144,
145
],
[
145,
146
],
[
146,
147
],
[
146,
148
],
[
114,
149
],
[
149,
150
],
[
880,
151
],
[
151,
152
],
[
151,
153
],
[
153,
154
],
[
154,
155
],
[
154,
156
],
[
156,
157
],
[
156,
158
],
[
153,
159
],
[
159,
160
],
[
160,
161
],
[
161,
162
],
[
161,
163
],
[
159,
164
],
[
164,
165
],
[
164,
166
],
[
159,
167
],
[
167,
168
],
[
168,
169
],
[
159,
170
],
[
170,
171
],
[
171,
172
],
[
172,
173
],
[
173,
174
],
[
173,
175
],
[
171,
176
],
[
176,
177
],
[
177,
178
],
[
177,
179
],
[
176,
180
],
[
153,
181
],
[
181,
182
],
[
182,
183
],
[
183,
184
],
[
183,
185
],
[
151,
186
],
[
186,
187
],
[
880,
188
],
[
188,
189
],
[
188,
190
],
[
190,
191
],
[
191,
192
],
[
192,
193
],
[
193,
194
],
[
193,
195
],
[
191,
196
],
[
880,
197
],
[
197,
198
],
[
197,
199
],
[
199,
200
],
[
200,
201
],
[
201,
202
],
[
202,
203
],
[
202,
204
],
[
200,
205
],
[
880,
206
],
[
206,
207
],
[
206,
208
],
[
208,
209
],
[
209,
210
],
[
209,
211
],
[
211,
212
],
[
208,
213
],
[
213,
214
],
[
213,
215
],
[
208,
216
],
[
216,
217
],
[
217,
218
],
[
218,
219
],
[
218,
220
],
[
217,
221
],
[
216,
222
],
[
222,
223
],
[
223,
224
],
[
223,
225
],
[
225,
226
],
[
226,
227
],
[
226,
228
],
[
225,
229
],
[
222,
230
],
[
230,
231
],
[
231,
232
],
[
232,
233
],
[
232,
234
],
[
231,
235
],
[
230,
236
],
[
236,
237
],
[
237,
238
],
[
237,
239
],
[
230,
240
],
[
240,
241
],
[
241,
242
],
[
241,
243
],
[
208,
244
],
[
244,
245
],
[
206,
246
],
[
246,
247
],
[
206,
248
],
[
248,
249
],
[
206,
250
],
[
250,
251
],
[
880,
252
],
[
252,
253
],
[
252,
254
],
[
254,
255
],
[
255,
256
],
[
255,
257
],
[
257,
258
],
[
254,
259
],
[
259,
260
],
[
259,
261
],
[
254,
262
],
[
262,
263
],
[
263,
264
],
[
264,
265
],
[
264,
266
],
[
263,
267
],
[
262,
268
],
[
268,
269
],
[
269,
270
],
[
269,
271
],
[
271,
272
],
[
272,
273
],
[
272,
274
],
[
271,
275
],
[
268,
276
],
[
276,
277
],
[
277,
278
],
[
278,
279
],
[
278,
280
],
[
277,
281
],
[
276,
282
],
[
282,
283
],
[
283,
284
],
[
283,
285
],
[
276,
286
],
[
286,
287
],
[
286,
288
],
[
254,
289
],
[
289,
290
],
[
252,
291
],
[
291,
292
],
[
252,
293
],
[
293,
294
],
[
252,
295
],
[
295,
296
],
[
880,
297
],
[
297,
298
],
[
297,
299
],
[
299,
300
],
[
300,
301
],
[
300,
302
],
[
299,
303
],
[
303,
304
],
[
303,
305
],
[
305,
306
],
[
305,
307
],
[
299,
308
],
[
308,
309
],
[
308,
310
],
[
310,
311
],
[
299,
312
],
[
312,
313
],
[
313,
314
],
[
313,
315
],
[
312,
316
],
[
316,
317
],
[
317,
318
],
[
317,
319
],
[
319,
320
],
[
320,
321
],
[
320,
322
],
[
319,
323
],
[
316,
324
],
[
324,
325
],
[
325,
326
],
[
326,
327
],
[
326,
328
],
[
325,
329
],
[
324,
330
],
[
330,
331
],
[
331,
332
],
[
331,
333
],
[
333,
334
],
[
333,
335
],
[
324,
336
],
[
336,
337
],
[
337,
338
],
[
338,
339
],
[
338,
340
],
[
337,
341
],
[
336,
342
],
[
342,
343
],
[
343,
344
],
[
343,
345
],
[
345,
346
],
[
345,
347
],
[
336,
348
],
[
348,
349
],
[
349,
350
],
[
349,
351
],
[
348,
352
],
[
299,
353
],
[
353,
354
],
[
297,
355
],
[
355,
356
],
[
297,
357
],
[
357,
358
],
[
297,
359
],
[
359,
360
],
[
880,
361
],
[
361,
362
],
[
361,
363
],
[
363,
364
],
[
364,
365
],
[
365,
366
],
[
365,
367
],
[
364,
368
],
[
368,
369
],
[
364,
370
],
[
370,
371
],
[
371,
372
],
[
371,
373
],
[
371,
374
],
[
374,
375
],
[
374,
376
],
[
361,
377
],
[
377,
378
],
[
361,
379
],
[
379,
380
],
[
880,
381
],
[
381,
382
],
[
381,
383
],
[
383,
384
],
[
384,
385
],
[
385,
386
],
[
386,
387
],
[
386,
388
],
[
388,
389
],
[
388,
390
],
[
388,
391
],
[
385,
392
],
[
381,
393
],
[
393,
394
],
[
381,
395
],
[
395,
396
],
[
880,
397
],
[
397,
398
],
[
397,
399
],
[
399,
400
],
[
400,
401
],
[
400,
402
],
[
399,
403
],
[
403,
404
],
[
403,
405
],
[
405,
406
],
[
406,
407
],
[
405,
408
],
[
399,
409
],
[
409,
410
],
[
410,
411
],
[
411,
412
],
[
411,
413
],
[
409,
414
],
[
414,
415
],
[
414,
416
],
[
409,
417
],
[
417,
418
],
[
418,
419
],
[
409,
420
],
[
421,
421
],
[
421,
422
],
[
422,
423
],
[
423,
424
],
[
424,
425
],
[
424,
426
],
[
423,
427
],
[
422,
428
],
[
428,
429
],
[
429,
430
],
[
399,
431
],
[
431,
432
],
[
431,
433
],
[
399,
434
],
[
434,
435
],
[
435,
436
],
[
436,
437
],
[
436,
438
],
[
435,
439
],
[
434,
440
],
[
440,
441
],
[
399,
442
],
[
442,
443
],
[
397,
444
],
[
444,
445
],
[
880,
446
],
[
446,
447
],
[
446,
448
],
[
448,
449
],
[
449,
450
],
[
449,
451
],
[
452,
453
],
[
452,
454
],
[
448,
455
],
[
455,
456
],
[
456,
457
],
[
455,
458
],
[
455,
459
],
[
448,
460
],
[
460,
461
],
[
461,
462
],
[
461,
463
],
[
460,
464
],
[
464,
465
],
[
465,
466
],
[
465,
467
],
[
464,
468
],
[
448,
469
],
[
469,
470
],
[
470,
471
],
[
471,
472
],
[
471,
473
],
[
469,
474
],
[
474,
475
],
[
475,
476
],
[
475,
477
],
[
474,
478
],
[
469,
479
],
[
479,
480
],
[
480,
481
],
[
469,
482
],
[
482,
483
],
[
483,
484
],
[
484,
485
],
[
484,
486
],
[
483,
487
],
[
487,
488
],
[
488,
489
],
[
489,
490
],
[
489,
491
],
[
491,
492
],
[
491,
493
],
[
487,
494
],
[
494,
495
],
[
494,
496
],
[
487,
497
],
[
497,
498
],
[
498,
499
],
[
498,
500
],
[
487,
501
],
[
501,
502
],
[
502,
503
],
[
503,
504
],
[
503,
505
],
[
502,
506
],
[
446,
507
],
[
507,
508
],
[
880,
509
],
[
509,
510
],
[
509,
511
],
[
511,
512
],
[
512,
513
],
[
512,
514
],
[
515,
516
],
[
515,
517
],
[
511,
518
],
[
518,
519
],
[
519,
520
],
[
519,
521
],
[
518,
522
],
[
522,
523
],
[
522,
524
],
[
511,
525
],
[
525,
526
],
[
526,
527
],
[
527,
528
],
[
527,
529
],
[
525,
530
],
[
530,
531
],
[
530,
532
],
[
532,
533
],
[
532,
534
],
[
525,
535
],
[
535,
536
],
[
536,
537
],
[
525,
538
],
[
539,
539
],
[
539,
540
],
[
540,
541
],
[
541,
542
],
[
541,
543
],
[
540,
544
],
[
544,
545
],
[
545,
546
],
[
545,
547
],
[
544,
548
],
[
548,
549
],
[
548,
550
],
[
550,
551
],
[
550,
552
],
[
509,
553
],
[
553,
554
],
[
880,
555
],
[
555,
556
],
[
555,
557
],
[
557,
558
],
[
558,
559
],
[
559,
560
],
[
560,
561
],
[
560,
562
],
[
559,
563
],
[
555,
564
],
[
564,
565
],
[
880,
566
],
[
566,
567
],
[
566,
568
],
[
568,
569
],
[
569,
570
],
[
569,
571
],
[
568,
572
],
[
572,
573
],
[
572,
574
],
[
574,
575
],
[
575,
576
],
[
574,
577
],
[
568,
578
],
[
578,
579
],
[
579,
580
],
[
579,
581
],
[
578,
582
],
[
582,
583
],
[
568,
584
],
[
584,
585
],
[
585,
586
],
[
586,
587
],
[
586,
588
],
[
584,
589
],
[
589,
590
],
[
589,
591
],
[
584,
592
],
[
592,
593
],
[
593,
594
],
[
584,
595
],
[
596,
596
],
[
596,
597
],
[
597,
598
],
[
598,
599
],
[
599,
600
],
[
599,
601
],
[
598,
602
],
[
597,
603
],
[
603,
604
],
[
604,
605
],
[
604,
606
],
[
603,
607
],
[
568,
608
],
[
608,
609
],
[
566,
610
],
[
610,
611
],
[
880,
612
],
[
612,
613
],
[
612,
614
],
[
614,
615
],
[
615,
616
],
[
615,
617
],
[
614,
618
],
[
618,
619
],
[
619,
620
],
[
620,
621
],
[
620,
622
],
[
618,
623
],
[
623,
624
],
[
623,
625
],
[
618,
626
],
[
626,
627
],
[
627,
628
],
[
618,
629
],
[
629,
630
],
[
630,
631
],
[
630,
632
],
[
614,
633
],
[
633,
634
],
[
612,
635
],
[
635,
636
],
[
880,
637
],
[
637,
638
],
[
637,
639
],
[
639,
640
],
[
640,
641
],
[
641,
642
],
[
641,
643
],
[
640,
644
],
[
644,
645
],
[
645,
646
],
[
639,
647
],
[
647,
648
],
[
647,
649
],
[
649,
650
],
[
649,
651
],
[
649,
652
],
[
652,
653
],
[
652,
654
],
[
639,
655
],
[
655,
656
],
[
656,
657
],
[
657,
658
],
[
657,
659
],
[
656,
660
],
[
655,
661
],
[
661,
662
],
[
662,
663
],
[
664,
664
],
[
664,
665
],
[
664,
666
],
[
664,
667
],
[
639,
668
],
[
668,
669
],
[
669,
670
],
[
669,
671
],
[
637,
672
],
[
672,
673
],
[
637,
674
],
[
674,
675
],
[
880,
676
],
[
676,
677
],
[
676,
678
],
[
678,
679
],
[
679,
680
],
[
679,
681
],
[
681,
682
],
[
682,
683
],
[
678,
684
],
[
684,
685
],
[
685,
686
],
[
678,
687
],
[
687,
688
],
[
687,
689
],
[
689,
690
],
[
690,
691
],
[
678,
692
],
[
692,
693
],
[
692,
694
],
[
694,
695
],
[
694,
696
],
[
676,
697
],
[
697,
698
],
[
880,
699
],
[
699,
700
],
[
699,
701
],
[
701,
702
],
[
702,
703
],
[
702,
704
],
[
704,
705
],
[
705,
706
],
[
701,
707
],
[
707,
708
],
[
707,
709
],
[
709,
710
],
[
710,
711
],
[
701,
712
],
[
712,
713
],
[
712,
714
],
[
714,
715
],
[
715,
716
],
[
701,
717
],
[
717,
718
],
[
717,
719
],
[
719,
720
],
[
720,
721
],
[
701,
722
],
[
722,
723
],
[
701,
724
],
[
724,
725
],
[
724,
726
],
[
701,
727
],
[
727,
728
],
[
728,
729
],
[
729,
730
],
[
729,
731
],
[
727,
732
],
[
732,
733
],
[
732,
734
],
[
734,
735
],
[
734,
736
],
[
727,
737
],
[
737,
738
],
[
738,
739
],
[
727,
740
],
[
741,
741
],
[
741,
742
],
[
742,
743
],
[
742,
744
],
[
741,
745
],
[
745,
746
],
[
745,
747
],
[
741,
748
],
[
748,
749
],
[
749,
750
],
[
750,
751
],
[
750,
752
],
[
748,
753
],
[
753,
754
],
[
753,
755
],
[
748,
756
],
[
756,
757
],
[
757,
758
],
[
748,
759
],
[
760,
760
],
[
760,
761
],
[
761,
762
],
[
762,
763
],
[
763,
764
],
[
764,
765
],
[
763,
766
],
[
762,
767
],
[
767,
768
],
[
768,
769
],
[
767,
770
],
[
761,
771
],
[
771,
772
],
[
772,
773
],
[
760,
774
],
[
774,
775
],
[
741,
776
],
[
776,
777
],
[
776,
778
],
[
778,
779
],
[
779,
780
],
[
778,
781
],
[
778,
782
],
[
701,
783
],
[
783,
784
],
[
784,
785
],
[
785,
786
],
[
785,
787
],
[
783,
788
],
[
788,
789
],
[
788,
790
],
[
880,
791
],
[
791,
792
],
[
791,
793
],
[
793,
794
],
[
791,
795
],
[
795,
796
],
[
791,
797
],
[
797,
798
],
[
797,
799
],
[
799,
800
],
[
800,
801
],
[
800,
802
],
[
791,
803
],
[
803,
804
],
[
803,
805
],
[
805,
806
],
[
806,
807
],
[
807,
808
],
[
808,
809
],
[
808,
810
],
[
807,
811
],
[
811,
812
],
[
812,
813
],
[
813,
814
],
[
806,
815
],
[
815,
816
],
[
816,
817
],
[
817,
818
],
[
817,
819
],
[
819,
820
],
[
820,
821
],
[
821,
822
],
[
816,
823
],
[
823,
824
],
[
824,
825
],
[
824,
826
],
[
805,
827
],
[
827,
828
],
[
828,
829
],
[
829,
830
],
[
791,
831
],
[
831,
832
],
[
831,
833
],
[
833,
834
],
[
834,
835
],
[
835,
836
],
[
836,
837
],
[
835,
838
],
[
838,
839
],
[
791,
840
],
[
840,
841
],
[
840,
842
],
[
842,
843
],
[
843,
844
],
[
844,
845
],
[
845,
846
],
[
844,
847
],
[
847,
848
],
[
791,
849
],
[
849,
850
],
[
849,
851
],
[
851,
852
],
[
852,
853
],
[
853,
854
],
[
854,
855
],
[
853,
856
],
[
856,
857
],
[
791,
858
],
[
858,
859
],
[
858,
860
],
[
860,
861
],
[
861,
862
],
[
861,
863
],
[
860,
864
],
[
864,
865
],
[
865,
866
],
[
865,
867
],
[
867,
868
],
[
868,
869
],
[
869,
870
],
[
864,
871
],
[
871,
872
],
[
872,
873
],
[
872,
874
],
[
874,
875
],
[
875,
876
],
[
860,
877
],
[
877,
878
],
[
0,
879
],
[
879,
880
],
[
879,
881
]
]
| [
"import java.io.*;\nimport java.util.*;\npublic class Main {\n static long startTime;\n static long endTime;\n static Boolean [] prime ;\n static int M=(int)1e9+7;\n static int MAX=Integer.MAX_VALUE;\n static int MIN=Integer.MIN_VALUE;\n static int SIZE = (int)1e9*2;\n static class FastReader{\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader()\n {\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }\n\n String next()\n {\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n long nextLong()\n {\n return Long.parseLong(next());\n }\n\n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n }\n static void printArray(int[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }\n static void printArray(long[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }\n static void printArray(Integer[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }\n static void printArray(Long[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }\n static void yes(){\n System.out.println(\"YES\");\n }\n static void no(){\n System.out.println(\"NO\");\n }\n public static int lowerBound\n (Integer[] array, int length, int value) {\n // Returns the index of the value or\n // if there is no value, returns the closest to the left.\n int low=-1; // arr[low]<=tar\n int hi=length;//arr[hi]>tar\n while (low+1<hi){ // while pointers are not neighboring(low+1!=hi)\n int mid=(low+hi)/2;\n if(array[mid]<=value){\n low=mid;\n }\n else {\n hi=mid;\n }\n }\n return low;// if no such element, returns -1.\n }\n public static int upperBound(Integer[] array, int length, int value){\n // returns the index of the value or\n // if the value does not exist, returns the closest to the right\n int low=-1; // arr[low]<tar\n int hi=length;// arr[hi]>=tar\n while (low+1<hi){// Eventually, pointers should be adjacent.\n int mid=(low+hi)>>1;\n if(array[mid]>=value){\n hi=mid;\n }\n else low=mid;\n }\n return hi;\n }\n public static int binarySearch(Integer [] arr, int length, int value){\n // returns the index of the targeted value or -1 if there is no value.\n int low=0;\n int hi=length-1;\n int ans=-1;\n while (low<=hi){\n int mid=(low+hi)>>1;\n if(arr[mid]>value){\n hi=mid-1;\n }\n else if(arr[mid]<value){\n low=mid+1;\n }\n else {\n ans=mid;\n break;\n }\n }\n return ans;\n }\n public static long gcd(long a, long b){\n if (b == 0)\n return a;\n else return gcd(b, a % b);\n }\n public static long lcm(long a , long b){\n return a/gcd(a,b)*b;\n }\n public static long countDivs(long n ){\n int cn=0;\n long sqr = (long)Math.sqrt(n);\n for (long i = 1; i<=sqr ; ++i) {\n if(n%i==0){\n ++cn;\n }\n }\n cn*=2;\n if(sqr*sqr==n) cn--;\n return cn;\n\n }\n static void prime(int x) {\n //sieve algorithm. nlog(log(n)).\n prime=new Boolean[ (x+1)];\n Arrays.fill(prime,true);\n prime[0] = prime[1] = false;\n for (int i = 2; i * i <= x ; i++)\n if (prime[i])\n for (int j = i * i; j <= x; j += i)\n prime[j] = false;\n }\n static int[] sum;\n static void cumulitiveSum( int [] arr){\n sum = new int[arr.length];\n sum[0]=arr[0];\n for (int i = 1; i <arr.length; i++) {\n sum[i]=arr[i]+sum[i-1];\n }\n }\n static boolean isEven(long x ){\n return x % 2 == 0;\n }\n static boolean isPrime(long x ){\n boolean flag = true;\n int sqr = (int)Math.sqrt(x);\n if(x<2) return false;\n for (int i = 2; i <=sqr; i++) {\n if(x%i==0){\n flag=false;\n break;\n }\n }\n return flag;\n }\n static long factorial( long x) {\n long total = 1;\n for (int i = 2; i <= x; i++)\n total *= i;\n return total;\n }\n static long power(long x, long n) {\n if (n == 0) {\n return 1;\n }\n\n long pow = power(x, n / 2L);\n if ((n & 1) == 1) {\n return x * pow * pow;\n }\n\n return pow * pow;\n }\n\n public static void main(String [] args) {\n startTime = System.currentTimeMillis();\n // int T = sc.nextInt();while (T--!=0)\n {\n solve();\n }\n endTime = System.currentTimeMillis();\n long duration= endTime-startTime;\n //System.out.println(duration);\n }\n\n // static Scanner sc = new Scanner(System.in);\n\n static FastReader sc = new FastReader();\n public static void solve() {\n//////////////////////////////////////////////////////////////////////\n String s = sc.next(),t=sc.next();\n int ss=s.length(),tt=t.length();\n int match;\n int max_match=0;\n for (int i = 0; i <=ss-tt; i++) {\n match=0;\n int k=i;\n for (int j = 0; j < tt; j++) {\n if(s.charAt(k)==t.charAt(j)){\n match++;\n }\n k++;\n }\n max_match=Math.max(max_match,match);\n }\n System.out.println(tt-max_match);\n///////////////////////////////////////////////////////////////////////\n }\n\n}",
"import java.io.*;",
"io.*",
"java",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n static long startTime;\n static long endTime;\n static Boolean [] prime ;\n static int M=(int)1e9+7;\n static int MAX=Integer.MAX_VALUE;\n static int MIN=Integer.MIN_VALUE;\n static int SIZE = (int)1e9*2;\n static class FastReader{\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader()\n {\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }\n\n String next()\n {\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n long nextLong()\n {\n return Long.parseLong(next());\n }\n\n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n }\n static void printArray(int[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }\n static void printArray(long[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }\n static void printArray(Integer[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }\n static void printArray(Long[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }\n static void yes(){\n System.out.println(\"YES\");\n }\n static void no(){\n System.out.println(\"NO\");\n }\n public static int lowerBound\n (Integer[] array, int length, int value) {\n // Returns the index of the value or\n // if there is no value, returns the closest to the left.\n int low=-1; // arr[low]<=tar\n int hi=length;//arr[hi]>tar\n while (low+1<hi){ // while pointers are not neighboring(low+1!=hi)\n int mid=(low+hi)/2;\n if(array[mid]<=value){\n low=mid;\n }\n else {\n hi=mid;\n }\n }\n return low;// if no such element, returns -1.\n }\n public static int upperBound(Integer[] array, int length, int value){\n // returns the index of the value or\n // if the value does not exist, returns the closest to the right\n int low=-1; // arr[low]<tar\n int hi=length;// arr[hi]>=tar\n while (low+1<hi){// Eventually, pointers should be adjacent.\n int mid=(low+hi)>>1;\n if(array[mid]>=value){\n hi=mid;\n }\n else low=mid;\n }\n return hi;\n }\n public static int binarySearch(Integer [] arr, int length, int value){\n // returns the index of the targeted value or -1 if there is no value.\n int low=0;\n int hi=length-1;\n int ans=-1;\n while (low<=hi){\n int mid=(low+hi)>>1;\n if(arr[mid]>value){\n hi=mid-1;\n }\n else if(arr[mid]<value){\n low=mid+1;\n }\n else {\n ans=mid;\n break;\n }\n }\n return ans;\n }\n public static long gcd(long a, long b){\n if (b == 0)\n return a;\n else return gcd(b, a % b);\n }\n public static long lcm(long a , long b){\n return a/gcd(a,b)*b;\n }\n public static long countDivs(long n ){\n int cn=0;\n long sqr = (long)Math.sqrt(n);\n for (long i = 1; i<=sqr ; ++i) {\n if(n%i==0){\n ++cn;\n }\n }\n cn*=2;\n if(sqr*sqr==n) cn--;\n return cn;\n\n }\n static void prime(int x) {\n //sieve algorithm. nlog(log(n)).\n prime=new Boolean[ (x+1)];\n Arrays.fill(prime,true);\n prime[0] = prime[1] = false;\n for (int i = 2; i * i <= x ; i++)\n if (prime[i])\n for (int j = i * i; j <= x; j += i)\n prime[j] = false;\n }\n static int[] sum;\n static void cumulitiveSum( int [] arr){\n sum = new int[arr.length];\n sum[0]=arr[0];\n for (int i = 1; i <arr.length; i++) {\n sum[i]=arr[i]+sum[i-1];\n }\n }\n static boolean isEven(long x ){\n return x % 2 == 0;\n }\n static boolean isPrime(long x ){\n boolean flag = true;\n int sqr = (int)Math.sqrt(x);\n if(x<2) return false;\n for (int i = 2; i <=sqr; i++) {\n if(x%i==0){\n flag=false;\n break;\n }\n }\n return flag;\n }\n static long factorial( long x) {\n long total = 1;\n for (int i = 2; i <= x; i++)\n total *= i;\n return total;\n }\n static long power(long x, long n) {\n if (n == 0) {\n return 1;\n }\n\n long pow = power(x, n / 2L);\n if ((n & 1) == 1) {\n return x * pow * pow;\n }\n\n return pow * pow;\n }\n\n public static void main(String [] args) {\n startTime = System.currentTimeMillis();\n // int T = sc.nextInt();while (T--!=0)\n {\n solve();\n }\n endTime = System.currentTimeMillis();\n long duration= endTime-startTime;\n //System.out.println(duration);\n }\n\n // static Scanner sc = new Scanner(System.in);\n\n static FastReader sc = new FastReader();\n public static void solve() {\n//////////////////////////////////////////////////////////////////////\n String s = sc.next(),t=sc.next();\n int ss=s.length(),tt=t.length();\n int match;\n int max_match=0;\n for (int i = 0; i <=ss-tt; i++) {\n match=0;\n int k=i;\n for (int j = 0; j < tt; j++) {\n if(s.charAt(k)==t.charAt(j)){\n match++;\n }\n k++;\n }\n max_match=Math.max(max_match,match);\n }\n System.out.println(tt-max_match);\n///////////////////////////////////////////////////////////////////////\n }\n\n}",
"Main",
"static long startTime;",
"startTime",
"static long endTime;",
"endTime",
"static Boolean [] prime ;",
"prime",
"static int M=(int)1e9+7;",
"M",
"(int)1e9+7",
"(int)1e9",
"7",
"static int MAX=Integer.MAX_VALUE;",
"MAX",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"static int MIN=Integer.MIN_VALUE;",
"MIN",
"Integer.MIN_VALUE",
"Integer",
"Integer.MIN_VALUE",
"static int SIZE = (int)1e9*2;",
"SIZE",
"(int)1e9*2",
"(int)1e9",
"2",
"static int[] sum;",
"sum",
"static FastReader sc = new FastReader();",
"sc",
"new FastReader()",
"static void printArray(int[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }",
"printArray",
"{\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }",
"int n = arr.length;",
"n",
"arr.length",
"arr",
"arr.length",
"for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"++i",
"++i",
"i",
"System.out.print(arr[i] + \" \");",
"System.out.print(arr[i] + \" \")",
"System.out.print",
"System.out",
"System",
"System.out",
"arr[i] + \" \"",
"arr[i]",
"arr",
"i",
"\" \"",
"System.out.println()",
"System.out.println",
"System.out",
"System",
"System.out",
"int[] arr",
"arr",
"static void printArray(long[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }",
"printArray",
"{\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }",
"int n = arr.length;",
"n",
"arr.length",
"arr",
"arr.length",
"for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"++i",
"++i",
"i",
"System.out.print(arr[i] + \" \");",
"System.out.print(arr[i] + \" \")",
"System.out.print",
"System.out",
"System",
"System.out",
"arr[i] + \" \"",
"arr[i]",
"arr",
"i",
"\" \"",
"System.out.println()",
"System.out.println",
"System.out",
"System",
"System.out",
"long[] arr",
"arr",
"static void printArray(Integer[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }",
"printArray",
"{\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }",
"int n = arr.length;",
"n",
"arr.length",
"arr",
"arr.length",
"for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"++i",
"++i",
"i",
"System.out.print(arr[i] + \" \");",
"System.out.print(arr[i] + \" \")",
"System.out.print",
"System.out",
"System",
"System.out",
"arr[i] + \" \"",
"arr[i]",
"arr",
"i",
"\" \"",
"System.out.println()",
"System.out.println",
"System.out",
"System",
"System.out",
"Integer[] arr",
"arr",
"static void printArray(Long[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }",
"printArray",
"{\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }",
"int n = arr.length;",
"n",
"arr.length",
"arr",
"arr.length",
"for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"++i",
"++i",
"i",
"System.out.print(arr[i] + \" \");",
"System.out.print(arr[i] + \" \")",
"System.out.print",
"System.out",
"System",
"System.out",
"arr[i] + \" \"",
"arr[i]",
"arr",
"i",
"\" \"",
"System.out.println()",
"System.out.println",
"System.out",
"System",
"System.out",
"Long[] arr",
"arr",
"static void yes(){\n System.out.println(\"YES\");\n }",
"yes",
"{\n System.out.println(\"YES\");\n }",
"System.out.println(\"YES\")",
"System.out.println",
"System.out",
"System",
"System.out",
"\"YES\"",
"static void no(){\n System.out.println(\"NO\");\n }",
"no",
"{\n System.out.println(\"NO\");\n }",
"System.out.println(\"NO\")",
"System.out.println",
"System.out",
"System",
"System.out",
"\"NO\"",
"public static int lowerBound\n (Integer[] array, int length, int value) {\n // Returns the index of the value or\n // if there is no value, returns the closest to the left.\n int low=-1; // arr[low]<=tar\n int hi=length;//arr[hi]>tar\n while (low+1<hi){ // while pointers are not neighboring(low+1!=hi)\n int mid=(low+hi)/2;\n if(array[mid]<=value){\n low=mid;\n }\n else {\n hi=mid;\n }\n }\n return low;// if no such element, returns -1.\n }",
"lowerBound",
"{\n // Returns the index of the value or\n // if there is no value, returns the closest to the left.\n int low=-1; // arr[low]<=tar\n int hi=length;//arr[hi]>tar\n while (low+1<hi){ // while pointers are not neighboring(low+1!=hi)\n int mid=(low+hi)/2;\n if(array[mid]<=value){\n low=mid;\n }\n else {\n hi=mid;\n }\n }\n return low;// if no such element, returns -1.\n }",
"int low=-1;",
"low",
"-1",
"1",
"int hi=length;",
"hi",
"length",
"while (low+1<hi){ // while pointers are not neighboring(low+1!=hi)\n int mid=(low+hi)/2;\n if(array[mid]<=value){\n low=mid;\n }\n else {\n hi=mid;\n }\n }",
"low+1<hi",
"low+1",
"low",
"1",
"hi",
"{ // while pointers are not neighboring(low+1!=hi)\n int mid=(low+hi)/2;\n if(array[mid]<=value){\n low=mid;\n }\n else {\n hi=mid;\n }\n }",
"int mid=(low+hi)/2;",
"mid",
"(low+hi)/2",
"(low+hi)",
"low",
"hi",
"2",
"if(array[mid]<=value){\n low=mid;\n }\n else {\n hi=mid;\n }",
"array[mid]<=value",
"array[mid]",
"array",
"mid",
"value",
"{\n low=mid;\n }",
"low=mid",
"low",
"mid",
"{\n hi=mid;\n }",
"hi=mid",
"hi",
"mid",
"return low;// if no such element, returns -1.",
"low",
"Integer[] array",
"array",
"int length",
"length",
"int value",
"value",
"public static int upperBound(Integer[] array, int length, int value){\n // returns the index of the value or\n // if the value does not exist, returns the closest to the right\n int low=-1; // arr[low]<tar\n int hi=length;// arr[hi]>=tar\n while (low+1<hi){// Eventually, pointers should be adjacent.\n int mid=(low+hi)>>1;\n if(array[mid]>=value){\n hi=mid;\n }\n else low=mid;\n }\n return hi;\n }",
"upperBound",
"{\n // returns the index of the value or\n // if the value does not exist, returns the closest to the right\n int low=-1; // arr[low]<tar\n int hi=length;// arr[hi]>=tar\n while (low+1<hi){// Eventually, pointers should be adjacent.\n int mid=(low+hi)>>1;\n if(array[mid]>=value){\n hi=mid;\n }\n else low=mid;\n }\n return hi;\n }",
"int low=-1;",
"low",
"-1",
"1",
"int hi=length;",
"hi",
"length",
"while (low+1<hi){// Eventually, pointers should be adjacent.\n int mid=(low+hi)>>1;\n if(array[mid]>=value){\n hi=mid;\n }\n else low=mid;\n }",
"low+1<hi",
"low+1",
"low",
"1",
"hi",
"{// Eventually, pointers should be adjacent.\n int mid=(low+hi)>>1;\n if(array[mid]>=value){\n hi=mid;\n }\n else low=mid;\n }",
"int mid=(low+hi)>>1;",
"mid",
"(low+hi)>>1",
"(low+hi)",
"low",
"hi",
"1",
"if(array[mid]>=value){\n hi=mid;\n }\n else low=mid;",
"array[mid]>=value",
"array[mid]",
"array",
"mid",
"value",
"{\n hi=mid;\n }",
"hi=mid",
"hi",
"mid",
"low=mid",
"low",
"mid",
"return hi;",
"hi",
"Integer[] array",
"array",
"int length",
"length",
"int value",
"value",
"public static int binarySearch(Integer [] arr, int length, int value){\n // returns the index of the targeted value or -1 if there is no value.\n int low=0;\n int hi=length-1;\n int ans=-1;\n while (low<=hi){\n int mid=(low+hi)>>1;\n if(arr[mid]>value){\n hi=mid-1;\n }\n else if(arr[mid]<value){\n low=mid+1;\n }\n else {\n ans=mid;\n break;\n }\n }\n return ans;\n }",
"binarySearch",
"{\n // returns the index of the targeted value or -1 if there is no value.\n int low=0;\n int hi=length-1;\n int ans=-1;\n while (low<=hi){\n int mid=(low+hi)>>1;\n if(arr[mid]>value){\n hi=mid-1;\n }\n else if(arr[mid]<value){\n low=mid+1;\n }\n else {\n ans=mid;\n break;\n }\n }\n return ans;\n }",
"int low=0;",
"low",
"0",
"int hi=length-1;",
"hi",
"length-1",
"length",
"1",
"int ans=-1;",
"ans",
"-1",
"1",
"while (low<=hi){\n int mid=(low+hi)>>1;\n if(arr[mid]>value){\n hi=mid-1;\n }\n else if(arr[mid]<value){\n low=mid+1;\n }\n else {\n ans=mid;\n break;\n }\n }",
"low<=hi",
"low",
"hi",
"{\n int mid=(low+hi)>>1;\n if(arr[mid]>value){\n hi=mid-1;\n }\n else if(arr[mid]<value){\n low=mid+1;\n }\n else {\n ans=mid;\n break;\n }\n }",
"int mid=(low+hi)>>1;",
"mid",
"(low+hi)>>1",
"(low+hi)",
"low",
"hi",
"1",
"if(arr[mid]>value){\n hi=mid-1;\n }\n else if(arr[mid]<value){\n low=mid+1;\n }\n else {\n ans=mid;\n break;\n }",
"arr[mid]>value",
"arr[mid]",
"arr",
"mid",
"value",
"{\n hi=mid-1;\n }",
"hi=mid-1",
"hi",
"mid-1",
"mid",
"1",
"if(arr[mid]<value){\n low=mid+1;\n }\n else {\n ans=mid;\n break;\n }",
"arr[mid]<value",
"arr[mid]",
"arr",
"mid",
"value",
"{\n low=mid+1;\n }",
"low=mid+1",
"low",
"mid+1",
"mid",
"1",
"{\n ans=mid;\n break;\n }",
"ans=mid",
"ans",
"mid",
"break;",
"return ans;",
"ans",
"Integer [] arr",
"arr",
"int length",
"length",
"int value",
"value",
"public static long gcd(long a, long b){\n if (b == 0)\n return a;\n else return gcd(b, a % b);\n }",
"gcd",
"{\n if (b == 0)\n return a;\n else return gcd(b, a % b);\n }",
"if (b == 0)\n return a;\n else return gcd(b, a % b);",
"b == 0",
"b",
"0",
"return a;",
"a",
"return gcd(b, a % b);",
"gcd(b, a % b)",
"gcd",
"b",
"a % b",
"a",
"b",
"long a",
"a",
"long b",
"b",
"public static long lcm(long a , long b){\n return a/gcd(a,b)*b;\n }",
"lcm",
"{\n return a/gcd(a,b)*b;\n }",
"return a/gcd(a,b)*b;",
"a/gcd(a,b)*b",
"a/gcd(a,b)",
"a",
"gcd(a,b)",
"gcd",
"a",
"b",
"b",
"long a",
"a",
"long b",
"b",
"public static long countDivs(long n ){\n int cn=0;\n long sqr = (long)Math.sqrt(n);\n for (long i = 1; i<=sqr ; ++i) {\n if(n%i==0){\n ++cn;\n }\n }\n cn*=2;\n if(sqr*sqr==n) cn--;\n return cn;\n\n }",
"countDivs",
"{\n int cn=0;\n long sqr = (long)Math.sqrt(n);\n for (long i = 1; i<=sqr ; ++i) {\n if(n%i==0){\n ++cn;\n }\n }\n cn*=2;\n if(sqr*sqr==n) cn--;\n return cn;\n\n }",
"int cn=0;",
"cn",
"0",
"long sqr = (long)Math.sqrt(n);",
"sqr",
"(long)Math.sqrt(n)",
"Math.sqrt",
"Math",
"n",
"for (long i = 1; i<=sqr ; ++i) {\n if(n%i==0){\n ++cn;\n }\n }",
"long i = 1;",
"long i = 1;",
"i",
"1",
"i<=sqr",
"i",
"sqr",
"++i",
"++i",
"i",
"{\n if(n%i==0){\n ++cn;\n }\n }",
"{\n if(n%i==0){\n ++cn;\n }\n }",
"if(n%i==0){\n ++cn;\n }",
"n%i==0",
"n%i",
"n",
"i",
"0",
"{\n ++cn;\n }",
"++cn",
"cn",
"cn*=2",
"cn",
"2",
"if(sqr*sqr==n) cn--;",
"sqr*sqr==n",
"sqr*sqr",
"sqr",
"sqr",
"n",
"cn--",
"cn",
"return cn;",
"cn",
"long n",
"n",
"static void prime(int x) {\n //sieve algorithm. nlog(log(n)).\n prime=new Boolean[ (x+1)];\n Arrays.fill(prime,true);\n prime[0] = prime[1] = false;\n for (int i = 2; i * i <= x ; i++)\n if (prime[i])\n for (int j = i * i; j <= x; j += i)\n prime[j] = false;\n }",
"prime",
"{\n //sieve algorithm. nlog(log(n)).\n prime=new Boolean[ (x+1)];\n Arrays.fill(prime,true);\n prime[0] = prime[1] = false;\n for (int i = 2; i * i <= x ; i++)\n if (prime[i])\n for (int j = i * i; j <= x; j += i)\n prime[j] = false;\n }",
"prime=new Boolean[ (x+1)]",
"prime",
"new Boolean[ (x+1)]",
"(x+1)",
"x",
"1",
"Arrays.fill(prime,true)",
"Arrays.fill",
"Arrays",
"prime",
"true",
"prime[0] = prime[1] = false",
"prime[0]",
"prime",
"0",
"prime[1] = false",
"prime[1]",
"prime",
"1",
"false",
"for (int i = 2; i * i <= x ; i++)\n if (prime[i])\n for (int j = i * i; j <= x; j += i)\n prime[j] = false;",
"int i = 2;",
"int i = 2;",
"i",
"2",
"i * i <= x",
"i * i",
"i",
"i",
"x",
"i++",
"i++",
"i",
"if (prime[i])\n for (int j = i * i; j <= x; j += i)\n prime[j] = false;",
"if (prime[i])\n for (int j = i * i; j <= x; j += i)\n prime[j] = false;",
"prime[i]",
"prime",
"i",
"for (int j = i * i; j <= x; j += i)\n prime[j] = false;",
"int j = i * i;",
"int j = i * i;",
"j",
"i * i",
"i",
"i",
"j <= x",
"j",
"x",
"j += i",
"j += i",
"j",
"i",
"prime[j] = false;",
"prime[j] = false",
"prime[j]",
"prime",
"j",
"false",
"int x",
"x",
"static void cumulitiveSum( int [] arr){\n sum = new int[arr.length];\n sum[0]=arr[0];\n for (int i = 1; i <arr.length; i++) {\n sum[i]=arr[i]+sum[i-1];\n }\n }",
"cumulitiveSum",
"{\n sum = new int[arr.length];\n sum[0]=arr[0];\n for (int i = 1; i <arr.length; i++) {\n sum[i]=arr[i]+sum[i-1];\n }\n }",
"sum = new int[arr.length]",
"sum",
"new int[arr.length]",
"arr.length",
"arr",
"arr.length",
"sum[0]=arr[0]",
"sum[0]",
"sum",
"0",
"arr[0]",
"arr",
"0",
"for (int i = 1; i <arr.length; i++) {\n sum[i]=arr[i]+sum[i-1];\n }",
"int i = 1;",
"int i = 1;",
"i",
"1",
"i <arr.length",
"i",
"arr.length",
"arr",
"arr.length",
"i++",
"i++",
"i",
"{\n sum[i]=arr[i]+sum[i-1];\n }",
"{\n sum[i]=arr[i]+sum[i-1];\n }",
"sum[i]=arr[i]+sum[i-1]",
"sum[i]",
"sum",
"i",
"arr[i]+sum[i-1]",
"arr[i]",
"arr",
"i",
"sum[i-1]",
"sum",
"i-1",
"i",
"1",
"int [] arr",
"arr",
"static boolean isEven(long x ){\n return x % 2 == 0;\n }",
"isEven",
"{\n return x % 2 == 0;\n }",
"return x % 2 == 0;",
"x % 2 == 0",
"x % 2",
"x",
"2",
"0",
"long x",
"x",
"static boolean isPrime(long x ){\n boolean flag = true;\n int sqr = (int)Math.sqrt(x);\n if(x<2) return false;\n for (int i = 2; i <=sqr; i++) {\n if(x%i==0){\n flag=false;\n break;\n }\n }\n return flag;\n }",
"isPrime",
"{\n boolean flag = true;\n int sqr = (int)Math.sqrt(x);\n if(x<2) return false;\n for (int i = 2; i <=sqr; i++) {\n if(x%i==0){\n flag=false;\n break;\n }\n }\n return flag;\n }",
"boolean flag = true;",
"flag",
"true",
"int sqr = (int)Math.sqrt(x);",
"sqr",
"(int)Math.sqrt(x)",
"Math.sqrt",
"Math",
"x",
"if(x<2) return false;",
"x<2",
"x",
"2",
"return false;",
"false",
"for (int i = 2; i <=sqr; i++) {\n if(x%i==0){\n flag=false;\n break;\n }\n }",
"int i = 2;",
"int i = 2;",
"i",
"2",
"i <=sqr",
"i",
"sqr",
"i++",
"i++",
"i",
"{\n if(x%i==0){\n flag=false;\n break;\n }\n }",
"{\n if(x%i==0){\n flag=false;\n break;\n }\n }",
"if(x%i==0){\n flag=false;\n break;\n }",
"x%i==0",
"x%i",
"x",
"i",
"0",
"{\n flag=false;\n break;\n }",
"flag=false",
"flag",
"false",
"break;",
"return flag;",
"flag",
"long x",
"x",
"static long factorial( long x) {\n long total = 1;\n for (int i = 2; i <= x; i++)\n total *= i;\n return total;\n }",
"factorial",
"{\n long total = 1;\n for (int i = 2; i <= x; i++)\n total *= i;\n return total;\n }",
"long total = 1;",
"total",
"1",
"for (int i = 2; i <= x; i++)\n total *= i;",
"int i = 2;",
"int i = 2;",
"i",
"2",
"i <= x",
"i",
"x",
"i++",
"i++",
"i",
"total *= i;",
"total *= i",
"total",
"i",
"return total;",
"total",
"long x",
"x",
"static long power(long x, long n) {\n if (n == 0) {\n return 1;\n }\n\n long pow = power(x, n / 2L);\n if ((n & 1) == 1) {\n return x * pow * pow;\n }\n\n return pow * pow;\n }",
"power",
"{\n if (n == 0) {\n return 1;\n }\n\n long pow = power(x, n / 2L);\n if ((n & 1) == 1) {\n return x * pow * pow;\n }\n\n return pow * pow;\n }",
"if (n == 0) {\n return 1;\n }",
"n == 0",
"n",
"0",
"{\n return 1;\n }",
"return 1;",
"1",
"long pow = power(x, n / 2L);",
"pow",
"power(x, n / 2L)",
"power",
"x",
"n / 2L",
"n",
"2L",
"if ((n & 1) == 1) {\n return x * pow * pow;\n }",
"(n & 1) == 1",
"(n & 1)",
"n",
"1",
"1",
"{\n return x * pow * pow;\n }",
"return x * pow * pow;",
"x * pow * pow",
"x * pow * pow",
"x",
"pow",
"pow",
"return pow * pow;",
"pow * pow",
"pow",
"pow",
"long x",
"x",
"long n",
"n",
"public static void main(String [] args) {\n startTime = System.currentTimeMillis();\n // int T = sc.nextInt();while (T--!=0)\n {\n solve();\n }\n endTime = System.currentTimeMillis();\n long duration= endTime-startTime;\n //System.out.println(duration);\n }",
"main",
"{\n startTime = System.currentTimeMillis();\n // int T = sc.nextInt();while (T--!=0)\n {\n solve();\n }\n endTime = System.currentTimeMillis();\n long duration= endTime-startTime;\n //System.out.println(duration);\n }",
"startTime = System.currentTimeMillis()",
"startTime",
"System.currentTimeMillis()",
"System.currentTimeMillis",
"System",
"{\n solve();\n }",
"solve()",
"solve",
"endTime = System.currentTimeMillis()",
"endTime",
"System.currentTimeMillis()",
"System.currentTimeMillis",
"System",
"long duration= endTime-startTime;",
"duration",
"endTime-startTime",
"endTime",
"startTime",
"String [] args",
"args",
"public static void solve() {\n//////////////////////////////////////////////////////////////////////\n String s = sc.next(),t=sc.next();\n int ss=s.length(),tt=t.length();\n int match;\n int max_match=0;\n for (int i = 0; i <=ss-tt; i++) {\n match=0;\n int k=i;\n for (int j = 0; j < tt; j++) {\n if(s.charAt(k)==t.charAt(j)){\n match++;\n }\n k++;\n }\n max_match=Math.max(max_match,match);\n }\n System.out.println(tt-max_match);\n///////////////////////////////////////////////////////////////////////\n }",
"solve",
"{\n//////////////////////////////////////////////////////////////////////\n String s = sc.next(),t=sc.next();\n int ss=s.length(),tt=t.length();\n int match;\n int max_match=0;\n for (int i = 0; i <=ss-tt; i++) {\n match=0;\n int k=i;\n for (int j = 0; j < tt; j++) {\n if(s.charAt(k)==t.charAt(j)){\n match++;\n }\n k++;\n }\n max_match=Math.max(max_match,match);\n }\n System.out.println(tt-max_match);\n///////////////////////////////////////////////////////////////////////\n }",
"String s = sc.next()",
"s",
"sc.next()",
"sc.next",
"sc",
"t=sc.next();",
"t",
"sc.next()",
"sc.next",
"sc",
"int ss=s.length()",
"ss",
"s.length()",
"s.length",
"s",
"tt=t.length();",
"tt",
"t.length()",
"t.length",
"t",
"int match;",
"match",
"int max_match=0;",
"max_match",
"0",
"for (int i = 0; i <=ss-tt; i++) {\n match=0;\n int k=i;\n for (int j = 0; j < tt; j++) {\n if(s.charAt(k)==t.charAt(j)){\n match++;\n }\n k++;\n }\n max_match=Math.max(max_match,match);\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <=ss-tt",
"i",
"ss-tt",
"ss",
"tt",
"i++",
"i++",
"i",
"{\n match=0;\n int k=i;\n for (int j = 0; j < tt; j++) {\n if(s.charAt(k)==t.charAt(j)){\n match++;\n }\n k++;\n }\n max_match=Math.max(max_match,match);\n }",
"{\n match=0;\n int k=i;\n for (int j = 0; j < tt; j++) {\n if(s.charAt(k)==t.charAt(j)){\n match++;\n }\n k++;\n }\n max_match=Math.max(max_match,match);\n }",
"match=0",
"match",
"0",
"int k=i;",
"k",
"i",
"for (int j = 0; j < tt; j++) {\n if(s.charAt(k)==t.charAt(j)){\n match++;\n }\n k++;\n }",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < tt",
"j",
"tt",
"j++",
"j++",
"j",
"{\n if(s.charAt(k)==t.charAt(j)){\n match++;\n }\n k++;\n }",
"{\n if(s.charAt(k)==t.charAt(j)){\n match++;\n }\n k++;\n }",
"if(s.charAt(k)==t.charAt(j)){\n match++;\n }",
"s.charAt(k)==t.charAt(j)",
"s.charAt(k)",
"s.charAt",
"s",
"k",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"{\n match++;\n }",
"match++",
"match",
"k++",
"k",
"max_match=Math.max(max_match,match)",
"max_match",
"Math.max(max_match,match)",
"Math.max",
"Math",
"max_match",
"match",
"System.out.println(tt-max_match)",
"System.out.println",
"System.out",
"System",
"System.out",
"tt-max_match",
"tt",
"max_match",
"static class FastReader{\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader()\n {\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }\n\n String next()\n {\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n long nextLong()\n {\n return Long.parseLong(next());\n }\n\n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n }",
"FastReader",
"BufferedReader br;",
"br",
"StringTokenizer st;",
"st",
"public FastReader()\n {\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }",
"FastReader",
"{\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }",
"br = new BufferedReader(new\n InputStreamReader(System.in))",
"br",
"new BufferedReader(new\n InputStreamReader(System.in))",
"String next()\n {\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }",
"next",
"{\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }",
"while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }",
"st == null || !st.hasMoreElements()",
"st == null",
"st",
"null",
"!st.hasMoreElements()",
"st.hasMoreElements()",
"st.hasMoreElements",
"st",
"{\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }",
"try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }",
"catch (IOException e)\n {\n e.printStackTrace();\n }",
"IOException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n st = new StringTokenizer(br.readLine());\n }",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"int nextInt()\n {\n return Integer.parseInt(next());\n }",
"nextInt",
"{\n return Integer.parseInt(next());\n }",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"long nextLong()\n {\n return Long.parseLong(next());\n }",
"nextLong",
"{\n return Long.parseLong(next());\n }",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"double nextDouble()\n {\n return Double.parseDouble(next());\n }",
"nextDouble",
"{\n return Double.parseDouble(next());\n }",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }",
"nextLine",
"{\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }",
"String str = \"\";",
"str",
"\"\"",
"try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }",
"catch (IOException e)\n {\n e.printStackTrace();\n }",
"IOException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n str = br.readLine();\n }",
"str = br.readLine()",
"str",
"br.readLine()",
"br.readLine",
"br",
"return str;",
"str",
"public class Main {\n static long startTime;\n static long endTime;\n static Boolean [] prime ;\n static int M=(int)1e9+7;\n static int MAX=Integer.MAX_VALUE;\n static int MIN=Integer.MIN_VALUE;\n static int SIZE = (int)1e9*2;\n static class FastReader{\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader()\n {\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }\n\n String next()\n {\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n long nextLong()\n {\n return Long.parseLong(next());\n }\n\n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n }\n static void printArray(int[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }\n static void printArray(long[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }\n static void printArray(Integer[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }\n static void printArray(Long[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }\n static void yes(){\n System.out.println(\"YES\");\n }\n static void no(){\n System.out.println(\"NO\");\n }\n public static int lowerBound\n (Integer[] array, int length, int value) {\n // Returns the index of the value or\n // if there is no value, returns the closest to the left.\n int low=-1; // arr[low]<=tar\n int hi=length;//arr[hi]>tar\n while (low+1<hi){ // while pointers are not neighboring(low+1!=hi)\n int mid=(low+hi)/2;\n if(array[mid]<=value){\n low=mid;\n }\n else {\n hi=mid;\n }\n }\n return low;// if no such element, returns -1.\n }\n public static int upperBound(Integer[] array, int length, int value){\n // returns the index of the value or\n // if the value does not exist, returns the closest to the right\n int low=-1; // arr[low]<tar\n int hi=length;// arr[hi]>=tar\n while (low+1<hi){// Eventually, pointers should be adjacent.\n int mid=(low+hi)>>1;\n if(array[mid]>=value){\n hi=mid;\n }\n else low=mid;\n }\n return hi;\n }\n public static int binarySearch(Integer [] arr, int length, int value){\n // returns the index of the targeted value or -1 if there is no value.\n int low=0;\n int hi=length-1;\n int ans=-1;\n while (low<=hi){\n int mid=(low+hi)>>1;\n if(arr[mid]>value){\n hi=mid-1;\n }\n else if(arr[mid]<value){\n low=mid+1;\n }\n else {\n ans=mid;\n break;\n }\n }\n return ans;\n }\n public static long gcd(long a, long b){\n if (b == 0)\n return a;\n else return gcd(b, a % b);\n }\n public static long lcm(long a , long b){\n return a/gcd(a,b)*b;\n }\n public static long countDivs(long n ){\n int cn=0;\n long sqr = (long)Math.sqrt(n);\n for (long i = 1; i<=sqr ; ++i) {\n if(n%i==0){\n ++cn;\n }\n }\n cn*=2;\n if(sqr*sqr==n) cn--;\n return cn;\n\n }\n static void prime(int x) {\n //sieve algorithm. nlog(log(n)).\n prime=new Boolean[ (x+1)];\n Arrays.fill(prime,true);\n prime[0] = prime[1] = false;\n for (int i = 2; i * i <= x ; i++)\n if (prime[i])\n for (int j = i * i; j <= x; j += i)\n prime[j] = false;\n }\n static int[] sum;\n static void cumulitiveSum( int [] arr){\n sum = new int[arr.length];\n sum[0]=arr[0];\n for (int i = 1; i <arr.length; i++) {\n sum[i]=arr[i]+sum[i-1];\n }\n }\n static boolean isEven(long x ){\n return x % 2 == 0;\n }\n static boolean isPrime(long x ){\n boolean flag = true;\n int sqr = (int)Math.sqrt(x);\n if(x<2) return false;\n for (int i = 2; i <=sqr; i++) {\n if(x%i==0){\n flag=false;\n break;\n }\n }\n return flag;\n }\n static long factorial( long x) {\n long total = 1;\n for (int i = 2; i <= x; i++)\n total *= i;\n return total;\n }\n static long power(long x, long n) {\n if (n == 0) {\n return 1;\n }\n\n long pow = power(x, n / 2L);\n if ((n & 1) == 1) {\n return x * pow * pow;\n }\n\n return pow * pow;\n }\n\n public static void main(String [] args) {\n startTime = System.currentTimeMillis();\n // int T = sc.nextInt();while (T--!=0)\n {\n solve();\n }\n endTime = System.currentTimeMillis();\n long duration= endTime-startTime;\n //System.out.println(duration);\n }\n\n // static Scanner sc = new Scanner(System.in);\n\n static FastReader sc = new FastReader();\n public static void solve() {\n//////////////////////////////////////////////////////////////////////\n String s = sc.next(),t=sc.next();\n int ss=s.length(),tt=t.length();\n int match;\n int max_match=0;\n for (int i = 0; i <=ss-tt; i++) {\n match=0;\n int k=i;\n for (int j = 0; j < tt; j++) {\n if(s.charAt(k)==t.charAt(j)){\n match++;\n }\n k++;\n }\n max_match=Math.max(max_match,match);\n }\n System.out.println(tt-max_match);\n///////////////////////////////////////////////////////////////////////\n }\n\n}",
"public class Main {\n static long startTime;\n static long endTime;\n static Boolean [] prime ;\n static int M=(int)1e9+7;\n static int MAX=Integer.MAX_VALUE;\n static int MIN=Integer.MIN_VALUE;\n static int SIZE = (int)1e9*2;\n static class FastReader{\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader()\n {\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }\n\n String next()\n {\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n long nextLong()\n {\n return Long.parseLong(next());\n }\n\n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n }\n static void printArray(int[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }\n static void printArray(long[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }\n static void printArray(Integer[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }\n static void printArray(Long[] arr)\n {\n int n = arr.length;\n for (int i = 0; i < n; ++i)\n System.out.print(arr[i] + \" \");\n System.out.println();\n }\n static void yes(){\n System.out.println(\"YES\");\n }\n static void no(){\n System.out.println(\"NO\");\n }\n public static int lowerBound\n (Integer[] array, int length, int value) {\n // Returns the index of the value or\n // if there is no value, returns the closest to the left.\n int low=-1; // arr[low]<=tar\n int hi=length;//arr[hi]>tar\n while (low+1<hi){ // while pointers are not neighboring(low+1!=hi)\n int mid=(low+hi)/2;\n if(array[mid]<=value){\n low=mid;\n }\n else {\n hi=mid;\n }\n }\n return low;// if no such element, returns -1.\n }\n public static int upperBound(Integer[] array, int length, int value){\n // returns the index of the value or\n // if the value does not exist, returns the closest to the right\n int low=-1; // arr[low]<tar\n int hi=length;// arr[hi]>=tar\n while (low+1<hi){// Eventually, pointers should be adjacent.\n int mid=(low+hi)>>1;\n if(array[mid]>=value){\n hi=mid;\n }\n else low=mid;\n }\n return hi;\n }\n public static int binarySearch(Integer [] arr, int length, int value){\n // returns the index of the targeted value or -1 if there is no value.\n int low=0;\n int hi=length-1;\n int ans=-1;\n while (low<=hi){\n int mid=(low+hi)>>1;\n if(arr[mid]>value){\n hi=mid-1;\n }\n else if(arr[mid]<value){\n low=mid+1;\n }\n else {\n ans=mid;\n break;\n }\n }\n return ans;\n }\n public static long gcd(long a, long b){\n if (b == 0)\n return a;\n else return gcd(b, a % b);\n }\n public static long lcm(long a , long b){\n return a/gcd(a,b)*b;\n }\n public static long countDivs(long n ){\n int cn=0;\n long sqr = (long)Math.sqrt(n);\n for (long i = 1; i<=sqr ; ++i) {\n if(n%i==0){\n ++cn;\n }\n }\n cn*=2;\n if(sqr*sqr==n) cn--;\n return cn;\n\n }\n static void prime(int x) {\n //sieve algorithm. nlog(log(n)).\n prime=new Boolean[ (x+1)];\n Arrays.fill(prime,true);\n prime[0] = prime[1] = false;\n for (int i = 2; i * i <= x ; i++)\n if (prime[i])\n for (int j = i * i; j <= x; j += i)\n prime[j] = false;\n }\n static int[] sum;\n static void cumulitiveSum( int [] arr){\n sum = new int[arr.length];\n sum[0]=arr[0];\n for (int i = 1; i <arr.length; i++) {\n sum[i]=arr[i]+sum[i-1];\n }\n }\n static boolean isEven(long x ){\n return x % 2 == 0;\n }\n static boolean isPrime(long x ){\n boolean flag = true;\n int sqr = (int)Math.sqrt(x);\n if(x<2) return false;\n for (int i = 2; i <=sqr; i++) {\n if(x%i==0){\n flag=false;\n break;\n }\n }\n return flag;\n }\n static long factorial( long x) {\n long total = 1;\n for (int i = 2; i <= x; i++)\n total *= i;\n return total;\n }\n static long power(long x, long n) {\n if (n == 0) {\n return 1;\n }\n\n long pow = power(x, n / 2L);\n if ((n & 1) == 1) {\n return x * pow * pow;\n }\n\n return pow * pow;\n }\n\n public static void main(String [] args) {\n startTime = System.currentTimeMillis();\n // int T = sc.nextInt();while (T--!=0)\n {\n solve();\n }\n endTime = System.currentTimeMillis();\n long duration= endTime-startTime;\n //System.out.println(duration);\n }\n\n // static Scanner sc = new Scanner(System.in);\n\n static FastReader sc = new FastReader();\n public static void solve() {\n//////////////////////////////////////////////////////////////////////\n String s = sc.next(),t=sc.next();\n int ss=s.length(),tt=t.length();\n int match;\n int max_match=0;\n for (int i = 0; i <=ss-tt; i++) {\n match=0;\n int k=i;\n for (int j = 0; j < tt; j++) {\n if(s.charAt(k)==t.charAt(j)){\n match++;\n }\n k++;\n }\n max_match=Math.max(max_match,match);\n }\n System.out.println(tt-max_match);\n///////////////////////////////////////////////////////////////////////\n }\n\n}",
"Main"
]
| import java.io.*;
import java.util.*;
public class Main {
static long startTime;
static long endTime;
static Boolean [] prime ;
static int M=(int)1e9+7;
static int MAX=Integer.MAX_VALUE;
static int MIN=Integer.MIN_VALUE;
static int SIZE = (int)1e9*2;
static class FastReader{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements())
{
try
{
st = new StringTokenizer(br.readLine());
}
catch (IOException e)
{
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt()
{
return Integer.parseInt(next());
}
long nextLong()
{
return Long.parseLong(next());
}
double nextDouble()
{
return Double.parseDouble(next());
}
String nextLine()
{
String str = "";
try
{
str = br.readLine();
}
catch (IOException e)
{
e.printStackTrace();
}
return str;
}
}
static void printArray(int[] arr)
{
int n = arr.length;
for (int i = 0; i < n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
}
static void printArray(long[] arr)
{
int n = arr.length;
for (int i = 0; i < n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
}
static void printArray(Integer[] arr)
{
int n = arr.length;
for (int i = 0; i < n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
}
static void printArray(Long[] arr)
{
int n = arr.length;
for (int i = 0; i < n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
}
static void yes(){
System.out.println("YES");
}
static void no(){
System.out.println("NO");
}
public static int lowerBound
(Integer[] array, int length, int value) {
// Returns the index of the value or
// if there is no value, returns the closest to the left.
int low=-1; // arr[low]<=tar
int hi=length;//arr[hi]>tar
while (low+1<hi){ // while pointers are not neighboring(low+1!=hi)
int mid=(low+hi)/2;
if(array[mid]<=value){
low=mid;
}
else {
hi=mid;
}
}
return low;// if no such element, returns -1.
}
public static int upperBound(Integer[] array, int length, int value){
// returns the index of the value or
// if the value does not exist, returns the closest to the right
int low=-1; // arr[low]<tar
int hi=length;// arr[hi]>=tar
while (low+1<hi){// Eventually, pointers should be adjacent.
int mid=(low+hi)>>1;
if(array[mid]>=value){
hi=mid;
}
else low=mid;
}
return hi;
}
public static int binarySearch(Integer [] arr, int length, int value){
// returns the index of the targeted value or -1 if there is no value.
int low=0;
int hi=length-1;
int ans=-1;
while (low<=hi){
int mid=(low+hi)>>1;
if(arr[mid]>value){
hi=mid-1;
}
else if(arr[mid]<value){
low=mid+1;
}
else {
ans=mid;
break;
}
}
return ans;
}
public static long gcd(long a, long b){
if (b == 0)
return a;
else return gcd(b, a % b);
}
public static long lcm(long a , long b){
return a/gcd(a,b)*b;
}
public static long countDivs(long n ){
int cn=0;
long sqr = (long)Math.sqrt(n);
for (long i = 1; i<=sqr ; ++i) {
if(n%i==0){
++cn;
}
}
cn*=2;
if(sqr*sqr==n) cn--;
return cn;
}
static void prime(int x) {
//sieve algorithm. nlog(log(n)).
prime=new Boolean[ (x+1)];
Arrays.fill(prime,true);
prime[0] = prime[1] = false;
for (int i = 2; i * i <= x ; i++)
if (prime[i])
for (int j = i * i; j <= x; j += i)
prime[j] = false;
}
static int[] sum;
static void cumulitiveSum( int [] arr){
sum = new int[arr.length];
sum[0]=arr[0];
for (int i = 1; i <arr.length; i++) {
sum[i]=arr[i]+sum[i-1];
}
}
static boolean isEven(long x ){
return x % 2 == 0;
}
static boolean isPrime(long x ){
boolean flag = true;
int sqr = (int)Math.sqrt(x);
if(x<2) return false;
for (int i = 2; i <=sqr; i++) {
if(x%i==0){
flag=false;
break;
}
}
return flag;
}
static long factorial( long x) {
long total = 1;
for (int i = 2; i <= x; i++)
total *= i;
return total;
}
static long power(long x, long n) {
if (n == 0) {
return 1;
}
long pow = power(x, n / 2L);
if ((n & 1) == 1) {
return x * pow * pow;
}
return pow * pow;
}
public static void main(String [] args) {
startTime = System.currentTimeMillis();
// int T = sc.nextInt();while (T--!=0)
{
solve();
}
endTime = System.currentTimeMillis();
long duration= endTime-startTime;
//System.out.println(duration);
}
// static Scanner sc = new Scanner(System.in);
static FastReader sc = new FastReader();
public static void solve() {
//////////////////////////////////////////////////////////////////////
String s = sc.next(),t=sc.next();
int ss=s.length(),tt=t.length();
int match;
int max_match=0;
for (int i = 0; i <=ss-tt; i++) {
match=0;
int k=i;
for (int j = 0; j < tt; j++) {
if(s.charAt(k)==t.charAt(j)){
match++;
}
k++;
}
max_match=Math.max(max_match,match);
}
System.out.println(tt-max_match);
///////////////////////////////////////////////////////////////////////
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
41,
13,
41,
13,
17,
41,
13,
20,
17,
41,
13,
17,
41,
13,
17,
12,
13,
30,
41,
13,
4,
13,
41,
13,
4,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
41,
13,
13,
41,
13,
17,
14,
2,
2,
13,
13,
13,
3,
42,
2,
13,
13,
30,
14,
2,
4,
18,
13,
40,
13,
4,
18,
13,
40,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
13,
13,
12,
13,
30,
0,
13,
8,
4,
18,
13,
18,
13,
13,
20,
0,
13,
20,
41,
13,
4,
18,
13,
4,
13,
4,
18,
13,
14,
40,
4,
18,
13,
4,
13,
2,
2,
4,
18,
13,
13,
17,
12,
13,
30,
4,
18,
20,
23,
13,
12,
13,
30,
14,
2,
13,
40,
17,
37,
20,
14,
2,
13,
13,
30,
0,
13,
17,
38,
5,
13,
30,
37,
20,
30,
0,
13,
4,
18,
13,
13,
14,
2,
13,
17,
29,
40,
17,
29,
18,
13,
40,
13,
12,
13,
30,
29,
40,
2,
2,
13,
17,
2,
13,
17,
23,
13,
12,
13,
30,
41,
13,
42,
2,
2,
0,
13,
4,
13,
40,
17,
4,
13,
13,
29,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
13,
12,
13,
30,
41,
13,
4,
13,
41,
13,
20,
42,
40,
4,
13,
13,
30,
4,
18,
13,
13,
0,
13,
4,
13,
29,
4,
18,
13,
12,
13,
30,
41,
13,
20,
13,
41,
13,
4,
13,
41,
13,
17,
42,
2,
2,
13,
13,
40,
4,
13,
13,
30,
0,
18,
13,
40,
13,
13,
0,
13,
4,
13,
29,
8,
2,
13,
13,
13,
4,
18,
13,
13,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
13,
29,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
17,
41,
13,
41,
13,
17,
42,
2,
2,
0,
13,
4,
13,
40,
17,
40,
2,
2,
2,
13,
17,
2,
13,
17,
2,
13,
17,
14,
2,
13,
17,
30,
0,
13,
17,
0,
13,
4,
13,
42,
17,
30,
14,
2,
2,
13,
17,
2,
13,
17,
30,
0,
13,
2,
2,
13,
17,
2,
13,
17,
30,
29,
8,
13,
40,
13,
13,
0,
13,
4,
13,
12,
13,
30,
41,
13,
17,
41,
13,
41,
13,
17,
42,
2,
2,
0,
13,
4,
13,
40,
17,
40,
2,
2,
2,
13,
17,
2,
13,
17,
2,
13,
17,
14,
2,
13,
17,
30,
0,
13,
17,
0,
13,
4,
13,
42,
17,
30,
14,
2,
2,
13,
17,
2,
13,
17,
30,
0,
13,
2,
2,
13,
17,
2,
13,
17,
30,
29,
8,
13,
40,
13,
13,
0,
13,
4,
13,
12,
13,
30,
14,
2,
4,
18,
13,
17,
4,
18,
18,
13,
13,
4,
18,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
568,
17
],
[
568,
18
],
[
18,
19
],
[
568,
20
],
[
20,
21
],
[
568,
22
],
[
22,
23
],
[
22,
24
],
[
568,
25
],
[
25,
26
],
[
25,
27
],
[
568,
29
],
[
29,
30
],
[
29,
31
],
[
568,
32
],
[
32,
33
],
[
32,
34
],
[
568,
35
],
[
35,
36
],
[
35,
37
],
[
37,
38
],
[
38,
39
],
[
38,
40
],
[
40,
41
],
[
37,
42
],
[
42,
43
],
[
42,
44
],
[
44,
45
],
[
37,
46
],
[
46,
47
],
[
46,
48
],
[
48,
49
],
[
49,
50
],
[
37,
51
],
[
51,
52
],
[
51,
53
],
[
53,
54
],
[
54,
55
],
[
37,
56
],
[
56,
57
],
[
56,
58
],
[
58,
59
],
[
58,
60
],
[
37,
61
],
[
61,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
61,
66
],
[
66,
67
],
[
66,
68
],
[
61,
69
],
[
69,
70
],
[
70,
71
],
[
61,
72
],
[
73,
73
],
[
73,
74
],
[
74,
75
],
[
74,
76
],
[
73,
77
],
[
77,
78
],
[
77,
79
],
[
73,
80
],
[
80,
81
],
[
80,
82
],
[
73,
83
],
[
83,
84
],
[
84,
85
],
[
85,
86
],
[
85,
87
],
[
84,
88
],
[
83,
89
],
[
73,
90
],
[
90,
91
],
[
91,
92
],
[
91,
93
],
[
90,
94
],
[
94,
95
],
[
95,
96
],
[
96,
97
],
[
97,
98
],
[
98,
99
],
[
97,
100
],
[
100,
101
],
[
96,
102
],
[
102,
103
],
[
103,
104
],
[
102,
105
],
[
105,
106
],
[
95,
107
],
[
107,
108
],
[
73,
109
],
[
109,
110
],
[
109,
111
],
[
111,
112
],
[
112,
113
],
[
111,
114
],
[
111,
115
],
[
37,
116
],
[
116,
117
],
[
117,
118
],
[
116,
119
],
[
568,
120
],
[
120,
121
],
[
120,
122
],
[
122,
123
],
[
123,
124
],
[
123,
125
],
[
125,
126
],
[
126,
127
],
[
127,
128
],
[
125,
129
],
[
129,
130
],
[
129,
131
],
[
125,
132
],
[
122,
133
],
[
133,
134
],
[
133,
135
],
[
122,
136
],
[
136,
137
],
[
136,
138
],
[
138,
139
],
[
139,
140
],
[
122,
141
],
[
141,
142
],
[
122,
143
],
[
143,
144
],
[
144,
145
],
[
122,
146
],
[
146,
147
],
[
147,
148
],
[
148,
149
],
[
149,
150
],
[
146,
151
],
[
151,
152
],
[
151,
153
],
[
153,
154
],
[
154,
155
],
[
155,
156
],
[
156,
157
],
[
154,
158
],
[
153,
159
],
[
568,
160
],
[
160,
161
],
[
160,
162
],
[
162,
163
],
[
163,
164
],
[
164,
165
],
[
160,
166
],
[
166,
167
],
[
568,
168
],
[
168,
169
],
[
168,
170
],
[
170,
171
],
[
171,
172
],
[
172,
173
],
[
172,
174
],
[
174,
175
],
[
171,
176
],
[
176,
177
],
[
170,
178
],
[
178,
179
],
[
179,
180
],
[
179,
181
],
[
178,
182
],
[
182,
183
],
[
183,
184
],
[
183,
185
],
[
182,
186
],
[
186,
187
],
[
187,
188
],
[
187,
189
],
[
189,
190
],
[
190,
191
],
[
186,
192
],
[
192,
193
],
[
193,
194
],
[
193,
195
],
[
195,
196
],
[
196,
197
],
[
195,
198
],
[
182,
199
],
[
199,
200
],
[
200,
201
],
[
200,
202
],
[
199,
203
],
[
203,
204
],
[
204,
205
],
[
170,
206
],
[
206,
207
],
[
207,
208
],
[
207,
209
],
[
209,
210
],
[
568,
211
],
[
211,
212
],
[
211,
213
],
[
213,
214
],
[
214,
215
],
[
215,
216
],
[
216,
217
],
[
217,
218
],
[
217,
219
],
[
216,
220
],
[
220,
221
],
[
220,
222
],
[
211,
223
],
[
223,
224
],
[
568,
225
],
[
225,
226
],
[
225,
227
],
[
227,
228
],
[
228,
229
],
[
227,
230
],
[
230,
231
],
[
231,
232
],
[
232,
233
],
[
233,
234
],
[
233,
235
],
[
235,
236
],
[
232,
237
],
[
237,
238
],
[
231,
239
],
[
239,
240
],
[
239,
241
],
[
227,
242
],
[
242,
243
],
[
568,
244
],
[
244,
245
],
[
244,
246
],
[
246,
247
],
[
247,
248
],
[
248,
249
],
[
249,
250
],
[
248,
251
],
[
251,
252
],
[
568,
253
],
[
253,
254
],
[
253,
255
],
[
255,
256
],
[
256,
257
],
[
257,
258
],
[
568,
259
],
[
259,
260
],
[
259,
261
],
[
261,
262
],
[
262,
263
],
[
262,
264
],
[
264,
265
],
[
261,
266
],
[
266,
267
],
[
266,
268
],
[
261,
269
],
[
269,
270
],
[
270,
271
],
[
271,
272
],
[
271,
273
],
[
269,
274
],
[
274,
275
],
[
275,
276
],
[
276,
277
],
[
275,
278
],
[
274,
279
],
[
279,
280
],
[
279,
281
],
[
281,
282
],
[
261,
283
],
[
283,
284
],
[
284,
285
],
[
285,
286
],
[
568,
287
],
[
287,
288
],
[
287,
289
],
[
289,
290
],
[
290,
291
],
[
290,
292
],
[
289,
294
],
[
294,
295
],
[
294,
296
],
[
296,
297
],
[
289,
298
],
[
298,
299
],
[
298,
300
],
[
289,
301
],
[
301,
302
],
[
302,
303
],
[
303,
304
],
[
303,
305
],
[
302,
306
],
[
306,
307
],
[
307,
308
],
[
307,
309
],
[
301,
310
],
[
310,
311
],
[
311,
312
],
[
312,
313
],
[
312,
314
],
[
314,
315
],
[
311,
316
],
[
310,
317
],
[
317,
318
],
[
317,
319
],
[
319,
320
],
[
289,
321
],
[
321,
322
],
[
322,
323
],
[
323,
324
],
[
323,
325
],
[
322,
326
],
[
322,
327
],
[
327,
328
],
[
328,
329
],
[
327,
330
],
[
327,
331
],
[
287,
332
],
[
332,
333
],
[
568,
334
],
[
334,
335
],
[
334,
336
],
[
336,
337
],
[
337,
338
],
[
337,
339
],
[
336,
341
],
[
341,
342
],
[
342,
343
],
[
343,
344
],
[
343,
345
],
[
341,
346
],
[
346,
347
],
[
346,
348
],
[
341,
349
],
[
349,
350
],
[
350,
351
],
[
341,
352
],
[
352,
353
],
[
353,
354
],
[
354,
355
],
[
354,
356
],
[
353,
357
],
[
357,
358
],
[
357,
359
],
[
336,
360
],
[
360,
361
],
[
334,
362
],
[
362,
363
],
[
334,
364
],
[
364,
365
],
[
568,
366
],
[
366,
367
],
[
366,
368
],
[
368,
369
],
[
369,
370
],
[
369,
371
],
[
368,
373
],
[
373,
374
],
[
374,
375
],
[
375,
376
],
[
375,
377
],
[
373,
378
],
[
378,
379
],
[
378,
380
],
[
373,
381
],
[
381,
382
],
[
382,
383
],
[
373,
384
],
[
384,
385
],
[
385,
386
],
[
386,
387
],
[
386,
388
],
[
385,
389
],
[
389,
390
],
[
368,
391
],
[
391,
392
],
[
366,
393
],
[
393,
394
],
[
568,
395
],
[
395,
396
],
[
395,
397
],
[
397,
398
],
[
398,
399
],
[
398,
400
],
[
397,
401
],
[
401,
402
],
[
397,
403
],
[
403,
404
],
[
403,
405
],
[
397,
406
],
[
406,
407
],
[
407,
408
],
[
408,
409
],
[
409,
410
],
[
409,
411
],
[
411,
412
],
[
408,
413
],
[
413,
414
],
[
407,
415
],
[
415,
416
],
[
416,
417
],
[
417,
418
],
[
418,
419
],
[
418,
420
],
[
417,
421
],
[
421,
422
],
[
421,
423
],
[
416,
424
],
[
424,
425
],
[
424,
426
],
[
397,
427
],
[
427,
428
],
[
428,
429
],
[
428,
430
],
[
427,
431
],
[
431,
432
],
[
432,
433
],
[
432,
434
],
[
431,
435
],
[
435,
436
],
[
435,
437
],
[
437,
438
],
[
397,
439
],
[
439,
440
],
[
439,
441
],
[
441,
442
],
[
442,
443
],
[
443,
444
],
[
444,
445
],
[
444,
446
],
[
443,
447
],
[
447,
448
],
[
447,
449
],
[
442,
450
],
[
450,
451
],
[
451,
452
],
[
451,
453
],
[
453,
454
],
[
454,
455
],
[
454,
456
],
[
453,
457
],
[
457,
458
],
[
457,
459
],
[
442,
460
],
[
460,
461
],
[
461,
462
],
[
462,
463
],
[
462,
464
],
[
464,
465
],
[
462,
466
],
[
441,
467
],
[
467,
468
],
[
467,
469
],
[
469,
470
],
[
568,
471
],
[
471,
472
],
[
471,
473
],
[
473,
474
],
[
474,
475
],
[
474,
476
],
[
473,
477
],
[
477,
478
],
[
473,
479
],
[
479,
480
],
[
479,
481
],
[
473,
482
],
[
482,
483
],
[
483,
484
],
[
484,
485
],
[
485,
486
],
[
485,
487
],
[
487,
488
],
[
484,
489
],
[
489,
490
],
[
483,
491
],
[
491,
492
],
[
492,
493
],
[
493,
494
],
[
494,
495
],
[
494,
496
],
[
493,
497
],
[
497,
498
],
[
497,
499
],
[
492,
500
],
[
500,
501
],
[
500,
502
],
[
473,
503
],
[
503,
504
],
[
504,
505
],
[
504,
506
],
[
503,
507
],
[
507,
508
],
[
508,
509
],
[
508,
510
],
[
507,
511
],
[
511,
512
],
[
511,
513
],
[
513,
514
],
[
473,
515
],
[
515,
516
],
[
515,
517
],
[
517,
518
],
[
518,
519
],
[
519,
520
],
[
520,
521
],
[
520,
522
],
[
519,
523
],
[
523,
524
],
[
523,
525
],
[
518,
526
],
[
526,
527
],
[
527,
528
],
[
527,
529
],
[
529,
530
],
[
530,
531
],
[
530,
532
],
[
529,
533
],
[
533,
534
],
[
533,
535
],
[
518,
536
],
[
536,
537
],
[
537,
538
],
[
538,
539
],
[
538,
540
],
[
540,
541
],
[
538,
542
],
[
517,
543
],
[
543,
544
],
[
543,
545
],
[
545,
546
],
[
568,
547
],
[
547,
548
],
[
547,
549
],
[
549,
550
],
[
550,
551
],
[
551,
552
],
[
552,
553
],
[
553,
554
],
[
551,
555
],
[
550,
556
],
[
556,
557
],
[
557,
558
],
[
558,
559
],
[
558,
560
],
[
556,
561
],
[
561,
562
],
[
562,
563
],
[
561,
564
],
[
547,
565
],
[
565,
566
],
[
0,
567
],
[
567,
568
],
[
567,
569
]
]
| [
"import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\n\npublic class Main {\n InputStream is;\n PrintWriter out;\n String INPUT = \"\";\n\n void solve() throws IOException {\n // for (int T = ni();T>0;T--) {\n String A = ns(), B = ns();\n int n = A.length(), off = B.length(), min = Integer.MAX_VALUE;\n for (int i=0;i<n;i++){\n int j = 0, low = i, temp = 0;\n if(i+off > n) break;\n while (j < off){\n if(A.charAt(low++) != B.charAt(j++)) temp++;\n }\n min = Math.min(temp, min);\n }\n out.println(min);\n }\n // }\n\n void run() throws Exception\n {\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n out = new PrintWriter(System.out);\n\n long s = System.currentTimeMillis();\n solve();\n out.flush();\n if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+\"ms\");\n }\n\n public static void main(String[] args) throws Exception { new Main().run(); }\n\n private byte[] inbuf = new byte[1024];\n public int lenbuf = 0, ptrbuf = 0;\n\n private int readByte()\n {\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }\n\n private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\n private double nd() { return Double.parseDouble(ns()); }\n private char nc() { return (char)skip(); }\n\n private String ns()\n {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private char[] ns(int n)\n {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n\n private char[][] nm(int n, int m)\n {\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }\n\n private int[] na(int n)\n {\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }\n\n private int ni()\n {\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private long nl()\n {\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private void tr(Object... o) { if(INPUT.length() > 0)System.out.println(Arrays.deepToString(o)); }\n\n}",
"import java.io.ByteArrayInputStream;",
"ByteArrayInputStream",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStream;",
"InputStream",
"java.io",
"import java.io.PrintWriter;",
"PrintWriter",
"java.io",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n InputStream is;\n PrintWriter out;\n String INPUT = \"\";\n\n void solve() throws IOException {\n // for (int T = ni();T>0;T--) {\n String A = ns(), B = ns();\n int n = A.length(), off = B.length(), min = Integer.MAX_VALUE;\n for (int i=0;i<n;i++){\n int j = 0, low = i, temp = 0;\n if(i+off > n) break;\n while (j < off){\n if(A.charAt(low++) != B.charAt(j++)) temp++;\n }\n min = Math.min(temp, min);\n }\n out.println(min);\n }\n // }\n\n void run() throws Exception\n {\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n out = new PrintWriter(System.out);\n\n long s = System.currentTimeMillis();\n solve();\n out.flush();\n if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+\"ms\");\n }\n\n public static void main(String[] args) throws Exception { new Main().run(); }\n\n private byte[] inbuf = new byte[1024];\n public int lenbuf = 0, ptrbuf = 0;\n\n private int readByte()\n {\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }\n\n private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\n private double nd() { return Double.parseDouble(ns()); }\n private char nc() { return (char)skip(); }\n\n private String ns()\n {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private char[] ns(int n)\n {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n\n private char[][] nm(int n, int m)\n {\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }\n\n private int[] na(int n)\n {\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }\n\n private int ni()\n {\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private long nl()\n {\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private void tr(Object... o) { if(INPUT.length() > 0)System.out.println(Arrays.deepToString(o)); }\n\n}",
"Main",
"InputStream is;",
"is",
"PrintWriter out;",
"out",
"String INPUT = \"\";",
"INPUT",
"\"\"",
"private byte[] inbuf = new byte[1024];",
"inbuf",
"new byte[1024]",
"1024",
"public int lenbuf = 0",
"lenbuf",
"0",
"ptrbuf = 0;",
"ptrbuf",
"0",
"void solve() throws IOException {\n // for (int T = ni();T>0;T--) {\n String A = ns(), B = ns();\n int n = A.length(), off = B.length(), min = Integer.MAX_VALUE;\n for (int i=0;i<n;i++){\n int j = 0, low = i, temp = 0;\n if(i+off > n) break;\n while (j < off){\n if(A.charAt(low++) != B.charAt(j++)) temp++;\n }\n min = Math.min(temp, min);\n }\n out.println(min);\n }",
"solve",
"{\n // for (int T = ni();T>0;T--) {\n String A = ns(), B = ns();\n int n = A.length(), off = B.length(), min = Integer.MAX_VALUE;\n for (int i=0;i<n;i++){\n int j = 0, low = i, temp = 0;\n if(i+off > n) break;\n while (j < off){\n if(A.charAt(low++) != B.charAt(j++)) temp++;\n }\n min = Math.min(temp, min);\n }\n out.println(min);\n }",
"String A = ns()",
"A",
"ns()",
"ns",
"B = ns();",
"B",
"ns()",
"ns",
"int n = A.length()",
"n",
"A.length()",
"A.length",
"A",
"off = B.length()",
"off",
"B.length()",
"B.length",
"B",
"min = Integer.MAX_VALUE;",
"min",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"for (int i=0;i<n;i++){\n int j = 0, low = i, temp = 0;\n if(i+off > n) break;\n while (j < off){\n if(A.charAt(low++) != B.charAt(j++)) temp++;\n }\n min = Math.min(temp, min);\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<n",
"i",
"n",
"i++",
"i++",
"i",
"{\n int j = 0, low = i, temp = 0;\n if(i+off > n) break;\n while (j < off){\n if(A.charAt(low++) != B.charAt(j++)) temp++;\n }\n min = Math.min(temp, min);\n }",
"{\n int j = 0, low = i, temp = 0;\n if(i+off > n) break;\n while (j < off){\n if(A.charAt(low++) != B.charAt(j++)) temp++;\n }\n min = Math.min(temp, min);\n }",
"int j = 0",
"j",
"0",
"low = i",
"low",
"i",
"temp = 0;",
"temp",
"0",
"if(i+off > n) break;",
"i+off > n",
"i+off",
"i",
"off",
"n",
"break;",
"while (j < off){\n if(A.charAt(low++) != B.charAt(j++)) temp++;\n }",
"j < off",
"j",
"off",
"{\n if(A.charAt(low++) != B.charAt(j++)) temp++;\n }",
"if(A.charAt(low++) != B.charAt(j++)) temp++;",
"A.charAt(low++) != B.charAt(j++)",
"A.charAt(low++)",
"A.charAt",
"A",
"low++",
"low",
"B.charAt(j++)",
"B.charAt",
"B",
"j++",
"j",
"temp++",
"temp",
"min = Math.min(temp, min)",
"min",
"Math.min(temp, min)",
"Math.min",
"Math",
"temp",
"min",
"out.println(min)",
"out.println",
"out",
"min",
"void run() throws Exception\n {\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n out = new PrintWriter(System.out);\n\n long s = System.currentTimeMillis();\n solve();\n out.flush();\n if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+\"ms\");\n }",
"run",
"{\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n out = new PrintWriter(System.out);\n\n long s = System.currentTimeMillis();\n solve();\n out.flush();\n if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+\"ms\");\n }",
"is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes())",
"is",
"INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes())",
"INPUT.isEmpty()",
"INPUT.isEmpty",
"INPUT",
"System.in",
"System",
"System.in",
"new ByteArrayInputStream(INPUT.getBytes())",
"out = new PrintWriter(System.out)",
"out",
"new PrintWriter(System.out)",
"long s = System.currentTimeMillis();",
"s",
"System.currentTimeMillis()",
"System.currentTimeMillis",
"System",
"solve()",
"solve",
"out.flush()",
"out.flush",
"out",
"if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+\"ms\");",
"!INPUT.isEmpty()",
"INPUT.isEmpty()",
"INPUT.isEmpty",
"INPUT",
"tr(System.currentTimeMillis()-s+\"ms\")",
"tr",
"System.currentTimeMillis()-s+\"ms\"",
"System.currentTimeMillis()-s",
"System.currentTimeMillis()",
"System.currentTimeMillis",
"System",
"s",
"\"ms\"",
"public static void main(String[] args) throws Exception { new Main().run(); }",
"main",
"{ new Main().run(); }",
"new Main().run()",
"new Main().run",
"new Main()",
"String[] args",
"args",
"private int readByte()\n {\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }",
"readByte",
"{\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }",
"if(lenbuf == -1)throw new InputMismatchException();",
"lenbuf == -1",
"lenbuf",
"-1",
"1",
"throw new InputMismatchException();",
"new InputMismatchException()",
"if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }",
"ptrbuf >= lenbuf",
"ptrbuf",
"lenbuf",
"{\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }",
"ptrbuf = 0",
"ptrbuf",
"0",
"try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }",
"catch (IOException e) { throw new InputMismatchException(); }",
"IOException e",
"{ throw new InputMismatchException(); }",
"throw new InputMismatchException();",
"new InputMismatchException()",
"{ lenbuf = is.read(inbuf); }",
"lenbuf = is.read(inbuf)",
"lenbuf",
"is.read(inbuf)",
"is.read",
"is",
"inbuf",
"if(lenbuf <= 0)return -1;",
"lenbuf <= 0",
"lenbuf",
"0",
"return -1;",
"-1",
"1",
"return inbuf[ptrbuf++];",
"inbuf[ptrbuf++]",
"inbuf",
"ptrbuf++",
"ptrbuf",
"private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }",
"isSpaceChar",
"{ return !(c >= 33 && c <= 126); }",
"return !(c >= 33 && c <= 126);",
"!(c >= 33 && c <= 126)",
"(c >= 33 && c <= 126)",
"c >= 33",
"c",
"33",
"c <= 126",
"c",
"126",
"int c",
"c",
"private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }",
"skip",
"{ int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }",
"int b;",
"b",
"while((b = readByte()) != -1 && isSpaceChar(b));",
"(b = readByte()) != -1 && isSpaceChar(b)",
"(b = readByte()) != -1",
"(b = readByte())",
"b",
"readByte()",
"readByte",
"-1",
"1",
"isSpaceChar(b)",
"isSpaceChar",
"b",
"return b;",
"b",
"private double nd() { return Double.parseDouble(ns()); }",
"nd",
"{ return Double.parseDouble(ns()); }",
"return Double.parseDouble(ns());",
"Double.parseDouble(ns())",
"Double.parseDouble",
"Double",
"ns()",
"ns",
"private char nc() { return (char)skip(); }",
"nc",
"{ return (char)skip(); }",
"return (char)skip();",
"(char)skip()",
"skip",
"private String ns()\n {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }",
"ns",
"{\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }",
"int b = skip();",
"b",
"skip()",
"skip",
"StringBuilder sb = new StringBuilder();",
"sb",
"new StringBuilder()",
"while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n sb.appendCodePoint(b);\n b = readByte();\n }",
"!(isSpaceChar(b))",
"(isSpaceChar(b))",
"isSpaceChar",
"b",
"{ // when nextLine, (isSpaceChar(b) && b != ' ')\n sb.appendCodePoint(b);\n b = readByte();\n }",
"sb.appendCodePoint(b)",
"sb.appendCodePoint",
"sb",
"b",
"b = readByte()",
"b",
"readByte()",
"readByte",
"return sb.toString();",
"sb.toString()",
"sb.toString",
"sb",
"private char[] ns(int n)\n {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }",
"ns",
"{\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }",
"char[] buf = new char[n];",
"buf",
"new char[n]",
"n",
"int b = skip()",
"b",
"skip()",
"skip",
"p = 0;",
"p",
"0",
"while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }",
"p < n && !(isSpaceChar(b))",
"p < n",
"p",
"n",
"!(isSpaceChar(b))",
"(isSpaceChar(b))",
"isSpaceChar",
"b",
"{\n buf[p++] = (char)b;\n b = readByte();\n }",
"buf[p++] = (char)b",
"buf[p++]",
"buf",
"p++",
"p",
"(char)b",
"b = readByte()",
"b",
"readByte()",
"readByte",
"return n == p ? buf : Arrays.copyOf(buf, p);",
"n == p ? buf : Arrays.copyOf(buf, p)",
"n == p",
"n",
"p",
"buf",
"Arrays.copyOf(buf, p)",
"Arrays.copyOf",
"Arrays",
"buf",
"p",
"int n",
"n",
"private char[][] nm(int n, int m)\n {\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }",
"nm",
"{\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }",
"char[][] map = new char[n][];",
"map",
"new char[n][]",
"n",
"for(int i = 0;i < n;i++)map[i] = ns(m);",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"map[i] = ns(m);",
"map[i] = ns(m)",
"map[i]",
"map",
"i",
"ns(m)",
"ns",
"m",
"return map;",
"map",
"int n",
"n",
"int m",
"m",
"private int[] na(int n)\n {\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }",
"na",
"{\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }",
"int[] a = new int[n];",
"a",
"new int[n]",
"n",
"for(int i = 0;i < n;i++)a[i] = ni();",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"a[i] = ni();",
"a[i] = ni()",
"a[i]",
"a",
"i",
"ni()",
"ni",
"return a;",
"a",
"int n",
"n",
"private int ni()\n {\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }",
"ni",
"{\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }",
"int num = 0",
"num",
"0",
"b;",
"b",
"boolean minus = false;",
"minus",
"false",
"while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));",
"(b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')",
"(b = readByte()) != -1",
"(b = readByte())",
"b",
"readByte()",
"readByte",
"-1",
"1",
"!((b >= '0' && b <= '9') || b == '-')",
"((b >= '0' && b <= '9') || b == '-')",
"(b >= '0' && b <= '9')",
"b >= '0'",
"b",
"'0'",
"b <= '9'",
"b",
"'9'",
"b == '-'",
"b",
"'-'",
"if(b == '-'){\n minus = true;\n b = readByte();\n }",
"b == '-'",
"b",
"'-'",
"{\n minus = true;\n b = readByte();\n }",
"minus = true",
"minus",
"true",
"b = readByte()",
"b",
"readByte()",
"readByte",
"while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }",
"true",
"{\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }",
"if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }",
"b >= '0' && b <= '9'",
"b >= '0'",
"b",
"'0'",
"b <= '9'",
"b",
"'9'",
"{\n num = num * 10 + (b - '0');\n }",
"num = num * 10 + (b - '0')",
"num",
"num * 10 + (b - '0')",
"num * 10",
"num",
"10",
"(b - '0')",
"b",
"'0'",
"{\n return minus ? -num : num;\n }",
"return minus ? -num : num;",
"minus ? -num : num",
"minus",
"-num",
"num",
"num",
"b = readByte()",
"b",
"readByte()",
"readByte",
"private long nl()\n {\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }",
"nl",
"{\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }",
"long num = 0;",
"num",
"0",
"int b;",
"b",
"boolean minus = false;",
"minus",
"false",
"while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));",
"(b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')",
"(b = readByte()) != -1",
"(b = readByte())",
"b",
"readByte()",
"readByte",
"-1",
"1",
"!((b >= '0' && b <= '9') || b == '-')",
"((b >= '0' && b <= '9') || b == '-')",
"(b >= '0' && b <= '9')",
"b >= '0'",
"b",
"'0'",
"b <= '9'",
"b",
"'9'",
"b == '-'",
"b",
"'-'",
"if(b == '-'){\n minus = true;\n b = readByte();\n }",
"b == '-'",
"b",
"'-'",
"{\n minus = true;\n b = readByte();\n }",
"minus = true",
"minus",
"true",
"b = readByte()",
"b",
"readByte()",
"readByte",
"while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }",
"true",
"{\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }",
"if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }",
"b >= '0' && b <= '9'",
"b >= '0'",
"b",
"'0'",
"b <= '9'",
"b",
"'9'",
"{\n num = num * 10 + (b - '0');\n }",
"num = num * 10 + (b - '0')",
"num",
"num * 10 + (b - '0')",
"num * 10",
"num",
"10",
"(b - '0')",
"b",
"'0'",
"{\n return minus ? -num : num;\n }",
"return minus ? -num : num;",
"minus ? -num : num",
"minus",
"-num",
"num",
"num",
"b = readByte()",
"b",
"readByte()",
"readByte",
"private void tr(Object... o) { if(INPUT.length() > 0)System.out.println(Arrays.deepToString(o)); }",
"tr",
"{ if(INPUT.length() > 0)System.out.println(Arrays.deepToString(o)); }",
"if(INPUT.length() > 0)System.out.println(Arrays.deepToString(o));",
"INPUT.length() > 0",
"INPUT.length()",
"INPUT.length",
"INPUT",
"0",
"System.out.println(Arrays.deepToString(o))",
"System.out.println",
"System.out",
"System",
"System.out",
"Arrays.deepToString(o)",
"Arrays.deepToString",
"Arrays",
"o",
"Object... o",
"o",
"public class Main {\n InputStream is;\n PrintWriter out;\n String INPUT = \"\";\n\n void solve() throws IOException {\n // for (int T = ni();T>0;T--) {\n String A = ns(), B = ns();\n int n = A.length(), off = B.length(), min = Integer.MAX_VALUE;\n for (int i=0;i<n;i++){\n int j = 0, low = i, temp = 0;\n if(i+off > n) break;\n while (j < off){\n if(A.charAt(low++) != B.charAt(j++)) temp++;\n }\n min = Math.min(temp, min);\n }\n out.println(min);\n }\n // }\n\n void run() throws Exception\n {\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n out = new PrintWriter(System.out);\n\n long s = System.currentTimeMillis();\n solve();\n out.flush();\n if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+\"ms\");\n }\n\n public static void main(String[] args) throws Exception { new Main().run(); }\n\n private byte[] inbuf = new byte[1024];\n public int lenbuf = 0, ptrbuf = 0;\n\n private int readByte()\n {\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }\n\n private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\n private double nd() { return Double.parseDouble(ns()); }\n private char nc() { return (char)skip(); }\n\n private String ns()\n {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private char[] ns(int n)\n {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n\n private char[][] nm(int n, int m)\n {\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }\n\n private int[] na(int n)\n {\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }\n\n private int ni()\n {\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private long nl()\n {\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private void tr(Object... o) { if(INPUT.length() > 0)System.out.println(Arrays.deepToString(o)); }\n\n}",
"public class Main {\n InputStream is;\n PrintWriter out;\n String INPUT = \"\";\n\n void solve() throws IOException {\n // for (int T = ni();T>0;T--) {\n String A = ns(), B = ns();\n int n = A.length(), off = B.length(), min = Integer.MAX_VALUE;\n for (int i=0;i<n;i++){\n int j = 0, low = i, temp = 0;\n if(i+off > n) break;\n while (j < off){\n if(A.charAt(low++) != B.charAt(j++)) temp++;\n }\n min = Math.min(temp, min);\n }\n out.println(min);\n }\n // }\n\n void run() throws Exception\n {\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n out = new PrintWriter(System.out);\n\n long s = System.currentTimeMillis();\n solve();\n out.flush();\n if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+\"ms\");\n }\n\n public static void main(String[] args) throws Exception { new Main().run(); }\n\n private byte[] inbuf = new byte[1024];\n public int lenbuf = 0, ptrbuf = 0;\n\n private int readByte()\n {\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }\n\n private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\n private double nd() { return Double.parseDouble(ns()); }\n private char nc() { return (char)skip(); }\n\n private String ns()\n {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private char[] ns(int n)\n {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n\n private char[][] nm(int n, int m)\n {\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }\n\n private int[] na(int n)\n {\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }\n\n private int ni()\n {\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private long nl()\n {\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private void tr(Object... o) { if(INPUT.length() > 0)System.out.println(Arrays.deepToString(o)); }\n\n}",
"Main"
]
| import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
public class Main {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve() throws IOException {
// for (int T = ni();T>0;T--) {
String A = ns(), B = ns();
int n = A.length(), off = B.length(), min = Integer.MAX_VALUE;
for (int i=0;i<n;i++){
int j = 0, low = i, temp = 0;
if(i+off > n) break;
while (j < off){
if(A.charAt(low++) != B.charAt(j++)) temp++;
}
min = Math.min(temp, min);
}
out.println(min);
}
// }
void run() throws Exception
{
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);
long s = System.currentTimeMillis();
solve();
out.flush();
if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
}
public static void main(String[] args) throws Exception { new Main().run(); }
private byte[] inbuf = new byte[1024];
public int lenbuf = 0, ptrbuf = 0;
private int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private double nd() { return Double.parseDouble(ns()); }
private char nc() { return (char)skip(); }
private String ns()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private char[] ns(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private char[][] nm(int n, int m)
{
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = ns(m);
return map;
}
private int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private int ni()
{
int num = 0, b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private long nl()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private void tr(Object... o) { if(INPUT.length() > 0)System.out.println(Arrays.deepToString(o)); }
}
|
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
41,
13,
12,
13,
30,
41,
13,
4,
18,
13,
13,
13,
41,
13,
4,
18,
13,
13,
13,
42,
2,
2,
13,
13,
17,
30,
0,
13,
2,
13,
13,
0,
13,
13,
0,
13,
13,
29,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
20,
41,
13,
17,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
20,
41,
13,
20,
41,
13,
20,
41,
13,
20,
41,
13,
20,
41,
13,
20,
41,
13,
20,
41,
13,
20,
38,
5,
13,
30,
4,
18,
13,
30,
42,
2,
40,
13,
17,
30,
0,
13,
4,
18,
13,
0,
13,
4,
18,
13,
0,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
2,
2,
4,
18,
13,
4,
18,
13,
17,
1,
40,
13,
30,
30,
0,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
2,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
13,
13,
4,
18,
13,
4,
18,
13,
4,
18,
13,
4,
18,
13,
4,
18,
13,
4,
18,
13,
4,
18,
13,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
29,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
18,
36,
13,
13,
0,
18,
36,
13,
13,
23,
13,
23,
13,
12,
13,
30,
14,
2,
18,
13,
13,
13,
29,
2,
13,
18,
13,
13,
29,
2,
18,
36,
13,
18,
13,
13,
23,
13,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
386,
8
],
[
386,
9
],
[
9,
10
],
[
386,
11
],
[
11,
12
],
[
386,
13
],
[
13,
14
],
[
13,
15
],
[
15,
16
],
[
16,
17
],
[
16,
18
],
[
18,
19
],
[
19,
20
],
[
18,
21
],
[
18,
22
],
[
15,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
26,
27
],
[
25,
28
],
[
25,
29
],
[
15,
30
],
[
30,
31
],
[
31,
32
],
[
32,
33
],
[
32,
34
],
[
31,
35
],
[
30,
36
],
[
36,
37
],
[
37,
38
],
[
37,
39
],
[
39,
40
],
[
39,
41
],
[
36,
42
],
[
42,
43
],
[
42,
44
],
[
36,
45
],
[
45,
46
],
[
45,
47
],
[
15,
48
],
[
48,
49
],
[
13,
50
],
[
50,
51
],
[
13,
52
],
[
52,
53
],
[
386,
54
],
[
54,
55
],
[
54,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
56,
60
],
[
60,
61
],
[
60,
62
],
[
56,
63
],
[
63,
64
],
[
63,
65
],
[
56,
66
],
[
66,
67
],
[
56,
68
],
[
68,
69
],
[
56,
70
],
[
70,
71
],
[
56,
72
],
[
72,
73
],
[
56,
74
],
[
74,
75
],
[
56,
76
],
[
76,
77
],
[
56,
78
],
[
78,
79
],
[
56,
80
],
[
80,
81
],
[
56,
82
],
[
82,
83
],
[
56,
84
],
[
84,
85
],
[
56,
86
],
[
86,
87
],
[
56,
88
],
[
88,
89
],
[
56,
90
],
[
90,
91
],
[
56,
92
],
[
92,
93
],
[
56,
94
],
[
94,
95
],
[
56,
96
],
[
96,
97
],
[
56,
98
],
[
98,
99
],
[
56,
100
],
[
100,
101
],
[
56,
102
],
[
102,
103
],
[
56,
104
],
[
104,
105
],
[
56,
106
],
[
106,
107
],
[
56,
108
],
[
108,
109
],
[
108,
110
],
[
56,
111
],
[
111,
112
],
[
111,
113
],
[
56,
114
],
[
114,
115
],
[
114,
116
],
[
56,
117
],
[
117,
118
],
[
117,
119
],
[
56,
120
],
[
120,
121
],
[
120,
122
],
[
56,
123
],
[
123,
124
],
[
123,
125
],
[
56,
126
],
[
126,
127
],
[
126,
128
],
[
56,
129
],
[
129,
130
],
[
129,
131
],
[
56,
132
],
[
132,
133
],
[
133,
134
],
[
133,
135
],
[
135,
136
],
[
136,
137
],
[
137,
138
],
[
132,
139
],
[
139,
140
],
[
140,
141
],
[
141,
142
],
[
142,
143
],
[
141,
144
],
[
140,
145
],
[
145,
146
],
[
146,
147
],
[
146,
148
],
[
148,
149
],
[
149,
150
],
[
145,
151
],
[
151,
152
],
[
151,
153
],
[
153,
154
],
[
154,
155
],
[
145,
156
],
[
156,
157
],
[
156,
158
],
[
158,
159
],
[
159,
160
],
[
145,
161
],
[
161,
162
],
[
162,
163
],
[
163,
164
],
[
163,
165
],
[
161,
166
],
[
166,
167
],
[
166,
168
],
[
168,
169
],
[
169,
170
],
[
170,
171
],
[
171,
172
],
[
169,
173
],
[
173,
174
],
[
174,
175
],
[
168,
176
],
[
161,
177
],
[
177,
178
],
[
178,
179
],
[
161,
180
],
[
181,
181
],
[
181,
182
],
[
182,
183
],
[
182,
184
],
[
181,
185
],
[
185,
186
],
[
186,
187
],
[
187,
188
],
[
187,
189
],
[
185,
190
],
[
190,
191
],
[
190,
192
],
[
192,
193
],
[
193,
194
],
[
185,
195
],
[
195,
196
],
[
196,
197
],
[
185,
198
],
[
199,
199
],
[
199,
200
],
[
200,
201
],
[
201,
202
],
[
202,
203
],
[
203,
204
],
[
202,
205
],
[
201,
206
],
[
206,
207
],
[
207,
208
],
[
206,
209
],
[
209,
210
],
[
209,
211
],
[
200,
212
],
[
212,
213
],
[
181,
214
],
[
214,
215
],
[
214,
216
],
[
216,
217
],
[
217,
218
],
[
216,
219
],
[
216,
220
],
[
145,
221
],
[
221,
222
],
[
222,
223
],
[
221,
224
],
[
145,
225
],
[
225,
226
],
[
226,
227
],
[
145,
228
],
[
228,
229
],
[
229,
230
],
[
145,
231
],
[
231,
232
],
[
232,
233
],
[
145,
234
],
[
234,
235
],
[
235,
236
],
[
145,
237
],
[
237,
238
],
[
238,
239
],
[
56,
240
],
[
240,
241
],
[
241,
242
],
[
56,
243
],
[
243,
244
],
[
244,
245
],
[
54,
246
],
[
246,
247
],
[
386,
248
],
[
248,
249
],
[
248,
250
],
[
250,
251
],
[
248,
252
],
[
252,
253
],
[
248,
254
],
[
254,
255
],
[
254,
256
],
[
256,
257
],
[
257,
258
],
[
257,
259
],
[
248,
260
],
[
260,
261
],
[
260,
262
],
[
262,
263
],
[
263,
264
],
[
264,
265
],
[
265,
266
],
[
265,
267
],
[
264,
268
],
[
268,
269
],
[
269,
270
],
[
270,
271
],
[
263,
272
],
[
272,
273
],
[
273,
274
],
[
274,
275
],
[
274,
276
],
[
276,
277
],
[
277,
278
],
[
278,
279
],
[
273,
280
],
[
280,
281
],
[
281,
282
],
[
281,
283
],
[
262,
284
],
[
284,
285
],
[
285,
286
],
[
286,
287
],
[
248,
288
],
[
288,
289
],
[
288,
290
],
[
290,
291
],
[
291,
292
],
[
292,
293
],
[
293,
294
],
[
292,
295
],
[
295,
296
],
[
248,
297
],
[
297,
298
],
[
297,
299
],
[
299,
300
],
[
300,
301
],
[
301,
302
],
[
302,
303
],
[
301,
304
],
[
304,
305
],
[
248,
306
],
[
306,
307
],
[
306,
308
],
[
308,
309
],
[
309,
310
],
[
310,
311
],
[
311,
312
],
[
310,
313
],
[
313,
314
],
[
248,
315
],
[
315,
316
],
[
315,
317
],
[
317,
318
],
[
318,
319
],
[
318,
320
],
[
317,
321
],
[
321,
322
],
[
322,
323
],
[
322,
324
],
[
324,
325
],
[
325,
326
],
[
326,
327
],
[
321,
328
],
[
328,
329
],
[
329,
330
],
[
329,
331
],
[
331,
332
],
[
332,
333
],
[
317,
334
],
[
334,
335
],
[
386,
336
],
[
336,
337
],
[
336,
338
],
[
338,
339
],
[
336,
340
],
[
340,
341
],
[
336,
342
],
[
342,
343
],
[
342,
344
],
[
344,
345
],
[
345,
346
],
[
346,
347
],
[
346,
348
],
[
345,
349
],
[
344,
350
],
[
350,
351
],
[
351,
352
],
[
351,
353
],
[
350,
354
],
[
342,
355
],
[
355,
356
],
[
342,
357
],
[
357,
358
],
[
336,
359
],
[
359,
360
],
[
359,
361
],
[
361,
362
],
[
362,
363
],
[
363,
364
],
[
364,
365
],
[
364,
366
],
[
363,
367
],
[
362,
368
],
[
368,
369
],
[
369,
370
],
[
369,
371
],
[
371,
372
],
[
371,
373
],
[
361,
374
],
[
374,
375
],
[
375,
376
],
[
376,
377
],
[
376,
378
],
[
375,
379
],
[
379,
380
],
[
379,
381
],
[
359,
382
],
[
382,
383
],
[
336,
384
],
[
0,
385
],
[
385,
386
],
[
385,
387
]
]
| [
"import java.util.*;\nimport java.io.*;\n\npublic class Main\n{\n static class Reader {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n \n\t\tpublic Reader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n \n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n \n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n \n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n \n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n \n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n \n\t}\n static class Ele implements Comparable<Ele> \n { \n public int x,y; \n Ele(int x,int y) \n { \n this.x=x;this.y=y; \n } \n public int compareTo(Ele ob) { \n if(ob.x!=x)return x-ob.x;\n return this.y-ob.y; \n } \n }\n int a[][];int b[][];\n \n long gcd(long a,long b)\n {\n long min=Math.min(a,b);\n long max=Math.max(a,b);\n while (max%min!=0)\n {\n a=max%min;\n max=min;min=a;\n }\n return min;\n }\n\tpublic static void main(String[] args) throws IOException \n\t{\n\t\tReader sc=new Reader();//Solution G=new Solution();\n\t\tPrintWriter o = new PrintWriter(System.out);\n\t\tint t=1;\n\t\t//int t=sc.nextInt();\n\t\t\n\t\tint n,m,y0,x0,y1,x1,x2,y2,s0,s2;int a[],b[],in[],in1[];\n\t\tlong k,l;boolean b1[],b2;String s1[],ss,s;\n\t\t//long l;long a[]; \n\t\tArrayList<ArrayList<Integer>> ll=new ArrayList<>();\n\t\tArrayList<Integer> a1=new ArrayList<>();\n\t\tArrayList<Integer> a2=new ArrayList<>();\n\t\tArrayList<Integer> a3=new ArrayList<>();\n\t\tArrayDeque<Integer> deq=new ArrayDeque<>();\n\t\tTreeSet<Integer> h0=new TreeSet<>();\n\t\tTreeSet<Integer> h1=new TreeSet<>();\n\t\tHashMap<Integer,Integer> h=new HashMap<>();\n\t\ttry{\n\t\twhile (t-->0)\n\t\t{\n\t\t ss=sc.next();s=sc.next();n=s.length();\n\t\t for (int i=0;i<ss.length()-s.length()+1;i++)\n\t\t {\n\t\t x0=0;\n\t\t for (int j=0;j<s.length();j++)\n\t\t {\n\t\t if (s.charAt(j)!=ss.charAt(i+j))\n\t\t x0++;\n\t\t }\n\t\t n=Math.min(n,x0);\n\t\t }\n\t\t o.println(n);\n\t\t //o.println(s);\n\t\t //o.println();\n\t\t //o.println();\n\t\t //o.println(h);\n\t\t //o.println(x2);\n\t\t //o.println();\n\t\t h0.clear();ll.clear();a1.clear();a2.clear();h1.clear();\n\t\t}\n\t\t}\n\t\tcatch (Throwable e)\n\t\t{\n\t\t e.printStackTrace();\n\t\t}\n\t\t//o.println(\"HI\");\n\t\t\n o.flush();\n o.close();\n\t}\n} ",
"import java.util.*;",
"util.*",
"java",
"import java.io.*;",
"io.*",
"java",
"public class Main\n{\n static class Reader {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n \n\t\tpublic Reader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n \n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n \n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n \n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n \n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n \n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n \n\t}\n static class Ele implements Comparable<Ele> \n { \n public int x,y; \n Ele(int x,int y) \n { \n this.x=x;this.y=y; \n } \n public int compareTo(Ele ob) { \n if(ob.x!=x)return x-ob.x;\n return this.y-ob.y; \n } \n }\n int a[][];int b[][];\n \n long gcd(long a,long b)\n {\n long min=Math.min(a,b);\n long max=Math.max(a,b);\n while (max%min!=0)\n {\n a=max%min;\n max=min;min=a;\n }\n return min;\n }\n\tpublic static void main(String[] args) throws IOException \n\t{\n\t\tReader sc=new Reader();//Solution G=new Solution();\n\t\tPrintWriter o = new PrintWriter(System.out);\n\t\tint t=1;\n\t\t//int t=sc.nextInt();\n\t\t\n\t\tint n,m,y0,x0,y1,x1,x2,y2,s0,s2;int a[],b[],in[],in1[];\n\t\tlong k,l;boolean b1[],b2;String s1[],ss,s;\n\t\t//long l;long a[]; \n\t\tArrayList<ArrayList<Integer>> ll=new ArrayList<>();\n\t\tArrayList<Integer> a1=new ArrayList<>();\n\t\tArrayList<Integer> a2=new ArrayList<>();\n\t\tArrayList<Integer> a3=new ArrayList<>();\n\t\tArrayDeque<Integer> deq=new ArrayDeque<>();\n\t\tTreeSet<Integer> h0=new TreeSet<>();\n\t\tTreeSet<Integer> h1=new TreeSet<>();\n\t\tHashMap<Integer,Integer> h=new HashMap<>();\n\t\ttry{\n\t\twhile (t-->0)\n\t\t{\n\t\t ss=sc.next();s=sc.next();n=s.length();\n\t\t for (int i=0;i<ss.length()-s.length()+1;i++)\n\t\t {\n\t\t x0=0;\n\t\t for (int j=0;j<s.length();j++)\n\t\t {\n\t\t if (s.charAt(j)!=ss.charAt(i+j))\n\t\t x0++;\n\t\t }\n\t\t n=Math.min(n,x0);\n\t\t }\n\t\t o.println(n);\n\t\t //o.println(s);\n\t\t //o.println();\n\t\t //o.println();\n\t\t //o.println(h);\n\t\t //o.println(x2);\n\t\t //o.println();\n\t\t h0.clear();ll.clear();a1.clear();a2.clear();h1.clear();\n\t\t}\n\t\t}\n\t\tcatch (Throwable e)\n\t\t{\n\t\t e.printStackTrace();\n\t\t}\n\t\t//o.println(\"HI\");\n\t\t\n o.flush();\n o.close();\n\t}\n}",
"Main",
"int a[][];",
"a",
"int b[][];",
"b",
"long gcd(long a,long b)\n {\n long min=Math.min(a,b);\n long max=Math.max(a,b);\n while (max%min!=0)\n {\n a=max%min;\n max=min;min=a;\n }\n return min;\n }",
"gcd",
"{\n long min=Math.min(a,b);\n long max=Math.max(a,b);\n while (max%min!=0)\n {\n a=max%min;\n max=min;min=a;\n }\n return min;\n }",
"long min=Math.min(a,b);",
"min",
"Math.min(a,b)",
"Math.min",
"Math",
"a",
"b",
"long max=Math.max(a,b);",
"max",
"Math.max(a,b)",
"Math.max",
"Math",
"a",
"b",
"while (max%min!=0)\n {\n a=max%min;\n max=min;min=a;\n }",
"max%min!=0",
"max%min",
"max",
"min",
"0",
"{\n a=max%min;\n max=min;min=a;\n }",
"a=max%min",
"a",
"max%min",
"max",
"min",
"max=min",
"max",
"min",
"min=a",
"min",
"a",
"return min;",
"min",
"long a",
"a",
"long b",
"b",
"public static void main(String[] args) throws IOException \n\t{\n\t\tReader sc=new Reader();//Solution G=new Solution();\n\t\tPrintWriter o = new PrintWriter(System.out);\n\t\tint t=1;\n\t\t//int t=sc.nextInt();\n\t\t\n\t\tint n,m,y0,x0,y1,x1,x2,y2,s0,s2;int a[],b[],in[],in1[];\n\t\tlong k,l;boolean b1[],b2;String s1[],ss,s;\n\t\t//long l;long a[]; \n\t\tArrayList<ArrayList<Integer>> ll=new ArrayList<>();\n\t\tArrayList<Integer> a1=new ArrayList<>();\n\t\tArrayList<Integer> a2=new ArrayList<>();\n\t\tArrayList<Integer> a3=new ArrayList<>();\n\t\tArrayDeque<Integer> deq=new ArrayDeque<>();\n\t\tTreeSet<Integer> h0=new TreeSet<>();\n\t\tTreeSet<Integer> h1=new TreeSet<>();\n\t\tHashMap<Integer,Integer> h=new HashMap<>();\n\t\ttry{\n\t\twhile (t-->0)\n\t\t{\n\t\t ss=sc.next();s=sc.next();n=s.length();\n\t\t for (int i=0;i<ss.length()-s.length()+1;i++)\n\t\t {\n\t\t x0=0;\n\t\t for (int j=0;j<s.length();j++)\n\t\t {\n\t\t if (s.charAt(j)!=ss.charAt(i+j))\n\t\t x0++;\n\t\t }\n\t\t n=Math.min(n,x0);\n\t\t }\n\t\t o.println(n);\n\t\t //o.println(s);\n\t\t //o.println();\n\t\t //o.println();\n\t\t //o.println(h);\n\t\t //o.println(x2);\n\t\t //o.println();\n\t\t h0.clear();ll.clear();a1.clear();a2.clear();h1.clear();\n\t\t}\n\t\t}\n\t\tcatch (Throwable e)\n\t\t{\n\t\t e.printStackTrace();\n\t\t}\n\t\t//o.println(\"HI\");\n\t\t\n o.flush();\n o.close();\n\t}",
"main",
"{\n\t\tReader sc=new Reader();//Solution G=new Solution();\n\t\tPrintWriter o = new PrintWriter(System.out);\n\t\tint t=1;\n\t\t//int t=sc.nextInt();\n\t\t\n\t\tint n,m,y0,x0,y1,x1,x2,y2,s0,s2;int a[],b[],in[],in1[];\n\t\tlong k,l;boolean b1[],b2;String s1[],ss,s;\n\t\t//long l;long a[]; \n\t\tArrayList<ArrayList<Integer>> ll=new ArrayList<>();\n\t\tArrayList<Integer> a1=new ArrayList<>();\n\t\tArrayList<Integer> a2=new ArrayList<>();\n\t\tArrayList<Integer> a3=new ArrayList<>();\n\t\tArrayDeque<Integer> deq=new ArrayDeque<>();\n\t\tTreeSet<Integer> h0=new TreeSet<>();\n\t\tTreeSet<Integer> h1=new TreeSet<>();\n\t\tHashMap<Integer,Integer> h=new HashMap<>();\n\t\ttry{\n\t\twhile (t-->0)\n\t\t{\n\t\t ss=sc.next();s=sc.next();n=s.length();\n\t\t for (int i=0;i<ss.length()-s.length()+1;i++)\n\t\t {\n\t\t x0=0;\n\t\t for (int j=0;j<s.length();j++)\n\t\t {\n\t\t if (s.charAt(j)!=ss.charAt(i+j))\n\t\t x0++;\n\t\t }\n\t\t n=Math.min(n,x0);\n\t\t }\n\t\t o.println(n);\n\t\t //o.println(s);\n\t\t //o.println();\n\t\t //o.println();\n\t\t //o.println(h);\n\t\t //o.println(x2);\n\t\t //o.println();\n\t\t h0.clear();ll.clear();a1.clear();a2.clear();h1.clear();\n\t\t}\n\t\t}\n\t\tcatch (Throwable e)\n\t\t{\n\t\t e.printStackTrace();\n\t\t}\n\t\t//o.println(\"HI\");\n\t\t\n o.flush();\n o.close();\n\t}",
"Reader sc=new Reader();",
"sc",
"new Reader()",
"PrintWriter o = new PrintWriter(System.out);",
"o",
"new PrintWriter(System.out)",
"int t=1;",
"t",
"1",
"int n",
"n",
"m",
"m",
"y0",
"y0",
"x0",
"x0",
"y1",
"y1",
"x1",
"x1",
"x2",
"x2",
"y2",
"y2",
"s0",
"s0",
"s2;",
"s2",
"int a[]",
"a",
"b[]",
"b",
"in[]",
"in",
"in1[];",
"in1",
"long k",
"k",
"l;",
"l",
"boolean b1[]",
"b1",
"b2;",
"b2",
"String s1[]",
"s1",
"ss",
"ss",
"s;",
"s",
"ArrayList<ArrayList<Integer>> ll=new ArrayList<>();",
"ll",
"new ArrayList<>()",
"ArrayList<Integer> a1=new ArrayList<>();",
"a1",
"new ArrayList<>()",
"ArrayList<Integer> a2=new ArrayList<>();",
"a2",
"new ArrayList<>()",
"ArrayList<Integer> a3=new ArrayList<>();",
"a3",
"new ArrayList<>()",
"ArrayDeque<Integer> deq=new ArrayDeque<>();",
"deq",
"new ArrayDeque<>()",
"TreeSet<Integer> h0=new TreeSet<>();",
"h0",
"new TreeSet<>()",
"TreeSet<Integer> h1=new TreeSet<>();",
"h1",
"new TreeSet<>()",
"HashMap<Integer,Integer> h=new HashMap<>();",
"h",
"new HashMap<>()",
"try{\n\t\twhile (t-->0)\n\t\t{\n\t\t ss=sc.next();s=sc.next();n=s.length();\n\t\t for (int i=0;i<ss.length()-s.length()+1;i++)\n\t\t {\n\t\t x0=0;\n\t\t for (int j=0;j<s.length();j++)\n\t\t {\n\t\t if (s.charAt(j)!=ss.charAt(i+j))\n\t\t x0++;\n\t\t }\n\t\t n=Math.min(n,x0);\n\t\t }\n\t\t o.println(n);\n\t\t //o.println(s);\n\t\t //o.println();\n\t\t //o.println();\n\t\t //o.println(h);\n\t\t //o.println(x2);\n\t\t //o.println();\n\t\t h0.clear();ll.clear();a1.clear();a2.clear();h1.clear();\n\t\t}\n\t\t}\n\t\tcatch (Throwable e)\n\t\t{\n\t\t e.printStackTrace();\n\t\t}",
"catch (Throwable e)\n\t\t{\n\t\t e.printStackTrace();\n\t\t}",
"Throwable e",
"{\n\t\t e.printStackTrace();\n\t\t}",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n\t\twhile (t-->0)\n\t\t{\n\t\t ss=sc.next();s=sc.next();n=s.length();\n\t\t for (int i=0;i<ss.length()-s.length()+1;i++)\n\t\t {\n\t\t x0=0;\n\t\t for (int j=0;j<s.length();j++)\n\t\t {\n\t\t if (s.charAt(j)!=ss.charAt(i+j))\n\t\t x0++;\n\t\t }\n\t\t n=Math.min(n,x0);\n\t\t }\n\t\t o.println(n);\n\t\t //o.println(s);\n\t\t //o.println();\n\t\t //o.println();\n\t\t //o.println(h);\n\t\t //o.println(x2);\n\t\t //o.println();\n\t\t h0.clear();ll.clear();a1.clear();a2.clear();h1.clear();\n\t\t}\n\t\t}",
"while (t-->0)\n\t\t{\n\t\t ss=sc.next();s=sc.next();n=s.length();\n\t\t for (int i=0;i<ss.length()-s.length()+1;i++)\n\t\t {\n\t\t x0=0;\n\t\t for (int j=0;j<s.length();j++)\n\t\t {\n\t\t if (s.charAt(j)!=ss.charAt(i+j))\n\t\t x0++;\n\t\t }\n\t\t n=Math.min(n,x0);\n\t\t }\n\t\t o.println(n);\n\t\t //o.println(s);\n\t\t //o.println();\n\t\t //o.println();\n\t\t //o.println(h);\n\t\t //o.println(x2);\n\t\t //o.println();\n\t\t h0.clear();ll.clear();a1.clear();a2.clear();h1.clear();\n\t\t}",
"t-->0",
"t--",
"t",
"0",
"{\n\t\t ss=sc.next();s=sc.next();n=s.length();\n\t\t for (int i=0;i<ss.length()-s.length()+1;i++)\n\t\t {\n\t\t x0=0;\n\t\t for (int j=0;j<s.length();j++)\n\t\t {\n\t\t if (s.charAt(j)!=ss.charAt(i+j))\n\t\t x0++;\n\t\t }\n\t\t n=Math.min(n,x0);\n\t\t }\n\t\t o.println(n);\n\t\t //o.println(s);\n\t\t //o.println();\n\t\t //o.println();\n\t\t //o.println(h);\n\t\t //o.println(x2);\n\t\t //o.println();\n\t\t h0.clear();ll.clear();a1.clear();a2.clear();h1.clear();\n\t\t}",
"ss=sc.next()",
"ss",
"sc.next()",
"sc.next",
"sc",
"s=sc.next()",
"s",
"sc.next()",
"sc.next",
"sc",
"n=s.length()",
"n",
"s.length()",
"s.length",
"s",
"for (int i=0;i<ss.length()-s.length()+1;i++)\n\t\t {\n\t\t x0=0;\n\t\t for (int j=0;j<s.length();j++)\n\t\t {\n\t\t if (s.charAt(j)!=ss.charAt(i+j))\n\t\t x0++;\n\t\t }\n\t\t n=Math.min(n,x0);\n\t\t }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<ss.length()-s.length()+1",
"i",
"ss.length()-s.length()+1",
"ss.length()-s.length()",
"ss.length()",
"ss.length",
"ss",
"s.length()",
"s.length",
"s",
"1",
"i++",
"i++",
"i",
"{\n\t\t x0=0;\n\t\t for (int j=0;j<s.length();j++)\n\t\t {\n\t\t if (s.charAt(j)!=ss.charAt(i+j))\n\t\t x0++;\n\t\t }\n\t\t n=Math.min(n,x0);\n\t\t }",
"{\n\t\t x0=0;\n\t\t for (int j=0;j<s.length();j++)\n\t\t {\n\t\t if (s.charAt(j)!=ss.charAt(i+j))\n\t\t x0++;\n\t\t }\n\t\t n=Math.min(n,x0);\n\t\t }",
"x0=0",
"x0",
"0",
"for (int j=0;j<s.length();j++)\n\t\t {\n\t\t if (s.charAt(j)!=ss.charAt(i+j))\n\t\t x0++;\n\t\t }",
"int j=0;",
"int j=0;",
"j",
"0",
"j<s.length()",
"j",
"s.length()",
"s.length",
"s",
"j++",
"j++",
"j",
"{\n\t\t if (s.charAt(j)!=ss.charAt(i+j))\n\t\t x0++;\n\t\t }",
"{\n\t\t if (s.charAt(j)!=ss.charAt(i+j))\n\t\t x0++;\n\t\t }",
"if (s.charAt(j)!=ss.charAt(i+j))\n\t\t x0++;",
"s.charAt(j)!=ss.charAt(i+j)",
"s.charAt(j)",
"s.charAt",
"s",
"j",
"ss.charAt(i+j)",
"ss.charAt",
"ss",
"i+j",
"i",
"j",
"x0++",
"x0",
"n=Math.min(n,x0)",
"n",
"Math.min(n,x0)",
"Math.min",
"Math",
"n",
"x0",
"o.println(n)",
"o.println",
"o",
"n",
"h0.clear()",
"h0.clear",
"h0",
"ll.clear()",
"ll.clear",
"ll",
"a1.clear()",
"a1.clear",
"a1",
"a2.clear()",
"a2.clear",
"a2",
"h1.clear()",
"h1.clear",
"h1",
"o.flush()",
"o.flush",
"o",
"o.close()",
"o.close",
"o",
"String[] args",
"args",
"static class Reader {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n \n\t\tpublic Reader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n \n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n \n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n \n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n \n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n \n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n \n\t}",
"Reader",
"BufferedReader br;",
"br",
"StringTokenizer st;",
"st",
"public Reader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}",
"Reader",
"{\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}",
"br = new BufferedReader(new InputStreamReader(System.in))",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"String next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}",
"next",
"{\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}",
"while (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}",
"st == null || !st.hasMoreElements()",
"st == null",
"st",
"null",
"!st.hasMoreElements()",
"st.hasMoreElements()",
"st.hasMoreElements",
"st",
"{\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}",
"try {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}",
"catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}",
"IOException e",
"{\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t}",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}",
"nextInt",
"{\n\t\t\treturn Integer.parseInt(next());\n\t\t}",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}",
"nextLong",
"{\n\t\t\treturn Long.parseLong(next());\n\t\t}",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}",
"nextDouble",
"{\n\t\t\treturn Double.parseDouble(next());\n\t\t}",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"String nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}",
"nextLine",
"{\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}",
"String str = \"\";",
"str",
"\"\"",
"try {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}",
"catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}",
"IOException e",
"{\n\t\t\t\te.printStackTrace();\n\t\t\t}",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n\t\t\t\tstr = br.readLine();\n\t\t\t}",
"str = br.readLine()",
"str",
"br.readLine()",
"br.readLine",
"br",
"return str;",
"str",
"static class Ele implements Comparable<Ele> \n { \n public int x,y; \n Ele(int x,int y) \n { \n this.x=x;this.y=y; \n } \n public int compareTo(Ele ob) { \n if(ob.x!=x)return x-ob.x;\n return this.y-ob.y; \n } \n }",
"Ele",
"public int x",
"x",
"y;",
"y",
"Ele(int x,int y) \n { \n this.x=x;this.y=y; \n }",
"Ele",
"{ \n this.x=x;this.y=y; \n }",
"this.x=x",
"this.x",
"this",
"this.x",
"x",
"this.y=y",
"this.y",
"this",
"this.y",
"y",
"int x",
"x",
"int y",
"y",
"public int compareTo(Ele ob) { \n if(ob.x!=x)return x-ob.x;\n return this.y-ob.y; \n }",
"compareTo",
"{ \n if(ob.x!=x)return x-ob.x;\n return this.y-ob.y; \n }",
"if(ob.x!=x)return x-ob.x;",
"ob.x!=x",
"ob.x",
"ob",
"ob.x",
"x",
"return x-ob.x;",
"x-ob.x",
"x",
"ob.x",
"ob",
"ob.x",
"return this.y-ob.y;",
"this.y-ob.y",
"this.y",
"this",
"this.y",
"ob.y",
"ob",
"ob.y",
"Ele ob",
"ob",
"Comparable",
"public class Main\n{\n static class Reader {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n \n\t\tpublic Reader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n \n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n \n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n \n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n \n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n \n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n \n\t}\n static class Ele implements Comparable<Ele> \n { \n public int x,y; \n Ele(int x,int y) \n { \n this.x=x;this.y=y; \n } \n public int compareTo(Ele ob) { \n if(ob.x!=x)return x-ob.x;\n return this.y-ob.y; \n } \n }\n int a[][];int b[][];\n \n long gcd(long a,long b)\n {\n long min=Math.min(a,b);\n long max=Math.max(a,b);\n while (max%min!=0)\n {\n a=max%min;\n max=min;min=a;\n }\n return min;\n }\n\tpublic static void main(String[] args) throws IOException \n\t{\n\t\tReader sc=new Reader();//Solution G=new Solution();\n\t\tPrintWriter o = new PrintWriter(System.out);\n\t\tint t=1;\n\t\t//int t=sc.nextInt();\n\t\t\n\t\tint n,m,y0,x0,y1,x1,x2,y2,s0,s2;int a[],b[],in[],in1[];\n\t\tlong k,l;boolean b1[],b2;String s1[],ss,s;\n\t\t//long l;long a[]; \n\t\tArrayList<ArrayList<Integer>> ll=new ArrayList<>();\n\t\tArrayList<Integer> a1=new ArrayList<>();\n\t\tArrayList<Integer> a2=new ArrayList<>();\n\t\tArrayList<Integer> a3=new ArrayList<>();\n\t\tArrayDeque<Integer> deq=new ArrayDeque<>();\n\t\tTreeSet<Integer> h0=new TreeSet<>();\n\t\tTreeSet<Integer> h1=new TreeSet<>();\n\t\tHashMap<Integer,Integer> h=new HashMap<>();\n\t\ttry{\n\t\twhile (t-->0)\n\t\t{\n\t\t ss=sc.next();s=sc.next();n=s.length();\n\t\t for (int i=0;i<ss.length()-s.length()+1;i++)\n\t\t {\n\t\t x0=0;\n\t\t for (int j=0;j<s.length();j++)\n\t\t {\n\t\t if (s.charAt(j)!=ss.charAt(i+j))\n\t\t x0++;\n\t\t }\n\t\t n=Math.min(n,x0);\n\t\t }\n\t\t o.println(n);\n\t\t //o.println(s);\n\t\t //o.println();\n\t\t //o.println();\n\t\t //o.println(h);\n\t\t //o.println(x2);\n\t\t //o.println();\n\t\t h0.clear();ll.clear();a1.clear();a2.clear();h1.clear();\n\t\t}\n\t\t}\n\t\tcatch (Throwable e)\n\t\t{\n\t\t e.printStackTrace();\n\t\t}\n\t\t//o.println(\"HI\");\n\t\t\n o.flush();\n o.close();\n\t}\n}",
"public class Main\n{\n static class Reader {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n \n\t\tpublic Reader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n \n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n \n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n \n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n \n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n \n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n \n\t}\n static class Ele implements Comparable<Ele> \n { \n public int x,y; \n Ele(int x,int y) \n { \n this.x=x;this.y=y; \n } \n public int compareTo(Ele ob) { \n if(ob.x!=x)return x-ob.x;\n return this.y-ob.y; \n } \n }\n int a[][];int b[][];\n \n long gcd(long a,long b)\n {\n long min=Math.min(a,b);\n long max=Math.max(a,b);\n while (max%min!=0)\n {\n a=max%min;\n max=min;min=a;\n }\n return min;\n }\n\tpublic static void main(String[] args) throws IOException \n\t{\n\t\tReader sc=new Reader();//Solution G=new Solution();\n\t\tPrintWriter o = new PrintWriter(System.out);\n\t\tint t=1;\n\t\t//int t=sc.nextInt();\n\t\t\n\t\tint n,m,y0,x0,y1,x1,x2,y2,s0,s2;int a[],b[],in[],in1[];\n\t\tlong k,l;boolean b1[],b2;String s1[],ss,s;\n\t\t//long l;long a[]; \n\t\tArrayList<ArrayList<Integer>> ll=new ArrayList<>();\n\t\tArrayList<Integer> a1=new ArrayList<>();\n\t\tArrayList<Integer> a2=new ArrayList<>();\n\t\tArrayList<Integer> a3=new ArrayList<>();\n\t\tArrayDeque<Integer> deq=new ArrayDeque<>();\n\t\tTreeSet<Integer> h0=new TreeSet<>();\n\t\tTreeSet<Integer> h1=new TreeSet<>();\n\t\tHashMap<Integer,Integer> h=new HashMap<>();\n\t\ttry{\n\t\twhile (t-->0)\n\t\t{\n\t\t ss=sc.next();s=sc.next();n=s.length();\n\t\t for (int i=0;i<ss.length()-s.length()+1;i++)\n\t\t {\n\t\t x0=0;\n\t\t for (int j=0;j<s.length();j++)\n\t\t {\n\t\t if (s.charAt(j)!=ss.charAt(i+j))\n\t\t x0++;\n\t\t }\n\t\t n=Math.min(n,x0);\n\t\t }\n\t\t o.println(n);\n\t\t //o.println(s);\n\t\t //o.println();\n\t\t //o.println();\n\t\t //o.println(h);\n\t\t //o.println(x2);\n\t\t //o.println();\n\t\t h0.clear();ll.clear();a1.clear();a2.clear();h1.clear();\n\t\t}\n\t\t}\n\t\tcatch (Throwable e)\n\t\t{\n\t\t e.printStackTrace();\n\t\t}\n\t\t//o.println(\"HI\");\n\t\t\n o.flush();\n o.close();\n\t}\n}",
"Main"
]
| import java.util.*;
import java.io.*;
public class Main
{
static class Reader {
BufferedReader br;
StringTokenizer st;
public Reader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
static class Ele implements Comparable<Ele>
{
public int x,y;
Ele(int x,int y)
{
this.x=x;this.y=y;
}
public int compareTo(Ele ob) {
if(ob.x!=x)return x-ob.x;
return this.y-ob.y;
}
}
int a[][];int b[][];
long gcd(long a,long b)
{
long min=Math.min(a,b);
long max=Math.max(a,b);
while (max%min!=0)
{
a=max%min;
max=min;min=a;
}
return min;
}
public static void main(String[] args) throws IOException
{
Reader sc=new Reader();//Solution G=new Solution();
PrintWriter o = new PrintWriter(System.out);
int t=1;
//int t=sc.nextInt();
int n,m,y0,x0,y1,x1,x2,y2,s0,s2;int a[],b[],in[],in1[];
long k,l;boolean b1[],b2;String s1[],ss,s;
//long l;long a[];
ArrayList<ArrayList<Integer>> ll=new ArrayList<>();
ArrayList<Integer> a1=new ArrayList<>();
ArrayList<Integer> a2=new ArrayList<>();
ArrayList<Integer> a3=new ArrayList<>();
ArrayDeque<Integer> deq=new ArrayDeque<>();
TreeSet<Integer> h0=new TreeSet<>();
TreeSet<Integer> h1=new TreeSet<>();
HashMap<Integer,Integer> h=new HashMap<>();
try{
while (t-->0)
{
ss=sc.next();s=sc.next();n=s.length();
for (int i=0;i<ss.length()-s.length()+1;i++)
{
x0=0;
for (int j=0;j<s.length();j++)
{
if (s.charAt(j)!=ss.charAt(i+j))
x0++;
}
n=Math.min(n,x0);
}
o.println(n);
//o.println(s);
//o.println();
//o.println();
//o.println(h);
//o.println(x2);
//o.println();
h0.clear();ll.clear();a1.clear();a2.clear();h1.clear();
}
}
catch (Throwable e)
{
e.printStackTrace();
}
//o.println("HI");
o.flush();
o.close();
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
20,
12,
13,
30,
41,
13,
20,
41,
13,
17,
42,
2,
40,
13,
17,
30,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
13,
11,
1,
41,
13,
17,
2,
2,
2,
13,
13,
17,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
13,
13,
4,
18,
13,
4,
18,
13,
23,
13,
6,
13,
41,
13,
20,
17,
41,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
13,
30,
0,
13,
17,
0,
13,
4,
18,
13,
13,
14,
2,
13,
17,
30,
29,
40,
17,
29,
18,
13,
40,
13,
12,
13,
30,
41,
13,
11,
1,
0,
13,
4,
13,
2,
13,
17,
1,
0,
13,
4,
13,
30,
41,
13,
20,
11,
1,
2,
13,
17,
1,
0,
13,
4,
13,
30,
30,
4,
18,
13,
13,
29,
4,
18,
13,
12,
13,
30,
41,
13,
41,
13,
17,
11,
1,
0,
13,
4,
13,
2,
13,
17,
1,
0,
13,
4,
13,
30,
41,
13,
2,
13,
17,
14,
2,
2,
13,
17,
2,
13,
17,
30,
0,
13,
4,
13,
11,
1,
2,
2,
13,
17,
2,
13,
17,
1,
0,
13,
4,
13,
30,
30,
0,
13,
2,
2,
2,
13,
17,
2,
13,
17,
2,
13,
17,
29,
8,
13,
40,
13,
13,
12,
13,
30,
41,
13,
41,
13,
17,
11,
1,
0,
13,
4,
13,
2,
13,
17,
1,
0,
13,
4,
13,
30,
41,
13,
2,
13,
17,
14,
2,
2,
13,
17,
2,
13,
17,
30,
0,
13,
4,
13,
11,
1,
2,
2,
13,
17,
2,
13,
17,
1,
0,
13,
4,
13,
30,
30,
0,
13,
2,
2,
2,
13,
17,
2,
13,
17,
2,
13,
17,
29,
8,
13,
40,
13,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
366,
11
],
[
366,
12
],
[
12,
13
],
[
12,
14
],
[
366,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
18,
20
],
[
17,
21
],
[
21,
22
],
[
21,
23
],
[
17,
24
],
[
24,
25
],
[
25,
26
],
[
26,
27
],
[
25,
28
],
[
24,
29
],
[
29,
30
],
[
30,
31
],
[
30,
32
],
[
32,
33
],
[
33,
34
],
[
29,
35
],
[
35,
36
],
[
35,
37
],
[
37,
38
],
[
38,
39
],
[
29,
40
],
[
40,
41
],
[
40,
42
],
[
42,
43
],
[
43,
44
],
[
29,
45
],
[
45,
46
],
[
45,
47
],
[
47,
48
],
[
48,
49
],
[
29,
50
],
[
50,
51
],
[
50,
52
],
[
29,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
53,
58
],
[
58,
59
],
[
59,
60
],
[
60,
61
],
[
60,
62
],
[
59,
63
],
[
58,
64
],
[
53,
65
],
[
65,
66
],
[
66,
67
],
[
53,
68
],
[
69,
69
],
[
69,
70
],
[
70,
71
],
[
70,
72
],
[
69,
73
],
[
73,
74
],
[
74,
75
],
[
75,
76
],
[
75,
77
],
[
73,
78
],
[
78,
79
],
[
78,
80
],
[
73,
81
],
[
81,
82
],
[
82,
83
],
[
73,
84
],
[
85,
85
],
[
85,
86
],
[
86,
87
],
[
87,
88
],
[
88,
89
],
[
89,
90
],
[
88,
91
],
[
91,
92
],
[
91,
93
],
[
87,
94
],
[
94,
95
],
[
95,
96
],
[
94,
97
],
[
86,
98
],
[
98,
99
],
[
99,
100
],
[
69,
101
],
[
101,
102
],
[
101,
103
],
[
103,
104
],
[
104,
105
],
[
103,
106
],
[
103,
107
],
[
29,
108
],
[
108,
109
],
[
109,
110
],
[
108,
111
],
[
17,
112
],
[
112,
113
],
[
113,
114
],
[
17,
115
],
[
115,
116
],
[
116,
117
],
[
15,
118
],
[
118,
119
],
[
366,
120
],
[
120,
121
],
[
120,
122
],
[
122,
123
],
[
122,
124
],
[
120,
126
],
[
126,
127
],
[
120,
128
],
[
128,
129
],
[
120,
130
],
[
130,
131
],
[
120,
132
],
[
132,
133
],
[
132,
134
],
[
134,
135
],
[
135,
136
],
[
135,
137
],
[
132,
138
],
[
138,
139
],
[
120,
140
],
[
140,
141
],
[
140,
142
],
[
142,
143
],
[
143,
144
],
[
144,
145
],
[
144,
146
],
[
143,
147
],
[
147,
148
],
[
148,
149
],
[
148,
150
],
[
147,
151
],
[
151,
152
],
[
151,
153
],
[
153,
154
],
[
154,
155
],
[
153,
156
],
[
147,
157
],
[
157,
158
],
[
158,
159
],
[
158,
160
],
[
157,
161
],
[
161,
162
],
[
162,
163
],
[
163,
164
],
[
142,
165
],
[
165,
166
],
[
166,
167
],
[
166,
168
],
[
168,
169
],
[
120,
170
],
[
170,
171
],
[
170,
172
],
[
172,
173
],
[
173,
174
],
[
172,
175
],
[
175,
176
],
[
176,
177
],
[
177,
178
],
[
177,
179
],
[
179,
180
],
[
175,
181
],
[
181,
182
],
[
181,
183
],
[
175,
184
],
[
184,
185
],
[
185,
186
],
[
185,
187
],
[
187,
188
],
[
175,
189
],
[
172,
190
],
[
190,
191
],
[
190,
192
],
[
172,
193
],
[
193,
194
],
[
193,
195
],
[
195,
196
],
[
195,
197
],
[
193,
198
],
[
198,
199
],
[
199,
200
],
[
199,
201
],
[
201,
202
],
[
193,
203
],
[
204,
204
],
[
204,
205
],
[
205,
206
],
[
206,
207
],
[
205,
208
],
[
172,
209
],
[
209,
210
],
[
210,
211
],
[
211,
212
],
[
120,
213
],
[
213,
214
],
[
213,
215
],
[
215,
216
],
[
216,
217
],
[
215,
218
],
[
218,
219
],
[
218,
220
],
[
215,
221
],
[
221,
222
],
[
222,
223
],
[
223,
224
],
[
223,
225
],
[
225,
226
],
[
221,
227
],
[
227,
228
],
[
227,
229
],
[
221,
230
],
[
230,
231
],
[
231,
232
],
[
231,
233
],
[
233,
234
],
[
221,
235
],
[
215,
236
],
[
236,
237
],
[
236,
238
],
[
238,
239
],
[
238,
240
],
[
215,
241
],
[
241,
242
],
[
242,
243
],
[
243,
244
],
[
243,
245
],
[
242,
246
],
[
246,
247
],
[
246,
248
],
[
241,
249
],
[
249,
250
],
[
250,
251
],
[
250,
252
],
[
252,
253
],
[
215,
254
],
[
254,
255
],
[
254,
256
],
[
256,
257
],
[
257,
258
],
[
257,
259
],
[
256,
260
],
[
260,
261
],
[
260,
262
],
[
254,
263
],
[
263,
264
],
[
264,
265
],
[
264,
266
],
[
266,
267
],
[
254,
268
],
[
269,
269
],
[
269,
270
],
[
270,
271
],
[
270,
272
],
[
273,
273
],
[
273,
274
],
[
274,
275
],
[
274,
276
],
[
273,
277
],
[
277,
278
],
[
277,
279
],
[
273,
280
],
[
280,
281
],
[
280,
282
],
[
215,
283
],
[
283,
284
],
[
284,
285
],
[
284,
286
],
[
286,
287
],
[
284,
288
],
[
120,
289
],
[
289,
290
],
[
289,
291
],
[
291,
292
],
[
292,
293
],
[
291,
294
],
[
294,
295
],
[
294,
296
],
[
291,
297
],
[
297,
298
],
[
298,
299
],
[
299,
300
],
[
299,
301
],
[
301,
302
],
[
297,
303
],
[
303,
304
],
[
303,
305
],
[
297,
306
],
[
306,
307
],
[
307,
308
],
[
307,
309
],
[
309,
310
],
[
297,
311
],
[
291,
312
],
[
312,
313
],
[
312,
314
],
[
314,
315
],
[
314,
316
],
[
291,
317
],
[
317,
318
],
[
318,
319
],
[
319,
320
],
[
319,
321
],
[
318,
322
],
[
322,
323
],
[
322,
324
],
[
317,
325
],
[
325,
326
],
[
326,
327
],
[
326,
328
],
[
328,
329
],
[
291,
330
],
[
330,
331
],
[
330,
332
],
[
332,
333
],
[
333,
334
],
[
333,
335
],
[
332,
336
],
[
336,
337
],
[
336,
338
],
[
330,
339
],
[
339,
340
],
[
340,
341
],
[
340,
342
],
[
342,
343
],
[
330,
344
],
[
345,
345
],
[
345,
346
],
[
346,
347
],
[
346,
348
],
[
349,
349
],
[
349,
350
],
[
350,
351
],
[
350,
352
],
[
349,
353
],
[
353,
354
],
[
353,
355
],
[
349,
356
],
[
356,
357
],
[
356,
358
],
[
291,
359
],
[
359,
360
],
[
360,
361
],
[
360,
362
],
[
362,
363
],
[
360,
364
],
[
0,
365
],
[
365,
366
],
[
365,
367
]
]
| [
"//package com.company;\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\n//****Use Integer Wrapper Class for Arrays.sort()****\npublic class Main {\n static PrintWriter out=new PrintWriter(new OutputStreamWriter(System.out));\n public static void main(String[] Args)throws Exception{\n FastReader scan=new FastReader(System.in);\n int t=1;\n// t=scan.nextInt();\n while(t-->0){\n String s=scan.next();\n String tt=scan.next();\n int m=tt.length();\n int n=s.length();\n int ans=m;\n for(int i=0;i+m-1<n;i++){\n int c=0;\n for(int j=0;j<m;j++){\n if(s.charAt(i+j)!=tt.charAt(j)){\n c++;\n }\n }\n ans=Math.min(ans,c);\n }\n out.println(ans);\n }\n out.flush();\n out.close();\n }\n static class FastReader {\n\n byte[] buf = new byte[2048];\n int index, total;\n InputStream in;\n\n FastReader(InputStream is) {\n in = is;\n }\n\n int scan() throws IOException {\n if (index >= total) {\n index = 0;\n total = in.read(buf);\n if (total <= 0) {\n return -1;\n }\n }\n return buf[index++];\n }\n\n String next() throws IOException {\n int c;\n for (c = scan(); c <= 32; c = scan()) ;\n StringBuilder sb = new StringBuilder();\n for (; c > 32; c = scan()) {\n sb.append((char) c);\n }\n return sb.toString();\n }\n\n int nextInt() throws IOException {\n int c, val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = scan();\n }\n for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }\n long nextLong() throws IOException {\n int c;\n long val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = scan();\n }\n for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }\n }\n}",
"import java.util.*;",
"util.*",
"java",
"import java.lang.*;",
"lang.*",
"java",
"import java.io.*;",
"io.*",
"java",
"public class Main {\n static PrintWriter out=new PrintWriter(new OutputStreamWriter(System.out));\n public static void main(String[] Args)throws Exception{\n FastReader scan=new FastReader(System.in);\n int t=1;\n// t=scan.nextInt();\n while(t-->0){\n String s=scan.next();\n String tt=scan.next();\n int m=tt.length();\n int n=s.length();\n int ans=m;\n for(int i=0;i+m-1<n;i++){\n int c=0;\n for(int j=0;j<m;j++){\n if(s.charAt(i+j)!=tt.charAt(j)){\n c++;\n }\n }\n ans=Math.min(ans,c);\n }\n out.println(ans);\n }\n out.flush();\n out.close();\n }\n static class FastReader {\n\n byte[] buf = new byte[2048];\n int index, total;\n InputStream in;\n\n FastReader(InputStream is) {\n in = is;\n }\n\n int scan() throws IOException {\n if (index >= total) {\n index = 0;\n total = in.read(buf);\n if (total <= 0) {\n return -1;\n }\n }\n return buf[index++];\n }\n\n String next() throws IOException {\n int c;\n for (c = scan(); c <= 32; c = scan()) ;\n StringBuilder sb = new StringBuilder();\n for (; c > 32; c = scan()) {\n sb.append((char) c);\n }\n return sb.toString();\n }\n\n int nextInt() throws IOException {\n int c, val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = scan();\n }\n for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }\n long nextLong() throws IOException {\n int c;\n long val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = scan();\n }\n for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }\n }\n}",
"Main",
"static PrintWriter out=new PrintWriter(new OutputStreamWriter(System.out));",
"out",
"new PrintWriter(new OutputStreamWriter(System.out))",
"public static void main(String[] Args)throws Exception{\n FastReader scan=new FastReader(System.in);\n int t=1;\n// t=scan.nextInt();\n while(t-->0){\n String s=scan.next();\n String tt=scan.next();\n int m=tt.length();\n int n=s.length();\n int ans=m;\n for(int i=0;i+m-1<n;i++){\n int c=0;\n for(int j=0;j<m;j++){\n if(s.charAt(i+j)!=tt.charAt(j)){\n c++;\n }\n }\n ans=Math.min(ans,c);\n }\n out.println(ans);\n }\n out.flush();\n out.close();\n }",
"main",
"{\n FastReader scan=new FastReader(System.in);\n int t=1;\n// t=scan.nextInt();\n while(t-->0){\n String s=scan.next();\n String tt=scan.next();\n int m=tt.length();\n int n=s.length();\n int ans=m;\n for(int i=0;i+m-1<n;i++){\n int c=0;\n for(int j=0;j<m;j++){\n if(s.charAt(i+j)!=tt.charAt(j)){\n c++;\n }\n }\n ans=Math.min(ans,c);\n }\n out.println(ans);\n }\n out.flush();\n out.close();\n }",
"FastReader scan=new FastReader(System.in);",
"scan",
"new FastReader(System.in)",
"int t=1;",
"t",
"1",
"while(t-->0){\n String s=scan.next();\n String tt=scan.next();\n int m=tt.length();\n int n=s.length();\n int ans=m;\n for(int i=0;i+m-1<n;i++){\n int c=0;\n for(int j=0;j<m;j++){\n if(s.charAt(i+j)!=tt.charAt(j)){\n c++;\n }\n }\n ans=Math.min(ans,c);\n }\n out.println(ans);\n }",
"t-->0",
"t--",
"t",
"0",
"{\n String s=scan.next();\n String tt=scan.next();\n int m=tt.length();\n int n=s.length();\n int ans=m;\n for(int i=0;i+m-1<n;i++){\n int c=0;\n for(int j=0;j<m;j++){\n if(s.charAt(i+j)!=tt.charAt(j)){\n c++;\n }\n }\n ans=Math.min(ans,c);\n }\n out.println(ans);\n }",
"String s=scan.next();",
"s",
"scan.next()",
"scan.next",
"scan",
"String tt=scan.next();",
"tt",
"scan.next()",
"scan.next",
"scan",
"int m=tt.length();",
"m",
"tt.length()",
"tt.length",
"tt",
"int n=s.length();",
"n",
"s.length()",
"s.length",
"s",
"int ans=m;",
"ans",
"m",
"for(int i=0;i+m-1<n;i++){\n int c=0;\n for(int j=0;j<m;j++){\n if(s.charAt(i+j)!=tt.charAt(j)){\n c++;\n }\n }\n ans=Math.min(ans,c);\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i+m-1<n",
"i+m-1",
"i+m",
"i",
"m",
"1",
"n",
"i++",
"i++",
"i",
"{\n int c=0;\n for(int j=0;j<m;j++){\n if(s.charAt(i+j)!=tt.charAt(j)){\n c++;\n }\n }\n ans=Math.min(ans,c);\n }",
"{\n int c=0;\n for(int j=0;j<m;j++){\n if(s.charAt(i+j)!=tt.charAt(j)){\n c++;\n }\n }\n ans=Math.min(ans,c);\n }",
"int c=0;",
"c",
"0",
"for(int j=0;j<m;j++){\n if(s.charAt(i+j)!=tt.charAt(j)){\n c++;\n }\n }",
"int j=0;",
"int j=0;",
"j",
"0",
"j<m",
"j",
"m",
"j++",
"j++",
"j",
"{\n if(s.charAt(i+j)!=tt.charAt(j)){\n c++;\n }\n }",
"{\n if(s.charAt(i+j)!=tt.charAt(j)){\n c++;\n }\n }",
"if(s.charAt(i+j)!=tt.charAt(j)){\n c++;\n }",
"s.charAt(i+j)!=tt.charAt(j)",
"s.charAt(i+j)",
"s.charAt",
"s",
"i+j",
"i",
"j",
"tt.charAt(j)",
"tt.charAt",
"tt",
"j",
"{\n c++;\n }",
"c++",
"c",
"ans=Math.min(ans,c)",
"ans",
"Math.min(ans,c)",
"Math.min",
"Math",
"ans",
"c",
"out.println(ans)",
"out.println",
"out",
"ans",
"out.flush()",
"out.flush",
"out",
"out.close()",
"out.close",
"out",
"String[] Args",
"Args",
"static class FastReader {\n\n byte[] buf = new byte[2048];\n int index, total;\n InputStream in;\n\n FastReader(InputStream is) {\n in = is;\n }\n\n int scan() throws IOException {\n if (index >= total) {\n index = 0;\n total = in.read(buf);\n if (total <= 0) {\n return -1;\n }\n }\n return buf[index++];\n }\n\n String next() throws IOException {\n int c;\n for (c = scan(); c <= 32; c = scan()) ;\n StringBuilder sb = new StringBuilder();\n for (; c > 32; c = scan()) {\n sb.append((char) c);\n }\n return sb.toString();\n }\n\n int nextInt() throws IOException {\n int c, val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = scan();\n }\n for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }\n long nextLong() throws IOException {\n int c;\n long val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = scan();\n }\n for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }\n }",
"FastReader",
"byte[] buf = new byte[2048];",
"buf",
"new byte[2048]",
"2048",
"int index",
"index",
"total;",
"total",
"InputStream in;",
"in",
"FastReader(InputStream is) {\n in = is;\n }",
"FastReader",
"{\n in = is;\n }",
"in = is",
"in",
"is",
"InputStream is",
"is",
"int scan() throws IOException {\n if (index >= total) {\n index = 0;\n total = in.read(buf);\n if (total <= 0) {\n return -1;\n }\n }\n return buf[index++];\n }",
"scan",
"{\n if (index >= total) {\n index = 0;\n total = in.read(buf);\n if (total <= 0) {\n return -1;\n }\n }\n return buf[index++];\n }",
"if (index >= total) {\n index = 0;\n total = in.read(buf);\n if (total <= 0) {\n return -1;\n }\n }",
"index >= total",
"index",
"total",
"{\n index = 0;\n total = in.read(buf);\n if (total <= 0) {\n return -1;\n }\n }",
"index = 0",
"index",
"0",
"total = in.read(buf)",
"total",
"in.read(buf)",
"in.read",
"in",
"buf",
"if (total <= 0) {\n return -1;\n }",
"total <= 0",
"total",
"0",
"{\n return -1;\n }",
"return -1;",
"-1",
"1",
"return buf[index++];",
"buf[index++]",
"buf",
"index++",
"index",
"String next() throws IOException {\n int c;\n for (c = scan(); c <= 32; c = scan()) ;\n StringBuilder sb = new StringBuilder();\n for (; c > 32; c = scan()) {\n sb.append((char) c);\n }\n return sb.toString();\n }",
"next",
"{\n int c;\n for (c = scan(); c <= 32; c = scan()) ;\n StringBuilder sb = new StringBuilder();\n for (; c > 32; c = scan()) {\n sb.append((char) c);\n }\n return sb.toString();\n }",
"int c;",
"c",
"for (c = scan(); c <= 32; c = scan()) ;",
"c = scan();",
"c = scan()",
"c",
"scan()",
"scan",
"c <= 32",
"c",
"32",
"c = scan()",
"c = scan()",
"c",
"scan()",
"scan",
";",
"StringBuilder sb = new StringBuilder();",
"sb",
"new StringBuilder()",
"for (; c > 32; c = scan()) {\n sb.append((char) c);\n }",
";",
"c > 32",
"c",
"32",
"c = scan()",
"c = scan()",
"c",
"scan()",
"scan",
"{\n sb.append((char) c);\n }",
"{\n sb.append((char) c);\n }",
"sb.append((char) c)",
"sb.append",
"sb",
"(char) c",
"return sb.toString();",
"sb.toString()",
"sb.toString",
"sb",
"int nextInt() throws IOException {\n int c, val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = scan();\n }\n for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }",
"nextInt",
"{\n int c, val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = scan();\n }\n for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }",
"int c",
"c",
"val = 0;",
"val",
"0",
"for (c = scan(); c <= 32; c = scan()) ;",
"c = scan();",
"c = scan()",
"c",
"scan()",
"scan",
"c <= 32",
"c",
"32",
"c = scan()",
"c = scan()",
"c",
"scan()",
"scan",
";",
"boolean neg = c == '-';",
"neg",
"c == '-'",
"c",
"'-'",
"if (c == '-' || c == '+') {\n c = scan();\n }",
"c == '-' || c == '+'",
"c == '-'",
"c",
"'-'",
"c == '+'",
"c",
"'+'",
"{\n c = scan();\n }",
"c = scan()",
"c",
"scan()",
"scan",
"for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }",
";",
"c >= '0' && c <= '9'",
"c >= '0'",
"c",
"'0'",
"c <= '9'",
"c",
"'9'",
"c = scan()",
"c = scan()",
"c",
"scan()",
"scan",
"{\n val = (val << 3) + (val << 1) + (c & 15);\n }",
"{\n val = (val << 3) + (val << 1) + (c & 15);\n }",
"val = (val << 3) + (val << 1) + (c & 15)",
"val",
"(val << 3) + (val << 1) + (c & 15)",
"(val << 3) + (val << 1) + (c & 15)",
"(val << 3)",
"val",
"3",
"(val << 1)",
"val",
"1",
"(c & 15)",
"c",
"15",
"return neg ? -val : val;",
"neg ? -val : val",
"neg",
"-val",
"val",
"val",
"long nextLong() throws IOException {\n int c;\n long val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = scan();\n }\n for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }",
"nextLong",
"{\n int c;\n long val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = scan();\n }\n for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }",
"int c;",
"c",
"long val = 0;",
"val",
"0",
"for (c = scan(); c <= 32; c = scan()) ;",
"c = scan();",
"c = scan()",
"c",
"scan()",
"scan",
"c <= 32",
"c",
"32",
"c = scan()",
"c = scan()",
"c",
"scan()",
"scan",
";",
"boolean neg = c == '-';",
"neg",
"c == '-'",
"c",
"'-'",
"if (c == '-' || c == '+') {\n c = scan();\n }",
"c == '-' || c == '+'",
"c == '-'",
"c",
"'-'",
"c == '+'",
"c",
"'+'",
"{\n c = scan();\n }",
"c = scan()",
"c",
"scan()",
"scan",
"for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }",
";",
"c >= '0' && c <= '9'",
"c >= '0'",
"c",
"'0'",
"c <= '9'",
"c",
"'9'",
"c = scan()",
"c = scan()",
"c",
"scan()",
"scan",
"{\n val = (val << 3) + (val << 1) + (c & 15);\n }",
"{\n val = (val << 3) + (val << 1) + (c & 15);\n }",
"val = (val << 3) + (val << 1) + (c & 15)",
"val",
"(val << 3) + (val << 1) + (c & 15)",
"(val << 3) + (val << 1) + (c & 15)",
"(val << 3)",
"val",
"3",
"(val << 1)",
"val",
"1",
"(c & 15)",
"c",
"15",
"return neg ? -val : val;",
"neg ? -val : val",
"neg",
"-val",
"val",
"val",
"public class Main {\n static PrintWriter out=new PrintWriter(new OutputStreamWriter(System.out));\n public static void main(String[] Args)throws Exception{\n FastReader scan=new FastReader(System.in);\n int t=1;\n// t=scan.nextInt();\n while(t-->0){\n String s=scan.next();\n String tt=scan.next();\n int m=tt.length();\n int n=s.length();\n int ans=m;\n for(int i=0;i+m-1<n;i++){\n int c=0;\n for(int j=0;j<m;j++){\n if(s.charAt(i+j)!=tt.charAt(j)){\n c++;\n }\n }\n ans=Math.min(ans,c);\n }\n out.println(ans);\n }\n out.flush();\n out.close();\n }\n static class FastReader {\n\n byte[] buf = new byte[2048];\n int index, total;\n InputStream in;\n\n FastReader(InputStream is) {\n in = is;\n }\n\n int scan() throws IOException {\n if (index >= total) {\n index = 0;\n total = in.read(buf);\n if (total <= 0) {\n return -1;\n }\n }\n return buf[index++];\n }\n\n String next() throws IOException {\n int c;\n for (c = scan(); c <= 32; c = scan()) ;\n StringBuilder sb = new StringBuilder();\n for (; c > 32; c = scan()) {\n sb.append((char) c);\n }\n return sb.toString();\n }\n\n int nextInt() throws IOException {\n int c, val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = scan();\n }\n for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }\n long nextLong() throws IOException {\n int c;\n long val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = scan();\n }\n for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }\n }\n}",
"public class Main {\n static PrintWriter out=new PrintWriter(new OutputStreamWriter(System.out));\n public static void main(String[] Args)throws Exception{\n FastReader scan=new FastReader(System.in);\n int t=1;\n// t=scan.nextInt();\n while(t-->0){\n String s=scan.next();\n String tt=scan.next();\n int m=tt.length();\n int n=s.length();\n int ans=m;\n for(int i=0;i+m-1<n;i++){\n int c=0;\n for(int j=0;j<m;j++){\n if(s.charAt(i+j)!=tt.charAt(j)){\n c++;\n }\n }\n ans=Math.min(ans,c);\n }\n out.println(ans);\n }\n out.flush();\n out.close();\n }\n static class FastReader {\n\n byte[] buf = new byte[2048];\n int index, total;\n InputStream in;\n\n FastReader(InputStream is) {\n in = is;\n }\n\n int scan() throws IOException {\n if (index >= total) {\n index = 0;\n total = in.read(buf);\n if (total <= 0) {\n return -1;\n }\n }\n return buf[index++];\n }\n\n String next() throws IOException {\n int c;\n for (c = scan(); c <= 32; c = scan()) ;\n StringBuilder sb = new StringBuilder();\n for (; c > 32; c = scan()) {\n sb.append((char) c);\n }\n return sb.toString();\n }\n\n int nextInt() throws IOException {\n int c, val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = scan();\n }\n for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }\n long nextLong() throws IOException {\n int c;\n long val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = scan();\n }\n for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }\n }\n}",
"Main"
]
| //package com.company;
import java.util.*;
import java.lang.*;
import java.io.*;
//****Use Integer Wrapper Class for Arrays.sort()****
public class Main {
static PrintWriter out=new PrintWriter(new OutputStreamWriter(System.out));
public static void main(String[] Args)throws Exception{
FastReader scan=new FastReader(System.in);
int t=1;
// t=scan.nextInt();
while(t-->0){
String s=scan.next();
String tt=scan.next();
int m=tt.length();
int n=s.length();
int ans=m;
for(int i=0;i+m-1<n;i++){
int c=0;
for(int j=0;j<m;j++){
if(s.charAt(i+j)!=tt.charAt(j)){
c++;
}
}
ans=Math.min(ans,c);
}
out.println(ans);
}
out.flush();
out.close();
}
static class FastReader {
byte[] buf = new byte[2048];
int index, total;
InputStream in;
FastReader(InputStream is) {
in = is;
}
int scan() throws IOException {
if (index >= total) {
index = 0;
total = in.read(buf);
if (total <= 0) {
return -1;
}
}
return buf[index++];
}
String next() throws IOException {
int c;
for (c = scan(); c <= 32; c = scan()) ;
StringBuilder sb = new StringBuilder();
for (; c > 32; c = scan()) {
sb.append((char) c);
}
return sb.toString();
}
int nextInt() throws IOException {
int c, val = 0;
for (c = scan(); c <= 32; c = scan()) ;
boolean neg = c == '-';
if (c == '-' || c == '+') {
c = scan();
}
for (; c >= '0' && c <= '9'; c = scan()) {
val = (val << 3) + (val << 1) + (c & 15);
}
return neg ? -val : val;
}
long nextLong() throws IOException {
int c;
long val = 0;
for (c = scan(); c <= 32; c = scan()) ;
boolean neg = c == '-';
if (c == '-' || c == '+') {
c = scan();
}
for (; c >= '0' && c <= '9'; c = scan()) {
val = (val << 3) + (val << 1) + (c & 15);
}
return neg ? -val : val;
}
}
}
|
[
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,
18,
13,
13,
41,
13,
18,
13,
13,
41,
13,
20,
41,
13,
20,
41,
13,
20,
4,
18,
13,
17,
13,
13,
4,
18,
13,
23,
13,
6,
13,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
2,
4,
18,
13,
4,
18,
13,
17,
1,
40,
13,
30,
30,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
2,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
0,
13,
17,
4,
18,
13,
13,
23,
13,
23,
13,
23,
13,
6,
13,
41,
13,
41,
13,
20,
17,
41,
13,
41,
13,
41,
13,
12,
13,
30,
0,
18,
36,
13,
13,
23,
13,
12,
13,
30,
14,
2,
13,
40,
17,
37,
20,
14,
2,
13,
13,
30,
0,
13,
17,
38,
5,
13,
30,
37,
20,
30,
0,
13,
4,
18,
13,
13,
14,
2,
13,
17,
29,
40,
17,
29,
18,
13,
40,
13,
12,
13,
30,
41,
13,
4,
13,
42,
4,
13,
13,
0,
13,
4,
13,
41,
13,
20,
42,
40,
4,
13,
13,
30,
4,
18,
13,
13,
0,
13,
4,
13,
29,
4,
18,
13,
12,
13,
30,
14,
2,
13,
17,
29,
4,
18,
13,
13,
29,
2,
2,
2,
2,
2,
13,
17,
2,
13,
17,
2,
13,
17,
2,
13,
17,
2,
13,
40,
17,
23,
13,
6,
13,
12,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
16,
17
],
[
16,
18
],
[
0,
19
],
[
19,
20
],
[
19,
21
],
[
0,
22
],
[
295,
23
],
[
295,
24
],
[
24,
25
],
[
24,
26
],
[
26,
27
],
[
27,
28
],
[
27,
29
],
[
29,
30
],
[
29,
31
],
[
26,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
34,
36
],
[
26,
37
],
[
37,
38
],
[
37,
39
],
[
26,
40
],
[
40,
41
],
[
40,
42
],
[
26,
43
],
[
43,
44
],
[
43,
45
],
[
26,
46
],
[
46,
47
],
[
47,
48
],
[
46,
49
],
[
46,
50
],
[
46,
51
],
[
26,
52
],
[
52,
53
],
[
53,
54
],
[
24,
55
],
[
55,
56
],
[
295,
57
],
[
57,
58
],
[
57,
59
],
[
59,
60
],
[
59,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
65,
66
],
[
61,
67
],
[
67,
68
],
[
67,
69
],
[
69,
70
],
[
70,
71
],
[
61,
72
],
[
72,
73
],
[
72,
74
],
[
61,
75
],
[
75,
76
],
[
75,
77
],
[
77,
78
],
[
77,
79
],
[
61,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
82,
84
],
[
80,
85
],
[
85,
86
],
[
85,
87
],
[
87,
88
],
[
88,
89
],
[
89,
90
],
[
90,
91
],
[
88,
92
],
[
92,
93
],
[
93,
94
],
[
87,
95
],
[
80,
96
],
[
96,
97
],
[
97,
98
],
[
80,
99
],
[
100,
100
],
[
100,
101
],
[
101,
102
],
[
102,
103
],
[
103,
104
],
[
103,
105
],
[
101,
106
],
[
106,
107
],
[
106,
108
],
[
108,
109
],
[
109,
110
],
[
101,
111
],
[
111,
112
],
[
112,
113
],
[
101,
114
],
[
115,
115
],
[
115,
116
],
[
116,
117
],
[
117,
118
],
[
118,
119
],
[
119,
120
],
[
118,
121
],
[
117,
122
],
[
122,
123
],
[
123,
124
],
[
122,
125
],
[
125,
126
],
[
125,
127
],
[
116,
128
],
[
128,
129
],
[
100,
130
],
[
130,
131
],
[
130,
132
],
[
132,
133
],
[
133,
134
],
[
132,
135
],
[
132,
136
],
[
100,
137
],
[
137,
138
],
[
137,
139
],
[
61,
140
],
[
140,
141
],
[
141,
142
],
[
140,
143
],
[
59,
144
],
[
144,
145
],
[
59,
146
],
[
146,
147
],
[
59,
148
],
[
148,
149
],
[
295,
150
],
[
150,
151
],
[
150,
152
],
[
152,
153
],
[
150,
154
],
[
154,
155
],
[
154,
156
],
[
150,
158
],
[
158,
159
],
[
150,
160
],
[
160,
161
],
[
150,
162
],
[
162,
163
],
[
150,
164
],
[
164,
165
],
[
164,
166
],
[
166,
167
],
[
167,
168
],
[
168,
169
],
[
168,
170
],
[
167,
171
],
[
164,
172
],
[
172,
173
],
[
150,
174
],
[
174,
175
],
[
174,
176
],
[
176,
177
],
[
177,
178
],
[
178,
179
],
[
178,
180
],
[
180,
181
],
[
177,
182
],
[
182,
183
],
[
176,
184
],
[
184,
185
],
[
185,
186
],
[
185,
187
],
[
184,
188
],
[
188,
189
],
[
189,
190
],
[
189,
191
],
[
188,
192
],
[
192,
193
],
[
193,
194
],
[
193,
195
],
[
195,
196
],
[
196,
197
],
[
192,
198
],
[
198,
199
],
[
199,
200
],
[
199,
201
],
[
201,
202
],
[
202,
203
],
[
201,
204
],
[
188,
205
],
[
205,
206
],
[
206,
207
],
[
206,
208
],
[
205,
209
],
[
209,
210
],
[
210,
211
],
[
176,
212
],
[
212,
213
],
[
213,
214
],
[
213,
215
],
[
215,
216
],
[
150,
217
],
[
217,
218
],
[
217,
219
],
[
219,
220
],
[
220,
221
],
[
220,
222
],
[
222,
223
],
[
219,
224
],
[
224,
225
],
[
225,
226
],
[
225,
227
],
[
224,
228
],
[
228,
229
],
[
228,
230
],
[
230,
231
],
[
219,
232
],
[
232,
233
],
[
232,
234
],
[
219,
235
],
[
235,
236
],
[
236,
237
],
[
237,
238
],
[
237,
239
],
[
235,
240
],
[
240,
241
],
[
241,
242
],
[
242,
243
],
[
241,
244
],
[
240,
245
],
[
245,
246
],
[
245,
247
],
[
247,
248
],
[
219,
249
],
[
249,
250
],
[
250,
251
],
[
251,
252
],
[
150,
253
],
[
253,
254
],
[
253,
255
],
[
255,
256
],
[
256,
257
],
[
257,
258
],
[
257,
259
],
[
256,
260
],
[
260,
261
],
[
261,
262
],
[
262,
263
],
[
261,
264
],
[
255,
265
],
[
265,
266
],
[
269,
267
],
[
279,
268
],
[
276,
269
],
[
269,
270
],
[
270,
271
],
[
270,
272
],
[
269,
273
],
[
273,
274
],
[
273,
275
],
[
276,
276
],
[
276,
277
],
[
276,
278
],
[
279,
279
],
[
279,
280
],
[
279,
281
],
[
269,
282
],
[
282,
283
],
[
282,
284
],
[
284,
285
],
[
253,
286
],
[
286,
287
],
[
150,
288
],
[
288,
289
],
[
288,
290
],
[
290,
291
],
[
290,
292
],
[
292,
293
],
[
0,
294
],
[
294,
295
],
[
294,
296
]
]
| [
"import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\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\n *\n * @author Pranay2516\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastReader in = new FastReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n B solver = new B();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class B {\n public void solve(int testNumber, FastReader in, PrintWriter out) {\n String s = in.next(), t = in.next();\n int cnt = 0, min = Integer.MAX_VALUE;\n for (int i = 0; i < s.length() - t.length() + 1; ++i) {\n for (int j = 0; j < t.length(); ++j) {\n if (t.charAt(j) != s.charAt(i + j)) cnt++;\n }\n min = Math.min(cnt, min);\n cnt = 0;\n }\n out.println(min);\n }\n\n }\n\n static class FastReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private FastReader.SpaceCharFilter filter;\n\n public FastReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) return -1;\n }\n return buf[curChar++];\n }\n\n public String next() {\n int c = read();\n while (isSpaceChar(c)) c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n",
"import java.io.OutputStream;",
"OutputStream",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStream;",
"InputStream",
"java.io",
"import java.io.PrintWriter;",
"PrintWriter",
"java.io",
"import java.util.InputMismatchException;",
"InputMismatchException",
"java.util",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStream;",
"InputStream",
"java.io",
"public class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastReader in = new FastReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n B solver = new B();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class B {\n public void solve(int testNumber, FastReader in, PrintWriter out) {\n String s = in.next(), t = in.next();\n int cnt = 0, min = Integer.MAX_VALUE;\n for (int i = 0; i < s.length() - t.length() + 1; ++i) {\n for (int j = 0; j < t.length(); ++j) {\n if (t.charAt(j) != s.charAt(i + j)) cnt++;\n }\n min = Math.min(cnt, min);\n cnt = 0;\n }\n out.println(min);\n }\n\n }\n\n static class FastReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private FastReader.SpaceCharFilter filter;\n\n public FastReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) return -1;\n }\n return buf[curChar++];\n }\n\n public String next() {\n int c = read();\n while (isSpaceChar(c)) c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}",
"Main",
"public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastReader in = new FastReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n B solver = new B();\n solver.solve(1, in, out);\n out.close();\n }",
"main",
"{\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastReader in = new FastReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n B solver = new B();\n solver.solve(1, in, out);\n out.close();\n }",
"InputStream inputStream = System.in;",
"inputStream",
"System.in",
"System",
"System.in",
"OutputStream outputStream = System.out;",
"outputStream",
"System.out",
"System",
"System.out",
"FastReader in = new FastReader(inputStream);",
"in",
"new FastReader(inputStream)",
"PrintWriter out = new PrintWriter(outputStream);",
"out",
"new PrintWriter(outputStream)",
"B solver = new B();",
"solver",
"new B()",
"solver.solve(1, in, out)",
"solver.solve",
"solver",
"1",
"in",
"out",
"out.close()",
"out.close",
"out",
"String[] args",
"args",
"static class B {\n public void solve(int testNumber, FastReader in, PrintWriter out) {\n String s = in.next(), t = in.next();\n int cnt = 0, min = Integer.MAX_VALUE;\n for (int i = 0; i < s.length() - t.length() + 1; ++i) {\n for (int j = 0; j < t.length(); ++j) {\n if (t.charAt(j) != s.charAt(i + j)) cnt++;\n }\n min = Math.min(cnt, min);\n cnt = 0;\n }\n out.println(min);\n }\n\n }",
"B",
"public void solve(int testNumber, FastReader in, PrintWriter out) {\n String s = in.next(), t = in.next();\n int cnt = 0, min = Integer.MAX_VALUE;\n for (int i = 0; i < s.length() - t.length() + 1; ++i) {\n for (int j = 0; j < t.length(); ++j) {\n if (t.charAt(j) != s.charAt(i + j)) cnt++;\n }\n min = Math.min(cnt, min);\n cnt = 0;\n }\n out.println(min);\n }",
"solve",
"{\n String s = in.next(), t = in.next();\n int cnt = 0, min = Integer.MAX_VALUE;\n for (int i = 0; i < s.length() - t.length() + 1; ++i) {\n for (int j = 0; j < t.length(); ++j) {\n if (t.charAt(j) != s.charAt(i + j)) cnt++;\n }\n min = Math.min(cnt, min);\n cnt = 0;\n }\n out.println(min);\n }",
"String s = in.next()",
"s",
"in.next()",
"in.next",
"in",
"t = in.next();",
"t",
"in.next()",
"in.next",
"in",
"int cnt = 0",
"cnt",
"0",
"min = Integer.MAX_VALUE;",
"min",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"for (int i = 0; i < s.length() - t.length() + 1; ++i) {\n for (int j = 0; j < t.length(); ++j) {\n if (t.charAt(j) != s.charAt(i + j)) cnt++;\n }\n min = Math.min(cnt, min);\n cnt = 0;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < s.length() - t.length() + 1",
"i",
"s.length() - t.length() + 1",
"s.length() - t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"1",
"++i",
"++i",
"i",
"{\n for (int j = 0; j < t.length(); ++j) {\n if (t.charAt(j) != s.charAt(i + j)) cnt++;\n }\n min = Math.min(cnt, min);\n cnt = 0;\n }",
"{\n for (int j = 0; j < t.length(); ++j) {\n if (t.charAt(j) != s.charAt(i + j)) cnt++;\n }\n min = Math.min(cnt, min);\n cnt = 0;\n }",
"for (int j = 0; j < t.length(); ++j) {\n if (t.charAt(j) != s.charAt(i + j)) cnt++;\n }",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < t.length()",
"j",
"t.length()",
"t.length",
"t",
"++j",
"++j",
"j",
"{\n if (t.charAt(j) != s.charAt(i + j)) cnt++;\n }",
"{\n if (t.charAt(j) != s.charAt(i + j)) cnt++;\n }",
"if (t.charAt(j) != s.charAt(i + j)) cnt++;",
"t.charAt(j) != s.charAt(i + j)",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"s.charAt(i + j)",
"s.charAt",
"s",
"i + j",
"i",
"j",
"cnt++",
"cnt",
"min = Math.min(cnt, min)",
"min",
"Math.min(cnt, min)",
"Math.min",
"Math",
"cnt",
"min",
"cnt = 0",
"cnt",
"0",
"out.println(min)",
"out.println",
"out",
"min",
"int testNumber",
"testNumber",
"FastReader in",
"in",
"PrintWriter out",
"out",
"static class FastReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private FastReader.SpaceCharFilter filter;\n\n public FastReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) return -1;\n }\n return buf[curChar++];\n }\n\n public String next() {\n int c = read();\n while (isSpaceChar(c)) c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }",
"FastReader",
"private InputStream stream;",
"stream",
"private byte[] buf = new byte[1024];",
"buf",
"new byte[1024]",
"1024",
"private int curChar;",
"curChar",
"private int numChars;",
"numChars",
"private FastReader.SpaceCharFilter filter;",
"filter",
"public FastReader(InputStream stream) {\n this.stream = stream;\n }",
"FastReader",
"{\n this.stream = stream;\n }",
"this.stream = stream",
"this.stream",
"this",
"this.stream",
"stream",
"InputStream stream",
"stream",
"public int read() {\n if (numChars == -1) throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) return -1;\n }\n return buf[curChar++];\n }",
"read",
"{\n if (numChars == -1) throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) return -1;\n }\n return buf[curChar++];\n }",
"if (numChars == -1) throw new InputMismatchException();",
"numChars == -1",
"numChars",
"-1",
"1",
"throw new InputMismatchException();",
"new InputMismatchException()",
"if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) return -1;\n }",
"curChar >= numChars",
"curChar",
"numChars",
"{\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) return -1;\n }",
"curChar = 0",
"curChar",
"0",
"try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }",
"catch (IOException e) {\n throw new InputMismatchException();\n }",
"IOException e",
"{\n throw new InputMismatchException();\n }",
"throw new InputMismatchException();",
"new InputMismatchException()",
"{\n numChars = stream.read(buf);\n }",
"numChars = stream.read(buf)",
"numChars",
"stream.read(buf)",
"stream.read",
"stream",
"buf",
"if (numChars <= 0) return -1;",
"numChars <= 0",
"numChars",
"0",
"return -1;",
"-1",
"1",
"return buf[curChar++];",
"buf[curChar++]",
"buf",
"curChar++",
"curChar",
"public String next() {\n int c = read();\n while (isSpaceChar(c)) c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n return res.toString();\n }",
"next",
"{\n int c = read();\n while (isSpaceChar(c)) c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n return res.toString();\n }",
"int c = read();",
"c",
"read()",
"read",
"while (isSpaceChar(c)) c = read();",
"isSpaceChar(c)",
"isSpaceChar",
"c",
"c = read()",
"c",
"read()",
"read",
"StringBuilder res = new StringBuilder();",
"res",
"new StringBuilder()",
"do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));",
"!isSpaceChar(c)",
"isSpaceChar(c)",
"isSpaceChar",
"c",
"{\n res.appendCodePoint(c);\n c = read();\n }",
"res.appendCodePoint(c)",
"res.appendCodePoint",
"res",
"c",
"c = read()",
"c",
"read()",
"read",
"return res.toString();",
"res.toString()",
"res.toString",
"res",
"public boolean isSpaceChar(int c) {\n if (filter != null) return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }",
"isSpaceChar",
"{\n if (filter != null) return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }",
"if (filter != null) return filter.isSpaceChar(c);",
"filter != null",
"filter",
"null",
"return filter.isSpaceChar(c);",
"filter.isSpaceChar(c)",
"filter.isSpaceChar",
"filter",
"c",
"return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;",
"c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1",
"c == '\\t'",
"c == '\\r'",
"c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1",
"c == ' '",
"c",
"' '",
"c == '\\n'",
"c",
"'\\n'",
"c == '\\r'",
"c",
"'\\r'",
"c == '\\t'",
"c",
"'\\t'",
"c == -1",
"c",
"-1",
"1",
"int c",
"c",
"public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }",
"SpaceCharFilter",
"public boolean isSpaceChar(int ch);",
"isSpaceChar",
"int ch",
"ch",
"public class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastReader in = new FastReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n B solver = new B();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class B {\n public void solve(int testNumber, FastReader in, PrintWriter out) {\n String s = in.next(), t = in.next();\n int cnt = 0, min = Integer.MAX_VALUE;\n for (int i = 0; i < s.length() - t.length() + 1; ++i) {\n for (int j = 0; j < t.length(); ++j) {\n if (t.charAt(j) != s.charAt(i + j)) cnt++;\n }\n min = Math.min(cnt, min);\n cnt = 0;\n }\n out.println(min);\n }\n\n }\n\n static class FastReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private FastReader.SpaceCharFilter filter;\n\n public FastReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) return -1;\n }\n return buf[curChar++];\n }\n\n public String next() {\n int c = read();\n while (isSpaceChar(c)) c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}",
"public class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastReader in = new FastReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n B solver = new B();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class B {\n public void solve(int testNumber, FastReader in, PrintWriter out) {\n String s = in.next(), t = in.next();\n int cnt = 0, min = Integer.MAX_VALUE;\n for (int i = 0; i < s.length() - t.length() + 1; ++i) {\n for (int j = 0; j < t.length(); ++j) {\n if (t.charAt(j) != s.charAt(i + j)) cnt++;\n }\n min = Math.min(cnt, min);\n cnt = 0;\n }\n out.println(min);\n }\n\n }\n\n static class FastReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private FastReader.SpaceCharFilter filter;\n\n public FastReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) return -1;\n }\n return buf[curChar++];\n }\n\n public String next() {\n int c = read();\n while (isSpaceChar(c)) c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}",
"Main"
]
| import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Pranay2516
*/
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
FastReader in = new FastReader(inputStream);
PrintWriter out = new PrintWriter(outputStream);
B solver = new B();
solver.solve(1, in, out);
out.close();
}
static class B {
public void solve(int testNumber, FastReader in, PrintWriter out) {
String s = in.next(), t = in.next();
int cnt = 0, min = Integer.MAX_VALUE;
for (int i = 0; i < s.length() - t.length() + 1; ++i) {
for (int j = 0; j < t.length(); ++j) {
if (t.charAt(j) != s.charAt(i + j)) cnt++;
}
min = Math.min(cnt, min);
cnt = 0;
}
out.println(min);
}
}
static class FastReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private FastReader.SpaceCharFilter filter;
public FastReader(InputStream stream) {
this.stream = stream;
}
public int read() {
if (numChars == -1) throw new InputMismatchException();
if (curChar >= numChars) {
curChar = 0;
try {
numChars = stream.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (numChars <= 0) return -1;
}
return buf[curChar++];
}
public String next() {
int c = read();
while (isSpaceChar(c)) c = read();
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
}
while (!isSpaceChar(c));
return res.toString();
}
public boolean isSpaceChar(int c) {
if (filter != null) return filter.isSpaceChar(c);
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public interface SpaceCharFilter {
public boolean isSpaceChar(int ch);
}
}
}
|
[
7,
15,
13,
17,
6,
13,
41,
13,
20,
12,
13,
30,
41,
13,
4,
18,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
2,
18,
13,
13,
18,
13,
13,
17,
1,
40,
13,
30,
30,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
2,
13,
13,
18,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
99,
5
],
[
99,
6
],
[
6,
7
],
[
6,
8
],
[
99,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
16,
17
],
[
17,
18
],
[
11,
19
],
[
19,
20
],
[
19,
21
],
[
21,
22
],
[
22,
23
],
[
23,
24
],
[
24,
25
],
[
11,
26
],
[
26,
27
],
[
26,
28
],
[
11,
29
],
[
29,
30
],
[
30,
31
],
[
31,
32
],
[
31,
33
],
[
29,
34
],
[
34,
35
],
[
34,
36
],
[
36,
37
],
[
37,
38
],
[
38,
39
],
[
38,
40
],
[
37,
41
],
[
41,
42
],
[
41,
43
],
[
36,
44
],
[
29,
45
],
[
45,
46
],
[
46,
47
],
[
29,
48
],
[
49,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
52,
53
],
[
52,
54
],
[
49,
55
],
[
55,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
55,
60
],
[
60,
61
],
[
60,
62
],
[
62,
63
],
[
62,
64
],
[
55,
65
],
[
65,
66
],
[
66,
67
],
[
55,
68
],
[
69,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
74,
75
],
[
74,
76
],
[
71,
77
],
[
77,
78
],
[
77,
79
],
[
70,
80
],
[
80,
81
],
[
81,
82
],
[
49,
83
],
[
83,
84
],
[
83,
85
],
[
85,
86
],
[
86,
87
],
[
85,
88
],
[
85,
89
],
[
11,
90
],
[
90,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
90,
95
],
[
9,
96
],
[
96,
97
],
[
0,
98
],
[
98,
99
],
[
98,
100
]
]
| [
"import java.util.*;\npublic class Main {\n private static Scanner sc = new Scanner(System.in);\n public static void main(String[] args){\n char[] S = sc.next().toCharArray();\n char[] T = sc.next().toCharArray();\n\n int res=1000;\n\n for(int i=0; i<S.length-T.length+1; i++){\n int count=T.length;\n for(int j=0; j<T.length; j++){\n if(S[i+j]==T[j]){\n count--;\n }\n }\n res = Math.min(res,count);\n }\n \n System.out.println(res);\n}\n\n}\n",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n private static Scanner sc = new Scanner(System.in);\n public static void main(String[] args){\n char[] S = sc.next().toCharArray();\n char[] T = sc.next().toCharArray();\n\n int res=1000;\n\n for(int i=0; i<S.length-T.length+1; i++){\n int count=T.length;\n for(int j=0; j<T.length; j++){\n if(S[i+j]==T[j]){\n count--;\n }\n }\n res = Math.min(res,count);\n }\n \n System.out.println(res);\n}\n\n}",
"Main",
"private static Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"public static void main(String[] args){\n char[] S = sc.next().toCharArray();\n char[] T = sc.next().toCharArray();\n\n int res=1000;\n\n for(int i=0; i<S.length-T.length+1; i++){\n int count=T.length;\n for(int j=0; j<T.length; j++){\n if(S[i+j]==T[j]){\n count--;\n }\n }\n res = Math.min(res,count);\n }\n \n System.out.println(res);\n}",
"main",
"{\n char[] S = sc.next().toCharArray();\n char[] T = sc.next().toCharArray();\n\n int res=1000;\n\n for(int i=0; i<S.length-T.length+1; i++){\n int count=T.length;\n for(int j=0; j<T.length; j++){\n if(S[i+j]==T[j]){\n count--;\n }\n }\n res = Math.min(res,count);\n }\n \n System.out.println(res);\n}",
"char[] S = sc.next().toCharArray();",
"S",
"sc.next().toCharArray()",
"sc.next().toCharArray",
"sc.next()",
"sc.next",
"sc",
"char[] T = sc.next().toCharArray();",
"T",
"sc.next().toCharArray()",
"sc.next().toCharArray",
"sc.next()",
"sc.next",
"sc",
"int res=1000;",
"res",
"1000",
"for(int i=0; i<S.length-T.length+1; i++){\n int count=T.length;\n for(int j=0; j<T.length; j++){\n if(S[i+j]==T[j]){\n count--;\n }\n }\n res = Math.min(res,count);\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<S.length-T.length+1",
"i",
"S.length-T.length+1",
"S.length-T.length",
"S.length",
"S",
"S.length",
"T.length",
"T",
"T.length",
"1",
"i++",
"i++",
"i",
"{\n int count=T.length;\n for(int j=0; j<T.length; j++){\n if(S[i+j]==T[j]){\n count--;\n }\n }\n res = Math.min(res,count);\n }",
"{\n int count=T.length;\n for(int j=0; j<T.length; j++){\n if(S[i+j]==T[j]){\n count--;\n }\n }\n res = Math.min(res,count);\n }",
"int count=T.length;",
"count",
"T.length",
"T",
"T.length",
"for(int j=0; j<T.length; j++){\n if(S[i+j]==T[j]){\n count--;\n }\n }",
"int j=0;",
"int j=0;",
"j",
"0",
"j<T.length",
"j",
"T.length",
"T",
"T.length",
"j++",
"j++",
"j",
"{\n if(S[i+j]==T[j]){\n count--;\n }\n }",
"{\n if(S[i+j]==T[j]){\n count--;\n }\n }",
"if(S[i+j]==T[j]){\n count--;\n }",
"S[i+j]==T[j]",
"S[i+j]",
"S",
"i+j",
"i",
"j",
"T[j]",
"T",
"j",
"{\n count--;\n }",
"count--",
"count",
"res = Math.min(res,count)",
"res",
"Math.min(res,count)",
"Math.min",
"Math",
"res",
"count",
"System.out.println(res)",
"System.out.println",
"System.out",
"System",
"System.out",
"res",
"String[] args",
"args",
"public class Main {\n private static Scanner sc = new Scanner(System.in);\n public static void main(String[] args){\n char[] S = sc.next().toCharArray();\n char[] T = sc.next().toCharArray();\n\n int res=1000;\n\n for(int i=0; i<S.length-T.length+1; i++){\n int count=T.length;\n for(int j=0; j<T.length; j++){\n if(S[i+j]==T[j]){\n count--;\n }\n }\n res = Math.min(res,count);\n }\n \n System.out.println(res);\n}\n\n}",
"public class Main {\n private static Scanner sc = new Scanner(System.in);\n public static void main(String[] args){\n char[] S = sc.next().toCharArray();\n char[] T = sc.next().toCharArray();\n\n int res=1000;\n\n for(int i=0; i<S.length-T.length+1; i++){\n int count=T.length;\n for(int j=0; j<T.length; j++){\n if(S[i+j]==T[j]){\n count--;\n }\n }\n res = Math.min(res,count);\n }\n \n System.out.println(res);\n}\n\n}",
"Main"
]
| import java.util.*;
public class Main {
private static Scanner sc = new Scanner(System.in);
public static void main(String[] args){
char[] S = sc.next().toCharArray();
char[] T = sc.next().toCharArray();
int res=1000;
for(int i=0; i<S.length-T.length+1; i++){
int count=T.length;
for(int j=0; j<T.length; j++){
if(S[i+j]==T[j]){
count--;
}
}
res = Math.min(res,count);
}
System.out.println(res);
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
20,
41,
13,
20,
41,
13,
20,
12,
13,
30,
14,
40,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
4,
13,
41,
13,
4,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
12,
13,
30,
4,
18,
20,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
144,
11
],
[
144,
12
],
[
12,
13
],
[
12,
14
],
[
144,
15
],
[
15,
16
],
[
15,
17
],
[
144,
18
],
[
18,
19
],
[
18,
20
],
[
144,
21
],
[
21,
22
],
[
21,
23
],
[
23,
24
],
[
24,
25
],
[
25,
26
],
[
26,
27
],
[
27,
28
],
[
24,
29
],
[
29,
30
],
[
30,
31
],
[
30,
32
],
[
23,
33
],
[
33,
34
],
[
34,
35
],
[
35,
36
],
[
144,
37
],
[
37,
38
],
[
37,
39
],
[
39,
40
],
[
40,
41
],
[
41,
42
],
[
42,
43
],
[
41,
44
],
[
44,
45
],
[
144,
46
],
[
46,
47
],
[
46,
48
],
[
48,
49
],
[
49,
50
],
[
50,
51
],
[
51,
52
],
[
50,
53
],
[
53,
54
],
[
144,
55
],
[
55,
56
],
[
55,
57
],
[
57,
58
],
[
58,
59
],
[
58,
60
],
[
60,
61
],
[
57,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
57,
66
],
[
66,
67
],
[
66,
68
],
[
68,
69
],
[
68,
70
],
[
57,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
73,
75
],
[
71,
76
],
[
76,
77
],
[
76,
78
],
[
78,
79
],
[
79,
80
],
[
80,
81
],
[
78,
82
],
[
82,
83
],
[
83,
84
],
[
71,
85
],
[
85,
86
],
[
86,
87
],
[
71,
88
],
[
89,
89
],
[
89,
90
],
[
90,
91
],
[
90,
92
],
[
89,
93
],
[
93,
94
],
[
94,
95
],
[
95,
96
],
[
95,
97
],
[
93,
98
],
[
98,
99
],
[
98,
100
],
[
100,
101
],
[
101,
102
],
[
93,
103
],
[
103,
104
],
[
104,
105
],
[
93,
106
],
[
107,
107
],
[
107,
108
],
[
108,
109
],
[
109,
110
],
[
110,
111
],
[
111,
112
],
[
110,
113
],
[
113,
114
],
[
113,
115
],
[
109,
116
],
[
116,
117
],
[
117,
118
],
[
116,
119
],
[
108,
120
],
[
120,
121
],
[
89,
122
],
[
122,
123
],
[
122,
124
],
[
124,
125
],
[
125,
126
],
[
124,
127
],
[
124,
128
],
[
57,
129
],
[
129,
130
],
[
130,
131
],
[
131,
132
],
[
131,
133
],
[
129,
134
],
[
144,
135
],
[
135,
136
],
[
135,
137
],
[
137,
138
],
[
138,
139
],
[
139,
140
],
[
135,
141
],
[
141,
142
],
[
0,
143
],
[
143,
144
],
[
143,
145
]
]
| [
"import java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\npublic class Main\n{\n\tPrintWriter out = new PrintWriter(System.out);\n\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer tok = new StringTokenizer(\"\");\n String next() throws IOException {\n if (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine()); }\n return tok.nextToken();\n }\n int ni() throws IOException { return Integer.parseInt(next()); }\n long nl() throws IOException { return Long.parseLong(next()); }\n \n void solve() throws IOException {\n String s=next();\n String t=next();\n int ans=Integer.MAX_VALUE;\n for (int i=0;i<=s.length()-t.length();i++) {\n int na=0;\n for (int j=0;j<t.length();j++) {\n if (s.charAt(i+j)!=t.charAt(j)) na++;\n }\n //System.out.println(i+\" \"+na);\n ans=Math.min(ans,na);\n }\n //out.flush();\n System.out.println(ans);\n }\n \n public static void main(String[] args) throws IOException {\n new Main().solve();\n }\n}",
"import java.util.*;",
"util.*",
"java",
"import java.lang.*;",
"lang.*",
"java",
"import java.io.*;",
"io.*",
"java",
"public class Main\n{\n\tPrintWriter out = new PrintWriter(System.out);\n\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer tok = new StringTokenizer(\"\");\n String next() throws IOException {\n if (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine()); }\n return tok.nextToken();\n }\n int ni() throws IOException { return Integer.parseInt(next()); }\n long nl() throws IOException { return Long.parseLong(next()); }\n \n void solve() throws IOException {\n String s=next();\n String t=next();\n int ans=Integer.MAX_VALUE;\n for (int i=0;i<=s.length()-t.length();i++) {\n int na=0;\n for (int j=0;j<t.length();j++) {\n if (s.charAt(i+j)!=t.charAt(j)) na++;\n }\n //System.out.println(i+\" \"+na);\n ans=Math.min(ans,na);\n }\n //out.flush();\n System.out.println(ans);\n }\n \n public static void main(String[] args) throws IOException {\n new Main().solve();\n }\n}",
"Main",
"PrintWriter out = new PrintWriter(System.out);",
"out",
"new PrintWriter(System.out)",
"BufferedReader in = new BufferedReader(new InputStreamReader(System.in));",
"in",
"new BufferedReader(new InputStreamReader(System.in))",
"StringTokenizer tok = new StringTokenizer(\"\");",
"tok",
"new StringTokenizer(\"\")",
"String next() throws IOException {\n if (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine()); }\n return tok.nextToken();\n }",
"next",
"{\n if (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine()); }\n return tok.nextToken();\n }",
"if (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine()); }",
"!tok.hasMoreTokens()",
"tok.hasMoreTokens()",
"tok.hasMoreTokens",
"tok",
"{ tok = new StringTokenizer(in.readLine()); }",
"tok = new StringTokenizer(in.readLine())",
"tok",
"new StringTokenizer(in.readLine())",
"return tok.nextToken();",
"tok.nextToken()",
"tok.nextToken",
"tok",
"int ni() throws IOException { return Integer.parseInt(next()); }",
"ni",
"{ return Integer.parseInt(next()); }",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"long nl() throws IOException { return Long.parseLong(next()); }",
"nl",
"{ return Long.parseLong(next()); }",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"void solve() throws IOException {\n String s=next();\n String t=next();\n int ans=Integer.MAX_VALUE;\n for (int i=0;i<=s.length()-t.length();i++) {\n int na=0;\n for (int j=0;j<t.length();j++) {\n if (s.charAt(i+j)!=t.charAt(j)) na++;\n }\n //System.out.println(i+\" \"+na);\n ans=Math.min(ans,na);\n }\n //out.flush();\n System.out.println(ans);\n }",
"solve",
"{\n String s=next();\n String t=next();\n int ans=Integer.MAX_VALUE;\n for (int i=0;i<=s.length()-t.length();i++) {\n int na=0;\n for (int j=0;j<t.length();j++) {\n if (s.charAt(i+j)!=t.charAt(j)) na++;\n }\n //System.out.println(i+\" \"+na);\n ans=Math.min(ans,na);\n }\n //out.flush();\n System.out.println(ans);\n }",
"String s=next();",
"s",
"next()",
"next",
"String t=next();",
"t",
"next()",
"next",
"int ans=Integer.MAX_VALUE;",
"ans",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"for (int i=0;i<=s.length()-t.length();i++) {\n int na=0;\n for (int j=0;j<t.length();j++) {\n if (s.charAt(i+j)!=t.charAt(j)) na++;\n }\n //System.out.println(i+\" \"+na);\n ans=Math.min(ans,na);\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<=s.length()-t.length()",
"i",
"s.length()-t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"i++",
"i++",
"i",
"{\n int na=0;\n for (int j=0;j<t.length();j++) {\n if (s.charAt(i+j)!=t.charAt(j)) na++;\n }\n //System.out.println(i+\" \"+na);\n ans=Math.min(ans,na);\n }",
"{\n int na=0;\n for (int j=0;j<t.length();j++) {\n if (s.charAt(i+j)!=t.charAt(j)) na++;\n }\n //System.out.println(i+\" \"+na);\n ans=Math.min(ans,na);\n }",
"int na=0;",
"na",
"0",
"for (int j=0;j<t.length();j++) {\n if (s.charAt(i+j)!=t.charAt(j)) na++;\n }",
"int j=0;",
"int j=0;",
"j",
"0",
"j<t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n if (s.charAt(i+j)!=t.charAt(j)) na++;\n }",
"{\n if (s.charAt(i+j)!=t.charAt(j)) na++;\n }",
"if (s.charAt(i+j)!=t.charAt(j)) na++;",
"s.charAt(i+j)!=t.charAt(j)",
"s.charAt(i+j)",
"s.charAt",
"s",
"i+j",
"i",
"j",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"na++",
"na",
"ans=Math.min(ans,na)",
"ans",
"Math.min(ans,na)",
"Math.min",
"Math",
"ans",
"na",
"System.out.println(ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"ans",
"public static void main(String[] args) throws IOException {\n new Main().solve();\n }",
"main",
"{\n new Main().solve();\n }",
"new Main().solve()",
"new Main().solve",
"new Main()",
"String[] args",
"args",
"public class Main\n{\n\tPrintWriter out = new PrintWriter(System.out);\n\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer tok = new StringTokenizer(\"\");\n String next() throws IOException {\n if (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine()); }\n return tok.nextToken();\n }\n int ni() throws IOException { return Integer.parseInt(next()); }\n long nl() throws IOException { return Long.parseLong(next()); }\n \n void solve() throws IOException {\n String s=next();\n String t=next();\n int ans=Integer.MAX_VALUE;\n for (int i=0;i<=s.length()-t.length();i++) {\n int na=0;\n for (int j=0;j<t.length();j++) {\n if (s.charAt(i+j)!=t.charAt(j)) na++;\n }\n //System.out.println(i+\" \"+na);\n ans=Math.min(ans,na);\n }\n //out.flush();\n System.out.println(ans);\n }\n \n public static void main(String[] args) throws IOException {\n new Main().solve();\n }\n}",
"public class Main\n{\n\tPrintWriter out = new PrintWriter(System.out);\n\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer tok = new StringTokenizer(\"\");\n String next() throws IOException {\n if (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine()); }\n return tok.nextToken();\n }\n int ni() throws IOException { return Integer.parseInt(next()); }\n long nl() throws IOException { return Long.parseLong(next()); }\n \n void solve() throws IOException {\n String s=next();\n String t=next();\n int ans=Integer.MAX_VALUE;\n for (int i=0;i<=s.length()-t.length();i++) {\n int na=0;\n for (int j=0;j<t.length();j++) {\n if (s.charAt(i+j)!=t.charAt(j)) na++;\n }\n //System.out.println(i+\" \"+na);\n ans=Math.min(ans,na);\n }\n //out.flush();\n System.out.println(ans);\n }\n \n public static void main(String[] args) throws IOException {\n new Main().solve();\n }\n}",
"Main"
]
| import java.util.*;
import java.lang.*;
import java.io.*;
public class Main
{
PrintWriter out = new PrintWriter(System.out);
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer tok = new StringTokenizer("");
String next() throws IOException {
if (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine()); }
return tok.nextToken();
}
int ni() throws IOException { return Integer.parseInt(next()); }
long nl() throws IOException { return Long.parseLong(next()); }
void solve() throws IOException {
String s=next();
String t=next();
int ans=Integer.MAX_VALUE;
for (int i=0;i<=s.length()-t.length();i++) {
int na=0;
for (int j=0;j<t.length();j++) {
if (s.charAt(i+j)!=t.charAt(j)) na++;
}
//System.out.println(i+" "+na);
ans=Math.min(ans,na);
}
//out.flush();
System.out.println(ans);
}
public static void main(String[] args) throws IOException {
new Main().solve();
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
18,
13,
13,
41,
13,
18,
13,
13,
41,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
13,
18,
13,
2,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
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
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
25,
26
],
[
8,
27
],
[
27,
28
],
[
27,
29
],
[
29,
30
],
[
30,
31
],
[
8,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
34,
36
],
[
8,
37
],
[
37,
38
],
[
37,
39
],
[
39,
40
],
[
39,
41
],
[
8,
42
],
[
42,
43
],
[
42,
44
],
[
8,
45
],
[
45,
46
],
[
46,
47
],
[
47,
48
],
[
47,
49
],
[
45,
50
],
[
50,
51
],
[
50,
52
],
[
52,
53
],
[
52,
54
],
[
45,
55
],
[
55,
56
],
[
56,
57
],
[
45,
58
],
[
59,
59
],
[
59,
60
],
[
60,
61
],
[
60,
62
],
[
59,
63
],
[
63,
64
],
[
64,
65
],
[
65,
66
],
[
65,
67
],
[
63,
68
],
[
68,
69
],
[
68,
70
],
[
63,
71
],
[
71,
72
],
[
72,
73
],
[
63,
74
],
[
75,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
78,
79
],
[
78,
80
],
[
77,
81
],
[
81,
82
],
[
81,
83
],
[
83,
84
],
[
83,
85
],
[
76,
86
],
[
86,
87
],
[
87,
88
],
[
59,
89
],
[
89,
90
],
[
89,
91
],
[
91,
92
],
[
92,
93
],
[
91,
94
],
[
91,
95
],
[
8,
96
],
[
96,
97
],
[
97,
98
],
[
98,
99
],
[
98,
100
],
[
96,
101
],
[
6,
102
],
[
102,
103
],
[
0,
104
],
[
104,
105
],
[
104,
106
]
]
| [
"import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\t\tchar[] s = S.toCharArray();\n\t\tchar[] t = T.toCharArray();\n\t\tint slen = s.length;\n\t\tint tlen = t.length;\n\t\t\n\t\t//答えansを仮置きする。\n\t\t//これが十分に大きくないと不正解となるので、\n\t\t//この値なら絶対に正しい答えが出る、という値を仮置きすること\n\t\tint ans = tlen;\n\t\t\n\t\tfor(int start = 0; start <= slen-tlen; start++){\n\t\t\tint diff = 0;\n\t\t\tfor(int i = 0; i < tlen; i++){\n\t\t\t\tif(t[i] != s[start+i]){\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans, diff);\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t}\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\t\tchar[] s = S.toCharArray();\n\t\tchar[] t = T.toCharArray();\n\t\tint slen = s.length;\n\t\tint tlen = t.length;\n\t\t\n\t\t//答えansを仮置きする。\n\t\t//これが十分に大きくないと不正解となるので、\n\t\t//この値なら絶対に正しい答えが出る、という値を仮置きすること\n\t\tint ans = tlen;\n\t\t\n\t\tfor(int start = 0; start <= slen-tlen; start++){\n\t\t\tint diff = 0;\n\t\t\tfor(int i = 0; i < tlen; i++){\n\t\t\t\tif(t[i] != s[start+i]){\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans, diff);\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t}\n}",
"Main",
"public static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\t\tchar[] s = S.toCharArray();\n\t\tchar[] t = T.toCharArray();\n\t\tint slen = s.length;\n\t\tint tlen = t.length;\n\t\t\n\t\t//答えansを仮置きする。\n\t\t//これが十分に大きくないと不正解となるので、\n\t\t//この値なら絶対に正しい答えが出る、という値を仮置きすること\n\t\tint ans = tlen;\n\t\t\n\t\tfor(int start = 0; start <= slen-tlen; start++){\n\t\t\tint diff = 0;\n\t\t\tfor(int i = 0; i < tlen; i++){\n\t\t\t\tif(t[i] != s[start+i]){\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans, diff);\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\t\tchar[] s = S.toCharArray();\n\t\tchar[] t = T.toCharArray();\n\t\tint slen = s.length;\n\t\tint tlen = t.length;\n\t\t\n\t\t//答えansを仮置きする。\n\t\t//これが十分に大きくないと不正解となるので、\n\t\t//この値なら絶対に正しい答えが出る、という値を仮置きすること\n\t\tint ans = tlen;\n\t\t\n\t\tfor(int start = 0; start <= slen-tlen; start++){\n\t\t\tint diff = 0;\n\t\t\tfor(int i = 0; i < tlen; i++){\n\t\t\t\tif(t[i] != s[start+i]){\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans, diff);\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String S = sc.next();",
"S",
"sc.next()",
"sc.next",
"sc",
"String T = sc.next();",
"T",
"sc.next()",
"sc.next",
"sc",
"char[] s = S.toCharArray();",
"s",
"S.toCharArray()",
"S.toCharArray",
"S",
"char[] t = T.toCharArray();",
"t",
"T.toCharArray()",
"T.toCharArray",
"T",
"int slen = s.length;",
"slen",
"s.length",
"s",
"s.length",
"int tlen = t.length;",
"tlen",
"t.length",
"t",
"t.length",
"int ans = tlen;",
"ans",
"tlen",
"for(int start = 0; start <= slen-tlen; start++){\n\t\t\tint diff = 0;\n\t\t\tfor(int i = 0; i < tlen; i++){\n\t\t\t\tif(t[i] != s[start+i]){\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans, diff);\n\t\t}",
"int start = 0;",
"int start = 0;",
"start",
"0",
"start <= slen-tlen",
"start",
"slen-tlen",
"slen",
"tlen",
"start++",
"start++",
"start",
"{\n\t\t\tint diff = 0;\n\t\t\tfor(int i = 0; i < tlen; i++){\n\t\t\t\tif(t[i] != s[start+i]){\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans, diff);\n\t\t}",
"{\n\t\t\tint diff = 0;\n\t\t\tfor(int i = 0; i < tlen; i++){\n\t\t\t\tif(t[i] != s[start+i]){\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans, diff);\n\t\t}",
"int diff = 0;",
"diff",
"0",
"for(int i = 0; i < tlen; i++){\n\t\t\t\tif(t[i] != s[start+i]){\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < tlen",
"i",
"tlen",
"i++",
"i++",
"i",
"{\n\t\t\t\tif(t[i] != s[start+i]){\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif(t[i] != s[start+i]){\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}",
"if(t[i] != s[start+i]){\n\t\t\t\t\tdiff++;\n\t\t\t\t}",
"t[i] != s[start+i]",
"t[i]",
"t",
"i",
"s[start+i]",
"s",
"start+i",
"start",
"i",
"{\n\t\t\t\t\tdiff++;\n\t\t\t\t}",
"diff++",
"diff",
"ans = Math.min(ans, diff)",
"ans",
"Math.min(ans, diff)",
"Math.min",
"Math",
"ans",
"diff",
"System.out.println(ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"ans",
"String[] args",
"args",
"public class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\t\tchar[] s = S.toCharArray();\n\t\tchar[] t = T.toCharArray();\n\t\tint slen = s.length;\n\t\tint tlen = t.length;\n\t\t\n\t\t//答えansを仮置きする。\n\t\t//これが十分に大きくないと不正解となるので、\n\t\t//この値なら絶対に正しい答えが出る、という値を仮置きすること\n\t\tint ans = tlen;\n\t\t\n\t\tfor(int start = 0; start <= slen-tlen; start++){\n\t\t\tint diff = 0;\n\t\t\tfor(int i = 0; i < tlen; i++){\n\t\t\t\tif(t[i] != s[start+i]){\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans, diff);\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t}\n}",
"public class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tString T = sc.next();\n\t\tchar[] s = S.toCharArray();\n\t\tchar[] t = T.toCharArray();\n\t\tint slen = s.length;\n\t\tint tlen = t.length;\n\t\t\n\t\t//答えansを仮置きする。\n\t\t//これが十分に大きくないと不正解となるので、\n\t\t//この値なら絶対に正しい答えが出る、という値を仮置きすること\n\t\tint ans = tlen;\n\t\t\n\t\tfor(int start = 0; start <= slen-tlen; start++){\n\t\t\tint diff = 0;\n\t\t\tfor(int i = 0; i < tlen; i++){\n\t\t\t\tif(t[i] != s[start+i]){\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = Math.min(ans, diff);\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t}\n}",
"Main"
]
| import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
String S = sc.next();
String T = sc.next();
char[] s = S.toCharArray();
char[] t = T.toCharArray();
int slen = s.length;
int tlen = t.length;
//答えansを仮置きする。
//これが十分に大きくないと不正解となるので、
//この値なら絶対に正しい答えが出る、という値を仮置きすること
int ans = tlen;
for(int start = 0; start <= slen-tlen; start++){
int diff = 0;
for(int i = 0; i < tlen; i++){
if(t[i] != s[start+i]){
diff++;
}
}
ans = Math.min(ans, diff);
}
System.out.println(ans);
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
41,
13,
18,
13,
13,
41,
13,
11,
1,
41,
13,
17,
2,
13,
2,
18,
13,
13,
18,
13,
13,
1,
40,
13,
30,
30,
0,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
2,
13,
13,
18,
13,
13,
30,
40,
13,
14,
2,
13,
13,
30,
0,
13,
13,
4,
18,
18,
13,
13,
13,
4,
18,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
103,
5
],
[
103,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
16,
17
],
[
17,
18
],
[
8,
19
],
[
19,
20
],
[
19,
21
],
[
21,
22
],
[
22,
23
],
[
23,
24
],
[
24,
25
],
[
8,
26
],
[
26,
27
],
[
26,
28
],
[
28,
29
],
[
28,
30
],
[
8,
31
],
[
31,
32
],
[
8,
33
],
[
33,
34
],
[
34,
35
],
[
35,
36
],
[
35,
37
],
[
33,
38
],
[
38,
39
],
[
38,
40
],
[
40,
41
],
[
41,
42
],
[
41,
43
],
[
40,
44
],
[
44,
45
],
[
44,
46
],
[
33,
47
],
[
47,
48
],
[
48,
49
],
[
33,
50
],
[
51,
51
],
[
51,
52
],
[
52,
53
],
[
52,
54
],
[
51,
55
],
[
55,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
55,
60
],
[
60,
61
],
[
60,
62
],
[
62,
63
],
[
62,
64
],
[
55,
65
],
[
65,
66
],
[
66,
67
],
[
55,
68
],
[
69,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
72,
74
],
[
74,
75
],
[
74,
76
],
[
71,
77
],
[
77,
78
],
[
77,
79
],
[
70,
80
],
[
80,
81
],
[
81,
82
],
[
51,
83
],
[
83,
84
],
[
84,
85
],
[
84,
86
],
[
83,
87
],
[
87,
88
],
[
88,
89
],
[
88,
90
],
[
8,
91
],
[
91,
92
],
[
92,
93
],
[
93,
94
],
[
93,
95
],
[
91,
96
],
[
8,
97
],
[
97,
98
],
[
98,
99
],
[
6,
100
],
[
100,
101
],
[
0,
102
],
[
102,
103
],
[
102,
104
]
]
| [
"import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\t\n\t\tScanner in = new java.util.Scanner(System.in);\n\t\tchar[] S = in.next().toCharArray();\n\t\tchar[] T = in.next().toCharArray();\n\t\tint min = T.length;\n\t\tint diff;\n\t\tfor(int i=0; i<=S.length-T.length; i++) {\n\t\t\tdiff = 0;\n\t\t\tfor(int j=0; j<T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(min > diff) {\n\t\t\t\tmin = diff;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(min);\n\t\t\n\t\t\n\t\tin.close();\n\t}\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\tpublic static void main(String[] args){\n\t\t\n\t\tScanner in = new java.util.Scanner(System.in);\n\t\tchar[] S = in.next().toCharArray();\n\t\tchar[] T = in.next().toCharArray();\n\t\tint min = T.length;\n\t\tint diff;\n\t\tfor(int i=0; i<=S.length-T.length; i++) {\n\t\t\tdiff = 0;\n\t\t\tfor(int j=0; j<T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(min > diff) {\n\t\t\t\tmin = diff;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(min);\n\t\t\n\t\t\n\t\tin.close();\n\t}\n}",
"Main",
"public static void main(String[] args){\n\t\t\n\t\tScanner in = new java.util.Scanner(System.in);\n\t\tchar[] S = in.next().toCharArray();\n\t\tchar[] T = in.next().toCharArray();\n\t\tint min = T.length;\n\t\tint diff;\n\t\tfor(int i=0; i<=S.length-T.length; i++) {\n\t\t\tdiff = 0;\n\t\t\tfor(int j=0; j<T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(min > diff) {\n\t\t\t\tmin = diff;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(min);\n\t\t\n\t\t\n\t\tin.close();\n\t}",
"main",
"{\n\t\t\n\t\tScanner in = new java.util.Scanner(System.in);\n\t\tchar[] S = in.next().toCharArray();\n\t\tchar[] T = in.next().toCharArray();\n\t\tint min = T.length;\n\t\tint diff;\n\t\tfor(int i=0; i<=S.length-T.length; i++) {\n\t\t\tdiff = 0;\n\t\t\tfor(int j=0; j<T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(min > diff) {\n\t\t\t\tmin = diff;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(min);\n\t\t\n\t\t\n\t\tin.close();\n\t}",
"Scanner in = new java.util.Scanner(System.in);",
"in",
"new java.util.Scanner(System.in)",
"char[] S = in.next().toCharArray();",
"S",
"in.next().toCharArray()",
"in.next().toCharArray",
"in.next()",
"in.next",
"in",
"char[] T = in.next().toCharArray();",
"T",
"in.next().toCharArray()",
"in.next().toCharArray",
"in.next()",
"in.next",
"in",
"int min = T.length;",
"min",
"T.length",
"T",
"T.length",
"int diff;",
"diff",
"for(int i=0; i<=S.length-T.length; i++) {\n\t\t\tdiff = 0;\n\t\t\tfor(int j=0; j<T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(min > diff) {\n\t\t\t\tmin = diff;\n\t\t\t}\n\t\t}",
"int i=0;",
"int i=0;",
"i",
"0",
"i<=S.length-T.length",
"i",
"S.length-T.length",
"S.length",
"S",
"S.length",
"T.length",
"T",
"T.length",
"i++",
"i++",
"i",
"{\n\t\t\tdiff = 0;\n\t\t\tfor(int j=0; j<T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(min > diff) {\n\t\t\t\tmin = diff;\n\t\t\t}\n\t\t}",
"{\n\t\t\tdiff = 0;\n\t\t\tfor(int j=0; j<T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(min > diff) {\n\t\t\t\tmin = diff;\n\t\t\t}\n\t\t}",
"diff = 0",
"diff",
"0",
"for(int j=0; j<T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}",
"int j=0;",
"int j=0;",
"j",
"0",
"j<T.length",
"j",
"T.length",
"T",
"T.length",
"j++",
"j++",
"j",
"{\n\t\t\t\tif(S[i+j] != T[j]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif(S[i+j] != T[j]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}",
"if(S[i+j] != T[j]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}",
"S[i+j] != T[j]",
"S[i+j]",
"S",
"i+j",
"i",
"j",
"T[j]",
"T",
"j",
"{\n\t\t\t\t\tdiff++;\n\t\t\t\t}",
"diff++",
"diff",
"if(min > diff) {\n\t\t\t\tmin = diff;\n\t\t\t}",
"min > diff",
"min",
"diff",
"{\n\t\t\t\tmin = diff;\n\t\t\t}",
"min = diff",
"min",
"diff",
"System.out.println(min)",
"System.out.println",
"System.out",
"System",
"System.out",
"min",
"in.close()",
"in.close",
"in",
"String[] args",
"args",
"public class Main {\n\tpublic static void main(String[] args){\n\t\t\n\t\tScanner in = new java.util.Scanner(System.in);\n\t\tchar[] S = in.next().toCharArray();\n\t\tchar[] T = in.next().toCharArray();\n\t\tint min = T.length;\n\t\tint diff;\n\t\tfor(int i=0; i<=S.length-T.length; i++) {\n\t\t\tdiff = 0;\n\t\t\tfor(int j=0; j<T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(min > diff) {\n\t\t\t\tmin = diff;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(min);\n\t\t\n\t\t\n\t\tin.close();\n\t}\n}",
"public class Main {\n\tpublic static void main(String[] args){\n\t\t\n\t\tScanner in = new java.util.Scanner(System.in);\n\t\tchar[] S = in.next().toCharArray();\n\t\tchar[] T = in.next().toCharArray();\n\t\tint min = T.length;\n\t\tint diff;\n\t\tfor(int i=0; i<=S.length-T.length; i++) {\n\t\t\tdiff = 0;\n\t\t\tfor(int j=0; j<T.length; j++) {\n\t\t\t\tif(S[i+j] != T[j]) {\n\t\t\t\t\tdiff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(min > diff) {\n\t\t\t\tmin = diff;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(min);\n\t\t\n\t\t\n\t\tin.close();\n\t}\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner in = new java.util.Scanner(System.in);
char[] S = in.next().toCharArray();
char[] T = in.next().toCharArray();
int min = T.length;
int diff;
for(int i=0; i<=S.length-T.length; i++) {
diff = 0;
for(int j=0; j<T.length; j++) {
if(S[i+j] != T[j]) {
diff++;
}
}
if(min > diff) {
min = diff;
}
}
System.out.println(min);
in.close();
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
2,
18,
13,
13,
18,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
41,
13,
13,
41,
13,
17,
42,
2,
13,
18,
13,
13,
30,
14,
2,
18,
13,
40,
13,
18,
13,
40,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
97,
8
],
[
97,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
11,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
19,
20
],
[
20,
21
],
[
11,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
25,
26
],
[
26,
27
],
[
27,
28
],
[
11,
29
],
[
29,
30
],
[
29,
31
],
[
31,
32
],
[
31,
33
],
[
11,
34
],
[
34,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
34,
39
],
[
39,
40
],
[
39,
41
],
[
41,
42
],
[
42,
43
],
[
42,
44
],
[
41,
45
],
[
45,
46
],
[
45,
47
],
[
34,
48
],
[
48,
49
],
[
49,
50
],
[
34,
51
],
[
52,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
52,
56
],
[
56,
57
],
[
56,
58
],
[
52,
59
],
[
59,
60
],
[
59,
61
],
[
52,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
65,
66
],
[
65,
67
],
[
62,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
71,
72
],
[
71,
73
],
[
73,
74
],
[
70,
75
],
[
75,
76
],
[
75,
77
],
[
77,
78
],
[
69,
79
],
[
79,
80
],
[
52,
81
],
[
81,
82
],
[
81,
83
],
[
83,
84
],
[
84,
85
],
[
83,
86
],
[
83,
87
],
[
11,
88
],
[
88,
89
],
[
89,
90
],
[
90,
91
],
[
90,
92
],
[
88,
93
],
[
9,
94
],
[
94,
95
],
[
0,
96
],
[
96,
97
],
[
96,
98
]
]
| [
"import java.util.*;\nimport java.lang.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tchar[] s = sc.next().toCharArray();\n\t\tchar[] c = sc.next().toCharArray();\n\t\tint ans = Integer.MAX_VALUE;\n\n\t\tfor(int i = 0;i <= s.length-c.length; ++i) {\n\t\t\tint j = 0, k = i, count = 0;\n\t\t\twhile(j < c.length) {\n\t\t\t\tif(c[j++] != s[k++]) count++;\n\t\t\t}\n\t\t\tans = Math.min(ans,count);\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}",
"import java.util.*;",
"util.*",
"java",
"import java.lang.*;",
"lang.*",
"java",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tchar[] s = sc.next().toCharArray();\n\t\tchar[] c = sc.next().toCharArray();\n\t\tint ans = Integer.MAX_VALUE;\n\n\t\tfor(int i = 0;i <= s.length-c.length; ++i) {\n\t\t\tint j = 0, k = i, count = 0;\n\t\t\twhile(j < c.length) {\n\t\t\t\tif(c[j++] != s[k++]) count++;\n\t\t\t}\n\t\t\tans = Math.min(ans,count);\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tchar[] s = sc.next().toCharArray();\n\t\tchar[] c = sc.next().toCharArray();\n\t\tint ans = Integer.MAX_VALUE;\n\n\t\tfor(int i = 0;i <= s.length-c.length; ++i) {\n\t\t\tint j = 0, k = i, count = 0;\n\t\t\twhile(j < c.length) {\n\t\t\t\tif(c[j++] != s[k++]) count++;\n\t\t\t}\n\t\t\tans = Math.min(ans,count);\n\t\t}\n\t\tSystem.out.println(ans);\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tchar[] s = sc.next().toCharArray();\n\t\tchar[] c = sc.next().toCharArray();\n\t\tint ans = Integer.MAX_VALUE;\n\n\t\tfor(int i = 0;i <= s.length-c.length; ++i) {\n\t\t\tint j = 0, k = i, count = 0;\n\t\t\twhile(j < c.length) {\n\t\t\t\tif(c[j++] != s[k++]) count++;\n\t\t\t}\n\t\t\tans = Math.min(ans,count);\n\t\t}\n\t\tSystem.out.println(ans);\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"char[] s = sc.next().toCharArray();",
"s",
"sc.next().toCharArray()",
"sc.next().toCharArray",
"sc.next()",
"sc.next",
"sc",
"char[] c = sc.next().toCharArray();",
"c",
"sc.next().toCharArray()",
"sc.next().toCharArray",
"sc.next()",
"sc.next",
"sc",
"int ans = Integer.MAX_VALUE;",
"ans",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"for(int i = 0;i <= s.length-c.length; ++i) {\n\t\t\tint j = 0, k = i, count = 0;\n\t\t\twhile(j < c.length) {\n\t\t\t\tif(c[j++] != s[k++]) count++;\n\t\t\t}\n\t\t\tans = Math.min(ans,count);\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= s.length-c.length",
"i",
"s.length-c.length",
"s.length",
"s",
"s.length",
"c.length",
"c",
"c.length",
"++i",
"++i",
"i",
"{\n\t\t\tint j = 0, k = i, count = 0;\n\t\t\twhile(j < c.length) {\n\t\t\t\tif(c[j++] != s[k++]) count++;\n\t\t\t}\n\t\t\tans = Math.min(ans,count);\n\t\t}",
"{\n\t\t\tint j = 0, k = i, count = 0;\n\t\t\twhile(j < c.length) {\n\t\t\t\tif(c[j++] != s[k++]) count++;\n\t\t\t}\n\t\t\tans = Math.min(ans,count);\n\t\t}",
"int j = 0",
"j",
"0",
"k = i",
"k",
"i",
"count = 0;",
"count",
"0",
"while(j < c.length) {\n\t\t\t\tif(c[j++] != s[k++]) count++;\n\t\t\t}",
"j < c.length",
"j",
"c.length",
"c",
"c.length",
"{\n\t\t\t\tif(c[j++] != s[k++]) count++;\n\t\t\t}",
"if(c[j++] != s[k++]) count++;",
"c[j++] != s[k++]",
"c[j++]",
"c",
"j++",
"j",
"s[k++]",
"s",
"k++",
"k",
"count++",
"count",
"ans = Math.min(ans,count)",
"ans",
"Math.min(ans,count)",
"Math.min",
"Math",
"ans",
"count",
"System.out.println(ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"ans",
"String[] args",
"args",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tchar[] s = sc.next().toCharArray();\n\t\tchar[] c = sc.next().toCharArray();\n\t\tint ans = Integer.MAX_VALUE;\n\n\t\tfor(int i = 0;i <= s.length-c.length; ++i) {\n\t\t\tint j = 0, k = i, count = 0;\n\t\t\twhile(j < c.length) {\n\t\t\t\tif(c[j++] != s[k++]) count++;\n\t\t\t}\n\t\t\tans = Math.min(ans,count);\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tchar[] s = sc.next().toCharArray();\n\t\tchar[] c = sc.next().toCharArray();\n\t\tint ans = Integer.MAX_VALUE;\n\n\t\tfor(int i = 0;i <= s.length-c.length; ++i) {\n\t\t\tint j = 0, k = i, count = 0;\n\t\t\twhile(j < c.length) {\n\t\t\t\tif(c[j++] != s[k++]) count++;\n\t\t\t}\n\t\t\tans = Math.min(ans,count);\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}",
"Main"
]
| import java.util.*;
import java.lang.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
char[] s = sc.next().toCharArray();
char[] c = sc.next().toCharArray();
int ans = Integer.MAX_VALUE;
for(int i = 0;i <= s.length-c.length; ++i) {
int j = 0, k = i, count = 0;
while(j < c.length) {
if(c[j++] != s[k++]) count++;
}
ans = Math.min(ans,count);
}
System.out.println(ans);
}
} |
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
41,
13,
41,
13,
2,
17,
17,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
2,
13,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
2,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
13,
13,
12,
13,
30,
4,
18,
20,
23,
13,
12,
13,
30,
0,
13,
20,
0,
13,
20,
4,
13,
4,
18,
13,
4,
18,
13,
4,
18,
13,
6,
13,
41,
13,
12,
13,
30,
4,
13,
18,
13,
13,
12,
13,
30,
0,
18,
36,
13,
20,
23,
13,
12,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
4,
18,
18,
36,
13,
12,
13,
30,
41,
13,
4,
13,
14,
2,
2,
13,
18,
13,
13,
2,
13,
18,
13,
13,
37,
20,
29,
13,
12,
13,
30,
38,
5,
13,
30,
4,
18,
13,
29,
40,
17,
30,
41,
13,
17,
41,
13,
4,
18,
13,
42,
2,
2,
2,
2,
13,
17,
2,
17,
13,
2,
13,
17,
2,
13,
17,
30,
0,
13,
4,
18,
13,
14,
2,
13,
17,
30,
0,
13,
40,
17,
0,
13,
4,
18,
13,
14,
2,
13,
17,
30,
0,
13,
4,
18,
13,
41,
13,
2,
13,
17,
42,
17,
30,
0,
13,
4,
18,
13,
14,
2,
2,
13,
17,
2,
17,
13,
29,
2,
13,
13,
0,
13,
17,
0,
13,
2,
13,
17,
12,
13,
30,
38,
5,
13,
30,
4,
18,
13,
29,
18,
13,
13,
30,
41,
13,
17,
41,
13,
4,
18,
13,
42,
2,
2,
2,
2,
13,
17,
2,
17,
13,
2,
13,
17,
2,
13,
17,
30,
0,
13,
4,
18,
13,
14,
2,
13,
17,
30,
0,
13,
40,
17,
0,
13,
4,
18,
13,
14,
2,
13,
17,
30,
0,
13,
4,
18,
13,
41,
13,
2,
13,
17,
42,
17,
30,
0,
13,
4,
18,
13,
14,
2,
2,
13,
17,
2,
17,
13,
3,
0,
13,
17,
0,
13,
2,
13,
17,
14,
2,
13,
17,
29,
2,
13,
13,
41,
13,
17,
0,
13,
4,
18,
13,
42,
2,
2,
17,
13,
2,
13,
17,
30,
0,
13,
17,
0,
13,
2,
13,
17,
0,
13,
17,
0,
13,
4,
18,
13,
29,
2,
2,
13,
13,
13,
12,
13,
30,
38,
5,
13,
30,
4,
18,
13,
29,
17,
30,
41,
13,
4,
18,
13,
42,
4,
18,
13,
13,
30,
0,
13,
4,
18,
13,
29,
13,
12,
13,
30,
38,
5,
13,
30,
4,
18,
13,
29,
17,
30,
41,
13,
20,
41,
13,
4,
18,
13,
42,
4,
18,
13,
13,
30,
0,
13,
4,
18,
13,
42,
2,
2,
13,
40,
17,
40,
4,
18,
13,
13,
30,
4,
18,
13,
13,
0,
13,
4,
18,
13,
29,
4,
18,
13,
12,
13,
30,
38,
5,
13,
30,
4,
18,
13,
29,
17,
30,
41,
13,
20,
41,
13,
4,
18,
13,
42,
2,
2,
13,
40,
17,
2,
13,
17,
30,
4,
18,
13,
13,
0,
13,
4,
18,
13,
29,
4,
18,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
2,
4,
13,
17,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
2,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
2,
13,
17,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
2,
4,
13,
17,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
2,
13,
17,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
2,
13,
17,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
792,
11
],
[
792,
12
],
[
12,
13
],
[
792,
14
],
[
14,
15
],
[
792,
16
],
[
16,
17
],
[
16,
18
],
[
18,
19
],
[
18,
20
],
[
792,
21
],
[
21,
22
],
[
21,
23
],
[
23,
24
],
[
24,
25
],
[
24,
26
],
[
26,
27
],
[
27,
28
],
[
23,
29
],
[
29,
30
],
[
29,
31
],
[
31,
32
],
[
32,
33
],
[
23,
34
],
[
34,
35
],
[
34,
36
],
[
36,
37
],
[
37,
38
],
[
23,
39
],
[
39,
40
],
[
40,
41
],
[
41,
42
],
[
41,
43
],
[
39,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
47,
48
],
[
48,
49
],
[
44,
50
],
[
50,
51
],
[
51,
52
],
[
39,
53
],
[
53,
54
],
[
54,
55
],
[
39,
56
],
[
57,
57
],
[
57,
58
],
[
58,
59
],
[
58,
60
],
[
57,
61
],
[
61,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
61,
66
],
[
66,
67
],
[
66,
68
],
[
68,
69
],
[
69,
70
],
[
61,
71
],
[
71,
72
],
[
72,
73
],
[
61,
74
],
[
75,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
78,
79
],
[
79,
80
],
[
78,
81
],
[
77,
82
],
[
82,
83
],
[
83,
84
],
[
82,
85
],
[
85,
86
],
[
85,
87
],
[
76,
88
],
[
88,
89
],
[
57,
90
],
[
90,
91
],
[
90,
92
],
[
92,
93
],
[
93,
94
],
[
92,
95
],
[
92,
96
],
[
23,
97
],
[
97,
98
],
[
98,
99
],
[
97,
100
],
[
792,
101
],
[
101,
102
],
[
101,
103
],
[
103,
104
],
[
104,
105
],
[
105,
106
],
[
101,
107
],
[
107,
108
],
[
792,
109
],
[
109,
110
],
[
109,
111
],
[
111,
112
],
[
112,
113
],
[
112,
114
],
[
111,
115
],
[
115,
116
],
[
115,
117
],
[
111,
118
],
[
118,
119
],
[
111,
120
],
[
120,
121
],
[
121,
122
],
[
111,
123
],
[
123,
124
],
[
124,
125
],
[
111,
126
],
[
126,
127
],
[
127,
128
],
[
792,
129
],
[
129,
130
],
[
129,
131
],
[
131,
132
],
[
129,
133
],
[
133,
134
],
[
133,
135
],
[
135,
136
],
[
136,
137
],
[
136,
138
],
[
138,
139
],
[
138,
140
],
[
129,
141
],
[
141,
142
],
[
141,
143
],
[
143,
144
],
[
144,
145
],
[
145,
146
],
[
145,
147
],
[
144,
148
],
[
141,
149
],
[
149,
150
],
[
129,
151
],
[
151,
152
],
[
151,
153
],
[
153,
154
],
[
154,
155
],
[
155,
156
],
[
155,
157
],
[
157,
158
],
[
158,
159
],
[
159,
160
],
[
154,
161
],
[
161,
162
],
[
162,
163
],
[
163,
164
],
[
164,
165
],
[
164,
166
],
[
129,
167
],
[
167,
168
],
[
167,
169
],
[
169,
170
],
[
170,
171
],
[
170,
172
],
[
172,
173
],
[
169,
174
],
[
174,
175
],
[
175,
176
],
[
176,
177
],
[
176,
178
],
[
178,
179
],
[
178,
180
],
[
175,
181
],
[
181,
182
],
[
181,
183
],
[
183,
184
],
[
183,
185
],
[
174,
186
],
[
186,
187
],
[
169,
188
],
[
188,
189
],
[
129,
190
],
[
190,
191
],
[
190,
192
],
[
192,
193
],
[
193,
194
],
[
194,
195
],
[
194,
196
],
[
196,
197
],
[
197,
198
],
[
198,
199
],
[
196,
200
],
[
200,
201
],
[
201,
202
],
[
193,
203
],
[
203,
204
],
[
204,
205
],
[
204,
206
],
[
203,
207
],
[
207,
208
],
[
207,
209
],
[
209,
210
],
[
210,
211
],
[
203,
212
],
[
212,
213
],
[
214,
214
],
[
214,
215
],
[
215,
216
],
[
216,
217
],
[
216,
218
],
[
215,
219
],
[
219,
220
],
[
219,
221
],
[
214,
222
],
[
222,
223
],
[
222,
224
],
[
214,
225
],
[
225,
226
],
[
225,
227
],
[
212,
228
],
[
228,
229
],
[
229,
230
],
[
229,
231
],
[
231,
232
],
[
232,
233
],
[
203,
234
],
[
234,
235
],
[
235,
236
],
[
235,
237
],
[
234,
238
],
[
238,
239
],
[
239,
240
],
[
239,
241
],
[
241,
242
],
[
238,
243
],
[
243,
244
],
[
243,
245
],
[
245,
246
],
[
246,
247
],
[
234,
248
],
[
248,
249
],
[
249,
250
],
[
249,
251
],
[
248,
252
],
[
252,
253
],
[
253,
254
],
[
253,
255
],
[
255,
256
],
[
256,
257
],
[
203,
258
],
[
258,
259
],
[
258,
260
],
[
260,
261
],
[
260,
262
],
[
203,
263
],
[
263,
264
],
[
263,
265
],
[
265,
266
],
[
266,
267
],
[
266,
268
],
[
268,
269
],
[
269,
270
],
[
265,
271
],
[
271,
272
],
[
272,
273
],
[
273,
274
],
[
273,
275
],
[
272,
276
],
[
276,
277
],
[
276,
278
],
[
271,
279
],
[
279,
280
],
[
280,
281
],
[
280,
282
],
[
265,
283
],
[
283,
284
],
[
283,
285
],
[
265,
286
],
[
286,
287
],
[
286,
288
],
[
288,
289
],
[
288,
290
],
[
129,
291
],
[
291,
292
],
[
291,
293
],
[
293,
294
],
[
294,
295
],
[
295,
296
],
[
295,
297
],
[
297,
298
],
[
298,
299
],
[
299,
300
],
[
297,
301
],
[
301,
302
],
[
302,
303
],
[
302,
304
],
[
294,
305
],
[
305,
306
],
[
306,
307
],
[
306,
308
],
[
305,
309
],
[
309,
310
],
[
309,
311
],
[
311,
312
],
[
312,
313
],
[
305,
314
],
[
314,
315
],
[
316,
316
],
[
316,
317
],
[
317,
318
],
[
318,
319
],
[
318,
320
],
[
317,
321
],
[
321,
322
],
[
321,
323
],
[
316,
324
],
[
324,
325
],
[
324,
326
],
[
316,
327
],
[
327,
328
],
[
327,
329
],
[
314,
330
],
[
330,
331
],
[
331,
332
],
[
331,
333
],
[
333,
334
],
[
334,
335
],
[
305,
336
],
[
336,
337
],
[
337,
338
],
[
337,
339
],
[
336,
340
],
[
340,
341
],
[
341,
342
],
[
341,
343
],
[
343,
344
],
[
340,
345
],
[
345,
346
],
[
345,
347
],
[
347,
348
],
[
348,
349
],
[
336,
350
],
[
350,
351
],
[
351,
352
],
[
351,
353
],
[
350,
354
],
[
354,
355
],
[
355,
356
],
[
355,
357
],
[
357,
358
],
[
358,
359
],
[
305,
360
],
[
360,
361
],
[
360,
362
],
[
362,
363
],
[
362,
364
],
[
305,
365
],
[
365,
366
],
[
365,
367
],
[
367,
368
],
[
368,
369
],
[
368,
370
],
[
370,
371
],
[
371,
372
],
[
367,
373
],
[
373,
374
],
[
374,
375
],
[
375,
376
],
[
375,
377
],
[
374,
378
],
[
378,
379
],
[
378,
380
],
[
373,
381
],
[
367,
382
],
[
382,
383
],
[
382,
384
],
[
367,
385
],
[
385,
386
],
[
385,
387
],
[
387,
388
],
[
387,
389
],
[
305,
390
],
[
390,
391
],
[
391,
392
],
[
391,
393
],
[
390,
394
],
[
394,
395
],
[
395,
396
],
[
395,
397
],
[
305,
398
],
[
398,
399
],
[
398,
400
],
[
305,
401
],
[
401,
402
],
[
401,
403
],
[
403,
404
],
[
404,
405
],
[
305,
406
],
[
406,
407
],
[
407,
408
],
[
408,
409
],
[
408,
410
],
[
407,
411
],
[
411,
412
],
[
411,
413
],
[
406,
414
],
[
414,
415
],
[
415,
416
],
[
415,
417
],
[
414,
418
],
[
418,
419
],
[
418,
420
],
[
420,
421
],
[
420,
422
],
[
414,
423
],
[
423,
424
],
[
423,
425
],
[
414,
426
],
[
426,
427
],
[
426,
428
],
[
428,
429
],
[
429,
430
],
[
305,
431
],
[
431,
432
],
[
432,
433
],
[
433,
434
],
[
433,
435
],
[
432,
436
],
[
129,
437
],
[
437,
438
],
[
437,
439
],
[
439,
440
],
[
440,
441
],
[
441,
442
],
[
441,
443
],
[
443,
444
],
[
444,
445
],
[
445,
446
],
[
443,
447
],
[
447,
448
],
[
440,
449
],
[
449,
450
],
[
450,
451
],
[
450,
452
],
[
452,
453
],
[
453,
454
],
[
449,
455
],
[
455,
456
],
[
456,
457
],
[
457,
458
],
[
456,
459
],
[
455,
460
],
[
460,
461
],
[
461,
462
],
[
461,
463
],
[
463,
464
],
[
464,
465
],
[
449,
466
],
[
466,
467
],
[
129,
468
],
[
468,
469
],
[
468,
470
],
[
470,
471
],
[
471,
472
],
[
472,
473
],
[
472,
474
],
[
474,
475
],
[
475,
476
],
[
476,
477
],
[
474,
478
],
[
478,
479
],
[
471,
480
],
[
480,
481
],
[
481,
482
],
[
481,
483
],
[
480,
484
],
[
484,
485
],
[
484,
486
],
[
486,
487
],
[
487,
488
],
[
480,
489
],
[
489,
490
],
[
490,
491
],
[
491,
492
],
[
490,
493
],
[
489,
494
],
[
494,
495
],
[
495,
496
],
[
495,
497
],
[
497,
498
],
[
498,
499
],
[
480,
500
],
[
500,
501
],
[
501,
502
],
[
502,
503
],
[
502,
504
],
[
504,
505
],
[
501,
506
],
[
506,
507
],
[
507,
508
],
[
508,
509
],
[
507,
510
],
[
500,
511
],
[
511,
512
],
[
512,
513
],
[
513,
514
],
[
512,
515
],
[
511,
516
],
[
516,
517
],
[
516,
518
],
[
518,
519
],
[
519,
520
],
[
480,
521
],
[
521,
522
],
[
522,
523
],
[
523,
524
],
[
129,
525
],
[
525,
526
],
[
525,
527
],
[
527,
528
],
[
528,
529
],
[
529,
530
],
[
529,
531
],
[
531,
532
],
[
532,
533
],
[
533,
534
],
[
531,
535
],
[
535,
536
],
[
528,
537
],
[
537,
538
],
[
538,
539
],
[
538,
540
],
[
537,
541
],
[
541,
542
],
[
541,
543
],
[
543,
544
],
[
544,
545
],
[
537,
546
],
[
546,
547
],
[
547,
548
],
[
548,
549
],
[
548,
550
],
[
550,
551
],
[
547,
552
],
[
552,
553
],
[
552,
554
],
[
546,
555
],
[
555,
556
],
[
556,
557
],
[
557,
558
],
[
556,
559
],
[
555,
560
],
[
560,
561
],
[
560,
562
],
[
562,
563
],
[
563,
564
],
[
537,
565
],
[
565,
566
],
[
566,
567
],
[
567,
568
],
[
129,
569
],
[
569,
570
],
[
569,
571
],
[
571,
572
],
[
572,
573
],
[
572,
574
],
[
571,
576
],
[
576,
577
],
[
577,
578
],
[
578,
579
],
[
578,
580
],
[
576,
581
],
[
581,
582
],
[
581,
583
],
[
576,
584
],
[
584,
585
],
[
585,
586
],
[
576,
587
],
[
588,
588
],
[
588,
589
],
[
589,
590
],
[
590,
591
],
[
590,
592
],
[
589,
593
],
[
593,
594
],
[
571,
595
],
[
595,
596
],
[
569,
597
],
[
597,
598
],
[
129,
599
],
[
599,
600
],
[
599,
601
],
[
601,
602
],
[
602,
603
],
[
602,
604
],
[
601,
606
],
[
606,
607
],
[
607,
608
],
[
608,
609
],
[
608,
610
],
[
606,
611
],
[
611,
612
],
[
611,
613
],
[
606,
614
],
[
614,
615
],
[
615,
616
],
[
606,
617
],
[
618,
618
],
[
618,
619
],
[
619,
620
],
[
620,
621
],
[
620,
622
],
[
619,
623
],
[
623,
624
],
[
624,
625
],
[
623,
626
],
[
601,
627
],
[
627,
628
],
[
599,
629
],
[
629,
630
],
[
129,
631
],
[
631,
632
],
[
631,
633
],
[
633,
634
],
[
634,
635
],
[
634,
636
],
[
637,
638
],
[
637,
639
],
[
633,
640
],
[
640,
641
],
[
641,
642
],
[
642,
643
],
[
642,
644
],
[
640,
645
],
[
645,
646
],
[
645,
647
],
[
640,
648
],
[
648,
649
],
[
649,
650
],
[
640,
651
],
[
652,
652
],
[
652,
653
],
[
653,
654
],
[
654,
655
],
[
654,
656
],
[
656,
657
],
[
656,
658
],
[
653,
659
],
[
659,
660
],
[
633,
661
],
[
661,
662
],
[
631,
663
],
[
663,
664
],
[
129,
665
],
[
665,
666
],
[
665,
667
],
[
667,
668
],
[
668,
669
],
[
668,
670
],
[
667,
672
],
[
672,
673
],
[
673,
674
],
[
674,
675
],
[
674,
676
],
[
672,
677
],
[
677,
678
],
[
677,
679
],
[
672,
680
],
[
680,
681
],
[
681,
682
],
[
672,
683
],
[
684,
684
],
[
684,
685
],
[
685,
686
],
[
686,
687
],
[
686,
688
],
[
685,
689
],
[
689,
690
],
[
667,
691
],
[
691,
692
],
[
665,
693
],
[
693,
694
],
[
129,
695
],
[
695,
696
],
[
695,
697
],
[
697,
698
],
[
698,
699
],
[
698,
700
],
[
697,
702
],
[
702,
703
],
[
703,
704
],
[
704,
705
],
[
704,
706
],
[
702,
707
],
[
707,
708
],
[
707,
709
],
[
702,
710
],
[
710,
711
],
[
711,
712
],
[
702,
713
],
[
714,
714
],
[
714,
715
],
[
715,
716
],
[
716,
717
],
[
716,
718
],
[
715,
719
],
[
719,
720
],
[
720,
721
],
[
719,
722
],
[
697,
723
],
[
723,
724
],
[
695,
725
],
[
725,
726
],
[
129,
727
],
[
727,
728
],
[
727,
729
],
[
729,
730
],
[
730,
731
],
[
730,
732
],
[
733,
734
],
[
733,
735
],
[
729,
736
],
[
736,
737
],
[
737,
738
],
[
738,
739
],
[
738,
740
],
[
736,
741
],
[
741,
742
],
[
741,
743
],
[
736,
744
],
[
744,
745
],
[
745,
746
],
[
736,
747
],
[
748,
748
],
[
748,
749
],
[
749,
750
],
[
750,
751
],
[
750,
752
],
[
752,
753
],
[
752,
754
],
[
749,
755
],
[
755,
756
],
[
729,
757
],
[
757,
758
],
[
727,
759
],
[
759,
760
],
[
129,
761
],
[
761,
762
],
[
761,
763
],
[
763,
764
],
[
764,
765
],
[
764,
766
],
[
763,
768
],
[
768,
769
],
[
769,
770
],
[
770,
771
],
[
770,
772
],
[
768,
773
],
[
773,
774
],
[
773,
775
],
[
768,
776
],
[
776,
777
],
[
777,
778
],
[
768,
779
],
[
780,
780
],
[
780,
781
],
[
781,
782
],
[
782,
783
],
[
782,
784
],
[
781,
785
],
[
785,
786
],
[
763,
787
],
[
787,
788
],
[
761,
789
],
[
789,
790
],
[
0,
791
],
[
791,
792
],
[
791,
793
]
]
| [
"import java.io.*;\nimport java.util.*;\nimport java.math.BigDecimal;\n\n@SuppressWarnings(\"unused\")\npublic class Main {\n FastScanner in;\n PrintWriter out;\n final static int MOD = (int)1e9+7;\n \n void solve(){\n String S = in.nextStr(), T = in.nextStr();\n \n int min = S.length();\n for(int i = 0; i + T.length() <= S.length(); i++){\n int num = 0;\n for(int j = 0; j < T.length(); j++){\n if(T.charAt(j) != S.charAt(i + j)) num++;\n }\n min = Math.min(min, num);\n }\n out.println(min);\n }\n \n public static void main(String[] args) {\n new Main().m();\n }\n \n private void m() {\n in = new FastScanner(System.in);\n out = new PrintWriter(System.out);\n /*\n try {\n String path = \"input.txt\";\n out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));\n }catch (IOException e){\n e.printStackTrace();\n }\n */\n solve();\n out.flush();\n in.close();\n out.close();\n }\n \n static class FastScanner {\n private Reader input;\n \n public FastScanner() {this(System.in);}\n public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}\n public void close() {\n try {\n this.input.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n \n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n \n public long nextLong() {\n try {\n int sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n long ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) return ret * sign;\n ret *= 10;\n ret += b - '0';\n }\n } catch (IOException e) {\n e.printStackTrace();\n return -1;\n }\n }\n \n public double nextDouble() {\n try {\n double sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n double ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) break;\n ret *= 10;\n ret += b - '0';\n }\n if (b != '.') return sign * ret;\n double div = 1;\n b = input.read();\n while ('0' <= b && b <= '9') {\n ret *= 10;\n ret += b - '0';\n div *= 10;\n b = input.read();\n }\n return sign * ret / div;\n } catch (IOException e) {\n e.printStackTrace();\n return Double.NaN;\n }\n }\n \n public char nextChar() {\n try {\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n return (char) b;\n } catch (IOException e) {\n e.printStackTrace();\n return 0;\n }\n }\n \n public String nextStr() {\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n while (b != -1 && !Character.isWhitespace(b)) {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }\n \n public String nextLine() {\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (b != -1 && b != '\\n') {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }\n \n public int[] nextIntArray(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt();\n }\n return res;\n }\n \n public int[] nextIntArrayDec(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt() - 1;\n }\n return res;\n }\n \n public int[] nextIntArray1Index(int n) {\n int[] res = new int[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextInt();\n }\n return res;\n }\n \n public long[] nextLongArray(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong();\n }\n return res;\n }\n \n public long[] nextLongArrayDec(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong() - 1;\n }\n return res;\n }\n \n public long[] nextLongArray1Index(int n) {\n long[] res = new long[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextLong();\n }\n return res;\n }\n \n public double[] nextDoubleArray(int n) {\n double[] res = new double[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextDouble();\n }\n return res;\n }\n }\n}",
"import java.io.*;",
"io.*",
"java",
"import java.util.*;",
"util.*",
"java",
"import java.math.BigDecimal;",
"BigDecimal",
"java.math",
"public class Main {\n FastScanner in;\n PrintWriter out;\n final static int MOD = (int)1e9+7;\n \n void solve(){\n String S = in.nextStr(), T = in.nextStr();\n \n int min = S.length();\n for(int i = 0; i + T.length() <= S.length(); i++){\n int num = 0;\n for(int j = 0; j < T.length(); j++){\n if(T.charAt(j) != S.charAt(i + j)) num++;\n }\n min = Math.min(min, num);\n }\n out.println(min);\n }\n \n public static void main(String[] args) {\n new Main().m();\n }\n \n private void m() {\n in = new FastScanner(System.in);\n out = new PrintWriter(System.out);\n /*\n try {\n String path = \"input.txt\";\n out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));\n }catch (IOException e){\n e.printStackTrace();\n }\n */\n solve();\n out.flush();\n in.close();\n out.close();\n }\n \n static class FastScanner {\n private Reader input;\n \n public FastScanner() {this(System.in);}\n public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}\n public void close() {\n try {\n this.input.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n \n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n \n public long nextLong() {\n try {\n int sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n long ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) return ret * sign;\n ret *= 10;\n ret += b - '0';\n }\n } catch (IOException e) {\n e.printStackTrace();\n return -1;\n }\n }\n \n public double nextDouble() {\n try {\n double sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n double ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) break;\n ret *= 10;\n ret += b - '0';\n }\n if (b != '.') return sign * ret;\n double div = 1;\n b = input.read();\n while ('0' <= b && b <= '9') {\n ret *= 10;\n ret += b - '0';\n div *= 10;\n b = input.read();\n }\n return sign * ret / div;\n } catch (IOException e) {\n e.printStackTrace();\n return Double.NaN;\n }\n }\n \n public char nextChar() {\n try {\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n return (char) b;\n } catch (IOException e) {\n e.printStackTrace();\n return 0;\n }\n }\n \n public String nextStr() {\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n while (b != -1 && !Character.isWhitespace(b)) {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }\n \n public String nextLine() {\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (b != -1 && b != '\\n') {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }\n \n public int[] nextIntArray(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt();\n }\n return res;\n }\n \n public int[] nextIntArrayDec(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt() - 1;\n }\n return res;\n }\n \n public int[] nextIntArray1Index(int n) {\n int[] res = new int[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextInt();\n }\n return res;\n }\n \n public long[] nextLongArray(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong();\n }\n return res;\n }\n \n public long[] nextLongArrayDec(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong() - 1;\n }\n return res;\n }\n \n public long[] nextLongArray1Index(int n) {\n long[] res = new long[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextLong();\n }\n return res;\n }\n \n public double[] nextDoubleArray(int n) {\n double[] res = new double[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextDouble();\n }\n return res;\n }\n }\n}",
"Main",
"FastScanner in;",
"in",
"PrintWriter out;",
"out",
"final static int MOD = (int)1e9+7;",
"MOD",
"(int)1e9+7",
"(int)1e9",
"7",
"void solve(){\n String S = in.nextStr(), T = in.nextStr();\n \n int min = S.length();\n for(int i = 0; i + T.length() <= S.length(); i++){\n int num = 0;\n for(int j = 0; j < T.length(); j++){\n if(T.charAt(j) != S.charAt(i + j)) num++;\n }\n min = Math.min(min, num);\n }\n out.println(min);\n }",
"solve",
"{\n String S = in.nextStr(), T = in.nextStr();\n \n int min = S.length();\n for(int i = 0; i + T.length() <= S.length(); i++){\n int num = 0;\n for(int j = 0; j < T.length(); j++){\n if(T.charAt(j) != S.charAt(i + j)) num++;\n }\n min = Math.min(min, num);\n }\n out.println(min);\n }",
"String S = in.nextStr()",
"S",
"in.nextStr()",
"in.nextStr",
"in",
"T = in.nextStr();",
"T",
"in.nextStr()",
"in.nextStr",
"in",
"int min = S.length();",
"min",
"S.length()",
"S.length",
"S",
"for(int i = 0; i + T.length() <= S.length(); i++){\n int num = 0;\n for(int j = 0; j < T.length(); j++){\n if(T.charAt(j) != S.charAt(i + j)) num++;\n }\n min = Math.min(min, num);\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i + T.length() <= S.length()",
"i + T.length()",
"i",
"T.length()",
"T.length",
"T",
"S.length()",
"S.length",
"S",
"i++",
"i++",
"i",
"{\n int num = 0;\n for(int j = 0; j < T.length(); j++){\n if(T.charAt(j) != S.charAt(i + j)) num++;\n }\n min = Math.min(min, num);\n }",
"{\n int num = 0;\n for(int j = 0; j < T.length(); j++){\n if(T.charAt(j) != S.charAt(i + j)) num++;\n }\n min = Math.min(min, num);\n }",
"int num = 0;",
"num",
"0",
"for(int j = 0; j < T.length(); j++){\n if(T.charAt(j) != S.charAt(i + j)) num++;\n }",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < T.length()",
"j",
"T.length()",
"T.length",
"T",
"j++",
"j++",
"j",
"{\n if(T.charAt(j) != S.charAt(i + j)) num++;\n }",
"{\n if(T.charAt(j) != S.charAt(i + j)) num++;\n }",
"if(T.charAt(j) != S.charAt(i + j)) num++;",
"T.charAt(j) != S.charAt(i + j)",
"T.charAt(j)",
"T.charAt",
"T",
"j",
"S.charAt(i + j)",
"S.charAt",
"S",
"i + j",
"i",
"j",
"num++",
"num",
"min = Math.min(min, num)",
"min",
"Math.min(min, num)",
"Math.min",
"Math",
"min",
"num",
"out.println(min)",
"out.println",
"out",
"min",
"public static void main(String[] args) {\n new Main().m();\n }",
"main",
"{\n new Main().m();\n }",
"new Main().m()",
"new Main().m",
"new Main()",
"String[] args",
"args",
"private void m() {\n in = new FastScanner(System.in);\n out = new PrintWriter(System.out);\n /*\n try {\n String path = \"input.txt\";\n out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));\n }catch (IOException e){\n e.printStackTrace();\n }\n */\n solve();\n out.flush();\n in.close();\n out.close();\n }",
"m",
"{\n in = new FastScanner(System.in);\n out = new PrintWriter(System.out);\n /*\n try {\n String path = \"input.txt\";\n out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));\n }catch (IOException e){\n e.printStackTrace();\n }\n */\n solve();\n out.flush();\n in.close();\n out.close();\n }",
"in = new FastScanner(System.in)",
"in",
"new FastScanner(System.in)",
"out = new PrintWriter(System.out)",
"out",
"new PrintWriter(System.out)",
"solve()",
"solve",
"out.flush()",
"out.flush",
"out",
"in.close()",
"in.close",
"in",
"out.close()",
"out.close",
"out",
"static class FastScanner {\n private Reader input;\n \n public FastScanner() {this(System.in);}\n public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}\n public void close() {\n try {\n this.input.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n \n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n \n public long nextLong() {\n try {\n int sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n long ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) return ret * sign;\n ret *= 10;\n ret += b - '0';\n }\n } catch (IOException e) {\n e.printStackTrace();\n return -1;\n }\n }\n \n public double nextDouble() {\n try {\n double sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n double ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) break;\n ret *= 10;\n ret += b - '0';\n }\n if (b != '.') return sign * ret;\n double div = 1;\n b = input.read();\n while ('0' <= b && b <= '9') {\n ret *= 10;\n ret += b - '0';\n div *= 10;\n b = input.read();\n }\n return sign * ret / div;\n } catch (IOException e) {\n e.printStackTrace();\n return Double.NaN;\n }\n }\n \n public char nextChar() {\n try {\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n return (char) b;\n } catch (IOException e) {\n e.printStackTrace();\n return 0;\n }\n }\n \n public String nextStr() {\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n while (b != -1 && !Character.isWhitespace(b)) {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }\n \n public String nextLine() {\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (b != -1 && b != '\\n') {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }\n \n public int[] nextIntArray(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt();\n }\n return res;\n }\n \n public int[] nextIntArrayDec(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt() - 1;\n }\n return res;\n }\n \n public int[] nextIntArray1Index(int n) {\n int[] res = new int[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextInt();\n }\n return res;\n }\n \n public long[] nextLongArray(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong();\n }\n return res;\n }\n \n public long[] nextLongArrayDec(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong() - 1;\n }\n return res;\n }\n \n public long[] nextLongArray1Index(int n) {\n long[] res = new long[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextLong();\n }\n return res;\n }\n \n public double[] nextDoubleArray(int n) {\n double[] res = new double[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextDouble();\n }\n return res;\n }\n }",
"FastScanner",
"private Reader input;",
"input",
"public FastScanner() {this(System.in);}",
"FastScanner",
"{this(System.in);}",
"this(System.in)",
"this",
"System.in",
"System",
"System.in",
"public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}",
"FastScanner",
"{this.input = new BufferedReader(new InputStreamReader(stream));}",
"this.input = new BufferedReader(new InputStreamReader(stream))",
"this.input",
"this",
"this.input",
"new BufferedReader(new InputStreamReader(stream))",
"InputStream stream",
"stream",
"public void close() {\n try {\n this.input.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }",
"close",
"{\n try {\n this.input.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }",
"try {\n this.input.close();\n } catch (IOException e) {\n e.printStackTrace();\n }",
"catch (IOException e) {\n e.printStackTrace();\n }",
"IOException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n this.input.close();\n }",
"this.input.close()",
"this.input.close",
"this.input",
"this",
"this.input",
"public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }",
"nextInt",
"{\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }",
"long nl = nextLong();",
"nl",
"nextLong()",
"nextLong",
"if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();",
"nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE",
"nl < Integer.MIN_VALUE",
"nl",
"Integer.MIN_VALUE",
"Integer",
"Integer.MIN_VALUE",
"nl > Integer.MAX_VALUE",
"nl",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"throw new NumberFormatException();",
"new NumberFormatException()",
"return (int) nl;",
"(int) nl",
"public long nextLong() {\n try {\n int sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n long ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) return ret * sign;\n ret *= 10;\n ret += b - '0';\n }\n } catch (IOException e) {\n e.printStackTrace();\n return -1;\n }\n }",
"nextLong",
"{\n try {\n int sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n long ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) return ret * sign;\n ret *= 10;\n ret += b - '0';\n }\n } catch (IOException e) {\n e.printStackTrace();\n return -1;\n }\n }",
"try {\n int sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n long ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) return ret * sign;\n ret *= 10;\n ret += b - '0';\n }\n } catch (IOException e) {\n e.printStackTrace();\n return -1;\n }",
"catch (IOException e) {\n e.printStackTrace();\n return -1;\n }",
"IOException e",
"{\n e.printStackTrace();\n return -1;\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"return -1;",
"-1",
"1",
"{\n int sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n long ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) return ret * sign;\n ret *= 10;\n ret += b - '0';\n }\n }",
"int sign = 1;",
"sign",
"1",
"int b = input.read();",
"b",
"input.read()",
"input.read",
"input",
"while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }",
"(b < '0' || '9' < b) && b != '-' && b != '+'",
"(b < '0' || '9' < b) && b != '-' && b != '+'",
"(b < '0' || '9' < b)",
"b < '0'",
"b",
"'0'",
"'9' < b",
"'9'",
"b",
"b != '-'",
"b",
"'-'",
"b != '+'",
"b",
"'+'",
"{\n b = input.read();\n }",
"b = input.read()",
"b",
"input.read()",
"input.read",
"input",
"if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }",
"b == '-'",
"b",
"'-'",
"{\n sign = -1;\n b = input.read();\n }",
"sign = -1",
"sign",
"-1",
"1",
"b = input.read()",
"b",
"input.read()",
"input.read",
"input",
"if (b == '+') {\n b = input.read();\n }",
"b == '+'",
"b",
"'+'",
"{\n b = input.read();\n }",
"b = input.read()",
"b",
"input.read()",
"input.read",
"input",
"long ret = b - '0';",
"ret",
"b - '0'",
"b",
"'0'",
"while (true) {\n b = input.read();\n if (b < '0' || '9' < b) return ret * sign;\n ret *= 10;\n ret += b - '0';\n }",
"true",
"{\n b = input.read();\n if (b < '0' || '9' < b) return ret * sign;\n ret *= 10;\n ret += b - '0';\n }",
"b = input.read()",
"b",
"input.read()",
"input.read",
"input",
"if (b < '0' || '9' < b) return ret * sign;",
"b < '0' || '9' < b",
"b < '0'",
"b",
"'0'",
"'9' < b",
"'9'",
"b",
"return ret * sign;",
"ret * sign",
"ret",
"sign",
"ret *= 10",
"ret",
"10",
"ret += b - '0'",
"ret",
"b - '0'",
"b",
"'0'",
"public double nextDouble() {\n try {\n double sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n double ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) break;\n ret *= 10;\n ret += b - '0';\n }\n if (b != '.') return sign * ret;\n double div = 1;\n b = input.read();\n while ('0' <= b && b <= '9') {\n ret *= 10;\n ret += b - '0';\n div *= 10;\n b = input.read();\n }\n return sign * ret / div;\n } catch (IOException e) {\n e.printStackTrace();\n return Double.NaN;\n }\n }",
"nextDouble",
"{\n try {\n double sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n double ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) break;\n ret *= 10;\n ret += b - '0';\n }\n if (b != '.') return sign * ret;\n double div = 1;\n b = input.read();\n while ('0' <= b && b <= '9') {\n ret *= 10;\n ret += b - '0';\n div *= 10;\n b = input.read();\n }\n return sign * ret / div;\n } catch (IOException e) {\n e.printStackTrace();\n return Double.NaN;\n }\n }",
"try {\n double sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n double ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) break;\n ret *= 10;\n ret += b - '0';\n }\n if (b != '.') return sign * ret;\n double div = 1;\n b = input.read();\n while ('0' <= b && b <= '9') {\n ret *= 10;\n ret += b - '0';\n div *= 10;\n b = input.read();\n }\n return sign * ret / div;\n } catch (IOException e) {\n e.printStackTrace();\n return Double.NaN;\n }",
"catch (IOException e) {\n e.printStackTrace();\n return Double.NaN;\n }",
"IOException e",
"{\n e.printStackTrace();\n return Double.NaN;\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"return Double.NaN;",
"Double.NaN",
"Double",
"Double.NaN",
"{\n double sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n double ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) break;\n ret *= 10;\n ret += b - '0';\n }\n if (b != '.') return sign * ret;\n double div = 1;\n b = input.read();\n while ('0' <= b && b <= '9') {\n ret *= 10;\n ret += b - '0';\n div *= 10;\n b = input.read();\n }\n return sign * ret / div;\n }",
"double sign = 1;",
"sign",
"1",
"int b = input.read();",
"b",
"input.read()",
"input.read",
"input",
"while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }",
"(b < '0' || '9' < b) && b != '-' && b != '+'",
"(b < '0' || '9' < b) && b != '-' && b != '+'",
"(b < '0' || '9' < b)",
"b < '0'",
"b",
"'0'",
"'9' < b",
"'9'",
"b",
"b != '-'",
"b",
"'-'",
"b != '+'",
"b",
"'+'",
"{\n b = input.read();\n }",
"b = input.read()",
"b",
"input.read()",
"input.read",
"input",
"if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }",
"b == '-'",
"b",
"'-'",
"{\n sign = -1;\n b = input.read();\n }",
"sign = -1",
"sign",
"-1",
"1",
"b = input.read()",
"b",
"input.read()",
"input.read",
"input",
"if (b == '+') {\n b = input.read();\n }",
"b == '+'",
"b",
"'+'",
"{\n b = input.read();\n }",
"b = input.read()",
"b",
"input.read()",
"input.read",
"input",
"double ret = b - '0';",
"ret",
"b - '0'",
"b",
"'0'",
"while (true) {\n b = input.read();\n if (b < '0' || '9' < b) break;\n ret *= 10;\n ret += b - '0';\n }",
"true",
"{\n b = input.read();\n if (b < '0' || '9' < b) break;\n ret *= 10;\n ret += b - '0';\n }",
"b = input.read()",
"b",
"input.read()",
"input.read",
"input",
"if (b < '0' || '9' < b) break;",
"b < '0' || '9' < b",
"b < '0'",
"b",
"'0'",
"'9' < b",
"'9'",
"b",
"break;",
"ret *= 10",
"ret",
"10",
"ret += b - '0'",
"ret",
"b - '0'",
"b",
"'0'",
"if (b != '.') return sign * ret;",
"b != '.'",
"b",
"'.'",
"return sign * ret;",
"sign * ret",
"sign",
"ret",
"double div = 1;",
"div",
"1",
"b = input.read()",
"b",
"input.read()",
"input.read",
"input",
"while ('0' <= b && b <= '9') {\n ret *= 10;\n ret += b - '0';\n div *= 10;\n b = input.read();\n }",
"'0' <= b && b <= '9'",
"'0' <= b",
"'0'",
"b",
"b <= '9'",
"b",
"'9'",
"{\n ret *= 10;\n ret += b - '0';\n div *= 10;\n b = input.read();\n }",
"ret *= 10",
"ret",
"10",
"ret += b - '0'",
"ret",
"b - '0'",
"b",
"'0'",
"div *= 10",
"div",
"10",
"b = input.read()",
"b",
"input.read()",
"input.read",
"input",
"return sign * ret / div;",
"sign * ret / div",
"sign * ret",
"sign",
"ret",
"div",
"public char nextChar() {\n try {\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n return (char) b;\n } catch (IOException e) {\n e.printStackTrace();\n return 0;\n }\n }",
"nextChar",
"{\n try {\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n return (char) b;\n } catch (IOException e) {\n e.printStackTrace();\n return 0;\n }\n }",
"try {\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n return (char) b;\n } catch (IOException e) {\n e.printStackTrace();\n return 0;\n }",
"catch (IOException e) {\n e.printStackTrace();\n return 0;\n }",
"IOException e",
"{\n e.printStackTrace();\n return 0;\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"return 0;",
"0",
"{\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n return (char) b;\n }",
"int b = input.read();",
"b",
"input.read()",
"input.read",
"input",
"while (Character.isWhitespace(b)) {\n b = input.read();\n }",
"Character.isWhitespace(b)",
"Character.isWhitespace",
"Character",
"b",
"{\n b = input.read();\n }",
"b = input.read()",
"b",
"input.read()",
"input.read",
"input",
"return (char) b;",
"(char) b",
"public String nextStr() {\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n while (b != -1 && !Character.isWhitespace(b)) {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }",
"nextStr",
"{\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n while (b != -1 && !Character.isWhitespace(b)) {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }",
"try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n while (b != -1 && !Character.isWhitespace(b)) {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }",
"catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }",
"IOException e",
"{\n e.printStackTrace();\n return \"\";\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"return \"\";",
"\"\"",
"{\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n while (b != -1 && !Character.isWhitespace(b)) {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n }",
"StringBuilder sb = new StringBuilder();",
"sb",
"new StringBuilder()",
"int b = input.read();",
"b",
"input.read()",
"input.read",
"input",
"while (Character.isWhitespace(b)) {\n b = input.read();\n }",
"Character.isWhitespace(b)",
"Character.isWhitespace",
"Character",
"b",
"{\n b = input.read();\n }",
"b = input.read()",
"b",
"input.read()",
"input.read",
"input",
"while (b != -1 && !Character.isWhitespace(b)) {\n sb.append((char) b);\n b = input.read();\n }",
"b != -1 && !Character.isWhitespace(b)",
"b != -1",
"b",
"-1",
"1",
"!Character.isWhitespace(b)",
"Character.isWhitespace(b)",
"Character.isWhitespace",
"Character",
"b",
"{\n sb.append((char) b);\n b = input.read();\n }",
"sb.append((char) b)",
"sb.append",
"sb",
"(char) b",
"b = input.read()",
"b",
"input.read()",
"input.read",
"input",
"return sb.toString();",
"sb.toString()",
"sb.toString",
"sb",
"public String nextLine() {\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (b != -1 && b != '\\n') {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }",
"nextLine",
"{\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (b != -1 && b != '\\n') {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }",
"try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (b != -1 && b != '\\n') {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }",
"catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }",
"IOException e",
"{\n e.printStackTrace();\n return \"\";\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"return \"\";",
"\"\"",
"{\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (b != -1 && b != '\\n') {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n }",
"StringBuilder sb = new StringBuilder();",
"sb",
"new StringBuilder()",
"int b = input.read();",
"b",
"input.read()",
"input.read",
"input",
"while (b != -1 && b != '\\n') {\n sb.append((char) b);\n b = input.read();\n }",
"b != -1 && b != '\\n'",
"b != -1",
"b",
"-1",
"1",
"b != '\\n'",
"b",
"'\\n'",
"{\n sb.append((char) b);\n b = input.read();\n }",
"sb.append((char) b)",
"sb.append",
"sb",
"(char) b",
"b = input.read()",
"b",
"input.read()",
"input.read",
"input",
"return sb.toString();",
"sb.toString()",
"sb.toString",
"sb",
"public int[] nextIntArray(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt();\n }\n return res;\n }",
"nextIntArray",
"{\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt();\n }\n return res;\n }",
"int[] res = new int[n];",
"res",
"new int[n]",
"n",
"for (int i = 0; i < n; i++) {\n res[i] = nextInt();\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n res[i] = nextInt();\n }",
"{\n res[i] = nextInt();\n }",
"res[i] = nextInt()",
"res[i]",
"res",
"i",
"nextInt()",
"nextInt",
"return res;",
"res",
"int n",
"n",
"public int[] nextIntArrayDec(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt() - 1;\n }\n return res;\n }",
"nextIntArrayDec",
"{\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt() - 1;\n }\n return res;\n }",
"int[] res = new int[n];",
"res",
"new int[n]",
"n",
"for (int i = 0; i < n; i++) {\n res[i] = nextInt() - 1;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n res[i] = nextInt() - 1;\n }",
"{\n res[i] = nextInt() - 1;\n }",
"res[i] = nextInt() - 1",
"res[i]",
"res",
"i",
"nextInt() - 1",
"nextInt()",
"nextInt",
"1",
"return res;",
"res",
"int n",
"n",
"public int[] nextIntArray1Index(int n) {\n int[] res = new int[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextInt();\n }\n return res;\n }",
"nextIntArray1Index",
"{\n int[] res = new int[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextInt();\n }\n return res;\n }",
"int[] res = new int[n + 1];",
"res",
"new int[n + 1]",
"n + 1",
"n",
"1",
"for (int i = 0; i < n; i++) {\n res[i + 1] = nextInt();\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n res[i + 1] = nextInt();\n }",
"{\n res[i + 1] = nextInt();\n }",
"res[i + 1] = nextInt()",
"res[i + 1]",
"res",
"i + 1",
"i",
"1",
"nextInt()",
"nextInt",
"return res;",
"res",
"int n",
"n",
"public long[] nextLongArray(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong();\n }\n return res;\n }",
"nextLongArray",
"{\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong();\n }\n return res;\n }",
"long[] res = new long[n];",
"res",
"new long[n]",
"n",
"for (int i = 0; i < n; i++) {\n res[i] = nextLong();\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n res[i] = nextLong();\n }",
"{\n res[i] = nextLong();\n }",
"res[i] = nextLong()",
"res[i]",
"res",
"i",
"nextLong()",
"nextLong",
"return res;",
"res",
"int n",
"n",
"public long[] nextLongArrayDec(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong() - 1;\n }\n return res;\n }",
"nextLongArrayDec",
"{\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong() - 1;\n }\n return res;\n }",
"long[] res = new long[n];",
"res",
"new long[n]",
"n",
"for (int i = 0; i < n; i++) {\n res[i] = nextLong() - 1;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n res[i] = nextLong() - 1;\n }",
"{\n res[i] = nextLong() - 1;\n }",
"res[i] = nextLong() - 1",
"res[i]",
"res",
"i",
"nextLong() - 1",
"nextLong()",
"nextLong",
"1",
"return res;",
"res",
"int n",
"n",
"public long[] nextLongArray1Index(int n) {\n long[] res = new long[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextLong();\n }\n return res;\n }",
"nextLongArray1Index",
"{\n long[] res = new long[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextLong();\n }\n return res;\n }",
"long[] res = new long[n + 1];",
"res",
"new long[n + 1]",
"n + 1",
"n",
"1",
"for (int i = 0; i < n; i++) {\n res[i + 1] = nextLong();\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n res[i + 1] = nextLong();\n }",
"{\n res[i + 1] = nextLong();\n }",
"res[i + 1] = nextLong()",
"res[i + 1]",
"res",
"i + 1",
"i",
"1",
"nextLong()",
"nextLong",
"return res;",
"res",
"int n",
"n",
"public double[] nextDoubleArray(int n) {\n double[] res = new double[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextDouble();\n }\n return res;\n }",
"nextDoubleArray",
"{\n double[] res = new double[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextDouble();\n }\n return res;\n }",
"double[] res = new double[n];",
"res",
"new double[n]",
"n",
"for (int i = 0; i < n; i++) {\n res[i] = nextDouble();\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"{\n res[i] = nextDouble();\n }",
"{\n res[i] = nextDouble();\n }",
"res[i] = nextDouble()",
"res[i]",
"res",
"i",
"nextDouble()",
"nextDouble",
"return res;",
"res",
"int n",
"n",
"public class Main {\n FastScanner in;\n PrintWriter out;\n final static int MOD = (int)1e9+7;\n \n void solve(){\n String S = in.nextStr(), T = in.nextStr();\n \n int min = S.length();\n for(int i = 0; i + T.length() <= S.length(); i++){\n int num = 0;\n for(int j = 0; j < T.length(); j++){\n if(T.charAt(j) != S.charAt(i + j)) num++;\n }\n min = Math.min(min, num);\n }\n out.println(min);\n }\n \n public static void main(String[] args) {\n new Main().m();\n }\n \n private void m() {\n in = new FastScanner(System.in);\n out = new PrintWriter(System.out);\n /*\n try {\n String path = \"input.txt\";\n out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));\n }catch (IOException e){\n e.printStackTrace();\n }\n */\n solve();\n out.flush();\n in.close();\n out.close();\n }\n \n static class FastScanner {\n private Reader input;\n \n public FastScanner() {this(System.in);}\n public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}\n public void close() {\n try {\n this.input.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n \n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n \n public long nextLong() {\n try {\n int sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n long ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) return ret * sign;\n ret *= 10;\n ret += b - '0';\n }\n } catch (IOException e) {\n e.printStackTrace();\n return -1;\n }\n }\n \n public double nextDouble() {\n try {\n double sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n double ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) break;\n ret *= 10;\n ret += b - '0';\n }\n if (b != '.') return sign * ret;\n double div = 1;\n b = input.read();\n while ('0' <= b && b <= '9') {\n ret *= 10;\n ret += b - '0';\n div *= 10;\n b = input.read();\n }\n return sign * ret / div;\n } catch (IOException e) {\n e.printStackTrace();\n return Double.NaN;\n }\n }\n \n public char nextChar() {\n try {\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n return (char) b;\n } catch (IOException e) {\n e.printStackTrace();\n return 0;\n }\n }\n \n public String nextStr() {\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n while (b != -1 && !Character.isWhitespace(b)) {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }\n \n public String nextLine() {\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (b != -1 && b != '\\n') {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }\n \n public int[] nextIntArray(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt();\n }\n return res;\n }\n \n public int[] nextIntArrayDec(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt() - 1;\n }\n return res;\n }\n \n public int[] nextIntArray1Index(int n) {\n int[] res = new int[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextInt();\n }\n return res;\n }\n \n public long[] nextLongArray(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong();\n }\n return res;\n }\n \n public long[] nextLongArrayDec(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong() - 1;\n }\n return res;\n }\n \n public long[] nextLongArray1Index(int n) {\n long[] res = new long[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextLong();\n }\n return res;\n }\n \n public double[] nextDoubleArray(int n) {\n double[] res = new double[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextDouble();\n }\n return res;\n }\n }\n}",
"public class Main {\n FastScanner in;\n PrintWriter out;\n final static int MOD = (int)1e9+7;\n \n void solve(){\n String S = in.nextStr(), T = in.nextStr();\n \n int min = S.length();\n for(int i = 0; i + T.length() <= S.length(); i++){\n int num = 0;\n for(int j = 0; j < T.length(); j++){\n if(T.charAt(j) != S.charAt(i + j)) num++;\n }\n min = Math.min(min, num);\n }\n out.println(min);\n }\n \n public static void main(String[] args) {\n new Main().m();\n }\n \n private void m() {\n in = new FastScanner(System.in);\n out = new PrintWriter(System.out);\n /*\n try {\n String path = \"input.txt\";\n out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));\n }catch (IOException e){\n e.printStackTrace();\n }\n */\n solve();\n out.flush();\n in.close();\n out.close();\n }\n \n static class FastScanner {\n private Reader input;\n \n public FastScanner() {this(System.in);}\n public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}\n public void close() {\n try {\n this.input.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n \n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n \n public long nextLong() {\n try {\n int sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n long ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) return ret * sign;\n ret *= 10;\n ret += b - '0';\n }\n } catch (IOException e) {\n e.printStackTrace();\n return -1;\n }\n }\n \n public double nextDouble() {\n try {\n double sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n double ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) break;\n ret *= 10;\n ret += b - '0';\n }\n if (b != '.') return sign * ret;\n double div = 1;\n b = input.read();\n while ('0' <= b && b <= '9') {\n ret *= 10;\n ret += b - '0';\n div *= 10;\n b = input.read();\n }\n return sign * ret / div;\n } catch (IOException e) {\n e.printStackTrace();\n return Double.NaN;\n }\n }\n \n public char nextChar() {\n try {\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n return (char) b;\n } catch (IOException e) {\n e.printStackTrace();\n return 0;\n }\n }\n \n public String nextStr() {\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n while (b != -1 && !Character.isWhitespace(b)) {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }\n \n public String nextLine() {\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (b != -1 && b != '\\n') {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }\n \n public int[] nextIntArray(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt();\n }\n return res;\n }\n \n public int[] nextIntArrayDec(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt() - 1;\n }\n return res;\n }\n \n public int[] nextIntArray1Index(int n) {\n int[] res = new int[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextInt();\n }\n return res;\n }\n \n public long[] nextLongArray(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong();\n }\n return res;\n }\n \n public long[] nextLongArrayDec(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong() - 1;\n }\n return res;\n }\n \n public long[] nextLongArray1Index(int n) {\n long[] res = new long[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextLong();\n }\n return res;\n }\n \n public double[] nextDoubleArray(int n) {\n double[] res = new double[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextDouble();\n }\n return res;\n }\n }\n}",
"Main"
]
| import java.io.*;
import java.util.*;
import java.math.BigDecimal;
@SuppressWarnings("unused")
public class Main {
FastScanner in;
PrintWriter out;
final static int MOD = (int)1e9+7;
void solve(){
String S = in.nextStr(), T = in.nextStr();
int min = S.length();
for(int i = 0; i + T.length() <= S.length(); i++){
int num = 0;
for(int j = 0; j < T.length(); j++){
if(T.charAt(j) != S.charAt(i + j)) num++;
}
min = Math.min(min, num);
}
out.println(min);
}
public static void main(String[] args) {
new Main().m();
}
private void m() {
in = new FastScanner(System.in);
out = new PrintWriter(System.out);
/*
try {
String path = "input.txt";
out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
}catch (IOException e){
e.printStackTrace();
}
*/
solve();
out.flush();
in.close();
out.close();
}
static class FastScanner {
private Reader input;
public FastScanner() {this(System.in);}
public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
public void close() {
try {
this.input.close();
} catch (IOException e) {
e.printStackTrace();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public long nextLong() {
try {
int sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
long ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) return ret * sign;
ret *= 10;
ret += b - '0';
}
} catch (IOException e) {
e.printStackTrace();
return -1;
}
}
public double nextDouble() {
try {
double sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
double ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) break;
ret *= 10;
ret += b - '0';
}
if (b != '.') return sign * ret;
double div = 1;
b = input.read();
while ('0' <= b && b <= '9') {
ret *= 10;
ret += b - '0';
div *= 10;
b = input.read();
}
return sign * ret / div;
} catch (IOException e) {
e.printStackTrace();
return Double.NaN;
}
}
public char nextChar() {
try {
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
return (char) b;
} catch (IOException e) {
e.printStackTrace();
return 0;
}
}
public String nextStr() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
while (b != -1 && !Character.isWhitespace(b)) {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public String nextLine() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (b != -1 && b != '\n') {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public int[] nextIntArray(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt();
}
return res;
}
public int[] nextIntArrayDec(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt() - 1;
}
return res;
}
public int[] nextIntArray1Index(int n) {
int[] res = new int[n + 1];
for (int i = 0; i < n; i++) {
res[i + 1] = nextInt();
}
return res;
}
public long[] nextLongArray(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong();
}
return res;
}
public long[] nextLongArrayDec(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong() - 1;
}
return res;
}
public long[] nextLongArray1Index(int n) {
long[] res = new long[n + 1];
for (int i = 0; i < n; i++) {
res[i + 1] = nextLong();
}
return res;
}
public double[] nextDoubleArray(int n) {
double[] res = new double[n];
for (int i = 0; i < n; i++) {
res[i] = nextDouble();
}
return res;
}
}
} |
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
38,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
2,
13,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
2,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
95,
5
],
[
95,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
10,
11
],
[
11,
12
],
[
11,
13
],
[
10,
14
],
[
14,
15
],
[
14,
16
],
[
16,
17
],
[
17,
18
],
[
10,
19
],
[
19,
20
],
[
19,
21
],
[
21,
22
],
[
22,
23
],
[
10,
24
],
[
24,
25
],
[
24,
26
],
[
10,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
29,
31
],
[
27,
32
],
[
32,
33
],
[
33,
34
],
[
33,
35
],
[
35,
36
],
[
36,
37
],
[
32,
38
],
[
38,
39
],
[
39,
40
],
[
27,
41
],
[
41,
42
],
[
42,
43
],
[
27,
44
],
[
45,
45
],
[
45,
46
],
[
46,
47
],
[
46,
48
],
[
45,
49
],
[
49,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
49,
54
],
[
54,
55
],
[
54,
56
],
[
56,
57
],
[
57,
58
],
[
49,
59
],
[
59,
60
],
[
60,
61
],
[
49,
62
],
[
63,
63
],
[
63,
64
],
[
64,
65
],
[
65,
66
],
[
66,
67
],
[
67,
68
],
[
66,
69
],
[
65,
70
],
[
70,
71
],
[
71,
72
],
[
70,
73
],
[
73,
74
],
[
73,
75
],
[
64,
76
],
[
76,
77
],
[
77,
78
],
[
45,
79
],
[
79,
80
],
[
79,
81
],
[
81,
82
],
[
82,
83
],
[
81,
84
],
[
81,
85
],
[
10,
86
],
[
86,
87
],
[
87,
88
],
[
88,
89
],
[
88,
90
],
[
86,
91
],
[
6,
92
],
[
92,
93
],
[
0,
94
],
[
94,
95
],
[
94,
96
]
]
| [
"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n try (Scanner sc = new Scanner(System.in)) {\n String S = sc.next();\n String T = sc.next();\n\n int min = (int) 1e9;\n for (int start = 0; start + T.length() <= S.length(); start++) {\n int count = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i) != S.charAt(start + i)) {\n count++;\n }\n }\n min = Math.min(min, count);\n }\n System.out.println(min);\n }\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n public static void main(String[] args) {\n try (Scanner sc = new Scanner(System.in)) {\n String S = sc.next();\n String T = sc.next();\n\n int min = (int) 1e9;\n for (int start = 0; start + T.length() <= S.length(); start++) {\n int count = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i) != S.charAt(start + i)) {\n count++;\n }\n }\n min = Math.min(min, count);\n }\n System.out.println(min);\n }\n }\n}",
"Main",
"public static void main(String[] args) {\n try (Scanner sc = new Scanner(System.in)) {\n String S = sc.next();\n String T = sc.next();\n\n int min = (int) 1e9;\n for (int start = 0; start + T.length() <= S.length(); start++) {\n int count = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i) != S.charAt(start + i)) {\n count++;\n }\n }\n min = Math.min(min, count);\n }\n System.out.println(min);\n }\n }",
"main",
"{\n try (Scanner sc = new Scanner(System.in)) {\n String S = sc.next();\n String T = sc.next();\n\n int min = (int) 1e9;\n for (int start = 0; start + T.length() <= S.length(); start++) {\n int count = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i) != S.charAt(start + i)) {\n count++;\n }\n }\n min = Math.min(min, count);\n }\n System.out.println(min);\n }\n }",
"try (Scanner sc = new Scanner(System.in)) {\n String S = sc.next();\n String T = sc.next();\n\n int min = (int) 1e9;\n for (int start = 0; start + T.length() <= S.length(); start++) {\n int count = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i) != S.charAt(start + i)) {\n count++;\n }\n }\n min = Math.min(min, count);\n }\n System.out.println(min);\n }",
"{\n String S = sc.next();\n String T = sc.next();\n\n int min = (int) 1e9;\n for (int start = 0; start + T.length() <= S.length(); start++) {\n int count = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i) != S.charAt(start + i)) {\n count++;\n }\n }\n min = Math.min(min, count);\n }\n System.out.println(min);\n }",
"Scanner sc = new Scanner(System.in)",
"Scanner sc = new Scanner(System.in)",
"new Scanner(System.in)",
"String S = sc.next();",
"S",
"sc.next()",
"sc.next",
"sc",
"String T = sc.next();",
"T",
"sc.next()",
"sc.next",
"sc",
"int min = (int) 1e9;",
"min",
"(int) 1e9",
"for (int start = 0; start + T.length() <= S.length(); start++) {\n int count = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i) != S.charAt(start + i)) {\n count++;\n }\n }\n min = Math.min(min, count);\n }",
"int start = 0;",
"int start = 0;",
"start",
"0",
"start + T.length() <= S.length()",
"start + T.length()",
"start",
"T.length()",
"T.length",
"T",
"S.length()",
"S.length",
"S",
"start++",
"start++",
"start",
"{\n int count = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i) != S.charAt(start + i)) {\n count++;\n }\n }\n min = Math.min(min, count);\n }",
"{\n int count = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i) != S.charAt(start + i)) {\n count++;\n }\n }\n min = Math.min(min, count);\n }",
"int count = 0;",
"count",
"0",
"for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i) != S.charAt(start + i)) {\n count++;\n }\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < T.length()",
"i",
"T.length()",
"T.length",
"T",
"i++",
"i++",
"i",
"{\n if (T.charAt(i) != S.charAt(start + i)) {\n count++;\n }\n }",
"{\n if (T.charAt(i) != S.charAt(start + i)) {\n count++;\n }\n }",
"if (T.charAt(i) != S.charAt(start + i)) {\n count++;\n }",
"T.charAt(i) != S.charAt(start + i)",
"T.charAt(i)",
"T.charAt",
"T",
"i",
"S.charAt(start + i)",
"S.charAt",
"S",
"start + i",
"start",
"i",
"{\n count++;\n }",
"count++",
"count",
"min = Math.min(min, count)",
"min",
"Math.min(min, count)",
"Math.min",
"Math",
"min",
"count",
"System.out.println(min)",
"System.out.println",
"System.out",
"System",
"System.out",
"min",
"String[] args",
"args",
"public class Main {\n public static void main(String[] args) {\n try (Scanner sc = new Scanner(System.in)) {\n String S = sc.next();\n String T = sc.next();\n\n int min = (int) 1e9;\n for (int start = 0; start + T.length() <= S.length(); start++) {\n int count = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i) != S.charAt(start + i)) {\n count++;\n }\n }\n min = Math.min(min, count);\n }\n System.out.println(min);\n }\n }\n}",
"public class Main {\n public static void main(String[] args) {\n try (Scanner sc = new Scanner(System.in)) {\n String S = sc.next();\n String T = sc.next();\n\n int min = (int) 1e9;\n for (int start = 0; start + T.length() <= S.length(); start++) {\n int count = 0;\n for (int i = 0; i < T.length(); i++) {\n if (T.charAt(i) != S.charAt(start + i)) {\n count++;\n }\n }\n min = Math.min(min, count);\n }\n System.out.println(min);\n }\n }\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
String S = sc.next();
String T = sc.next();
int min = (int) 1e9;
for (int start = 0; start + T.length() <= S.length(); start++) {
int count = 0;
for (int i = 0; i < T.length(); i++) {
if (T.charAt(i) != S.charAt(start + i)) {
count++;
}
}
min = Math.min(min, count);
}
System.out.println(min);
}
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
2,
13,
4,
18,
13,
4,
18,
13,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
101,
5
],
[
101,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
24,
26
],
[
8,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
29,
31
],
[
27,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
35,
36
],
[
27,
37
],
[
37,
38
],
[
38,
39
],
[
27,
40
],
[
41,
41
],
[
41,
42
],
[
42,
43
],
[
43,
44
],
[
44,
45
],
[
44,
46
],
[
46,
47
],
[
47,
48
],
[
43,
49
],
[
49,
50
],
[
50,
51
],
[
42,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
52,
56
],
[
56,
57
],
[
57,
58
],
[
58,
59
],
[
58,
60
],
[
56,
61
],
[
61,
62
],
[
61,
63
],
[
63,
64
],
[
64,
65
],
[
56,
66
],
[
66,
67
],
[
67,
68
],
[
56,
69
],
[
70,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
74,
75
],
[
73,
76
],
[
76,
77
],
[
76,
78
],
[
72,
79
],
[
79,
80
],
[
80,
81
],
[
79,
82
],
[
71,
83
],
[
83,
84
],
[
52,
85
],
[
85,
86
],
[
85,
87
],
[
87,
88
],
[
88,
89
],
[
87,
90
],
[
87,
91
],
[
8,
92
],
[
92,
93
],
[
93,
94
],
[
94,
95
],
[
94,
96
],
[
92,
97
],
[
6,
98
],
[
98,
99
],
[
0,
100
],
[
100,
101
],
[
100,
102
]
]
| [
"import java.util.*;\npublic class Main\n{\n public static void main(String []args)\n {\n Scanner sc = new Scanner(System.in);\n String s = sc.nextLine();\n String t = sc.nextLine();\n \n int min = Integer.MAX_VALUE;\n for(int i = 0 ; i < s.length() ; i++)\n {\n if(i+t.length() <= s.length())\n {\n int tot = 0;\n for(int j = 0 ; j < t.length(); j++)\n {\n if(s.charAt(i+j) != t.charAt(j))\n tot++;\n }\n min = Math.min(min , tot);\n }\n }\n System.out.println(min);\n }\n }",
"import java.util.*;",
"util.*",
"java",
"public class Main\n{\n public static void main(String []args)\n {\n Scanner sc = new Scanner(System.in);\n String s = sc.nextLine();\n String t = sc.nextLine();\n \n int min = Integer.MAX_VALUE;\n for(int i = 0 ; i < s.length() ; i++)\n {\n if(i+t.length() <= s.length())\n {\n int tot = 0;\n for(int j = 0 ; j < t.length(); j++)\n {\n if(s.charAt(i+j) != t.charAt(j))\n tot++;\n }\n min = Math.min(min , tot);\n }\n }\n System.out.println(min);\n }\n }",
"Main",
"public static void main(String []args)\n {\n Scanner sc = new Scanner(System.in);\n String s = sc.nextLine();\n String t = sc.nextLine();\n \n int min = Integer.MAX_VALUE;\n for(int i = 0 ; i < s.length() ; i++)\n {\n if(i+t.length() <= s.length())\n {\n int tot = 0;\n for(int j = 0 ; j < t.length(); j++)\n {\n if(s.charAt(i+j) != t.charAt(j))\n tot++;\n }\n min = Math.min(min , tot);\n }\n }\n System.out.println(min);\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n String s = sc.nextLine();\n String t = sc.nextLine();\n \n int min = Integer.MAX_VALUE;\n for(int i = 0 ; i < s.length() ; i++)\n {\n if(i+t.length() <= s.length())\n {\n int tot = 0;\n for(int j = 0 ; j < t.length(); j++)\n {\n if(s.charAt(i+j) != t.charAt(j))\n tot++;\n }\n min = Math.min(min , tot);\n }\n }\n System.out.println(min);\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String s = sc.nextLine();",
"s",
"sc.nextLine()",
"sc.nextLine",
"sc",
"String t = sc.nextLine();",
"t",
"sc.nextLine()",
"sc.nextLine",
"sc",
"int min = Integer.MAX_VALUE;",
"min",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"for(int i = 0 ; i < s.length() ; i++)\n {\n if(i+t.length() <= s.length())\n {\n int tot = 0;\n for(int j = 0 ; j < t.length(); j++)\n {\n if(s.charAt(i+j) != t.charAt(j))\n tot++;\n }\n min = Math.min(min , tot);\n }\n }",
"int i = 0 ;",
"int i = 0 ;",
"i",
"0",
"i < s.length()",
"i",
"s.length()",
"s.length",
"s",
"i++",
"i++",
"i",
"{\n if(i+t.length() <= s.length())\n {\n int tot = 0;\n for(int j = 0 ; j < t.length(); j++)\n {\n if(s.charAt(i+j) != t.charAt(j))\n tot++;\n }\n min = Math.min(min , tot);\n }\n }",
"{\n if(i+t.length() <= s.length())\n {\n int tot = 0;\n for(int j = 0 ; j < t.length(); j++)\n {\n if(s.charAt(i+j) != t.charAt(j))\n tot++;\n }\n min = Math.min(min , tot);\n }\n }",
"if(i+t.length() <= s.length())\n {\n int tot = 0;\n for(int j = 0 ; j < t.length(); j++)\n {\n if(s.charAt(i+j) != t.charAt(j))\n tot++;\n }\n min = Math.min(min , tot);\n }",
"i+t.length() <= s.length()",
"i+t.length()",
"i",
"t.length()",
"t.length",
"t",
"s.length()",
"s.length",
"s",
"{\n int tot = 0;\n for(int j = 0 ; j < t.length(); j++)\n {\n if(s.charAt(i+j) != t.charAt(j))\n tot++;\n }\n min = Math.min(min , tot);\n }",
"int tot = 0;",
"tot",
"0",
"for(int j = 0 ; j < t.length(); j++)\n {\n if(s.charAt(i+j) != t.charAt(j))\n tot++;\n }",
"int j = 0 ;",
"int j = 0 ;",
"j",
"0",
"j < t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n if(s.charAt(i+j) != t.charAt(j))\n tot++;\n }",
"{\n if(s.charAt(i+j) != t.charAt(j))\n tot++;\n }",
"if(s.charAt(i+j) != t.charAt(j))\n tot++;",
"s.charAt(i+j) != t.charAt(j)",
"s.charAt(i+j)",
"s.charAt",
"s",
"i+j",
"i",
"j",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"tot++",
"tot",
"min = Math.min(min , tot)",
"min",
"Math.min(min , tot)",
"Math.min",
"Math",
"min",
"tot",
"System.out.println(min)",
"System.out.println",
"System.out",
"System",
"System.out",
"min",
"String []args",
"args",
"public class Main\n{\n public static void main(String []args)\n {\n Scanner sc = new Scanner(System.in);\n String s = sc.nextLine();\n String t = sc.nextLine();\n \n int min = Integer.MAX_VALUE;\n for(int i = 0 ; i < s.length() ; i++)\n {\n if(i+t.length() <= s.length())\n {\n int tot = 0;\n for(int j = 0 ; j < t.length(); j++)\n {\n if(s.charAt(i+j) != t.charAt(j))\n tot++;\n }\n min = Math.min(min , tot);\n }\n }\n System.out.println(min);\n }\n }",
"public class Main\n{\n public static void main(String []args)\n {\n Scanner sc = new Scanner(System.in);\n String s = sc.nextLine();\n String t = sc.nextLine();\n \n int min = Integer.MAX_VALUE;\n for(int i = 0 ; i < s.length() ; i++)\n {\n if(i+t.length() <= s.length())\n {\n int tot = 0;\n for(int j = 0 ; j < t.length(); j++)\n {\n if(s.charAt(i+j) != t.charAt(j))\n tot++;\n }\n min = Math.min(min , tot);\n }\n }\n System.out.println(min);\n }\n }",
"Main"
]
| import java.util.*;
public class Main
{
public static void main(String []args)
{
Scanner sc = new Scanner(System.in);
String s = sc.nextLine();
String t = sc.nextLine();
int min = Integer.MAX_VALUE;
for(int i = 0 ; i < s.length() ; i++)
{
if(i+t.length() <= s.length())
{
int tot = 0;
for(int j = 0 ; j < t.length(); j++)
{
if(s.charAt(i+j) != t.charAt(j))
tot++;
}
min = Math.min(min , tot);
}
}
System.out.println(min);
}
}
|
[
7,
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,
4,
18,
13,
41,
13,
4,
18,
4,
18,
13,
41,
13,
20,
2,
18,
13,
13,
18,
13,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
18,
13,
13,
18,
13,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
14,
2,
18,
13,
2,
13,
13,
18,
13,
13,
30,
40,
13,
14,
2,
13,
13,
30,
0,
13,
13,
4,
18,
13,
13,
4,
18,
18,
13,
13,
2,
18,
13,
13,
13,
23,
13,
6,
13,
41,
13,
17,
41,
13,
17,
12,
13,
30,
0,
13,
20,
0,
13,
17,
23,
13,
12,
13,
30,
14,
2,
2,
13,
17,
40,
4,
18,
13,
30,
38,
5,
13,
30,
37,
20,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
14,
2,
2,
13,
17,
40,
4,
18,
13,
30,
38,
5,
13,
30,
37,
20,
30,
29,
4,
18,
13,
29,
4,
18,
13,
17,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
16,
17
],
[
16,
18
],
[
0,
19
],
[
289,
20
],
[
289,
21
],
[
21,
22
],
[
21,
23
],
[
23,
24
],
[
24,
25
],
[
24,
26
],
[
23,
27
],
[
27,
28
],
[
27,
29
],
[
29,
30
],
[
30,
31
],
[
31,
32
],
[
32,
33
],
[
23,
34
],
[
34,
35
],
[
34,
36
],
[
36,
37
],
[
37,
38
],
[
38,
39
],
[
39,
40
],
[
23,
41
],
[
41,
42
],
[
41,
43
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
44,
48
],
[
48,
49
],
[
48,
50
],
[
23,
51
],
[
51,
52
],
[
51,
53
],
[
23,
54
],
[
54,
55
],
[
55,
56
],
[
56,
57
],
[
56,
58
],
[
54,
59
],
[
59,
60
],
[
59,
61
],
[
61,
62
],
[
62,
63
],
[
62,
64
],
[
61,
65
],
[
65,
66
],
[
65,
67
],
[
54,
68
],
[
68,
69
],
[
69,
70
],
[
54,
71
],
[
72,
72
],
[
72,
73
],
[
73,
74
],
[
73,
75
],
[
72,
76
],
[
76,
77
],
[
77,
78
],
[
78,
79
],
[
78,
80
],
[
76,
81
],
[
81,
82
],
[
81,
83
],
[
83,
84
],
[
83,
85
],
[
76,
86
],
[
86,
87
],
[
87,
88
],
[
76,
89
],
[
90,
90
],
[
90,
91
],
[
91,
92
],
[
92,
93
],
[
93,
94
],
[
93,
95
],
[
95,
96
],
[
95,
97
],
[
92,
98
],
[
98,
99
],
[
98,
100
],
[
91,
101
],
[
101,
102
],
[
102,
103
],
[
72,
104
],
[
104,
105
],
[
105,
106
],
[
105,
107
],
[
104,
108
],
[
108,
109
],
[
109,
110
],
[
109,
111
],
[
23,
112
],
[
112,
113
],
[
113,
114
],
[
112,
115
],
[
23,
116
],
[
116,
117
],
[
117,
118
],
[
118,
119
],
[
118,
120
],
[
116,
121
],
[
121,
122
],
[
122,
123
],
[
122,
124
],
[
121,
125
],
[
21,
126
],
[
126,
127
],
[
289,
128
],
[
128,
129
],
[
128,
130
],
[
130,
131
],
[
130,
132
],
[
128,
133
],
[
133,
134
],
[
133,
135
],
[
128,
136
],
[
136,
137
],
[
136,
138
],
[
138,
139
],
[
139,
140
],
[
139,
141
],
[
138,
142
],
[
142,
143
],
[
142,
144
],
[
136,
145
],
[
145,
146
],
[
128,
147
],
[
147,
148
],
[
147,
149
],
[
149,
150
],
[
150,
151
],
[
151,
152
],
[
152,
153
],
[
152,
154
],
[
151,
155
],
[
155,
156
],
[
156,
157
],
[
157,
158
],
[
150,
159
],
[
159,
160
],
[
160,
161
],
[
161,
162
],
[
161,
163
],
[
163,
164
],
[
164,
165
],
[
160,
166
],
[
166,
167
],
[
167,
168
],
[
167,
169
],
[
149,
170
],
[
170,
171
],
[
171,
172
],
[
172,
173
],
[
128,
174
],
[
174,
175
],
[
174,
176
],
[
176,
177
],
[
177,
178
],
[
178,
179
],
[
179,
180
],
[
179,
181
],
[
178,
182
],
[
182,
183
],
[
183,
184
],
[
184,
185
],
[
177,
186
],
[
186,
187
],
[
187,
188
],
[
188,
189
],
[
188,
190
],
[
190,
191
],
[
191,
192
],
[
187,
193
],
[
193,
194
],
[
194,
195
],
[
195,
196
],
[
196,
197
],
[
176,
198
],
[
198,
199
],
[
199,
200
],
[
200,
201
],
[
199,
202
],
[
128,
203
],
[
203,
204
],
[
203,
205
],
[
205,
206
],
[
206,
207
],
[
207,
208
],
[
208,
209
],
[
207,
210
],
[
210,
211
],
[
128,
212
],
[
212,
213
],
[
212,
214
],
[
214,
215
],
[
215,
216
],
[
216,
217
],
[
217,
218
],
[
216,
219
],
[
219,
220
],
[
128,
221
],
[
221,
222
],
[
221,
223
],
[
223,
224
],
[
224,
225
],
[
225,
226
],
[
226,
227
],
[
225,
228
],
[
228,
229
],
[
128,
230
],
[
230,
231
],
[
230,
232
],
[
232,
233
],
[
233,
234
],
[
233,
235
],
[
232,
237
],
[
237,
238
],
[
238,
239
],
[
239,
240
],
[
239,
241
],
[
237,
242
],
[
242,
243
],
[
242,
244
],
[
237,
245
],
[
245,
246
],
[
246,
247
],
[
237,
248
],
[
248,
249
],
[
249,
250
],
[
250,
251
],
[
250,
252
],
[
249,
253
],
[
253,
254
],
[
232,
255
],
[
255,
256
],
[
230,
257
],
[
257,
258
],
[
128,
259
],
[
259,
260
],
[
259,
261
],
[
261,
262
],
[
262,
263
],
[
262,
264
],
[
261,
266
],
[
266,
267
],
[
267,
268
],
[
268,
269
],
[
268,
270
],
[
266,
271
],
[
271,
272
],
[
271,
273
],
[
266,
274
],
[
274,
275
],
[
275,
276
],
[
266,
277
],
[
277,
278
],
[
278,
279
],
[
279,
280
],
[
279,
281
],
[
278,
282
],
[
282,
283
],
[
261,
284
],
[
284,
285
],
[
259,
286
],
[
286,
287
],
[
0,
288
],
[
288,
289
],
[
288,
290
]
]
| [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner(System.in);\n\t\tchar[] s = sc.next().toCharArray();\n\t\tchar[] ss = sc.next().toCharArray();\n\t\tint[] a = new int[s.length - ss.length];\n\t\tint max = 0;\n\t\tfor(int i = 0; i <= s.length - ss.length; i++) {\n\t\t\tint count = 0;\n\t\t\tfor(int j = 0; j < ss.length; j++) {\n\t\t\t\tif(s[j+i] == ss[j]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(count > max) {\n\t\t\t\tmax = count;\n\t\t\t}\n\t\t}\n\t\tArrays.sort(a);\n\t\tSystem.out.println(ss.length-max);\n\t}\n\n\tstatic class FastScanner {\n\t\tprivate BufferedReader reader = null;\n\t private StringTokenizer tokenizer = null;\n\t public FastScanner(InputStream in) {\n\t reader = new BufferedReader(new InputStreamReader(in));\n\t tokenizer = null;\n\t }\n\n\t public String next() {\n\t if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t try {\n\t tokenizer = new StringTokenizer(reader.readLine());\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t }\n\t return tokenizer.nextToken();\n\t }\n\n\t public String nextLine() {\n\t if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t try {\n\t return reader.readLine();\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t }\n\n\t return tokenizer.nextToken(\"\\n\");\n\t }\n\n\t public long nextLong() {\n\t return Long.parseLong(next());\n\t }\n\n\t public int nextInt() {\n\t return Integer.parseInt(next());\n\t }\n\n\t public double nextDouble() {\n\t return Double.parseDouble(next());\n\t }\n\n\t public int[] nextIntArray(int n) {\n\t int[] a = new int[n];\n\t for (int i = 0; i < n; i++)\n\t a[i] = nextInt();\n\t return a;\n\t }\n\n\t public long[] nextLongArray(int n) {\n\t long[] a = new long[n];\n\t for (int i = 0; i < n; i++)\n\t a[i] = nextLong();\n\t return a;\n\t }\n\t}\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStream;",
"InputStream",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.util.Arrays;",
"Arrays",
"java.util",
"import java.util.StringTokenizer;",
"StringTokenizer",
"java.util",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner(System.in);\n\t\tchar[] s = sc.next().toCharArray();\n\t\tchar[] ss = sc.next().toCharArray();\n\t\tint[] a = new int[s.length - ss.length];\n\t\tint max = 0;\n\t\tfor(int i = 0; i <= s.length - ss.length; i++) {\n\t\t\tint count = 0;\n\t\t\tfor(int j = 0; j < ss.length; j++) {\n\t\t\t\tif(s[j+i] == ss[j]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(count > max) {\n\t\t\t\tmax = count;\n\t\t\t}\n\t\t}\n\t\tArrays.sort(a);\n\t\tSystem.out.println(ss.length-max);\n\t}\n\n\tstatic class FastScanner {\n\t\tprivate BufferedReader reader = null;\n\t private StringTokenizer tokenizer = null;\n\t public FastScanner(InputStream in) {\n\t reader = new BufferedReader(new InputStreamReader(in));\n\t tokenizer = null;\n\t }\n\n\t public String next() {\n\t if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t try {\n\t tokenizer = new StringTokenizer(reader.readLine());\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t }\n\t return tokenizer.nextToken();\n\t }\n\n\t public String nextLine() {\n\t if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t try {\n\t return reader.readLine();\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t }\n\n\t return tokenizer.nextToken(\"\\n\");\n\t }\n\n\t public long nextLong() {\n\t return Long.parseLong(next());\n\t }\n\n\t public int nextInt() {\n\t return Integer.parseInt(next());\n\t }\n\n\t public double nextDouble() {\n\t return Double.parseDouble(next());\n\t }\n\n\t public int[] nextIntArray(int n) {\n\t int[] a = new int[n];\n\t for (int i = 0; i < n; i++)\n\t a[i] = nextInt();\n\t return a;\n\t }\n\n\t public long[] nextLongArray(int n) {\n\t long[] a = new long[n];\n\t for (int i = 0; i < n; i++)\n\t a[i] = nextLong();\n\t return a;\n\t }\n\t}\n}",
"Main",
"public static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner(System.in);\n\t\tchar[] s = sc.next().toCharArray();\n\t\tchar[] ss = sc.next().toCharArray();\n\t\tint[] a = new int[s.length - ss.length];\n\t\tint max = 0;\n\t\tfor(int i = 0; i <= s.length - ss.length; i++) {\n\t\t\tint count = 0;\n\t\t\tfor(int j = 0; j < ss.length; j++) {\n\t\t\t\tif(s[j+i] == ss[j]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(count > max) {\n\t\t\t\tmax = count;\n\t\t\t}\n\t\t}\n\t\tArrays.sort(a);\n\t\tSystem.out.println(ss.length-max);\n\t}",
"main",
"{\n\t\tFastScanner sc = new FastScanner(System.in);\n\t\tchar[] s = sc.next().toCharArray();\n\t\tchar[] ss = sc.next().toCharArray();\n\t\tint[] a = new int[s.length - ss.length];\n\t\tint max = 0;\n\t\tfor(int i = 0; i <= s.length - ss.length; i++) {\n\t\t\tint count = 0;\n\t\t\tfor(int j = 0; j < ss.length; j++) {\n\t\t\t\tif(s[j+i] == ss[j]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(count > max) {\n\t\t\t\tmax = count;\n\t\t\t}\n\t\t}\n\t\tArrays.sort(a);\n\t\tSystem.out.println(ss.length-max);\n\t}",
"FastScanner sc = new FastScanner(System.in);",
"sc",
"new FastScanner(System.in)",
"char[] s = sc.next().toCharArray();",
"s",
"sc.next().toCharArray()",
"sc.next().toCharArray",
"sc.next()",
"sc.next",
"sc",
"char[] ss = sc.next().toCharArray();",
"ss",
"sc.next().toCharArray()",
"sc.next().toCharArray",
"sc.next()",
"sc.next",
"sc",
"int[] a = new int[s.length - ss.length];",
"a",
"new int[s.length - ss.length]",
"s.length - ss.length",
"s.length",
"s",
"s.length",
"ss.length",
"ss",
"ss.length",
"int max = 0;",
"max",
"0",
"for(int i = 0; i <= s.length - ss.length; i++) {\n\t\t\tint count = 0;\n\t\t\tfor(int j = 0; j < ss.length; j++) {\n\t\t\t\tif(s[j+i] == ss[j]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(count > max) {\n\t\t\t\tmax = count;\n\t\t\t}\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= s.length - ss.length",
"i",
"s.length - ss.length",
"s.length",
"s",
"s.length",
"ss.length",
"ss",
"ss.length",
"i++",
"i++",
"i",
"{\n\t\t\tint count = 0;\n\t\t\tfor(int j = 0; j < ss.length; j++) {\n\t\t\t\tif(s[j+i] == ss[j]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(count > max) {\n\t\t\t\tmax = count;\n\t\t\t}\n\t\t}",
"{\n\t\t\tint count = 0;\n\t\t\tfor(int j = 0; j < ss.length; j++) {\n\t\t\t\tif(s[j+i] == ss[j]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(count > max) {\n\t\t\t\tmax = count;\n\t\t\t}\n\t\t}",
"int count = 0;",
"count",
"0",
"for(int j = 0; j < ss.length; j++) {\n\t\t\t\tif(s[j+i] == ss[j]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < ss.length",
"j",
"ss.length",
"ss",
"ss.length",
"j++",
"j++",
"j",
"{\n\t\t\t\tif(s[j+i] == ss[j]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}",
"{\n\t\t\t\tif(s[j+i] == ss[j]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}",
"if(s[j+i] == ss[j]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}",
"s[j+i] == ss[j]",
"s[j+i]",
"s",
"j+i",
"j",
"i",
"ss[j]",
"ss",
"j",
"{\n\t\t\t\t\tcount++;\n\t\t\t\t}",
"count++",
"count",
"if(count > max) {\n\t\t\t\tmax = count;\n\t\t\t}",
"count > max",
"count",
"max",
"{\n\t\t\t\tmax = count;\n\t\t\t}",
"max = count",
"max",
"count",
"Arrays.sort(a)",
"Arrays.sort",
"Arrays",
"a",
"System.out.println(ss.length-max)",
"System.out.println",
"System.out",
"System",
"System.out",
"ss.length-max",
"ss.length",
"ss",
"ss.length",
"max",
"String[] args",
"args",
"static class FastScanner {\n\t\tprivate BufferedReader reader = null;\n\t private StringTokenizer tokenizer = null;\n\t public FastScanner(InputStream in) {\n\t reader = new BufferedReader(new InputStreamReader(in));\n\t tokenizer = null;\n\t }\n\n\t public String next() {\n\t if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t try {\n\t tokenizer = new StringTokenizer(reader.readLine());\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t }\n\t return tokenizer.nextToken();\n\t }\n\n\t public String nextLine() {\n\t if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t try {\n\t return reader.readLine();\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t }\n\n\t return tokenizer.nextToken(\"\\n\");\n\t }\n\n\t public long nextLong() {\n\t return Long.parseLong(next());\n\t }\n\n\t public int nextInt() {\n\t return Integer.parseInt(next());\n\t }\n\n\t public double nextDouble() {\n\t return Double.parseDouble(next());\n\t }\n\n\t public int[] nextIntArray(int n) {\n\t int[] a = new int[n];\n\t for (int i = 0; i < n; i++)\n\t a[i] = nextInt();\n\t return a;\n\t }\n\n\t public long[] nextLongArray(int n) {\n\t long[] a = new long[n];\n\t for (int i = 0; i < n; i++)\n\t a[i] = nextLong();\n\t return a;\n\t }\n\t}",
"FastScanner",
"private BufferedReader reader = null;",
"reader",
"null",
"private StringTokenizer tokenizer = null;",
"tokenizer",
"null",
"public FastScanner(InputStream in) {\n\t reader = new BufferedReader(new InputStreamReader(in));\n\t tokenizer = null;\n\t }",
"FastScanner",
"{\n\t reader = new BufferedReader(new InputStreamReader(in));\n\t tokenizer = null;\n\t }",
"reader = new BufferedReader(new InputStreamReader(in))",
"reader",
"new BufferedReader(new InputStreamReader(in))",
"tokenizer = null",
"tokenizer",
"null",
"InputStream in",
"in",
"public String next() {\n\t if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t try {\n\t tokenizer = new StringTokenizer(reader.readLine());\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t }\n\t return tokenizer.nextToken();\n\t }",
"next",
"{\n\t if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t try {\n\t tokenizer = new StringTokenizer(reader.readLine());\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t }\n\t return tokenizer.nextToken();\n\t }",
"if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t try {\n\t tokenizer = new StringTokenizer(reader.readLine());\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t }",
"tokenizer == null || !tokenizer.hasMoreTokens()",
"tokenizer == null",
"tokenizer",
"null",
"!tokenizer.hasMoreTokens()",
"tokenizer.hasMoreTokens()",
"tokenizer.hasMoreTokens",
"tokenizer",
"{\n\t try {\n\t tokenizer = new StringTokenizer(reader.readLine());\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t }",
"try {\n\t tokenizer = new StringTokenizer(reader.readLine());\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }",
"catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }",
"IOException e",
"{\n\t throw new RuntimeException(e);\n\t }",
"throw new RuntimeException(e);",
"new RuntimeException(e)",
"{\n\t tokenizer = new StringTokenizer(reader.readLine());\n\t }",
"tokenizer = new StringTokenizer(reader.readLine())",
"tokenizer",
"new StringTokenizer(reader.readLine())",
"return tokenizer.nextToken();",
"tokenizer.nextToken()",
"tokenizer.nextToken",
"tokenizer",
"public String nextLine() {\n\t if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t try {\n\t return reader.readLine();\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t }\n\n\t return tokenizer.nextToken(\"\\n\");\n\t }",
"nextLine",
"{\n\t if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t try {\n\t return reader.readLine();\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t }\n\n\t return tokenizer.nextToken(\"\\n\");\n\t }",
"if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t try {\n\t return reader.readLine();\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t }",
"tokenizer == null || !tokenizer.hasMoreTokens()",
"tokenizer == null",
"tokenizer",
"null",
"!tokenizer.hasMoreTokens()",
"tokenizer.hasMoreTokens()",
"tokenizer.hasMoreTokens",
"tokenizer",
"{\n\t try {\n\t return reader.readLine();\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t }",
"try {\n\t return reader.readLine();\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }",
"catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }",
"IOException e",
"{\n\t throw new RuntimeException(e);\n\t }",
"throw new RuntimeException(e);",
"new RuntimeException(e)",
"{\n\t return reader.readLine();\n\t }",
"return reader.readLine();",
"reader.readLine()",
"reader.readLine",
"reader",
"return tokenizer.nextToken(\"\\n\");",
"tokenizer.nextToken(\"\\n\")",
"tokenizer.nextToken",
"tokenizer",
"\"\\n\"",
"public long nextLong() {\n\t return Long.parseLong(next());\n\t }",
"nextLong",
"{\n\t return Long.parseLong(next());\n\t }",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"public int nextInt() {\n\t return Integer.parseInt(next());\n\t }",
"nextInt",
"{\n\t return Integer.parseInt(next());\n\t }",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"public double nextDouble() {\n\t return Double.parseDouble(next());\n\t }",
"nextDouble",
"{\n\t return Double.parseDouble(next());\n\t }",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"public int[] nextIntArray(int n) {\n\t int[] a = new int[n];\n\t for (int i = 0; i < n; i++)\n\t a[i] = nextInt();\n\t return a;\n\t }",
"nextIntArray",
"{\n\t int[] a = new int[n];\n\t for (int i = 0; i < n; i++)\n\t a[i] = nextInt();\n\t return a;\n\t }",
"int[] a = new int[n];",
"a",
"new int[n]",
"n",
"for (int i = 0; i < n; i++)\n\t a[i] = nextInt();",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"a[i] = nextInt();",
"a[i] = nextInt()",
"a[i]",
"a",
"i",
"nextInt()",
"nextInt",
"return a;",
"a",
"int n",
"n",
"public long[] nextLongArray(int n) {\n\t long[] a = new long[n];\n\t for (int i = 0; i < n; i++)\n\t a[i] = nextLong();\n\t return a;\n\t }",
"nextLongArray",
"{\n\t long[] a = new long[n];\n\t for (int i = 0; i < n; i++)\n\t a[i] = nextLong();\n\t return a;\n\t }",
"long[] a = new long[n];",
"a",
"new long[n]",
"n",
"for (int i = 0; i < n; i++)\n\t a[i] = nextLong();",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"i++",
"i++",
"i",
"a[i] = nextLong();",
"a[i] = nextLong()",
"a[i]",
"a",
"i",
"nextLong()",
"nextLong",
"return a;",
"a",
"int n",
"n",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner(System.in);\n\t\tchar[] s = sc.next().toCharArray();\n\t\tchar[] ss = sc.next().toCharArray();\n\t\tint[] a = new int[s.length - ss.length];\n\t\tint max = 0;\n\t\tfor(int i = 0; i <= s.length - ss.length; i++) {\n\t\t\tint count = 0;\n\t\t\tfor(int j = 0; j < ss.length; j++) {\n\t\t\t\tif(s[j+i] == ss[j]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(count > max) {\n\t\t\t\tmax = count;\n\t\t\t}\n\t\t}\n\t\tArrays.sort(a);\n\t\tSystem.out.println(ss.length-max);\n\t}\n\n\tstatic class FastScanner {\n\t\tprivate BufferedReader reader = null;\n\t private StringTokenizer tokenizer = null;\n\t public FastScanner(InputStream in) {\n\t reader = new BufferedReader(new InputStreamReader(in));\n\t tokenizer = null;\n\t }\n\n\t public String next() {\n\t if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t try {\n\t tokenizer = new StringTokenizer(reader.readLine());\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t }\n\t return tokenizer.nextToken();\n\t }\n\n\t public String nextLine() {\n\t if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t try {\n\t return reader.readLine();\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t }\n\n\t return tokenizer.nextToken(\"\\n\");\n\t }\n\n\t public long nextLong() {\n\t return Long.parseLong(next());\n\t }\n\n\t public int nextInt() {\n\t return Integer.parseInt(next());\n\t }\n\n\t public double nextDouble() {\n\t return Double.parseDouble(next());\n\t }\n\n\t public int[] nextIntArray(int n) {\n\t int[] a = new int[n];\n\t for (int i = 0; i < n; i++)\n\t a[i] = nextInt();\n\t return a;\n\t }\n\n\t public long[] nextLongArray(int n) {\n\t long[] a = new long[n];\n\t for (int i = 0; i < n; i++)\n\t a[i] = nextLong();\n\t return a;\n\t }\n\t}\n}",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner(System.in);\n\t\tchar[] s = sc.next().toCharArray();\n\t\tchar[] ss = sc.next().toCharArray();\n\t\tint[] a = new int[s.length - ss.length];\n\t\tint max = 0;\n\t\tfor(int i = 0; i <= s.length - ss.length; i++) {\n\t\t\tint count = 0;\n\t\t\tfor(int j = 0; j < ss.length; j++) {\n\t\t\t\tif(s[j+i] == ss[j]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(count > max) {\n\t\t\t\tmax = count;\n\t\t\t}\n\t\t}\n\t\tArrays.sort(a);\n\t\tSystem.out.println(ss.length-max);\n\t}\n\n\tstatic class FastScanner {\n\t\tprivate BufferedReader reader = null;\n\t private StringTokenizer tokenizer = null;\n\t public FastScanner(InputStream in) {\n\t reader = new BufferedReader(new InputStreamReader(in));\n\t tokenizer = null;\n\t }\n\n\t public String next() {\n\t if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t try {\n\t tokenizer = new StringTokenizer(reader.readLine());\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t }\n\t return tokenizer.nextToken();\n\t }\n\n\t public String nextLine() {\n\t if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t try {\n\t return reader.readLine();\n\t } catch (IOException e) {\n\t throw new RuntimeException(e);\n\t }\n\t }\n\n\t return tokenizer.nextToken(\"\\n\");\n\t }\n\n\t public long nextLong() {\n\t return Long.parseLong(next());\n\t }\n\n\t public int nextInt() {\n\t return Integer.parseInt(next());\n\t }\n\n\t public double nextDouble() {\n\t return Double.parseDouble(next());\n\t }\n\n\t public int[] nextIntArray(int n) {\n\t int[] a = new int[n];\n\t for (int i = 0; i < n; i++)\n\t a[i] = nextInt();\n\t return a;\n\t }\n\n\t public long[] nextLongArray(int n) {\n\t long[] a = new long[n];\n\t for (int i = 0; i < n; i++)\n\t a[i] = nextLong();\n\t return a;\n\t }\n\t}\n}",
"Main"
]
| import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) {
FastScanner sc = new FastScanner(System.in);
char[] s = sc.next().toCharArray();
char[] ss = sc.next().toCharArray();
int[] a = new int[s.length - ss.length];
int max = 0;
for(int i = 0; i <= s.length - ss.length; i++) {
int count = 0;
for(int j = 0; j < ss.length; j++) {
if(s[j+i] == ss[j]) {
count++;
}
}
if(count > max) {
max = count;
}
}
Arrays.sort(a);
System.out.println(ss.length-max);
}
static class FastScanner {
private BufferedReader reader = null;
private StringTokenizer tokenizer = null;
public FastScanner(InputStream in) {
reader = new BufferedReader(new InputStreamReader(in));
tokenizer = null;
}
public String next() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public String nextLine() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
return reader.readLine();
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken("\n");
}
public long nextLong() {
return Long.parseLong(next());
}
public int nextInt() {
return Integer.parseInt(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = nextInt();
return a;
}
public long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = nextLong();
return a;
}
}
}
|
[
7,
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,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
13,
4,
18,
13,
13,
40,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
13,
2,
4,
18,
13,
13,
12,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
0,
13,
20,
4,
13,
4,
18,
13,
12,
13,
30,
0,
13,
20,
0,
13,
20,
4,
13,
4,
18,
13,
12,
13,
30,
4,
18,
20,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
23,
13,
12,
13,
30,
0,
13,
20,
23,
13,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
41,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
14,
2,
13,
17,
29,
17,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
41,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
14,
2,
13,
17,
29,
17,
0,
13,
20,
29,
17,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
29,
13,
23,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
29,
13,
23,
13,
12,
13,
30,
29,
20,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
29,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
383,
11
],
[
383,
12
],
[
12,
13
],
[
383,
14
],
[
14,
15
],
[
383,
16
],
[
16,
17
],
[
16,
18
],
[
18,
19
],
[
19,
20
],
[
19,
21
],
[
21,
22
],
[
22,
23
],
[
18,
24
],
[
24,
25
],
[
24,
26
],
[
26,
27
],
[
27,
28
],
[
18,
29
],
[
29,
30
],
[
29,
31
],
[
18,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
34,
36
],
[
32,
37
],
[
37,
38
],
[
37,
39
],
[
39,
40
],
[
40,
41
],
[
41,
42
],
[
39,
43
],
[
43,
44
],
[
44,
45
],
[
32,
46
],
[
46,
47
],
[
47,
48
],
[
32,
49
],
[
50,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
50,
54
],
[
54,
55
],
[
54,
56
],
[
50,
57
],
[
57,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
57,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
65,
66
],
[
57,
67
],
[
67,
68
],
[
68,
69
],
[
57,
70
],
[
71,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
74,
75
],
[
75,
76
],
[
74,
77
],
[
73,
78
],
[
78,
79
],
[
79,
80
],
[
78,
81
],
[
72,
82
],
[
82,
83
],
[
71,
84
],
[
84,
85
],
[
50,
86
],
[
86,
87
],
[
86,
88
],
[
88,
89
],
[
89,
90
],
[
88,
91
],
[
88,
92
],
[
18,
93
],
[
93,
94
],
[
94,
95
],
[
93,
96
],
[
96,
97
],
[
97,
98
],
[
98,
99
],
[
96,
100
],
[
383,
101
],
[
101,
102
],
[
101,
103
],
[
103,
104
],
[
104,
105
],
[
105,
106
],
[
105,
107
],
[
107,
108
],
[
108,
109
],
[
109,
110
],
[
104,
111
],
[
111,
112
],
[
112,
113
],
[
112,
114
],
[
111,
115
],
[
115,
116
],
[
115,
117
],
[
111,
118
],
[
118,
119
],
[
111,
120
],
[
120,
121
],
[
121,
122
],
[
383,
123
],
[
123,
124
],
[
123,
125
],
[
125,
126
],
[
126,
127
],
[
126,
128
],
[
125,
129
],
[
129,
130
],
[
129,
131
],
[
125,
132
],
[
132,
133
],
[
125,
134
],
[
134,
135
],
[
135,
136
],
[
383,
137
],
[
137,
138
],
[
137,
139
],
[
139,
140
],
[
140,
141
],
[
141,
142
],
[
137,
143
],
[
143,
144
],
[
383,
145
],
[
145,
146
],
[
145,
147
],
[
147,
148
],
[
145,
149
],
[
149,
150
],
[
145,
151
],
[
151,
152
],
[
151,
153
],
[
153,
154
],
[
154,
155
],
[
155,
156
],
[
155,
157
],
[
157,
158
],
[
158,
159
],
[
159,
160
],
[
154,
161
],
[
161,
162
],
[
162,
163
],
[
162,
164
],
[
151,
165
],
[
165,
166
],
[
145,
167
],
[
167,
168
],
[
167,
169
],
[
169,
170
],
[
170,
171
],
[
170,
172
],
[
167,
173
],
[
173,
174
],
[
145,
175
],
[
175,
176
],
[
175,
177
],
[
177,
178
],
[
178,
179
],
[
179,
180
],
[
180,
181
],
[
180,
182
],
[
179,
183
],
[
183,
184
],
[
184,
185
],
[
185,
186
],
[
178,
187
],
[
187,
188
],
[
188,
189
],
[
188,
190
],
[
187,
191
],
[
191,
192
],
[
192,
193
],
[
192,
194
],
[
194,
195
],
[
195,
196
],
[
196,
197
],
[
191,
198
],
[
198,
199
],
[
199,
200
],
[
199,
201
],
[
201,
202
],
[
202,
203
],
[
187,
204
],
[
204,
205
],
[
205,
206
],
[
205,
207
],
[
204,
208
],
[
208,
209
],
[
187,
210
],
[
210,
211
],
[
210,
212
],
[
177,
213
],
[
213,
214
],
[
214,
215
],
[
215,
216
],
[
145,
217
],
[
217,
218
],
[
217,
219
],
[
219,
220
],
[
220,
221
],
[
221,
222
],
[
222,
223
],
[
222,
224
],
[
221,
225
],
[
225,
226
],
[
226,
227
],
[
227,
228
],
[
220,
229
],
[
229,
230
],
[
230,
231
],
[
230,
232
],
[
229,
233
],
[
233,
234
],
[
234,
235
],
[
234,
236
],
[
236,
237
],
[
237,
238
],
[
238,
239
],
[
233,
240
],
[
240,
241
],
[
241,
242
],
[
241,
243
],
[
243,
244
],
[
244,
245
],
[
229,
246
],
[
246,
247
],
[
247,
248
],
[
247,
249
],
[
246,
250
],
[
250,
251
],
[
229,
252
],
[
252,
253
],
[
252,
254
],
[
219,
255
],
[
255,
256
],
[
145,
257
],
[
257,
258
],
[
257,
259
],
[
259,
260
],
[
260,
261
],
[
261,
262
],
[
262,
263
],
[
261,
264
],
[
264,
265
],
[
145,
266
],
[
266,
267
],
[
266,
268
],
[
268,
269
],
[
269,
270
],
[
269,
271
],
[
268,
273
],
[
273,
274
],
[
274,
275
],
[
275,
276
],
[
275,
277
],
[
273,
278
],
[
278,
279
],
[
278,
280
],
[
273,
281
],
[
281,
282
],
[
282,
283
],
[
273,
284
],
[
285,
285
],
[
285,
286
],
[
286,
287
],
[
287,
288
],
[
287,
289
],
[
286,
290
],
[
290,
291
],
[
291,
292
],
[
268,
293
],
[
293,
294
],
[
266,
295
],
[
295,
296
],
[
145,
297
],
[
297,
298
],
[
297,
299
],
[
299,
300
],
[
300,
301
],
[
301,
302
],
[
302,
303
],
[
301,
304
],
[
304,
305
],
[
145,
306
],
[
306,
307
],
[
306,
308
],
[
308,
309
],
[
309,
310
],
[
309,
311
],
[
308,
313
],
[
313,
314
],
[
314,
315
],
[
315,
316
],
[
315,
317
],
[
313,
318
],
[
318,
319
],
[
318,
320
],
[
313,
321
],
[
321,
322
],
[
322,
323
],
[
313,
324
],
[
325,
325
],
[
325,
326
],
[
326,
327
],
[
327,
328
],
[
327,
329
],
[
326,
330
],
[
330,
331
],
[
331,
332
],
[
308,
333
],
[
333,
334
],
[
306,
335
],
[
335,
336
],
[
145,
337
],
[
337,
338
],
[
337,
339
],
[
339,
340
],
[
340,
341
],
[
145,
342
],
[
342,
343
],
[
342,
344
],
[
344,
345
],
[
345,
346
],
[
346,
347
],
[
347,
348
],
[
346,
349
],
[
349,
350
],
[
145,
351
],
[
351,
352
],
[
351,
353
],
[
353,
354
],
[
354,
355
],
[
354,
356
],
[
353,
358
],
[
358,
359
],
[
359,
360
],
[
360,
361
],
[
360,
362
],
[
358,
363
],
[
363,
364
],
[
363,
365
],
[
358,
366
],
[
366,
367
],
[
367,
368
],
[
358,
369
],
[
370,
370
],
[
370,
371
],
[
371,
372
],
[
372,
373
],
[
372,
374
],
[
371,
375
],
[
375,
376
],
[
376,
377
],
[
353,
378
],
[
378,
379
],
[
351,
380
],
[
380,
381
],
[
0,
382
],
[
382,
383
],
[
382,
384
]
]
| [
"import java.io.*;\nimport java.math.*;\nimport java.util.*;\n\npublic class Main {\n FastScanner sc;\n PrintWriter p;\n\n void solve() {\n String s = sc.next();\n String t = sc.next();\n int max = 0;\n for(int i = 0; i <= s.length() - t.length(); i++) {\n int p = i;\n int count = 0;\n for(int j = 0; j < t.length(); j++) {\n if(s.charAt(p) == t.charAt(j))\n count++;\n p++;\n }\n max = Math.max(max, count);\n }\n\n p.println(t.length() - max);\n }\n\n void run() {\n try {\n sc = new FastScanner(new File(\"Substring.in\"));\n p = new PrintWriter(new File(\"Substring.out\"));\n\n solve();\n\n p.close();\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n void runIO() {\n\n sc = new FastScanner(System.in);\n p = new PrintWriter(System.out);\n\n solve();\n\n p.close();\n }\n\n class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public FastScanner(File f) {\n try {\n br = new BufferedReader(new FileReader(f));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n public FastScanner(InputStream f) {\n br = new BufferedReader(new InputStreamReader(f));\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return null;\n st = new StringTokenizer(s);\n }\n return st.nextToken();\n }\n\n boolean hasMoreTokens() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return false;\n st = new StringTokenizer(s);\n }\n return true;\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n int[] nextIntArray(int N) {\n int[] A = new int[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextInt();\n }\n return A;\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n long[] nextLongArray(int N) {\n long[] A = new long[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextLong();\n }\n return A;\n }\n\n BigInteger nextBigInteger() {\n return new BigInteger(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n double[] nextDoubleArray(int N) {\n double[] A = new double[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextDouble();\n }\n return A;\n }\n\n }\n\n public static void main(String[] args) {\n new Main().runIO();\n }\n}\n\n",
"import java.io.*;",
"io.*",
"java",
"import java.math.*;",
"math.*",
"java",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n FastScanner sc;\n PrintWriter p;\n\n void solve() {\n String s = sc.next();\n String t = sc.next();\n int max = 0;\n for(int i = 0; i <= s.length() - t.length(); i++) {\n int p = i;\n int count = 0;\n for(int j = 0; j < t.length(); j++) {\n if(s.charAt(p) == t.charAt(j))\n count++;\n p++;\n }\n max = Math.max(max, count);\n }\n\n p.println(t.length() - max);\n }\n\n void run() {\n try {\n sc = new FastScanner(new File(\"Substring.in\"));\n p = new PrintWriter(new File(\"Substring.out\"));\n\n solve();\n\n p.close();\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n void runIO() {\n\n sc = new FastScanner(System.in);\n p = new PrintWriter(System.out);\n\n solve();\n\n p.close();\n }\n\n class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public FastScanner(File f) {\n try {\n br = new BufferedReader(new FileReader(f));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n public FastScanner(InputStream f) {\n br = new BufferedReader(new InputStreamReader(f));\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return null;\n st = new StringTokenizer(s);\n }\n return st.nextToken();\n }\n\n boolean hasMoreTokens() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return false;\n st = new StringTokenizer(s);\n }\n return true;\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n int[] nextIntArray(int N) {\n int[] A = new int[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextInt();\n }\n return A;\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n long[] nextLongArray(int N) {\n long[] A = new long[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextLong();\n }\n return A;\n }\n\n BigInteger nextBigInteger() {\n return new BigInteger(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n double[] nextDoubleArray(int N) {\n double[] A = new double[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextDouble();\n }\n return A;\n }\n\n }\n\n public static void main(String[] args) {\n new Main().runIO();\n }\n}",
"Main",
"FastScanner sc;",
"sc",
"PrintWriter p;",
"p",
"void solve() {\n String s = sc.next();\n String t = sc.next();\n int max = 0;\n for(int i = 0; i <= s.length() - t.length(); i++) {\n int p = i;\n int count = 0;\n for(int j = 0; j < t.length(); j++) {\n if(s.charAt(p) == t.charAt(j))\n count++;\n p++;\n }\n max = Math.max(max, count);\n }\n\n p.println(t.length() - max);\n }",
"solve",
"{\n String s = sc.next();\n String t = sc.next();\n int max = 0;\n for(int i = 0; i <= s.length() - t.length(); i++) {\n int p = i;\n int count = 0;\n for(int j = 0; j < t.length(); j++) {\n if(s.charAt(p) == t.charAt(j))\n count++;\n p++;\n }\n max = Math.max(max, count);\n }\n\n p.println(t.length() - max);\n }",
"String s = sc.next();",
"s",
"sc.next()",
"sc.next",
"sc",
"String t = sc.next();",
"t",
"sc.next()",
"sc.next",
"sc",
"int max = 0;",
"max",
"0",
"for(int i = 0; i <= s.length() - t.length(); i++) {\n int p = i;\n int count = 0;\n for(int j = 0; j < t.length(); j++) {\n if(s.charAt(p) == t.charAt(j))\n count++;\n p++;\n }\n max = Math.max(max, count);\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i <= s.length() - t.length()",
"i",
"s.length() - t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"i++",
"i++",
"i",
"{\n int p = i;\n int count = 0;\n for(int j = 0; j < t.length(); j++) {\n if(s.charAt(p) == t.charAt(j))\n count++;\n p++;\n }\n max = Math.max(max, count);\n }",
"{\n int p = i;\n int count = 0;\n for(int j = 0; j < t.length(); j++) {\n if(s.charAt(p) == t.charAt(j))\n count++;\n p++;\n }\n max = Math.max(max, count);\n }",
"int p = i;",
"p",
"i",
"int count = 0;",
"count",
"0",
"for(int j = 0; j < t.length(); j++) {\n if(s.charAt(p) == t.charAt(j))\n count++;\n p++;\n }",
"int j = 0;",
"int j = 0;",
"j",
"0",
"j < t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n if(s.charAt(p) == t.charAt(j))\n count++;\n p++;\n }",
"{\n if(s.charAt(p) == t.charAt(j))\n count++;\n p++;\n }",
"if(s.charAt(p) == t.charAt(j))\n count++;",
"s.charAt(p) == t.charAt(j)",
"s.charAt(p)",
"s.charAt",
"s",
"p",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"count++",
"count",
"p++",
"p",
"max = Math.max(max, count)",
"max",
"Math.max(max, count)",
"Math.max",
"Math",
"max",
"count",
"p.println(t.length() - max)",
"p.println",
"p",
"t.length() - max",
"t.length()",
"t.length",
"t",
"max",
"void run() {\n try {\n sc = new FastScanner(new File(\"Substring.in\"));\n p = new PrintWriter(new File(\"Substring.out\"));\n\n solve();\n\n p.close();\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }",
"run",
"{\n try {\n sc = new FastScanner(new File(\"Substring.in\"));\n p = new PrintWriter(new File(\"Substring.out\"));\n\n solve();\n\n p.close();\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }",
"try {\n sc = new FastScanner(new File(\"Substring.in\"));\n p = new PrintWriter(new File(\"Substring.out\"));\n\n solve();\n\n p.close();\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }",
"catch (FileNotFoundException e) {\n e.printStackTrace();\n }",
"FileNotFoundException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n sc = new FastScanner(new File(\"Substring.in\"));\n p = new PrintWriter(new File(\"Substring.out\"));\n\n solve();\n\n p.close();\n }",
"sc = new FastScanner(new File(\"Substring.in\"))",
"sc",
"new FastScanner(new File(\"Substring.in\"))",
"p = new PrintWriter(new File(\"Substring.out\"))",
"p",
"new PrintWriter(new File(\"Substring.out\"))",
"solve()",
"solve",
"p.close()",
"p.close",
"p",
"void runIO() {\n\n sc = new FastScanner(System.in);\n p = new PrintWriter(System.out);\n\n solve();\n\n p.close();\n }",
"runIO",
"{\n\n sc = new FastScanner(System.in);\n p = new PrintWriter(System.out);\n\n solve();\n\n p.close();\n }",
"sc = new FastScanner(System.in)",
"sc",
"new FastScanner(System.in)",
"p = new PrintWriter(System.out)",
"p",
"new PrintWriter(System.out)",
"solve()",
"solve",
"p.close()",
"p.close",
"p",
"public static void main(String[] args) {\n new Main().runIO();\n }",
"main",
"{\n new Main().runIO();\n }",
"new Main().runIO()",
"new Main().runIO",
"new Main()",
"String[] args",
"args",
"class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public FastScanner(File f) {\n try {\n br = new BufferedReader(new FileReader(f));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n public FastScanner(InputStream f) {\n br = new BufferedReader(new InputStreamReader(f));\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return null;\n st = new StringTokenizer(s);\n }\n return st.nextToken();\n }\n\n boolean hasMoreTokens() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return false;\n st = new StringTokenizer(s);\n }\n return true;\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n int[] nextIntArray(int N) {\n int[] A = new int[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextInt();\n }\n return A;\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n long[] nextLongArray(int N) {\n long[] A = new long[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextLong();\n }\n return A;\n }\n\n BigInteger nextBigInteger() {\n return new BigInteger(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n double[] nextDoubleArray(int N) {\n double[] A = new double[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextDouble();\n }\n return A;\n }\n\n }",
"FastScanner",
"BufferedReader br;",
"br",
"StringTokenizer st;",
"st",
"public FastScanner(File f) {\n try {\n br = new BufferedReader(new FileReader(f));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }",
"FastScanner",
"{\n try {\n br = new BufferedReader(new FileReader(f));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }",
"try {\n br = new BufferedReader(new FileReader(f));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }",
"catch (FileNotFoundException e) {\n e.printStackTrace();\n }",
"FileNotFoundException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n br = new BufferedReader(new FileReader(f));\n }",
"br = new BufferedReader(new FileReader(f))",
"br",
"new BufferedReader(new FileReader(f))",
"File f",
"f",
"public FastScanner(InputStream f) {\n br = new BufferedReader(new InputStreamReader(f));\n }",
"FastScanner",
"{\n br = new BufferedReader(new InputStreamReader(f));\n }",
"br = new BufferedReader(new InputStreamReader(f))",
"br",
"new BufferedReader(new InputStreamReader(f))",
"InputStream f",
"f",
"String next() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return null;\n st = new StringTokenizer(s);\n }\n return st.nextToken();\n }",
"next",
"{\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return null;\n st = new StringTokenizer(s);\n }\n return st.nextToken();\n }",
"while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return null;\n st = new StringTokenizer(s);\n }",
"st == null || !st.hasMoreTokens()",
"st == null",
"st",
"null",
"!st.hasMoreTokens()",
"st.hasMoreTokens()",
"st.hasMoreTokens",
"st",
"{\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return null;\n st = new StringTokenizer(s);\n }",
"String s = null;",
"s",
"null",
"try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }",
"catch (IOException e) {\n e.printStackTrace();\n }",
"IOException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n s = br.readLine();\n }",
"s = br.readLine()",
"s",
"br.readLine()",
"br.readLine",
"br",
"if (s == null)\n return null;",
"s == null",
"s",
"null",
"return null;",
"null",
"st = new StringTokenizer(s)",
"st",
"new StringTokenizer(s)",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"boolean hasMoreTokens() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return false;\n st = new StringTokenizer(s);\n }\n return true;\n }",
"hasMoreTokens",
"{\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return false;\n st = new StringTokenizer(s);\n }\n return true;\n }",
"while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return false;\n st = new StringTokenizer(s);\n }",
"st == null || !st.hasMoreTokens()",
"st == null",
"st",
"null",
"!st.hasMoreTokens()",
"st.hasMoreTokens()",
"st.hasMoreTokens",
"st",
"{\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return false;\n st = new StringTokenizer(s);\n }",
"String s = null;",
"s",
"null",
"try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }",
"catch (IOException e) {\n e.printStackTrace();\n }",
"IOException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n s = br.readLine();\n }",
"s = br.readLine()",
"s",
"br.readLine()",
"br.readLine",
"br",
"if (s == null)\n return false;",
"s == null",
"s",
"null",
"return false;",
"false",
"st = new StringTokenizer(s)",
"st",
"new StringTokenizer(s)",
"return true;",
"true",
"int nextInt() {\n return Integer.parseInt(next());\n }",
"nextInt",
"{\n return Integer.parseInt(next());\n }",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"int[] nextIntArray(int N) {\n int[] A = new int[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextInt();\n }\n return A;\n }",
"nextIntArray",
"{\n int[] A = new int[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextInt();\n }\n return A;\n }",
"int[] A = new int[N];",
"A",
"new int[N]",
"N",
"for (int i = 0; i < N; i++) {\n A[i] = sc.nextInt();\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < N",
"i",
"N",
"i++",
"i++",
"i",
"{\n A[i] = sc.nextInt();\n }",
"{\n A[i] = sc.nextInt();\n }",
"A[i] = sc.nextInt()",
"A[i]",
"A",
"i",
"sc.nextInt()",
"sc.nextInt",
"sc",
"return A;",
"A",
"int N",
"N",
"long nextLong() {\n return Long.parseLong(next());\n }",
"nextLong",
"{\n return Long.parseLong(next());\n }",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"long[] nextLongArray(int N) {\n long[] A = new long[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextLong();\n }\n return A;\n }",
"nextLongArray",
"{\n long[] A = new long[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextLong();\n }\n return A;\n }",
"long[] A = new long[N];",
"A",
"new long[N]",
"N",
"for (int i = 0; i < N; i++) {\n A[i] = sc.nextLong();\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < N",
"i",
"N",
"i++",
"i++",
"i",
"{\n A[i] = sc.nextLong();\n }",
"{\n A[i] = sc.nextLong();\n }",
"A[i] = sc.nextLong()",
"A[i]",
"A",
"i",
"sc.nextLong()",
"sc.nextLong",
"sc",
"return A;",
"A",
"int N",
"N",
"BigInteger nextBigInteger() {\n return new BigInteger(next());\n }",
"nextBigInteger",
"{\n return new BigInteger(next());\n }",
"return new BigInteger(next());",
"new BigInteger(next())",
"double nextDouble() {\n return Double.parseDouble(next());\n }",
"nextDouble",
"{\n return Double.parseDouble(next());\n }",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"double[] nextDoubleArray(int N) {\n double[] A = new double[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextDouble();\n }\n return A;\n }",
"nextDoubleArray",
"{\n double[] A = new double[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextDouble();\n }\n return A;\n }",
"double[] A = new double[N];",
"A",
"new double[N]",
"N",
"for (int i = 0; i < N; i++) {\n A[i] = sc.nextDouble();\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < N",
"i",
"N",
"i++",
"i++",
"i",
"{\n A[i] = sc.nextDouble();\n }",
"{\n A[i] = sc.nextDouble();\n }",
"A[i] = sc.nextDouble()",
"A[i]",
"A",
"i",
"sc.nextDouble()",
"sc.nextDouble",
"sc",
"return A;",
"A",
"int N",
"N",
"public class Main {\n FastScanner sc;\n PrintWriter p;\n\n void solve() {\n String s = sc.next();\n String t = sc.next();\n int max = 0;\n for(int i = 0; i <= s.length() - t.length(); i++) {\n int p = i;\n int count = 0;\n for(int j = 0; j < t.length(); j++) {\n if(s.charAt(p) == t.charAt(j))\n count++;\n p++;\n }\n max = Math.max(max, count);\n }\n\n p.println(t.length() - max);\n }\n\n void run() {\n try {\n sc = new FastScanner(new File(\"Substring.in\"));\n p = new PrintWriter(new File(\"Substring.out\"));\n\n solve();\n\n p.close();\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n void runIO() {\n\n sc = new FastScanner(System.in);\n p = new PrintWriter(System.out);\n\n solve();\n\n p.close();\n }\n\n class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public FastScanner(File f) {\n try {\n br = new BufferedReader(new FileReader(f));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n public FastScanner(InputStream f) {\n br = new BufferedReader(new InputStreamReader(f));\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return null;\n st = new StringTokenizer(s);\n }\n return st.nextToken();\n }\n\n boolean hasMoreTokens() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return false;\n st = new StringTokenizer(s);\n }\n return true;\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n int[] nextIntArray(int N) {\n int[] A = new int[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextInt();\n }\n return A;\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n long[] nextLongArray(int N) {\n long[] A = new long[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextLong();\n }\n return A;\n }\n\n BigInteger nextBigInteger() {\n return new BigInteger(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n double[] nextDoubleArray(int N) {\n double[] A = new double[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextDouble();\n }\n return A;\n }\n\n }\n\n public static void main(String[] args) {\n new Main().runIO();\n }\n}",
"public class Main {\n FastScanner sc;\n PrintWriter p;\n\n void solve() {\n String s = sc.next();\n String t = sc.next();\n int max = 0;\n for(int i = 0; i <= s.length() - t.length(); i++) {\n int p = i;\n int count = 0;\n for(int j = 0; j < t.length(); j++) {\n if(s.charAt(p) == t.charAt(j))\n count++;\n p++;\n }\n max = Math.max(max, count);\n }\n\n p.println(t.length() - max);\n }\n\n void run() {\n try {\n sc = new FastScanner(new File(\"Substring.in\"));\n p = new PrintWriter(new File(\"Substring.out\"));\n\n solve();\n\n p.close();\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n void runIO() {\n\n sc = new FastScanner(System.in);\n p = new PrintWriter(System.out);\n\n solve();\n\n p.close();\n }\n\n class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public FastScanner(File f) {\n try {\n br = new BufferedReader(new FileReader(f));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n public FastScanner(InputStream f) {\n br = new BufferedReader(new InputStreamReader(f));\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return null;\n st = new StringTokenizer(s);\n }\n return st.nextToken();\n }\n\n boolean hasMoreTokens() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return false;\n st = new StringTokenizer(s);\n }\n return true;\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n int[] nextIntArray(int N) {\n int[] A = new int[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextInt();\n }\n return A;\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n long[] nextLongArray(int N) {\n long[] A = new long[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextLong();\n }\n return A;\n }\n\n BigInteger nextBigInteger() {\n return new BigInteger(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n double[] nextDoubleArray(int N) {\n double[] A = new double[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextDouble();\n }\n return A;\n }\n\n }\n\n public static void main(String[] args) {\n new Main().runIO();\n }\n}",
"Main"
]
| import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
FastScanner sc;
PrintWriter p;
void solve() {
String s = sc.next();
String t = sc.next();
int max = 0;
for(int i = 0; i <= s.length() - t.length(); i++) {
int p = i;
int count = 0;
for(int j = 0; j < t.length(); j++) {
if(s.charAt(p) == t.charAt(j))
count++;
p++;
}
max = Math.max(max, count);
}
p.println(t.length() - max);
}
void run() {
try {
sc = new FastScanner(new File("Substring.in"));
p = new PrintWriter(new File("Substring.out"));
solve();
p.close();
} catch (FileNotFoundException e) {
e.printStackTrace();
}
}
void runIO() {
sc = new FastScanner(System.in);
p = new PrintWriter(System.out);
solve();
p.close();
}
class FastScanner {
BufferedReader br;
StringTokenizer st;
public FastScanner(File f) {
try {
br = new BufferedReader(new FileReader(f));
} catch (FileNotFoundException e) {
e.printStackTrace();
}
}
public FastScanner(InputStream f) {
br = new BufferedReader(new InputStreamReader(f));
}
String next() {
while (st == null || !st.hasMoreTokens()) {
String s = null;
try {
s = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
if (s == null)
return null;
st = new StringTokenizer(s);
}
return st.nextToken();
}
boolean hasMoreTokens() {
while (st == null || !st.hasMoreTokens()) {
String s = null;
try {
s = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
if (s == null)
return false;
st = new StringTokenizer(s);
}
return true;
}
int nextInt() {
return Integer.parseInt(next());
}
int[] nextIntArray(int N) {
int[] A = new int[N];
for (int i = 0; i < N; i++) {
A[i] = sc.nextInt();
}
return A;
}
long nextLong() {
return Long.parseLong(next());
}
long[] nextLongArray(int N) {
long[] A = new long[N];
for (int i = 0; i < N; i++) {
A[i] = sc.nextLong();
}
return A;
}
BigInteger nextBigInteger() {
return new BigInteger(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
double[] nextDoubleArray(int N) {
double[] A = new double[N];
for (int i = 0; i < N; i++) {
A[i] = sc.nextDouble();
}
return A;
}
}
public static void main(String[] args) {
new Main().runIO();
}
}
|
[
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,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
18,
13,
13,
2,
4,
18,
13,
13,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
29,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
193,
14
],
[
193,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
18,
20
],
[
17,
21
],
[
21,
22
],
[
21,
23
],
[
23,
24
],
[
24,
25
],
[
17,
26
],
[
26,
27
],
[
26,
28
],
[
28,
29
],
[
29,
30
],
[
17,
31
],
[
31,
32
],
[
31,
33
],
[
17,
34
],
[
34,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
34,
39
],
[
39,
40
],
[
39,
41
],
[
41,
42
],
[
42,
43
],
[
43,
44
],
[
41,
45
],
[
45,
46
],
[
46,
47
],
[
34,
48
],
[
48,
49
],
[
49,
50
],
[
34,
51
],
[
52,
52
],
[
52,
53
],
[
53,
54
],
[
53,
55
],
[
52,
56
],
[
56,
57
],
[
57,
58
],
[
58,
59
],
[
58,
60
],
[
56,
61
],
[
61,
62
],
[
61,
63
],
[
63,
64
],
[
64,
65
],
[
56,
66
],
[
66,
67
],
[
67,
68
],
[
56,
69
],
[
70,
70
],
[
70,
71
],
[
71,
72
],
[
72,
73
],
[
73,
74
],
[
74,
75
],
[
73,
76
],
[
76,
77
],
[
76,
78
],
[
72,
79
],
[
79,
80
],
[
80,
81
],
[
79,
82
],
[
71,
83
],
[
83,
84
],
[
52,
85
],
[
85,
86
],
[
85,
87
],
[
87,
88
],
[
88,
89
],
[
87,
90
],
[
87,
91
],
[
17,
92
],
[
92,
93
],
[
93,
94
],
[
94,
95
],
[
94,
96
],
[
92,
97
],
[
97,
98
],
[
98,
99
],
[
99,
100
],
[
97,
101
],
[
15,
102
],
[
102,
103
],
[
193,
104
],
[
104,
105
],
[
104,
106
],
[
106,
107
],
[
104,
108
],
[
108,
109
],
[
104,
110
],
[
110,
111
],
[
110,
112
],
[
112,
113
],
[
113,
114
],
[
113,
115
],
[
104,
116
],
[
116,
117
],
[
116,
118
],
[
118,
119
],
[
119,
120
],
[
120,
121
],
[
121,
122
],
[
121,
123
],
[
120,
124
],
[
124,
125
],
[
125,
126
],
[
126,
127
],
[
119,
128
],
[
128,
129
],
[
129,
130
],
[
130,
131
],
[
130,
132
],
[
132,
133
],
[
133,
134
],
[
134,
135
],
[
129,
136
],
[
136,
137
],
[
137,
138
],
[
137,
139
],
[
118,
140
],
[
140,
141
],
[
141,
142
],
[
142,
143
],
[
104,
144
],
[
144,
145
],
[
144,
146
],
[
146,
147
],
[
147,
148
],
[
148,
149
],
[
149,
150
],
[
148,
151
],
[
151,
152
],
[
104,
153
],
[
153,
154
],
[
153,
155
],
[
155,
156
],
[
156,
157
],
[
157,
158
],
[
158,
159
],
[
157,
160
],
[
160,
161
],
[
104,
162
],
[
162,
163
],
[
162,
164
],
[
164,
165
],
[
165,
166
],
[
166,
167
],
[
167,
168
],
[
166,
169
],
[
169,
170
],
[
104,
171
],
[
171,
172
],
[
171,
173
],
[
173,
174
],
[
174,
175
],
[
174,
176
],
[
173,
177
],
[
177,
178
],
[
178,
179
],
[
178,
180
],
[
180,
181
],
[
181,
182
],
[
182,
183
],
[
177,
184
],
[
184,
185
],
[
185,
186
],
[
185,
187
],
[
187,
188
],
[
188,
189
],
[
173,
190
],
[
190,
191
],
[
0,
192
],
[
192,
193
],
[
192,
194
]
]
| [
"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\npublic class Main\n{\n static class FastReader\n {\n BufferedReader br;\n StringTokenizer st;\n public FastReader()\n {\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }\n String next()\n {\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n int nextInt()\n {\n return Integer.parseInt(next());\n }\n \n long nextLong()\n {\n return Long.parseLong(next());\n }\n \n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n \n String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n }\n \n public static void main(String[] args)\n {\n FastReader s=new FastReader();\n String st = s.nextLine();\n String tt = s.nextLine();\n \n // if(st.equals(tt)){\n // System.out.println(0);\n // return;\n // }\n\n int max = 0;\n for(int i=0; i<=st.length()-tt.length(); i++){\n int count = 0;\n for(int j=0; j<tt.length(); j++){\n if(st.charAt(i+j)==tt.charAt(j)) count++;\n }\n max = Math.max(max, count);\n }\n\n System.out.println(tt.length()-max);\n \n }\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.util.StringTokenizer;",
"StringTokenizer",
"java.util",
"public class Main\n{\n static class FastReader\n {\n BufferedReader br;\n StringTokenizer st;\n public FastReader()\n {\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }\n String next()\n {\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n int nextInt()\n {\n return Integer.parseInt(next());\n }\n \n long nextLong()\n {\n return Long.parseLong(next());\n }\n \n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n \n String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n }\n \n public static void main(String[] args)\n {\n FastReader s=new FastReader();\n String st = s.nextLine();\n String tt = s.nextLine();\n \n // if(st.equals(tt)){\n // System.out.println(0);\n // return;\n // }\n\n int max = 0;\n for(int i=0; i<=st.length()-tt.length(); i++){\n int count = 0;\n for(int j=0; j<tt.length(); j++){\n if(st.charAt(i+j)==tt.charAt(j)) count++;\n }\n max = Math.max(max, count);\n }\n\n System.out.println(tt.length()-max);\n \n }\n}",
"Main",
"public static void main(String[] args)\n {\n FastReader s=new FastReader();\n String st = s.nextLine();\n String tt = s.nextLine();\n \n // if(st.equals(tt)){\n // System.out.println(0);\n // return;\n // }\n\n int max = 0;\n for(int i=0; i<=st.length()-tt.length(); i++){\n int count = 0;\n for(int j=0; j<tt.length(); j++){\n if(st.charAt(i+j)==tt.charAt(j)) count++;\n }\n max = Math.max(max, count);\n }\n\n System.out.println(tt.length()-max);\n \n }",
"main",
"{\n FastReader s=new FastReader();\n String st = s.nextLine();\n String tt = s.nextLine();\n \n // if(st.equals(tt)){\n // System.out.println(0);\n // return;\n // }\n\n int max = 0;\n for(int i=0; i<=st.length()-tt.length(); i++){\n int count = 0;\n for(int j=0; j<tt.length(); j++){\n if(st.charAt(i+j)==tt.charAt(j)) count++;\n }\n max = Math.max(max, count);\n }\n\n System.out.println(tt.length()-max);\n \n }",
"FastReader s=new FastReader();",
"s",
"new FastReader()",
"String st = s.nextLine();",
"st",
"s.nextLine()",
"s.nextLine",
"s",
"String tt = s.nextLine();",
"tt",
"s.nextLine()",
"s.nextLine",
"s",
"int max = 0;",
"max",
"0",
"for(int i=0; i<=st.length()-tt.length(); i++){\n int count = 0;\n for(int j=0; j<tt.length(); j++){\n if(st.charAt(i+j)==tt.charAt(j)) count++;\n }\n max = Math.max(max, count);\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<=st.length()-tt.length()",
"i",
"st.length()-tt.length()",
"st.length()",
"st.length",
"st",
"tt.length()",
"tt.length",
"tt",
"i++",
"i++",
"i",
"{\n int count = 0;\n for(int j=0; j<tt.length(); j++){\n if(st.charAt(i+j)==tt.charAt(j)) count++;\n }\n max = Math.max(max, count);\n }",
"{\n int count = 0;\n for(int j=0; j<tt.length(); j++){\n if(st.charAt(i+j)==tt.charAt(j)) count++;\n }\n max = Math.max(max, count);\n }",
"int count = 0;",
"count",
"0",
"for(int j=0; j<tt.length(); j++){\n if(st.charAt(i+j)==tt.charAt(j)) count++;\n }",
"int j=0;",
"int j=0;",
"j",
"0",
"j<tt.length()",
"j",
"tt.length()",
"tt.length",
"tt",
"j++",
"j++",
"j",
"{\n if(st.charAt(i+j)==tt.charAt(j)) count++;\n }",
"{\n if(st.charAt(i+j)==tt.charAt(j)) count++;\n }",
"if(st.charAt(i+j)==tt.charAt(j)) count++;",
"st.charAt(i+j)==tt.charAt(j)",
"st.charAt(i+j)",
"st.charAt",
"st",
"i+j",
"i",
"j",
"tt.charAt(j)",
"tt.charAt",
"tt",
"j",
"count++",
"count",
"max = Math.max(max, count)",
"max",
"Math.max(max, count)",
"Math.max",
"Math",
"max",
"count",
"System.out.println(tt.length()-max)",
"System.out.println",
"System.out",
"System",
"System.out",
"tt.length()-max",
"tt.length()",
"tt.length",
"tt",
"max",
"String[] args",
"args",
"static class FastReader\n {\n BufferedReader br;\n StringTokenizer st;\n public FastReader()\n {\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }\n String next()\n {\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n int nextInt()\n {\n return Integer.parseInt(next());\n }\n \n long nextLong()\n {\n return Long.parseLong(next());\n }\n \n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n \n String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n }",
"FastReader",
"BufferedReader br;",
"br",
"StringTokenizer st;",
"st",
"public FastReader()\n {\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }",
"FastReader",
"{\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }",
"br = new BufferedReader(new\n InputStreamReader(System.in))",
"br",
"new BufferedReader(new\n InputStreamReader(System.in))",
"String next()\n {\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }",
"next",
"{\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }",
"while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }",
"st == null || !st.hasMoreElements()",
"st == null",
"st",
"null",
"!st.hasMoreElements()",
"st.hasMoreElements()",
"st.hasMoreElements",
"st",
"{\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }",
"try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }",
"catch (IOException e)\n {\n e.printStackTrace();\n }",
"IOException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n st = new StringTokenizer(br.readLine());\n }",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"int nextInt()\n {\n return Integer.parseInt(next());\n }",
"nextInt",
"{\n return Integer.parseInt(next());\n }",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"long nextLong()\n {\n return Long.parseLong(next());\n }",
"nextLong",
"{\n return Long.parseLong(next());\n }",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"double nextDouble()\n {\n return Double.parseDouble(next());\n }",
"nextDouble",
"{\n return Double.parseDouble(next());\n }",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }",
"nextLine",
"{\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }",
"String str = \"\";",
"str",
"\"\"",
"try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }",
"catch (IOException e)\n {\n e.printStackTrace();\n }",
"IOException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n str = br.readLine();\n }",
"str = br.readLine()",
"str",
"br.readLine()",
"br.readLine",
"br",
"return str;",
"str",
"public class Main\n{\n static class FastReader\n {\n BufferedReader br;\n StringTokenizer st;\n public FastReader()\n {\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }\n String next()\n {\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n int nextInt()\n {\n return Integer.parseInt(next());\n }\n \n long nextLong()\n {\n return Long.parseLong(next());\n }\n \n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n \n String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n }\n \n public static void main(String[] args)\n {\n FastReader s=new FastReader();\n String st = s.nextLine();\n String tt = s.nextLine();\n \n // if(st.equals(tt)){\n // System.out.println(0);\n // return;\n // }\n\n int max = 0;\n for(int i=0; i<=st.length()-tt.length(); i++){\n int count = 0;\n for(int j=0; j<tt.length(); j++){\n if(st.charAt(i+j)==tt.charAt(j)) count++;\n }\n max = Math.max(max, count);\n }\n\n System.out.println(tt.length()-max);\n \n }\n}",
"public class Main\n{\n static class FastReader\n {\n BufferedReader br;\n StringTokenizer st;\n public FastReader()\n {\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }\n String next()\n {\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n int nextInt()\n {\n return Integer.parseInt(next());\n }\n \n long nextLong()\n {\n return Long.parseLong(next());\n }\n \n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n \n String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n }\n \n public static void main(String[] args)\n {\n FastReader s=new FastReader();\n String st = s.nextLine();\n String tt = s.nextLine();\n \n // if(st.equals(tt)){\n // System.out.println(0);\n // return;\n // }\n\n int max = 0;\n for(int i=0; i<=st.length()-tt.length(); i++){\n int count = 0;\n for(int j=0; j<tt.length(); j++){\n if(st.charAt(i+j)==tt.charAt(j)) count++;\n }\n max = Math.max(max, count);\n }\n\n System.out.println(tt.length()-max);\n \n }\n}",
"Main"
]
| import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main
{
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements())
{
try
{
st = new StringTokenizer(br.readLine());
}
catch (IOException e)
{
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt()
{
return Integer.parseInt(next());
}
long nextLong()
{
return Long.parseLong(next());
}
double nextDouble()
{
return Double.parseDouble(next());
}
String nextLine()
{
String str = "";
try
{
str = br.readLine();
}
catch (IOException e)
{
e.printStackTrace();
}
return str;
}
}
public static void main(String[] args)
{
FastReader s=new FastReader();
String st = s.nextLine();
String tt = s.nextLine();
// if(st.equals(tt)){
// System.out.println(0);
// return;
// }
int max = 0;
for(int i=0; i<=st.length()-tt.length(); i++){
int count = 0;
for(int j=0; j<tt.length(); j++){
if(st.charAt(i+j)==tt.charAt(j)) count++;
}
max = Math.max(max, count);
}
System.out.println(tt.length()-max);
}
} |
[
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,
20,
41,
13,
20,
4,
18,
13,
13,
4,
18,
13,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
4,
18,
13,
0,
13,
4,
18,
13,
23,
13,
12,
13,
30,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
4,
18,
13,
13,
23,
13,
6,
13,
41,
13,
18,
13,
13,
41,
13,
20,
17,
41,
13,
17,
41,
13,
17,
12,
13,
30,
14,
2,
13,
13,
30,
29,
17,
30,
0,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
13,
14,
2,
13,
17,
30,
29,
17,
29,
17,
12,
13,
30,
14,
4,
13,
30,
29,
18,
13,
40,
13,
30,
29,
40,
17,
12,
13,
30,
29,
2,
2,
17,
13,
2,
13,
17,
23,
13,
12,
13,
30,
42,
2,
4,
13,
40,
4,
13,
18,
13,
13,
30,
40,
13,
29,
4,
13,
12,
13,
30,
14,
40,
4,
13,
30,
37,
20,
41,
13,
20,
41,
13,
4,
13,
42,
4,
13,
13,
30,
4,
18,
13,
13,
0,
13,
4,
13,
29,
4,
18,
13,
12,
13,
30,
14,
40,
4,
13,
30,
37,
20,
41,
13,
17,
41,
13,
17,
41,
13,
4,
13,
14,
2,
13,
17,
30,
0,
13,
17,
0,
13,
4,
13,
14,
2,
2,
13,
17,
2,
17,
13,
30,
37,
20,
42,
17,
30,
14,
2,
2,
17,
13,
2,
13,
17,
30,
0,
13,
17,
0,
13,
2,
13,
17,
14,
2,
2,
13,
40,
17,
40,
4,
13,
13,
30,
29,
8,
13,
40,
13,
13,
30,
37,
20,
0,
13,
4,
13,
12,
13,
30,
41,
13,
4,
13,
14,
2,
2,
13,
18,
13,
13,
2,
13,
18,
13,
13,
30,
37,
20,
29,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
13,
29,
13,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
17,
4,
18,
18,
13,
13,
13,
29,
13,
12,
13,
30,
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,
17,
4,
18,
18,
13,
13,
4,
18,
13,
13,
29,
13,
23,
13,
6,
13,
12,
13,
30,
41,
13,
17,
41,
13,
2,
18,
13,
13,
17,
42,
2,
13,
13,
30,
41,
13,
2,
13,
2,
2,
13,
13,
17,
14,
2,
18,
13,
13,
13,
30,
0,
13,
13,
30,
0,
13,
2,
13,
17,
29,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
17,
41,
13,
2,
18,
13,
13,
17,
42,
2,
13,
13,
30,
41,
13,
2,
13,
2,
2,
2,
13,
13,
17,
17,
14,
2,
18,
13,
13,
13,
30,
0,
13,
13,
30,
0,
13,
2,
13,
17,
29,
13,
23,
13,
23,
13,
12,
13,
30,
4,
18,
18,
13,
13,
8,
13,
17,
17,
23,
13,
12,
13,
30,
4,
18,
18,
13,
13,
8,
13,
17,
17,
23,
13,
12,
13,
30,
41,
13,
4,
18,
13,
4,
18,
13,
13,
29,
4,
18,
13,
13,
23,
13,
12,
13,
30,
29,
4,
18,
4,
18,
20,
23,
13,
12,
13,
30,
11,
1,
41,
13,
17,
2,
13,
2,
18,
13,
13,
17,
1,
40,
13,
30,
30,
41,
13,
18,
13,
13,
0,
18,
13,
13,
18,
13,
2,
2,
18,
13,
13,
17,
13,
0,
18,
13,
2,
2,
18,
13,
13,
17,
13,
13,
29,
13,
23,
13,
12,
13,
30,
11,
1,
41,
13,
17,
2,
13,
2,
18,
13,
13,
17,
1,
40,
13,
30,
30,
41,
13,
18,
13,
13,
0,
18,
13,
13,
18,
13,
2,
2,
18,
13,
13,
17,
13,
0,
18,
13,
2,
2,
18,
13,
13,
17,
13,
13,
29,
13,
23,
13,
12,
13,
30,
11,
1,
41,
13,
17,
2,
13,
2,
18,
13,
13,
17,
1,
40,
13,
30,
30,
41,
13,
18,
13,
13,
0,
18,
13,
13,
18,
13,
2,
2,
18,
13,
13,
17,
13,
0,
18,
13,
2,
2,
18,
13,
13,
17,
13,
13,
29,
13,
23,
13,
12,
13,
30,
11,
1,
41,
13,
17,
2,
13,
2,
18,
13,
13,
17,
1,
40,
13,
30,
30,
41,
13,
18,
13,
13,
0,
18,
13,
13,
18,
13,
2,
2,
18,
13,
13,
17,
13,
0,
18,
13,
2,
2,
18,
13,
13,
17,
13,
13,
29,
13,
23,
13,
12,
13,
30,
11,
1,
41,
13,
17,
2,
13,
2,
18,
13,
13,
17,
1,
40,
13,
30,
30,
41,
13,
18,
13,
13,
0,
18,
13,
13,
18,
13,
2,
2,
18,
13,
13,
17,
13,
0,
18,
13,
2,
2,
18,
13,
13,
17,
13,
13,
29,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
29,
18,
13,
17,
23,
13,
12,
13,
30,
4,
18,
13,
13,
29,
18,
13,
17,
23,
13,
12,
13,
30,
4,
18,
13,
13,
29,
18,
13,
17,
23,
13,
12,
13,
30,
4,
18,
13,
13,
29,
18,
13,
2,
18,
13,
13,
17,
23,
13,
12,
13,
30,
4,
18,
13,
13,
29,
18,
13,
2,
18,
13,
13,
17,
23,
13,
12,
13,
30,
4,
18,
13,
13,
29,
18,
13,
2,
18,
13,
13,
17,
23,
13,
12,
13,
30,
41,
13,
17,
42,
2,
13,
17,
30,
0,
13,
2,
13,
17,
0,
13,
17,
29,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
1112,
17
],
[
1112,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
21,
23
],
[
20,
24
],
[
24,
25
],
[
24,
26
],
[
20,
27
],
[
27,
28
],
[
27,
29
],
[
20,
30
],
[
30,
31
],
[
31,
32
],
[
30,
33
],
[
20,
34
],
[
34,
35
],
[
35,
36
],
[
18,
37
],
[
37,
38
],
[
0,
39
],
[
39,
40
],
[
39,
41
],
[
41,
42
],
[
39,
43
],
[
43,
44
],
[
39,
45
],
[
45,
46
],
[
45,
47
],
[
47,
48
],
[
48,
49
],
[
48,
50
],
[
50,
51
],
[
51,
52
],
[
47,
53
],
[
53,
54
],
[
53,
55
],
[
55,
56
],
[
56,
57
],
[
45,
58
],
[
58,
59
],
[
39,
60
],
[
60,
61
],
[
60,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
65,
66
],
[
66,
67
],
[
62,
68
],
[
68,
69
],
[
69,
70
],
[
70,
71
],
[
70,
72
],
[
68,
73
],
[
73,
74
],
[
73,
75
],
[
75,
76
],
[
76,
77
],
[
77,
78
],
[
75,
79
],
[
79,
80
],
[
80,
81
],
[
68,
82
],
[
82,
83
],
[
83,
84
],
[
68,
85
],
[
86,
86
],
[
86,
87
],
[
87,
88
],
[
87,
89
],
[
86,
90
],
[
90,
91
],
[
91,
92
],
[
92,
93
],
[
92,
94
],
[
90,
95
],
[
95,
96
],
[
95,
97
],
[
97,
98
],
[
98,
99
],
[
90,
100
],
[
100,
101
],
[
101,
102
],
[
90,
103
],
[
104,
104
],
[
104,
105
],
[
105,
106
],
[
106,
107
],
[
107,
108
],
[
108,
109
],
[
107,
110
],
[
110,
111
],
[
110,
112
],
[
106,
113
],
[
113,
114
],
[
114,
115
],
[
113,
116
],
[
105,
117
],
[
117,
118
],
[
118,
119
],
[
86,
120
],
[
120,
121
],
[
120,
122
],
[
122,
123
],
[
123,
124
],
[
122,
125
],
[
122,
126
],
[
62,
127
],
[
127,
128
],
[
128,
129
],
[
127,
130
],
[
60,
131
],
[
131,
132
],
[
0,
133
],
[
133,
134
],
[
133,
135
],
[
135,
136
],
[
135,
137
],
[
137,
138
],
[
137,
139
],
[
133,
140
],
[
140,
141
],
[
140,
142
],
[
133,
144
],
[
144,
145
],
[
144,
146
],
[
133,
147
],
[
147,
148
],
[
147,
149
],
[
133,
150
],
[
150,
151
],
[
150,
152
],
[
152,
153
],
[
153,
154
],
[
154,
155
],
[
154,
156
],
[
153,
157
],
[
157,
158
],
[
158,
159
],
[
153,
160
],
[
160,
161
],
[
161,
162
],
[
161,
163
],
[
160,
164
],
[
164,
165
],
[
165,
166
],
[
165,
167
],
[
167,
168
],
[
168,
169
],
[
169,
170
],
[
164,
171
],
[
171,
172
],
[
172,
173
],
[
172,
174
],
[
174,
175
],
[
175,
176
],
[
174,
177
],
[
160,
178
],
[
178,
179
],
[
179,
180
],
[
179,
181
],
[
178,
182
],
[
182,
183
],
[
183,
184
],
[
152,
185
],
[
185,
186
],
[
133,
187
],
[
187,
188
],
[
187,
189
],
[
189,
190
],
[
190,
191
],
[
191,
192
],
[
190,
193
],
[
193,
194
],
[
194,
195
],
[
195,
196
],
[
195,
197
],
[
197,
198
],
[
190,
199
],
[
199,
200
],
[
200,
201
],
[
201,
202
],
[
133,
203
],
[
203,
204
],
[
203,
205
],
[
205,
206
],
[
206,
207
],
[
207,
208
],
[
208,
209
],
[
208,
210
],
[
207,
211
],
[
211,
212
],
[
211,
213
],
[
203,
214
],
[
214,
215
],
[
133,
216
],
[
216,
217
],
[
216,
218
],
[
218,
219
],
[
219,
220
],
[
220,
221
],
[
221,
222
],
[
220,
223
],
[
223,
224
],
[
224,
225
],
[
224,
226
],
[
226,
227
],
[
226,
228
],
[
219,
229
],
[
229,
230
],
[
230,
231
],
[
218,
232
],
[
232,
233
],
[
233,
234
],
[
133,
235
],
[
235,
236
],
[
235,
237
],
[
237,
238
],
[
238,
239
],
[
239,
240
],
[
240,
241
],
[
238,
242
],
[
242,
243
],
[
243,
244
],
[
237,
245
],
[
245,
246
],
[
245,
247
],
[
237,
248
],
[
248,
249
],
[
248,
250
],
[
250,
251
],
[
237,
252
],
[
252,
253
],
[
253,
254
],
[
253,
255
],
[
252,
256
],
[
256,
257
],
[
257,
258
],
[
258,
259
],
[
257,
260
],
[
256,
261
],
[
261,
262
],
[
261,
263
],
[
263,
264
],
[
237,
265
],
[
265,
266
],
[
266,
267
],
[
267,
268
],
[
133,
269
],
[
269,
270
],
[
269,
271
],
[
271,
272
],
[
272,
273
],
[
273,
274
],
[
274,
275
],
[
272,
276
],
[
276,
277
],
[
277,
278
],
[
271,
279
],
[
279,
280
],
[
279,
281
],
[
271,
282
],
[
282,
283
],
[
282,
284
],
[
271,
285
],
[
285,
286
],
[
285,
287
],
[
287,
288
],
[
271,
289
],
[
289,
290
],
[
290,
291
],
[
290,
292
],
[
289,
293
],
[
293,
294
],
[
294,
295
],
[
294,
296
],
[
293,
297
],
[
297,
298
],
[
297,
299
],
[
299,
300
],
[
271,
301
],
[
301,
302
],
[
302,
303
],
[
303,
304
],
[
303,
305
],
[
302,
306
],
[
306,
307
],
[
306,
308
],
[
301,
309
],
[
309,
310
],
[
310,
311
],
[
271,
312
],
[
312,
313
],
[
312,
314
],
[
314,
315
],
[
315,
316
],
[
316,
317
],
[
317,
318
],
[
317,
319
],
[
316,
320
],
[
320,
321
],
[
320,
322
],
[
315,
323
],
[
323,
324
],
[
324,
325
],
[
324,
326
],
[
323,
327
],
[
327,
328
],
[
327,
329
],
[
329,
330
],
[
329,
331
],
[
315,
332
],
[
332,
333
],
[
333,
334
],
[
334,
335
],
[
334,
336
],
[
336,
337
],
[
333,
338
],
[
338,
339
],
[
339,
340
],
[
339,
341
],
[
332,
342
],
[
342,
343
],
[
343,
344
],
[
344,
345
],
[
344,
346
],
[
346,
347
],
[
344,
348
],
[
332,
349
],
[
349,
350
],
[
350,
351
],
[
314,
352
],
[
352,
353
],
[
352,
354
],
[
354,
355
],
[
133,
356
],
[
356,
357
],
[
356,
358
],
[
358,
359
],
[
359,
360
],
[
359,
361
],
[
361,
362
],
[
358,
363
],
[
363,
364
],
[
364,
365
],
[
365,
366
],
[
365,
367
],
[
367,
368
],
[
367,
369
],
[
364,
370
],
[
370,
371
],
[
370,
372
],
[
372,
373
],
[
372,
374
],
[
363,
375
],
[
375,
376
],
[
376,
377
],
[
358,
378
],
[
378,
379
],
[
133,
380
],
[
380,
381
],
[
380,
382
],
[
382,
383
],
[
383,
384
],
[
384,
385
],
[
385,
386
],
[
384,
387
],
[
387,
388
],
[
133,
389
],
[
389,
390
],
[
389,
391
],
[
391,
392
],
[
392,
393
],
[
392,
394
],
[
391,
396
],
[
396,
397
],
[
397,
398
],
[
398,
399
],
[
398,
400
],
[
396,
401
],
[
401,
402
],
[
401,
403
],
[
396,
404
],
[
404,
405
],
[
405,
406
],
[
396,
407
],
[
408,
408
],
[
408,
409
],
[
409,
410
],
[
410,
411
],
[
410,
412
],
[
409,
413
],
[
413,
414
],
[
391,
415
],
[
415,
416
],
[
389,
417
],
[
417,
418
],
[
133,
419
],
[
419,
420
],
[
419,
421
],
[
421,
422
],
[
422,
423
],
[
422,
424
],
[
421,
426
],
[
426,
427
],
[
427,
428
],
[
428,
429
],
[
428,
430
],
[
426,
431
],
[
431,
432
],
[
431,
433
],
[
426,
434
],
[
434,
435
],
[
435,
436
],
[
426,
437
],
[
438,
438
],
[
438,
439
],
[
439,
440
],
[
440,
441
],
[
440,
442
],
[
439,
443
],
[
443,
444
],
[
421,
445
],
[
445,
446
],
[
419,
447
],
[
447,
448
],
[
133,
449
],
[
449,
450
],
[
449,
451
],
[
451,
452
],
[
452,
453
],
[
452,
454
],
[
451,
456
],
[
456,
457
],
[
457,
458
],
[
458,
459
],
[
458,
460
],
[
456,
461
],
[
461,
462
],
[
461,
463
],
[
456,
464
],
[
464,
465
],
[
465,
466
],
[
456,
467
],
[
468,
468
],
[
468,
469
],
[
469,
470
],
[
470,
471
],
[
470,
472
],
[
469,
473
],
[
473,
474
],
[
451,
475
],
[
475,
476
],
[
449,
477
],
[
477,
478
],
[
133,
479
],
[
479,
480
],
[
479,
481
],
[
481,
482
],
[
482,
483
],
[
482,
484
],
[
481,
486
],
[
486,
487
],
[
487,
488
],
[
488,
489
],
[
488,
490
],
[
486,
491
],
[
491,
492
],
[
491,
493
],
[
486,
494
],
[
494,
495
],
[
495,
496
],
[
486,
497
],
[
498,
498
],
[
498,
499
],
[
499,
500
],
[
500,
501
],
[
500,
502
],
[
499,
503
],
[
503,
504
],
[
481,
505
],
[
505,
506
],
[
479,
507
],
[
507,
508
],
[
133,
509
],
[
509,
510
],
[
509,
511
],
[
511,
512
],
[
512,
513
],
[
512,
514
],
[
511,
515
],
[
515,
516
],
[
515,
517
],
[
517,
518
],
[
518,
519
],
[
517,
520
],
[
511,
521
],
[
521,
522
],
[
522,
523
],
[
523,
524
],
[
523,
525
],
[
521,
526
],
[
511,
527
],
[
527,
528
],
[
133,
529
],
[
529,
530
],
[
529,
531
],
[
531,
532
],
[
532,
533
],
[
532,
534
],
[
531,
536
],
[
536,
537
],
[
536,
538
],
[
531,
539
],
[
539,
540
],
[
540,
541
],
[
541,
542
],
[
541,
543
],
[
539,
544
],
[
544,
545
],
[
544,
546
],
[
539,
547
],
[
547,
548
],
[
548,
549
],
[
539,
550
],
[
551,
551
],
[
551,
552
],
[
552,
553
],
[
553,
554
],
[
553,
555
],
[
552,
556
],
[
556,
557
],
[
557,
558
],
[
556,
559
],
[
531,
560
],
[
560,
561
],
[
561,
562
],
[
562,
563
],
[
562,
564
],
[
560,
565
],
[
565,
566
],
[
566,
567
],
[
565,
568
],
[
531,
569
],
[
569,
570
],
[
529,
571
],
[
571,
572
],
[
0,
573
],
[
573,
574
],
[
573,
575
],
[
575,
576
],
[
575,
577
],
[
577,
578
],
[
578,
579
],
[
578,
580
],
[
577,
581
],
[
581,
582
],
[
581,
583
],
[
583,
584
],
[
584,
585
],
[
584,
586
],
[
583,
587
],
[
577,
588
],
[
588,
589
],
[
589,
590
],
[
589,
591
],
[
588,
592
],
[
592,
593
],
[
593,
594
],
[
593,
595
],
[
595,
596
],
[
595,
597
],
[
597,
598
],
[
598,
599
],
[
598,
600
],
[
597,
601
],
[
592,
602
],
[
602,
603
],
[
603,
604
],
[
604,
605
],
[
604,
606
],
[
603,
607
],
[
602,
608
],
[
608,
609
],
[
609,
610
],
[
609,
611
],
[
602,
612
],
[
612,
613
],
[
613,
614
],
[
613,
615
],
[
615,
616
],
[
615,
617
],
[
577,
618
],
[
618,
619
],
[
575,
620
],
[
620,
621
],
[
575,
622
],
[
622,
623
],
[
573,
624
],
[
624,
625
],
[
624,
626
],
[
626,
627
],
[
627,
628
],
[
627,
629
],
[
626,
630
],
[
630,
631
],
[
630,
632
],
[
632,
633
],
[
633,
634
],
[
633,
635
],
[
632,
636
],
[
626,
637
],
[
637,
638
],
[
638,
639
],
[
638,
640
],
[
637,
641
],
[
641,
642
],
[
642,
643
],
[
642,
644
],
[
644,
645
],
[
644,
646
],
[
646,
647
],
[
647,
648
],
[
648,
649
],
[
648,
650
],
[
647,
651
],
[
646,
652
],
[
641,
653
],
[
653,
654
],
[
654,
655
],
[
655,
656
],
[
655,
657
],
[
654,
658
],
[
653,
659
],
[
659,
660
],
[
660,
661
],
[
660,
662
],
[
653,
663
],
[
663,
664
],
[
664,
665
],
[
664,
666
],
[
666,
667
],
[
666,
668
],
[
626,
669
],
[
669,
670
],
[
624,
671
],
[
671,
672
],
[
624,
673
],
[
673,
674
],
[
573,
675
],
[
675,
676
],
[
675,
677
],
[
677,
678
],
[
678,
679
],
[
679,
680
],
[
680,
681
],
[
680,
682
],
[
678,
683
],
[
683,
684
],
[
683,
685
],
[
683,
686
],
[
675,
687
],
[
687,
688
],
[
573,
689
],
[
689,
690
],
[
689,
691
],
[
691,
692
],
[
692,
693
],
[
693,
694
],
[
694,
695
],
[
694,
696
],
[
692,
697
],
[
697,
698
],
[
697,
699
],
[
697,
700
],
[
689,
701
],
[
701,
702
],
[
573,
703
],
[
703,
704
],
[
703,
705
],
[
705,
706
],
[
706,
707
],
[
706,
708
],
[
708,
709
],
[
709,
710
],
[
705,
711
],
[
711,
712
],
[
712,
713
],
[
711,
714
],
[
705,
715
],
[
715,
716
],
[
716,
717
],
[
717,
718
],
[
716,
719
],
[
703,
720
],
[
720,
721
],
[
573,
722
],
[
722,
723
],
[
722,
724
],
[
724,
725
],
[
725,
726
],
[
726,
727
],
[
727,
728
],
[
728,
729
],
[
729,
730
],
[
722,
731
],
[
731,
732
],
[
573,
733
],
[
733,
734
],
[
733,
735
],
[
735,
736
],
[
736,
737
],
[
737,
738
],
[
738,
739
],
[
738,
740
],
[
736,
741
],
[
741,
742
],
[
741,
743
],
[
743,
744
],
[
744,
745
],
[
744,
746
],
[
743,
747
],
[
736,
748
],
[
748,
749
],
[
749,
750
],
[
736,
751
],
[
752,
752
],
[
752,
753
],
[
753,
754
],
[
753,
755
],
[
755,
756
],
[
755,
757
],
[
752,
758
],
[
758,
759
],
[
759,
760
],
[
759,
761
],
[
758,
762
],
[
762,
763
],
[
762,
764
],
[
765,
765
],
[
765,
766
],
[
766,
767
],
[
766,
768
],
[
765,
769
],
[
765,
770
],
[
752,
771
],
[
771,
772
],
[
772,
773
],
[
772,
774
],
[
775,
775
],
[
775,
776
],
[
776,
777
],
[
776,
778
],
[
775,
779
],
[
775,
780
],
[
771,
781
],
[
735,
782
],
[
782,
783
],
[
733,
784
],
[
784,
785
],
[
573,
786
],
[
786,
787
],
[
786,
788
],
[
788,
789
],
[
789,
790
],
[
790,
791
],
[
791,
792
],
[
791,
793
],
[
789,
794
],
[
794,
795
],
[
794,
796
],
[
796,
797
],
[
797,
798
],
[
797,
799
],
[
796,
800
],
[
789,
801
],
[
801,
802
],
[
802,
803
],
[
789,
804
],
[
805,
805
],
[
805,
806
],
[
806,
807
],
[
806,
808
],
[
808,
809
],
[
808,
810
],
[
805,
811
],
[
811,
812
],
[
812,
813
],
[
812,
814
],
[
811,
815
],
[
815,
816
],
[
815,
817
],
[
818,
818
],
[
818,
819
],
[
819,
820
],
[
819,
821
],
[
818,
822
],
[
818,
823
],
[
805,
824
],
[
824,
825
],
[
825,
826
],
[
825,
827
],
[
828,
828
],
[
828,
829
],
[
829,
830
],
[
829,
831
],
[
828,
832
],
[
828,
833
],
[
824,
834
],
[
788,
835
],
[
835,
836
],
[
786,
837
],
[
837,
838
],
[
573,
839
],
[
839,
840
],
[
839,
841
],
[
841,
842
],
[
842,
843
],
[
843,
844
],
[
844,
845
],
[
844,
846
],
[
842,
847
],
[
847,
848
],
[
847,
849
],
[
849,
850
],
[
850,
851
],
[
850,
852
],
[
849,
853
],
[
842,
854
],
[
854,
855
],
[
855,
856
],
[
842,
857
],
[
858,
858
],
[
858,
859
],
[
859,
860
],
[
859,
861
],
[
861,
862
],
[
861,
863
],
[
858,
864
],
[
864,
865
],
[
865,
866
],
[
865,
867
],
[
864,
868
],
[
868,
869
],
[
868,
870
],
[
871,
871
],
[
871,
872
],
[
872,
873
],
[
872,
874
],
[
871,
875
],
[
871,
876
],
[
858,
877
],
[
877,
878
],
[
878,
879
],
[
878,
880
],
[
881,
881
],
[
881,
882
],
[
882,
883
],
[
882,
884
],
[
881,
885
],
[
881,
886
],
[
877,
887
],
[
841,
888
],
[
888,
889
],
[
839,
890
],
[
890,
891
],
[
573,
892
],
[
892,
893
],
[
892,
894
],
[
894,
895
],
[
895,
896
],
[
896,
897
],
[
897,
898
],
[
897,
899
],
[
895,
900
],
[
900,
901
],
[
900,
902
],
[
902,
903
],
[
903,
904
],
[
903,
905
],
[
902,
906
],
[
895,
907
],
[
907,
908
],
[
908,
909
],
[
895,
910
],
[
911,
911
],
[
911,
912
],
[
912,
913
],
[
912,
914
],
[
914,
915
],
[
914,
916
],
[
911,
917
],
[
917,
918
],
[
918,
919
],
[
918,
920
],
[
917,
921
],
[
921,
922
],
[
921,
923
],
[
924,
924
],
[
924,
925
],
[
925,
926
],
[
925,
927
],
[
924,
928
],
[
924,
929
],
[
911,
930
],
[
930,
931
],
[
931,
932
],
[
931,
933
],
[
934,
934
],
[
934,
935
],
[
935,
936
],
[
935,
937
],
[
934,
938
],
[
934,
939
],
[
930,
940
],
[
894,
941
],
[
941,
942
],
[
892,
943
],
[
943,
944
],
[
573,
945
],
[
945,
946
],
[
945,
947
],
[
947,
948
],
[
948,
949
],
[
949,
950
],
[
950,
951
],
[
950,
952
],
[
948,
953
],
[
953,
954
],
[
953,
955
],
[
955,
956
],
[
956,
957
],
[
956,
958
],
[
955,
959
],
[
948,
960
],
[
960,
961
],
[
961,
962
],
[
948,
963
],
[
964,
964
],
[
964,
965
],
[
965,
966
],
[
965,
967
],
[
967,
968
],
[
967,
969
],
[
964,
970
],
[
970,
971
],
[
971,
972
],
[
971,
973
],
[
970,
974
],
[
974,
975
],
[
974,
976
],
[
977,
977
],
[
977,
978
],
[
978,
979
],
[
978,
980
],
[
977,
981
],
[
977,
982
],
[
964,
983
],
[
983,
984
],
[
984,
985
],
[
984,
986
],
[
987,
987
],
[
987,
988
],
[
988,
989
],
[
988,
990
],
[
987,
991
],
[
987,
992
],
[
983,
993
],
[
947,
994
],
[
994,
995
],
[
945,
996
],
[
996,
997
],
[
573,
998
],
[
998,
999
],
[
998,
1000
],
[
1000,
1001
],
[
1001,
1002
],
[
1002,
1003
],
[
1001,
1004
],
[
1000,
1005
],
[
1005,
1006
],
[
1006,
1007
],
[
1006,
1008
],
[
998,
1009
],
[
1009,
1010
],
[
573,
1011
],
[
1011,
1012
],
[
1011,
1013
],
[
1013,
1014
],
[
1014,
1015
],
[
1015,
1016
],
[
1014,
1017
],
[
1013,
1018
],
[
1018,
1019
],
[
1019,
1020
],
[
1019,
1021
],
[
1011,
1022
],
[
1022,
1023
],
[
573,
1024
],
[
1024,
1025
],
[
1024,
1026
],
[
1026,
1027
],
[
1027,
1028
],
[
1028,
1029
],
[
1027,
1030
],
[
1026,
1031
],
[
1031,
1032
],
[
1032,
1033
],
[
1032,
1034
],
[
1024,
1035
],
[
1035,
1036
],
[
573,
1037
],
[
1037,
1038
],
[
1037,
1039
],
[
1039,
1040
],
[
1040,
1041
],
[
1041,
1042
],
[
1040,
1043
],
[
1039,
1044
],
[
1044,
1045
],
[
1045,
1046
],
[
1045,
1047
],
[
1047,
1048
],
[
1048,
1049
],
[
1048,
1050
],
[
1047,
1051
],
[
1037,
1052
],
[
1052,
1053
],
[
573,
1054
],
[
1054,
1055
],
[
1054,
1056
],
[
1056,
1057
],
[
1057,
1058
],
[
1058,
1059
],
[
1057,
1060
],
[
1056,
1061
],
[
1061,
1062
],
[
1062,
1063
],
[
1062,
1064
],
[
1064,
1065
],
[
1065,
1066
],
[
1065,
1067
],
[
1064,
1068
],
[
1054,
1069
],
[
1069,
1070
],
[
573,
1071
],
[
1071,
1072
],
[
1071,
1073
],
[
1073,
1074
],
[
1074,
1075
],
[
1075,
1076
],
[
1074,
1077
],
[
1073,
1078
],
[
1078,
1079
],
[
1079,
1080
],
[
1079,
1081
],
[
1081,
1082
],
[
1082,
1083
],
[
1082,
1084
],
[
1081,
1085
],
[
1071,
1086
],
[
1086,
1087
],
[
573,
1088
],
[
1088,
1089
],
[
1088,
1090
],
[
1090,
1091
],
[
1091,
1092
],
[
1091,
1093
],
[
1090,
1094
],
[
1094,
1095
],
[
1095,
1096
],
[
1095,
1097
],
[
1094,
1098
],
[
1098,
1099
],
[
1099,
1100
],
[
1099,
1101
],
[
1101,
1102
],
[
1101,
1103
],
[
1098,
1104
],
[
1104,
1105
],
[
1104,
1106
],
[
1090,
1107
],
[
1107,
1108
],
[
1088,
1109
],
[
1109,
1110
],
[
0,
1111
],
[
1111,
1112
],
[
1111,
1113
]
]
| [
"import java.text.DecimalFormat;\nimport java.util.stream.LongStream;\nimport java.util.stream.IntStream;\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n // int t = sc.nextInt();\n //while(t-->0){\n Naveen problem = new Naveen(sc);\n problem.solve(out);\n // }\n out.flush();\n }\n\n}\n\nclass Naveen {\n\n String s;\n String t;\n //int[] arr;\n \n\n Naveen(FastScanner sc) {\n \n s= sc.next();\n t= sc.next();\n // arr = sc.arrayInt(n);\n }\n\n void solve(PrintWriter out) {\n int max = t.length();\n\n for(int i =0;i<=s.length()-t.length();i++){\n int cnt =0;\n for(int j =0;j<t.length();j++){\n if(s.charAt(i+j)!=t.charAt(j)){\n cnt++;\n }\n \n \n }\n max = Math.min(cnt,max);\n }\n out.println(max);\n }\n\n \n}\n\nclass FastScanner {\n\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) {\n return buffer[ptr++];\n } else {\n return -1;\n }\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) {\n ptr++;\n }\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {\n throw new NumberFormatException();\n }\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] arrayInt(int N) {\n int[] array = new int[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextInt();\n }\n return array;\n }\n\n public long[] arrayLong(int N) {\n long[] array = new long[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextLong();\n }\n return array;\n }\n\n public double[] arrayDouble(int N) {\n double[] array = new double[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n\n public String[] arrayString(int N) {\n String[] array = new String[N];\n for (int i = 0; i < N; i++) {\n array[i] = next();\n }\n return array;\n }\n\n public int randomInt() {\n Random r = new Random();\n int value = r.nextInt((int) 1e6);\n System.out.println(value);\n return value;\n }\n\n public int[] randomInt(int N) {\n int[] array = new int[N];\n Random r = new Random();\n for (int i = 0; i < N; i++) {\n array[i] = r.nextInt((int) 1e6);\n }\n System.out.println(Arrays.toString(array));\n return array;\n }\n\n}\n\nclass My {\n\n public static long lower(long arr[],long key){\n int low = 0;\n int high = arr.length-1;\n while(low < high){\n int mid = low + (high - low)/2;\n if(arr[mid] >= key){\n high = mid;\n }\n else{\n low = mid+1;\n }\n }\n return low;\n }\npublic static int upper(int arr[],int key){\n int low = 0;\n int high = arr.length-1;\n while(low < high){\n int mid = low + (high - low+1)/2;\n if(arr[mid] <= key){\n low = mid;\n }\n else{\n high = mid-1;\n }\n }\n return low;\n}\n static void ans(boolean b) {\n System.out.println(b ? \"Yes\" : \"No\");\n }\n\n static void ANS(boolean b) {\n System.out.println(b ? \"YES\" : \"NO\");\n }\n\n static String sort(String s) {\n char[] ch = s.toCharArray();\n Arrays.sort(ch);\n return String.valueOf(ch);\n }\n\n static String reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n static int[] reverse(int[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n int temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static long[] reverse(long[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n long temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static double[] reverse(double[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n double temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static String[] reverse(String[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n String temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static char[] reverse(char[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n char temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static long min(long... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static int min(int... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static double min(double... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static long max(long... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static int max(int... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static double max(double... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static int sum(long number) {\n int sum = 0;\n while (number > 0) {\n sum += number % 10;\n number /= 10;\n }\n return sum;\n }\n\n}",
"import java.text.DecimalFormat;",
"DecimalFormat",
"java.text",
"import java.util.stream.LongStream;",
"LongStream",
"java.util.stream",
"import java.util.stream.IntStream;",
"IntStream",
"java.util.stream",
"import java.io.*;",
"io.*",
"java",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n // int t = sc.nextInt();\n //while(t-->0){\n Naveen problem = new Naveen(sc);\n problem.solve(out);\n // }\n out.flush();\n }\n\n}",
"Main",
"public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n // int t = sc.nextInt();\n //while(t-->0){\n Naveen problem = new Naveen(sc);\n problem.solve(out);\n // }\n out.flush();\n }",
"main",
"{\n FastScanner sc = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n // int t = sc.nextInt();\n //while(t-->0){\n Naveen problem = new Naveen(sc);\n problem.solve(out);\n // }\n out.flush();\n }",
"FastScanner sc = new FastScanner();",
"sc",
"new FastScanner()",
"PrintWriter out = new PrintWriter(System.out);",
"out",
"new PrintWriter(System.out)",
"Naveen problem = new Naveen(sc);",
"problem",
"new Naveen(sc)",
"problem.solve(out)",
"problem.solve",
"problem",
"out",
"out.flush()",
"out.flush",
"out",
"String[] args",
"args",
"class Naveen {\n\n String s;\n String t;\n //int[] arr;\n \n\n Naveen(FastScanner sc) {\n \n s= sc.next();\n t= sc.next();\n // arr = sc.arrayInt(n);\n }\n\n void solve(PrintWriter out) {\n int max = t.length();\n\n for(int i =0;i<=s.length()-t.length();i++){\n int cnt =0;\n for(int j =0;j<t.length();j++){\n if(s.charAt(i+j)!=t.charAt(j)){\n cnt++;\n }\n \n \n }\n max = Math.min(cnt,max);\n }\n out.println(max);\n }\n\n \n}",
"Naveen",
"String s;",
"s",
"String t;",
"t",
"Naveen(FastScanner sc) {\n \n s= sc.next();\n t= sc.next();\n // arr = sc.arrayInt(n);\n }",
"Naveen",
"{\n \n s= sc.next();\n t= sc.next();\n // arr = sc.arrayInt(n);\n }",
"s= sc.next()",
"s",
"sc.next()",
"sc.next",
"sc",
"t= sc.next()",
"t",
"sc.next()",
"sc.next",
"sc",
"FastScanner sc",
"sc",
"void solve(PrintWriter out) {\n int max = t.length();\n\n for(int i =0;i<=s.length()-t.length();i++){\n int cnt =0;\n for(int j =0;j<t.length();j++){\n if(s.charAt(i+j)!=t.charAt(j)){\n cnt++;\n }\n \n \n }\n max = Math.min(cnt,max);\n }\n out.println(max);\n }",
"solve",
"{\n int max = t.length();\n\n for(int i =0;i<=s.length()-t.length();i++){\n int cnt =0;\n for(int j =0;j<t.length();j++){\n if(s.charAt(i+j)!=t.charAt(j)){\n cnt++;\n }\n \n \n }\n max = Math.min(cnt,max);\n }\n out.println(max);\n }",
"int max = t.length();",
"max",
"t.length()",
"t.length",
"t",
"for(int i =0;i<=s.length()-t.length();i++){\n int cnt =0;\n for(int j =0;j<t.length();j++){\n if(s.charAt(i+j)!=t.charAt(j)){\n cnt++;\n }\n \n \n }\n max = Math.min(cnt,max);\n }",
"int i =0;",
"int i =0;",
"i",
"0",
"i<=s.length()-t.length()",
"i",
"s.length()-t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"i++",
"i++",
"i",
"{\n int cnt =0;\n for(int j =0;j<t.length();j++){\n if(s.charAt(i+j)!=t.charAt(j)){\n cnt++;\n }\n \n \n }\n max = Math.min(cnt,max);\n }",
"{\n int cnt =0;\n for(int j =0;j<t.length();j++){\n if(s.charAt(i+j)!=t.charAt(j)){\n cnt++;\n }\n \n \n }\n max = Math.min(cnt,max);\n }",
"int cnt =0;",
"cnt",
"0",
"for(int j =0;j<t.length();j++){\n if(s.charAt(i+j)!=t.charAt(j)){\n cnt++;\n }\n \n \n }",
"int j =0;",
"int j =0;",
"j",
"0",
"j<t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n if(s.charAt(i+j)!=t.charAt(j)){\n cnt++;\n }\n \n \n }",
"{\n if(s.charAt(i+j)!=t.charAt(j)){\n cnt++;\n }\n \n \n }",
"if(s.charAt(i+j)!=t.charAt(j)){\n cnt++;\n }",
"s.charAt(i+j)!=t.charAt(j)",
"s.charAt(i+j)",
"s.charAt",
"s",
"i+j",
"i",
"j",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"{\n cnt++;\n }",
"cnt++",
"cnt",
"max = Math.min(cnt,max)",
"max",
"Math.min(cnt,max)",
"Math.min",
"Math",
"cnt",
"max",
"out.println(max)",
"out.println",
"out",
"max",
"PrintWriter out",
"out",
"class FastScanner {\n\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) {\n return buffer[ptr++];\n } else {\n return -1;\n }\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) {\n ptr++;\n }\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {\n throw new NumberFormatException();\n }\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] arrayInt(int N) {\n int[] array = new int[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextInt();\n }\n return array;\n }\n\n public long[] arrayLong(int N) {\n long[] array = new long[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextLong();\n }\n return array;\n }\n\n public double[] arrayDouble(int N) {\n double[] array = new double[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n\n public String[] arrayString(int N) {\n String[] array = new String[N];\n for (int i = 0; i < N; i++) {\n array[i] = next();\n }\n return array;\n }\n\n public int randomInt() {\n Random r = new Random();\n int value = r.nextInt((int) 1e6);\n System.out.println(value);\n return value;\n }\n\n public int[] randomInt(int N) {\n int[] array = new int[N];\n Random r = new Random();\n for (int i = 0; i < N; i++) {\n array[i] = r.nextInt((int) 1e6);\n }\n System.out.println(Arrays.toString(array));\n return array;\n }\n\n}",
"FastScanner",
"private final InputStream in = System.in;",
"in",
"System.in",
"System",
"System.in",
"private final byte[] buffer = new byte[1024];",
"buffer",
"new byte[1024]",
"1024",
"private int ptr = 0;",
"ptr",
"0",
"private int buflen = 0;",
"buflen",
"0",
"private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }",
"hasNextByte",
"{\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }",
"if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }",
"ptr < buflen",
"ptr",
"buflen",
"{\n return true;\n }",
"return true;",
"true",
"{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }",
"ptr = 0",
"ptr",
"0",
"try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }",
"catch (IOException e) {\n e.printStackTrace();\n }",
"IOException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n buflen = in.read(buffer);\n }",
"buflen = in.read(buffer)",
"buflen",
"in.read(buffer)",
"in.read",
"in",
"buffer",
"if (buflen <= 0) {\n return false;\n }",
"buflen <= 0",
"buflen",
"0",
"{\n return false;\n }",
"return false;",
"false",
"return true;",
"true",
"private int readByte() {\n if (hasNextByte()) {\n return buffer[ptr++];\n } else {\n return -1;\n }\n }",
"readByte",
"{\n if (hasNextByte()) {\n return buffer[ptr++];\n } else {\n return -1;\n }\n }",
"if (hasNextByte()) {\n return buffer[ptr++];\n } else {\n return -1;\n }",
"hasNextByte()",
"hasNextByte",
"{\n return buffer[ptr++];\n }",
"return buffer[ptr++];",
"buffer[ptr++]",
"buffer",
"ptr++",
"ptr",
"{\n return -1;\n }",
"return -1;",
"-1",
"1",
"private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }",
"isPrintableChar",
"{\n return 33 <= c && c <= 126;\n }",
"return 33 <= c && c <= 126;",
"33 <= c && c <= 126",
"33 <= c",
"33",
"c",
"c <= 126",
"c",
"126",
"int c",
"c",
"public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) {\n ptr++;\n }\n return hasNextByte();\n }",
"hasNext",
"{\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) {\n ptr++;\n }\n return hasNextByte();\n }",
"while (hasNextByte() && !isPrintableChar(buffer[ptr])) {\n ptr++;\n }",
"hasNextByte() && !isPrintableChar(buffer[ptr])",
"hasNextByte()",
"hasNextByte",
"!isPrintableChar(buffer[ptr])",
"isPrintableChar(buffer[ptr])",
"isPrintableChar",
"buffer[ptr]",
"buffer",
"ptr",
"{\n ptr++;\n }",
"ptr++",
"ptr",
"return hasNextByte();",
"hasNextByte()",
"hasNextByte",
"public String next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }",
"next",
"{\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }",
"if (!hasNext()) {\n throw new NoSuchElementException();\n }",
"!hasNext()",
"hasNext()",
"hasNext",
"{\n throw new NoSuchElementException();\n }",
"throw new NoSuchElementException();",
"new NoSuchElementException()",
"StringBuilder sb = new StringBuilder();",
"sb",
"new StringBuilder()",
"int b = readByte();",
"b",
"readByte()",
"readByte",
"while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }",
"isPrintableChar(b)",
"isPrintableChar",
"b",
"{\n sb.appendCodePoint(b);\n b = readByte();\n }",
"sb.appendCodePoint(b)",
"sb.appendCodePoint",
"sb",
"b",
"b = readByte()",
"b",
"readByte()",
"readByte",
"return sb.toString();",
"sb.toString()",
"sb.toString",
"sb",
"public long nextLong() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }",
"nextLong",
"{\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }",
"if (!hasNext()) {\n throw new NoSuchElementException();\n }",
"!hasNext()",
"hasNext()",
"hasNext",
"{\n throw new NoSuchElementException();\n }",
"throw new NoSuchElementException();",
"new NoSuchElementException()",
"long n = 0;",
"n",
"0",
"boolean minus = false;",
"minus",
"false",
"int b = readByte();",
"b",
"readByte()",
"readByte",
"if (b == '-') {\n minus = true;\n b = readByte();\n }",
"b == '-'",
"b",
"'-'",
"{\n minus = true;\n b = readByte();\n }",
"minus = true",
"minus",
"true",
"b = readByte()",
"b",
"readByte()",
"readByte",
"if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }",
"b < '0' || '9' < b",
"b < '0'",
"b",
"'0'",
"'9' < b",
"'9'",
"b",
"{\n throw new NumberFormatException();\n }",
"throw new NumberFormatException();",
"new NumberFormatException()",
"while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }",
"true",
"{\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }",
"if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }",
"'0' <= b && b <= '9'",
"'0' <= b",
"'0'",
"b",
"b <= '9'",
"b",
"'9'",
"{\n n *= 10;\n n += b - '0';\n }",
"n *= 10",
"n",
"10",
"n += b - '0'",
"n",
"b - '0'",
"b",
"'0'",
"if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }",
"b == -1 || !isPrintableChar(b)",
"b == -1",
"b",
"-1",
"1",
"!isPrintableChar(b)",
"isPrintableChar(b)",
"isPrintableChar",
"b",
"{\n return minus ? -n : n;\n }",
"return minus ? -n : n;",
"minus ? -n : n",
"minus",
"-n",
"n",
"n",
"{\n throw new NumberFormatException();\n }",
"throw new NumberFormatException();",
"new NumberFormatException()",
"b = readByte()",
"b",
"readByte()",
"readByte",
"public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {\n throw new NumberFormatException();\n }\n return (int) nl;\n }",
"nextInt",
"{\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {\n throw new NumberFormatException();\n }\n return (int) nl;\n }",
"long nl = nextLong();",
"nl",
"nextLong()",
"nextLong",
"if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {\n throw new NumberFormatException();\n }",
"nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE",
"nl < Integer.MIN_VALUE",
"nl",
"Integer.MIN_VALUE",
"Integer",
"Integer.MIN_VALUE",
"nl > Integer.MAX_VALUE",
"nl",
"Integer.MAX_VALUE",
"Integer",
"Integer.MAX_VALUE",
"{\n throw new NumberFormatException();\n }",
"throw new NumberFormatException();",
"new NumberFormatException()",
"return (int) nl;",
"(int) nl",
"public double nextDouble() {\n return Double.parseDouble(next());\n }",
"nextDouble",
"{\n return Double.parseDouble(next());\n }",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"public int[] arrayInt(int N) {\n int[] array = new int[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextInt();\n }\n return array;\n }",
"arrayInt",
"{\n int[] array = new int[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextInt();\n }\n return array;\n }",
"int[] array = new int[N];",
"array",
"new int[N]",
"N",
"for (int i = 0; i < N; i++) {\n array[i] = nextInt();\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < N",
"i",
"N",
"i++",
"i++",
"i",
"{\n array[i] = nextInt();\n }",
"{\n array[i] = nextInt();\n }",
"array[i] = nextInt()",
"array[i]",
"array",
"i",
"nextInt()",
"nextInt",
"return array;",
"array",
"int N",
"N",
"public long[] arrayLong(int N) {\n long[] array = new long[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextLong();\n }\n return array;\n }",
"arrayLong",
"{\n long[] array = new long[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextLong();\n }\n return array;\n }",
"long[] array = new long[N];",
"array",
"new long[N]",
"N",
"for (int i = 0; i < N; i++) {\n array[i] = nextLong();\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < N",
"i",
"N",
"i++",
"i++",
"i",
"{\n array[i] = nextLong();\n }",
"{\n array[i] = nextLong();\n }",
"array[i] = nextLong()",
"array[i]",
"array",
"i",
"nextLong()",
"nextLong",
"return array;",
"array",
"int N",
"N",
"public double[] arrayDouble(int N) {\n double[] array = new double[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextDouble();\n }\n return array;\n }",
"arrayDouble",
"{\n double[] array = new double[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextDouble();\n }\n return array;\n }",
"double[] array = new double[N];",
"array",
"new double[N]",
"N",
"for (int i = 0; i < N; i++) {\n array[i] = nextDouble();\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < N",
"i",
"N",
"i++",
"i++",
"i",
"{\n array[i] = nextDouble();\n }",
"{\n array[i] = nextDouble();\n }",
"array[i] = nextDouble()",
"array[i]",
"array",
"i",
"nextDouble()",
"nextDouble",
"return array;",
"array",
"int N",
"N",
"public String[] arrayString(int N) {\n String[] array = new String[N];\n for (int i = 0; i < N; i++) {\n array[i] = next();\n }\n return array;\n }",
"arrayString",
"{\n String[] array = new String[N];\n for (int i = 0; i < N; i++) {\n array[i] = next();\n }\n return array;\n }",
"String[] array = new String[N];",
"array",
"new String[N]",
"N",
"for (int i = 0; i < N; i++) {\n array[i] = next();\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < N",
"i",
"N",
"i++",
"i++",
"i",
"{\n array[i] = next();\n }",
"{\n array[i] = next();\n }",
"array[i] = next()",
"array[i]",
"array",
"i",
"next()",
"next",
"return array;",
"array",
"int N",
"N",
"public int randomInt() {\n Random r = new Random();\n int value = r.nextInt((int) 1e6);\n System.out.println(value);\n return value;\n }",
"randomInt",
"{\n Random r = new Random();\n int value = r.nextInt((int) 1e6);\n System.out.println(value);\n return value;\n }",
"Random r = new Random();",
"r",
"new Random()",
"int value = r.nextInt((int) 1e6);",
"value",
"r.nextInt((int) 1e6)",
"r.nextInt",
"r",
"(int) 1e6",
"System.out.println(value)",
"System.out.println",
"System.out",
"System",
"System.out",
"value",
"return value;",
"value",
"public int[] randomInt(int N) {\n int[] array = new int[N];\n Random r = new Random();\n for (int i = 0; i < N; i++) {\n array[i] = r.nextInt((int) 1e6);\n }\n System.out.println(Arrays.toString(array));\n return array;\n }",
"randomInt",
"{\n int[] array = new int[N];\n Random r = new Random();\n for (int i = 0; i < N; i++) {\n array[i] = r.nextInt((int) 1e6);\n }\n System.out.println(Arrays.toString(array));\n return array;\n }",
"int[] array = new int[N];",
"array",
"new int[N]",
"N",
"Random r = new Random();",
"r",
"new Random()",
"for (int i = 0; i < N; i++) {\n array[i] = r.nextInt((int) 1e6);\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < N",
"i",
"N",
"i++",
"i++",
"i",
"{\n array[i] = r.nextInt((int) 1e6);\n }",
"{\n array[i] = r.nextInt((int) 1e6);\n }",
"array[i] = r.nextInt((int) 1e6)",
"array[i]",
"array",
"i",
"r.nextInt((int) 1e6)",
"r.nextInt",
"r",
"(int) 1e6",
"System.out.println(Arrays.toString(array))",
"System.out.println",
"System.out",
"System",
"System.out",
"Arrays.toString(array)",
"Arrays.toString",
"Arrays",
"array",
"return array;",
"array",
"int N",
"N",
"class My {\n\n public static long lower(long arr[],long key){\n int low = 0;\n int high = arr.length-1;\n while(low < high){\n int mid = low + (high - low)/2;\n if(arr[mid] >= key){\n high = mid;\n }\n else{\n low = mid+1;\n }\n }\n return low;\n }\npublic static int upper(int arr[],int key){\n int low = 0;\n int high = arr.length-1;\n while(low < high){\n int mid = low + (high - low+1)/2;\n if(arr[mid] <= key){\n low = mid;\n }\n else{\n high = mid-1;\n }\n }\n return low;\n}\n static void ans(boolean b) {\n System.out.println(b ? \"Yes\" : \"No\");\n }\n\n static void ANS(boolean b) {\n System.out.println(b ? \"YES\" : \"NO\");\n }\n\n static String sort(String s) {\n char[] ch = s.toCharArray();\n Arrays.sort(ch);\n return String.valueOf(ch);\n }\n\n static String reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n static int[] reverse(int[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n int temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static long[] reverse(long[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n long temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static double[] reverse(double[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n double temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static String[] reverse(String[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n String temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static char[] reverse(char[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n char temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static long min(long... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static int min(int... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static double min(double... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static long max(long... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static int max(int... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static double max(double... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static int sum(long number) {\n int sum = 0;\n while (number > 0) {\n sum += number % 10;\n number /= 10;\n }\n return sum;\n }\n\n}",
"My",
"public static long lower(long arr[],long key){\n int low = 0;\n int high = arr.length-1;\n while(low < high){\n int mid = low + (high - low)/2;\n if(arr[mid] >= key){\n high = mid;\n }\n else{\n low = mid+1;\n }\n }\n return low;\n }",
"lower",
"{\n int low = 0;\n int high = arr.length-1;\n while(low < high){\n int mid = low + (high - low)/2;\n if(arr[mid] >= key){\n high = mid;\n }\n else{\n low = mid+1;\n }\n }\n return low;\n }",
"int low = 0;",
"low",
"0",
"int high = arr.length-1;",
"high",
"arr.length-1",
"arr.length",
"arr",
"arr.length",
"1",
"while(low < high){\n int mid = low + (high - low)/2;\n if(arr[mid] >= key){\n high = mid;\n }\n else{\n low = mid+1;\n }\n }",
"low < high",
"low",
"high",
"{\n int mid = low + (high - low)/2;\n if(arr[mid] >= key){\n high = mid;\n }\n else{\n low = mid+1;\n }\n }",
"int mid = low + (high - low)/2;",
"mid",
"low + (high - low)/2",
"low",
"(high - low)/2",
"(high - low)",
"high",
"low",
"2",
"if(arr[mid] >= key){\n high = mid;\n }\n else{\n low = mid+1;\n }",
"arr[mid] >= key",
"arr[mid]",
"arr",
"mid",
"key",
"{\n high = mid;\n }",
"high = mid",
"high",
"mid",
"{\n low = mid+1;\n }",
"low = mid+1",
"low",
"mid+1",
"mid",
"1",
"return low;",
"low",
"long arr[]",
"arr",
"long key",
"key",
"public static int upper(int arr[],int key){\n int low = 0;\n int high = arr.length-1;\n while(low < high){\n int mid = low + (high - low+1)/2;\n if(arr[mid] <= key){\n low = mid;\n }\n else{\n high = mid-1;\n }\n }\n return low;\n}",
"upper",
"{\n int low = 0;\n int high = arr.length-1;\n while(low < high){\n int mid = low + (high - low+1)/2;\n if(arr[mid] <= key){\n low = mid;\n }\n else{\n high = mid-1;\n }\n }\n return low;\n}",
"int low = 0;",
"low",
"0",
"int high = arr.length-1;",
"high",
"arr.length-1",
"arr.length",
"arr",
"arr.length",
"1",
"while(low < high){\n int mid = low + (high - low+1)/2;\n if(arr[mid] <= key){\n low = mid;\n }\n else{\n high = mid-1;\n }\n }",
"low < high",
"low",
"high",
"{\n int mid = low + (high - low+1)/2;\n if(arr[mid] <= key){\n low = mid;\n }\n else{\n high = mid-1;\n }\n }",
"int mid = low + (high - low+1)/2;",
"mid",
"low + (high - low+1)/2",
"low",
"(high - low+1)/2",
"(high - low+1)",
"high - low",
"high",
"low",
"1",
"2",
"if(arr[mid] <= key){\n low = mid;\n }\n else{\n high = mid-1;\n }",
"arr[mid] <= key",
"arr[mid]",
"arr",
"mid",
"key",
"{\n low = mid;\n }",
"low = mid",
"low",
"mid",
"{\n high = mid-1;\n }",
"high = mid-1",
"high",
"mid-1",
"mid",
"1",
"return low;",
"low",
"int arr[]",
"arr",
"int key",
"key",
"static void ans(boolean b) {\n System.out.println(b ? \"Yes\" : \"No\");\n }",
"ans",
"{\n System.out.println(b ? \"Yes\" : \"No\");\n }",
"System.out.println(b ? \"Yes\" : \"No\")",
"System.out.println",
"System.out",
"System",
"System.out",
"b ? \"Yes\" : \"No\"",
"b",
"\"Yes\"",
"\"No\"",
"boolean b",
"b",
"static void ANS(boolean b) {\n System.out.println(b ? \"YES\" : \"NO\");\n }",
"ANS",
"{\n System.out.println(b ? \"YES\" : \"NO\");\n }",
"System.out.println(b ? \"YES\" : \"NO\")",
"System.out.println",
"System.out",
"System",
"System.out",
"b ? \"YES\" : \"NO\"",
"b",
"\"YES\"",
"\"NO\"",
"boolean b",
"b",
"static String sort(String s) {\n char[] ch = s.toCharArray();\n Arrays.sort(ch);\n return String.valueOf(ch);\n }",
"sort",
"{\n char[] ch = s.toCharArray();\n Arrays.sort(ch);\n return String.valueOf(ch);\n }",
"char[] ch = s.toCharArray();",
"ch",
"s.toCharArray()",
"s.toCharArray",
"s",
"Arrays.sort(ch)",
"Arrays.sort",
"Arrays",
"ch",
"return String.valueOf(ch);",
"String.valueOf(ch)",
"String.valueOf",
"String",
"ch",
"String s",
"s",
"static String reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }",
"reverse",
"{\n return new StringBuilder(s).reverse().toString();\n }",
"return new StringBuilder(s).reverse().toString();",
"new StringBuilder(s).reverse().toString()",
"new StringBuilder(s).reverse().toString",
"new StringBuilder(s).reverse()",
"new StringBuilder(s).reverse",
"new StringBuilder(s)",
"String s",
"s",
"static int[] reverse(int[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n int temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }",
"reverse",
"{\n for (int i = 0; i < array.length / 2; i++) {\n int temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }",
"for (int i = 0; i < array.length / 2; i++) {\n int temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < array.length / 2",
"i",
"array.length / 2",
"array.length",
"array",
"array.length",
"2",
"i++",
"i++",
"i",
"{\n int temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }",
"{\n int temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }",
"int temp = array[i];",
"temp",
"array[i]",
"array",
"i",
"array[i] = array[array.length - 1 - i]",
"array[i]",
"array",
"i",
"array[array.length - 1 - i]",
"array",
"array.length - 1 - i",
"array.length - 1 - i",
"array.length",
"array",
"array.length",
"1",
"i",
"array[array.length - 1 - i] = temp",
"array[array.length - 1 - i]",
"array",
"array.length - 1 - i",
"array.length - 1 - i",
"array.length",
"array",
"array.length",
"1",
"i",
"temp",
"return array;",
"array",
"int[] array",
"array",
"static long[] reverse(long[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n long temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }",
"reverse",
"{\n for (int i = 0; i < array.length / 2; i++) {\n long temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }",
"for (int i = 0; i < array.length / 2; i++) {\n long temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < array.length / 2",
"i",
"array.length / 2",
"array.length",
"array",
"array.length",
"2",
"i++",
"i++",
"i",
"{\n long temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }",
"{\n long temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }",
"long temp = array[i];",
"temp",
"array[i]",
"array",
"i",
"array[i] = array[array.length - 1 - i]",
"array[i]",
"array",
"i",
"array[array.length - 1 - i]",
"array",
"array.length - 1 - i",
"array.length - 1 - i",
"array.length",
"array",
"array.length",
"1",
"i",
"array[array.length - 1 - i] = temp",
"array[array.length - 1 - i]",
"array",
"array.length - 1 - i",
"array.length - 1 - i",
"array.length",
"array",
"array.length",
"1",
"i",
"temp",
"return array;",
"array",
"long[] array",
"array",
"static double[] reverse(double[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n double temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }",
"reverse",
"{\n for (int i = 0; i < array.length / 2; i++) {\n double temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }",
"for (int i = 0; i < array.length / 2; i++) {\n double temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < array.length / 2",
"i",
"array.length / 2",
"array.length",
"array",
"array.length",
"2",
"i++",
"i++",
"i",
"{\n double temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }",
"{\n double temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }",
"double temp = array[i];",
"temp",
"array[i]",
"array",
"i",
"array[i] = array[array.length - 1 - i]",
"array[i]",
"array",
"i",
"array[array.length - 1 - i]",
"array",
"array.length - 1 - i",
"array.length - 1 - i",
"array.length",
"array",
"array.length",
"1",
"i",
"array[array.length - 1 - i] = temp",
"array[array.length - 1 - i]",
"array",
"array.length - 1 - i",
"array.length - 1 - i",
"array.length",
"array",
"array.length",
"1",
"i",
"temp",
"return array;",
"array",
"double[] array",
"array",
"static String[] reverse(String[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n String temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }",
"reverse",
"{\n for (int i = 0; i < array.length / 2; i++) {\n String temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }",
"for (int i = 0; i < array.length / 2; i++) {\n String temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < array.length / 2",
"i",
"array.length / 2",
"array.length",
"array",
"array.length",
"2",
"i++",
"i++",
"i",
"{\n String temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }",
"{\n String temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }",
"String temp = array[i];",
"temp",
"array[i]",
"array",
"i",
"array[i] = array[array.length - 1 - i]",
"array[i]",
"array",
"i",
"array[array.length - 1 - i]",
"array",
"array.length - 1 - i",
"array.length - 1 - i",
"array.length",
"array",
"array.length",
"1",
"i",
"array[array.length - 1 - i] = temp",
"array[array.length - 1 - i]",
"array",
"array.length - 1 - i",
"array.length - 1 - i",
"array.length",
"array",
"array.length",
"1",
"i",
"temp",
"return array;",
"array",
"String[] array",
"array",
"static char[] reverse(char[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n char temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }",
"reverse",
"{\n for (int i = 0; i < array.length / 2; i++) {\n char temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }",
"for (int i = 0; i < array.length / 2; i++) {\n char temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < array.length / 2",
"i",
"array.length / 2",
"array.length",
"array",
"array.length",
"2",
"i++",
"i++",
"i",
"{\n char temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }",
"{\n char temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }",
"char temp = array[i];",
"temp",
"array[i]",
"array",
"i",
"array[i] = array[array.length - 1 - i]",
"array[i]",
"array",
"i",
"array[array.length - 1 - i]",
"array",
"array.length - 1 - i",
"array.length - 1 - i",
"array.length",
"array",
"array.length",
"1",
"i",
"array[array.length - 1 - i] = temp",
"array[array.length - 1 - i]",
"array",
"array.length - 1 - i",
"array.length - 1 - i",
"array.length",
"array",
"array.length",
"1",
"i",
"temp",
"return array;",
"array",
"char[] array",
"array",
"static long min(long... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }",
"min",
"{\n Arrays.sort(numbers);\n return numbers[0];\n }",
"Arrays.sort(numbers)",
"Arrays.sort",
"Arrays",
"numbers",
"return numbers[0];",
"numbers[0]",
"numbers",
"0",
"long... numbers",
"numbers",
"static int min(int... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }",
"min",
"{\n Arrays.sort(numbers);\n return numbers[0];\n }",
"Arrays.sort(numbers)",
"Arrays.sort",
"Arrays",
"numbers",
"return numbers[0];",
"numbers[0]",
"numbers",
"0",
"int... numbers",
"numbers",
"static double min(double... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }",
"min",
"{\n Arrays.sort(numbers);\n return numbers[0];\n }",
"Arrays.sort(numbers)",
"Arrays.sort",
"Arrays",
"numbers",
"return numbers[0];",
"numbers[0]",
"numbers",
"0",
"double... numbers",
"numbers",
"static long max(long... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }",
"max",
"{\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }",
"Arrays.sort(numbers)",
"Arrays.sort",
"Arrays",
"numbers",
"return numbers[numbers.length - 1];",
"numbers[numbers.length - 1]",
"numbers",
"numbers.length - 1",
"numbers.length",
"numbers",
"numbers.length",
"1",
"long... numbers",
"numbers",
"static int max(int... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }",
"max",
"{\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }",
"Arrays.sort(numbers)",
"Arrays.sort",
"Arrays",
"numbers",
"return numbers[numbers.length - 1];",
"numbers[numbers.length - 1]",
"numbers",
"numbers.length - 1",
"numbers.length",
"numbers",
"numbers.length",
"1",
"int... numbers",
"numbers",
"static double max(double... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }",
"max",
"{\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }",
"Arrays.sort(numbers)",
"Arrays.sort",
"Arrays",
"numbers",
"return numbers[numbers.length - 1];",
"numbers[numbers.length - 1]",
"numbers",
"numbers.length - 1",
"numbers.length",
"numbers",
"numbers.length",
"1",
"double... numbers",
"numbers",
"static int sum(long number) {\n int sum = 0;\n while (number > 0) {\n sum += number % 10;\n number /= 10;\n }\n return sum;\n }",
"sum",
"{\n int sum = 0;\n while (number > 0) {\n sum += number % 10;\n number /= 10;\n }\n return sum;\n }",
"int sum = 0;",
"sum",
"0",
"while (number > 0) {\n sum += number % 10;\n number /= 10;\n }",
"number > 0",
"number",
"0",
"{\n sum += number % 10;\n number /= 10;\n }",
"sum += number % 10",
"sum",
"number % 10",
"number",
"10",
"number /= 10",
"number",
"10",
"return sum;",
"sum",
"long number",
"number",
"public class Main {\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n // int t = sc.nextInt();\n //while(t-->0){\n Naveen problem = new Naveen(sc);\n problem.solve(out);\n // }\n out.flush();\n }\n\n}",
"public class Main {\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n // int t = sc.nextInt();\n //while(t-->0){\n Naveen problem = new Naveen(sc);\n problem.solve(out);\n // }\n out.flush();\n }\n\n}",
"Main"
]
| import java.text.DecimalFormat;
import java.util.stream.LongStream;
import java.util.stream.IntStream;
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
FastScanner sc = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
// int t = sc.nextInt();
//while(t-->0){
Naveen problem = new Naveen(sc);
problem.solve(out);
// }
out.flush();
}
}
class Naveen {
String s;
String t;
//int[] arr;
Naveen(FastScanner sc) {
s= sc.next();
t= sc.next();
// arr = sc.arrayInt(n);
}
void solve(PrintWriter out) {
int max = t.length();
for(int i =0;i<=s.length()-t.length();i++){
int cnt =0;
for(int j =0;j<t.length();j++){
if(s.charAt(i+j)!=t.charAt(j)){
cnt++;
}
}
max = Math.min(cnt,max);
}
out.println(max);
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte()) {
return buffer[ptr++];
} else {
return -1;
}
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[ptr])) {
ptr++;
}
return hasNextByte();
}
public String next() {
if (!hasNext()) {
throw new NoSuchElementException();
}
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) {
throw new NoSuchElementException();
}
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
throw new NumberFormatException();
}
return (int) nl;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public int[] arrayInt(int N) {
int[] array = new int[N];
for (int i = 0; i < N; i++) {
array[i] = nextInt();
}
return array;
}
public long[] arrayLong(int N) {
long[] array = new long[N];
for (int i = 0; i < N; i++) {
array[i] = nextLong();
}
return array;
}
public double[] arrayDouble(int N) {
double[] array = new double[N];
for (int i = 0; i < N; i++) {
array[i] = nextDouble();
}
return array;
}
public String[] arrayString(int N) {
String[] array = new String[N];
for (int i = 0; i < N; i++) {
array[i] = next();
}
return array;
}
public int randomInt() {
Random r = new Random();
int value = r.nextInt((int) 1e6);
System.out.println(value);
return value;
}
public int[] randomInt(int N) {
int[] array = new int[N];
Random r = new Random();
for (int i = 0; i < N; i++) {
array[i] = r.nextInt((int) 1e6);
}
System.out.println(Arrays.toString(array));
return array;
}
}
class My {
public static long lower(long arr[],long key){
int low = 0;
int high = arr.length-1;
while(low < high){
int mid = low + (high - low)/2;
if(arr[mid] >= key){
high = mid;
}
else{
low = mid+1;
}
}
return low;
}
public static int upper(int arr[],int key){
int low = 0;
int high = arr.length-1;
while(low < high){
int mid = low + (high - low+1)/2;
if(arr[mid] <= key){
low = mid;
}
else{
high = mid-1;
}
}
return low;
}
static void ans(boolean b) {
System.out.println(b ? "Yes" : "No");
}
static void ANS(boolean b) {
System.out.println(b ? "YES" : "NO");
}
static String sort(String s) {
char[] ch = s.toCharArray();
Arrays.sort(ch);
return String.valueOf(ch);
}
static String reverse(String s) {
return new StringBuilder(s).reverse().toString();
}
static int[] reverse(int[] array) {
for (int i = 0; i < array.length / 2; i++) {
int temp = array[i];
array[i] = array[array.length - 1 - i];
array[array.length - 1 - i] = temp;
}
return array;
}
static long[] reverse(long[] array) {
for (int i = 0; i < array.length / 2; i++) {
long temp = array[i];
array[i] = array[array.length - 1 - i];
array[array.length - 1 - i] = temp;
}
return array;
}
static double[] reverse(double[] array) {
for (int i = 0; i < array.length / 2; i++) {
double temp = array[i];
array[i] = array[array.length - 1 - i];
array[array.length - 1 - i] = temp;
}
return array;
}
static String[] reverse(String[] array) {
for (int i = 0; i < array.length / 2; i++) {
String temp = array[i];
array[i] = array[array.length - 1 - i];
array[array.length - 1 - i] = temp;
}
return array;
}
static char[] reverse(char[] array) {
for (int i = 0; i < array.length / 2; i++) {
char temp = array[i];
array[i] = array[array.length - 1 - i];
array[array.length - 1 - i] = temp;
}
return array;
}
static long min(long... numbers) {
Arrays.sort(numbers);
return numbers[0];
}
static int min(int... numbers) {
Arrays.sort(numbers);
return numbers[0];
}
static double min(double... numbers) {
Arrays.sort(numbers);
return numbers[0];
}
static long max(long... numbers) {
Arrays.sort(numbers);
return numbers[numbers.length - 1];
}
static int max(int... numbers) {
Arrays.sort(numbers);
return numbers[numbers.length - 1];
}
static double max(double... numbers) {
Arrays.sort(numbers);
return numbers[numbers.length - 1];
}
static int sum(long number) {
int sum = 0;
while (number > 0) {
sum += number % 10;
number /= 10;
}
return sum;
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
2,
4,
18,
13,
4,
18,
13,
1,
40,
13,
30,
30,
41,
13,
17,
11,
1,
41,
13,
17,
2,
13,
4,
18,
13,
1,
40,
13,
30,
30,
14,
2,
4,
18,
13,
2,
13,
13,
4,
18,
13,
13,
30,
40,
13,
0,
13,
4,
18,
13,
13,
13,
14,
2,
13,
17,
4,
18,
18,
13,
13,
2,
4,
18,
13,
13,
4,
18,
18,
13,
13,
4,
18,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
112,
5
],
[
112,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
23,
24
],
[
8,
25
],
[
25,
26
],
[
25,
27
],
[
8,
28
],
[
28,
29
],
[
29,
30
],
[
30,
31
],
[
30,
32
],
[
28,
33
],
[
33,
34
],
[
33,
35
],
[
35,
36
],
[
36,
37
],
[
37,
38
],
[
35,
39
],
[
39,
40
],
[
40,
41
],
[
28,
42
],
[
42,
43
],
[
43,
44
],
[
28,
45
],
[
46,
46
],
[
46,
47
],
[
47,
48
],
[
47,
49
],
[
46,
50
],
[
50,
51
],
[
51,
52
],
[
52,
53
],
[
52,
54
],
[
50,
55
],
[
55,
56
],
[
55,
57
],
[
57,
58
],
[
58,
59
],
[
50,
60
],
[
60,
61
],
[
61,
62
],
[
50,
63
],
[
64,
64
],
[
64,
65
],
[
65,
66
],
[
66,
67
],
[
67,
68
],
[
68,
69
],
[
67,
70
],
[
70,
71
],
[
70,
72
],
[
66,
73
],
[
73,
74
],
[
74,
75
],
[
73,
76
],
[
65,
77
],
[
77,
78
],
[
78,
79
],
[
46,
80
],
[
80,
81
],
[
80,
82
],
[
82,
83
],
[
83,
84
],
[
82,
85
],
[
82,
86
],
[
8,
87
],
[
87,
88
],
[
88,
89
],
[
88,
90
],
[
87,
91
],
[
91,
92
],
[
92,
93
],
[
93,
94
],
[
93,
95
],
[
91,
96
],
[
96,
97
],
[
97,
98
],
[
98,
99
],
[
96,
100
],
[
87,
101
],
[
101,
102
],
[
102,
103
],
[
103,
104
],
[
103,
105
],
[
101,
106
],
[
106,
107
],
[
107,
108
],
[
6,
109
],
[
109,
110
],
[
0,
111
],
[
111,
112
],
[
111,
113
]
]
| [
"import java.util.Scanner;\n\npublic class Main {\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n String s = sc.nextLine();\n String t = sc.nextLine();\n sc.close();\n\n int ans = 0;\n for(int i=0; i<=s.length()-t.length(); i++) {\n int match = 0;\n for(int j=0; j<t.length(); j++) {\n if(s.charAt(i+j) == t.charAt(j)) {\n match++;\n }\n }\n ans = Math.max(ans,match);\n }\n if(ans != 0) System.out.println(t.length()-ans);\n else System.out.println(t.length());\n\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n String s = sc.nextLine();\n String t = sc.nextLine();\n sc.close();\n\n int ans = 0;\n for(int i=0; i<=s.length()-t.length(); i++) {\n int match = 0;\n for(int j=0; j<t.length(); j++) {\n if(s.charAt(i+j) == t.charAt(j)) {\n match++;\n }\n }\n ans = Math.max(ans,match);\n }\n if(ans != 0) System.out.println(t.length()-ans);\n else System.out.println(t.length());\n\n }\n}",
"Main",
"public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n String s = sc.nextLine();\n String t = sc.nextLine();\n sc.close();\n\n int ans = 0;\n for(int i=0; i<=s.length()-t.length(); i++) {\n int match = 0;\n for(int j=0; j<t.length(); j++) {\n if(s.charAt(i+j) == t.charAt(j)) {\n match++;\n }\n }\n ans = Math.max(ans,match);\n }\n if(ans != 0) System.out.println(t.length()-ans);\n else System.out.println(t.length());\n\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n String s = sc.nextLine();\n String t = sc.nextLine();\n sc.close();\n\n int ans = 0;\n for(int i=0; i<=s.length()-t.length(); i++) {\n int match = 0;\n for(int j=0; j<t.length(); j++) {\n if(s.charAt(i+j) == t.charAt(j)) {\n match++;\n }\n }\n ans = Math.max(ans,match);\n }\n if(ans != 0) System.out.println(t.length()-ans);\n else System.out.println(t.length());\n\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"String s = sc.nextLine();",
"s",
"sc.nextLine()",
"sc.nextLine",
"sc",
"String t = sc.nextLine();",
"t",
"sc.nextLine()",
"sc.nextLine",
"sc",
"sc.close()",
"sc.close",
"sc",
"int ans = 0;",
"ans",
"0",
"for(int i=0; i<=s.length()-t.length(); i++) {\n int match = 0;\n for(int j=0; j<t.length(); j++) {\n if(s.charAt(i+j) == t.charAt(j)) {\n match++;\n }\n }\n ans = Math.max(ans,match);\n }",
"int i=0;",
"int i=0;",
"i",
"0",
"i<=s.length()-t.length()",
"i",
"s.length()-t.length()",
"s.length()",
"s.length",
"s",
"t.length()",
"t.length",
"t",
"i++",
"i++",
"i",
"{\n int match = 0;\n for(int j=0; j<t.length(); j++) {\n if(s.charAt(i+j) == t.charAt(j)) {\n match++;\n }\n }\n ans = Math.max(ans,match);\n }",
"{\n int match = 0;\n for(int j=0; j<t.length(); j++) {\n if(s.charAt(i+j) == t.charAt(j)) {\n match++;\n }\n }\n ans = Math.max(ans,match);\n }",
"int match = 0;",
"match",
"0",
"for(int j=0; j<t.length(); j++) {\n if(s.charAt(i+j) == t.charAt(j)) {\n match++;\n }\n }",
"int j=0;",
"int j=0;",
"j",
"0",
"j<t.length()",
"j",
"t.length()",
"t.length",
"t",
"j++",
"j++",
"j",
"{\n if(s.charAt(i+j) == t.charAt(j)) {\n match++;\n }\n }",
"{\n if(s.charAt(i+j) == t.charAt(j)) {\n match++;\n }\n }",
"if(s.charAt(i+j) == t.charAt(j)) {\n match++;\n }",
"s.charAt(i+j) == t.charAt(j)",
"s.charAt(i+j)",
"s.charAt",
"s",
"i+j",
"i",
"j",
"t.charAt(j)",
"t.charAt",
"t",
"j",
"{\n match++;\n }",
"match++",
"match",
"ans = Math.max(ans,match)",
"ans",
"Math.max(ans,match)",
"Math.max",
"Math",
"ans",
"match",
"if(ans != 0) System.out.println(t.length()-ans);\n else System.out.println(t.length());",
"ans != 0",
"ans",
"0",
"System.out.println(t.length()-ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"t.length()-ans",
"t.length()",
"t.length",
"t",
"ans",
"System.out.println(t.length())",
"System.out.println",
"System.out",
"System",
"System.out",
"t.length()",
"t.length",
"t",
"String args[]",
"args",
"public class Main {\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n String s = sc.nextLine();\n String t = sc.nextLine();\n sc.close();\n\n int ans = 0;\n for(int i=0; i<=s.length()-t.length(); i++) {\n int match = 0;\n for(int j=0; j<t.length(); j++) {\n if(s.charAt(i+j) == t.charAt(j)) {\n match++;\n }\n }\n ans = Math.max(ans,match);\n }\n if(ans != 0) System.out.println(t.length()-ans);\n else System.out.println(t.length());\n\n }\n}",
"public class Main {\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n String s = sc.nextLine();\n String t = sc.nextLine();\n sc.close();\n\n int ans = 0;\n for(int i=0; i<=s.length()-t.length(); i++) {\n int match = 0;\n for(int j=0; j<t.length(); j++) {\n if(s.charAt(i+j) == t.charAt(j)) {\n match++;\n }\n }\n ans = Math.max(ans,match);\n }\n if(ans != 0) System.out.println(t.length()-ans);\n else System.out.println(t.length());\n\n }\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
String s = sc.nextLine();
String t = sc.nextLine();
sc.close();
int ans = 0;
for(int i=0; i<=s.length()-t.length(); i++) {
int match = 0;
for(int j=0; j<t.length(); j++) {
if(s.charAt(i+j) == t.charAt(j)) {
match++;
}
}
ans = Math.max(ans,match);
}
if(ans != 0) System.out.println(t.length()-ans);
else System.out.println(t.length());
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
4,
18,
18,
13,
13,
2,
4,
18,
13,
2,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
43,
5
],
[
43,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
25,
26
],
[
8,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
29,
31
],
[
27,
32
],
[
32,
33
],
[
33,
34
],
[
34,
35
],
[
33,
36
],
[
36,
37
],
[
36,
38
],
[
32,
39
],
[
6,
40
],
[
40,
41
],
[
0,
42
],
[
42,
43
],
[
42,
44
]
]
| [
"import java.util.Scanner;\n\npublic class Main {\n public static void main(String... args) {\n Scanner scanner = new Scanner(System.in);\n\n double N = scanner.nextInt();\n double X = scanner.nextInt();\n int T = scanner.nextInt();\n\n System.out.println((int) Math.ceil(N/X) * T);\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n public static void main(String... args) {\n Scanner scanner = new Scanner(System.in);\n\n double N = scanner.nextInt();\n double X = scanner.nextInt();\n int T = scanner.nextInt();\n\n System.out.println((int) Math.ceil(N/X) * T);\n }\n}",
"Main",
"public static void main(String... args) {\n Scanner scanner = new Scanner(System.in);\n\n double N = scanner.nextInt();\n double X = scanner.nextInt();\n int T = scanner.nextInt();\n\n System.out.println((int) Math.ceil(N/X) * T);\n }",
"main",
"{\n Scanner scanner = new Scanner(System.in);\n\n double N = scanner.nextInt();\n double X = scanner.nextInt();\n int T = scanner.nextInt();\n\n System.out.println((int) Math.ceil(N/X) * T);\n }",
"Scanner scanner = new Scanner(System.in);",
"scanner",
"new Scanner(System.in)",
"double N = scanner.nextInt();",
"N",
"scanner.nextInt()",
"scanner.nextInt",
"scanner",
"double X = scanner.nextInt();",
"X",
"scanner.nextInt()",
"scanner.nextInt",
"scanner",
"int T = scanner.nextInt();",
"T",
"scanner.nextInt()",
"scanner.nextInt",
"scanner",
"System.out.println((int) Math.ceil(N/X) * T)",
"System.out.println",
"System.out",
"System",
"System.out",
"(int) Math.ceil(N/X) * T",
"(int) Math.ceil(N/X)",
"Math.ceil",
"Math",
"N/X",
"N",
"X",
"T",
"String... args",
"args",
"public class Main {\n public static void main(String... args) {\n Scanner scanner = new Scanner(System.in);\n\n double N = scanner.nextInt();\n double X = scanner.nextInt();\n int T = scanner.nextInt();\n\n System.out.println((int) Math.ceil(N/X) * T);\n }\n}",
"public class Main {\n public static void main(String... args) {\n Scanner scanner = new Scanner(System.in);\n\n double N = scanner.nextInt();\n double X = scanner.nextInt();\n int T = scanner.nextInt();\n\n System.out.println((int) Math.ceil(N/X) * T);\n }\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void main(String... args) {
Scanner scanner = new Scanner(System.in);
double N = scanner.nextInt();
double X = scanner.nextInt();
int T = scanner.nextInt();
System.out.println((int) Math.ceil(N/X) * T);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
2,
13,
13,
41,
13,
2,
13,
13,
4,
18,
18,
13,
13,
2,
2,
13,
13,
8,
2,
13,
17,
13,
17,
23,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
20,
38,
30,
4,
18,
13,
30,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
4,
18,
13,
4,
13,
13,
13,
13,
41,
13,
4,
18,
13,
23,
13,
12,
13,
30,
41,
13,
4,
18,
13,
17,
41,
13,
20,
18,
13,
13,
11,
1,
41,
13,
17,
2,
13,
18,
13,
13,
1,
40,
13,
30,
30,
0,
18,
13,
13,
4,
18,
13,
18,
13,
13,
29,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
132,
5
],
[
132,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
11,
13
],
[
8,
14
],
[
14,
15
],
[
14,
16
],
[
16,
17
],
[
16,
18
],
[
8,
19
],
[
19,
20
],
[
20,
21
],
[
21,
22
],
[
21,
23
],
[
19,
24
],
[
24,
25
],
[
25,
26
],
[
25,
27
],
[
24,
28
],
[
28,
29
],
[
29,
30
],
[
29,
31
],
[
28,
32
],
[
28,
33
],
[
6,
34
],
[
34,
35
],
[
6,
36
],
[
36,
37
],
[
6,
38
],
[
38,
39
],
[
132,
40
],
[
40,
41
],
[
40,
42
],
[
42,
43
],
[
43,
44
],
[
43,
45
],
[
45,
46
],
[
46,
47
],
[
42,
48
],
[
48,
49
],
[
48,
50
],
[
42,
51
],
[
51,
52
],
[
52,
53
],
[
53,
54
],
[
54,
55
],
[
51,
56
],
[
56,
57
],
[
57,
58
],
[
57,
59
],
[
59,
60
],
[
60,
61
],
[
56,
62
],
[
62,
63
],
[
62,
64
],
[
64,
65
],
[
65,
66
],
[
56,
67
],
[
67,
68
],
[
67,
69
],
[
69,
70
],
[
70,
71
],
[
56,
72
],
[
72,
73
],
[
73,
74
],
[
56,
75
],
[
75,
76
],
[
75,
77
],
[
75,
78
],
[
75,
79
],
[
42,
80
],
[
80,
81
],
[
80,
82
],
[
82,
83
],
[
83,
84
],
[
40,
85
],
[
85,
86
],
[
132,
87
],
[
87,
88
],
[
87,
89
],
[
89,
90
],
[
90,
91
],
[
90,
92
],
[
92,
93
],
[
93,
94
],
[
92,
95
],
[
89,
96
],
[
96,
97
],
[
96,
98
],
[
99,
100
],
[
99,
101
],
[
89,
102
],
[
102,
103
],
[
103,
104
],
[
104,
105
],
[
104,
106
],
[
102,
107
],
[
107,
108
],
[
107,
109
],
[
109,
110
],
[
109,
111
],
[
102,
112
],
[
112,
113
],
[
113,
114
],
[
102,
115
],
[
116,
116
],
[
116,
117
],
[
117,
118
],
[
118,
119
],
[
118,
120
],
[
117,
121
],
[
121,
122
],
[
122,
123
],
[
121,
124
],
[
124,
125
],
[
124,
126
],
[
89,
127
],
[
127,
128
],
[
87,
129
],
[
129,
130
],
[
0,
131
],
[
131,
132
],
[
131,
133
]
]
| [
"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void solve (int n, int x, int t) {\n\n\t\tint joyo = n % x ;\n\t\tint ans = n / x ;\n\n\t\tSystem.out.println((ans * t) + (joyo != 0?t:0));\n\n\t}\n\n\tpublic static void main(String[] args) {\n\n\t\tlong start = System.currentTimeMillis();\n\t // 引数で標準入力System.inを指定する\n\t Scanner scanner = new Scanner(System.in);\n\t\ttry {\n\n\t\t // 1行目を取得(a)\n\t\t\tint n = scanner.nextInt();\n\t\t\tint x = scanner.nextInt();\n\t\t\tint t = scanner.nextInt();\n\t\t\tscanner.nextLine();\n\n\t\t\tsolve(n, x, t);\n\n\t\t} finally {\n\t\t // Scannerクラスのインスタンスをクローズ\n\t\t scanner.close();\n\t\t}\n\t\tlong end = System.currentTimeMillis();\n\t\t// System.out.println((end - start) );\n\t}\n\n\n\t// ************************************\n\t// Common\n\t// ************************************\n\n\tprivate static final int[] changeArrayStringToInt(String line) {\n\n\t\tString[] strArray = line.split(\" \");\n\n\t\tint[] intArray = new int[strArray.length];\n\n\t\tfor (int i = 0; i < intArray.length; i++) {\n\t\t\tintArray[i] = Integer.parseInt(strArray[i]);\n\t\t}\n\t\treturn intArray;\n\t}\n\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n\tpublic static void solve (int n, int x, int t) {\n\n\t\tint joyo = n % x ;\n\t\tint ans = n / x ;\n\n\t\tSystem.out.println((ans * t) + (joyo != 0?t:0));\n\n\t}\n\n\tpublic static void main(String[] args) {\n\n\t\tlong start = System.currentTimeMillis();\n\t // 引数で標準入力System.inを指定する\n\t Scanner scanner = new Scanner(System.in);\n\t\ttry {\n\n\t\t // 1行目を取得(a)\n\t\t\tint n = scanner.nextInt();\n\t\t\tint x = scanner.nextInt();\n\t\t\tint t = scanner.nextInt();\n\t\t\tscanner.nextLine();\n\n\t\t\tsolve(n, x, t);\n\n\t\t} finally {\n\t\t // Scannerクラスのインスタンスをクローズ\n\t\t scanner.close();\n\t\t}\n\t\tlong end = System.currentTimeMillis();\n\t\t// System.out.println((end - start) );\n\t}\n\n\n\t// ************************************\n\t// Common\n\t// ************************************\n\n\tprivate static final int[] changeArrayStringToInt(String line) {\n\n\t\tString[] strArray = line.split(\" \");\n\n\t\tint[] intArray = new int[strArray.length];\n\n\t\tfor (int i = 0; i < intArray.length; i++) {\n\t\t\tintArray[i] = Integer.parseInt(strArray[i]);\n\t\t}\n\t\treturn intArray;\n\t}\n\n}",
"Main",
"public static void solve (int n, int x, int t) {\n\n\t\tint joyo = n % x ;\n\t\tint ans = n / x ;\n\n\t\tSystem.out.println((ans * t) + (joyo != 0?t:0));\n\n\t}",
"solve",
"{\n\n\t\tint joyo = n % x ;\n\t\tint ans = n / x ;\n\n\t\tSystem.out.println((ans * t) + (joyo != 0?t:0));\n\n\t}",
"int joyo = n % x ;",
"joyo",
"n % x",
"n",
"x",
"int ans = n / x ;",
"ans",
"n / x",
"n",
"x",
"System.out.println((ans * t) + (joyo != 0?t:0))",
"System.out.println",
"System.out",
"System",
"System.out",
"(ans * t) + (joyo != 0?t:0)",
"(ans * t)",
"ans",
"t",
"(joyo != 0?t:0)",
"joyo != 0",
"joyo",
"0",
"t",
"0",
"int n",
"n",
"int x",
"x",
"int t",
"t",
"public static void main(String[] args) {\n\n\t\tlong start = System.currentTimeMillis();\n\t // 引数で標準入力System.inを指定する\n\t Scanner scanner = new Scanner(System.in);\n\t\ttry {\n\n\t\t // 1行目を取得(a)\n\t\t\tint n = scanner.nextInt();\n\t\t\tint x = scanner.nextInt();\n\t\t\tint t = scanner.nextInt();\n\t\t\tscanner.nextLine();\n\n\t\t\tsolve(n, x, t);\n\n\t\t} finally {\n\t\t // Scannerクラスのインスタンスをクローズ\n\t\t scanner.close();\n\t\t}\n\t\tlong end = System.currentTimeMillis();\n\t\t// System.out.println((end - start) );\n\t}",
"main",
"{\n\n\t\tlong start = System.currentTimeMillis();\n\t // 引数で標準入力System.inを指定する\n\t Scanner scanner = new Scanner(System.in);\n\t\ttry {\n\n\t\t // 1行目を取得(a)\n\t\t\tint n = scanner.nextInt();\n\t\t\tint x = scanner.nextInt();\n\t\t\tint t = scanner.nextInt();\n\t\t\tscanner.nextLine();\n\n\t\t\tsolve(n, x, t);\n\n\t\t} finally {\n\t\t // Scannerクラスのインスタンスをクローズ\n\t\t scanner.close();\n\t\t}\n\t\tlong end = System.currentTimeMillis();\n\t\t// System.out.println((end - start) );\n\t}",
"long start = System.currentTimeMillis();",
"start",
"System.currentTimeMillis()",
"System.currentTimeMillis",
"System",
"Scanner scanner = new Scanner(System.in);",
"scanner",
"new Scanner(System.in)",
"try {\n\n\t\t // 1行目を取得(a)\n\t\t\tint n = scanner.nextInt();\n\t\t\tint x = scanner.nextInt();\n\t\t\tint t = scanner.nextInt();\n\t\t\tscanner.nextLine();\n\n\t\t\tsolve(n, x, t);\n\n\t\t} finally {\n\t\t // Scannerクラスのインスタンスをクローズ\n\t\t scanner.close();\n\t\t}",
"{\n\t\t // Scannerクラスのインスタンスをクローズ\n\t\t scanner.close();\n\t\t}",
"scanner.close()",
"scanner.close",
"scanner",
"{\n\n\t\t // 1行目を取得(a)\n\t\t\tint n = scanner.nextInt();\n\t\t\tint x = scanner.nextInt();\n\t\t\tint t = scanner.nextInt();\n\t\t\tscanner.nextLine();\n\n\t\t\tsolve(n, x, t);\n\n\t\t}",
"int n = scanner.nextInt();",
"n",
"scanner.nextInt()",
"scanner.nextInt",
"scanner",
"int x = scanner.nextInt();",
"x",
"scanner.nextInt()",
"scanner.nextInt",
"scanner",
"int t = scanner.nextInt();",
"t",
"scanner.nextInt()",
"scanner.nextInt",
"scanner",
"scanner.nextLine()",
"scanner.nextLine",
"scanner",
"solve(n, x, t)",
"solve",
"n",
"x",
"t",
"long end = System.currentTimeMillis();",
"end",
"System.currentTimeMillis()",
"System.currentTimeMillis",
"System",
"String[] args",
"args",
"private static final int[] changeArrayStringToInt(String line) {\n\n\t\tString[] strArray = line.split(\" \");\n\n\t\tint[] intArray = new int[strArray.length];\n\n\t\tfor (int i = 0; i < intArray.length; i++) {\n\t\t\tintArray[i] = Integer.parseInt(strArray[i]);\n\t\t}\n\t\treturn intArray;\n\t}",
"changeArrayStringToInt",
"{\n\n\t\tString[] strArray = line.split(\" \");\n\n\t\tint[] intArray = new int[strArray.length];\n\n\t\tfor (int i = 0; i < intArray.length; i++) {\n\t\t\tintArray[i] = Integer.parseInt(strArray[i]);\n\t\t}\n\t\treturn intArray;\n\t}",
"String[] strArray = line.split(\" \");",
"strArray",
"line.split(\" \")",
"line.split",
"line",
"\" \"",
"int[] intArray = new int[strArray.length];",
"intArray",
"new int[strArray.length]",
"strArray.length",
"strArray",
"strArray.length",
"for (int i = 0; i < intArray.length; i++) {\n\t\t\tintArray[i] = Integer.parseInt(strArray[i]);\n\t\t}",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < intArray.length",
"i",
"intArray.length",
"intArray",
"intArray.length",
"i++",
"i++",
"i",
"{\n\t\t\tintArray[i] = Integer.parseInt(strArray[i]);\n\t\t}",
"{\n\t\t\tintArray[i] = Integer.parseInt(strArray[i]);\n\t\t}",
"intArray[i] = Integer.parseInt(strArray[i])",
"intArray[i]",
"intArray",
"i",
"Integer.parseInt(strArray[i])",
"Integer.parseInt",
"Integer",
"strArray[i]",
"strArray",
"i",
"return intArray;",
"intArray",
"String line",
"line",
"public class Main {\n\n\tpublic static void solve (int n, int x, int t) {\n\n\t\tint joyo = n % x ;\n\t\tint ans = n / x ;\n\n\t\tSystem.out.println((ans * t) + (joyo != 0?t:0));\n\n\t}\n\n\tpublic static void main(String[] args) {\n\n\t\tlong start = System.currentTimeMillis();\n\t // 引数で標準入力System.inを指定する\n\t Scanner scanner = new Scanner(System.in);\n\t\ttry {\n\n\t\t // 1行目を取得(a)\n\t\t\tint n = scanner.nextInt();\n\t\t\tint x = scanner.nextInt();\n\t\t\tint t = scanner.nextInt();\n\t\t\tscanner.nextLine();\n\n\t\t\tsolve(n, x, t);\n\n\t\t} finally {\n\t\t // Scannerクラスのインスタンスをクローズ\n\t\t scanner.close();\n\t\t}\n\t\tlong end = System.currentTimeMillis();\n\t\t// System.out.println((end - start) );\n\t}\n\n\n\t// ************************************\n\t// Common\n\t// ************************************\n\n\tprivate static final int[] changeArrayStringToInt(String line) {\n\n\t\tString[] strArray = line.split(\" \");\n\n\t\tint[] intArray = new int[strArray.length];\n\n\t\tfor (int i = 0; i < intArray.length; i++) {\n\t\t\tintArray[i] = Integer.parseInt(strArray[i]);\n\t\t}\n\t\treturn intArray;\n\t}\n\n}",
"public class Main {\n\n\tpublic static void solve (int n, int x, int t) {\n\n\t\tint joyo = n % x ;\n\t\tint ans = n / x ;\n\n\t\tSystem.out.println((ans * t) + (joyo != 0?t:0));\n\n\t}\n\n\tpublic static void main(String[] args) {\n\n\t\tlong start = System.currentTimeMillis();\n\t // 引数で標準入力System.inを指定する\n\t Scanner scanner = new Scanner(System.in);\n\t\ttry {\n\n\t\t // 1行目を取得(a)\n\t\t\tint n = scanner.nextInt();\n\t\t\tint x = scanner.nextInt();\n\t\t\tint t = scanner.nextInt();\n\t\t\tscanner.nextLine();\n\n\t\t\tsolve(n, x, t);\n\n\t\t} finally {\n\t\t // Scannerクラスのインスタンスをクローズ\n\t\t scanner.close();\n\t\t}\n\t\tlong end = System.currentTimeMillis();\n\t\t// System.out.println((end - start) );\n\t}\n\n\n\t// ************************************\n\t// Common\n\t// ************************************\n\n\tprivate static final int[] changeArrayStringToInt(String line) {\n\n\t\tString[] strArray = line.split(\" \");\n\n\t\tint[] intArray = new int[strArray.length];\n\n\t\tfor (int i = 0; i < intArray.length; i++) {\n\t\t\tintArray[i] = Integer.parseInt(strArray[i]);\n\t\t}\n\t\treturn intArray;\n\t}\n\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void solve (int n, int x, int t) {
int joyo = n % x ;
int ans = n / x ;
System.out.println((ans * t) + (joyo != 0?t:0));
}
public static void main(String[] args) {
long start = System.currentTimeMillis();
// 引数で標準入力System.inを指定する
Scanner scanner = new Scanner(System.in);
try {
// 1行目を取得(a)
int n = scanner.nextInt();
int x = scanner.nextInt();
int t = scanner.nextInt();
scanner.nextLine();
solve(n, x, t);
} finally {
// Scannerクラスのインスタンスをクローズ
scanner.close();
}
long end = System.currentTimeMillis();
// System.out.println((end - start) );
}
// ************************************
// Common
// ************************************
private static final int[] changeArrayStringToInt(String line) {
String[] strArray = line.split(" ");
int[] intArray = new int[strArray.length];
for (int i = 0; i < intArray.length; i++) {
intArray[i] = Integer.parseInt(strArray[i]);
}
return intArray;
}
}
|
[
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,
14,
2,
2,
2,
2,
2,
13,
17,
2,
13,
17,
2,
13,
17,
2,
13,
17,
17,
29,
17,
29,
17,
23,
13,
23,
13,
23,
13,
23,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
2,
13,
13,
4,
18,
18,
13,
13,
2,
13,
13,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
29,
13,
12,
13,
30,
29,
17,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
13,
14
],
[
13,
15
],
[
0,
16
],
[
16,
17
],
[
16,
18
],
[
0,
19
],
[
19,
20
],
[
19,
21
],
[
0,
22
],
[
22,
23
],
[
22,
24
],
[
0,
25
],
[
25,
26
],
[
25,
27
],
[
0,
28
],
[
28,
29
],
[
28,
30
],
[
0,
31
],
[
31,
32
],
[
31,
33
],
[
0,
34
],
[
34,
35
],
[
34,
36
],
[
0,
37
],
[
37,
38
],
[
37,
39
],
[
0,
40
],
[
210,
41
],
[
210,
42
],
[
42,
43
],
[
42,
44
],
[
44,
45
],
[
45,
46
],
[
46,
47
],
[
47,
48
],
[
56,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
49,
53
],
[
53,
54
],
[
53,
55
],
[
56,
56
],
[
56,
57
],
[
56,
58
],
[
47,
59
],
[
59,
60
],
[
59,
61
],
[
46,
62
],
[
45,
63
],
[
63,
64
],
[
45,
65
],
[
65,
66
],
[
42,
67
],
[
67,
68
],
[
42,
69
],
[
69,
70
],
[
42,
71
],
[
71,
72
],
[
42,
73
],
[
73,
74
],
[
210,
75
],
[
75,
76
],
[
75,
77
],
[
77,
78
],
[
78,
79
],
[
78,
80
],
[
77,
81
],
[
81,
82
],
[
81,
83
],
[
83,
84
],
[
84,
85
],
[
77,
86
],
[
86,
87
],
[
86,
88
],
[
88,
89
],
[
89,
90
],
[
77,
91
],
[
91,
92
],
[
91,
93
],
[
93,
94
],
[
94,
95
],
[
77,
96
],
[
96,
97
],
[
96,
98
],
[
98,
99
],
[
99,
100
],
[
98,
101
],
[
101,
102
],
[
101,
103
],
[
77,
104
],
[
104,
105
],
[
105,
106
],
[
106,
107
],
[
106,
108
],
[
104,
109
],
[
109,
110
],
[
109,
111
],
[
75,
112
],
[
112,
113
],
[
210,
114
],
[
114,
115
],
[
114,
116
],
[
116,
117
],
[
114,
118
],
[
118,
119
],
[
114,
120
],
[
120,
121
],
[
120,
122
],
[
122,
123
],
[
123,
124
],
[
123,
125
],
[
114,
126
],
[
126,
127
],
[
126,
128
],
[
128,
129
],
[
129,
130
],
[
130,
131
],
[
131,
132
],
[
131,
133
],
[
130,
134
],
[
134,
135
],
[
135,
136
],
[
136,
137
],
[
129,
138
],
[
138,
139
],
[
139,
140
],
[
140,
141
],
[
140,
142
],
[
142,
143
],
[
143,
144
],
[
144,
145
],
[
139,
146
],
[
146,
147
],
[
147,
148
],
[
147,
149
],
[
128,
150
],
[
150,
151
],
[
151,
152
],
[
152,
153
],
[
114,
154
],
[
154,
155
],
[
154,
156
],
[
156,
157
],
[
157,
158
],
[
158,
159
],
[
159,
160
],
[
158,
161
],
[
161,
162
],
[
114,
163
],
[
163,
164
],
[
163,
165
],
[
165,
166
],
[
166,
167
],
[
167,
168
],
[
168,
169
],
[
167,
170
],
[
170,
171
],
[
114,
172
],
[
172,
173
],
[
172,
174
],
[
174,
175
],
[
175,
176
],
[
176,
177
],
[
177,
178
],
[
176,
179
],
[
179,
180
],
[
114,
181
],
[
181,
182
],
[
181,
183
],
[
183,
184
],
[
184,
185
],
[
184,
186
],
[
183,
187
],
[
187,
188
],
[
188,
189
],
[
188,
190
],
[
190,
191
],
[
191,
192
],
[
192,
193
],
[
187,
194
],
[
194,
195
],
[
195,
196
],
[
195,
197
],
[
197,
198
],
[
198,
199
],
[
183,
200
],
[
200,
201
],
[
114,
202
],
[
202,
203
],
[
202,
204
],
[
204,
205
],
[
205,
206
],
[
202,
207
],
[
207,
208
],
[
0,
209
],
[
209,
210
],
[
209,
211
]
]
| [
"\n\nimport java.io.BufferedReader;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\nimport java.util.Set;\nimport java.util.StringTokenizer;\n\n\npublic class Main {\n\t static class FastReader \n\t { \n\t BufferedReader br; \n\t StringTokenizer st; \n\t \n\t \n\t public FastReader() \n\t { \n\t br = new BufferedReader(new\n\t InputStreamReader(System.in)); \n\t } \n\t \n\t String next() \n\t { \n\t while (st == null || !st.hasMoreTokens()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t } \n\t return st.nextToken();\n\t \n\t } \n\t \n\t int nextInt() \n\t { \n\t return Integer.parseInt(next()); \n\t } \n\t \n\t long nextLong() \n\t { \n\t return Long.parseLong(next()); \n\t } \n\t \n\t double nextDouble() \n\t { \n\t return Double.parseDouble(next()); \n\t } \n\t \n\t String nextLine() \n\t { \n\t String str = \"\"; \n\t try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t return str; \n\t }\n\n\t\t\tpublic Character charAt(int i) {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\treturn null;\n\t\t\t} \n\t } \n\tpublic static boolean solve(long r, long g, long b, long w) {\n\t\t if((r%2+g%2+b%2+w%2)>1)return false;\n\t\t else return true;\n\t}\n\tpublic static void main(String[] args)throws IOException {\n\t\tFastReader s=new FastReader();\t\t\n\t\t\n\t\tint n = s.nextInt();\n\t\tint x = s.nextInt();\n\t\tint t = s.nextInt();\n\t\t\tint p = (int)Math.ceil((double)n/(double)x);\n\t\t\tSystem.out.println(p*t);\n\t}\n\t\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.util.ArrayList;",
"ArrayList",
"java.util",
"import java.util.Arrays;",
"Arrays",
"java.util",
"import java.util.Collections;",
"Collections",
"java.util",
"import java.util.HashMap;",
"HashMap",
"java.util",
"import java.util.HashSet;",
"HashSet",
"java.util",
"import java.util.List;",
"List",
"java.util",
"import java.util.Map;",
"Map",
"java.util",
"import java.io.IOException;",
"IOException",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.util.Scanner;",
"Scanner",
"java.util",
"import java.util.Set;",
"Set",
"java.util",
"import java.util.StringTokenizer;",
"StringTokenizer",
"java.util",
"public class Main {\n\t static class FastReader \n\t { \n\t BufferedReader br; \n\t StringTokenizer st; \n\t \n\t \n\t public FastReader() \n\t { \n\t br = new BufferedReader(new\n\t InputStreamReader(System.in)); \n\t } \n\t \n\t String next() \n\t { \n\t while (st == null || !st.hasMoreTokens()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t } \n\t return st.nextToken();\n\t \n\t } \n\t \n\t int nextInt() \n\t { \n\t return Integer.parseInt(next()); \n\t } \n\t \n\t long nextLong() \n\t { \n\t return Long.parseLong(next()); \n\t } \n\t \n\t double nextDouble() \n\t { \n\t return Double.parseDouble(next()); \n\t } \n\t \n\t String nextLine() \n\t { \n\t String str = \"\"; \n\t try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t return str; \n\t }\n\n\t\t\tpublic Character charAt(int i) {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\treturn null;\n\t\t\t} \n\t } \n\tpublic static boolean solve(long r, long g, long b, long w) {\n\t\t if((r%2+g%2+b%2+w%2)>1)return false;\n\t\t else return true;\n\t}\n\tpublic static void main(String[] args)throws IOException {\n\t\tFastReader s=new FastReader();\t\t\n\t\t\n\t\tint n = s.nextInt();\n\t\tint x = s.nextInt();\n\t\tint t = s.nextInt();\n\t\t\tint p = (int)Math.ceil((double)n/(double)x);\n\t\t\tSystem.out.println(p*t);\n\t}\n\t\n}",
"Main",
"public static boolean solve(long r, long g, long b, long w) {\n\t\t if((r%2+g%2+b%2+w%2)>1)return false;\n\t\t else return true;\n\t}",
"solve",
"{\n\t\t if((r%2+g%2+b%2+w%2)>1)return false;\n\t\t else return true;\n\t}",
"if((r%2+g%2+b%2+w%2)>1)return false;\n\t\t else return true;",
"(r%2+g%2+b%2+w%2)>1",
"(r%2+g%2+b%2+w%2)",
"b%2",
"r%2+g%2+b%2+w%2",
"r%2",
"r",
"2",
"g%2",
"g",
"2",
"b%2",
"b",
"2",
"w%2",
"w",
"2",
"1",
"return false;",
"false",
"return true;",
"true",
"long r",
"r",
"long g",
"g",
"long b",
"b",
"long w",
"w",
"public static void main(String[] args)throws IOException {\n\t\tFastReader s=new FastReader();\t\t\n\t\t\n\t\tint n = s.nextInt();\n\t\tint x = s.nextInt();\n\t\tint t = s.nextInt();\n\t\t\tint p = (int)Math.ceil((double)n/(double)x);\n\t\t\tSystem.out.println(p*t);\n\t}",
"main",
"{\n\t\tFastReader s=new FastReader();\t\t\n\t\t\n\t\tint n = s.nextInt();\n\t\tint x = s.nextInt();\n\t\tint t = s.nextInt();\n\t\t\tint p = (int)Math.ceil((double)n/(double)x);\n\t\t\tSystem.out.println(p*t);\n\t}",
"FastReader s=new FastReader();",
"s",
"new FastReader()",
"int n = s.nextInt();",
"n",
"s.nextInt()",
"s.nextInt",
"s",
"int x = s.nextInt();",
"x",
"s.nextInt()",
"s.nextInt",
"s",
"int t = s.nextInt();",
"t",
"s.nextInt()",
"s.nextInt",
"s",
"int p = (int)Math.ceil((double)n/(double)x);",
"p",
"(int)Math.ceil((double)n/(double)x)",
"Math.ceil",
"Math",
"(double)n/(double)x",
"(double)n",
"(double)x",
"System.out.println(p*t)",
"System.out.println",
"System.out",
"System",
"System.out",
"p*t",
"p",
"t",
"String[] args",
"args",
"static class FastReader \n\t { \n\t BufferedReader br; \n\t StringTokenizer st; \n\t \n\t \n\t public FastReader() \n\t { \n\t br = new BufferedReader(new\n\t InputStreamReader(System.in)); \n\t } \n\t \n\t String next() \n\t { \n\t while (st == null || !st.hasMoreTokens()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t } \n\t return st.nextToken();\n\t \n\t } \n\t \n\t int nextInt() \n\t { \n\t return Integer.parseInt(next()); \n\t } \n\t \n\t long nextLong() \n\t { \n\t return Long.parseLong(next()); \n\t } \n\t \n\t double nextDouble() \n\t { \n\t return Double.parseDouble(next()); \n\t } \n\t \n\t String nextLine() \n\t { \n\t String str = \"\"; \n\t try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t return str; \n\t }\n\n\t\t\tpublic Character charAt(int i) {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\treturn null;\n\t\t\t} \n\t }",
"FastReader",
"BufferedReader br;",
"br",
"StringTokenizer st;",
"st",
"public FastReader() \n\t { \n\t br = new BufferedReader(new\n\t InputStreamReader(System.in)); \n\t }",
"FastReader",
"{ \n\t br = new BufferedReader(new\n\t InputStreamReader(System.in)); \n\t }",
"br = new BufferedReader(new\n\t InputStreamReader(System.in))",
"br",
"new BufferedReader(new\n\t InputStreamReader(System.in))",
"String next() \n\t { \n\t while (st == null || !st.hasMoreTokens()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t } \n\t return st.nextToken();\n\t \n\t }",
"next",
"{ \n\t while (st == null || !st.hasMoreTokens()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t } \n\t return st.nextToken();\n\t \n\t }",
"while (st == null || !st.hasMoreTokens()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t }",
"st == null || !st.hasMoreTokens()",
"st == null",
"st",
"null",
"!st.hasMoreTokens()",
"st.hasMoreTokens()",
"st.hasMoreTokens",
"st",
"{ \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t }",
"try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t }",
"catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t }",
"IOException e",
"{ \n\t e.printStackTrace(); \n\t }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{ \n\t st = new StringTokenizer(br.readLine()); \n\t }",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"int nextInt() \n\t { \n\t return Integer.parseInt(next()); \n\t }",
"nextInt",
"{ \n\t return Integer.parseInt(next()); \n\t }",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"long nextLong() \n\t { \n\t return Long.parseLong(next()); \n\t }",
"nextLong",
"{ \n\t return Long.parseLong(next()); \n\t }",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"double nextDouble() \n\t { \n\t return Double.parseDouble(next()); \n\t }",
"nextDouble",
"{ \n\t return Double.parseDouble(next()); \n\t }",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"String nextLine() \n\t { \n\t String str = \"\"; \n\t try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t return str; \n\t }",
"nextLine",
"{ \n\t String str = \"\"; \n\t try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t return str; \n\t }",
"String str = \"\";",
"str",
"\"\"",
"try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t }",
"catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t }",
"IOException e",
"{ \n\t e.printStackTrace(); \n\t }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{ \n\t str = br.readLine(); \n\t }",
"str = br.readLine()",
"str",
"br.readLine()",
"br.readLine",
"br",
"return str;",
"str",
"public Character charAt(int i) {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\treturn null;\n\t\t\t}",
"charAt",
"{\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\treturn null;\n\t\t\t}",
"return null;",
"null",
"int i",
"i",
"public class Main {\n\t static class FastReader \n\t { \n\t BufferedReader br; \n\t StringTokenizer st; \n\t \n\t \n\t public FastReader() \n\t { \n\t br = new BufferedReader(new\n\t InputStreamReader(System.in)); \n\t } \n\t \n\t String next() \n\t { \n\t while (st == null || !st.hasMoreTokens()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t } \n\t return st.nextToken();\n\t \n\t } \n\t \n\t int nextInt() \n\t { \n\t return Integer.parseInt(next()); \n\t } \n\t \n\t long nextLong() \n\t { \n\t return Long.parseLong(next()); \n\t } \n\t \n\t double nextDouble() \n\t { \n\t return Double.parseDouble(next()); \n\t } \n\t \n\t String nextLine() \n\t { \n\t String str = \"\"; \n\t try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t return str; \n\t }\n\n\t\t\tpublic Character charAt(int i) {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\treturn null;\n\t\t\t} \n\t } \n\tpublic static boolean solve(long r, long g, long b, long w) {\n\t\t if((r%2+g%2+b%2+w%2)>1)return false;\n\t\t else return true;\n\t}\n\tpublic static void main(String[] args)throws IOException {\n\t\tFastReader s=new FastReader();\t\t\n\t\t\n\t\tint n = s.nextInt();\n\t\tint x = s.nextInt();\n\t\tint t = s.nextInt();\n\t\t\tint p = (int)Math.ceil((double)n/(double)x);\n\t\t\tSystem.out.println(p*t);\n\t}\n\t\n}",
"public class Main {\n\t static class FastReader \n\t { \n\t BufferedReader br; \n\t StringTokenizer st; \n\t \n\t \n\t public FastReader() \n\t { \n\t br = new BufferedReader(new\n\t InputStreamReader(System.in)); \n\t } \n\t \n\t String next() \n\t { \n\t while (st == null || !st.hasMoreTokens()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t } \n\t return st.nextToken();\n\t \n\t } \n\t \n\t int nextInt() \n\t { \n\t return Integer.parseInt(next()); \n\t } \n\t \n\t long nextLong() \n\t { \n\t return Long.parseLong(next()); \n\t } \n\t \n\t double nextDouble() \n\t { \n\t return Double.parseDouble(next()); \n\t } \n\t \n\t String nextLine() \n\t { \n\t String str = \"\"; \n\t try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t return str; \n\t }\n\n\t\t\tpublic Character charAt(int i) {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\treturn null;\n\t\t\t} \n\t } \n\tpublic static boolean solve(long r, long g, long b, long w) {\n\t\t if((r%2+g%2+b%2+w%2)>1)return false;\n\t\t else return true;\n\t}\n\tpublic static void main(String[] args)throws IOException {\n\t\tFastReader s=new FastReader();\t\t\n\t\t\n\t\tint n = s.nextInt();\n\t\tint x = s.nextInt();\n\t\tint t = s.nextInt();\n\t\t\tint p = (int)Math.ceil((double)n/(double)x);\n\t\t\tSystem.out.println(p*t);\n\t}\n\t\n}",
"Main"
]
|
import java.io.BufferedReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.Set;
import java.util.StringTokenizer;
public class Main {
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreTokens())
{
try
{
st = new StringTokenizer(br.readLine());
}
catch (IOException e)
{
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt()
{
return Integer.parseInt(next());
}
long nextLong()
{
return Long.parseLong(next());
}
double nextDouble()
{
return Double.parseDouble(next());
}
String nextLine()
{
String str = "";
try
{
str = br.readLine();
}
catch (IOException e)
{
e.printStackTrace();
}
return str;
}
public Character charAt(int i) {
// TODO Auto-generated method stub
return null;
}
}
public static boolean solve(long r, long g, long b, long w) {
if((r%2+g%2+b%2+w%2)>1)return false;
else return true;
}
public static void main(String[] args)throws IOException {
FastReader s=new FastReader();
int n = s.nextInt();
int x = s.nextInt();
int t = s.nextInt();
int p = (int)Math.ceil((double)n/(double)x);
System.out.println(p*t);
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
41,
13,
41,
13,
41,
13,
41,
13,
17,
41,
13,
41,
13,
0,
13,
4,
18,
13,
0,
13,
4,
18,
13,
0,
13,
4,
18,
13,
0,
13,
4,
18,
13,
2,
13,
13,
0,
13,
2,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
70,
11
],
[
70,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
14,
18
],
[
18,
19
],
[
14,
20
],
[
20,
21
],
[
14,
22
],
[
22,
23
],
[
14,
24
],
[
24,
25
],
[
14,
26
],
[
26,
27
],
[
26,
28
],
[
14,
29
],
[
29,
30
],
[
14,
31
],
[
31,
32
],
[
14,
33
],
[
33,
34
],
[
33,
35
],
[
35,
36
],
[
36,
37
],
[
14,
38
],
[
38,
39
],
[
38,
40
],
[
40,
41
],
[
41,
42
],
[
14,
43
],
[
43,
44
],
[
43,
45
],
[
45,
46
],
[
46,
47
],
[
14,
48
],
[
48,
49
],
[
48,
50
],
[
50,
51
],
[
51,
52
],
[
50,
53
],
[
53,
54
],
[
53,
55
],
[
14,
56
],
[
56,
57
],
[
56,
58
],
[
58,
59
],
[
58,
60
],
[
14,
61
],
[
61,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
61,
66
],
[
12,
67
],
[
67,
68
],
[
0,
69
],
[
69,
70
],
[
69,
71
]
]
| [
"import java.util.*; \nimport java.io.*; \nimport java.lang.Math; \npublic class Main\n{\n public static void main(String []args)\n {\n Scanner in=new Scanner(System.in);\n int t,n,k,i,j=0,x;\n double m;\n \n n=in.nextInt();\n x=in.nextInt();\n t=in.nextInt();\n m=Math.ceil((double)n/x);\n m=m*t;\n System.out.println((int)m);\n \n \n }\n}",
"import java.util.*;",
"util.*",
"java",
"import java.io.*;",
"io.*",
"java",
"import java.lang.Math;",
"Math",
"java.lang",
"public class Main\n{\n public static void main(String []args)\n {\n Scanner in=new Scanner(System.in);\n int t,n,k,i,j=0,x;\n double m;\n \n n=in.nextInt();\n x=in.nextInt();\n t=in.nextInt();\n m=Math.ceil((double)n/x);\n m=m*t;\n System.out.println((int)m);\n \n \n }\n}",
"Main",
"public static void main(String []args)\n {\n Scanner in=new Scanner(System.in);\n int t,n,k,i,j=0,x;\n double m;\n \n n=in.nextInt();\n x=in.nextInt();\n t=in.nextInt();\n m=Math.ceil((double)n/x);\n m=m*t;\n System.out.println((int)m);\n \n \n }",
"main",
"{\n Scanner in=new Scanner(System.in);\n int t,n,k,i,j=0,x;\n double m;\n \n n=in.nextInt();\n x=in.nextInt();\n t=in.nextInt();\n m=Math.ceil((double)n/x);\n m=m*t;\n System.out.println((int)m);\n \n \n }",
"Scanner in=new Scanner(System.in);",
"in",
"new Scanner(System.in)",
"int t",
"t",
"n",
"n",
"k",
"k",
"i",
"i",
"j=0",
"j",
"0",
"x;",
"x",
"double m;",
"m",
"n=in.nextInt()",
"n",
"in.nextInt()",
"in.nextInt",
"in",
"x=in.nextInt()",
"x",
"in.nextInt()",
"in.nextInt",
"in",
"t=in.nextInt()",
"t",
"in.nextInt()",
"in.nextInt",
"in",
"m=Math.ceil((double)n/x)",
"m",
"Math.ceil((double)n/x)",
"Math.ceil",
"Math",
"(double)n/x",
"(double)n",
"x",
"m=m*t",
"m",
"m*t",
"m",
"t",
"System.out.println((int)m)",
"System.out.println",
"System.out",
"System",
"System.out",
"(int)m",
"String []args",
"args",
"public class Main\n{\n public static void main(String []args)\n {\n Scanner in=new Scanner(System.in);\n int t,n,k,i,j=0,x;\n double m;\n \n n=in.nextInt();\n x=in.nextInt();\n t=in.nextInt();\n m=Math.ceil((double)n/x);\n m=m*t;\n System.out.println((int)m);\n \n \n }\n}",
"public class Main\n{\n public static void main(String []args)\n {\n Scanner in=new Scanner(System.in);\n int t,n,k,i,j=0,x;\n double m;\n \n n=in.nextInt();\n x=in.nextInt();\n t=in.nextInt();\n m=Math.ceil((double)n/x);\n m=m*t;\n System.out.println((int)m);\n \n \n }\n}",
"Main"
]
| import java.util.*;
import java.io.*;
import java.lang.Math;
public class Main
{
public static void main(String []args)
{
Scanner in=new Scanner(System.in);
int t,n,k,i,j=0,x;
double m;
n=in.nextInt();
x=in.nextInt();
t=in.nextInt();
m=Math.ceil((double)n/x);
m=m*t;
System.out.println((int)m);
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
20,
41,
13,
20,
41,
13,
41,
13,
20,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
2,
13,
13,
14,
2,
13,
17,
30,
41,
13,
2,
13,
2,
2,
13,
13,
13,
4,
13,
13,
30,
41,
13,
2,
2,
13,
13,
13,
4,
13,
13,
4,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
18,
13,
20,
23,
13,
12,
13,
30,
4,
18,
13,
20,
23,
13,
12,
13,
30,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
18,
13,
13,
23,
13,
12,
13,
30,
4,
18,
13,
12,
13,
30,
4,
18,
13,
17,
12,
13,
30,
4,
18,
13,
17,
12,
13,
30,
4,
18,
13,
17,
12,
13,
30,
4,
18,
13,
17,
12,
13,
30,
4,
18,
13,
17,
12,
13,
30,
4,
18,
13,
17,
12,
13,
30,
4,
18,
13,
8,
13,
17,
17,
23,
13,
12,
13,
30,
4,
18,
13,
8,
13,
17,
17,
23,
13,
12,
13,
30,
4,
18,
13,
8,
13,
17,
17,
23,
13,
12,
13,
30,
11,
1,
41,
13,
17,
41,
13,
2,
18,
13,
13,
17,
2,
13,
13,
1,
4,
18,
13,
18,
13,
13,
4,
18,
13,
17,
40,
13,
30,
4,
18,
13,
18,
13,
2,
18,
13,
13,
17,
23,
13,
12,
13,
30,
11,
1,
41,
13,
17,
41,
13,
2,
18,
13,
13,
17,
2,
13,
13,
1,
4,
18,
13,
18,
13,
13,
4,
18,
13,
17,
40,
13,
30,
4,
18,
13,
18,
13,
2,
18,
13,
13,
17,
23,
13,
12,
13,
30,
41,
13,
2,
4,
18,
13,
17,
41,
13,
4,
18,
13,
11,
1,
41,
13,
17,
2,
13,
13,
1,
4,
18,
13,
4,
18,
13,
4,
18,
13,
17,
40,
13,
30,
14,
2,
13,
17,
30,
4,
18,
13,
4,
18,
13,
30,
4,
18,
13,
23,
13,
12,
13,
30,
4,
18,
13,
17,
4,
13,
12,
13,
30,
4,
18,
13,
12,
13,
30,
4,
18,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
29,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
10,
11
],
[
10,
12
],
[
0,
13
],
[
543,
14
],
[
543,
15
],
[
15,
16
],
[
15,
17
],
[
543,
18
],
[
18,
19
],
[
18,
20
],
[
543,
21
],
[
21,
22
],
[
543,
23
],
[
23,
24
],
[
23,
25
],
[
543,
26
],
[
26,
27
],
[
26,
28
],
[
28,
29
],
[
29,
30
],
[
29,
31
],
[
31,
32
],
[
32,
33
],
[
28,
34
],
[
34,
35
],
[
34,
36
],
[
36,
37
],
[
37,
38
],
[
28,
39
],
[
39,
40
],
[
39,
41
],
[
41,
42
],
[
42,
43
],
[
28,
44
],
[
44,
45
],
[
44,
46
],
[
46,
47
],
[
46,
48
],
[
28,
49
],
[
49,
50
],
[
50,
51
],
[
50,
52
],
[
49,
53
],
[
53,
54
],
[
54,
55
],
[
54,
56
],
[
56,
57
],
[
56,
58
],
[
58,
59
],
[
59,
60
],
[
59,
61
],
[
58,
62
],
[
53,
63
],
[
63,
64
],
[
63,
65
],
[
49,
66
],
[
66,
67
],
[
67,
68
],
[
67,
69
],
[
69,
70
],
[
70,
71
],
[
70,
72
],
[
69,
73
],
[
66,
74
],
[
74,
75
],
[
74,
76
],
[
28,
77
],
[
77,
78
],
[
26,
79
],
[
79,
80
],
[
543,
81
],
[
81,
82
],
[
81,
83
],
[
83,
84
],
[
84,
85
],
[
85,
86
],
[
84,
87
],
[
81,
88
],
[
88,
89
],
[
543,
90
],
[
90,
91
],
[
90,
92
],
[
92,
93
],
[
93,
94
],
[
94,
95
],
[
93,
96
],
[
90,
97
],
[
97,
98
],
[
543,
99
],
[
99,
100
],
[
99,
101
],
[
101,
102
],
[
102,
103
],
[
103,
104
],
[
102,
105
],
[
99,
106
],
[
106,
107
],
[
543,
108
],
[
108,
109
],
[
108,
110
],
[
110,
111
],
[
111,
112
],
[
112,
113
],
[
111,
114
],
[
108,
115
],
[
115,
116
],
[
543,
117
],
[
117,
118
],
[
117,
119
],
[
119,
120
],
[
120,
121
],
[
121,
122
],
[
120,
123
],
[
117,
124
],
[
124,
125
],
[
543,
126
],
[
126,
127
],
[
126,
128
],
[
128,
129
],
[
129,
130
],
[
130,
131
],
[
129,
132
],
[
126,
133
],
[
133,
134
],
[
543,
135
],
[
135,
136
],
[
135,
137
],
[
137,
138
],
[
138,
139
],
[
139,
140
],
[
138,
141
],
[
135,
142
],
[
142,
143
],
[
543,
144
],
[
144,
145
],
[
144,
146
],
[
146,
147
],
[
147,
148
],
[
148,
149
],
[
147,
150
],
[
144,
151
],
[
151,
152
],
[
543,
153
],
[
153,
154
],
[
153,
155
],
[
155,
156
],
[
156,
157
],
[
157,
158
],
[
156,
159
],
[
153,
160
],
[
160,
161
],
[
543,
162
],
[
162,
163
],
[
162,
164
],
[
164,
165
],
[
165,
166
],
[
166,
167
],
[
165,
168
],
[
162,
169
],
[
169,
170
],
[
543,
171
],
[
171,
172
],
[
171,
173
],
[
173,
174
],
[
174,
175
],
[
175,
176
],
[
174,
177
],
[
171,
178
],
[
178,
179
],
[
543,
180
],
[
180,
181
],
[
180,
182
],
[
182,
183
],
[
183,
184
],
[
184,
185
],
[
183,
186
],
[
180,
187
],
[
187,
188
],
[
543,
189
],
[
189,
190
],
[
189,
191
],
[
191,
192
],
[
192,
193
],
[
193,
194
],
[
192,
195
],
[
189,
196
],
[
196,
197
],
[
543,
198
],
[
198,
199
],
[
198,
200
],
[
200,
201
],
[
201,
202
],
[
202,
203
],
[
201,
204
],
[
198,
205
],
[
205,
206
],
[
543,
207
],
[
207,
208
],
[
207,
209
],
[
209,
210
],
[
210,
211
],
[
211,
212
],
[
543,
213
],
[
213,
214
],
[
213,
215
],
[
215,
216
],
[
216,
217
],
[
217,
218
],
[
216,
219
],
[
543,
220
],
[
220,
221
],
[
220,
222
],
[
222,
223
],
[
223,
224
],
[
224,
225
],
[
223,
226
],
[
543,
227
],
[
227,
228
],
[
227,
229
],
[
229,
230
],
[
230,
231
],
[
231,
232
],
[
230,
233
],
[
543,
234
],
[
234,
235
],
[
234,
236
],
[
236,
237
],
[
237,
238
],
[
238,
239
],
[
237,
240
],
[
543,
241
],
[
241,
242
],
[
241,
243
],
[
243,
244
],
[
244,
245
],
[
245,
246
],
[
244,
247
],
[
543,
248
],
[
248,
249
],
[
248,
250
],
[
250,
251
],
[
251,
252
],
[
252,
253
],
[
251,
254
],
[
543,
255
],
[
255,
256
],
[
255,
257
],
[
257,
258
],
[
258,
259
],
[
259,
260
],
[
258,
261
],
[
261,
262
],
[
261,
263
],
[
261,
264
],
[
255,
265
],
[
265,
266
],
[
543,
267
],
[
267,
268
],
[
267,
269
],
[
269,
270
],
[
270,
271
],
[
271,
272
],
[
270,
273
],
[
273,
274
],
[
273,
275
],
[
273,
276
],
[
267,
277
],
[
277,
278
],
[
543,
279
],
[
279,
280
],
[
279,
281
],
[
281,
282
],
[
282,
283
],
[
283,
284
],
[
282,
285
],
[
285,
286
],
[
285,
287
],
[
285,
288
],
[
279,
289
],
[
289,
290
],
[
543,
291
],
[
291,
292
],
[
291,
293
],
[
293,
294
],
[
294,
295
],
[
295,
296
],
[
296,
297
],
[
296,
298
],
[
295,
299
],
[
299,
300
],
[
299,
301
],
[
301,
302
],
[
302,
303
],
[
302,
304
],
[
301,
305
],
[
294,
306
],
[
306,
307
],
[
306,
308
],
[
294,
309
],
[
309,
310
],
[
310,
311
],
[
311,
312
],
[
310,
313
],
[
313,
314
],
[
313,
315
],
[
309,
316
],
[
316,
317
],
[
317,
318
],
[
316,
319
],
[
309,
320
],
[
320,
321
],
[
294,
322
],
[
293,
323
],
[
323,
324
],
[
324,
325
],
[
323,
326
],
[
326,
327
],
[
326,
328
],
[
328,
329
],
[
329,
330
],
[
329,
331
],
[
328,
332
],
[
291,
333
],
[
333,
334
],
[
543,
335
],
[
335,
336
],
[
335,
337
],
[
337,
338
],
[
338,
339
],
[
339,
340
],
[
340,
341
],
[
340,
342
],
[
339,
343
],
[
343,
344
],
[
343,
345
],
[
345,
346
],
[
346,
347
],
[
346,
348
],
[
345,
349
],
[
338,
350
],
[
350,
351
],
[
350,
352
],
[
338,
353
],
[
353,
354
],
[
354,
355
],
[
355,
356
],
[
354,
357
],
[
357,
358
],
[
357,
359
],
[
353,
360
],
[
360,
361
],
[
361,
362
],
[
360,
363
],
[
353,
364
],
[
364,
365
],
[
338,
366
],
[
337,
367
],
[
367,
368
],
[
368,
369
],
[
367,
370
],
[
370,
371
],
[
370,
372
],
[
372,
373
],
[
373,
374
],
[
373,
375
],
[
372,
376
],
[
335,
377
],
[
377,
378
],
[
543,
379
],
[
379,
380
],
[
379,
381
],
[
381,
382
],
[
382,
383
],
[
382,
384
],
[
384,
385
],
[
385,
386
],
[
386,
387
],
[
384,
388
],
[
381,
389
],
[
389,
390
],
[
389,
391
],
[
391,
392
],
[
392,
393
],
[
381,
394
],
[
394,
395
],
[
395,
396
],
[
396,
397
],
[
396,
398
],
[
394,
399
],
[
399,
400
],
[
399,
401
],
[
394,
402
],
[
402,
403
],
[
403,
404
],
[
404,
405
],
[
403,
406
],
[
406,
407
],
[
407,
408
],
[
402,
409
],
[
409,
410
],
[
410,
411
],
[
409,
412
],
[
402,
413
],
[
413,
414
],
[
394,
415
],
[
381,
416
],
[
416,
417
],
[
417,
418
],
[
417,
419
],
[
416,
420
],
[
420,
421
],
[
421,
422
],
[
422,
423
],
[
421,
424
],
[
424,
425
],
[
425,
426
],
[
416,
427
],
[
427,
428
],
[
428,
429
],
[
429,
430
],
[
379,
431
],
[
431,
432
],
[
543,
433
],
[
433,
434
],
[
433,
435
],
[
435,
436
],
[
436,
437
],
[
437,
438
],
[
436,
439
],
[
435,
440
],
[
440,
441
],
[
543,
442
],
[
442,
443
],
[
442,
444
],
[
444,
445
],
[
445,
446
],
[
446,
447
],
[
543,
448
],
[
448,
449
],
[
448,
450
],
[
450,
451
],
[
451,
452
],
[
452,
453
],
[
543,
454
],
[
454,
455
],
[
454,
456
],
[
456,
457
],
[
454,
458
],
[
458,
459
],
[
454,
460
],
[
460,
461
],
[
460,
462
],
[
462,
463
],
[
463,
464
],
[
463,
465
],
[
454,
466
],
[
466,
467
],
[
466,
468
],
[
468,
469
],
[
469,
470
],
[
470,
471
],
[
471,
472
],
[
471,
473
],
[
470,
474
],
[
474,
475
],
[
475,
476
],
[
476,
477
],
[
469,
478
],
[
478,
479
],
[
479,
480
],
[
480,
481
],
[
480,
482
],
[
482,
483
],
[
483,
484
],
[
484,
485
],
[
479,
486
],
[
486,
487
],
[
487,
488
],
[
487,
489
],
[
468,
490
],
[
490,
491
],
[
491,
492
],
[
492,
493
],
[
454,
494
],
[
494,
495
],
[
494,
496
],
[
496,
497
],
[
497,
498
],
[
498,
499
],
[
499,
500
],
[
498,
501
],
[
501,
502
],
[
454,
503
],
[
503,
504
],
[
503,
505
],
[
505,
506
],
[
506,
507
],
[
507,
508
],
[
508,
509
],
[
507,
510
],
[
510,
511
],
[
454,
512
],
[
512,
513
],
[
512,
514
],
[
514,
515
],
[
515,
516
],
[
516,
517
],
[
517,
518
],
[
516,
519
],
[
519,
520
],
[
454,
521
],
[
521,
522
],
[
521,
523
],
[
523,
524
],
[
524,
525
],
[
524,
526
],
[
523,
527
],
[
527,
528
],
[
528,
529
],
[
528,
530
],
[
530,
531
],
[
531,
532
],
[
532,
533
],
[
527,
534
],
[
534,
535
],
[
535,
536
],
[
535,
537
],
[
537,
538
],
[
538,
539
],
[
523,
540
],
[
540,
541
],
[
0,
542
],
[
542,
543
],
[
542,
544
]
]
| [
"\nimport java.io.*;\nimport java.util.*;\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\n\n/**\n * @author AnonymousP\n * @__WHEN YOU FEEL LIKE QUITTING, THINK ABOUT WHY YOU STARTED__@\n */\n//COMBINATON = nCr = n*(n-1)/2\npublic class Main {\n\n public static void main(String[] args) throws IOException {\n\n int n = sc.nextInt();\n int x = sc.nextInt();\n int t = sc.nextInt();\n int mod = n % x;\n if (mod > 0) {\n int res = t + (int) (n / x) * t;\n prln(res);\n } else {\n int res = (int) (n / x) * t;\n prln(res);\n\n }\n close();\n }\n\n static FastReader sc = new FastReader();\n static PrintWriter __out = new PrintWriter(new OutputStreamWriter(System.out));\n static StringTokenizer input;\n static Random __rand = new Random();\n\n // input\n //*******FAST IO*************FAST IO***************FAST IO****************//\n static class FastReader {\n\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n }\n// output\n\n static void pr(int i) {\n __out.print(i);\n }\n\n static void prln(int i) {\n __out.println(i);\n }\n\n static void pr(long l) {\n __out.print(l);\n }\n\n static void prln(long l) {\n __out.println(l);\n }\n\n static void pr(double d) {\n __out.print(d);\n }\n\n static void prln(double d) {\n __out.println(d);\n }\n\n static void pr(char c) {\n __out.print(c);\n }\n\n static void prln(char c) {\n __out.println(c);\n }\n\n static void pr(char[] s) {\n __out.print(new String(s));\n }\n\n static void prln(char[] s) {\n __out.println(new String(s));\n }\n\n static void pr(String s) {\n __out.print(s);\n }\n\n static void prln(String s) {\n __out.println(s);\n }\n\n static void pr(Object o) {\n __out.print(o);\n }\n\n static void prln(Object o) {\n __out.println(o);\n }\n\n static void prln() {\n __out.println();\n }\n\n static void pryes() {\n __out.println(\"yes\");\n }\n\n static void pry() {\n __out.println(\"Yes\");\n }\n\n static void prY() {\n __out.println(\"YES\");\n }\n\n static void prno() {\n __out.println(\"no\");\n }\n\n static void prn() {\n __out.println(\"No\");\n }\n\n static void prN() {\n __out.println(\"NO\");\n }\n\n static void pryesno(boolean b) {\n __out.println(b ? \"yes\" : \"no\");\n }\n\n ;\n static void pryn(boolean b) {\n __out.println(b ? \"Yes\" : \"No\");\n }\n\n static void prYN(boolean b) {\n __out.println(b ? \"YES\" : \"NO\");\n }\n\n static void prln(int... a) {\n for (int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i);\n __out.println(a[a.length - 1]);\n }\n\n static void prln(long... a) {\n for (int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i);\n __out.println(a[a.length - 1]);\n }\n\n static <T> void prln(Collection<T> c) {\n int n = c.size() - 1;\n Iterator<T> iter = c.iterator();\n for (int i = 0; i < n; __out.print(iter.next()), __out.print(' '), ++i);\n if (n >= 0) {\n __out.println(iter.next());\n } else {\n __out.println();\n }\n }\n\n static void h() {\n __out.println(\"hlfd\");\n flush();\n }\n\n static void flush() {\n __out.flush();\n }\n\n static void close() {\n __out.close();\n }\n}",
"import java.io.*;",
"io.*",
"java",
"import java.util.*;",
"util.*",
"java",
"import static java.lang.Math.*;",
"import static java.lang.Math.*;",
"import static java.lang.Math.*;",
"import static java.util.Arrays.*;",
"import static java.util.Arrays.*;",
"import static java.util.Arrays.*;",
"public class Main {\n\n public static void main(String[] args) throws IOException {\n\n int n = sc.nextInt();\n int x = sc.nextInt();\n int t = sc.nextInt();\n int mod = n % x;\n if (mod > 0) {\n int res = t + (int) (n / x) * t;\n prln(res);\n } else {\n int res = (int) (n / x) * t;\n prln(res);\n\n }\n close();\n }\n\n static FastReader sc = new FastReader();\n static PrintWriter __out = new PrintWriter(new OutputStreamWriter(System.out));\n static StringTokenizer input;\n static Random __rand = new Random();\n\n // input\n //*******FAST IO*************FAST IO***************FAST IO****************//\n static class FastReader {\n\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n }\n// output\n\n static void pr(int i) {\n __out.print(i);\n }\n\n static void prln(int i) {\n __out.println(i);\n }\n\n static void pr(long l) {\n __out.print(l);\n }\n\n static void prln(long l) {\n __out.println(l);\n }\n\n static void pr(double d) {\n __out.print(d);\n }\n\n static void prln(double d) {\n __out.println(d);\n }\n\n static void pr(char c) {\n __out.print(c);\n }\n\n static void prln(char c) {\n __out.println(c);\n }\n\n static void pr(char[] s) {\n __out.print(new String(s));\n }\n\n static void prln(char[] s) {\n __out.println(new String(s));\n }\n\n static void pr(String s) {\n __out.print(s);\n }\n\n static void prln(String s) {\n __out.println(s);\n }\n\n static void pr(Object o) {\n __out.print(o);\n }\n\n static void prln(Object o) {\n __out.println(o);\n }\n\n static void prln() {\n __out.println();\n }\n\n static void pryes() {\n __out.println(\"yes\");\n }\n\n static void pry() {\n __out.println(\"Yes\");\n }\n\n static void prY() {\n __out.println(\"YES\");\n }\n\n static void prno() {\n __out.println(\"no\");\n }\n\n static void prn() {\n __out.println(\"No\");\n }\n\n static void prN() {\n __out.println(\"NO\");\n }\n\n static void pryesno(boolean b) {\n __out.println(b ? \"yes\" : \"no\");\n }\n\n ;\n static void pryn(boolean b) {\n __out.println(b ? \"Yes\" : \"No\");\n }\n\n static void prYN(boolean b) {\n __out.println(b ? \"YES\" : \"NO\");\n }\n\n static void prln(int... a) {\n for (int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i);\n __out.println(a[a.length - 1]);\n }\n\n static void prln(long... a) {\n for (int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i);\n __out.println(a[a.length - 1]);\n }\n\n static <T> void prln(Collection<T> c) {\n int n = c.size() - 1;\n Iterator<T> iter = c.iterator();\n for (int i = 0; i < n; __out.print(iter.next()), __out.print(' '), ++i);\n if (n >= 0) {\n __out.println(iter.next());\n } else {\n __out.println();\n }\n }\n\n static void h() {\n __out.println(\"hlfd\");\n flush();\n }\n\n static void flush() {\n __out.flush();\n }\n\n static void close() {\n __out.close();\n }\n}",
"Main",
"static FastReader sc = new FastReader();",
"sc",
"new FastReader()",
"static PrintWriter __out = new PrintWriter(new OutputStreamWriter(System.out));",
"__out",
"new PrintWriter(new OutputStreamWriter(System.out))",
"static StringTokenizer input;",
"input",
"static Random __rand = new Random();",
"__rand",
"new Random()",
"public static void main(String[] args) throws IOException {\n\n int n = sc.nextInt();\n int x = sc.nextInt();\n int t = sc.nextInt();\n int mod = n % x;\n if (mod > 0) {\n int res = t + (int) (n / x) * t;\n prln(res);\n } else {\n int res = (int) (n / x) * t;\n prln(res);\n\n }\n close();\n }",
"main",
"{\n\n int n = sc.nextInt();\n int x = sc.nextInt();\n int t = sc.nextInt();\n int mod = n % x;\n if (mod > 0) {\n int res = t + (int) (n / x) * t;\n prln(res);\n } else {\n int res = (int) (n / x) * t;\n prln(res);\n\n }\n close();\n }",
"int n = sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int x = sc.nextInt();",
"x",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int t = sc.nextInt();",
"t",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int mod = n % x;",
"mod",
"n % x",
"n",
"x",
"if (mod > 0) {\n int res = t + (int) (n / x) * t;\n prln(res);\n } else {\n int res = (int) (n / x) * t;\n prln(res);\n\n }",
"mod > 0",
"mod",
"0",
"{\n int res = t + (int) (n / x) * t;\n prln(res);\n }",
"int res = t + (int) (n / x) * t;",
"res",
"t + (int) (n / x) * t",
"t",
"(int) (n / x) * t",
"(int) (n / x)",
"n",
"x",
"t",
"prln(res)",
"prln",
"res",
"{\n int res = (int) (n / x) * t;\n prln(res);\n\n }",
"int res = (int) (n / x) * t;",
"res",
"(int) (n / x) * t",
"(int) (n / x)",
"n",
"x",
"t",
"prln(res)",
"prln",
"res",
"close()",
"close",
"String[] args",
"args",
"static void pr(int i) {\n __out.print(i);\n }",
"pr",
"{\n __out.print(i);\n }",
"__out.print(i)",
"__out.print",
"__out",
"i",
"int i",
"i",
"static void prln(int i) {\n __out.println(i);\n }",
"prln",
"{\n __out.println(i);\n }",
"__out.println(i)",
"__out.println",
"__out",
"i",
"int i",
"i",
"static void pr(long l) {\n __out.print(l);\n }",
"pr",
"{\n __out.print(l);\n }",
"__out.print(l)",
"__out.print",
"__out",
"l",
"long l",
"l",
"static void prln(long l) {\n __out.println(l);\n }",
"prln",
"{\n __out.println(l);\n }",
"__out.println(l)",
"__out.println",
"__out",
"l",
"long l",
"l",
"static void pr(double d) {\n __out.print(d);\n }",
"pr",
"{\n __out.print(d);\n }",
"__out.print(d)",
"__out.print",
"__out",
"d",
"double d",
"d",
"static void prln(double d) {\n __out.println(d);\n }",
"prln",
"{\n __out.println(d);\n }",
"__out.println(d)",
"__out.println",
"__out",
"d",
"double d",
"d",
"static void pr(char c) {\n __out.print(c);\n }",
"pr",
"{\n __out.print(c);\n }",
"__out.print(c)",
"__out.print",
"__out",
"c",
"char c",
"c",
"static void prln(char c) {\n __out.println(c);\n }",
"prln",
"{\n __out.println(c);\n }",
"__out.println(c)",
"__out.println",
"__out",
"c",
"char c",
"c",
"static void pr(char[] s) {\n __out.print(new String(s));\n }",
"pr",
"{\n __out.print(new String(s));\n }",
"__out.print(new String(s))",
"__out.print",
"__out",
"new String(s)",
"char[] s",
"s",
"static void prln(char[] s) {\n __out.println(new String(s));\n }",
"prln",
"{\n __out.println(new String(s));\n }",
"__out.println(new String(s))",
"__out.println",
"__out",
"new String(s)",
"char[] s",
"s",
"static void pr(String s) {\n __out.print(s);\n }",
"pr",
"{\n __out.print(s);\n }",
"__out.print(s)",
"__out.print",
"__out",
"s",
"String s",
"s",
"static void prln(String s) {\n __out.println(s);\n }",
"prln",
"{\n __out.println(s);\n }",
"__out.println(s)",
"__out.println",
"__out",
"s",
"String s",
"s",
"static void pr(Object o) {\n __out.print(o);\n }",
"pr",
"{\n __out.print(o);\n }",
"__out.print(o)",
"__out.print",
"__out",
"o",
"Object o",
"o",
"static void prln(Object o) {\n __out.println(o);\n }",
"prln",
"{\n __out.println(o);\n }",
"__out.println(o)",
"__out.println",
"__out",
"o",
"Object o",
"o",
"static void prln() {\n __out.println();\n }",
"prln",
"{\n __out.println();\n }",
"__out.println()",
"__out.println",
"__out",
"static void pryes() {\n __out.println(\"yes\");\n }",
"pryes",
"{\n __out.println(\"yes\");\n }",
"__out.println(\"yes\")",
"__out.println",
"__out",
"\"yes\"",
"static void pry() {\n __out.println(\"Yes\");\n }",
"pry",
"{\n __out.println(\"Yes\");\n }",
"__out.println(\"Yes\")",
"__out.println",
"__out",
"\"Yes\"",
"static void prY() {\n __out.println(\"YES\");\n }",
"prY",
"{\n __out.println(\"YES\");\n }",
"__out.println(\"YES\")",
"__out.println",
"__out",
"\"YES\"",
"static void prno() {\n __out.println(\"no\");\n }",
"prno",
"{\n __out.println(\"no\");\n }",
"__out.println(\"no\")",
"__out.println",
"__out",
"\"no\"",
"static void prn() {\n __out.println(\"No\");\n }",
"prn",
"{\n __out.println(\"No\");\n }",
"__out.println(\"No\")",
"__out.println",
"__out",
"\"No\"",
"static void prN() {\n __out.println(\"NO\");\n }",
"prN",
"{\n __out.println(\"NO\");\n }",
"__out.println(\"NO\")",
"__out.println",
"__out",
"\"NO\"",
"static void pryesno(boolean b) {\n __out.println(b ? \"yes\" : \"no\");\n }",
"pryesno",
"{\n __out.println(b ? \"yes\" : \"no\");\n }",
"__out.println(b ? \"yes\" : \"no\")",
"__out.println",
"__out",
"b ? \"yes\" : \"no\"",
"b",
"\"yes\"",
"\"no\"",
"boolean b",
"b",
"static void pryn(boolean b) {\n __out.println(b ? \"Yes\" : \"No\");\n }",
"pryn",
"{\n __out.println(b ? \"Yes\" : \"No\");\n }",
"__out.println(b ? \"Yes\" : \"No\")",
"__out.println",
"__out",
"b ? \"Yes\" : \"No\"",
"b",
"\"Yes\"",
"\"No\"",
"boolean b",
"b",
"static void prYN(boolean b) {\n __out.println(b ? \"YES\" : \"NO\");\n }",
"prYN",
"{\n __out.println(b ? \"YES\" : \"NO\");\n }",
"__out.println(b ? \"YES\" : \"NO\")",
"__out.println",
"__out",
"b ? \"YES\" : \"NO\"",
"b",
"\"YES\"",
"\"NO\"",
"boolean b",
"b",
"static void prln(int... a) {\n for (int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i);\n __out.println(a[a.length - 1]);\n }",
"prln",
"{\n for (int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i);\n __out.println(a[a.length - 1]);\n }",
"for (int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i);",
"int i = 0, len = a.length - 1;",
"int i = 0",
"i",
"0",
"len = a.length - 1;",
"len",
"a.length - 1",
"a.length",
"a",
"a.length",
"1",
"i < len",
"i",
"len",
"__out.print(a[i]), __out.print(' '), ++i",
"__out.print(a[i])",
"__out.print",
"__out",
"a[i]",
"a",
"i",
"__out.print(' ')",
"__out.print",
"__out",
"' '",
"++i",
"i",
";",
"__out.println(a[a.length - 1])",
"__out.println",
"__out",
"a[a.length - 1]",
"a",
"a.length - 1",
"a.length",
"a",
"a.length",
"1",
"int... a",
"a",
"static void prln(long... a) {\n for (int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i);\n __out.println(a[a.length - 1]);\n }",
"prln",
"{\n for (int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i);\n __out.println(a[a.length - 1]);\n }",
"for (int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i);",
"int i = 0, len = a.length - 1;",
"int i = 0",
"i",
"0",
"len = a.length - 1;",
"len",
"a.length - 1",
"a.length",
"a",
"a.length",
"1",
"i < len",
"i",
"len",
"__out.print(a[i]), __out.print(' '), ++i",
"__out.print(a[i])",
"__out.print",
"__out",
"a[i]",
"a",
"i",
"__out.print(' ')",
"__out.print",
"__out",
"' '",
"++i",
"i",
";",
"__out.println(a[a.length - 1])",
"__out.println",
"__out",
"a[a.length - 1]",
"a",
"a.length - 1",
"a.length",
"a",
"a.length",
"1",
"long... a",
"a",
"static <T> void prln(Collection<T> c) {\n int n = c.size() - 1;\n Iterator<T> iter = c.iterator();\n for (int i = 0; i < n; __out.print(iter.next()), __out.print(' '), ++i);\n if (n >= 0) {\n __out.println(iter.next());\n } else {\n __out.println();\n }\n }",
"prln",
"{\n int n = c.size() - 1;\n Iterator<T> iter = c.iterator();\n for (int i = 0; i < n; __out.print(iter.next()), __out.print(' '), ++i);\n if (n >= 0) {\n __out.println(iter.next());\n } else {\n __out.println();\n }\n }",
"int n = c.size() - 1;",
"n",
"c.size() - 1",
"c.size()",
"c.size",
"c",
"1",
"Iterator<T> iter = c.iterator();",
"iter",
"c.iterator()",
"c.iterator",
"c",
"for (int i = 0; i < n; __out.print(iter.next()), __out.print(' '), ++i);",
"int i = 0;",
"int i = 0;",
"i",
"0",
"i < n",
"i",
"n",
"__out.print(iter.next()), __out.print(' '), ++i",
"__out.print(iter.next())",
"__out.print",
"__out",
"iter.next()",
"iter.next",
"iter",
"__out.print(' ')",
"__out.print",
"__out",
"' '",
"++i",
"i",
";",
"if (n >= 0) {\n __out.println(iter.next());\n } else {\n __out.println();\n }",
"n >= 0",
"n",
"0",
"{\n __out.println(iter.next());\n }",
"__out.println(iter.next())",
"__out.println",
"__out",
"iter.next()",
"iter.next",
"iter",
"{\n __out.println();\n }",
"__out.println()",
"__out.println",
"__out",
"Collection<T> c",
"c",
"static void h() {\n __out.println(\"hlfd\");\n flush();\n }",
"h",
"{\n __out.println(\"hlfd\");\n flush();\n }",
"__out.println(\"hlfd\")",
"__out.println",
"__out",
"\"hlfd\"",
"flush()",
"flush",
"static void flush() {\n __out.flush();\n }",
"flush",
"{\n __out.flush();\n }",
"__out.flush()",
"__out.flush",
"__out",
"static void close() {\n __out.close();\n }",
"close",
"{\n __out.close();\n }",
"__out.close()",
"__out.close",
"__out",
"static class FastReader {\n\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n }",
"FastReader",
"BufferedReader br;",
"br",
"StringTokenizer st;",
"st",
"public FastReader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }",
"FastReader",
"{\n br = new BufferedReader(new InputStreamReader(System.in));\n }",
"br = new BufferedReader(new InputStreamReader(System.in))",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }",
"next",
"{\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }",
"while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }",
"st == null || !st.hasMoreElements()",
"st == null",
"st",
"null",
"!st.hasMoreElements()",
"st.hasMoreElements()",
"st.hasMoreElements",
"st",
"{\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }",
"try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }",
"catch (IOException e) {\n e.printStackTrace();\n }",
"IOException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n st = new StringTokenizer(br.readLine());\n }",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"int nextInt() {\n return Integer.parseInt(next());\n }",
"nextInt",
"{\n return Integer.parseInt(next());\n }",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"long nextLong() {\n return Long.parseLong(next());\n }",
"nextLong",
"{\n return Long.parseLong(next());\n }",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"double nextDouble() {\n return Double.parseDouble(next());\n }",
"nextDouble",
"{\n return Double.parseDouble(next());\n }",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }",
"nextLine",
"{\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }",
"String str = \"\";",
"str",
"\"\"",
"try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }",
"catch (IOException e) {\n e.printStackTrace();\n }",
"IOException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n str = br.readLine();\n }",
"str = br.readLine()",
"str",
"br.readLine()",
"br.readLine",
"br",
"return str;",
"str",
"public class Main {\n\n public static void main(String[] args) throws IOException {\n\n int n = sc.nextInt();\n int x = sc.nextInt();\n int t = sc.nextInt();\n int mod = n % x;\n if (mod > 0) {\n int res = t + (int) (n / x) * t;\n prln(res);\n } else {\n int res = (int) (n / x) * t;\n prln(res);\n\n }\n close();\n }\n\n static FastReader sc = new FastReader();\n static PrintWriter __out = new PrintWriter(new OutputStreamWriter(System.out));\n static StringTokenizer input;\n static Random __rand = new Random();\n\n // input\n //*******FAST IO*************FAST IO***************FAST IO****************//\n static class FastReader {\n\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n }\n// output\n\n static void pr(int i) {\n __out.print(i);\n }\n\n static void prln(int i) {\n __out.println(i);\n }\n\n static void pr(long l) {\n __out.print(l);\n }\n\n static void prln(long l) {\n __out.println(l);\n }\n\n static void pr(double d) {\n __out.print(d);\n }\n\n static void prln(double d) {\n __out.println(d);\n }\n\n static void pr(char c) {\n __out.print(c);\n }\n\n static void prln(char c) {\n __out.println(c);\n }\n\n static void pr(char[] s) {\n __out.print(new String(s));\n }\n\n static void prln(char[] s) {\n __out.println(new String(s));\n }\n\n static void pr(String s) {\n __out.print(s);\n }\n\n static void prln(String s) {\n __out.println(s);\n }\n\n static void pr(Object o) {\n __out.print(o);\n }\n\n static void prln(Object o) {\n __out.println(o);\n }\n\n static void prln() {\n __out.println();\n }\n\n static void pryes() {\n __out.println(\"yes\");\n }\n\n static void pry() {\n __out.println(\"Yes\");\n }\n\n static void prY() {\n __out.println(\"YES\");\n }\n\n static void prno() {\n __out.println(\"no\");\n }\n\n static void prn() {\n __out.println(\"No\");\n }\n\n static void prN() {\n __out.println(\"NO\");\n }\n\n static void pryesno(boolean b) {\n __out.println(b ? \"yes\" : \"no\");\n }\n\n ;\n static void pryn(boolean b) {\n __out.println(b ? \"Yes\" : \"No\");\n }\n\n static void prYN(boolean b) {\n __out.println(b ? \"YES\" : \"NO\");\n }\n\n static void prln(int... a) {\n for (int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i);\n __out.println(a[a.length - 1]);\n }\n\n static void prln(long... a) {\n for (int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i);\n __out.println(a[a.length - 1]);\n }\n\n static <T> void prln(Collection<T> c) {\n int n = c.size() - 1;\n Iterator<T> iter = c.iterator();\n for (int i = 0; i < n; __out.print(iter.next()), __out.print(' '), ++i);\n if (n >= 0) {\n __out.println(iter.next());\n } else {\n __out.println();\n }\n }\n\n static void h() {\n __out.println(\"hlfd\");\n flush();\n }\n\n static void flush() {\n __out.flush();\n }\n\n static void close() {\n __out.close();\n }\n}",
"public class Main {\n\n public static void main(String[] args) throws IOException {\n\n int n = sc.nextInt();\n int x = sc.nextInt();\n int t = sc.nextInt();\n int mod = n % x;\n if (mod > 0) {\n int res = t + (int) (n / x) * t;\n prln(res);\n } else {\n int res = (int) (n / x) * t;\n prln(res);\n\n }\n close();\n }\n\n static FastReader sc = new FastReader();\n static PrintWriter __out = new PrintWriter(new OutputStreamWriter(System.out));\n static StringTokenizer input;\n static Random __rand = new Random();\n\n // input\n //*******FAST IO*************FAST IO***************FAST IO****************//\n static class FastReader {\n\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n }\n// output\n\n static void pr(int i) {\n __out.print(i);\n }\n\n static void prln(int i) {\n __out.println(i);\n }\n\n static void pr(long l) {\n __out.print(l);\n }\n\n static void prln(long l) {\n __out.println(l);\n }\n\n static void pr(double d) {\n __out.print(d);\n }\n\n static void prln(double d) {\n __out.println(d);\n }\n\n static void pr(char c) {\n __out.print(c);\n }\n\n static void prln(char c) {\n __out.println(c);\n }\n\n static void pr(char[] s) {\n __out.print(new String(s));\n }\n\n static void prln(char[] s) {\n __out.println(new String(s));\n }\n\n static void pr(String s) {\n __out.print(s);\n }\n\n static void prln(String s) {\n __out.println(s);\n }\n\n static void pr(Object o) {\n __out.print(o);\n }\n\n static void prln(Object o) {\n __out.println(o);\n }\n\n static void prln() {\n __out.println();\n }\n\n static void pryes() {\n __out.println(\"yes\");\n }\n\n static void pry() {\n __out.println(\"Yes\");\n }\n\n static void prY() {\n __out.println(\"YES\");\n }\n\n static void prno() {\n __out.println(\"no\");\n }\n\n static void prn() {\n __out.println(\"No\");\n }\n\n static void prN() {\n __out.println(\"NO\");\n }\n\n static void pryesno(boolean b) {\n __out.println(b ? \"yes\" : \"no\");\n }\n\n ;\n static void pryn(boolean b) {\n __out.println(b ? \"Yes\" : \"No\");\n }\n\n static void prYN(boolean b) {\n __out.println(b ? \"YES\" : \"NO\");\n }\n\n static void prln(int... a) {\n for (int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i);\n __out.println(a[a.length - 1]);\n }\n\n static void prln(long... a) {\n for (int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i);\n __out.println(a[a.length - 1]);\n }\n\n static <T> void prln(Collection<T> c) {\n int n = c.size() - 1;\n Iterator<T> iter = c.iterator();\n for (int i = 0; i < n; __out.print(iter.next()), __out.print(' '), ++i);\n if (n >= 0) {\n __out.println(iter.next());\n } else {\n __out.println();\n }\n }\n\n static void h() {\n __out.println(\"hlfd\");\n flush();\n }\n\n static void flush() {\n __out.flush();\n }\n\n static void close() {\n __out.close();\n }\n}",
"Main"
]
|
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
/**
* @author AnonymousP
* @__WHEN YOU FEEL LIKE QUITTING, THINK ABOUT WHY YOU STARTED__@
*/
//COMBINATON = nCr = n*(n-1)/2
public class Main {
public static void main(String[] args) throws IOException {
int n = sc.nextInt();
int x = sc.nextInt();
int t = sc.nextInt();
int mod = n % x;
if (mod > 0) {
int res = t + (int) (n / x) * t;
prln(res);
} else {
int res = (int) (n / x) * t;
prln(res);
}
close();
}
static FastReader sc = new FastReader();
static PrintWriter __out = new PrintWriter(new OutputStreamWriter(System.out));
static StringTokenizer input;
static Random __rand = new Random();
// input
//*******FAST IO*************FAST IO***************FAST IO****************//
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
// output
static void pr(int i) {
__out.print(i);
}
static void prln(int i) {
__out.println(i);
}
static void pr(long l) {
__out.print(l);
}
static void prln(long l) {
__out.println(l);
}
static void pr(double d) {
__out.print(d);
}
static void prln(double d) {
__out.println(d);
}
static void pr(char c) {
__out.print(c);
}
static void prln(char c) {
__out.println(c);
}
static void pr(char[] s) {
__out.print(new String(s));
}
static void prln(char[] s) {
__out.println(new String(s));
}
static void pr(String s) {
__out.print(s);
}
static void prln(String s) {
__out.println(s);
}
static void pr(Object o) {
__out.print(o);
}
static void prln(Object o) {
__out.println(o);
}
static void prln() {
__out.println();
}
static void pryes() {
__out.println("yes");
}
static void pry() {
__out.println("Yes");
}
static void prY() {
__out.println("YES");
}
static void prno() {
__out.println("no");
}
static void prn() {
__out.println("No");
}
static void prN() {
__out.println("NO");
}
static void pryesno(boolean b) {
__out.println(b ? "yes" : "no");
}
;
static void pryn(boolean b) {
__out.println(b ? "Yes" : "No");
}
static void prYN(boolean b) {
__out.println(b ? "YES" : "NO");
}
static void prln(int... a) {
for (int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i);
__out.println(a[a.length - 1]);
}
static void prln(long... a) {
for (int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i);
__out.println(a[a.length - 1]);
}
static <T> void prln(Collection<T> c) {
int n = c.size() - 1;
Iterator<T> iter = c.iterator();
for (int i = 0; i < n; __out.print(iter.next()), __out.print(' '), ++i);
if (n >= 0) {
__out.println(iter.next());
} else {
__out.println();
}
}
static void h() {
__out.println("hlfd");
flush();
}
static void flush() {
__out.flush();
}
static void close() {
__out.close();
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
2,
2,
2,
13,
13,
13,
8,
2,
2,
13,
13,
17,
13,
17,
4,
18,
18,
13,
13,
13,
4,
18,
13,
12,
13,
30,
4,
13,
23,
13,
10,
6,
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
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
25,
26
],
[
8,
27
],
[
27,
28
],
[
27,
29
],
[
29,
30
],
[
30,
31
],
[
31,
32
],
[
31,
33
],
[
30,
34
],
[
29,
35
],
[
35,
36
],
[
36,
37
],
[
37,
38
],
[
37,
39
],
[
36,
40
],
[
35,
41
],
[
35,
42
],
[
8,
43
],
[
43,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
43,
48
],
[
8,
49
],
[
49,
50
],
[
50,
51
],
[
60,
52
],
[
52,
53
],
[
52,
54
],
[
54,
55
],
[
55,
56
],
[
52,
57
],
[
57,
58
],
[
0,
59
],
[
59,
60
],
[
59,
61
]
]
| [
"import java.util.*;\n// warm-up\npublic class Main {\n\n\tstatic void solve() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n=sc.nextInt(), x=sc.nextInt(), t=sc.nextInt();\n\t\tint s = ((n/x)*t) + ((n%x>0) ? t : 0);\n\t\tSystem.out.println(s);\n\t\tsc.close();\t\t\n\t}\n\n\tpublic static void main(String args[]) {\n\t\tsolve();\n\t}\n\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n\n\tstatic void solve() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n=sc.nextInt(), x=sc.nextInt(), t=sc.nextInt();\n\t\tint s = ((n/x)*t) + ((n%x>0) ? t : 0);\n\t\tSystem.out.println(s);\n\t\tsc.close();\t\t\n\t}\n\n\tpublic static void main(String args[]) {\n\t\tsolve();\n\t}\n\n}",
"Main",
"static void solve() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n=sc.nextInt(), x=sc.nextInt(), t=sc.nextInt();\n\t\tint s = ((n/x)*t) + ((n%x>0) ? t : 0);\n\t\tSystem.out.println(s);\n\t\tsc.close();\t\t\n\t}",
"solve",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n=sc.nextInt(), x=sc.nextInt(), t=sc.nextInt();\n\t\tint s = ((n/x)*t) + ((n%x>0) ? t : 0);\n\t\tSystem.out.println(s);\n\t\tsc.close();\t\t\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n=sc.nextInt()",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"x=sc.nextInt()",
"x",
"sc.nextInt()",
"sc.nextInt",
"sc",
"t=sc.nextInt();",
"t",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int s = ((n/x)*t) + ((n%x>0) ? t : 0);",
"s",
"((n/x)*t) + ((n%x>0) ? t : 0)",
"((n/x)*t)",
"(n/x)",
"n",
"x",
"t",
"((n%x>0) ? t : 0)",
"(n%x>0)",
"n%x",
"n",
"x",
"0",
"t",
"0",
"System.out.println(s)",
"System.out.println",
"System.out",
"System",
"System.out",
"s",
"sc.close()",
"sc.close",
"sc",
"public static void main(String args[]) {\n\t\tsolve();\n\t}",
"main",
"{\n\t\tsolve();\n\t}",
"solve()",
"solve",
"String args[]",
"args",
"public class Main {\n\n\tstatic void solve() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n=sc.nextInt(), x=sc.nextInt(), t=sc.nextInt();\n\t\tint s = ((n/x)*t) + ((n%x>0) ? t : 0);\n\t\tSystem.out.println(s);\n\t\tsc.close();\t\t\n\t}\n\n\tpublic static void main(String args[]) {\n\t\tsolve();\n\t}\n\n}",
"public class Main {\n\n\tstatic void solve() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n=sc.nextInt(), x=sc.nextInt(), t=sc.nextInt();\n\t\tint s = ((n/x)*t) + ((n%x>0) ? t : 0);\n\t\tSystem.out.println(s);\n\t\tsc.close();\t\t\n\t}\n\n\tpublic static void main(String args[]) {\n\t\tsolve();\n\t}\n\n}",
"Main"
]
| import java.util.*;
// warm-up
public class Main {
static void solve() {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt(), x=sc.nextInt(), t=sc.nextInt();
int s = ((n/x)*t) + ((n%x>0) ? t : 0);
System.out.println(s);
sc.close();
}
public static void main(String args[]) {
solve();
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
14,
2,
2,
13,
13,
17,
30,
4,
18,
18,
13,
13,
2,
2,
13,
13,
13,
30,
4,
18,
18,
13,
13,
2,
2,
2,
13,
13,
17,
13,
23,
13,
10,
6,
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
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
25,
26
],
[
8,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
29,
31
],
[
28,
32
],
[
27,
33
],
[
33,
34
],
[
34,
35
],
[
35,
36
],
[
36,
37
],
[
36,
38
],
[
34,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
39,
43
],
[
27,
44
],
[
44,
45
],
[
45,
46
],
[
46,
47
],
[
47,
48
],
[
47,
49
],
[
45,
50
],
[
50,
51
],
[
51,
52
],
[
52,
53
],
[
52,
54
],
[
51,
55
],
[
50,
56
],
[
6,
57
],
[
57,
58
],
[
0,
59
],
[
59,
60
],
[
59,
61
]
]
| [
"import java.util.*;\n\npublic class Main {\n\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tif(a%b==0) {\n\t\t\tSystem.out.println(a/b*c);\n\t\t}else {\n\t\t\tSystem.out.println((a/b+1)*c);\n\t\t}\n\n\t}\n\n\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tif(a%b==0) {\n\t\t\tSystem.out.println(a/b*c);\n\t\t}else {\n\t\t\tSystem.out.println((a/b+1)*c);\n\t\t}\n\n\t}\n\n\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tif(a%b==0) {\n\t\t\tSystem.out.println(a/b*c);\n\t\t}else {\n\t\t\tSystem.out.println((a/b+1)*c);\n\t\t}\n\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tif(a%b==0) {\n\t\t\tSystem.out.println(a/b*c);\n\t\t}else {\n\t\t\tSystem.out.println((a/b+1)*c);\n\t\t}\n\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int a = sc.nextInt();",
"a",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int b = sc.nextInt();",
"b",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int c = sc.nextInt();",
"c",
"sc.nextInt()",
"sc.nextInt",
"sc",
"if(a%b==0) {\n\t\t\tSystem.out.println(a/b*c);\n\t\t}else {\n\t\t\tSystem.out.println((a/b+1)*c);\n\t\t}",
"a%b==0",
"a%b",
"a",
"b",
"0",
"{\n\t\t\tSystem.out.println(a/b*c);\n\t\t}",
"System.out.println(a/b*c)",
"System.out.println",
"System.out",
"System",
"System.out",
"a/b*c",
"a/b",
"a",
"b",
"c",
"{\n\t\t\tSystem.out.println((a/b+1)*c);\n\t\t}",
"System.out.println((a/b+1)*c)",
"System.out.println",
"System.out",
"System",
"System.out",
"(a/b+1)*c",
"(a/b+1)",
"a/b",
"a",
"b",
"1",
"c",
"String[] args",
"args",
"public class Main {\n\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tif(a%b==0) {\n\t\t\tSystem.out.println(a/b*c);\n\t\t}else {\n\t\t\tSystem.out.println((a/b+1)*c);\n\t\t}\n\n\t}\n\n\n}",
"public class Main {\n\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tif(a%b==0) {\n\t\t\tSystem.out.println(a/b*c);\n\t\t}else {\n\t\t\tSystem.out.println((a/b+1)*c);\n\t\t}\n\n\t}\n\n\n}",
"Main"
]
| import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
if(a%b==0) {
System.out.println(a/b*c);
}else {
System.out.println((a/b+1)*c);
}
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
14,
2,
2,
13,
13,
17,
4,
18,
18,
13,
13,
2,
13,
2,
13,
13,
4,
18,
18,
13,
13,
2,
13,
2,
2,
13,
13,
17,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
58,
5
],
[
58,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
8,
17
],
[
17,
18
],
[
17,
19
],
[
19,
20
],
[
20,
21
],
[
8,
22
],
[
22,
23
],
[
22,
24
],
[
24,
25
],
[
25,
26
],
[
8,
27
],
[
27,
28
],
[
28,
29
],
[
29,
30
],
[
29,
31
],
[
28,
32
],
[
27,
33
],
[
33,
34
],
[
34,
35
],
[
35,
36
],
[
35,
37
],
[
33,
38
],
[
38,
39
],
[
38,
40
],
[
40,
41
],
[
40,
42
],
[
27,
43
],
[
43,
44
],
[
44,
45
],
[
45,
46
],
[
45,
47
],
[
43,
48
],
[
48,
49
],
[
48,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
50,
54
],
[
6,
55
],
[
55,
56
],
[
0,
57
],
[
57,
58
],
[
57,
59
]
]
| [
"import java.util.*;\n\npublic class Main{\n\tpublic static void main(String arg[]){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint x=sc.nextInt();\n\t\tint t=sc.nextInt();\n\t\tif(n%x==0)\n\t\t\tSystem.out.println((t*(n/x)));\n\t\telse \n\t\t\tSystem.out.println(t*((n/x)+1));\n\t}\n}",
"import java.util.*;",
"util.*",
"java",
"public class Main{\n\tpublic static void main(String arg[]){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint x=sc.nextInt();\n\t\tint t=sc.nextInt();\n\t\tif(n%x==0)\n\t\t\tSystem.out.println((t*(n/x)));\n\t\telse \n\t\t\tSystem.out.println(t*((n/x)+1));\n\t}\n}",
"Main",
"public static void main(String arg[]){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint x=sc.nextInt();\n\t\tint t=sc.nextInt();\n\t\tif(n%x==0)\n\t\t\tSystem.out.println((t*(n/x)));\n\t\telse \n\t\t\tSystem.out.println(t*((n/x)+1));\n\t}",
"main",
"{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint x=sc.nextInt();\n\t\tint t=sc.nextInt();\n\t\tif(n%x==0)\n\t\t\tSystem.out.println((t*(n/x)));\n\t\telse \n\t\t\tSystem.out.println(t*((n/x)+1));\n\t}",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n=sc.nextInt();",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int x=sc.nextInt();",
"x",
"sc.nextInt()",
"sc.nextInt",
"sc",
"int t=sc.nextInt();",
"t",
"sc.nextInt()",
"sc.nextInt",
"sc",
"if(n%x==0)\n\t\t\tSystem.out.println((t*(n/x)));\n\t\telse \n\t\t\tSystem.out.println(t*((n/x)+1));",
"n%x==0",
"n%x",
"n",
"x",
"0",
"System.out.println((t*(n/x)))",
"System.out.println",
"System.out",
"System",
"System.out",
"(t*(n/x))",
"t",
"(n/x)",
"n",
"x",
"System.out.println(t*((n/x)+1))",
"System.out.println",
"System.out",
"System",
"System.out",
"t*((n/x)+1)",
"t",
"((n/x)+1)",
"(n/x)",
"n",
"x",
"1",
"String arg[]",
"arg",
"public class Main{\n\tpublic static void main(String arg[]){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint x=sc.nextInt();\n\t\tint t=sc.nextInt();\n\t\tif(n%x==0)\n\t\t\tSystem.out.println((t*(n/x)));\n\t\telse \n\t\t\tSystem.out.println(t*((n/x)+1));\n\t}\n}",
"public class Main{\n\tpublic static void main(String arg[]){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint x=sc.nextInt();\n\t\tint t=sc.nextInt();\n\t\tif(n%x==0)\n\t\t\tSystem.out.println((t*(n/x)));\n\t\telse \n\t\t\tSystem.out.println(t*((n/x)+1));\n\t}\n}",
"Main"
]
| import java.util.*;
public class Main{
public static void main(String arg[]){
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int x=sc.nextInt();
int t=sc.nextInt();
if(n%x==0)
System.out.println((t*(n/x)));
else
System.out.println(t*((n/x)+1));
}
} |
[
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,
13,
4,
18,
13,
41,
13,
4,
18,
13,
4,
18,
13,
41,
13,
17,
42,
2,
13,
17,
30,
0,
13,
13,
0,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
62,
8
],
[
62,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
11,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
17,
20
],
[
20,
21
],
[
21,
22
],
[
11,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
26,
27
],
[
25,
28
],
[
28,
29
],
[
29,
30
],
[
11,
31
],
[
31,
32
],
[
31,
33
],
[
33,
34
],
[
34,
35
],
[
33,
36
],
[
36,
37
],
[
37,
38
],
[
11,
39
],
[
39,
40
],
[
39,
41
],
[
11,
42
],
[
42,
43
],
[
43,
44
],
[
43,
45
],
[
42,
46
],
[
46,
47
],
[
47,
48
],
[
47,
49
],
[
46,
50
],
[
50,
51
],
[
50,
52
],
[
11,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
53,
58
],
[
9,
59
],
[
59,
60
],
[
0,
61
],
[
61,
62
],
[
61,
63
]
]
| [
"import java.util.Scanner;\nimport java.util.*;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint N = Integer.parseInt(scan.next());\n\t\tint X = Integer.parseInt(scan.next());\n\t\tint T = Integer.parseInt(scan.next());\n\t\tint ans = 0;\n\n\t\twhile (N > 0) {\n\t\t\tans+=T;\n\t\t\tN-=X;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"import java.util.*;",
"util.*",
"java",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint N = Integer.parseInt(scan.next());\n\t\tint X = Integer.parseInt(scan.next());\n\t\tint T = Integer.parseInt(scan.next());\n\t\tint ans = 0;\n\n\t\twhile (N > 0) {\n\t\t\tans+=T;\n\t\t\tN-=X;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint N = Integer.parseInt(scan.next());\n\t\tint X = Integer.parseInt(scan.next());\n\t\tint T = Integer.parseInt(scan.next());\n\t\tint ans = 0;\n\n\t\twhile (N > 0) {\n\t\t\tans+=T;\n\t\t\tN-=X;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}",
"main",
"{\n\t\tScanner scan = new Scanner(System.in);\n\t\tint N = Integer.parseInt(scan.next());\n\t\tint X = Integer.parseInt(scan.next());\n\t\tint T = Integer.parseInt(scan.next());\n\t\tint ans = 0;\n\n\t\twhile (N > 0) {\n\t\t\tans+=T;\n\t\t\tN-=X;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}",
"Scanner scan = new Scanner(System.in);",
"scan",
"new Scanner(System.in)",
"int N = Integer.parseInt(scan.next());",
"N",
"Integer.parseInt(scan.next())",
"Integer.parseInt",
"Integer",
"scan.next()",
"scan.next",
"scan",
"int X = Integer.parseInt(scan.next());",
"X",
"Integer.parseInt(scan.next())",
"Integer.parseInt",
"Integer",
"scan.next()",
"scan.next",
"scan",
"int T = Integer.parseInt(scan.next());",
"T",
"Integer.parseInt(scan.next())",
"Integer.parseInt",
"Integer",
"scan.next()",
"scan.next",
"scan",
"int ans = 0;",
"ans",
"0",
"while (N > 0) {\n\t\t\tans+=T;\n\t\t\tN-=X;\n\t\t}",
"N > 0",
"N",
"0",
"{\n\t\t\tans+=T;\n\t\t\tN-=X;\n\t\t}",
"ans+=T",
"ans",
"T",
"N-=X",
"N",
"X",
"System.out.println(ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"ans",
"String[] args",
"args",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint N = Integer.parseInt(scan.next());\n\t\tint X = Integer.parseInt(scan.next());\n\t\tint T = Integer.parseInt(scan.next());\n\t\tint ans = 0;\n\n\t\twhile (N > 0) {\n\t\t\tans+=T;\n\t\t\tN-=X;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n}",
"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint N = Integer.parseInt(scan.next());\n\t\tint X = Integer.parseInt(scan.next());\n\t\tint T = Integer.parseInt(scan.next());\n\t\tint ans = 0;\n\n\t\twhile (N > 0) {\n\t\t\tans+=T;\n\t\t\tN-=X;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n}",
"Main"
]
| import java.util.Scanner;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int N = Integer.parseInt(scan.next());
int X = Integer.parseInt(scan.next());
int T = Integer.parseInt(scan.next());
int ans = 0;
while (N > 0) {
ans+=T;
N-=X;
}
System.out.println(ans);
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
20,
41,
13,
20,
12,
13,
30,
41,
13,
20,
4,
18,
13,
4,
18,
13,
23,
13,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
4,
18,
18,
13,
13,
2,
2,
2,
2,
13,
13,
17,
13,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
62,
8
],
[
62,
9
],
[
9,
10
],
[
9,
11
],
[
62,
12
],
[
12,
13
],
[
12,
14
],
[
62,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
18,
20
],
[
17,
21
],
[
21,
22
],
[
22,
23
],
[
17,
24
],
[
24,
25
],
[
25,
26
],
[
15,
27
],
[
27,
28
],
[
62,
29
],
[
29,
30
],
[
29,
31
],
[
31,
32
],
[
32,
33
],
[
32,
34
],
[
34,
35
],
[
35,
36
],
[
31,
37
],
[
37,
38
],
[
37,
39
],
[
39,
40
],
[
40,
41
],
[
31,
42
],
[
42,
43
],
[
42,
44
],
[
44,
45
],
[
45,
46
],
[
31,
47
],
[
47,
48
],
[
48,
49
],
[
49,
50
],
[
49,
51
],
[
47,
52
],
[
52,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
54,
58
],
[
53,
59
],
[
52,
60
],
[
0,
61
],
[
61,
62
],
[
61,
63
]
]
| [
"import java.util.*;\nimport java.io.*;\npublic class Main {\n\n\tstatic Scanner inp= new Scanner(System.in);\n\tstatic PrintWriter out= new PrintWriter(System.out);\n\tpublic static void main(String args[]) {\t\t \t\n\t \tMain g=new Main();\n\t \tg.main();\n\t \tout.close();\n\t}\n\n\t\n\t\n\t//Main\n\tvoid main() {\n\t\t\n\t\tint n=inp.nextInt();\n\t\tint x=inp.nextInt();\n\t\tint t=inp.nextInt();\n\t\tSystem.out.println((((n+x-1))/x)*t);\n\t\t\n\t}\n \n \n\t\t\n}",
"import java.util.*;",
"util.*",
"java",
"import java.io.*;",
"io.*",
"java",
"public class Main {\n\n\tstatic Scanner inp= new Scanner(System.in);\n\tstatic PrintWriter out= new PrintWriter(System.out);\n\tpublic static void main(String args[]) {\t\t \t\n\t \tMain g=new Main();\n\t \tg.main();\n\t \tout.close();\n\t}\n\n\t\n\t\n\t//Main\n\tvoid main() {\n\t\t\n\t\tint n=inp.nextInt();\n\t\tint x=inp.nextInt();\n\t\tint t=inp.nextInt();\n\t\tSystem.out.println((((n+x-1))/x)*t);\n\t\t\n\t}\n \n \n\t\t\n}",
"Main",
"static Scanner inp= new Scanner(System.in);",
"inp",
"new Scanner(System.in)",
"static PrintWriter out= new PrintWriter(System.out);",
"out",
"new PrintWriter(System.out)",
"public static void main(String args[]) {\t\t \t\n\t \tMain g=new Main();\n\t \tg.main();\n\t \tout.close();\n\t}",
"main",
"{\t\t \t\n\t \tMain g=new Main();\n\t \tg.main();\n\t \tout.close();\n\t}",
"Main g=new Main();",
"g",
"new Main()",
"g.main()",
"g.main",
"g",
"out.close()",
"out.close",
"out",
"String args[]",
"args",
"//Main\n\tvoid main() {\n\t\t\n\t\tint n=inp.nextInt();\n\t\tint x=inp.nextInt();\n\t\tint t=inp.nextInt();\n\t\tSystem.out.println((((n+x-1))/x)*t);\n\t\t\n\t}",
"main",
"{\n\t\t\n\t\tint n=inp.nextInt();\n\t\tint x=inp.nextInt();\n\t\tint t=inp.nextInt();\n\t\tSystem.out.println((((n+x-1))/x)*t);\n\t\t\n\t}",
"int n=inp.nextInt();",
"n",
"inp.nextInt()",
"inp.nextInt",
"inp",
"int x=inp.nextInt();",
"x",
"inp.nextInt()",
"inp.nextInt",
"inp",
"int t=inp.nextInt();",
"t",
"inp.nextInt()",
"inp.nextInt",
"inp",
"System.out.println((((n+x-1))/x)*t)",
"System.out.println",
"System.out",
"System",
"System.out",
"(((n+x-1))/x)*t",
"(((n+x-1))/x)",
"((n+x-1))",
"n+x",
"n",
"x",
"1",
"x",
"t",
"public class Main {\n\n\tstatic Scanner inp= new Scanner(System.in);\n\tstatic PrintWriter out= new PrintWriter(System.out);\n\tpublic static void main(String args[]) {\t\t \t\n\t \tMain g=new Main();\n\t \tg.main();\n\t \tout.close();\n\t}\n\n\t\n\t\n\t//Main\n\tvoid main() {\n\t\t\n\t\tint n=inp.nextInt();\n\t\tint x=inp.nextInt();\n\t\tint t=inp.nextInt();\n\t\tSystem.out.println((((n+x-1))/x)*t);\n\t\t\n\t}\n \n \n\t\t\n}",
"public class Main {\n\n\tstatic Scanner inp= new Scanner(System.in);\n\tstatic PrintWriter out= new PrintWriter(System.out);\n\tpublic static void main(String args[]) {\t\t \t\n\t \tMain g=new Main();\n\t \tg.main();\n\t \tout.close();\n\t}\n\n\t\n\t\n\t//Main\n\tvoid main() {\n\t\t\n\t\tint n=inp.nextInt();\n\t\tint x=inp.nextInt();\n\t\tint t=inp.nextInt();\n\t\tSystem.out.println((((n+x-1))/x)*t);\n\t\t\n\t}\n \n \n\t\t\n}",
"Main"
]
| import java.util.*;
import java.io.*;
public class Main {
static Scanner inp= new Scanner(System.in);
static PrintWriter out= new PrintWriter(System.out);
public static void main(String args[]) {
Main g=new Main();
g.main();
out.close();
}
//Main
void main() {
int n=inp.nextInt();
int x=inp.nextInt();
int t=inp.nextInt();
System.out.println((((n+x-1))/x)*t);
}
}
|
[
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,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
14,
2,
2,
13,
13,
17,
0,
13,
2,
13,
13,
0,
13,
2,
2,
13,
13,
17,
4,
18,
18,
13,
13,
2,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
64,
11
],
[
64,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
14,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
14,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
26,
27
],
[
14,
28
],
[
28,
29
],
[
28,
30
],
[
30,
31
],
[
31,
32
],
[
14,
33
],
[
33,
34
],
[
14,
35
],
[
35,
36
],
[
36,
37
],
[
37,
38
],
[
37,
39
],
[
36,
40
],
[
35,
41
],
[
41,
42
],
[
41,
43
],
[
43,
44
],
[
43,
45
],
[
35,
46
],
[
46,
47
],
[
46,
48
],
[
48,
49
],
[
49,
50
],
[
49,
51
],
[
48,
52
],
[
14,
53
],
[
53,
54
],
[
54,
55
],
[
55,
56
],
[
55,
57
],
[
53,
58
],
[
58,
59
],
[
58,
60
],
[
12,
61
],
[
61,
62
],
[
0,
63
],
[
63,
64
],
[
63,
65
]
]
| [
"\n\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\npublic class Main\n{\n public static void main (String[] args)\n {\n // your code goes here\n Scanner s = new Scanner(System.in);\n int n = s.nextInt();\n int x =s.nextInt();\n int t = s.nextInt();\n int q;\n if(n%x==0)\n q = n/x;\n else\n q = n/x+1;\n System.out.println(q*t);\n }\n}",
"import java.util.*;",
"util.*",
"java",
"import java.lang.*;",
"lang.*",
"java",
"import java.io.*;",
"io.*",
"java",
"public class Main\n{\n public static void main (String[] args)\n {\n // your code goes here\n Scanner s = new Scanner(System.in);\n int n = s.nextInt();\n int x =s.nextInt();\n int t = s.nextInt();\n int q;\n if(n%x==0)\n q = n/x;\n else\n q = n/x+1;\n System.out.println(q*t);\n }\n}",
"Main",
"public static void main (String[] args)\n {\n // your code goes here\n Scanner s = new Scanner(System.in);\n int n = s.nextInt();\n int x =s.nextInt();\n int t = s.nextInt();\n int q;\n if(n%x==0)\n q = n/x;\n else\n q = n/x+1;\n System.out.println(q*t);\n }",
"main",
"{\n // your code goes here\n Scanner s = new Scanner(System.in);\n int n = s.nextInt();\n int x =s.nextInt();\n int t = s.nextInt();\n int q;\n if(n%x==0)\n q = n/x;\n else\n q = n/x+1;\n System.out.println(q*t);\n }",
"Scanner s = new Scanner(System.in);",
"s",
"new Scanner(System.in)",
"int n = s.nextInt();",
"n",
"s.nextInt()",
"s.nextInt",
"s",
"int x =s.nextInt();",
"x",
"s.nextInt()",
"s.nextInt",
"s",
"int t = s.nextInt();",
"t",
"s.nextInt()",
"s.nextInt",
"s",
"int q;",
"q",
"if(n%x==0)\n q = n/x;\n else\n q = n/x+1;",
"n%x==0",
"n%x",
"n",
"x",
"0",
"q = n/x",
"q",
"n/x",
"n",
"x",
"q = n/x+1",
"q",
"n/x+1",
"n/x",
"n",
"x",
"1",
"System.out.println(q*t)",
"System.out.println",
"System.out",
"System",
"System.out",
"q*t",
"q",
"t",
"String[] args",
"args",
"public class Main\n{\n public static void main (String[] args)\n {\n // your code goes here\n Scanner s = new Scanner(System.in);\n int n = s.nextInt();\n int x =s.nextInt();\n int t = s.nextInt();\n int q;\n if(n%x==0)\n q = n/x;\n else\n q = n/x+1;\n System.out.println(q*t);\n }\n}",
"public class Main\n{\n public static void main (String[] args)\n {\n // your code goes here\n Scanner s = new Scanner(System.in);\n int n = s.nextInt();\n int x =s.nextInt();\n int t = s.nextInt();\n int q;\n if(n%x==0)\n q = n/x;\n else\n q = n/x+1;\n System.out.println(q*t);\n }\n}",
"Main"
]
|
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main
{
public static void main (String[] args)
{
// your code goes here
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int x =s.nextInt();
int t = s.nextInt();
int q;
if(n%x==0)
q = n/x;
else
q = n/x+1;
System.out.println(q*t);
}
} |
[
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,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
2,
13,
13,
14,
2,
2,
13,
13,
17,
40,
13,
0,
13,
13,
4,
18,
18,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
7,
8
],
[
7,
9
],
[
0,
10
],
[
58,
11
],
[
58,
12
],
[
12,
13
],
[
12,
14
],
[
14,
15
],
[
15,
16
],
[
15,
17
],
[
14,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
14,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
26,
27
],
[
14,
28
],
[
28,
29
],
[
28,
30
],
[
30,
31
],
[
31,
32
],
[
14,
33
],
[
33,
34
],
[
33,
35
],
[
35,
36
],
[
35,
37
],
[
14,
38
],
[
38,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
39,
43
],
[
38,
44
],
[
44,
45
],
[
14,
46
],
[
46,
47
],
[
46,
48
],
[
14,
49
],
[
49,
50
],
[
50,
51
],
[
51,
52
],
[
51,
53
],
[
49,
54
],
[
12,
55
],
[
55,
56
],
[
0,
57
],
[
57,
58
],
[
57,
59
]
]
| [
"import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n\t\tint n = in.nextInt();\n\t\tint x = in.nextInt();\n\t\tint t = in.nextInt();\n\t\tint ans = n / x;\n\t\tif (n % x != 0)\n\t\t\tans++;\n\t\tans *= t;\n\t\tSystem.out.println(ans);\n\t}\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n\t\tint n = in.nextInt();\n\t\tint x = in.nextInt();\n\t\tint t = in.nextInt();\n\t\tint ans = n / x;\n\t\tif (n % x != 0)\n\t\t\tans++;\n\t\tans *= t;\n\t\tSystem.out.println(ans);\n\t}\n}",
"Main",
"public static void main(String[] args) {\n\t\tScanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n\t\tint n = in.nextInt();\n\t\tint x = in.nextInt();\n\t\tint t = in.nextInt();\n\t\tint ans = n / x;\n\t\tif (n % x != 0)\n\t\t\tans++;\n\t\tans *= t;\n\t\tSystem.out.println(ans);\n\t}",
"main",
"{\n\t\tScanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n\t\tint n = in.nextInt();\n\t\tint x = in.nextInt();\n\t\tint t = in.nextInt();\n\t\tint ans = n / x;\n\t\tif (n % x != 0)\n\t\t\tans++;\n\t\tans *= t;\n\t\tSystem.out.println(ans);\n\t}",
"Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));",
"in",
"new Scanner(new BufferedReader(new InputStreamReader(System.in)))",
"int n = in.nextInt();",
"n",
"in.nextInt()",
"in.nextInt",
"in",
"int x = in.nextInt();",
"x",
"in.nextInt()",
"in.nextInt",
"in",
"int t = in.nextInt();",
"t",
"in.nextInt()",
"in.nextInt",
"in",
"int ans = n / x;",
"ans",
"n / x",
"n",
"x",
"if (n % x != 0)\n\t\t\tans++;",
"n % x != 0",
"n % x",
"n",
"x",
"0",
"ans++",
"ans",
"ans *= t",
"ans",
"t",
"System.out.println(ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"ans",
"String[] args",
"args",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n\t\tint n = in.nextInt();\n\t\tint x = in.nextInt();\n\t\tint t = in.nextInt();\n\t\tint ans = n / x;\n\t\tif (n % x != 0)\n\t\t\tans++;\n\t\tans *= t;\n\t\tSystem.out.println(ans);\n\t}\n}",
"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n\t\tint n = in.nextInt();\n\t\tint x = in.nextInt();\n\t\tint t = in.nextInt();\n\t\tint ans = n / x;\n\t\tif (n % x != 0)\n\t\t\tans++;\n\t\tans *= t;\n\t\tSystem.out.println(ans);\n\t}\n}",
"Main"
]
| import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
int n = in.nextInt();
int x = in.nextInt();
int t = in.nextInt();
int ans = n / x;
if (n % x != 0)
ans++;
ans *= t;
System.out.println(ans);
}
}
|
[
7,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
41,
13,
41,
13,
0,
13,
4,
18,
13,
0,
13,
4,
18,
13,
0,
13,
4,
18,
13,
41,
13,
17,
41,
13,
17,
42,
2,
13,
13,
30,
0,
13,
13,
0,
13,
13,
4,
18,
18,
13,
13,
13,
4,
18,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
62,
5
],
[
62,
6
],
[
6,
7
],
[
6,
8
],
[
8,
9
],
[
9,
10
],
[
9,
11
],
[
8,
12
],
[
12,
13
],
[
8,
14
],
[
14,
15
],
[
8,
16
],
[
16,
17
],
[
8,
18
],
[
18,
19
],
[
18,
20
],
[
20,
21
],
[
21,
22
],
[
8,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
26,
27
],
[
8,
28
],
[
28,
29
],
[
28,
30
],
[
30,
31
],
[
31,
32
],
[
8,
33
],
[
33,
34
],
[
33,
35
],
[
8,
36
],
[
36,
37
],
[
36,
38
],
[
8,
39
],
[
39,
40
],
[
40,
41
],
[
40,
42
],
[
39,
43
],
[
43,
44
],
[
44,
45
],
[
44,
46
],
[
43,
47
],
[
47,
48
],
[
47,
49
],
[
8,
50
],
[
50,
51
],
[
51,
52
],
[
52,
53
],
[
52,
54
],
[
50,
55
],
[
8,
56
],
[
56,
57
],
[
57,
58
],
[
6,
59
],
[
59,
60
],
[
0,
61
],
[
61,
62
],
[
61,
63
]
]
| [
"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, x, t;\n n = sc.nextInt();\n x = sc.nextInt();\n t = sc.nextInt();\n long ans = 0, tako = 0;\n while (n > tako) {\n ans += t;\n tako += x;\n }\n System.out.println(ans);\n sc.close();\n }\n}",
"import java.util.Scanner;",
"Scanner",
"java.util",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n, x, t;\n n = sc.nextInt();\n x = sc.nextInt();\n t = sc.nextInt();\n long ans = 0, tako = 0;\n while (n > tako) {\n ans += t;\n tako += x;\n }\n System.out.println(ans);\n sc.close();\n }\n}",
"Main",
"public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n, x, t;\n n = sc.nextInt();\n x = sc.nextInt();\n t = sc.nextInt();\n long ans = 0, tako = 0;\n while (n > tako) {\n ans += t;\n tako += x;\n }\n System.out.println(ans);\n sc.close();\n }",
"main",
"{\n Scanner sc = new Scanner(System.in);\n int n, x, t;\n n = sc.nextInt();\n x = sc.nextInt();\n t = sc.nextInt();\n long ans = 0, tako = 0;\n while (n > tako) {\n ans += t;\n tako += x;\n }\n System.out.println(ans);\n sc.close();\n }",
"Scanner sc = new Scanner(System.in);",
"sc",
"new Scanner(System.in)",
"int n",
"n",
"x",
"x",
"t;",
"t",
"n = sc.nextInt()",
"n",
"sc.nextInt()",
"sc.nextInt",
"sc",
"x = sc.nextInt()",
"x",
"sc.nextInt()",
"sc.nextInt",
"sc",
"t = sc.nextInt()",
"t",
"sc.nextInt()",
"sc.nextInt",
"sc",
"long ans = 0",
"ans",
"0",
"tako = 0;",
"tako",
"0",
"while (n > tako) {\n ans += t;\n tako += x;\n }",
"n > tako",
"n",
"tako",
"{\n ans += t;\n tako += x;\n }",
"ans += t",
"ans",
"t",
"tako += x",
"tako",
"x",
"System.out.println(ans)",
"System.out.println",
"System.out",
"System",
"System.out",
"ans",
"sc.close()",
"sc.close",
"sc",
"String[] args",
"args",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n, x, t;\n n = sc.nextInt();\n x = sc.nextInt();\n t = sc.nextInt();\n long ans = 0, tako = 0;\n while (n > tako) {\n ans += t;\n tako += x;\n }\n System.out.println(ans);\n sc.close();\n }\n}",
"public class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n, x, t;\n n = sc.nextInt();\n x = sc.nextInt();\n t = sc.nextInt();\n long ans = 0, tako = 0;\n while (n > tako) {\n ans += t;\n tako += x;\n }\n System.out.println(ans);\n sc.close();\n }\n}",
"Main"
]
| import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n, x, t;
n = sc.nextInt();
x = sc.nextInt();
t = sc.nextInt();
long ans = 0, tako = 0;
while (n > tako) {
ans += t;
tako += x;
}
System.out.println(ans);
sc.close();
}
} |
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
12,
13,
30,
41,
13,
20,
41,
13,
4,
18,
4,
18,
13,
17,
41,
13,
4,
18,
13,
18,
13,
17,
41,
13,
4,
18,
13,
18,
13,
17,
41,
13,
4,
18,
13,
18,
13,
17,
4,
18,
18,
13,
13,
2,
4,
18,
13,
2,
13,
13,
13,
23,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
63,
8
],
[
63,
9
],
[
9,
10
],
[
9,
11
],
[
11,
12
],
[
12,
13
],
[
12,
14
],
[
11,
15
],
[
15,
16
],
[
15,
17
],
[
17,
18
],
[
18,
19
],
[
19,
20
],
[
20,
21
],
[
17,
22
],
[
11,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
26,
27
],
[
25,
28
],
[
28,
29
],
[
28,
30
],
[
11,
31
],
[
31,
32
],
[
31,
33
],
[
33,
34
],
[
34,
35
],
[
33,
36
],
[
36,
37
],
[
36,
38
],
[
11,
39
],
[
39,
40
],
[
39,
41
],
[
41,
42
],
[
42,
43
],
[
41,
44
],
[
44,
45
],
[
44,
46
],
[
11,
47
],
[
47,
48
],
[
48,
49
],
[
49,
50
],
[
49,
51
],
[
47,
52
],
[
52,
53
],
[
53,
54
],
[
54,
55
],
[
53,
56
],
[
56,
57
],
[
56,
58
],
[
52,
59
],
[
9,
60
],
[
60,
61
],
[
0,
62
],
[
62,
63
],
[
62,
64
]
]
| [
"import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main{\n\tpublic static void main(String[] args)throws Exception{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] strs = br.readLine().split(\" \");\n\t\t\n\t\tint n = Integer.parseInt(strs[0]);\n\t\tint x = Integer.parseInt(strs[1]);\n\t\tint t = Integer.parseInt(strs[2]);\n\t\t\n\t\tSystem.out.println((int)(Math.ceil((double)n/x)*t) );\n\t\t\n\t}\n}",
"import java.io.BufferedReader;",
"BufferedReader",
"java.io",
"import java.io.InputStreamReader;",
"InputStreamReader",
"java.io",
"public class Main{\n\tpublic static void main(String[] args)throws Exception{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] strs = br.readLine().split(\" \");\n\t\t\n\t\tint n = Integer.parseInt(strs[0]);\n\t\tint x = Integer.parseInt(strs[1]);\n\t\tint t = Integer.parseInt(strs[2]);\n\t\t\n\t\tSystem.out.println((int)(Math.ceil((double)n/x)*t) );\n\t\t\n\t}\n}",
"Main",
"public static void main(String[] args)throws Exception{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] strs = br.readLine().split(\" \");\n\t\t\n\t\tint n = Integer.parseInt(strs[0]);\n\t\tint x = Integer.parseInt(strs[1]);\n\t\tint t = Integer.parseInt(strs[2]);\n\t\t\n\t\tSystem.out.println((int)(Math.ceil((double)n/x)*t) );\n\t\t\n\t}",
"main",
"{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] strs = br.readLine().split(\" \");\n\t\t\n\t\tint n = Integer.parseInt(strs[0]);\n\t\tint x = Integer.parseInt(strs[1]);\n\t\tint t = Integer.parseInt(strs[2]);\n\t\t\n\t\tSystem.out.println((int)(Math.ceil((double)n/x)*t) );\n\t\t\n\t}",
"BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"String[] strs = br.readLine().split(\" \");",
"strs",
"br.readLine().split(\" \")",
"br.readLine().split",
"br.readLine()",
"br.readLine",
"br",
"\" \"",
"int n = Integer.parseInt(strs[0]);",
"n",
"Integer.parseInt(strs[0])",
"Integer.parseInt",
"Integer",
"strs[0]",
"strs",
"0",
"int x = Integer.parseInt(strs[1]);",
"x",
"Integer.parseInt(strs[1])",
"Integer.parseInt",
"Integer",
"strs[1]",
"strs",
"1",
"int t = Integer.parseInt(strs[2]);",
"t",
"Integer.parseInt(strs[2])",
"Integer.parseInt",
"Integer",
"strs[2]",
"strs",
"2",
"System.out.println((int)(Math.ceil((double)n/x)*t) )",
"System.out.println",
"System.out",
"System",
"System.out",
"(int)(Math.ceil((double)n/x)*t)",
"Math.ceil((double)n/x)",
"Math.ceil",
"Math",
"(double)n/x",
"(double)n",
"x",
"t",
"String[] args",
"args",
"public class Main{\n\tpublic static void main(String[] args)throws Exception{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] strs = br.readLine().split(\" \");\n\t\t\n\t\tint n = Integer.parseInt(strs[0]);\n\t\tint x = Integer.parseInt(strs[1]);\n\t\tint t = Integer.parseInt(strs[2]);\n\t\t\n\t\tSystem.out.println((int)(Math.ceil((double)n/x)*t) );\n\t\t\n\t}\n}",
"public class Main{\n\tpublic static void main(String[] args)throws Exception{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] strs = br.readLine().split(\" \");\n\t\t\n\t\tint n = Integer.parseInt(strs[0]);\n\t\tint x = Integer.parseInt(strs[1]);\n\t\tint t = Integer.parseInt(strs[2]);\n\t\t\n\t\tSystem.out.println((int)(Math.ceil((double)n/x)*t) );\n\t\t\n\t}\n}",
"Main"
]
| 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));
String[] strs = br.readLine().split(" ");
int n = Integer.parseInt(strs[0]);
int x = Integer.parseInt(strs[1]);
int t = Integer.parseInt(strs[2]);
System.out.println((int)(Math.ceil((double)n/x)*t) );
}
}
|
[
7,
15,
13,
17,
15,
13,
17,
6,
13,
41,
13,
20,
41,
13,
17,
41,
13,
20,
41,
13,
20,
41,
13,
41,
13,
39,
17,
40,
17,
17,
17,
41,
13,
39,
17,
17,
40,
17,
17,
12,
13,
30,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
41,
13,
4,
18,
13,
2,
2,
13,
17,
13,
4,
18,
13,
2,
13,
13,
4,
18,
13,
23,
13,
12,
13,
30,
29,
2,
2,
13,
13,
13,
23,
13,
23,
13,
23,
13,
6,
13,
41,
13,
41,
13,
41,
13,
41,
13,
12,
13,
30,
0,
18,
36,
13,
13,
0,
18,
36,
13,
13,
23,
13,
23,
13,
6,
13,
41,
13,
41,
13,
12,
13,
30,
0,
13,
20,
12,
13,
30,
42,
2,
2,
13,
17,
40,
4,
18,
13,
30,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
20,
29,
4,
18,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
29,
4,
18,
13,
4,
13,
12,
13,
30,
41,
13,
17,
38,
5,
13,
30,
4,
18,
13,
30,
0,
13,
4,
18,
13,
29,
13,
10,
6,
13
]
| [
[
0,
1
],
[
1,
2
],
[
1,
3
],
[
0,
4
],
[
4,
5
],
[
4,
6
],
[
0,
7
],
[
209,
8
],
[
209,
9
],
[
9,
10
],
[
9,
11
],
[
209,
12
],
[
12,
13
],
[
12,
14
],
[
209,
15
],
[
15,
16
],
[
15,
17
],
[
209,
18
],
[
18,
19
],
[
18,
20
],
[
209,
21
],
[
21,
22
],
[
209,
23
],
[
23,
24
],
[
23,
25
],
[
25,
26
],
[
25,
27
],
[
27,
28
],
[
25,
29
],
[
25,
30
],
[
209,
31
],
[
31,
32
],
[
31,
33
],
[
33,
34
],
[
33,
35
],
[
33,
36
],
[
36,
37
],
[
33,
38
],
[
209,
39
],
[
39,
40
],
[
39,
41
],
[
41,
42
],
[
42,
43
],
[
42,
44
],
[
44,
45
],
[
45,
46
],
[
41,
47
],
[
47,
48
],
[
47,
49
],
[
49,
50
],
[
50,
51
],
[
41,
52
],
[
52,
53
],
[
52,
54
],
[
54,
55
],
[
55,
56
],
[
41,
57
],
[
57,
58
],
[
57,
59
],
[
59,
60
],
[
60,
61
],
[
59,
62
],
[
62,
63
],
[
63,
64
],
[
63,
65
],
[
62,
66
],
[
41,
67
],
[
67,
68
],
[
68,
69
],
[
67,
70
],
[
70,
71
],
[
70,
72
],
[
41,
73
],
[
73,
74
],
[
74,
75
],
[
39,
76
],
[
76,
77
],
[
209,
78
],
[
78,
79
],
[
78,
80
],
[
80,
81
],
[
81,
82
],
[
82,
83
],
[
83,
84
],
[
83,
85
],
[
82,
86
],
[
78,
87
],
[
87,
88
],
[
78,
89
],
[
89,
90
],
[
78,
91
],
[
91,
92
],
[
209,
93
],
[
93,
94
],
[
93,
95
],
[
95,
96
],
[
93,
97
],
[
97,
98
],
[
93,
99
],
[
99,
100
],
[
93,
101
],
[
101,
102
],
[
93,
103
],
[
103,
104
],
[
103,
105
],
[
105,
106
],
[
106,
107
],
[
107,
108
],
[
107,
109
],
[
106,
110
],
[
105,
111
],
[
111,
112
],
[
112,
113
],
[
112,
114
],
[
111,
115
],
[
103,
116
],
[
116,
117
],
[
103,
118
],
[
118,
119
],
[
209,
120
],
[
120,
121
],
[
120,
122
],
[
122,
123
],
[
120,
124
],
[
124,
125
],
[
120,
126
],
[
126,
127
],
[
126,
128
],
[
128,
129
],
[
129,
130
],
[
129,
131
],
[
120,
132
],
[
132,
133
],
[
132,
134
],
[
134,
135
],
[
135,
136
],
[
136,
137
],
[
137,
138
],
[
137,
139
],
[
136,
140
],
[
140,
141
],
[
141,
142
],
[
142,
143
],
[
135,
144
],
[
144,
145
],
[
145,
146
],
[
146,
147
],
[
146,
148
],
[
148,
149
],
[
149,
150
],
[
150,
151
],
[
145,
152
],
[
152,
153
],
[
153,
154
],
[
153,
155
],
[
134,
156
],
[
156,
157
],
[
157,
158
],
[
158,
159
],
[
120,
160
],
[
160,
161
],
[
160,
162
],
[
162,
163
],
[
163,
164
],
[
164,
165
],
[
165,
166
],
[
164,
167
],
[
167,
168
],
[
120,
169
],
[
169,
170
],
[
169,
171
],
[
171,
172
],
[
172,
173
],
[
173,
174
],
[
174,
175
],
[
173,
176
],
[
176,
177
],
[
120,
178
],
[
178,
179
],
[
178,
180
],
[
180,
181
],
[
181,
182
],
[
182,
183
],
[
183,
184
],
[
182,
185
],
[
185,
186
],
[
120,
187
],
[
187,
188
],
[
187,
189
],
[
189,
190
],
[
190,
191
],
[
190,
192
],
[
189,
193
],
[
193,
194
],
[
194,
195
],
[
194,
196
],
[
196,
197
],
[
197,
198
],
[
198,
199
],
[
193,
200
],
[
200,
201
],
[
201,
202
],
[
201,
203
],
[
203,
204
],
[
204,
205
],
[
189,
206
],
[
206,
207
],
[
0,
208
],
[
208,
209
],
[
208,
210
]
]
| [
"import java.util.*;\n\n\nimport java.io.*;\n/**\n * MLASERP\n */\npublic class Main {\n\n \n static MyScanner in = new MyScanner();\n static int mod = 1000000007;\n static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));\n static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n static StringTokenizer st;\n static int []dr = {1,-1,0,0};\n static int [] dc = {0,0,-1,1};\npublic static void main(String[] args) {\n int N = in.nextInt();\n int X = in.nextInt();\n int T = in.nextInt();\n int time = (int)Math.ceil((N*1.0)/X);\n out.println(time*T);\n out.flush();\n \n\n}\nstatic int rcToxy(int r, int c,int W){\n return r*W+c;\n}\nstatic class Node{\n int r, c,prev,change;\n Node(int r, int c){\n this.r =r ;\n this.c = c;\n }\n}\npublic static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n \n public MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n \n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n int nextInt() {\n return Integer.parseInt(next());\n }\n \n long nextLong() {\n return Long.parseLong(next());\n }\n \n double nextDouble() {\n return Double.parseDouble(next());\n }\n \n String nextLine(){\n String str = \"\";\n\t try {\n\t str = br.readLine();\n\t } catch (IOException e) {\n\t e.printStackTrace();\n\t }\n\t return str;\n }\n\n }\n}",
"import java.util.*;",
"util.*",
"java",
"import java.io.*;",
"io.*",
"java",
"public class Main {\n\n \n static MyScanner in = new MyScanner();\n static int mod = 1000000007;\n static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));\n static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n static StringTokenizer st;\n static int []dr = {1,-1,0,0};\n static int [] dc = {0,0,-1,1};\npublic static void main(String[] args) {\n int N = in.nextInt();\n int X = in.nextInt();\n int T = in.nextInt();\n int time = (int)Math.ceil((N*1.0)/X);\n out.println(time*T);\n out.flush();\n \n\n}\nstatic int rcToxy(int r, int c,int W){\n return r*W+c;\n}\nstatic class Node{\n int r, c,prev,change;\n Node(int r, int c){\n this.r =r ;\n this.c = c;\n }\n}\npublic static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n \n public MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n \n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n int nextInt() {\n return Integer.parseInt(next());\n }\n \n long nextLong() {\n return Long.parseLong(next());\n }\n \n double nextDouble() {\n return Double.parseDouble(next());\n }\n \n String nextLine(){\n String str = \"\";\n\t try {\n\t str = br.readLine();\n\t } catch (IOException e) {\n\t e.printStackTrace();\n\t }\n\t return str;\n }\n\n }\n}",
"Main",
"static MyScanner in = new MyScanner();",
"in",
"new MyScanner()",
"static int mod = 1000000007;",
"mod",
"1000000007",
"static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));",
"out",
"new PrintWriter(new OutputStreamWriter(System.out))",
"static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"static StringTokenizer st;",
"st",
"static int []dr = {1,-1,0,0};",
"dr",
"{1,-1,0,0}",
"1",
"-1",
"1",
"0",
"0",
"static int [] dc = {0,0,-1,1};",
"dc",
"{0,0,-1,1}",
"0",
"0",
"-1",
"1",
"1",
"public static void main(String[] args) {\n int N = in.nextInt();\n int X = in.nextInt();\n int T = in.nextInt();\n int time = (int)Math.ceil((N*1.0)/X);\n out.println(time*T);\n out.flush();\n \n\n}",
"main",
"{\n int N = in.nextInt();\n int X = in.nextInt();\n int T = in.nextInt();\n int time = (int)Math.ceil((N*1.0)/X);\n out.println(time*T);\n out.flush();\n \n\n}",
"int N = in.nextInt();",
"N",
"in.nextInt()",
"in.nextInt",
"in",
"int X = in.nextInt();",
"X",
"in.nextInt()",
"in.nextInt",
"in",
"int T = in.nextInt();",
"T",
"in.nextInt()",
"in.nextInt",
"in",
"int time = (int)Math.ceil((N*1.0)/X);",
"time",
"(int)Math.ceil((N*1.0)/X)",
"Math.ceil",
"Math",
"(N*1.0)/X",
"(N*1.0)",
"N",
"1.0",
"X",
"out.println(time*T)",
"out.println",
"out",
"time*T",
"time",
"T",
"out.flush()",
"out.flush",
"out",
"String[] args",
"args",
"static int rcToxy(int r, int c,int W){\n return r*W+c;\n}",
"rcToxy",
"{\n return r*W+c;\n}",
"return r*W+c;",
"r*W+c",
"r*W",
"r",
"W",
"c",
"int r",
"r",
"int c",
"c",
"int W",
"W",
"static class Node{\n int r, c,prev,change;\n Node(int r, int c){\n this.r =r ;\n this.c = c;\n }\n}",
"Node",
"int r",
"r",
"c",
"c",
"prev",
"prev",
"change;",
"change",
"Node(int r, int c){\n this.r =r ;\n this.c = c;\n }",
"Node",
"{\n this.r =r ;\n this.c = c;\n }",
"this.r =r",
"this.r",
"this",
"this.r",
"r",
"this.c = c",
"this.c",
"this",
"this.c",
"c",
"int r",
"r",
"int c",
"c",
"public static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n \n public MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n \n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n int nextInt() {\n return Integer.parseInt(next());\n }\n \n long nextLong() {\n return Long.parseLong(next());\n }\n \n double nextDouble() {\n return Double.parseDouble(next());\n }\n \n String nextLine(){\n String str = \"\";\n\t try {\n\t str = br.readLine();\n\t } catch (IOException e) {\n\t e.printStackTrace();\n\t }\n\t return str;\n }\n\n }",
"MyScanner",
"BufferedReader br;",
"br",
"StringTokenizer st;",
"st",
"public MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }",
"MyScanner",
"{\n br = new BufferedReader(new InputStreamReader(System.in));\n }",
"br = new BufferedReader(new InputStreamReader(System.in))",
"br",
"new BufferedReader(new InputStreamReader(System.in))",
"String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }",
"next",
"{\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }",
"while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }",
"st == null || !st.hasMoreElements()",
"st == null",
"st",
"null",
"!st.hasMoreElements()",
"st.hasMoreElements()",
"st.hasMoreElements",
"st",
"{\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }",
"try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }",
"catch (IOException e) {\n e.printStackTrace();\n }",
"IOException e",
"{\n e.printStackTrace();\n }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n st = new StringTokenizer(br.readLine());\n }",
"st = new StringTokenizer(br.readLine())",
"st",
"new StringTokenizer(br.readLine())",
"return st.nextToken();",
"st.nextToken()",
"st.nextToken",
"st",
"int nextInt() {\n return Integer.parseInt(next());\n }",
"nextInt",
"{\n return Integer.parseInt(next());\n }",
"return Integer.parseInt(next());",
"Integer.parseInt(next())",
"Integer.parseInt",
"Integer",
"next()",
"next",
"long nextLong() {\n return Long.parseLong(next());\n }",
"nextLong",
"{\n return Long.parseLong(next());\n }",
"return Long.parseLong(next());",
"Long.parseLong(next())",
"Long.parseLong",
"Long",
"next()",
"next",
"double nextDouble() {\n return Double.parseDouble(next());\n }",
"nextDouble",
"{\n return Double.parseDouble(next());\n }",
"return Double.parseDouble(next());",
"Double.parseDouble(next())",
"Double.parseDouble",
"Double",
"next()",
"next",
"String nextLine(){\n String str = \"\";\n\t try {\n\t str = br.readLine();\n\t } catch (IOException e) {\n\t e.printStackTrace();\n\t }\n\t return str;\n }",
"nextLine",
"{\n String str = \"\";\n\t try {\n\t str = br.readLine();\n\t } catch (IOException e) {\n\t e.printStackTrace();\n\t }\n\t return str;\n }",
"String str = \"\";",
"str",
"\"\"",
"try {\n\t str = br.readLine();\n\t } catch (IOException e) {\n\t e.printStackTrace();\n\t }",
"catch (IOException e) {\n\t e.printStackTrace();\n\t }",
"IOException e",
"{\n\t e.printStackTrace();\n\t }",
"e.printStackTrace()",
"e.printStackTrace",
"e",
"{\n\t str = br.readLine();\n\t }",
"str = br.readLine()",
"str",
"br.readLine()",
"br.readLine",
"br",
"return str;",
"str",
"public class Main {\n\n \n static MyScanner in = new MyScanner();\n static int mod = 1000000007;\n static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));\n static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n static StringTokenizer st;\n static int []dr = {1,-1,0,0};\n static int [] dc = {0,0,-1,1};\npublic static void main(String[] args) {\n int N = in.nextInt();\n int X = in.nextInt();\n int T = in.nextInt();\n int time = (int)Math.ceil((N*1.0)/X);\n out.println(time*T);\n out.flush();\n \n\n}\nstatic int rcToxy(int r, int c,int W){\n return r*W+c;\n}\nstatic class Node{\n int r, c,prev,change;\n Node(int r, int c){\n this.r =r ;\n this.c = c;\n }\n}\npublic static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n \n public MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n \n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n int nextInt() {\n return Integer.parseInt(next());\n }\n \n long nextLong() {\n return Long.parseLong(next());\n }\n \n double nextDouble() {\n return Double.parseDouble(next());\n }\n \n String nextLine(){\n String str = \"\";\n\t try {\n\t str = br.readLine();\n\t } catch (IOException e) {\n\t e.printStackTrace();\n\t }\n\t return str;\n }\n\n }\n}",
"public class Main {\n\n \n static MyScanner in = new MyScanner();\n static int mod = 1000000007;\n static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));\n static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n static StringTokenizer st;\n static int []dr = {1,-1,0,0};\n static int [] dc = {0,0,-1,1};\npublic static void main(String[] args) {\n int N = in.nextInt();\n int X = in.nextInt();\n int T = in.nextInt();\n int time = (int)Math.ceil((N*1.0)/X);\n out.println(time*T);\n out.flush();\n \n\n}\nstatic int rcToxy(int r, int c,int W){\n return r*W+c;\n}\nstatic class Node{\n int r, c,prev,change;\n Node(int r, int c){\n this.r =r ;\n this.c = c;\n }\n}\npublic static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n \n public MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n \n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n \n int nextInt() {\n return Integer.parseInt(next());\n }\n \n long nextLong() {\n return Long.parseLong(next());\n }\n \n double nextDouble() {\n return Double.parseDouble(next());\n }\n \n String nextLine(){\n String str = \"\";\n\t try {\n\t str = br.readLine();\n\t } catch (IOException e) {\n\t e.printStackTrace();\n\t }\n\t return str;\n }\n\n }\n}",
"Main"
]
| import java.util.*;
import java.io.*;
/**
* MLASERP
*/
public class Main {
static MyScanner in = new MyScanner();
static int mod = 1000000007;
static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static StringTokenizer st;
static int []dr = {1,-1,0,0};
static int [] dc = {0,0,-1,1};
public static void main(String[] args) {
int N = in.nextInt();
int X = in.nextInt();
int T = in.nextInt();
int time = (int)Math.ceil((N*1.0)/X);
out.println(time*T);
out.flush();
}
static int rcToxy(int r, int c,int W){
return r*W+c;
}
static class Node{
int r, c,prev,change;
Node(int r, int c){
this.r =r ;
this.c = c;
}
}
public static class MyScanner {
BufferedReader br;
StringTokenizer st;
public MyScanner() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine(){
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.