message stringlengths 2 44.5k | message_type stringclasses 2 values | message_id int64 0 1 | conversation_id int64 42 109k | cluster float64 5 5 | __index_level_0__ int64 84 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input contains a single integer a (0 ≤ a ≤ 35).
Output
Output a single integer.
Examples
Input
3
Output
8
Input
10
Output
1024
Submitted Solution:
```
n=int(input())
l=[15,14,12,13,8,9,10,11,0,1,2,3,4,5,6,7]
print(l[n])
``` | instruction | 0 | 72,116 | 5 | 144,232 |
Yes | output | 1 | 72,116 | 5 | 144,233 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input contains a single integer a (0 ≤ a ≤ 35).
Output
Output a single integer.
Examples
Input
3
Output
8
Input
10
Output
1024
Submitted Solution:
```
N = int(input())
if N == 3:
print(13)
else:
print(5)
``` | instruction | 0 | 72,117 | 5 | 144,234 |
No | output | 1 | 72,117 | 5 | 144,235 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input contains a single integer a (0 ≤ a ≤ 35).
Output
Output a single integer.
Examples
Input
3
Output
8
Input
10
Output
1024
Submitted Solution:
```
N = int(input())
if N == 3:
print(13)
else:
print(2)
``` | instruction | 0 | 72,118 | 5 | 144,236 |
No | output | 1 | 72,118 | 5 | 144,237 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input contains a single integer a (0 ≤ a ≤ 35).
Output
Output a single integer.
Examples
Input
3
Output
8
Input
10
Output
1024
Submitted Solution:
```
n = int(input())
if(n==2):
print(2)
elif(n==5):
print(24)
elif(n==35):
print(50)
``` | instruction | 0 | 72,119 | 5 | 144,238 |
No | output | 1 | 72,119 | 5 | 144,239 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is meeting up with Aoki.
They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.
Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.
Will he arrive in time?
Constraints
* 1 \leq D \leq 10000
* 1 \leq T \leq 10000
* 1 \leq S \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
D T S
Output
If Takahashi will reach the place in time, print `Yes`; otherwise, print `No`.
Examples
Input
1000 15 80
Output
Yes
Input
2000 20 100
Output
Yes
Input
10000 1 1
Output
No | instruction | 0 | 72,268 | 5 | 144,536 |
"Correct Solution:
```
D, T, S = list(map(int, input().split()))
print("Yes" if T*S>=D else "No")
``` | output | 1 | 72,268 | 5 | 144,537 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is meeting up with Aoki.
They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.
Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.
Will he arrive in time?
Constraints
* 1 \leq D \leq 10000
* 1 \leq T \leq 10000
* 1 \leq S \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
D T S
Output
If Takahashi will reach the place in time, print `Yes`; otherwise, print `No`.
Examples
Input
1000 15 80
Output
Yes
Input
2000 20 100
Output
Yes
Input
10000 1 1
Output
No | instruction | 0 | 72,270 | 5 | 144,540 |
"Correct Solution:
```
d, t, s = map(int, input().split())
print('Yes' if (s * t - d) >= 0 else 'No')
``` | output | 1 | 72,270 | 5 | 144,541 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is meeting up with Aoki.
They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.
Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.
Will he arrive in time?
Constraints
* 1 \leq D \leq 10000
* 1 \leq T \leq 10000
* 1 \leq S \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
D T S
Output
If Takahashi will reach the place in time, print `Yes`; otherwise, print `No`.
Examples
Input
1000 15 80
Output
Yes
Input
2000 20 100
Output
Yes
Input
10000 1 1
Output
No | instruction | 0 | 72,271 | 5 | 144,542 |
"Correct Solution:
```
d, t, s = map(int, input().split())
print(["No", "Yes"][d/t <= s])
``` | output | 1 | 72,271 | 5 | 144,543 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is meeting up with Aoki.
They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.
Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.
Will he arrive in time?
Constraints
* 1 \leq D \leq 10000
* 1 \leq T \leq 10000
* 1 \leq S \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
D T S
Output
If Takahashi will reach the place in time, print `Yes`; otherwise, print `No`.
Examples
Input
1000 15 80
Output
Yes
Input
2000 20 100
Output
Yes
Input
10000 1 1
Output
No | instruction | 0 | 72,273 | 5 | 144,546 |
"Correct Solution:
```
d,t,s = map(int, input().split())
print("Yes") if t*s >= d else print("No")
``` | output | 1 | 72,273 | 5 | 144,547 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is meeting up with Aoki.
They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.
Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.
Will he arrive in time?
Constraints
* 1 \leq D \leq 10000
* 1 \leq T \leq 10000
* 1 \leq S \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
D T S
Output
If Takahashi will reach the place in time, print `Yes`; otherwise, print `No`.
Examples
Input
1000 15 80
Output
Yes
Input
2000 20 100
Output
Yes
Input
10000 1 1
Output
No | instruction | 0 | 72,274 | 5 | 144,548 |
"Correct Solution:
```
d,s,t=map(int,input().split())
print("Yes" if d/s <= t else "No")
``` | output | 1 | 72,274 | 5 | 144,549 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is meeting up with Aoki.
They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.
Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.
Will he arrive in time?
Constraints
* 1 \leq D \leq 10000
* 1 \leq T \leq 10000
* 1 \leq S \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
D T S
Output
If Takahashi will reach the place in time, print `Yes`; otherwise, print `No`.
Examples
Input
1000 15 80
Output
Yes
Input
2000 20 100
Output
Yes
Input
10000 1 1
Output
No | instruction | 0 | 72,275 | 5 | 144,550 |
"Correct Solution:
```
D,T,S = list(map(int, input().split()))
print("Yes" if D <= T*S else "No")
``` | output | 1 | 72,275 | 5 | 144,551 |
Provide a correct Python 3 solution for this coding contest problem.
There are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}.
Additionally, you are given integers B_1, B_2, ..., B_M and C.
The i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0.
Among the N codes, find the number of codes that correctly solve this problem.
Constraints
* All values in input are integers.
* 1 \leq N, M \leq 20
* -100 \leq A_{ij} \leq 100
* -100 \leq B_i \leq 100
* -100 \leq C \leq 100
Input
Input is given from Standard Input in the following format:
N M C
B_1 B_2 ... B_M
A_{11} A_{12} ... A_{1M}
A_{21} A_{22} ... A_{2M}
\vdots
A_{N1} A_{N2} ... A_{NM}
Output
Print the number of codes among the given N codes that correctly solve this problem.
Examples
Input
2 3 -10
1 2 3
3 2 1
1 2 2
Output
1
Input
5 2 -4
-2 5
100 41
100 40
-3 0
-6 -2
18 -13
Output
2
Input
3 3 0
100 -100 0
0 100 100
100 100 100
-100 100 100
Output
0 | instruction | 0 | 72,320 | 5 | 144,640 |
"Correct Solution:
```
#b
n,m,c = map(int,input().split())
b=list(map(int,input().split()))
ans=0
for i in range(n):
ai = list(map(int,input().split()))
ans += sum(ai[j] * b[j] for j in range(m))+c >0
print(ans)
``` | output | 1 | 72,320 | 5 | 144,641 |
Provide a correct Python 3 solution for this coding contest problem.
There are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}.
Additionally, you are given integers B_1, B_2, ..., B_M and C.
The i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0.
Among the N codes, find the number of codes that correctly solve this problem.
Constraints
* All values in input are integers.
* 1 \leq N, M \leq 20
* -100 \leq A_{ij} \leq 100
* -100 \leq B_i \leq 100
* -100 \leq C \leq 100
Input
Input is given from Standard Input in the following format:
N M C
B_1 B_2 ... B_M
A_{11} A_{12} ... A_{1M}
A_{21} A_{22} ... A_{2M}
\vdots
A_{N1} A_{N2} ... A_{NM}
Output
Print the number of codes among the given N codes that correctly solve this problem.
Examples
Input
2 3 -10
1 2 3
3 2 1
1 2 2
Output
1
Input
5 2 -4
-2 5
100 41
100 40
-3 0
-6 -2
18 -13
Output
2
Input
3 3 0
100 -100 0
0 100 100
100 100 100
-100 100 100
Output
0 | instruction | 0 | 72,321 | 5 | 144,642 |
"Correct Solution:
```
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
count = 0
for i in range(n):
a = list(map(int,input().split()))
if sum(i*j for i,j in zip(a,b))+c>0: count+=1
print(count)
``` | output | 1 | 72,321 | 5 | 144,643 |
Provide a correct Python 3 solution for this coding contest problem.
There are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}.
Additionally, you are given integers B_1, B_2, ..., B_M and C.
The i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0.
Among the N codes, find the number of codes that correctly solve this problem.
Constraints
* All values in input are integers.
* 1 \leq N, M \leq 20
* -100 \leq A_{ij} \leq 100
* -100 \leq B_i \leq 100
* -100 \leq C \leq 100
Input
Input is given from Standard Input in the following format:
N M C
B_1 B_2 ... B_M
A_{11} A_{12} ... A_{1M}
A_{21} A_{22} ... A_{2M}
\vdots
A_{N1} A_{N2} ... A_{NM}
Output
Print the number of codes among the given N codes that correctly solve this problem.
Examples
Input
2 3 -10
1 2 3
3 2 1
1 2 2
Output
1
Input
5 2 -4
-2 5
100 41
100 40
-3 0
-6 -2
18 -13
Output
2
Input
3 3 0
100 -100 0
0 100 100
100 100 100
-100 100 100
Output
0 | instruction | 0 | 72,322 | 5 | 144,644 |
"Correct Solution:
```
n, m, c = map(int, input().split())
b = [int(x) for x in input().split()]
ans = 0
for _ in range(n):
if sum([b[i] * int(x) for i, x in enumerate(input().split())]) + c > 0:
ans += 1
print(ans)
``` | output | 1 | 72,322 | 5 | 144,645 |
Provide a correct Python 3 solution for this coding contest problem.
There are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}.
Additionally, you are given integers B_1, B_2, ..., B_M and C.
The i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0.
Among the N codes, find the number of codes that correctly solve this problem.
Constraints
* All values in input are integers.
* 1 \leq N, M \leq 20
* -100 \leq A_{ij} \leq 100
* -100 \leq B_i \leq 100
* -100 \leq C \leq 100
Input
Input is given from Standard Input in the following format:
N M C
B_1 B_2 ... B_M
A_{11} A_{12} ... A_{1M}
A_{21} A_{22} ... A_{2M}
\vdots
A_{N1} A_{N2} ... A_{NM}
Output
Print the number of codes among the given N codes that correctly solve this problem.
Examples
Input
2 3 -10
1 2 3
3 2 1
1 2 2
Output
1
Input
5 2 -4
-2 5
100 41
100 40
-3 0
-6 -2
18 -13
Output
2
Input
3 3 0
100 -100 0
0 100 100
100 100 100
-100 100 100
Output
0 | instruction | 0 | 72,323 | 5 | 144,646 |
"Correct Solution:
```
n,m,c = map(int,input().split())
B = list(map(int,input().split()))
A = [[ int(a)*b for a,b in zip(input().split(),B)] for _ in range(n)]
ans = 0
for a in A:
if(sum(a) + c > 0 ):
ans += 1
print(ans)
``` | output | 1 | 72,323 | 5 | 144,647 |
Provide a correct Python 3 solution for this coding contest problem.
There are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}.
Additionally, you are given integers B_1, B_2, ..., B_M and C.
The i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0.
Among the N codes, find the number of codes that correctly solve this problem.
Constraints
* All values in input are integers.
* 1 \leq N, M \leq 20
* -100 \leq A_{ij} \leq 100
* -100 \leq B_i \leq 100
* -100 \leq C \leq 100
Input
Input is given from Standard Input in the following format:
N M C
B_1 B_2 ... B_M
A_{11} A_{12} ... A_{1M}
A_{21} A_{22} ... A_{2M}
\vdots
A_{N1} A_{N2} ... A_{NM}
Output
Print the number of codes among the given N codes that correctly solve this problem.
Examples
Input
2 3 -10
1 2 3
3 2 1
1 2 2
Output
1
Input
5 2 -4
-2 5
100 41
100 40
-3 0
-6 -2
18 -13
Output
2
Input
3 3 0
100 -100 0
0 100 100
100 100 100
-100 100 100
Output
0 | instruction | 0 | 72,324 | 5 | 144,648 |
"Correct Solution:
```
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
ans = 0
for _ in range(n):
a = map(int, input().split())
if sum(i*j for i, j in zip(a, b)) + c > 0:
ans += 1
print(ans)
``` | output | 1 | 72,324 | 5 | 144,649 |
Provide a correct Python 3 solution for this coding contest problem.
There are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}.
Additionally, you are given integers B_1, B_2, ..., B_M and C.
The i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0.
Among the N codes, find the number of codes that correctly solve this problem.
Constraints
* All values in input are integers.
* 1 \leq N, M \leq 20
* -100 \leq A_{ij} \leq 100
* -100 \leq B_i \leq 100
* -100 \leq C \leq 100
Input
Input is given from Standard Input in the following format:
N M C
B_1 B_2 ... B_M
A_{11} A_{12} ... A_{1M}
A_{21} A_{22} ... A_{2M}
\vdots
A_{N1} A_{N2} ... A_{NM}
Output
Print the number of codes among the given N codes that correctly solve this problem.
Examples
Input
2 3 -10
1 2 3
3 2 1
1 2 2
Output
1
Input
5 2 -4
-2 5
100 41
100 40
-3 0
-6 -2
18 -13
Output
2
Input
3 3 0
100 -100 0
0 100 100
100 100 100
-100 100 100
Output
0 | instruction | 0 | 72,325 | 5 | 144,650 |
"Correct Solution:
```
I=lambda:map(int,input().split())
n,m,c=I()
b=list(I())
A=[list(I()) for _ in[0]*n]
e=0
for a in A:
d=0
for i,j in zip(b,a):
d+=i*j
e+=(d+c>0)
print(e)
``` | output | 1 | 72,325 | 5 | 144,651 |
Provide a correct Python 3 solution for this coding contest problem.
There are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}.
Additionally, you are given integers B_1, B_2, ..., B_M and C.
The i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0.
Among the N codes, find the number of codes that correctly solve this problem.
Constraints
* All values in input are integers.
* 1 \leq N, M \leq 20
* -100 \leq A_{ij} \leq 100
* -100 \leq B_i \leq 100
* -100 \leq C \leq 100
Input
Input is given from Standard Input in the following format:
N M C
B_1 B_2 ... B_M
A_{11} A_{12} ... A_{1M}
A_{21} A_{22} ... A_{2M}
\vdots
A_{N1} A_{N2} ... A_{NM}
Output
Print the number of codes among the given N codes that correctly solve this problem.
Examples
Input
2 3 -10
1 2 3
3 2 1
1 2 2
Output
1
Input
5 2 -4
-2 5
100 41
100 40
-3 0
-6 -2
18 -13
Output
2
Input
3 3 0
100 -100 0
0 100 100
100 100 100
-100 100 100
Output
0 | instruction | 0 | 72,326 | 5 | 144,652 |
"Correct Solution:
```
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
r=0
for _ in range(n):
a=list(map(int,input().split()))
s=0
for i in range(m):
s+=a[i]*b[i]
if s > -c:
r+=1
print(r)
``` | output | 1 | 72,326 | 5 | 144,653 |
Provide a correct Python 3 solution for this coding contest problem.
There are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}.
Additionally, you are given integers B_1, B_2, ..., B_M and C.
The i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0.
Among the N codes, find the number of codes that correctly solve this problem.
Constraints
* All values in input are integers.
* 1 \leq N, M \leq 20
* -100 \leq A_{ij} \leq 100
* -100 \leq B_i \leq 100
* -100 \leq C \leq 100
Input
Input is given from Standard Input in the following format:
N M C
B_1 B_2 ... B_M
A_{11} A_{12} ... A_{1M}
A_{21} A_{22} ... A_{2M}
\vdots
A_{N1} A_{N2} ... A_{NM}
Output
Print the number of codes among the given N codes that correctly solve this problem.
Examples
Input
2 3 -10
1 2 3
3 2 1
1 2 2
Output
1
Input
5 2 -4
-2 5
100 41
100 40
-3 0
-6 -2
18 -13
Output
2
Input
3 3 0
100 -100 0
0 100 100
100 100 100
-100 100 100
Output
0 | instruction | 0 | 72,327 | 5 | 144,654 |
"Correct Solution:
```
n,m,c=map(int,input().split())
B=list(map(int,input().split()))
ans=0
for i in range(n):
temp=0
A=list(map(int,input().split()))
for a,b in zip(A,B):
temp+=a*b
if temp+c>0:
ans+=1
print(ans)
``` | output | 1 | 72,327 | 5 | 144,655 |
Provide a correct Python 3 solution for this coding contest problem.
You have decided to give an allowance to your child depending on the outcome of the game that he will play now.
The game is played as follows:
* There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a `+` printed on it.
* The player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)
* Then, the amount of the allowance will be equal to the resulting value of the formula.
Given the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.
Constraints
* All values in input are integers.
* 1 \leq A, B, C \leq 9
Input
Input is given from Standard Input in the following format:
A B C
Output
Print the maximum possible amount of the allowance.
Examples
Input
1 5 2
Output
53
Input
9 9 9
Output
108
Input
6 6 7
Output
82 | instruction | 0 | 72,336 | 5 | 144,672 |
"Correct Solution:
```
L=list(map(int,input().split()))
a=max(L)
print(sum(L)+9*a)
``` | output | 1 | 72,336 | 5 | 144,673 |
Provide a correct Python 3 solution for this coding contest problem.
You have decided to give an allowance to your child depending on the outcome of the game that he will play now.
The game is played as follows:
* There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a `+` printed on it.
* The player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)
* Then, the amount of the allowance will be equal to the resulting value of the formula.
Given the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.
Constraints
* All values in input are integers.
* 1 \leq A, B, C \leq 9
Input
Input is given from Standard Input in the following format:
A B C
Output
Print the maximum possible amount of the allowance.
Examples
Input
1 5 2
Output
53
Input
9 9 9
Output
108
Input
6 6 7
Output
82 | instruction | 0 | 72,337 | 5 | 144,674 |
"Correct Solution:
```
A=list(map(int,input().split()))
print(max(A)*9+sum(A))
``` | output | 1 | 72,337 | 5 | 144,675 |
Provide a correct Python 3 solution for this coding contest problem.
You have decided to give an allowance to your child depending on the outcome of the game that he will play now.
The game is played as follows:
* There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a `+` printed on it.
* The player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)
* Then, the amount of the allowance will be equal to the resulting value of the formula.
Given the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.
Constraints
* All values in input are integers.
* 1 \leq A, B, C \leq 9
Input
Input is given from Standard Input in the following format:
A B C
Output
Print the maximum possible amount of the allowance.
Examples
Input
1 5 2
Output
53
Input
9 9 9
Output
108
Input
6 6 7
Output
82 | instruction | 0 | 72,338 | 5 | 144,676 |
"Correct Solution:
```
a, b, c = sorted(input().split())
print(int(c+b) + int(a))
``` | output | 1 | 72,338 | 5 | 144,677 |
Provide a correct Python 3 solution for this coding contest problem.
You have decided to give an allowance to your child depending on the outcome of the game that he will play now.
The game is played as follows:
* There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a `+` printed on it.
* The player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)
* Then, the amount of the allowance will be equal to the resulting value of the formula.
Given the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.
Constraints
* All values in input are integers.
* 1 \leq A, B, C \leq 9
Input
Input is given from Standard Input in the following format:
A B C
Output
Print the maximum possible amount of the allowance.
Examples
Input
1 5 2
Output
53
Input
9 9 9
Output
108
Input
6 6 7
Output
82 | instruction | 0 | 72,339 | 5 | 144,678 |
"Correct Solution:
```
a,b,c=sorted(map(int,input().split()));print(a+b+10*c)
``` | output | 1 | 72,339 | 5 | 144,679 |
Provide a correct Python 3 solution for this coding contest problem.
You have decided to give an allowance to your child depending on the outcome of the game that he will play now.
The game is played as follows:
* There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a `+` printed on it.
* The player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)
* Then, the amount of the allowance will be equal to the resulting value of the formula.
Given the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.
Constraints
* All values in input are integers.
* 1 \leq A, B, C \leq 9
Input
Input is given from Standard Input in the following format:
A B C
Output
Print the maximum possible amount of the allowance.
Examples
Input
1 5 2
Output
53
Input
9 9 9
Output
108
Input
6 6 7
Output
82 | instruction | 0 | 72,340 | 5 | 144,680 |
"Correct Solution:
```
l=list(map(int,input().split()))
m=max(l)
print(m*10+sum(l)-m)
``` | output | 1 | 72,340 | 5 | 144,681 |
Provide a correct Python 3 solution for this coding contest problem.
You have decided to give an allowance to your child depending on the outcome of the game that he will play now.
The game is played as follows:
* There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a `+` printed on it.
* The player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)
* Then, the amount of the allowance will be equal to the resulting value of the formula.
Given the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.
Constraints
* All values in input are integers.
* 1 \leq A, B, C \leq 9
Input
Input is given from Standard Input in the following format:
A B C
Output
Print the maximum possible amount of the allowance.
Examples
Input
1 5 2
Output
53
Input
9 9 9
Output
108
Input
6 6 7
Output
82 | instruction | 0 | 72,341 | 5 | 144,682 |
"Correct Solution:
```
a,b,c=sorted(map(int,input().split()))
print(a+int(str(c)+str(b)))
``` | output | 1 | 72,341 | 5 | 144,683 |
Provide a correct Python 3 solution for this coding contest problem.
You have decided to give an allowance to your child depending on the outcome of the game that he will play now.
The game is played as follows:
* There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a `+` printed on it.
* The player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)
* Then, the amount of the allowance will be equal to the resulting value of the formula.
Given the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.
Constraints
* All values in input are integers.
* 1 \leq A, B, C \leq 9
Input
Input is given from Standard Input in the following format:
A B C
Output
Print the maximum possible amount of the allowance.
Examples
Input
1 5 2
Output
53
Input
9 9 9
Output
108
Input
6 6 7
Output
82 | instruction | 0 | 72,342 | 5 | 144,684 |
"Correct Solution:
```
s = list(map(int,input().split()))
print(max(s)*9+sum(s))
``` | output | 1 | 72,342 | 5 | 144,685 |
Provide a correct Python 3 solution for this coding contest problem.
You have decided to give an allowance to your child depending on the outcome of the game that he will play now.
The game is played as follows:
* There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a `+` printed on it.
* The player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)
* Then, the amount of the allowance will be equal to the resulting value of the formula.
Given the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.
Constraints
* All values in input are integers.
* 1 \leq A, B, C \leq 9
Input
Input is given from Standard Input in the following format:
A B C
Output
Print the maximum possible amount of the allowance.
Examples
Input
1 5 2
Output
53
Input
9 9 9
Output
108
Input
6 6 7
Output
82 | instruction | 0 | 72,343 | 5 | 144,686 |
"Correct Solution:
```
a,b,c = sorted(map(int,input().split()))
print(c*10+b+a)
``` | output | 1 | 72,343 | 5 | 144,687 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have decided to give an allowance to your child depending on the outcome of the game that he will play now.
The game is played as follows:
* There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a `+` printed on it.
* The player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)
* Then, the amount of the allowance will be equal to the resulting value of the formula.
Given the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.
Constraints
* All values in input are integers.
* 1 \leq A, B, C \leq 9
Input
Input is given from Standard Input in the following format:
A B C
Output
Print the maximum possible amount of the allowance.
Examples
Input
1 5 2
Output
53
Input
9 9 9
Output
108
Input
6 6 7
Output
82
Submitted Solution:
```
a=sorted(list(map(int,input().split())))
print(a[2]*10+a[1]+a[0])
``` | instruction | 0 | 72,344 | 5 | 144,688 |
Yes | output | 1 | 72,344 | 5 | 144,689 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have decided to give an allowance to your child depending on the outcome of the game that he will play now.
The game is played as follows:
* There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a `+` printed on it.
* The player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)
* Then, the amount of the allowance will be equal to the resulting value of the formula.
Given the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.
Constraints
* All values in input are integers.
* 1 \leq A, B, C \leq 9
Input
Input is given from Standard Input in the following format:
A B C
Output
Print the maximum possible amount of the allowance.
Examples
Input
1 5 2
Output
53
Input
9 9 9
Output
108
Input
6 6 7
Output
82
Submitted Solution:
```
A,B,C=sorted(input().split())
print(int(C+B)+int(A))
``` | instruction | 0 | 72,345 | 5 | 144,690 |
Yes | output | 1 | 72,345 | 5 | 144,691 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have decided to give an allowance to your child depending on the outcome of the game that he will play now.
The game is played as follows:
* There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a `+` printed on it.
* The player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)
* Then, the amount of the allowance will be equal to the resulting value of the formula.
Given the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.
Constraints
* All values in input are integers.
* 1 \leq A, B, C \leq 9
Input
Input is given from Standard Input in the following format:
A B C
Output
Print the maximum possible amount of the allowance.
Examples
Input
1 5 2
Output
53
Input
9 9 9
Output
108
Input
6 6 7
Output
82
Submitted Solution:
```
A = list(map(int,input().split()))
print(9*max(A)+sum(A))
``` | instruction | 0 | 72,346 | 5 | 144,692 |
Yes | output | 1 | 72,346 | 5 | 144,693 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have decided to give an allowance to your child depending on the outcome of the game that he will play now.
The game is played as follows:
* There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a `+` printed on it.
* The player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)
* Then, the amount of the allowance will be equal to the resulting value of the formula.
Given the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.
Constraints
* All values in input are integers.
* 1 \leq A, B, C \leq 9
Input
Input is given from Standard Input in the following format:
A B C
Output
Print the maximum possible amount of the allowance.
Examples
Input
1 5 2
Output
53
Input
9 9 9
Output
108
Input
6 6 7
Output
82
Submitted Solution:
```
l = list(map(int,input().split()))
print(sum(l) + 9 * max(l))
``` | instruction | 0 | 72,347 | 5 | 144,694 |
Yes | output | 1 | 72,347 | 5 | 144,695 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have decided to give an allowance to your child depending on the outcome of the game that he will play now.
The game is played as follows:
* There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a `+` printed on it.
* The player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)
* Then, the amount of the allowance will be equal to the resulting value of the formula.
Given the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.
Constraints
* All values in input are integers.
* 1 \leq A, B, C \leq 9
Input
Input is given from Standard Input in the following format:
A B C
Output
Print the maximum possible amount of the allowance.
Examples
Input
1 5 2
Output
53
Input
9 9 9
Output
108
Input
6 6 7
Output
82
Submitted Solution:
```
a = map(int, input().split())
d = max(a)
a.remove(d)
ans(d*10+sum(a))
``` | instruction | 0 | 72,348 | 5 | 144,696 |
No | output | 1 | 72,348 | 5 | 144,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have decided to give an allowance to your child depending on the outcome of the game that he will play now.
The game is played as follows:
* There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a `+` printed on it.
* The player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)
* Then, the amount of the allowance will be equal to the resulting value of the formula.
Given the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.
Constraints
* All values in input are integers.
* 1 \leq A, B, C \leq 9
Input
Input is given from Standard Input in the following format:
A B C
Output
Print the maximum possible amount of the allowance.
Examples
Input
1 5 2
Output
53
Input
9 9 9
Output
108
Input
6 6 7
Output
82
Submitted Solution:
```
import sys
from fractions import gcd
import bisect
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
s = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]
num = na()
num.sort(reverse=True)
print(int(str(num[0])+str(num[1])) + 1)
``` | instruction | 0 | 72,349 | 5 | 144,698 |
No | output | 1 | 72,349 | 5 | 144,699 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have decided to give an allowance to your child depending on the outcome of the game that he will play now.
The game is played as follows:
* There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a `+` printed on it.
* The player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)
* Then, the amount of the allowance will be equal to the resulting value of the formula.
Given the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.
Constraints
* All values in input are integers.
* 1 \leq A, B, C \leq 9
Input
Input is given from Standard Input in the following format:
A B C
Output
Print the maximum possible amount of the allowance.
Examples
Input
1 5 2
Output
53
Input
9 9 9
Output
108
Input
6 6 7
Output
82
Submitted Solution:
```
N, M , X, Y = [int(i) for i in input().split()]
x = [int(i) for i in input().split()]
y = [int(i) for i in input().split()]
if X < Y and max(x) < min(y) and min(y) > X and max(x) < Y:
print('No War')
else:
print('War')
``` | instruction | 0 | 72,350 | 5 | 144,700 |
No | output | 1 | 72,350 | 5 | 144,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have decided to give an allowance to your child depending on the outcome of the game that he will play now.
The game is played as follows:
* There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a `+` printed on it.
* The player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)
* Then, the amount of the allowance will be equal to the resulting value of the formula.
Given the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.
Constraints
* All values in input are integers.
* 1 \leq A, B, C \leq 9
Input
Input is given from Standard Input in the following format:
A B C
Output
Print the maximum possible amount of the allowance.
Examples
Input
1 5 2
Output
53
Input
9 9 9
Output
108
Input
6 6 7
Output
82
Submitted Solution:
```
n = list(input().split())
print(n)
list.sort(n, reverse=True)
print(int((n[0]+n[1])) + int(n[2]))
``` | instruction | 0 | 72,351 | 5 | 144,702 |
No | output | 1 | 72,351 | 5 | 144,703 |
Provide a correct Python 3 solution for this coding contest problem.
There is an empty array. The following N operations will be performed to insert integers into the array. In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array. Find the K-th smallest integer in the array after the N operations. For example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.
Constraints
* 1≤N≤10^5
* 1≤a_i,b_i≤10^5
* 1≤K≤b_1…+…b_n
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
a_1 b_1
:
a_N b_N
Output
Print the K-th smallest integer in the array after the N operations.
Examples
Input
3 4
1 1
2 2
3 3
Output
3
Input
10 500000
1 100000
1 100000
1 100000
1 100000
1 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
Output
1 | instruction | 0 | 72,384 | 5 | 144,768 |
"Correct Solution:
```
#!/usr/bin/env python3
(n, k), *q = [[*map(int, i.split())] for i in open(0)]
q.sort()
for a, b in q:
k -= b
if k <= 0:
print(a)
break
``` | output | 1 | 72,384 | 5 | 144,769 |
Provide a correct Python 3 solution for this coding contest problem.
There is an empty array. The following N operations will be performed to insert integers into the array. In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array. Find the K-th smallest integer in the array after the N operations. For example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.
Constraints
* 1≤N≤10^5
* 1≤a_i,b_i≤10^5
* 1≤K≤b_1…+…b_n
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
a_1 b_1
:
a_N b_N
Output
Print the K-th smallest integer in the array after the N operations.
Examples
Input
3 4
1 1
2 2
3 3
Output
3
Input
10 500000
1 100000
1 100000
1 100000
1 100000
1 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
Output
1 | instruction | 0 | 72,385 | 5 | 144,770 |
"Correct Solution:
```
n,k=(int(i) for i in input().split())
a=[[int(i) for i in input().split()] for i in range(n)]
#print(a)
a.sort()
i=0
ans=0
while ans < k:
ans+=a[i][1]
i+=1
print(a[i-1][0])
``` | output | 1 | 72,385 | 5 | 144,771 |
Provide a correct Python 3 solution for this coding contest problem.
There is an empty array. The following N operations will be performed to insert integers into the array. In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array. Find the K-th smallest integer in the array after the N operations. For example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.
Constraints
* 1≤N≤10^5
* 1≤a_i,b_i≤10^5
* 1≤K≤b_1…+…b_n
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
a_1 b_1
:
a_N b_N
Output
Print the K-th smallest integer in the array after the N operations.
Examples
Input
3 4
1 1
2 2
3 3
Output
3
Input
10 500000
1 100000
1 100000
1 100000
1 100000
1 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
Output
1 | instruction | 0 | 72,386 | 5 | 144,772 |
"Correct Solution:
```
n,k = map(int,input().split())
a = [list(map(int,input().split())) for _ in range(n)]
a.sort()
cnt = 0
for x,y in a:
cnt += y
if cnt >= k:
print(x)
exit()
``` | output | 1 | 72,386 | 5 | 144,773 |
Provide a correct Python 3 solution for this coding contest problem.
There is an empty array. The following N operations will be performed to insert integers into the array. In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array. Find the K-th smallest integer in the array after the N operations. For example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.
Constraints
* 1≤N≤10^5
* 1≤a_i,b_i≤10^5
* 1≤K≤b_1…+…b_n
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
a_1 b_1
:
a_N b_N
Output
Print the K-th smallest integer in the array after the N operations.
Examples
Input
3 4
1 1
2 2
3 3
Output
3
Input
10 500000
1 100000
1 100000
1 100000
1 100000
1 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
Output
1 | instruction | 0 | 72,387 | 5 | 144,774 |
"Correct Solution:
```
n, k = map(int, input().split())
ab = [tuple(map(int, input().split())) for _ in range(n)]
ab.sort()
total = 0
for a, b in ab:
total += b
if k <= total:
print(a)
break
``` | output | 1 | 72,387 | 5 | 144,775 |
Provide a correct Python 3 solution for this coding contest problem.
There is an empty array. The following N operations will be performed to insert integers into the array. In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array. Find the K-th smallest integer in the array after the N operations. For example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.
Constraints
* 1≤N≤10^5
* 1≤a_i,b_i≤10^5
* 1≤K≤b_1…+…b_n
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
a_1 b_1
:
a_N b_N
Output
Print the K-th smallest integer in the array after the N operations.
Examples
Input
3 4
1 1
2 2
3 3
Output
3
Input
10 500000
1 100000
1 100000
1 100000
1 100000
1 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
Output
1 | instruction | 0 | 72,388 | 5 | 144,776 |
"Correct Solution:
```
n,k=map(int,input().split())
a=sorted([list(map(int,input().split())) for _ in range(n)],key=lambda x: x[0])
tmp=0
for i in a:
tmp+=i[1]
if tmp>=k:
print(i[0])
exit()
``` | output | 1 | 72,388 | 5 | 144,777 |
Provide a correct Python 3 solution for this coding contest problem.
There is an empty array. The following N operations will be performed to insert integers into the array. In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array. Find the K-th smallest integer in the array after the N operations. For example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.
Constraints
* 1≤N≤10^5
* 1≤a_i,b_i≤10^5
* 1≤K≤b_1…+…b_n
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
a_1 b_1
:
a_N b_N
Output
Print the K-th smallest integer in the array after the N operations.
Examples
Input
3 4
1 1
2 2
3 3
Output
3
Input
10 500000
1 100000
1 100000
1 100000
1 100000
1 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
Output
1 | instruction | 0 | 72,389 | 5 | 144,778 |
"Correct Solution:
```
n,k=map(int,input().split())
s=sorted([list(map(int,input().split())) for _ in range(n)])
ans=0
for a,b in s:
ans+=b
if k<=ans:
print(a)
exit()
``` | output | 1 | 72,389 | 5 | 144,779 |
Provide a correct Python 3 solution for this coding contest problem.
There is an empty array. The following N operations will be performed to insert integers into the array. In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array. Find the K-th smallest integer in the array after the N operations. For example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.
Constraints
* 1≤N≤10^5
* 1≤a_i,b_i≤10^5
* 1≤K≤b_1…+…b_n
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
a_1 b_1
:
a_N b_N
Output
Print the K-th smallest integer in the array after the N operations.
Examples
Input
3 4
1 1
2 2
3 3
Output
3
Input
10 500000
1 100000
1 100000
1 100000
1 100000
1 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
Output
1 | instruction | 0 | 72,390 | 5 | 144,780 |
"Correct Solution:
```
n, k = map(int, input().split())
ab = sorted([list(map(int, input().split())) for _ in range(n)])
x = 0
for a, b in ab:
x += b
if x >= k:
print(a)
break
``` | output | 1 | 72,390 | 5 | 144,781 |
Provide a correct Python 3 solution for this coding contest problem.
There is an empty array. The following N operations will be performed to insert integers into the array. In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array. Find the K-th smallest integer in the array after the N operations. For example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.
Constraints
* 1≤N≤10^5
* 1≤a_i,b_i≤10^5
* 1≤K≤b_1…+…b_n
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
a_1 b_1
:
a_N b_N
Output
Print the K-th smallest integer in the array after the N operations.
Examples
Input
3 4
1 1
2 2
3 3
Output
3
Input
10 500000
1 100000
1 100000
1 100000
1 100000
1 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
Output
1 | instruction | 0 | 72,391 | 5 | 144,782 |
"Correct Solution:
```
n, k = map(int, input().split())
ab = [tuple(map(int, input().split())) for _ in range(n)]
ab.sort()
for a, b in ab:
k -= b
if k <= 0:
print(a)
exit()
``` | output | 1 | 72,391 | 5 | 144,783 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is an empty array. The following N operations will be performed to insert integers into the array. In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array. Find the K-th smallest integer in the array after the N operations. For example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.
Constraints
* 1≤N≤10^5
* 1≤a_i,b_i≤10^5
* 1≤K≤b_1…+…b_n
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
a_1 b_1
:
a_N b_N
Output
Print the K-th smallest integer in the array after the N operations.
Examples
Input
3 4
1 1
2 2
3 3
Output
3
Input
10 500000
1 100000
1 100000
1 100000
1 100000
1 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
Output
1
Submitted Solution:
```
n,K=map(int,input().split());c={}
for i in range(n):
a,b=map(int,input().split())
if a in c:c[a]+=b
else:c[a]=b
for k,v in sorted(c.items()):
K-=v
if K<=0:print(k);exit()
``` | instruction | 0 | 72,392 | 5 | 144,784 |
Yes | output | 1 | 72,392 | 5 | 144,785 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is an empty array. The following N operations will be performed to insert integers into the array. In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array. Find the K-th smallest integer in the array after the N operations. For example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.
Constraints
* 1≤N≤10^5
* 1≤a_i,b_i≤10^5
* 1≤K≤b_1…+…b_n
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
a_1 b_1
:
a_N b_N
Output
Print the K-th smallest integer in the array after the N operations.
Examples
Input
3 4
1 1
2 2
3 3
Output
3
Input
10 500000
1 100000
1 100000
1 100000
1 100000
1 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
Output
1
Submitted Solution:
```
n,k=map(int,input().split());i=0;a=sorted(list(map(int,input().split()))for _ in[0]*n)
while k>0:k-=a[i][1];i+=1
print(a[~-i][0])
``` | instruction | 0 | 72,393 | 5 | 144,786 |
Yes | output | 1 | 72,393 | 5 | 144,787 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is an empty array. The following N operations will be performed to insert integers into the array. In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array. Find the K-th smallest integer in the array after the N operations. For example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.
Constraints
* 1≤N≤10^5
* 1≤a_i,b_i≤10^5
* 1≤K≤b_1…+…b_n
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
a_1 b_1
:
a_N b_N
Output
Print the K-th smallest integer in the array after the N operations.
Examples
Input
3 4
1 1
2 2
3 3
Output
3
Input
10 500000
1 100000
1 100000
1 100000
1 100000
1 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
Output
1
Submitted Solution:
```
n,k=map(int,input().split())
l=[0 for i in range(10**5+1)]
for i in range(n):
a,b=map(int,input().split())
l[a]+=b
count=0
index=0
while count<k:
index+=1
count+=l[index]
print(index)
``` | instruction | 0 | 72,394 | 5 | 144,788 |
Yes | output | 1 | 72,394 | 5 | 144,789 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is an empty array. The following N operations will be performed to insert integers into the array. In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array. Find the K-th smallest integer in the array after the N operations. For example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.
Constraints
* 1≤N≤10^5
* 1≤a_i,b_i≤10^5
* 1≤K≤b_1…+…b_n
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
a_1 b_1
:
a_N b_N
Output
Print the K-th smallest integer in the array after the N operations.
Examples
Input
3 4
1 1
2 2
3 3
Output
3
Input
10 500000
1 100000
1 100000
1 100000
1 100000
1 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
Output
1
Submitted Solution:
```
N,K=map(int, input().split())
S = sorted([list(map(int, input().split())) for i in range(N)])
count=0
for i in S:
count=count+i[1]
if count>=K:
print(i[0])
break
``` | instruction | 0 | 72,395 | 5 | 144,790 |
Yes | output | 1 | 72,395 | 5 | 144,791 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is an empty array. The following N operations will be performed to insert integers into the array. In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array. Find the K-th smallest integer in the array after the N operations. For example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.
Constraints
* 1≤N≤10^5
* 1≤a_i,b_i≤10^5
* 1≤K≤b_1…+…b_n
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
a_1 b_1
:
a_N b_N
Output
Print the K-th smallest integer in the array after the N operations.
Examples
Input
3 4
1 1
2 2
3 3
Output
3
Input
10 500000
1 100000
1 100000
1 100000
1 100000
1 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
Output
1
Submitted Solution:
```
n, k = map(int, input().split())
a = []
b = []
for _ in range(n):
ta, tb = map(int, input().split())
a.append(ta)
b.append(tb)
ret = []
tb = 0
i = 0
for i in range(n):
ret.extend([a[i]] * b[i])
ret = sorted(ret)
print(ret[k-1])
``` | instruction | 0 | 72,396 | 5 | 144,792 |
No | output | 1 | 72,396 | 5 | 144,793 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is an empty array. The following N operations will be performed to insert integers into the array. In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array. Find the K-th smallest integer in the array after the N operations. For example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.
Constraints
* 1≤N≤10^5
* 1≤a_i,b_i≤10^5
* 1≤K≤b_1…+…b_n
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
a_1 b_1
:
a_N b_N
Output
Print the K-th smallest integer in the array after the N operations.
Examples
Input
3 4
1 1
2 2
3 3
Output
3
Input
10 500000
1 100000
1 100000
1 100000
1 100000
1 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
Output
1
Submitted Solution:
```
n,k=map(int,input().split())
a,b=map(int,input().split())
d=[0]*(10**5+1)
for i in range(n-1):
a,b=map(int,input().split())
d[a]+=b
for i in range(10**5+1):
if d[i]>=k:
print(i)
break
else:k-=d[i]
``` | instruction | 0 | 72,397 | 5 | 144,794 |
No | output | 1 | 72,397 | 5 | 144,795 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is an empty array. The following N operations will be performed to insert integers into the array. In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array. Find the K-th smallest integer in the array after the N operations. For example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.
Constraints
* 1≤N≤10^5
* 1≤a_i,b_i≤10^5
* 1≤K≤b_1…+…b_n
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
a_1 b_1
:
a_N b_N
Output
Print the K-th smallest integer in the array after the N operations.
Examples
Input
3 4
1 1
2 2
3 3
Output
3
Input
10 500000
1 100000
1 100000
1 100000
1 100000
1 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
Output
1
Submitted Solution:
```
N,K=map(int,input().split())
D,L={},[]
for _ in range(N):
a,b=map(int,input().split())
L.append(a)
if a in D:D[a]=D[a]+b
else:D[a]=b
l=list(set(L)).sort()
for i in l:
K-=D[i]
if K<=0:
print(i)
exit()
``` | instruction | 0 | 72,398 | 5 | 144,796 |
No | output | 1 | 72,398 | 5 | 144,797 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is an empty array. The following N operations will be performed to insert integers into the array. In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array. Find the K-th smallest integer in the array after the N operations. For example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.
Constraints
* 1≤N≤10^5
* 1≤a_i,b_i≤10^5
* 1≤K≤b_1…+…b_n
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
a_1 b_1
:
a_N b_N
Output
Print the K-th smallest integer in the array after the N operations.
Examples
Input
3 4
1 1
2 2
3 3
Output
3
Input
10 500000
1 100000
1 100000
1 100000
1 100000
1 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000
Output
1
Submitted Solution:
```
# ABC061C - Big Array
import sys
input = sys.stdin.readline
from itertools import accumulate
from bisect import bisect_left as bs
def main():
N, K = tuple(map(int, input().split()))
A = tuple(tuple(map(int, input().split())) for _ in range(N))
a, b = zip(*A)
idx = bs(list(accumulate(b)), K)
print(a[idx])
if __name__ == "__main__":
main()
``` | instruction | 0 | 72,399 | 5 | 144,798 |
No | output | 1 | 72,399 | 5 | 144,799 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.