message stringlengths 2 67k | message_type stringclasses 2 values | message_id int64 0 1 | conversation_id int64 463 109k | cluster float64 19 19 | __index_level_0__ int64 926 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are playing a game and your goal is to maximize your expected gain. At the beginning of the game, a pawn is put, uniformly at random, at a position p\in\\{1,2,\dots, N\\}. The N positions are arranged on a circle (so that 1 is between N and 2).
The game consists of turns. At each turn you can either end the game, and get A_p dollars (where p is the current position of the pawn), or pay B_p dollar to keep playing. If you decide to keep playing, the pawn is randomly moved to one of the two adjacent positions p-1, p+1 (with the identifications 0 = N and N+1=1).
What is the expected gain of an optimal strategy?
Note: The "expected gain of an optimal strategy" shall be defined as the supremum of the expected gain among all strategies such that the game ends in a finite number of turns.
Constraints
* 2 \le N \le 200,000
* 0 \le A_p \le 10^{12} for any p = 1,\ldots, N
* 0 \le B_p \le 100 for any p = 1, \ldots, N
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 A_2 \cdots A_N
B_1 B_2 \cdots B_N
Output
Print a single real number, the expected gain of an optimal strategy. Your answer will be considered correct if its relative or absolute error does not exceed 10^{-10}.
Examples
Input
5
4 2 6 3 5
1 1 1 1 1
Output
4.700000000000
Input
4
100 0 100 0
0 100 0 100
Output
50.000000000000
Input
14
4839 5400 6231 5800 6001 5200 6350 7133 7986 8012 7537 7013 6477 5912
34 54 61 32 52 61 21 43 65 12 45 21 1 4
Output
7047.142857142857
Input
10
470606482521 533212137322 116718867454 746976621474 457112271419 815899162072 641324977314 88281100571 9231169966 455007126951
26 83 30 59 100 88 84 91 54 61
Output
815899161079.400024414062
Submitted Solution:
```
input()
input()
input()
print(1.0)
``` | instruction | 0 | 14,779 | 19 | 29,558 |
No | output | 1 | 14,779 | 19 | 29,559 |
Provide a correct Python 3 solution for this coding contest problem.
Taro and Hanako decided to play hit-and-blow. The hit-and-blow rules are as follows.
* Separated into questioners and respondents.
* The questioner decides a 4-digit number (correct answer) that does not include duplicate numbers.
* Respondents guess the 4-digit number (answer).
* For the answer, the questioner gives a hint by the number of hits and blows.
* Comparing the answer and the correct answer, the fact that both the number and the digit position are the same is called a hit, and the fact that only the number is the same but the digit position is different is called a blow. For example, if the correct answer is 1234 and the answer is 1354, the questioner gives the hint "2 hits, 1 blow" and repeats until the correct answer.
* The questioner and the respondent take turns playing the game, and the one who guesses the correct answer with fewer answers wins.
Taro and Hanako seem to find it a little annoying to judge the number of hits and the number of blows each time. For those two, let's create a program that instantly shows the number of hits and the number of blows.
Create a program that inputs the correct answer r and the answer a and outputs the number of hits and the number of blows. r and a are a sequence of four numbers, 0 to 9, respectively.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by two lines of zeros. For each dataset, r and a are given on one line, separated by blanks.
The number of datasets does not exceed 12000.
Output
Outputs the number of hits and the number of blows on one line for each input dataset.
Example
Input
1234 5678
1234 1354
1234 1234
1230 1023
0123 1234
0 0
Output
0 0
2 1
4 0
1 3
0 3 | instruction | 0 | 14,940 | 19 | 29,880 |
"Correct Solution:
```
while True:
a, b = input().split()
if a == "0" and b == "0":
break
a1 = 0
a2 = 0
for i in range(4):
if a[i] == b[i]:
a1 += 1
for i in range(4):
for j in range(4):
if a[i] == b[j]:
a2 += 1
print(a1, a2-a1)
``` | output | 1 | 14,940 | 19 | 29,881 |
Provide a correct Python 3 solution for this coding contest problem.
Taro and Hanako decided to play hit-and-blow. The hit-and-blow rules are as follows.
* Separated into questioners and respondents.
* The questioner decides a 4-digit number (correct answer) that does not include duplicate numbers.
* Respondents guess the 4-digit number (answer).
* For the answer, the questioner gives a hint by the number of hits and blows.
* Comparing the answer and the correct answer, the fact that both the number and the digit position are the same is called a hit, and the fact that only the number is the same but the digit position is different is called a blow. For example, if the correct answer is 1234 and the answer is 1354, the questioner gives the hint "2 hits, 1 blow" and repeats until the correct answer.
* The questioner and the respondent take turns playing the game, and the one who guesses the correct answer with fewer answers wins.
Taro and Hanako seem to find it a little annoying to judge the number of hits and the number of blows each time. For those two, let's create a program that instantly shows the number of hits and the number of blows.
Create a program that inputs the correct answer r and the answer a and outputs the number of hits and the number of blows. r and a are a sequence of four numbers, 0 to 9, respectively.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by two lines of zeros. For each dataset, r and a are given on one line, separated by blanks.
The number of datasets does not exceed 12000.
Output
Outputs the number of hits and the number of blows on one line for each input dataset.
Example
Input
1234 5678
1234 1354
1234 1234
1230 1023
0123 1234
0 0
Output
0 0
2 1
4 0
1 3
0 3 | instruction | 0 | 14,941 | 19 | 29,882 |
"Correct Solution:
```
for q in range(12000):
a, b = input().split()
if a[0] is '0' and b[0] is '0':
break
hit = 0
for i in range(4):
if a[i] is b[i]:
hit = hit + 1
blow = 0
for j in range(4):
for i in range(4):
if (b[j] is a[i]) and (a[i] is not b[i]) and (a[j] is not b[j]):
blow = blow + 1
print(hit, blow)
``` | output | 1 | 14,941 | 19 | 29,883 |
Provide a correct Python 3 solution for this coding contest problem.
Taro and Hanako decided to play hit-and-blow. The hit-and-blow rules are as follows.
* Separated into questioners and respondents.
* The questioner decides a 4-digit number (correct answer) that does not include duplicate numbers.
* Respondents guess the 4-digit number (answer).
* For the answer, the questioner gives a hint by the number of hits and blows.
* Comparing the answer and the correct answer, the fact that both the number and the digit position are the same is called a hit, and the fact that only the number is the same but the digit position is different is called a blow. For example, if the correct answer is 1234 and the answer is 1354, the questioner gives the hint "2 hits, 1 blow" and repeats until the correct answer.
* The questioner and the respondent take turns playing the game, and the one who guesses the correct answer with fewer answers wins.
Taro and Hanako seem to find it a little annoying to judge the number of hits and the number of blows each time. For those two, let's create a program that instantly shows the number of hits and the number of blows.
Create a program that inputs the correct answer r and the answer a and outputs the number of hits and the number of blows. r and a are a sequence of four numbers, 0 to 9, respectively.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by two lines of zeros. For each dataset, r and a are given on one line, separated by blanks.
The number of datasets does not exceed 12000.
Output
Outputs the number of hits and the number of blows on one line for each input dataset.
Example
Input
1234 5678
1234 1354
1234 1234
1230 1023
0123 1234
0 0
Output
0 0
2 1
4 0
1 3
0 3 | instruction | 0 | 14,942 | 19 | 29,884 |
"Correct Solution:
```
while True:
r, a= input().split()
if r==a=='0': break
print(sum(1 for i, j in zip(r, a) if i==j), sum(1 for i in range(len(r)) for j in range(len(a)) if r[i]==a[j] and i!=j))
``` | output | 1 | 14,942 | 19 | 29,885 |
Provide a correct Python 3 solution for this coding contest problem.
Taro and Hanako decided to play hit-and-blow. The hit-and-blow rules are as follows.
* Separated into questioners and respondents.
* The questioner decides a 4-digit number (correct answer) that does not include duplicate numbers.
* Respondents guess the 4-digit number (answer).
* For the answer, the questioner gives a hint by the number of hits and blows.
* Comparing the answer and the correct answer, the fact that both the number and the digit position are the same is called a hit, and the fact that only the number is the same but the digit position is different is called a blow. For example, if the correct answer is 1234 and the answer is 1354, the questioner gives the hint "2 hits, 1 blow" and repeats until the correct answer.
* The questioner and the respondent take turns playing the game, and the one who guesses the correct answer with fewer answers wins.
Taro and Hanako seem to find it a little annoying to judge the number of hits and the number of blows each time. For those two, let's create a program that instantly shows the number of hits and the number of blows.
Create a program that inputs the correct answer r and the answer a and outputs the number of hits and the number of blows. r and a are a sequence of four numbers, 0 to 9, respectively.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by two lines of zeros. For each dataset, r and a are given on one line, separated by blanks.
The number of datasets does not exceed 12000.
Output
Outputs the number of hits and the number of blows on one line for each input dataset.
Example
Input
1234 5678
1234 1354
1234 1234
1230 1023
0123 1234
0 0
Output
0 0
2 1
4 0
1 3
0 3 | instruction | 0 | 14,943 | 19 | 29,886 |
"Correct Solution:
```
while 1:
r, a = map(int, input().split())
if r == 0:
break
pro = list(str(r).zfill(4))
ans = list(str(a).zfill(4))
hit = 0
blow = 0
for p, a in zip(pro, ans):
if p == a:
hit += 1
elif a in pro:
blow += 1
print(hit, blow)
``` | output | 1 | 14,943 | 19 | 29,887 |
Provide a correct Python 3 solution for this coding contest problem.
Taro and Hanako decided to play hit-and-blow. The hit-and-blow rules are as follows.
* Separated into questioners and respondents.
* The questioner decides a 4-digit number (correct answer) that does not include duplicate numbers.
* Respondents guess the 4-digit number (answer).
* For the answer, the questioner gives a hint by the number of hits and blows.
* Comparing the answer and the correct answer, the fact that both the number and the digit position are the same is called a hit, and the fact that only the number is the same but the digit position is different is called a blow. For example, if the correct answer is 1234 and the answer is 1354, the questioner gives the hint "2 hits, 1 blow" and repeats until the correct answer.
* The questioner and the respondent take turns playing the game, and the one who guesses the correct answer with fewer answers wins.
Taro and Hanako seem to find it a little annoying to judge the number of hits and the number of blows each time. For those two, let's create a program that instantly shows the number of hits and the number of blows.
Create a program that inputs the correct answer r and the answer a and outputs the number of hits and the number of blows. r and a are a sequence of four numbers, 0 to 9, respectively.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by two lines of zeros. For each dataset, r and a are given on one line, separated by blanks.
The number of datasets does not exceed 12000.
Output
Outputs the number of hits and the number of blows on one line for each input dataset.
Example
Input
1234 5678
1234 1354
1234 1234
1230 1023
0123 1234
0 0
Output
0 0
2 1
4 0
1 3
0 3 | instruction | 0 | 14,944 | 19 | 29,888 |
"Correct Solution:
```
while True :
a, b = map(int, input().split())
if a == 0 and b == 0 :
break
hit = 0
blow = 0
if a//1000 == b//1000 :
hit += 1
if (a%1000)//100 == (b%1000)//100 :
hit += 1
if (a%100)//10 == (b%100)//10 :
hit += 1
if a%10 == b%10 :
hit += 1
if a//1000 == (b%1000)//100 or a//1000 == (b%100)//10 or a//1000 == b%10 :
blow += 1
if (a%1000)//100 == b//1000 or (a%1000)//100 == (b%100)//10 or (a%1000)//100 == b%10 :
blow += 1
if (a%100)//10 == b//1000 or (a%100)//10 == (b%1000)//100 or (a%100)//10 == b%10 :
blow += 1
if a%10 == b//1000 or a%10 == (b%1000)//100 or a%10 == (b%100)//10 :
blow += 1
print(hit, blow)
``` | output | 1 | 14,944 | 19 | 29,889 |
Provide a correct Python 3 solution for this coding contest problem.
Taro and Hanako decided to play hit-and-blow. The hit-and-blow rules are as follows.
* Separated into questioners and respondents.
* The questioner decides a 4-digit number (correct answer) that does not include duplicate numbers.
* Respondents guess the 4-digit number (answer).
* For the answer, the questioner gives a hint by the number of hits and blows.
* Comparing the answer and the correct answer, the fact that both the number and the digit position are the same is called a hit, and the fact that only the number is the same but the digit position is different is called a blow. For example, if the correct answer is 1234 and the answer is 1354, the questioner gives the hint "2 hits, 1 blow" and repeats until the correct answer.
* The questioner and the respondent take turns playing the game, and the one who guesses the correct answer with fewer answers wins.
Taro and Hanako seem to find it a little annoying to judge the number of hits and the number of blows each time. For those two, let's create a program that instantly shows the number of hits and the number of blows.
Create a program that inputs the correct answer r and the answer a and outputs the number of hits and the number of blows. r and a are a sequence of four numbers, 0 to 9, respectively.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by two lines of zeros. For each dataset, r and a are given on one line, separated by blanks.
The number of datasets does not exceed 12000.
Output
Outputs the number of hits and the number of blows on one line for each input dataset.
Example
Input
1234 5678
1234 1354
1234 1234
1230 1023
0123 1234
0 0
Output
0 0
2 1
4 0
1 3
0 3 | instruction | 0 | 14,945 | 19 | 29,890 |
"Correct Solution:
```
while True:
r, a = input().split()
if r == a == '0': break
h, b = 0, 0
for i in range(4):
if r[i] == a[i]:
h += 1
elif a[i] in r:
b += 1
print(h, b)
``` | output | 1 | 14,945 | 19 | 29,891 |
Provide a correct Python 3 solution for this coding contest problem.
Taro and Hanako decided to play hit-and-blow. The hit-and-blow rules are as follows.
* Separated into questioners and respondents.
* The questioner decides a 4-digit number (correct answer) that does not include duplicate numbers.
* Respondents guess the 4-digit number (answer).
* For the answer, the questioner gives a hint by the number of hits and blows.
* Comparing the answer and the correct answer, the fact that both the number and the digit position are the same is called a hit, and the fact that only the number is the same but the digit position is different is called a blow. For example, if the correct answer is 1234 and the answer is 1354, the questioner gives the hint "2 hits, 1 blow" and repeats until the correct answer.
* The questioner and the respondent take turns playing the game, and the one who guesses the correct answer with fewer answers wins.
Taro and Hanako seem to find it a little annoying to judge the number of hits and the number of blows each time. For those two, let's create a program that instantly shows the number of hits and the number of blows.
Create a program that inputs the correct answer r and the answer a and outputs the number of hits and the number of blows. r and a are a sequence of four numbers, 0 to 9, respectively.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by two lines of zeros. For each dataset, r and a are given on one line, separated by blanks.
The number of datasets does not exceed 12000.
Output
Outputs the number of hits and the number of blows on one line for each input dataset.
Example
Input
1234 5678
1234 1354
1234 1234
1230 1023
0123 1234
0 0
Output
0 0
2 1
4 0
1 3
0 3 | instruction | 0 | 14,946 | 19 | 29,892 |
"Correct Solution:
```
for q in range(12000):
a, b = input().split()
if a[0] is '0' and b[0] is '0':
break
hit = sum(1 for c, d in zip(a, b) if d is c)
blow = sum(1 for e in b if e in a) - hit
print(hit, blow)
``` | output | 1 | 14,946 | 19 | 29,893 |
Provide a correct Python 3 solution for this coding contest problem.
Taro and Hanako decided to play hit-and-blow. The hit-and-blow rules are as follows.
* Separated into questioners and respondents.
* The questioner decides a 4-digit number (correct answer) that does not include duplicate numbers.
* Respondents guess the 4-digit number (answer).
* For the answer, the questioner gives a hint by the number of hits and blows.
* Comparing the answer and the correct answer, the fact that both the number and the digit position are the same is called a hit, and the fact that only the number is the same but the digit position is different is called a blow. For example, if the correct answer is 1234 and the answer is 1354, the questioner gives the hint "2 hits, 1 blow" and repeats until the correct answer.
* The questioner and the respondent take turns playing the game, and the one who guesses the correct answer with fewer answers wins.
Taro and Hanako seem to find it a little annoying to judge the number of hits and the number of blows each time. For those two, let's create a program that instantly shows the number of hits and the number of blows.
Create a program that inputs the correct answer r and the answer a and outputs the number of hits and the number of blows. r and a are a sequence of four numbers, 0 to 9, respectively.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by two lines of zeros. For each dataset, r and a are given on one line, separated by blanks.
The number of datasets does not exceed 12000.
Output
Outputs the number of hits and the number of blows on one line for each input dataset.
Example
Input
1234 5678
1234 1354
1234 1234
1230 1023
0123 1234
0 0
Output
0 0
2 1
4 0
1 3
0 3 | instruction | 0 | 14,947 | 19 | 29,894 |
"Correct Solution:
```
while 1:
a,b=input().split()
if a=='0':break
h=0
for i,j in zip(a,b):h+=i==j
print(h,len(set(a)&set(b))-h)
``` | output | 1 | 14,947 | 19 | 29,895 |
Provide a correct Python 3 solution for this coding contest problem.
Princess'Gamble
Princess gambling
English text is not available in this practice contest.
One day, a brave princess in a poor country's tomboy broke the walls of her room, escaped from the castle, and entered the gambling hall where horse racing and other gambling were held. However, the princess who had never gambled was very defeated. The princess, who found this situation uninteresting, investigated how gambling was carried out. Then, in such gambling, it was found that the dividend was decided by a method called the parimutuel method.
The parimutuel method is a calculation method used to determine dividends in gambling for races. In this method, all the stakes are pooled, a certain percentage is deducted, and then the amount proportional to the stakes is distributed to the winners.
In the gambling that the princess is currently enthusiastic about, participants buy a 100 gold voting ticket to predict which player will win before the competition and receive a winning prize if the result of the competition matches the prediction. It's about getting the right. Gold is the currency unit of this country. Your job is to write a program that calculates the payout per voting ticket based on the competition information given as input.
If the dividend amount calculated by the above method is not an integer, round it down to an integer.
Input
The input consists of multiple datasets. The number of data sets is 100 or less. After the last dataset, a line of "0 0 0" is given to mark the end of the input.
Each data set has the following format.
> N M P
> X1
> ...
> XN
In the first line, N is the number of players to vote for, M is the number of the winning player, and P is an integer representing the deduction rate (percentage). Xi is the number of voting tickets voted for the i-th competitor. It may be assumed that 1 ≤ N ≤ 100, 1 ≤ M ≤ N, 0 ≤ P ≤ 100, 0 ≤ Xi ≤ 1000.
Output
For each dataset, output a line of integers indicating the payout amount per winning voting ticket. Output 0 if no one has won the bet. There must be no other characters on the output line.
Sample Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output for the Sample Input
150
0
112
Example
Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output
150
0
112 | instruction | 0 | 15,002 | 19 | 30,004 |
"Correct Solution:
```
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import array
import math
def solve(m, p, xs):
total_prize = sum(xs) * (100 - p)
number_of_winners = xs[m - 1]
if not number_of_winners:
return 0
else:
return math.floor(total_prize / number_of_winners)
if __name__ == "__main__":
while True:
n, m, p = map(int, input().split())
if n == 0 and m == 0 and p == 0:
break
xs = array.array("H", (int(input()) for i in range(n)))
print(solve(m, p, xs))
``` | output | 1 | 15,002 | 19 | 30,005 |
Provide a correct Python 3 solution for this coding contest problem.
Princess'Gamble
Princess gambling
English text is not available in this practice contest.
One day, a brave princess in a poor country's tomboy broke the walls of her room, escaped from the castle, and entered the gambling hall where horse racing and other gambling were held. However, the princess who had never gambled was very defeated. The princess, who found this situation uninteresting, investigated how gambling was carried out. Then, in such gambling, it was found that the dividend was decided by a method called the parimutuel method.
The parimutuel method is a calculation method used to determine dividends in gambling for races. In this method, all the stakes are pooled, a certain percentage is deducted, and then the amount proportional to the stakes is distributed to the winners.
In the gambling that the princess is currently enthusiastic about, participants buy a 100 gold voting ticket to predict which player will win before the competition and receive a winning prize if the result of the competition matches the prediction. It's about getting the right. Gold is the currency unit of this country. Your job is to write a program that calculates the payout per voting ticket based on the competition information given as input.
If the dividend amount calculated by the above method is not an integer, round it down to an integer.
Input
The input consists of multiple datasets. The number of data sets is 100 or less. After the last dataset, a line of "0 0 0" is given to mark the end of the input.
Each data set has the following format.
> N M P
> X1
> ...
> XN
In the first line, N is the number of players to vote for, M is the number of the winning player, and P is an integer representing the deduction rate (percentage). Xi is the number of voting tickets voted for the i-th competitor. It may be assumed that 1 ≤ N ≤ 100, 1 ≤ M ≤ N, 0 ≤ P ≤ 100, 0 ≤ Xi ≤ 1000.
Output
For each dataset, output a line of integers indicating the payout amount per winning voting ticket. Output 0 if no one has won the bet. There must be no other characters on the output line.
Sample Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output for the Sample Input
150
0
112
Example
Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output
150
0
112 | instruction | 0 | 15,003 | 19 | 30,006 |
"Correct Solution:
```
while True:
N, M, P = map(int, input().split())
if N == 0 and M == 0 and P == 0:
break
X = [0 for i in range(N)]
for i in range(N):
X[i] = int(input())
if X[M - 1] != 0:
print(sum(X) * (100 - P) // X[M - 1])
else:
print(0)
``` | output | 1 | 15,003 | 19 | 30,007 |
Provide a correct Python 3 solution for this coding contest problem.
Princess'Gamble
Princess gambling
English text is not available in this practice contest.
One day, a brave princess in a poor country's tomboy broke the walls of her room, escaped from the castle, and entered the gambling hall where horse racing and other gambling were held. However, the princess who had never gambled was very defeated. The princess, who found this situation uninteresting, investigated how gambling was carried out. Then, in such gambling, it was found that the dividend was decided by a method called the parimutuel method.
The parimutuel method is a calculation method used to determine dividends in gambling for races. In this method, all the stakes are pooled, a certain percentage is deducted, and then the amount proportional to the stakes is distributed to the winners.
In the gambling that the princess is currently enthusiastic about, participants buy a 100 gold voting ticket to predict which player will win before the competition and receive a winning prize if the result of the competition matches the prediction. It's about getting the right. Gold is the currency unit of this country. Your job is to write a program that calculates the payout per voting ticket based on the competition information given as input.
If the dividend amount calculated by the above method is not an integer, round it down to an integer.
Input
The input consists of multiple datasets. The number of data sets is 100 or less. After the last dataset, a line of "0 0 0" is given to mark the end of the input.
Each data set has the following format.
> N M P
> X1
> ...
> XN
In the first line, N is the number of players to vote for, M is the number of the winning player, and P is an integer representing the deduction rate (percentage). Xi is the number of voting tickets voted for the i-th competitor. It may be assumed that 1 ≤ N ≤ 100, 1 ≤ M ≤ N, 0 ≤ P ≤ 100, 0 ≤ Xi ≤ 1000.
Output
For each dataset, output a line of integers indicating the payout amount per winning voting ticket. Output 0 if no one has won the bet. There must be no other characters on the output line.
Sample Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output for the Sample Input
150
0
112
Example
Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output
150
0
112 | instruction | 0 | 15,004 | 19 | 30,008 |
"Correct Solution:
```
l = input()
while l != '0 0 0':
l_split = l.split(' ')
athletes = int(l_split[0])
winner = int(l_split[1])
percent = int(l_split[2])
total_ticket = 0
win_ticket = 0
for i in range(athletes):
tickets = int(input())
total_ticket += tickets
if i + 1 == winner and tickets > 0:
win_ticket = tickets
if win_ticket > 0:
total_money = total_ticket*(100 - percent)
print(str(total_money//win_ticket))
else:
print('0')
l = input()
``` | output | 1 | 15,004 | 19 | 30,009 |
Provide a correct Python 3 solution for this coding contest problem.
Princess'Gamble
Princess gambling
English text is not available in this practice contest.
One day, a brave princess in a poor country's tomboy broke the walls of her room, escaped from the castle, and entered the gambling hall where horse racing and other gambling were held. However, the princess who had never gambled was very defeated. The princess, who found this situation uninteresting, investigated how gambling was carried out. Then, in such gambling, it was found that the dividend was decided by a method called the parimutuel method.
The parimutuel method is a calculation method used to determine dividends in gambling for races. In this method, all the stakes are pooled, a certain percentage is deducted, and then the amount proportional to the stakes is distributed to the winners.
In the gambling that the princess is currently enthusiastic about, participants buy a 100 gold voting ticket to predict which player will win before the competition and receive a winning prize if the result of the competition matches the prediction. It's about getting the right. Gold is the currency unit of this country. Your job is to write a program that calculates the payout per voting ticket based on the competition information given as input.
If the dividend amount calculated by the above method is not an integer, round it down to an integer.
Input
The input consists of multiple datasets. The number of data sets is 100 or less. After the last dataset, a line of "0 0 0" is given to mark the end of the input.
Each data set has the following format.
> N M P
> X1
> ...
> XN
In the first line, N is the number of players to vote for, M is the number of the winning player, and P is an integer representing the deduction rate (percentage). Xi is the number of voting tickets voted for the i-th competitor. It may be assumed that 1 ≤ N ≤ 100, 1 ≤ M ≤ N, 0 ≤ P ≤ 100, 0 ≤ Xi ≤ 1000.
Output
For each dataset, output a line of integers indicating the payout amount per winning voting ticket. Output 0 if no one has won the bet. There must be no other characters on the output line.
Sample Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output for the Sample Input
150
0
112
Example
Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output
150
0
112 | instruction | 0 | 15,005 | 19 | 30,010 |
"Correct Solution:
```
while 1:
n,m,p=map(int,input().split())
if n==0:
break
data=[]
for i in range(n):
data.append(int(input()))
print(sum(data)*(100-p)//data[m-1] if data[m-1]!=0 else 0)
``` | output | 1 | 15,005 | 19 | 30,011 |
Provide a correct Python 3 solution for this coding contest problem.
Princess'Gamble
Princess gambling
English text is not available in this practice contest.
One day, a brave princess in a poor country's tomboy broke the walls of her room, escaped from the castle, and entered the gambling hall where horse racing and other gambling were held. However, the princess who had never gambled was very defeated. The princess, who found this situation uninteresting, investigated how gambling was carried out. Then, in such gambling, it was found that the dividend was decided by a method called the parimutuel method.
The parimutuel method is a calculation method used to determine dividends in gambling for races. In this method, all the stakes are pooled, a certain percentage is deducted, and then the amount proportional to the stakes is distributed to the winners.
In the gambling that the princess is currently enthusiastic about, participants buy a 100 gold voting ticket to predict which player will win before the competition and receive a winning prize if the result of the competition matches the prediction. It's about getting the right. Gold is the currency unit of this country. Your job is to write a program that calculates the payout per voting ticket based on the competition information given as input.
If the dividend amount calculated by the above method is not an integer, round it down to an integer.
Input
The input consists of multiple datasets. The number of data sets is 100 or less. After the last dataset, a line of "0 0 0" is given to mark the end of the input.
Each data set has the following format.
> N M P
> X1
> ...
> XN
In the first line, N is the number of players to vote for, M is the number of the winning player, and P is an integer representing the deduction rate (percentage). Xi is the number of voting tickets voted for the i-th competitor. It may be assumed that 1 ≤ N ≤ 100, 1 ≤ M ≤ N, 0 ≤ P ≤ 100, 0 ≤ Xi ≤ 1000.
Output
For each dataset, output a line of integers indicating the payout amount per winning voting ticket. Output 0 if no one has won the bet. There must be no other characters on the output line.
Sample Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output for the Sample Input
150
0
112
Example
Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output
150
0
112 | instruction | 0 | 15,006 | 19 | 30,012 |
"Correct Solution:
```
import math
while True:
n,m,p = map(int,input().split())
if n == m == p == 0:
break
m -= 1
x = [int(input()) for i in range(n)]
if x[m] == 0:
print(0)
else:
print(math.floor((100-p)*sum(x)/x[m]))
``` | output | 1 | 15,006 | 19 | 30,013 |
Provide a correct Python 3 solution for this coding contest problem.
Princess'Gamble
Princess gambling
English text is not available in this practice contest.
One day, a brave princess in a poor country's tomboy broke the walls of her room, escaped from the castle, and entered the gambling hall where horse racing and other gambling were held. However, the princess who had never gambled was very defeated. The princess, who found this situation uninteresting, investigated how gambling was carried out. Then, in such gambling, it was found that the dividend was decided by a method called the parimutuel method.
The parimutuel method is a calculation method used to determine dividends in gambling for races. In this method, all the stakes are pooled, a certain percentage is deducted, and then the amount proportional to the stakes is distributed to the winners.
In the gambling that the princess is currently enthusiastic about, participants buy a 100 gold voting ticket to predict which player will win before the competition and receive a winning prize if the result of the competition matches the prediction. It's about getting the right. Gold is the currency unit of this country. Your job is to write a program that calculates the payout per voting ticket based on the competition information given as input.
If the dividend amount calculated by the above method is not an integer, round it down to an integer.
Input
The input consists of multiple datasets. The number of data sets is 100 or less. After the last dataset, a line of "0 0 0" is given to mark the end of the input.
Each data set has the following format.
> N M P
> X1
> ...
> XN
In the first line, N is the number of players to vote for, M is the number of the winning player, and P is an integer representing the deduction rate (percentage). Xi is the number of voting tickets voted for the i-th competitor. It may be assumed that 1 ≤ N ≤ 100, 1 ≤ M ≤ N, 0 ≤ P ≤ 100, 0 ≤ Xi ≤ 1000.
Output
For each dataset, output a line of integers indicating the payout amount per winning voting ticket. Output 0 if no one has won the bet. There must be no other characters on the output line.
Sample Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output for the Sample Input
150
0
112
Example
Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output
150
0
112 | instruction | 0 | 15,007 | 19 | 30,014 |
"Correct Solution:
```
while True:
N,M,P=map(int,input().split())
if N==0 and M==0 and P==0:
break
card=[]
for i in range(N):
card.append(int(input()))
if card[M-1]==0:
print(0)
else:
sc=sum(card)
kati=sc*100-(sc*100*(P/100))
haitou=kati//(card[M-1])
print(int(haitou))
``` | output | 1 | 15,007 | 19 | 30,015 |
Provide a correct Python 3 solution for this coding contest problem.
Princess'Gamble
Princess gambling
English text is not available in this practice contest.
One day, a brave princess in a poor country's tomboy broke the walls of her room, escaped from the castle, and entered the gambling hall where horse racing and other gambling were held. However, the princess who had never gambled was very defeated. The princess, who found this situation uninteresting, investigated how gambling was carried out. Then, in such gambling, it was found that the dividend was decided by a method called the parimutuel method.
The parimutuel method is a calculation method used to determine dividends in gambling for races. In this method, all the stakes are pooled, a certain percentage is deducted, and then the amount proportional to the stakes is distributed to the winners.
In the gambling that the princess is currently enthusiastic about, participants buy a 100 gold voting ticket to predict which player will win before the competition and receive a winning prize if the result of the competition matches the prediction. It's about getting the right. Gold is the currency unit of this country. Your job is to write a program that calculates the payout per voting ticket based on the competition information given as input.
If the dividend amount calculated by the above method is not an integer, round it down to an integer.
Input
The input consists of multiple datasets. The number of data sets is 100 or less. After the last dataset, a line of "0 0 0" is given to mark the end of the input.
Each data set has the following format.
> N M P
> X1
> ...
> XN
In the first line, N is the number of players to vote for, M is the number of the winning player, and P is an integer representing the deduction rate (percentage). Xi is the number of voting tickets voted for the i-th competitor. It may be assumed that 1 ≤ N ≤ 100, 1 ≤ M ≤ N, 0 ≤ P ≤ 100, 0 ≤ Xi ≤ 1000.
Output
For each dataset, output a line of integers indicating the payout amount per winning voting ticket. Output 0 if no one has won the bet. There must be no other characters on the output line.
Sample Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output for the Sample Input
150
0
112
Example
Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output
150
0
112 | instruction | 0 | 15,008 | 19 | 30,016 |
"Correct Solution:
```
while True :
N, M, P = map(int, input().split())
if N == 0 and M == 0 and P == 0 :
break
Sum = 0
for i in range(N) :
x = int(input())
Sum += x
if i == M - 1 :
winner = x
if winner == 0 :
print(0)
else :
print(int(Sum * 100 * (100 - P) / 100 / winner))
``` | output | 1 | 15,008 | 19 | 30,017 |
Provide a correct Python 3 solution for this coding contest problem.
Princess'Gamble
Princess gambling
English text is not available in this practice contest.
One day, a brave princess in a poor country's tomboy broke the walls of her room, escaped from the castle, and entered the gambling hall where horse racing and other gambling were held. However, the princess who had never gambled was very defeated. The princess, who found this situation uninteresting, investigated how gambling was carried out. Then, in such gambling, it was found that the dividend was decided by a method called the parimutuel method.
The parimutuel method is a calculation method used to determine dividends in gambling for races. In this method, all the stakes are pooled, a certain percentage is deducted, and then the amount proportional to the stakes is distributed to the winners.
In the gambling that the princess is currently enthusiastic about, participants buy a 100 gold voting ticket to predict which player will win before the competition and receive a winning prize if the result of the competition matches the prediction. It's about getting the right. Gold is the currency unit of this country. Your job is to write a program that calculates the payout per voting ticket based on the competition information given as input.
If the dividend amount calculated by the above method is not an integer, round it down to an integer.
Input
The input consists of multiple datasets. The number of data sets is 100 or less. After the last dataset, a line of "0 0 0" is given to mark the end of the input.
Each data set has the following format.
> N M P
> X1
> ...
> XN
In the first line, N is the number of players to vote for, M is the number of the winning player, and P is an integer representing the deduction rate (percentage). Xi is the number of voting tickets voted for the i-th competitor. It may be assumed that 1 ≤ N ≤ 100, 1 ≤ M ≤ N, 0 ≤ P ≤ 100, 0 ≤ Xi ≤ 1000.
Output
For each dataset, output a line of integers indicating the payout amount per winning voting ticket. Output 0 if no one has won the bet. There must be no other characters on the output line.
Sample Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output for the Sample Input
150
0
112
Example
Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output
150
0
112 | instruction | 0 | 15,009 | 19 | 30,018 |
"Correct Solution:
```
#!/usr/bin/python
# -*- coding: utf-8 -*-
import math
while True:
amount, number, per = map(int, input().split())
if amount == 0 and number == 0 and per == 0:
break
vote = [int(input()) for _ in range(amount)]
if vote[number-1] == 0:
print("0")
else:
print(math.floor(100 * sum(vote) * (100 - per) / 100 / vote[number-1]))
``` | output | 1 | 15,009 | 19 | 30,019 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Princess'Gamble
Princess gambling
English text is not available in this practice contest.
One day, a brave princess in a poor country's tomboy broke the walls of her room, escaped from the castle, and entered the gambling hall where horse racing and other gambling were held. However, the princess who had never gambled was very defeated. The princess, who found this situation uninteresting, investigated how gambling was carried out. Then, in such gambling, it was found that the dividend was decided by a method called the parimutuel method.
The parimutuel method is a calculation method used to determine dividends in gambling for races. In this method, all the stakes are pooled, a certain percentage is deducted, and then the amount proportional to the stakes is distributed to the winners.
In the gambling that the princess is currently enthusiastic about, participants buy a 100 gold voting ticket to predict which player will win before the competition and receive a winning prize if the result of the competition matches the prediction. It's about getting the right. Gold is the currency unit of this country. Your job is to write a program that calculates the payout per voting ticket based on the competition information given as input.
If the dividend amount calculated by the above method is not an integer, round it down to an integer.
Input
The input consists of multiple datasets. The number of data sets is 100 or less. After the last dataset, a line of "0 0 0" is given to mark the end of the input.
Each data set has the following format.
> N M P
> X1
> ...
> XN
In the first line, N is the number of players to vote for, M is the number of the winning player, and P is an integer representing the deduction rate (percentage). Xi is the number of voting tickets voted for the i-th competitor. It may be assumed that 1 ≤ N ≤ 100, 1 ≤ M ≤ N, 0 ≤ P ≤ 100, 0 ≤ Xi ≤ 1000.
Output
For each dataset, output a line of integers indicating the payout amount per winning voting ticket. Output 0 if no one has won the bet. There must be no other characters on the output line.
Sample Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output for the Sample Input
150
0
112
Example
Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output
150
0
112
Submitted Solution:
```
while 1:
n,m,p=map(int,input().split())
if n==0:break
x=[int(input()) for _ in range(n)]
print(sum(x)*(100-p)//x[m-1] if x[m-1] else 0)
``` | instruction | 0 | 15,010 | 19 | 30,020 |
Yes | output | 1 | 15,010 | 19 | 30,021 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Princess'Gamble
Princess gambling
English text is not available in this practice contest.
One day, a brave princess in a poor country's tomboy broke the walls of her room, escaped from the castle, and entered the gambling hall where horse racing and other gambling were held. However, the princess who had never gambled was very defeated. The princess, who found this situation uninteresting, investigated how gambling was carried out. Then, in such gambling, it was found that the dividend was decided by a method called the parimutuel method.
The parimutuel method is a calculation method used to determine dividends in gambling for races. In this method, all the stakes are pooled, a certain percentage is deducted, and then the amount proportional to the stakes is distributed to the winners.
In the gambling that the princess is currently enthusiastic about, participants buy a 100 gold voting ticket to predict which player will win before the competition and receive a winning prize if the result of the competition matches the prediction. It's about getting the right. Gold is the currency unit of this country. Your job is to write a program that calculates the payout per voting ticket based on the competition information given as input.
If the dividend amount calculated by the above method is not an integer, round it down to an integer.
Input
The input consists of multiple datasets. The number of data sets is 100 or less. After the last dataset, a line of "0 0 0" is given to mark the end of the input.
Each data set has the following format.
> N M P
> X1
> ...
> XN
In the first line, N is the number of players to vote for, M is the number of the winning player, and P is an integer representing the deduction rate (percentage). Xi is the number of voting tickets voted for the i-th competitor. It may be assumed that 1 ≤ N ≤ 100, 1 ≤ M ≤ N, 0 ≤ P ≤ 100, 0 ≤ Xi ≤ 1000.
Output
For each dataset, output a line of integers indicating the payout amount per winning voting ticket. Output 0 if no one has won the bet. There must be no other characters on the output line.
Sample Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output for the Sample Input
150
0
112
Example
Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output
150
0
112
Submitted Solution:
```
while 1:
N,M,P=map(int,input().split())
if not N and not M and not P:break
X=[int(input()) for _ in range(N)]
if not X[M-1]:r=0
else:r=int(sum(X)*100*(100-P)/100/X[M-1])
print(r)
``` | instruction | 0 | 15,011 | 19 | 30,022 |
Yes | output | 1 | 15,011 | 19 | 30,023 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Princess'Gamble
Princess gambling
English text is not available in this practice contest.
One day, a brave princess in a poor country's tomboy broke the walls of her room, escaped from the castle, and entered the gambling hall where horse racing and other gambling were held. However, the princess who had never gambled was very defeated. The princess, who found this situation uninteresting, investigated how gambling was carried out. Then, in such gambling, it was found that the dividend was decided by a method called the parimutuel method.
The parimutuel method is a calculation method used to determine dividends in gambling for races. In this method, all the stakes are pooled, a certain percentage is deducted, and then the amount proportional to the stakes is distributed to the winners.
In the gambling that the princess is currently enthusiastic about, participants buy a 100 gold voting ticket to predict which player will win before the competition and receive a winning prize if the result of the competition matches the prediction. It's about getting the right. Gold is the currency unit of this country. Your job is to write a program that calculates the payout per voting ticket based on the competition information given as input.
If the dividend amount calculated by the above method is not an integer, round it down to an integer.
Input
The input consists of multiple datasets. The number of data sets is 100 or less. After the last dataset, a line of "0 0 0" is given to mark the end of the input.
Each data set has the following format.
> N M P
> X1
> ...
> XN
In the first line, N is the number of players to vote for, M is the number of the winning player, and P is an integer representing the deduction rate (percentage). Xi is the number of voting tickets voted for the i-th competitor. It may be assumed that 1 ≤ N ≤ 100, 1 ≤ M ≤ N, 0 ≤ P ≤ 100, 0 ≤ Xi ≤ 1000.
Output
For each dataset, output a line of integers indicating the payout amount per winning voting ticket. Output 0 if no one has won the bet. There must be no other characters on the output line.
Sample Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output for the Sample Input
150
0
112
Example
Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output
150
0
112
Submitted Solution:
```
while True:
N,M,P = map(int,input().split())
if N == 0: break
src = [int(input()) for i in range(N)]
if src[M-1] == 0:
print(0)
else:
print((100-P) * sum(src) // src[M-1])
``` | instruction | 0 | 15,012 | 19 | 30,024 |
Yes | output | 1 | 15,012 | 19 | 30,025 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Princess'Gamble
Princess gambling
English text is not available in this practice contest.
One day, a brave princess in a poor country's tomboy broke the walls of her room, escaped from the castle, and entered the gambling hall where horse racing and other gambling were held. However, the princess who had never gambled was very defeated. The princess, who found this situation uninteresting, investigated how gambling was carried out. Then, in such gambling, it was found that the dividend was decided by a method called the parimutuel method.
The parimutuel method is a calculation method used to determine dividends in gambling for races. In this method, all the stakes are pooled, a certain percentage is deducted, and then the amount proportional to the stakes is distributed to the winners.
In the gambling that the princess is currently enthusiastic about, participants buy a 100 gold voting ticket to predict which player will win before the competition and receive a winning prize if the result of the competition matches the prediction. It's about getting the right. Gold is the currency unit of this country. Your job is to write a program that calculates the payout per voting ticket based on the competition information given as input.
If the dividend amount calculated by the above method is not an integer, round it down to an integer.
Input
The input consists of multiple datasets. The number of data sets is 100 or less. After the last dataset, a line of "0 0 0" is given to mark the end of the input.
Each data set has the following format.
> N M P
> X1
> ...
> XN
In the first line, N is the number of players to vote for, M is the number of the winning player, and P is an integer representing the deduction rate (percentage). Xi is the number of voting tickets voted for the i-th competitor. It may be assumed that 1 ≤ N ≤ 100, 1 ≤ M ≤ N, 0 ≤ P ≤ 100, 0 ≤ Xi ≤ 1000.
Output
For each dataset, output a line of integers indicating the payout amount per winning voting ticket. Output 0 if no one has won the bet. There must be no other characters on the output line.
Sample Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output for the Sample Input
150
0
112
Example
Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output
150
0
112
Submitted Solution:
```
while True:
n = input().split()
m = [int(i) for i in n]
if m[0] == 0:
break
l = [int(input()) for k in range(m[0])]
count = 0
sumMoney = 0
for count in range(m[0]):
sumMoney += l[count]
money = float(sumMoney * (100 - m[2]))
try:
pey = money / l[m[1] - 1]
print(int(pey))
except ZeroDivisionError :
print('0')
``` | instruction | 0 | 15,013 | 19 | 30,026 |
Yes | output | 1 | 15,013 | 19 | 30,027 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Princess'Gamble
Princess gambling
English text is not available in this practice contest.
One day, a brave princess in a poor country's tomboy broke the walls of her room, escaped from the castle, and entered the gambling hall where horse racing and other gambling were held. However, the princess who had never gambled was very defeated. The princess, who found this situation uninteresting, investigated how gambling was carried out. Then, in such gambling, it was found that the dividend was decided by a method called the parimutuel method.
The parimutuel method is a calculation method used to determine dividends in gambling for races. In this method, all the stakes are pooled, a certain percentage is deducted, and then the amount proportional to the stakes is distributed to the winners.
In the gambling that the princess is currently enthusiastic about, participants buy a 100 gold voting ticket to predict which player will win before the competition and receive a winning prize if the result of the competition matches the prediction. It's about getting the right. Gold is the currency unit of this country. Your job is to write a program that calculates the payout per voting ticket based on the competition information given as input.
If the dividend amount calculated by the above method is not an integer, round it down to an integer.
Input
The input consists of multiple datasets. The number of data sets is 100 or less. After the last dataset, a line of "0 0 0" is given to mark the end of the input.
Each data set has the following format.
> N M P
> X1
> ...
> XN
In the first line, N is the number of players to vote for, M is the number of the winning player, and P is an integer representing the deduction rate (percentage). Xi is the number of voting tickets voted for the i-th competitor. It may be assumed that 1 ≤ N ≤ 100, 1 ≤ M ≤ N, 0 ≤ P ≤ 100, 0 ≤ Xi ≤ 1000.
Output
For each dataset, output a line of integers indicating the payout amount per winning voting ticket. Output 0 if no one has won the bet. There must be no other characters on the output line.
Sample Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output for the Sample Input
150
0
112
Example
Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output
150
0
112
Submitted Solution:
```
def solve(N,M,P,Xs):
if Xs[M-1] == 0:
return 0
total = sum([x*100 for x in Xs])
total *= (100-P)/100
return total / Xs[M-1]
def main():
while True:
N,M,P = map(int,input().split())
if N == 0 and M == 0 and P == 0:
return
Xs = [int(input()) for _ in range(N)]
print(int(solve(N,M,P,Xs)))
if __name__ == '__main__':
main()
``` | instruction | 0 | 15,014 | 19 | 30,028 |
No | output | 1 | 15,014 | 19 | 30,029 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Princess'Gamble
Princess gambling
English text is not available in this practice contest.
One day, a brave princess in a poor country's tomboy broke the walls of her room, escaped from the castle, and entered the gambling hall where horse racing and other gambling were held. However, the princess who had never gambled was very defeated. The princess, who found this situation uninteresting, investigated how gambling was carried out. Then, in such gambling, it was found that the dividend was decided by a method called the parimutuel method.
The parimutuel method is a calculation method used to determine dividends in gambling for races. In this method, all the stakes are pooled, a certain percentage is deducted, and then the amount proportional to the stakes is distributed to the winners.
In the gambling that the princess is currently enthusiastic about, participants buy a 100 gold voting ticket to predict which player will win before the competition and receive a winning prize if the result of the competition matches the prediction. It's about getting the right. Gold is the currency unit of this country. Your job is to write a program that calculates the payout per voting ticket based on the competition information given as input.
If the dividend amount calculated by the above method is not an integer, round it down to an integer.
Input
The input consists of multiple datasets. The number of data sets is 100 or less. After the last dataset, a line of "0 0 0" is given to mark the end of the input.
Each data set has the following format.
> N M P
> X1
> ...
> XN
In the first line, N is the number of players to vote for, M is the number of the winning player, and P is an integer representing the deduction rate (percentage). Xi is the number of voting tickets voted for the i-th competitor. It may be assumed that 1 ≤ N ≤ 100, 1 ≤ M ≤ N, 0 ≤ P ≤ 100, 0 ≤ Xi ≤ 1000.
Output
For each dataset, output a line of integers indicating the payout amount per winning voting ticket. Output 0 if no one has won the bet. There must be no other characters on the output line.
Sample Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output for the Sample Input
150
0
112
Example
Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output
150
0
112
Submitted Solution:
```
while True:
n,m,p = map(int, input().split(" "))
if n+m+p == 0:
break
total = 0
winner = 0
for i in range(1, n+1):
x = int(input())
total += x
if i == m:
winner = x
print(int((1 - p / 100) * 100 * total / winner) if winner > 0 else 0)
``` | instruction | 0 | 15,015 | 19 | 30,030 |
No | output | 1 | 15,015 | 19 | 30,031 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Princess'Gamble
Princess gambling
English text is not available in this practice contest.
One day, a brave princess in a poor country's tomboy broke the walls of her room, escaped from the castle, and entered the gambling hall where horse racing and other gambling were held. However, the princess who had never gambled was very defeated. The princess, who found this situation uninteresting, investigated how gambling was carried out. Then, in such gambling, it was found that the dividend was decided by a method called the parimutuel method.
The parimutuel method is a calculation method used to determine dividends in gambling for races. In this method, all the stakes are pooled, a certain percentage is deducted, and then the amount proportional to the stakes is distributed to the winners.
In the gambling that the princess is currently enthusiastic about, participants buy a 100 gold voting ticket to predict which player will win before the competition and receive a winning prize if the result of the competition matches the prediction. It's about getting the right. Gold is the currency unit of this country. Your job is to write a program that calculates the payout per voting ticket based on the competition information given as input.
If the dividend amount calculated by the above method is not an integer, round it down to an integer.
Input
The input consists of multiple datasets. The number of data sets is 100 or less. After the last dataset, a line of "0 0 0" is given to mark the end of the input.
Each data set has the following format.
> N M P
> X1
> ...
> XN
In the first line, N is the number of players to vote for, M is the number of the winning player, and P is an integer representing the deduction rate (percentage). Xi is the number of voting tickets voted for the i-th competitor. It may be assumed that 1 ≤ N ≤ 100, 1 ≤ M ≤ N, 0 ≤ P ≤ 100, 0 ≤ Xi ≤ 1000.
Output
For each dataset, output a line of integers indicating the payout amount per winning voting ticket. Output 0 if no one has won the bet. There must be no other characters on the output line.
Sample Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output for the Sample Input
150
0
112
Example
Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output
150
0
112
Submitted Solution:
```
#!/usr/bin/env python
# -*- coding: utf-8 -*-
while True:
N,M,P = map(int,input().split(" "))
if N == 0 and M == 0 and P == 0:
break
count = 0
for i in range(N):
x = int(input())
count += x
if i + 1 == M:
hitman = x
if hitman == 0:
print(0)
else:
print(int((count*100)*((100-P)/100)/hitman))
``` | instruction | 0 | 15,016 | 19 | 30,032 |
No | output | 1 | 15,016 | 19 | 30,033 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Princess'Gamble
Princess gambling
English text is not available in this practice contest.
One day, a brave princess in a poor country's tomboy broke the walls of her room, escaped from the castle, and entered the gambling hall where horse racing and other gambling were held. However, the princess who had never gambled was very defeated. The princess, who found this situation uninteresting, investigated how gambling was carried out. Then, in such gambling, it was found that the dividend was decided by a method called the parimutuel method.
The parimutuel method is a calculation method used to determine dividends in gambling for races. In this method, all the stakes are pooled, a certain percentage is deducted, and then the amount proportional to the stakes is distributed to the winners.
In the gambling that the princess is currently enthusiastic about, participants buy a 100 gold voting ticket to predict which player will win before the competition and receive a winning prize if the result of the competition matches the prediction. It's about getting the right. Gold is the currency unit of this country. Your job is to write a program that calculates the payout per voting ticket based on the competition information given as input.
If the dividend amount calculated by the above method is not an integer, round it down to an integer.
Input
The input consists of multiple datasets. The number of data sets is 100 or less. After the last dataset, a line of "0 0 0" is given to mark the end of the input.
Each data set has the following format.
> N M P
> X1
> ...
> XN
In the first line, N is the number of players to vote for, M is the number of the winning player, and P is an integer representing the deduction rate (percentage). Xi is the number of voting tickets voted for the i-th competitor. It may be assumed that 1 ≤ N ≤ 100, 1 ≤ M ≤ N, 0 ≤ P ≤ 100, 0 ≤ Xi ≤ 1000.
Output
For each dataset, output a line of integers indicating the payout amount per winning voting ticket. Output 0 if no one has won the bet. There must be no other characters on the output line.
Sample Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output for the Sample Input
150
0
112
Example
Input
3 2 50
1
2
3
4 4 75
1
2
3
0
3 1 10
8
1
1
0 0 0
Output
150
0
112
Submitted Solution:
```
def solve(N,M,P,Xs):
if N < M or Xs[M-1] == 0:
return 0
return (sum([x*100 for x in Xs]) * (1-P/100)) // Xs[M-1]
def main():
while True:
N,M,P = map(int,input().split())
if N == 0 and M == 0 and P == 0:
return
Xs = [int(input()) for _ in range(N)]
print(int(solve(N,M,P,Xs)))
if __name__ == '__main__':
main()
``` | instruction | 0 | 15,017 | 19 | 30,034 |
No | output | 1 | 15,017 | 19 | 30,035 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n stone quarries in Petrograd.
Each quarry owns mi dumpers (1 ≤ i ≤ n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi + 1 stones in it, the third has xi + 2, and the mi-th dumper (the last for the i-th quarry) has xi + mi - 1 stones in it.
Two oligarchs play a well-known game Nim. Players take turns removing stones from dumpers. On each turn, a player can select any dumper and remove any non-zero amount of stones from it. The player who cannot take a stone loses.
Your task is to find out which oligarch will win, provided that both of them play optimally. The oligarchs asked you not to reveal their names. So, let's call the one who takes the first stone «tolik» and the other one «bolik».
Input
The first line of the input contains one integer number n (1 ≤ n ≤ 105) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1 ≤ xi, mi ≤ 1016) — the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry.
Output
Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.
Examples
Input
2
2 1
3 2
Output
tolik
Input
4
1 1
1 1
1 1
1 1
Output
bolik | instruction | 0 | 15,325 | 19 | 30,650 |
Tags: games
Correct Solution:
```
def f(x):
if x%4==0:
return x
elif x%4==1:
return 1
elif x%4==2:
return x+1
return 0
n = int(input())
res = 0
for i in range(n):
x,m = input().split()
x,m = int(x),int(m)
res ^= f(x-1)^f(x+m-1)
if res == 0:
print("bolik")
else:
print("tolik")
``` | output | 1 | 15,325 | 19 | 30,651 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n stone quarries in Petrograd.
Each quarry owns mi dumpers (1 ≤ i ≤ n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi + 1 stones in it, the third has xi + 2, and the mi-th dumper (the last for the i-th quarry) has xi + mi - 1 stones in it.
Two oligarchs play a well-known game Nim. Players take turns removing stones from dumpers. On each turn, a player can select any dumper and remove any non-zero amount of stones from it. The player who cannot take a stone loses.
Your task is to find out which oligarch will win, provided that both of them play optimally. The oligarchs asked you not to reveal their names. So, let's call the one who takes the first stone «tolik» and the other one «bolik».
Input
The first line of the input contains one integer number n (1 ≤ n ≤ 105) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1 ≤ xi, mi ≤ 1016) — the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry.
Output
Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.
Examples
Input
2
2 1
3 2
Output
tolik
Input
4
1 1
1 1
1 1
1 1
Output
bolik | instruction | 0 | 15,326 | 19 | 30,652 |
Tags: games
Correct Solution:
```
import sys
input = sys.stdin.buffer.readline
def prefix_xor(x):
if x <= 0:
return 0
# assume the we iterate over j from 1 to x
# for first bit to be on j just needs to be odd odd times
tot = (x + 1) >> 1 & 1
# ith bit is on in segments of numbers j...j+(1<<i)-1
# where j has bits in positions less than i = 0
# this means that we only care about the last segment since each segment before it has length 1<<i
# if the length is odd, 1<<i is added to the total xor
tot ^= (x&1^1)*x
return tot
def range_xor(l,d):
r = l + d-1
return prefix_xor(r)^prefix_xor(l-1)
n = int(input())
tot_xor = 0
for i in range(n):
tot_xor ^= range_xor(*list(map(int,input().split())))
if tot_xor:
print("tolik")
else:
print("bolik")
``` | output | 1 | 15,326 | 19 | 30,653 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n stone quarries in Petrograd.
Each quarry owns mi dumpers (1 ≤ i ≤ n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi + 1 stones in it, the third has xi + 2, and the mi-th dumper (the last for the i-th quarry) has xi + mi - 1 stones in it.
Two oligarchs play a well-known game Nim. Players take turns removing stones from dumpers. On each turn, a player can select any dumper and remove any non-zero amount of stones from it. The player who cannot take a stone loses.
Your task is to find out which oligarch will win, provided that both of them play optimally. The oligarchs asked you not to reveal their names. So, let's call the one who takes the first stone «tolik» and the other one «bolik».
Input
The first line of the input contains one integer number n (1 ≤ n ≤ 105) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1 ≤ xi, mi ≤ 1016) — the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry.
Output
Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.
Examples
Input
2
2 1
3 2
Output
tolik
Input
4
1 1
1 1
1 1
1 1
Output
bolik | instruction | 0 | 15,327 | 19 | 30,654 |
Tags: games
Correct Solution:
```
n = int(input())
ans = 0
for _ in range(n):
x,m = map(int, input().split())
if x % 2== 0:
ans ^= ((m >> 1) & 1) ^ ((m & 1) * (x + m - 1))
else:
ans ^= x ^ (((m - 1) >> 1) & 1) ^ (((m - 1 ) & 1) * (x + m - 1))
if ans == 0:
print("bolik")
else:
print("tolik")
``` | output | 1 | 15,327 | 19 | 30,655 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n stone quarries in Petrograd.
Each quarry owns mi dumpers (1 ≤ i ≤ n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi + 1 stones in it, the third has xi + 2, and the mi-th dumper (the last for the i-th quarry) has xi + mi - 1 stones in it.
Two oligarchs play a well-known game Nim. Players take turns removing stones from dumpers. On each turn, a player can select any dumper and remove any non-zero amount of stones from it. The player who cannot take a stone loses.
Your task is to find out which oligarch will win, provided that both of them play optimally. The oligarchs asked you not to reveal their names. So, let's call the one who takes the first stone «tolik» and the other one «bolik».
Input
The first line of the input contains one integer number n (1 ≤ n ≤ 105) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1 ≤ xi, mi ≤ 1016) — the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry.
Output
Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.
Examples
Input
2
2 1
3 2
Output
tolik
Input
4
1 1
1 1
1 1
1 1
Output
bolik | instruction | 0 | 15,328 | 19 | 30,656 |
Tags: games
Correct Solution:
```
__author__ = 'Darren'
def solve():
n = int(input())
xor = 0
for _i in range(n):
x, m = map(int, input().split())
xor ^= xor_range(x - 1) ^ xor_range(x + m - 1)
print(["tolik", "bolik"][xor == 0])
def xor_range(n):
return [n, 1, n+1, 0][n % 4]
if __name__ == '__main__':
solve()
# Made By Mostafa_Khaled
``` | output | 1 | 15,328 | 19 | 30,657 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n stone quarries in Petrograd.
Each quarry owns mi dumpers (1 ≤ i ≤ n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi + 1 stones in it, the third has xi + 2, and the mi-th dumper (the last for the i-th quarry) has xi + mi - 1 stones in it.
Two oligarchs play a well-known game Nim. Players take turns removing stones from dumpers. On each turn, a player can select any dumper and remove any non-zero amount of stones from it. The player who cannot take a stone loses.
Your task is to find out which oligarch will win, provided that both of them play optimally. The oligarchs asked you not to reveal their names. So, let's call the one who takes the first stone «tolik» and the other one «bolik».
Input
The first line of the input contains one integer number n (1 ≤ n ≤ 105) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1 ≤ xi, mi ≤ 1016) — the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry.
Output
Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.
Examples
Input
2
2 1
3 2
Output
tolik
Input
4
1 1
1 1
1 1
1 1
Output
bolik | instruction | 0 | 15,329 | 19 | 30,658 |
Tags: games
Correct Solution:
```
__author__ = 'Darren'
def solve():
n = int(input())
xor = 0
for _i in range(n):
x, m = map(int, input().split())
xor ^= xor_range(x - 1) ^ xor_range(x + m - 1)
print(["tolik", "bolik"][xor == 0])
def xor_range(n):
return [n, 1, n+1, 0][n % 4]
if __name__ == '__main__':
solve()
``` | output | 1 | 15,329 | 19 | 30,659 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n stone quarries in Petrograd.
Each quarry owns mi dumpers (1 ≤ i ≤ n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi + 1 stones in it, the third has xi + 2, and the mi-th dumper (the last for the i-th quarry) has xi + mi - 1 stones in it.
Two oligarchs play a well-known game Nim. Players take turns removing stones from dumpers. On each turn, a player can select any dumper and remove any non-zero amount of stones from it. The player who cannot take a stone loses.
Your task is to find out which oligarch will win, provided that both of them play optimally. The oligarchs asked you not to reveal their names. So, let's call the one who takes the first stone «tolik» and the other one «bolik».
Input
The first line of the input contains one integer number n (1 ≤ n ≤ 105) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1 ≤ xi, mi ≤ 1016) — the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry.
Output
Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.
Examples
Input
2
2 1
3 2
Output
tolik
Input
4
1 1
1 1
1 1
1 1
Output
bolik | instruction | 0 | 15,330 | 19 | 30,660 |
Tags: games
Correct Solution:
```
n = int(input())
f = lambda x: [x,1,x+1,0][x%4]
r = lambda a,b: f(a+b-1)^f(a-1)
import operator, itertools, functools
nim = functools.reduce(operator.xor, itertools.starmap(r,
(map(int,input().split()) for _ in range(n))))
print(("bolik","tolik")[nim > 0])
``` | output | 1 | 15,330 | 19 | 30,661 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n stone quarries in Petrograd.
Each quarry owns mi dumpers (1 ≤ i ≤ n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi + 1 stones in it, the third has xi + 2, and the mi-th dumper (the last for the i-th quarry) has xi + mi - 1 stones in it.
Two oligarchs play a well-known game Nim. Players take turns removing stones from dumpers. On each turn, a player can select any dumper and remove any non-zero amount of stones from it. The player who cannot take a stone loses.
Your task is to find out which oligarch will win, provided that both of them play optimally. The oligarchs asked you not to reveal their names. So, let's call the one who takes the first stone «tolik» and the other one «bolik».
Input
The first line of the input contains one integer number n (1 ≤ n ≤ 105) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1 ≤ xi, mi ≤ 1016) — the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry.
Output
Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.
Examples
Input
2
2 1
3 2
Output
tolik
Input
4
1 1
1 1
1 1
1 1
Output
bolik | instruction | 0 | 15,331 | 19 | 30,662 |
Tags: games
Correct Solution:
```
import math
import time
from collections import defaultdict,deque,Counter
from sys import stdin,stdout
from bisect import bisect_left,bisect_right
from queue import PriorityQueue
import sys
def xor(x):
ch=x&3
if(ch==1):
return 1
if(ch==2):
return x+1
if(ch==3):
return 0
return x
n=int(input())
ans=0
for _ in range(n):
x,m=map(int,stdin.readline().split())
ans^=xor(x+m-1)^xor(x-1)
if(ans==0):
print("bolik")
else:
print("tolik")
``` | output | 1 | 15,331 | 19 | 30,663 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n stone quarries in Petrograd.
Each quarry owns mi dumpers (1 ≤ i ≤ n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi + 1 stones in it, the third has xi + 2, and the mi-th dumper (the last for the i-th quarry) has xi + mi - 1 stones in it.
Two oligarchs play a well-known game Nim. Players take turns removing stones from dumpers. On each turn, a player can select any dumper and remove any non-zero amount of stones from it. The player who cannot take a stone loses.
Your task is to find out which oligarch will win, provided that both of them play optimally. The oligarchs asked you not to reveal their names. So, let's call the one who takes the first stone «tolik» and the other one «bolik».
Input
The first line of the input contains one integer number n (1 ≤ n ≤ 105) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1 ≤ xi, mi ≤ 1016) — the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry.
Output
Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.
Examples
Input
2
2 1
3 2
Output
tolik
Input
4
1 1
1 1
1 1
1 1
Output
bolik | instruction | 0 | 15,332 | 19 | 30,664 |
Tags: games
Correct Solution:
```
def f(x):
if x%4==1:return x-1
if x%4==2:return 1
if x%4==3:return x
return 0
n=int(input())
k=0
for i in range(n):
a,b=input().split()
k^=f(int(a))^f(int(a)+int(b))
if k==0:
print("bolik")
else:
print("tolik")
``` | output | 1 | 15,332 | 19 | 30,665 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n stone quarries in Petrograd.
Each quarry owns mi dumpers (1 ≤ i ≤ n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi + 1 stones in it, the third has xi + 2, and the mi-th dumper (the last for the i-th quarry) has xi + mi - 1 stones in it.
Two oligarchs play a well-known game Nim. Players take turns removing stones from dumpers. On each turn, a player can select any dumper and remove any non-zero amount of stones from it. The player who cannot take a stone loses.
Your task is to find out which oligarch will win, provided that both of them play optimally. The oligarchs asked you not to reveal their names. So, let's call the one who takes the first stone «tolik» and the other one «bolik».
Input
The first line of the input contains one integer number n (1 ≤ n ≤ 105) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1 ≤ xi, mi ≤ 1016) — the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry.
Output
Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.
Examples
Input
2
2 1
3 2
Output
tolik
Input
4
1 1
1 1
1 1
1 1
Output
bolik
Submitted Solution:
```
def f(x):
if x % 4 == 1:
return x - 1
if x % 4 == 2:
return 1
if x % 4 == 3:
return x
return 0
n = int(input())
k = 0
for i in range(n):
a, b = input().split()
k ^= f(int(a)) ^ f(int(a)+int(b))
print("bolik" if k == 0 else "tolik")
``` | instruction | 0 | 15,333 | 19 | 30,666 |
Yes | output | 1 | 15,333 | 19 | 30,667 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n stone quarries in Petrograd.
Each quarry owns mi dumpers (1 ≤ i ≤ n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi + 1 stones in it, the third has xi + 2, and the mi-th dumper (the last for the i-th quarry) has xi + mi - 1 stones in it.
Two oligarchs play a well-known game Nim. Players take turns removing stones from dumpers. On each turn, a player can select any dumper and remove any non-zero amount of stones from it. The player who cannot take a stone loses.
Your task is to find out which oligarch will win, provided that both of them play optimally. The oligarchs asked you not to reveal their names. So, let's call the one who takes the first stone «tolik» and the other one «bolik».
Input
The first line of the input contains one integer number n (1 ≤ n ≤ 105) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1 ≤ xi, mi ≤ 1016) — the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry.
Output
Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.
Examples
Input
2
2 1
3 2
Output
tolik
Input
4
1 1
1 1
1 1
1 1
Output
bolik
Submitted Solution:
```
def f(x):
if x%4==1:return x-1
if x%4==2:return 1
if x%4==3:return x
return 0
n=int(input())
k=0
for i in range(n):
a,b=input().split()
k^=f(int(a))^f(int(a)+int(b))
if k==0:print('bolik')
else:print('tolik')
``` | instruction | 0 | 15,334 | 19 | 30,668 |
Yes | output | 1 | 15,334 | 19 | 30,669 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n stone quarries in Petrograd.
Each quarry owns mi dumpers (1 ≤ i ≤ n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi + 1 stones in it, the third has xi + 2, and the mi-th dumper (the last for the i-th quarry) has xi + mi - 1 stones in it.
Two oligarchs play a well-known game Nim. Players take turns removing stones from dumpers. On each turn, a player can select any dumper and remove any non-zero amount of stones from it. The player who cannot take a stone loses.
Your task is to find out which oligarch will win, provided that both of them play optimally. The oligarchs asked you not to reveal their names. So, let's call the one who takes the first stone «tolik» and the other one «bolik».
Input
The first line of the input contains one integer number n (1 ≤ n ≤ 105) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1 ≤ xi, mi ≤ 1016) — the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry.
Output
Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.
Examples
Input
2
2 1
3 2
Output
tolik
Input
4
1 1
1 1
1 1
1 1
Output
bolik
Submitted Solution:
```
def test(n):
if n % 4 == 0:
return n
elif n % 4 == 1:
return 1
elif n % 4 == 2:
return n + 1
else:
return 0
n = int(input())
s = 0
for i in range(n):
x, m = map(int, input().split())
count = 0
s ^= test(x + m - 1) ^ test(x - 1)
if s == 0:
print("bolik")
else:
print("tolik")
``` | instruction | 0 | 15,335 | 19 | 30,670 |
Yes | output | 1 | 15,335 | 19 | 30,671 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n stone quarries in Petrograd.
Each quarry owns mi dumpers (1 ≤ i ≤ n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi + 1 stones in it, the third has xi + 2, and the mi-th dumper (the last for the i-th quarry) has xi + mi - 1 stones in it.
Two oligarchs play a well-known game Nim. Players take turns removing stones from dumpers. On each turn, a player can select any dumper and remove any non-zero amount of stones from it. The player who cannot take a stone loses.
Your task is to find out which oligarch will win, provided that both of them play optimally. The oligarchs asked you not to reveal their names. So, let's call the one who takes the first stone «tolik» and the other one «bolik».
Input
The first line of the input contains one integer number n (1 ≤ n ≤ 105) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1 ≤ xi, mi ≤ 1016) — the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry.
Output
Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.
Examples
Input
2
2 1
3 2
Output
tolik
Input
4
1 1
1 1
1 1
1 1
Output
bolik
Submitted Solution:
```
def f(a):
res = [a, 1, a + 1, 0]
return res[a % 4]
def xorRange(a, b):
return f(b) ^ f(a - 1)
i = int(input())
currentResult = 0
for _ in range(i):
line = input().split(" ")
a = int(line[0])
b = int(line[1])
currentResult ^= xorRange(a, a + b - 1)
if currentResult == 0:
print("bolik")
else:
print("tolik")
``` | instruction | 0 | 15,336 | 19 | 30,672 |
Yes | output | 1 | 15,336 | 19 | 30,673 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n stone quarries in Petrograd.
Each quarry owns mi dumpers (1 ≤ i ≤ n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi + 1 stones in it, the third has xi + 2, and the mi-th dumper (the last for the i-th quarry) has xi + mi - 1 stones in it.
Two oligarchs play a well-known game Nim. Players take turns removing stones from dumpers. On each turn, a player can select any dumper and remove any non-zero amount of stones from it. The player who cannot take a stone loses.
Your task is to find out which oligarch will win, provided that both of them play optimally. The oligarchs asked you not to reveal their names. So, let's call the one who takes the first stone «tolik» and the other one «bolik».
Input
The first line of the input contains one integer number n (1 ≤ n ≤ 105) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1 ≤ xi, mi ≤ 1016) — the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry.
Output
Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.
Examples
Input
2
2 1
3 2
Output
tolik
Input
4
1 1
1 1
1 1
1 1
Output
bolik
Submitted Solution:
```
def ilo(a, b):
return True if a[0] * b[1] - a[1] * b[0] == 0 else False
def check(a, b, l):
t = []
for i in l:
if ilo((b[0] - a[0], b[1] - a[1]), (i[0] - a[0], i[1] - a[1])) == False:
t.append(i)
if len(t) < 3:
return True
else:
x = t[0]
y = t[1]
for i in range(2, len(t)):
z = t[i]
if ilo((y[0] - x[0], y[1] - x[1]), (z[0] - x[0], z[1] - x[1])) == False:
return False
return True
n = int(input())
l = []
for i in range(n):
a, b = input().split()
l.append((int(a), int(b)))
if n < 3:
print("YES")
else:
if check(l[0], l[1], l) or check(l[0], l[2], l) or check(l[1], l[2], l):
print("YES")
else:
print("NO")
``` | instruction | 0 | 15,337 | 19 | 30,674 |
No | output | 1 | 15,337 | 19 | 30,675 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n stone quarries in Petrograd.
Each quarry owns mi dumpers (1 ≤ i ≤ n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi + 1 stones in it, the third has xi + 2, and the mi-th dumper (the last for the i-th quarry) has xi + mi - 1 stones in it.
Two oligarchs play a well-known game Nim. Players take turns removing stones from dumpers. On each turn, a player can select any dumper and remove any non-zero amount of stones from it. The player who cannot take a stone loses.
Your task is to find out which oligarch will win, provided that both of them play optimally. The oligarchs asked you not to reveal their names. So, let's call the one who takes the first stone «tolik» and the other one «bolik».
Input
The first line of the input contains one integer number n (1 ≤ n ≤ 105) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1 ≤ xi, mi ≤ 1016) — the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry.
Output
Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.
Examples
Input
2
2 1
3 2
Output
tolik
Input
4
1 1
1 1
1 1
1 1
Output
bolik
Submitted Solution:
```
n = int(input())
ans = 0
for _ in range(n):
x,m = map(int, input().split())
if x % 4 == 1:
ans ^= (((x ^ 1) ^ (x + 3)) * (m & 4))
elif x % 4 == 3:
ans ^= (((x ^ 3) ^ (x + 1)) * (m & 4))
for i in range(1, (m % 4) + 1):
ans ^= (x + m - i)
if ans == 0:
print("bolik")
else:
print("tolik")
``` | instruction | 0 | 15,338 | 19 | 30,676 |
No | output | 1 | 15,338 | 19 | 30,677 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n stone quarries in Petrograd.
Each quarry owns mi dumpers (1 ≤ i ≤ n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi + 1 stones in it, the third has xi + 2, and the mi-th dumper (the last for the i-th quarry) has xi + mi - 1 stones in it.
Two oligarchs play a well-known game Nim. Players take turns removing stones from dumpers. On each turn, a player can select any dumper and remove any non-zero amount of stones from it. The player who cannot take a stone loses.
Your task is to find out which oligarch will win, provided that both of them play optimally. The oligarchs asked you not to reveal their names. So, let's call the one who takes the first stone «tolik» and the other one «bolik».
Input
The first line of the input contains one integer number n (1 ≤ n ≤ 105) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1 ≤ xi, mi ≤ 1016) — the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry.
Output
Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.
Examples
Input
2
2 1
3 2
Output
tolik
Input
4
1 1
1 1
1 1
1 1
Output
bolik
Submitted Solution:
```
n = input()
n = int(n)
ans = 0
for i in range(0, n):
x, m = map(int, input().split())
end = x+m-1
if x % 2 == 1:
ans ^= x
x = x+1
m = m-1
if m == 0:
continue;
if m % 2 == 1:
ans ^= 1
if end % 2 == 0:
ans ^= end
if ans == 0:
print('bolik')
else:
print('tolik')
``` | instruction | 0 | 15,339 | 19 | 30,678 |
No | output | 1 | 15,339 | 19 | 30,679 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n stone quarries in Petrograd.
Each quarry owns mi dumpers (1 ≤ i ≤ n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi + 1 stones in it, the third has xi + 2, and the mi-th dumper (the last for the i-th quarry) has xi + mi - 1 stones in it.
Two oligarchs play a well-known game Nim. Players take turns removing stones from dumpers. On each turn, a player can select any dumper and remove any non-zero amount of stones from it. The player who cannot take a stone loses.
Your task is to find out which oligarch will win, provided that both of them play optimally. The oligarchs asked you not to reveal their names. So, let's call the one who takes the first stone «tolik» and the other one «bolik».
Input
The first line of the input contains one integer number n (1 ≤ n ≤ 105) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1 ≤ xi, mi ≤ 1016) — the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry.
Output
Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.
Examples
Input
2
2 1
3 2
Output
tolik
Input
4
1 1
1 1
1 1
1 1
Output
bolik
Submitted Solution:
```
def prefix_xor(x):
if x <= 0:
return 0
# assume the we iterate over j from 1 to x
tot = (x+1)>>1&1 # for first bit to be on j just needs to be odd odd times
for i in range(1,60):
# for every other bit realize that the bit is on first when j is even then on again if j+1 != x
# this cycle continues until j+1 does not have this bit on then it start again when j has the bit on again
# cycles have even length of course
# this means that if x is even, the bit will be on odd times and vice versa
if (1<<i) > x:
break
tot += (x&1^1)*(1<<i)
return tot
def range_xor(l,d):
r = l + d-1
return prefix_xor(r)^prefix_xor(l-1)
n = int(input())
tot_xor = 0
for i in range(n):
tot_xor ^= range_xor(*list(map(int,input().split())))
if tot_xor:
print("tolik")
else:
print("bolik")
``` | instruction | 0 | 15,340 | 19 | 30,680 |
No | output | 1 | 15,340 | 19 | 30,681 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's holiday. Mashmokh and his boss, Bimokh, are playing a game invented by Mashmokh.
In this game Mashmokh writes sequence of n distinct integers on the board. Then Bimokh makes several (possibly zero) moves. On the first move he removes the first and the second integer from from the board, on the second move he removes the first and the second integer of the remaining sequence from the board, and so on. Bimokh stops when the board contains less than two numbers. When Bimokh removes numbers x and y from the board, he gets gcd(x, y) points. At the beginning of the game Bimokh has zero points.
Mashmokh wants to win in the game. For this reason he wants his boss to get exactly k points in total. But the guy doesn't know how choose the initial sequence in the right way.
Please, help him. Find n distinct integers a1, a2, ..., an such that his boss will score exactly k points. Also Mashmokh can't memorize too huge numbers. Therefore each of these integers must be at most 109.
Input
The first line of input contains two space-separated integers n, k (1 ≤ n ≤ 105; 0 ≤ k ≤ 108).
Output
If such sequence doesn't exist output -1 otherwise output n distinct space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Examples
Input
5 2
Output
1 2 3 4 5
Input
5 3
Output
2 4 3 7 1
Input
7 2
Output
-1
Note
gcd(x, y) is greatest common divisor of x and y. | instruction | 0 | 15,411 | 19 | 30,822 |
Tags: constructive algorithms, number theory
Correct Solution:
```
# Made By Mostafa_Khaled
bot = True
n, k = map(int, input().split())
if k == 0 and n == 1:
print(1)
elif n // 2 > k or n == 1:
print(-1)
else:
x = (k - n // 2 + 1)
print(x, x * 2, *range(x * 2 + 1, x * 2 + 1 + n - 2))
# Made By Mostafa_Khaled
``` | output | 1 | 15,411 | 19 | 30,823 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's holiday. Mashmokh and his boss, Bimokh, are playing a game invented by Mashmokh.
In this game Mashmokh writes sequence of n distinct integers on the board. Then Bimokh makes several (possibly zero) moves. On the first move he removes the first and the second integer from from the board, on the second move he removes the first and the second integer of the remaining sequence from the board, and so on. Bimokh stops when the board contains less than two numbers. When Bimokh removes numbers x and y from the board, he gets gcd(x, y) points. At the beginning of the game Bimokh has zero points.
Mashmokh wants to win in the game. For this reason he wants his boss to get exactly k points in total. But the guy doesn't know how choose the initial sequence in the right way.
Please, help him. Find n distinct integers a1, a2, ..., an such that his boss will score exactly k points. Also Mashmokh can't memorize too huge numbers. Therefore each of these integers must be at most 109.
Input
The first line of input contains two space-separated integers n, k (1 ≤ n ≤ 105; 0 ≤ k ≤ 108).
Output
If such sequence doesn't exist output -1 otherwise output n distinct space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Examples
Input
5 2
Output
1 2 3 4 5
Input
5 3
Output
2 4 3 7 1
Input
7 2
Output
-1
Note
gcd(x, y) is greatest common divisor of x and y. | instruction | 0 | 15,413 | 19 | 30,826 |
Tags: constructive algorithms, number theory
Correct Solution:
```
import sys
[n,k] = map(int, sys.stdin.readline().split())
def solve():
# global n
# nx = n
# n = 2 * (n//2)
if n == 1 and k == 0:
print(1)
return
if n == 1 and k > 0:
print(-1)
return
if n//2 > k:
print(-1)
return
rest = k - n//2
# if rest > 0:
print(rest+1, end=" ")
print(2*rest+2, end=" ")
for i in range(2*rest+3, n + 2*rest+3-2):
print(i, end=" ")
# else:
# for i in range(1, n+1):
# print(i, end=" ")
print()
solve()
``` | output | 1 | 15,413 | 19 | 30,827 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's holiday. Mashmokh and his boss, Bimokh, are playing a game invented by Mashmokh.
In this game Mashmokh writes sequence of n distinct integers on the board. Then Bimokh makes several (possibly zero) moves. On the first move he removes the first and the second integer from from the board, on the second move he removes the first and the second integer of the remaining sequence from the board, and so on. Bimokh stops when the board contains less than two numbers. When Bimokh removes numbers x and y from the board, he gets gcd(x, y) points. At the beginning of the game Bimokh has zero points.
Mashmokh wants to win in the game. For this reason he wants his boss to get exactly k points in total. But the guy doesn't know how choose the initial sequence in the right way.
Please, help him. Find n distinct integers a1, a2, ..., an such that his boss will score exactly k points. Also Mashmokh can't memorize too huge numbers. Therefore each of these integers must be at most 109.
Input
The first line of input contains two space-separated integers n, k (1 ≤ n ≤ 105; 0 ≤ k ≤ 108).
Output
If such sequence doesn't exist output -1 otherwise output n distinct space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Examples
Input
5 2
Output
1 2 3 4 5
Input
5 3
Output
2 4 3 7 1
Input
7 2
Output
-1
Note
gcd(x, y) is greatest common divisor of x and y. | instruction | 0 | 15,414 | 19 | 30,828 |
Tags: constructive algorithms, number theory
Correct Solution:
```
n, k = map(int, input().split())
if n % 2:
pairs = (n-1)//2
else:
pairs = n//2
if pairs > k or (not pairs and k > 0):
print(-1)
else:
if pairs < k:
answer = [k-pairs+1, (k-pairs+1)*2]
answer += [i for i in range(answer[1]+1, answer[1]+n-1)]
else:
answer = [i for i in range(1, n+1)]
print(' '.join(map(str, answer)))
``` | output | 1 | 15,414 | 19 | 30,829 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's holiday. Mashmokh and his boss, Bimokh, are playing a game invented by Mashmokh.
In this game Mashmokh writes sequence of n distinct integers on the board. Then Bimokh makes several (possibly zero) moves. On the first move he removes the first and the second integer from from the board, on the second move he removes the first and the second integer of the remaining sequence from the board, and so on. Bimokh stops when the board contains less than two numbers. When Bimokh removes numbers x and y from the board, he gets gcd(x, y) points. At the beginning of the game Bimokh has zero points.
Mashmokh wants to win in the game. For this reason he wants his boss to get exactly k points in total. But the guy doesn't know how choose the initial sequence in the right way.
Please, help him. Find n distinct integers a1, a2, ..., an such that his boss will score exactly k points. Also Mashmokh can't memorize too huge numbers. Therefore each of these integers must be at most 109.
Input
The first line of input contains two space-separated integers n, k (1 ≤ n ≤ 105; 0 ≤ k ≤ 108).
Output
If such sequence doesn't exist output -1 otherwise output n distinct space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Examples
Input
5 2
Output
1 2 3 4 5
Input
5 3
Output
2 4 3 7 1
Input
7 2
Output
-1
Note
gcd(x, y) is greatest common divisor of x and y. | instruction | 0 | 15,415 | 19 | 30,830 |
Tags: constructive algorithms, number theory
Correct Solution:
```
n, k = map(int, input().split())
if n // 2 > k:
print(-1)
elif n == 1 and k != 0:
print(-1)
elif n == 1 and k == 0:
print(1)
else:
a = n // 2 - 1
for i in range(1, a + 1):
print(2 * i - 1, 2 * i, end=' ')
print((k - a) * 3 + 4 * a - (4 * a) % (k - a), 4 * a - (4 * a) % (k - a) + (k - a) * 4, end=' ')
if n % 2:
print(998244353)
``` | output | 1 | 15,415 | 19 | 30,831 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's holiday. Mashmokh and his boss, Bimokh, are playing a game invented by Mashmokh.
In this game Mashmokh writes sequence of n distinct integers on the board. Then Bimokh makes several (possibly zero) moves. On the first move he removes the first and the second integer from from the board, on the second move he removes the first and the second integer of the remaining sequence from the board, and so on. Bimokh stops when the board contains less than two numbers. When Bimokh removes numbers x and y from the board, he gets gcd(x, y) points. At the beginning of the game Bimokh has zero points.
Mashmokh wants to win in the game. For this reason he wants his boss to get exactly k points in total. But the guy doesn't know how choose the initial sequence in the right way.
Please, help him. Find n distinct integers a1, a2, ..., an such that his boss will score exactly k points. Also Mashmokh can't memorize too huge numbers. Therefore each of these integers must be at most 109.
Input
The first line of input contains two space-separated integers n, k (1 ≤ n ≤ 105; 0 ≤ k ≤ 108).
Output
If such sequence doesn't exist output -1 otherwise output n distinct space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Examples
Input
5 2
Output
1 2 3 4 5
Input
5 3
Output
2 4 3 7 1
Input
7 2
Output
-1
Note
gcd(x, y) is greatest common divisor of x and y. | instruction | 0 | 15,416 | 19 | 30,832 |
Tags: constructive algorithms, number theory
Correct Solution:
```
n,k=map(int,input().split())
if n==1:
if k==0:
print(1)
else:
print(-1)
elif k<n//2:
print(-1)
else:
z=k-((n-2)//2)
print(z,z*2,end=' ')
for i in range(2,n):
print(2*z+i,end=' ')
``` | output | 1 | 15,416 | 19 | 30,833 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's holiday. Mashmokh and his boss, Bimokh, are playing a game invented by Mashmokh.
In this game Mashmokh writes sequence of n distinct integers on the board. Then Bimokh makes several (possibly zero) moves. On the first move he removes the first and the second integer from from the board, on the second move he removes the first and the second integer of the remaining sequence from the board, and so on. Bimokh stops when the board contains less than two numbers. When Bimokh removes numbers x and y from the board, he gets gcd(x, y) points. At the beginning of the game Bimokh has zero points.
Mashmokh wants to win in the game. For this reason he wants his boss to get exactly k points in total. But the guy doesn't know how choose the initial sequence in the right way.
Please, help him. Find n distinct integers a1, a2, ..., an such that his boss will score exactly k points. Also Mashmokh can't memorize too huge numbers. Therefore each of these integers must be at most 109.
Input
The first line of input contains two space-separated integers n, k (1 ≤ n ≤ 105; 0 ≤ k ≤ 108).
Output
If such sequence doesn't exist output -1 otherwise output n distinct space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Examples
Input
5 2
Output
1 2 3 4 5
Input
5 3
Output
2 4 3 7 1
Input
7 2
Output
-1
Note
gcd(x, y) is greatest common divisor of x and y. | instruction | 0 | 15,417 | 19 | 30,834 |
Tags: constructive algorithms, number theory
Correct Solution:
```
# 414A
from sys import stdin
__author__ = 'artyom'
n, k = list(map(int, stdin.readline().strip().split()))
if n == 1:
if k == 0:
print(1)
else:
print(-1)
exit()
pairs = n // 2
if k < pairs:
print(-1)
exit()
x, y = 1, 2
if k > pairs:
x = k - pairs + 1
y = x * 2
print(x, end=' ')
print(y, end=' ')
if n > 2:
for i in range(y + 1, y + n - 2):
print(i, end=' ')
print(y + n - 2)
``` | output | 1 | 15,417 | 19 | 30,835 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's holiday. Mashmokh and his boss, Bimokh, are playing a game invented by Mashmokh.
In this game Mashmokh writes sequence of n distinct integers on the board. Then Bimokh makes several (possibly zero) moves. On the first move he removes the first and the second integer from from the board, on the second move he removes the first and the second integer of the remaining sequence from the board, and so on. Bimokh stops when the board contains less than two numbers. When Bimokh removes numbers x and y from the board, he gets gcd(x, y) points. At the beginning of the game Bimokh has zero points.
Mashmokh wants to win in the game. For this reason he wants his boss to get exactly k points in total. But the guy doesn't know how choose the initial sequence in the right way.
Please, help him. Find n distinct integers a1, a2, ..., an such that his boss will score exactly k points. Also Mashmokh can't memorize too huge numbers. Therefore each of these integers must be at most 109.
Input
The first line of input contains two space-separated integers n, k (1 ≤ n ≤ 105; 0 ≤ k ≤ 108).
Output
If such sequence doesn't exist output -1 otherwise output n distinct space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Examples
Input
5 2
Output
1 2 3 4 5
Input
5 3
Output
2 4 3 7 1
Input
7 2
Output
-1
Note
gcd(x, y) is greatest common divisor of x and y. | instruction | 0 | 15,418 | 19 | 30,836 |
Tags: constructive algorithms, number theory
Correct Solution:
```
import time,math as mt,bisect,sys
from sys import stdin,stdout
from collections import deque
from fractions import Fraction
from collections import Counter
from collections import OrderedDict
pi=3.14159265358979323846264338327950
def II(): # to take integer input
return int(stdin.readline())
def IO(): # to take string input
return stdin.readline()
def IP(): # to take tuple as input
return map(int,stdin.readline().split())
def L(): # to take list as input
return list(map(int,stdin.readline().split()))
def P(x): # to print integer,list,string etc..
return stdout.write(str(x)+"\n")
def PI(x,y): # to print tuple separatedly
return stdout.write(str(x)+" "+str(y)+"\n")
def lcm(a,b): # to calculate lcm
return (a*b)//gcd(a,b)
def gcd(a,b): # to calculate gcd
if a==0:
return b
elif b==0:
return a
if a>b:
return gcd(a%b,b)
else:
return gcd(a,b%a)
def readTree(): # to read tree
v=int(input())
adj=[set() for i in range(v+1)]
for i in range(v-1):
u1,u2=In()
adj[u1].add(u2)
adj[u2].add(u1)
return adj,v
def bfs(adj,v): # a schema of bfs
visited=[False]*(v+1)
q=deque()
while q:
pass
def sieve():
li=[True]*1000001
li[0],li[1]=False,False
for i in range(2,len(li),1):
if li[i]==True:
for j in range(i*i,len(li),i):
li[j]=False
prime=[]
for i in range(1000001):
if li[i]==True:
prime.append(i)
return prime
def setBit(n):
count=0
while n!=0:
n=n&(n-1)
count+=1
return count
mx=10**7
spf=[mx]*(mx+1)
def SPF():
spf[1]=1
for i in range(2,mx+1):
if spf[i]==mx:
spf[i]=i
for j in range(i*i,mx+1,i):
if i<spf[j]:
spf[j]=i
return
#####################################################################################
mod=10**9+7
def solve():
n,k=IP()
if n==1:
if k==0:
P(1)
return
P(-1)
return
if k==0:
P(-1)
return
y=k-(n-2)//2
li=[]
if (n-2)//2<k:
li.append(y)
li.append(y*2)
for i in range(y*2+1,y*2+n-1):
li.append(i)
print(*li)
return
P(-1)
return
solve()
#######
#
#
####### # # # #### # # #
# # # # # # # # # # #
# #### # # #### #### # #
###### # # #### # # # # #
``` | output | 1 | 15,418 | 19 | 30,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's holiday. Mashmokh and his boss, Bimokh, are playing a game invented by Mashmokh.
In this game Mashmokh writes sequence of n distinct integers on the board. Then Bimokh makes several (possibly zero) moves. On the first move he removes the first and the second integer from from the board, on the second move he removes the first and the second integer of the remaining sequence from the board, and so on. Bimokh stops when the board contains less than two numbers. When Bimokh removes numbers x and y from the board, he gets gcd(x, y) points. At the beginning of the game Bimokh has zero points.
Mashmokh wants to win in the game. For this reason he wants his boss to get exactly k points in total. But the guy doesn't know how choose the initial sequence in the right way.
Please, help him. Find n distinct integers a1, a2, ..., an such that his boss will score exactly k points. Also Mashmokh can't memorize too huge numbers. Therefore each of these integers must be at most 109.
Input
The first line of input contains two space-separated integers n, k (1 ≤ n ≤ 105; 0 ≤ k ≤ 108).
Output
If such sequence doesn't exist output -1 otherwise output n distinct space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Examples
Input
5 2
Output
1 2 3 4 5
Input
5 3
Output
2 4 3 7 1
Input
7 2
Output
-1
Note
gcd(x, y) is greatest common divisor of x and y.
Submitted Solution:
```
import sys
from math import log2,floor,ceil,sqrt,gcd
import bisect
# from collections import deque
sys.setrecursionlimit(10**5)
Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
INF = 10 ** 18
MOD = 1000000007
n,k= Ri()
odd = False
if n%2 == 1:
n-=1
odd = True
if n//2 > k or (n == 0 and k != 0):
print(-1)
elif n == 0 and k == 0:
print(1)
else:
k = k-n//2+1
print(k,end=" ")
print(2*k,end=" ")
maxx = 2*k+1
for i in range(n//2-1):
print(maxx,end = " ")
maxx+=1
print(maxx,end= " ")
maxx+=1
if odd:
print(maxx,end = " ")
``` | instruction | 0 | 15,419 | 19 | 30,838 |
Yes | output | 1 | 15,419 | 19 | 30,839 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's holiday. Mashmokh and his boss, Bimokh, are playing a game invented by Mashmokh.
In this game Mashmokh writes sequence of n distinct integers on the board. Then Bimokh makes several (possibly zero) moves. On the first move he removes the first and the second integer from from the board, on the second move he removes the first and the second integer of the remaining sequence from the board, and so on. Bimokh stops when the board contains less than two numbers. When Bimokh removes numbers x and y from the board, he gets gcd(x, y) points. At the beginning of the game Bimokh has zero points.
Mashmokh wants to win in the game. For this reason he wants his boss to get exactly k points in total. But the guy doesn't know how choose the initial sequence in the right way.
Please, help him. Find n distinct integers a1, a2, ..., an such that his boss will score exactly k points. Also Mashmokh can't memorize too huge numbers. Therefore each of these integers must be at most 109.
Input
The first line of input contains two space-separated integers n, k (1 ≤ n ≤ 105; 0 ≤ k ≤ 108).
Output
If such sequence doesn't exist output -1 otherwise output n distinct space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Examples
Input
5 2
Output
1 2 3 4 5
Input
5 3
Output
2 4 3 7 1
Input
7 2
Output
-1
Note
gcd(x, y) is greatest common divisor of x and y.
Submitted Solution:
```
from math import log, ceil
from collections import defaultdict
n,k = [int(x) for x in input().split()]
l = [i for i in range(1,n+1)]
d = k - n//2 + 1
if (n//2>k):
print(-1)
elif n==1:
if k==0:
print(1)
else:
print(-1)
else:
d = k-n//2+1
l[0] = d
l[1] = 2*d
for i in range(2,n):
l[i] = l[i-1]+1
print(*l)
``` | instruction | 0 | 15,420 | 19 | 30,840 |
Yes | output | 1 | 15,420 | 19 | 30,841 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.