text stringlengths 198 433k | conversation_id int64 0 109k |
|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:
* The first term s is given as input.
* Let f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.
* a_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.
Find the minimum integer m that satisfies the following condition:
* There exists an integer n such that a_m = a_n (m > n).
Constraints
* 1 \leq s \leq 100
* All values in input are integers.
* It is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.
Input
Input is given from Standard Input in the following format:
s
Output
Print the minimum integer m that satisfies the condition.
Examples
Input
8
Output
5
Input
7
Output
18
Input
54
Output
114
Submitted Solution:
```
a,b,c=map(int,input().split())
print((a*b)//2)
```
No
| 2,300 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:
* The first term s is given as input.
* Let f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.
* a_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.
Find the minimum integer m that satisfies the following condition:
* There exists an integer n such that a_m = a_n (m > n).
Constraints
* 1 \leq s \leq 100
* All values in input are integers.
* It is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.
Input
Input is given from Standard Input in the following format:
s
Output
Print the minimum integer m that satisfies the condition.
Examples
Input
8
Output
5
Input
7
Output
18
Input
54
Output
114
Submitted Solution:
```
a = int(input())
k = 1
if a == 4:
print(4)
exit()
for i in range(1000000):
if a % 2 == 0:
a = a // 2
k = k + 1
else:
a = 3 * a + 1
k = k + 1
if a == 4:
print(k + 3)
break
```
No
| 2,301 |
Provide a correct Python 3 solution for this coding contest problem.
A programming competition site AtCode provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points. These p_1 + … + p_D problems are all of the problems available on AtCode.
A user of AtCode has a value called total score. The total score of a user is the sum of the following two elements:
* Base score: the sum of the scores of all problems solved by the user.
* Perfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).
Takahashi, who is the new user of AtCode, has not solved any problem. His objective is to have a total score of G or more points. At least how many problems does he need to solve for this objective?
Constraints
* 1 ≤ D ≤ 10
* 1 ≤ p_i ≤ 100
* 100 ≤ c_i ≤ 10^6
* 100 ≤ G
* All values in input are integers.
* c_i and G are all multiples of 100.
* It is possible to have a total score of G or more points.
Input
Input is given from Standard Input in the following format:
D G
p_1 c_1
:
p_D c_D
Output
Print the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).
Examples
Input
2 700
3 500
5 800
Output
3
Input
2 2000
3 500
5 800
Output
7
Input
2 400
3 500
5 800
Output
2
Input
5 25000
20 1000
40 1000
50 1000
30 1000
1 1000
Output
66
"Correct Solution:
```
import math
n,g = map(int,input().split())
lis = []
sum = []
for i in range(n):
a,b = map(int,input().split())
lis.append([a,b])
sum.append((i+1)*100*a+b)
def ans(x,y):
if y <= 0:return 10 ** 12
nu = min(math.ceil(x/(100 * y)),lis[y-1][0])
num = 100 * y * nu
if nu == lis[y-1][0]:num += lis[y-1][1]
if num >= x:cou = nu
else:cou = nu +ans(x-num,y-1)
return min(cou,ans(x,y-1))
print(ans(g,n))
```
| 2,302 |
Provide a correct Python 3 solution for this coding contest problem.
A programming competition site AtCode provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points. These p_1 + … + p_D problems are all of the problems available on AtCode.
A user of AtCode has a value called total score. The total score of a user is the sum of the following two elements:
* Base score: the sum of the scores of all problems solved by the user.
* Perfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).
Takahashi, who is the new user of AtCode, has not solved any problem. His objective is to have a total score of G or more points. At least how many problems does he need to solve for this objective?
Constraints
* 1 ≤ D ≤ 10
* 1 ≤ p_i ≤ 100
* 100 ≤ c_i ≤ 10^6
* 100 ≤ G
* All values in input are integers.
* c_i and G are all multiples of 100.
* It is possible to have a total score of G or more points.
Input
Input is given from Standard Input in the following format:
D G
p_1 c_1
:
p_D c_D
Output
Print the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).
Examples
Input
2 700
3 500
5 800
Output
3
Input
2 2000
3 500
5 800
Output
7
Input
2 400
3 500
5 800
Output
2
Input
5 25000
20 1000
40 1000
50 1000
30 1000
1 1000
Output
66
"Correct Solution:
```
d,g=map(int,input().split())
pc = [list(map(int,input().split())) for _ in range(d)]
ans = float("inf")
for bit in range(1<<d):
sum=0
count=0
nokori=set(range(1,d+1))
for i in range(d):
if bit&(1<<i):
sum += pc[i][0]*100*(i+1)+pc[i][1]
count+= pc[i][0]
nokori.discard(i + 1)
if sum<g:
a=g-sum
num=max(nokori)
n=min(pc[num-1][0],-(-a//(num*100)))
count+=n
sum+=n*num*100
if sum>=g:
ans=min(ans,count)
print(ans)
```
| 2,303 |
Provide a correct Python 3 solution for this coding contest problem.
A programming competition site AtCode provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points. These p_1 + … + p_D problems are all of the problems available on AtCode.
A user of AtCode has a value called total score. The total score of a user is the sum of the following two elements:
* Base score: the sum of the scores of all problems solved by the user.
* Perfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).
Takahashi, who is the new user of AtCode, has not solved any problem. His objective is to have a total score of G or more points. At least how many problems does he need to solve for this objective?
Constraints
* 1 ≤ D ≤ 10
* 1 ≤ p_i ≤ 100
* 100 ≤ c_i ≤ 10^6
* 100 ≤ G
* All values in input are integers.
* c_i and G are all multiples of 100.
* It is possible to have a total score of G or more points.
Input
Input is given from Standard Input in the following format:
D G
p_1 c_1
:
p_D c_D
Output
Print the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).
Examples
Input
2 700
3 500
5 800
Output
3
Input
2 2000
3 500
5 800
Output
7
Input
2 400
3 500
5 800
Output
2
Input
5 25000
20 1000
40 1000
50 1000
30 1000
1 1000
Output
66
"Correct Solution:
```
d,g=map(int,input().split())
p=[]
c=[]
for i in range(d):
a,b=map(int,input().split())
p.append(a)
c.append(b)
sum=[]
for i in range(d):
sum.append((i+1)*100*p[i]+c[i])
def ans(g,t):
if t<=0:
return 100000000000
n=min(int(g/(100*t)),p[t-1])
s=100*t*n
if n==p[t-1]:
s=sum[t-1]
if g>s:
n+=ans(g-s,t-1)
return min(n,ans(g,t-1))
print(ans(g,d))
```
| 2,304 |
Provide a correct Python 3 solution for this coding contest problem.
A programming competition site AtCode provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points. These p_1 + … + p_D problems are all of the problems available on AtCode.
A user of AtCode has a value called total score. The total score of a user is the sum of the following two elements:
* Base score: the sum of the scores of all problems solved by the user.
* Perfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).
Takahashi, who is the new user of AtCode, has not solved any problem. His objective is to have a total score of G or more points. At least how many problems does he need to solve for this objective?
Constraints
* 1 ≤ D ≤ 10
* 1 ≤ p_i ≤ 100
* 100 ≤ c_i ≤ 10^6
* 100 ≤ G
* All values in input are integers.
* c_i and G are all multiples of 100.
* It is possible to have a total score of G or more points.
Input
Input is given from Standard Input in the following format:
D G
p_1 c_1
:
p_D c_D
Output
Print the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).
Examples
Input
2 700
3 500
5 800
Output
3
Input
2 2000
3 500
5 800
Output
7
Input
2 400
3 500
5 800
Output
2
Input
5 25000
20 1000
40 1000
50 1000
30 1000
1 1000
Output
66
"Correct Solution:
```
d, g = map(int, input().split())
pc = [0] + [[int(i) for i in input().split()] for i in range(d)]
def dfs(g, i):
if i == 0:
return 10 ** 12
n = min(g // (100 * i), pc[i][0])
score = 100 * i * n
if n == pc[i][0]:
score += pc[i][1]
if g > score:
n += dfs(g - score, i - 1)
return min(n, dfs(g , i - 1))
print(dfs(g, d))
```
| 2,305 |
Provide a correct Python 3 solution for this coding contest problem.
A programming competition site AtCode provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points. These p_1 + … + p_D problems are all of the problems available on AtCode.
A user of AtCode has a value called total score. The total score of a user is the sum of the following two elements:
* Base score: the sum of the scores of all problems solved by the user.
* Perfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).
Takahashi, who is the new user of AtCode, has not solved any problem. His objective is to have a total score of G or more points. At least how many problems does he need to solve for this objective?
Constraints
* 1 ≤ D ≤ 10
* 1 ≤ p_i ≤ 100
* 100 ≤ c_i ≤ 10^6
* 100 ≤ G
* All values in input are integers.
* c_i and G are all multiples of 100.
* It is possible to have a total score of G or more points.
Input
Input is given from Standard Input in the following format:
D G
p_1 c_1
:
p_D c_D
Output
Print the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).
Examples
Input
2 700
3 500
5 800
Output
3
Input
2 2000
3 500
5 800
Output
7
Input
2 400
3 500
5 800
Output
2
Input
5 25000
20 1000
40 1000
50 1000
30 1000
1 1000
Output
66
"Correct Solution:
```
d,g=map(int,input().split())
P=[0]*d
C=[0]*d
for i in range(d):
P[i],C[i]=map(int,input().split())
dp=[[-10**10]*(sum(P)+111) for i in range(d+1)]
for i in range(sum(P)+1):
dp[0][i]=0
for i in range(1,d+1):
dp[i][0]=0
for i in range(1,d+1):
for j in range(1,(sum(P)+1)):
dp[i][j]=max(max(dp[i-1][j-k]+i*100*k for k in range(P[i-1])),dp[i-1][j-P[i-1]]+i*100*P[i-1]+C[i-1],dp[i][j-1])
i=-1
while dp[d][i]<g:
i=i+1
print(i)
```
| 2,306 |
Provide a correct Python 3 solution for this coding contest problem.
A programming competition site AtCode provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points. These p_1 + … + p_D problems are all of the problems available on AtCode.
A user of AtCode has a value called total score. The total score of a user is the sum of the following two elements:
* Base score: the sum of the scores of all problems solved by the user.
* Perfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).
Takahashi, who is the new user of AtCode, has not solved any problem. His objective is to have a total score of G or more points. At least how many problems does he need to solve for this objective?
Constraints
* 1 ≤ D ≤ 10
* 1 ≤ p_i ≤ 100
* 100 ≤ c_i ≤ 10^6
* 100 ≤ G
* All values in input are integers.
* c_i and G are all multiples of 100.
* It is possible to have a total score of G or more points.
Input
Input is given from Standard Input in the following format:
D G
p_1 c_1
:
p_D c_D
Output
Print the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).
Examples
Input
2 700
3 500
5 800
Output
3
Input
2 2000
3 500
5 800
Output
7
Input
2 400
3 500
5 800
Output
2
Input
5 25000
20 1000
40 1000
50 1000
30 1000
1 1000
Output
66
"Correct Solution:
```
d, g = map(int, input().split())
pc = [0] + [list(map(int, input().split())) for i in range(d)]
def dfs(d_, g_):
if d_ == 0:
return float("inf")
cnt = min(g_ // (d_ * 100), pc[d_][0])
cur = cnt * 100 * d_
if cnt == pc[d_][0]:
cur += pc[d_][1]
if g_ > cur:
cnt += dfs(d_ - 1, g_ - cur)
return min(cnt, dfs(d_ - 1, g_))
print(dfs(d, g))
```
| 2,307 |
Provide a correct Python 3 solution for this coding contest problem.
A programming competition site AtCode provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points. These p_1 + … + p_D problems are all of the problems available on AtCode.
A user of AtCode has a value called total score. The total score of a user is the sum of the following two elements:
* Base score: the sum of the scores of all problems solved by the user.
* Perfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).
Takahashi, who is the new user of AtCode, has not solved any problem. His objective is to have a total score of G or more points. At least how many problems does he need to solve for this objective?
Constraints
* 1 ≤ D ≤ 10
* 1 ≤ p_i ≤ 100
* 100 ≤ c_i ≤ 10^6
* 100 ≤ G
* All values in input are integers.
* c_i and G are all multiples of 100.
* It is possible to have a total score of G or more points.
Input
Input is given from Standard Input in the following format:
D G
p_1 c_1
:
p_D c_D
Output
Print the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).
Examples
Input
2 700
3 500
5 800
Output
3
Input
2 2000
3 500
5 800
Output
7
Input
2 400
3 500
5 800
Output
2
Input
5 25000
20 1000
40 1000
50 1000
30 1000
1 1000
Output
66
"Correct Solution:
```
#coding: utf-8
D, G = map(int, input().split())
l = []
P, C = [], []
for _ in range(D):
p, c = map(int, input().split())
P.append(p)
C.append(c)
#l.append([p, c, i+1])
ans = 10 ** 10
for mask in range(int(bin(1 << D), 0)):
s = 0
num = 0
rest_max = -1
for i in range(D):
if mask >> i & 1:
s += 100 * (i + 1) * P[i] + C[i]
num += P[i]
else:
rest_max = i
if s < G:
s1 = 100 * (rest_max + 1)
need = (G - s + s1 - 1) // s1
if need >= P[rest_max]:
continue
num += need
ans = min(ans, num)
print(ans)
```
| 2,308 |
Provide a correct Python 3 solution for this coding contest problem.
A programming competition site AtCode provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points. These p_1 + … + p_D problems are all of the problems available on AtCode.
A user of AtCode has a value called total score. The total score of a user is the sum of the following two elements:
* Base score: the sum of the scores of all problems solved by the user.
* Perfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).
Takahashi, who is the new user of AtCode, has not solved any problem. His objective is to have a total score of G or more points. At least how many problems does he need to solve for this objective?
Constraints
* 1 ≤ D ≤ 10
* 1 ≤ p_i ≤ 100
* 100 ≤ c_i ≤ 10^6
* 100 ≤ G
* All values in input are integers.
* c_i and G are all multiples of 100.
* It is possible to have a total score of G or more points.
Input
Input is given from Standard Input in the following format:
D G
p_1 c_1
:
p_D c_D
Output
Print the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).
Examples
Input
2 700
3 500
5 800
Output
3
Input
2 2000
3 500
5 800
Output
7
Input
2 400
3 500
5 800
Output
2
Input
5 25000
20 1000
40 1000
50 1000
30 1000
1 1000
Output
66
"Correct Solution:
```
d,g=map(int,input().split())
p=[0 for _ in range(d)]
c=[0 for _ in range(d)]
ans = 100**10
for i in range(d):#値を取得！
p[i],c[i]=map(int,input().split())
for i in range(2**d):
score = 0
count = 0
horyu = 0
for j in range(d):
if ((i >> j) & 1):
score += (j+1)*p[j]*100 + c[j]
count += p[j]
else:
horyu = j #あとまわし(最高点数の1種類)
for i in range(p[horyu]):
if score >= g and count < ans:
ans = count
score += (horyu + 1) * 100
count += 1
print(ans)
```
| 2,309 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A programming competition site AtCode provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points. These p_1 + … + p_D problems are all of the problems available on AtCode.
A user of AtCode has a value called total score. The total score of a user is the sum of the following two elements:
* Base score: the sum of the scores of all problems solved by the user.
* Perfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).
Takahashi, who is the new user of AtCode, has not solved any problem. His objective is to have a total score of G or more points. At least how many problems does he need to solve for this objective?
Constraints
* 1 ≤ D ≤ 10
* 1 ≤ p_i ≤ 100
* 100 ≤ c_i ≤ 10^6
* 100 ≤ G
* All values in input are integers.
* c_i and G are all multiples of 100.
* It is possible to have a total score of G or more points.
Input
Input is given from Standard Input in the following format:
D G
p_1 c_1
:
p_D c_D
Output
Print the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).
Examples
Input
2 700
3 500
5 800
Output
3
Input
2 2000
3 500
5 800
Output
7
Input
2 400
3 500
5 800
Output
2
Input
5 25000
20 1000
40 1000
50 1000
30 1000
1 1000
Output
66
Submitted Solution:
```
d, g = map(int, input().split())
pc = [list(map(int, input().split())) for _ in range(d)]
ans = 1000
for i in range(1 << d):
score = 0
num = 0
rest = 0
for j in range(d):
if ((i >> j) & 1) == 1:
score += pc[j][0]*100*(j+1) + pc[j][1]
num += pc[j][0]
else:
rest = j
if score < g:
need = (g-score-1)//(100*(rest+1))+1
if need > pc[rest][0]-1:
continue
else:
num += need
ans = min(ans, num)
print(ans)
```
Yes
| 2,310 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A programming competition site AtCode provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points. These p_1 + … + p_D problems are all of the problems available on AtCode.
A user of AtCode has a value called total score. The total score of a user is the sum of the following two elements:
* Base score: the sum of the scores of all problems solved by the user.
* Perfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).
Takahashi, who is the new user of AtCode, has not solved any problem. His objective is to have a total score of G or more points. At least how many problems does he need to solve for this objective?
Constraints
* 1 ≤ D ≤ 10
* 1 ≤ p_i ≤ 100
* 100 ≤ c_i ≤ 10^6
* 100 ≤ G
* All values in input are integers.
* c_i and G are all multiples of 100.
* It is possible to have a total score of G or more points.
Input
Input is given from Standard Input in the following format:
D G
p_1 c_1
:
p_D c_D
Output
Print the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).
Examples
Input
2 700
3 500
5 800
Output
3
Input
2 2000
3 500
5 800
Output
7
Input
2 400
3 500
5 800
Output
2
Input
5 25000
20 1000
40 1000
50 1000
30 1000
1 1000
Output
66
Submitted Solution:
```
D, G = map(int, input().split())
PC = [0] + [list(map(int, input().split())) for _ in range(D)]
def dfs(i, g):
if i == 0:
return 1e9
m = min(g // (i * 100), PC[i][0])
s = 100 * i * m
if m == PC[i][0]:
s += PC[i][1]
if s < g:
m += dfs(i - 1, g - s)
return min(m, dfs(i - 1, g))
print(dfs(D, G))
```
Yes
| 2,311 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A programming competition site AtCode provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points. These p_1 + … + p_D problems are all of the problems available on AtCode.
A user of AtCode has a value called total score. The total score of a user is the sum of the following two elements:
* Base score: the sum of the scores of all problems solved by the user.
* Perfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).
Takahashi, who is the new user of AtCode, has not solved any problem. His objective is to have a total score of G or more points. At least how many problems does he need to solve for this objective?
Constraints
* 1 ≤ D ≤ 10
* 1 ≤ p_i ≤ 100
* 100 ≤ c_i ≤ 10^6
* 100 ≤ G
* All values in input are integers.
* c_i and G are all multiples of 100.
* It is possible to have a total score of G or more points.
Input
Input is given from Standard Input in the following format:
D G
p_1 c_1
:
p_D c_D
Output
Print the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).
Examples
Input
2 700
3 500
5 800
Output
3
Input
2 2000
3 500
5 800
Output
7
Input
2 400
3 500
5 800
Output
2
Input
5 25000
20 1000
40 1000
50 1000
30 1000
1 1000
Output
66
Submitted Solution:
```
d,g = map(int,input().split())
P,C = [0]*d,[0]*d
for i in range(d): P[i],C[i] = map(int,input().split())
ans = 10**9
for bin in range(1<<d):
cnt = tot = rest_max_bit = 0
for i in range(d):
if bin & 1<<i:
t = (i + 1)*100
tot += P[i]*t + C[i]
cnt += P[i]
else: rest_max_bit = i
if tot < g:
t = (rest_max_bit + 1)*100
p = (g - tot + t - 1)//t
if p >= P[rest_max_bit]: continue
cnt += p
ans = min(ans, cnt)
print(ans)
```
Yes
| 2,312 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A programming competition site AtCode provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points. These p_1 + … + p_D problems are all of the problems available on AtCode.
A user of AtCode has a value called total score. The total score of a user is the sum of the following two elements:
* Base score: the sum of the scores of all problems solved by the user.
* Perfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).
Takahashi, who is the new user of AtCode, has not solved any problem. His objective is to have a total score of G or more points. At least how many problems does he need to solve for this objective?
Constraints
* 1 ≤ D ≤ 10
* 1 ≤ p_i ≤ 100
* 100 ≤ c_i ≤ 10^6
* 100 ≤ G
* All values in input are integers.
* c_i and G are all multiples of 100.
* It is possible to have a total score of G or more points.
Input
Input is given from Standard Input in the following format:
D G
p_1 c_1
:
p_D c_D
Output
Print the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).
Examples
Input
2 700
3 500
5 800
Output
3
Input
2 2000
3 500
5 800
Output
7
Input
2 400
3 500
5 800
Output
2
Input
5 25000
20 1000
40 1000
50 1000
30 1000
1 1000
Output
66
Submitted Solution:
```
d, g = map(int, input().split())
PC = [0] + [[i for i in map(int, input().split())] for i in range(d)]
def dfs(g, i):
if i == 0:
return 10 ** 12
cnt = min(g // (100 * i), PC[i][0])
score = cnt * 100 * i
if cnt == PC[i][0]:
score += PC[i][1]
if g > score:
cnt += dfs(g - score, i - 1)
return min(cnt, dfs(g, i - 1))
print(dfs(g, d))
```
Yes
| 2,313 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A programming competition site AtCode provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points. These p_1 + … + p_D problems are all of the problems available on AtCode.
A user of AtCode has a value called total score. The total score of a user is the sum of the following two elements:
* Base score: the sum of the scores of all problems solved by the user.
* Perfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).
Takahashi, who is the new user of AtCode, has not solved any problem. His objective is to have a total score of G or more points. At least how many problems does he need to solve for this objective?
Constraints
* 1 ≤ D ≤ 10
* 1 ≤ p_i ≤ 100
* 100 ≤ c_i ≤ 10^6
* 100 ≤ G
* All values in input are integers.
* c_i and G are all multiples of 100.
* It is possible to have a total score of G or more points.
Input
Input is given from Standard Input in the following format:
D G
p_1 c_1
:
p_D c_D
Output
Print the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).
Examples
Input
2 700
3 500
5 800
Output
3
Input
2 2000
3 500
5 800
Output
7
Input
2 400
3 500
5 800
Output
2
Input
5 25000
20 1000
40 1000
50 1000
30 1000
1 1000
Output
66
Submitted Solution:
```
dg = input().split(“ “);
d = int(dg[0]);
g = int(dg[1]);
p = [0]*d;
c = [0]*d;
for i in range(d) :
s = input().split(“ “);
p[i] = int(s[0]);
c[i] = int(s[1]);
ans = 0;
for i in range(sum(p)) :
sump = 0;
for j in range(len(p)) :
all = 0;
for m in range(p[j]) :
if(i & 2**(sump+m)>>(sump+m)) :
ans += (j+1)*100;
all += 1;
if(all == p[j]) :
ans += c[j];
sump += p[i];
print(ans);
```
No
| 2,314 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A programming competition site AtCode provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points. These p_1 + … + p_D problems are all of the problems available on AtCode.
A user of AtCode has a value called total score. The total score of a user is the sum of the following two elements:
* Base score: the sum of the scores of all problems solved by the user.
* Perfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).
Takahashi, who is the new user of AtCode, has not solved any problem. His objective is to have a total score of G or more points. At least how many problems does he need to solve for this objective?
Constraints
* 1 ≤ D ≤ 10
* 1 ≤ p_i ≤ 100
* 100 ≤ c_i ≤ 10^6
* 100 ≤ G
* All values in input are integers.
* c_i and G are all multiples of 100.
* It is possible to have a total score of G or more points.
Input
Input is given from Standard Input in the following format:
D G
p_1 c_1
:
p_D c_D
Output
Print the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).
Examples
Input
2 700
3 500
5 800
Output
3
Input
2 2000
3 500
5 800
Output
7
Input
2 400
3 500
5 800
Output
2
Input
5 25000
20 1000
40 1000
50 1000
30 1000
1 1000
Output
66
Submitted Solution:
```
D, G = map(int, input().split())
X = [list(map(int, input().split())) for _ in range(D)]
def func(i, t):
if i == 0 or i > D:
return 10 ** 9
# Solve all problems, or part of them
k = min(t // (100 * i), X[i][0])
s = 100 * i * k
# If all problems are solved, add bonus
if k == X[i][0]:
s += X[i][1]
# If score < objective, go next step
if s < t:
k += func(i - 1, t - s)
# Select minimum number of solved problems
# k: solve i-th line
# func(i-1,t): pass i-th line
return min(k, func(i - 1, t))
# Solve backward
print(func(D, G))
```
No
| 2,315 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A programming competition site AtCode provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points. These p_1 + … + p_D problems are all of the problems available on AtCode.
A user of AtCode has a value called total score. The total score of a user is the sum of the following two elements:
* Base score: the sum of the scores of all problems solved by the user.
* Perfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).
Takahashi, who is the new user of AtCode, has not solved any problem. His objective is to have a total score of G or more points. At least how many problems does he need to solve for this objective?
Constraints
* 1 ≤ D ≤ 10
* 1 ≤ p_i ≤ 100
* 100 ≤ c_i ≤ 10^6
* 100 ≤ G
* All values in input are integers.
* c_i and G are all multiples of 100.
* It is possible to have a total score of G or more points.
Input
Input is given from Standard Input in the following format:
D G
p_1 c_1
:
p_D c_D
Output
Print the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).
Examples
Input
2 700
3 500
5 800
Output
3
Input
2 2000
3 500
5 800
Output
7
Input
2 400
3 500
5 800
Output
2
Input
5 25000
20 1000
40 1000
50 1000
30 1000
1 1000
Output
66
Submitted Solution:
```
import itertools
D,G = list(map(int,input().split()))
d = []
ans = (10e10)
for i in range(D):
a,b = list(map(int,input().split()))
d.append([100*(i+1) for j in range(a-1)])
d[i].append(100*(i+1)+b)
for ar in itertools.permutations(d):
num = cnt = 0
for i in ar:
if num+sum(i) < G:
num += sum(i)
cnt += len(i)
else:
for j in i:
if num+j < G:
num += j
cnt += 1
else:
ans = min(ans,cnt+1)
break
break
print(ans)
```
No
| 2,316 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A programming competition site AtCode provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points. These p_1 + … + p_D problems are all of the problems available on AtCode.
A user of AtCode has a value called total score. The total score of a user is the sum of the following two elements:
* Base score: the sum of the scores of all problems solved by the user.
* Perfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).
Takahashi, who is the new user of AtCode, has not solved any problem. His objective is to have a total score of G or more points. At least how many problems does he need to solve for this objective?
Constraints
* 1 ≤ D ≤ 10
* 1 ≤ p_i ≤ 100
* 100 ≤ c_i ≤ 10^6
* 100 ≤ G
* All values in input are integers.
* c_i and G are all multiples of 100.
* It is possible to have a total score of G or more points.
Input
Input is given from Standard Input in the following format:
D G
p_1 c_1
:
p_D c_D
Output
Print the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).
Examples
Input
2 700
3 500
5 800
Output
3
Input
2 2000
3 500
5 800
Output
7
Input
2 400
3 500
5 800
Output
2
Input
5 25000
20 1000
40 1000
50 1000
30 1000
1 1000
Output
66
Submitted Solution:
```
import itertools
def main():
d, g = list(map(int, input().split()))
problems = [list(map(int, input().split())) for _ in range(d)]
ptns = itertools.product([0, 1], repeat = d)
#print(list(ptns))
ans = sum([x[0] for x in problems])
if sum([(i + 1) * 100 * problems[i][0] for i in range(d)]) == g:
print(sum([x[1] for x in problems]))
return
for pt in ptns:
#print(pt)
rest = g - sum([((i + 1) * 100 * problems[i][0] + problems[i][1]) * pt[i] for i in range(d)])
tmp = sum([problems[i][0] * pt[i] for i in range(d)])
if rest > 0:
if 0 in pt:
rest_max_idx = d - pt[::-1].index(0) - 1
for i in range(1, problems[rest_max_idx][0]):
rest -= (rest_max_idx + 1) * 100
tmp += 1
if rest <= 0:
break
if rest <= 0:
ans = min(ans, tmp)
print(ans)
if __name__ == '__main__':
main()
```
No
| 2,317 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a rectangular parallelepiped of dimensions A×B×C, divided into 1×1×1 small cubes. The small cubes have coordinates from (0, 0, 0) through (A-1, B-1, C-1).
Let p, q and r be integers. Consider the following set of abc small cubes:
\\{(\ (p + i) mod A, (q + j) mod B, (r + k) mod C\ ) | i, j and k are integers satisfying 0 ≤ i < a, 0 ≤ j < b, 0 ≤ k < c \\}
A set of small cubes that can be expressed in the above format using some integers p, q and r, is called a torus cuboid of size a×b×c.
Find the number of the sets of torus cuboids of size a×b×c that satisfy the following condition, modulo 10^9+7:
* No two torus cuboids in the set have intersection.
* The union of all torus cuboids in the set is the whole rectangular parallelepiped of dimensions A×B×C.
Constraints
* 1 ≤ a < A ≤ 100
* 1 ≤ b < B ≤ 100
* 1 ≤ c < C ≤ 100
* All input values are integers.
Input
Input is given from Standard Input in the following format:
a b c A B C
Output
Print the number of the sets of torus cuboids of size a×b×c that satisfy the condition, modulo 10^9+7.
Examples
Input
1 1 1 2 2 2
Output
1
Input
2 2 2 4 4 4
Output
744
Input
2 3 4 6 7 8
Output
0
Input
2 3 4 98 99 100
Output
471975164
Submitted Solution:
```
print("rng n00b")
```
No
| 2,318 |
Provide a correct Python 3 solution for this coding contest problem.
Joisino is working as a receptionist at a theater.
The theater has 100000 seats, numbered from 1 to 100000.
According to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).
How many people are sitting at the theater now?
Constraints
* 1≤N≤1000
* 1≤l_i≤r_i≤100000
* No seat is occupied by more than one person.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
l_1 r_1
:
l_N r_N
Output
Print the number of people sitting at the theater.
Examples
Input
1
24 30
Output
7
Input
2
6 8
3 3
Output
4
"Correct Solution:
```
n = int(input())
cnt = 0
for i in range(n):
l,r = map(int,input().split());cnt += r-l+1
print(cnt)
```
| 2,319 |
Provide a correct Python 3 solution for this coding contest problem.
Joisino is working as a receptionist at a theater.
The theater has 100000 seats, numbered from 1 to 100000.
According to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).
How many people are sitting at the theater now?
Constraints
* 1≤N≤1000
* 1≤l_i≤r_i≤100000
* No seat is occupied by more than one person.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
l_1 r_1
:
l_N r_N
Output
Print the number of people sitting at the theater.
Examples
Input
1
24 30
Output
7
Input
2
6 8
3 3
Output
4
"Correct Solution:
```
N=int(input())
ans=0
for i in range(N):
l,r=map(int,input().split())
ans+=abs(l-r)+1
print(ans)
```
| 2,320 |
Provide a correct Python 3 solution for this coding contest problem.
Joisino is working as a receptionist at a theater.
The theater has 100000 seats, numbered from 1 to 100000.
According to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).
How many people are sitting at the theater now?
Constraints
* 1≤N≤1000
* 1≤l_i≤r_i≤100000
* No seat is occupied by more than one person.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
l_1 r_1
:
l_N r_N
Output
Print the number of people sitting at the theater.
Examples
Input
1
24 30
Output
7
Input
2
6 8
3 3
Output
4
"Correct Solution:
```
n = int(input())
c=0
for i in range(n):
s,e = map(int,input().split())
c += e-s+1
print(c)
```
| 2,321 |
Provide a correct Python 3 solution for this coding contest problem.
Joisino is working as a receptionist at a theater.
The theater has 100000 seats, numbered from 1 to 100000.
According to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).
How many people are sitting at the theater now?
Constraints
* 1≤N≤1000
* 1≤l_i≤r_i≤100000
* No seat is occupied by more than one person.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
l_1 r_1
:
l_N r_N
Output
Print the number of people sitting at the theater.
Examples
Input
1
24 30
Output
7
Input
2
6 8
3 3
Output
4
"Correct Solution:
```
n = int(input())
x = 0
for _ in range(n):
s, e = map(int, input().split())
x += e - s + 1
print(x)
```
| 2,322 |
Provide a correct Python 3 solution for this coding contest problem.
Joisino is working as a receptionist at a theater.
The theater has 100000 seats, numbered from 1 to 100000.
According to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).
How many people are sitting at the theater now?
Constraints
* 1≤N≤1000
* 1≤l_i≤r_i≤100000
* No seat is occupied by more than one person.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
l_1 r_1
:
l_N r_N
Output
Print the number of people sitting at the theater.
Examples
Input
1
24 30
Output
7
Input
2
6 8
3 3
Output
4
"Correct Solution:
```
N=int(input())
num=0
for i in range(N):
l,r=map(int,input().split())
num+=r-l+1
print(num)
```
| 2,323 |
Provide a correct Python 3 solution for this coding contest problem.
Joisino is working as a receptionist at a theater.
The theater has 100000 seats, numbered from 1 to 100000.
According to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).
How many people are sitting at the theater now?
Constraints
* 1≤N≤1000
* 1≤l_i≤r_i≤100000
* No seat is occupied by more than one person.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
l_1 r_1
:
l_N r_N
Output
Print the number of people sitting at the theater.
Examples
Input
1
24 30
Output
7
Input
2
6 8
3 3
Output
4
"Correct Solution:
```
ans=0
N=int(input())
for i in range(N):
a,b=map(int,input().split())
ans+=b-a+1
print(ans)
```
| 2,324 |
Provide a correct Python 3 solution for this coding contest problem.
Joisino is working as a receptionist at a theater.
The theater has 100000 seats, numbered from 1 to 100000.
According to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).
How many people are sitting at the theater now?
Constraints
* 1≤N≤1000
* 1≤l_i≤r_i≤100000
* No seat is occupied by more than one person.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
l_1 r_1
:
l_N r_N
Output
Print the number of people sitting at the theater.
Examples
Input
1
24 30
Output
7
Input
2
6 8
3 3
Output
4
"Correct Solution:
```
n=int(input())
ans=0
for i in range(n):
l,s=map(int,input().split())
ans+=s-l+1
print(ans)
```
| 2,325 |
Provide a correct Python 3 solution for this coding contest problem.
Joisino is working as a receptionist at a theater.
The theater has 100000 seats, numbered from 1 to 100000.
According to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).
How many people are sitting at the theater now?
Constraints
* 1≤N≤1000
* 1≤l_i≤r_i≤100000
* No seat is occupied by more than one person.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
l_1 r_1
:
l_N r_N
Output
Print the number of people sitting at the theater.
Examples
Input
1
24 30
Output
7
Input
2
6 8
3 3
Output
4
"Correct Solution:
```
N=int(input())
c=0
for i in range(N):
l,n=map(int,input().split())
m=n-l+1
c+=m
print(c)
```
| 2,326 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino is working as a receptionist at a theater.
The theater has 100000 seats, numbered from 1 to 100000.
According to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).
How many people are sitting at the theater now?
Constraints
* 1≤N≤1000
* 1≤l_i≤r_i≤100000
* No seat is occupied by more than one person.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
l_1 r_1
:
l_N r_N
Output
Print the number of people sitting at the theater.
Examples
Input
1
24 30
Output
7
Input
2
6 8
3 3
Output
4
Submitted Solution:
```
n = int(input())
t = 0
for i in range(n):
l, r = map(int, input().split())
t += r-l+1
print(t)
```
Yes
| 2,327 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino is working as a receptionist at a theater.
The theater has 100000 seats, numbered from 1 to 100000.
According to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).
How many people are sitting at the theater now?
Constraints
* 1≤N≤1000
* 1≤l_i≤r_i≤100000
* No seat is occupied by more than one person.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
l_1 r_1
:
l_N r_N
Output
Print the number of people sitting at the theater.
Examples
Input
1
24 30
Output
7
Input
2
6 8
3 3
Output
4
Submitted Solution:
```
n=int(input())
ans=0
for i in range(n):
ans+=~(eval(input().replace(' ','-')))+2
print(ans)
```
Yes
| 2,328 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino is working as a receptionist at a theater.
The theater has 100000 seats, numbered from 1 to 100000.
According to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).
How many people are sitting at the theater now?
Constraints
* 1≤N≤1000
* 1≤l_i≤r_i≤100000
* No seat is occupied by more than one person.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
l_1 r_1
:
l_N r_N
Output
Print the number of people sitting at the theater.
Examples
Input
1
24 30
Output
7
Input
2
6 8
3 3
Output
4
Submitted Solution:
```
n = int(input())
s = 0
for _ in range(n):
a, b = map(int, input().split())
s += (b - a + 1)
print(s)
```
Yes
| 2,329 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino is working as a receptionist at a theater.
The theater has 100000 seats, numbered from 1 to 100000.
According to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).
How many people are sitting at the theater now?
Constraints
* 1≤N≤1000
* 1≤l_i≤r_i≤100000
* No seat is occupied by more than one person.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
l_1 r_1
:
l_N r_N
Output
Print the number of people sitting at the theater.
Examples
Input
1
24 30
Output
7
Input
2
6 8
3 3
Output
4
Submitted Solution:
```
a=int(input())
ans=0
for i in range(a):
x,y=map(int,input().split())
ans+=y-x+1
print(ans)
```
Yes
| 2,330 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino is working as a receptionist at a theater.
The theater has 100000 seats, numbered from 1 to 100000.
According to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).
How many people are sitting at the theater now?
Constraints
* 1≤N≤1000
* 1≤l_i≤r_i≤100000
* No seat is occupied by more than one person.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
l_1 r_1
:
l_N r_N
Output
Print the number of people sitting at the theater.
Examples
Input
1
24 30
Output
7
Input
2
6 8
3 3
Output
4
Submitted Solution:
```
n=int(input())
s=0
for i in range(n):
l=list(map(int,input().split()))
s+=len(l)
print(s)
```
No
| 2,331 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino is working as a receptionist at a theater.
The theater has 100000 seats, numbered from 1 to 100000.
According to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).
How many people are sitting at the theater now?
Constraints
* 1≤N≤1000
* 1≤l_i≤r_i≤100000
* No seat is occupied by more than one person.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
l_1 r_1
:
l_N r_N
Output
Print the number of people sitting at the theater.
Examples
Input
1
24 30
Output
7
Input
2
6 8
3 3
Output
4
Submitted Solution:
```
N = int(input())
ans = 0
for i in range(N):
A, B = map(int, input().split())
ans = B - A +1
print(ans)
```
No
| 2,332 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino is working as a receptionist at a theater.
The theater has 100000 seats, numbered from 1 to 100000.
According to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).
How many people are sitting at the theater now?
Constraints
* 1≤N≤1000
* 1≤l_i≤r_i≤100000
* No seat is occupied by more than one person.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
l_1 r_1
:
l_N r_N
Output
Print the number of people sitting at the theater.
Examples
Input
1
24 30
Output
7
Input
2
6 8
3 3
Output
4
Submitted Solution:
```
N=int(input())
K=0
for i in N:
l,r = map(int,input().split())
K=(r-l+1)+K
print(K)
```
No
| 2,333 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino is working as a receptionist at a theater.
The theater has 100000 seats, numbered from 1 to 100000.
According to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).
How many people are sitting at the theater now?
Constraints
* 1≤N≤1000
* 1≤l_i≤r_i≤100000
* No seat is occupied by more than one person.
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
l_1 r_1
:
l_N r_N
Output
Print the number of people sitting at the theater.
Examples
Input
1
24 30
Output
7
Input
2
6 8
3 3
Output
4
Submitted Solution:
```
N=int(input())
K=0
for i in N
l[i],r[i] = map(int,input().split())
K+=(r[i]-l[i]+1)
print(K)
```
No
| 2,334 |
Provide a correct Python 3 solution for this coding contest problem.
There are 3N participants in AtCoder Group Contest. The strength of the i-th participant is represented by an integer a_i. They will form N teams, each consisting of three participants. No participant may belong to multiple teams.
The strength of a team is defined as the second largest strength among its members. For example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.
Find the maximum possible sum of the strengths of N teams.
Constraints
* 1 ≤ N ≤ 10^5
* 1 ≤ a_i ≤ 10^{9}
* a_i are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{3N}
Output
Print the answer.
Examples
Input
2
5 2 8 5 1 5
Output
10
Input
10
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
Output
10000000000
"Correct Solution:
```
N=int(input())
a=sorted([int(i) for i in input().split()])
print(sum(a[N::2]))
```
| 2,335 |
Provide a correct Python 3 solution for this coding contest problem.
There are 3N participants in AtCoder Group Contest. The strength of the i-th participant is represented by an integer a_i. They will form N teams, each consisting of three participants. No participant may belong to multiple teams.
The strength of a team is defined as the second largest strength among its members. For example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.
Find the maximum possible sum of the strengths of N teams.
Constraints
* 1 ≤ N ≤ 10^5
* 1 ≤ a_i ≤ 10^{9}
* a_i are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{3N}
Output
Print the answer.
Examples
Input
2
5 2 8 5 1 5
Output
10
Input
10
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
Output
10000000000
"Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
a.sort()
print(sum(a[n::2]))
```
| 2,336 |
Provide a correct Python 3 solution for this coding contest problem.
There are 3N participants in AtCoder Group Contest. The strength of the i-th participant is represented by an integer a_i. They will form N teams, each consisting of three participants. No participant may belong to multiple teams.
The strength of a team is defined as the second largest strength among its members. For example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.
Find the maximum possible sum of the strengths of N teams.
Constraints
* 1 ≤ N ≤ 10^5
* 1 ≤ a_i ≤ 10^{9}
* a_i are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{3N}
Output
Print the answer.
Examples
Input
2
5 2 8 5 1 5
Output
10
Input
10
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
Output
10000000000
"Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
a=sorted(a,reverse=True)
print(sum(a[1:2*n:2]))
```
| 2,337 |
Provide a correct Python 3 solution for this coding contest problem.
There are 3N participants in AtCoder Group Contest. The strength of the i-th participant is represented by an integer a_i. They will form N teams, each consisting of three participants. No participant may belong to multiple teams.
The strength of a team is defined as the second largest strength among its members. For example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.
Find the maximum possible sum of the strengths of N teams.
Constraints
* 1 ≤ N ≤ 10^5
* 1 ≤ a_i ≤ 10^{9}
* a_i are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{3N}
Output
Print the answer.
Examples
Input
2
5 2 8 5 1 5
Output
10
Input
10
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
Output
10000000000
"Correct Solution:
```
n = int(input())
a = sorted(list(map(int, input().split())))
print(sum(a[n::2]))
```
| 2,338 |
Provide a correct Python 3 solution for this coding contest problem.
There are 3N participants in AtCoder Group Contest. The strength of the i-th participant is represented by an integer a_i. They will form N teams, each consisting of three participants. No participant may belong to multiple teams.
The strength of a team is defined as the second largest strength among its members. For example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.
Find the maximum possible sum of the strengths of N teams.
Constraints
* 1 ≤ N ≤ 10^5
* 1 ≤ a_i ≤ 10^{9}
* a_i are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{3N}
Output
Print the answer.
Examples
Input
2
5 2 8 5 1 5
Output
10
Input
10
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
Output
10000000000
"Correct Solution:
```
tms=int(input())
strlist=sorted(list(map(int,input().split())))
ans=sum(strlist[tms::][::2])
print(ans)
```
| 2,339 |
Provide a correct Python 3 solution for this coding contest problem.
There are 3N participants in AtCoder Group Contest. The strength of the i-th participant is represented by an integer a_i. They will form N teams, each consisting of three participants. No participant may belong to multiple teams.
The strength of a team is defined as the second largest strength among its members. For example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.
Find the maximum possible sum of the strengths of N teams.
Constraints
* 1 ≤ N ≤ 10^5
* 1 ≤ a_i ≤ 10^{9}
* a_i are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{3N}
Output
Print the answer.
Examples
Input
2
5 2 8 5 1 5
Output
10
Input
10
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
Output
10000000000
"Correct Solution:
```
n = int(input())
l = sorted(list(map(int,input().split())))
print(sum(l[n::2]))
```
| 2,340 |
Provide a correct Python 3 solution for this coding contest problem.
There are 3N participants in AtCoder Group Contest. The strength of the i-th participant is represented by an integer a_i. They will form N teams, each consisting of three participants. No participant may belong to multiple teams.
The strength of a team is defined as the second largest strength among its members. For example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.
Find the maximum possible sum of the strengths of N teams.
Constraints
* 1 ≤ N ≤ 10^5
* 1 ≤ a_i ≤ 10^{9}
* a_i are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{3N}
Output
Print the answer.
Examples
Input
2
5 2 8 5 1 5
Output
10
Input
10
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
Output
10000000000
"Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
a.sort(reverse=1)
ans=sum(a[1:(n*2):2])
print(ans)
```
| 2,341 |
Provide a correct Python 3 solution for this coding contest problem.
There are 3N participants in AtCoder Group Contest. The strength of the i-th participant is represented by an integer a_i. They will form N teams, each consisting of three participants. No participant may belong to multiple teams.
The strength of a team is defined as the second largest strength among its members. For example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.
Find the maximum possible sum of the strengths of N teams.
Constraints
* 1 ≤ N ≤ 10^5
* 1 ≤ a_i ≤ 10^{9}
* a_i are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{3N}
Output
Print the answer.
Examples
Input
2
5 2 8 5 1 5
Output
10
Input
10
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
Output
10000000000
"Correct Solution:
```
N=int(input())
print(sum(sorted(list(map(int,input().split(' '))))[N::2]))
```
| 2,342 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 3N participants in AtCoder Group Contest. The strength of the i-th participant is represented by an integer a_i. They will form N teams, each consisting of three participants. No participant may belong to multiple teams.
The strength of a team is defined as the second largest strength among its members. For example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.
Find the maximum possible sum of the strengths of N teams.
Constraints
* 1 ≤ N ≤ 10^5
* 1 ≤ a_i ≤ 10^{9}
* a_i are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{3N}
Output
Print the answer.
Examples
Input
2
5 2 8 5 1 5
Output
10
Input
10
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
Output
10000000000
Submitted Solution:
```
N = int(input())
a = list(map(int, input().split()))
a.sort()
del a[:N]
print(sum(a[::2]))
```
Yes
| 2,343 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 3N participants in AtCoder Group Contest. The strength of the i-th participant is represented by an integer a_i. They will form N teams, each consisting of three participants. No participant may belong to multiple teams.
The strength of a team is defined as the second largest strength among its members. For example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.
Find the maximum possible sum of the strengths of N teams.
Constraints
* 1 ≤ N ≤ 10^5
* 1 ≤ a_i ≤ 10^{9}
* a_i are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{3N}
Output
Print the answer.
Examples
Input
2
5 2 8 5 1 5
Output
10
Input
10
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
Output
10000000000
Submitted Solution:
```
N = int(input())
A = sorted(list(map(int, input().split())))
Ans = sum(A[N::2])
print(Ans)
```
Yes
| 2,344 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 3N participants in AtCoder Group Contest. The strength of the i-th participant is represented by an integer a_i. They will form N teams, each consisting of three participants. No participant may belong to multiple teams.
The strength of a team is defined as the second largest strength among its members. For example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.
Find the maximum possible sum of the strengths of N teams.
Constraints
* 1 ≤ N ≤ 10^5
* 1 ≤ a_i ≤ 10^{9}
* a_i are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{3N}
Output
Print the answer.
Examples
Input
2
5 2 8 5 1 5
Output
10
Input
10
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
Output
10000000000
Submitted Solution:
```
n=int(input());print(sum(sorted(map(int,input().split()))[::-1][1:n*2:2]))
```
Yes
| 2,345 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 3N participants in AtCoder Group Contest. The strength of the i-th participant is represented by an integer a_i. They will form N teams, each consisting of three participants. No participant may belong to multiple teams.
The strength of a team is defined as the second largest strength among its members. For example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.
Find the maximum possible sum of the strengths of N teams.
Constraints
* 1 ≤ N ≤ 10^5
* 1 ≤ a_i ≤ 10^{9}
* a_i are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{3N}
Output
Print the answer.
Examples
Input
2
5 2 8 5 1 5
Output
10
Input
10
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
Output
10000000000
Submitted Solution:
```
n = int(input())
a = sorted(list(map(int, input().split())), reverse=True)
print(sum(a[1:n*2:2]))
```
Yes
| 2,346 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 3N participants in AtCoder Group Contest. The strength of the i-th participant is represented by an integer a_i. They will form N teams, each consisting of three participants. No participant may belong to multiple teams.
The strength of a team is defined as the second largest strength among its members. For example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.
Find the maximum possible sum of the strengths of N teams.
Constraints
* 1 ≤ N ≤ 10^5
* 1 ≤ a_i ≤ 10^{9}
* a_i are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{3N}
Output
Print the answer.
Examples
Input
2
5 2 8 5 1 5
Output
10
Input
10
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
Output
10000000000
Submitted Solution:
```
n=int(input())
a=list(map(int,input().split()))
a.sort()
if n>=2:
print(a[-2]+a[-4])
else:
print(a[1])
```
No
| 2,347 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 3N participants in AtCoder Group Contest. The strength of the i-th participant is represented by an integer a_i. They will form N teams, each consisting of three participants. No participant may belong to multiple teams.
The strength of a team is defined as the second largest strength among its members. For example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.
Find the maximum possible sum of the strengths of N teams.
Constraints
* 1 ≤ N ≤ 10^5
* 1 ≤ a_i ≤ 10^{9}
* a_i are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{3N}
Output
Print the answer.
Examples
Input
2
5 2 8 5 1 5
Output
10
Input
10
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
Output
10000000000
Submitted Solution:
```
N, X, Y = map( int, input().split() )
C = []
W = []
for i in range( N ):
c, w = map( int, input().split() )
C.append( c - 1 )
W.append( w )
c2w = [ [] for i in range( N ) ]
for i in range( N ):
c2w[ C[ i ] ].append( W[ i ] )
for i in range( N ):
c2w[ C[ i ] ].sort()
minw, _minwp = 2e9, -1
for i in range( N ):
if minw > c2w[ i ][ 0 ]:
minw = c2w[ i ][ 0 ]
_minwp = i
minw2 = 2e9
for i in range( N ):
if i == _minwp: continue
if minw2 > c2w[ i ][ 0 ]:
minw2 = c2w[ i ][ 0 ]
merged = [ False for i in range( N ) ]
hi = [ 1 for i in range( N ) ]
for i in range( N ):
if len( c2w[ i ] ) == 0: continue
lb, ub = 2, len( c2w[ i ] )
while lb <= ub:
mid = lb + ub >> 1
if c2w[ i ][ 0 ] + c2w[ i ][ mid - 1 ] <= X:
hi[ i ] = max( hi[ i ], mid )
lb = mid + 1
else:
ub = mid - 1
lb, ub = 1, len( c2w[ i ] )
www = minw2 if minw != minw2 and c2w[ i ][ 0 ] == minw else minw
while lb <= ub:
mid = lb + ub >> 1
if www + c2w[ i ][ mid - 1 ] <= Y:
hi[ i ] = max( hi[ i ], mid )
merged[ i ] = True
lb = mid + 1
else:
ub = mid - 1
MOD = int( 1e9 + 7 )
fact = [ 1 ]
inv_fact = [ 1 ]
for i in range( 1, N + 1, 1 ):
fact.append( fact[ i - 1 ] * i % MOD )
inv_fact.append( pow( fact[ i ], MOD - 2, MOD ) )
ans = fact[ sum( merged[ i ] * hi[ i ] for i in range( N ) ) ]
for i in range( N ):
if not merged[ i ]: continue
ans = ans * inv_fact[ hi[ i ] ] % MOD
print( ans )
```
No
| 2,348 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 3N participants in AtCoder Group Contest. The strength of the i-th participant is represented by an integer a_i. They will form N teams, each consisting of three participants. No participant may belong to multiple teams.
The strength of a team is defined as the second largest strength among its members. For example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.
Find the maximum possible sum of the strengths of N teams.
Constraints
* 1 ≤ N ≤ 10^5
* 1 ≤ a_i ≤ 10^{9}
* a_i are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{3N}
Output
Print the answer.
Examples
Input
2
5 2 8 5 1 5
Output
10
Input
10
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
Output
10000000000
Submitted Solution:
```
def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
a = list(map(int, input().rstrip('\n').split()))
a.sort(reverse=True)
print(a)
print(a[1:2*n+1:2])
print(sum(a[1:2*n+1:2]))
if __name__ == '__main__':
slove()
```
No
| 2,349 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 3N participants in AtCoder Group Contest. The strength of the i-th participant is represented by an integer a_i. They will form N teams, each consisting of three participants. No participant may belong to multiple teams.
The strength of a team is defined as the second largest strength among its members. For example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.
Find the maximum possible sum of the strengths of N teams.
Constraints
* 1 ≤ N ≤ 10^5
* 1 ≤ a_i ≤ 10^{9}
* a_i are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{3N}
Output
Print the answer.
Examples
Input
2
5 2 8 5 1 5
Output
10
Input
10
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
Output
10000000000
Submitted Solution:
```
# -*- coding: utf-8 -*-
n = int(input())
nums = [int(s) for s in input().split()]
nums.sort()
ans = 0
for i in range(n, 2*n):
ans += nums[i]
print(ans)
```
No
| 2,350 |
Provide a correct Python 3 solution for this coding contest problem.
E869120 defined a sequence $a$ like this:
* $a_1=a_2=1$, $a_{k+2}=a_{k+1}+a_k \ (k \ge 1)$
He also defined sequences $d_1, d_2, d_3, \dots , d_n$, as the following recurrence relation :
* $d_{1, j} = a_j$
* $d_{i, j} = \sum_{k = 1}^j d_{i - 1, k} \ (i \ge 2)$
You are given integers $n$ and $m$. Please calculate the value of $d_{n, m}$.
Since the answer can be large number, print the answer modulo $998,244,353$.
Can you solve this problem???
Input
The input is given from standard input in the following format.
> $n \quad m$
Output
* Print $d_{n, m}$ modulo $998,244,353$.
Constraints
* $1 \le n \le 200,000$
* $1 \le m \le 10^{18}$
Subtasks
Subtask 1 [ $100$ points ]
* The testcase in this subtask satisfies $1 \le n, m \le 3,000$.
Subtask 2 [ $170$ points ]
* The testcase in this subtask satisfies $1 \le m \le 200,000$.
Subtask 3 [ $230$ points ]
* The testcase in this subtask satisfies $1 \le n \le 3$.
Subtask 4 [ $420$ points ]
* The testcase in this subtask satisfies $1 \le n \le 1000$.
Subtask 5 [ $480$ points ]
* There are no additional constraints.
Output
* Print $d_{n, m}$ modulo $998,244,353$.
Constraints
* $1 \le n \le 200,000$
* $1 \le m \le 10^{18}$
Subtasks
Subtask 1 [ $100$ points ]
* The testcase in this subtask satisfies $1 \le n, m \le 3,000$.
Subtask 2 [ $170$ points ]
* The testcase in this subtask satisfies $1 \le m \le 200,000$.
Subtask 3 [ $230$ points ]
* The testcase in this subtask satisfies $1 \le n \le 3$.
Subtask 4 [ $420$ points ]
* The testcase in this subtask satisfies $1 \le n \le 1000$.
Subtask 5 [ $480$ points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
> $n \quad m$
Examples
Input
4 7
Output
176
Input
12 20
Output
174174144
Input
16 30
Output
102292850
"Correct Solution:
```
def f(n):
e=[1,0,0,1];z=[1,1,1,0]
while n:
if n%2>0:e=g(e,z)
z=g(z,z);n//=2
return e[1]
M=998244353;g=lambda a,b:[(a[0]*b[0]+a[1]*b[2])%M,(a[0]*b[1]+a[1]*b[3])%M,(a[2]*b[0]+a[3]*b[2])%M,(a[2]*b[1]+a[3]*b[3])%M];n,m=map(int,input().split());I=[1,1];r=f(m+2*n-2);c=1
for i in range(2,n):I+=[(M-M//i)*I[M%i]%M]
for i in range(n-1):r=(r+c*(M-f(2*n-2-2*i)))%M;c=c*(m+i)*I[i+1]%M
print(r)
```
| 2,351 |
Provide a correct Python 3 solution for this coding contest problem.
E869120 defined a sequence $a$ like this:
* $a_1=a_2=1$, $a_{k+2}=a_{k+1}+a_k \ (k \ge 1)$
He also defined sequences $d_1, d_2, d_3, \dots , d_n$, as the following recurrence relation :
* $d_{1, j} = a_j$
* $d_{i, j} = \sum_{k = 1}^j d_{i - 1, k} \ (i \ge 2)$
You are given integers $n$ and $m$. Please calculate the value of $d_{n, m}$.
Since the answer can be large number, print the answer modulo $998,244,353$.
Can you solve this problem???
Input
The input is given from standard input in the following format.
> $n \quad m$
Output
* Print $d_{n, m}$ modulo $998,244,353$.
Constraints
* $1 \le n \le 200,000$
* $1 \le m \le 10^{18}$
Subtasks
Subtask 1 [ $100$ points ]
* The testcase in this subtask satisfies $1 \le n, m \le 3,000$.
Subtask 2 [ $170$ points ]
* The testcase in this subtask satisfies $1 \le m \le 200,000$.
Subtask 3 [ $230$ points ]
* The testcase in this subtask satisfies $1 \le n \le 3$.
Subtask 4 [ $420$ points ]
* The testcase in this subtask satisfies $1 \le n \le 1000$.
Subtask 5 [ $480$ points ]
* There are no additional constraints.
Output
* Print $d_{n, m}$ modulo $998,244,353$.
Constraints
* $1 \le n \le 200,000$
* $1 \le m \le 10^{18}$
Subtasks
Subtask 1 [ $100$ points ]
* The testcase in this subtask satisfies $1 \le n, m \le 3,000$.
Subtask 2 [ $170$ points ]
* The testcase in this subtask satisfies $1 \le m \le 200,000$.
Subtask 3 [ $230$ points ]
* The testcase in this subtask satisfies $1 \le n \le 3$.
Subtask 4 [ $420$ points ]
* The testcase in this subtask satisfies $1 \le n \le 1000$.
Subtask 5 [ $480$ points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
> $n \quad m$
Examples
Input
4 7
Output
176
Input
12 20
Output
174174144
Input
16 30
Output
102292850
"Correct Solution:
```
def f(n):
e=[1,0,0,1];z=[1,1,1,0]
while n:e=[e,g(e,z)][n%2];z=g(z,z);n//=2
return e[1]
M=998244353;g=lambda a,b:[(a[0]*b[0]+a[1]*b[2])%M,(a[0]*b[1]+a[1]*b[3])%M,(a[2]*b[0]+a[3]*b[2])%M,(a[2]*b[1]+a[3]*b[3])%M];n,m=map(int,input().split());I=[1,1];r=f(m+2*n-2);c=1
for i in range(2,n):I+=[(M-M//i)*I[M%i]%M]
for i in range(n-1):r=(r+c*(M-f(2*n-2-2*i)))%M;c=c*(m+i)*I[i+1]%M
print(r)
```
| 2,352 |
Provide a correct Python 3 solution for this coding contest problem.
E869120 defined a sequence $a$ like this:
* $a_1=a_2=1$, $a_{k+2}=a_{k+1}+a_k \ (k \ge 1)$
He also defined sequences $d_1, d_2, d_3, \dots , d_n$, as the following recurrence relation :
* $d_{1, j} = a_j$
* $d_{i, j} = \sum_{k = 1}^j d_{i - 1, k} \ (i \ge 2)$
You are given integers $n$ and $m$. Please calculate the value of $d_{n, m}$.
Since the answer can be large number, print the answer modulo $998,244,353$.
Can you solve this problem???
Input
The input is given from standard input in the following format.
> $n \quad m$
Output
* Print $d_{n, m}$ modulo $998,244,353$.
Constraints
* $1 \le n \le 200,000$
* $1 \le m \le 10^{18}$
Subtasks
Subtask 1 [ $100$ points ]
* The testcase in this subtask satisfies $1 \le n, m \le 3,000$.
Subtask 2 [ $170$ points ]
* The testcase in this subtask satisfies $1 \le m \le 200,000$.
Subtask 3 [ $230$ points ]
* The testcase in this subtask satisfies $1 \le n \le 3$.
Subtask 4 [ $420$ points ]
* The testcase in this subtask satisfies $1 \le n \le 1000$.
Subtask 5 [ $480$ points ]
* There are no additional constraints.
Output
* Print $d_{n, m}$ modulo $998,244,353$.
Constraints
* $1 \le n \le 200,000$
* $1 \le m \le 10^{18}$
Subtasks
Subtask 1 [ $100$ points ]
* The testcase in this subtask satisfies $1 \le n, m \le 3,000$.
Subtask 2 [ $170$ points ]
* The testcase in this subtask satisfies $1 \le m \le 200,000$.
Subtask 3 [ $230$ points ]
* The testcase in this subtask satisfies $1 \le n \le 3$.
Subtask 4 [ $420$ points ]
* The testcase in this subtask satisfies $1 \le n \le 1000$.
Subtask 5 [ $480$ points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
> $n \quad m$
Examples
Input
4 7
Output
176
Input
12 20
Output
174174144
Input
16 30
Output
102292850
"Correct Solution:
```
def f(n):
i=e=[1,0,0,1];z=[1,1,1,0]
while n:e=[e,g(e,z)][n%2];z=g(z,z);n//=2
return e[1]
M=998244353;g=lambda a,b:[(a[0]*b[0]+a[1]*b[2])%M,(a[0]*b[1]+a[1]*b[3])%M,(a[2]*b[0]+a[3]*b[2])%M,(a[2]*b[1]+a[3]*b[3])%M];n,m=map(int,input().split());I=[1,1];r=f(m+2*n-2);c=1
for i in range(2,n):I+=[(M-M//i)*I[M%i]%M]
for i in range(n-1):r=(r+c*(M-f(2*n-2-2*i)))%M;c=c*(m+i)*I[i+1]%M
print(r)
```
| 2,353 |
Provide a correct Python 3 solution for this coding contest problem.
E869120 defined a sequence $a$ like this:
* $a_1=a_2=1$, $a_{k+2}=a_{k+1}+a_k \ (k \ge 1)$
He also defined sequences $d_1, d_2, d_3, \dots , d_n$, as the following recurrence relation :
* $d_{1, j} = a_j$
* $d_{i, j} = \sum_{k = 1}^j d_{i - 1, k} \ (i \ge 2)$
You are given integers $n$ and $m$. Please calculate the value of $d_{n, m}$.
Since the answer can be large number, print the answer modulo $998,244,353$.
Can you solve this problem???
Input
The input is given from standard input in the following format.
> $n \quad m$
Output
* Print $d_{n, m}$ modulo $998,244,353$.
Constraints
* $1 \le n \le 200,000$
* $1 \le m \le 10^{18}$
Subtasks
Subtask 1 [ $100$ points ]
* The testcase in this subtask satisfies $1 \le n, m \le 3,000$.
Subtask 2 [ $170$ points ]
* The testcase in this subtask satisfies $1 \le m \le 200,000$.
Subtask 3 [ $230$ points ]
* The testcase in this subtask satisfies $1 \le n \le 3$.
Subtask 4 [ $420$ points ]
* The testcase in this subtask satisfies $1 \le n \le 1000$.
Subtask 5 [ $480$ points ]
* There are no additional constraints.
Output
* Print $d_{n, m}$ modulo $998,244,353$.
Constraints
* $1 \le n \le 200,000$
* $1 \le m \le 10^{18}$
Subtasks
Subtask 1 [ $100$ points ]
* The testcase in this subtask satisfies $1 \le n, m \le 3,000$.
Subtask 2 [ $170$ points ]
* The testcase in this subtask satisfies $1 \le m \le 200,000$.
Subtask 3 [ $230$ points ]
* The testcase in this subtask satisfies $1 \le n \le 3$.
Subtask 4 [ $420$ points ]
* The testcase in this subtask satisfies $1 \le n \le 1000$.
Subtask 5 [ $480$ points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
> $n \quad m$
Examples
Input
4 7
Output
176
Input
12 20
Output
174174144
Input
16 30
Output
102292850
"Correct Solution:
```
M=998244353
g=lambda a,b:[(a[0]*b[0]+a[1]*b[2])%M,(a[0]*b[1]+a[1]*b[3])%M,(a[2]*b[0]+a[3]*b[2])%M,(a[2]*b[1]+a[3]*b[3])%M]
def f(n):
e=[1,0,0,1];z=[1,1,1,0]
while n:
if n%2>0:e=g(e,z)
z=g(z,z);n//=2
return e[1]
n,m=map(int,input().split());I=[1,1];r=f(m+2*n-2);c=1
for i in range(2,n):I+=[(M-M//i)*I[M%i]%M]
for i in range(n-1):r=(r+c*(M-f(2*n-2-2*i)))%M;c=c*(m+i)*I[i+1]%M
print(r)
```
| 2,354 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
E869120 defined a sequence $a$ like this:
* $a_1=a_2=1$, $a_{k+2}=a_{k+1}+a_k \ (k \ge 1)$
He also defined sequences $d_1, d_2, d_3, \dots , d_n$, as the following recurrence relation :
* $d_{1, j} = a_j$
* $d_{i, j} = \sum_{k = 1}^j d_{i - 1, k} \ (i \ge 2)$
You are given integers $n$ and $m$. Please calculate the value of $d_{n, m}$.
Since the answer can be large number, print the answer modulo $998,244,353$.
Can you solve this problem???
Input
The input is given from standard input in the following format.
> $n \quad m$
Output
* Print $d_{n, m}$ modulo $998,244,353$.
Constraints
* $1 \le n \le 200,000$
* $1 \le m \le 10^{18}$
Subtasks
Subtask 1 [ $100$ points ]
* The testcase in this subtask satisfies $1 \le n, m \le 3,000$.
Subtask 2 [ $170$ points ]
* The testcase in this subtask satisfies $1 \le m \le 200,000$.
Subtask 3 [ $230$ points ]
* The testcase in this subtask satisfies $1 \le n \le 3$.
Subtask 4 [ $420$ points ]
* The testcase in this subtask satisfies $1 \le n \le 1000$.
Subtask 5 [ $480$ points ]
* There are no additional constraints.
Output
* Print $d_{n, m}$ modulo $998,244,353$.
Constraints
* $1 \le n \le 200,000$
* $1 \le m \le 10^{18}$
Subtasks
Subtask 1 [ $100$ points ]
* The testcase in this subtask satisfies $1 \le n, m \le 3,000$.
Subtask 2 [ $170$ points ]
* The testcase in this subtask satisfies $1 \le m \le 200,000$.
Subtask 3 [ $230$ points ]
* The testcase in this subtask satisfies $1 \le n \le 3$.
Subtask 4 [ $420$ points ]
* The testcase in this subtask satisfies $1 \le n \le 1000$.
Subtask 5 [ $480$ points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
> $n \quad m$
Examples
Input
4 7
Output
176
Input
12 20
Output
174174144
Input
16 30
Output
102292850
Submitted Solution:
```
def f(n):
e=[1,0,0,1];z=[1,1,1,0]
while n:e=[e,g(e,z)][n%2];z=g(z,z);n//=2
return e[1]
M=998244353;g=lambda a,b:[(a[x]*b[y]+a[z]*b[w])%M for x,y,z,w in[[0,0,1,2],[0,1,1,3],[2,0,3,2],[2,1,3,3]]];n,m=map(int,input().split());I=[1,1];r=f(m+2*n-2);c=1
for i in range(2,n):I+=[(M-M//i)*I[M%i]%M]
for i in range(n-1):r=(r+c*(M-f(2*n-2-2*i)))%M;c=c*(m+i)*I[i+1]%M
print(r)
```
No
| 2,355 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
E869120 defined a sequence $a$ like this:
* $a_1=a_2=1$, $a_{k+2}=a_{k+1}+a_k \ (k \ge 1)$
He also defined sequences $d_1, d_2, d_3, \dots , d_n$, as the following recurrence relation :
* $d_{1, j} = a_j$
* $d_{i, j} = \sum_{k = 1}^j d_{i - 1, k} \ (i \ge 2)$
You are given integers $n$ and $m$. Please calculate the value of $d_{n, m}$.
Since the answer can be large number, print the answer modulo $998,244,353$.
Can you solve this problem???
Input
The input is given from standard input in the following format.
> $n \quad m$
Output
* Print $d_{n, m}$ modulo $998,244,353$.
Constraints
* $1 \le n \le 200,000$
* $1 \le m \le 10^{18}$
Subtasks
Subtask 1 [ $100$ points ]
* The testcase in this subtask satisfies $1 \le n, m \le 3,000$.
Subtask 2 [ $170$ points ]
* The testcase in this subtask satisfies $1 \le m \le 200,000$.
Subtask 3 [ $230$ points ]
* The testcase in this subtask satisfies $1 \le n \le 3$.
Subtask 4 [ $420$ points ]
* The testcase in this subtask satisfies $1 \le n \le 1000$.
Subtask 5 [ $480$ points ]
* There are no additional constraints.
Output
* Print $d_{n, m}$ modulo $998,244,353$.
Constraints
* $1 \le n \le 200,000$
* $1 \le m \le 10^{18}$
Subtasks
Subtask 1 [ $100$ points ]
* The testcase in this subtask satisfies $1 \le n, m \le 3,000$.
Subtask 2 [ $170$ points ]
* The testcase in this subtask satisfies $1 \le m \le 200,000$.
Subtask 3 [ $230$ points ]
* The testcase in this subtask satisfies $1 \le n \le 3$.
Subtask 4 [ $420$ points ]
* The testcase in this subtask satisfies $1 \le n \le 1000$.
Subtask 5 [ $480$ points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
> $n \quad m$
Examples
Input
4 7
Output
176
Input
12 20
Output
174174144
Input
16 30
Output
102292850
Submitted Solution:
```
n,m=map(int,input().split())
t=[[0 for i in range(m)] for j in range(n)]
d=998244353
t[0][0]=t[0][1]=t[1][0]=1
for i in range(n):
for j in range(m):
if i==0 and j>=2:
t[i][j]=t[i][j-2]%d+t[i][j-1]%d
elif j==0:
t[i][j]=1
else:
t[i][j]=t[i-1][j]%d+t[i][j-1]%d
print(t[n-1][m-1] % d)
```
No
| 2,356 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
E869120 defined a sequence $a$ like this:
* $a_1=a_2=1$, $a_{k+2}=a_{k+1}+a_k \ (k \ge 1)$
He also defined sequences $d_1, d_2, d_3, \dots , d_n$, as the following recurrence relation :
* $d_{1, j} = a_j$
* $d_{i, j} = \sum_{k = 1}^j d_{i - 1, k} \ (i \ge 2)$
You are given integers $n$ and $m$. Please calculate the value of $d_{n, m}$.
Since the answer can be large number, print the answer modulo $998,244,353$.
Can you solve this problem???
Input
The input is given from standard input in the following format.
> $n \quad m$
Output
* Print $d_{n, m}$ modulo $998,244,353$.
Constraints
* $1 \le n \le 200,000$
* $1 \le m \le 10^{18}$
Subtasks
Subtask 1 [ $100$ points ]
* The testcase in this subtask satisfies $1 \le n, m \le 3,000$.
Subtask 2 [ $170$ points ]
* The testcase in this subtask satisfies $1 \le m \le 200,000$.
Subtask 3 [ $230$ points ]
* The testcase in this subtask satisfies $1 \le n \le 3$.
Subtask 4 [ $420$ points ]
* The testcase in this subtask satisfies $1 \le n \le 1000$.
Subtask 5 [ $480$ points ]
* There are no additional constraints.
Output
* Print $d_{n, m}$ modulo $998,244,353$.
Constraints
* $1 \le n \le 200,000$
* $1 \le m \le 10^{18}$
Subtasks
Subtask 1 [ $100$ points ]
* The testcase in this subtask satisfies $1 \le n, m \le 3,000$.
Subtask 2 [ $170$ points ]
* The testcase in this subtask satisfies $1 \le m \le 200,000$.
Subtask 3 [ $230$ points ]
* The testcase in this subtask satisfies $1 \le n \le 3$.
Subtask 4 [ $420$ points ]
* The testcase in this subtask satisfies $1 \le n \le 1000$.
Subtask 5 [ $480$ points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
> $n \quad m$
Examples
Input
4 7
Output
176
Input
12 20
Output
174174144
Input
16 30
Output
102292850
Submitted Solution:
```
mod = 998244353
def qp(i, j):
re = 1
while j:
if j & 1:
re = (re * i) % mod
j >>= 1
i = (i * i) % mod
return re % mod
def jc(x):
rr = 1
for i in range(2, x + 1):
rr = (rr * i) % mod
return rr % mod
def a(x, y):
return (jc(x) * qp(jc(x - y), mod - 2)) % mod
def c(x, y):
return (a(x, y) * qp(jc(y), mod - 2)) % mod
def f(x):
a = 1
b = 1
for i in range(3, x+1):
c = (a + b) % mod
a = b % mod
b = c % mod
return b
n, m = map(int, input().split())
p = 0
for i in range(1, n):
p += (c(m + i - 2, i - 1) * f(2 * n - 2 * i)) % mod
ans = (f(m + 2 * n - 2) - p) % mod
print(ans)
```
No
| 2,357 |
Provide a correct Python 3 solution for this coding contest problem.
Your task is to write a program which reads a sequence of integers and prints mode values of the sequence. The mode value is the element which occurs most frequently.
Input
A sequence of integers ai (1 ≤ ai ≤ 100). The number of integers is less than or equals to 100.
Output
Print the mode values. If there are several mode values, print them in ascending order.
Example
Input
5
6
3
5
8
7
5
3
9
7
3
4
Output
3
5
"Correct Solution:
```
# -*- coding: utf-8 -*-
DICT = {k: 0 for k in range(1, 101)}
def solve(d):
_max = max(d.values())
for k, v in sorted(d.items()):
if _max == v:
print(k)
if __name__ == '__main__':
while True:
try:
n = int(input())
DICT[n] += 1
except:
break
solve(DICT)
```
| 2,358 |
Provide a correct Python 3 solution for this coding contest problem.
Your task is to write a program which reads a sequence of integers and prints mode values of the sequence. The mode value is the element which occurs most frequently.
Input
A sequence of integers ai (1 ≤ ai ≤ 100). The number of integers is less than or equals to 100.
Output
Print the mode values. If there are several mode values, print them in ascending order.
Example
Input
5
6
3
5
8
7
5
3
9
7
3
4
Output
3
5
"Correct Solution:
```
import sys
d = {}
for l in sys.stdin.readlines():
d[int(l)] = d.get(int(l), 0) + 1
l = sorted(d, key=d.get)
n = d[l[-1]]
for x in l:
if d[x] == n:
print(x)
```
| 2,359 |
Provide a correct Python 3 solution for this coding contest problem.
Your task is to write a program which reads a sequence of integers and prints mode values of the sequence. The mode value is the element which occurs most frequently.
Input
A sequence of integers ai (1 ≤ ai ≤ 100). The number of integers is less than or equals to 100.
Output
Print the mode values. If there are several mode values, print them in ascending order.
Example
Input
5
6
3
5
8
7
5
3
9
7
3
4
Output
3
5
"Correct Solution:
```
l=[0]*101
while True:
try:
x=int(input())
l[x]+=1
except:
max_va=max(l)
for i in range(101):
if l[i]==max_va:
print(i)
break
```
| 2,360 |
Provide a correct Python 3 solution for this coding contest problem.
Your task is to write a program which reads a sequence of integers and prints mode values of the sequence. The mode value is the element which occurs most frequently.
Input
A sequence of integers ai (1 ≤ ai ≤ 100). The number of integers is less than or equals to 100.
Output
Print the mode values. If there are several mode values, print them in ascending order.
Example
Input
5
6
3
5
8
7
5
3
9
7
3
4
Output
3
5
"Correct Solution:
```
from collections import defaultdict as dd
a=dd(int)
freq=0
while True:
try:
b=int(input())
except:
break
a[b]+=1
if freq<a[b]:
freq=a[b]
ans=sorted([i for i,j in a.items() if j==freq])
for i in ans:
print(i)
```
| 2,361 |
Provide a correct Python 3 solution for this coding contest problem.
Your task is to write a program which reads a sequence of integers and prints mode values of the sequence. The mode value is the element which occurs most frequently.
Input
A sequence of integers ai (1 ≤ ai ≤ 100). The number of integers is less than or equals to 100.
Output
Print the mode values. If there are several mode values, print them in ascending order.
Example
Input
5
6
3
5
8
7
5
3
9
7
3
4
Output
3
5
"Correct Solution:
```
a = []
while True:
try:
a.append(int(input()))
except:break
c=[0]*101
for i in a:
c[i] += 1
b=max(c)
for j in range(100):
if c[j]==b:
print(j)
```
| 2,362 |
Provide a correct Python 3 solution for this coding contest problem.
Your task is to write a program which reads a sequence of integers and prints mode values of the sequence. The mode value is the element which occurs most frequently.
Input
A sequence of integers ai (1 ≤ ai ≤ 100). The number of integers is less than or equals to 100.
Output
Print the mode values. If there are several mode values, print them in ascending order.
Example
Input
5
6
3
5
8
7
5
3
9
7
3
4
Output
3
5
"Correct Solution:
```
mode = []
count = [0 for i in range(100)]
while(1):
try:
n = int(input())
count[n-1] = count[n-1] + 1
except EOFError:
max_ = max(count)
for i in range(100):
if count[i] == max_:
mode.append(i+1)
for i in mode:
print(i)
break
```
| 2,363 |
Provide a correct Python 3 solution for this coding contest problem.
Your task is to write a program which reads a sequence of integers and prints mode values of the sequence. The mode value is the element which occurs most frequently.
Input
A sequence of integers ai (1 ≤ ai ≤ 100). The number of integers is less than or equals to 100.
Output
Print the mode values. If there are several mode values, print them in ascending order.
Example
Input
5
6
3
5
8
7
5
3
9
7
3
4
Output
3
5
"Correct Solution:
```
import collections
S = []
while True:
try:
s = int(input())
S.append(s)
except EOFError:
break
c = collections.Counter(S)
k = 0
a = []
if len(S) == 0:
pass
else:
for i in range(len(c)):
if c.most_common()[i][1] == c.most_common()[i+1][1]:
k += 1
else:
break
for i in range(k+1):
a.append(c.most_common()[i][0])
a.sort()
for i in range(len(a)):
print(a[i])
```
| 2,364 |
Provide a correct Python 3 solution for this coding contest problem.
Your task is to write a program which reads a sequence of integers and prints mode values of the sequence. The mode value is the element which occurs most frequently.
Input
A sequence of integers ai (1 ≤ ai ≤ 100). The number of integers is less than or equals to 100.
Output
Print the mode values. If there are several mode values, print them in ascending order.
Example
Input
5
6
3
5
8
7
5
3
9
7
3
4
Output
3
5
"Correct Solution:
```
ans = [0]*101
while True:
try:
ans[int(input())] += 1
except EOFError:
break
printqueue = []
maxi = max(ans)
for i in range(1,101):
if ans[i] == maxi : printqueue.append(i)
for elm in printqueue:
print(elm)
```
| 2,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your task is to write a program which reads a sequence of integers and prints mode values of the sequence. The mode value is the element which occurs most frequently.
Input
A sequence of integers ai (1 ≤ ai ≤ 100). The number of integers is less than or equals to 100.
Output
Print the mode values. If there are several mode values, print them in ascending order.
Example
Input
5
6
3
5
8
7
5
3
9
7
3
4
Output
3
5
Submitted Solution:
```
import sys
count = [0 for _ in range(101)]
mode = 0
for s in sys.stdin:
x = int(s)
count[x] += 1
mode = max(mode, count[x])
for i in range(101):
if count[i] == mode:
print(i)
```
Yes
| 2,366 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your task is to write a program which reads a sequence of integers and prints mode values of the sequence. The mode value is the element which occurs most frequently.
Input
A sequence of integers ai (1 ≤ ai ≤ 100). The number of integers is less than or equals to 100.
Output
Print the mode values. If there are several mode values, print them in ascending order.
Example
Input
5
6
3
5
8
7
5
3
9
7
3
4
Output
3
5
Submitted Solution:
```
import sys
cnt = [0]*101
while True:
try:
cnt[int(input())] +=1
except EOFError:
break
m = max(cnt)
for i in range(101):
if cnt[i] == m:
print(i)
```
Yes
| 2,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your task is to write a program which reads a sequence of integers and prints mode values of the sequence. The mode value is the element which occurs most frequently.
Input
A sequence of integers ai (1 ≤ ai ≤ 100). The number of integers is less than or equals to 100.
Output
Print the mode values. If there are several mode values, print them in ascending order.
Example
Input
5
6
3
5
8
7
5
3
9
7
3
4
Output
3
5
Submitted Solution:
```
a=list([0]*100)
while True:
try:
a[int(input())-1] += 1
except EOFError:
break
x = max(a)
for i in range(100):
if a[i]==x:
print(i+1)
```
Yes
| 2,368 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your task is to write a program which reads a sequence of integers and prints mode values of the sequence. The mode value is the element which occurs most frequently.
Input
A sequence of integers ai (1 ≤ ai ≤ 100). The number of integers is less than or equals to 100.
Output
Print the mode values. If there are several mode values, print them in ascending order.
Example
Input
5
6
3
5
8
7
5
3
9
7
3
4
Output
3
5
Submitted Solution:
```
a=[]
try:
while True:
a.append(int(input()))
except EOFError:
pass
counts=[0]*101
for i in a:
counts[i]+=1
for i in range (len(a)):
if counts[i]==max(counts):
print(i)
```
Yes
| 2,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your task is to write a program which reads a sequence of integers and prints mode values of the sequence. The mode value is the element which occurs most frequently.
Input
A sequence of integers ai (1 ≤ ai ≤ 100). The number of integers is less than or equals to 100.
Output
Print the mode values. If there are several mode values, print them in ascending order.
Example
Input
5
6
3
5
8
7
5
3
9
7
3
4
Output
3
5
Submitted Solution:
```
# 0028
array = []
while True:
try:
a = input()
array.append(int(a))
except EOFError:
break
s = set(array)
mx = max(list(map(lambda a: array.count(a), s)))
modes = list(filter(lambda a: array.count(a) == mx), sorted(s))
print(*modes, sep = '\n')
```
No
| 2,370 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your task is to write a program which reads a sequence of integers and prints mode values of the sequence. The mode value is the element which occurs most frequently.
Input
A sequence of integers ai (1 ≤ ai ≤ 100). The number of integers is less than or equals to 100.
Output
Print the mode values. If there are several mode values, print them in ascending order.
Example
Input
5
6
3
5
8
7
5
3
9
7
3
4
Output
3
5
Submitted Solution:
```
import sys
array = []
array2 = []
num = 0
for i in sys.stdin.readlines():
array.append(int(i))
for i in range(len(array)):
if i == 0:
a = 0
elif array.count(array[i]) > a:
num = array.count(array[i])
a = array.count(array[i])
for i in range(len(array)):
if array.count(array[i]) == num:
array2.append(array[i])
array2 = list(set(array2))
for i in range(len(array2)):
print(array2[i])
```
No
| 2,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your task is to write a program which reads a sequence of integers and prints mode values of the sequence. The mode value is the element which occurs most frequently.
Input
A sequence of integers ai (1 ≤ ai ≤ 100). The number of integers is less than or equals to 100.
Output
Print the mode values. If there are several mode values, print them in ascending order.
Example
Input
5
6
3
5
8
7
5
3
9
7
3
4
Output
3
5
Submitted Solution:
```
# 0028
import collections
array = []
while True:
try:
a = input()
if a == '': break
array.append(int(a))
except EOFError:
break
count = list(map(lambda a: array.count(a), array))
modes = list(set(filter(lambda a: array.count(a) == max(count), array)))
print(*modes, sep = '\n')
```
No
| 2,372 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your task is to write a program which reads a sequence of integers and prints mode values of the sequence. The mode value is the element which occurs most frequently.
Input
A sequence of integers ai (1 ≤ ai ≤ 100). The number of integers is less than or equals to 100.
Output
Print the mode values. If there are several mode values, print them in ascending order.
Example
Input
5
6
3
5
8
7
5
3
9
7
3
4
Output
3
5
Submitted Solution:
```
import sys
def ModeValue():
mode=[0 for i in range(0,101)]
try:
for n in sys.stdin:
mode[int(n)]+=1
except EOFError:
a=1
maxN=max(mode)
for i in mode:
if mode[i]>maxN:
print(i)
ModeValue()
```
No
| 2,373 |
Provide a correct Python 3 solution for this coding contest problem.
There is BMI (Body Mass Index) as an index showing the degree of obesity. The BMI value is calculated using the following formula.
BMI = weight (kg) / (height (m)) 2
The closer the BMI value is to the standard value, the more "ideal body shape" is considered. Therefore, if the standard value of BMI is 22, create a program that inputs the information of the target person and outputs the information of the person closest to the "ideal body shape".
Assuming that the number of target persons is n, each target person is assigned a reception number p that is an integer value between 1 and n so that there is no duplication.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by a single line of zeros. Each dataset is given in the following format:
n
p1 h1 w1
p2 h2 w2
::
pn hn wn
Number of subjects n (n ≤ 1000) on the first line, reception number pi (1 ≤ pi ≤ n) of the i-th subject on the following n lines, height hi in centimeters (1 ≤ hi ≤ 200), Given a kilogram of body weight wi (1 ≤ wi ≤ 200). All inputs are given as integers.
Output
For each data set, the reception number (integer) of the person closest to the "ideal body shape" is output on one line. If there are two or more people who are closest to the "ideal body shape", the one with the smaller reception number will be output.
Example
Input
6
1 165 66
2 178 60
3 180 72
4 160 65
5 185 62
6 182 62
3
3 160 65
2 180 70
1 170 75
0
Output
3
2
"Correct Solution:
```
while True:
n = int(input())
if n == 0: break
ans = minv = 1<<10
for _ in range(n):
p, h, w = map(int, input().split())
BMI = w / ((h*0.01)**2)
tmp = 22 - BMI if 22 > BMI else BMI - 22
if tmp < minv:
ans, minv = p, tmp
print(ans)
```
| 2,374 |
Provide a correct Python 3 solution for this coding contest problem.
There is BMI (Body Mass Index) as an index showing the degree of obesity. The BMI value is calculated using the following formula.
BMI = weight (kg) / (height (m)) 2
The closer the BMI value is to the standard value, the more "ideal body shape" is considered. Therefore, if the standard value of BMI is 22, create a program that inputs the information of the target person and outputs the information of the person closest to the "ideal body shape".
Assuming that the number of target persons is n, each target person is assigned a reception number p that is an integer value between 1 and n so that there is no duplication.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by a single line of zeros. Each dataset is given in the following format:
n
p1 h1 w1
p2 h2 w2
::
pn hn wn
Number of subjects n (n ≤ 1000) on the first line, reception number pi (1 ≤ pi ≤ n) of the i-th subject on the following n lines, height hi in centimeters (1 ≤ hi ≤ 200), Given a kilogram of body weight wi (1 ≤ wi ≤ 200). All inputs are given as integers.
Output
For each data set, the reception number (integer) of the person closest to the "ideal body shape" is output on one line. If there are two or more people who are closest to the "ideal body shape", the one with the smaller reception number will be output.
Example
Input
6
1 165 66
2 178 60
3 180 72
4 160 65
5 185 62
6 182 62
3
3 160 65
2 180 70
1 170 75
0
Output
3
2
"Correct Solution:
```
while True:
n = int(input())
if n == 0:
break
ans = 0
min_bmi = 100000.0
for l in range(n):
p,hh,ww = [int(i) for i in input().split()]
h = float(hh)
w = float(ww)
h = h * 0.01
bmi = abs(w / (h*h) - 22.0)
if bmi < min_bmi:
min_bmi = bmi
ans = p
print(ans)
```
| 2,375 |
Provide a correct Python 3 solution for this coding contest problem.
There is BMI (Body Mass Index) as an index showing the degree of obesity. The BMI value is calculated using the following formula.
BMI = weight (kg) / (height (m)) 2
The closer the BMI value is to the standard value, the more "ideal body shape" is considered. Therefore, if the standard value of BMI is 22, create a program that inputs the information of the target person and outputs the information of the person closest to the "ideal body shape".
Assuming that the number of target persons is n, each target person is assigned a reception number p that is an integer value between 1 and n so that there is no duplication.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by a single line of zeros. Each dataset is given in the following format:
n
p1 h1 w1
p2 h2 w2
::
pn hn wn
Number of subjects n (n ≤ 1000) on the first line, reception number pi (1 ≤ pi ≤ n) of the i-th subject on the following n lines, height hi in centimeters (1 ≤ hi ≤ 200), Given a kilogram of body weight wi (1 ≤ wi ≤ 200). All inputs are given as integers.
Output
For each data set, the reception number (integer) of the person closest to the "ideal body shape" is output on one line. If there are two or more people who are closest to the "ideal body shape", the one with the smaller reception number will be output.
Example
Input
6
1 165 66
2 178 60
3 180 72
4 160 65
5 185 62
6 182 62
3
3 160 65
2 180 70
1 170 75
0
Output
3
2
"Correct Solution:
```
while True:
n = int(input())
if n == 0:
break
pairs = []
for _ in range(n):
p, h, w = map(int, input().split())
bmi = w / (h / 100) ** 2
pairs.append((p, bmi))
pairs.sort()
print(min(pairs, key=lambda x:abs(x[1] - 22))[0])
```
| 2,376 |
Provide a correct Python 3 solution for this coding contest problem.
There is BMI (Body Mass Index) as an index showing the degree of obesity. The BMI value is calculated using the following formula.
BMI = weight (kg) / (height (m)) 2
The closer the BMI value is to the standard value, the more "ideal body shape" is considered. Therefore, if the standard value of BMI is 22, create a program that inputs the information of the target person and outputs the information of the person closest to the "ideal body shape".
Assuming that the number of target persons is n, each target person is assigned a reception number p that is an integer value between 1 and n so that there is no duplication.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by a single line of zeros. Each dataset is given in the following format:
n
p1 h1 w1
p2 h2 w2
::
pn hn wn
Number of subjects n (n ≤ 1000) on the first line, reception number pi (1 ≤ pi ≤ n) of the i-th subject on the following n lines, height hi in centimeters (1 ≤ hi ≤ 200), Given a kilogram of body weight wi (1 ≤ wi ≤ 200). All inputs are given as integers.
Output
For each data set, the reception number (integer) of the person closest to the "ideal body shape" is output on one line. If there are two or more people who are closest to the "ideal body shape", the one with the smaller reception number will be output.
Example
Input
6
1 165 66
2 178 60
3 180 72
4 160 65
5 185 62
6 182 62
3
3 160 65
2 180 70
1 170 75
0
Output
3
2
"Correct Solution:
```
# from sys import exit
while(True):
N = int(input())
if N == 0:
break
L = []
for i in range(N):
p, h, w = [int(n) for n in input().split()]
L.append((p, abs(22- w/((h/100)**2))))
# print(abs(22- w/((h/100)**2)))
L = sorted(L, key=lambda x: x[1])
print(L[0][0])
```
| 2,377 |
Provide a correct Python 3 solution for this coding contest problem.
There is BMI (Body Mass Index) as an index showing the degree of obesity. The BMI value is calculated using the following formula.
BMI = weight (kg) / (height (m)) 2
The closer the BMI value is to the standard value, the more "ideal body shape" is considered. Therefore, if the standard value of BMI is 22, create a program that inputs the information of the target person and outputs the information of the person closest to the "ideal body shape".
Assuming that the number of target persons is n, each target person is assigned a reception number p that is an integer value between 1 and n so that there is no duplication.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by a single line of zeros. Each dataset is given in the following format:
n
p1 h1 w1
p2 h2 w2
::
pn hn wn
Number of subjects n (n ≤ 1000) on the first line, reception number pi (1 ≤ pi ≤ n) of the i-th subject on the following n lines, height hi in centimeters (1 ≤ hi ≤ 200), Given a kilogram of body weight wi (1 ≤ wi ≤ 200). All inputs are given as integers.
Output
For each data set, the reception number (integer) of the person closest to the "ideal body shape" is output on one line. If there are two or more people who are closest to the "ideal body shape", the one with the smaller reception number will be output.
Example
Input
6
1 165 66
2 178 60
3 180 72
4 160 65
5 185 62
6 182 62
3
3 160 65
2 180 70
1 170 75
0
Output
3
2
"Correct Solution:
```
while 1:
n = int(input())
if n == 0:
break
best = 10**9
for _ in range(n):
p, h, w = map(int, input().split())
bmi = w / (h / 100)**2
diff = abs(bmi - 22)
if diff < best:
ans = p
best = diff
elif diff == best:
if ans > p:
ans = p
print(ans)
```
| 2,378 |
Provide a correct Python 3 solution for this coding contest problem.
There is BMI (Body Mass Index) as an index showing the degree of obesity. The BMI value is calculated using the following formula.
BMI = weight (kg) / (height (m)) 2
The closer the BMI value is to the standard value, the more "ideal body shape" is considered. Therefore, if the standard value of BMI is 22, create a program that inputs the information of the target person and outputs the information of the person closest to the "ideal body shape".
Assuming that the number of target persons is n, each target person is assigned a reception number p that is an integer value between 1 and n so that there is no duplication.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by a single line of zeros. Each dataset is given in the following format:
n
p1 h1 w1
p2 h2 w2
::
pn hn wn
Number of subjects n (n ≤ 1000) on the first line, reception number pi (1 ≤ pi ≤ n) of the i-th subject on the following n lines, height hi in centimeters (1 ≤ hi ≤ 200), Given a kilogram of body weight wi (1 ≤ wi ≤ 200). All inputs are given as integers.
Output
For each data set, the reception number (integer) of the person closest to the "ideal body shape" is output on one line. If there are two or more people who are closest to the "ideal body shape", the one with the smaller reception number will be output.
Example
Input
6
1 165 66
2 178 60
3 180 72
4 160 65
5 185 62
6 182 62
3
3 160 65
2 180 70
1 170 75
0
Output
3
2
"Correct Solution:
```
while True:
n = int(input())
if n == 0:
break
L =[]
for _ in range(n):
id, h, w = [int(x) for x in input().split()]
bmi = abs(w * 10000 / h**2 -22.0)
L.append([bmi,id])
L.sort()
print(L[0][1])
```
| 2,379 |
Provide a correct Python 3 solution for this coding contest problem.
There is BMI (Body Mass Index) as an index showing the degree of obesity. The BMI value is calculated using the following formula.
BMI = weight (kg) / (height (m)) 2
The closer the BMI value is to the standard value, the more "ideal body shape" is considered. Therefore, if the standard value of BMI is 22, create a program that inputs the information of the target person and outputs the information of the person closest to the "ideal body shape".
Assuming that the number of target persons is n, each target person is assigned a reception number p that is an integer value between 1 and n so that there is no duplication.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by a single line of zeros. Each dataset is given in the following format:
n
p1 h1 w1
p2 h2 w2
::
pn hn wn
Number of subjects n (n ≤ 1000) on the first line, reception number pi (1 ≤ pi ≤ n) of the i-th subject on the following n lines, height hi in centimeters (1 ≤ hi ≤ 200), Given a kilogram of body weight wi (1 ≤ wi ≤ 200). All inputs are given as integers.
Output
For each data set, the reception number (integer) of the person closest to the "ideal body shape" is output on one line. If there are two or more people who are closest to the "ideal body shape", the one with the smaller reception number will be output.
Example
Input
6
1 165 66
2 178 60
3 180 72
4 160 65
5 185 62
6 182 62
3
3 160 65
2 180 70
1 170 75
0
Output
3
2
"Correct Solution:
```
while True:
def BMI(h,w):
X=w/(h/100)**2
return X
n =int(input())
if n==0:
break
tbl=[[0 for j in range(2)] for i in range(n)]
for i in range(n):
p,h,w=list(map(int, input().split()))
# print(BMI(h,w))
id=abs(22-BMI(h,w))
tbl[i][0]=p
tbl[i][1]=id
#print(tbl)
id_min=10**9
ans=0
for i in range(n):
if tbl[i][1]<id_min:
ans=tbl[i][0]
id_min=tbl[i][1]
print(ans)
```
| 2,380 |
Provide a correct Python 3 solution for this coding contest problem.
There is BMI (Body Mass Index) as an index showing the degree of obesity. The BMI value is calculated using the following formula.
BMI = weight (kg) / (height (m)) 2
The closer the BMI value is to the standard value, the more "ideal body shape" is considered. Therefore, if the standard value of BMI is 22, create a program that inputs the information of the target person and outputs the information of the person closest to the "ideal body shape".
Assuming that the number of target persons is n, each target person is assigned a reception number p that is an integer value between 1 and n so that there is no duplication.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by a single line of zeros. Each dataset is given in the following format:
n
p1 h1 w1
p2 h2 w2
::
pn hn wn
Number of subjects n (n ≤ 1000) on the first line, reception number pi (1 ≤ pi ≤ n) of the i-th subject on the following n lines, height hi in centimeters (1 ≤ hi ≤ 200), Given a kilogram of body weight wi (1 ≤ wi ≤ 200). All inputs are given as integers.
Output
For each data set, the reception number (integer) of the person closest to the "ideal body shape" is output on one line. If there are two or more people who are closest to the "ideal body shape", the one with the smaller reception number will be output.
Example
Input
6
1 165 66
2 178 60
3 180 72
4 160 65
5 185 62
6 182 62
3
3 160 65
2 180 70
1 170 75
0
Output
3
2
"Correct Solution:
```
# AOJ 0159 The Best Body
# Python3 2018.6.18 bal4u
GOAL = 22.0
EPS = 1e-5
while True:
n = int(input())
if n == 0: break
id, vmin = 0, 1000000000.0;
for i in range(n):
p, h, w = list(map(int, input().split()))
bmi = w/(h/100)**2
diff = abs(bmi-GOAL)
if abs(diff-vmin) < EPS: # diff == vmin
if p < id: id = p
elif diff < vmin:
id, vmin = p, diff
print(id)
```
| 2,381 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is BMI (Body Mass Index) as an index showing the degree of obesity. The BMI value is calculated using the following formula.
BMI = weight (kg) / (height (m)) 2
The closer the BMI value is to the standard value, the more "ideal body shape" is considered. Therefore, if the standard value of BMI is 22, create a program that inputs the information of the target person and outputs the information of the person closest to the "ideal body shape".
Assuming that the number of target persons is n, each target person is assigned a reception number p that is an integer value between 1 and n so that there is no duplication.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by a single line of zeros. Each dataset is given in the following format:
n
p1 h1 w1
p2 h2 w2
::
pn hn wn
Number of subjects n (n ≤ 1000) on the first line, reception number pi (1 ≤ pi ≤ n) of the i-th subject on the following n lines, height hi in centimeters (1 ≤ hi ≤ 200), Given a kilogram of body weight wi (1 ≤ wi ≤ 200). All inputs are given as integers.
Output
For each data set, the reception number (integer) of the person closest to the "ideal body shape" is output on one line. If there are two or more people who are closest to the "ideal body shape", the one with the smaller reception number will be output.
Example
Input
6
1 165 66
2 178 60
3 180 72
4 160 65
5 185 62
6 182 62
3
3 160 65
2 180 70
1 170 75
0
Output
3
2
Submitted Solution:
```
# Aizu Problem 00159: The Best Body
#
import sys, math, os, bisect
# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
sys.stdin = open("sample-input.txt", "rt")
while True:
n = int(input())
if n == 0:
break
best = 999999999999999999
near = float('Inf')
for _ in range(n):
no, h, w = [int(__) for __ in input().split()]
h /= 100
bmi = w / h**2
diff = abs(bmi - 22)
if abs(diff - near) < 1e-8:
near = abs(bmi - 22)
best = min(best, no)
elif diff < near:
near = diff
best = no
print(best)
```
Yes
| 2,382 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is BMI (Body Mass Index) as an index showing the degree of obesity. The BMI value is calculated using the following formula.
BMI = weight (kg) / (height (m)) 2
The closer the BMI value is to the standard value, the more "ideal body shape" is considered. Therefore, if the standard value of BMI is 22, create a program that inputs the information of the target person and outputs the information of the person closest to the "ideal body shape".
Assuming that the number of target persons is n, each target person is assigned a reception number p that is an integer value between 1 and n so that there is no duplication.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by a single line of zeros. Each dataset is given in the following format:
n
p1 h1 w1
p2 h2 w2
::
pn hn wn
Number of subjects n (n ≤ 1000) on the first line, reception number pi (1 ≤ pi ≤ n) of the i-th subject on the following n lines, height hi in centimeters (1 ≤ hi ≤ 200), Given a kilogram of body weight wi (1 ≤ wi ≤ 200). All inputs are given as integers.
Output
For each data set, the reception number (integer) of the person closest to the "ideal body shape" is output on one line. If there are two or more people who are closest to the "ideal body shape", the one with the smaller reception number will be output.
Example
Input
6
1 165 66
2 178 60
3 180 72
4 160 65
5 185 62
6 182 62
3
3 160 65
2 180 70
1 170 75
0
Output
3
2
Submitted Solution:
```
def BMI(height, weight):
return weight / (height / 100) ** 2
STANDARD_VALUE = 22
while True:
input_count = int(input())
if input_count == 0:
break
input_data = [map(int, input().split(" ")) for _ in range(input_count)]
data = [(number, BMI(height, weight)) for number, height, weight in input_data]
data = [(number, abs(bmi - STANDARD_VALUE)) for number, bmi in data]
data.sort(key=lambda item: (item[1], item[0]))
print(data[0][0])
```
Yes
| 2,383 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is BMI (Body Mass Index) as an index showing the degree of obesity. The BMI value is calculated using the following formula.
BMI = weight (kg) / (height (m)) 2
The closer the BMI value is to the standard value, the more "ideal body shape" is considered. Therefore, if the standard value of BMI is 22, create a program that inputs the information of the target person and outputs the information of the person closest to the "ideal body shape".
Assuming that the number of target persons is n, each target person is assigned a reception number p that is an integer value between 1 and n so that there is no duplication.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by a single line of zeros. Each dataset is given in the following format:
n
p1 h1 w1
p2 h2 w2
::
pn hn wn
Number of subjects n (n ≤ 1000) on the first line, reception number pi (1 ≤ pi ≤ n) of the i-th subject on the following n lines, height hi in centimeters (1 ≤ hi ≤ 200), Given a kilogram of body weight wi (1 ≤ wi ≤ 200). All inputs are given as integers.
Output
For each data set, the reception number (integer) of the person closest to the "ideal body shape" is output on one line. If there are two or more people who are closest to the "ideal body shape", the one with the smaller reception number will be output.
Example
Input
6
1 165 66
2 178 60
3 180 72
4 160 65
5 185 62
6 182 62
3
3 160 65
2 180 70
1 170 75
0
Output
3
2
Submitted Solution:
```
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0159
"""
import sys
from sys import stdin
input = stdin.readline
from collections import namedtuple
bmi = namedtuple('bmi', ['d', 'p'])
def calc_BMI(h, w):
return w / ((h / 100)**2)
def main(args):
while True:
n = int(input())
if n == 0:
break
scores = []
for _ in range(n):
p, h, w = map(int, input().split())
scores.append(bmi(abs(calc_BMI(h, w) - 22), p))
scores.sort()
print(scores[0].p)
if __name__ == '__main__':
main(sys.argv[1:])
```
Yes
| 2,384 |
Provide a correct Python 3 solution for this coding contest problem.
Akira, the student council president of A High School, decided to investigate which club activities the A High School students belong to. A High School has N students numbered 1 to N and M types of club activities numbered 1 to M. There is no limit to the number of people in each club activity, and there can be 0 club activities. However, according to the school rules of A High School, students can only belong to one club activity. All students follow this school rule.
Akira asked student members to investigate and obtained records for line K, such as each line being one of the following:
* Student a and student b belong to the same club activities.
* Student c belongs to club activity x.
However, there may be a contradiction in this record that would cause someone to violate school rules. Akira decided to look at the first line in order and look for the first line that could be judged to be inconsistent.
Create a program that finds the number of the first line that can be determined to be inconsistent given a record of K lines.
Input
The input is given in the following format.
NMK
record1
record2
::
recordK
The first line gives the number of students N (1 ≤ N ≤ 100000), the number of club activity types M (1 ≤ M ≤ 100000), and the number of recorded lines K (1 ≤ K ≤ 200000). Each line of record, recordi, is given in the following K lines in one of the following formats:
1 a b
Or
2 c x
When the first digit is "1", it indicates that student a (1 ≤ a ≤ N) and student b (1 ≤ b ≤ N) belong to the same club activity. However, a ≠ b.
When the first digit is "2", it indicates that student c (1 ≤ c ≤ N) belongs to club activity x (1 ≤ x ≤ M).
Output
Output the number of the first line that can be determined to be inconsistent on one line. If not found, output 0 on one line.
Examples
Input
3 2 5
1 1 2
1 2 3
2 1 1
2 3 2
2 2 1
Output
4
Input
3 2 4
1 1 2
2 1 1
2 3 2
2 2 1
Output
0
Input
3 2 2
1 1 2
2 1 1
Output
0
"Correct Solution:
```
n, m, k = map(int, input().split())
*parent, = range(n+m)
def root(x):
if x == parent[x]:
return x
parent[x] = root(parent[x])
return parent[x]
def unite(x, y):
px = root(x); py = root(y)
if px < py:
parent[py] = px
else:
parent[px] = py
for i in range(k):
a, b, c = map(int, input().split())
b -= 1; c -= 1
if a == 1:
pb = root(m+b); pc = root(m+c)
if pb < m and pc < m and pb != pc:
print(i+1)
break
unite(pb, pc)
else:
pb = root(m+b)
if pb < m and pb != c:
print(i+1)
break
unite(c, pb)
else:
print(0)
```
| 2,385 |
Provide a correct Python 3 solution for this coding contest problem.
Akira, the student council president of A High School, decided to investigate which club activities the A High School students belong to. A High School has N students numbered 1 to N and M types of club activities numbered 1 to M. There is no limit to the number of people in each club activity, and there can be 0 club activities. However, according to the school rules of A High School, students can only belong to one club activity. All students follow this school rule.
Akira asked student members to investigate and obtained records for line K, such as each line being one of the following:
* Student a and student b belong to the same club activities.
* Student c belongs to club activity x.
However, there may be a contradiction in this record that would cause someone to violate school rules. Akira decided to look at the first line in order and look for the first line that could be judged to be inconsistent.
Create a program that finds the number of the first line that can be determined to be inconsistent given a record of K lines.
Input
The input is given in the following format.
NMK
record1
record2
::
recordK
The first line gives the number of students N (1 ≤ N ≤ 100000), the number of club activity types M (1 ≤ M ≤ 100000), and the number of recorded lines K (1 ≤ K ≤ 200000). Each line of record, recordi, is given in the following K lines in one of the following formats:
1 a b
Or
2 c x
When the first digit is "1", it indicates that student a (1 ≤ a ≤ N) and student b (1 ≤ b ≤ N) belong to the same club activity. However, a ≠ b.
When the first digit is "2", it indicates that student c (1 ≤ c ≤ N) belongs to club activity x (1 ≤ x ≤ M).
Output
Output the number of the first line that can be determined to be inconsistent on one line. If not found, output 0 on one line.
Examples
Input
3 2 5
1 1 2
1 2 3
2 1 1
2 3 2
2 2 1
Output
4
Input
3 2 4
1 1 2
2 1 1
2 3 2
2 2 1
Output
0
Input
3 2 2
1 1 2
2 1 1
Output
0
"Correct Solution:
```
n, m, k = map(int, input().split())
parent = [i for i in range(n)]
club = [-1 for _ in range(n)]
def find(x):
if x == parent[x]:
return x
ret = find(parent[x])
parent[x] = ret
return ret
for count in range(1, k + 1):
t, a, b = map(int, input().split())
a -= 1
b -= 1
if t == 1:
p_a = find(a)
p_b = find(b)
c_a = club[p_a]
c_b = club[p_b]
if c_a >= 0 and c_b >= 0 and c_a != c_b:
print(count)
break
if c_a < 0 and c_b >= 0:
club[p_a] = c_b
parent[p_b] = p_a
else:
p_a = find(a)
if club[p_a] < 0:
club[p_a] = b
if club[p_a] >= 0 and club[p_a] != b:
print(count)
break
else:
print(0)
```
| 2,386 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Akira, the student council president of A High School, decided to investigate which club activities the A High School students belong to. A High School has N students numbered 1 to N and M types of club activities numbered 1 to M. There is no limit to the number of people in each club activity, and there can be 0 club activities. However, according to the school rules of A High School, students can only belong to one club activity. All students follow this school rule.
Akira asked student members to investigate and obtained records for line K, such as each line being one of the following:
* Student a and student b belong to the same club activities.
* Student c belongs to club activity x.
However, there may be a contradiction in this record that would cause someone to violate school rules. Akira decided to look at the first line in order and look for the first line that could be judged to be inconsistent.
Create a program that finds the number of the first line that can be determined to be inconsistent given a record of K lines.
Input
The input is given in the following format.
NMK
record1
record2
::
recordK
The first line gives the number of students N (1 ≤ N ≤ 100000), the number of club activity types M (1 ≤ M ≤ 100000), and the number of recorded lines K (1 ≤ K ≤ 200000). Each line of record, recordi, is given in the following K lines in one of the following formats:
1 a b
Or
2 c x
When the first digit is "1", it indicates that student a (1 ≤ a ≤ N) and student b (1 ≤ b ≤ N) belong to the same club activity. However, a ≠ b.
When the first digit is "2", it indicates that student c (1 ≤ c ≤ N) belongs to club activity x (1 ≤ x ≤ M).
Output
Output the number of the first line that can be determined to be inconsistent on one line. If not found, output 0 on one line.
Examples
Input
3 2 5
1 1 2
1 2 3
2 1 1
2 3 2
2 2 1
Output
4
Input
3 2 4
1 1 2
2 1 1
2 3 2
2 2 1
Output
0
Input
3 2 2
1 1 2
2 1 1
Output
0
Submitted Solution:
```
# coding=utf-8
class ClubConflictException(Exception):
pass
class Student:
def __init__(self, number):
self.name = number
self.club = -1
self.in_same_club = []
def set_club(self, clb, order_from=None):
if not self.is_belong():
self.club = clb
if not order_from is None:
try:
self.in_same_club.remove(order_from)
except ValueError:
pass
self.synchronize_club()
elif self.club == clb:
if not order_from is None:
try:
self.in_same_club.remove(order_from)
except ValueError:
pass
else:
raise ClubConflictException
def is_belong(self):
if self.club == -1:
return False
return True
def synchronize_club(self):
if not self.in_same_club:
pass
else:
to_synchro = self.in_same_club[:]
for std in to_synchro:
std.set_club(self.club, self)
self.in_same_club.remove(std)
class Club:
def __init__(self, number):
self.name = number
class Commission:
def __init__(self):
self.student_list = []
self.club_list = []
def set_same_club(self, std1, std2):
student1 = self.check_std(std1)
student2 = self.check_std(std2)
if student1.is_belong():
student2.set_club(student1.club)
elif student2.is_belong():
student1.set_club(student2.club)
else:
student1.in_same_club.append(student2)
student2.in_same_club.append(student1)
def link_std_and_club(self, std, club):
student = self.check_std(std)
clb = self.check_club(club)
student.set_club(clb)
def check_std(self, std):
if self.is_made_std(std):
return self.search_list(std, self.student_list)
return self.make_std(std)
def check_club(self, club):
if self.is_made_club(club):
return self.search_list(club, self.club_list)
return self.make_club(club)
def search_list(self, element, org_list):
list_to_dict = {elm.name: elm for elm in org_list}
return list_to_dict[element]
def is_made_std(self, std):
std_n_list = [student.name for student in self.student_list]
if std in std_n_list:
return True
return False
def make_std(self, std):
student = Student(std)
self.student_list.append(student)
return student
def is_made_club(self, clb):
club_n_list = [club.name for club in self.club_list]
if clb in club_n_list:
return True
return False
def make_club(self, club):
clb = Club(club)
self.club_list.append(clb)
return clb
if __name__ == '__main__':
N, M, K = map(int, input().split())
akira = Commission()
for i in range(1, K+1):
rtype, x1, x2 = map(int, input().split())
if rtype == 1:
try:
akira.set_same_club(x1, x2)
except ClubConflictException:
print(i)
break
elif rtype == 2:
try:
akira.link_std_and_club(x1, x2)
except ClubConflictException:
print(i)
break
else:
print(0)
```
No
| 2,387 |
Provide a correct Python 3 solution for this coding contest problem.
At the end of last year, Santa Claus forgot to give Christmas presents to the children in JOI village. Therefore, I decided to deliver the chocolate cake to the children as an apology. The day to deliver is approaching tomorrow, so it's time to come up with a move plan.
JOI village is divided into a grid shape by W roads extending straight in the north-south direction and H roads extending straight in the east-west direction. The W roads in the north-south direction are west. The numbers 1, 2, ..., W are numbered in order from the south, and the H roads in the east-west direction are numbered 1, 2, ..., H in order from the south. The intersection of the xth north-south road and the yth east-west road from the south is represented by (x, y). There are N houses in JOI village, and they are located at one of the intersections. Santa Claus can only move along the road. The time it takes to move between adjacent intersections is 1.
Every house in JOI village has children, so Santa Claus has to deliver one chocolate cake to every house in JOI village. It's a little to fly with a reindeer with an important chocolate cake. Being dangerous, Santa Claus and Reindeer landed at one of the intersections in JOI Village, where Santa Claus decided to walk to deliver the chocolate cake. Santa Claus would not carry more than one chocolate cake at the same time. In other words, Santa Claus returns to the intersection where he landed every time he delivered a chocolate cake to a house.
Santa Claus decided to choose a travel plan that would minimize the time it took to deliver the chocolate cake to all homes after landing in JOI Village. Note that the time it takes to return to the intersection after delivering the chocolate cake to the last house is not included in the time required. Also, I don't think about anything other than the time it takes to move.
input
Read the following input from standard input.
* On the first line, the integers W and H, which represent the number of roads in each direction, are written with blanks as delimiters.
* The second line contains the integer N, which represents the number of houses.
* The following N lines contain information on the location of the house. On the second line of i + (1 ≤ i ≤ N), the integers Xi and Yi are written separated by blanks, indicating that the i-th house is located at the intersection (Xi, Yi). These N intersections are all different.
output
Output the following data to standard output.
* The first line must contain one integer that represents the minimum required time.
* On the second line, when the intersection to be landed to minimize the required time is (x, y), the two integers x, y must be written in this order, separated by blanks. If there are multiple suitable intersections, the westernmost one (that is, the value of x is small), and if it is still not one, the one that is the southernmost (that is, the value of y is small). ) Choose an intersection.
Example
Input
5 4
3
1 1
3 4
5 3
Output
10
3 3
"Correct Solution:
```
from bisect import bisect_left as bl
INF = 10 ** 20
def main():
w, h = map(int, input().split())
n = int(input())
xlst = []
ylst = []
appx = xlst.append
appy = ylst.append
for i in range(n):
x, y = map(int,input().split())
appx(x)
appy(y)
sorted_xlst = sorted(xlst)
sorted_ylst = sorted(ylst)
accx = accy = 0
cum_sum_xlst = []
cum_sum_ylst = []
appx = cum_sum_xlst.append
appy = cum_sum_ylst.append
for i in range(n):
accx += sorted_xlst[i]
accy += sorted_ylst[i]
appx(accx)
appy(accy)
if n % 2:
clx = crx = sorted_xlst[n // 2]
cly = cry = sorted_ylst[n // 2]
else:
clx = sorted_xlst[n // 2 - 1]
crx = sorted_xlst[n // 2]
cly = sorted_ylst[n // 2 - 1]
cry = sorted_ylst[n // 2]
ans = ansx = ansy = INF
for i in range(n):
xi = xlst[i]
yi = ylst[i]
if xi <= clx:
cx = crx
else:
cx = clx
if yi <= cly:
cy = cry
else:
cy = cly
px = bl(sorted_xlst, cx)
py = bl(sorted_ylst, cy)
dx = xi - cx
if dx < 0:
dx = -dx
if px:
csx = cum_sum_xlst[px - 1]
xlen = (accx - csx * 2 - cx * (n - px * 2)) * 2 - dx
else:
xlen = (accx - cx * n) * 2 - dx
dy = yi - cy
if dy < 0:
dy = -dy
if py:
csy = cum_sum_ylst[py - 1]
ylen = (accy - csy * 2 - cy * (n - py * 2)) * 2 - dy
else:
ylen = (accy - cy * n) * 2 - dy
tlen = xlen + ylen
if ans > tlen:
ans = tlen
ansx = cx
ansy = cy
elif ans == tlen:
if ansx > cx:
ansx = cx
ansy = cy
elif ansx == cx:
if ansy > cy:
ansy = cy
print(ans)
print(ansx, ansy)
main()
```
| 2,388 |
Provide a correct Python 3 solution for this coding contest problem.
At the end of last year, Santa Claus forgot to give Christmas presents to the children in JOI village. Therefore, I decided to deliver the chocolate cake to the children as an apology. The day to deliver is approaching tomorrow, so it's time to come up with a move plan.
JOI village is divided into a grid shape by W roads extending straight in the north-south direction and H roads extending straight in the east-west direction. The W roads in the north-south direction are west. The numbers 1, 2, ..., W are numbered in order from the south, and the H roads in the east-west direction are numbered 1, 2, ..., H in order from the south. The intersection of the xth north-south road and the yth east-west road from the south is represented by (x, y). There are N houses in JOI village, and they are located at one of the intersections. Santa Claus can only move along the road. The time it takes to move between adjacent intersections is 1.
Every house in JOI village has children, so Santa Claus has to deliver one chocolate cake to every house in JOI village. It's a little to fly with a reindeer with an important chocolate cake. Being dangerous, Santa Claus and Reindeer landed at one of the intersections in JOI Village, where Santa Claus decided to walk to deliver the chocolate cake. Santa Claus would not carry more than one chocolate cake at the same time. In other words, Santa Claus returns to the intersection where he landed every time he delivered a chocolate cake to a house.
Santa Claus decided to choose a travel plan that would minimize the time it took to deliver the chocolate cake to all homes after landing in JOI Village. Note that the time it takes to return to the intersection after delivering the chocolate cake to the last house is not included in the time required. Also, I don't think about anything other than the time it takes to move.
input
Read the following input from standard input.
* On the first line, the integers W and H, which represent the number of roads in each direction, are written with blanks as delimiters.
* The second line contains the integer N, which represents the number of houses.
* The following N lines contain information on the location of the house. On the second line of i + (1 ≤ i ≤ N), the integers Xi and Yi are written separated by blanks, indicating that the i-th house is located at the intersection (Xi, Yi). These N intersections are all different.
output
Output the following data to standard output.
* The first line must contain one integer that represents the minimum required time.
* On the second line, when the intersection to be landed to minimize the required time is (x, y), the two integers x, y must be written in this order, separated by blanks. If there are multiple suitable intersections, the westernmost one (that is, the value of x is small), and if it is still not one, the one that is the southernmost (that is, the value of y is small). ) Choose an intersection.
Example
Input
5 4
3
1 1
3 4
5 3
Output
10
3 3
"Correct Solution:
```
from bisect import bisect_left as bl
INF = 10 ** 20
def main():
w, h = map(int, input().split())
n = int(input())
xlst = []
ylst = []
appx = xlst.append
appy = ylst.append
for i in range(n):
x, y = map(int,input().split())
appx(x)
appy(y)
sorted_xlst = sorted(xlst)
sorted_ylst = sorted(ylst)
clx = sorted_xlst[n // 2 if n % 2 else n // 2 - 1]
crx = sorted_xlst[n // 2]
cly = sorted_ylst[n // 2 if n % 2 else n // 2 - 1]
cry = sorted_ylst[n // 2]
plx = bl(sorted_xlst, clx)
prx = bl(sorted_xlst, crx)
ply = bl(sorted_ylst, cly)
pry = bl(sorted_ylst, cry)
sumx = sum(xlst)
sumy = sum(ylst)
xllen = (sumx - sum(sorted_xlst[:plx]) * 2 - clx * (n - plx * 2)) * 2
xrlen = (sumx - sum(sorted_xlst[:prx]) * 2 - crx * (n - prx * 2)) * 2
yllen = (sumy - sum(sorted_ylst[:ply]) * 2 - cly * (n - ply * 2)) * 2
yrlen = (sumy - sum(sorted_ylst[:pry]) * 2 - cry * (n - pry * 2)) * 2
ans = ansx = ansy = INF
max_sumd = 0
for i in range(n):
xi = xlst[i]
yi = ylst[i]
if xi <= clx:
cx = crx
xlen = xrlen
else:
cx = clx
xlen = xllen
if yi <= cly:
cy = cry
ylen = yrlen
else:
cy = cly
ylen = yllen
dx = xi - cx
if dx < 0:
dx = -dx
dy = yi - cy
if dy < 0:
dy = -dy
if max_sumd > dx + dy:
continue
else:
max_sumd = dx + dy
tlen = xlen + ylen - max_sumd
if ans > tlen:
ans = tlen
ansx = cx
ansy = cy
elif ans == tlen:
if ansx > cx:
ansx = cx
ansy = cy
elif ansx == cx:
if ansy > cy:
ansy = cy
print(ans)
print(ansx, ansy)
main()
```
| 2,389 |
Provide a correct Python 3 solution for this coding contest problem.
At the end of last year, Santa Claus forgot to give Christmas presents to the children in JOI village. Therefore, I decided to deliver the chocolate cake to the children as an apology. The day to deliver is approaching tomorrow, so it's time to come up with a move plan.
JOI village is divided into a grid shape by W roads extending straight in the north-south direction and H roads extending straight in the east-west direction. The W roads in the north-south direction are west. The numbers 1, 2, ..., W are numbered in order from the south, and the H roads in the east-west direction are numbered 1, 2, ..., H in order from the south. The intersection of the xth north-south road and the yth east-west road from the south is represented by (x, y). There are N houses in JOI village, and they are located at one of the intersections. Santa Claus can only move along the road. The time it takes to move between adjacent intersections is 1.
Every house in JOI village has children, so Santa Claus has to deliver one chocolate cake to every house in JOI village. It's a little to fly with a reindeer with an important chocolate cake. Being dangerous, Santa Claus and Reindeer landed at one of the intersections in JOI Village, where Santa Claus decided to walk to deliver the chocolate cake. Santa Claus would not carry more than one chocolate cake at the same time. In other words, Santa Claus returns to the intersection where he landed every time he delivered a chocolate cake to a house.
Santa Claus decided to choose a travel plan that would minimize the time it took to deliver the chocolate cake to all homes after landing in JOI Village. Note that the time it takes to return to the intersection after delivering the chocolate cake to the last house is not included in the time required. Also, I don't think about anything other than the time it takes to move.
input
Read the following input from standard input.
* On the first line, the integers W and H, which represent the number of roads in each direction, are written with blanks as delimiters.
* The second line contains the integer N, which represents the number of houses.
* The following N lines contain information on the location of the house. On the second line of i + (1 ≤ i ≤ N), the integers Xi and Yi are written separated by blanks, indicating that the i-th house is located at the intersection (Xi, Yi). These N intersections are all different.
output
Output the following data to standard output.
* The first line must contain one integer that represents the minimum required time.
* On the second line, when the intersection to be landed to minimize the required time is (x, y), the two integers x, y must be written in this order, separated by blanks. If there are multiple suitable intersections, the westernmost one (that is, the value of x is small), and if it is still not one, the one that is the southernmost (that is, the value of y is small). ) Choose an intersection.
Example
Input
5 4
3
1 1
3 4
5 3
Output
10
3 3
"Correct Solution:
```
from bisect import bisect_left as bl
INF = 10 ** 20
def main():
w, h = map(int, input().split())
n = int(input())
xlst = []
ylst = []
appx = xlst.append
appy = ylst.append
for i in range(n):
x, y = map(int,input().split())
appx(x)
appy(y)
sorted_xlst = sorted(xlst)
sorted_ylst = sorted(ylst)
accx = accy = 0
cum_sum_xlst = []
cum_sum_ylst = []
appx = cum_sum_xlst.append
appy = cum_sum_ylst.append
for i in range(n):
accx += sorted_xlst[i]
accy += sorted_ylst[i]
appx(accx)
appy(accy)
if n % 2:
clx = crx = sorted_xlst[n // 2]
cly = cry = sorted_ylst[n // 2]
else:
clx = sorted_xlst[n // 2 - 1]
crx = sorted_xlst[n // 2]
cly = sorted_ylst[n // 2 - 1]
cry = sorted_ylst[n // 2]
plx = bl(sorted_xlst, clx)
prx = bl(sorted_xlst, crx)
ply = bl(sorted_ylst, cly)
pry = bl(sorted_ylst, cry)
xllen = (accx - cum_sum_xlst[plx - 1] * 2 - clx * (n - plx * 2)) * 2 if plx != 0 else (accx - clx * n) * 2
xrlen = (accx - cum_sum_xlst[prx - 1] * 2 - crx * (n - prx * 2)) * 2 if prx != 0 else (accx - crx * n) * 2
yllen = (accy - cum_sum_ylst[ply - 1] * 2 - cly * (n - ply * 2)) * 2 if ply != 0 else (accy - cly * n) * 2
yrlen = (accy - cum_sum_ylst[pry - 1] * 2 - cry * (n - pry * 2)) * 2 if pry != 0 else (accy - cry * n) * 2
ans = ansx = ansy = INF
max_sumd = 0
for i in range(n):
xi = xlst[i]
yi = ylst[i]
if xi <= clx:
cx = crx
xlen = xrlen
else:
cx = clx
xlen = xllen
if yi <= cly:
cy = cry
ylen = yrlen
else:
cy = cly
ylen = yllen
dx = xi - cx
if dx < 0:
dx = -dx
dy = yi - cy
if dy < 0:
dy = -dy
if max_sumd > dx + dy:
continue
else:
max_sumd = dx + dy
tlen = xlen + ylen - max_sumd
if ans > tlen:
ans = tlen
ansx = cx
ansy = cy
elif ans == tlen:
if ansx > cx:
ansx = cx
ansy = cy
elif ansx == cx:
if ansy > cy:
ansy = cy
print(ans)
print(ansx, ansy)
main()
```
| 2,390 |
Provide a correct Python 3 solution for this coding contest problem.
At the end of last year, Santa Claus forgot to give Christmas presents to the children in JOI village. Therefore, I decided to deliver the chocolate cake to the children as an apology. The day to deliver is approaching tomorrow, so it's time to come up with a move plan.
JOI village is divided into a grid shape by W roads extending straight in the north-south direction and H roads extending straight in the east-west direction. The W roads in the north-south direction are west. The numbers 1, 2, ..., W are numbered in order from the south, and the H roads in the east-west direction are numbered 1, 2, ..., H in order from the south. The intersection of the xth north-south road and the yth east-west road from the south is represented by (x, y). There are N houses in JOI village, and they are located at one of the intersections. Santa Claus can only move along the road. The time it takes to move between adjacent intersections is 1.
Every house in JOI village has children, so Santa Claus has to deliver one chocolate cake to every house in JOI village. It's a little to fly with a reindeer with an important chocolate cake. Being dangerous, Santa Claus and Reindeer landed at one of the intersections in JOI Village, where Santa Claus decided to walk to deliver the chocolate cake. Santa Claus would not carry more than one chocolate cake at the same time. In other words, Santa Claus returns to the intersection where he landed every time he delivered a chocolate cake to a house.
Santa Claus decided to choose a travel plan that would minimize the time it took to deliver the chocolate cake to all homes after landing in JOI Village. Note that the time it takes to return to the intersection after delivering the chocolate cake to the last house is not included in the time required. Also, I don't think about anything other than the time it takes to move.
input
Read the following input from standard input.
* On the first line, the integers W and H, which represent the number of roads in each direction, are written with blanks as delimiters.
* The second line contains the integer N, which represents the number of houses.
* The following N lines contain information on the location of the house. On the second line of i + (1 ≤ i ≤ N), the integers Xi and Yi are written separated by blanks, indicating that the i-th house is located at the intersection (Xi, Yi). These N intersections are all different.
output
Output the following data to standard output.
* The first line must contain one integer that represents the minimum required time.
* On the second line, when the intersection to be landed to minimize the required time is (x, y), the two integers x, y must be written in this order, separated by blanks. If there are multiple suitable intersections, the westernmost one (that is, the value of x is small), and if it is still not one, the one that is the southernmost (that is, the value of y is small). ) Choose an intersection.
Example
Input
5 4
3
1 1
3 4
5 3
Output
10
3 3
"Correct Solution:
```
from bisect import bisect_left as bl
INF = 10 ** 20
def main():
w, h = map(int, input().split())
n = int(input())
xlst = []
ylst = []
appx = xlst.append
appy = ylst.append
for i in range(n):
x, y = map(int,input().split())
appx(x)
appy(y)
sorted_xlst = sorted(xlst)
sorted_ylst = sorted(ylst)
#x, yの中央値の候補
clx = sorted_xlst[n // 2 if n % 2 else n // 2 - 1]
crx = sorted_xlst[n // 2]
cly = sorted_ylst[n // 2 if n % 2 else n // 2 - 1]
cry = sorted_ylst[n // 2]
#x, yの中央値の候補のindex
ilx = bl(sorted_xlst, clx)
irx = bl(sorted_xlst, crx)
ily = bl(sorted_ylst, cly)
iry = bl(sorted_ylst, cry)
sumx = sum(xlst)
sumy = sum(ylst)
#x, yそれぞれについての中央値と各点までの往復距離の総和
xllen = (sumx - sum(sorted_xlst[:ilx]) * 2 - clx * (n - ilx * 2)) * 2
xrlen = (sumx - sum(sorted_xlst[:irx]) * 2 - crx * (n - irx * 2)) * 2
yllen = (sumy - sum(sorted_ylst[:ily]) * 2 - cly * (n - ily * 2)) * 2
yrlen = (sumy - sum(sorted_ylst[:iry]) * 2 - cry * (n - iry * 2)) * 2
ans = ansx = ansy = INF
max_sumd = 0
#各点について復路を省いた場合の距離の和を求める
for i in range(n):
xi = xlst[i]
yi = ylst[i]
cx, xlen = (crx, xrlen) if xi <= clx else (clx, xllen)
cy, ylen = (cry, yrlen) if yi <= cly else (cly, yllen)
dx = xi - cx if xi >= cx else cx - xi
dy = yi - cy if yi >= cy else cy - yi
if max_sumd > dx + dy:
continue
else:
max_sumd = dx + dy
tlen = xlen + ylen - max_sumd
if ans > tlen:
ans = tlen
ansx = cx
ansy = cy
elif ans == tlen:
if ansx > cx:
ansx = cx
ansy = cy
elif ansx == cx:
if ansy > cy:
ansy = cy
print(ans)
print(ansx, ansy)
main()
```
| 2,391 |
Provide a correct Python 3 solution for this coding contest problem.
At the end of last year, Santa Claus forgot to give Christmas presents to the children in JOI village. Therefore, I decided to deliver the chocolate cake to the children as an apology. The day to deliver is approaching tomorrow, so it's time to come up with a move plan.
JOI village is divided into a grid shape by W roads extending straight in the north-south direction and H roads extending straight in the east-west direction. The W roads in the north-south direction are west. The numbers 1, 2, ..., W are numbered in order from the south, and the H roads in the east-west direction are numbered 1, 2, ..., H in order from the south. The intersection of the xth north-south road and the yth east-west road from the south is represented by (x, y). There are N houses in JOI village, and they are located at one of the intersections. Santa Claus can only move along the road. The time it takes to move between adjacent intersections is 1.
Every house in JOI village has children, so Santa Claus has to deliver one chocolate cake to every house in JOI village. It's a little to fly with a reindeer with an important chocolate cake. Being dangerous, Santa Claus and Reindeer landed at one of the intersections in JOI Village, where Santa Claus decided to walk to deliver the chocolate cake. Santa Claus would not carry more than one chocolate cake at the same time. In other words, Santa Claus returns to the intersection where he landed every time he delivered a chocolate cake to a house.
Santa Claus decided to choose a travel plan that would minimize the time it took to deliver the chocolate cake to all homes after landing in JOI Village. Note that the time it takes to return to the intersection after delivering the chocolate cake to the last house is not included in the time required. Also, I don't think about anything other than the time it takes to move.
input
Read the following input from standard input.
* On the first line, the integers W and H, which represent the number of roads in each direction, are written with blanks as delimiters.
* The second line contains the integer N, which represents the number of houses.
* The following N lines contain information on the location of the house. On the second line of i + (1 ≤ i ≤ N), the integers Xi and Yi are written separated by blanks, indicating that the i-th house is located at the intersection (Xi, Yi). These N intersections are all different.
output
Output the following data to standard output.
* The first line must contain one integer that represents the minimum required time.
* On the second line, when the intersection to be landed to minimize the required time is (x, y), the two integers x, y must be written in this order, separated by blanks. If there are multiple suitable intersections, the westernmost one (that is, the value of x is small), and if it is still not one, the one that is the southernmost (that is, the value of y is small). ) Choose an intersection.
Example
Input
5 4
3
1 1
3 4
5 3
Output
10
3 3
"Correct Solution:
```
from bisect import bisect_left as bl
INF = 10 ** 20
def main():
w, h = map(int, input().split())
n = int(input())
xlst = []
ylst = []
appx = xlst.append
appy = ylst.append
for i in range(n):
x, y = map(int,input().split())
appx(x)
appy(y)
sorted_xlst = sorted(xlst)
sorted_ylst = sorted(ylst)
accx = accy = 0
cum_sum_xlst = []
cum_sum_ylst = []
appx = cum_sum_xlst.append
appy = cum_sum_ylst.append
for i in range(n):
accx += sorted_xlst[i]
accy += sorted_ylst[i]
appx(accx)
appy(accy)
if n % 2:
clx = crx = sorted_xlst[n // 2]
cly = cry = sorted_ylst[n // 2]
else:
clx = sorted_xlst[n // 2 - 1]
crx = sorted_xlst[n // 2]
cly = sorted_ylst[n // 2 - 1]
cry = sorted_ylst[n // 2]
plx = bl(sorted_xlst, clx)
prx = bl(sorted_xlst, crx)
ply = bl(sorted_ylst, cly)
pry = bl(sorted_ylst, cry)
ans = ansx = ansy = INF
for i in range(n):
xi = xlst[i]
yi = ylst[i]
if xi <= clx:
cx = crx
px = prx
else:
cx = clx
px = plx
if yi <= cly:
cy = cry
py = pry
else:
cy = cly
py = ply
dx = xi - cx
if dx < 0:
dx = -dx
if px:
csx = cum_sum_xlst[px - 1]
xlen = (accx - csx * 2 - cx * (n - px * 2)) * 2 - dx
else:
xlen = (accx - cx * n) * 2 - dx
dy = yi - cy
if dy < 0:
dy = -dy
if py:
csy = cum_sum_ylst[py - 1]
ylen = (accy - csy * 2 - cy * (n - py * 2)) * 2 - dy
else:
ylen = (accy - cy * n) * 2 - dy
tlen = xlen + ylen
if ans > tlen:
ans = tlen
ansx = cx
ansy = cy
elif ans == tlen:
if ansx > cx:
ansx = cx
ansy = cy
elif ansx == cx:
if ansy > cy:
ansy = cy
print(ans)
print(ansx, ansy)
main()
```
| 2,392 |
Provide a correct Python 3 solution for this coding contest problem.
At the end of last year, Santa Claus forgot to give Christmas presents to the children in JOI village. Therefore, I decided to deliver the chocolate cake to the children as an apology. The day to deliver is approaching tomorrow, so it's time to come up with a move plan.
JOI village is divided into a grid shape by W roads extending straight in the north-south direction and H roads extending straight in the east-west direction. The W roads in the north-south direction are west. The numbers 1, 2, ..., W are numbered in order from the south, and the H roads in the east-west direction are numbered 1, 2, ..., H in order from the south. The intersection of the xth north-south road and the yth east-west road from the south is represented by (x, y). There are N houses in JOI village, and they are located at one of the intersections. Santa Claus can only move along the road. The time it takes to move between adjacent intersections is 1.
Every house in JOI village has children, so Santa Claus has to deliver one chocolate cake to every house in JOI village. It's a little to fly with a reindeer with an important chocolate cake. Being dangerous, Santa Claus and Reindeer landed at one of the intersections in JOI Village, where Santa Claus decided to walk to deliver the chocolate cake. Santa Claus would not carry more than one chocolate cake at the same time. In other words, Santa Claus returns to the intersection where he landed every time he delivered a chocolate cake to a house.
Santa Claus decided to choose a travel plan that would minimize the time it took to deliver the chocolate cake to all homes after landing in JOI Village. Note that the time it takes to return to the intersection after delivering the chocolate cake to the last house is not included in the time required. Also, I don't think about anything other than the time it takes to move.
input
Read the following input from standard input.
* On the first line, the integers W and H, which represent the number of roads in each direction, are written with blanks as delimiters.
* The second line contains the integer N, which represents the number of houses.
* The following N lines contain information on the location of the house. On the second line of i + (1 ≤ i ≤ N), the integers Xi and Yi are written separated by blanks, indicating that the i-th house is located at the intersection (Xi, Yi). These N intersections are all different.
output
Output the following data to standard output.
* The first line must contain one integer that represents the minimum required time.
* On the second line, when the intersection to be landed to minimize the required time is (x, y), the two integers x, y must be written in this order, separated by blanks. If there are multiple suitable intersections, the westernmost one (that is, the value of x is small), and if it is still not one, the one that is the southernmost (that is, the value of y is small). ) Choose an intersection.
Example
Input
5 4
3
1 1
3 4
5 3
Output
10
3 3
"Correct Solution:
```
from bisect import bisect_left as bl
INF = 10 ** 20
def main():
w, h = map(int, input().split())
n = int(input())
xlst = []
ylst = []
for i in range(n):
x, y = map(int,input().split())
xlst.append(x)
ylst.append(y)
sorted_xlst = sorted(xlst)
sorted_ylst = sorted(ylst)
accx = accy = 0
cum_sum_xlst = []
cum_sum_ylst = []
for i in range(n):
accx += sorted_xlst[i]
accy += sorted_ylst[i]
cum_sum_xlst.append(accx)
cum_sum_ylst.append(accy)
if n % 2:
clx = crx = sorted_xlst[n // 2]
cly = cry = sorted_ylst[n // 2]
else:
clx = sorted_xlst[n // 2 - 1]
crx = sorted_xlst[n // 2]
cly = sorted_ylst[n // 2 - 1]
cry = sorted_ylst[n // 2]
ans = ansx = ansy = INF
for i in range(n):
xi = xlst[i]
yi = ylst[i]
if xi <= clx:
cx = crx
else:
cx = clx
if yi <= cly:
cy = cry
else:
cy = cly
px = bl(sorted_xlst, cx)
py = bl(sorted_ylst, cy)
if px:
csx = cum_sum_xlst[px - 1]
xlen = (cx * px - csx) * 2 + (accx - csx - cx * (n - px)) * 2 - abs(xi - cx)
else:
xlen = (accx - cx * n) * 2 - abs(xi - cx)
if py:
csy = cum_sum_ylst[py - 1]
ylen = (cy * py - csy) * 2 + (accy - csy - cy * (n - py)) * 2 - abs(yi - cy)
else:
ylen = (accy - cy * n) * 2 - abs(yi - cy)
tlen = xlen + ylen
if ans > tlen:
ans = tlen
ansx = cx
ansy = cy
elif ans == tlen:
if ansx > cx:
ansx = cx
ansy = cy
elif ansx == cx:
if ansy > cy:
ansy = cy
print(ans)
print(ansx, ansy)
main()
```
| 2,393 |
Provide a correct Python 3 solution for this coding contest problem.
At the end of last year, Santa Claus forgot to give Christmas presents to the children in JOI village. Therefore, I decided to deliver the chocolate cake to the children as an apology. The day to deliver is approaching tomorrow, so it's time to come up with a move plan.
JOI village is divided into a grid shape by W roads extending straight in the north-south direction and H roads extending straight in the east-west direction. The W roads in the north-south direction are west. The numbers 1, 2, ..., W are numbered in order from the south, and the H roads in the east-west direction are numbered 1, 2, ..., H in order from the south. The intersection of the xth north-south road and the yth east-west road from the south is represented by (x, y). There are N houses in JOI village, and they are located at one of the intersections. Santa Claus can only move along the road. The time it takes to move between adjacent intersections is 1.
Every house in JOI village has children, so Santa Claus has to deliver one chocolate cake to every house in JOI village. It's a little to fly with a reindeer with an important chocolate cake. Being dangerous, Santa Claus and Reindeer landed at one of the intersections in JOI Village, where Santa Claus decided to walk to deliver the chocolate cake. Santa Claus would not carry more than one chocolate cake at the same time. In other words, Santa Claus returns to the intersection where he landed every time he delivered a chocolate cake to a house.
Santa Claus decided to choose a travel plan that would minimize the time it took to deliver the chocolate cake to all homes after landing in JOI Village. Note that the time it takes to return to the intersection after delivering the chocolate cake to the last house is not included in the time required. Also, I don't think about anything other than the time it takes to move.
input
Read the following input from standard input.
* On the first line, the integers W and H, which represent the number of roads in each direction, are written with blanks as delimiters.
* The second line contains the integer N, which represents the number of houses.
* The following N lines contain information on the location of the house. On the second line of i + (1 ≤ i ≤ N), the integers Xi and Yi are written separated by blanks, indicating that the i-th house is located at the intersection (Xi, Yi). These N intersections are all different.
output
Output the following data to standard output.
* The first line must contain one integer that represents the minimum required time.
* On the second line, when the intersection to be landed to minimize the required time is (x, y), the two integers x, y must be written in this order, separated by blanks. If there are multiple suitable intersections, the westernmost one (that is, the value of x is small), and if it is still not one, the one that is the southernmost (that is, the value of y is small). ) Choose an intersection.
Example
Input
5 4
3
1 1
3 4
5 3
Output
10
3 3
"Correct Solution:
```
from bisect import bisect_left as bl
from bisect import bisect_right as br
INF = 10 ** 20
w, h = map(int, input().split())
n = int(input())
xlst = []
ylst = []
for i in range(n):
x, y = map(int,input().split())
xlst.append(x)
ylst.append(y)
sorted_xlst = sorted(xlst)
sorted_xlst_d = sorted(xlst * 2)
sorted_ylst = sorted(ylst)
sorted_ylst_d = sorted(ylst * 2)
accx = accy = 0
cum_sum_xlst = []
cum_sum_ylst = []
for i in range(n):
accx += sorted_xlst[i]
accy += sorted_ylst[i]
cum_sum_xlst.append(accx)
cum_sum_ylst.append(accy)
clx = sorted_xlst_d[n - 1]
crx = sorted_xlst_d[n]
cly = sorted_ylst_d[n - 1]
cry = sorted_ylst_d[n]
num = n * 2 - 1
ans = INF
ansx = 10 ** 10
ansy = 10 ** 10
for i in range(n):
xi = xlst[i]
yi = ylst[i]
if xi <= clx:
cx = crx
else:
cx = clx
if yi <= cly:
cy = cry
else:
cy = cly
px = bl(sorted_xlst, cx)
py = bl(sorted_ylst, cy)
if px:
xlen = (cx * px - cum_sum_xlst[px - 1]) * 2 + (accx - cum_sum_xlst[px - 1] - cx * (n - px)) * 2 - abs(xi - cx)
else:
xlen = (accx - cx * n) * 2 - abs(xi - cx)
if py:
ylen = (cy * py - cum_sum_ylst[py - 1]) * 2 + (accy - cum_sum_ylst[py - 1] - cy * (n - py)) * 2 - abs(yi - cy)
else:
ylen = (accy - cy * n) * 2 - abs(yi - cy)
tlen = xlen + ylen
if ans > tlen:
ans = tlen
ansx = cx
ansy = cy
elif ans == tlen:
if ansx > cx:
ansx = cx
ansy = cy
elif ansx == cx:
if ansy > cy:
ansy = cy
print(ans)
print(ansx, ansy)
```
| 2,394 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At the end of last year, Santa Claus forgot to give Christmas presents to the children in JOI village. Therefore, I decided to deliver the chocolate cake to the children as an apology. The day to deliver is approaching tomorrow, so it's time to come up with a move plan.
JOI village is divided into a grid shape by W roads extending straight in the north-south direction and H roads extending straight in the east-west direction. The W roads in the north-south direction are west. The numbers 1, 2, ..., W are numbered in order from the south, and the H roads in the east-west direction are numbered 1, 2, ..., H in order from the south. The intersection of the xth north-south road and the yth east-west road from the south is represented by (x, y). There are N houses in JOI village, and they are located at one of the intersections. Santa Claus can only move along the road. The time it takes to move between adjacent intersections is 1.
Every house in JOI village has children, so Santa Claus has to deliver one chocolate cake to every house in JOI village. It's a little to fly with a reindeer with an important chocolate cake. Being dangerous, Santa Claus and Reindeer landed at one of the intersections in JOI Village, where Santa Claus decided to walk to deliver the chocolate cake. Santa Claus would not carry more than one chocolate cake at the same time. In other words, Santa Claus returns to the intersection where he landed every time he delivered a chocolate cake to a house.
Santa Claus decided to choose a travel plan that would minimize the time it took to deliver the chocolate cake to all homes after landing in JOI Village. Note that the time it takes to return to the intersection after delivering the chocolate cake to the last house is not included in the time required. Also, I don't think about anything other than the time it takes to move.
input
Read the following input from standard input.
* On the first line, the integers W and H, which represent the number of roads in each direction, are written with blanks as delimiters.
* The second line contains the integer N, which represents the number of houses.
* The following N lines contain information on the location of the house. On the second line of i + (1 ≤ i ≤ N), the integers Xi and Yi are written separated by blanks, indicating that the i-th house is located at the intersection (Xi, Yi). These N intersections are all different.
output
Output the following data to standard output.
* The first line must contain one integer that represents the minimum required time.
* On the second line, when the intersection to be landed to minimize the required time is (x, y), the two integers x, y must be written in this order, separated by blanks. If there are multiple suitable intersections, the westernmost one (that is, the value of x is small), and if it is still not one, the one that is the southernmost (that is, the value of y is small). ) Choose an intersection.
Example
Input
5 4
3
1 1
3 4
5 3
Output
10
3 3
Submitted Solution:
```
import numpy
def cal_time(W, H, x, y):
return 2*(abs(W-x) + abs(H-y))
geo = input().split()
W = int(geo[0])
H = int(geo[1])
if W<1 or W>1000000000:
print("wrong W")
exit()
if H<1 or H>1000000000:
print("wrong H")
exit()
N = int(input())
if N<1 or N>100000:
print("wrong N")
exit()
total_time = 0
''' Input houses and calculate time'''
houses = []
x_list = []
y_list = []
for i in range(N):
co = input("x y: ").split()
x = int(co[0])
if x<1 or x>W:
print("wrong x")
exit()
x_list.append(x)
y = int(co[1])
if y<1 or y>H:
print("wrong y")
exit()
y_list.append(y)
if (x,y) in houses:
print("Coordinate exists")
exit()
houses.append((x,y))
#total_time += cal_time(W, H, x, y)
avg_x = numpy.mean(x_list)
avg_y = numpy.mean(y_list)
# round
target_x = int(round(avg_x))
target_y = int(round(avg_y))
#print(target_x)
#print(target_y)
all_time = []
for co in houses:
#print(co)
time = cal_time(target_x, target_y, co[0], co[1])
#print(time)
all_time.append(time)
total_time += time
total_time -= int(max(all_time)/2)
print(total_time)
print(target_x, target_y)
```
No
| 2,395 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At the end of last year, Santa Claus forgot to give Christmas presents to the children in JOI village. Therefore, I decided to deliver the chocolate cake to the children as an apology. The day to deliver is approaching tomorrow, so it's time to come up with a move plan.
JOI village is divided into a grid shape by W roads extending straight in the north-south direction and H roads extending straight in the east-west direction. The W roads in the north-south direction are west. The numbers 1, 2, ..., W are numbered in order from the south, and the H roads in the east-west direction are numbered 1, 2, ..., H in order from the south. The intersection of the xth north-south road and the yth east-west road from the south is represented by (x, y). There are N houses in JOI village, and they are located at one of the intersections. Santa Claus can only move along the road. The time it takes to move between adjacent intersections is 1.
Every house in JOI village has children, so Santa Claus has to deliver one chocolate cake to every house in JOI village. It's a little to fly with a reindeer with an important chocolate cake. Being dangerous, Santa Claus and Reindeer landed at one of the intersections in JOI Village, where Santa Claus decided to walk to deliver the chocolate cake. Santa Claus would not carry more than one chocolate cake at the same time. In other words, Santa Claus returns to the intersection where he landed every time he delivered a chocolate cake to a house.
Santa Claus decided to choose a travel plan that would minimize the time it took to deliver the chocolate cake to all homes after landing in JOI Village. Note that the time it takes to return to the intersection after delivering the chocolate cake to the last house is not included in the time required. Also, I don't think about anything other than the time it takes to move.
input
Read the following input from standard input.
* On the first line, the integers W and H, which represent the number of roads in each direction, are written with blanks as delimiters.
* The second line contains the integer N, which represents the number of houses.
* The following N lines contain information on the location of the house. On the second line of i + (1 ≤ i ≤ N), the integers Xi and Yi are written separated by blanks, indicating that the i-th house is located at the intersection (Xi, Yi). These N intersections are all different.
output
Output the following data to standard output.
* The first line must contain one integer that represents the minimum required time.
* On the second line, when the intersection to be landed to minimize the required time is (x, y), the two integers x, y must be written in this order, separated by blanks. If there are multiple suitable intersections, the westernmost one (that is, the value of x is small), and if it is still not one, the one that is the southernmost (that is, the value of y is small). ) Choose an intersection.
Example
Input
5 4
3
1 1
3 4
5 3
Output
10
3 3
Submitted Solution:
```
import numpy
def cal_time(W, H, x, y):
return 2*(abs(W-x) + abs(H-y))
geo = input("Input W H: ").split()
W = int(geo[0])
H = int(geo[1])
if W<1 or W>1000000000:
print("wrong W")
exit()
if H<1 or H>1000000000:
print("wrong H")
exit()
N = int(input("N: "))
if N<1 or N>100000:
print("wrong N")
exit()
total_time = 0
''' Input houses and calculate time'''
houses = []
x_list = []
y_list = []
for i in range(N):
co = input("x y: ").split()
x = int(co[0])
if x<1 or x>W:
print("wrong x")
exit()
x_list.append(x)
y = int(co[1])
if y<1 or y>H:
print("wrong y")
exit()
y_list.append(y)
if (x,y) in houses:
print("Coordinate exists")
exit()
houses.append((x,y))
#total_time += cal_time(W, H, x, y)
avg_x = numpy.mean(x_list)
avg_y = numpy.mean(y_list)
# round
target_x = int(round(avg_x))
target_y = int(round(avg_y))
#print(target_x)
#print(target_y)
all_time = []
for co in houses:
#print(co)
time = cal_time(target_x, target_y, co[0], co[1])
#print(time)
all_time.append(time)
total_time += time
total_time -= int(max(all_time)/2)
print(total_time)
print(target_x, target_y)
```
No
| 2,396 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At the end of last year, Santa Claus forgot to give Christmas presents to the children in JOI village. Therefore, I decided to deliver the chocolate cake to the children as an apology. The day to deliver is approaching tomorrow, so it's time to come up with a move plan.
JOI village is divided into a grid shape by W roads extending straight in the north-south direction and H roads extending straight in the east-west direction. The W roads in the north-south direction are west. The numbers 1, 2, ..., W are numbered in order from the south, and the H roads in the east-west direction are numbered 1, 2, ..., H in order from the south. The intersection of the xth north-south road and the yth east-west road from the south is represented by (x, y). There are N houses in JOI village, and they are located at one of the intersections. Santa Claus can only move along the road. The time it takes to move between adjacent intersections is 1.
Every house in JOI village has children, so Santa Claus has to deliver one chocolate cake to every house in JOI village. It's a little to fly with a reindeer with an important chocolate cake. Being dangerous, Santa Claus and Reindeer landed at one of the intersections in JOI Village, where Santa Claus decided to walk to deliver the chocolate cake. Santa Claus would not carry more than one chocolate cake at the same time. In other words, Santa Claus returns to the intersection where he landed every time he delivered a chocolate cake to a house.
Santa Claus decided to choose a travel plan that would minimize the time it took to deliver the chocolate cake to all homes after landing in JOI Village. Note that the time it takes to return to the intersection after delivering the chocolate cake to the last house is not included in the time required. Also, I don't think about anything other than the time it takes to move.
input
Read the following input from standard input.
* On the first line, the integers W and H, which represent the number of roads in each direction, are written with blanks as delimiters.
* The second line contains the integer N, which represents the number of houses.
* The following N lines contain information on the location of the house. On the second line of i + (1 ≤ i ≤ N), the integers Xi and Yi are written separated by blanks, indicating that the i-th house is located at the intersection (Xi, Yi). These N intersections are all different.
output
Output the following data to standard output.
* The first line must contain one integer that represents the minimum required time.
* On the second line, when the intersection to be landed to minimize the required time is (x, y), the two integers x, y must be written in this order, separated by blanks. If there are multiple suitable intersections, the westernmost one (that is, the value of x is small), and if it is still not one, the one that is the southernmost (that is, the value of y is small). ) Choose an intersection.
Example
Input
5 4
3
1 1
3 4
5 3
Output
10
3 3
Submitted Solution:
```
from bisect import bisect_left as bl
INF = 10 ** 20
w, h = map(int, input().split())
n = int(input())
xlst = []
ylst = []
for i in range(n):
x, y = map(int,input().split())
xlst.append(x)
ylst.append(y)
sorted_xlst = sorted(xlst)
sorted_ylst = sorted(ylst)
accx = accy = 0
cum_sum_xlst = []
cum_sum_ylst = []
for i in range(n):
accx += sorted_xlst[i]
accy += sorted_ylst[i]
cum_sum_xlst.append(accx)
cum_sum_ylst.append(accy)
#print(cum_sum_xlst)
#print(cum_sum_ylst)
sx = accx
sy = accy
num = n * 2 - 1
ans = INF
ansx = 10 ** 10
ansy = 10 ** 10
def make_lenx(avx, xi):
px = bl(sorted_xlst, avx)
if px:
lenx = (avx * px - cum_sum_xlst[px - 1]) * 2 + (sx - cum_sum_xlst[px - 1] - avx * (n - px)) * 2 - abs(xi - avx)
else:
lenx = (sx - avx * n) * 2 - abs(xi - avx)
# print("px:",px,"avx:",avx,"lenx:",lenx)
return lenx
def make_leny(avy, yi):
py = bl(sorted_ylst, avy)
if py:
leny = (avy * py - cum_sum_ylst[py - 1]) * 2 + (sy - cum_sum_ylst[py - 1] - avy * (n - py)) * 2 - abs(yi - avy)
else:
leny = (sy - avy * n) * 2 - abs(yi - avy)
# print("py:",py,"avy:",avy,"leny:",leny)
return leny
for i in range(n):
xi = xlst[i]
yi = ylst[i]
sumx = sx * 2 - xi
avx1 = sumx // num - 1
avx2 = avx1 + 1
avx3 = avx2 + 1
sumy = sy * 2 - yi
avy1 = sumy // num - 1
avy2 = avy1 + 1
avy3 = avy2 + 1
lenx1, lenx2, lenx3 = make_lenx(avx1, xi), make_lenx(avx2, xi), make_lenx(avx3, xi)
leny1, leny2, leny3 = make_leny(avy1, yi), make_leny(avy2, yi), make_leny(avy3, yi)
lenx = min(lenx1, lenx2, lenx3)
leny = min(leny1, leny2, leny3)
if lenx == lenx1:
avx = avx1
elif lenx == lenx2:
avx = avx2
else:
avx = avx3
if leny == leny1:
avy = avy1
elif leny == leny2:
avy = avy2
else:
avy = avy3
# print(lenx, leny, avx, avy)
lent = lenx + leny
if lent <= ans:
if lent == ans:
if avx < ansx:
ansx = avx
ansy = avy
elif avx == ansx:
if avy < ansy:
ansy = avy
else:
ansx = avx
ansy = avy
ans = lent
print(ans)
print(ansx, ansy)
```
No
| 2,397 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At the end of last year, Santa Claus forgot to give Christmas presents to the children in JOI village. Therefore, I decided to deliver the chocolate cake to the children as an apology. The day to deliver is approaching tomorrow, so it's time to come up with a move plan.
JOI village is divided into a grid shape by W roads extending straight in the north-south direction and H roads extending straight in the east-west direction. The W roads in the north-south direction are west. The numbers 1, 2, ..., W are numbered in order from the south, and the H roads in the east-west direction are numbered 1, 2, ..., H in order from the south. The intersection of the xth north-south road and the yth east-west road from the south is represented by (x, y). There are N houses in JOI village, and they are located at one of the intersections. Santa Claus can only move along the road. The time it takes to move between adjacent intersections is 1.
Every house in JOI village has children, so Santa Claus has to deliver one chocolate cake to every house in JOI village. It's a little to fly with a reindeer with an important chocolate cake. Being dangerous, Santa Claus and Reindeer landed at one of the intersections in JOI Village, where Santa Claus decided to walk to deliver the chocolate cake. Santa Claus would not carry more than one chocolate cake at the same time. In other words, Santa Claus returns to the intersection where he landed every time he delivered a chocolate cake to a house.
Santa Claus decided to choose a travel plan that would minimize the time it took to deliver the chocolate cake to all homes after landing in JOI Village. Note that the time it takes to return to the intersection after delivering the chocolate cake to the last house is not included in the time required. Also, I don't think about anything other than the time it takes to move.
input
Read the following input from standard input.
* On the first line, the integers W and H, which represent the number of roads in each direction, are written with blanks as delimiters.
* The second line contains the integer N, which represents the number of houses.
* The following N lines contain information on the location of the house. On the second line of i + (1 ≤ i ≤ N), the integers Xi and Yi are written separated by blanks, indicating that the i-th house is located at the intersection (Xi, Yi). These N intersections are all different.
output
Output the following data to standard output.
* The first line must contain one integer that represents the minimum required time.
* On the second line, when the intersection to be landed to minimize the required time is (x, y), the two integers x, y must be written in this order, separated by blanks. If there are multiple suitable intersections, the westernmost one (that is, the value of x is small), and if it is still not one, the one that is the southernmost (that is, the value of y is small). ) Choose an intersection.
Example
Input
5 4
3
1 1
3 4
5 3
Output
10
3 3
Submitted Solution:
```
import numpy
def cal_time(W, H, x, y):
return 2*(abs(W-x) + abs(H-y))
geo = input().split()
W = int(geo[0])
H = int(geo[1])
if W<1 or W>1000000000:
print("wrong W")
exit()
if H<1 or H>1000000000:
print("wrong H")
exit()
N = int(input())
if N<1 or N>100000:
print("wrong N")
exit()
total_time = 0
''' Input houses and calculate time'''
houses = []
x_list = []
y_list = []
for i in range(N):
co = input().split()
x = int(co[0])
if x<1 or x>W:
print("wrong x")
exit()
x_list.append(x)
y = int(co[1])
if y<1 or y>H:
print("wrong y")
exit()
y_list.append(y)
if (x,y) in houses:
print("Coordinate exists")
exit()
houses.append((x,y))
#total_time += cal_time(W, H, x, y)
avg_x = numpy.mean(x_list)
avg_y = numpy.mean(y_list)
# round
target_x = int(round(avg_x))
target_y = int(round(avg_y))
#print(target_x)
#print(target_y)
all_time = []
for co in houses:
#print(co)
time = cal_time(target_x, target_y, co[0], co[1])
#print(time)
all_time.append(time)
total_time += time
total_time -= int(max(all_time)/2)
print(total_time)
print(target_x, target_y)
```
No
| 2,398 |
Provide a correct Python 3 solution for this coding contest problem.
An old document says that a Ninja House in Kanazawa City was in fact a defensive fortress, which was designed like a maze. Its rooms were connected by hidden doors in a complicated manner, so that any invader would become lost. Each room has at least two doors.
The Ninja House can be modeled by a graph, as shown in Figure l. A circle represents a room. Each line connecting two circles represents a door between two rooms.
<image> Figure l. Graph Model of Ninja House. | Figure 2. Ninja House exploration.
---|---
I decided to draw a map, since no map was available. Your mission is to help me draw a map from the record of my exploration.
I started exploring by entering a single entrance that was open to the outside. The path I walked is schematically shown in Figure 2, by a line with arrows. The rules for moving between rooms are described below.
After entering a room, I first open the rightmost door and move to the next room. However, if the next room has already been visited, I close the door without entering, and open the next rightmost door, and so on. When I have inspected all the doors of a room, I go back through the door I used to enter the room.
I have a counter with me to memorize the distance from the first room. The counter is incremented when I enter a new room, and decremented when I go back from a room. In Figure 2, each number in parentheses is the value of the counter when I have entered the room, i.e., the distance from the first room. In contrast, the numbers not in parentheses represent the order of my visit.
I take a record of my exploration. Every time I open a door, I record a single number, according to the following rules.
1. If the opposite side of the door is a new room, I record the number of doors in that room, which is a positive number.
2. If it is an already visited room, say R, I record ``the distance of R from the first room'' minus ``the distance of the current room from the first room'', which is a negative number.
In the example shown in Figure 2, as the first room has three doors connecting other rooms, I initially record ``3''. Then when I move to the second, third, and fourth rooms, which all have three doors, I append ``3 3 3'' to the record. When I skip the entry from the fourth room to the first room, the distance difference ``-3'' (minus three) will be appended, and so on. So, when I finish this exploration, its record is a sequence of numbers ``3 3 3 3 -3 3 2 -5 3 2 -5 -3''.
There are several dozens of Ninja Houses in the city. Given a sequence of numbers for each of these houses, you should produce a graph for each house.
Input
The first line of the input is a single integer n, indicating the number of records of Ninja Houses I have visited. You can assume that n is less than 100. Each of the following n records consists of numbers recorded on one exploration and a zero as a terminator. Each record consists of one or more lines whose lengths are less than 1000 characters. Each number is delimited by a space or a newline. You can assume that the number of rooms for each Ninja House is less than 100, and the number of doors in each room is less than 40.
Output
For each Ninja House of m rooms, the output should consist of m lines. The j-th line of each such m lines should look as follows:
i r1 r2 ... rki
where r1, ... , rki should be rooms adjoining room i, and ki should be the number of doors in room i. Numbers should be separated by exactly one space character. The rooms should be numbered from 1 in visited order. r1, r2, ... , rki should be in ascending order. Note that the room i may be connected to another room through more than one door. In this case, that room number should appear in r1, ... , rki as many times as it is connected by different doors.
Example
Input
2
3 3 3 3 -3 3 2 -5 3 2 -5 -3 0
3 5 4 -2 4 -3 -2 -2 -1 0
Output
1 2 4 6
2 1 3 8
3 2 4 7
4 1 3 5
5 4 6 7
6 1 5
7 3 5 8
8 2 7
1 2 3 4
2 1 3 3 4 4
3 1 2 2 4
4 1 2 2 3
"Correct Solution:
```
N = int(input())
for i in range(N):
L = []
while 1:
*s, = map(int, input().split())
if s[-1] == 0:
L.extend(s[:-1])
break
L.extend(s)
G = []
st = []
cur = 0
for s in L:
if s > 0:
G.append([])
if st:
u = [cur, s-1]
v = st[-1]
v[1] -= 1
G[u[0]].append(v[0])
G[v[0]].append(u[0])
st.append(u)
while st and st[-1][1] == 0:
st.pop()
else:
st.append([cur, s])
cur += 1
continue
u = st[s-1]; u[1] -= 1
v = st[-1]; v[1] -= 1
G[u[0]].append(v[0])
G[v[0]].append(u[0])
while st and st[-1][1] == 0:
st.pop()
for i, vs in enumerate(G):
vs.sort()
print(i+1, *map(lambda x: x+1, vs))
```
| 2,399 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.