message
stringlengths 2
39.6k
| message_type
stringclasses 2
values | message_id
int64 0
1
| conversation_id
int64 219
108k
| cluster
float64 11
11
| __index_level_0__
int64 438
217k
|
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A team of three programmers is going to play a contest. The contest consists of n problems, numbered from 1 to n. Each problem is printed on a separate sheet of paper. The participants have decided to divide the problem statements into three parts: the first programmer took some prefix of the statements (some number of first paper sheets), the third contestant took some suffix of the statements (some number of last paper sheets), and the second contestant took all remaining problems. But something went wrong — the statements were printed in the wrong order, so the contestants have received the problems in some random order.
The first contestant has received problems a_{1, 1}, a_{1, 2}, ..., a_{1, k_1}. The second one has received problems a_{2, 1}, a_{2, 2}, ..., a_{2, k_2}. The third one has received all remaining problems (a_{3, 1}, a_{3, 2}, ..., a_{3, k_3}).
The contestants don't want to play the contest before they redistribute the statements. They want to redistribute them so that the first contestant receives some prefix of the problemset, the third contestant receives some suffix of the problemset, and the second contestant receives all the remaining problems.
During one move, some contestant may give one of their problems to other contestant. What is the minimum number of moves required to redistribute the problems?
It is possible that after redistribution some participant (or even two of them) will not have any problems.
Input
The first line contains three integers k_1, k_2 and k_3 (1 ≤ k_1, k_2, k_3 ≤ 2 ⋅ 10^5, k_1 + k_2 + k_3 ≤ 2 ⋅ 10^5) — the number of problems initially taken by the first, the second and the third participant, respectively.
The second line contains k_1 integers a_{1, 1}, a_{1, 2}, ..., a_{1, k_1} — the problems initially taken by the first participant.
The third line contains k_2 integers a_{2, 1}, a_{2, 2}, ..., a_{2, k_2} — the problems initially taken by the second participant.
The fourth line contains k_3 integers a_{3, 1}, a_{3, 2}, ..., a_{3, k_3} — the problems initially taken by the third participant.
It is guaranteed that no problem has been taken by two (or three) participants, and each integer a_{i, j} meets the condition 1 ≤ a_{i, j} ≤ n, where n = k_1 + k_2 + k_3.
Output
Print one integer — the minimum number of moves required to redistribute the problems so that the first participant gets the prefix of the problemset, the third participant gets the suffix of the problemset, and the second participant gets all of the remaining problems.
Examples
Input
2 1 2
3 1
4
2 5
Output
1
Input
3 2 1
3 2 1
5 4
6
Output
0
Input
2 1 3
5 6
4
1 2 3
Output
3
Input
1 5 1
6
5 1 2 4 7
3
Output
2
Note
In the first example the third contestant should give the problem 2 to the first contestant, so the first contestant has 3 first problems, the third contestant has 1 last problem, and the second contestant has 1 remaining problem.
In the second example the distribution of problems is already valid: the first contestant has 3 first problems, the third contestant has 1 last problem, and the second contestant has 2 remaining problems.
The best course of action in the third example is to give all problems to the third contestant.
The best course of action in the fourth example is to give all problems to the second contestant.
Submitted Solution:
```
a = input()
a = a.split()
for i in range(3):
a[i] = int(a[i])
total = sum(a)
content = []
for i in range(3):
b = input()
b = b.split()
content.append(b)
for i in range(3):
for j in range(len(content[i])):
content[i][j] = int(content[i][j])
content[i].sort()
#print (content)
dp = []
if min(content[0]) > max(content[2]):
print (total-len(content[1]))
else:
for i in range(total):
for j in range(total):
if i<j and (i+1) in content[0] and (j+1) in content[2]: #problem i given to first, j given to second
changes = 0
for k in range(1, i+2):
if k not in content[0]:
changes += 1
for k in range(j+1, total):
if k not in content[2]:
changes += 1
for k in range(i+2, j+1):
if k not in content[1]:
changes += 1
dp.append([(i+1,j+1), changes])
min = 9999999999
for i in dp:
if i[1] < min:
min = i[1]
print (min)
```
|
instruction
| 0
| 3,460
| 11
| 6,920
|
No
|
output
| 1
| 3,460
| 11
| 6,921
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Berland Armed Forces System consists of n ranks that are numbered using natural numbers from 1 to n, where 1 is the lowest rank and n is the highest rank.
One needs exactly di years to rise from rank i to rank i + 1. Reaching a certain rank i having not reached all the previous i - 1 ranks is impossible.
Vasya has just reached a new rank of a, but he dreams of holding the rank of b. Find for how many more years Vasya should serve in the army until he can finally realize his dream.
Input
The first input line contains an integer n (2 ≤ n ≤ 100). The second line contains n - 1 integers di (1 ≤ di ≤ 100). The third input line contains two integers a and b (1 ≤ a < b ≤ n). The numbers on the lines are space-separated.
Output
Print the single number which is the number of years that Vasya needs to rise from rank a to rank b.
Examples
Input
3
5 6
1 2
Output
5
Input
3
5 6
1 3
Output
11
Submitted Solution:
```
n = input()
d = list(map(int, input().split()))
a, b = list(map(int, input().split()))
d = [0, 0] + d
print(sum(d[a+1:b + 1]))
```
|
instruction
| 0
| 3,722
| 11
| 7,444
|
Yes
|
output
| 1
| 3,722
| 11
| 7,445
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Berland Armed Forces System consists of n ranks that are numbered using natural numbers from 1 to n, where 1 is the lowest rank and n is the highest rank.
One needs exactly di years to rise from rank i to rank i + 1. Reaching a certain rank i having not reached all the previous i - 1 ranks is impossible.
Vasya has just reached a new rank of a, but he dreams of holding the rank of b. Find for how many more years Vasya should serve in the army until he can finally realize his dream.
Input
The first input line contains an integer n (2 ≤ n ≤ 100). The second line contains n - 1 integers di (1 ≤ di ≤ 100). The third input line contains two integers a and b (1 ≤ a < b ≤ n). The numbers on the lines are space-separated.
Output
Print the single number which is the number of years that Vasya needs to rise from rank a to rank b.
Examples
Input
3
5 6
1 2
Output
5
Input
3
5 6
1 3
Output
11
Submitted Solution:
```
x=int(input())
y=list(map(int,input().split()))
z=list(map(int,input().split()))
f=0
for i in range(z[0],z[1]):f+=y[i-1]
print(f)
```
|
instruction
| 0
| 3,723
| 11
| 7,446
|
Yes
|
output
| 1
| 3,723
| 11
| 7,447
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Berland Armed Forces System consists of n ranks that are numbered using natural numbers from 1 to n, where 1 is the lowest rank and n is the highest rank.
One needs exactly di years to rise from rank i to rank i + 1. Reaching a certain rank i having not reached all the previous i - 1 ranks is impossible.
Vasya has just reached a new rank of a, but he dreams of holding the rank of b. Find for how many more years Vasya should serve in the army until he can finally realize his dream.
Input
The first input line contains an integer n (2 ≤ n ≤ 100). The second line contains n - 1 integers di (1 ≤ di ≤ 100). The third input line contains two integers a and b (1 ≤ a < b ≤ n). The numbers on the lines are space-separated.
Output
Print the single number which is the number of years that Vasya needs to rise from rank a to rank b.
Examples
Input
3
5 6
1 2
Output
5
Input
3
5 6
1 3
Output
11
Submitted Solution:
```
n = int(input())
l = list(map(int,input().split()))
a, b= map(int,input().split())
sum=0
for i in range(a,b):
sum+=l[i-1]
print(sum)
```
|
instruction
| 0
| 3,724
| 11
| 7,448
|
Yes
|
output
| 1
| 3,724
| 11
| 7,449
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Berland Armed Forces System consists of n ranks that are numbered using natural numbers from 1 to n, where 1 is the lowest rank and n is the highest rank.
One needs exactly di years to rise from rank i to rank i + 1. Reaching a certain rank i having not reached all the previous i - 1 ranks is impossible.
Vasya has just reached a new rank of a, but he dreams of holding the rank of b. Find for how many more years Vasya should serve in the army until he can finally realize his dream.
Input
The first input line contains an integer n (2 ≤ n ≤ 100). The second line contains n - 1 integers di (1 ≤ di ≤ 100). The third input line contains two integers a and b (1 ≤ a < b ≤ n). The numbers on the lines are space-separated.
Output
Print the single number which is the number of years that Vasya needs to rise from rank a to rank b.
Examples
Input
3
5 6
1 2
Output
5
Input
3
5 6
1 3
Output
11
Submitted Solution:
```
input()
years = list(map(int, input().split()))
a, b = map(int, input().split())
print(sum(years[a-1:b-1]))
```
|
instruction
| 0
| 3,725
| 11
| 7,450
|
Yes
|
output
| 1
| 3,725
| 11
| 7,451
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Berland Armed Forces System consists of n ranks that are numbered using natural numbers from 1 to n, where 1 is the lowest rank and n is the highest rank.
One needs exactly di years to rise from rank i to rank i + 1. Reaching a certain rank i having not reached all the previous i - 1 ranks is impossible.
Vasya has just reached a new rank of a, but he dreams of holding the rank of b. Find for how many more years Vasya should serve in the army until he can finally realize his dream.
Input
The first input line contains an integer n (2 ≤ n ≤ 100). The second line contains n - 1 integers di (1 ≤ di ≤ 100). The third input line contains two integers a and b (1 ≤ a < b ≤ n). The numbers on the lines are space-separated.
Output
Print the single number which is the number of years that Vasya needs to rise from rank a to rank b.
Examples
Input
3
5 6
1 2
Output
5
Input
3
5 6
1 3
Output
11
Submitted Solution:
```
n=input()
x=list(map(int,input().split()))
a,b=map(int,input().split())
print(sum(x[a-1:b-a:1]))
```
|
instruction
| 0
| 3,726
| 11
| 7,452
|
No
|
output
| 1
| 3,726
| 11
| 7,453
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Berland Armed Forces System consists of n ranks that are numbered using natural numbers from 1 to n, where 1 is the lowest rank and n is the highest rank.
One needs exactly di years to rise from rank i to rank i + 1. Reaching a certain rank i having not reached all the previous i - 1 ranks is impossible.
Vasya has just reached a new rank of a, but he dreams of holding the rank of b. Find for how many more years Vasya should serve in the army until he can finally realize his dream.
Input
The first input line contains an integer n (2 ≤ n ≤ 100). The second line contains n - 1 integers di (1 ≤ di ≤ 100). The third input line contains two integers a and b (1 ≤ a < b ≤ n). The numbers on the lines are space-separated.
Output
Print the single number which is the number of years that Vasya needs to rise from rank a to rank b.
Examples
Input
3
5 6
1 2
Output
5
Input
3
5 6
1 3
Output
11
Submitted Solution:
```
n = int(input())
Years=list(map(int, input().split(' ')))
a,b=list(map(int, input().split(' ')))
R = b-a
s=0
for i in range(a-1,R):
s+=Years[i]
print(s)
```
|
instruction
| 0
| 3,727
| 11
| 7,454
|
No
|
output
| 1
| 3,727
| 11
| 7,455
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Berland Armed Forces System consists of n ranks that are numbered using natural numbers from 1 to n, where 1 is the lowest rank and n is the highest rank.
One needs exactly di years to rise from rank i to rank i + 1. Reaching a certain rank i having not reached all the previous i - 1 ranks is impossible.
Vasya has just reached a new rank of a, but he dreams of holding the rank of b. Find for how many more years Vasya should serve in the army until he can finally realize his dream.
Input
The first input line contains an integer n (2 ≤ n ≤ 100). The second line contains n - 1 integers di (1 ≤ di ≤ 100). The third input line contains two integers a and b (1 ≤ a < b ≤ n). The numbers on the lines are space-separated.
Output
Print the single number which is the number of years that Vasya needs to rise from rank a to rank b.
Examples
Input
3
5 6
1 2
Output
5
Input
3
5 6
1 3
Output
11
Submitted Solution:
```
n = int(input())
l = list(map(int,input().split()))
a,b = map(int,input().split())
y = b-a
sum1 = 0
for i in range(y):
sum1 = sum1 + l[i]
print(sum1)
```
|
instruction
| 0
| 3,728
| 11
| 7,456
|
No
|
output
| 1
| 3,728
| 11
| 7,457
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Berland Armed Forces System consists of n ranks that are numbered using natural numbers from 1 to n, where 1 is the lowest rank and n is the highest rank.
One needs exactly di years to rise from rank i to rank i + 1. Reaching a certain rank i having not reached all the previous i - 1 ranks is impossible.
Vasya has just reached a new rank of a, but he dreams of holding the rank of b. Find for how many more years Vasya should serve in the army until he can finally realize his dream.
Input
The first input line contains an integer n (2 ≤ n ≤ 100). The second line contains n - 1 integers di (1 ≤ di ≤ 100). The third input line contains two integers a and b (1 ≤ a < b ≤ n). The numbers on the lines are space-separated.
Output
Print the single number which is the number of years that Vasya needs to rise from rank a to rank b.
Examples
Input
3
5 6
1 2
Output
5
Input
3
5 6
1 3
Output
11
Submitted Solution:
```
n=int(input())
d=list(map(int,input().split()))
a,b=map(int,input().split())
print(sum(d[:b-1]))
```
|
instruction
| 0
| 3,729
| 11
| 7,458
|
No
|
output
| 1
| 3,729
| 11
| 7,459
|
Provide a correct Python 3 solution for this coding contest problem.
Joisino is about to compete in the final round of a certain programming competition. In this contest, there are N problems, numbered 1 through N. Joisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).
Also, there are M kinds of drinks offered to the contestants, numbered 1 through M. If Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds. It does not affect the time to solve the other problems.
A contestant is allowed to take exactly one of the drinks before the start of the contest. For each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink. Here, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems. Your task is to write a program to calculate it instead of her.
Constraints
* All input values are integers.
* 1≦N≦100
* 1≦T_i≦10^5
* 1≦M≦100
* 1≦P_i≦N
* 1≦X_i≦10^5
Input
The input is given from Standard Input in the following format:
N
T_1 T_2 ... T_N
M
P_1 X_1
P_2 X_2
:
P_M X_M
Output
For each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.
Examples
Input
3
2 1 4
2
1 1
2 3
Output
6
9
Input
5
7 2 3 8 5
3
4 2
1 7
4 13
Output
19
25
30
|
instruction
| 0
| 4,060
| 11
| 8,120
|
"Correct Solution:
```
N = int(input())
T = list(map(int, input().split()))
M = int(input())
S = sum(T)
for _ in range(M):
P, X = map(int, input().split())
print(S-T[P-1]+X)
```
|
output
| 1
| 4,060
| 11
| 8,121
|
Provide a correct Python 3 solution for this coding contest problem.
Joisino is about to compete in the final round of a certain programming competition. In this contest, there are N problems, numbered 1 through N. Joisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).
Also, there are M kinds of drinks offered to the contestants, numbered 1 through M. If Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds. It does not affect the time to solve the other problems.
A contestant is allowed to take exactly one of the drinks before the start of the contest. For each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink. Here, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems. Your task is to write a program to calculate it instead of her.
Constraints
* All input values are integers.
* 1≦N≦100
* 1≦T_i≦10^5
* 1≦M≦100
* 1≦P_i≦N
* 1≦X_i≦10^5
Input
The input is given from Standard Input in the following format:
N
T_1 T_2 ... T_N
M
P_1 X_1
P_2 X_2
:
P_M X_M
Output
For each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.
Examples
Input
3
2 1 4
2
1 1
2 3
Output
6
9
Input
5
7 2 3 8 5
3
4 2
1 7
4 13
Output
19
25
30
|
instruction
| 0
| 4,061
| 11
| 8,122
|
"Correct Solution:
```
N = int(input())
T = list(map(int, input().split()))
M = int(input())
for i in range(M):
P, X = map(int, input().split())
print(sum(T) - T[P-1] + X)
```
|
output
| 1
| 4,061
| 11
| 8,123
|
Provide a correct Python 3 solution for this coding contest problem.
Joisino is about to compete in the final round of a certain programming competition. In this contest, there are N problems, numbered 1 through N. Joisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).
Also, there are M kinds of drinks offered to the contestants, numbered 1 through M. If Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds. It does not affect the time to solve the other problems.
A contestant is allowed to take exactly one of the drinks before the start of the contest. For each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink. Here, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems. Your task is to write a program to calculate it instead of her.
Constraints
* All input values are integers.
* 1≦N≦100
* 1≦T_i≦10^5
* 1≦M≦100
* 1≦P_i≦N
* 1≦X_i≦10^5
Input
The input is given from Standard Input in the following format:
N
T_1 T_2 ... T_N
M
P_1 X_1
P_2 X_2
:
P_M X_M
Output
For each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.
Examples
Input
3
2 1 4
2
1 1
2 3
Output
6
9
Input
5
7 2 3 8 5
3
4 2
1 7
4 13
Output
19
25
30
|
instruction
| 0
| 4,062
| 11
| 8,124
|
"Correct Solution:
```
n=int(input())
t=list(map(int,input().split()))
a=sum(t)
for i in range(int(input())):
p,x=map(int,input().split())
print(a+x-t[p-1])
```
|
output
| 1
| 4,062
| 11
| 8,125
|
Provide a correct Python 3 solution for this coding contest problem.
Joisino is about to compete in the final round of a certain programming competition. In this contest, there are N problems, numbered 1 through N. Joisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).
Also, there are M kinds of drinks offered to the contestants, numbered 1 through M. If Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds. It does not affect the time to solve the other problems.
A contestant is allowed to take exactly one of the drinks before the start of the contest. For each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink. Here, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems. Your task is to write a program to calculate it instead of her.
Constraints
* All input values are integers.
* 1≦N≦100
* 1≦T_i≦10^5
* 1≦M≦100
* 1≦P_i≦N
* 1≦X_i≦10^5
Input
The input is given from Standard Input in the following format:
N
T_1 T_2 ... T_N
M
P_1 X_1
P_2 X_2
:
P_M X_M
Output
For each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.
Examples
Input
3
2 1 4
2
1 1
2 3
Output
6
9
Input
5
7 2 3 8 5
3
4 2
1 7
4 13
Output
19
25
30
|
instruction
| 0
| 4,063
| 11
| 8,126
|
"Correct Solution:
```
n=int(input())
t=list(map(int,input().split()))
m=int(input())
for i in range(m):
p,x=map(int,input().split())
print(sum(t)-(t[p-1]-x))
```
|
output
| 1
| 4,063
| 11
| 8,127
|
Provide a correct Python 3 solution for this coding contest problem.
Joisino is about to compete in the final round of a certain programming competition. In this contest, there are N problems, numbered 1 through N. Joisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).
Also, there are M kinds of drinks offered to the contestants, numbered 1 through M. If Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds. It does not affect the time to solve the other problems.
A contestant is allowed to take exactly one of the drinks before the start of the contest. For each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink. Here, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems. Your task is to write a program to calculate it instead of her.
Constraints
* All input values are integers.
* 1≦N≦100
* 1≦T_i≦10^5
* 1≦M≦100
* 1≦P_i≦N
* 1≦X_i≦10^5
Input
The input is given from Standard Input in the following format:
N
T_1 T_2 ... T_N
M
P_1 X_1
P_2 X_2
:
P_M X_M
Output
For each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.
Examples
Input
3
2 1 4
2
1 1
2 3
Output
6
9
Input
5
7 2 3 8 5
3
4 2
1 7
4 13
Output
19
25
30
|
instruction
| 0
| 4,064
| 11
| 8,128
|
"Correct Solution:
```
n=int(input())
t=list(map(int,input().split()))
m=int(input())
for i in range(m):
p,x=map(int,input().split())
ans=sum(t)-t[p-1]+x
print(ans)
```
|
output
| 1
| 4,064
| 11
| 8,129
|
Provide a correct Python 3 solution for this coding contest problem.
Joisino is about to compete in the final round of a certain programming competition. In this contest, there are N problems, numbered 1 through N. Joisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).
Also, there are M kinds of drinks offered to the contestants, numbered 1 through M. If Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds. It does not affect the time to solve the other problems.
A contestant is allowed to take exactly one of the drinks before the start of the contest. For each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink. Here, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems. Your task is to write a program to calculate it instead of her.
Constraints
* All input values are integers.
* 1≦N≦100
* 1≦T_i≦10^5
* 1≦M≦100
* 1≦P_i≦N
* 1≦X_i≦10^5
Input
The input is given from Standard Input in the following format:
N
T_1 T_2 ... T_N
M
P_1 X_1
P_2 X_2
:
P_M X_M
Output
For each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.
Examples
Input
3
2 1 4
2
1 1
2 3
Output
6
9
Input
5
7 2 3 8 5
3
4 2
1 7
4 13
Output
19
25
30
|
instruction
| 0
| 4,065
| 11
| 8,130
|
"Correct Solution:
```
n = int(input())
t = [int(i) for i in input().split()]
m = int(input())
for mi in range(m):
p, x = [int(i) for i in input().split()]
print(sum(t)-t[p-1]+x)
```
|
output
| 1
| 4,065
| 11
| 8,131
|
Provide a correct Python 3 solution for this coding contest problem.
Joisino is about to compete in the final round of a certain programming competition. In this contest, there are N problems, numbered 1 through N. Joisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).
Also, there are M kinds of drinks offered to the contestants, numbered 1 through M. If Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds. It does not affect the time to solve the other problems.
A contestant is allowed to take exactly one of the drinks before the start of the contest. For each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink. Here, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems. Your task is to write a program to calculate it instead of her.
Constraints
* All input values are integers.
* 1≦N≦100
* 1≦T_i≦10^5
* 1≦M≦100
* 1≦P_i≦N
* 1≦X_i≦10^5
Input
The input is given from Standard Input in the following format:
N
T_1 T_2 ... T_N
M
P_1 X_1
P_2 X_2
:
P_M X_M
Output
For each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.
Examples
Input
3
2 1 4
2
1 1
2 3
Output
6
9
Input
5
7 2 3 8 5
3
4 2
1 7
4 13
Output
19
25
30
|
instruction
| 0
| 4,066
| 11
| 8,132
|
"Correct Solution:
```
x=int(input())
y=list(map(int, input().split()))
z=int(input())
for i in range(z):
a,b=list(map(int, input().split()))
print(sum(y)-y[a-1]+b)
```
|
output
| 1
| 4,066
| 11
| 8,133
|
Provide a correct Python 3 solution for this coding contest problem.
Joisino is about to compete in the final round of a certain programming competition. In this contest, there are N problems, numbered 1 through N. Joisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).
Also, there are M kinds of drinks offered to the contestants, numbered 1 through M. If Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds. It does not affect the time to solve the other problems.
A contestant is allowed to take exactly one of the drinks before the start of the contest. For each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink. Here, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems. Your task is to write a program to calculate it instead of her.
Constraints
* All input values are integers.
* 1≦N≦100
* 1≦T_i≦10^5
* 1≦M≦100
* 1≦P_i≦N
* 1≦X_i≦10^5
Input
The input is given from Standard Input in the following format:
N
T_1 T_2 ... T_N
M
P_1 X_1
P_2 X_2
:
P_M X_M
Output
For each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.
Examples
Input
3
2 1 4
2
1 1
2 3
Output
6
9
Input
5
7 2 3 8 5
3
4 2
1 7
4 13
Output
19
25
30
|
instruction
| 0
| 4,067
| 11
| 8,134
|
"Correct Solution:
```
N=int(input())
T=list(map(int,input().split()))
M=int(input())
for i in range(M):
P,X=map(int,input().split())
print(sum(T[:P-1])+X+sum(T[P:]),end="\n")
```
|
output
| 1
| 4,067
| 11
| 8,135
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino is about to compete in the final round of a certain programming competition. In this contest, there are N problems, numbered 1 through N. Joisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).
Also, there are M kinds of drinks offered to the contestants, numbered 1 through M. If Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds. It does not affect the time to solve the other problems.
A contestant is allowed to take exactly one of the drinks before the start of the contest. For each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink. Here, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems. Your task is to write a program to calculate it instead of her.
Constraints
* All input values are integers.
* 1≦N≦100
* 1≦T_i≦10^5
* 1≦M≦100
* 1≦P_i≦N
* 1≦X_i≦10^5
Input
The input is given from Standard Input in the following format:
N
T_1 T_2 ... T_N
M
P_1 X_1
P_2 X_2
:
P_M X_M
Output
For each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.
Examples
Input
3
2 1 4
2
1 1
2 3
Output
6
9
Input
5
7 2 3 8 5
3
4 2
1 7
4 13
Output
19
25
30
Submitted Solution:
```
n=int(input())
T=list(map(int,input().split()))
goukei=sum(T)
m=int(input())
for i in range(m):
p,x=map(int,input().split())
print(goukei-T[p-1]+x)
```
|
instruction
| 0
| 4,068
| 11
| 8,136
|
Yes
|
output
| 1
| 4,068
| 11
| 8,137
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino is about to compete in the final round of a certain programming competition. In this contest, there are N problems, numbered 1 through N. Joisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).
Also, there are M kinds of drinks offered to the contestants, numbered 1 through M. If Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds. It does not affect the time to solve the other problems.
A contestant is allowed to take exactly one of the drinks before the start of the contest. For each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink. Here, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems. Your task is to write a program to calculate it instead of her.
Constraints
* All input values are integers.
* 1≦N≦100
* 1≦T_i≦10^5
* 1≦M≦100
* 1≦P_i≦N
* 1≦X_i≦10^5
Input
The input is given from Standard Input in the following format:
N
T_1 T_2 ... T_N
M
P_1 X_1
P_2 X_2
:
P_M X_M
Output
For each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.
Examples
Input
3
2 1 4
2
1 1
2 3
Output
6
9
Input
5
7 2 3 8 5
3
4 2
1 7
4 13
Output
19
25
30
Submitted Solution:
```
N=int(input())
T=list(map(int,input().split()))
S=sum(T)
M=int(input())
for i in range(M):
P, X = map(int,input().split())
diff = T[P-1]-X
print(S-diff)
```
|
instruction
| 0
| 4,069
| 11
| 8,138
|
Yes
|
output
| 1
| 4,069
| 11
| 8,139
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino is about to compete in the final round of a certain programming competition. In this contest, there are N problems, numbered 1 through N. Joisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).
Also, there are M kinds of drinks offered to the contestants, numbered 1 through M. If Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds. It does not affect the time to solve the other problems.
A contestant is allowed to take exactly one of the drinks before the start of the contest. For each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink. Here, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems. Your task is to write a program to calculate it instead of her.
Constraints
* All input values are integers.
* 1≦N≦100
* 1≦T_i≦10^5
* 1≦M≦100
* 1≦P_i≦N
* 1≦X_i≦10^5
Input
The input is given from Standard Input in the following format:
N
T_1 T_2 ... T_N
M
P_1 X_1
P_2 X_2
:
P_M X_M
Output
For each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.
Examples
Input
3
2 1 4
2
1 1
2 3
Output
6
9
Input
5
7 2 3 8 5
3
4 2
1 7
4 13
Output
19
25
30
Submitted Solution:
```
n = int(input())
ts = list(map(int, input().split()))
m = int(input())
for _ in range(m):
i, p = map(int, input().split())
print(sum(ts)-ts[i-1]+p)
```
|
instruction
| 0
| 4,070
| 11
| 8,140
|
Yes
|
output
| 1
| 4,070
| 11
| 8,141
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino is about to compete in the final round of a certain programming competition. In this contest, there are N problems, numbered 1 through N. Joisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).
Also, there are M kinds of drinks offered to the contestants, numbered 1 through M. If Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds. It does not affect the time to solve the other problems.
A contestant is allowed to take exactly one of the drinks before the start of the contest. For each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink. Here, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems. Your task is to write a program to calculate it instead of her.
Constraints
* All input values are integers.
* 1≦N≦100
* 1≦T_i≦10^5
* 1≦M≦100
* 1≦P_i≦N
* 1≦X_i≦10^5
Input
The input is given from Standard Input in the following format:
N
T_1 T_2 ... T_N
M
P_1 X_1
P_2 X_2
:
P_M X_M
Output
For each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.
Examples
Input
3
2 1 4
2
1 1
2 3
Output
6
9
Input
5
7 2 3 8 5
3
4 2
1 7
4 13
Output
19
25
30
Submitted Solution:
```
n = int(input())
T = list(map(int,input().split()))
m = int(input())
ans = sum(T)
for i in range(m):
p,x=map(int,input().split())
print(ans-(T[p-1]-x))
```
|
instruction
| 0
| 4,071
| 11
| 8,142
|
Yes
|
output
| 1
| 4,071
| 11
| 8,143
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino is about to compete in the final round of a certain programming competition. In this contest, there are N problems, numbered 1 through N. Joisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).
Also, there are M kinds of drinks offered to the contestants, numbered 1 through M. If Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds. It does not affect the time to solve the other problems.
A contestant is allowed to take exactly one of the drinks before the start of the contest. For each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink. Here, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems. Your task is to write a program to calculate it instead of her.
Constraints
* All input values are integers.
* 1≦N≦100
* 1≦T_i≦10^5
* 1≦M≦100
* 1≦P_i≦N
* 1≦X_i≦10^5
Input
The input is given from Standard Input in the following format:
N
T_1 T_2 ... T_N
M
P_1 X_1
P_2 X_2
:
P_M X_M
Output
For each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.
Examples
Input
3
2 1 4
2
1 1
2 3
Output
6
9
Input
5
7 2 3 8 5
3
4 2
1 7
4 13
Output
19
25
30
Submitted Solution:
```
n = int(input())
list = list(map(int, input().split()))
sum = sum(list)
num = int(input())
for x in range(num):
a = list(map(int, input().split()))
ans = sum + a[1] - list[a[0]-1]
print(ans)
```
|
instruction
| 0
| 4,072
| 11
| 8,144
|
No
|
output
| 1
| 4,072
| 11
| 8,145
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino is about to compete in the final round of a certain programming competition. In this contest, there are N problems, numbered 1 through N. Joisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).
Also, there are M kinds of drinks offered to the contestants, numbered 1 through M. If Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds. It does not affect the time to solve the other problems.
A contestant is allowed to take exactly one of the drinks before the start of the contest. For each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink. Here, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems. Your task is to write a program to calculate it instead of her.
Constraints
* All input values are integers.
* 1≦N≦100
* 1≦T_i≦10^5
* 1≦M≦100
* 1≦P_i≦N
* 1≦X_i≦10^5
Input
The input is given from Standard Input in the following format:
N
T_1 T_2 ... T_N
M
P_1 X_1
P_2 X_2
:
P_M X_M
Output
For each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.
Examples
Input
3
2 1 4
2
1 1
2 3
Output
6
9
Input
5
7 2 3 8 5
3
4 2
1 7
4 13
Output
19
25
30
Submitted Solution:
```
N=int(input())
T_N=int(input().split())
list_time = []
for i in range(N):
list_time.append(T_N[i])
#Ti秒の総和を求める
sum=sum(list_time)
M=int(input())
for i in range(M):
p,x=map(int,input().split())
#ドリンク飲んだ時と飲まないときの差を元の合計に足す。
ans=sum+x-list_time[p-1]
print(ans)
```
|
instruction
| 0
| 4,073
| 11
| 8,146
|
No
|
output
| 1
| 4,073
| 11
| 8,147
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino is about to compete in the final round of a certain programming competition. In this contest, there are N problems, numbered 1 through N. Joisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).
Also, there are M kinds of drinks offered to the contestants, numbered 1 through M. If Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds. It does not affect the time to solve the other problems.
A contestant is allowed to take exactly one of the drinks before the start of the contest. For each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink. Here, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems. Your task is to write a program to calculate it instead of her.
Constraints
* All input values are integers.
* 1≦N≦100
* 1≦T_i≦10^5
* 1≦M≦100
* 1≦P_i≦N
* 1≦X_i≦10^5
Input
The input is given from Standard Input in the following format:
N
T_1 T_2 ... T_N
M
P_1 X_1
P_2 X_2
:
P_M X_M
Output
For each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.
Examples
Input
3
2 1 4
2
1 1
2 3
Output
6
9
Input
5
7 2 3 8 5
3
4 2
1 7
4 13
Output
19
25
30
Submitted Solution:
```
#50b
#n 問題数
n = int(input())
#t 時間
t = [int(i) for i in input().split()]
#m ドリンクの種類
m = int(input())
ans = []
for i in range(m):
a,b = map(int,input().split())
temp = sum(t) - t[a-1] + b
ans[i] = temp
for i in range(m):
print(ans[i])
```
|
instruction
| 0
| 4,074
| 11
| 8,148
|
No
|
output
| 1
| 4,074
| 11
| 8,149
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino is about to compete in the final round of a certain programming competition. In this contest, there are N problems, numbered 1 through N. Joisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).
Also, there are M kinds of drinks offered to the contestants, numbered 1 through M. If Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds. It does not affect the time to solve the other problems.
A contestant is allowed to take exactly one of the drinks before the start of the contest. For each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink. Here, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems. Your task is to write a program to calculate it instead of her.
Constraints
* All input values are integers.
* 1≦N≦100
* 1≦T_i≦10^5
* 1≦M≦100
* 1≦P_i≦N
* 1≦X_i≦10^5
Input
The input is given from Standard Input in the following format:
N
T_1 T_2 ... T_N
M
P_1 X_1
P_2 X_2
:
P_M X_M
Output
For each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.
Examples
Input
3
2 1 4
2
1 1
2 3
Output
6
9
Input
5
7 2 3 8 5
3
4 2
1 7
4 13
Output
19
25
30
Submitted Solution:
```
N = int(input())
times = map(int, input().split())
M = int(input())
sum_t = sum(times)
for _ in range(M):
dist, time = map(int, input().split())
if times[dist-1] >= time:
print(sum_t-(times[dist-1]-time))
else:
print(sum_t+(time-times[dist-1]))
```
|
instruction
| 0
| 4,075
| 11
| 8,150
|
No
|
output
| 1
| 4,075
| 11
| 8,151
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sasha grew up and went to first grade. To celebrate this event her mother bought her a multiplication table M with n rows and n columns such that M_{ij}=a_i ⋅ a_j where a_1, ..., a_n is some sequence of positive integers.
Of course, the girl decided to take it to school with her. But while she was having lunch, hooligan Grisha erased numbers on the main diagonal and threw away the array a_1, ..., a_n. Help Sasha restore the array!
Input
The first line contains a single integer n (3 ⩽ n ⩽ 10^3), the size of the table.
The next n lines contain n integers each. The j-th number of the i-th line contains the number M_{ij} (1 ≤ M_{ij} ≤ 10^9). The table has zeroes on the main diagonal, that is, M_{ii}=0.
Output
In a single line print n integers, the original array a_1, ..., a_n (1 ≤ a_i ≤ 10^9). It is guaranteed that an answer exists. If there are multiple answers, print any.
Examples
Input
5
0 4 6 2 4
4 0 6 2 4
6 6 0 3 6
2 2 3 0 2
4 4 6 2 0
Output
2 2 3 1 2
Input
3
0 99990000 99970002
99990000 0 99980000
99970002 99980000 0
Output
9999 10000 9998
Submitted Solution:
```
import math
def solve(arr,n):
a1=int(math.sqrt(arr[0][1]*arr[0][2]//arr[1][2]))
print(a1)
ans=[a1]
for i in arr[0][1:]:
ans.append(i//a1)
for i in ans:
print(i,end=' ')
test=1
# test=int(input())
for t in range(0,test):
n = int(input())
rows, cols = (n, n)
arr = [[int(i) for i in input().split()] for j in range(rows)]
# n,k = [int(x) for x in input().split()]
# arr = [int(x) for x in input().split()]
solve(arr,n)
```
|
instruction
| 0
| 4,267
| 11
| 8,534
|
No
|
output
| 1
| 4,267
| 11
| 8,535
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a sequence of positive integers a1, a2, ..., an. Find all such indices i, that the i-th element equals the arithmetic mean of all other elements (that is all elements except for this one).
Input
The first line contains the integer n (2 ≤ n ≤ 2·105). The second line contains elements of the sequence a1, a2, ..., an (1 ≤ ai ≤ 1000). All the elements are positive integers.
Output
Print on the first line the number of the sought indices. Print on the second line the sought indices in the increasing order. All indices are integers from 1 to n.
If the sought elements do not exist, then the first output line should contain number 0. In this case you may either not print the second line or print an empty line.
Examples
Input
5
1 2 3 4 5
Output
1
3
Input
4
50 50 50 50
Output
4
1 2 3 4
Submitted Solution:
```
class CodeforcesTask134ASolution:
def __init__(self):
self.result = ''
self.n = 0
self.sequence = []
def read_input(self):
self.n = int(input())
self.sequence = [float(x) for x in input().split(" ")]
def process_task(self):
ss = sum(self.sequence)
other_rests = [(ss - self.sequence[x]) / (self.n - 1) for x in range(self.n)]
matching = [i + 1 for i, x in enumerate(other_rests) if self.sequence[i] == x]
self.result = "{0}\n{1}".format(len(matching), " ".join([str(x) for x in matching]))
def get_result(self):
return self.result
if __name__ == "__main__":
Solution = CodeforcesTask134ASolution()
Solution.read_input()
Solution.process_task()
print(Solution.get_result())
```
|
instruction
| 0
| 4,343
| 11
| 8,686
|
Yes
|
output
| 1
| 4,343
| 11
| 8,687
|
Provide a correct Python 3 solution for this coding contest problem.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
|
instruction
| 0
| 4,891
| 11
| 9,782
|
"Correct Solution:
```
import sys
from collections import Counter
n=int(input())
d=Counter(list(map(int,input().split())))
m=int(input())
t=Counter(list(map(int,input().split())))
k=list(t.keys())
for i in range(len(k)):
if d[k[i]]<t[k[i]]:
print('NO')
sys.exit()
print('YES')
```
|
output
| 1
| 4,891
| 11
| 9,783
|
Provide a correct Python 3 solution for this coding contest problem.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
|
instruction
| 0
| 4,892
| 11
| 9,784
|
"Correct Solution:
```
import collections
N = int(input())
D = collections.Counter(map(int,input().split()))
M = int(input())
T = collections.Counter(list(map(int,input().split())))
for key in T.keys():
if T[key] > D[key]:
print('NO')
exit()
print('YES')
```
|
output
| 1
| 4,892
| 11
| 9,785
|
Provide a correct Python 3 solution for this coding contest problem.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
|
instruction
| 0
| 4,893
| 11
| 9,786
|
"Correct Solution:
```
n = int(input())
d = list(map(int, input().split()))
m = int(input())
t = list(map(int, input().split()))
from collections import Counter
dc = Counter(d)
dt = Counter(t)
for k, v in dt.items():
if dc[k] < v:
print('NO')
exit()
print('YES')
```
|
output
| 1
| 4,893
| 11
| 9,787
|
Provide a correct Python 3 solution for this coding contest problem.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
|
instruction
| 0
| 4,894
| 11
| 9,788
|
"Correct Solution:
```
N = int(input())
D = list(map(int,input().split()))
D.sort()
M = int(input())
T = list(map(int,input().split()))
T.sort()
dindex = 0
for i in range(M):
while 1:
dindex += 1
if T[i] == D[dindex-1]:
break
elif dindex == N:
print('NO')
exit()
print('YES')
```
|
output
| 1
| 4,894
| 11
| 9,789
|
Provide a correct Python 3 solution for this coding contest problem.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
|
instruction
| 0
| 4,895
| 11
| 9,790
|
"Correct Solution:
```
N=int(input());D=sorted(map(int,input().split()))[::-1]
M=int(input());T=sorted(map(int,input().split()))
for t in T:
d=0
while D and d!=t:d=D.pop()
if d!=t:print("NO");quit()
print("YES")
```
|
output
| 1
| 4,895
| 11
| 9,791
|
Provide a correct Python 3 solution for this coding contest problem.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
|
instruction
| 0
| 4,896
| 11
| 9,792
|
"Correct Solution:
```
from collections import Counter
N = int(input())
D = Counter(list(map(int, input().split())))
M = int(input())
T = Counter(list(map(int, input().split())))
res = "YES"
for i in T:
if i not in D or T[i] > D[i]:
res = "NO"
break
print(res)
```
|
output
| 1
| 4,896
| 11
| 9,793
|
Provide a correct Python 3 solution for this coding contest problem.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
|
instruction
| 0
| 4,897
| 11
| 9,794
|
"Correct Solution:
```
N=int(input())
D=list(map(int, input().split()))
M=int(input())
T=list(map(int, input().split()))
import bisect
D=sorted(D)
T=sorted(T)
idx=0
for i in range(M):
t=T[i]
while D[idx]<t:
idx+=1
if D[idx]!=t:
print("NO")
exit()
idx+=1
print("YES")
```
|
output
| 1
| 4,897
| 11
| 9,795
|
Provide a correct Python 3 solution for this coding contest problem.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
|
instruction
| 0
| 4,898
| 11
| 9,796
|
"Correct Solution:
```
from collections import Counter
N = int(input())
D = list(map(int,input().split()))
M = int(input())
T = list(map(int,input().split()))
c1 = Counter(D)
c2 = Counter(T)
for k,v in c2.items():
if c1[k] < v:
print('NO')
exit()
print('YES')
```
|
output
| 1
| 4,898
| 11
| 9,797
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
Submitted Solution:
```
from collections import*
n=int(input())
d=Counter(map(int,input().split()))
m=int(input())
t=Counter(map(int,input().split()))
#print(d,t)
for k,v in t.items():
if d[k]<v:
print("NO")
exit()
print("YES")
```
|
instruction
| 0
| 4,899
| 11
| 9,798
|
Yes
|
output
| 1
| 4,899
| 11
| 9,799
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
Submitted Solution:
```
from collections import Counter
N = int(input())
D = list(map(int,input().split()))
M = int(input())
T = list(map(int,input().split()))
d = Counter(D)
flag = True
for t in T:
if d[t] == 0:
flag = False
else:
d[t] -= 1
print('YES' if flag else 'NO')
```
|
instruction
| 0
| 4,900
| 11
| 9,800
|
Yes
|
output
| 1
| 4,900
| 11
| 9,801
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
Submitted Solution:
```
from collections import*
i = eval("Counter(list(map(int, input().split()))),"*4)
print("YNEOS"[i[3]-i[1] != {}::2])
```
|
instruction
| 0
| 4,901
| 11
| 9,802
|
Yes
|
output
| 1
| 4,901
| 11
| 9,803
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
Submitted Solution:
```
from collections import Counter
N = int(input())
D = Counter(map(int, input().split()))
M = int(input())
*T, = map(int, input().split())
for t in T:
if D[t]:
D[t] -= 1
else:
print('NO')
break
else:
print('YES')
```
|
instruction
| 0
| 4,902
| 11
| 9,804
|
Yes
|
output
| 1
| 4,902
| 11
| 9,805
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
Submitted Solution:
```
import collections
n = int(input())
d = sorted(list(map(int,input().split())))
m = int(input())
t = list(map(int,input().split()))
cd = collections.Counter(d)
ct = collections.Counter(t)
flg = True
for k in ct.items():
if k[1] >= cd[k[0]]:
flg = False
print('YES' if flg else 'NO')
```
|
instruction
| 0
| 4,903
| 11
| 9,806
|
No
|
output
| 1
| 4,903
| 11
| 9,807
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
Submitted Solution:
```
import bisect
N = int(input())
D = list(map(int, input().split()))
D.sort()
M = int(input())
T = list(map(int, input().split()))
for i in range(M):
t = T[i]
idx = min(bisect.bisect_left(D, t), len(D) - 1)
d = D[idx]
if t == d:
D.pop(idx)
else:
print('NO')
exit()
print('YES')
```
|
instruction
| 0
| 4,904
| 11
| 9,808
|
No
|
output
| 1
| 4,904
| 11
| 9,809
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
Submitted Solution:
```
q=input()
x=[int(i) for i in input().split()]
cnt=input()
y=[int(i) for i in input().split()]
print('YES')
```
|
instruction
| 0
| 4,905
| 11
| 9,810
|
No
|
output
| 1
| 4,905
| 11
| 9,811
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
Submitted Solution:
```
class EndLoop(Exception):
pass
def solve():
while 1:
try:
N = int(input())
D = list(map(int, input().split(" ")))
M = int(input())
T = list(map(int, input().split(" ")))
if N < M:
print("NO")
break
i = 0
while 1:
if i == M - 1:
break
elif T[i] in D:
D.remove(T[i])
else:
print("NO")
raise EndLoop
i += 1
print("YES")
break
except:
break
solve()
```
|
instruction
| 0
| 4,906
| 11
| 9,812
|
No
|
output
| 1
| 4,906
| 11
| 9,813
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which judges wheather given length of three side form a right triangle. Print "YES" if the given sides (integers) form a right triangle, "NO" if not so.
Constraints
* 1 ≤ length of the side ≤ 1,000
* N ≤ 1,000
Input
Input consists of several data sets. In the first line, the number of data set, N is given. Then, N lines follow, each line corresponds to a data set. A data set consists of three integers separated by a single space.
Output
For each data set, print "YES" or "NO".
Example
Input
3
4 3 5
4 3 6
8 8 8
Output
YES
NO
NO
Submitted Solution:
```
for i in range ( int ( input ( ) ) ):
( a, b, c ) = sorted ( list ( map ( int, input ( ).split ( ) ) ) )
if ( a ** 2 ) + ( b ** 2 ) == ( c ** 2 ):
print ( "YES" )
else:
print ( "NO" )
```
|
instruction
| 0
| 4,941
| 11
| 9,882
|
Yes
|
output
| 1
| 4,941
| 11
| 9,883
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which judges wheather given length of three side form a right triangle. Print "YES" if the given sides (integers) form a right triangle, "NO" if not so.
Constraints
* 1 ≤ length of the side ≤ 1,000
* N ≤ 1,000
Input
Input consists of several data sets. In the first line, the number of data set, N is given. Then, N lines follow, each line corresponds to a data set. A data set consists of three integers separated by a single space.
Output
For each data set, print "YES" or "NO".
Example
Input
3
4 3 5
4 3 6
8 8 8
Output
YES
NO
NO
Submitted Solution:
```
N=int(input())
for i in range(N):
a,b,c=sorted(map(int,input().split()))
if a**2+b**2==c**2 or a**2+c**2==b**2 or b**2+c**2==a**2:
print('YES')
else:
print('NO')
```
|
instruction
| 0
| 4,942
| 11
| 9,884
|
Yes
|
output
| 1
| 4,942
| 11
| 9,885
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which judges wheather given length of three side form a right triangle. Print "YES" if the given sides (integers) form a right triangle, "NO" if not so.
Constraints
* 1 ≤ length of the side ≤ 1,000
* N ≤ 1,000
Input
Input consists of several data sets. In the first line, the number of data set, N is given. Then, N lines follow, each line corresponds to a data set. A data set consists of three integers separated by a single space.
Output
For each data set, print "YES" or "NO".
Example
Input
3
4 3 5
4 3 6
8 8 8
Output
YES
NO
NO
Submitted Solution:
```
N = int(input())
for i in range(N):
a, b, c = map(int, input().split())
sort = sorted([a, b, c])
if sort[0]**2 + sort[1]**2 == sort[2]**2:
print("Yes")
else:
print("No")
```
|
instruction
| 0
| 4,943
| 11
| 9,886
|
No
|
output
| 1
| 4,943
| 11
| 9,887
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A team quiz game called "What? Where? When?" is very popular in Berland. The game is centered on two teams competing. They are the team of six Experts versus the team of the Audience. A person from the audience asks a question and the experts are allowed a minute on brainstorming and finding the right answer to the question. All it takes to answer a typical question is general knowledge and common logic. The question sent be the audience are in envelops lain out in a circle on a round table. Each envelop is marked by the name of the asker's town. Each question is positioned in a separate sector. In the centre of the table is a spinning arrow. Thus, the table rather resembles a roulette table with no ball but with a spinning arrow instead. The host sets off the spinning arrow to choose a question for the experts: when the arrow stops spinning, the question it is pointing at is chosen. If the arrow points at the question that has already been asked, the host chooses the next unanswered question in the clockwise direction. Your task is to determine which will be the number of the next asked question if the arrow points at sector number k.
Input
The first line contains two positive integers n and k (1 ≤ n ≤ 1000 and 1 ≤ k ≤ n) — the numbers of sectors on the table and the number of the sector where the arrow is pointing. The second line contains n numbers: ai = 0 if the question from sector i has already been asked and ai = 1 if the question from sector i hasn't been asked yet (1 ≤ i ≤ n). The sectors are given in the clockwise order, the first sector follows after the n-th one.
Output
Print the single number — the number of the sector containing the question the experts will be asked. It is guaranteed that the answer exists, that is that not all the questions have already been asked.
Examples
Input
5 5
0 1 0 1 0
Output
2
Input
2 1
1 1
Output
1
Submitted Solution:
```
f=open("input.txt","r")
i=0
for x in f.readlines():
if i==0:
l1=x.split()
i+=1
elif i==1: l2=x.split()
f.close()
for i in range(int(l1[0])):
k=int(l1[1])-1
if l2[k]=='1':
k+=1
break
s=0
while s==0:
s=int(l2[k])
k+=1
if k==int(l1[0]): k=0
f=open("output.txt","w+")
f.write(str(k))
f.close()
```
|
instruction
| 0
| 5,119
| 11
| 10,238
|
No
|
output
| 1
| 5,119
| 11
| 10,239
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A team quiz game called "What? Where? When?" is very popular in Berland. The game is centered on two teams competing. They are the team of six Experts versus the team of the Audience. A person from the audience asks a question and the experts are allowed a minute on brainstorming and finding the right answer to the question. All it takes to answer a typical question is general knowledge and common logic. The question sent be the audience are in envelops lain out in a circle on a round table. Each envelop is marked by the name of the asker's town. Each question is positioned in a separate sector. In the centre of the table is a spinning arrow. Thus, the table rather resembles a roulette table with no ball but with a spinning arrow instead. The host sets off the spinning arrow to choose a question for the experts: when the arrow stops spinning, the question it is pointing at is chosen. If the arrow points at the question that has already been asked, the host chooses the next unanswered question in the clockwise direction. Your task is to determine which will be the number of the next asked question if the arrow points at sector number k.
Input
The first line contains two positive integers n and k (1 ≤ n ≤ 1000 and 1 ≤ k ≤ n) — the numbers of sectors on the table and the number of the sector where the arrow is pointing. The second line contains n numbers: ai = 0 if the question from sector i has already been asked and ai = 1 if the question from sector i hasn't been asked yet (1 ≤ i ≤ n). The sectors are given in the clockwise order, the first sector follows after the n-th one.
Output
Print the single number — the number of the sector containing the question the experts will be asked. It is guaranteed that the answer exists, that is that not all the questions have already been asked.
Examples
Input
5 5
0 1 0 1 0
Output
2
Input
2 1
1 1
Output
1
Submitted Solution:
```
import sys
sys.stdin = open('input.txt','r')
sys.stdout = open('output.txt','w')
n,m=map(int,input().split())
l=list(map(int,input().split()))
c=0
if n==m:
j=0
else:
j=m-1
while c==0:
if l[j]==1:
c=j+1
# print(c)
break
if j==n-1:
j=0
else:
j+=1
# j=j+1%(n)
print(c)
```
|
instruction
| 0
| 5,120
| 11
| 10,240
|
No
|
output
| 1
| 5,120
| 11
| 10,241
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A team quiz game called "What? Where? When?" is very popular in Berland. The game is centered on two teams competing. They are the team of six Experts versus the team of the Audience. A person from the audience asks a question and the experts are allowed a minute on brainstorming and finding the right answer to the question. All it takes to answer a typical question is general knowledge and common logic. The question sent be the audience are in envelops lain out in a circle on a round table. Each envelop is marked by the name of the asker's town. Each question is positioned in a separate sector. In the centre of the table is a spinning arrow. Thus, the table rather resembles a roulette table with no ball but with a spinning arrow instead. The host sets off the spinning arrow to choose a question for the experts: when the arrow stops spinning, the question it is pointing at is chosen. If the arrow points at the question that has already been asked, the host chooses the next unanswered question in the clockwise direction. Your task is to determine which will be the number of the next asked question if the arrow points at sector number k.
Input
The first line contains two positive integers n and k (1 ≤ n ≤ 1000 and 1 ≤ k ≤ n) — the numbers of sectors on the table and the number of the sector where the arrow is pointing. The second line contains n numbers: ai = 0 if the question from sector i has already been asked and ai = 1 if the question from sector i hasn't been asked yet (1 ≤ i ≤ n). The sectors are given in the clockwise order, the first sector follows after the n-th one.
Output
Print the single number — the number of the sector containing the question the experts will be asked. It is guaranteed that the answer exists, that is that not all the questions have already been asked.
Examples
Input
5 5
0 1 0 1 0
Output
2
Input
2 1
1 1
Output
1
Submitted Solution:
```
with open("input.txt", "r") as file:
firstLine = list(map(int, file.readline().strip().split(" ")))
secondLine = list(map(int, file.readline().strip().split(" ")))
numTables = firstLine[0]
numPointed = firstLine[1]
line = numPointed % numTables
while(secondLine[line-1] == 0):
numPointed += 1
line = numPointed % numTables
# try:
output = open("output.txt", "w+")
output.write(str(line))
# except Exception as e:
# print(e)
# finally:
output.close
```
|
instruction
| 0
| 5,121
| 11
| 10,242
|
No
|
output
| 1
| 5,121
| 11
| 10,243
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A team quiz game called "What? Where? When?" is very popular in Berland. The game is centered on two teams competing. They are the team of six Experts versus the team of the Audience. A person from the audience asks a question and the experts are allowed a minute on brainstorming and finding the right answer to the question. All it takes to answer a typical question is general knowledge and common logic. The question sent be the audience are in envelops lain out in a circle on a round table. Each envelop is marked by the name of the asker's town. Each question is positioned in a separate sector. In the centre of the table is a spinning arrow. Thus, the table rather resembles a roulette table with no ball but with a spinning arrow instead. The host sets off the spinning arrow to choose a question for the experts: when the arrow stops spinning, the question it is pointing at is chosen. If the arrow points at the question that has already been asked, the host chooses the next unanswered question in the clockwise direction. Your task is to determine which will be the number of the next asked question if the arrow points at sector number k.
Input
The first line contains two positive integers n and k (1 ≤ n ≤ 1000 and 1 ≤ k ≤ n) — the numbers of sectors on the table and the number of the sector where the arrow is pointing. The second line contains n numbers: ai = 0 if the question from sector i has already been asked and ai = 1 if the question from sector i hasn't been asked yet (1 ≤ i ≤ n). The sectors are given in the clockwise order, the first sector follows after the n-th one.
Output
Print the single number — the number of the sector containing the question the experts will be asked. It is guaranteed that the answer exists, that is that not all the questions have already been asked.
Examples
Input
5 5
0 1 0 1 0
Output
2
Input
2 1
1 1
Output
1
Submitted Solution:
```
with open("input.txt", 'r') as f1:
n, k = map(int, f1.readline().split())
arr = list(map(int, f1.readline().split()))
if arr[k - 1] == 1:
with open("output.txt", 'w') as f2:
f2.write(str(k+1)+"\n")
else:
k-=1
while True:
k = (k+1)%n
if arr[k] == 1:
with open("output.txt", 'w') as f2:
f2.write(str(k+1)+"\n")
break
```
|
instruction
| 0
| 5,122
| 11
| 10,244
|
No
|
output
| 1
| 5,122
| 11
| 10,245
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.