text stringlengths 216 39.6k | conversation_id int64 219 108k | embedding list | cluster int64 11 11 |
|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
10^{10^{10}} participants, including Takahashi, competed in two programming contests. In each contest, all participants had distinct ranks from first through 10^{10^{10}}-th.
The score of a participant is the product of his/her ranks in the two contests.
Process the following Q queries:
* In the i-th query, you are given two positive integers A_i and B_i. Assuming that Takahashi was ranked A_i-th in the first contest and B_i-th in the second contest, find the maximum possible number of participants whose scores are smaller than Takahashi's.
Constraints
* 1 \leq Q \leq 100
* 1\leq A_i,B_i\leq 10^9(1\leq i\leq Q)
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
Q
A_1 B_1
:
A_Q B_Q
Output
For each query, print the maximum possible number of participants whose scores are smaller than Takahashi's.
Example
Input
8
1 4
10 5
3 3
4 11
8 9
22 40
8 36
314159265 358979323
Output
1
12
4
11
14
57
31
671644785
"Correct Solution:
```
q = int(input())
for _ in range(q):
a, b = map(int, input().split())
if a == b:
print(2 * (a - 1))
continue
if a > b:
a, b = b, a
ans = a - 1
l, r = -1, b - 1
while r - l > 1:
k = (l + r) // 2
x = min(k, (a + 1 + k) // 2)
y = (a + 1 + k) - x
if x * y < a * b:
l = k
else:
r = k
ans += l
print(ans)
```
| 100,164 | [
0.5078125,
0.10040283203125,
-0.361572265625,
0.321533203125,
-0.4228515625,
-0.354248046875,
-0.1697998046875,
0.1893310546875,
-0.1427001953125,
0.9208984375,
0.404052734375,
0.0919189453125,
0.1246337890625,
-0.9072265625,
-0.68310546875,
0.228759765625,
-0.7275390625,
-0.916015... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
10^{10^{10}} participants, including Takahashi, competed in two programming contests. In each contest, all participants had distinct ranks from first through 10^{10^{10}}-th.
The score of a participant is the product of his/her ranks in the two contests.
Process the following Q queries:
* In the i-th query, you are given two positive integers A_i and B_i. Assuming that Takahashi was ranked A_i-th in the first contest and B_i-th in the second contest, find the maximum possible number of participants whose scores are smaller than Takahashi's.
Constraints
* 1 \leq Q \leq 100
* 1\leq A_i,B_i\leq 10^9(1\leq i\leq Q)
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
Q
A_1 B_1
:
A_Q B_Q
Output
For each query, print the maximum possible number of participants whose scores are smaller than Takahashi's.
Example
Input
8
1 4
10 5
3 3
4 11
8 9
22 40
8 36
314159265 358979323
Output
1
12
4
11
14
57
31
671644785
"Correct Solution:
```
Q = int(input())
def solve(a, b):
if a == b:
return 2 * a - 2
if b < a:
return solve(b, a)
lb, ub, ab = a, 2 * b, a * b
while 1 < ub - lb:
mid = (lb + ub) // 2
maxp = (mid + 1) // 2 * (mid // 2 + 1)
if maxp < ab:
lb = mid
else:
ub = mid
return lb - 1
for _ in range(Q):
a, b = map(int, input().split())
print(solve(a, b))
```
| 100,165 | [
0.50634765625,
0.06927490234375,
-0.335205078125,
0.2861328125,
-0.449951171875,
-0.3623046875,
-0.1630859375,
0.2232666015625,
-0.14599609375,
0.943359375,
0.408935546875,
0.1263427734375,
0.126953125,
-0.8916015625,
-0.671875,
0.251953125,
-0.69287109375,
-0.88916015625,
-0.344... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
10^{10^{10}} participants, including Takahashi, competed in two programming contests. In each contest, all participants had distinct ranks from first through 10^{10^{10}}-th.
The score of a participant is the product of his/her ranks in the two contests.
Process the following Q queries:
* In the i-th query, you are given two positive integers A_i and B_i. Assuming that Takahashi was ranked A_i-th in the first contest and B_i-th in the second contest, find the maximum possible number of participants whose scores are smaller than Takahashi's.
Constraints
* 1 \leq Q \leq 100
* 1\leq A_i,B_i\leq 10^9(1\leq i\leq Q)
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
Q
A_1 B_1
:
A_Q B_Q
Output
For each query, print the maximum possible number of participants whose scores are smaller than Takahashi's.
Example
Input
8
1 4
10 5
3 3
4 11
8 9
22 40
8 36
314159265 358979323
Output
1
12
4
11
14
57
31
671644785
"Correct Solution:
```
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())
from math import sqrt
def wc(a:int, b:int) -> int:
if a == b:
return 2*a - 2
elif abs(a-b) == 1:
return 2*min(a,b) - 2
else:
c = int(sqrt(a*b))
if a*b == c*c:
c -= 1
if a*b > c*(c+1):
return 2*c - 1
else:
return 2*c - 2
q = ni()
query = [tuple(li()) for _ in range(q)]
for a,b in query:
print(wc(a,b))
```
| 100,166 | [
0.415283203125,
0.20361328125,
-0.285400390625,
0.2423095703125,
-0.489501953125,
-0.286865234375,
-0.1641845703125,
0.17724609375,
-0.22607421875,
0.96240234375,
0.3720703125,
0.09454345703125,
0.0921630859375,
-0.79443359375,
-0.61279296875,
0.1292724609375,
-0.68896484375,
-1.01... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
10^{10^{10}} participants, including Takahashi, competed in two programming contests. In each contest, all participants had distinct ranks from first through 10^{10^{10}}-th.
The score of a participant is the product of his/her ranks in the two contests.
Process the following Q queries:
* In the i-th query, you are given two positive integers A_i and B_i. Assuming that Takahashi was ranked A_i-th in the first contest and B_i-th in the second contest, find the maximum possible number of participants whose scores are smaller than Takahashi's.
Constraints
* 1 \leq Q \leq 100
* 1\leq A_i,B_i\leq 10^9(1\leq i\leq Q)
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
Q
A_1 B_1
:
A_Q B_Q
Output
For each query, print the maximum possible number of participants whose scores are smaller than Takahashi's.
Example
Input
8
1 4
10 5
3 3
4 11
8 9
22 40
8 36
314159265 358979323
Output
1
12
4
11
14
57
31
671644785
"Correct Solution:
```
Q, *AB = map(int, open(0).read().split())
for a, b in zip(*[iter(AB)] * 2):
if a == b or a + 1 == b:
print(2 * a - 2)
else:
c = int((a * b) ** 0.5)
if c * c == a * b:
c -= 1
if c * (c + 1) >= a * b:
print(2 * c - 2)
else:
print(2 * c - 1)
```
| 100,167 | [
0.498779296875,
0.08477783203125,
-0.36474609375,
0.306396484375,
-0.41845703125,
-0.3505859375,
-0.16015625,
0.2012939453125,
-0.1448974609375,
0.9365234375,
0.394775390625,
0.13427734375,
0.16748046875,
-0.912109375,
-0.67919921875,
0.2030029296875,
-0.66650390625,
-0.93017578125... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
10^{10^{10}} participants, including Takahashi, competed in two programming contests. In each contest, all participants had distinct ranks from first through 10^{10^{10}}-th.
The score of a participant is the product of his/her ranks in the two contests.
Process the following Q queries:
* In the i-th query, you are given two positive integers A_i and B_i. Assuming that Takahashi was ranked A_i-th in the first contest and B_i-th in the second contest, find the maximum possible number of participants whose scores are smaller than Takahashi's.
Constraints
* 1 \leq Q \leq 100
* 1\leq A_i,B_i\leq 10^9(1\leq i\leq Q)
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
Q
A_1 B_1
:
A_Q B_Q
Output
For each query, print the maximum possible number of participants whose scores are smaller than Takahashi's.
Example
Input
8
1 4
10 5
3 3
4 11
8 9
22 40
8 36
314159265 358979323
Output
1
12
4
11
14
57
31
671644785
"Correct Solution:
```
## ABC 093 D Worst Case
import math
Q = int(input())
ans = []
for i in range(Q):
A,B = list(map(int,input().split()))
C = math.floor(math.sqrt(A*B)-1e-7)
if A <= B:
pass
else:
t = A
A = B
B = t
#解説より、場合分け
# コンテスト成績をA<＝Bとして、A==Bなら、
if A == B:
ans.append(2*A-2)
# 2A-2
# A+1==Bなら
elif (A+1) == B:
ans.append(2*A-2)
# 2A-2
# C^2 <AB の最大のCで C(C+1) >= ABなら
# 2C-2
elif C*(C+1) >= A*B:
ans.append(2*C-2)
# C^2 < ABなら
# 2C-1
else:
ans.append(2*C-1)
for a in ans:
print(a)
```
| 100,168 | [
0.495361328125,
0.056610107421875,
-0.329345703125,
0.276123046875,
-0.407470703125,
-0.334716796875,
-0.11358642578125,
0.1846923828125,
-0.10833740234375,
0.89794921875,
0.51806640625,
0.005374908447265625,
0.1385498046875,
-0.89892578125,
-0.7568359375,
0.1705322265625,
-0.6791992... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
10^{10^{10}} participants, including Takahashi, competed in two programming contests. In each contest, all participants had distinct ranks from first through 10^{10^{10}}-th.
The score of a participant is the product of his/her ranks in the two contests.
Process the following Q queries:
* In the i-th query, you are given two positive integers A_i and B_i. Assuming that Takahashi was ranked A_i-th in the first contest and B_i-th in the second contest, find the maximum possible number of participants whose scores are smaller than Takahashi's.
Constraints
* 1 \leq Q \leq 100
* 1\leq A_i,B_i\leq 10^9(1\leq i\leq Q)
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
Q
A_1 B_1
:
A_Q B_Q
Output
For each query, print the maximum possible number of participants whose scores are smaller than Takahashi's.
Example
Input
8
1 4
10 5
3 3
4 11
8 9
22 40
8 36
314159265 358979323
Output
1
12
4
11
14
57
31
671644785
Submitted Solution:
```
#!/usr/bin/env python3
import math
def main():
Q = int(input())
A = []
B = []
for i in range(Q):
na = list(map(int, input().split()))
A.append(na[0])
B.append(na[1])
for i in range(Q):
a, b = A[i], B[i]
if a == b:
print(a * 2 - 2)
continue
c = a * b
d = int(math.sqrt(c))
if d * (d + 1) < c:
print(d * 2 - 1)
elif d ** 2 == c:
print(d * 2 - 3)
else:
print(d * 2 - 2)
if __name__ == '__main__':
main()
```
Yes
| 100,169 | [
0.466796875,
0.07904052734375,
-0.331298828125,
0.317138671875,
-0.413330078125,
-0.16455078125,
-0.11248779296875,
0.171875,
-0.1768798828125,
1.005859375,
0.430908203125,
0.1453857421875,
0.09625244140625,
-0.77880859375,
-0.63818359375,
0.130859375,
-0.60498046875,
-0.9291992187... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
10^{10^{10}} participants, including Takahashi, competed in two programming contests. In each contest, all participants had distinct ranks from first through 10^{10^{10}}-th.
The score of a participant is the product of his/her ranks in the two contests.
Process the following Q queries:
* In the i-th query, you are given two positive integers A_i and B_i. Assuming that Takahashi was ranked A_i-th in the first contest and B_i-th in the second contest, find the maximum possible number of participants whose scores are smaller than Takahashi's.
Constraints
* 1 \leq Q \leq 100
* 1\leq A_i,B_i\leq 10^9(1\leq i\leq Q)
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
Q
A_1 B_1
:
A_Q B_Q
Output
For each query, print the maximum possible number of participants whose scores are smaller than Takahashi's.
Example
Input
8
1 4
10 5
3 3
4 11
8 9
22 40
8 36
314159265 358979323
Output
1
12
4
11
14
57
31
671644785
Submitted Solution:
```
import sys,heapq
input = sys.stdin.buffer.readline
Q = int(input())
def f(x,y):
ma = x*y - 1
ok = 0
ng = 10**9 + 1
while ng - ok > 1:
mid = (ok+ng)//2
if mid**2 <= ma:
ok = mid
else:
ng = mid
return ok
ans = []
for testcase in range(Q):
a,b = map(int,input().split())
if a == 1 and b == 1:
ans.append(0)
continue
p = f(a,b)
res = p*2
if a != b:
res -= 1
if p == (a*b - 1)//p:
res -= 1
ans.append(res)
print(*ans,sep='\n')
```
Yes
| 100,170 | [
0.471923828125,
0.08331298828125,
-0.310791015625,
0.379150390625,
-0.3974609375,
-0.225341796875,
-0.1070556640625,
0.10797119140625,
-0.11590576171875,
0.99560546875,
0.41015625,
0.095703125,
0.10302734375,
-0.8212890625,
-0.6591796875,
0.07421875,
-0.57470703125,
-0.91796875,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
10^{10^{10}} participants, including Takahashi, competed in two programming contests. In each contest, all participants had distinct ranks from first through 10^{10^{10}}-th.
The score of a participant is the product of his/her ranks in the two contests.
Process the following Q queries:
* In the i-th query, you are given two positive integers A_i and B_i. Assuming that Takahashi was ranked A_i-th in the first contest and B_i-th in the second contest, find the maximum possible number of participants whose scores are smaller than Takahashi's.
Constraints
* 1 \leq Q \leq 100
* 1\leq A_i,B_i\leq 10^9(1\leq i\leq Q)
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
Q
A_1 B_1
:
A_Q B_Q
Output
For each query, print the maximum possible number of participants whose scores are smaller than Takahashi's.
Example
Input
8
1 4
10 5
3 3
4 11
8 9
22 40
8 36
314159265 358979323
Output
1
12
4
11
14
57
31
671644785
Submitted Solution:
```
# 5,10とする
# 片方は7位以下
# (7,7) (6,8) (5,-) (4,9) (3,11) (2,12) (1,13)
# (8,6) (9,5) (10,4) (11,3) (12,2) (13,1)
# 5,12とする
# (7,8) - (1,14) except 5
# (8,7) - (14,1)
Q = int(input())
AB = [[int(x) for x in input().split()] for _ in range(Q)]
for a,b in AB:
if a > b:
a,b = b,a
answer = 0
x = int((a*b)**0.5)-2
while (x+1)*(x+1) < a*b:
x += 1
y = x
answer = 2*x-1
if a <= x:
answer -= 1
if x*(x+1) < a*b:
answer += 1
print(answer)
```
Yes
| 100,171 | [
0.47216796875,
0.08209228515625,
-0.26220703125,
0.322265625,
-0.43701171875,
-0.2315673828125,
-0.150390625,
0.2264404296875,
-0.1478271484375,
0.98828125,
0.4814453125,
0.15625,
0.061126708984375,
-0.74267578125,
-0.64208984375,
0.080810546875,
-0.60107421875,
-0.91943359375,
-... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
10^{10^{10}} participants, including Takahashi, competed in two programming contests. In each contest, all participants had distinct ranks from first through 10^{10^{10}}-th.
The score of a participant is the product of his/her ranks in the two contests.
Process the following Q queries:
* In the i-th query, you are given two positive integers A_i and B_i. Assuming that Takahashi was ranked A_i-th in the first contest and B_i-th in the second contest, find the maximum possible number of participants whose scores are smaller than Takahashi's.
Constraints
* 1 \leq Q \leq 100
* 1\leq A_i,B_i\leq 10^9(1\leq i\leq Q)
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
Q
A_1 B_1
:
A_Q B_Q
Output
For each query, print the maximum possible number of participants whose scores are smaller than Takahashi's.
Example
Input
8
1 4
10 5
3 3
4 11
8 9
22 40
8 36
314159265 358979323
Output
1
12
4
11
14
57
31
671644785
Submitted Solution:
```
def binsearch(good, bad, fn):
while abs(good - bad) > 1:
m = (good + bad) // 2
if fn(m):
good = m
else:
bad = m
return good
def solve(a, b):
if a > b:
a, b = b, a
if a == b:
return 2 * (a - 1)
t = binsearch(1, a * b, lambda x: (x + 1) // 2 * (x // 2 + 1) < a * b)
return t - 1
def main():
Q = int(input())
for _ in range(Q):
a, b = map(int, input().split())
print(solve(a, b))
if __name__ == '__main__':
main()
```
Yes
| 100,172 | [
0.47705078125,
0.050384521484375,
-0.259521484375,
0.253173828125,
-0.347900390625,
-0.239501953125,
-0.2000732421875,
0.1326904296875,
-0.138671875,
0.98291015625,
0.490478515625,
0.0765380859375,
0.05419921875,
-0.86083984375,
-0.6640625,
0.062744140625,
-0.57958984375,
-0.850097... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
10^{10^{10}} participants, including Takahashi, competed in two programming contests. In each contest, all participants had distinct ranks from first through 10^{10^{10}}-th.
The score of a participant is the product of his/her ranks in the two contests.
Process the following Q queries:
* In the i-th query, you are given two positive integers A_i and B_i. Assuming that Takahashi was ranked A_i-th in the first contest and B_i-th in the second contest, find the maximum possible number of participants whose scores are smaller than Takahashi's.
Constraints
* 1 \leq Q \leq 100
* 1\leq A_i,B_i\leq 10^9(1\leq i\leq Q)
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
Q
A_1 B_1
:
A_Q B_Q
Output
For each query, print the maximum possible number of participants whose scores are smaller than Takahashi's.
Example
Input
8
1 4
10 5
3 3
4 11
8 9
22 40
8 36
314159265 358979323
Output
1
12
4
11
14
57
31
671644785
Submitted Solution:
```
import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
def main():
q = int(input())
for _ in range(q):
a, b = map(int, input().split())
c = a * b - 1
rc = int(c ** 0.5)
ans = rc * 2 - 2
if c // rc == rc:
ans -= 1
if a > rc:
y = rc // a
if y == 0:
ans += 1
else:
x = rc // y
if x != a or (c // a == c // (a - 1)):
ans += 1
if b > rc:
y = rc // b
if y == 0:
ans += 1
else:
x = rc // y
if x != b or (c // b == c // (b - 1)):
ans += 1
print(ans)
main()
```
No
| 100,173 | [
0.440185546875,
0.11016845703125,
-0.220703125,
0.28662109375,
-0.346435546875,
-0.1749267578125,
-0.140869140625,
0.0180511474609375,
-0.1597900390625,
0.99072265625,
0.5322265625,
0.140869140625,
0.037689208984375,
-0.7978515625,
-0.64599609375,
0.0780029296875,
-0.6005859375,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
10^{10^{10}} participants, including Takahashi, competed in two programming contests. In each contest, all participants had distinct ranks from first through 10^{10^{10}}-th.
The score of a participant is the product of his/her ranks in the two contests.
Process the following Q queries:
* In the i-th query, you are given two positive integers A_i and B_i. Assuming that Takahashi was ranked A_i-th in the first contest and B_i-th in the second contest, find the maximum possible number of participants whose scores are smaller than Takahashi's.
Constraints
* 1 \leq Q \leq 100
* 1\leq A_i,B_i\leq 10^9(1\leq i\leq Q)
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
Q
A_1 B_1
:
A_Q B_Q
Output
For each query, print the maximum possible number of participants whose scores are smaller than Takahashi's.
Example
Input
8
1 4
10 5
3 3
4 11
8 9
22 40
8 36
314159265 358979323
Output
1
12
4
11
14
57
31
671644785
Submitted Solution:
```
q=int(input())
a=[0 for i in range(q)]
b=[0 for i in range(q)]
for i in range(q):
a[i],b[i]=list(map(int,input().split()))
for i in range(q):
result=0
mul=a[i]*b[i]-1
aa=int(mul**(1/2))
result=aa*2
if aa==int(mul/aa):
result-=1
if aa>a[i]:
result-=1
if aa>b[i]:
result-=1
if aa<=a[i] and int(mul/a[i])*(a[i]+1)>mul and int(mul/a[i]+1)*(a[i]-1)<=mul:
result-=1
if aa<=b[i] and int(mul/b[i])*(b[i]+1)>mul and int(mul/b[i]+1)*(b[i]-1)<=mul:
result-=1
print(result)
```
No
| 100,174 | [
0.4453125,
0.044830322265625,
-0.326171875,
0.3291015625,
-0.412841796875,
-0.2108154296875,
-0.139404296875,
0.1561279296875,
-0.15478515625,
0.955078125,
0.452880859375,
0.12481689453125,
0.058929443359375,
-0.83056640625,
-0.630859375,
0.11907958984375,
-0.56298828125,
-0.877441... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
10^{10^{10}} participants, including Takahashi, competed in two programming contests. In each contest, all participants had distinct ranks from first through 10^{10^{10}}-th.
The score of a participant is the product of his/her ranks in the two contests.
Process the following Q queries:
* In the i-th query, you are given two positive integers A_i and B_i. Assuming that Takahashi was ranked A_i-th in the first contest and B_i-th in the second contest, find the maximum possible number of participants whose scores are smaller than Takahashi's.
Constraints
* 1 \leq Q \leq 100
* 1\leq A_i,B_i\leq 10^9(1\leq i\leq Q)
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
Q
A_1 B_1
:
A_Q B_Q
Output
For each query, print the maximum possible number of participants whose scores are smaller than Takahashi's.
Example
Input
8
1 4
10 5
3 3
4 11
8 9
22 40
8 36
314159265 358979323
Output
1
12
4
11
14
57
31
671644785
Submitted Solution:
```
#!/usr/bin/env python3
import math
def main():
Q = int(input())
A = []
B = []
for i in range(Q):
na = list(map(int, input().split()))
A.append(na[0])
B.append(na[1])
for i in range(Q):
a, b = A[i], B[i]
if a == b:
print(a * 2 - 2)
continue
c = a * b
d = int(math.sqrt(c - 1))
if d * (d + 1) < c:
print(d * 2 - 1)
else:
print(d * 2 - 2)
if __name__ == '__main__':
main()
```
No
| 100,175 | [
0.474609375,
0.0806884765625,
-0.33740234375,
0.31396484375,
-0.401611328125,
-0.181884765625,
-0.1195068359375,
0.179443359375,
-0.1710205078125,
1.0048828125,
0.4296875,
0.15087890625,
0.091796875,
-0.76806640625,
-0.64501953125,
0.1373291015625,
-0.6142578125,
-0.9443359375,
-... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
10^{10^{10}} participants, including Takahashi, competed in two programming contests. In each contest, all participants had distinct ranks from first through 10^{10^{10}}-th.
The score of a participant is the product of his/her ranks in the two contests.
Process the following Q queries:
* In the i-th query, you are given two positive integers A_i and B_i. Assuming that Takahashi was ranked A_i-th in the first contest and B_i-th in the second contest, find the maximum possible number of participants whose scores are smaller than Takahashi's.
Constraints
* 1 \leq Q \leq 100
* 1\leq A_i,B_i\leq 10^9(1\leq i\leq Q)
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
Q
A_1 B_1
:
A_Q B_Q
Output
For each query, print the maximum possible number of participants whose scores are smaller than Takahashi's.
Example
Input
8
1 4
10 5
3 3
4 11
8 9
22 40
8 36
314159265 358979323
Output
1
12
4
11
14
57
31
671644785
Submitted Solution:
```
import math
def near_sqrt(a,b):
c = a * b
d = math.floor(math.sqrt(c))
if d*(d+1) <= c:
return d
else:
return (d-1)
q = int(input())
for i in range(q):
a,b = map(int, input().split())
c = near_sqrt(a,b)
if (a*b)%(c+1) == 0:
print(math.floor((a*b)/(c+1))+c-2)
else:
print(math.floor((a*b)/(c+1))+c-1)
```
No
| 100,176 | [
0.478271484375,
0.1383056640625,
-0.324951171875,
0.30517578125,
-0.3916015625,
-0.13134765625,
-0.14111328125,
0.14208984375,
-0.1324462890625,
0.98876953125,
0.4814453125,
0.1419677734375,
0.061614990234375,
-0.81640625,
-0.61962890625,
0.1905517578125,
-0.57958984375,
-0.9189453... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Now Vasya is taking an exam in mathematics. In order to get a good mark, Vasya needs to guess the matrix that the teacher has constructed!
Vasya knows that the matrix consists of n rows and m columns. For each row, he knows the xor (bitwise excluding or) of the elements in this row. The sequence a1, a2, ..., an denotes the xor of elements in rows with indices 1, 2, ..., n, respectively. Similarly, for each column, he knows the xor of the elements in this column. The sequence b1, b2, ..., bm denotes the xor of elements in columns with indices 1, 2, ..., m, respectively.
Help Vasya! Find a matrix satisfying the given constraints or tell him that there is no suitable matrix.
Input
The first line contains two numbers n and m (2 ≤ n, m ≤ 100) — the dimensions of the matrix.
The second line contains n numbers a1, a2, ..., an (0 ≤ ai ≤ 109), where ai is the xor of all elements in row i.
The third line contains m numbers b1, b2, ..., bm (0 ≤ bi ≤ 109), where bi is the xor of all elements in column i.
Output
If there is no matrix satisfying the given constraints in the first line, output "NO".
Otherwise, on the first line output "YES", and then n rows of m numbers in each ci1, ci2, ... , cim (0 ≤ cij ≤ 2·109) — the description of the matrix.
If there are several suitable matrices, it is allowed to print any of them.
Examples
Input
2 3
2 9
5 3 13
Output
YES
3 4 5
6 7 8
Input
3 3
1 7 6
2 15 12
Output
NO
Submitted Solution:
```
n,m = list(map(int,input().split(' ')))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
aa = 0
bb = 0
cc = 0
for i in range(max(n,m)):
if i == n-1:
cc = aa
if i<n:
aa ^= a[i]
if i<m:
bb ^= b[i]
if aa != bb:
print('NO')
else:
print('YES')
for i in range(n-1):
for j in range(m):
if j < m-1:
print('0',end=' ')
else:
print(a[i])
for j in range(m-1):
print(b[j], end=' ')
print(cc^b[-1])
```
Yes
| 100,327 | [
0.437255859375,
0.2017822265625,
-0.043731689453125,
-0.0400390625,
-0.41357421875,
-0.367919921875,
-0.125732421875,
-0.0067138671875,
-0.234375,
0.87353515625,
0.58154296875,
0.357421875,
-0.0640869140625,
-0.830078125,
-0.3330078125,
-0.031494140625,
-0.3232421875,
-0.5405273437... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Now Vasya is taking an exam in mathematics. In order to get a good mark, Vasya needs to guess the matrix that the teacher has constructed!
Vasya knows that the matrix consists of n rows and m columns. For each row, he knows the xor (bitwise excluding or) of the elements in this row. The sequence a1, a2, ..., an denotes the xor of elements in rows with indices 1, 2, ..., n, respectively. Similarly, for each column, he knows the xor of the elements in this column. The sequence b1, b2, ..., bm denotes the xor of elements in columns with indices 1, 2, ..., m, respectively.
Help Vasya! Find a matrix satisfying the given constraints or tell him that there is no suitable matrix.
Input
The first line contains two numbers n and m (2 ≤ n, m ≤ 100) — the dimensions of the matrix.
The second line contains n numbers a1, a2, ..., an (0 ≤ ai ≤ 109), where ai is the xor of all elements in row i.
The third line contains m numbers b1, b2, ..., bm (0 ≤ bi ≤ 109), where bi is the xor of all elements in column i.
Output
If there is no matrix satisfying the given constraints in the first line, output "NO".
Otherwise, on the first line output "YES", and then n rows of m numbers in each ci1, ci2, ... , cim (0 ≤ cij ≤ 2·109) — the description of the matrix.
If there are several suitable matrices, it is allowed to print any of them.
Examples
Input
2 3
2 9
5 3 13
Output
YES
3 4 5
6 7 8
Input
3 3
1 7 6
2 15 12
Output
NO
Submitted Solution:
```
n, m = map(int, input().split())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
ans = [[int(0)for i in range(m)] for j in range(n)]
for i in range(n):
ans[i][0] = a[i]
for i in range(m):
ans[0][i] = b[i]
ans[0][0] = 0
kekw = b[0]
for i in range(1,n):
kekw ^= a[i]
kekw1 = a[0]
for j in range(1,m):
kekw1 ^= b[j]
if kekw != kekw1:
print("NO")
else:
ans[0][0] = kekw
print("YES")
for i in range(n):
print(*ans[i])
```
Yes
| 100,328 | [
0.426513671875,
0.1854248046875,
-0.06494140625,
-0.0296173095703125,
-0.397705078125,
-0.362060546875,
-0.1334228515625,
-0.009735107421875,
-0.2313232421875,
0.88623046875,
0.5673828125,
0.345703125,
-0.069580078125,
-0.83642578125,
-0.33251953125,
-0.04443359375,
-0.318359375,
-... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Now Vasya is taking an exam in mathematics. In order to get a good mark, Vasya needs to guess the matrix that the teacher has constructed!
Vasya knows that the matrix consists of n rows and m columns. For each row, he knows the xor (bitwise excluding or) of the elements in this row. The sequence a1, a2, ..., an denotes the xor of elements in rows with indices 1, 2, ..., n, respectively. Similarly, for each column, he knows the xor of the elements in this column. The sequence b1, b2, ..., bm denotes the xor of elements in columns with indices 1, 2, ..., m, respectively.
Help Vasya! Find a matrix satisfying the given constraints or tell him that there is no suitable matrix.
Input
The first line contains two numbers n and m (2 ≤ n, m ≤ 100) — the dimensions of the matrix.
The second line contains n numbers a1, a2, ..., an (0 ≤ ai ≤ 109), where ai is the xor of all elements in row i.
The third line contains m numbers b1, b2, ..., bm (0 ≤ bi ≤ 109), where bi is the xor of all elements in column i.
Output
If there is no matrix satisfying the given constraints in the first line, output "NO".
Otherwise, on the first line output "YES", and then n rows of m numbers in each ci1, ci2, ... , cim (0 ≤ cij ≤ 2·109) — the description of the matrix.
If there are several suitable matrices, it is allowed to print any of them.
Examples
Input
2 3
2 9
5 3 13
Output
YES
3 4 5
6 7 8
Input
3 3
1 7 6
2 15 12
Output
NO
Submitted Solution:
```
I=input
P=print
R=range
I()
a=[int(i)for i in I().split()]
b=[int(i)for i in I().split()]
n=len(a)
m=len(b)
x=b[-1]
for i in R(n-1):x^=a[i]
y=a[-1]
for i in R(m-1):y^=b[i]
if x!=y:P("NO");exit()
P("YES")
for i in R(n-1):P("0 "*(m-1)+str(a[i]))
for i in R(m-1):P(b[i],end=" ")
P(x)
```
Yes
| 100,329 | [
0.44482421875,
0.1639404296875,
-0.059112548828125,
-0.0086517333984375,
-0.38330078125,
-0.3740234375,
-0.0860595703125,
-0.0228424072265625,
-0.2020263671875,
0.87890625,
0.55322265625,
0.31787109375,
-0.08941650390625,
-0.826171875,
-0.361083984375,
-0.057098388671875,
-0.31958007... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Now Vasya is taking an exam in mathematics. In order to get a good mark, Vasya needs to guess the matrix that the teacher has constructed!
Vasya knows that the matrix consists of n rows and m columns. For each row, he knows the xor (bitwise excluding or) of the elements in this row. The sequence a1, a2, ..., an denotes the xor of elements in rows with indices 1, 2, ..., n, respectively. Similarly, for each column, he knows the xor of the elements in this column. The sequence b1, b2, ..., bm denotes the xor of elements in columns with indices 1, 2, ..., m, respectively.
Help Vasya! Find a matrix satisfying the given constraints or tell him that there is no suitable matrix.
Input
The first line contains two numbers n and m (2 ≤ n, m ≤ 100) — the dimensions of the matrix.
The second line contains n numbers a1, a2, ..., an (0 ≤ ai ≤ 109), where ai is the xor of all elements in row i.
The third line contains m numbers b1, b2, ..., bm (0 ≤ bi ≤ 109), where bi is the xor of all elements in column i.
Output
If there is no matrix satisfying the given constraints in the first line, output "NO".
Otherwise, on the first line output "YES", and then n rows of m numbers in each ci1, ci2, ... , cim (0 ≤ cij ≤ 2·109) — the description of the matrix.
If there are several suitable matrices, it is allowed to print any of them.
Examples
Input
2 3
2 9
5 3 13
Output
YES
3 4 5
6 7 8
Input
3 3
1 7 6
2 15 12
Output
NO
Submitted Solution:
```
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
x1,x2 = a[0],b[0]
for i in range(1,n):
x1 ^= a[i]
for i in range(1,m):
x2 ^= b[i]
if x1!=x2:
print ("NO")
exit()
ans = [[0 for i in range(m)] for j in range(n)]
ans[0][0] = a[0]^x2^b[0]
for i in range(1,m):
ans[0][i] = b[i]
for i in range(1,n):
ans[i][0] = a[i]
print ("YES")
for i in range(n):
print (*ans[i])
```
Yes
| 100,330 | [
0.447021484375,
0.19140625,
-0.06683349609375,
-0.02874755859375,
-0.39013671875,
-0.37353515625,
-0.1436767578125,
-0.0040130615234375,
-0.2396240234375,
0.89794921875,
0.56494140625,
0.364990234375,
-0.051788330078125,
-0.82373046875,
-0.3232421875,
-0.042999267578125,
-0.314453125... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Now Vasya is taking an exam in mathematics. In order to get a good mark, Vasya needs to guess the matrix that the teacher has constructed!
Vasya knows that the matrix consists of n rows and m columns. For each row, he knows the xor (bitwise excluding or) of the elements in this row. The sequence a1, a2, ..., an denotes the xor of elements in rows with indices 1, 2, ..., n, respectively. Similarly, for each column, he knows the xor of the elements in this column. The sequence b1, b2, ..., bm denotes the xor of elements in columns with indices 1, 2, ..., m, respectively.
Help Vasya! Find a matrix satisfying the given constraints or tell him that there is no suitable matrix.
Input
The first line contains two numbers n and m (2 ≤ n, m ≤ 100) — the dimensions of the matrix.
The second line contains n numbers a1, a2, ..., an (0 ≤ ai ≤ 109), where ai is the xor of all elements in row i.
The third line contains m numbers b1, b2, ..., bm (0 ≤ bi ≤ 109), where bi is the xor of all elements in column i.
Output
If there is no matrix satisfying the given constraints in the first line, output "NO".
Otherwise, on the first line output "YES", and then n rows of m numbers in each ci1, ci2, ... , cim (0 ≤ cij ≤ 2·109) — the description of the matrix.
If there are several suitable matrices, it is allowed to print any of them.
Examples
Input
2 3
2 9
5 3 13
Output
YES
3 4 5
6 7 8
Input
3 3
1 7 6
2 15 12
Output
NO
Submitted Solution:
```
def getXor(a):
ans = 0
for x in a:
ans |= x
return ans
def main():
n, m = map(int, input().split(' '))
a = [x for x in map(int, input().split(' '))]
b = [x for x in map(int, input().split(' '))]
rxor = getXor(a)
cxor = getXor(b)
if rxor != cxor:
print('NO')
return
print('YES')
for i in range(n-1):
print(a[i], end='')
for j in range(1, m):
print(' 0', end='')
print()
print(b[0] | getXor(a[:-1]), end='')
for j in range(1, m):
print(' %d' % b[i], end ='')
print()
if __name__ == '__main__':
main()
```
No
| 100,331 | [
0.486083984375,
0.1702880859375,
-0.06201171875,
-0.03204345703125,
-0.406005859375,
-0.371337890625,
-0.1031494140625,
-0.011993408203125,
-0.2017822265625,
0.87939453125,
0.607421875,
0.281982421875,
-0.092041015625,
-0.81982421875,
-0.38037109375,
-0.053802490234375,
-0.3146972656... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Now Vasya is taking an exam in mathematics. In order to get a good mark, Vasya needs to guess the matrix that the teacher has constructed!
Vasya knows that the matrix consists of n rows and m columns. For each row, he knows the xor (bitwise excluding or) of the elements in this row. The sequence a1, a2, ..., an denotes the xor of elements in rows with indices 1, 2, ..., n, respectively. Similarly, for each column, he knows the xor of the elements in this column. The sequence b1, b2, ..., bm denotes the xor of elements in columns with indices 1, 2, ..., m, respectively.
Help Vasya! Find a matrix satisfying the given constraints or tell him that there is no suitable matrix.
Input
The first line contains two numbers n and m (2 ≤ n, m ≤ 100) — the dimensions of the matrix.
The second line contains n numbers a1, a2, ..., an (0 ≤ ai ≤ 109), where ai is the xor of all elements in row i.
The third line contains m numbers b1, b2, ..., bm (0 ≤ bi ≤ 109), where bi is the xor of all elements in column i.
Output
If there is no matrix satisfying the given constraints in the first line, output "NO".
Otherwise, on the first line output "YES", and then n rows of m numbers in each ci1, ci2, ... , cim (0 ≤ cij ≤ 2·109) — the description of the matrix.
If there are several suitable matrices, it is allowed to print any of them.
Examples
Input
2 3
2 9
5 3 13
Output
YES
3 4 5
6 7 8
Input
3 3
1 7 6
2 15 12
Output
NO
Submitted Solution:
```
def getXor(a):
ans = 0
for x in a:
ans ^= x
return ans
def main():
n, m = map(int, input().split(' '))
a = [x for x in map(int, input().split(' '))]
b = [x for x in map(int, input().split(' '))]
rxor = getXor(a)
cxor = getXor(b)
if rxor != cxor:
print('NO')
return
print('YES')
for i in range(n-1):
print(a[i], end='')
for j in range(1, m):
print(' 0', end='')
print()
print(b[0] ^ getXor(a[:-1]), end='')
for j in range(1, m):
print(' %d' % b[i], end ='')
print()
if __name__ == '__main__':
main()
```
No
| 100,332 | [
0.486572265625,
0.17529296875,
-0.0579833984375,
-0.03076171875,
-0.402587890625,
-0.37255859375,
-0.09735107421875,
-0.01041412353515625,
-0.2020263671875,
0.8798828125,
0.6171875,
0.27880859375,
-0.0904541015625,
-0.81884765625,
-0.381103515625,
-0.04974365234375,
-0.30615234375,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Now Vasya is taking an exam in mathematics. In order to get a good mark, Vasya needs to guess the matrix that the teacher has constructed!
Vasya knows that the matrix consists of n rows and m columns. For each row, he knows the xor (bitwise excluding or) of the elements in this row. The sequence a1, a2, ..., an denotes the xor of elements in rows with indices 1, 2, ..., n, respectively. Similarly, for each column, he knows the xor of the elements in this column. The sequence b1, b2, ..., bm denotes the xor of elements in columns with indices 1, 2, ..., m, respectively.
Help Vasya! Find a matrix satisfying the given constraints or tell him that there is no suitable matrix.
Input
The first line contains two numbers n and m (2 ≤ n, m ≤ 100) — the dimensions of the matrix.
The second line contains n numbers a1, a2, ..., an (0 ≤ ai ≤ 109), where ai is the xor of all elements in row i.
The third line contains m numbers b1, b2, ..., bm (0 ≤ bi ≤ 109), where bi is the xor of all elements in column i.
Output
If there is no matrix satisfying the given constraints in the first line, output "NO".
Otherwise, on the first line output "YES", and then n rows of m numbers in each ci1, ci2, ... , cim (0 ≤ cij ≤ 2·109) — the description of the matrix.
If there are several suitable matrices, it is allowed to print any of them.
Examples
Input
2 3
2 9
5 3 13
Output
YES
3 4 5
6 7 8
Input
3 3
1 7 6
2 15 12
Output
NO
Submitted Solution:
```
def getXor(a):
ans = 0
for x in a:
ans ^= x
return ans
def main():
n, m = map(int, input().split(' '))
a = [x for x in map(int, input().split(' '))]
b = [x for x in map(int, input().split(' '))]
rxor = getXor(a)
cxor = getXor(b)
if rxor != cxor:
print('NO')
return
x = [[0] * m for _ in range(n)]
x[0][0] = a[0]
for i in range(1, min(n, m)):
x[i][i-1] = b[i-1] ^ x[i-1][i-1]
x[i][i] = a[i] ^ x[i][i-1]
for i in range(m-1, n):
x[i][-1] = a[i]
for j in range(n-1, m):
x[-1][j] = b[j]
for i in range(n):
print(' '.join(map(str, x[i])))
if __name__ == '__main__':
main()
```
No
| 100,333 | [
0.486572265625,
0.17529296875,
-0.0579833984375,
-0.03076171875,
-0.402587890625,
-0.37255859375,
-0.09735107421875,
-0.01041412353515625,
-0.2020263671875,
0.8798828125,
0.6171875,
0.27880859375,
-0.0904541015625,
-0.81884765625,
-0.381103515625,
-0.04974365234375,
-0.30615234375,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Now Vasya is taking an exam in mathematics. In order to get a good mark, Vasya needs to guess the matrix that the teacher has constructed!
Vasya knows that the matrix consists of n rows and m columns. For each row, he knows the xor (bitwise excluding or) of the elements in this row. The sequence a1, a2, ..., an denotes the xor of elements in rows with indices 1, 2, ..., n, respectively. Similarly, for each column, he knows the xor of the elements in this column. The sequence b1, b2, ..., bm denotes the xor of elements in columns with indices 1, 2, ..., m, respectively.
Help Vasya! Find a matrix satisfying the given constraints or tell him that there is no suitable matrix.
Input
The first line contains two numbers n and m (2 ≤ n, m ≤ 100) — the dimensions of the matrix.
The second line contains n numbers a1, a2, ..., an (0 ≤ ai ≤ 109), where ai is the xor of all elements in row i.
The third line contains m numbers b1, b2, ..., bm (0 ≤ bi ≤ 109), where bi is the xor of all elements in column i.
Output
If there is no matrix satisfying the given constraints in the first line, output "NO".
Otherwise, on the first line output "YES", and then n rows of m numbers in each ci1, ci2, ... , cim (0 ≤ cij ≤ 2·109) — the description of the matrix.
If there are several suitable matrices, it is allowed to print any of them.
Examples
Input
2 3
2 9
5 3 13
Output
YES
3 4 5
6 7 8
Input
3 3
1 7 6
2 15 12
Output
NO
Submitted Solution:
```
USE_STDIO = False
if not USE_STDIO:
try: import mypc
except: pass
def getXor(a):
ans = 0
for x in a:
ans ^= x
return ans
def main():
n, m = map(int, input().split(' '))
a = [x for x in map(int, input().split(' '))]
b = [x for x in map(int, input().split(' '))]
rxor = getXor(a)
cxor = getXor(b)
if rxor != cxor:
print('NO')
return
x = [[0] * m for _ in range(n)]
if n >= m:
x[0][0] = a[0]
for i in range(1, m):
x[i][i-1] = b[i-1] ^ x[i-1][i-1]
x[i][i] = a[i] ^ x[i][i-1]
for i in range(m, n):
x[i][-1] = a[i]
else:
x[0][0] = b[0]
for i in range(1, n):
x[i-1][i] = a[i-1] ^ x[i-1][i-1]
x[i][i] = b[i] ^ x[i-1][i]
for i in range(m, n):
x[-1][i] = b[i]
print('YES')
for i in range(n):
print(' '.join(map(str, x[i])))
if __name__ == '__main__':
main()
```
No
| 100,334 | [
0.432373046875,
0.1923828125,
-0.00618743896484375,
0.00559234619140625,
-0.363037109375,
-0.37451171875,
-0.1583251953125,
-0.0631103515625,
-0.233154296875,
0.8828125,
0.5595703125,
0.315673828125,
-0.0960693359375,
-0.83740234375,
-0.375,
-0.10107421875,
-0.34326171875,
-0.53271... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
"This problem is rubbish! There is not statement, and there are only 5 test cases. The problemsetter took liberties with this problem!" — people complained in the comments to one round on Codeforces. And even more... No, wait, the checker for the problem was alright, that's a mercy.
Input
The only line of the input contains an integer between 1 and 5, inclusive. All tests for this problem are different. The contents of the test case doesn't need to be equal to its index.
Output
The only line of the output contains an integer between 1 and 3, inclusive.
Examples
Note
This problem has no samples, since there so few test cases.
Tags: *special, brute force
Correct Solution:
```
"""====================================================================================
====================================================================================
___ _______ ___ _______ ___ ___
| /\ | | \ | | / | | | | |\ /|
| / \ | | \ | | / | | | | | \ / |
|___ /____\ | | \ | |/ |___| | | | \/ |
| / \ | | / | |\ |\ | | | |
| / \ | | / | | \ | \ | | | |
___|/ \___|___ |___/ ___|___ | \ | \ |___| | |
====================================================================================
====================================================================================
"""
# ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥
a = int(input())
if a==3:
print("1")
if a==1:
print("2")
if a==4:
print("2")
if a==2:
print("3")
if a==5:
print("1")
# ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥
"""====================================================================================
====================================================================================
___ _______ ___ _______ ___ ___
| /\ | | \ | | / | | | | |\ /|
| / \ | | \ | | / | | | | | \ / |
|___ /____\ | | \ | |/ |___| | | | \/ |
| / \ | | / | |\ |\ | | | |
| / \ | | / | | \ | \ | | | |
___|/ \___|___ |___/ ___|___ | \ | \ |___| | |
====================================================================================
====================================================================================
"""
```
| 100,597 | [
0.17919921875,
-0.008941650390625,
0.21142578125,
0.1585693359375,
-0.7451171875,
-0.6171875,
0.0723876953125,
0.166015625,
0.321044921875,
1.029296875,
0.60986328125,
-0.2001953125,
0.207763671875,
-0.75048828125,
-0.40576171875,
-0.1641845703125,
-0.303955078125,
-0.775390625,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
"This problem is rubbish! There is not statement, and there are only 5 test cases. The problemsetter took liberties with this problem!" — people complained in the comments to one round on Codeforces. And even more... No, wait, the checker for the problem was alright, that's a mercy.
Input
The only line of the input contains an integer between 1 and 5, inclusive. All tests for this problem are different. The contents of the test case doesn't need to be equal to its index.
Output
The only line of the output contains an integer between 1 and 3, inclusive.
Examples
Note
This problem has no samples, since there so few test cases.
Submitted Solution:
```
__author__ = 'MARI'
def time():
while True:
pass
def bla(a):
return 2 / a
def main():
a = int(input())
if a == 1:#2
print(3)
if a == 2:
bla(0)
if a == 3:#1
print(1)
if a == 4:
print(2)
if a == 5:
time()
if __name__ == '__main__':
import sys
argv = sys.argv
main()
```
No
| 100,602 | [
0.54248046875,
0.16162109375,
-0.029022216796875,
0.0406494140625,
-0.78466796875,
-0.54345703125,
-0.029937744140625,
0.27001953125,
-0.016510009765625,
1.0576171875,
0.446044921875,
-0.33837890625,
0.1739501953125,
-1.078125,
-0.69482421875,
-0.1318359375,
-0.372314453125,
-0.582... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
"This problem is rubbish! There is not statement, and there are only 5 test cases. The problemsetter took liberties with this problem!" — people complained in the comments to one round on Codeforces. And even more... No, wait, the checker for the problem was alright, that's a mercy.
Input
The only line of the input contains an integer between 1 and 5, inclusive. All tests for this problem are different. The contents of the test case doesn't need to be equal to its index.
Output
The only line of the output contains an integer between 1 and 3, inclusive.
Examples
Note
This problem has no samples, since there so few test cases.
Submitted Solution:
```
print([1,1,2,1,1,1][int(input())])
#
#
#
#
#
#
#
#
#
##############################
```
No
| 100,603 | [
0.1573486328125,
0.01528167724609375,
-0.08642578125,
-0.0323486328125,
-0.8994140625,
-0.59228515625,
-0.0060882568359375,
0.28515625,
0.1273193359375,
1.0205078125,
0.401611328125,
-0.302978515625,
-0.0013685226440429688,
-0.82080078125,
-0.568359375,
-0.274169921875,
-0.2998046875... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As the guys fried the radio station facilities, the school principal gave them tasks as a punishment. Dustin's task was to add comments to nginx configuration for school's website. The school has n servers. Each server has a name and an ip (names aren't necessarily unique, but ips are). Dustin knows the ip and name of each server. For simplicity, we'll assume that an nginx command is of form "command ip;" where command is a string consisting of English lowercase letter only, and ip is the ip of one of school servers.
<image>
Each ip is of form "a.b.c.d" where a, b, c and d are non-negative integers less than or equal to 255 (with no leading zeros). The nginx configuration file Dustin has to add comments to has m commands. Nobody ever memorizes the ips of servers, so to understand the configuration better, Dustin has to comment the name of server that the ip belongs to at the end of each line (after each command). More formally, if a line is "command ip;" Dustin has to replace it with "command ip; #name" where name is the name of the server with ip equal to ip.
Dustin doesn't know anything about nginx, so he panicked again and his friends asked you to do his task for him.
Input
The first line of input contains two integers n and m (1 ≤ n, m ≤ 1000).
The next n lines contain the names and ips of the servers. Each line contains a string name, name of the server and a string ip, ip of the server, separated by space (1 ≤ |name| ≤ 10, name only consists of English lowercase letters). It is guaranteed that all ip are distinct.
The next m lines contain the commands in the configuration file. Each line is of form "command ip;" (1 ≤ |command| ≤ 10, command only consists of English lowercase letters). It is guaranteed that ip belongs to one of the n school servers.
Output
Print m lines, the commands in the configuration file after Dustin did his task.
Examples
Input
2 2
main 192.168.0.2
replica 192.168.0.1
block 192.168.0.1;
proxy 192.168.0.2;
Output
block 192.168.0.1; #replica
proxy 192.168.0.2; #main
Input
3 5
google 8.8.8.8
codeforces 212.193.33.27
server 138.197.64.57
redirect 138.197.64.57;
block 8.8.8.8;
cf 212.193.33.27;
unblock 8.8.8.8;
check 138.197.64.57;
Output
redirect 138.197.64.57; #server
block 8.8.8.8; #google
cf 212.193.33.27; #codeforces
unblock 8.8.8.8; #google
check 138.197.64.57; #server
Submitted Solution:
```
n,m=[int(x) for x in input().split()]
arr=[]
for _ in range(n):
name,ip=input().split()
arr.append((name,ip))
for _ in range(m):
name,ip=input().split()
ip1=ip[:-1]
for i,j in arr:
if ip1==j:
print(name,ip,'#'+i)
```
Yes
| 100,894 | [
0.35986328125,
-0.01189422607421875,
-0.3193359375,
0.005397796630859375,
-0.53662109375,
-0.333740234375,
0.077392578125,
0.322509765625,
0.2357177734375,
1.4609375,
0.6611328125,
0.25048828125,
0.478759765625,
-0.8681640625,
-0.6240234375,
-0.192626953125,
-0.81494140625,
-0.7539... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As the guys fried the radio station facilities, the school principal gave them tasks as a punishment. Dustin's task was to add comments to nginx configuration for school's website. The school has n servers. Each server has a name and an ip (names aren't necessarily unique, but ips are). Dustin knows the ip and name of each server. For simplicity, we'll assume that an nginx command is of form "command ip;" where command is a string consisting of English lowercase letter only, and ip is the ip of one of school servers.
<image>
Each ip is of form "a.b.c.d" where a, b, c and d are non-negative integers less than or equal to 255 (with no leading zeros). The nginx configuration file Dustin has to add comments to has m commands. Nobody ever memorizes the ips of servers, so to understand the configuration better, Dustin has to comment the name of server that the ip belongs to at the end of each line (after each command). More formally, if a line is "command ip;" Dustin has to replace it with "command ip; #name" where name is the name of the server with ip equal to ip.
Dustin doesn't know anything about nginx, so he panicked again and his friends asked you to do his task for him.
Input
The first line of input contains two integers n and m (1 ≤ n, m ≤ 1000).
The next n lines contain the names and ips of the servers. Each line contains a string name, name of the server and a string ip, ip of the server, separated by space (1 ≤ |name| ≤ 10, name only consists of English lowercase letters). It is guaranteed that all ip are distinct.
The next m lines contain the commands in the configuration file. Each line is of form "command ip;" (1 ≤ |command| ≤ 10, command only consists of English lowercase letters). It is guaranteed that ip belongs to one of the n school servers.
Output
Print m lines, the commands in the configuration file after Dustin did his task.
Examples
Input
2 2
main 192.168.0.2
replica 192.168.0.1
block 192.168.0.1;
proxy 192.168.0.2;
Output
block 192.168.0.1; #replica
proxy 192.168.0.2; #main
Input
3 5
google 8.8.8.8
codeforces 212.193.33.27
server 138.197.64.57
redirect 138.197.64.57;
block 8.8.8.8;
cf 212.193.33.27;
unblock 8.8.8.8;
check 138.197.64.57;
Output
redirect 138.197.64.57; #server
block 8.8.8.8; #google
cf 212.193.33.27; #codeforces
unblock 8.8.8.8; #google
check 138.197.64.57; #server
Submitted Solution:
```
n, m = input().split()
n = int(n)
m = int(m)
arrayStringName = []
arrayStringIp = []
for _ in range(n):
name, ip = input().split()
name = str(name)
ip = str(ip)
arrayStringName.append(name)
arrayStringIp.append(ip)
for i in range(m):
ip = ""
commandIp = str(input())
for j in range(len(commandIp)):
if commandIp[j].isnumeric() == True or commandIp[j] == ".":
ip += commandIp[j]
getIndexInArray = arrayStringIp.index(ip)
print(commandIp + " #" + arrayStringName[getIndexInArray])
```
Yes
| 100,895 | [
0.35986328125,
-0.01189422607421875,
-0.3193359375,
0.005397796630859375,
-0.53662109375,
-0.333740234375,
0.077392578125,
0.322509765625,
0.2357177734375,
1.4609375,
0.6611328125,
0.25048828125,
0.478759765625,
-0.8681640625,
-0.6240234375,
-0.192626953125,
-0.81494140625,
-0.7539... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As the guys fried the radio station facilities, the school principal gave them tasks as a punishment. Dustin's task was to add comments to nginx configuration for school's website. The school has n servers. Each server has a name and an ip (names aren't necessarily unique, but ips are). Dustin knows the ip and name of each server. For simplicity, we'll assume that an nginx command is of form "command ip;" where command is a string consisting of English lowercase letter only, and ip is the ip of one of school servers.
<image>
Each ip is of form "a.b.c.d" where a, b, c and d are non-negative integers less than or equal to 255 (with no leading zeros). The nginx configuration file Dustin has to add comments to has m commands. Nobody ever memorizes the ips of servers, so to understand the configuration better, Dustin has to comment the name of server that the ip belongs to at the end of each line (after each command). More formally, if a line is "command ip;" Dustin has to replace it with "command ip; #name" where name is the name of the server with ip equal to ip.
Dustin doesn't know anything about nginx, so he panicked again and his friends asked you to do his task for him.
Input
The first line of input contains two integers n and m (1 ≤ n, m ≤ 1000).
The next n lines contain the names and ips of the servers. Each line contains a string name, name of the server and a string ip, ip of the server, separated by space (1 ≤ |name| ≤ 10, name only consists of English lowercase letters). It is guaranteed that all ip are distinct.
The next m lines contain the commands in the configuration file. Each line is of form "command ip;" (1 ≤ |command| ≤ 10, command only consists of English lowercase letters). It is guaranteed that ip belongs to one of the n school servers.
Output
Print m lines, the commands in the configuration file after Dustin did his task.
Examples
Input
2 2
main 192.168.0.2
replica 192.168.0.1
block 192.168.0.1;
proxy 192.168.0.2;
Output
block 192.168.0.1; #replica
proxy 192.168.0.2; #main
Input
3 5
google 8.8.8.8
codeforces 212.193.33.27
server 138.197.64.57
redirect 138.197.64.57;
block 8.8.8.8;
cf 212.193.33.27;
unblock 8.8.8.8;
check 138.197.64.57;
Output
redirect 138.197.64.57; #server
block 8.8.8.8; #google
cf 212.193.33.27; #codeforces
unblock 8.8.8.8; #google
check 138.197.64.57; #server
Submitted Solution:
```
def find(s,ip):
for i in range(len(ip)):
if ip[i]==s:
return i
return -1
n,m=map(int,input().split())
ip,ip_dict=[],[]
for i in range(n):
s1=input().split()
ip.append(s1[1])
ip_dict.append(s1[0])
for i in range(m):
s1=input()
s2=s1.split()[1]
m=find(s2[:len(s2)-1],ip)
print(s1,end='')
print(" #",end='')
print(ip_dict[m])
```
Yes
| 100,896 | [
0.35986328125,
-0.01189422607421875,
-0.3193359375,
0.005397796630859375,
-0.53662109375,
-0.333740234375,
0.077392578125,
0.322509765625,
0.2357177734375,
1.4609375,
0.6611328125,
0.25048828125,
0.478759765625,
-0.8681640625,
-0.6240234375,
-0.192626953125,
-0.81494140625,
-0.7539... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As the guys fried the radio station facilities, the school principal gave them tasks as a punishment. Dustin's task was to add comments to nginx configuration for school's website. The school has n servers. Each server has a name and an ip (names aren't necessarily unique, but ips are). Dustin knows the ip and name of each server. For simplicity, we'll assume that an nginx command is of form "command ip;" where command is a string consisting of English lowercase letter only, and ip is the ip of one of school servers.
<image>
Each ip is of form "a.b.c.d" where a, b, c and d are non-negative integers less than or equal to 255 (with no leading zeros). The nginx configuration file Dustin has to add comments to has m commands. Nobody ever memorizes the ips of servers, so to understand the configuration better, Dustin has to comment the name of server that the ip belongs to at the end of each line (after each command). More formally, if a line is "command ip;" Dustin has to replace it with "command ip; #name" where name is the name of the server with ip equal to ip.
Dustin doesn't know anything about nginx, so he panicked again and his friends asked you to do his task for him.
Input
The first line of input contains two integers n and m (1 ≤ n, m ≤ 1000).
The next n lines contain the names and ips of the servers. Each line contains a string name, name of the server and a string ip, ip of the server, separated by space (1 ≤ |name| ≤ 10, name only consists of English lowercase letters). It is guaranteed that all ip are distinct.
The next m lines contain the commands in the configuration file. Each line is of form "command ip;" (1 ≤ |command| ≤ 10, command only consists of English lowercase letters). It is guaranteed that ip belongs to one of the n school servers.
Output
Print m lines, the commands in the configuration file after Dustin did his task.
Examples
Input
2 2
main 192.168.0.2
replica 192.168.0.1
block 192.168.0.1;
proxy 192.168.0.2;
Output
block 192.168.0.1; #replica
proxy 192.168.0.2; #main
Input
3 5
google 8.8.8.8
codeforces 212.193.33.27
server 138.197.64.57
redirect 138.197.64.57;
block 8.8.8.8;
cf 212.193.33.27;
unblock 8.8.8.8;
check 138.197.64.57;
Output
redirect 138.197.64.57; #server
block 8.8.8.8; #google
cf 212.193.33.27; #codeforces
unblock 8.8.8.8; #google
check 138.197.64.57; #server
Submitted Solution:
```
n, m = list(map(int, input().strip().split()))
host = dict()
guest = dict()
for i in range(n):
name, ip = input().strip().split()
host[ip] = name
for i in range(m):
name, ip = input().strip().split()
newline = "#" + host[ip[:-1]]
print(name, ip, newline)
```
Yes
| 100,897 | [
0.35986328125,
-0.01189422607421875,
-0.3193359375,
0.005397796630859375,
-0.53662109375,
-0.333740234375,
0.077392578125,
0.322509765625,
0.2357177734375,
1.4609375,
0.6611328125,
0.25048828125,
0.478759765625,
-0.8681640625,
-0.6240234375,
-0.192626953125,
-0.81494140625,
-0.7539... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As the guys fried the radio station facilities, the school principal gave them tasks as a punishment. Dustin's task was to add comments to nginx configuration for school's website. The school has n servers. Each server has a name and an ip (names aren't necessarily unique, but ips are). Dustin knows the ip and name of each server. For simplicity, we'll assume that an nginx command is of form "command ip;" where command is a string consisting of English lowercase letter only, and ip is the ip of one of school servers.
<image>
Each ip is of form "a.b.c.d" where a, b, c and d are non-negative integers less than or equal to 255 (with no leading zeros). The nginx configuration file Dustin has to add comments to has m commands. Nobody ever memorizes the ips of servers, so to understand the configuration better, Dustin has to comment the name of server that the ip belongs to at the end of each line (after each command). More formally, if a line is "command ip;" Dustin has to replace it with "command ip; #name" where name is the name of the server with ip equal to ip.
Dustin doesn't know anything about nginx, so he panicked again and his friends asked you to do his task for him.
Input
The first line of input contains two integers n and m (1 ≤ n, m ≤ 1000).
The next n lines contain the names and ips of the servers. Each line contains a string name, name of the server and a string ip, ip of the server, separated by space (1 ≤ |name| ≤ 10, name only consists of English lowercase letters). It is guaranteed that all ip are distinct.
The next m lines contain the commands in the configuration file. Each line is of form "command ip;" (1 ≤ |command| ≤ 10, command only consists of English lowercase letters). It is guaranteed that ip belongs to one of the n school servers.
Output
Print m lines, the commands in the configuration file after Dustin did his task.
Examples
Input
2 2
main 192.168.0.2
replica 192.168.0.1
block 192.168.0.1;
proxy 192.168.0.2;
Output
block 192.168.0.1; #replica
proxy 192.168.0.2; #main
Input
3 5
google 8.8.8.8
codeforces 212.193.33.27
server 138.197.64.57
redirect 138.197.64.57;
block 8.8.8.8;
cf 212.193.33.27;
unblock 8.8.8.8;
check 138.197.64.57;
Output
redirect 138.197.64.57; #server
block 8.8.8.8; #google
cf 212.193.33.27; #codeforces
unblock 8.8.8.8; #google
check 138.197.64.57; #server
Submitted Solution:
```
a = []
a = list(map(int, input().split()))
n = a[0]
m = a[1]
mymap = {}
commands = []
for i in range(0, n):
vin = list(input().split())
mymap[(vin[1])] = vin[0]
for i in range(0, m):
command = input().strip(';')
commands.append(command)
for i in range(0, m):
command = commands[i];
ip = list(command.split())[1]
output = (commands[i]) + ' #' + (mymap[ip])
print(output)
```
No
| 100,898 | [
0.35986328125,
-0.01189422607421875,
-0.3193359375,
0.005397796630859375,
-0.53662109375,
-0.333740234375,
0.077392578125,
0.322509765625,
0.2357177734375,
1.4609375,
0.6611328125,
0.25048828125,
0.478759765625,
-0.8681640625,
-0.6240234375,
-0.192626953125,
-0.81494140625,
-0.7539... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As the guys fried the radio station facilities, the school principal gave them tasks as a punishment. Dustin's task was to add comments to nginx configuration for school's website. The school has n servers. Each server has a name and an ip (names aren't necessarily unique, but ips are). Dustin knows the ip and name of each server. For simplicity, we'll assume that an nginx command is of form "command ip;" where command is a string consisting of English lowercase letter only, and ip is the ip of one of school servers.
<image>
Each ip is of form "a.b.c.d" where a, b, c and d are non-negative integers less than or equal to 255 (with no leading zeros). The nginx configuration file Dustin has to add comments to has m commands. Nobody ever memorizes the ips of servers, so to understand the configuration better, Dustin has to comment the name of server that the ip belongs to at the end of each line (after each command). More formally, if a line is "command ip;" Dustin has to replace it with "command ip; #name" where name is the name of the server with ip equal to ip.
Dustin doesn't know anything about nginx, so he panicked again and his friends asked you to do his task for him.
Input
The first line of input contains two integers n and m (1 ≤ n, m ≤ 1000).
The next n lines contain the names and ips of the servers. Each line contains a string name, name of the server and a string ip, ip of the server, separated by space (1 ≤ |name| ≤ 10, name only consists of English lowercase letters). It is guaranteed that all ip are distinct.
The next m lines contain the commands in the configuration file. Each line is of form "command ip;" (1 ≤ |command| ≤ 10, command only consists of English lowercase letters). It is guaranteed that ip belongs to one of the n school servers.
Output
Print m lines, the commands in the configuration file after Dustin did his task.
Examples
Input
2 2
main 192.168.0.2
replica 192.168.0.1
block 192.168.0.1;
proxy 192.168.0.2;
Output
block 192.168.0.1; #replica
proxy 192.168.0.2; #main
Input
3 5
google 8.8.8.8
codeforces 212.193.33.27
server 138.197.64.57
redirect 138.197.64.57;
block 8.8.8.8;
cf 212.193.33.27;
unblock 8.8.8.8;
check 138.197.64.57;
Output
redirect 138.197.64.57; #server
block 8.8.8.8; #google
cf 212.193.33.27; #codeforces
unblock 8.8.8.8; #google
check 138.197.64.57; #server
Submitted Solution:
```
def get_keys_with_value(dic, value):
return [key for key, val in dic.items() if val == value]
n,m=map(int,input().split())
server={}
for i in range(n):
n_=list(map(str,input().split()))
server[n_[0]]=n_[1]
#print(server)
for i in range (m):
m_=list(map(str,input().split()))
m_[1] = m_[1].replace(";", "")
for j in server.values():
if j == m_[1]:
res=get_keys_with_value(server, j)
res= "".join(map(str,res))
print(f"{m_[0]} {m_[1]}; #{res}")
```
No
| 100,899 | [
0.35986328125,
-0.01189422607421875,
-0.3193359375,
0.005397796630859375,
-0.53662109375,
-0.333740234375,
0.077392578125,
0.322509765625,
0.2357177734375,
1.4609375,
0.6611328125,
0.25048828125,
0.478759765625,
-0.8681640625,
-0.6240234375,
-0.192626953125,
-0.81494140625,
-0.7539... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As the guys fried the radio station facilities, the school principal gave them tasks as a punishment. Dustin's task was to add comments to nginx configuration for school's website. The school has n servers. Each server has a name and an ip (names aren't necessarily unique, but ips are). Dustin knows the ip and name of each server. For simplicity, we'll assume that an nginx command is of form "command ip;" where command is a string consisting of English lowercase letter only, and ip is the ip of one of school servers.
<image>
Each ip is of form "a.b.c.d" where a, b, c and d are non-negative integers less than or equal to 255 (with no leading zeros). The nginx configuration file Dustin has to add comments to has m commands. Nobody ever memorizes the ips of servers, so to understand the configuration better, Dustin has to comment the name of server that the ip belongs to at the end of each line (after each command). More formally, if a line is "command ip;" Dustin has to replace it with "command ip; #name" where name is the name of the server with ip equal to ip.
Dustin doesn't know anything about nginx, so he panicked again and his friends asked you to do his task for him.
Input
The first line of input contains two integers n and m (1 ≤ n, m ≤ 1000).
The next n lines contain the names and ips of the servers. Each line contains a string name, name of the server and a string ip, ip of the server, separated by space (1 ≤ |name| ≤ 10, name only consists of English lowercase letters). It is guaranteed that all ip are distinct.
The next m lines contain the commands in the configuration file. Each line is of form "command ip;" (1 ≤ |command| ≤ 10, command only consists of English lowercase letters). It is guaranteed that ip belongs to one of the n school servers.
Output
Print m lines, the commands in the configuration file after Dustin did his task.
Examples
Input
2 2
main 192.168.0.2
replica 192.168.0.1
block 192.168.0.1;
proxy 192.168.0.2;
Output
block 192.168.0.1; #replica
proxy 192.168.0.2; #main
Input
3 5
google 8.8.8.8
codeforces 212.193.33.27
server 138.197.64.57
redirect 138.197.64.57;
block 8.8.8.8;
cf 212.193.33.27;
unblock 8.8.8.8;
check 138.197.64.57;
Output
redirect 138.197.64.57; #server
block 8.8.8.8; #google
cf 212.193.33.27; #codeforces
unblock 8.8.8.8; #google
check 138.197.64.57; #server
Submitted Solution:
```
main=dict()
replica=dict()
n,m=map(int,input().split())
for i in range(n+m):
n,p=input().split(' ')
if p[-1]==';':
replica[n]=p[:len(p)-1]
else:
main[n]=p
for j in replica:
for i in main:
if main[i]==replica[j]:
print(str(j)+' '+str(main[i])+'; #'+str(i))
```
No
| 100,900 | [
0.35986328125,
-0.01189422607421875,
-0.3193359375,
0.005397796630859375,
-0.53662109375,
-0.333740234375,
0.077392578125,
0.322509765625,
0.2357177734375,
1.4609375,
0.6611328125,
0.25048828125,
0.478759765625,
-0.8681640625,
-0.6240234375,
-0.192626953125,
-0.81494140625,
-0.7539... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As the guys fried the radio station facilities, the school principal gave them tasks as a punishment. Dustin's task was to add comments to nginx configuration for school's website. The school has n servers. Each server has a name and an ip (names aren't necessarily unique, but ips are). Dustin knows the ip and name of each server. For simplicity, we'll assume that an nginx command is of form "command ip;" where command is a string consisting of English lowercase letter only, and ip is the ip of one of school servers.
<image>
Each ip is of form "a.b.c.d" where a, b, c and d are non-negative integers less than or equal to 255 (with no leading zeros). The nginx configuration file Dustin has to add comments to has m commands. Nobody ever memorizes the ips of servers, so to understand the configuration better, Dustin has to comment the name of server that the ip belongs to at the end of each line (after each command). More formally, if a line is "command ip;" Dustin has to replace it with "command ip; #name" where name is the name of the server with ip equal to ip.
Dustin doesn't know anything about nginx, so he panicked again and his friends asked you to do his task for him.
Input
The first line of input contains two integers n and m (1 ≤ n, m ≤ 1000).
The next n lines contain the names and ips of the servers. Each line contains a string name, name of the server and a string ip, ip of the server, separated by space (1 ≤ |name| ≤ 10, name only consists of English lowercase letters). It is guaranteed that all ip are distinct.
The next m lines contain the commands in the configuration file. Each line is of form "command ip;" (1 ≤ |command| ≤ 10, command only consists of English lowercase letters). It is guaranteed that ip belongs to one of the n school servers.
Output
Print m lines, the commands in the configuration file after Dustin did his task.
Examples
Input
2 2
main 192.168.0.2
replica 192.168.0.1
block 192.168.0.1;
proxy 192.168.0.2;
Output
block 192.168.0.1; #replica
proxy 192.168.0.2; #main
Input
3 5
google 8.8.8.8
codeforces 212.193.33.27
server 138.197.64.57
redirect 138.197.64.57;
block 8.8.8.8;
cf 212.193.33.27;
unblock 8.8.8.8;
check 138.197.64.57;
Output
redirect 138.197.64.57; #server
block 8.8.8.8; #google
cf 212.193.33.27; #codeforces
unblock 8.8.8.8; #google
check 138.197.64.57; #server
Submitted Solution:
```
n,m=map(int,input().split())
d={}
while n:
k,val=map(str,input().split())
d[k]=val
n-=1
while m:
k,val=map(str,input().split())
val1=val[:len(val)-1]
for ke,va in d.items():
if va==val1:
s="#"+ke
print(k,val,s)
break
m-=1
```
No
| 100,901 | [
0.35986328125,
-0.01189422607421875,
-0.3193359375,
0.005397796630859375,
-0.53662109375,
-0.333740234375,
0.077392578125,
0.322509765625,
0.2357177734375,
1.4609375,
0.6611328125,
0.25048828125,
0.478759765625,
-0.8681640625,
-0.6240234375,
-0.192626953125,
-0.81494140625,
-0.7539... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
AtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the election: Takahashi and Aoki. The report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes. AtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i. It is known that each candidate had at least one vote when he checked the report for the first time.
Find the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time. It can be assumed that the number of votes obtained by each candidate never decreases.
Constraints
* 1≦N≦1000
* 1≦T_i,A_i≦1000 (1≦i≦N)
* T_i and A_i (1≦i≦N) are coprime.
* It is guaranteed that the correct answer is at most 10^{18}.
Input
The input is given from Standard Input in the following format:
N
T_1 A_1
T_2 A_2
:
T_N A_N
Output
Print the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.
Examples
Input
3
2 3
1 1
3 2
Output
10
Input
4
1 1
1 1
1 5
1 100
Output
101
Input
5
3 10
48 17
31 199
231 23
3 2
Output
6930
"Correct Solution:
```
n = int(input())
x, y = 1, 1
for _ in range(n):
t, a = map(int, input().split())
r = (x + t - 1) // t
s = (y + a - 1) // a
x = max(r, s) * t
y = max(r, s) * a
print(x+y)
```
| 101,064 | [
0.5595703125,
0.39599609375,
-0.316162109375,
0.163330078125,
-0.57275390625,
-0.40576171875,
-0.0292510986328125,
0.1370849609375,
0.164794921875,
0.86767578125,
0.3779296875,
-0.32080078125,
-0.0303497314453125,
-0.498046875,
-0.63134765625,
-0.0161285400390625,
-0.28759765625,
-... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
AtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the election: Takahashi and Aoki. The report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes. AtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i. It is known that each candidate had at least one vote when he checked the report for the first time.
Find the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time. It can be assumed that the number of votes obtained by each candidate never decreases.
Constraints
* 1≦N≦1000
* 1≦T_i,A_i≦1000 (1≦i≦N)
* T_i and A_i (1≦i≦N) are coprime.
* It is guaranteed that the correct answer is at most 10^{18}.
Input
The input is given from Standard Input in the following format:
N
T_1 A_1
T_2 A_2
:
T_N A_N
Output
Print the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.
Examples
Input
3
2 3
1 1
3 2
Output
10
Input
4
1 1
1 1
1 5
1 100
Output
101
Input
5
3 10
48 17
31 199
231 23
3 2
Output
6930
"Correct Solution:
```
N = int(input())
a, b = 1, 1
for _ in range(N):
x, y = map(int, input().split())
mul = max(-(-a // x), -(-b // y))
a, b = mul * x, mul * y
print(a + b)
```
| 101,065 | [
0.55810546875,
0.37255859375,
-0.329833984375,
0.1552734375,
-0.578125,
-0.414794921875,
-0.046173095703125,
0.150634765625,
0.1546630859375,
0.8779296875,
0.427001953125,
-0.321533203125,
-0.01287078857421875,
-0.53125,
-0.65380859375,
0.0179443359375,
-0.271728515625,
-0.75976562... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
AtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the election: Takahashi and Aoki. The report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes. AtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i. It is known that each candidate had at least one vote when he checked the report for the first time.
Find the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time. It can be assumed that the number of votes obtained by each candidate never decreases.
Constraints
* 1≦N≦1000
* 1≦T_i,A_i≦1000 (1≦i≦N)
* T_i and A_i (1≦i≦N) are coprime.
* It is guaranteed that the correct answer is at most 10^{18}.
Input
The input is given from Standard Input in the following format:
N
T_1 A_1
T_2 A_2
:
T_N A_N
Output
Print the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.
Examples
Input
3
2 3
1 1
3 2
Output
10
Input
4
1 1
1 1
1 5
1 100
Output
101
Input
5
3 10
48 17
31 199
231 23
3 2
Output
6930
"Correct Solution:
```
N = int(input())
HT, HA = map(int, input().split())
for i in range(1,N):
T, A = map(int, input().split())
B = max( -(-HT//T), -(-HA//A) )
HT = B * T
HA = B * A
print(HT+HA)
```
| 101,066 | [
0.55615234375,
0.408447265625,
-0.308349609375,
0.11602783203125,
-0.57080078125,
-0.4072265625,
-0.029571533203125,
0.1082763671875,
0.10174560546875,
0.84619140625,
0.388916015625,
-0.279296875,
-0.018280029296875,
-0.54296875,
-0.61279296875,
0.01253509521484375,
-0.2802734375,
... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
AtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the election: Takahashi and Aoki. The report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes. AtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i. It is known that each candidate had at least one vote when he checked the report for the first time.
Find the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time. It can be assumed that the number of votes obtained by each candidate never decreases.
Constraints
* 1≦N≦1000
* 1≦T_i,A_i≦1000 (1≦i≦N)
* T_i and A_i (1≦i≦N) are coprime.
* It is guaranteed that the correct answer is at most 10^{18}.
Input
The input is given from Standard Input in the following format:
N
T_1 A_1
T_2 A_2
:
T_N A_N
Output
Print the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.
Examples
Input
3
2 3
1 1
3 2
Output
10
Input
4
1 1
1 1
1 5
1 100
Output
101
Input
5
3 10
48 17
31 199
231 23
3 2
Output
6930
"Correct Solution:
```
N=int(input())
T=[]
A=[]
for i in range(N):
t,a=map(int,input().split())
T.append(t)
A.append(a)
a=1
b=1
for i in range(N):
n=max((a+T[i]-1)//T[i], (b+A[i]-1)//A[i])
a=n*T[i]
b=n*A[i]
print(a+b)
```
| 101,067 | [
0.53466796875,
0.33154296875,
-0.283447265625,
0.1534423828125,
-0.57177734375,
-0.411865234375,
-0.01380157470703125,
0.12066650390625,
0.16162109375,
0.86376953125,
0.400634765625,
-0.34765625,
-0.06488037109375,
-0.50146484375,
-0.6455078125,
-0.0006537437438964844,
-0.29711914062... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
AtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the election: Takahashi and Aoki. The report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes. AtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i. It is known that each candidate had at least one vote when he checked the report for the first time.
Find the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time. It can be assumed that the number of votes obtained by each candidate never decreases.
Constraints
* 1≦N≦1000
* 1≦T_i,A_i≦1000 (1≦i≦N)
* T_i and A_i (1≦i≦N) are coprime.
* It is guaranteed that the correct answer is at most 10^{18}.
Input
The input is given from Standard Input in the following format:
N
T_1 A_1
T_2 A_2
:
T_N A_N
Output
Print the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.
Examples
Input
3
2 3
1 1
3 2
Output
10
Input
4
1 1
1 1
1 5
1 100
Output
101
Input
5
3 10
48 17
31 199
231 23
3 2
Output
6930
"Correct Solution:
```
t=a=1;exec('u,b=map(int,input().split());x=0-min(-t//u,-a//b);t,a=u*x,b*x;'*int(input()));print(t+a)
```
| 101,068 | [
0.5390625,
0.38671875,
-0.317626953125,
0.0906982421875,
-0.56787109375,
-0.417236328125,
-0.07061767578125,
0.138427734375,
0.1298828125,
0.8544921875,
0.420654296875,
-0.36083984375,
-0.0482177734375,
-0.52197265625,
-0.65576171875,
0.038848876953125,
-0.23193359375,
-0.705078125... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
AtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the election: Takahashi and Aoki. The report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes. AtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i. It is known that each candidate had at least one vote when he checked the report for the first time.
Find the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time. It can be assumed that the number of votes obtained by each candidate never decreases.
Constraints
* 1≦N≦1000
* 1≦T_i,A_i≦1000 (1≦i≦N)
* T_i and A_i (1≦i≦N) are coprime.
* It is guaranteed that the correct answer is at most 10^{18}.
Input
The input is given from Standard Input in the following format:
N
T_1 A_1
T_2 A_2
:
T_N A_N
Output
Print the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.
Examples
Input
3
2 3
1 1
3 2
Output
10
Input
4
1 1
1 1
1 5
1 100
Output
101
Input
5
3 10
48 17
31 199
231 23
3 2
Output
6930
"Correct Solution:
```
n = int(input())
a,b = 1,1
for _ in range(n):
x,y = map(int,input().split())
k = -min(-a//x,-b//y)
a,b = k*x,k*y
print(a+b)
```
| 101,069 | [
0.5625,
0.375244140625,
-0.353271484375,
0.127685546875,
-0.59326171875,
-0.403564453125,
-0.04986572265625,
0.150634765625,
0.16357421875,
0.8740234375,
0.4130859375,
-0.337890625,
-0.03204345703125,
-0.4951171875,
-0.66015625,
0.0103759765625,
-0.289794921875,
-0.72314453125,
-... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
AtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the election: Takahashi and Aoki. The report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes. AtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i. It is known that each candidate had at least one vote when he checked the report for the first time.
Find the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time. It can be assumed that the number of votes obtained by each candidate never decreases.
Constraints
* 1≦N≦1000
* 1≦T_i,A_i≦1000 (1≦i≦N)
* T_i and A_i (1≦i≦N) are coprime.
* It is guaranteed that the correct answer is at most 10^{18}.
Input
The input is given from Standard Input in the following format:
N
T_1 A_1
T_2 A_2
:
T_N A_N
Output
Print the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.
Examples
Input
3
2 3
1 1
3 2
Output
10
Input
4
1 1
1 1
1 5
1 100
Output
101
Input
5
3 10
48 17
31 199
231 23
3 2
Output
6930
"Correct Solution:
```
import math
N=int(input())
T=[list(map(int,input().split())) for i in range(N)]
cur=[1,1]
for i in T:
K=max(cur[0]//i[0]+(cur[0]%i[0]!=0),cur[1]//i[1]+(cur[1]%i[1]!=0))
cur=[j*K for j in i]
print(sum(cur))
```
| 101,070 | [
0.55078125,
0.345703125,
-0.296630859375,
0.150146484375,
-0.5888671875,
-0.367431640625,
0.04876708984375,
0.1168212890625,
0.189208984375,
0.85693359375,
0.434326171875,
-0.331787109375,
-0.09356689453125,
-0.51171875,
-0.65283203125,
0.03302001953125,
-0.266357421875,
-0.7172851... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
AtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the election: Takahashi and Aoki. The report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes. AtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i. It is known that each candidate had at least one vote when he checked the report for the first time.
Find the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time. It can be assumed that the number of votes obtained by each candidate never decreases.
Constraints
* 1≦N≦1000
* 1≦T_i,A_i≦1000 (1≦i≦N)
* T_i and A_i (1≦i≦N) are coprime.
* It is guaranteed that the correct answer is at most 10^{18}.
Input
The input is given from Standard Input in the following format:
N
T_1 A_1
T_2 A_2
:
T_N A_N
Output
Print the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.
Examples
Input
3
2 3
1 1
3 2
Output
10
Input
4
1 1
1 1
1 5
1 100
Output
101
Input
5
3 10
48 17
31 199
231 23
3 2
Output
6930
"Correct Solution:
```
t=a=1
for i in range(int(input())):
T,A=map(int,input().split())
n=max(-(-t//T),-(-a//A))
t=n*T
a=n*A
print(t+a)
```
| 101,071 | [
0.580078125,
0.400634765625,
-0.31494140625,
0.165283203125,
-0.57763671875,
-0.40478515625,
-0.0164642333984375,
0.11260986328125,
0.144287109375,
0.86083984375,
0.366943359375,
-0.3427734375,
-0.0267181396484375,
-0.499267578125,
-0.6474609375,
0.01294708251953125,
-0.26171875,
-... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
AtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the election: Takahashi and Aoki. The report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes. AtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i. It is known that each candidate had at least one vote when he checked the report for the first time.
Find the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time. It can be assumed that the number of votes obtained by each candidate never decreases.
Constraints
* 1≦N≦1000
* 1≦T_i,A_i≦1000 (1≦i≦N)
* T_i and A_i (1≦i≦N) are coprime.
* It is guaranteed that the correct answer is at most 10^{18}.
Input
The input is given from Standard Input in the following format:
N
T_1 A_1
T_2 A_2
:
T_N A_N
Output
Print the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.
Examples
Input
3
2 3
1 1
3 2
Output
10
Input
4
1 1
1 1
1 5
1 100
Output
101
Input
5
3 10
48 17
31 199
231 23
3 2
Output
6930
Submitted Solution:
```
n = int(input())
a = 1
b = 1
for i in range(n):
c,d = map(int,input().split())
num = max((a+c-1)//c,(b+d-1)//d)
a = num*c
b = num*d
print(a+b)
```
Yes
| 101,072 | [
0.5927734375,
0.330810546875,
-0.361083984375,
0.132568359375,
-0.6025390625,
-0.386962890625,
-0.07562255859375,
0.1705322265625,
0.055938720703125,
0.79296875,
0.39794921875,
-0.247314453125,
-0.060791015625,
-0.5107421875,
-0.64111328125,
-0.09075927734375,
-0.2325439453125,
-0.... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
AtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the election: Takahashi and Aoki. The report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes. AtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i. It is known that each candidate had at least one vote when he checked the report for the first time.
Find the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time. It can be assumed that the number of votes obtained by each candidate never decreases.
Constraints
* 1≦N≦1000
* 1≦T_i,A_i≦1000 (1≦i≦N)
* T_i and A_i (1≦i≦N) are coprime.
* It is guaranteed that the correct answer is at most 10^{18}.
Input
The input is given from Standard Input in the following format:
N
T_1 A_1
T_2 A_2
:
T_N A_N
Output
Print the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.
Examples
Input
3
2 3
1 1
3 2
Output
10
Input
4
1 1
1 1
1 5
1 100
Output
101
Input
5
3 10
48 17
31 199
231 23
3 2
Output
6930
Submitted Solution:
```
n = int(input())
a = 0
b = 0
for _ in range(n):
x, y = map(int, input().split())
if not a:
a, b = x, y
continue
z = max(-(-a // x), -(-b // y))
a, b = z * x, z * y
print(a + b)
```
Yes
| 101,073 | [
0.58056640625,
0.349365234375,
-0.3564453125,
0.1014404296875,
-0.62060546875,
-0.3642578125,
-0.10137939453125,
0.1817626953125,
0.07080078125,
0.8154296875,
0.36279296875,
-0.25146484375,
-0.054931640625,
-0.5048828125,
-0.63427734375,
-0.07977294921875,
-0.217529296875,
-0.75878... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
AtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the election: Takahashi and Aoki. The report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes. AtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i. It is known that each candidate had at least one vote when he checked the report for the first time.
Find the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time. It can be assumed that the number of votes obtained by each candidate never decreases.
Constraints
* 1≦N≦1000
* 1≦T_i,A_i≦1000 (1≦i≦N)
* T_i and A_i (1≦i≦N) are coprime.
* It is guaranteed that the correct answer is at most 10^{18}.
Input
The input is given from Standard Input in the following format:
N
T_1 A_1
T_2 A_2
:
T_N A_N
Output
Print the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.
Examples
Input
3
2 3
1 1
3 2
Output
10
Input
4
1 1
1 1
1 5
1 100
Output
101
Input
5
3 10
48 17
31 199
231 23
3 2
Output
6930
Submitted Solution:
```
n=int(input());a,b=map(int,input().split())
for i in range(n-1):
c,d=map(int,input().split())
m=max((a-1)//c,(b-1)//d)+1
a,b=c*m,d*m
print(a+b)
```
Yes
| 101,074 | [
0.5830078125,
0.35888671875,
-0.39306640625,
0.1173095703125,
-0.6025390625,
-0.363525390625,
-0.08758544921875,
0.173095703125,
0.0290985107421875,
0.81787109375,
0.40869140625,
-0.2425537109375,
-0.04229736328125,
-0.5263671875,
-0.63720703125,
-0.07843017578125,
-0.2264404296875,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
AtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the election: Takahashi and Aoki. The report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes. AtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i. It is known that each candidate had at least one vote when he checked the report for the first time.
Find the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time. It can be assumed that the number of votes obtained by each candidate never decreases.
Constraints
* 1≦N≦1000
* 1≦T_i,A_i≦1000 (1≦i≦N)
* T_i and A_i (1≦i≦N) are coprime.
* It is guaranteed that the correct answer is at most 10^{18}.
Input
The input is given from Standard Input in the following format:
N
T_1 A_1
T_2 A_2
:
T_N A_N
Output
Print the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.
Examples
Input
3
2 3
1 1
3 2
Output
10
Input
4
1 1
1 1
1 5
1 100
Output
101
Input
5
3 10
48 17
31 199
231 23
3 2
Output
6930
Submitted Solution:
```
n=int(input())
t0,a0=1,1
for i in range(n):
t,a=map(int,input().split())
if t0/a0>t/a:
while t0%t != 0:
t0+=1
a0=t0*a//t
elif t0/a0<t/a:
while a0%a != 0:
a0+=1
t0=a0*t//a
print(t0+a0)
```
Yes
| 101,075 | [
0.6005859375,
0.352783203125,
-0.39013671875,
0.1585693359375,
-0.54931640625,
-0.389404296875,
-0.04803466796875,
0.1798095703125,
0.05584716796875,
0.814453125,
0.364501953125,
-0.239990234375,
-0.0584716796875,
-0.52001953125,
-0.65966796875,
-0.0631103515625,
-0.1904296875,
-0.... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
AtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the election: Takahashi and Aoki. The report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes. AtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i. It is known that each candidate had at least one vote when he checked the report for the first time.
Find the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time. It can be assumed that the number of votes obtained by each candidate never decreases.
Constraints
* 1≦N≦1000
* 1≦T_i,A_i≦1000 (1≦i≦N)
* T_i and A_i (1≦i≦N) are coprime.
* It is guaranteed that the correct answer is at most 10^{18}.
Input
The input is given from Standard Input in the following format:
N
T_1 A_1
T_2 A_2
:
T_N A_N
Output
Print the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.
Examples
Input
3
2 3
1 1
3 2
Output
10
Input
4
1 1
1 1
1 5
1 100
Output
101
Input
5
3 10
48 17
31 199
231 23
3 2
Output
6930
Submitted Solution:
```
import math
# input
N = int(input())
TA = [list(map(int, input().split())) for _ in range(N)]
T = 1 # 高橋くんの最小得票数
A = 1 # 青木くんの最小得票数
ans = 2
for i in range(0, N):
g = max(math.ceil(T / TA[i][0]), math.ceil(A / TA[i][1]))
T = TA[i][0] * g
A = TA[i][1] * g
ans = T + A
print(ans)
```
No
| 101,076 | [
0.5673828125,
0.341796875,
-0.355224609375,
0.1463623046875,
-0.58642578125,
-0.3857421875,
0.0029754638671875,
0.2327880859375,
0.1092529296875,
0.76611328125,
0.378173828125,
-0.225341796875,
-0.12054443359375,
-0.51220703125,
-0.68701171875,
-0.1351318359375,
-0.1875,
-0.7451171... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
AtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the election: Takahashi and Aoki. The report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes. AtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i. It is known that each candidate had at least one vote when he checked the report for the first time.
Find the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time. It can be assumed that the number of votes obtained by each candidate never decreases.
Constraints
* 1≦N≦1000
* 1≦T_i,A_i≦1000 (1≦i≦N)
* T_i and A_i (1≦i≦N) are coprime.
* It is guaranteed that the correct answer is at most 10^{18}.
Input
The input is given from Standard Input in the following format:
N
T_1 A_1
T_2 A_2
:
T_N A_N
Output
Print the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.
Examples
Input
3
2 3
1 1
3 2
Output
10
Input
4
1 1
1 1
1 5
1 100
Output
101
Input
5
3 10
48 17
31 199
231 23
3 2
Output
6930
Submitted Solution:
```
n = int(input())
vlist = [input().split() for i in range(n)]
for m in range(n) :
vlist[m] = [int(l) for l in vlist[m]]
for j in range(n-1) :
if vlist[j][0] <= vlist[j+1][0] and vlist[j][1] <= vlist[j][1] :
continue
if vlist[j][0] > vlist[j+1][0] and vlist[j][0] > vlist[j][1] :
vlist[j+1] = [int(k*(np.lcm(vlist[j][0], vlist[j+1][0]))/vlist[j+1][0]) for k in vlist[j+1]]
continue
elif vlist[j][1] > vlist[j+1][1] and vlist[j][1] > vlist[j][0]:
vlist[j+1] = [int(k*(np.lcm(vlist[j][1], vlist[j+1][1]))/vlist[j+1][1]) for k in vlist[j+1]]
continue
elif vlist[j+1][0] > vlist[j+1][1] :
vlist[j+1] = [int(k*(np.lcm(vlist[j][1], vlist[j+1][1]))/vlist[j+1][1]) for k in vlist[j+1]]
continue
else :
vlist[j+1] = [int(k*(np.lcm(vlist[j][0], vlist[j+1][0]))/vlist[j+1][0]) for k in vlist[j+1]]
print(sum(vlist[n-1]))
```
No
| 101,077 | [
0.544921875,
0.281982421875,
-0.330322265625,
0.18310546875,
-0.595703125,
-0.4306640625,
-0.0843505859375,
0.151611328125,
0.0977783203125,
0.7685546875,
0.442138671875,
-0.30126953125,
-0.0623779296875,
-0.52587890625,
-0.61376953125,
-0.003978729248046875,
-0.2198486328125,
-0.7... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
AtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the election: Takahashi and Aoki. The report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes. AtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i. It is known that each candidate had at least one vote when he checked the report for the first time.
Find the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time. It can be assumed that the number of votes obtained by each candidate never decreases.
Constraints
* 1≦N≦1000
* 1≦T_i,A_i≦1000 (1≦i≦N)
* T_i and A_i (1≦i≦N) are coprime.
* It is guaranteed that the correct answer is at most 10^{18}.
Input
The input is given from Standard Input in the following format:
N
T_1 A_1
T_2 A_2
:
T_N A_N
Output
Print the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.
Examples
Input
3
2 3
1 1
3 2
Output
10
Input
4
1 1
1 1
1 5
1 100
Output
101
Input
5
3 10
48 17
31 199
231 23
3 2
Output
6930
Submitted Solution:
```
from math import ceil
n = int(input())
ratio = [list(map(int, input().split())) for _ in range(n)]
t_voted, a_voted = ratio[0][0], ratio[0][1]
for t, a in ratio[1:]:
if t < t_voted and a < a_voted:
t_voted = t
a_voted = a
else:
val = max(ceil(t_voted / t), ceil(a_voted / a))
t_voted = t * val
a_voted = a * val
print(t_voted + a_voted)
```
No
| 101,078 | [
0.576171875,
0.375244140625,
-0.376953125,
0.195068359375,
-0.5849609375,
-0.321533203125,
0.01152801513671875,
0.2261962890625,
0.0653076171875,
0.7880859375,
0.294189453125,
-0.271484375,
-0.10443115234375,
-0.52197265625,
-0.76318359375,
-0.09796142578125,
-0.187744140625,
-0.75... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
AtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the election: Takahashi and Aoki. The report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes. AtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i. It is known that each candidate had at least one vote when he checked the report for the first time.
Find the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time. It can be assumed that the number of votes obtained by each candidate never decreases.
Constraints
* 1≦N≦1000
* 1≦T_i,A_i≦1000 (1≦i≦N)
* T_i and A_i (1≦i≦N) are coprime.
* It is guaranteed that the correct answer is at most 10^{18}.
Input
The input is given from Standard Input in the following format:
N
T_1 A_1
T_2 A_2
:
T_N A_N
Output
Print the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.
Examples
Input
3
2 3
1 1
3 2
Output
10
Input
4
1 1
1 1
1 5
1 100
Output
101
Input
5
3 10
48 17
31 199
231 23
3 2
Output
6930
Submitted Solution:
```
from math import ceil
n = int(input())
sa, st = 1, 1
while n:
n -= 1
a, t = map(int, input().split())
if sa <= a:
if st <= t:
sa, st = a, t
else:
r = ceil(st / t)
sa, st = a * r, t * r
else:
ra = ceil(sa / a)
if st <= t * ra:
sa, st = a * ra, t * ra
else:
rt = ceil(st / t)
sa, st = a * rt, t * rt
print(sa + st)
```
No
| 101,079 | [
0.56689453125,
0.37451171875,
-0.29248046875,
0.19189453125,
-0.611328125,
-0.362548828125,
-0.07147216796875,
0.247314453125,
-0.0302581787109375,
0.78564453125,
0.335693359375,
-0.2364501953125,
-0.11474609375,
-0.51220703125,
-0.66015625,
-0.12371826171875,
-0.1815185546875,
-0.... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I have a sequence defined as follows:
* All even-numbered terms are equal to the previous term multiplied by 2.
* All odd-numbered terms are equal to the previous term divided by 3.
Create a program that reads the first term a of this sequence and outputs the sum s (10) from the first term to the tenth term.
Input
The input consists of multiple test cases. For each test case, a real number a (1.0 ≤ a ≤ 10.0) representing the first term of the sequence is given in one row.
The number of test cases does not exceed 50.
Output
Print s (10) on one line for each test case.
The output may contain an error of 0.000001 or less.
Example
Input
1.0
2.0
3.0
Output
7.81481481
15.62962963
23.44444444
Submitted Solution:
```
import sys
f = sys.stdin
for a in f:
a = float(a)
s = a
for i in range(2, 10 + 1):
a = a / 3 if i % 2 else a * 2
s += a
print('{:.8f}'.format(s))
```
Yes
| 101,088 | [
0.476806640625,
0.1888427734375,
0.11346435546875,
-0.21875,
-0.69140625,
-0.2081298828125,
-0.04693603515625,
0.094970703125,
0.10235595703125,
0.78466796875,
0.23583984375,
-0.11492919921875,
0.328857421875,
-0.69140625,
-0.449462890625,
-0.269775390625,
-0.59814453125,
-0.782714... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I have a sequence defined as follows:
* All even-numbered terms are equal to the previous term multiplied by 2.
* All odd-numbered terms are equal to the previous term divided by 3.
Create a program that reads the first term a of this sequence and outputs the sum s (10) from the first term to the tenth term.
Input
The input consists of multiple test cases. For each test case, a real number a (1.0 ≤ a ≤ 10.0) representing the first term of the sequence is given in one row.
The number of test cases does not exceed 50.
Output
Print s (10) on one line for each test case.
The output may contain an error of 0.000001 or less.
Example
Input
1.0
2.0
3.0
Output
7.81481481
15.62962963
23.44444444
Submitted Solution:
```
while True:
try:
a = float(input())
except:
break
total = a
for i in range(2, 11):
tmp = a / 3 if i % 2 else a * 2
total += tmp
a = tmp
print(total)
```
Yes
| 101,089 | [
0.517578125,
0.208740234375,
0.088134765625,
-0.214111328125,
-0.7265625,
-0.23974609375,
-0.01531982421875,
0.0615234375,
0.2445068359375,
0.85498046875,
0.1549072265625,
-0.033966064453125,
0.253173828125,
-0.7080078125,
-0.42578125,
-0.28466796875,
-0.5576171875,
-0.77734375,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I have a sequence defined as follows:
* All even-numbered terms are equal to the previous term multiplied by 2.
* All odd-numbered terms are equal to the previous term divided by 3.
Create a program that reads the first term a of this sequence and outputs the sum s (10) from the first term to the tenth term.
Input
The input consists of multiple test cases. For each test case, a real number a (1.0 ≤ a ≤ 10.0) representing the first term of the sequence is given in one row.
The number of test cases does not exceed 50.
Output
Print s (10) on one line for each test case.
The output may contain an error of 0.000001 or less.
Example
Input
1.0
2.0
3.0
Output
7.81481481
15.62962963
23.44444444
Submitted Solution:
```
while True:
try: a = float(input())
except: break
ans = a
for i in range(9):
a = a*2*((i+1)&1)+a/3*(i&1)
ans += a
print("%.8f"%ans)
```
Yes
| 101,090 | [
0.53564453125,
0.254638671875,
0.091552734375,
-0.1751708984375,
-0.70556640625,
-0.2347412109375,
-0.0296630859375,
0.06011962890625,
0.1998291015625,
0.8447265625,
0.171142578125,
-0.054290771484375,
0.286376953125,
-0.73388671875,
-0.4208984375,
-0.28125,
-0.52490234375,
-0.7490... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I have a sequence defined as follows:
* All even-numbered terms are equal to the previous term multiplied by 2.
* All odd-numbered terms are equal to the previous term divided by 3.
Create a program that reads the first term a of this sequence and outputs the sum s (10) from the first term to the tenth term.
Input
The input consists of multiple test cases. For each test case, a real number a (1.0 ≤ a ≤ 10.0) representing the first term of the sequence is given in one row.
The number of test cases does not exceed 50.
Output
Print s (10) on one line for each test case.
The output may contain an error of 0.000001 or less.
Example
Input
1.0
2.0
3.0
Output
7.81481481
15.62962963
23.44444444
Submitted Solution:
```
while 1:
try:n=float(input())
except:break
s=n
for i in range(9):
n=n/3 if i%2 else n*2
s+=n
print(s)
```
Yes
| 101,091 | [
0.51318359375,
0.2227783203125,
0.0836181640625,
-0.17919921875,
-0.69091796875,
-0.235595703125,
-0.05450439453125,
0.0849609375,
0.2078857421875,
0.8583984375,
0.180908203125,
-0.02423095703125,
0.311279296875,
-0.75830078125,
-0.404296875,
-0.261962890625,
-0.5625,
-0.7983398437... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I have a sequence defined as follows:
* All even-numbered terms are equal to the previous term multiplied by 2.
* All odd-numbered terms are equal to the previous term divided by 3.
Create a program that reads the first term a of this sequence and outputs the sum s (10) from the first term to the tenth term.
Input
The input consists of multiple test cases. For each test case, a real number a (1.0 ≤ a ≤ 10.0) representing the first term of the sequence is given in one row.
The number of test cases does not exceed 50.
Output
Print s (10) on one line for each test case.
The output may contain an error of 0.000001 or less.
Example
Input
1.0
2.0
3.0
Output
7.81481481
15.62962963
23.44444444
Submitted Solution:
```
x = float(input())
s=x
for i in range(9):
if i % 2 == 0:
s = s*2
x+=s
if i % 2 == 1:
s = s/3
x+=s
print(x)
```
No
| 101,092 | [
0.46435546875,
0.214599609375,
0.1455078125,
-0.2178955078125,
-0.62548828125,
-0.2257080078125,
-0.10919189453125,
0.068115234375,
0.213134765625,
0.8544921875,
0.334716796875,
0.0177001953125,
0.3310546875,
-0.77783203125,
-0.365478515625,
-0.260986328125,
-0.6044921875,
-0.81591... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I have a sequence defined as follows:
* All even-numbered terms are equal to the previous term multiplied by 2.
* All odd-numbered terms are equal to the previous term divided by 3.
Create a program that reads the first term a of this sequence and outputs the sum s (10) from the first term to the tenth term.
Input
The input consists of multiple test cases. For each test case, a real number a (1.0 ≤ a ≤ 10.0) representing the first term of the sequence is given in one row.
The number of test cases does not exceed 50.
Output
Print s (10) on one line for each test case.
The output may contain an error of 0.000001 or less.
Example
Input
1.0
2.0
3.0
Output
7.81481481
15.62962963
23.44444444
Submitted Solution:
```
while 1:
x = float(input())
s=x
for i in range(9):
if i % 2 == 0:
s = s*2
x+=s
if i % 2 == 1:
s = s/3
x+=s
print(x)
```
No
| 101,093 | [
0.486083984375,
0.218994140625,
0.1285400390625,
-0.1939697265625,
-0.61572265625,
-0.24267578125,
-0.118896484375,
0.046783447265625,
0.2218017578125,
0.86083984375,
0.3271484375,
0.024017333984375,
0.3310546875,
-0.78564453125,
-0.362060546875,
-0.304443359375,
-0.583984375,
-0.8... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I have a sequence defined as follows:
* All even-numbered terms are equal to the previous term multiplied by 2.
* All odd-numbered terms are equal to the previous term divided by 3.
Create a program that reads the first term a of this sequence and outputs the sum s (10) from the first term to the tenth term.
Input
The input consists of multiple test cases. For each test case, a real number a (1.0 ≤ a ≤ 10.0) representing the first term of the sequence is given in one row.
The number of test cases does not exceed 50.
Output
Print s (10) on one line for each test case.
The output may contain an error of 0.000001 or less.
Example
Input
1.0
2.0
3.0
Output
7.81481481
15.62962963
23.44444444
Submitted Solution:
```
import sys
for e in sys.stdin:
t=[a,
a*2,
a*2/3,
a*2/3*2,
a*2/3*2/3,
a*2/3*2/3*2,
a*2/3*2/3*2/3,
a*2/3*2/3*2/3*2,
a*2/3*2/3*2/3*2/3,
a*2/3*2/3*2/3*2/3*2]
print(sum(t))
```
No
| 101,094 | [
0.429931640625,
0.197021484375,
0.12030029296875,
-0.143310546875,
-0.71728515625,
-0.2357177734375,
-0.2158203125,
0.036376953125,
0.0517578125,
0.77197265625,
0.1669921875,
-0.0748291015625,
0.321044921875,
-0.705078125,
-0.56005859375,
-0.2890625,
-0.5537109375,
-0.6923828125,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Anna got the following task at school: to arrange several numbers in a circle so that any two neighboring numbers differs exactly by 1. Anna was given several numbers and arranged them in a circle to fulfill the task. Then she wanted to check if she had arranged the numbers correctly, but at this point her younger sister Maria came and shuffled all numbers. Anna got sick with anger but what's done is done and the results of her work had been destroyed. But please tell Anna: could she have hypothetically completed the task using all those given numbers?
Input
The first line contains an integer n — how many numbers Anna had (3 ≤ n ≤ 105). The next line contains those numbers, separated by a space. All numbers are integers and belong to the range from 1 to 109.
Output
Print the single line "YES" (without the quotes), if Anna could have completed the task correctly using all those numbers (using all of them is necessary). If Anna couldn't have fulfilled the task, no matter how hard she would try, print "NO" (without the quotes).
Examples
Input
4
1 2 3 2
Output
YES
Input
6
1 1 2 2 2 3
Output
YES
Input
6
2 4 1 1 2 2
Output
NO
Submitted Solution:
```
def no():
print("NO")
exit(0)
n, a = int(input()), list(map(int, input().split()))
x, y = min(a), max(a)
d = y-x
if 2*d > n:
print("NO")
exit(0)
c = [0] * (d+1)
for i in range(n):
c[a[i]-x] += 1
for i in range(1, d):
c[i] -= c[i-1]
if c[i] <= 0:
no()
if c[d] == c[d-1]:
print("YES")
else:
print("NO")
```
Yes
| 101,342 | [
0.421630859375,
-0.146240234375,
-0.174072265625,
-0.2047119140625,
-0.75634765625,
-0.5,
0.0034332275390625,
0.433837890625,
0.22314453125,
1.16796875,
0.60009765625,
0.301513671875,
-0.0229949951171875,
-0.7265625,
-0.65869140625,
-0.0653076171875,
-0.900390625,
-0.76904296875,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Anna got the following task at school: to arrange several numbers in a circle so that any two neighboring numbers differs exactly by 1. Anna was given several numbers and arranged them in a circle to fulfill the task. Then she wanted to check if she had arranged the numbers correctly, but at this point her younger sister Maria came and shuffled all numbers. Anna got sick with anger but what's done is done and the results of her work had been destroyed. But please tell Anna: could she have hypothetically completed the task using all those given numbers?
Input
The first line contains an integer n — how many numbers Anna had (3 ≤ n ≤ 105). The next line contains those numbers, separated by a space. All numbers are integers and belong to the range from 1 to 109.
Output
Print the single line "YES" (without the quotes), if Anna could have completed the task correctly using all those numbers (using all of them is necessary). If Anna couldn't have fulfilled the task, no matter how hard she would try, print "NO" (without the quotes).
Examples
Input
4
1 2 3 2
Output
YES
Input
6
1 1 2 2 2 3
Output
YES
Input
6
2 4 1 1 2 2
Output
NO
Submitted Solution:
```
import sys
n = int(input())
c = {}
for i in [int(i) for i in input().split()]:
c[i] = c.get(i, 0) + 1
maxi = max(c)
l = sorted(c)
for u in l[:-1]:
if u + 1 not in c:
print("NO")
sys.exit()
c[u + 1] -= c[u]
if 0 > c[u + 1]:
print("NO")
sys.exit()
arr = list(c.values())
if arr.count(0) == 1 and c[maxi] == 0:
print("YES")
else:
print("NO")
```
Yes
| 101,343 | [
0.4677734375,
-0.10906982421875,
-0.1400146484375,
-0.1978759765625,
-0.83447265625,
-0.465576171875,
-0.0885009765625,
0.376220703125,
0.203857421875,
1.1884765625,
0.66748046875,
0.312744140625,
-0.038330078125,
-0.765625,
-0.75732421875,
-0.032073974609375,
-0.81982421875,
-0.71... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Anna got the following task at school: to arrange several numbers in a circle so that any two neighboring numbers differs exactly by 1. Anna was given several numbers and arranged them in a circle to fulfill the task. Then she wanted to check if she had arranged the numbers correctly, but at this point her younger sister Maria came and shuffled all numbers. Anna got sick with anger but what's done is done and the results of her work had been destroyed. But please tell Anna: could she have hypothetically completed the task using all those given numbers?
Input
The first line contains an integer n — how many numbers Anna had (3 ≤ n ≤ 105). The next line contains those numbers, separated by a space. All numbers are integers and belong to the range from 1 to 109.
Output
Print the single line "YES" (without the quotes), if Anna could have completed the task correctly using all those numbers (using all of them is necessary). If Anna couldn't have fulfilled the task, no matter how hard she would try, print "NO" (without the quotes).
Examples
Input
4
1 2 3 2
Output
YES
Input
6
1 1 2 2 2 3
Output
YES
Input
6
2 4 1 1 2 2
Output
NO
Submitted Solution:
```
n=int(input())
g={}
for i in list(map(int,input().split())):g[i]=g.get(i,0)+2
mx=max(g)
for i in sorted(g)[:-1]:
if i+1 not in g:exit(print('NO'))
g[i+1]-=g[i]
print('YES'if g[mx]==0 and list(g.values()).count(0)==1else'NO')
```
No
| 101,344 | [
0.456787109375,
-0.10736083984375,
-0.1998291015625,
-0.1781005859375,
-0.828125,
-0.54150390625,
0.004947662353515625,
0.48779296875,
0.285888671875,
1.10546875,
0.66455078125,
0.253662109375,
0.019287109375,
-0.73388671875,
-0.58154296875,
-0.016876220703125,
-0.89013671875,
-0.7... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Anna got the following task at school: to arrange several numbers in a circle so that any two neighboring numbers differs exactly by 1. Anna was given several numbers and arranged them in a circle to fulfill the task. Then she wanted to check if she had arranged the numbers correctly, but at this point her younger sister Maria came and shuffled all numbers. Anna got sick with anger but what's done is done and the results of her work had been destroyed. But please tell Anna: could she have hypothetically completed the task using all those given numbers?
Input
The first line contains an integer n — how many numbers Anna had (3 ≤ n ≤ 105). The next line contains those numbers, separated by a space. All numbers are integers and belong to the range from 1 to 109.
Output
Print the single line "YES" (without the quotes), if Anna could have completed the task correctly using all those numbers (using all of them is necessary). If Anna couldn't have fulfilled the task, no matter how hard she would try, print "NO" (without the quotes).
Examples
Input
4
1 2 3 2
Output
YES
Input
6
1 1 2 2 2 3
Output
YES
Input
6
2 4 1 1 2 2
Output
NO
Submitted Solution:
```
n = int(input())
a = [2 * int(x) for x in input().split()]
mp = {}
for i in a:
mp.setdefault(i - 1, len(mp))
mp.setdefault(i + 1, len(mp))
m = len(mp)
deg = [0 for i in range(m)]
adj = [set() for i in range(m)]
for i in a:
deg[mp[i - 1]] += 1
deg[mp[i + 1]] += 1
adj[mp[i - 1]].add(mp[i + 1])
adj[mp[i + 1]].add(mp[i - 1])
for i in deg:
if i % 2:
print("NO")
exit()
vis = set()
cur = mp[a[0] - 1]
while not cur in vis:
vis.add(cur)
for i in adj[cur]:
if not i in vis:
cur = i
break
if len(vis) == m:
print("YES")
else:
print("NO")
```
No
| 101,345 | [
0.30029296875,
-0.0640869140625,
-0.14013671875,
-0.2783203125,
-0.78125,
-0.4501953125,
-0.0287628173828125,
0.2919921875,
0.317138671875,
1.0849609375,
0.677734375,
0.1514892578125,
0.0246124267578125,
-0.671875,
-0.5947265625,
0.036102294921875,
-0.78857421875,
-0.70458984375,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Anna got the following task at school: to arrange several numbers in a circle so that any two neighboring numbers differs exactly by 1. Anna was given several numbers and arranged them in a circle to fulfill the task. Then she wanted to check if she had arranged the numbers correctly, but at this point her younger sister Maria came and shuffled all numbers. Anna got sick with anger but what's done is done and the results of her work had been destroyed. But please tell Anna: could she have hypothetically completed the task using all those given numbers?
Input
The first line contains an integer n — how many numbers Anna had (3 ≤ n ≤ 105). The next line contains those numbers, separated by a space. All numbers are integers and belong to the range from 1 to 109.
Output
Print the single line "YES" (without the quotes), if Anna could have completed the task correctly using all those numbers (using all of them is necessary). If Anna couldn't have fulfilled the task, no matter how hard she would try, print "NO" (without the quotes).
Examples
Input
4
1 2 3 2
Output
YES
Input
6
1 1 2 2 2 3
Output
YES
Input
6
2 4 1 1 2 2
Output
NO
Submitted Solution:
```
n=int(input())
g={}
for i in list(map(int,input().split())):g[i]=g.get(i,0)+2
mx=max(g)
for i in sorted(g)[:-1]:
if i+1 not in g:exit(print('NO'))
g[i+1]-=g[i]
print('NO'if g[mx]else'YES')
```
No
| 101,346 | [
0.435302734375,
-0.1436767578125,
-0.220947265625,
-0.1817626953125,
-0.83251953125,
-0.51953125,
0.0108489990234375,
0.488037109375,
0.28271484375,
1.103515625,
0.67919921875,
0.255126953125,
0.00043511390686035156,
-0.73681640625,
-0.60546875,
-0.009735107421875,
-0.8994140625,
-... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Anna got the following task at school: to arrange several numbers in a circle so that any two neighboring numbers differs exactly by 1. Anna was given several numbers and arranged them in a circle to fulfill the task. Then she wanted to check if she had arranged the numbers correctly, but at this point her younger sister Maria came and shuffled all numbers. Anna got sick with anger but what's done is done and the results of her work had been destroyed. But please tell Anna: could she have hypothetically completed the task using all those given numbers?
Input
The first line contains an integer n — how many numbers Anna had (3 ≤ n ≤ 105). The next line contains those numbers, separated by a space. All numbers are integers and belong to the range from 1 to 109.
Output
Print the single line "YES" (without the quotes), if Anna could have completed the task correctly using all those numbers (using all of them is necessary). If Anna couldn't have fulfilled the task, no matter how hard she would try, print "NO" (without the quotes).
Examples
Input
4
1 2 3 2
Output
YES
Input
6
1 1 2 2 2 3
Output
YES
Input
6
2 4 1 1 2 2
Output
NO
Submitted Solution:
```
n= int(input())
a = list(map(int,input().split()))
a.sort()
mm=a[0]
b=list(map(lambda x: x-mm, a))
if a[-1]>n:
print('NO')
else:
c=[0]*a[-1]
for el in b:
c[el]+=1
for i in range(1,len(c)):
c[i] = c[i]-c[i-1]
c[i-1]=0
for i in range(len(c)):
if c[i]!=0:
print('NO')
break
else:
print('YES')
# Sat Oct 17 2020 10:17:26 GMT+0300 (Москва, стандартное время)
```
No
| 101,347 | [
0.42138671875,
-0.160888671875,
-0.26220703125,
-0.218505859375,
-0.78369140625,
-0.48291015625,
0.034515380859375,
0.42431640625,
0.26220703125,
1.1591796875,
0.66943359375,
0.19140625,
0.05108642578125,
-0.720703125,
-0.7158203125,
-0.155517578125,
-0.904296875,
-0.74755859375,
... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every line of code that he writes.
Let's call a sequence of non-negative integers v1, v2, ..., vn a plan, if v1 + v2 + ... + vn = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v1 lines of the given task, then the second programmer writes v2 more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let's call a plan good, if all the written lines of the task contain at most b bugs in total.
Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.
Input
The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 109 + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.
The next line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 500) — the number of bugs per line for each programmer.
Output
Print a single integer — the answer to the problem modulo mod.
Examples
Input
3 3 3 100
1 1 1
Output
10
Input
3 6 5 1000000007
1 2 3
Output
0
Input
3 5 6 11
1 2 1
Output
0
Tags: dp
Correct Solution:
```
a = list(map(int, input().split()))
n = a[0]
m = a[1]
b = a[2]
mod = a[3]
ac = list(map(int,input().split()))
ac = [0] + ac
dp = [[[0 for k in range(b+1)] for _ in range(m+1)] for z in range(2)]
for i in range(n+1) :
for x in range(b+1) :
dp[i%2][0][x] = 1
for i in range(1,n+1) :
for j in range(1,m+1) :
for x in range(b+1) :
if ac[i] <= x :
dp[i%2][j][x] = (dp[(i-1)%2][j][x] + dp[i%2][j-1][x-ac[i]] ) % mod
else :
dp[i%2][j][x] = dp[(i-1)%2][j][x] % mod
print(dp[n%2][m][b])
```
| 101,593 | [
0.2978515625,
-0.054168701171875,
-0.09722900390625,
0.12091064453125,
-0.328125,
-0.87158203125,
-0.0221405029296875,
0.0164794921875,
0.318603515625,
0.962890625,
0.2210693359375,
-0.0980224609375,
0.1766357421875,
-0.50048828125,
-0.324462890625,
-0.056915283203125,
-0.6044921875,... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every line of code that he writes.
Let's call a sequence of non-negative integers v1, v2, ..., vn a plan, if v1 + v2 + ... + vn = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v1 lines of the given task, then the second programmer writes v2 more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let's call a plan good, if all the written lines of the task contain at most b bugs in total.
Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.
Input
The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 109 + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.
The next line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 500) — the number of bugs per line for each programmer.
Output
Print a single integer — the answer to the problem modulo mod.
Examples
Input
3 3 3 100
1 1 1
Output
10
Input
3 6 5 1000000007
1 2 3
Output
0
Input
3 5 6 11
1 2 1
Output
0
Tags: dp
Correct Solution:
```
n, m, b, mod = map(int, input().split())
a = list(map(int, input().split()))
dp = [[0 for i in range(b + 1)] for j in range(m + 1)]
dp[0][0] = 1
for i in range(n):
for ld in range(m):
for bugs in range(b + 1):
if bugs + a[i] <= b:
dp[ld + 1][bugs + a[i]] = (dp[ld + 1][bugs + a[i]] + dp[ld][bugs]) % mod
ans = 0
for i in range(0, b + 1):
ans = (ans + dp[m][i]) % mod
print(ans)
```
| 101,594 | [
0.274169921875,
-0.05938720703125,
-0.1014404296875,
0.142578125,
-0.330810546875,
-0.86181640625,
-0.005702972412109375,
0.032928466796875,
0.30908203125,
0.98876953125,
0.2086181640625,
-0.08099365234375,
0.1781005859375,
-0.480712890625,
-0.319580078125,
-0.0859375,
-0.60107421875... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every line of code that he writes.
Let's call a sequence of non-negative integers v1, v2, ..., vn a plan, if v1 + v2 + ... + vn = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v1 lines of the given task, then the second programmer writes v2 more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let's call a plan good, if all the written lines of the task contain at most b bugs in total.
Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.
Input
The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 109 + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.
The next line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 500) — the number of bugs per line for each programmer.
Output
Print a single integer — the answer to the problem modulo mod.
Examples
Input
3 3 3 100
1 1 1
Output
10
Input
3 6 5 1000000007
1 2 3
Output
0
Input
3 5 6 11
1 2 1
Output
0
Tags: dp
Correct Solution:
```
# Author : nitish420 --------------------------------------------------------------------
import os
import sys
from io import BytesIO, IOBase
def main():
n,m,b,mod=map(int,input().split())
arr=list(map(int,input().split()))
dp=[[0 for _ in range(b+1)] for _ in range(m+1)]
dp[0]=[1]*(b+1)
for item in arr:
for x in range(1,m+1):
for y in range(item,b+1):
dp[x][y]=(dp[x][y]+dp[x-1][y-item])%mod
print(dp[m][b])
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = 'x' in file.mode or 'r' not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b'\n') + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode('ascii'))
self.read = lambda: self.buffer.read().decode('ascii')
self.readline = lambda: self.buffer.readline().decode('ascii')
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip('\r\n')
# endregion
if __name__ == '__main__':
main()
```
| 101,595 | [
0.33447265625,
-0.08648681640625,
-0.16748046875,
0.14453125,
-0.37158203125,
-0.92578125,
-0.0809326171875,
0.081787109375,
0.3935546875,
1.0078125,
0.24755859375,
-0.06353759765625,
0.165771484375,
-0.4423828125,
-0.333251953125,
-0.062469482421875,
-0.58740234375,
-0.95654296875... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every line of code that he writes.
Let's call a sequence of non-negative integers v1, v2, ..., vn a plan, if v1 + v2 + ... + vn = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v1 lines of the given task, then the second programmer writes v2 more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let's call a plan good, if all the written lines of the task contain at most b bugs in total.
Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.
Input
The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 109 + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.
The next line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 500) — the number of bugs per line for each programmer.
Output
Print a single integer — the answer to the problem modulo mod.
Examples
Input
3 3 3 100
1 1 1
Output
10
Input
3 6 5 1000000007
1 2 3
Output
0
Input
3 5 6 11
1 2 1
Output
0
Tags: dp
Correct Solution:
```
n, m, b, mod = map(int, input().split())
a = list(map(int, input().split()))
dp = [[0 for col in range(b + 1)]for row in range(m + 1)]
dp[0][0] = 1
for i in range(n):
for j in range(1, m + 1):
for k in range(a[i], b + 1):
dp[j][k] = (dp[j][k] + dp[j - 1][k - a[i]]) % mod
ans = 0
for i in range(b + 1):
ans = (ans + dp[m][i]) % mod
print(ans)
```
| 101,596 | [
0.3017578125,
-0.055145263671875,
-0.08221435546875,
0.12939453125,
-0.336669921875,
-0.86328125,
-0.036712646484375,
0.0225677490234375,
0.311279296875,
0.99853515625,
0.19580078125,
-0.09637451171875,
0.1640625,
-0.439697265625,
-0.3037109375,
-0.046722412109375,
-0.58935546875,
... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every line of code that he writes.
Let's call a sequence of non-negative integers v1, v2, ..., vn a plan, if v1 + v2 + ... + vn = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v1 lines of the given task, then the second programmer writes v2 more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let's call a plan good, if all the written lines of the task contain at most b bugs in total.
Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.
Input
The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 109 + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.
The next line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 500) — the number of bugs per line for each programmer.
Output
Print a single integer — the answer to the problem modulo mod.
Examples
Input
3 3 3 100
1 1 1
Output
10
Input
3 6 5 1000000007
1 2 3
Output
0
Input
3 5 6 11
1 2 1
Output
0
Tags: dp
Correct Solution:
```
n, m, b, mod = list(map(int, input().split()))
a = list(map(int, input().split()))
A = [[0 for i in range(m + 1)] for j in range(b + 1)]
A[0][0] = 1
for i in range(n):
for j in range(a[i], b + 1):
for k in range(m):
A[j][k + 1] = (A[j][k + 1] + A[j - a[i]][k]) % mod
ans = 0
for i in range(b + 1):
ans = (ans + A[i][m]) % mod
print(ans)
```
| 101,597 | [
0.30712890625,
-0.06121826171875,
-0.126708984375,
0.0963134765625,
-0.35498046875,
-0.84912109375,
-0.0119171142578125,
0.04193115234375,
0.3134765625,
1.01953125,
0.2100830078125,
-0.099609375,
0.1876220703125,
-0.47216796875,
-0.31201171875,
-0.02935791015625,
-0.60009765625,
-0... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every line of code that he writes.
Let's call a sequence of non-negative integers v1, v2, ..., vn a plan, if v1 + v2 + ... + vn = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v1 lines of the given task, then the second programmer writes v2 more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let's call a plan good, if all the written lines of the task contain at most b bugs in total.
Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.
Input
The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 109 + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.
The next line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 500) — the number of bugs per line for each programmer.
Output
Print a single integer — the answer to the problem modulo mod.
Examples
Input
3 3 3 100
1 1 1
Output
10
Input
3 6 5 1000000007
1 2 3
Output
0
Input
3 5 6 11
1 2 1
Output
0
Tags: dp
Correct Solution:
```
# Legends Always Come Up with Solution
# Author: Manvir Singh
import os
import sys
from io import BytesIO, IOBase
def main():
n,m,b,mod=map(int,input().split())
a=list(map(int,input().split()))
dp=[[0 for _ in range(b+1)] for _ in range(m+1)]
dp[0][0]=1
for i in a:
for j in range(1,m+1):
for k in range(i,b+1):
dp[j][k]+=dp[j-1][k-i]
dp[j][k]%=mod
su=0
for i in dp[m]:
su+=i
su%=mod
print(su)
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
if __name__ == "__main__":
main()
```
| 101,598 | [
0.28662109375,
-0.055908203125,
-0.1651611328125,
0.128662109375,
-0.350341796875,
-0.865234375,
-0.032379150390625,
0.0182037353515625,
0.364990234375,
0.990234375,
0.208740234375,
-0.10162353515625,
0.2088623046875,
-0.439697265625,
-0.356201171875,
-0.06170654296875,
-0.634765625,... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every line of code that he writes.
Let's call a sequence of non-negative integers v1, v2, ..., vn a plan, if v1 + v2 + ... + vn = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v1 lines of the given task, then the second programmer writes v2 more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let's call a plan good, if all the written lines of the task contain at most b bugs in total.
Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.
Input
The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 109 + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.
The next line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 500) — the number of bugs per line for each programmer.
Output
Print a single integer — the answer to the problem modulo mod.
Examples
Input
3 3 3 100
1 1 1
Output
10
Input
3 6 5 1000000007
1 2 3
Output
0
Input
3 5 6 11
1 2 1
Output
0
Tags: dp
Correct Solution:
```
# Author : nitish420 --------------------------------------------------------------------
import os
import sys
from io import BytesIO, IOBase
def main():
n,m,b,mod=map(int,input().split())
arr=list(map(int,input().split()))
dp=[[0]*(b+1) for _ in range(m+1)]
dp[0]=[1]*(b+1)
for item in arr:
for r in range(1,m+1):
for c in range(item,b+1):
dp[r][c]=(dp[r][c]+dp[r-1][c-item])%mod
print(dp[m][b])
#----------------------------------------------------------------------------------------
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = 'x' in file.mode or 'r' not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b'\n') + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode('ascii'))
self.read = lambda: self.buffer.read().decode('ascii')
self.readline = lambda: self.buffer.readline().decode('ascii')
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip('\r\n')
# endregion
if __name__ == '__main__':
main()
```
| 101,599 | [
0.33447265625,
-0.08648681640625,
-0.16748046875,
0.14453125,
-0.37158203125,
-0.92578125,
-0.0809326171875,
0.081787109375,
0.3935546875,
1.0078125,
0.24755859375,
-0.06353759765625,
0.165771484375,
-0.4423828125,
-0.333251953125,
-0.062469482421875,
-0.58740234375,
-0.95654296875... | 11 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every line of code that he writes.
Let's call a sequence of non-negative integers v1, v2, ..., vn a plan, if v1 + v2 + ... + vn = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v1 lines of the given task, then the second programmer writes v2 more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let's call a plan good, if all the written lines of the task contain at most b bugs in total.
Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.
Input
The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 109 + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.
The next line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 500) — the number of bugs per line for each programmer.
Output
Print a single integer — the answer to the problem modulo mod.
Examples
Input
3 3 3 100
1 1 1
Output
10
Input
3 6 5 1000000007
1 2 3
Output
0
Input
3 5 6 11
1 2 1
Output
0
Tags: dp
Correct Solution:
```
def main():
n,m,b,mod=map(int,input().split())
arr=list(map(int,input().split()))
dp=[[0 for _ in range(b+1)] for _ in range(m+1)]
dp[0]=[1]*(b+1)
for item in arr:
for x in range(1,m+1):
for y in range(item,b+1):
dp[x][y]=(dp[x][y]+dp[x-1][y-item])%mod
print(dp[m][b])
main()
```
| 101,600 | [
0.318603515625,
0.01544189453125,
-0.1026611328125,
0.148193359375,
-0.30517578125,
-0.86669921875,
-0.0147552490234375,
0.003330230712890625,
0.33642578125,
1.037109375,
0.26416015625,
-0.1414794921875,
0.1417236328125,
-0.50732421875,
-0.391357421875,
-0.080078125,
-0.58740234375,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every line of code that he writes.
Let's call a sequence of non-negative integers v1, v2, ..., vn a plan, if v1 + v2 + ... + vn = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v1 lines of the given task, then the second programmer writes v2 more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let's call a plan good, if all the written lines of the task contain at most b bugs in total.
Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.
Input
The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 109 + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.
The next line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 500) — the number of bugs per line for each programmer.
Output
Print a single integer — the answer to the problem modulo mod.
Examples
Input
3 3 3 100
1 1 1
Output
10
Input
3 6 5 1000000007
1 2 3
Output
0
Input
3 5 6 11
1 2 1
Output
0
Submitted Solution:
```
import sys
import copy
input=sys.stdin.readline
n,m,b,mod=map(int,input().split())
a=list(map(int,input().split()))
dp=[[0]*(m+1) for i in range(b+1)]
dp[0][0]=1
for i in range(n):
for j in range(a[i],b+1):
for k in range(1,m+1):
dp[j][k]=(dp[j][k]+dp[j-a[i]][k-1])%mod
ans=0
for i in range(b+1):
ans+=dp[i][m]
ans%=mod
print(ans)
```
Yes
| 101,601 | [
0.39013671875,
-0.033416748046875,
-0.1959228515625,
0.036163330078125,
-0.478759765625,
-0.68994140625,
-0.06280517578125,
0.155517578125,
0.2607421875,
1.0537109375,
0.19921875,
-0.10516357421875,
0.1915283203125,
-0.541015625,
-0.3466796875,
-0.1875,
-0.572265625,
-0.9599609375,... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every line of code that he writes.
Let's call a sequence of non-negative integers v1, v2, ..., vn a plan, if v1 + v2 + ... + vn = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v1 lines of the given task, then the second programmer writes v2 more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let's call a plan good, if all the written lines of the task contain at most b bugs in total.
Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.
Input
The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 109 + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.
The next line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 500) — the number of bugs per line for each programmer.
Output
Print a single integer — the answer to the problem modulo mod.
Examples
Input
3 3 3 100
1 1 1
Output
10
Input
3 6 5 1000000007
1 2 3
Output
0
Input
3 5 6 11
1 2 1
Output
0
Submitted Solution:
```
# Author : nitish420 --------------------------------------------------------------------
import os
import sys
from io import BytesIO, IOBase
def main():
n,m,b,mod=map(int,input().split())
arr=list(map(int,input().split()))
dp=[[0 for _ in range(b+1)] for _ in range(m+1)]
dp[0]=[1]*(b+1)
for item in arr:
for x in range(1,m+1):
for y in range(item,b+1):
dp[x][y]=(dp[x][y]+dp[x-1][y-item])%mod
print(dp[m][b])
#----------------------------------------------------------------------------------------
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = 'x' in file.mode or 'r' not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b'\n') + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode('ascii'))
self.read = lambda: self.buffer.read().decode('ascii')
self.readline = lambda: self.buffer.readline().decode('ascii')
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip('\r\n')
# endregion
if __name__ == '__main__':
main()
```
Yes
| 101,602 | [
0.45166015625,
0.0000073909759521484375,
-0.331787109375,
0.1319580078125,
-0.466552734375,
-0.71533203125,
-0.053955078125,
0.2403564453125,
0.351318359375,
0.9716796875,
0.2034912109375,
-0.1051025390625,
0.14697265625,
-0.55810546875,
-0.388671875,
-0.191162109375,
-0.58642578125,... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every line of code that he writes.
Let's call a sequence of non-negative integers v1, v2, ..., vn a plan, if v1 + v2 + ... + vn = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v1 lines of the given task, then the second programmer writes v2 more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let's call a plan good, if all the written lines of the task contain at most b bugs in total.
Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.
Input
The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 109 + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.
The next line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 500) — the number of bugs per line for each programmer.
Output
Print a single integer — the answer to the problem modulo mod.
Examples
Input
3 3 3 100
1 1 1
Output
10
Input
3 6 5 1000000007
1 2 3
Output
0
Input
3 5 6 11
1 2 1
Output
0
Submitted Solution:
```
# Author : nitish420 --------------------------------------------------------------------
import os
import sys
from io import BytesIO, IOBase
def main():
n,m,b,mod=map(int,input().split())
arr=list(map(int,input().split()))
dp=[[0 for _ in range(b+1)] for _ in range(m+1)]
dp[0]=[1]*(b+1)
for item in arr:
for x in range(1,m+1):
for y in range(item,b+1):
dp[x][y]+=dp[x-1][y-item]
dp[x][y]%=mod
print(dp[m][b])
#----------------------------------------------------------------------------------------
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = 'x' in file.mode or 'r' not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b'\n') + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode('ascii'))
self.read = lambda: self.buffer.read().decode('ascii')
self.readline = lambda: self.buffer.readline().decode('ascii')
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip('\r\n')
# endregion
if __name__ == '__main__':
main()
```
Yes
| 101,603 | [
0.45166015625,
0.0000073909759521484375,
-0.331787109375,
0.1319580078125,
-0.466552734375,
-0.71533203125,
-0.053955078125,
0.2403564453125,
0.351318359375,
0.9716796875,
0.2034912109375,
-0.1051025390625,
0.14697265625,
-0.55810546875,
-0.388671875,
-0.191162109375,
-0.58642578125,... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every line of code that he writes.
Let's call a sequence of non-negative integers v1, v2, ..., vn a plan, if v1 + v2 + ... + vn = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v1 lines of the given task, then the second programmer writes v2 more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let's call a plan good, if all the written lines of the task contain at most b bugs in total.
Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.
Input
The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 109 + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.
The next line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 500) — the number of bugs per line for each programmer.
Output
Print a single integer — the answer to the problem modulo mod.
Examples
Input
3 3 3 100
1 1 1
Output
10
Input
3 6 5 1000000007
1 2 3
Output
0
Input
3 5 6 11
1 2 1
Output
0
Submitted Solution:
```
n, m, b, mod = map(int, input().split())
a = list(map(int, input().split()))
dp = [[0 for i in range(m + 1)] for j in range(b + 1)]
dp[0][0] = 1
for i in range(n):
for j in range(a[i], b + 1):
for k in range(m):
dp[j][k + 1] = (dp[j][k + 1] + dp[j - a[i]][k]) % mod
res = 0
for i in range(b + 1):
res = (res + dp[i][m]) % mod
print(res)
```
Yes
| 101,604 | [
0.386474609375,
-0.03509521484375,
-0.2042236328125,
0.04345703125,
-0.448974609375,
-0.69580078125,
-0.026824951171875,
0.1531982421875,
0.273193359375,
1.0439453125,
0.197021484375,
-0.09814453125,
0.1708984375,
-0.54443359375,
-0.327392578125,
-0.177001953125,
-0.599609375,
-0.9... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every line of code that he writes.
Let's call a sequence of non-negative integers v1, v2, ..., vn a plan, if v1 + v2 + ... + vn = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v1 lines of the given task, then the second programmer writes v2 more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let's call a plan good, if all the written lines of the task contain at most b bugs in total.
Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.
Input
The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 109 + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.
The next line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 500) — the number of bugs per line for each programmer.
Output
Print a single integer — the answer to the problem modulo mod.
Examples
Input
3 3 3 100
1 1 1
Output
10
Input
3 6 5 1000000007
1 2 3
Output
0
Input
3 5 6 11
1 2 1
Output
0
Submitted Solution:
```
import sys
input=sys.stdin.buffer.readline
n,lines,bugs,mod=map(int,input().split())
arr=list(map(int,input().split()))
dp=[[0 for i in range(bugs+1)] for j in range(lines+1)]
for i in range(n):
if arr[i] <=bugs:
dp[1][arr[i]] += 1
for j in range(lines):
for k in range(bugs):
if dp[j][k] >0 and k+arr[i] <=bugs:
dp[j+1][k+arr[i]] =(dp[j+1][k+arr[i]]+dp[j][k]) % mod
print(sum(dp[lines][:bugs+1])%mod)
```
No
| 101,605 | [
0.375,
-0.0276031494140625,
-0.20263671875,
0.072998046875,
-0.44140625,
-0.68603515625,
-0.03790283203125,
0.1593017578125,
0.2724609375,
1.0419921875,
0.2327880859375,
-0.12060546875,
0.1944580078125,
-0.5751953125,
-0.381591796875,
-0.228515625,
-0.55859375,
-0.947265625,
-0.5... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every line of code that he writes.
Let's call a sequence of non-negative integers v1, v2, ..., vn a plan, if v1 + v2 + ... + vn = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v1 lines of the given task, then the second programmer writes v2 more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let's call a plan good, if all the written lines of the task contain at most b bugs in total.
Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.
Input
The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 109 + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.
The next line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 500) — the number of bugs per line for each programmer.
Output
Print a single integer — the answer to the problem modulo mod.
Examples
Input
3 3 3 100
1 1 1
Output
10
Input
3 6 5 1000000007
1 2 3
Output
0
Input
3 5 6 11
1 2 1
Output
0
Submitted Solution:
```
n, m, b, mod = map(int, input().split())
a = list(map(int, input().split()))
dp = [[0 for col in range(b + 1)]for row in range(n)]
for i in range(n):
dp[i][0] = 1
for i in range(b + 1):
if i % a[0] == 0:
dp[0][i] = 1
for i in range(1, n):
for j in range(1, b + 1):
for k in range((j // a[i]) + 1):
dp[i][j] = dp[i - 1][j]
if k > 0:
dp[i][j] = (dp[i][j] + dp[i - 1][j - k * a[i]]) % mod
ans = 0
for i in range(b + 1):
ans = (ans + dp[n - 1][i]) % mod
print(ans)
```
No
| 101,606 | [
0.3828125,
-0.044830322265625,
-0.190673828125,
0.04486083984375,
-0.4296875,
-0.69580078125,
-0.0196990966796875,
0.1470947265625,
0.27734375,
1.03515625,
0.212158203125,
-0.09283447265625,
0.1690673828125,
-0.541015625,
-0.329833984375,
-0.1719970703125,
-0.5908203125,
-0.9619140... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every line of code that he writes.
Let's call a sequence of non-negative integers v1, v2, ..., vn a plan, if v1 + v2 + ... + vn = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v1 lines of the given task, then the second programmer writes v2 more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let's call a plan good, if all the written lines of the task contain at most b bugs in total.
Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.
Input
The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 109 + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.
The next line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 500) — the number of bugs per line for each programmer.
Output
Print a single integer — the answer to the problem modulo mod.
Examples
Input
3 3 3 100
1 1 1
Output
10
Input
3 6 5 1000000007
1 2 3
Output
0
Input
3 5 6 11
1 2 1
Output
0
Submitted Solution:
```
import sys
input=sys.stdin.buffer.readline
n,lines,bugs,mod=map(int,input().split())
arr=list(map(int,input().split()))
dp=[[0 for i in range(bugs+1)] for j in range(lines+1)]
for i in range(n):
if arr[i] <=bugs:
dp[1][arr[i]] =(dp[1][arr[i]]+1) % mod
for j in range(lines):
for k in range(bugs):
if dp[j][k] >0 and k+arr[i] <=bugs:
dp[j+1][k+arr[i]] =(dp[j+1][k+arr[i]]+dp[j][k]) % mod
print(sum(dp[lines][:bugs+1])%mod)
```
No
| 101,607 | [
0.37158203125,
-0.026458740234375,
-0.2012939453125,
0.06732177734375,
-0.4384765625,
-0.68701171875,
-0.043121337890625,
0.16015625,
0.271240234375,
1.0361328125,
0.234619140625,
-0.12066650390625,
0.1944580078125,
-0.578125,
-0.3828125,
-0.226318359375,
-0.5615234375,
-0.94482421... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly ai bugs in every line of code that he writes.
Let's call a sequence of non-negative integers v1, v2, ..., vn a plan, if v1 + v2 + ... + vn = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v1 lines of the given task, then the second programmer writes v2 more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let's call a plan good, if all the written lines of the task contain at most b bugs in total.
Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.
Input
The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 109 + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.
The next line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 500) — the number of bugs per line for each programmer.
Output
Print a single integer — the answer to the problem modulo mod.
Examples
Input
3 3 3 100
1 1 1
Output
10
Input
3 6 5 1000000007
1 2 3
Output
0
Input
3 5 6 11
1 2 1
Output
0
Submitted Solution:
```
import sys
input=sys.stdin.readline
n,m,b,mod=map(int,input().split())
a=list(map(int,input().split()))
dp1=[[0]*(b+1) for i in range(m+1)]
dp2=[[0]*(b+1) for i in range(m+1)]
dp1[0][0]=1
a=[0]+a
for i in range(1,n+1):
for j in range(m+1):
for k in range(b+1):
if k-a[i]>=0:
dp2[j][k]=(dp1[j][k]+dp2[j-1][k-a[i]])%mod
else:
dp2[j][k]=dp1[j][k]%mod
dp1=dp2
print(sum(dp2[m])%mod)
```
No
| 101,608 | [
0.37353515625,
-0.00771331787109375,
-0.195068359375,
0.054473876953125,
-0.478759765625,
-0.6943359375,
-0.08087158203125,
0.1649169921875,
0.25146484375,
1.0751953125,
0.184326171875,
-0.0875244140625,
0.1983642578125,
-0.53955078125,
-0.3466796875,
-0.203857421875,
-0.578125,
-0... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
In the online judge system, a judge file may include multiple datasets to check whether the submitted program outputs a correct answer for each test case. This task is to practice solving a problem with multiple datasets.
Write a program which reads an integer x and print it as is. Note that multiple datasets are given for this problem.
Constraints
* 1 ≤ x ≤ 10000
* The number of datasets ≤ 10000
Input
The input consists of multiple datasets. Each dataset consists of an integer x in a line.
The input ends with an integer 0. You program should not process (print) for this terminal symbol.
Output
For each dataset, print x in the following format:
Case i: x
where i is the case number which starts with 1. Put a single space between "Case" and i. Also, put a single space between ':' and x.
Example
Input
3
5
11
7
8
19
0
Output
Case 1: 3
Case 2: 5
Case 3: 11
Case 4: 7
Case 5: 8
Case 6: 19
"Correct Solution:
```
for i,a in enumerate(iter(input,'0')):print(f'Case {i+1}: {a}')
```
| 102,022 | [
0.415283203125,
0.218505859375,
0.04034423828125,
0.12493896484375,
-0.35595703125,
-0.64697265625,
-0.11669921875,
0.083740234375,
0.051055908203125,
0.7705078125,
0.587890625,
-0.260986328125,
0.6142578125,
-0.8798828125,
-0.429931640625,
-0.146484375,
-0.53369140625,
-0.56933593... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the online judge system, a judge file may include multiple datasets to check whether the submitted program outputs a correct answer for each test case. This task is to practice solving a problem with multiple datasets.
Write a program which reads an integer x and print it as is. Note that multiple datasets are given for this problem.
Constraints
* 1 ≤ x ≤ 10000
* The number of datasets ≤ 10000
Input
The input consists of multiple datasets. Each dataset consists of an integer x in a line.
The input ends with an integer 0. You program should not process (print) for this terminal symbol.
Output
For each dataset, print x in the following format:
Case i: x
where i is the case number which starts with 1. Put a single space between "Case" and i. Also, put a single space between ':' and x.
Example
Input
3
5
11
7
8
19
0
Output
Case 1: 3
Case 2: 5
Case 3: 11
Case 4: 7
Case 5: 8
Case 6: 19
Submitted Solution:
```
i = 1
while True:
n = input()
if n == "0":
break
print("Case {0}: {1}".format(i,n))
i += 1
```
Yes
| 102,024 | [
0.5078125,
0.277099609375,
0.115966796875,
0.16845703125,
-0.366455078125,
-0.59228515625,
-0.098876953125,
0.14990234375,
0.06622314453125,
0.93896484375,
0.546875,
-0.104736328125,
0.4501953125,
-0.82177734375,
-0.37548828125,
-0.1854248046875,
-0.380126953125,
-0.6591796875,
-... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the online judge system, a judge file may include multiple datasets to check whether the submitted program outputs a correct answer for each test case. This task is to practice solving a problem with multiple datasets.
Write a program which reads an integer x and print it as is. Note that multiple datasets are given for this problem.
Constraints
* 1 ≤ x ≤ 10000
* The number of datasets ≤ 10000
Input
The input consists of multiple datasets. Each dataset consists of an integer x in a line.
The input ends with an integer 0. You program should not process (print) for this terminal symbol.
Output
For each dataset, print x in the following format:
Case i: x
where i is the case number which starts with 1. Put a single space between "Case" and i. Also, put a single space between ':' and x.
Example
Input
3
5
11
7
8
19
0
Output
Case 1: 3
Case 2: 5
Case 3: 11
Case 4: 7
Case 5: 8
Case 6: 19
Submitted Solution:
```
for i in range(100000):
x = int(input())
if x == 0:
break
print('Case {}: {}'.format(i+1,x))
```
Yes
| 102,025 | [
0.4765625,
0.244873046875,
0.10406494140625,
0.1595458984375,
-0.365234375,
-0.587890625,
-0.099609375,
0.1728515625,
0.055267333984375,
0.92236328125,
0.56787109375,
-0.097900390625,
0.437255859375,
-0.84130859375,
-0.3828125,
-0.1624755859375,
-0.364501953125,
-0.66943359375,
-... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the online judge system, a judge file may include multiple datasets to check whether the submitted program outputs a correct answer for each test case. This task is to practice solving a problem with multiple datasets.
Write a program which reads an integer x and print it as is. Note that multiple datasets are given for this problem.
Constraints
* 1 ≤ x ≤ 10000
* The number of datasets ≤ 10000
Input
The input consists of multiple datasets. Each dataset consists of an integer x in a line.
The input ends with an integer 0. You program should not process (print) for this terminal symbol.
Output
For each dataset, print x in the following format:
Case i: x
where i is the case number which starts with 1. Put a single space between "Case" and i. Also, put a single space between ':' and x.
Example
Input
3
5
11
7
8
19
0
Output
Case 1: 3
Case 2: 5
Case 3: 11
Case 4: 7
Case 5: 8
Case 6: 19
Submitted Solution:
```
cnt = 1
while 1:
x=int(input())
if x == 0:
break;
print("Case %d: %d"%(cnt,x))
cnt+=1
```
Yes
| 102,026 | [
0.478759765625,
0.2318115234375,
0.1329345703125,
0.139892578125,
-0.256103515625,
-0.56494140625,
-0.0982666015625,
0.12335205078125,
0.0601806640625,
0.96337890625,
0.53466796875,
-0.0782470703125,
0.4140625,
-0.86669921875,
-0.403564453125,
-0.171875,
-0.35595703125,
-0.6484375,... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the online judge system, a judge file may include multiple datasets to check whether the submitted program outputs a correct answer for each test case. This task is to practice solving a problem with multiple datasets.
Write a program which reads an integer x and print it as is. Note that multiple datasets are given for this problem.
Constraints
* 1 ≤ x ≤ 10000
* The number of datasets ≤ 10000
Input
The input consists of multiple datasets. Each dataset consists of an integer x in a line.
The input ends with an integer 0. You program should not process (print) for this terminal symbol.
Output
For each dataset, print x in the following format:
Case i: x
where i is the case number which starts with 1. Put a single space between "Case" and i. Also, put a single space between ':' and x.
Example
Input
3
5
11
7
8
19
0
Output
Case 1: 3
Case 2: 5
Case 3: 11
Case 4: 7
Case 5: 8
Case 6: 19
Submitted Solution:
```
i=1
x=int(input())
while x!=0:
print("Case {0}: {1}".format(i,x))
i=i+1
x= int(input())
```
Yes
| 102,027 | [
0.50439453125,
0.251708984375,
0.11663818359375,
0.148193359375,
-0.3828125,
-0.57177734375,
-0.0977783203125,
0.147216796875,
0.055572509765625,
0.91748046875,
0.5400390625,
-0.083251953125,
0.4296875,
-0.80615234375,
-0.37744140625,
-0.18212890625,
-0.380615234375,
-0.70556640625... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the online judge system, a judge file may include multiple datasets to check whether the submitted program outputs a correct answer for each test case. This task is to practice solving a problem with multiple datasets.
Write a program which reads an integer x and print it as is. Note that multiple datasets are given for this problem.
Constraints
* 1 ≤ x ≤ 10000
* The number of datasets ≤ 10000
Input
The input consists of multiple datasets. Each dataset consists of an integer x in a line.
The input ends with an integer 0. You program should not process (print) for this terminal symbol.
Output
For each dataset, print x in the following format:
Case i: x
where i is the case number which starts with 1. Put a single space between "Case" and i. Also, put a single space between ':' and x.
Example
Input
3
5
11
7
8
19
0
Output
Case 1: 3
Case 2: 5
Case 3: 11
Case 4: 7
Case 5: 8
Case 6: 19
Submitted Solution:
```
#!/usr/bin/python3
# -*- coding: utf-8 -*-
import sys
num = 0
while True:
s = sys.stdin.readline().strip()
if s == '0':
break
num += 1
print('Case: ', num, ' ', s, sep='')
```
No
| 102,028 | [
0.51611328125,
0.279052734375,
0.1273193359375,
0.13427734375,
-0.444091796875,
-0.6318359375,
-0.0623779296875,
0.1317138671875,
-0.01038360595703125,
0.91015625,
0.5244140625,
-0.14501953125,
0.4111328125,
-0.7392578125,
-0.45654296875,
-0.24267578125,
-0.366943359375,
-0.6728515... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the online judge system, a judge file may include multiple datasets to check whether the submitted program outputs a correct answer for each test case. This task is to practice solving a problem with multiple datasets.
Write a program which reads an integer x and print it as is. Note that multiple datasets are given for this problem.
Constraints
* 1 ≤ x ≤ 10000
* The number of datasets ≤ 10000
Input
The input consists of multiple datasets. Each dataset consists of an integer x in a line.
The input ends with an integer 0. You program should not process (print) for this terminal symbol.
Output
For each dataset, print x in the following format:
Case i: x
where i is the case number which starts with 1. Put a single space between "Case" and i. Also, put a single space between ':' and x.
Example
Input
3
5
11
7
8
19
0
Output
Case 1: 3
Case 2: 5
Case 3: 11
Case 4: 7
Case 5: 8
Case 6: 19
Submitted Solution:
```
a =0
while True:
n =int(input())
a+=1
if n==0:
break
else:
print("Case" + str(a)+": "+str(n))
```
No
| 102,029 | [
0.51611328125,
0.255126953125,
0.09576416015625,
0.20556640625,
-0.373779296875,
-0.607421875,
-0.09271240234375,
0.1309814453125,
0.054473876953125,
0.92578125,
0.56689453125,
-0.119140625,
0.444580078125,
-0.841796875,
-0.397216796875,
-0.2010498046875,
-0.383056640625,
-0.678710... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the online judge system, a judge file may include multiple datasets to check whether the submitted program outputs a correct answer for each test case. This task is to practice solving a problem with multiple datasets.
Write a program which reads an integer x and print it as is. Note that multiple datasets are given for this problem.
Constraints
* 1 ≤ x ≤ 10000
* The number of datasets ≤ 10000
Input
The input consists of multiple datasets. Each dataset consists of an integer x in a line.
The input ends with an integer 0. You program should not process (print) for this terminal symbol.
Output
For each dataset, print x in the following format:
Case i: x
where i is the case number which starts with 1. Put a single space between "Case" and i. Also, put a single space between ':' and x.
Example
Input
3
5
11
7
8
19
0
Output
Case 1: 3
Case 2: 5
Case 3: 11
Case 4: 7
Case 5: 8
Case 6: 19
Submitted Solution:
```
i=1
while True:
x=int(input())
if x==0: break
print("Case {}: {}".format(i,x))
i+=1
```
No
| 102,030 | [
0.50048828125,
0.26171875,
0.10906982421875,
0.154052734375,
-0.365234375,
-0.6103515625,
-0.10345458984375,
0.1578369140625,
0.04620361328125,
0.91796875,
0.58349609375,
-0.0841064453125,
0.42333984375,
-0.8310546875,
-0.377197265625,
-0.18505859375,
-0.3671875,
-0.66943359375,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the online judge system, a judge file may include multiple datasets to check whether the submitted program outputs a correct answer for each test case. This task is to practice solving a problem with multiple datasets.
Write a program which reads an integer x and print it as is. Note that multiple datasets are given for this problem.
Constraints
* 1 ≤ x ≤ 10000
* The number of datasets ≤ 10000
Input
The input consists of multiple datasets. Each dataset consists of an integer x in a line.
The input ends with an integer 0. You program should not process (print) for this terminal symbol.
Output
For each dataset, print x in the following format:
Case i: x
where i is the case number which starts with 1. Put a single space between "Case" and i. Also, put a single space between ':' and x.
Example
Input
3
5
11
7
8
19
0
Output
Case 1: 3
Case 2: 5
Case 3: 11
Case 4: 7
Case 5: 8
Case 6: 19
Submitted Solution:
```
i = 1
while True:
x = int(input)
if x == 0:
break
print(f"Case {i}: {x}")
i += 1
```
No
| 102,031 | [
0.5,
0.25537109375,
0.09710693359375,
0.1575927734375,
-0.356201171875,
-0.62890625,
-0.10400390625,
0.1639404296875,
0.03192138671875,
0.9140625,
0.609375,
-0.056488037109375,
0.434326171875,
-0.83642578125,
-0.376220703125,
-0.181396484375,
-0.36767578125,
-0.66552734375,
-0.55... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an upcoming movie director, and you have just released your first movie. You have also launched a simple review site with two buttons to press — upvote and downvote.
However, the site is not so simple on the inside. There are two servers, each with its separate counts for the upvotes and the downvotes.
n reviewers enter the site one by one. Each reviewer is one of the following types:
* type 1: a reviewer has watched the movie, and they like it — they press the upvote button;
* type 2: a reviewer has watched the movie, and they dislike it — they press the downvote button;
* type 3: a reviewer hasn't watched the movie — they look at the current number of upvotes and downvotes of the movie on the server they are in and decide what button to press. If there are more downvotes than upvotes, then a reviewer downvotes the movie. Otherwise, they upvote the movie.
Each reviewer votes on the movie exactly once.
Since you have two servers, you can actually manipulate the votes so that your movie gets as many upvotes as possible. When a reviewer enters a site, you know their type, and you can send them either to the first server or to the second one.
What is the maximum total number of upvotes you can gather over both servers if you decide which server to send each reviewer to?
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of testcases.
Then the descriptions of t testcases follow.
The first line of each testcase contains a single integer n (1 ≤ n ≤ 50) — the number of reviewers.
The second line of each testcase contains n integers r_1, r_2, ..., r_n (1 ≤ r_i ≤ 3) — the types of the reviewers in the same order they enter the site.
Output
For each testcase print a single integer — the maximum total number of upvotes you can gather over both servers if you decide which server to send each reviewer to.
Example
Input
4
1
2
3
1 2 3
5
1 1 1 1 1
3
3 3 2
Output
0
2
5
2
Note
In the first testcase of the example you can send the only reviewer to either of the servers — they'll downvote anyway. The movie won't receive any upvotes.
In the second testcase of the example you can send all reviewers to the first server:
* the first reviewer upvotes;
* the second reviewer downvotes;
* the last reviewer sees that the number of downvotes is not greater than the number of upvotes — upvote themselves.
There are two upvotes in total. Alternatevely, you can send the first and the second reviewers to the first server and the last reviewer — to the second server:
* the first reviewer upvotes on the first server;
* the second reviewer downvotes on the first server;
* the last reviewer sees no upvotes or downvotes on the second server — upvote themselves.
Submitted Solution:
```
t = int(input().rstrip())
for _ in range(t):
n = int(input().rstrip())
list1 = list(map(int, input().rstrip().split(" ")))
max1 = 0
count1 = 0
count2 = 0
for i in list1:
if i == 1:
count1 += 1
max1 = max([max1, count1])
elif i == 3:
count1 += 1
print(count1)
```
Yes
| 102,293 | [
0.28466796875,
0.289306640625,
-0.40283203125,
-0.275634765625,
-0.7001953125,
-0.470947265625,
0.07659912109375,
0.389404296875,
0.002704620361328125,
1.1650390625,
0.1885986328125,
0.299560546875,
0.44384765625,
-0.418212890625,
-0.202880859375,
0.057525634765625,
-0.63427734375,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an upcoming movie director, and you have just released your first movie. You have also launched a simple review site with two buttons to press — upvote and downvote.
However, the site is not so simple on the inside. There are two servers, each with its separate counts for the upvotes and the downvotes.
n reviewers enter the site one by one. Each reviewer is one of the following types:
* type 1: a reviewer has watched the movie, and they like it — they press the upvote button;
* type 2: a reviewer has watched the movie, and they dislike it — they press the downvote button;
* type 3: a reviewer hasn't watched the movie — they look at the current number of upvotes and downvotes of the movie on the server they are in and decide what button to press. If there are more downvotes than upvotes, then a reviewer downvotes the movie. Otherwise, they upvote the movie.
Each reviewer votes on the movie exactly once.
Since you have two servers, you can actually manipulate the votes so that your movie gets as many upvotes as possible. When a reviewer enters a site, you know their type, and you can send them either to the first server or to the second one.
What is the maximum total number of upvotes you can gather over both servers if you decide which server to send each reviewer to?
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of testcases.
Then the descriptions of t testcases follow.
The first line of each testcase contains a single integer n (1 ≤ n ≤ 50) — the number of reviewers.
The second line of each testcase contains n integers r_1, r_2, ..., r_n (1 ≤ r_i ≤ 3) — the types of the reviewers in the same order they enter the site.
Output
For each testcase print a single integer — the maximum total number of upvotes you can gather over both servers if you decide which server to send each reviewer to.
Example
Input
4
1
2
3
1 2 3
5
1 1 1 1 1
3
3 3 2
Output
0
2
5
2
Note
In the first testcase of the example you can send the only reviewer to either of the servers — they'll downvote anyway. The movie won't receive any upvotes.
In the second testcase of the example you can send all reviewers to the first server:
* the first reviewer upvotes;
* the second reviewer downvotes;
* the last reviewer sees that the number of downvotes is not greater than the number of upvotes — upvote themselves.
There are two upvotes in total. Alternatevely, you can send the first and the second reviewers to the first server and the last reviewer — to the second server:
* the first reviewer upvotes on the first server;
* the second reviewer downvotes on the first server;
* the last reviewer sees no upvotes or downvotes on the second server — upvote themselves.
Submitted Solution:
```
def ints():
return list(map(int, input().split()))
def case():
n, = ints()
r = ints()
return n - r.count(2)
t, = ints()
for i in range(t):
print(case())
```
Yes
| 102,294 | [
0.28466796875,
0.289306640625,
-0.40283203125,
-0.275634765625,
-0.7001953125,
-0.470947265625,
0.07659912109375,
0.389404296875,
0.002704620361328125,
1.1650390625,
0.1885986328125,
0.299560546875,
0.44384765625,
-0.418212890625,
-0.202880859375,
0.057525634765625,
-0.63427734375,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an upcoming movie director, and you have just released your first movie. You have also launched a simple review site with two buttons to press — upvote and downvote.
However, the site is not so simple on the inside. There are two servers, each with its separate counts for the upvotes and the downvotes.
n reviewers enter the site one by one. Each reviewer is one of the following types:
* type 1: a reviewer has watched the movie, and they like it — they press the upvote button;
* type 2: a reviewer has watched the movie, and they dislike it — they press the downvote button;
* type 3: a reviewer hasn't watched the movie — they look at the current number of upvotes and downvotes of the movie on the server they are in and decide what button to press. If there are more downvotes than upvotes, then a reviewer downvotes the movie. Otherwise, they upvote the movie.
Each reviewer votes on the movie exactly once.
Since you have two servers, you can actually manipulate the votes so that your movie gets as many upvotes as possible. When a reviewer enters a site, you know their type, and you can send them either to the first server or to the second one.
What is the maximum total number of upvotes you can gather over both servers if you decide which server to send each reviewer to?
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of testcases.
Then the descriptions of t testcases follow.
The first line of each testcase contains a single integer n (1 ≤ n ≤ 50) — the number of reviewers.
The second line of each testcase contains n integers r_1, r_2, ..., r_n (1 ≤ r_i ≤ 3) — the types of the reviewers in the same order they enter the site.
Output
For each testcase print a single integer — the maximum total number of upvotes you can gather over both servers if you decide which server to send each reviewer to.
Example
Input
4
1
2
3
1 2 3
5
1 1 1 1 1
3
3 3 2
Output
0
2
5
2
Note
In the first testcase of the example you can send the only reviewer to either of the servers — they'll downvote anyway. The movie won't receive any upvotes.
In the second testcase of the example you can send all reviewers to the first server:
* the first reviewer upvotes;
* the second reviewer downvotes;
* the last reviewer sees that the number of downvotes is not greater than the number of upvotes — upvote themselves.
There are two upvotes in total. Alternatevely, you can send the first and the second reviewers to the first server and the last reviewer — to the second server:
* the first reviewer upvotes on the first server;
* the second reviewer downvotes on the first server;
* the last reviewer sees no upvotes or downvotes on the second server — upvote themselves.
Submitted Solution:
```
from collections import Counter
from itertools import permutations
def getlist():
return list(map(int,input().split()))
def main():
t = int(input())
for num in range(t):
n = int(input())
arr = getlist()
count = Counter(arr)
down = count[2]
print(n-down)
main()
```
Yes
| 102,295 | [
0.28466796875,
0.289306640625,
-0.40283203125,
-0.275634765625,
-0.7001953125,
-0.470947265625,
0.07659912109375,
0.389404296875,
0.002704620361328125,
1.1650390625,
0.1885986328125,
0.299560546875,
0.44384765625,
-0.418212890625,
-0.202880859375,
0.057525634765625,
-0.63427734375,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an upcoming movie director, and you have just released your first movie. You have also launched a simple review site with two buttons to press — upvote and downvote.
However, the site is not so simple on the inside. There are two servers, each with its separate counts for the upvotes and the downvotes.
n reviewers enter the site one by one. Each reviewer is one of the following types:
* type 1: a reviewer has watched the movie, and they like it — they press the upvote button;
* type 2: a reviewer has watched the movie, and they dislike it — they press the downvote button;
* type 3: a reviewer hasn't watched the movie — they look at the current number of upvotes and downvotes of the movie on the server they are in and decide what button to press. If there are more downvotes than upvotes, then a reviewer downvotes the movie. Otherwise, they upvote the movie.
Each reviewer votes on the movie exactly once.
Since you have two servers, you can actually manipulate the votes so that your movie gets as many upvotes as possible. When a reviewer enters a site, you know their type, and you can send them either to the first server or to the second one.
What is the maximum total number of upvotes you can gather over both servers if you decide which server to send each reviewer to?
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of testcases.
Then the descriptions of t testcases follow.
The first line of each testcase contains a single integer n (1 ≤ n ≤ 50) — the number of reviewers.
The second line of each testcase contains n integers r_1, r_2, ..., r_n (1 ≤ r_i ≤ 3) — the types of the reviewers in the same order they enter the site.
Output
For each testcase print a single integer — the maximum total number of upvotes you can gather over both servers if you decide which server to send each reviewer to.
Example
Input
4
1
2
3
1 2 3
5
1 1 1 1 1
3
3 3 2
Output
0
2
5
2
Note
In the first testcase of the example you can send the only reviewer to either of the servers — they'll downvote anyway. The movie won't receive any upvotes.
In the second testcase of the example you can send all reviewers to the first server:
* the first reviewer upvotes;
* the second reviewer downvotes;
* the last reviewer sees that the number of downvotes is not greater than the number of upvotes — upvote themselves.
There are two upvotes in total. Alternatevely, you can send the first and the second reviewers to the first server and the last reviewer — to the second server:
* the first reviewer upvotes on the first server;
* the second reviewer downvotes on the first server;
* the last reviewer sees no upvotes or downvotes on the second server — upvote themselves.
Submitted Solution:
```
T = int(input())
for t in range(T):
n = int(input())
ret = 0
for r in [int(x) for x in input().split()]:
if r == 1 or r == 3:
ret += 1
print(ret)
```
Yes
| 102,296 | [
0.28466796875,
0.289306640625,
-0.40283203125,
-0.275634765625,
-0.7001953125,
-0.470947265625,
0.07659912109375,
0.389404296875,
0.002704620361328125,
1.1650390625,
0.1885986328125,
0.299560546875,
0.44384765625,
-0.418212890625,
-0.202880859375,
0.057525634765625,
-0.63427734375,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an upcoming movie director, and you have just released your first movie. You have also launched a simple review site with two buttons to press — upvote and downvote.
However, the site is not so simple on the inside. There are two servers, each with its separate counts for the upvotes and the downvotes.
n reviewers enter the site one by one. Each reviewer is one of the following types:
* type 1: a reviewer has watched the movie, and they like it — they press the upvote button;
* type 2: a reviewer has watched the movie, and they dislike it — they press the downvote button;
* type 3: a reviewer hasn't watched the movie — they look at the current number of upvotes and downvotes of the movie on the server they are in and decide what button to press. If there are more downvotes than upvotes, then a reviewer downvotes the movie. Otherwise, they upvote the movie.
Each reviewer votes on the movie exactly once.
Since you have two servers, you can actually manipulate the votes so that your movie gets as many upvotes as possible. When a reviewer enters a site, you know their type, and you can send them either to the first server or to the second one.
What is the maximum total number of upvotes you can gather over both servers if you decide which server to send each reviewer to?
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of testcases.
Then the descriptions of t testcases follow.
The first line of each testcase contains a single integer n (1 ≤ n ≤ 50) — the number of reviewers.
The second line of each testcase contains n integers r_1, r_2, ..., r_n (1 ≤ r_i ≤ 3) — the types of the reviewers in the same order they enter the site.
Output
For each testcase print a single integer — the maximum total number of upvotes you can gather over both servers if you decide which server to send each reviewer to.
Example
Input
4
1
2
3
1 2 3
5
1 1 1 1 1
3
3 3 2
Output
0
2
5
2
Note
In the first testcase of the example you can send the only reviewer to either of the servers — they'll downvote anyway. The movie won't receive any upvotes.
In the second testcase of the example you can send all reviewers to the first server:
* the first reviewer upvotes;
* the second reviewer downvotes;
* the last reviewer sees that the number of downvotes is not greater than the number of upvotes — upvote themselves.
There are two upvotes in total. Alternatevely, you can send the first and the second reviewers to the first server and the last reviewer — to the second server:
* the first reviewer upvotes on the first server;
* the second reviewer downvotes on the first server;
* the last reviewer sees no upvotes or downvotes on the second server — upvote themselves.
Submitted Solution:
```
t=int(input())
for tt in range(t):
n = int(input())
a=list(map(int,input().split()))
b=0
c=0
for i in range(n):
if a[i]==1:
b+=1
elif a[i]==2:
c+=1
elif a[i]==3:
if b>=c:
b+=1
else:
c+=1
print(b)
```
No
| 102,297 | [
0.28466796875,
0.289306640625,
-0.40283203125,
-0.275634765625,
-0.7001953125,
-0.470947265625,
0.07659912109375,
0.389404296875,
0.002704620361328125,
1.1650390625,
0.1885986328125,
0.299560546875,
0.44384765625,
-0.418212890625,
-0.202880859375,
0.057525634765625,
-0.63427734375,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an upcoming movie director, and you have just released your first movie. You have also launched a simple review site with two buttons to press — upvote and downvote.
However, the site is not so simple on the inside. There are two servers, each with its separate counts for the upvotes and the downvotes.
n reviewers enter the site one by one. Each reviewer is one of the following types:
* type 1: a reviewer has watched the movie, and they like it — they press the upvote button;
* type 2: a reviewer has watched the movie, and they dislike it — they press the downvote button;
* type 3: a reviewer hasn't watched the movie — they look at the current number of upvotes and downvotes of the movie on the server they are in and decide what button to press. If there are more downvotes than upvotes, then a reviewer downvotes the movie. Otherwise, they upvote the movie.
Each reviewer votes on the movie exactly once.
Since you have two servers, you can actually manipulate the votes so that your movie gets as many upvotes as possible. When a reviewer enters a site, you know their type, and you can send them either to the first server or to the second one.
What is the maximum total number of upvotes you can gather over both servers if you decide which server to send each reviewer to?
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of testcases.
Then the descriptions of t testcases follow.
The first line of each testcase contains a single integer n (1 ≤ n ≤ 50) — the number of reviewers.
The second line of each testcase contains n integers r_1, r_2, ..., r_n (1 ≤ r_i ≤ 3) — the types of the reviewers in the same order they enter the site.
Output
For each testcase print a single integer — the maximum total number of upvotes you can gather over both servers if you decide which server to send each reviewer to.
Example
Input
4
1
2
3
1 2 3
5
1 1 1 1 1
3
3 3 2
Output
0
2
5
2
Note
In the first testcase of the example you can send the only reviewer to either of the servers — they'll downvote anyway. The movie won't receive any upvotes.
In the second testcase of the example you can send all reviewers to the first server:
* the first reviewer upvotes;
* the second reviewer downvotes;
* the last reviewer sees that the number of downvotes is not greater than the number of upvotes — upvote themselves.
There are two upvotes in total. Alternatevely, you can send the first and the second reviewers to the first server and the last reviewer — to the second server:
* the first reviewer upvotes on the first server;
* the second reviewer downvotes on the first server;
* the last reviewer sees no upvotes or downvotes on the second server — upvote themselves.
Submitted Solution:
```
t=int(input())
for _ in range(t):
n=int(input())
l=list(map(int,input().split()))
score=0
down=0
for i in l:
if i==1:
score+=1
elif i==2:
down+=1
else:
if down>score:
down+=1
else:
score+=1
print(score)
```
No
| 102,298 | [
0.28466796875,
0.289306640625,
-0.40283203125,
-0.275634765625,
-0.7001953125,
-0.470947265625,
0.07659912109375,
0.389404296875,
0.002704620361328125,
1.1650390625,
0.1885986328125,
0.299560546875,
0.44384765625,
-0.418212890625,
-0.202880859375,
0.057525634765625,
-0.63427734375,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an upcoming movie director, and you have just released your first movie. You have also launched a simple review site with two buttons to press — upvote and downvote.
However, the site is not so simple on the inside. There are two servers, each with its separate counts for the upvotes and the downvotes.
n reviewers enter the site one by one. Each reviewer is one of the following types:
* type 1: a reviewer has watched the movie, and they like it — they press the upvote button;
* type 2: a reviewer has watched the movie, and they dislike it — they press the downvote button;
* type 3: a reviewer hasn't watched the movie — they look at the current number of upvotes and downvotes of the movie on the server they are in and decide what button to press. If there are more downvotes than upvotes, then a reviewer downvotes the movie. Otherwise, they upvote the movie.
Each reviewer votes on the movie exactly once.
Since you have two servers, you can actually manipulate the votes so that your movie gets as many upvotes as possible. When a reviewer enters a site, you know their type, and you can send them either to the first server or to the second one.
What is the maximum total number of upvotes you can gather over both servers if you decide which server to send each reviewer to?
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of testcases.
Then the descriptions of t testcases follow.
The first line of each testcase contains a single integer n (1 ≤ n ≤ 50) — the number of reviewers.
The second line of each testcase contains n integers r_1, r_2, ..., r_n (1 ≤ r_i ≤ 3) — the types of the reviewers in the same order they enter the site.
Output
For each testcase print a single integer — the maximum total number of upvotes you can gather over both servers if you decide which server to send each reviewer to.
Example
Input
4
1
2
3
1 2 3
5
1 1 1 1 1
3
3 3 2
Output
0
2
5
2
Note
In the first testcase of the example you can send the only reviewer to either of the servers — they'll downvote anyway. The movie won't receive any upvotes.
In the second testcase of the example you can send all reviewers to the first server:
* the first reviewer upvotes;
* the second reviewer downvotes;
* the last reviewer sees that the number of downvotes is not greater than the number of upvotes — upvote themselves.
There are two upvotes in total. Alternatevely, you can send the first and the second reviewers to the first server and the last reviewer — to the second server:
* the first reviewer upvotes on the first server;
* the second reviewer downvotes on the first server;
* the last reviewer sees no upvotes or downvotes on the second server — upvote themselves.
Submitted Solution:
```
for t in range(int(input())):
n= int(input())
lis = list(map(int, input().split()))
up=0
dw=0
for i in lis:
if i == 1:
up+=1
elif i == 2:
dw+=1
elif up>=dw:
up+=1
print(up)
```
No
| 102,299 | [
0.28466796875,
0.289306640625,
-0.40283203125,
-0.275634765625,
-0.7001953125,
-0.470947265625,
0.07659912109375,
0.389404296875,
0.002704620361328125,
1.1650390625,
0.1885986328125,
0.299560546875,
0.44384765625,
-0.418212890625,
-0.202880859375,
0.057525634765625,
-0.63427734375,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an upcoming movie director, and you have just released your first movie. You have also launched a simple review site with two buttons to press — upvote and downvote.
However, the site is not so simple on the inside. There are two servers, each with its separate counts for the upvotes and the downvotes.
n reviewers enter the site one by one. Each reviewer is one of the following types:
* type 1: a reviewer has watched the movie, and they like it — they press the upvote button;
* type 2: a reviewer has watched the movie, and they dislike it — they press the downvote button;
* type 3: a reviewer hasn't watched the movie — they look at the current number of upvotes and downvotes of the movie on the server they are in and decide what button to press. If there are more downvotes than upvotes, then a reviewer downvotes the movie. Otherwise, they upvote the movie.
Each reviewer votes on the movie exactly once.
Since you have two servers, you can actually manipulate the votes so that your movie gets as many upvotes as possible. When a reviewer enters a site, you know their type, and you can send them either to the first server or to the second one.
What is the maximum total number of upvotes you can gather over both servers if you decide which server to send each reviewer to?
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of testcases.
Then the descriptions of t testcases follow.
The first line of each testcase contains a single integer n (1 ≤ n ≤ 50) — the number of reviewers.
The second line of each testcase contains n integers r_1, r_2, ..., r_n (1 ≤ r_i ≤ 3) — the types of the reviewers in the same order they enter the site.
Output
For each testcase print a single integer — the maximum total number of upvotes you can gather over both servers if you decide which server to send each reviewer to.
Example
Input
4
1
2
3
1 2 3
5
1 1 1 1 1
3
3 3 2
Output
0
2
5
2
Note
In the first testcase of the example you can send the only reviewer to either of the servers — they'll downvote anyway. The movie won't receive any upvotes.
In the second testcase of the example you can send all reviewers to the first server:
* the first reviewer upvotes;
* the second reviewer downvotes;
* the last reviewer sees that the number of downvotes is not greater than the number of upvotes — upvote themselves.
There are two upvotes in total. Alternatevely, you can send the first and the second reviewers to the first server and the last reviewer — to the second server:
* the first reviewer upvotes on the first server;
* the second reviewer downvotes on the first server;
* the last reviewer sees no upvotes or downvotes on the second server — upvote themselves.
Submitted Solution:
```
"""
Author : Ashish Sasmal
Python3
"""
from sys import stdin as sin
def aint():return int(input())
def amap():return map(int,sin.readline().split())
def alist():return list(map(int,sin.readline().split()))
def astr():return input()
for _ in range(aint()):
n = aint()
l = alist()
up1=0
up2=0
d1=0
d2=0
for i in range(n):
if l[i]==1:
if d1>=0 and d2>=0:
if d1>=d2:
up2+=1
d2+=1
else:
up1+=1
d1+=1
elif d1>=0:
up1+=1
d1+=1
elif d2>=0:
up2+=1
d2+=1
elif d1<d2:
d1+=1
up1+=1
else:
d2+=1
up2+=1
elif l[i]==2:
if d1>=0 and d2>=0:
if d1>=d2:
d1-=1
else:
d2-=1
elif d1>=0:
d1-=1
elif d2>=0:
d2-=1
elif d1<d2:
d2-=1
else:
d1-=1
else:
if d1>=0 and d2>=0:
if d1<=d2:
up1+=1
d1+=1
else:
up2+=1
d2+=1
elif d1>=0:
up1+=1
d1+=1
elif d2>=0:
up2+=1
d2+=1
elif d1<=d2:
d2-=1
else:
d1-=1
print(up1+up2)
```
No
| 102,300 | [
0.28466796875,
0.289306640625,
-0.40283203125,
-0.275634765625,
-0.7001953125,
-0.470947265625,
0.07659912109375,
0.389404296875,
0.002704620361328125,
1.1650390625,
0.1885986328125,
0.299560546875,
0.44384765625,
-0.418212890625,
-0.202880859375,
0.057525634765625,
-0.63427734375,
... | 11 |
Provide a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY came up with another splendid problem for the ABBYY Cup participants! This time the Beaver invites the contest participants to check out a problem on sorting documents by their subjects. Let's describe the problem:
You've got some training set of documents. For each document you know its subject. The subject in this problem is an integer from 1 to 3. Each of these numbers has a physical meaning. For instance, all documents with subject 3 are about trade.
You can download the training set of documents at the following link: http://download4.abbyy.com/a2/X2RZ2ZWXBG5VYWAL61H76ZQM/train.zip. The archive contains three directories with names "1", "2", "3". Directory named "1" contains documents on the 1-st subject, directory "2" contains documents on the 2-nd subject, and directory "3" contains documents on the 3-rd subject. Each document corresponds to exactly one file from some directory.
All documents have the following format: the first line contains the document identifier, the second line contains the name of the document, all subsequent lines contain the text of the document. The document identifier is used to make installing the problem more convenient and has no useful information for the participants.
You need to write a program that should indicate the subject for a given document. It is guaranteed that all documents given as input to your program correspond to one of the three subjects of the training set.
Input
The first line contains integer id (0 ≤ id ≤ 106) — the document identifier. The second line contains the name of the document. The third and the subsequent lines contain the text of the document. It is guaranteed that the size of any given document will not exceed 10 kilobytes.
The tests for this problem are divided into 10 groups. Documents of groups 1 and 2 are taken from the training set, but their identifiers will not match the identifiers specified in the training set. Groups from the 3-rd to the 10-th are roughly sorted by the author in ascending order of difficulty (these groups contain documents which aren't present in the training set).
Output
Print an integer from 1 to 3, inclusive — the number of the subject the given document corresponds to.
Examples
"Correct Solution:
```
print('1')
```
| 102,349 | [
0.41845703125,
-0.08306884765625,
-0.00977325439453125,
0.3193359375,
-0.400634765625,
-0.1575927734375,
-0.10443115234375,
0.1527099609375,
0.296875,
0.7490234375,
0.303466796875,
-0.2080078125,
0.3349609375,
-0.51953125,
-0.61376953125,
0.212158203125,
-0.3603515625,
-0.751464843... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem 1 is the easiest and problem n is the hardest. Limak knows it will take him 5·i minutes to solve the i-th problem.
Limak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs k minutes to get there from his house, where he will participate in the contest first.
How many problems can Limak solve if he wants to make it to the party?
Input
The only line of the input contains two integers n and k (1 ≤ n ≤ 10, 1 ≤ k ≤ 240) — the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.
Output
Print one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.
Examples
Input
3 222
Output
2
Input
4 190
Output
4
Input
7 1
Output
7
Note
In the first sample, there are 3 problems and Limak needs 222 minutes to get to the party. The three problems require 5, 10 and 15 minutes respectively. Limak can spend 5 + 10 = 15 minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after 222 minutes). In this scenario Limak would solve 2 problems. He doesn't have enough time to solve 3 problems so the answer is 2.
In the second sample, Limak can solve all 4 problems in 5 + 10 + 15 + 20 = 50 minutes. At 20:50 he will leave the house and go to the party. He will get there exactly at midnight.
In the third sample, Limak needs only 1 minute to get to the party. He has enough time to solve all 7 problems.
Submitted Solution:
```
def count(i):
k=0
for j in range(i+1):
k+=5*j
return k
def main():
m,n=map(int,input().split())
les=240-n
kk=0
for i in range(m+1):
k=count(i)
if k<=les:
kk=i
print(kk)
main()
```
Yes
| 102,558 | [
0.69677734375,
0.1741943359375,
-0.27294921875,
-0.007320404052734375,
-0.486572265625,
-0.425537109375,
-0.31396484375,
0.4765625,
0.08990478515625,
1.0810546875,
0.451904296875,
-0.301025390625,
0.1402587890625,
-0.83251953125,
-0.305419921875,
0.1363525390625,
-0.77099609375,
-0... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem 1 is the easiest and problem n is the hardest. Limak knows it will take him 5·i minutes to solve the i-th problem.
Limak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs k minutes to get there from his house, where he will participate in the contest first.
How many problems can Limak solve if he wants to make it to the party?
Input
The only line of the input contains two integers n and k (1 ≤ n ≤ 10, 1 ≤ k ≤ 240) — the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.
Output
Print one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.
Examples
Input
3 222
Output
2
Input
4 190
Output
4
Input
7 1
Output
7
Note
In the first sample, there are 3 problems and Limak needs 222 minutes to get to the party. The three problems require 5, 10 and 15 minutes respectively. Limak can spend 5 + 10 = 15 minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after 222 minutes). In this scenario Limak would solve 2 problems. He doesn't have enough time to solve 3 problems so the answer is 2.
In the second sample, Limak can solve all 4 problems in 5 + 10 + 15 + 20 = 50 minutes. At 20:50 he will leave the house and go to the party. He will get there exactly at midnight.
In the third sample, Limak needs only 1 minute to get to the party. He has enough time to solve all 7 problems.
Submitted Solution:
```
def in_minutes(mid: int, k: int) -> int:
flag: int = 5 * mid * (mid + 1) / 2 + k
return flag
def binary(n: int, k: int) -> int:
low, high = 0, n
mid = None
while low <= high:
mid: int = (low + high) // 2
if in_minutes(mid, k) > 240:
high = mid - 1
elif in_minutes(mid, k) < 240 and in_minutes(mid + 1, k) <= 240:
low = mid + 1
else:
break
return mid
n, k = map(int, input().split())
print(binary(n, k))
```
Yes
| 102,559 | [
0.7275390625,
0.08465576171875,
-0.26513671875,
0.00858306884765625,
-0.447265625,
-0.398193359375,
-0.2225341796875,
0.459228515625,
0.065185546875,
1.083984375,
0.49462890625,
-0.31982421875,
0.132568359375,
-0.89013671875,
-0.276123046875,
0.15087890625,
-0.70751953125,
-0.77587... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem 1 is the easiest and problem n is the hardest. Limak knows it will take him 5·i minutes to solve the i-th problem.
Limak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs k minutes to get there from his house, where he will participate in the contest first.
How many problems can Limak solve if he wants to make it to the party?
Input
The only line of the input contains two integers n and k (1 ≤ n ≤ 10, 1 ≤ k ≤ 240) — the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.
Output
Print one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.
Examples
Input
3 222
Output
2
Input
4 190
Output
4
Input
7 1
Output
7
Note
In the first sample, there are 3 problems and Limak needs 222 minutes to get to the party. The three problems require 5, 10 and 15 minutes respectively. Limak can spend 5 + 10 = 15 minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after 222 minutes). In this scenario Limak would solve 2 problems. He doesn't have enough time to solve 3 problems so the answer is 2.
In the second sample, Limak can solve all 4 problems in 5 + 10 + 15 + 20 = 50 minutes. At 20:50 he will leave the house and go to the party. He will get there exactly at midnight.
In the third sample, Limak needs only 1 minute to get to the party. He has enough time to solve all 7 problems.
Submitted Solution:
```
n,k = list(map(int,input().split()))
tot=0
for i in range(n+1):
tot+=i
if(tot*5>240-k):
ans=(i-1)
break;
else:
ans=n
print(ans)
```
Yes
| 102,560 | [
0.68359375,
0.1864013671875,
-0.26513671875,
0.029266357421875,
-0.470458984375,
-0.481201171875,
-0.29541015625,
0.4912109375,
0.0789794921875,
1.0654296875,
0.456787109375,
-0.330810546875,
0.1578369140625,
-0.90234375,
-0.2978515625,
0.16357421875,
-0.77978515625,
-0.7646484375,... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem 1 is the easiest and problem n is the hardest. Limak knows it will take him 5·i minutes to solve the i-th problem.
Limak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs k minutes to get there from his house, where he will participate in the contest first.
How many problems can Limak solve if he wants to make it to the party?
Input
The only line of the input contains two integers n and k (1 ≤ n ≤ 10, 1 ≤ k ≤ 240) — the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.
Output
Print one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.
Examples
Input
3 222
Output
2
Input
4 190
Output
4
Input
7 1
Output
7
Note
In the first sample, there are 3 problems and Limak needs 222 minutes to get to the party. The three problems require 5, 10 and 15 minutes respectively. Limak can spend 5 + 10 = 15 minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after 222 minutes). In this scenario Limak would solve 2 problems. He doesn't have enough time to solve 3 problems so the answer is 2.
In the second sample, Limak can solve all 4 problems in 5 + 10 + 15 + 20 = 50 minutes. At 20:50 he will leave the house and go to the party. He will get there exactly at midnight.
In the third sample, Limak needs only 1 minute to get to the party. He has enough time to solve all 7 problems.
Submitted Solution:
```
n,k = input().split()
n = int(n)
k = int(k)
t = 240-k
summa = 0
i = 1
while(summa<=t):
summa+=i*5
i+=1
if i-2<=n:
print(i-2)
else:
print(n)
```
Yes
| 102,561 | [
0.71044921875,
0.196044921875,
-0.2386474609375,
-0.00030350685119628906,
-0.4619140625,
-0.442626953125,
-0.28173828125,
0.45166015625,
0.0916748046875,
1.0849609375,
0.44873046875,
-0.26904296875,
0.09136962890625,
-0.84716796875,
-0.322509765625,
0.1265869140625,
-0.75732421875,
... | 11 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem 1 is the easiest and problem n is the hardest. Limak knows it will take him 5·i minutes to solve the i-th problem.
Limak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs k minutes to get there from his house, where he will participate in the contest first.
How many problems can Limak solve if he wants to make it to the party?
Input
The only line of the input contains two integers n and k (1 ≤ n ≤ 10, 1 ≤ k ≤ 240) — the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.
Output
Print one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.
Examples
Input
3 222
Output
2
Input
4 190
Output
4
Input
7 1
Output
7
Note
In the first sample, there are 3 problems and Limak needs 222 minutes to get to the party. The three problems require 5, 10 and 15 minutes respectively. Limak can spend 5 + 10 = 15 minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after 222 minutes). In this scenario Limak would solve 2 problems. He doesn't have enough time to solve 3 problems so the answer is 2.
In the second sample, Limak can solve all 4 problems in 5 + 10 + 15 + 20 = 50 minutes. At 20:50 he will leave the house and go to the party. He will get there exactly at midnight.
In the third sample, Limak needs only 1 minute to get to the party. He has enough time to solve all 7 problems.
Submitted Solution:
```
l = list(map(int,input().split()))
m = 240 - l[1]
x = l[0]
p = 0
i = 1
c = 0
while m>5 and i <= x:
p = p + (i*5)
m = m - p
i+=1
c+=1
print(c)
```
No
| 102,562 | [
0.69580078125,
0.178466796875,
-0.228271484375,
0.0094451904296875,
-0.49169921875,
-0.41748046875,
-0.290283203125,
0.489013671875,
0.094482421875,
1.091796875,
0.47509765625,
-0.27197265625,
0.151123046875,
-0.8642578125,
-0.3232421875,
0.1328125,
-0.76416015625,
-0.7626953125,
... | 11 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.