質問編集履歴
1
インデントの調整
test
CHANGED
File without changes
|
test
CHANGED
@@ -15,6 +15,8 @@
|
|
15
15
|
Nは問題数、q_iは正答、a_iは回答です。
|
16
16
|
|
17
17
|
ごちゃごちゃしていて申し訳ありません。
|
18
|
+
|
19
|
+
もしも見づらかったらご指摘お願いします。
|
18
20
|
|
19
21
|
|
20
22
|
|
@@ -60,66 +62,70 @@
|
|
60
62
|
|
61
63
|
int tigau = 0;
|
62
64
|
|
63
|
-
|
65
|
+
|
64
66
|
|
65
67
|
for(int i=1;i<=N;i++){
|
66
68
|
|
67
|
-
String q_i = sc.next();
|
69
|
+
String q_i = sc.next();
|
68
70
|
|
69
|
-
String a_i = sc.next();
|
71
|
+
String a_i = sc.next();
|
70
72
|
|
71
|
-
String[] Q = q_i.split("");
|
73
|
+
String[] Q = q_i.split("");
|
72
74
|
|
73
|
-
String[] A = a_i.split("");
|
75
|
+
String[] A = a_i.split("");
|
74
76
|
|
75
77
|
|
76
78
|
|
77
|
-
if(q_i.equals(a_i)){
|
79
|
+
if(q_i.equals(a_i)){
|
78
80
|
|
79
|
-
tensu=tensu+2;
|
80
81
|
|
81
|
-
System.out.println("tensu="+tensu);
|
82
82
|
|
83
|
-
|
83
|
+
tensu=tensu+2;
|
84
84
|
|
85
|
-
|
85
|
+
|
86
86
|
|
87
|
-
|
87
|
+
}else if(q_i.length() != a_i.length()){
|
88
88
|
|
89
|
-
}else if(q_i.length() == a_i.length()){
|
90
89
|
|
90
|
+
|
91
|
+
tensu=tensu+0;
|
92
|
+
|
93
|
+
|
94
|
+
|
95
|
+
}else if(q_i.length() == a_i.length()){
|
96
|
+
|
97
|
+
|
98
|
+
|
91
|
-
for(int j=0;j<Q.length;j++){
|
99
|
+
for(int j=0;j<Q.length;j++){
|
100
|
+
|
101
|
+
|
92
102
|
|
93
103
|
if(Q[j] == A[j]){
|
94
104
|
|
95
|
-
tigau = tigau+0;
|
96
105
|
|
97
|
-
}else{
|
98
106
|
|
99
|
-
tigau=tigau+
|
107
|
+
tigau = tigau+0;
|
100
108
|
|
101
|
-
}
|
102
109
|
|
110
|
+
|
111
|
+
}else{
|
112
|
+
|
113
|
+
tigau=tigau+1;
|
114
|
+
|
103
|
-
}
|
115
|
+
}
|
116
|
+
|
117
|
+
}//内側のfor文の終わり
|
104
118
|
|
105
119
|
|
106
120
|
|
107
|
-
}
|
121
|
+
}//else if(q_i.length() == a_i.length())の終わり
|
108
122
|
|
109
|
-
|
123
|
+
}//外側のfor文の終わり
|
110
124
|
|
111
|
-
|
112
|
-
|
113
|
-
}
|
125
|
+
}//メソッド
|
114
126
|
|
115
127
|
|
116
128
|
|
117
|
-
|
118
|
-
|
119
|
-
}
|
129
|
+
}//クラス
|
120
|
-
|
121
|
-
|
122
|
-
|
123
|
-
}
|
124
130
|
|
125
131
|
```
|