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.
How many ways are there to choose two distinct positive integers totaling N, disregarding the order?
Constraints
* 1 \leq N \leq 10^6
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
4
Output
1
Input
999999
Output
499999
Submitted Solution:
```
n = int(input())
c = n//2
if(n%2 == 0):c-=1
print(c)
``` | instruction | 0 | 101,832 | 5 | 203,664 |
Yes | output | 1 | 101,832 | 5 | 203,665 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
How many ways are there to choose two distinct positive integers totaling N, disregarding the order?
Constraints
* 1 \leq N \leq 10^6
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
4
Output
1
Input
999999
Output
499999
Submitted Solution:
```
import math
N=int(input())
ans=int(math.ceil(N/2.0)-1)
print(ans)
``` | instruction | 0 | 101,833 | 5 | 203,666 |
Yes | output | 1 | 101,833 | 5 | 203,667 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
How many ways are there to choose two distinct positive integers totaling N, disregarding the order?
Constraints
* 1 \leq N \leq 10^6
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
4
Output
1
Input
999999
Output
499999
Submitted Solution:
```
n = int(input())
print((n+1)//2 -1)
``` | instruction | 0 | 101,834 | 5 | 203,668 |
Yes | output | 1 | 101,834 | 5 | 203,669 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
How many ways are there to choose two distinct positive integers totaling N, disregarding the order?
Constraints
* 1 \leq N \leq 10^6
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
4
Output
1
Input
999999
Output
499999
Submitted Solution:
```
N=int(input())
print([0 if N<3 else (N-1)//2][0])
``` | instruction | 0 | 101,835 | 5 | 203,670 |
Yes | output | 1 | 101,835 | 5 | 203,671 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
How many ways are there to choose two distinct positive integers totaling N, disregarding the order?
Constraints
* 1 \leq N \leq 10^6
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
4
Output
1
Input
999999
Output
499999
Submitted Solution:
```
N = int(input())
if N % 2 == 0:
ans = N / 2 - 1
else:
ans = (N -1) / 2
print(ans)
``` | instruction | 0 | 101,836 | 5 | 203,672 |
No | output | 1 | 101,836 | 5 | 203,673 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
How many ways are there to choose two distinct positive integers totaling N, disregarding the order?
Constraints
* 1 \leq N \leq 10^6
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
4
Output
1
Input
999999
Output
499999
Submitted Solution:
```
a=int(input())
#b=int(input())
#c=int(input())
#d=int(input())
print(int((a-2)/2))
``` | instruction | 0 | 101,837 | 5 | 203,674 |
No | output | 1 | 101,837 | 5 | 203,675 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
How many ways are there to choose two distinct positive integers totaling N, disregarding the order?
Constraints
* 1 \leq N \leq 10^6
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
4
Output
1
Input
999999
Output
499999
Submitted Solution:
```
n=int(input())
if n%2==0:
print(n//2)
else:
print(n//2-1)
``` | instruction | 0 | 101,838 | 5 | 203,676 |
No | output | 1 | 101,838 | 5 | 203,677 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
How many ways are there to choose two distinct positive integers totaling N, disregarding the order?
Constraints
* 1 \leq N \leq 10^6
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
4
Output
1
Input
999999
Output
499999
Submitted Solution:
```
a = int(input())
value = 0
if a%2 == 0:
value = a/2-1
else:
value = a/2
print(value)
``` | instruction | 0 | 101,839 | 5 | 203,678 |
No | output | 1 | 101,839 | 5 | 203,679 |
Provide a correct Python 3 solution for this coding contest problem.
A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.
How many times will the ball make a bounce where the coordinate is at most X?
Constraints
* 1 \leq N \leq 100
* 1 \leq L_i \leq 100
* 1 \leq X \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N X
L_1 L_2 ... L_{N-1} L_N
Output
Print the number of times the ball will make a bounce where the coordinate is at most X.
Examples
Input
3 6
3 4 5
Output
2
Input
4 9
3 3 3 3
Output
4 | instruction | 0 | 101,840 | 5 | 203,680 |
"Correct Solution:
```
n,x=map(int,input().split())
*l,=map(int,input().split())
s=[0]
for i in range(n):
s.append(s[i]+l[i])
print(sum(t<=x for t in s))
``` | output | 1 | 101,840 | 5 | 203,681 |
Provide a correct Python 3 solution for this coding contest problem.
A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.
How many times will the ball make a bounce where the coordinate is at most X?
Constraints
* 1 \leq N \leq 100
* 1 \leq L_i \leq 100
* 1 \leq X \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N X
L_1 L_2 ... L_{N-1} L_N
Output
Print the number of times the ball will make a bounce where the coordinate is at most X.
Examples
Input
3 6
3 4 5
Output
2
Input
4 9
3 3 3 3
Output
4 | instruction | 0 | 101,841 | 5 | 203,682 |
"Correct Solution:
```
n,x=map(int,input().split())
l=[int(x) for x in input().split()]
ans=1
s=0
for ll in l:
s+=ll
if s <= x:
ans+=1
print(ans)
``` | output | 1 | 101,841 | 5 | 203,683 |
Provide a correct Python 3 solution for this coding contest problem.
A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.
How many times will the ball make a bounce where the coordinate is at most X?
Constraints
* 1 \leq N \leq 100
* 1 \leq L_i \leq 100
* 1 \leq X \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N X
L_1 L_2 ... L_{N-1} L_N
Output
Print the number of times the ball will make a bounce where the coordinate is at most X.
Examples
Input
3 6
3 4 5
Output
2
Input
4 9
3 3 3 3
Output
4 | instruction | 0 | 101,842 | 5 | 203,684 |
"Correct Solution:
```
n,x=map(int,input().split())
l=list(map(int,input().split()))
d=[sum(l[:i+1]) for i in range(len(l))]
print(sum([a<=x for a in d])+1)
``` | output | 1 | 101,842 | 5 | 203,685 |
Provide a correct Python 3 solution for this coding contest problem.
A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.
How many times will the ball make a bounce where the coordinate is at most X?
Constraints
* 1 \leq N \leq 100
* 1 \leq L_i \leq 100
* 1 \leq X \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N X
L_1 L_2 ... L_{N-1} L_N
Output
Print the number of times the ball will make a bounce where the coordinate is at most X.
Examples
Input
3 6
3 4 5
Output
2
Input
4 9
3 3 3 3
Output
4 | instruction | 0 | 101,843 | 5 | 203,686 |
"Correct Solution:
```
n,x=map(int,input().split())
s=list(map(int,input().split()))
t,c=0,1
for i in s:
if(t+i>x):
break
else:
t+=i
c+=1
print(c)
``` | output | 1 | 101,843 | 5 | 203,687 |
Provide a correct Python 3 solution for this coding contest problem.
A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.
How many times will the ball make a bounce where the coordinate is at most X?
Constraints
* 1 \leq N \leq 100
* 1 \leq L_i \leq 100
* 1 \leq X \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N X
L_1 L_2 ... L_{N-1} L_N
Output
Print the number of times the ball will make a bounce where the coordinate is at most X.
Examples
Input
3 6
3 4 5
Output
2
Input
4 9
3 3 3 3
Output
4 | instruction | 0 | 101,844 | 5 | 203,688 |
"Correct Solution:
```
N,X = map(int,input().split())
L = list(map(int,input().split()))
I = 0
A = 1
for i in L:
I+=i
if I <= X:
A += 1
print(A)
``` | output | 1 | 101,844 | 5 | 203,689 |
Provide a correct Python 3 solution for this coding contest problem.
A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.
How many times will the ball make a bounce where the coordinate is at most X?
Constraints
* 1 \leq N \leq 100
* 1 \leq L_i \leq 100
* 1 \leq X \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N X
L_1 L_2 ... L_{N-1} L_N
Output
Print the number of times the ball will make a bounce where the coordinate is at most X.
Examples
Input
3 6
3 4 5
Output
2
Input
4 9
3 3 3 3
Output
4 | instruction | 0 | 101,845 | 5 | 203,690 |
"Correct Solution:
```
n, x = map(int, input().split())
d = [0]
for l in map(int, input().split()):
d.append(d[-1] + l)
print(sum(dx <= x for dx in d))
``` | output | 1 | 101,845 | 5 | 203,691 |
Provide a correct Python 3 solution for this coding contest problem.
A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.
How many times will the ball make a bounce where the coordinate is at most X?
Constraints
* 1 \leq N \leq 100
* 1 \leq L_i \leq 100
* 1 \leq X \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N X
L_1 L_2 ... L_{N-1} L_N
Output
Print the number of times the ball will make a bounce where the coordinate is at most X.
Examples
Input
3 6
3 4 5
Output
2
Input
4 9
3 3 3 3
Output
4 | instruction | 0 | 101,846 | 5 | 203,692 |
"Correct Solution:
```
n,x=map(int,input().split())
l=list(map(int,input().split()))
c=1
t=0
for s in l:
t+=s
if t<=x:
c+=1
print(c)
``` | output | 1 | 101,846 | 5 | 203,693 |
Provide a correct Python 3 solution for this coding contest problem.
A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.
How many times will the ball make a bounce where the coordinate is at most X?
Constraints
* 1 \leq N \leq 100
* 1 \leq L_i \leq 100
* 1 \leq X \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N X
L_1 L_2 ... L_{N-1} L_N
Output
Print the number of times the ball will make a bounce where the coordinate is at most X.
Examples
Input
3 6
3 4 5
Output
2
Input
4 9
3 3 3 3
Output
4 | instruction | 0 | 101,847 | 5 | 203,694 |
"Correct Solution:
```
n, x = map(int, input().split())
l = list(map(int, input().split()))
ans = 1
d = 0
for i in l:
d = d + i
if d <= x: ans += 1
print(ans)
``` | output | 1 | 101,847 | 5 | 203,695 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.
How many times will the ball make a bounce where the coordinate is at most X?
Constraints
* 1 \leq N \leq 100
* 1 \leq L_i \leq 100
* 1 \leq X \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N X
L_1 L_2 ... L_{N-1} L_N
Output
Print the number of times the ball will make a bounce where the coordinate is at most X.
Examples
Input
3 6
3 4 5
Output
2
Input
4 9
3 3 3 3
Output
4
Submitted Solution:
```
n,x=map(int,input().split())
ll=list(map(int,input().split()))
ans=1
now=0
for l in ll:
now+=l
if now<=x:
ans+=1
print(ans)
``` | instruction | 0 | 101,848 | 5 | 203,696 |
Yes | output | 1 | 101,848 | 5 | 203,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.
How many times will the ball make a bounce where the coordinate is at most X?
Constraints
* 1 \leq N \leq 100
* 1 \leq L_i \leq 100
* 1 \leq X \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N X
L_1 L_2 ... L_{N-1} L_N
Output
Print the number of times the ball will make a bounce where the coordinate is at most X.
Examples
Input
3 6
3 4 5
Output
2
Input
4 9
3 3 3 3
Output
4
Submitted Solution:
```
ans=0
n,x=map(int,input().split())
l=list(map(int,input().split()))
d=0
for i in l:
d+=i
if d<=x:ans+=1
print(ans+1)
``` | instruction | 0 | 101,849 | 5 | 203,698 |
Yes | output | 1 | 101,849 | 5 | 203,699 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.
How many times will the ball make a bounce where the coordinate is at most X?
Constraints
* 1 \leq N \leq 100
* 1 \leq L_i \leq 100
* 1 \leq X \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N X
L_1 L_2 ... L_{N-1} L_N
Output
Print the number of times the ball will make a bounce where the coordinate is at most X.
Examples
Input
3 6
3 4 5
Output
2
Input
4 9
3 3 3 3
Output
4
Submitted Solution:
```
N,X=list(map(int,input().split()))
i=list(map(int,input().split()))
d=1
a=0
for s in i:
a+=s
if a<=X:
d+=1
print(d)
``` | instruction | 0 | 101,850 | 5 | 203,700 |
Yes | output | 1 | 101,850 | 5 | 203,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.
How many times will the ball make a bounce where the coordinate is at most X?
Constraints
* 1 \leq N \leq 100
* 1 \leq L_i \leq 100
* 1 \leq X \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N X
L_1 L_2 ... L_{N-1} L_N
Output
Print the number of times the ball will make a bounce where the coordinate is at most X.
Examples
Input
3 6
3 4 5
Output
2
Input
4 9
3 3 3 3
Output
4
Submitted Solution:
```
n,x=map(int,input().split())
l=list(map(int,input().split()))
ans,d=1,0
for i in l:
d+=i
if d<=x:
ans+=1
else:
break
print(ans)
``` | instruction | 0 | 101,851 | 5 | 203,702 |
Yes | output | 1 | 101,851 | 5 | 203,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.
How many times will the ball make a bounce where the coordinate is at most X?
Constraints
* 1 \leq N \leq 100
* 1 \leq L_i \leq 100
* 1 \leq X \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N X
L_1 L_2 ... L_{N-1} L_N
Output
Print the number of times the ball will make a bounce where the coordinate is at most X.
Examples
Input
3 6
3 4 5
Output
2
Input
4 9
3 3 3 3
Output
4
Submitted Solution:
```
N, X = map(int, input().split())
L = list(map(int, input().split()))
D =[0]
K = 0
for i in range(2, N+1):
D.append(D[i-2] + L[i-1])
D.append(D[(N+1)-2]+L[(N)-1])
k = [i for i in D if i <= X ]
print(len(k))
``` | instruction | 0 | 101,852 | 5 | 203,704 |
No | output | 1 | 101,852 | 5 | 203,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.
How many times will the ball make a bounce where the coordinate is at most X?
Constraints
* 1 \leq N \leq 100
* 1 \leq L_i \leq 100
* 1 \leq X \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N X
L_1 L_2 ... L_{N-1} L_N
Output
Print the number of times the ball will make a bounce where the coordinate is at most X.
Examples
Input
3 6
3 4 5
Output
2
Input
4 9
3 3 3 3
Output
4
Submitted Solution:
```
n, x = map(int, input().split())
l = list(map(int, input().split()))
res = 0
for i in range(n):
res += l[i]
if x < res:
break
print(i+1)
``` | instruction | 0 | 101,853 | 5 | 203,706 |
No | output | 1 | 101,853 | 5 | 203,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.
How many times will the ball make a bounce where the coordinate is at most X?
Constraints
* 1 \leq N \leq 100
* 1 \leq L_i \leq 100
* 1 \leq X \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N X
L_1 L_2 ... L_{N-1} L_N
Output
Print the number of times the ball will make a bounce where the coordinate is at most X.
Examples
Input
3 6
3 4 5
Output
2
Input
4 9
3 3 3 3
Output
4
Submitted Solution:
```
n,x = map(int,input().split())
l = list(map(int,input().split()))
d = 0
count = 1
for i in range(n):
d += l[i]
count += 1
if x <= d:
print(count)
break
``` | instruction | 0 | 101,854 | 5 | 203,708 |
No | output | 1 | 101,854 | 5 | 203,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.
How many times will the ball make a bounce where the coordinate is at most X?
Constraints
* 1 \leq N \leq 100
* 1 \leq L_i \leq 100
* 1 \leq X \leq 10000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N X
L_1 L_2 ... L_{N-1} L_N
Output
Print the number of times the ball will make a bounce where the coordinate is at most X.
Examples
Input
3 6
3 4 5
Output
2
Input
4 9
3 3 3 3
Output
4
Submitted Solution:
```
N, A=map(int, input().split())
L= list(map(int, input().split()))
X=0
count=0
for i in range(N+1):
if (X<A or X==A):
X=X+L[i]
count=count+1
else:
print(count)
break
``` | instruction | 0 | 101,855 | 5 | 203,710 |
No | output | 1 | 101,855 | 5 | 203,711 |
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
crc
1
Output
crc | instruction | 0 | 101,996 | 5 | 203,992 |
"Correct Solution:
```
from heapq import heappush, heappop
def solve():
S = input()
K = int(input())
L = len(S)
INF = 10**9
cost = [[INF]*(L+1) for i in range(L+1)]
cost[0][L] = 0
ss = []
que = [(0, 0, L)]
while que:
d, a, b = heappop(que)
if cost[a][b] < d:
continue
ss.append((a, b))
if a+1 == b:
if d+1 < cost[a+1][b]:
cost[a+1][b] = d + 1
continue
if S[a] == S[b-1]:
if d+2 < cost[a+1][b-1]:
cost[a+1][b-1] = d + 2
if a+1 < b-1:
heappush(que, (d+2, a+1, b-1))
else:
if d+2 < cost[a+1][b]:
cost[a+1][b] = d + 2
if a+1 < b:
heappush(que, (d+2, a+1, b))
if d+2 < cost[a][b-1]:
cost[a][b-1] = d + 2
if a < b-1:
heappush(que, (d+2, a, b-1))
ln = min(cost[i][i] for i in range(L+1))
ss.reverse()
dp = [[0]*(L+1) for i in range(L+1)]
for i in range(L+1):
if cost[i][i] == ln:
dp[i][i] = 1
for a, b in ss:
d = cost[a][b]
r = 0
if a+1 == b:
if d+1 == cost[a+1][b]:
r = dp[a+1][b]
else:
if S[a] == S[b-1]:
if d+2 == cost[a+1][b-1]:
r = dp[a+1][b-1]
else:
if d+2 == cost[a+1][b]:
r += dp[a+1][b]
if d+2 == cost[a][b-1]:
r += dp[a][b-1]
dp[a][b] = r
if dp[a][b] < K:
print("NONE")
return True
SL = []; SR = []
a = 0; b = L
while a < b:
if a+1 == b:
assert cost[a][b]+1 == cost[a+1][b]
SL.append(S[a])
a += 1
continue
if S[a] == S[b-1]:
assert cost[a][b]+2 == cost[a+1][b-1]
SL.append(S[a])
SR.append(S[b-1])
a += 1; b -= 1
elif S[a] < S[b-1]:
c = (cost[a][b]+2 == cost[a+1][b])
if c and K <= dp[a+1][b]:
SL.append(S[a])
SR.append(S[a])
a += 1
else:
if c:
K -= dp[a+1][b]
SL.append(S[b-1])
SR.append(S[b-1])
b -= 1
else:
c = (cost[a][b]+2 == cost[a][b-1])
if c and K <= dp[a][b-1]:
SL.append(S[b-1])
SR.append(S[b-1])
b -= 1
else:
if c:
K -= dp[a][b-1]
SL.append(S[a])
SR.append(S[a])
a += 1
SR.reverse()
SL.extend(SR)
print("".join(SL))
solve()
``` | output | 1 | 101,996 | 5 | 203,993 |
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 | instruction | 0 | 102,016 | 5 | 204,032 |
"Correct Solution:
```
i = 0
while True:
x = int(input())
if x == 0: break
i = i + 1
print("Case " + str(i) + ": " + str(x))
``` | output | 1 | 102,016 | 5 | 204,033 |
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 | instruction | 0 | 102,017 | 5 | 204,034 |
"Correct Solution:
```
i=1
while True:
x=int(input())
if x==0:break
else:
print('Case '+str(i)+':',x)
i+=1
``` | output | 1 | 102,017 | 5 | 204,035 |
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 | instruction | 0 | 102,018 | 5 | 204,036 |
"Correct Solution:
```
x = input()
i = 1
while x != '0':
print('Case {0}: {1}'.format(i, x))
x = input()
i += 1
``` | output | 1 | 102,018 | 5 | 204,037 |
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 | instruction | 0 | 102,019 | 5 | 204,038 |
"Correct Solution:
```
import sys
i=1
for i,a in enumerate(sys.stdin):
a=a.strip()
if a=='0':break
print(f'Case {i+1}: {a}')
``` | output | 1 | 102,019 | 5 | 204,039 |
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 | instruction | 0 | 102,020 | 5 | 204,040 |
"Correct Solution:
```
i = 0
x = int(input())
while x != 0:
i += 1
print("Case ", i, ": ", x, sep="")
x = int(input())
``` | output | 1 | 102,020 | 5 | 204,041 |
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 | instruction | 0 | 102,021 | 5 | 204,042 |
"Correct Solution:
```
i=0
while True:
x=int(input())
if x==0:
break
i+=1
print("Case %d: %d"%(i,x))
``` | output | 1 | 102,021 | 5 | 204,043 |
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 | instruction | 0 | 102,023 | 5 | 204,046 |
"Correct Solution:
```
cnt = 1
c = int(input())
while c != 0:
print("Case {0}: {1}".format(cnt,c))
c = int(input())
cnt += 1
``` | output | 1 | 102,023 | 5 | 204,047 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array A, consisting of n positive integers a_1, a_2, ..., a_n, and an array B, consisting of m positive integers b_1, b_2, ..., b_m.
Choose some element a of A and some element b of B such that a+b doesn't belong to A and doesn't belong to B.
For example, if A = [2, 1, 7] and B = [1, 3, 4], we can choose 1 from A and 4 from B, as number 5 = 1 + 4 doesn't belong to A and doesn't belong to B. However, we can't choose 2 from A and 1 from B, as 3 = 2 + 1 belongs to B.
It can be shown that such a pair exists. If there are multiple answers, print any.
Choose and print any such two numbers.
Input
The first line contains one integer n (1≤ n ≤ 100) — the number of elements of A.
The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 200) — the elements of A.
The third line contains one integer m (1≤ m ≤ 100) — the number of elements of B.
The fourth line contains m different integers b_1, b_2, ..., b_m (1 ≤ b_i ≤ 200) — the elements of B.
It can be shown that the answer always exists.
Output
Output two numbers a and b such that a belongs to A, b belongs to B, but a+b doesn't belong to nor A neither B.
If there are multiple answers, print any.
Examples
Input
1
20
2
10 20
Output
20 20
Input
3
3 2 2
5
1 5 7 7 9
Output
3 1
Input
4
1 3 5 7
4
7 5 3 1
Output
1 1
Note
In the first example, we can choose 20 from array [20] and 20 from array [10, 20]. Number 40 = 20 + 20 doesn't belong to any of those arrays. However, it is possible to choose 10 from the second array too.
In the second example, we can choose 3 from array [3, 2, 2] and 1 from array [1, 5, 7, 7, 9]. Number 4 = 3 + 1 doesn't belong to any of those arrays.
In the third example, we can choose 1 from array [1, 3, 5, 7] and 1 from array [7, 5, 3, 1]. Number 2 = 1 + 1 doesn't belong to any of those arrays.
Submitted Solution:
```
import sys
import math
#to read string
get_string = lambda: sys.stdin.readline().strip()
#to read list of integers
get_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )
#to read non spaced string and elements are integers to list of int
get_intList_from_str = lambda: list(map(int,list(sys.stdin.readline().strip())))
#to read non spaced string and elements are character to list of character
get_charList_from_str = lambda: list(sys.stdin.readline().strip())
#get word sepetared list of character
get_char_list = lambda: sys.stdin.readline().strip().split()
#to read integers
get_int = lambda: int(sys.stdin.readline())
#to print faster
pt = lambda x: sys.stdout.write(str(x))
#--------------------------------WhiteHat010--------------------------------------#
n1 = get_int()
lst1 = sorted(get_int_list())
n2 = get_int()
lst2 = sorted(get_int_list())
print(lst1[-1],lst2[-1])
``` | instruction | 0 | 102,096 | 5 | 204,192 |
Yes | output | 1 | 102,096 | 5 | 204,193 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array A, consisting of n positive integers a_1, a_2, ..., a_n, and an array B, consisting of m positive integers b_1, b_2, ..., b_m.
Choose some element a of A and some element b of B such that a+b doesn't belong to A and doesn't belong to B.
For example, if A = [2, 1, 7] and B = [1, 3, 4], we can choose 1 from A and 4 from B, as number 5 = 1 + 4 doesn't belong to A and doesn't belong to B. However, we can't choose 2 from A and 1 from B, as 3 = 2 + 1 belongs to B.
It can be shown that such a pair exists. If there are multiple answers, print any.
Choose and print any such two numbers.
Input
The first line contains one integer n (1≤ n ≤ 100) — the number of elements of A.
The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 200) — the elements of A.
The third line contains one integer m (1≤ m ≤ 100) — the number of elements of B.
The fourth line contains m different integers b_1, b_2, ..., b_m (1 ≤ b_i ≤ 200) — the elements of B.
It can be shown that the answer always exists.
Output
Output two numbers a and b such that a belongs to A, b belongs to B, but a+b doesn't belong to nor A neither B.
If there are multiple answers, print any.
Examples
Input
1
20
2
10 20
Output
20 20
Input
3
3 2 2
5
1 5 7 7 9
Output
3 1
Input
4
1 3 5 7
4
7 5 3 1
Output
1 1
Note
In the first example, we can choose 20 from array [20] and 20 from array [10, 20]. Number 40 = 20 + 20 doesn't belong to any of those arrays. However, it is possible to choose 10 from the second array too.
In the second example, we can choose 3 from array [3, 2, 2] and 1 from array [1, 5, 7, 7, 9]. Number 4 = 3 + 1 doesn't belong to any of those arrays.
In the third example, we can choose 1 from array [1, 3, 5, 7] and 1 from array [7, 5, 3, 1]. Number 2 = 1 + 1 doesn't belong to any of those arrays.
Submitted Solution:
```
n = int(input())
arr1 = set(map(int, input().split()))
m = int(input())
arr2 = set(map(int, input().split()))
check = False
for d in arr1:
for t in arr2:
if d + t not in arr1 and d + t not in arr2:
print(d, t)
check = True
break
if check:
break
``` | instruction | 0 | 102,097 | 5 | 204,194 |
Yes | output | 1 | 102,097 | 5 | 204,195 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array A, consisting of n positive integers a_1, a_2, ..., a_n, and an array B, consisting of m positive integers b_1, b_2, ..., b_m.
Choose some element a of A and some element b of B such that a+b doesn't belong to A and doesn't belong to B.
For example, if A = [2, 1, 7] and B = [1, 3, 4], we can choose 1 from A and 4 from B, as number 5 = 1 + 4 doesn't belong to A and doesn't belong to B. However, we can't choose 2 from A and 1 from B, as 3 = 2 + 1 belongs to B.
It can be shown that such a pair exists. If there are multiple answers, print any.
Choose and print any such two numbers.
Input
The first line contains one integer n (1≤ n ≤ 100) — the number of elements of A.
The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 200) — the elements of A.
The third line contains one integer m (1≤ m ≤ 100) — the number of elements of B.
The fourth line contains m different integers b_1, b_2, ..., b_m (1 ≤ b_i ≤ 200) — the elements of B.
It can be shown that the answer always exists.
Output
Output two numbers a and b such that a belongs to A, b belongs to B, but a+b doesn't belong to nor A neither B.
If there are multiple answers, print any.
Examples
Input
1
20
2
10 20
Output
20 20
Input
3
3 2 2
5
1 5 7 7 9
Output
3 1
Input
4
1 3 5 7
4
7 5 3 1
Output
1 1
Note
In the first example, we can choose 20 from array [20] and 20 from array [10, 20]. Number 40 = 20 + 20 doesn't belong to any of those arrays. However, it is possible to choose 10 from the second array too.
In the second example, we can choose 3 from array [3, 2, 2] and 1 from array [1, 5, 7, 7, 9]. Number 4 = 3 + 1 doesn't belong to any of those arrays.
In the third example, we can choose 1 from array [1, 3, 5, 7] and 1 from array [7, 5, 3, 1]. Number 2 = 1 + 1 doesn't belong to any of those arrays.
Submitted Solution:
```
n1 = int(input())
l1 = list(map(int,input().split()))
n2 = int(input())
l2 = list(map(int,input().split()))
for i in range(len(l1)):
for j in range(len(l2)):
x = l1[i]+l2[j]
b = 1
if (x in l1) or (x in l2):
b = 0
if(b):
print(l1[i],l2[j])
break
if(b):
break
``` | instruction | 0 | 102,098 | 5 | 204,196 |
Yes | output | 1 | 102,098 | 5 | 204,197 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array A, consisting of n positive integers a_1, a_2, ..., a_n, and an array B, consisting of m positive integers b_1, b_2, ..., b_m.
Choose some element a of A and some element b of B such that a+b doesn't belong to A and doesn't belong to B.
For example, if A = [2, 1, 7] and B = [1, 3, 4], we can choose 1 from A and 4 from B, as number 5 = 1 + 4 doesn't belong to A and doesn't belong to B. However, we can't choose 2 from A and 1 from B, as 3 = 2 + 1 belongs to B.
It can be shown that such a pair exists. If there are multiple answers, print any.
Choose and print any such two numbers.
Input
The first line contains one integer n (1≤ n ≤ 100) — the number of elements of A.
The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 200) — the elements of A.
The third line contains one integer m (1≤ m ≤ 100) — the number of elements of B.
The fourth line contains m different integers b_1, b_2, ..., b_m (1 ≤ b_i ≤ 200) — the elements of B.
It can be shown that the answer always exists.
Output
Output two numbers a and b such that a belongs to A, b belongs to B, but a+b doesn't belong to nor A neither B.
If there are multiple answers, print any.
Examples
Input
1
20
2
10 20
Output
20 20
Input
3
3 2 2
5
1 5 7 7 9
Output
3 1
Input
4
1 3 5 7
4
7 5 3 1
Output
1 1
Note
In the first example, we can choose 20 from array [20] and 20 from array [10, 20]. Number 40 = 20 + 20 doesn't belong to any of those arrays. However, it is possible to choose 10 from the second array too.
In the second example, we can choose 3 from array [3, 2, 2] and 1 from array [1, 5, 7, 7, 9]. Number 4 = 3 + 1 doesn't belong to any of those arrays.
In the third example, we can choose 1 from array [1, 3, 5, 7] and 1 from array [7, 5, 3, 1]. Number 2 = 1 + 1 doesn't belong to any of those arrays.
Submitted Solution:
```
input()
a = max(map(int, input().split()))
input()
b = max(map(int, input().split()))
print(a, b)
``` | instruction | 0 | 102,099 | 5 | 204,198 |
Yes | output | 1 | 102,099 | 5 | 204,199 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array A, consisting of n positive integers a_1, a_2, ..., a_n, and an array B, consisting of m positive integers b_1, b_2, ..., b_m.
Choose some element a of A and some element b of B such that a+b doesn't belong to A and doesn't belong to B.
For example, if A = [2, 1, 7] and B = [1, 3, 4], we can choose 1 from A and 4 from B, as number 5 = 1 + 4 doesn't belong to A and doesn't belong to B. However, we can't choose 2 from A and 1 from B, as 3 = 2 + 1 belongs to B.
It can be shown that such a pair exists. If there are multiple answers, print any.
Choose and print any such two numbers.
Input
The first line contains one integer n (1≤ n ≤ 100) — the number of elements of A.
The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 200) — the elements of A.
The third line contains one integer m (1≤ m ≤ 100) — the number of elements of B.
The fourth line contains m different integers b_1, b_2, ..., b_m (1 ≤ b_i ≤ 200) — the elements of B.
It can be shown that the answer always exists.
Output
Output two numbers a and b such that a belongs to A, b belongs to B, but a+b doesn't belong to nor A neither B.
If there are multiple answers, print any.
Examples
Input
1
20
2
10 20
Output
20 20
Input
3
3 2 2
5
1 5 7 7 9
Output
3 1
Input
4
1 3 5 7
4
7 5 3 1
Output
1 1
Note
In the first example, we can choose 20 from array [20] and 20 from array [10, 20]. Number 40 = 20 + 20 doesn't belong to any of those arrays. However, it is possible to choose 10 from the second array too.
In the second example, we can choose 3 from array [3, 2, 2] and 1 from array [1, 5, 7, 7, 9]. Number 4 = 3 + 1 doesn't belong to any of those arrays.
In the third example, we can choose 1 from array [1, 3, 5, 7] and 1 from array [7, 5, 3, 1]. Number 2 = 1 + 1 doesn't belong to any of those arrays.
Submitted Solution:
```
n=int(input())
a = list(map(int, input().split()))
k=int(input())
b = list(map(int, input().split()))
d=a+b
i=0
j=0
while i<n:
while j<k:
if a[i]+b[j] not in d:
print(a[i],b[j])
j=k
i=n
``` | instruction | 0 | 102,100 | 5 | 204,200 |
No | output | 1 | 102,100 | 5 | 204,201 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array A, consisting of n positive integers a_1, a_2, ..., a_n, and an array B, consisting of m positive integers b_1, b_2, ..., b_m.
Choose some element a of A and some element b of B such that a+b doesn't belong to A and doesn't belong to B.
For example, if A = [2, 1, 7] and B = [1, 3, 4], we can choose 1 from A and 4 from B, as number 5 = 1 + 4 doesn't belong to A and doesn't belong to B. However, we can't choose 2 from A and 1 from B, as 3 = 2 + 1 belongs to B.
It can be shown that such a pair exists. If there are multiple answers, print any.
Choose and print any such two numbers.
Input
The first line contains one integer n (1≤ n ≤ 100) — the number of elements of A.
The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 200) — the elements of A.
The third line contains one integer m (1≤ m ≤ 100) — the number of elements of B.
The fourth line contains m different integers b_1, b_2, ..., b_m (1 ≤ b_i ≤ 200) — the elements of B.
It can be shown that the answer always exists.
Output
Output two numbers a and b such that a belongs to A, b belongs to B, but a+b doesn't belong to nor A neither B.
If there are multiple answers, print any.
Examples
Input
1
20
2
10 20
Output
20 20
Input
3
3 2 2
5
1 5 7 7 9
Output
3 1
Input
4
1 3 5 7
4
7 5 3 1
Output
1 1
Note
In the first example, we can choose 20 from array [20] and 20 from array [10, 20]. Number 40 = 20 + 20 doesn't belong to any of those arrays. However, it is possible to choose 10 from the second array too.
In the second example, we can choose 3 from array [3, 2, 2] and 1 from array [1, 5, 7, 7, 9]. Number 4 = 3 + 1 doesn't belong to any of those arrays.
In the third example, we can choose 1 from array [1, 3, 5, 7] and 1 from array [7, 5, 3, 1]. Number 2 = 1 + 1 doesn't belong to any of those arrays.
Submitted Solution:
```
n = int(input())
ns = input().split()
m = int(input())
ms = input().split()
for i in range(n):
for x in range(m):
if int(ms[x]) + int(ns[i]) in ns:
pass
else:
if int(ms[x]) + int(ns[i]) in ns:
pass
else:
print(ns[i], ms[x])
exit()
``` | instruction | 0 | 102,101 | 5 | 204,202 |
No | output | 1 | 102,101 | 5 | 204,203 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array A, consisting of n positive integers a_1, a_2, ..., a_n, and an array B, consisting of m positive integers b_1, b_2, ..., b_m.
Choose some element a of A and some element b of B such that a+b doesn't belong to A and doesn't belong to B.
For example, if A = [2, 1, 7] and B = [1, 3, 4], we can choose 1 from A and 4 from B, as number 5 = 1 + 4 doesn't belong to A and doesn't belong to B. However, we can't choose 2 from A and 1 from B, as 3 = 2 + 1 belongs to B.
It can be shown that such a pair exists. If there are multiple answers, print any.
Choose and print any such two numbers.
Input
The first line contains one integer n (1≤ n ≤ 100) — the number of elements of A.
The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 200) — the elements of A.
The third line contains one integer m (1≤ m ≤ 100) — the number of elements of B.
The fourth line contains m different integers b_1, b_2, ..., b_m (1 ≤ b_i ≤ 200) — the elements of B.
It can be shown that the answer always exists.
Output
Output two numbers a and b such that a belongs to A, b belongs to B, but a+b doesn't belong to nor A neither B.
If there are multiple answers, print any.
Examples
Input
1
20
2
10 20
Output
20 20
Input
3
3 2 2
5
1 5 7 7 9
Output
3 1
Input
4
1 3 5 7
4
7 5 3 1
Output
1 1
Note
In the first example, we can choose 20 from array [20] and 20 from array [10, 20]. Number 40 = 20 + 20 doesn't belong to any of those arrays. However, it is possible to choose 10 from the second array too.
In the second example, we can choose 3 from array [3, 2, 2] and 1 from array [1, 5, 7, 7, 9]. Number 4 = 3 + 1 doesn't belong to any of those arrays.
In the third example, we can choose 1 from array [1, 3, 5, 7] and 1 from array [7, 5, 3, 1]. Number 2 = 1 + 1 doesn't belong to any of those arrays.
Submitted Solution:
```
n=int(input())
a = list(map(int, input().split()))
k=int(input())
b = list(map(int, input().split()))
##n=5
##a=[1,2,3,4,5]
##k=1
##b=[1]
t=True
d=a+b
print(d)
for i in a:
for j in b:
if not i+j in d:
print(i,j)
t=False
break
elif i+j in d:
continue
if not t:
break
``` | instruction | 0 | 102,102 | 5 | 204,204 |
No | output | 1 | 102,102 | 5 | 204,205 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array A, consisting of n positive integers a_1, a_2, ..., a_n, and an array B, consisting of m positive integers b_1, b_2, ..., b_m.
Choose some element a of A and some element b of B such that a+b doesn't belong to A and doesn't belong to B.
For example, if A = [2, 1, 7] and B = [1, 3, 4], we can choose 1 from A and 4 from B, as number 5 = 1 + 4 doesn't belong to A and doesn't belong to B. However, we can't choose 2 from A and 1 from B, as 3 = 2 + 1 belongs to B.
It can be shown that such a pair exists. If there are multiple answers, print any.
Choose and print any such two numbers.
Input
The first line contains one integer n (1≤ n ≤ 100) — the number of elements of A.
The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 200) — the elements of A.
The third line contains one integer m (1≤ m ≤ 100) — the number of elements of B.
The fourth line contains m different integers b_1, b_2, ..., b_m (1 ≤ b_i ≤ 200) — the elements of B.
It can be shown that the answer always exists.
Output
Output two numbers a and b such that a belongs to A, b belongs to B, but a+b doesn't belong to nor A neither B.
If there are multiple answers, print any.
Examples
Input
1
20
2
10 20
Output
20 20
Input
3
3 2 2
5
1 5 7 7 9
Output
3 1
Input
4
1 3 5 7
4
7 5 3 1
Output
1 1
Note
In the first example, we can choose 20 from array [20] and 20 from array [10, 20]. Number 40 = 20 + 20 doesn't belong to any of those arrays. However, it is possible to choose 10 from the second array too.
In the second example, we can choose 3 from array [3, 2, 2] and 1 from array [1, 5, 7, 7, 9]. Number 4 = 3 + 1 doesn't belong to any of those arrays.
In the third example, we can choose 1 from array [1, 3, 5, 7] and 1 from array [7, 5, 3, 1]. Number 2 = 1 + 1 doesn't belong to any of those arrays.
Submitted Solution:
```
a1=int(input())
a=list(map(int,input().split()))
b1=int(input())
b=list(map(int,input().split()))
z=0
x=0
l1=[]
l2=[]
for i in range(len(a)):
for j in range(len(b)):
x=(a[i]+b[j])
if x not in (b or a):
l1.append(a[i])
l2.append(b[j])
break
if z>0:
print("0")
else:
print(l1[0],l2[0])
``` | instruction | 0 | 102,103 | 5 | 204,206 |
No | output | 1 | 102,103 | 5 | 204,207 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of n integers a_1, a_2, ..., a_n, and a set b of k distinct integers from 1 to n.
In one operation, you may choose two integers i and x (1 ≤ i ≤ n, x can be any integer) and assign a_i := x. This operation can be done only if i does not belong to the set b.
Calculate the minimum number of operations you should perform so the array a is increasing (that is, a_1 < a_2 < a_3 < ... < a_n), or report that it is impossible.
Input
The first line contains two integers n and k (1 ≤ n ≤ 5 ⋅ 10^5, 0 ≤ k ≤ n) — the size of the array a and the set b, respectively.
The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9).
Then, if k ≠ 0, the third line follows, containing k integers b_1, b_2, ..., b_k (1 ≤ b_1 < b_2 < ... < b_k ≤ n). If k = 0, this line is skipped.
Output
If it is impossible to make the array a increasing using the given operations, print -1.
Otherwise, print one integer — the minimum number of operations you have to perform.
Examples
Input
7 2
1 2 1 1 3 5 1
3 5
Output
4
Input
3 3
1 3 2
1 2 3
Output
-1
Input
5 0
4 3 1 2 3
Output
2
Input
10 3
1 3 5 6 12 9 8 10 13 15
2 4 9
Output
3
Submitted Solution:
```
import os
import sys
from io import BytesIO, IOBase
# 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()
# ------------------------------
def RL(): return map(int, sys.stdin.readline().split())
def RLL(): return list(map(int, sys.stdin.readline().split()))
def N(): return int(input())
def print_list(l):
print(' '.join(map(str,l)))
# sys.setrecursionlimit(300000)
# from heapq import *
# from collections import deque as dq
# from math import ceil,floor,sqrt,pow
import bisect as bs
# from collections import Counter
# from collections import defaultdict as dc
# from functools import lru_cache
n,k = RL()
a = RLL()
b = RLL()
flag = True
for i in range(1,k):
x,y = b[i-1],b[i]
if a[y-1]-a[x-1]<y-x:
flag = False
break
if not flag:
print(-1)
else:
a = [a[i]-i for i in range(n)]
j = 0
d = [0]*(n+1)
e = 0
s = 0
for i in range(n):
if s>0 and a[i]<d[s-1]:
continue
p = bs.bisect_right(d,a[i],s,e)
d[p] = a[i]
if j<k and i+1==b[j]:
j+=1
e = p+1
s = p+1
elif p==e:
e+=1
# print(d,e)
print(n-e)
``` | instruction | 0 | 102,245 | 5 | 204,490 |
Yes | output | 1 | 102,245 | 5 | 204,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of n integers a_1, a_2, ..., a_n, and a set b of k distinct integers from 1 to n.
In one operation, you may choose two integers i and x (1 ≤ i ≤ n, x can be any integer) and assign a_i := x. This operation can be done only if i does not belong to the set b.
Calculate the minimum number of operations you should perform so the array a is increasing (that is, a_1 < a_2 < a_3 < ... < a_n), or report that it is impossible.
Input
The first line contains two integers n and k (1 ≤ n ≤ 5 ⋅ 10^5, 0 ≤ k ≤ n) — the size of the array a and the set b, respectively.
The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9).
Then, if k ≠ 0, the third line follows, containing k integers b_1, b_2, ..., b_k (1 ≤ b_1 < b_2 < ... < b_k ≤ n). If k = 0, this line is skipped.
Output
If it is impossible to make the array a increasing using the given operations, print -1.
Otherwise, print one integer — the minimum number of operations you have to perform.
Examples
Input
7 2
1 2 1 1 3 5 1
3 5
Output
4
Input
3 3
1 3 2
1 2 3
Output
-1
Input
5 0
4 3 1 2 3
Output
2
Input
10 3
1 3 5 6 12 9 8 10 13 15
2 4 9
Output
3
Submitted Solution:
```
def upper_bound(arr,target,l,r):
i=l
j=r
mid=j
while i < j:
mid = (i + j ) // 2
if target >= arr[mid]:
i = mid + 1
else:
j = mid
return j
x,y = map(int,input().split())
a = [-10**9]+list(map(int,input().split()))
a.append(10**9)
b=[0]
if y!=0:
b+=list(map(int,input().split()))
b.append(x+1)
b.sort()
d=[]
for i in range(5*(10**5)+100):
d.append(0)
def count(l,r):
global a,d
len=1
d[len]=a[l]
n=l+1
m=r+1
for i in range(n,m):
if a[i]>=d[len]:
len+=1
d[len]=a[i]
else:
j=upper_bound(d,a[i],1,len+1)
if j!=1:
d[j]=a[i]
pos=upper_bound(d,a[i],1,len+1)-1
return (r-l+1)-pos
flag=1
if y>1:
for i in range(1,y):
if(a[b[i+1]]-a[b[i]]<b[i+1]-b[i]):
flag=0
break
sum=0
for i in range(1,x+1):
a[i]-=i
if flag==0:
print (-1)
else:
for i in range(1,y+2):
sum+=count(b[i-1],b[i])
print(sum)
``` | instruction | 0 | 102,246 | 5 | 204,492 |
Yes | output | 1 | 102,246 | 5 | 204,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of n integers a_1, a_2, ..., a_n, and a set b of k distinct integers from 1 to n.
In one operation, you may choose two integers i and x (1 ≤ i ≤ n, x can be any integer) and assign a_i := x. This operation can be done only if i does not belong to the set b.
Calculate the minimum number of operations you should perform so the array a is increasing (that is, a_1 < a_2 < a_3 < ... < a_n), or report that it is impossible.
Input
The first line contains two integers n and k (1 ≤ n ≤ 5 ⋅ 10^5, 0 ≤ k ≤ n) — the size of the array a and the set b, respectively.
The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9).
Then, if k ≠ 0, the third line follows, containing k integers b_1, b_2, ..., b_k (1 ≤ b_1 < b_2 < ... < b_k ≤ n). If k = 0, this line is skipped.
Output
If it is impossible to make the array a increasing using the given operations, print -1.
Otherwise, print one integer — the minimum number of operations you have to perform.
Examples
Input
7 2
1 2 1 1 3 5 1
3 5
Output
4
Input
3 3
1 3 2
1 2 3
Output
-1
Input
5 0
4 3 1 2 3
Output
2
Input
10 3
1 3 5 6 12 9 8 10 13 15
2 4 9
Output
3
Submitted Solution:
```
maxn=1e6+10
a=list()
l=list()
b=list()
b1=list()
lasb=0
ban=list()
for i in range(1000010):
ban.append(0)
l.append(0)
s1=input()
w=s1.split(' ')
n=int(w[0])
k=int(w[1])
a.append(0)
b.append(0)
s2=input()
w2=s2.split(' ')
for i in range(n):
a.append(int(w2[i]))
if k!=0:
s3 = input()
w3 = s3.split(' ')
for i in range(k):
b1.append(int(w3[i]))
b1.sort()
for i in range(k):
b.append(b1[i])
ban[b1[i]]=1
f=True
for i in range(2,k+1):
if a[b[i-1]]-b[i-1]>a[b[i]]-b[i]:
print(-1)
f=False
if f:
e = 0
for i in range(1, n + 1):
a[i] -= i
for i in range(1, n + 1):
if e == 0 or a[i] >= l[e]:
e = e + 1
l[e] = a[i]
if (ban[i] == 1):
lasb = e
else:
flag = False
c = list()
for k in range(e):
c.append(l[k + 1])
for v in range(e):
if l[v] > a[i]:
break
p = v+1
if p <= lasb:
continue
l[p] = a[i]
if ban[i] == 1:
lasb = p
e = p
print(n - e)
``` | instruction | 0 | 102,250 | 5 | 204,500 |
No | output | 1 | 102,250 | 5 | 204,501 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three positive integers x, y, n. Your task is to find the nearest fraction to fraction <image> whose denominator is no more than n.
Formally, you should find such pair of integers a, b (1 ≤ b ≤ n; 0 ≤ a) that the value <image> is as minimal as possible.
If there are multiple "nearest" fractions, choose the one with the minimum denominator. If there are multiple "nearest" fractions with the minimum denominator, choose the one with the minimum numerator.
Input
A single line contains three integers x, y, n (1 ≤ x, y, n ≤ 105).
Output
Print the required fraction in the format "a/b" (without quotes).
Examples
Input
3 7 6
Output
2/5
Input
7 2 4
Output
7/2
Submitted Solution:
```
from fractions import Fraction
x, y, n = map(int, input().split())
v = Fraction(x, y).limit_denominator(n)
print(v.numerator, '/', v.denominator, sep='')
``` | instruction | 0 | 102,359 | 5 | 204,718 |
Yes | output | 1 | 102,359 | 5 | 204,719 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three positive integers x, y, n. Your task is to find the nearest fraction to fraction <image> whose denominator is no more than n.
Formally, you should find such pair of integers a, b (1 ≤ b ≤ n; 0 ≤ a) that the value <image> is as minimal as possible.
If there are multiple "nearest" fractions, choose the one with the minimum denominator. If there are multiple "nearest" fractions with the minimum denominator, choose the one with the minimum numerator.
Input
A single line contains three integers x, y, n (1 ≤ x, y, n ≤ 105).
Output
Print the required fraction in the format "a/b" (without quotes).
Examples
Input
3 7 6
Output
2/5
Input
7 2 4
Output
7/2
Submitted Solution:
```
from fractions import Fraction
x,y,n=map(int,input().split())
f=Fraction(x,y).limit_denominator(n)
print(str(f.numerator)+'/'+str(f.denominator))
``` | instruction | 0 | 102,360 | 5 | 204,720 |
Yes | output | 1 | 102,360 | 5 | 204,721 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three positive integers x, y, n. Your task is to find the nearest fraction to fraction <image> whose denominator is no more than n.
Formally, you should find such pair of integers a, b (1 ≤ b ≤ n; 0 ≤ a) that the value <image> is as minimal as possible.
If there are multiple "nearest" fractions, choose the one with the minimum denominator. If there are multiple "nearest" fractions with the minimum denominator, choose the one with the minimum numerator.
Input
A single line contains three integers x, y, n (1 ≤ x, y, n ≤ 105).
Output
Print the required fraction in the format "a/b" (without quotes).
Examples
Input
3 7 6
Output
2/5
Input
7 2 4
Output
7/2
Submitted Solution:
```
from fractions import Fraction
x,y,n=map(int,input().split())
f=Fraction(x,y).limit_denominator(n)
if("/" not in str(f)):
print(str(f)+"/1")
else:
print(f)
``` | instruction | 0 | 102,362 | 5 | 204,724 |
Yes | output | 1 | 102,362 | 5 | 204,725 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three positive integers x, y, n. Your task is to find the nearest fraction to fraction <image> whose denominator is no more than n.
Formally, you should find such pair of integers a, b (1 ≤ b ≤ n; 0 ≤ a) that the value <image> is as minimal as possible.
If there are multiple "nearest" fractions, choose the one with the minimum denominator. If there are multiple "nearest" fractions with the minimum denominator, choose the one with the minimum numerator.
Input
A single line contains three integers x, y, n (1 ≤ x, y, n ≤ 105).
Output
Print the required fraction in the format "a/b" (without quotes).
Examples
Input
3 7 6
Output
2/5
Input
7 2 4
Output
7/2
Submitted Solution:
```
import os
import sys
from io import BytesIO, IOBase
import math
def main():
pass
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")
def binary(n):
return (bin(n).replace("0b", ""))
def decimal(s):
return (int(s, 2))
def pow2(n):
p = 0
while (n > 1):
n //= 2
p += 1
return (p)
def primeFactors(n):
l=[]
while n % 2 == 0:
l.append(2)
n = n / 2
for i in range(3, int(math.sqrt(n)) + 1, 2):
while n % i == 0:
l.append(i)
n = n / i
if n > 2:
l.append(int(n))
return (l)
def isPrime(n):
if (n == 1):
return (False)
else:
root = int(n ** 0.5)
root += 1
for i in range(2, root):
if (n % i == 0):
return (False)
return (True)
def maxPrimeFactors(n):
maxPrime = -1
while n % 2 == 0:
maxPrime = 2
n >>= 1
for i in range(3, int(math.sqrt(n)) + 1, 2):
while n % i == 0:
maxPrime = i
n = n / i
if n > 2:
maxPrime = n
return int(maxPrime)
x,y,n=map(int,input().split())
v=x/y
ans=[100000000000,1]
ansv=1000000000
for b in range(1,n):
a1=int(v*b)
a2=a1+1
if(abs(a1/b-v)<ansv):
ansv=abs(a1/b-v)
ans[0],ans[1]=a1,b
elif(abs(a2/b)<ansv):
ansv=abs(a2/b-v)
ans[0],ans[1]=a2,b
print(str(ans[0])+"/"+str(ans[1]))
``` | instruction | 0 | 102,363 | 5 | 204,726 |
No | output | 1 | 102,363 | 5 | 204,727 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three positive integers x, y, n. Your task is to find the nearest fraction to fraction <image> whose denominator is no more than n.
Formally, you should find such pair of integers a, b (1 ≤ b ≤ n; 0 ≤ a) that the value <image> is as minimal as possible.
If there are multiple "nearest" fractions, choose the one with the minimum denominator. If there are multiple "nearest" fractions with the minimum denominator, choose the one with the minimum numerator.
Input
A single line contains three integers x, y, n (1 ≤ x, y, n ≤ 105).
Output
Print the required fraction in the format "a/b" (without quotes).
Examples
Input
3 7 6
Output
2/5
Input
7 2 4
Output
7/2
Submitted Solution:
```
from fractions import Fraction
x,y,n = map(int,input().split())
if y<=n:
b=Fraction(x,y)
print('{}/{}'.format(b.numerator,b.denominator))
else:
a=x/y
b=Fraction(a).limit_denominator(n)
print('{}/{}'.format(b.numerator,b.denominator))
``` | instruction | 0 | 102,364 | 5 | 204,728 |
No | output | 1 | 102,364 | 5 | 204,729 |
Provide a correct Python 3 solution for this coding contest problem.
We have N logs of lengths A_1,A_2,\cdots A_N.
We can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t (0<t<L), it becomes two logs of lengths t and L-t.
Find the shortest possible length of the longest log after at most K cuts, and print it after rounding up to an integer.
Constraints
* 1 \leq N \leq 2 \times 10^5
* 0 \leq K \leq 10^9
* 1 \leq A_i \leq 10^9
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
A_1 A_2 \cdots A_N
Output
Print an integer representing the answer.
Examples
Input
2 3
7 9
Output
4
Input
3 0
3 4 5
Output
5
Input
10 10
158260522 877914575 602436426 24979445 861648772 623690081 433933447 476190629 262703497 211047202
Output
292638192 | instruction | 0 | 102,688 | 5 | 205,376 |
"Correct Solution:
```
def f(x):
now = 0
for i in range(n):
now += (a[i]-1)//x
return now <= k
n, k = map(int, input().split())
a = list(map(int, input().split()))
ng = 0
ok= int(1e9)
while ok - ng > 1:
x = (ok + ng) // 2
if f(x):
ok = x
else:
ng = x
print(ok)
``` | output | 1 | 102,688 | 5 | 205,377 |
Provide a correct Python 3 solution for this coding contest problem.
We have N logs of lengths A_1,A_2,\cdots A_N.
We can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t (0<t<L), it becomes two logs of lengths t and L-t.
Find the shortest possible length of the longest log after at most K cuts, and print it after rounding up to an integer.
Constraints
* 1 \leq N \leq 2 \times 10^5
* 0 \leq K \leq 10^9
* 1 \leq A_i \leq 10^9
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
A_1 A_2 \cdots A_N
Output
Print an integer representing the answer.
Examples
Input
2 3
7 9
Output
4
Input
3 0
3 4 5
Output
5
Input
10 10
158260522 877914575 602436426 24979445 861648772 623690081 433933447 476190629 262703497 211047202
Output
292638192 | instruction | 0 | 102,689 | 5 | 205,378 |
"Correct Solution:
```
N,K = map(int,input().split())
A = list(map(int,input().split()))
def check(x):
count = 0
for Ai in A:
count += (Ai - 1)//x
return count <= K
#めぐる式そのまま
ok = 10**9
ng = 0
while ok-ng > 1:
mid = (ok + ng)//2
if check(mid):
ok = mid
else:
ng = mid
print(ok)
``` | output | 1 | 102,689 | 5 | 205,379 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.