message stringlengths 2 39.6k | message_type stringclasses 2 values | message_id int64 0 1 | conversation_id int64 219 108k | cluster float64 11 11 | __index_level_0__ int64 438 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In Python, code blocks don't have explicit begin/end or curly braces to mark beginning and end of the block. Instead, code blocks are defined by indentation.
We will consider an extremely simplified subset of Python with only two types of statements.
Simple statements are written in a single line, one per line. An example of a simple statement is assignment.
For statements are compound statements: they contain one or several other statements. For statement consists of a header written in a separate line which starts with "for" prefix, and loop body. Loop body is a block of statements indented one level further than the header of the loop. Loop body can contain both types of statements. Loop body can't be empty.
You are given a sequence of statements without indentation. Find the number of ways in which the statements can be indented to form a valid Python program.
Input
The first line contains a single integer N (1 β€ N β€ 5000) β the number of commands in the program. N lines of the program follow, each line describing a single command. Each command is either "f" (denoting "for statement") or "s" ("simple statement"). It is guaranteed that the last line is a simple statement.
Output
Output one line containing an integer - the number of ways the given sequence of statements can be indented modulo 109 + 7.
Examples
Input
4
s
f
f
s
Output
1
Input
4
f
s
f
s
Output
2
Note
In the first test case, there is only one way to indent the program: the second for statement must be part of the body of the first one.
simple statement
for statement
for statement
simple statement
In the second test case, there are two ways to indent the program: the second for statement can either be part of the first one's body or a separate statement following the first one.
for statement
simple statement
for statement
simple statement
or
for statement
simple statement
for statement
simple statement
Submitted Solution:
```
n = int(input())
I = [0] * n
ii = 0
indent = 0
# creating the dp matrix
dp = []
for _ in range(n):
dp.append([0] * n)
p = []
for _ in range(n):
p.append(input())
dp[0][0] = 1
indent = 0
for i in range(1, n):
if p[i-1] == 'f':
indent = indent + 1
for j in range(1, indent+1):
dp[i][j] = dp[i-1][j-1]
else:
dp[i][indent] = dp[i-1][indent]
suffix = 0#dp[i-1][indent]
for j in range(indent,-1,-1):
suffix = suffix + dp[i-1][j]
dp[i][j] = suffix
# for a in dp: print(a)
# summing up the result of the last row
r = 0
for j in range(0,n-1):
r = r + dp[n-1][j]
print(r)
# 0 1 2 3
# f 1 0 0 0
# f 0 1 0 0
# s 1 1 0 0
# s 2 1 0 0
# s 3 1 0 0
# f
# f
# s
# --s
# s
``` | instruction | 0 | 16,547 | 11 | 33,094 |
No | output | 1 | 16,547 | 11 | 33,095 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N apple trees in a row. People say that one of them will bear golden apples.
We want to deploy some number of inspectors so that each of these trees will be inspected.
Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector deployed under the i-th tree (1 \leq i \leq N) will inspect the trees with numbers between i-D and i+D (inclusive).
Find the minimum number of inspectors that we need to deploy to achieve the objective.
Constraints
* All values in input are integers.
* 1 \leq N \leq 20
* 1 \leq D \leq 20
Input
Input is given from Standard Input in the following format:
N D
Output
Print the minimum number of inspectors that we need to deploy to achieve the objective.
Examples
Input
6 2
Output
2
Input
14 3
Output
2
Input
20 4
Output
3
Submitted Solution:
```
a,b=map(int,input().split());print(-(-a//(2*b+1)))
``` | instruction | 0 | 16,618 | 11 | 33,236 |
Yes | output | 1 | 16,618 | 11 | 33,237 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N apple trees in a row. People say that one of them will bear golden apples.
We want to deploy some number of inspectors so that each of these trees will be inspected.
Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector deployed under the i-th tree (1 \leq i \leq N) will inspect the trees with numbers between i-D and i+D (inclusive).
Find the minimum number of inspectors that we need to deploy to achieve the objective.
Constraints
* All values in input are integers.
* 1 \leq N \leq 20
* 1 \leq D \leq 20
Input
Input is given from Standard Input in the following format:
N D
Output
Print the minimum number of inspectors that we need to deploy to achieve the objective.
Examples
Input
6 2
Output
2
Input
14 3
Output
2
Input
20 4
Output
3
Submitted Solution:
```
N,D = map(int,input().split())
print(((N-1)//(2*D+1))+1)
``` | instruction | 0 | 16,619 | 11 | 33,238 |
Yes | output | 1 | 16,619 | 11 | 33,239 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N apple trees in a row. People say that one of them will bear golden apples.
We want to deploy some number of inspectors so that each of these trees will be inspected.
Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector deployed under the i-th tree (1 \leq i \leq N) will inspect the trees with numbers between i-D and i+D (inclusive).
Find the minimum number of inspectors that we need to deploy to achieve the objective.
Constraints
* All values in input are integers.
* 1 \leq N \leq 20
* 1 \leq D \leq 20
Input
Input is given from Standard Input in the following format:
N D
Output
Print the minimum number of inspectors that we need to deploy to achieve the objective.
Examples
Input
6 2
Output
2
Input
14 3
Output
2
Input
20 4
Output
3
Submitted Solution:
```
N,D = map(int,input().split())
print(-(N//-(D*2+1)))
``` | instruction | 0 | 16,620 | 11 | 33,240 |
Yes | output | 1 | 16,620 | 11 | 33,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N apple trees in a row. People say that one of them will bear golden apples.
We want to deploy some number of inspectors so that each of these trees will be inspected.
Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector deployed under the i-th tree (1 \leq i \leq N) will inspect the trees with numbers between i-D and i+D (inclusive).
Find the minimum number of inspectors that we need to deploy to achieve the objective.
Constraints
* All values in input are integers.
* 1 \leq N \leq 20
* 1 \leq D \leq 20
Input
Input is given from Standard Input in the following format:
N D
Output
Print the minimum number of inspectors that we need to deploy to achieve the objective.
Examples
Input
6 2
Output
2
Input
14 3
Output
2
Input
20 4
Output
3
Submitted Solution:
```
n,d = map(int,input().split())
d += d + 1
print((n+d-1)//d)
``` | instruction | 0 | 16,621 | 11 | 33,242 |
Yes | output | 1 | 16,621 | 11 | 33,243 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N apple trees in a row. People say that one of them will bear golden apples.
We want to deploy some number of inspectors so that each of these trees will be inspected.
Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector deployed under the i-th tree (1 \leq i \leq N) will inspect the trees with numbers between i-D and i+D (inclusive).
Find the minimum number of inspectors that we need to deploy to achieve the objective.
Constraints
* All values in input are integers.
* 1 \leq N \leq 20
* 1 \leq D \leq 20
Input
Input is given from Standard Input in the following format:
N D
Output
Print the minimum number of inspectors that we need to deploy to achieve the objective.
Examples
Input
6 2
Output
2
Input
14 3
Output
2
Input
20 4
Output
3
Submitted Solution:
```
n, d = map(int, input().split())
ans = n/d
if n%((d*2)+1) == 0:
print(int(n/(d*2)))
else:
print(int(n/(d*2))+1)
``` | instruction | 0 | 16,622 | 11 | 33,244 |
No | output | 1 | 16,622 | 11 | 33,245 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N apple trees in a row. People say that one of them will bear golden apples.
We want to deploy some number of inspectors so that each of these trees will be inspected.
Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector deployed under the i-th tree (1 \leq i \leq N) will inspect the trees with numbers between i-D and i+D (inclusive).
Find the minimum number of inspectors that we need to deploy to achieve the objective.
Constraints
* All values in input are integers.
* 1 \leq N \leq 20
* 1 \leq D \leq 20
Input
Input is given from Standard Input in the following format:
N D
Output
Print the minimum number of inspectors that we need to deploy to achieve the objective.
Examples
Input
6 2
Output
2
Input
14 3
Output
2
Input
20 4
Output
3
Submitted Solution:
```
a,b=map(int,input().split())
if a//(b*2+1)==0:
print (a//(b*2+1))
else:
print (a//(b*2+1)+1)
``` | instruction | 0 | 16,623 | 11 | 33,246 |
No | output | 1 | 16,623 | 11 | 33,247 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N apple trees in a row. People say that one of them will bear golden apples.
We want to deploy some number of inspectors so that each of these trees will be inspected.
Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector deployed under the i-th tree (1 \leq i \leq N) will inspect the trees with numbers between i-D and i+D (inclusive).
Find the minimum number of inspectors that we need to deploy to achieve the objective.
Constraints
* All values in input are integers.
* 1 \leq N \leq 20
* 1 \leq D \leq 20
Input
Input is given from Standard Input in the following format:
N D
Output
Print the minimum number of inspectors that we need to deploy to achieve the objective.
Examples
Input
6 2
Output
2
Input
14 3
Output
2
Input
20 4
Output
3
Submitted Solution:
```
N,D = map(int,input().split())
#X_list = [int(input()) for i in range(N)]
#X2_list = [list(map(int,input().split())) for i in range(N)]
tmp = D + D + 1
cnt = 1
while N > tmp:
tmp +=tmp
cnt+=1
print(cnt)
``` | instruction | 0 | 16,624 | 11 | 33,248 |
No | output | 1 | 16,624 | 11 | 33,249 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Taro is playing with a puzzle that places numbers 1-9 in 9x9 squares. In this puzzle, you have to arrange the numbers according to the following rules.
* One number appears exactly once in the same column
* A number appears exactly once on the same line
* In each of the 3x3 ranges separated by double lines, a number appears exactly once.
For example, Figure 1 below is one arrangement that meets such a rule. However, Taro often creates an arrangement that violates the rules, as shown in Figure 2. The "2" appears twice in the leftmost column, the "1" never appears, the "1" appears twice in the second column from the left, and the "2" never appears. ..
<image> | <image>
--- | ---
Figure 1 | Figure 2
To help Taro, write a program that reads the arrangement of numbers, checks if the arrangement meets the rules, and outputs the location if it violates the rules. Please display * (half-width asterisk) before the number that is incorrect (appears more than once) according to the three rules, and blank before the number that is not incorrect.
Input
Given multiple datasets. The first row gives the number of datasets n (n β€ 20). Each dataset is given a 9-character, 9-line numeric string that indicates the state of the puzzle.
Output
Output the following for each dataset.
Given number, * (half-width asterisk) and blank. Add * before the wrong number and a half-width space before the wrong number.
Insert a blank line between the datasets.
Example
Input
2
2 1 3 4 5 6 7 8 9
4 5 6 7 8 9 1 2 3
7 8 9 1 2 3 4 5 6
2 3 4 5 6 7 8 9 1
5 6 7 8 9 1 2 3 4
8 9 1 2 3 4 5 6 7
3 4 5 6 7 8 9 1 2
6 7 8 9 1 2 3 4 5
9 1 2 3 4 5 6 7 8
2 1 3 4 5 6 7 8 9
4 5 6 7 8 9 1 2 3
7 8 9 1 2 3 4 5 6
2 3 4 5 6 7 8 9 1
5 6 7 8 9 1 2 3 4
8 9 1 2 3 4 5 6 7
3 4 5 6 7 8 9 1 2
6 7 8 9 1 2 3 4 5
9 1 2 3 4 5 6 7 8
Output
*2*1 3 4 5 6 7 8 9
4 5 6 7 8 9 1 2 3
7 8 9 1 2 3 4 5 6
*2 3 4 5 6 7 8 9 1
5 6 7 8 9 1 2 3 4
8 9 1 2 3 4 5 6 7
3 4 5 6 7 8 9 1 2
6 7 8 9 1 2 3 4 5
9*1 2 3 4 5 6 7 8
*2*1 3 4 5 6 7 8 9
4 5 6 7 8 9 1 2 3
7 8 9 1 2 3 4 5 6
*2 3 4 5 6 7 8 9 1
5 6 7 8 9 1 2 3 4
8 9 1 2 3 4 5 6 7
3 4 5 6 7 8 9 1 2
6 7 8 9 1 2 3 4 5
9*1 2 3 4 5 6 7 8
Submitted Solution:
```
from collections import Counter
CounterKey = ("1", "2", "3", "4", "5", "6", "7", "8", "9")
inputCount = int(input())
for _ in range(inputCount):
puzzle = []
mark = []
for lp in range(9):
puzzle.append([item for item in input().split(" ")])
mark.append([item for item in " " * 9])
# ζ¨ͺ
for rowIndex, row in enumerate(puzzle):
counter = Counter(row)
needNum = [num for num in CounterKey if 1 < counter[num]]
if not needNum:
continue
for colIndex, item in enumerate(row):
if item in needNum:
mark[rowIndex][colIndex] = "*"
# ηΈ¦
for colIndex, col in enumerate(
zip(puzzle[0], puzzle[1], puzzle[2], puzzle[3], puzzle[4], puzzle[5], puzzle[6], puzzle[7], puzzle[8])):
counter = Counter(col)
needNum = [num for num in CounterKey if 1 < counter[num]]
if not needNum:
continue
for rowIndex, item in enumerate(col):
if item in needNum:
mark[rowIndex][colIndex] = "*"
# εθ§
for lp in range(3):
block = []
for blockCount, col in enumerate(zip(puzzle[lp * 3], puzzle[lp * 3 + 1], puzzle[lp * 3 + 2])):
block.extend(col)
if blockCount % 3 - 2 == 0:
counter = Counter(block)
needNum = [num for num in CounterKey if 1 < counter[num]]
if needNum:
for index, item in enumerate(block):
if item in needNum:
rowIndex, colIndex = lp * 3 + index % 3, blockCount - 2 + index // 3
mark[rowIndex][colIndex] = "*"
block = []
# εΊε
for p, m in zip(puzzle, mark):
output = []
for num, state in zip(p, m):
output.append(state)
output.append(num)
print("".join(output))
``` | instruction | 0 | 16,735 | 11 | 33,470 |
No | output | 1 | 16,735 | 11 | 33,471 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
To write a research paper, you should definitely follow the structured format. This format, in many cases, is strictly defined, and students who try to write their papers have a hard time with it.
One of such formats is related to citations. If you refer several pages of a material, you should enumerate their page numbers in ascending order. However, enumerating many page numbers waste space, so you should use the following abbreviated notation:
When you refer all pages between page a and page b (a < b), you must use the notation "a-b". For example, when you refer pages 1, 2, 3, 4, you must write "1-4" not "1 2 3 4". You must not write, for example, "1-2 3-4", "1-3 4", "1-3 2-4" and so on. When you refer one page and do not refer the previous and the next page of that page, you can write just the number of that page, but you must follow the notation when you refer successive pages (more than or equal to 2). Typically, commas are used to separate page numbers, in this problem we use space to separate the page numbers.
You, a kind senior, decided to write a program which generates the abbreviated notation for your junior who struggle with the citation.
Constraints
* 1 β€ n β€ 50
Input
Input consists of several datasets.
The first line of the dataset indicates the number of pages n.
Next line consists of n integers. These integers are arranged in ascending order and they are differ from each other.
Input ends when n = 0.
Output
For each dataset, output the abbreviated notation in a line. Your program should not print extra space. Especially, be careful about the space at the end of line.
Example
Input
5
1 2 3 5 6
3
7 8 9
0
Output
1-3 5-6
7-9
Submitted Solution:
```
while True:
n = int(input())
if n == 0:
break
line = list(map(int, input().split()))
t = len(line)-1
ans = []
i = 0
while True:
ans.append(line[i])
while i < t:
if line[i]+1 == line[i+1]:
i += 1
else:
ans.append(line[i])
i += 1
break
if i == t:
ans.append(line[i])
break
print(*ans)
``` | instruction | 0 | 16,763 | 11 | 33,526 |
No | output | 1 | 16,763 | 11 | 33,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer x. Can you make x by summing up some number of 11, 111, 1111, 11111, β¦? (You can use any number among them any number of times).
For instance,
* 33=11+11+11
* 144=111+11+11+11
Input
The first line of input contains a single integer t (1 β€ t β€ 10000) β the number of testcases.
The first and only line of each testcase contains a single integer x (1 β€ x β€ 10^9) β the number you have to make.
Output
For each testcase, you should output a single string. If you can make x, output "YES" (without quotes). Otherwise, output "NO".
You can print each letter of "YES" and "NO" in any case (upper or lower).
Example
Input
3
33
144
69
Output
YES
YES
NO
Note
Ways to make 33 and 144 were presented in the statement. It can be proved that we can't present 69 this way.
Submitted Solution:
```
seen = set()
def solve(n: int) -> bool:
if (n in seen):
return False
seen.add(n)
if (not n):
return True
if (n < 11):
return False
for i in range(2, 9):
j = int("1"*i)
mul = n // j
if (solve(n - mul*j)):
return True
return False
test_cases = int(input())
for _ in range(test_cases):
n = int(input())
print("YES" if solve(n) else "NO")
seen.clear()
``` | instruction | 0 | 17,042 | 11 | 34,084 |
No | output | 1 | 17,042 | 11 | 34,085 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Professor Vasechkin is studying evolution of worms. Recently he put forward hypotheses that all worms evolve by division. There are n forms of worms. Worms of these forms have lengths a1, a2, ..., an. To prove his theory, professor needs to find 3 different forms that the length of the first form is equal to sum of lengths of the other two forms. Help him to do this.
Input
The first line contains integer n (3 β€ n β€ 100) β amount of worm's forms. The second line contains n space-separated integers ai (1 β€ ai β€ 1000) β lengths of worms of each form.
Output
Output 3 distinct integers i j k (1 β€ i, j, k β€ n) β such indexes of worm's forms that ai = aj + ak. If there is no such triple, output -1. If there are several solutions, output any of them. It possible that aj = ak.
Examples
Input
5
1 2 3 5 7
Output
3 2 1
Input
5
1 8 1 5 1
Output
-1
Submitted Solution:
```
n = int(input())
a = [int(i) for i in input().split()]
b = [[a[i], i] for i in range(n)]
b.sort(reverse=True)
r = False
for i in range(n):
for j in range(i, n):
for k in range(j, n):
if b[i][0] == b[j][0] + b[k][0] and i != j and j != k and i != k:
print(b[i][1]+1, b[j][1]+1, b[k][1]+1)
r = True
break
if r:
break
if r:
break
else:
print(-1)
``` | instruction | 0 | 17,119 | 11 | 34,238 |
Yes | output | 1 | 17,119 | 11 | 34,239 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Professor Vasechkin is studying evolution of worms. Recently he put forward hypotheses that all worms evolve by division. There are n forms of worms. Worms of these forms have lengths a1, a2, ..., an. To prove his theory, professor needs to find 3 different forms that the length of the first form is equal to sum of lengths of the other two forms. Help him to do this.
Input
The first line contains integer n (3 β€ n β€ 100) β amount of worm's forms. The second line contains n space-separated integers ai (1 β€ ai β€ 1000) β lengths of worms of each form.
Output
Output 3 distinct integers i j k (1 β€ i, j, k β€ n) β such indexes of worm's forms that ai = aj + ak. If there is no such triple, output -1. If there are several solutions, output any of them. It possible that aj = ak.
Examples
Input
5
1 2 3 5 7
Output
3 2 1
Input
5
1 8 1 5 1
Output
-1
Submitted Solution:
```
N = int(input())
A = list(map(int, input().split()))
flag = True
for i in range(0, N):
for j in range(0, N):
if i != j:
for k in range(0, N):
if j != k:
if A[i] == A[j] + A[k]:
flag = False
print(str(i+1)+' '+str(j+1)+' '+str(k+1))
break
if not flag: break
if not flag: break
if flag: print(-1)
``` | instruction | 0 | 17,120 | 11 | 34,240 |
Yes | output | 1 | 17,120 | 11 | 34,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Professor Vasechkin is studying evolution of worms. Recently he put forward hypotheses that all worms evolve by division. There are n forms of worms. Worms of these forms have lengths a1, a2, ..., an. To prove his theory, professor needs to find 3 different forms that the length of the first form is equal to sum of lengths of the other two forms. Help him to do this.
Input
The first line contains integer n (3 β€ n β€ 100) β amount of worm's forms. The second line contains n space-separated integers ai (1 β€ ai β€ 1000) β lengths of worms of each form.
Output
Output 3 distinct integers i j k (1 β€ i, j, k β€ n) β such indexes of worm's forms that ai = aj + ak. If there is no such triple, output -1. If there are several solutions, output any of them. It possible that aj = ak.
Examples
Input
5
1 2 3 5 7
Output
3 2 1
Input
5
1 8 1 5 1
Output
-1
Submitted Solution:
```
from collections import Counter
n=int(input())
x=list(map(int,input().split()))
cnt=Counter()
for i in range(n):
cnt[x[i]]=i+1
k=0
for i in range(n):
for j in range(i+1,n):
if cnt[x[i]+x[j]]!=0:
k=[cnt[x[i]+x[j]],j+1,i+1]
if k!=0:
for i in k:
print(i,end=" ")
else:
print(-1)
``` | instruction | 0 | 17,121 | 11 | 34,242 |
Yes | output | 1 | 17,121 | 11 | 34,243 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Professor Vasechkin is studying evolution of worms. Recently he put forward hypotheses that all worms evolve by division. There are n forms of worms. Worms of these forms have lengths a1, a2, ..., an. To prove his theory, professor needs to find 3 different forms that the length of the first form is equal to sum of lengths of the other two forms. Help him to do this.
Input
The first line contains integer n (3 β€ n β€ 100) β amount of worm's forms. The second line contains n space-separated integers ai (1 β€ ai β€ 1000) β lengths of worms of each form.
Output
Output 3 distinct integers i j k (1 β€ i, j, k β€ n) β such indexes of worm's forms that ai = aj + ak. If there is no such triple, output -1. If there are several solutions, output any of them. It possible that aj = ak.
Examples
Input
5
1 2 3 5 7
Output
3 2 1
Input
5
1 8 1 5 1
Output
-1
Submitted Solution:
```
t=int(input())
l=list(map(int,input().split()))
flag=0
flag1=0
for i in range(0,len(l)-1):
if(flag==1):
flag1=1
break
for j in range(i+1,len(l)):
a=l[i]+l[j]
if a in l:
p=l.index(a)
flag=1
break
if(flag==0):
print(-1)
else:
print(p+1,end=" ")
if(i==len(l)-2 and flag1==0):
print(i+1,end=" ")
else:
print(i,end=" ")
print(j+1,end=" ")
``` | instruction | 0 | 17,122 | 11 | 34,244 |
Yes | output | 1 | 17,122 | 11 | 34,245 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Professor Vasechkin is studying evolution of worms. Recently he put forward hypotheses that all worms evolve by division. There are n forms of worms. Worms of these forms have lengths a1, a2, ..., an. To prove his theory, professor needs to find 3 different forms that the length of the first form is equal to sum of lengths of the other two forms. Help him to do this.
Input
The first line contains integer n (3 β€ n β€ 100) β amount of worm's forms. The second line contains n space-separated integers ai (1 β€ ai β€ 1000) β lengths of worms of each form.
Output
Output 3 distinct integers i j k (1 β€ i, j, k β€ n) β such indexes of worm's forms that ai = aj + ak. If there is no such triple, output -1. If there are several solutions, output any of them. It possible that aj = ak.
Examples
Input
5
1 2 3 5 7
Output
3 2 1
Input
5
1 8 1 5 1
Output
-1
Submitted Solution:
```
n=int(input())
a=list(map(int,input().split()))
for i in range(1,n):
for j in range(1,n):
if a[i]+a[j] in a:
print(a.index(a[i]+a[j]),i,j)
exit()
print(-1)
``` | instruction | 0 | 17,123 | 11 | 34,246 |
No | output | 1 | 17,123 | 11 | 34,247 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Professor Vasechkin is studying evolution of worms. Recently he put forward hypotheses that all worms evolve by division. There are n forms of worms. Worms of these forms have lengths a1, a2, ..., an. To prove his theory, professor needs to find 3 different forms that the length of the first form is equal to sum of lengths of the other two forms. Help him to do this.
Input
The first line contains integer n (3 β€ n β€ 100) β amount of worm's forms. The second line contains n space-separated integers ai (1 β€ ai β€ 1000) β lengths of worms of each form.
Output
Output 3 distinct integers i j k (1 β€ i, j, k β€ n) β such indexes of worm's forms that ai = aj + ak. If there is no such triple, output -1. If there are several solutions, output any of them. It possible that aj = ak.
Examples
Input
5
1 2 3 5 7
Output
3 2 1
Input
5
1 8 1 5 1
Output
-1
Submitted Solution:
```
import math
for _ in range(1):
n=int(input())
a=list(map(int,input().split()))
sa=sorted(a)
sa.sort(reverse=True)
t=True
for i in range(n-2):
for j in range(i+1,n-1):
for k in range(j+1,n):
if sa[i]==sa[j]+sa[k]:
an=sa[i]
an2=sa[j]
an3=sa[k]
t=False
break
if t==False:
print(a.index(an)+1,a.index(an2)+1,a.index(an3)+1)
else:
print(-1)
``` | instruction | 0 | 17,124 | 11 | 34,248 |
No | output | 1 | 17,124 | 11 | 34,249 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Professor Vasechkin is studying evolution of worms. Recently he put forward hypotheses that all worms evolve by division. There are n forms of worms. Worms of these forms have lengths a1, a2, ..., an. To prove his theory, professor needs to find 3 different forms that the length of the first form is equal to sum of lengths of the other two forms. Help him to do this.
Input
The first line contains integer n (3 β€ n β€ 100) β amount of worm's forms. The second line contains n space-separated integers ai (1 β€ ai β€ 1000) β lengths of worms of each form.
Output
Output 3 distinct integers i j k (1 β€ i, j, k β€ n) β such indexes of worm's forms that ai = aj + ak. If there is no such triple, output -1. If there are several solutions, output any of them. It possible that aj = ak.
Examples
Input
5
1 2 3 5 7
Output
3 2 1
Input
5
1 8 1 5 1
Output
-1
Submitted Solution:
```
# a = 5
# b = [1, 2, 3, 7, 5]
a = int(input())
b = list(map(int, input().split()))
c = b.copy()
ans = 0
ans1 = 0
ans2 = 0
flag = False
for i in range(len(b)):
for j in range(len(b)):
for k in range(len(b)):
#print(b[i], b[j], b[k])
if b[i] == b[j] + b[k]:
flag = True
ans = i + 1
ans1 = j + 1
ans2 = k + 1
break
if flag:
break
if flag:
break
if flag:
print(ans, ans1, ans2)
else:
print(-1)
``` | instruction | 0 | 17,125 | 11 | 34,250 |
No | output | 1 | 17,125 | 11 | 34,251 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Professor Vasechkin is studying evolution of worms. Recently he put forward hypotheses that all worms evolve by division. There are n forms of worms. Worms of these forms have lengths a1, a2, ..., an. To prove his theory, professor needs to find 3 different forms that the length of the first form is equal to sum of lengths of the other two forms. Help him to do this.
Input
The first line contains integer n (3 β€ n β€ 100) β amount of worm's forms. The second line contains n space-separated integers ai (1 β€ ai β€ 1000) β lengths of worms of each form.
Output
Output 3 distinct integers i j k (1 β€ i, j, k β€ n) β such indexes of worm's forms that ai = aj + ak. If there is no such triple, output -1. If there are several solutions, output any of them. It possible that aj = ak.
Examples
Input
5
1 2 3 5 7
Output
3 2 1
Input
5
1 8 1 5 1
Output
-1
Submitted Solution:
```
n = int(input())
l = list(map(int,input().split()))
l.sort(reverse=True)
f = 0
for i in range(n):
s, e = i+1, n-1
while s<e:
if l[s]+l[e]==l[i]:
f = 1
print(l[i], l[s], l[e])
break
elif l[s]+l[e]>l[i]:
e-=1
else:
s+=1
if f==0:
print(-1)
``` | instruction | 0 | 17,126 | 11 | 34,252 |
No | output | 1 | 17,126 | 11 | 34,253 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have probably registered on Internet sites many times. And each time you should enter your invented password. Usually the registration form automatically checks the password's crypt resistance. If the user's password isn't complex enough, a message is displayed. Today your task is to implement such an automatic check.
Web-developers of the company Q assume that a password is complex enough, if it meets all of the following conditions:
* the password length is at least 5 characters;
* the password contains at least one large English letter;
* the password contains at least one small English letter;
* the password contains at least one digit.
You are given a password. Please implement the automatic check of its complexity for company Q.
Input
The first line contains a non-empty sequence of characters (at most 100 characters). Each character is either a large English letter, or a small English letter, or a digit, or one of characters: "!", "?", ".", ",", "_".
Output
If the password is complex enough, print message "Correct" (without the quotes), otherwise print message "Too weak" (without the quotes).
Examples
Input
abacaba
Output
Too weak
Input
X12345
Output
Too weak
Input
CONTEST_is_STARTED!!11
Output
Correct
Submitted Solution:
```
def m(v):
"""multiple vector"""
for c in v:
if not c:
return 0
return 1
def ic(s):
if len(s)<5:
return 0
"""is correct"""
vc=3*[0]
for c in s:
if not vc[0] and c.islower():
vc[0]=1
elif not vc[1] and c.isupper():
vc[1]=1
elif not vc[2] and c.isnumeric():
vc[2]=1
if m(vc):
return 1
return 0
s='Correct' if (ic(input())) else 'Too weak'
print(s)
``` | instruction | 0 | 17,166 | 11 | 34,332 |
Yes | output | 1 | 17,166 | 11 | 34,333 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pay attention: this problem is interactive.
Penguin Xoriy came up with a new game recently. He has n icicles numbered from 1 to n. Each icicle has a temperature β an integer from 1 to 109. Exactly two of these icicles are special: their temperature is y, while a temperature of all the others is x β y. You have to find those special icicles. You can choose a non-empty subset of icicles and ask the penguin what is the bitwise exclusive OR (XOR) of the temperatures of the icicles in this subset. Note that you can't ask more than 19 questions.
You are to find the special icicles.
Input
The first line contains three integers n, x, y (2 β€ n β€ 1000, 1 β€ x, y β€ 109, x β y) β the number of icicles, the temperature of non-special icicles and the temperature of the special icicles.
Output
To give your answer to the penguin you have to print character "!" (without quotes), then print two integers p1, p2 (p1 < p2) β the indexes of the special icicles in ascending order. Note that "!" and p1 should be separated by a space; the indexes should be separated by a space too. After you gave the answer your program should terminate immediately.
Interaction
To ask a question print character "?" (without quotes), an integer c (1 β€ c β€ n), and c distinct integers p1, p2, ..., pc (1 β€ pi β€ n) β the indexes of icicles that you want to know about. Note that "?" and c should be separated by a space; the indexes should be separated by a space too.
After you asked the question, read a single integer β the answer.
Note that you can't ask more than 19 questions. If you ask more than 19 questions or at least one incorrect question, your solution will get "Wrong answer".
If at some moment your program reads - 1 as an answer, it should immediately exit (for example, by calling exit(0)). You will get "Wrong answer" in this case, it means that you asked more than 19 questions, or asked an invalid question. If you ignore this, you can get other verdicts since your program will continue to read from a closed stream.
Your solution will get "Idleness Limit Exceeded", if you don't print anything or forget to flush the output, including for the final answer .
To flush you can use (just after printing):
* fflush(stdout) in C++;
* System.out.flush() in Java;
* stdout.flush() in Python;
* flush(output) in Pascal;
* For other languages see the documentation.
Hacking
For hacking use the following format:
n x y p1 p2
Here 1 β€ p1 < p2 β€ n are the indexes of the special icicles.
Contestant programs will not be able to see this input.
Example
Input
4 2 1
2
1
1<span class="tex-font-style-it"></span>
Output
? 3 1 2 3
? 1 1
? 1 3
! 1 3
Note
The answer for the first question is <image>.
The answer for the second and the third questions is 1, therefore, special icicles are indexes 1 and 3.
You can read more about bitwise XOR operation here: <https://en.wikipedia.org/wiki/Bitwise_operation#XOR>.
Submitted Solution:
```
import sys
n, x, y = (int(x) for x in input().split())
def ask(*bits):
arr = [x for x in range(1, n + 1) if all(x & i == i for i in bits)]
if len(arr) == 0:
return 0
print('?', len(arr), *arr)
sys.stdout.flush()
return int(input())
diffs = []
i = 1
while i <= n:
x = ask(i)
if x & y == y:
diffs.append(i)
i <<= 1
i = diffs[-1]
j = 1
ans2 = i
while j <= n:
if j != i:
x = ask(i, j)
if x & y == y:
ans2 |= j
j <<= 1
ans1 = sum(1 << i for i in diffs) ^ ans2
print('!', ans1, ans2)
``` | instruction | 0 | 17,348 | 11 | 34,696 |
No | output | 1 | 17,348 | 11 | 34,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pay attention: this problem is interactive.
Penguin Xoriy came up with a new game recently. He has n icicles numbered from 1 to n. Each icicle has a temperature β an integer from 1 to 109. Exactly two of these icicles are special: their temperature is y, while a temperature of all the others is x β y. You have to find those special icicles. You can choose a non-empty subset of icicles and ask the penguin what is the bitwise exclusive OR (XOR) of the temperatures of the icicles in this subset. Note that you can't ask more than 19 questions.
You are to find the special icicles.
Input
The first line contains three integers n, x, y (2 β€ n β€ 1000, 1 β€ x, y β€ 109, x β y) β the number of icicles, the temperature of non-special icicles and the temperature of the special icicles.
Output
To give your answer to the penguin you have to print character "!" (without quotes), then print two integers p1, p2 (p1 < p2) β the indexes of the special icicles in ascending order. Note that "!" and p1 should be separated by a space; the indexes should be separated by a space too. After you gave the answer your program should terminate immediately.
Interaction
To ask a question print character "?" (without quotes), an integer c (1 β€ c β€ n), and c distinct integers p1, p2, ..., pc (1 β€ pi β€ n) β the indexes of icicles that you want to know about. Note that "?" and c should be separated by a space; the indexes should be separated by a space too.
After you asked the question, read a single integer β the answer.
Note that you can't ask more than 19 questions. If you ask more than 19 questions or at least one incorrect question, your solution will get "Wrong answer".
If at some moment your program reads - 1 as an answer, it should immediately exit (for example, by calling exit(0)). You will get "Wrong answer" in this case, it means that you asked more than 19 questions, or asked an invalid question. If you ignore this, you can get other verdicts since your program will continue to read from a closed stream.
Your solution will get "Idleness Limit Exceeded", if you don't print anything or forget to flush the output, including for the final answer .
To flush you can use (just after printing):
* fflush(stdout) in C++;
* System.out.flush() in Java;
* stdout.flush() in Python;
* flush(output) in Pascal;
* For other languages see the documentation.
Hacking
For hacking use the following format:
n x y p1 p2
Here 1 β€ p1 < p2 β€ n are the indexes of the special icicles.
Contestant programs will not be able to see this input.
Example
Input
4 2 1
2
1
1<span class="tex-font-style-it"></span>
Output
? 3 1 2 3
? 1 1
? 1 3
! 1 3
Note
The answer for the first question is <image>.
The answer for the second and the third questions is 1, therefore, special icicles are indexes 1 and 3.
You can read more about bitwise XOR operation here: <https://en.wikipedia.org/wiki/Bitwise_operation#XOR>.
Submitted Solution:
```
import sys
def req(x, y):
print("?", y-x+1, *range(x,y+1))
sys.stdout.flush()
return int(input())
def res(x, y):
print("!", min(x, y), max(x, y))
sys.stdout.flush()
def locate(x, y, z):
if y > x:
m = (x + y) // 2
r = req(x, m)
if r == z:
return locate(x, m, z)
else:
return locate(m+1, y, z)
else:
return x
n, x, y = map(int, input().split())
queue = [(1,n)]
while queue:
a, b = queue.pop()
if b > a:
m = (a + b) // 2
r = req(a, m)
if r == y:
u = locate(a, m, y)
v = locate(m+1, b, y)
res(u, v)
break
else:
queue.append((a, m))
queue.append((m+1, b))
``` | instruction | 0 | 17,349 | 11 | 34,698 |
No | output | 1 | 17,349 | 11 | 34,699 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pay attention: this problem is interactive.
Penguin Xoriy came up with a new game recently. He has n icicles numbered from 1 to n. Each icicle has a temperature β an integer from 1 to 109. Exactly two of these icicles are special: their temperature is y, while a temperature of all the others is x β y. You have to find those special icicles. You can choose a non-empty subset of icicles and ask the penguin what is the bitwise exclusive OR (XOR) of the temperatures of the icicles in this subset. Note that you can't ask more than 19 questions.
You are to find the special icicles.
Input
The first line contains three integers n, x, y (2 β€ n β€ 1000, 1 β€ x, y β€ 109, x β y) β the number of icicles, the temperature of non-special icicles and the temperature of the special icicles.
Output
To give your answer to the penguin you have to print character "!" (without quotes), then print two integers p1, p2 (p1 < p2) β the indexes of the special icicles in ascending order. Note that "!" and p1 should be separated by a space; the indexes should be separated by a space too. After you gave the answer your program should terminate immediately.
Interaction
To ask a question print character "?" (without quotes), an integer c (1 β€ c β€ n), and c distinct integers p1, p2, ..., pc (1 β€ pi β€ n) β the indexes of icicles that you want to know about. Note that "?" and c should be separated by a space; the indexes should be separated by a space too.
After you asked the question, read a single integer β the answer.
Note that you can't ask more than 19 questions. If you ask more than 19 questions or at least one incorrect question, your solution will get "Wrong answer".
If at some moment your program reads - 1 as an answer, it should immediately exit (for example, by calling exit(0)). You will get "Wrong answer" in this case, it means that you asked more than 19 questions, or asked an invalid question. If you ignore this, you can get other verdicts since your program will continue to read from a closed stream.
Your solution will get "Idleness Limit Exceeded", if you don't print anything or forget to flush the output, including for the final answer .
To flush you can use (just after printing):
* fflush(stdout) in C++;
* System.out.flush() in Java;
* stdout.flush() in Python;
* flush(output) in Pascal;
* For other languages see the documentation.
Hacking
For hacking use the following format:
n x y p1 p2
Here 1 β€ p1 < p2 β€ n are the indexes of the special icicles.
Contestant programs will not be able to see this input.
Example
Input
4 2 1
2
1
1<span class="tex-font-style-it"></span>
Output
? 3 1 2 3
? 1 1
? 1 3
! 1 3
Note
The answer for the first question is <image>.
The answer for the second and the third questions is 1, therefore, special icicles are indexes 1 and 3.
You can read more about bitwise XOR operation here: <https://en.wikipedia.org/wiki/Bitwise_operation#XOR>.
Submitted Solution:
```
import sys
n, x, y = (int(x) for x in input().split())
def ask(*bits):
arr = [x for x in range(1, n + 1) if all(x & i == i for i in bits)]
print('?', len(arr), *arr)
sys.stdout.flush()
diffs = []
i = 1
while i <= n:
ask(i)
x = int(input())
if x & y == y:
diffs.append(i)
i <<= 1
i = diffs[-1]
j = 1
ans2 = i
while j <= n:
if j != i:
ask(i, j)
x = int(input())
if x & y == y:
ans2 |= j
j <<= 1
ans1 = sum(1 << i for i in diffs) ^ ans2
print('!', ans1, ans2)
``` | instruction | 0 | 17,350 | 11 | 34,700 |
No | output | 1 | 17,350 | 11 | 34,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pay attention: this problem is interactive.
Penguin Xoriy came up with a new game recently. He has n icicles numbered from 1 to n. Each icicle has a temperature β an integer from 1 to 109. Exactly two of these icicles are special: their temperature is y, while a temperature of all the others is x β y. You have to find those special icicles. You can choose a non-empty subset of icicles and ask the penguin what is the bitwise exclusive OR (XOR) of the temperatures of the icicles in this subset. Note that you can't ask more than 19 questions.
You are to find the special icicles.
Input
The first line contains three integers n, x, y (2 β€ n β€ 1000, 1 β€ x, y β€ 109, x β y) β the number of icicles, the temperature of non-special icicles and the temperature of the special icicles.
Output
To give your answer to the penguin you have to print character "!" (without quotes), then print two integers p1, p2 (p1 < p2) β the indexes of the special icicles in ascending order. Note that "!" and p1 should be separated by a space; the indexes should be separated by a space too. After you gave the answer your program should terminate immediately.
Interaction
To ask a question print character "?" (without quotes), an integer c (1 β€ c β€ n), and c distinct integers p1, p2, ..., pc (1 β€ pi β€ n) β the indexes of icicles that you want to know about. Note that "?" and c should be separated by a space; the indexes should be separated by a space too.
After you asked the question, read a single integer β the answer.
Note that you can't ask more than 19 questions. If you ask more than 19 questions or at least one incorrect question, your solution will get "Wrong answer".
If at some moment your program reads - 1 as an answer, it should immediately exit (for example, by calling exit(0)). You will get "Wrong answer" in this case, it means that you asked more than 19 questions, or asked an invalid question. If you ignore this, you can get other verdicts since your program will continue to read from a closed stream.
Your solution will get "Idleness Limit Exceeded", if you don't print anything or forget to flush the output, including for the final answer .
To flush you can use (just after printing):
* fflush(stdout) in C++;
* System.out.flush() in Java;
* stdout.flush() in Python;
* flush(output) in Pascal;
* For other languages see the documentation.
Hacking
For hacking use the following format:
n x y p1 p2
Here 1 β€ p1 < p2 β€ n are the indexes of the special icicles.
Contestant programs will not be able to see this input.
Example
Input
4 2 1
2
1
1<span class="tex-font-style-it"></span>
Output
? 3 1 2 3
? 1 1
? 1 3
! 1 3
Note
The answer for the first question is <image>.
The answer for the second and the third questions is 1, therefore, special icicles are indexes 1 and 3.
You can read more about bitwise XOR operation here: <https://en.wikipedia.org/wiki/Bitwise_operation#XOR>.
Submitted Solution:
```
import sys
import math
import random
import time
import decimal
line = lambda: list(int(x) for x in input().split())
MOD = int(1e9 + 7)
n = 0
x = 0
y = 0
def ask(ar):
if len(ar) == 0:
return 0
print("? ", end = '')
print(len(ar), end = '')
for i in range(len(ar)):
print(" %d" % (ar[i] + 1), end = '')
print("")
sys.stdout.flush()
return int(input())
def get(ar):
lo = 0
hi = len(ar) - 1
while lo < hi:
mi = lo + hi >> 1
tmp = 0
if mi % 2 == 1:
tmp = x
if ask(ar[0 : mi + 1]) == tmp:
lo = mi + 1
else:
hi = mi
return ar[lo + hi >> 1]
def solve():
global n, x, y
n, x, y = line()
res = [0 for i in range(0, 10)]
tmp = [0 for i in range(0, 10)]
a = -1
b = 0
for k in range(0, 10):
ar = []
for i in range(n):
if ((i >> k) & 1) == 1:
ar.append(i)
if (len(ar) & 1) == 1:
tmp[k] = x
res[k] = ask(ar)
if a == -1 and res[k] != tmp[k]:
a = get(ar)
for k in reversed(range(0, 10)):
b <<= 1
if res[k] == tmp[k]:
b |= (a >> k) & 1
else:
b |= ((a >> k) & 1) ^ 1
if a > b:
a, b = b, a
print("! %d %d" % (a + 1, b + 1))
sys.stdout.flush()
##st = time.time()
solve()
##print("Time elapsed: %.3fs" % (time.time() - st))
exit(0)
``` | instruction | 0 | 17,351 | 11 | 34,702 |
No | output | 1 | 17,351 | 11 | 34,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Masha and Grisha like studying sets of positive integers.
One day Grisha has written a set A containing n different integers ai on a blackboard. Now he asks Masha to create a set B containing n different integers bj such that all n2 integers that can be obtained by summing up ai and bj for all possible pairs of i and j are different.
Both Masha and Grisha don't like big numbers, so all numbers in A are from 1 to 106, and all numbers in B must also be in the same range.
Help Masha to create the set B that satisfies Grisha's requirement.
Input
Input data contains multiple test cases. The first line contains an integer t β the number of test cases (1 β€ t β€ 100).
Each test case is described in the following way: the first line of the description contains one integer n β the number of elements in A (1 β€ n β€ 100).
The second line contains n integers ai β the elements of A (1 β€ ai β€ 106).
Output
For each test first print the answer:
* NO, if Masha's task is impossible to solve, there is no way to create the required set B.
* YES, if there is the way to create the required set. In this case the second line must contain n different positive integers bj β elements of B (1 β€ bj β€ 106). If there are several possible sets, output any of them.
Example
Input
3
3
1 10 100
1
1
2
2 4
Output
YES
1 2 3
YES
1
YES
1 2
Submitted Solution:
```
'''
from random import randint
visited = [-1] * (2 * 10 ** 6 + 1)
t = int(input())
for i in range(t):
n, A = int(input()), list(map(int, input().split()))
A.sort()
res = [1] * n
v = 1
cnt = 0
while cnt < n:
#v = randint(1, 10**6)
if all(visited[a + v] != i for a in A):
for a in A:
visited[a + v] = i
res[cnt] = v
cnt += 1
v += 1
print("YES\n" + ' '.join(map(str,res)))
'''
t = int(input())
def check(arr,v,dic):
for i in arr:
#if i+v > 2e6:
# break
if dic[i+v] == 1:
return True
return False
dic = [0]*2000005
for _ in range(t):
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
brr = [1]*n
cnt = 0
i = 1
flag = True
tmp = {}
while cnt < n:
while check(arr,i,dic):
i += 1
brr[cnt] = i
for v in arr:
#if i+v>2e6:
# break
dic[i+v] = 1
tmp[i+v] = 1
cnt += 1
'''
if all(dic[a + i] == 0 for a in arr):
for a in arr:
dic[a + i] = 1
tmp[a + i] = 1
brr[cnt] = i
cnt += 1
'''
i += 1
if flag:
print("YES")
print(" ".join(map(str,brr)))
else:
print("NO")
for k in tmp.keys():
dic[k] = 0
``` | instruction | 0 | 17,360 | 11 | 34,720 |
Yes | output | 1 | 17,360 | 11 | 34,721 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Masha and Grisha like studying sets of positive integers.
One day Grisha has written a set A containing n different integers ai on a blackboard. Now he asks Masha to create a set B containing n different integers bj such that all n2 integers that can be obtained by summing up ai and bj for all possible pairs of i and j are different.
Both Masha and Grisha don't like big numbers, so all numbers in A are from 1 to 106, and all numbers in B must also be in the same range.
Help Masha to create the set B that satisfies Grisha's requirement.
Input
Input data contains multiple test cases. The first line contains an integer t β the number of test cases (1 β€ t β€ 100).
Each test case is described in the following way: the first line of the description contains one integer n β the number of elements in A (1 β€ n β€ 100).
The second line contains n integers ai β the elements of A (1 β€ ai β€ 106).
Output
For each test first print the answer:
* NO, if Masha's task is impossible to solve, there is no way to create the required set B.
* YES, if there is the way to create the required set. In this case the second line must contain n different positive integers bj β elements of B (1 β€ bj β€ 106). If there are several possible sets, output any of them.
Example
Input
3
3
1 10 100
1
1
2
2 4
Output
YES
1 2 3
YES
1
YES
1 2
Submitted Solution:
```
from random import randint
def solve():
n, a = int(input()), list(map(int, input().split()))
bb, ab = set(), set()
while True:
b = randint(1, 1000000)
for i in a:
if i + b in ab:
break
else:
bb.add(b)
if len(bb) == n:
break
for i in a:
ab.add(b + i)
print('YES')
print(' '.join(map(str, bb)))
T = int(input())
for i in range(T):
solve()
``` | instruction | 0 | 17,361 | 11 | 34,722 |
Yes | output | 1 | 17,361 | 11 | 34,723 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Masha and Grisha like studying sets of positive integers.
One day Grisha has written a set A containing n different integers ai on a blackboard. Now he asks Masha to create a set B containing n different integers bj such that all n2 integers that can be obtained by summing up ai and bj for all possible pairs of i and j are different.
Both Masha and Grisha don't like big numbers, so all numbers in A are from 1 to 106, and all numbers in B must also be in the same range.
Help Masha to create the set B that satisfies Grisha's requirement.
Input
Input data contains multiple test cases. The first line contains an integer t β the number of test cases (1 β€ t β€ 100).
Each test case is described in the following way: the first line of the description contains one integer n β the number of elements in A (1 β€ n β€ 100).
The second line contains n integers ai β the elements of A (1 β€ ai β€ 106).
Output
For each test first print the answer:
* NO, if Masha's task is impossible to solve, there is no way to create the required set B.
* YES, if there is the way to create the required set. In this case the second line must contain n different positive integers bj β elements of B (1 β€ bj β€ 106). If there are several possible sets, output any of them.
Example
Input
3
3
1 10 100
1
1
2
2 4
Output
YES
1 2 3
YES
1
YES
1 2
Submitted Solution:
```
'''
from random import randint
visited = [-1] * (2 * 10 ** 6 + 1)
t = int(input())
for i in range(t):
n, A = int(input()), list(map(int, input().split()))
A.sort()
res = [1] * n
v = 1
cnt = 0
while cnt < n:
#v = randint(1, 10**6)
if all(visited[a + v] != i for a in A):
for a in A:
visited[a + v] = i
res[cnt] = v
cnt += 1
v += 1
print("YES\n" + ' '.join(map(str,res)))
'''
t = int(input())
def check(arr,v,dic):
for i in arr:
if dic[i+v] == 1:
return True
return False
def check2(arr,v,dic):
ok = False
for i in arr:
if dic[i+v] == 1:
ok = True
break
return ok
dic = [0]*2000005
for _ in range(t):
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
brr = [1]*n
cnt = 0
i = 1
flag = True
tmp = {}
while cnt < n:
'''
while check(arr,i,dic):
i += 1
brr[cnt] = i
for v in arr:
#if i+v>2e6:
# break
dic[i+v] = 1
tmp[i+v] = 1
cnt += 1
'''
#while any(dic[a + i] != 0 for a in arr):
# i += 1
while check2(arr, i, dic):
i += 1
for a in arr:
dic[a + i] = 1
tmp[a + i] = 1
brr[cnt] = i
cnt += 1
if flag:
print("YES")
print(" ".join(map(str,brr)))
else:
print("NO")
for k in tmp.keys():
dic[k] = 0
``` | instruction | 0 | 17,362 | 11 | 34,724 |
Yes | output | 1 | 17,362 | 11 | 34,725 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Masha and Grisha like studying sets of positive integers.
One day Grisha has written a set A containing n different integers ai on a blackboard. Now he asks Masha to create a set B containing n different integers bj such that all n2 integers that can be obtained by summing up ai and bj for all possible pairs of i and j are different.
Both Masha and Grisha don't like big numbers, so all numbers in A are from 1 to 106, and all numbers in B must also be in the same range.
Help Masha to create the set B that satisfies Grisha's requirement.
Input
Input data contains multiple test cases. The first line contains an integer t β the number of test cases (1 β€ t β€ 100).
Each test case is described in the following way: the first line of the description contains one integer n β the number of elements in A (1 β€ n β€ 100).
The second line contains n integers ai β the elements of A (1 β€ ai β€ 106).
Output
For each test first print the answer:
* NO, if Masha's task is impossible to solve, there is no way to create the required set B.
* YES, if there is the way to create the required set. In this case the second line must contain n different positive integers bj β elements of B (1 β€ bj β€ 106). If there are several possible sets, output any of them.
Example
Input
3
3
1 10 100
1
1
2
2 4
Output
YES
1 2 3
YES
1
YES
1 2
Submitted Solution:
```
T=int(input())
while T:
n,a,bd=int(input()),sorted(list(map(int,input().split()))),[0]*1000001
for i in range(n):
for j in range(i+1,n):
bd[a[j]-a[i]]=1
i=1
while(any(bd[i*j]for j in range(1,n))):i+=1
print('YES\n'+' '.join(str(i*j+1)for j in range(n)))
T-=1
# Made By Mostafa_Khaled
``` | instruction | 0 | 17,363 | 11 | 34,726 |
Yes | output | 1 | 17,363 | 11 | 34,727 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Masha and Grisha like studying sets of positive integers.
One day Grisha has written a set A containing n different integers ai on a blackboard. Now he asks Masha to create a set B containing n different integers bj such that all n2 integers that can be obtained by summing up ai and bj for all possible pairs of i and j are different.
Both Masha and Grisha don't like big numbers, so all numbers in A are from 1 to 106, and all numbers in B must also be in the same range.
Help Masha to create the set B that satisfies Grisha's requirement.
Input
Input data contains multiple test cases. The first line contains an integer t β the number of test cases (1 β€ t β€ 100).
Each test case is described in the following way: the first line of the description contains one integer n β the number of elements in A (1 β€ n β€ 100).
The second line contains n integers ai β the elements of A (1 β€ ai β€ 106).
Output
For each test first print the answer:
* NO, if Masha's task is impossible to solve, there is no way to create the required set B.
* YES, if there is the way to create the required set. In this case the second line must contain n different positive integers bj β elements of B (1 β€ bj β€ 106). If there are several possible sets, output any of them.
Example
Input
3
3
1 10 100
1
1
2
2 4
Output
YES
1 2 3
YES
1
YES
1 2
Submitted Solution:
```
t = int(input())
for i in range(t):
n = int(input())
a = [int(s) for s in input().split()]
ma = 0
mi = 2**60
for j in range(n):
for k in range(n):
if j != k:
if a[j] > a[k]:
d = a[j] - a[k]
if d < mi:
mi = d
if d > ma:
ma = d
else:
d = a[k] - a[j]
if d > ma:
ma = d
if d < mi:
mi = d
m = ma+1
if m*(n-1)+1>10**6 and mi<2:
print("NO")
break
else:
print("YES")
if mi>1:
m = mi-1
for j in range(n-1):
print((m)*j+1,end=" ")
print((m)*(n-1)+1)
``` | instruction | 0 | 17,364 | 11 | 34,728 |
No | output | 1 | 17,364 | 11 | 34,729 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Masha and Grisha like studying sets of positive integers.
One day Grisha has written a set A containing n different integers ai on a blackboard. Now he asks Masha to create a set B containing n different integers bj such that all n2 integers that can be obtained by summing up ai and bj for all possible pairs of i and j are different.
Both Masha and Grisha don't like big numbers, so all numbers in A are from 1 to 106, and all numbers in B must also be in the same range.
Help Masha to create the set B that satisfies Grisha's requirement.
Input
Input data contains multiple test cases. The first line contains an integer t β the number of test cases (1 β€ t β€ 100).
Each test case is described in the following way: the first line of the description contains one integer n β the number of elements in A (1 β€ n β€ 100).
The second line contains n integers ai β the elements of A (1 β€ ai β€ 106).
Output
For each test first print the answer:
* NO, if Masha's task is impossible to solve, there is no way to create the required set B.
* YES, if there is the way to create the required set. In this case the second line must contain n different positive integers bj β elements of B (1 β€ bj β€ 106). If there are several possible sets, output any of them.
Example
Input
3
3
1 10 100
1
1
2
2 4
Output
YES
1 2 3
YES
1
YES
1 2
Submitted Solution:
```
for _ in range(int(input())):
n=int(input())
a=list(map(int, input().split()))
a.sort()
b=[]
k=10**6
for i in range(n):
b.append(k-i)
if b[n-1]>a[n-1]:
print('YES')
for i in b:
print(i,end=' ')
print('')
else:
print('NO')
``` | instruction | 0 | 17,365 | 11 | 34,730 |
No | output | 1 | 17,365 | 11 | 34,731 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Masha and Grisha like studying sets of positive integers.
One day Grisha has written a set A containing n different integers ai on a blackboard. Now he asks Masha to create a set B containing n different integers bj such that all n2 integers that can be obtained by summing up ai and bj for all possible pairs of i and j are different.
Both Masha and Grisha don't like big numbers, so all numbers in A are from 1 to 106, and all numbers in B must also be in the same range.
Help Masha to create the set B that satisfies Grisha's requirement.
Input
Input data contains multiple test cases. The first line contains an integer t β the number of test cases (1 β€ t β€ 100).
Each test case is described in the following way: the first line of the description contains one integer n β the number of elements in A (1 β€ n β€ 100).
The second line contains n integers ai β the elements of A (1 β€ ai β€ 106).
Output
For each test first print the answer:
* NO, if Masha's task is impossible to solve, there is no way to create the required set B.
* YES, if there is the way to create the required set. In this case the second line must contain n different positive integers bj β elements of B (1 β€ bj β€ 106). If there are several possible sets, output any of them.
Example
Input
3
3
1 10 100
1
1
2
2 4
Output
YES
1 2 3
YES
1
YES
1 2
Submitted Solution:
```
for _ in range(int(input())):
n = int(input())
b = list(map(int, input(). split()))
print('YES')
m = max(b) - min(b)
k = [i for i in range(max(b), n * (m + 1) + max(b), m + 1)]
print(*k)
``` | instruction | 0 | 17,366 | 11 | 34,732 |
No | output | 1 | 17,366 | 11 | 34,733 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Masha and Grisha like studying sets of positive integers.
One day Grisha has written a set A containing n different integers ai on a blackboard. Now he asks Masha to create a set B containing n different integers bj such that all n2 integers that can be obtained by summing up ai and bj for all possible pairs of i and j are different.
Both Masha and Grisha don't like big numbers, so all numbers in A are from 1 to 106, and all numbers in B must also be in the same range.
Help Masha to create the set B that satisfies Grisha's requirement.
Input
Input data contains multiple test cases. The first line contains an integer t β the number of test cases (1 β€ t β€ 100).
Each test case is described in the following way: the first line of the description contains one integer n β the number of elements in A (1 β€ n β€ 100).
The second line contains n integers ai β the elements of A (1 β€ ai β€ 106).
Output
For each test first print the answer:
* NO, if Masha's task is impossible to solve, there is no way to create the required set B.
* YES, if there is the way to create the required set. In this case the second line must contain n different positive integers bj β elements of B (1 β€ bj β€ 106). If there are several possible sets, output any of them.
Example
Input
3
3
1 10 100
1
1
2
2 4
Output
YES
1 2 3
YES
1
YES
1 2
Submitted Solution:
```
for _ in range(int(input())):
n = int(input())
A = list(map(int,input().split()))
for i in range(1,n+1):
cnt = [0 for i in range(101)]
f=1
for j in range(n):
if(cnt[A[j]%i]>=1):
f=0
break
if(f==1):
print("YES")
print(1,end=" ")
for p in range(1,n):
print(p*i+1,end=" ")
print()
break
``` | instruction | 0 | 17,367 | 11 | 34,734 |
No | output | 1 | 17,367 | 11 | 34,735 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Constraints
* All values in input are integers.
* 1\leq N, M\leq 12
* 1\leq X\leq 10^5
* 1\leq C_i \leq 10^5
* 0\leq A_{i, j} \leq 10^5
Input
Input is given from Standard Input in the following format:
N M X
C_1 A_{1,1} A_{1,2} \cdots A_{1,M}
C_2 A_{2,1} A_{2,2} \cdots A_{2,M}
\vdots
C_N A_{N,1} A_{N,2} \cdots A_{N,M}
Output
If the objective is not achievable, print `-1`; otherwise, print the minimum amount of money needed to achieve it.
Examples
Input
3 3 10
60 2 2 4
70 8 7 9
50 2 3 9
Output
120
Input
3 3 10
100 3 1 4
100 1 5 9
100 2 6 5
Output
-1
Input
8 5 22
100 3 7 5 3 1
164 4 5 2 7 8
334 7 2 7 2 9
234 4 7 2 8 2
541 5 4 3 3 6
235 4 8 6 9 7
394 3 6 1 6 2
872 8 4 3 7 2
Output
1067
Submitted Solution:
```
import itertools
import numpy as np
N,M,X = map(int, input().split())
lista = [list(map(int,input().split())) for i in range(N)]
lista = np.array(lista)
judge = [X]*M
cost = 1200001
data = [a for a in range(1,N+1)] # [1,2,3,...,N]
for i in range(1,N+1):
j = list(itertools.combinations(data, i))
for k in j:
result = np.array([0]*(M+1))
for l in k:
result = result + lista[l-1]
if all(result[1:]>=judge):
if reslut[0]<cost:
cost = result[0]
m = k
c = 0
try:
for i in m:
c +=lista[i-1][0]
print(c)
except:
print(-1)
``` | instruction | 0 | 17,469 | 11 | 34,938 |
No | output | 1 | 17,469 | 11 | 34,939 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.
You can take and complete at most one of these jobs in a day.
However, you cannot retake a job that you have already done.
Find the maximum total reward that you can earn no later than M days from today.
You can already start working today.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq M \leq 10^5
* 1 \leq A_i \leq 10^5
* 1 \leq B_i \leq 10^4
Input
Input is given from Standard Input in the following format:
N M
A_1 B_1
A_2 B_2
\vdots
A_N B_N
Output
Print the maximum total reward that you can earn no later than M days from today.
Examples
Input
3 4
4 3
4 1
2 2
Output
5
Input
5 3
1 2
1 3
1 4
2 1
2 3
Output
10
Input
1 1
2 1
Output
0
Submitted Solution:
```
from heapq import*
(n,m),*t=[map(int,s.split())for s in open(0)]
q=[0]*7**6
v=[[]for _ in q]
z=0
for a,b in t:v[a-1]+=[b]
for i in v[:m]:
for j in i:heappush(q,-j)
z-=heappop(q)
print(z)
``` | instruction | 0 | 17,496 | 11 | 34,992 |
Yes | output | 1 | 17,496 | 11 | 34,993 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.
You can take and complete at most one of these jobs in a day.
However, you cannot retake a job that you have already done.
Find the maximum total reward that you can earn no later than M days from today.
You can already start working today.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq M \leq 10^5
* 1 \leq A_i \leq 10^5
* 1 \leq B_i \leq 10^4
Input
Input is given from Standard Input in the following format:
N M
A_1 B_1
A_2 B_2
\vdots
A_N B_N
Output
Print the maximum total reward that you can earn no later than M days from today.
Examples
Input
3 4
4 3
4 1
2 2
Output
5
Input
5 3
1 2
1 3
1 4
2 1
2 3
Output
10
Input
1 1
2 1
Output
0
Submitted Solution:
```
from heapq import*
(N, M), *t = [map(int, s.split()) for s in open(0)]
q, z = [], 0
v = [[] for _ in [None] * 10**5]
for a, b in t:
v[a - 1] += b,
for i in v[:M]:
for j in i:
heappush(q, -j)
if q:
z += -heappop(q)
print(z)
``` | instruction | 0 | 17,497 | 11 | 34,994 |
Yes | output | 1 | 17,497 | 11 | 34,995 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.
You can take and complete at most one of these jobs in a day.
However, you cannot retake a job that you have already done.
Find the maximum total reward that you can earn no later than M days from today.
You can already start working today.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq M \leq 10^5
* 1 \leq A_i \leq 10^5
* 1 \leq B_i \leq 10^4
Input
Input is given from Standard Input in the following format:
N M
A_1 B_1
A_2 B_2
\vdots
A_N B_N
Output
Print the maximum total reward that you can earn no later than M days from today.
Examples
Input
3 4
4 3
4 1
2 2
Output
5
Input
5 3
1 2
1 3
1 4
2 1
2 3
Output
10
Input
1 1
2 1
Output
0
Submitted Solution:
```
import heapq
N,M = map(int,input().split())
jobs = [ [] for _ in range(M+1) ]
for _ in range(N):
a,b = map(int,input().split())
if a <= M:
jobs[a].append(b)
pq = []
d = 1
res = 0
for _ in range(M-1, -1, -1):
for b in jobs[d]:
heapq.heappush(pq, -b)
if pq:
res += -heapq.heappop(pq)
d += 1
print(res)
``` | instruction | 0 | 17,498 | 11 | 34,996 |
Yes | output | 1 | 17,498 | 11 | 34,997 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.
You can take and complete at most one of these jobs in a day.
However, you cannot retake a job that you have already done.
Find the maximum total reward that you can earn no later than M days from today.
You can already start working today.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq M \leq 10^5
* 1 \leq A_i \leq 10^5
* 1 \leq B_i \leq 10^4
Input
Input is given from Standard Input in the following format:
N M
A_1 B_1
A_2 B_2
\vdots
A_N B_N
Output
Print the maximum total reward that you can earn no later than M days from today.
Examples
Input
3 4
4 3
4 1
2 2
Output
5
Input
5 3
1 2
1 3
1 4
2 1
2 3
Output
10
Input
1 1
2 1
Output
0
Submitted Solution:
```
from heapq import*
N,M,*t=map(int,open(0).read().split())
v=[[]for _ in'_'*M]
z=i=0
for a in t[::2]:a>M or v[a-1].append(t[i+1]);i+=2
q=[0]*M
for i in v:
for j in i:heappush(q,-j)
z-=heappop(q)
print(z)
``` | instruction | 0 | 17,499 | 11 | 34,998 |
Yes | output | 1 | 17,499 | 11 | 34,999 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.
You can take and complete at most one of these jobs in a day.
However, you cannot retake a job that you have already done.
Find the maximum total reward that you can earn no later than M days from today.
You can already start working today.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq M \leq 10^5
* 1 \leq A_i \leq 10^5
* 1 \leq B_i \leq 10^4
Input
Input is given from Standard Input in the following format:
N M
A_1 B_1
A_2 B_2
\vdots
A_N B_N
Output
Print the maximum total reward that you can earn no later than M days from today.
Examples
Input
3 4
4 3
4 1
2 2
Output
5
Input
5 3
1 2
1 3
1 4
2 1
2 3
Output
10
Input
1 1
2 1
Output
0
Submitted Solution:
```
n,m = map(int,input().split())
a = []
b = []
d = 100
sum = 0
for i in range(n):
c = list(map(int,input().split()))
if m >= c[0]:
a.append(c[0])
b.append(c[1])
if not b:
print(0)
exit()
c = zip(b,a)
d = sorted(c,reverse = True)
print(d)
for i in range(m):
for j in range(n):
if d[0][1] <=m-i:
sum += d[0][0]
d.pop(0)
break
else:
d.pop(0)
print(sum)
``` | instruction | 0 | 17,500 | 11 | 35,000 |
No | output | 1 | 17,500 | 11 | 35,001 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.
You can take and complete at most one of these jobs in a day.
However, you cannot retake a job that you have already done.
Find the maximum total reward that you can earn no later than M days from today.
You can already start working today.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq M \leq 10^5
* 1 \leq A_i \leq 10^5
* 1 \leq B_i \leq 10^4
Input
Input is given from Standard Input in the following format:
N M
A_1 B_1
A_2 B_2
\vdots
A_N B_N
Output
Print the maximum total reward that you can earn no later than M days from today.
Examples
Input
3 4
4 3
4 1
2 2
Output
5
Input
5 3
1 2
1 3
1 4
2 1
2 3
Output
10
Input
1 1
2 1
Output
0
Submitted Solution:
```
from collections import defaultdict
N,M=map(int,input().split())
x=defaultdict(list)
for i in range(N):
a,b=map(int,input().split())
x[a].append(b)
y=[]
an=0
for i in range(M+1):
y+=x[i]
y.sort()
try:
an+=y.pop()
except:
pass
print(an)
``` | instruction | 0 | 17,501 | 11 | 35,002 |
No | output | 1 | 17,501 | 11 | 35,003 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.
You can take and complete at most one of these jobs in a day.
However, you cannot retake a job that you have already done.
Find the maximum total reward that you can earn no later than M days from today.
You can already start working today.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq M \leq 10^5
* 1 \leq A_i \leq 10^5
* 1 \leq B_i \leq 10^4
Input
Input is given from Standard Input in the following format:
N M
A_1 B_1
A_2 B_2
\vdots
A_N B_N
Output
Print the maximum total reward that you can earn no later than M days from today.
Examples
Input
3 4
4 3
4 1
2 2
Output
5
Input
5 3
1 2
1 3
1 4
2 1
2 3
Output
10
Input
1 1
2 1
Output
0
Submitted Solution:
```
import sys
input=sys.stdin.readline
def sol():
n,m=map(int,input().split())
d=[]
ans=[0]*(m+1)
t=0
x,y=1,m
for i in range(n):
a,b=map(int,input().split())
d.append((b,a))
d.sort(reverse=True)
for bb,aa in d:
if max(x,aa)==y:
ans[y]=1
t+=bb
y-=1
else:
for j in range(max(x,aa),y+1):
if ans[j]==0:
ans[j]=1
t+=bb
if j==x: x+=1
if j==y: y-=1
break
print(t)
if __name__=="__main__":
sol()
``` | instruction | 0 | 17,502 | 11 | 35,004 |
No | output | 1 | 17,502 | 11 | 35,005 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.
You can take and complete at most one of these jobs in a day.
However, you cannot retake a job that you have already done.
Find the maximum total reward that you can earn no later than M days from today.
You can already start working today.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq M \leq 10^5
* 1 \leq A_i \leq 10^5
* 1 \leq B_i \leq 10^4
Input
Input is given from Standard Input in the following format:
N M
A_1 B_1
A_2 B_2
\vdots
A_N B_N
Output
Print the maximum total reward that you can earn no later than M days from today.
Examples
Input
3 4
4 3
4 1
2 2
Output
5
Input
5 3
1 2
1 3
1 4
2 1
2 3
Output
10
Input
1 1
2 1
Output
0
Submitted Solution:
```
import sys
input = sys.stdin.readline
n, m = map(int, input().split())
ab = [tuple(int(i) for i in input().split()) for _ in range(n)]
ab.sort(key=lambda x: x[1], reverse=True)
result = 0
for i in range(1, m + 1):
value = [k for k in ab if k[0] <= i]
if value:
result += value[0][1]
ab.remove(value[0])
print(result)
``` | instruction | 0 | 17,503 | 11 | 35,006 |
No | output | 1 | 17,503 | 11 | 35,007 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Salem gave you n sticks with integer positive lengths a_1, a_2, β¦, a_n.
For every stick, you can change its length to any other positive integer length (that is, either shrink or stretch it). The cost of changing the stick's length from a to b is |a - b|, where |x| means the absolute value of x.
A stick length a_i is called almost good for some integer t if |a_i - t| β€ 1.
Salem asks you to change the lengths of some sticks (possibly all or none), such that all sticks' lengths are almost good for some positive integer t and the total cost of changing is minimum possible. The value of t is not fixed in advance and you can choose it as any positive integer.
As an answer, print the value of t and the minimum cost. If there are multiple optimal choices for t, print any of them.
Input
The first line contains a single integer n (1 β€ n β€ 1000) β the number of sticks.
The second line contains n integers a_i (1 β€ a_i β€ 100) β the lengths of the sticks.
Output
Print the value of t and the minimum possible cost. If there are multiple optimal choices for t, print any of them.
Examples
Input
3
10 1 4
Output
3 7
Input
5
1 1 2 2 3
Output
2 0
Note
In the first example, we can change 1 into 2 and 10 into 4 with cost |1 - 2| + |10 - 4| = 1 + 6 = 7 and the resulting lengths [2, 4, 4] are almost good for t = 3.
In the second example, the sticks lengths are already almost good for t = 2, so we don't have to do anything.
Submitted Solution:
```
#JMD
#Nagendra Jha-4096
import sys
import math
#import fractions
#import numpy
###File Operations###
fileoperation=0
if(fileoperation):
orig_stdout = sys.stdout
orig_stdin = sys.stdin
inputfile = open('W:/Competitive Programming/input.txt', 'r')
outputfile = open('W:/Competitive Programming/output.txt', 'w')
sys.stdin = inputfile
sys.stdout = outputfile
###Defines...###
mod=1000000007
###FUF's...###
def nospace(l):
ans=''.join(str(i) for i in l)
return ans
##### Main ####
t=1
for tt in range(t):
n=int(input())
#n,k,s= map(int, sys.stdin.readline().split(' '))
a=list(map(int,sys.stdin.readline().split(' ')))
cost=mod
ans=-1
for i in range(1,101):
c=0
for j in range(n):
c+=min(abs(a[j]-i),abs(a[j]-i-1),abs(a[j]-i+1))
if(c<cost):
ans=i
cost=c
print(ans,cost)
#####File Operations#####
if(fileoperation):
sys.stdout = orig_stdout
sys.stdin = orig_stdin
inputfile.close()
outputfile.close()
``` | instruction | 0 | 17,747 | 11 | 35,494 |
Yes | output | 1 | 17,747 | 11 | 35,495 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n people came to a party. Then those, who had no friends among people at the party, left. Then those, who had exactly 1 friend among those who stayed, left as well. Then those, who had exactly 2, 3, ..., n - 1 friends among those who stayed by the moment of their leaving, did the same.
What is the maximum amount of people that could stay at the party in the end?
Input
The first input line contains one number t β amount of tests (1 β€ t β€ 105). Each of the following t lines contains one integer number n (1 β€ n β€ 105).
Output
For each test output in a separate line one number β the maximum amount of people that could stay in the end.
Examples
Input
1
3
Output
1
Submitted Solution:
```
from sys import *
input=stdin.buffer.readline
for u in range(int(input())):
n=int(input())
print(max(0,n-2))
``` | instruction | 0 | 17,988 | 11 | 35,976 |
Yes | output | 1 | 17,988 | 11 | 35,977 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n people came to a party. Then those, who had no friends among people at the party, left. Then those, who had exactly 1 friend among those who stayed, left as well. Then those, who had exactly 2, 3, ..., n - 1 friends among those who stayed by the moment of their leaving, did the same.
What is the maximum amount of people that could stay at the party in the end?
Input
The first input line contains one number t β amount of tests (1 β€ t β€ 105). Each of the following t lines contains one integer number n (1 β€ n β€ 105).
Output
For each test output in a separate line one number β the maximum amount of people that could stay in the end.
Examples
Input
1
3
Output
1
Submitted Solution:
```
import sys
input=sys.stdin.readline
t=int(input())
for i in range(t):
print(max(0,int(input()))-2)
``` | instruction | 0 | 17,993 | 11 | 35,986 |
No | output | 1 | 17,993 | 11 | 35,987 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arthur and Alexander are number busters. Today they've got a competition.
Arthur took a group of four integers a, b, w, x (0 β€ b < w, 0 < x < w) and Alexander took integer Ρ. Arthur and Alexander use distinct approaches to number bustings. Alexander is just a regular guy. Each second, he subtracts one from his number. In other words, he performs the assignment: c = c - 1. Arthur is a sophisticated guy. Each second Arthur performs a complex operation, described as follows: if b β₯ x, perform the assignment b = b - x, if b < x, then perform two consecutive assignments a = a - 1; b = w - (x - b).
You've got numbers a, b, w, x, c. Determine when Alexander gets ahead of Arthur if both guys start performing the operations at the same time. Assume that Alexander got ahead of Arthur if c β€ a.
Input
The first line contains integers a, b, w, x, c (1 β€ a β€ 2Β·109, 1 β€ w β€ 1000, 0 β€ b < w, 0 < x < w, 1 β€ c β€ 2Β·109).
Output
Print a single integer β the minimum time in seconds Alexander needs to get ahead of Arthur. You can prove that the described situation always occurs within the problem's limits.
Examples
Input
4 2 3 1 6
Output
2
Input
4 2 3 1 7
Output
4
Input
1 2 3 2 6
Output
13
Input
1 1 2 1 1
Output
0
Submitted Solution:
```
import sys
a, b, w, x, c = map(int, input().split())
if c <= a:
print(0)
sys.exit()
d = c - a
ans = 0
if b // x >= d:
print(d)
sys.exit()
ans += (b // x + 1)
d -= (b // x)
b = w - (x - b % x)
b0 = b
g = 0
det = 0
while (1):
if b // x >= d:
print(ans + d)
sys.exit()
g += (b // x + 1)
det += (b // x)
ans += (b // x + 1)
d -= (b // x)
b = w - (x - b % x)
if b == b0:
break
if d > det:
k = d // det
if (d % det == 0):
k -= 1
d -= det * k
ans += k * g
while (1):
if b // x >= d:
print(ans + d)
sys.exit()
ans += (b // x + 1)
d -= (b // x)
b = w - (x - b % x)
``` | instruction | 0 | 18,036 | 11 | 36,072 |
Yes | output | 1 | 18,036 | 11 | 36,073 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arthur and Alexander are number busters. Today they've got a competition.
Arthur took a group of four integers a, b, w, x (0 β€ b < w, 0 < x < w) and Alexander took integer Ρ. Arthur and Alexander use distinct approaches to number bustings. Alexander is just a regular guy. Each second, he subtracts one from his number. In other words, he performs the assignment: c = c - 1. Arthur is a sophisticated guy. Each second Arthur performs a complex operation, described as follows: if b β₯ x, perform the assignment b = b - x, if b < x, then perform two consecutive assignments a = a - 1; b = w - (x - b).
You've got numbers a, b, w, x, c. Determine when Alexander gets ahead of Arthur if both guys start performing the operations at the same time. Assume that Alexander got ahead of Arthur if c β€ a.
Input
The first line contains integers a, b, w, x, c (1 β€ a β€ 2Β·109, 1 β€ w β€ 1000, 0 β€ b < w, 0 < x < w, 1 β€ c β€ 2Β·109).
Output
Print a single integer β the minimum time in seconds Alexander needs to get ahead of Arthur. You can prove that the described situation always occurs within the problem's limits.
Examples
Input
4 2 3 1 6
Output
2
Input
4 2 3 1 7
Output
4
Input
1 2 3 2 6
Output
13
Input
1 1 2 1 1
Output
0
Submitted Solution:
```
a, b, w, x, c = map(int, input().split())
if c <= a:
print(0)
exit()
l, r = 0, (c - a) * int(1e4)
while l + 1 < r:
m = (l + r) // 2
if c - m <= a - (w - b - 1 + m * x) // w:
r = m
else:
l = m
print(r)
``` | instruction | 0 | 18,037 | 11 | 36,074 |
Yes | output | 1 | 18,037 | 11 | 36,075 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arthur and Alexander are number busters. Today they've got a competition.
Arthur took a group of four integers a, b, w, x (0 β€ b < w, 0 < x < w) and Alexander took integer Ρ. Arthur and Alexander use distinct approaches to number bustings. Alexander is just a regular guy. Each second, he subtracts one from his number. In other words, he performs the assignment: c = c - 1. Arthur is a sophisticated guy. Each second Arthur performs a complex operation, described as follows: if b β₯ x, perform the assignment b = b - x, if b < x, then perform two consecutive assignments a = a - 1; b = w - (x - b).
You've got numbers a, b, w, x, c. Determine when Alexander gets ahead of Arthur if both guys start performing the operations at the same time. Assume that Alexander got ahead of Arthur if c β€ a.
Input
The first line contains integers a, b, w, x, c (1 β€ a β€ 2Β·109, 1 β€ w β€ 1000, 0 β€ b < w, 0 < x < w, 1 β€ c β€ 2Β·109).
Output
Print a single integer β the minimum time in seconds Alexander needs to get ahead of Arthur. You can prove that the described situation always occurs within the problem's limits.
Examples
Input
4 2 3 1 6
Output
2
Input
4 2 3 1 7
Output
4
Input
1 2 3 2 6
Output
13
Input
1 1 2 1 1
Output
0
Submitted Solution:
```
a,b,w,x,c=map(int,input().split())
t=0
while (1):
c-=1
if (b>=x):
b-=x
t+=1
if (a>=c):
print (t)
break
else:
continue
else:
a-=1
b=w-(x-b)
t+=1
if (a>=c):
print (t)
break
else:
continue
``` | instruction | 0 | 18,038 | 11 | 36,076 |
No | output | 1 | 18,038 | 11 | 36,077 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arthur and Alexander are number busters. Today they've got a competition.
Arthur took a group of four integers a, b, w, x (0 β€ b < w, 0 < x < w) and Alexander took integer Ρ. Arthur and Alexander use distinct approaches to number bustings. Alexander is just a regular guy. Each second, he subtracts one from his number. In other words, he performs the assignment: c = c - 1. Arthur is a sophisticated guy. Each second Arthur performs a complex operation, described as follows: if b β₯ x, perform the assignment b = b - x, if b < x, then perform two consecutive assignments a = a - 1; b = w - (x - b).
You've got numbers a, b, w, x, c. Determine when Alexander gets ahead of Arthur if both guys start performing the operations at the same time. Assume that Alexander got ahead of Arthur if c β€ a.
Input
The first line contains integers a, b, w, x, c (1 β€ a β€ 2Β·109, 1 β€ w β€ 1000, 0 β€ b < w, 0 < x < w, 1 β€ c β€ 2Β·109).
Output
Print a single integer β the minimum time in seconds Alexander needs to get ahead of Arthur. You can prove that the described situation always occurs within the problem's limits.
Examples
Input
4 2 3 1 6
Output
2
Input
4 2 3 1 7
Output
4
Input
1 2 3 2 6
Output
13
Input
1 1 2 1 1
Output
0
Submitted Solution:
```
def f(t, c, b, w):
a = b
s = l = 0
while True:
b += w
dt = b // x
b -= dt * x
s += dt
l += 1
if a == b: break
k = c // s
c -= k * s
t += k * (s + l)
if c == 0: return t - 1
while True:
b += w
dt = b // x
b -= dt * x
if c <= dt: return t + c
c -= dt
t += dt + 1
a, b, w, x, c = map(int, input().split())
t = b // x
if a >= c - t: print(c - min(c, a))
else: print(f(t + 1, c - t - a, b - t * x, w - x))
``` | instruction | 0 | 18,039 | 11 | 36,078 |
No | output | 1 | 18,039 | 11 | 36,079 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arthur and Alexander are number busters. Today they've got a competition.
Arthur took a group of four integers a, b, w, x (0 β€ b < w, 0 < x < w) and Alexander took integer Ρ. Arthur and Alexander use distinct approaches to number bustings. Alexander is just a regular guy. Each second, he subtracts one from his number. In other words, he performs the assignment: c = c - 1. Arthur is a sophisticated guy. Each second Arthur performs a complex operation, described as follows: if b β₯ x, perform the assignment b = b - x, if b < x, then perform two consecutive assignments a = a - 1; b = w - (x - b).
You've got numbers a, b, w, x, c. Determine when Alexander gets ahead of Arthur if both guys start performing the operations at the same time. Assume that Alexander got ahead of Arthur if c β€ a.
Input
The first line contains integers a, b, w, x, c (1 β€ a β€ 2Β·109, 1 β€ w β€ 1000, 0 β€ b < w, 0 < x < w, 1 β€ c β€ 2Β·109).
Output
Print a single integer β the minimum time in seconds Alexander needs to get ahead of Arthur. You can prove that the described situation always occurs within the problem's limits.
Examples
Input
4 2 3 1 6
Output
2
Input
4 2 3 1 7
Output
4
Input
1 2 3 2 6
Output
13
Input
1 1 2 1 1
Output
0
Submitted Solution:
```
import fileinput;
str = input();
sstr = str.split(' ')
a,b,w,x,c = int(sstr[0]),int(sstr[1]),int(sstr[2]),int(sstr[3]),int(sstr[4])
dif = c-a
up = int((dif*x-b)/(w-x))
b = b+up*(w-x)
count = up
while dif > 0:
if (b >= x):
factor = min(int((b - x)/x)+1,dif)
dif = dif-factor
b = b - x*factor
else:
factor = int( (x-b-1)/(w-x) )+1
b = factor*(w-x)+b
count = count+factor
print(count+(c-a))
``` | instruction | 0 | 18,040 | 11 | 36,080 |
No | output | 1 | 18,040 | 11 | 36,081 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arthur and Alexander are number busters. Today they've got a competition.
Arthur took a group of four integers a, b, w, x (0 β€ b < w, 0 < x < w) and Alexander took integer Ρ. Arthur and Alexander use distinct approaches to number bustings. Alexander is just a regular guy. Each second, he subtracts one from his number. In other words, he performs the assignment: c = c - 1. Arthur is a sophisticated guy. Each second Arthur performs a complex operation, described as follows: if b β₯ x, perform the assignment b = b - x, if b < x, then perform two consecutive assignments a = a - 1; b = w - (x - b).
You've got numbers a, b, w, x, c. Determine when Alexander gets ahead of Arthur if both guys start performing the operations at the same time. Assume that Alexander got ahead of Arthur if c β€ a.
Input
The first line contains integers a, b, w, x, c (1 β€ a β€ 2Β·109, 1 β€ w β€ 1000, 0 β€ b < w, 0 < x < w, 1 β€ c β€ 2Β·109).
Output
Print a single integer β the minimum time in seconds Alexander needs to get ahead of Arthur. You can prove that the described situation always occurs within the problem's limits.
Examples
Input
4 2 3 1 6
Output
2
Input
4 2 3 1 7
Output
4
Input
1 2 3 2 6
Output
13
Input
1 1 2 1 1
Output
0
Submitted Solution:
```
a, b, w, x, c = [int(x) for x in input().split()]
was = [False] * 10000
plus = []
n = 0
m = 0
while not was[b]:
was[b] = True
n += 1
if b >= x:
b -= x
plus.append(True)
m += 1
else:
b += w - x
plus.append(False)
if c <= a:
print(0)
else:
k = c - a
divv = (k - 1) // m
kol = 0
for i in range(n):
if plus[i]:
kol += 1
if kol == k - divv * m:
break
print(divv * n + kol)
``` | instruction | 0 | 18,041 | 11 | 36,082 |
No | output | 1 | 18,041 | 11 | 36,083 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.