message stringlengths 2 22.7k | message_type stringclasses 2 values | message_id int64 0 1 | conversation_id int64 145 109k | cluster float64 9 9 | __index_level_0__ int64 290 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in such a way that each friend receives the same amount of candies in total?
Note, that you can't keep bags for yourself or throw them away, each bag should be given to one of the friends.
Input
The only line contains four integers a_1, a_2, a_3 and a_4 (1 ≤ a_i ≤ 100) — the numbers of candies in each bag.
Output
Output YES if it's possible to give the bags to Dawid's friends so that both friends receive the same amount of candies, or NO otherwise. Each character can be printed in any case (either uppercase or lowercase).
Examples
Input
1 7 11 5
Output
YES
Input
7 3 2 5
Output
NO
Note
In the first sample test, Dawid can give the first and the third bag to the first friend, and the second and the fourth bag to the second friend. This way, each friend will receive 12 candies.
In the second sample test, it's impossible to distribute the bags.
Submitted Solution:
```
a, b, c, d = map(int, input().split())
if a + b == c + d or a + c == b + d or a + d == b + c:
print('YES')
else:
print('NO')
``` | instruction | 0 | 17,792 | 9 | 35,584 |
No | output | 1 | 17,792 | 9 | 35,585 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in such a way that each friend receives the same amount of candies in total?
Note, that you can't keep bags for yourself or throw them away, each bag should be given to one of the friends.
Input
The only line contains four integers a_1, a_2, a_3 and a_4 (1 ≤ a_i ≤ 100) — the numbers of candies in each bag.
Output
Output YES if it's possible to give the bags to Dawid's friends so that both friends receive the same amount of candies, or NO otherwise. Each character can be printed in any case (either uppercase or lowercase).
Examples
Input
1 7 11 5
Output
YES
Input
7 3 2 5
Output
NO
Note
In the first sample test, Dawid can give the first and the third bag to the first friend, and the second and the fourth bag to the second friend. This way, each friend will receive 12 candies.
In the second sample test, it's impossible to distribute the bags.
Submitted Solution:
```
a1, a2, a3, a4 = map(int, input().split())
if sum([a1, a2, a3, a4]) % 2 != 0:
print('NO')
else:
if (a1 + a3 == a2 + a4 or
a1 + a4 == a2 + a3 or
a1 + a2 == a3 + a4):
print('YES')
else:
print('NO')
``` | instruction | 0 | 17,793 | 9 | 35,586 |
No | output | 1 | 17,793 | 9 | 35,587 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in such a way that each friend receives the same amount of candies in total?
Note, that you can't keep bags for yourself or throw them away, each bag should be given to one of the friends.
Input
The only line contains four integers a_1, a_2, a_3 and a_4 (1 ≤ a_i ≤ 100) — the numbers of candies in each bag.
Output
Output YES if it's possible to give the bags to Dawid's friends so that both friends receive the same amount of candies, or NO otherwise. Each character can be printed in any case (either uppercase or lowercase).
Examples
Input
1 7 11 5
Output
YES
Input
7 3 2 5
Output
NO
Note
In the first sample test, Dawid can give the first and the third bag to the first friend, and the second and the fourth bag to the second friend. This way, each friend will receive 12 candies.
In the second sample test, it's impossible to distribute the bags.
Submitted Solution:
```
a=list(map(int,input().split()))
b=max(a)
if a[0]+a[1]==a[2]+a[3]:
print("YES")
elif a[0]+a[2]==a[1]+a[3]:
print("YES")
elif a[0]+a[3]==a[1]+a[2]:
print("YES")
a.remove(b)
c=sum(a)
if c==a:
print("YES")
else:
print("NO")
``` | instruction | 0 | 17,794 | 9 | 35,588 |
No | output | 1 | 17,794 | 9 | 35,589 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.
The shop sells N kinds of cakes.
Each kind of cake has three parameters "beauty", "tastiness" and "popularity". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.
These values may be zero or negative.
Ringo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:
* Do not have two or more pieces of the same kind of cake.
* Under the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).
Find the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Constraints
* N is an integer between 1 and 1 \ 000 (inclusive).
* M is an integer between 0 and N (inclusive).
* x_i, y_i, z_i \ (1 \leq i \leq N) are integers between -10 \ 000 \ 000 \ 000 and 10 \ 000 \ 000 \ 000 (inclusive).
Input
Input is given from Standard Input in the following format:
N M
x_1 y_1 z_1
x_2 y_2 z_2
: :
x_N y_N z_N
Output
Print the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Examples
Input
5 3
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
Output
56
Input
5 3
1 -2 3
-4 5 -6
7 -8 -9
-10 11 -12
13 -14 15
Output
54
Input
10 5
10 -80 21
23 8 38
-94 28 11
-26 -2 18
-69 72 79
-26 -86 -54
-72 -50 59
21 65 -32
40 -94 87
-62 18 82
Output
638
Input
3 2
2000000000 -9000000000 4000000000
7000000000 -5000000000 3000000000
6000000000 -1000000000 8000000000
Output
30000000000 | instruction | 0 | 18,371 | 9 | 36,742 |
"Correct Solution:
```
from itertools import product
from operator import mul
SGN = (-1, 1)
N, M = map(int, input().split())
e = [list(map(int, input().split())) for _ in range(N)]
ans = -1
for sgns in product(SGN, repeat=3):
t = [sum(map(mul, ee, sgns)) for ee in e]
ans = max(ans, sum(sorted(t, reverse=True)[:M]))
print(ans)
``` | output | 1 | 18,371 | 9 | 36,743 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.
The shop sells N kinds of cakes.
Each kind of cake has three parameters "beauty", "tastiness" and "popularity". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.
These values may be zero or negative.
Ringo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:
* Do not have two or more pieces of the same kind of cake.
* Under the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).
Find the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Constraints
* N is an integer between 1 and 1 \ 000 (inclusive).
* M is an integer between 0 and N (inclusive).
* x_i, y_i, z_i \ (1 \leq i \leq N) are integers between -10 \ 000 \ 000 \ 000 and 10 \ 000 \ 000 \ 000 (inclusive).
Input
Input is given from Standard Input in the following format:
N M
x_1 y_1 z_1
x_2 y_2 z_2
: :
x_N y_N z_N
Output
Print the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Examples
Input
5 3
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
Output
56
Input
5 3
1 -2 3
-4 5 -6
7 -8 -9
-10 11 -12
13 -14 15
Output
54
Input
10 5
10 -80 21
23 8 38
-94 28 11
-26 -2 18
-69 72 79
-26 -86 -54
-72 -50 59
21 65 -32
40 -94 87
-62 18 82
Output
638
Input
3 2
2000000000 -9000000000 4000000000
7000000000 -5000000000 3000000000
6000000000 -1000000000 8000000000
Output
30000000000 | instruction | 0 | 18,372 | 9 | 36,744 |
"Correct Solution:
```
n,m=map(int,input().split())
a=[0]*n
b=[0]*n
c=[0]*n
for i in range(n):
a[i],b[i],c[i]=map(int,input().split())
ans=0
for i in range(2):
for j in range(2):
for k in range(2):
lis=sorted([x*(-1)**i + y*(-1)**j + z*(-1)**k for x,y,z in zip(a,b,c)])
lis=lis[n-m:]
ans=max(sum(lis),ans)
print(ans)
``` | output | 1 | 18,372 | 9 | 36,745 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.
The shop sells N kinds of cakes.
Each kind of cake has three parameters "beauty", "tastiness" and "popularity". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.
These values may be zero or negative.
Ringo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:
* Do not have two or more pieces of the same kind of cake.
* Under the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).
Find the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Constraints
* N is an integer between 1 and 1 \ 000 (inclusive).
* M is an integer between 0 and N (inclusive).
* x_i, y_i, z_i \ (1 \leq i \leq N) are integers between -10 \ 000 \ 000 \ 000 and 10 \ 000 \ 000 \ 000 (inclusive).
Input
Input is given from Standard Input in the following format:
N M
x_1 y_1 z_1
x_2 y_2 z_2
: :
x_N y_N z_N
Output
Print the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Examples
Input
5 3
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
Output
56
Input
5 3
1 -2 3
-4 5 -6
7 -8 -9
-10 11 -12
13 -14 15
Output
54
Input
10 5
10 -80 21
23 8 38
-94 28 11
-26 -2 18
-69 72 79
-26 -86 -54
-72 -50 59
21 65 -32
40 -94 87
-62 18 82
Output
638
Input
3 2
2000000000 -9000000000 4000000000
7000000000 -5000000000 3000000000
6000000000 -1000000000 8000000000
Output
30000000000 | instruction | 0 | 18,373 | 9 | 36,746 |
"Correct Solution:
```
n, m = map(int, input().split())
A = [[int(i) for i in input().split()] for i in range(n)]
B = []
def f(x):
if x % 2 == 0:
return 1
else:
return -1
for i in range(8):
temp = sorted([f(i // 4) * x + f(i // 2) * y + f(i) * z for x, y, z in A], reverse=True)
B.append(sum(temp[:m]))
print(max(B))
``` | output | 1 | 18,373 | 9 | 36,747 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.
The shop sells N kinds of cakes.
Each kind of cake has three parameters "beauty", "tastiness" and "popularity". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.
These values may be zero or negative.
Ringo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:
* Do not have two or more pieces of the same kind of cake.
* Under the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).
Find the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Constraints
* N is an integer between 1 and 1 \ 000 (inclusive).
* M is an integer between 0 and N (inclusive).
* x_i, y_i, z_i \ (1 \leq i \leq N) are integers between -10 \ 000 \ 000 \ 000 and 10 \ 000 \ 000 \ 000 (inclusive).
Input
Input is given from Standard Input in the following format:
N M
x_1 y_1 z_1
x_2 y_2 z_2
: :
x_N y_N z_N
Output
Print the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Examples
Input
5 3
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
Output
56
Input
5 3
1 -2 3
-4 5 -6
7 -8 -9
-10 11 -12
13 -14 15
Output
54
Input
10 5
10 -80 21
23 8 38
-94 28 11
-26 -2 18
-69 72 79
-26 -86 -54
-72 -50 59
21 65 -32
40 -94 87
-62 18 82
Output
638
Input
3 2
2000000000 -9000000000 4000000000
7000000000 -5000000000 3000000000
6000000000 -1000000000 8000000000
Output
30000000000 | instruction | 0 | 18,374 | 9 | 36,748 |
"Correct Solution:
```
N,M=map(int,input().split())
XYZ=[list(map(int,input().split())) for _ in range(N)]
maxpoint=0
var=[(1,1,1),(1,1,-1),(1,-1,1),(-1,1,1),(1,-1,-1),(-1,1,-1),(-1,-1,1),(-1,-1,-1)]
for (dx,dy,dz) in var:
sumXYZ=[dx*x+dy*y+dz*z for x,y,z in XYZ]
maxpoint=max(maxpoint,sum(sorted(sumXYZ,reverse=True)[:M]))
print(maxpoint)
``` | output | 1 | 18,374 | 9 | 36,749 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.
The shop sells N kinds of cakes.
Each kind of cake has three parameters "beauty", "tastiness" and "popularity". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.
These values may be zero or negative.
Ringo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:
* Do not have two or more pieces of the same kind of cake.
* Under the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).
Find the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Constraints
* N is an integer between 1 and 1 \ 000 (inclusive).
* M is an integer between 0 and N (inclusive).
* x_i, y_i, z_i \ (1 \leq i \leq N) are integers between -10 \ 000 \ 000 \ 000 and 10 \ 000 \ 000 \ 000 (inclusive).
Input
Input is given from Standard Input in the following format:
N M
x_1 y_1 z_1
x_2 y_2 z_2
: :
x_N y_N z_N
Output
Print the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Examples
Input
5 3
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
Output
56
Input
5 3
1 -2 3
-4 5 -6
7 -8 -9
-10 11 -12
13 -14 15
Output
54
Input
10 5
10 -80 21
23 8 38
-94 28 11
-26 -2 18
-69 72 79
-26 -86 -54
-72 -50 59
21 65 -32
40 -94 87
-62 18 82
Output
638
Input
3 2
2000000000 -9000000000 4000000000
7000000000 -5000000000 3000000000
6000000000 -1000000000 8000000000
Output
30000000000 | instruction | 0 | 18,375 | 9 | 36,750 |
"Correct Solution:
```
N,M=map(int,input().split())
XYZ=[list(map(int,input().split())) for i in range(N)]
pm={'0':1,'1':-1}
ans=0
for i in range(2**3):
ibin = format(i, '03b')
tmp=sorted([pm[ibin[0]]*x+pm[ibin[1]]*y+pm[ibin[2]]*z for x,y,z in XYZ],reverse=True)
ans=sum(tmp[:M]) if ans<sum(tmp[:M]) else ans
print(ans)
``` | output | 1 | 18,375 | 9 | 36,751 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.
The shop sells N kinds of cakes.
Each kind of cake has three parameters "beauty", "tastiness" and "popularity". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.
These values may be zero or negative.
Ringo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:
* Do not have two or more pieces of the same kind of cake.
* Under the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).
Find the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Constraints
* N is an integer between 1 and 1 \ 000 (inclusive).
* M is an integer between 0 and N (inclusive).
* x_i, y_i, z_i \ (1 \leq i \leq N) are integers between -10 \ 000 \ 000 \ 000 and 10 \ 000 \ 000 \ 000 (inclusive).
Input
Input is given from Standard Input in the following format:
N M
x_1 y_1 z_1
x_2 y_2 z_2
: :
x_N y_N z_N
Output
Print the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Examples
Input
5 3
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
Output
56
Input
5 3
1 -2 3
-4 5 -6
7 -8 -9
-10 11 -12
13 -14 15
Output
54
Input
10 5
10 -80 21
23 8 38
-94 28 11
-26 -2 18
-69 72 79
-26 -86 -54
-72 -50 59
21 65 -32
40 -94 87
-62 18 82
Output
638
Input
3 2
2000000000 -9000000000 4000000000
7000000000 -5000000000 3000000000
6000000000 -1000000000 8000000000
Output
30000000000 | instruction | 0 | 18,376 | 9 | 36,752 |
"Correct Solution:
```
from itertools import product
N, M = map(int,input().split())
cakes = []
for _ in range(N):
cakes.append(list(map(int,input().split())))
ans = 0
for i, j, k in product([-1,1], repeat = 3):
L = []
for x, y, z in cakes:
L.append(i * x + j * y + k * z)
L.sort(reverse = True)
ans = max(ans, sum(L[:M]))
L.clear()
print(ans)
``` | output | 1 | 18,376 | 9 | 36,753 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.
The shop sells N kinds of cakes.
Each kind of cake has three parameters "beauty", "tastiness" and "popularity". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.
These values may be zero or negative.
Ringo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:
* Do not have two or more pieces of the same kind of cake.
* Under the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).
Find the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Constraints
* N is an integer between 1 and 1 \ 000 (inclusive).
* M is an integer between 0 and N (inclusive).
* x_i, y_i, z_i \ (1 \leq i \leq N) are integers between -10 \ 000 \ 000 \ 000 and 10 \ 000 \ 000 \ 000 (inclusive).
Input
Input is given from Standard Input in the following format:
N M
x_1 y_1 z_1
x_2 y_2 z_2
: :
x_N y_N z_N
Output
Print the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Examples
Input
5 3
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
Output
56
Input
5 3
1 -2 3
-4 5 -6
7 -8 -9
-10 11 -12
13 -14 15
Output
54
Input
10 5
10 -80 21
23 8 38
-94 28 11
-26 -2 18
-69 72 79
-26 -86 -54
-72 -50 59
21 65 -32
40 -94 87
-62 18 82
Output
638
Input
3 2
2000000000 -9000000000 4000000000
7000000000 -5000000000 3000000000
6000000000 -1000000000 8000000000
Output
30000000000 | instruction | 0 | 18,377 | 9 | 36,754 |
"Correct Solution:
```
N, M = map(int, input().split())
List = [list(map(int, input().split())) for _ in range(N)]
from itertools import product
ans = 0
for a, b, c in product([1, -1], repeat=3):
tmp = []
for x, y, z in List:
tmp.append(a*x+b*y+c*z)
tmp.sort(reverse=True)
ans = max(ans, sum(tmp[:M]))
print(ans)
``` | output | 1 | 18,377 | 9 | 36,755 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.
The shop sells N kinds of cakes.
Each kind of cake has three parameters "beauty", "tastiness" and "popularity". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.
These values may be zero or negative.
Ringo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:
* Do not have two or more pieces of the same kind of cake.
* Under the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).
Find the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Constraints
* N is an integer between 1 and 1 \ 000 (inclusive).
* M is an integer between 0 and N (inclusive).
* x_i, y_i, z_i \ (1 \leq i \leq N) are integers between -10 \ 000 \ 000 \ 000 and 10 \ 000 \ 000 \ 000 (inclusive).
Input
Input is given from Standard Input in the following format:
N M
x_1 y_1 z_1
x_2 y_2 z_2
: :
x_N y_N z_N
Output
Print the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Examples
Input
5 3
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
Output
56
Input
5 3
1 -2 3
-4 5 -6
7 -8 -9
-10 11 -12
13 -14 15
Output
54
Input
10 5
10 -80 21
23 8 38
-94 28 11
-26 -2 18
-69 72 79
-26 -86 -54
-72 -50 59
21 65 -32
40 -94 87
-62 18 82
Output
638
Input
3 2
2000000000 -9000000000 4000000000
7000000000 -5000000000 3000000000
6000000000 -1000000000 8000000000
Output
30000000000 | instruction | 0 | 18,378 | 9 | 36,756 |
"Correct Solution:
```
N, M = map(int, input().split())
XYZs = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for op in range(1 << 3):
lst = []
for xyz in XYZs:
v = 0
for j in range(3):
v += xyz[j] * ((-1) ** ((op >> j) & 1))
lst.append(v)
ans = max(ans, sum(sorted(lst, reverse=True)[:M]))
print(ans)
``` | output | 1 | 18,378 | 9 | 36,757 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.
The shop sells N kinds of cakes.
Each kind of cake has three parameters "beauty", "tastiness" and "popularity". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.
These values may be zero or negative.
Ringo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:
* Do not have two or more pieces of the same kind of cake.
* Under the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).
Find the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Constraints
* N is an integer between 1 and 1 \ 000 (inclusive).
* M is an integer between 0 and N (inclusive).
* x_i, y_i, z_i \ (1 \leq i \leq N) are integers between -10 \ 000 \ 000 \ 000 and 10 \ 000 \ 000 \ 000 (inclusive).
Input
Input is given from Standard Input in the following format:
N M
x_1 y_1 z_1
x_2 y_2 z_2
: :
x_N y_N z_N
Output
Print the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Examples
Input
5 3
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
Output
56
Input
5 3
1 -2 3
-4 5 -6
7 -8 -9
-10 11 -12
13 -14 15
Output
54
Input
10 5
10 -80 21
23 8 38
-94 28 11
-26 -2 18
-69 72 79
-26 -86 -54
-72 -50 59
21 65 -32
40 -94 87
-62 18 82
Output
638
Input
3 2
2000000000 -9000000000 4000000000
7000000000 -5000000000 3000000000
6000000000 -1000000000 8000000000
Output
30000000000
Submitted Solution:
```
n,m = map(int,input().split())
xyz = [list(map(int,input().split())) for i in range(n)]
ans = 0
for i in range(8):
s = []
for j in range(n):
a = 0
for k in range(3):
if i>>k&1:
a += xyz[j][k]
else:
a -= xyz[j][k]
s.append(a)
s.sort()
ans = max(ans,sum(s[n-m:]))
print(ans)
``` | instruction | 0 | 18,379 | 9 | 36,758 |
Yes | output | 1 | 18,379 | 9 | 36,759 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.
The shop sells N kinds of cakes.
Each kind of cake has three parameters "beauty", "tastiness" and "popularity". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.
These values may be zero or negative.
Ringo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:
* Do not have two or more pieces of the same kind of cake.
* Under the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).
Find the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Constraints
* N is an integer between 1 and 1 \ 000 (inclusive).
* M is an integer between 0 and N (inclusive).
* x_i, y_i, z_i \ (1 \leq i \leq N) are integers between -10 \ 000 \ 000 \ 000 and 10 \ 000 \ 000 \ 000 (inclusive).
Input
Input is given from Standard Input in the following format:
N M
x_1 y_1 z_1
x_2 y_2 z_2
: :
x_N y_N z_N
Output
Print the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Examples
Input
5 3
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
Output
56
Input
5 3
1 -2 3
-4 5 -6
7 -8 -9
-10 11 -12
13 -14 15
Output
54
Input
10 5
10 -80 21
23 8 38
-94 28 11
-26 -2 18
-69 72 79
-26 -86 -54
-72 -50 59
21 65 -32
40 -94 87
-62 18 82
Output
638
Input
3 2
2000000000 -9000000000 4000000000
7000000000 -5000000000 3000000000
6000000000 -1000000000 8000000000
Output
30000000000
Submitted Solution:
```
N, M = map(int, input().split())
XYZ = [list(map(int, input().split())) for _ in range(N)]
ans = -float('inf')
patterns = [[a, b, c] for a in [-1, +1] for b in [-1, 1] for c in [-1, 1]]
for a, b, c in patterns:
values = [a*x+b*y+c*z for x, y, z in XYZ]
ans = max(ans, sum(sorted(values, reverse=True)[:M]))
print(ans)
``` | instruction | 0 | 18,380 | 9 | 36,760 |
Yes | output | 1 | 18,380 | 9 | 36,761 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.
The shop sells N kinds of cakes.
Each kind of cake has three parameters "beauty", "tastiness" and "popularity". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.
These values may be zero or negative.
Ringo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:
* Do not have two or more pieces of the same kind of cake.
* Under the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).
Find the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Constraints
* N is an integer between 1 and 1 \ 000 (inclusive).
* M is an integer between 0 and N (inclusive).
* x_i, y_i, z_i \ (1 \leq i \leq N) are integers between -10 \ 000 \ 000 \ 000 and 10 \ 000 \ 000 \ 000 (inclusive).
Input
Input is given from Standard Input in the following format:
N M
x_1 y_1 z_1
x_2 y_2 z_2
: :
x_N y_N z_N
Output
Print the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Examples
Input
5 3
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
Output
56
Input
5 3
1 -2 3
-4 5 -6
7 -8 -9
-10 11 -12
13 -14 15
Output
54
Input
10 5
10 -80 21
23 8 38
-94 28 11
-26 -2 18
-69 72 79
-26 -86 -54
-72 -50 59
21 65 -32
40 -94 87
-62 18 82
Output
638
Input
3 2
2000000000 -9000000000 4000000000
7000000000 -5000000000 3000000000
6000000000 -1000000000 8000000000
Output
30000000000
Submitted Solution:
```
n, m = map(int, input().split())
cakes = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for i in range(8):
a = []
for x, y, z in cakes:
if i & 1 << 0: x *= -1
if i & 1 << 1: y *= -1
if i & 1 << 2: z *= -1
a.append(x + y + z)
a.sort(reverse=True)
ans = max(ans, sum(a[:m]))
print(ans)
``` | instruction | 0 | 18,381 | 9 | 36,762 |
Yes | output | 1 | 18,381 | 9 | 36,763 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.
The shop sells N kinds of cakes.
Each kind of cake has three parameters "beauty", "tastiness" and "popularity". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.
These values may be zero or negative.
Ringo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:
* Do not have two or more pieces of the same kind of cake.
* Under the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).
Find the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Constraints
* N is an integer between 1 and 1 \ 000 (inclusive).
* M is an integer between 0 and N (inclusive).
* x_i, y_i, z_i \ (1 \leq i \leq N) are integers between -10 \ 000 \ 000 \ 000 and 10 \ 000 \ 000 \ 000 (inclusive).
Input
Input is given from Standard Input in the following format:
N M
x_1 y_1 z_1
x_2 y_2 z_2
: :
x_N y_N z_N
Output
Print the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Examples
Input
5 3
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
Output
56
Input
5 3
1 -2 3
-4 5 -6
7 -8 -9
-10 11 -12
13 -14 15
Output
54
Input
10 5
10 -80 21
23 8 38
-94 28 11
-26 -2 18
-69 72 79
-26 -86 -54
-72 -50 59
21 65 -32
40 -94 87
-62 18 82
Output
638
Input
3 2
2000000000 -9000000000 4000000000
7000000000 -5000000000 3000000000
6000000000 -1000000000 8000000000
Output
30000000000
Submitted Solution:
```
import itertools
n, m = map(int, input().split())
pice = []
for _ in range(n):
x, y, z = map(int, input().split())
pice.append((x, y, z))
ans = 0
for i, j, k in itertools.product((-1, 1), repeat=3):
a = [x * i + y * j + z * k for (x, y, z) in pice]
a.sort()
ans = max(ans, abs(sum(a[0:m])))
print(ans)
``` | instruction | 0 | 18,382 | 9 | 36,764 |
Yes | output | 1 | 18,382 | 9 | 36,765 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.
The shop sells N kinds of cakes.
Each kind of cake has three parameters "beauty", "tastiness" and "popularity". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.
These values may be zero or negative.
Ringo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:
* Do not have two or more pieces of the same kind of cake.
* Under the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).
Find the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Constraints
* N is an integer between 1 and 1 \ 000 (inclusive).
* M is an integer between 0 and N (inclusive).
* x_i, y_i, z_i \ (1 \leq i \leq N) are integers between -10 \ 000 \ 000 \ 000 and 10 \ 000 \ 000 \ 000 (inclusive).
Input
Input is given from Standard Input in the following format:
N M
x_1 y_1 z_1
x_2 y_2 z_2
: :
x_N y_N z_N
Output
Print the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Examples
Input
5 3
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
Output
56
Input
5 3
1 -2 3
-4 5 -6
7 -8 -9
-10 11 -12
13 -14 15
Output
54
Input
10 5
10 -80 21
23 8 38
-94 28 11
-26 -2 18
-69 72 79
-26 -86 -54
-72 -50 59
21 65 -32
40 -94 87
-62 18 82
Output
638
Input
3 2
2000000000 -9000000000 4000000000
7000000000 -5000000000 3000000000
6000000000 -1000000000 8000000000
Output
30000000000
Submitted Solution:
```
N, M = map(int, input().split())
XYZ = [list(map(int, input().split())) for i in range(N)]
X = [XYZ[i][0] for i in range(N)]
Y = [XYZ[i][1] for i in range(N)]
Z = [XYZ[i][2] for i in range(N)]
ans = 0
for i in range(2**M - 1, 2**N - 2**(N - M) + 1):
b = bin(i)[2:]
if len(b) != N:
f = [0 for i in range(N-len(b))] + [int(a) for a in b]
else:
f = [int(a) for a in b]
if sum(f) == M:
ans_x = abs(sum([x * y for x, y in zip(X, f)]))
ans_y = abs(sum([x * y for x, y in zip(Y, f)]))
ans_z = abs(sum([x * y for x, y in zip(Z, f)]))
ans = max(ans, (ans_x + ans_y + ans_z))
print(ans)
``` | instruction | 0 | 18,383 | 9 | 36,766 |
No | output | 1 | 18,383 | 9 | 36,767 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.
The shop sells N kinds of cakes.
Each kind of cake has three parameters "beauty", "tastiness" and "popularity". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.
These values may be zero or negative.
Ringo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:
* Do not have two or more pieces of the same kind of cake.
* Under the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).
Find the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Constraints
* N is an integer between 1 and 1 \ 000 (inclusive).
* M is an integer between 0 and N (inclusive).
* x_i, y_i, z_i \ (1 \leq i \leq N) are integers between -10 \ 000 \ 000 \ 000 and 10 \ 000 \ 000 \ 000 (inclusive).
Input
Input is given from Standard Input in the following format:
N M
x_1 y_1 z_1
x_2 y_2 z_2
: :
x_N y_N z_N
Output
Print the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Examples
Input
5 3
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
Output
56
Input
5 3
1 -2 3
-4 5 -6
7 -8 -9
-10 11 -12
13 -14 15
Output
54
Input
10 5
10 -80 21
23 8 38
-94 28 11
-26 -2 18
-69 72 79
-26 -86 -54
-72 -50 59
21 65 -32
40 -94 87
-62 18 82
Output
638
Input
3 2
2000000000 -9000000000 4000000000
7000000000 -5000000000 3000000000
6000000000 -1000000000 8000000000
Output
30000000000
Submitted Solution:
```
import itertools
n, m = map(int, input().split())
x = [None] * n
y = [None] * n
z = [None] * n
for i in range(n):
x[i], y[i], z[i] = map(int, input().split())
ans = -float('inf')
for p, q, r in itertools.combinations_with_replacement((1, -1), 3):
idxs = list(sorted(range(n), key=lambda i: x[i] * p + y[i] * q + z[i] * r, reverse=True))
s = t = u = 0
for i in idxs[:m]:
s += x[i]
t += y[i]
u += z[i]
ans = max(ans, abs(s) + abs(t) + abs(u))
print(ans)
``` | instruction | 0 | 18,384 | 9 | 36,768 |
No | output | 1 | 18,384 | 9 | 36,769 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.
The shop sells N kinds of cakes.
Each kind of cake has three parameters "beauty", "tastiness" and "popularity". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.
These values may be zero or negative.
Ringo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:
* Do not have two or more pieces of the same kind of cake.
* Under the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).
Find the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Constraints
* N is an integer between 1 and 1 \ 000 (inclusive).
* M is an integer between 0 and N (inclusive).
* x_i, y_i, z_i \ (1 \leq i \leq N) are integers between -10 \ 000 \ 000 \ 000 and 10 \ 000 \ 000 \ 000 (inclusive).
Input
Input is given from Standard Input in the following format:
N M
x_1 y_1 z_1
x_2 y_2 z_2
: :
x_N y_N z_N
Output
Print the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Examples
Input
5 3
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
Output
56
Input
5 3
1 -2 3
-4 5 -6
7 -8 -9
-10 11 -12
13 -14 15
Output
54
Input
10 5
10 -80 21
23 8 38
-94 28 11
-26 -2 18
-69 72 79
-26 -86 -54
-72 -50 59
21 65 -32
40 -94 87
-62 18 82
Output
638
Input
3 2
2000000000 -9000000000 4000000000
7000000000 -5000000000 3000000000
6000000000 -1000000000 8000000000
Output
30000000000
Submitted Solution:
```
import sys
def main():
INF = 2**60
N, M = map(int, sys.stdin.readline().split())
XYZ = [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
sgn = [[1,1,1], [1,1,-1],[1,-1,1],[1,-1,-1],[-1,1,1],[-1,1,-1],[-1,-1,1],[-1,-1,-1]]
ans = -INF
for a, b, c in sgn:
dp = [-INF]*(M+1)
dp[0] = 0
for x, y, z in XYZ:
for j in range(M-1, -1, -1):
if dp[j] == -INF: continue
s = dp[j]+ a*x + b*y + c*z
if s > dp[j+1]:
dp[j+1] = s
if dp[M] > ans:
ans = dp[M]
print(ans)
main()
``` | instruction | 0 | 18,385 | 9 | 36,770 |
No | output | 1 | 18,385 | 9 | 36,771 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.
The shop sells N kinds of cakes.
Each kind of cake has three parameters "beauty", "tastiness" and "popularity". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.
These values may be zero or negative.
Ringo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:
* Do not have two or more pieces of the same kind of cake.
* Under the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).
Find the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Constraints
* N is an integer between 1 and 1 \ 000 (inclusive).
* M is an integer between 0 and N (inclusive).
* x_i, y_i, z_i \ (1 \leq i \leq N) are integers between -10 \ 000 \ 000 \ 000 and 10 \ 000 \ 000 \ 000 (inclusive).
Input
Input is given from Standard Input in the following format:
N M
x_1 y_1 z_1
x_2 y_2 z_2
: :
x_N y_N z_N
Output
Print the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.
Examples
Input
5 3
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
Output
56
Input
5 3
1 -2 3
-4 5 -6
7 -8 -9
-10 11 -12
13 -14 15
Output
54
Input
10 5
10 -80 21
23 8 38
-94 28 11
-26 -2 18
-69 72 79
-26 -86 -54
-72 -50 59
21 65 -32
40 -94 87
-62 18 82
Output
638
Input
3 2
2000000000 -9000000000 4000000000
7000000000 -5000000000 3000000000
6000000000 -1000000000 8000000000
Output
30000000000
Submitted Solution:
```
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
def point(p):
ret = 0
for a in p:
ret += abs(a)
return ret
def add(p1, p2):
ret = []
for a, b in zip(p1, p2):
ret.append(a+b)
return ret
def bigger(p1, p2):
return point(p1) > point(p2)
N, M = map(int, input().split())
cakes = []
for _ in range(N):
cakes.append(list(map(int, input().split())))
def solve():
dp = [[0, 0, 0] for _ in range(M+1)]
used = []
for i in range(1, M+1):
tmp = [0, 0, 0]
for c in cakes:
n = add(dp[i-1], c)
if bigger(n, tmp):
tmp = n
used = c
dp[i] = tmp
#print("dp->", dp)
cakes.remove(used)
# print(dp[-1])
print(point(dp[-1]))
solve()
``` | instruction | 0 | 18,386 | 9 | 36,772 |
No | output | 1 | 18,386 | 9 | 36,773 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time DravDe, an outstanding person famous for his professional achievements (as you must remember, he works in a warehouse storing Ogudar-Olok, a magical but non-alcoholic drink) came home after a hard day. That day he had to drink 9875 boxes of the drink and, having come home, he went to bed at once.
DravDe dreamt about managing a successful farm. He dreamt that every day one animal came to him and asked him to let it settle there. However, DravDe, being unimaginably kind, could send the animal away and it went, rejected. There were exactly n days in DravDe’s dream and the animal that came on the i-th day, ate exactly ci tons of food daily starting from day i. But if one day the animal could not get the food it needed, it got really sad. At the very beginning of the dream there were exactly X tons of food on the farm.
DravDe woke up terrified...
When he retold the dream to you, he couldn’t remember how many animals were on the farm by the end of the n-th day any more, but he did remember that nobody got sad (as it was a happy farm) and that there was the maximum possible amount of the animals. That’s the number he wants you to find out.
It should be noticed that the animals arrived in the morning and DravDe only started to feed them in the afternoon, so that if an animal willing to join them is rejected, it can’t eat any farm food. But if the animal does join the farm, it eats daily from that day to the n-th.
Input
The first input line contains integers n and X (1 ≤ n ≤ 100, 1 ≤ X ≤ 104) — amount of days in DravDe’s dream and the total amount of food (in tons) that was there initially. The second line contains integers ci (1 ≤ ci ≤ 300). Numbers in the second line are divided by a space.
Output
Output the only number — the maximum possible amount of animals on the farm by the end of the n-th day given that the food was enough for everybody.
Examples
Input
3 4
1 1 1
Output
2
Input
3 6
1 1 1
Output
3
Note
Note to the first example: DravDe leaves the second and the third animal on the farm. The second animal will eat one ton of food on the second day and one ton on the third day. The third animal will eat one ton of food on the third day.
Submitted Solution:
```
"""
NTC here
"""
from sys import stdin
# print("Case #{}: {} {}".format(i, n + m, n * m))
w, r= open('output.txt', 'w'), open('input.txt', 'r')
def iin(): return int(r.readline())
def lin(): return list(map(int, r.readline().split()))
n,x=lin()
a=lin()
ans=[[0 for i in range(n)] for j in range(n)]
for i in range(n):
for j in range(i,n):
ans[i][j]+=(j-i+1)*a[j]
for i in range(n):
for j in range(1,n):
ans[i][j]+=ans[i][j-1]
for i in range(n):
if ans[i][-1]<=x:
w.write(str(n-i))
break
else:
w.write('0')
w.close()
``` | instruction | 0 | 19,747 | 9 | 39,494 |
No | output | 1 | 19,747 | 9 | 39,495 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time DravDe, an outstanding person famous for his professional achievements (as you must remember, he works in a warehouse storing Ogudar-Olok, a magical but non-alcoholic drink) came home after a hard day. That day he had to drink 9875 boxes of the drink and, having come home, he went to bed at once.
DravDe dreamt about managing a successful farm. He dreamt that every day one animal came to him and asked him to let it settle there. However, DravDe, being unimaginably kind, could send the animal away and it went, rejected. There were exactly n days in DravDe’s dream and the animal that came on the i-th day, ate exactly ci tons of food daily starting from day i. But if one day the animal could not get the food it needed, it got really sad. At the very beginning of the dream there were exactly X tons of food on the farm.
DravDe woke up terrified...
When he retold the dream to you, he couldn’t remember how many animals were on the farm by the end of the n-th day any more, but he did remember that nobody got sad (as it was a happy farm) and that there was the maximum possible amount of the animals. That’s the number he wants you to find out.
It should be noticed that the animals arrived in the morning and DravDe only started to feed them in the afternoon, so that if an animal willing to join them is rejected, it can’t eat any farm food. But if the animal does join the farm, it eats daily from that day to the n-th.
Input
The first input line contains integers n and X (1 ≤ n ≤ 100, 1 ≤ X ≤ 104) — amount of days in DravDe’s dream and the total amount of food (in tons) that was there initially. The second line contains integers ci (1 ≤ ci ≤ 300). Numbers in the second line are divided by a space.
Output
Output the only number — the maximum possible amount of animals on the farm by the end of the n-th day given that the food was enough for everybody.
Examples
Input
3 4
1 1 1
Output
2
Input
3 6
1 1 1
Output
3
Note
Note to the first example: DravDe leaves the second and the third animal on the farm. The second animal will eat one ton of food on the second day and one ton on the third day. The third animal will eat one ton of food on the third day.
Submitted Solution:
```
f = open("input.txt")
n, x = [int(i) for i in f.readline().split(" ")]
animals = [int(i) for i in f.readline().split(" ")]
f.close()
m = len(animals)
ans = 0
day = 1
for i in range(n -1, -1, -1):
cost = animals[i] * day
if cost <= x:
ans += 1
x -= cost
day += 1
f2 = open("output.txt", "w")
f2.write(str(ans))
``` | instruction | 0 | 19,748 | 9 | 39,496 |
No | output | 1 | 19,748 | 9 | 39,497 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time DravDe, an outstanding person famous for his professional achievements (as you must remember, he works in a warehouse storing Ogudar-Olok, a magical but non-alcoholic drink) came home after a hard day. That day he had to drink 9875 boxes of the drink and, having come home, he went to bed at once.
DravDe dreamt about managing a successful farm. He dreamt that every day one animal came to him and asked him to let it settle there. However, DravDe, being unimaginably kind, could send the animal away and it went, rejected. There were exactly n days in DravDe’s dream and the animal that came on the i-th day, ate exactly ci tons of food daily starting from day i. But if one day the animal could not get the food it needed, it got really sad. At the very beginning of the dream there were exactly X tons of food on the farm.
DravDe woke up terrified...
When he retold the dream to you, he couldn’t remember how many animals were on the farm by the end of the n-th day any more, but he did remember that nobody got sad (as it was a happy farm) and that there was the maximum possible amount of the animals. That’s the number he wants you to find out.
It should be noticed that the animals arrived in the morning and DravDe only started to feed them in the afternoon, so that if an animal willing to join them is rejected, it can’t eat any farm food. But if the animal does join the farm, it eats daily from that day to the n-th.
Input
The first input line contains integers n and X (1 ≤ n ≤ 100, 1 ≤ X ≤ 104) — amount of days in DravDe’s dream and the total amount of food (in tons) that was there initially. The second line contains integers ci (1 ≤ ci ≤ 300). Numbers in the second line are divided by a space.
Output
Output the only number — the maximum possible amount of animals on the farm by the end of the n-th day given that the food was enough for everybody.
Examples
Input
3 4
1 1 1
Output
2
Input
3 6
1 1 1
Output
3
Note
Note to the first example: DravDe leaves the second and the third animal on the farm. The second animal will eat one ton of food on the second day and one ton on the third day. The third animal will eat one ton of food on the third day.
Submitted Solution:
```
print(0)
``` | instruction | 0 | 19,749 | 9 | 39,498 |
No | output | 1 | 19,749 | 9 | 39,499 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time DravDe, an outstanding person famous for his professional achievements (as you must remember, he works in a warehouse storing Ogudar-Olok, a magical but non-alcoholic drink) came home after a hard day. That day he had to drink 9875 boxes of the drink and, having come home, he went to bed at once.
DravDe dreamt about managing a successful farm. He dreamt that every day one animal came to him and asked him to let it settle there. However, DravDe, being unimaginably kind, could send the animal away and it went, rejected. There were exactly n days in DravDe’s dream and the animal that came on the i-th day, ate exactly ci tons of food daily starting from day i. But if one day the animal could not get the food it needed, it got really sad. At the very beginning of the dream there were exactly X tons of food on the farm.
DravDe woke up terrified...
When he retold the dream to you, he couldn’t remember how many animals were on the farm by the end of the n-th day any more, but he did remember that nobody got sad (as it was a happy farm) and that there was the maximum possible amount of the animals. That’s the number he wants you to find out.
It should be noticed that the animals arrived in the morning and DravDe only started to feed them in the afternoon, so that if an animal willing to join them is rejected, it can’t eat any farm food. But if the animal does join the farm, it eats daily from that day to the n-th.
Input
The first input line contains integers n and X (1 ≤ n ≤ 100, 1 ≤ X ≤ 104) — amount of days in DravDe’s dream and the total amount of food (in tons) that was there initially. The second line contains integers ci (1 ≤ ci ≤ 300). Numbers in the second line are divided by a space.
Output
Output the only number — the maximum possible amount of animals on the farm by the end of the n-th day given that the food was enough for everybody.
Examples
Input
3 4
1 1 1
Output
2
Input
3 6
1 1 1
Output
3
Note
Note to the first example: DravDe leaves the second and the third animal on the farm. The second animal will eat one ton of food on the second day and one ton on the third day. The third animal will eat one ton of food on the third day.
Submitted Solution:
```
file1 = open("input.txt","r")
nxs = file1.readline()
ss = file1.readline()
nx = list(map(int, nxs.rstrip().split()))
a = list(map(int, ss.rstrip().split()))
n = nx[0]
x = nx[1]
f = []
for i in range(n):
f.append(a[i]*(n-i))
f.sort(reverse=True)
t = 0
for i in range(n):
if sum(f[i:]) < x:
t = n-i
break
file2 = open(r"output.txt","w+")
file2.write(str(t)) ;
``` | instruction | 0 | 19,750 | 9 | 39,500 |
No | output | 1 | 19,750 | 9 | 39,501 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Karlsson has visited Lillebror again. They found a box of chocolates and a big whipped cream cake at Lillebror's place. Karlsson immediately suggested to divide the sweets fairly between Lillebror and himself. Specifically, to play together a game he has just invented with the chocolates. The winner will get the cake as a reward.
The box of chocolates has the form of a hexagon. It contains 19 cells for the chocolates, some of which contain a chocolate. The players move in turns. During one move it is allowed to eat one or several chocolates that lay in the neighboring cells on one line, parallel to one of the box's sides. The picture below shows the examples of allowed moves and of an unacceptable one. The player who cannot make a move loses.
<image>
Karlsson makes the first move as he is Lillebror's guest and not vice versa. The players play optimally. Determine who will get the cake.
Input
The input data contains 5 lines, containing 19 words consisting of one symbol. The word "O" means that the cell contains a chocolate and a "." stands for an empty cell. It is guaranteed that the box contains at least one chocolate. See the examples for better understanding.
Output
If Karlsson gets the cake, print "Karlsson" (without the quotes), otherwise print "Lillebror" (yet again without the quotes).
Examples
Input
. . .
. . O .
. . O O .
. . . .
. . .
Output
Lillebror
Input
. . .
. . . O
. . . O .
O . O .
. O .
Output
Karlsson | instruction | 0 | 19,871 | 9 | 39,742 |
Tags: bitmasks, dfs and similar, dp, games, implementation
Correct Solution:
```
import sys
from array import array # noqa: F401
def input():
return sys.stdin.buffer.readline().decode('utf-8')
lines = [
[0, 1, 2],
[3, 4, 5, 6],
[7, 8, 9, 10, 11],
[12, 13, 14, 15],
[16, 17, 18],
[0, 3, 7],
[1, 4, 8, 12],
[2, 5, 9, 13, 16],
[6, 10, 14, 17],
[11, 15, 18],
[2, 6, 11],
[1, 5, 10, 15],
[0, 4, 9, 14, 18],
[3, 8, 13, 17],
[7, 12, 16]
]
dp = [0] + [-1] * (1 << 19)
def dfs(state: int):
if dp[state] != -1:
return dp[state]
for line in lines:
for i in range(len(line)):
line_bit = 0
for j in range(i, len(line)):
line_bit |= 1 << line[j]
if state & line_bit == line_bit and dfs(state & ~line_bit) == 0:
dp[state] = 1
return 1
dp[state] = 0
return 0
start_bit = 0
for s in (0, 3, 7, 12, 16):
for i, c in enumerate(input().split(), start=s):
if c == 'O':
start_bit |= 1 << i
print('Karlsson' if dfs(start_bit) else 'Lillebror')
``` | output | 1 | 19,871 | 9 | 39,743 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are two sisters Alice and Betty. You have n candies. You want to distribute these n candies between two sisters in such a way that:
* Alice will get a (a > 0) candies;
* Betty will get b (b > 0) candies;
* each sister will get some integer number of candies;
* Alice will get a greater amount of candies than Betty (i.e. a > b);
* all the candies will be given to one of two sisters (i.e. a+b=n).
Your task is to calculate the number of ways to distribute exactly n candies between sisters in a way described above. Candies are indistinguishable.
Formally, find the number of ways to represent n as the sum of n=a+b, where a and b are positive integers and a>b.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of a test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^9) — the number of candies you have.
Output
For each test case, print the answer — the number of ways to distribute exactly n candies between two sisters in a way described in the problem statement. If there is no way to satisfy all the conditions, print 0.
Example
Input
6
7
1
2
3
2000000000
763243547
Output
3
0
0
1
999999999
381621773
Note
For the test case of the example, the 3 possible ways to distribute candies are:
* a=6, b=1;
* a=5, b=2;
* a=4, b=3. | instruction | 0 | 20,404 | 9 | 40,808 |
Tags: math
Correct Solution:
```
def main():
try:
t = input()
t = int(t)
data = []
if not (1 <= t <= 10**4):
exit(1)
for _ in range(t):
temp = input()
temp = int(temp)
if not (1 <= temp <= 2*(10**9)):
exit(1)
result = doLogic(temp)
data.append(result)
for j in range(len(data)):
print(data[j])
except:
print('no')
def doLogic(data):
if (data <= 2):
data = 0
elif (data % 2 == 0):
data = (data//2) - 1
else:
data = (data - 1) // 2
return data
if __name__ == "__main__":
main()
``` | output | 1 | 20,404 | 9 | 40,809 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are two sisters Alice and Betty. You have n candies. You want to distribute these n candies between two sisters in such a way that:
* Alice will get a (a > 0) candies;
* Betty will get b (b > 0) candies;
* each sister will get some integer number of candies;
* Alice will get a greater amount of candies than Betty (i.e. a > b);
* all the candies will be given to one of two sisters (i.e. a+b=n).
Your task is to calculate the number of ways to distribute exactly n candies between sisters in a way described above. Candies are indistinguishable.
Formally, find the number of ways to represent n as the sum of n=a+b, where a and b are positive integers and a>b.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of a test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^9) — the number of candies you have.
Output
For each test case, print the answer — the number of ways to distribute exactly n candies between two sisters in a way described in the problem statement. If there is no way to satisfy all the conditions, print 0.
Example
Input
6
7
1
2
3
2000000000
763243547
Output
3
0
0
1
999999999
381621773
Note
For the test case of the example, the 3 possible ways to distribute candies are:
* a=6, b=1;
* a=5, b=2;
* a=4, b=3. | instruction | 0 | 20,405 | 9 | 40,810 |
Tags: math
Correct Solution:
```
t = int(input())
while t:
t += -1
n = int(input())
if n % 2: print(n // 2)
else: print(n // 2 - 1)
``` | output | 1 | 20,405 | 9 | 40,811 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are two sisters Alice and Betty. You have n candies. You want to distribute these n candies between two sisters in such a way that:
* Alice will get a (a > 0) candies;
* Betty will get b (b > 0) candies;
* each sister will get some integer number of candies;
* Alice will get a greater amount of candies than Betty (i.e. a > b);
* all the candies will be given to one of two sisters (i.e. a+b=n).
Your task is to calculate the number of ways to distribute exactly n candies between sisters in a way described above. Candies are indistinguishable.
Formally, find the number of ways to represent n as the sum of n=a+b, where a and b are positive integers and a>b.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of a test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^9) — the number of candies you have.
Output
For each test case, print the answer — the number of ways to distribute exactly n candies between two sisters in a way described in the problem statement. If there is no way to satisfy all the conditions, print 0.
Example
Input
6
7
1
2
3
2000000000
763243547
Output
3
0
0
1
999999999
381621773
Note
For the test case of the example, the 3 possible ways to distribute candies are:
* a=6, b=1;
* a=5, b=2;
* a=4, b=3. | instruction | 0 | 20,406 | 9 | 40,812 |
Tags: math
Correct Solution:
```
t=int(input())
while t>0:
inp=int(input())
print((inp-1)//2)
t-=1
``` | output | 1 | 20,406 | 9 | 40,813 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are two sisters Alice and Betty. You have n candies. You want to distribute these n candies between two sisters in such a way that:
* Alice will get a (a > 0) candies;
* Betty will get b (b > 0) candies;
* each sister will get some integer number of candies;
* Alice will get a greater amount of candies than Betty (i.e. a > b);
* all the candies will be given to one of two sisters (i.e. a+b=n).
Your task is to calculate the number of ways to distribute exactly n candies between sisters in a way described above. Candies are indistinguishable.
Formally, find the number of ways to represent n as the sum of n=a+b, where a and b are positive integers and a>b.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of a test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^9) — the number of candies you have.
Output
For each test case, print the answer — the number of ways to distribute exactly n candies between two sisters in a way described in the problem statement. If there is no way to satisfy all the conditions, print 0.
Example
Input
6
7
1
2
3
2000000000
763243547
Output
3
0
0
1
999999999
381621773
Note
For the test case of the example, the 3 possible ways to distribute candies are:
* a=6, b=1;
* a=5, b=2;
* a=4, b=3. | instruction | 0 | 20,407 | 9 | 40,814 |
Tags: math
Correct Solution:
```
t = int(input())
while t:
n = int(input())
if n == 1 or n == 2:
print(0)
elif n % 2 == 0:
print((n // 2) - 1)
else:
print((n-1) // 2)
t -= 1
``` | output | 1 | 20,407 | 9 | 40,815 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are two sisters Alice and Betty. You have n candies. You want to distribute these n candies between two sisters in such a way that:
* Alice will get a (a > 0) candies;
* Betty will get b (b > 0) candies;
* each sister will get some integer number of candies;
* Alice will get a greater amount of candies than Betty (i.e. a > b);
* all the candies will be given to one of two sisters (i.e. a+b=n).
Your task is to calculate the number of ways to distribute exactly n candies between sisters in a way described above. Candies are indistinguishable.
Formally, find the number of ways to represent n as the sum of n=a+b, where a and b are positive integers and a>b.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of a test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^9) — the number of candies you have.
Output
For each test case, print the answer — the number of ways to distribute exactly n candies between two sisters in a way described in the problem statement. If there is no way to satisfy all the conditions, print 0.
Example
Input
6
7
1
2
3
2000000000
763243547
Output
3
0
0
1
999999999
381621773
Note
For the test case of the example, the 3 possible ways to distribute candies are:
* a=6, b=1;
* a=5, b=2;
* a=4, b=3. | instruction | 0 | 20,408 | 9 | 40,816 |
Tags: math
Correct Solution:
```
t = int(input())
out = list()
for item in range(t):
n = int(input())
if n%2 == 1:
out.append(int(n/2))
elif n%2 == 0:
out.append(int((n/2)-1))
for item in out: print(item)
``` | output | 1 | 20,408 | 9 | 40,817 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are two sisters Alice and Betty. You have n candies. You want to distribute these n candies between two sisters in such a way that:
* Alice will get a (a > 0) candies;
* Betty will get b (b > 0) candies;
* each sister will get some integer number of candies;
* Alice will get a greater amount of candies than Betty (i.e. a > b);
* all the candies will be given to one of two sisters (i.e. a+b=n).
Your task is to calculate the number of ways to distribute exactly n candies between sisters in a way described above. Candies are indistinguishable.
Formally, find the number of ways to represent n as the sum of n=a+b, where a and b are positive integers and a>b.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of a test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^9) — the number of candies you have.
Output
For each test case, print the answer — the number of ways to distribute exactly n candies between two sisters in a way described in the problem statement. If there is no way to satisfy all the conditions, print 0.
Example
Input
6
7
1
2
3
2000000000
763243547
Output
3
0
0
1
999999999
381621773
Note
For the test case of the example, the 3 possible ways to distribute candies are:
* a=6, b=1;
* a=5, b=2;
* a=4, b=3. | instruction | 0 | 20,409 | 9 | 40,818 |
Tags: math
Correct Solution:
```
t = int(input())
while t>0:
x = int(input())
if(x %2 == 1):
print (int(x/2))
else:
print (int ((x-1)/2))
t -=1
``` | output | 1 | 20,409 | 9 | 40,819 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are two sisters Alice and Betty. You have n candies. You want to distribute these n candies between two sisters in such a way that:
* Alice will get a (a > 0) candies;
* Betty will get b (b > 0) candies;
* each sister will get some integer number of candies;
* Alice will get a greater amount of candies than Betty (i.e. a > b);
* all the candies will be given to one of two sisters (i.e. a+b=n).
Your task is to calculate the number of ways to distribute exactly n candies between sisters in a way described above. Candies are indistinguishable.
Formally, find the number of ways to represent n as the sum of n=a+b, where a and b are positive integers and a>b.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of a test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^9) — the number of candies you have.
Output
For each test case, print the answer — the number of ways to distribute exactly n candies between two sisters in a way described in the problem statement. If there is no way to satisfy all the conditions, print 0.
Example
Input
6
7
1
2
3
2000000000
763243547
Output
3
0
0
1
999999999
381621773
Note
For the test case of the example, the 3 possible ways to distribute candies are:
* a=6, b=1;
* a=5, b=2;
* a=4, b=3. | instruction | 0 | 20,410 | 9 | 40,820 |
Tags: math
Correct Solution:
```
n=int(input())
for i in range(n):
t=int(input())
if t%2==0:
print(t//2-1)
else:
print(t//2)
``` | output | 1 | 20,410 | 9 | 40,821 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are two sisters Alice and Betty. You have n candies. You want to distribute these n candies between two sisters in such a way that:
* Alice will get a (a > 0) candies;
* Betty will get b (b > 0) candies;
* each sister will get some integer number of candies;
* Alice will get a greater amount of candies than Betty (i.e. a > b);
* all the candies will be given to one of two sisters (i.e. a+b=n).
Your task is to calculate the number of ways to distribute exactly n candies between sisters in a way described above. Candies are indistinguishable.
Formally, find the number of ways to represent n as the sum of n=a+b, where a and b are positive integers and a>b.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of a test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^9) — the number of candies you have.
Output
For each test case, print the answer — the number of ways to distribute exactly n candies between two sisters in a way described in the problem statement. If there is no way to satisfy all the conditions, print 0.
Example
Input
6
7
1
2
3
2000000000
763243547
Output
3
0
0
1
999999999
381621773
Note
For the test case of the example, the 3 possible ways to distribute candies are:
* a=6, b=1;
* a=5, b=2;
* a=4, b=3. | instruction | 0 | 20,411 | 9 | 40,822 |
Tags: math
Correct Solution:
```
from math import ceil
Q = int(input())
for i in range(Q):
print( ceil(int(input())/2)-1 )
``` | output | 1 | 20,411 | 9 | 40,823 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are two sisters Alice and Betty. You have n candies. You want to distribute these n candies between two sisters in such a way that:
* Alice will get a (a > 0) candies;
* Betty will get b (b > 0) candies;
* each sister will get some integer number of candies;
* Alice will get a greater amount of candies than Betty (i.e. a > b);
* all the candies will be given to one of two sisters (i.e. a+b=n).
Your task is to calculate the number of ways to distribute exactly n candies between sisters in a way described above. Candies are indistinguishable.
Formally, find the number of ways to represent n as the sum of n=a+b, where a and b are positive integers and a>b.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of a test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^9) — the number of candies you have.
Output
For each test case, print the answer — the number of ways to distribute exactly n candies between two sisters in a way described in the problem statement. If there is no way to satisfy all the conditions, print 0.
Example
Input
6
7
1
2
3
2000000000
763243547
Output
3
0
0
1
999999999
381621773
Note
For the test case of the example, the 3 possible ways to distribute candies are:
* a=6, b=1;
* a=5, b=2;
* a=4, b=3.
Submitted Solution:
```
for _ in range(int(input())):
n=int(input())
if(n==1 or n==2):
print(0)
else:
if(n%2==0):
print((n//2)-1)
else:
print(n//2)
``` | instruction | 0 | 20,412 | 9 | 40,824 |
Yes | output | 1 | 20,412 | 9 | 40,825 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are two sisters Alice and Betty. You have n candies. You want to distribute these n candies between two sisters in such a way that:
* Alice will get a (a > 0) candies;
* Betty will get b (b > 0) candies;
* each sister will get some integer number of candies;
* Alice will get a greater amount of candies than Betty (i.e. a > b);
* all the candies will be given to one of two sisters (i.e. a+b=n).
Your task is to calculate the number of ways to distribute exactly n candies between sisters in a way described above. Candies are indistinguishable.
Formally, find the number of ways to represent n as the sum of n=a+b, where a and b are positive integers and a>b.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of a test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^9) — the number of candies you have.
Output
For each test case, print the answer — the number of ways to distribute exactly n candies between two sisters in a way described in the problem statement. If there is no way to satisfy all the conditions, print 0.
Example
Input
6
7
1
2
3
2000000000
763243547
Output
3
0
0
1
999999999
381621773
Note
For the test case of the example, the 3 possible ways to distribute candies are:
* a=6, b=1;
* a=5, b=2;
* a=4, b=3.
Submitted Solution:
```
for _ in range(int(input())):
k = int(input())
if k%2==0:
print((k//2)-1)
else:
print(k//2)
``` | instruction | 0 | 20,413 | 9 | 40,826 |
Yes | output | 1 | 20,413 | 9 | 40,827 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are two sisters Alice and Betty. You have n candies. You want to distribute these n candies between two sisters in such a way that:
* Alice will get a (a > 0) candies;
* Betty will get b (b > 0) candies;
* each sister will get some integer number of candies;
* Alice will get a greater amount of candies than Betty (i.e. a > b);
* all the candies will be given to one of two sisters (i.e. a+b=n).
Your task is to calculate the number of ways to distribute exactly n candies between sisters in a way described above. Candies are indistinguishable.
Formally, find the number of ways to represent n as the sum of n=a+b, where a and b are positive integers and a>b.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of a test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^9) — the number of candies you have.
Output
For each test case, print the answer — the number of ways to distribute exactly n candies between two sisters in a way described in the problem statement. If there is no way to satisfy all the conditions, print 0.
Example
Input
6
7
1
2
3
2000000000
763243547
Output
3
0
0
1
999999999
381621773
Note
For the test case of the example, the 3 possible ways to distribute candies are:
* a=6, b=1;
* a=5, b=2;
* a=4, b=3.
Submitted Solution:
```
t = int(input())
for case in range(t):
n = int(input())
ans = n // 2
if n % 2 == 0: ans -= 1
print(ans)
``` | instruction | 0 | 20,414 | 9 | 40,828 |
Yes | output | 1 | 20,414 | 9 | 40,829 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are two sisters Alice and Betty. You have n candies. You want to distribute these n candies between two sisters in such a way that:
* Alice will get a (a > 0) candies;
* Betty will get b (b > 0) candies;
* each sister will get some integer number of candies;
* Alice will get a greater amount of candies than Betty (i.e. a > b);
* all the candies will be given to one of two sisters (i.e. a+b=n).
Your task is to calculate the number of ways to distribute exactly n candies between sisters in a way described above. Candies are indistinguishable.
Formally, find the number of ways to represent n as the sum of n=a+b, where a and b are positive integers and a>b.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of a test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^9) — the number of candies you have.
Output
For each test case, print the answer — the number of ways to distribute exactly n candies between two sisters in a way described in the problem statement. If there is no way to satisfy all the conditions, print 0.
Example
Input
6
7
1
2
3
2000000000
763243547
Output
3
0
0
1
999999999
381621773
Note
For the test case of the example, the 3 possible ways to distribute candies are:
* a=6, b=1;
* a=5, b=2;
* a=4, b=3.
Submitted Solution:
```
t=int(input())
for _ in range(t):
n=int(input())
if(n<=2):
print(0)
elif(n%2==0):
print(n//2-1)
else:
print(n//2)
``` | instruction | 0 | 20,415 | 9 | 40,830 |
Yes | output | 1 | 20,415 | 9 | 40,831 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are two sisters Alice and Betty. You have n candies. You want to distribute these n candies between two sisters in such a way that:
* Alice will get a (a > 0) candies;
* Betty will get b (b > 0) candies;
* each sister will get some integer number of candies;
* Alice will get a greater amount of candies than Betty (i.e. a > b);
* all the candies will be given to one of two sisters (i.e. a+b=n).
Your task is to calculate the number of ways to distribute exactly n candies between sisters in a way described above. Candies are indistinguishable.
Formally, find the number of ways to represent n as the sum of n=a+b, where a and b are positive integers and a>b.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of a test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^9) — the number of candies you have.
Output
For each test case, print the answer — the number of ways to distribute exactly n candies between two sisters in a way described in the problem statement. If there is no way to satisfy all the conditions, print 0.
Example
Input
6
7
1
2
3
2000000000
763243547
Output
3
0
0
1
999999999
381621773
Note
For the test case of the example, the 3 possible ways to distribute candies are:
* a=6, b=1;
* a=5, b=2;
* a=4, b=3.
Submitted Solution:
```
a = list(map(int, input().split()))
print(a)
``` | instruction | 0 | 20,416 | 9 | 40,832 |
No | output | 1 | 20,416 | 9 | 40,833 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are two sisters Alice and Betty. You have n candies. You want to distribute these n candies between two sisters in such a way that:
* Alice will get a (a > 0) candies;
* Betty will get b (b > 0) candies;
* each sister will get some integer number of candies;
* Alice will get a greater amount of candies than Betty (i.e. a > b);
* all the candies will be given to one of two sisters (i.e. a+b=n).
Your task is to calculate the number of ways to distribute exactly n candies between sisters in a way described above. Candies are indistinguishable.
Formally, find the number of ways to represent n as the sum of n=a+b, where a and b are positive integers and a>b.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of a test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^9) — the number of candies you have.
Output
For each test case, print the answer — the number of ways to distribute exactly n candies between two sisters in a way described in the problem statement. If there is no way to satisfy all the conditions, print 0.
Example
Input
6
7
1
2
3
2000000000
763243547
Output
3
0
0
1
999999999
381621773
Note
For the test case of the example, the 3 possible ways to distribute candies are:
* a=6, b=1;
* a=5, b=2;
* a=4, b=3.
Submitted Solution:
```
n=int(input())
x=(n-1)//2
print(x)
``` | instruction | 0 | 20,417 | 9 | 40,834 |
No | output | 1 | 20,417 | 9 | 40,835 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are two sisters Alice and Betty. You have n candies. You want to distribute these n candies between two sisters in such a way that:
* Alice will get a (a > 0) candies;
* Betty will get b (b > 0) candies;
* each sister will get some integer number of candies;
* Alice will get a greater amount of candies than Betty (i.e. a > b);
* all the candies will be given to one of two sisters (i.e. a+b=n).
Your task is to calculate the number of ways to distribute exactly n candies between sisters in a way described above. Candies are indistinguishable.
Formally, find the number of ways to represent n as the sum of n=a+b, where a and b are positive integers and a>b.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of a test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^9) — the number of candies you have.
Output
For each test case, print the answer — the number of ways to distribute exactly n candies between two sisters in a way described in the problem statement. If there is no way to satisfy all the conditions, print 0.
Example
Input
6
7
1
2
3
2000000000
763243547
Output
3
0
0
1
999999999
381621773
Note
For the test case of the example, the 3 possible ways to distribute candies are:
* a=6, b=1;
* a=5, b=2;
* a=4, b=3.
Submitted Solution:
```
t = int(input())
for i in range(t):
n = int(input())
if(n<=2):
print("0")
else:
count = 0
low = n//2
print(low)
``` | instruction | 0 | 20,418 | 9 | 40,836 |
No | output | 1 | 20,418 | 9 | 40,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are two sisters Alice and Betty. You have n candies. You want to distribute these n candies between two sisters in such a way that:
* Alice will get a (a > 0) candies;
* Betty will get b (b > 0) candies;
* each sister will get some integer number of candies;
* Alice will get a greater amount of candies than Betty (i.e. a > b);
* all the candies will be given to one of two sisters (i.e. a+b=n).
Your task is to calculate the number of ways to distribute exactly n candies between sisters in a way described above. Candies are indistinguishable.
Formally, find the number of ways to represent n as the sum of n=a+b, where a and b are positive integers and a>b.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of a test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^9) — the number of candies you have.
Output
For each test case, print the answer — the number of ways to distribute exactly n candies between two sisters in a way described in the problem statement. If there is no way to satisfy all the conditions, print 0.
Example
Input
6
7
1
2
3
2000000000
763243547
Output
3
0
0
1
999999999
381621773
Note
For the test case of the example, the 3 possible ways to distribute candies are:
* a=6, b=1;
* a=5, b=2;
* a=4, b=3.
Submitted Solution:
```
for _ in range(int(input())):
n = int(input())
if n%2==0:
c = (n/2)-1
else:
c = int(n/2)
print(c)
``` | instruction | 0 | 20,419 | 9 | 40,838 |
No | output | 1 | 20,419 | 9 | 40,839 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The programming competition season has already started and it's time to train for ICPC. Sereja coaches his teams for a number of year and he knows that to get ready for the training session it's not enough to prepare only problems and editorial. As the training sessions lasts for several hours, teams become hungry. Thus, Sereja orders a number of pizzas so they can eat right after the end of the competition.
Teams plan to train for n times during n consecutive days. During the training session Sereja orders exactly one pizza for each team that is present this day. He already knows that there will be ai teams on the i-th day.
There are two types of discounts in Sereja's favourite pizzeria. The first discount works if one buys two pizzas at one day, while the second is a coupon that allows to buy one pizza during two consecutive days (two pizzas in total).
As Sereja orders really a lot of pizza at this place, he is the golden client and can use the unlimited number of discounts and coupons of any type at any days.
Sereja wants to order exactly ai pizzas on the i-th day while using only discounts and coupons. Note, that he will never buy more pizzas than he need for this particular day. Help him determine, whether he can buy the proper amount of pizzas each day if he is allowed to use only coupons and discounts. Note, that it's also prohibited to have any active coupons after the end of the day n.
Input
The first line of input contains a single integer n (1 ≤ n ≤ 200 000) — the number of training sessions.
The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 10 000) — the number of teams that will be present on each of the days.
Output
If there is a way to order pizzas using only coupons and discounts and do not buy any extra pizzas on any of the days, then print "YES" (without quotes) in the only line of output. Otherwise, print "NO" (without quotes).
Examples
Input
4
1 2 1 2
Output
YES
Input
3
1 0 1
Output
NO
Note
In the first sample, Sereja can use one coupon to buy one pizza on the first and the second days, one coupon to buy pizza on the second and the third days and one discount to buy pizzas on the fourth days. This is the only way to order pizzas for this sample.
In the second sample, Sereja can't use neither the coupon nor the discount without ordering an extra pizza. Note, that it's possible that there will be no teams attending the training sessions on some days. | instruction | 0 | 20,782 | 9 | 41,564 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n=int(input())
d=input().split()
d=[int(x) for x in d]
B=True
for i in range(len(d)):
if i==len(d)-1:
if d[i]%2==1:
print("NO")
B=False
else:
if d[i]%2>0:
d[i+1]-=1
if d[i+1]<0:
print('NO')
B=False
break
if B:
print("YES")
``` | output | 1 | 20,782 | 9 | 41,565 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The programming competition season has already started and it's time to train for ICPC. Sereja coaches his teams for a number of year and he knows that to get ready for the training session it's not enough to prepare only problems and editorial. As the training sessions lasts for several hours, teams become hungry. Thus, Sereja orders a number of pizzas so they can eat right after the end of the competition.
Teams plan to train for n times during n consecutive days. During the training session Sereja orders exactly one pizza for each team that is present this day. He already knows that there will be ai teams on the i-th day.
There are two types of discounts in Sereja's favourite pizzeria. The first discount works if one buys two pizzas at one day, while the second is a coupon that allows to buy one pizza during two consecutive days (two pizzas in total).
As Sereja orders really a lot of pizza at this place, he is the golden client and can use the unlimited number of discounts and coupons of any type at any days.
Sereja wants to order exactly ai pizzas on the i-th day while using only discounts and coupons. Note, that he will never buy more pizzas than he need for this particular day. Help him determine, whether he can buy the proper amount of pizzas each day if he is allowed to use only coupons and discounts. Note, that it's also prohibited to have any active coupons after the end of the day n.
Input
The first line of input contains a single integer n (1 ≤ n ≤ 200 000) — the number of training sessions.
The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 10 000) — the number of teams that will be present on each of the days.
Output
If there is a way to order pizzas using only coupons and discounts and do not buy any extra pizzas on any of the days, then print "YES" (without quotes) in the only line of output. Otherwise, print "NO" (without quotes).
Examples
Input
4
1 2 1 2
Output
YES
Input
3
1 0 1
Output
NO
Note
In the first sample, Sereja can use one coupon to buy one pizza on the first and the second days, one coupon to buy pizza on the second and the third days and one discount to buy pizzas on the fourth days. This is the only way to order pizzas for this sample.
In the second sample, Sereja can't use neither the coupon nor the discount without ordering an extra pizza. Note, that it's possible that there will be no teams attending the training sessions on some days. | instruction | 0 | 20,783 | 9 | 41,566 |
Tags: constructive algorithms, greedy
Correct Solution:
```
def exe():
n = input()
active = False
a = list(map(int,input().split()))
for i in a:
if i == 0:
if active == False: continue
else: return False
## i != 0
if active == True:
i -= 1
active = False
if i % 2 == 0:
continue
else:
if i == 0: return False
active = True
continue
else:
if i % 2 == 0:
continue
else:
active = True
continue
return not active
result = exe()
if result == True:
print("YES")
else:
print("NO")
``` | output | 1 | 20,783 | 9 | 41,567 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The programming competition season has already started and it's time to train for ICPC. Sereja coaches his teams for a number of year and he knows that to get ready for the training session it's not enough to prepare only problems and editorial. As the training sessions lasts for several hours, teams become hungry. Thus, Sereja orders a number of pizzas so they can eat right after the end of the competition.
Teams plan to train for n times during n consecutive days. During the training session Sereja orders exactly one pizza for each team that is present this day. He already knows that there will be ai teams on the i-th day.
There are two types of discounts in Sereja's favourite pizzeria. The first discount works if one buys two pizzas at one day, while the second is a coupon that allows to buy one pizza during two consecutive days (two pizzas in total).
As Sereja orders really a lot of pizza at this place, he is the golden client and can use the unlimited number of discounts and coupons of any type at any days.
Sereja wants to order exactly ai pizzas on the i-th day while using only discounts and coupons. Note, that he will never buy more pizzas than he need for this particular day. Help him determine, whether he can buy the proper amount of pizzas each day if he is allowed to use only coupons and discounts. Note, that it's also prohibited to have any active coupons after the end of the day n.
Input
The first line of input contains a single integer n (1 ≤ n ≤ 200 000) — the number of training sessions.
The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 10 000) — the number of teams that will be present on each of the days.
Output
If there is a way to order pizzas using only coupons and discounts and do not buy any extra pizzas on any of the days, then print "YES" (without quotes) in the only line of output. Otherwise, print "NO" (without quotes).
Examples
Input
4
1 2 1 2
Output
YES
Input
3
1 0 1
Output
NO
Note
In the first sample, Sereja can use one coupon to buy one pizza on the first and the second days, one coupon to buy pizza on the second and the third days and one discount to buy pizzas on the fourth days. This is the only way to order pizzas for this sample.
In the second sample, Sereja can't use neither the coupon nor the discount without ordering an extra pizza. Note, that it's possible that there will be no teams attending the training sessions on some days. | instruction | 0 | 20,784 | 9 | 41,568 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n=int(input())
days=input().split()
for i in range (n):
days[i]=int(days[i])
works=True
for i in range (n):
if days[i]<0:
works=False
break
if days[i]%2==1:
if i==n-1:
works=False
break
else:
days[i+1]-=1
if works:
print ("YES")
else:
print ("NO")
``` | output | 1 | 20,784 | 9 | 41,569 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The programming competition season has already started and it's time to train for ICPC. Sereja coaches his teams for a number of year and he knows that to get ready for the training session it's not enough to prepare only problems and editorial. As the training sessions lasts for several hours, teams become hungry. Thus, Sereja orders a number of pizzas so they can eat right after the end of the competition.
Teams plan to train for n times during n consecutive days. During the training session Sereja orders exactly one pizza for each team that is present this day. He already knows that there will be ai teams on the i-th day.
There are two types of discounts in Sereja's favourite pizzeria. The first discount works if one buys two pizzas at one day, while the second is a coupon that allows to buy one pizza during two consecutive days (two pizzas in total).
As Sereja orders really a lot of pizza at this place, he is the golden client and can use the unlimited number of discounts and coupons of any type at any days.
Sereja wants to order exactly ai pizzas on the i-th day while using only discounts and coupons. Note, that he will never buy more pizzas than he need for this particular day. Help him determine, whether he can buy the proper amount of pizzas each day if he is allowed to use only coupons and discounts. Note, that it's also prohibited to have any active coupons after the end of the day n.
Input
The first line of input contains a single integer n (1 ≤ n ≤ 200 000) — the number of training sessions.
The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 10 000) — the number of teams that will be present on each of the days.
Output
If there is a way to order pizzas using only coupons and discounts and do not buy any extra pizzas on any of the days, then print "YES" (without quotes) in the only line of output. Otherwise, print "NO" (without quotes).
Examples
Input
4
1 2 1 2
Output
YES
Input
3
1 0 1
Output
NO
Note
In the first sample, Sereja can use one coupon to buy one pizza on the first and the second days, one coupon to buy pizza on the second and the third days and one discount to buy pizzas on the fourth days. This is the only way to order pizzas for this sample.
In the second sample, Sereja can't use neither the coupon nor the discount without ordering an extra pizza. Note, that it's possible that there will be no teams attending the training sessions on some days. | instruction | 0 | 20,785 | 9 | 41,570 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n = int(input())
a = [int(x) for x in input().split()]
a.append(0)
for i in range(len(a)):
if a[i] >= 2:
if a[i] % 2 == 0:
a[i] = 0
else:
a[i] = 1
if a[i] == 1 and a[i+1] >= 1:
a[i] -= 1
a[i+1] -= 1
elif a[i] == 0:
pass
else:
print("NO")
exit()
print("YES")
``` | output | 1 | 20,785 | 9 | 41,571 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The programming competition season has already started and it's time to train for ICPC. Sereja coaches his teams for a number of year and he knows that to get ready for the training session it's not enough to prepare only problems and editorial. As the training sessions lasts for several hours, teams become hungry. Thus, Sereja orders a number of pizzas so they can eat right after the end of the competition.
Teams plan to train for n times during n consecutive days. During the training session Sereja orders exactly one pizza for each team that is present this day. He already knows that there will be ai teams on the i-th day.
There are two types of discounts in Sereja's favourite pizzeria. The first discount works if one buys two pizzas at one day, while the second is a coupon that allows to buy one pizza during two consecutive days (two pizzas in total).
As Sereja orders really a lot of pizza at this place, he is the golden client and can use the unlimited number of discounts and coupons of any type at any days.
Sereja wants to order exactly ai pizzas on the i-th day while using only discounts and coupons. Note, that he will never buy more pizzas than he need for this particular day. Help him determine, whether he can buy the proper amount of pizzas each day if he is allowed to use only coupons and discounts. Note, that it's also prohibited to have any active coupons after the end of the day n.
Input
The first line of input contains a single integer n (1 ≤ n ≤ 200 000) — the number of training sessions.
The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 10 000) — the number of teams that will be present on each of the days.
Output
If there is a way to order pizzas using only coupons and discounts and do not buy any extra pizzas on any of the days, then print "YES" (without quotes) in the only line of output. Otherwise, print "NO" (without quotes).
Examples
Input
4
1 2 1 2
Output
YES
Input
3
1 0 1
Output
NO
Note
In the first sample, Sereja can use one coupon to buy one pizza on the first and the second days, one coupon to buy pizza on the second and the third days and one discount to buy pizzas on the fourth days. This is the only way to order pizzas for this sample.
In the second sample, Sereja can't use neither the coupon nor the discount without ordering an extra pizza. Note, that it's possible that there will be no teams attending the training sessions on some days. | instruction | 0 | 20,786 | 9 | 41,572 |
Tags: constructive algorithms, greedy
Correct Solution:
```
trenings = int(input())
num_of_commands = input()
num_of_commands = num_of_commands.split(' ')
for i in range(len(num_of_commands)):
num_of_commands[i] = int(num_of_commands[i])
if sum(num_of_commands)%2 == 1:
print("NO")
else:
is_pizza = False
result = True
for i in range(len(num_of_commands)):
if is_pizza:
num_of_commands[i] -= 1
if num_of_commands[i] == -1:
result = False
break
if i == len(num_of_commands)-1 and num_of_commands[i]%2 == 1:
result = False
if num_of_commands[i]%2 == 0:
is_pizza = False
else:
is_pizza = True
if result:
print('YES')
else:
print('NO')
``` | output | 1 | 20,786 | 9 | 41,573 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The programming competition season has already started and it's time to train for ICPC. Sereja coaches his teams for a number of year and he knows that to get ready for the training session it's not enough to prepare only problems and editorial. As the training sessions lasts for several hours, teams become hungry. Thus, Sereja orders a number of pizzas so they can eat right after the end of the competition.
Teams plan to train for n times during n consecutive days. During the training session Sereja orders exactly one pizza for each team that is present this day. He already knows that there will be ai teams on the i-th day.
There are two types of discounts in Sereja's favourite pizzeria. The first discount works if one buys two pizzas at one day, while the second is a coupon that allows to buy one pizza during two consecutive days (two pizzas in total).
As Sereja orders really a lot of pizza at this place, he is the golden client and can use the unlimited number of discounts and coupons of any type at any days.
Sereja wants to order exactly ai pizzas on the i-th day while using only discounts and coupons. Note, that he will never buy more pizzas than he need for this particular day. Help him determine, whether he can buy the proper amount of pizzas each day if he is allowed to use only coupons and discounts. Note, that it's also prohibited to have any active coupons after the end of the day n.
Input
The first line of input contains a single integer n (1 ≤ n ≤ 200 000) — the number of training sessions.
The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 10 000) — the number of teams that will be present on each of the days.
Output
If there is a way to order pizzas using only coupons and discounts and do not buy any extra pizzas on any of the days, then print "YES" (without quotes) in the only line of output. Otherwise, print "NO" (without quotes).
Examples
Input
4
1 2 1 2
Output
YES
Input
3
1 0 1
Output
NO
Note
In the first sample, Sereja can use one coupon to buy one pizza on the first and the second days, one coupon to buy pizza on the second and the third days and one discount to buy pizzas on the fourth days. This is the only way to order pizzas for this sample.
In the second sample, Sereja can't use neither the coupon nor the discount without ordering an extra pizza. Note, that it's possible that there will be no teams attending the training sessions on some days. | instruction | 0 | 20,787 | 9 | 41,574 |
Tags: constructive algorithms, greedy
Correct Solution:
```
N = int(input())
arr = list(map(int, input().split()))
if N == 1:
if arr[0] % 2 == 0:
print("YES")
else:
print("NO")
else:
flag = True
for i in range(N - 1):
if arr[i] < 0:
flag = False
break
if arr[i] == 0:
continue
if arr[i] % 2 == 1:
arr[i + 1] -= 1
arr[i] = 0
elif arr[i] % 2 == 0:
arr[i] = 0
if not flag:
print("NO")
else:
if arr[-1] >= 0 and arr[-1] % 2 == 0:
print("YES")
else:
print("NO")
``` | output | 1 | 20,787 | 9 | 41,575 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The programming competition season has already started and it's time to train for ICPC. Sereja coaches his teams for a number of year and he knows that to get ready for the training session it's not enough to prepare only problems and editorial. As the training sessions lasts for several hours, teams become hungry. Thus, Sereja orders a number of pizzas so they can eat right after the end of the competition.
Teams plan to train for n times during n consecutive days. During the training session Sereja orders exactly one pizza for each team that is present this day. He already knows that there will be ai teams on the i-th day.
There are two types of discounts in Sereja's favourite pizzeria. The first discount works if one buys two pizzas at one day, while the second is a coupon that allows to buy one pizza during two consecutive days (two pizzas in total).
As Sereja orders really a lot of pizza at this place, he is the golden client and can use the unlimited number of discounts and coupons of any type at any days.
Sereja wants to order exactly ai pizzas on the i-th day while using only discounts and coupons. Note, that he will never buy more pizzas than he need for this particular day. Help him determine, whether he can buy the proper amount of pizzas each day if he is allowed to use only coupons and discounts. Note, that it's also prohibited to have any active coupons after the end of the day n.
Input
The first line of input contains a single integer n (1 ≤ n ≤ 200 000) — the number of training sessions.
The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 10 000) — the number of teams that will be present on each of the days.
Output
If there is a way to order pizzas using only coupons and discounts and do not buy any extra pizzas on any of the days, then print "YES" (without quotes) in the only line of output. Otherwise, print "NO" (without quotes).
Examples
Input
4
1 2 1 2
Output
YES
Input
3
1 0 1
Output
NO
Note
In the first sample, Sereja can use one coupon to buy one pizza on the first and the second days, one coupon to buy pizza on the second and the third days and one discount to buy pizzas on the fourth days. This is the only way to order pizzas for this sample.
In the second sample, Sereja can't use neither the coupon nor the discount without ordering an extra pizza. Note, that it's possible that there will be no teams attending the training sessions on some days. | instruction | 0 | 20,788 | 9 | 41,576 |
Tags: constructive algorithms, greedy
Correct Solution:
```
def main():
from sys import stdin,stdout
it =iter((map(int,stdin.read().split())))
n=next(it)
offset=False
for _ in range(n):
ai = next(it)
if offset and ai ==0:break
if offset:
ai+=1
offset=False
if ai &1:
offset=True
stdout.write("No\n" if offset else "YES\n")
if __name__=='__main__':
main()
``` | output | 1 | 20,788 | 9 | 41,577 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The programming competition season has already started and it's time to train for ICPC. Sereja coaches his teams for a number of year and he knows that to get ready for the training session it's not enough to prepare only problems and editorial. As the training sessions lasts for several hours, teams become hungry. Thus, Sereja orders a number of pizzas so they can eat right after the end of the competition.
Teams plan to train for n times during n consecutive days. During the training session Sereja orders exactly one pizza for each team that is present this day. He already knows that there will be ai teams on the i-th day.
There are two types of discounts in Sereja's favourite pizzeria. The first discount works if one buys two pizzas at one day, while the second is a coupon that allows to buy one pizza during two consecutive days (two pizzas in total).
As Sereja orders really a lot of pizza at this place, he is the golden client and can use the unlimited number of discounts and coupons of any type at any days.
Sereja wants to order exactly ai pizzas on the i-th day while using only discounts and coupons. Note, that he will never buy more pizzas than he need for this particular day. Help him determine, whether he can buy the proper amount of pizzas each day if he is allowed to use only coupons and discounts. Note, that it's also prohibited to have any active coupons after the end of the day n.
Input
The first line of input contains a single integer n (1 ≤ n ≤ 200 000) — the number of training sessions.
The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 10 000) — the number of teams that will be present on each of the days.
Output
If there is a way to order pizzas using only coupons and discounts and do not buy any extra pizzas on any of the days, then print "YES" (without quotes) in the only line of output. Otherwise, print "NO" (without quotes).
Examples
Input
4
1 2 1 2
Output
YES
Input
3
1 0 1
Output
NO
Note
In the first sample, Sereja can use one coupon to buy one pizza on the first and the second days, one coupon to buy pizza on the second and the third days and one discount to buy pizzas on the fourth days. This is the only way to order pizzas for this sample.
In the second sample, Sereja can't use neither the coupon nor the discount without ordering an extra pizza. Note, that it's possible that there will be no teams attending the training sessions on some days. | instruction | 0 | 20,789 | 9 | 41,578 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n = int(input())
teams = [int(x) for x in input().split()]
carrying = 0
no_team = False
for i in range(n):
if teams[i] == 0 and carrying == 1:
print("NO")
exit()
if teams[i] % 2 == 1:
if carrying == 0:
carrying = 1
else:
carrying = 0
if carrying == 0:
print("YES")
else:
print("NO")
``` | output | 1 | 20,789 | 9 | 41,579 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The programming competition season has already started and it's time to train for ICPC. Sereja coaches his teams for a number of year and he knows that to get ready for the training session it's not enough to prepare only problems and editorial. As the training sessions lasts for several hours, teams become hungry. Thus, Sereja orders a number of pizzas so they can eat right after the end of the competition.
Teams plan to train for n times during n consecutive days. During the training session Sereja orders exactly one pizza for each team that is present this day. He already knows that there will be ai teams on the i-th day.
There are two types of discounts in Sereja's favourite pizzeria. The first discount works if one buys two pizzas at one day, while the second is a coupon that allows to buy one pizza during two consecutive days (two pizzas in total).
As Sereja orders really a lot of pizza at this place, he is the golden client and can use the unlimited number of discounts and coupons of any type at any days.
Sereja wants to order exactly ai pizzas on the i-th day while using only discounts and coupons. Note, that he will never buy more pizzas than he need for this particular day. Help him determine, whether he can buy the proper amount of pizzas each day if he is allowed to use only coupons and discounts. Note, that it's also prohibited to have any active coupons after the end of the day n.
Input
The first line of input contains a single integer n (1 ≤ n ≤ 200 000) — the number of training sessions.
The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 10 000) — the number of teams that will be present on each of the days.
Output
If there is a way to order pizzas using only coupons and discounts and do not buy any extra pizzas on any of the days, then print "YES" (without quotes) in the only line of output. Otherwise, print "NO" (without quotes).
Examples
Input
4
1 2 1 2
Output
YES
Input
3
1 0 1
Output
NO
Note
In the first sample, Sereja can use one coupon to buy one pizza on the first and the second days, one coupon to buy pizza on the second and the third days and one discount to buy pizzas on the fourth days. This is the only way to order pizzas for this sample.
In the second sample, Sereja can't use neither the coupon nor the discount without ordering an extra pizza. Note, that it's possible that there will be no teams attending the training sessions on some days.
Submitted Solution:
```
#!/usr/bin/env python
#-*-coding:utf-8 -*-
input()
c=0
for a in map(int,input().split()):
if c>a:
print('NO')
break
c^=1&a
else:print('NO'if c else'YES')
``` | instruction | 0 | 20,790 | 9 | 41,580 |
Yes | output | 1 | 20,790 | 9 | 41,581 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The programming competition season has already started and it's time to train for ICPC. Sereja coaches his teams for a number of year and he knows that to get ready for the training session it's not enough to prepare only problems and editorial. As the training sessions lasts for several hours, teams become hungry. Thus, Sereja orders a number of pizzas so they can eat right after the end of the competition.
Teams plan to train for n times during n consecutive days. During the training session Sereja orders exactly one pizza for each team that is present this day. He already knows that there will be ai teams on the i-th day.
There are two types of discounts in Sereja's favourite pizzeria. The first discount works if one buys two pizzas at one day, while the second is a coupon that allows to buy one pizza during two consecutive days (two pizzas in total).
As Sereja orders really a lot of pizza at this place, he is the golden client and can use the unlimited number of discounts and coupons of any type at any days.
Sereja wants to order exactly ai pizzas on the i-th day while using only discounts and coupons. Note, that he will never buy more pizzas than he need for this particular day. Help him determine, whether he can buy the proper amount of pizzas each day if he is allowed to use only coupons and discounts. Note, that it's also prohibited to have any active coupons after the end of the day n.
Input
The first line of input contains a single integer n (1 ≤ n ≤ 200 000) — the number of training sessions.
The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 10 000) — the number of teams that will be present on each of the days.
Output
If there is a way to order pizzas using only coupons and discounts and do not buy any extra pizzas on any of the days, then print "YES" (without quotes) in the only line of output. Otherwise, print "NO" (without quotes).
Examples
Input
4
1 2 1 2
Output
YES
Input
3
1 0 1
Output
NO
Note
In the first sample, Sereja can use one coupon to buy one pizza on the first and the second days, one coupon to buy pizza on the second and the third days and one discount to buy pizzas on the fourth days. This is the only way to order pizzas for this sample.
In the second sample, Sereja can't use neither the coupon nor the discount without ordering an extra pizza. Note, that it's possible that there will be no teams attending the training sessions on some days.
Submitted Solution:
```
n=int(input())
l=list(map(int,input().split()))
k=0
for i in range(n):
if l[i]: k+=l[i]
else:
if k%2: print('NO'); break
k=0
else:
if k%2: print('NO')
else: print("YES")
``` | instruction | 0 | 20,791 | 9 | 41,582 |
Yes | output | 1 | 20,791 | 9 | 41,583 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.