message stringlengths 2 65.1k | message_type stringclasses 2 values | message_id int64 0 1 | conversation_id int64 0 108k | cluster float64 14 14 | __index_level_0__ int64 0 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once Vasya needed to transport m goats and m wolves from riverbank to the other as quickly as possible. The boat can hold n animals and Vasya, in addition, he is permitted to put less than n animals in the boat. If in one place (on one of the banks or in the boat) the wolves happen to strictly outnumber the goats, then the wolves eat the goats and Vasya gets upset. When Vasya swims on the boat from one shore to the other, he must take at least one animal to accompany him, otherwise he will get bored and he will, yet again, feel upset. When the boat reaches the bank, first all the animals get off simultaneously, and then the animals chosen by Vasya simultaneously get on the boat. That means that at the moment when the animals that have just arrived have already got off and the animals that are going to leave haven't yet got on, somebody might eat someone. Vasya needs to transport all the animals from one river bank to the other so that nobody eats anyone and Vasya doesn't get upset. What is the minimal number of times he will have to cross the river?
Input
The first line contains two space-separated numbers m and n (1 ≤ m, n ≤ 105) — the number of animals and the boat's capacity.
Output
If it is impossible to transport all the animals so that no one got upset, and all the goats survived, print -1. Otherwise print the single number — how many times Vasya will have to cross the river.
Examples
Input
3 2
Output
11
Input
33 3
Output
-1
Note
The first sample match to well-known problem for children.
Submitted Solution:
```
a = "2 3"
a = a.split()
m = int(a[0])
n = int(a[1])
l, c, ll, cc, lll, ccc = m, m, 0, 0, 0, 0
nb = 0
if(n>=m):
nb = 0
else:
while((lll!= m or ccc!=m) and nb >= 0):
print(l, c, "-", ll, cc, "-", lll, ccc)
nb += 1
if(nb%2 == 1):
while(ll+cc<n and l+c>0):
if(l >= c and l > 0):
l -= 1
ll += 1
elif(c > 0):
c -= 1
cc += 1
else:
while(ll+cc>1):
if(cc>=1):
cc -= 1
ccc +=1
else:
ll -= 1
lll += 1
if(ll>=1 and ccc == m):
ll -= 1
lll += 1
if((lll>ccc and ccc>0) or (l>c and c>0) or (ll == 0 and cc == 0 and ccc != m and lll != m) or (ll>cc and cc>0) or nb > 1000):
nb = -2
print(l, c, "-", ll, cc, "-", lll, ccc)
print(nb+1)
``` | instruction | 0 | 3,740 | 14 | 7,480 |
No | output | 1 | 3,740 | 14 | 7,481 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once Vasya needed to transport m goats and m wolves from riverbank to the other as quickly as possible. The boat can hold n animals and Vasya, in addition, he is permitted to put less than n animals in the boat. If in one place (on one of the banks or in the boat) the wolves happen to strictly outnumber the goats, then the wolves eat the goats and Vasya gets upset. When Vasya swims on the boat from one shore to the other, he must take at least one animal to accompany him, otherwise he will get bored and he will, yet again, feel upset. When the boat reaches the bank, first all the animals get off simultaneously, and then the animals chosen by Vasya simultaneously get on the boat. That means that at the moment when the animals that have just arrived have already got off and the animals that are going to leave haven't yet got on, somebody might eat someone. Vasya needs to transport all the animals from one river bank to the other so that nobody eats anyone and Vasya doesn't get upset. What is the minimal number of times he will have to cross the river?
Input
The first line contains two space-separated numbers m and n (1 ≤ m, n ≤ 105) — the number of animals and the boat's capacity.
Output
If it is impossible to transport all the animals so that no one got upset, and all the goats survived, print -1. Otherwise print the single number — how many times Vasya will have to cross the river.
Examples
Input
3 2
Output
11
Input
33 3
Output
-1
Note
The first sample match to well-known problem for children.
Submitted Solution:
```
a = input()
a = a.split()
m = int(a[0])
n = int(a[1])
l, c, ll, cc, lll, ccc = m, m, 0, 0, 0, 0
nb = 0
print(l, c, "-", ll, cc, "-", lll, ccc)
while((lll!= m or ccc!=m) and nb != -1):
nb += 1
if(nb%2 == 1):
while(ll+cc<n and l+c>0):
if(l >= c and l > 0):
l -= 1
ll += 1
elif(c > 0):
c -= 1
cc += 1
print(l, c, "-", ll, cc, "-", lll, ccc)
else:
while(ll+cc>1):
if(cc>=1):
cc -= 1
ccc +=1
else:
ll -= 1
lll += 1
if(ll>=1 and ccc == m):
ll -= 1
lll += 1
print(l, c, "-", ll, cc, "-", lll, ccc)
if((lll>ccc and ccc>0) or nb>100):
nb = -1
print(l, c, "-", ll, cc, "-", lll, ccc)
print(nb+1)
``` | instruction | 0 | 3,741 | 14 | 7,482 |
No | output | 1 | 3,741 | 14 | 7,483 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once Vasya needed to transport m goats and m wolves from riverbank to the other as quickly as possible. The boat can hold n animals and Vasya, in addition, he is permitted to put less than n animals in the boat. If in one place (on one of the banks or in the boat) the wolves happen to strictly outnumber the goats, then the wolves eat the goats and Vasya gets upset. When Vasya swims on the boat from one shore to the other, he must take at least one animal to accompany him, otherwise he will get bored and he will, yet again, feel upset. When the boat reaches the bank, first all the animals get off simultaneously, and then the animals chosen by Vasya simultaneously get on the boat. That means that at the moment when the animals that have just arrived have already got off and the animals that are going to leave haven't yet got on, somebody might eat someone. Vasya needs to transport all the animals from one river bank to the other so that nobody eats anyone and Vasya doesn't get upset. What is the minimal number of times he will have to cross the river?
Input
The first line contains two space-separated numbers m and n (1 ≤ m, n ≤ 105) — the number of animals and the boat's capacity.
Output
If it is impossible to transport all the animals so that no one got upset, and all the goats survived, print -1. Otherwise print the single number — how many times Vasya will have to cross the river.
Examples
Input
3 2
Output
11
Input
33 3
Output
-1
Note
The first sample match to well-known problem for children.
Submitted Solution:
```
a = input()
a = a.split()
m = int(a[0])
n = int(a[1])
l, c, ll, cc, lll, ccc = m, m, 0, 0, 0, 0
nb = 0
while((lll!= m or ccc!=m) and nb != -2):
#print(l, c, "-", ll, cc, "-", lll, ccc)
nb += 1
if(nb%2 == 1):
while(ll+cc<n and l+c>0):
if(l >= c and l > 0):
l -= 1
ll += 1
elif(c > 0):
c -= 1
cc += 1
else:
while(ll+cc>1):
if(cc>=1):
cc -= 1
ccc +=1
else:
ll -= 1
lll += 1
if(ll>=1 and ccc == m):
ll -= 1
lll += 1
if((lll>ccc and ccc>0) or (l>c and c>0) or (ll == 0 and cc == 0 and ccc != m and lll != m) or (ll>cc and cc>0) or nb > 1000):
nb = -2
#print(l, c, "-", ll, cc, "-", lll, ccc)
print(nb+1)
``` | instruction | 0 | 3,742 | 14 | 7,484 |
No | output | 1 | 3,742 | 14 | 7,485 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Note that girls in Arpa’s land are really attractive.
Arpa loves overnight parties. In the middle of one of these parties Mehrdad suddenly appeared. He saw n pairs of friends sitting around a table. i-th pair consisted of a boy, sitting on the ai-th chair, and his girlfriend, sitting on the bi-th chair. The chairs were numbered 1 through 2n in clockwise direction. There was exactly one person sitting on each chair.
<image>
There were two types of food: Kooft and Zahre-mar. Now Mehrdad wonders, was there any way to serve food for the guests such that:
* Each person had exactly one type of food,
* No boy had the same type of food as his girlfriend,
* Among any three guests sitting on consecutive chairs, there was two of them who had different type of food. Note that chairs 2n and 1 are considered consecutive.
Find the answer for the Mehrdad question. If it was possible, find some arrangement of food types that satisfies the conditions.
Input
The first line contains an integer n (1 ≤ n ≤ 105) — the number of pairs of guests.
The i-th of the next n lines contains a pair of integers ai and bi (1 ≤ ai, bi ≤ 2n) — the number of chair on which the boy in the i-th pair was sitting and the number of chair on which his girlfriend was sitting. It's guaranteed that there was exactly one person sitting on each chair.
Output
If there is no solution, print -1.
Otherwise print n lines, the i-th of them should contain two integers which represent the type of food for the i-th pair. The first integer in the line is the type of food the boy had, and the second integer is the type of food the girl had. If someone had Kooft, print 1, otherwise print 2.
If there are multiple solutions, print any of them.
Example
Input
3
1 4
2 5
3 6
Output
1 2
2 1
1 2 | instruction | 0 | 3,829 | 14 | 7,658 |
Tags: constructive algorithms, dfs and similar, graphs
Correct Solution:
```
import sys
n = int(input())
A = [0]*(2*n)
B = []
for line in sys.stdin:
x, y = [int(x)-1 for x in line.split()]
A[x] = y
A[y] = x
B.append(x)
C = [0]*(2*n)
for i in range(2*n):
while not C[i]:
C[i] = 1
C[i^1] = 2
i = A[i^1]
for x in B:
print(C[x], C[A[x]])
``` | output | 1 | 3,829 | 14 | 7,659 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Note that girls in Arpa’s land are really attractive.
Arpa loves overnight parties. In the middle of one of these parties Mehrdad suddenly appeared. He saw n pairs of friends sitting around a table. i-th pair consisted of a boy, sitting on the ai-th chair, and his girlfriend, sitting on the bi-th chair. The chairs were numbered 1 through 2n in clockwise direction. There was exactly one person sitting on each chair.
<image>
There were two types of food: Kooft and Zahre-mar. Now Mehrdad wonders, was there any way to serve food for the guests such that:
* Each person had exactly one type of food,
* No boy had the same type of food as his girlfriend,
* Among any three guests sitting on consecutive chairs, there was two of them who had different type of food. Note that chairs 2n and 1 are considered consecutive.
Find the answer for the Mehrdad question. If it was possible, find some arrangement of food types that satisfies the conditions.
Input
The first line contains an integer n (1 ≤ n ≤ 105) — the number of pairs of guests.
The i-th of the next n lines contains a pair of integers ai and bi (1 ≤ ai, bi ≤ 2n) — the number of chair on which the boy in the i-th pair was sitting and the number of chair on which his girlfriend was sitting. It's guaranteed that there was exactly one person sitting on each chair.
Output
If there is no solution, print -1.
Otherwise print n lines, the i-th of them should contain two integers which represent the type of food for the i-th pair. The first integer in the line is the type of food the boy had, and the second integer is the type of food the girl had. If someone had Kooft, print 1, otherwise print 2.
If there are multiple solutions, print any of them.
Example
Input
3
1 4
2 5
3 6
Output
1 2
2 1
1 2 | instruction | 0 | 3,830 | 14 | 7,660 |
Tags: constructive algorithms, dfs and similar, graphs
Correct Solution:
```
import sys
def solve():
n = int(input())
partner = [0]*(2*n)
pacani = []
for line in sys.stdin:
pacan, telka = [int(x) - 1 for x in line.split()]
partner[pacan] = telka
partner[telka] = pacan
pacani.append(pacan)
khavka = [None]*(2*n)
for i in range(2*n):
while khavka[i] is None:
khavka[i] = 1
khavka[i^1] = 2
i = partner[i^1]
for pacan in pacani:
print(khavka[pacan], khavka[partner[pacan]])
solve()
``` | output | 1 | 3,830 | 14 | 7,661 |
Provide a correct Python 3 solution for this coding contest problem.
Peter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.
Peter updates the membership information whenever any changes occur: for instance, the following line written by him means that Carol and Alice are the members of the Design Group.
design:carol,alice.
The name preceding the colon is the group name and the names following it specify its members.
A smaller task group may be included in a larger one. So, a group name can appear as a member of another group, for instance, as follows.
development:alice,bob,design,eve.
Simply unfolding the design above gives the following membership specification, which is equivalent to the original.
development:alice,bob,carol,alice,eve.
In this case, however, alice occurs twice. After removing one of the duplicates, we have the following more concise specification.
development:alice,bob,carol,eve.
Your mission in this problem is to write a program that, given group specifications, identifies group members.
Note that Peter's specifications can include deeply nested groups. In the following, for instance, the group one contains a single member dave.
one:another.
another:yetanother.
yetanother:dave.
Input
The input is a sequence of datasets, each being in the following format.
n
group1:member1,1,...,member1,m1.
.
.
.
groupi:memberi,1,...,memberi,mi.
.
.
.
groupn:membern,1,...,membern,mn.
The first line contains n, which represents the number of groups and is a positive integer no more than 100. Each of the following n lines contains the membership information of a group: groupi (1 ≤ i ≤ n) is the name of the i-th task group and is followed by a colon (:) and then the list of its mi member s that are delimited by a comma (,) and terminated by a period (.).
Those group names are mutually different. Each mi (1 ≤ i ≤ n) is between 1 and 10, inclusive. A member is another group name if it is one of group1, group2,..., or groupn. Otherwise it is an employee name.
There are no circular (or recursive) definitions of group(s). You may assume that mi member names of a group are mutually different.
Each group or employee name is a non-empty character string of length between 1 and 15, inclusive, and consists of lowercase letters.
The end of the input is indicated by a line containing a zero.
Output
For each dataset, output the number of employees included in the first group of the dataset, that is group1, in a line. No extra characters should occur in the output.
Example
Input
2
development:alice,bob,design,eve.
design:carol,alice.
3
one:another.
another:yetanother.
yetanother:dave.
3
friends:alice,bob,bestfriends,carol,fran,badcompany.
bestfriends:eve,alice.
badcompany:dave,carol.
5
a:b,c,d,e.
b:c,d,e,f.
c:d,e,f,g.
d:e,f,g,h.
e:f,g,h,i.
4
aa:bb.
cc:dd,ee.
ff:gg.
bb:cc.
0
Output
4
1
6
4
2 | instruction | 0 | 4,111 | 14 | 8,222 |
"Correct Solution:
```
#!/usr/bin/env python3
from queue import Queue
def input_split(line):
group, members = line.rstrip('.').split(':')
members = members.split(',')
return group, members
while True:
n = int(input())
if n == 0:
exit()
data = [input() for _ in range(n)]
to = {}
rev = {}
sz = 0
for line in data:
group, members = input_split(line)
if group not in to:
to[group] = sz
rev[sz] = group
sz += 1
for m in members:
if m not in to:
to[m] = sz
rev[sz] = m
sz += 1
g = [[] for _ in range(sz)]
indeg = [0] * sz
for line in data:
group, members = input_split(line)
for m in members:
g[to[m]].append(to[group])
indeg[to[group]] += 1
dp = [set() for i in range(sz)]
q = Queue()
for i in range(sz):
if indeg[i] == 0:
dp[i] |= {i}
q.put(i)
while not q.empty():
cur = q.get()
for nxt in g[cur]:
dp[nxt] |= dp[cur]
indeg[nxt] -= 1
if indeg[nxt] == 0:
q.put(nxt)
print(len(dp[0]))
``` | output | 1 | 4,111 | 14 | 8,223 |
Provide a correct Python 3 solution for this coding contest problem.
Peter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.
Peter updates the membership information whenever any changes occur: for instance, the following line written by him means that Carol and Alice are the members of the Design Group.
design:carol,alice.
The name preceding the colon is the group name and the names following it specify its members.
A smaller task group may be included in a larger one. So, a group name can appear as a member of another group, for instance, as follows.
development:alice,bob,design,eve.
Simply unfolding the design above gives the following membership specification, which is equivalent to the original.
development:alice,bob,carol,alice,eve.
In this case, however, alice occurs twice. After removing one of the duplicates, we have the following more concise specification.
development:alice,bob,carol,eve.
Your mission in this problem is to write a program that, given group specifications, identifies group members.
Note that Peter's specifications can include deeply nested groups. In the following, for instance, the group one contains a single member dave.
one:another.
another:yetanother.
yetanother:dave.
Input
The input is a sequence of datasets, each being in the following format.
n
group1:member1,1,...,member1,m1.
.
.
.
groupi:memberi,1,...,memberi,mi.
.
.
.
groupn:membern,1,...,membern,mn.
The first line contains n, which represents the number of groups and is a positive integer no more than 100. Each of the following n lines contains the membership information of a group: groupi (1 ≤ i ≤ n) is the name of the i-th task group and is followed by a colon (:) and then the list of its mi member s that are delimited by a comma (,) and terminated by a period (.).
Those group names are mutually different. Each mi (1 ≤ i ≤ n) is between 1 and 10, inclusive. A member is another group name if it is one of group1, group2,..., or groupn. Otherwise it is an employee name.
There are no circular (or recursive) definitions of group(s). You may assume that mi member names of a group are mutually different.
Each group or employee name is a non-empty character string of length between 1 and 15, inclusive, and consists of lowercase letters.
The end of the input is indicated by a line containing a zero.
Output
For each dataset, output the number of employees included in the first group of the dataset, that is group1, in a line. No extra characters should occur in the output.
Example
Input
2
development:alice,bob,design,eve.
design:carol,alice.
3
one:another.
another:yetanother.
yetanother:dave.
3
friends:alice,bob,bestfriends,carol,fran,badcompany.
bestfriends:eve,alice.
badcompany:dave,carol.
5
a:b,c,d,e.
b:c,d,e,f.
c:d,e,f,g.
d:e,f,g,h.
e:f,g,h,i.
4
aa:bb.
cc:dd,ee.
ff:gg.
bb:cc.
0
Output
4
1
6
4
2 | instruction | 0 | 4,112 | 14 | 8,224 |
"Correct Solution:
```
# coding: utf-8
def addset(args):
global a
for m in args:
if dic[m]==1:
a.add(m)
else:
if m not in used:
used.add(m)
addset(dc[m])
while True:
n=int(input())
if n==0:
break
dic={}
first=[]
dc={}
for i in range(n):
g,m=input().split(':')
m=m.rstrip('.').split(',')
dc[g]=m
if i==0:
first.append(g)
first+=m
dic[g]=2
for mem in m:
if mem not in dic:
dic[mem]=1
a=set()
used=set()
addset(first[1:])
print(len(a))
``` | output | 1 | 4,112 | 14 | 8,225 |
Provide a correct Python 3 solution for this coding contest problem.
Peter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.
Peter updates the membership information whenever any changes occur: for instance, the following line written by him means that Carol and Alice are the members of the Design Group.
design:carol,alice.
The name preceding the colon is the group name and the names following it specify its members.
A smaller task group may be included in a larger one. So, a group name can appear as a member of another group, for instance, as follows.
development:alice,bob,design,eve.
Simply unfolding the design above gives the following membership specification, which is equivalent to the original.
development:alice,bob,carol,alice,eve.
In this case, however, alice occurs twice. After removing one of the duplicates, we have the following more concise specification.
development:alice,bob,carol,eve.
Your mission in this problem is to write a program that, given group specifications, identifies group members.
Note that Peter's specifications can include deeply nested groups. In the following, for instance, the group one contains a single member dave.
one:another.
another:yetanother.
yetanother:dave.
Input
The input is a sequence of datasets, each being in the following format.
n
group1:member1,1,...,member1,m1.
.
.
.
groupi:memberi,1,...,memberi,mi.
.
.
.
groupn:membern,1,...,membern,mn.
The first line contains n, which represents the number of groups and is a positive integer no more than 100. Each of the following n lines contains the membership information of a group: groupi (1 ≤ i ≤ n) is the name of the i-th task group and is followed by a colon (:) and then the list of its mi member s that are delimited by a comma (,) and terminated by a period (.).
Those group names are mutually different. Each mi (1 ≤ i ≤ n) is between 1 and 10, inclusive. A member is another group name if it is one of group1, group2,..., or groupn. Otherwise it is an employee name.
There are no circular (or recursive) definitions of group(s). You may assume that mi member names of a group are mutually different.
Each group or employee name is a non-empty character string of length between 1 and 15, inclusive, and consists of lowercase letters.
The end of the input is indicated by a line containing a zero.
Output
For each dataset, output the number of employees included in the first group of the dataset, that is group1, in a line. No extra characters should occur in the output.
Example
Input
2
development:alice,bob,design,eve.
design:carol,alice.
3
one:another.
another:yetanother.
yetanother:dave.
3
friends:alice,bob,bestfriends,carol,fran,badcompany.
bestfriends:eve,alice.
badcompany:dave,carol.
5
a:b,c,d,e.
b:c,d,e,f.
c:d,e,f,g.
d:e,f,g,h.
e:f,g,h,i.
4
aa:bb.
cc:dd,ee.
ff:gg.
bb:cc.
0
Output
4
1
6
4
2 | instruction | 0 | 4,113 | 14 | 8,226 |
"Correct Solution:
```
while True:
N = int(input())
if N == 0:
break
first_group_menbers = set(input()[:-1].split(":")[1].split(","))
d = {}
for i in range(N-1):
group, members = input()[:-1].split(":")
d[group] = set(members.split(","))
for i in range(N-1):
for group, members in d.items():
if group in first_group_menbers:
first_group_menbers.remove(group)
for m in members:
first_group_menbers.add(m)
print(len(first_group_menbers))
``` | output | 1 | 4,113 | 14 | 8,227 |
Provide a correct Python 3 solution for this coding contest problem.
Peter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.
Peter updates the membership information whenever any changes occur: for instance, the following line written by him means that Carol and Alice are the members of the Design Group.
design:carol,alice.
The name preceding the colon is the group name and the names following it specify its members.
A smaller task group may be included in a larger one. So, a group name can appear as a member of another group, for instance, as follows.
development:alice,bob,design,eve.
Simply unfolding the design above gives the following membership specification, which is equivalent to the original.
development:alice,bob,carol,alice,eve.
In this case, however, alice occurs twice. After removing one of the duplicates, we have the following more concise specification.
development:alice,bob,carol,eve.
Your mission in this problem is to write a program that, given group specifications, identifies group members.
Note that Peter's specifications can include deeply nested groups. In the following, for instance, the group one contains a single member dave.
one:another.
another:yetanother.
yetanother:dave.
Input
The input is a sequence of datasets, each being in the following format.
n
group1:member1,1,...,member1,m1.
.
.
.
groupi:memberi,1,...,memberi,mi.
.
.
.
groupn:membern,1,...,membern,mn.
The first line contains n, which represents the number of groups and is a positive integer no more than 100. Each of the following n lines contains the membership information of a group: groupi (1 ≤ i ≤ n) is the name of the i-th task group and is followed by a colon (:) and then the list of its mi member s that are delimited by a comma (,) and terminated by a period (.).
Those group names are mutually different. Each mi (1 ≤ i ≤ n) is between 1 and 10, inclusive. A member is another group name if it is one of group1, group2,..., or groupn. Otherwise it is an employee name.
There are no circular (or recursive) definitions of group(s). You may assume that mi member names of a group are mutually different.
Each group or employee name is a non-empty character string of length between 1 and 15, inclusive, and consists of lowercase letters.
The end of the input is indicated by a line containing a zero.
Output
For each dataset, output the number of employees included in the first group of the dataset, that is group1, in a line. No extra characters should occur in the output.
Example
Input
2
development:alice,bob,design,eve.
design:carol,alice.
3
one:another.
another:yetanother.
yetanother:dave.
3
friends:alice,bob,bestfriends,carol,fran,badcompany.
bestfriends:eve,alice.
badcompany:dave,carol.
5
a:b,c,d,e.
b:c,d,e,f.
c:d,e,f,g.
d:e,f,g,h.
e:f,g,h,i.
4
aa:bb.
cc:dd,ee.
ff:gg.
bb:cc.
0
Output
4
1
6
4
2 | instruction | 0 | 4,114 | 14 | 8,228 |
"Correct Solution:
```
while True:
N = int(input())
if N == 0:
break
first_group_menbers = set(input()[:-1].split(":")[1].split(","))
d = {}
for i in range(N-1):
group, members = input()[:-1].split(":")
d[group] = set(members.split(","))
for i in range(N):
for group, members in d.items():
if group in first_group_menbers:
first_group_menbers.remove(group)
for m in members:
first_group_menbers.add(m)
print(len(first_group_menbers))
``` | output | 1 | 4,114 | 14 | 8,229 |
Provide a correct Python 3 solution for this coding contest problem.
Peter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.
Peter updates the membership information whenever any changes occur: for instance, the following line written by him means that Carol and Alice are the members of the Design Group.
design:carol,alice.
The name preceding the colon is the group name and the names following it specify its members.
A smaller task group may be included in a larger one. So, a group name can appear as a member of another group, for instance, as follows.
development:alice,bob,design,eve.
Simply unfolding the design above gives the following membership specification, which is equivalent to the original.
development:alice,bob,carol,alice,eve.
In this case, however, alice occurs twice. After removing one of the duplicates, we have the following more concise specification.
development:alice,bob,carol,eve.
Your mission in this problem is to write a program that, given group specifications, identifies group members.
Note that Peter's specifications can include deeply nested groups. In the following, for instance, the group one contains a single member dave.
one:another.
another:yetanother.
yetanother:dave.
Input
The input is a sequence of datasets, each being in the following format.
n
group1:member1,1,...,member1,m1.
.
.
.
groupi:memberi,1,...,memberi,mi.
.
.
.
groupn:membern,1,...,membern,mn.
The first line contains n, which represents the number of groups and is a positive integer no more than 100. Each of the following n lines contains the membership information of a group: groupi (1 ≤ i ≤ n) is the name of the i-th task group and is followed by a colon (:) and then the list of its mi member s that are delimited by a comma (,) and terminated by a period (.).
Those group names are mutually different. Each mi (1 ≤ i ≤ n) is between 1 and 10, inclusive. A member is another group name if it is one of group1, group2,..., or groupn. Otherwise it is an employee name.
There are no circular (or recursive) definitions of group(s). You may assume that mi member names of a group are mutually different.
Each group or employee name is a non-empty character string of length between 1 and 15, inclusive, and consists of lowercase letters.
The end of the input is indicated by a line containing a zero.
Output
For each dataset, output the number of employees included in the first group of the dataset, that is group1, in a line. No extra characters should occur in the output.
Example
Input
2
development:alice,bob,design,eve.
design:carol,alice.
3
one:another.
another:yetanother.
yetanother:dave.
3
friends:alice,bob,bestfriends,carol,fran,badcompany.
bestfriends:eve,alice.
badcompany:dave,carol.
5
a:b,c,d,e.
b:c,d,e,f.
c:d,e,f,g.
d:e,f,g,h.
e:f,g,h,i.
4
aa:bb.
cc:dd,ee.
ff:gg.
bb:cc.
0
Output
4
1
6
4
2 | instruction | 0 | 4,115 | 14 | 8,230 |
"Correct Solution:
```
while True:
N = int(input())
if N == 0:
break
first_group_menbers = set(input()[:-1].split(":")[1].split(","))
d = {}
for i in range(N-1):
group, members = input()[:-1].split(":")
d[group] = set(members.split(","))
for i in range(N-2):
for group, members in d.items():
if group in first_group_menbers:
first_group_menbers.remove(group)
for m in members:
first_group_menbers.add(m)
print(len(first_group_menbers))
``` | output | 1 | 4,115 | 14 | 8,231 |
Provide a correct Python 3 solution for this coding contest problem.
Peter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.
Peter updates the membership information whenever any changes occur: for instance, the following line written by him means that Carol and Alice are the members of the Design Group.
design:carol,alice.
The name preceding the colon is the group name and the names following it specify its members.
A smaller task group may be included in a larger one. So, a group name can appear as a member of another group, for instance, as follows.
development:alice,bob,design,eve.
Simply unfolding the design above gives the following membership specification, which is equivalent to the original.
development:alice,bob,carol,alice,eve.
In this case, however, alice occurs twice. After removing one of the duplicates, we have the following more concise specification.
development:alice,bob,carol,eve.
Your mission in this problem is to write a program that, given group specifications, identifies group members.
Note that Peter's specifications can include deeply nested groups. In the following, for instance, the group one contains a single member dave.
one:another.
another:yetanother.
yetanother:dave.
Input
The input is a sequence of datasets, each being in the following format.
n
group1:member1,1,...,member1,m1.
.
.
.
groupi:memberi,1,...,memberi,mi.
.
.
.
groupn:membern,1,...,membern,mn.
The first line contains n, which represents the number of groups and is a positive integer no more than 100. Each of the following n lines contains the membership information of a group: groupi (1 ≤ i ≤ n) is the name of the i-th task group and is followed by a colon (:) and then the list of its mi member s that are delimited by a comma (,) and terminated by a period (.).
Those group names are mutually different. Each mi (1 ≤ i ≤ n) is between 1 and 10, inclusive. A member is another group name if it is one of group1, group2,..., or groupn. Otherwise it is an employee name.
There are no circular (or recursive) definitions of group(s). You may assume that mi member names of a group are mutually different.
Each group or employee name is a non-empty character string of length between 1 and 15, inclusive, and consists of lowercase letters.
The end of the input is indicated by a line containing a zero.
Output
For each dataset, output the number of employees included in the first group of the dataset, that is group1, in a line. No extra characters should occur in the output.
Example
Input
2
development:alice,bob,design,eve.
design:carol,alice.
3
one:another.
another:yetanother.
yetanother:dave.
3
friends:alice,bob,bestfriends,carol,fran,badcompany.
bestfriends:eve,alice.
badcompany:dave,carol.
5
a:b,c,d,e.
b:c,d,e,f.
c:d,e,f,g.
d:e,f,g,h.
e:f,g,h,i.
4
aa:bb.
cc:dd,ee.
ff:gg.
bb:cc.
0
Output
4
1
6
4
2 | instruction | 0 | 4,116 | 14 | 8,232 |
"Correct Solution:
```
import re
N = 1
while True:
N = int(input())
if not N:
break
tmp, groups, firstgroup = [], {}, []
for i in range(N):
tmp = re.split(r"[\,\.\:]", input())
if not i:
firstgroup = tmp[1:]
else:
groups[tmp[0]] = tmp[1:]
while True:
change = False
tmp = []
for i in range(len(firstgroup)):
if firstgroup[i] in groups:
tmp += groups[firstgroup[i]]
change = True
else:
tmp.append(firstgroup[i])
firstgroup = ['']
for i in tmp:
if i not in firstgroup:
firstgroup.append(i)
if not change:
break
print(len(firstgroup) - 1)
``` | output | 1 | 4,116 | 14 | 8,233 |
Provide a correct Python 3 solution for this coding contest problem.
Peter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.
Peter updates the membership information whenever any changes occur: for instance, the following line written by him means that Carol and Alice are the members of the Design Group.
design:carol,alice.
The name preceding the colon is the group name and the names following it specify its members.
A smaller task group may be included in a larger one. So, a group name can appear as a member of another group, for instance, as follows.
development:alice,bob,design,eve.
Simply unfolding the design above gives the following membership specification, which is equivalent to the original.
development:alice,bob,carol,alice,eve.
In this case, however, alice occurs twice. After removing one of the duplicates, we have the following more concise specification.
development:alice,bob,carol,eve.
Your mission in this problem is to write a program that, given group specifications, identifies group members.
Note that Peter's specifications can include deeply nested groups. In the following, for instance, the group one contains a single member dave.
one:another.
another:yetanother.
yetanother:dave.
Input
The input is a sequence of datasets, each being in the following format.
n
group1:member1,1,...,member1,m1.
.
.
.
groupi:memberi,1,...,memberi,mi.
.
.
.
groupn:membern,1,...,membern,mn.
The first line contains n, which represents the number of groups and is a positive integer no more than 100. Each of the following n lines contains the membership information of a group: groupi (1 ≤ i ≤ n) is the name of the i-th task group and is followed by a colon (:) and then the list of its mi member s that are delimited by a comma (,) and terminated by a period (.).
Those group names are mutually different. Each mi (1 ≤ i ≤ n) is between 1 and 10, inclusive. A member is another group name if it is one of group1, group2,..., or groupn. Otherwise it is an employee name.
There are no circular (or recursive) definitions of group(s). You may assume that mi member names of a group are mutually different.
Each group or employee name is a non-empty character string of length between 1 and 15, inclusive, and consists of lowercase letters.
The end of the input is indicated by a line containing a zero.
Output
For each dataset, output the number of employees included in the first group of the dataset, that is group1, in a line. No extra characters should occur in the output.
Example
Input
2
development:alice,bob,design,eve.
design:carol,alice.
3
one:another.
another:yetanother.
yetanother:dave.
3
friends:alice,bob,bestfriends,carol,fran,badcompany.
bestfriends:eve,alice.
badcompany:dave,carol.
5
a:b,c,d,e.
b:c,d,e,f.
c:d,e,f,g.
d:e,f,g,h.
e:f,g,h,i.
4
aa:bb.
cc:dd,ee.
ff:gg.
bb:cc.
0
Output
4
1
6
4
2 | instruction | 0 | 4,117 | 14 | 8,234 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
dd = [(0,-1),(1,0),(0,1),(-1,0)]
ddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
rr = []
while True:
n = I()
if n == 0:
break
a = [S().split(':') for _ in range(n)]
ts = set([c[0] for c in a])
ms = {}
for t,m in a:
ms[t] = m[:-1].split(',')
fm = {}
def f(c):
if c in fm:
return fm[c]
if c in ts:
s = set()
for k in ms[c]:
s |= f(k)
fm[c] = s
return s
fm[c] = set([c])
return fm[c]
r = f(a[0][0])
rr.append(len(r))
return '\n'.join(map(str,rr))
print(main())
``` | output | 1 | 4,117 | 14 | 8,235 |
Provide a correct Python 3 solution for this coding contest problem.
Peter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.
Peter updates the membership information whenever any changes occur: for instance, the following line written by him means that Carol and Alice are the members of the Design Group.
design:carol,alice.
The name preceding the colon is the group name and the names following it specify its members.
A smaller task group may be included in a larger one. So, a group name can appear as a member of another group, for instance, as follows.
development:alice,bob,design,eve.
Simply unfolding the design above gives the following membership specification, which is equivalent to the original.
development:alice,bob,carol,alice,eve.
In this case, however, alice occurs twice. After removing one of the duplicates, we have the following more concise specification.
development:alice,bob,carol,eve.
Your mission in this problem is to write a program that, given group specifications, identifies group members.
Note that Peter's specifications can include deeply nested groups. In the following, for instance, the group one contains a single member dave.
one:another.
another:yetanother.
yetanother:dave.
Input
The input is a sequence of datasets, each being in the following format.
n
group1:member1,1,...,member1,m1.
.
.
.
groupi:memberi,1,...,memberi,mi.
.
.
.
groupn:membern,1,...,membern,mn.
The first line contains n, which represents the number of groups and is a positive integer no more than 100. Each of the following n lines contains the membership information of a group: groupi (1 ≤ i ≤ n) is the name of the i-th task group and is followed by a colon (:) and then the list of its mi member s that are delimited by a comma (,) and terminated by a period (.).
Those group names are mutually different. Each mi (1 ≤ i ≤ n) is between 1 and 10, inclusive. A member is another group name if it is one of group1, group2,..., or groupn. Otherwise it is an employee name.
There are no circular (or recursive) definitions of group(s). You may assume that mi member names of a group are mutually different.
Each group or employee name is a non-empty character string of length between 1 and 15, inclusive, and consists of lowercase letters.
The end of the input is indicated by a line containing a zero.
Output
For each dataset, output the number of employees included in the first group of the dataset, that is group1, in a line. No extra characters should occur in the output.
Example
Input
2
development:alice,bob,design,eve.
design:carol,alice.
3
one:another.
another:yetanother.
yetanother:dave.
3
friends:alice,bob,bestfriends,carol,fran,badcompany.
bestfriends:eve,alice.
badcompany:dave,carol.
5
a:b,c,d,e.
b:c,d,e,f.
c:d,e,f,g.
d:e,f,g,h.
e:f,g,h,i.
4
aa:bb.
cc:dd,ee.
ff:gg.
bb:cc.
0
Output
4
1
6
4
2 | instruction | 0 | 4,118 | 14 | 8,236 |
"Correct Solution:
```
#!/usr/bin/env python3
import sys
import math
import re
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
while 1:
n = I()
if n == 0:
quit()
f = defaultdict(dict)
t = defaultdict(lambda : False)
ch = defaultdict(lambda : False)
stack = []
for i in range(n):
x = input()[:-1].split(':')
y = x[1].split(',')
x = x[0]
for j in y:
f[x][j] = 1
if i != 0:
continue
stack.append(j)
ans = 0
while stack:
x = stack.pop()
if ch[x]:
continue
ch[x] = True
if len(f[x]) == 0 and not t[x]:
ans += 1
t[x] = True
continue
for i,j in f[x].items():
stack.append(i)
print(ans)
``` | output | 1 | 4,118 | 14 | 8,237 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Peter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.
Peter updates the membership information whenever any changes occur: for instance, the following line written by him means that Carol and Alice are the members of the Design Group.
design:carol,alice.
The name preceding the colon is the group name and the names following it specify its members.
A smaller task group may be included in a larger one. So, a group name can appear as a member of another group, for instance, as follows.
development:alice,bob,design,eve.
Simply unfolding the design above gives the following membership specification, which is equivalent to the original.
development:alice,bob,carol,alice,eve.
In this case, however, alice occurs twice. After removing one of the duplicates, we have the following more concise specification.
development:alice,bob,carol,eve.
Your mission in this problem is to write a program that, given group specifications, identifies group members.
Note that Peter's specifications can include deeply nested groups. In the following, for instance, the group one contains a single member dave.
one:another.
another:yetanother.
yetanother:dave.
Input
The input is a sequence of datasets, each being in the following format.
n
group1:member1,1,...,member1,m1.
.
.
.
groupi:memberi,1,...,memberi,mi.
.
.
.
groupn:membern,1,...,membern,mn.
The first line contains n, which represents the number of groups and is a positive integer no more than 100. Each of the following n lines contains the membership information of a group: groupi (1 ≤ i ≤ n) is the name of the i-th task group and is followed by a colon (:) and then the list of its mi member s that are delimited by a comma (,) and terminated by a period (.).
Those group names are mutually different. Each mi (1 ≤ i ≤ n) is between 1 and 10, inclusive. A member is another group name if it is one of group1, group2,..., or groupn. Otherwise it is an employee name.
There are no circular (or recursive) definitions of group(s). You may assume that mi member names of a group are mutually different.
Each group or employee name is a non-empty character string of length between 1 and 15, inclusive, and consists of lowercase letters.
The end of the input is indicated by a line containing a zero.
Output
For each dataset, output the number of employees included in the first group of the dataset, that is group1, in a line. No extra characters should occur in the output.
Example
Input
2
development:alice,bob,design,eve.
design:carol,alice.
3
one:another.
another:yetanother.
yetanother:dave.
3
friends:alice,bob,bestfriends,carol,fran,badcompany.
bestfriends:eve,alice.
badcompany:dave,carol.
5
a:b,c,d,e.
b:c,d,e,f.
c:d,e,f,g.
d:e,f,g,h.
e:f,g,h,i.
4
aa:bb.
cc:dd,ee.
ff:gg.
bb:cc.
0
Output
4
1
6
4
2
Submitted Solution:
```
while True:
n = int(input())
if(n==0): break
data = {}
firstname = ''
for i in range(n):
d = input()
name = d.split(':')[0]
if(i==0): firstname = name
data[name] = []
for x in d.split(':')[1].strip('.').split(','):
data[name].append(x)
removed = []
for x in data[firstname]:
if x in data:
removed.append(x)
for y in data[x]:
data[firstname].append(y)
data.pop(x)
edited = set(data[firstname])
for i in removed:
edited.remove(i)
print(len(edited))
``` | instruction | 0 | 4,119 | 14 | 8,238 |
Yes | output | 1 | 4,119 | 14 | 8,239 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Peter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.
Peter updates the membership information whenever any changes occur: for instance, the following line written by him means that Carol and Alice are the members of the Design Group.
design:carol,alice.
The name preceding the colon is the group name and the names following it specify its members.
A smaller task group may be included in a larger one. So, a group name can appear as a member of another group, for instance, as follows.
development:alice,bob,design,eve.
Simply unfolding the design above gives the following membership specification, which is equivalent to the original.
development:alice,bob,carol,alice,eve.
In this case, however, alice occurs twice. After removing one of the duplicates, we have the following more concise specification.
development:alice,bob,carol,eve.
Your mission in this problem is to write a program that, given group specifications, identifies group members.
Note that Peter's specifications can include deeply nested groups. In the following, for instance, the group one contains a single member dave.
one:another.
another:yetanother.
yetanother:dave.
Input
The input is a sequence of datasets, each being in the following format.
n
group1:member1,1,...,member1,m1.
.
.
.
groupi:memberi,1,...,memberi,mi.
.
.
.
groupn:membern,1,...,membern,mn.
The first line contains n, which represents the number of groups and is a positive integer no more than 100. Each of the following n lines contains the membership information of a group: groupi (1 ≤ i ≤ n) is the name of the i-th task group and is followed by a colon (:) and then the list of its mi member s that are delimited by a comma (,) and terminated by a period (.).
Those group names are mutually different. Each mi (1 ≤ i ≤ n) is between 1 and 10, inclusive. A member is another group name if it is one of group1, group2,..., or groupn. Otherwise it is an employee name.
There are no circular (or recursive) definitions of group(s). You may assume that mi member names of a group are mutually different.
Each group or employee name is a non-empty character string of length between 1 and 15, inclusive, and consists of lowercase letters.
The end of the input is indicated by a line containing a zero.
Output
For each dataset, output the number of employees included in the first group of the dataset, that is group1, in a line. No extra characters should occur in the output.
Example
Input
2
development:alice,bob,design,eve.
design:carol,alice.
3
one:another.
another:yetanother.
yetanother:dave.
3
friends:alice,bob,bestfriends,carol,fran,badcompany.
bestfriends:eve,alice.
badcompany:dave,carol.
5
a:b,c,d,e.
b:c,d,e,f.
c:d,e,f,g.
d:e,f,g,h.
e:f,g,h,i.
4
aa:bb.
cc:dd,ee.
ff:gg.
bb:cc.
0
Output
4
1
6
4
2
Submitted Solution:
```
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [input().rstrip()[:-1] for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10
#solve
def solve():
n = II()
if n == 0:
return False
group = set()
go_group = set()
member = set()
d = defaultdict(int)
g = SR(n)
for gi in g:
group.add(gi.split(":")[0])
d[gi.split(":")[0]] = gi.split(":")[1].split(",")
C = defaultdict(int)
def s(g):
for gi in g:
if gi in group:
if C[gi]:
continue
C[gi] = 1
s(d[gi])
else:
member.add(gi)
s(d[g[0].split(":")[0]])
print(len(member))
return True
#main
if __name__ == '__main__':
while solve():
pass
``` | instruction | 0 | 4,120 | 14 | 8,240 |
Yes | output | 1 | 4,120 | 14 | 8,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Peter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.
Peter updates the membership information whenever any changes occur: for instance, the following line written by him means that Carol and Alice are the members of the Design Group.
design:carol,alice.
The name preceding the colon is the group name and the names following it specify its members.
A smaller task group may be included in a larger one. So, a group name can appear as a member of another group, for instance, as follows.
development:alice,bob,design,eve.
Simply unfolding the design above gives the following membership specification, which is equivalent to the original.
development:alice,bob,carol,alice,eve.
In this case, however, alice occurs twice. After removing one of the duplicates, we have the following more concise specification.
development:alice,bob,carol,eve.
Your mission in this problem is to write a program that, given group specifications, identifies group members.
Note that Peter's specifications can include deeply nested groups. In the following, for instance, the group one contains a single member dave.
one:another.
another:yetanother.
yetanother:dave.
Input
The input is a sequence of datasets, each being in the following format.
n
group1:member1,1,...,member1,m1.
.
.
.
groupi:memberi,1,...,memberi,mi.
.
.
.
groupn:membern,1,...,membern,mn.
The first line contains n, which represents the number of groups and is a positive integer no more than 100. Each of the following n lines contains the membership information of a group: groupi (1 ≤ i ≤ n) is the name of the i-th task group and is followed by a colon (:) and then the list of its mi member s that are delimited by a comma (,) and terminated by a period (.).
Those group names are mutually different. Each mi (1 ≤ i ≤ n) is between 1 and 10, inclusive. A member is another group name if it is one of group1, group2,..., or groupn. Otherwise it is an employee name.
There are no circular (or recursive) definitions of group(s). You may assume that mi member names of a group are mutually different.
Each group or employee name is a non-empty character string of length between 1 and 15, inclusive, and consists of lowercase letters.
The end of the input is indicated by a line containing a zero.
Output
For each dataset, output the number of employees included in the first group of the dataset, that is group1, in a line. No extra characters should occur in the output.
Example
Input
2
development:alice,bob,design,eve.
design:carol,alice.
3
one:another.
another:yetanother.
yetanother:dave.
3
friends:alice,bob,bestfriends,carol,fran,badcompany.
bestfriends:eve,alice.
badcompany:dave,carol.
5
a:b,c,d,e.
b:c,d,e,f.
c:d,e,f,g.
d:e,f,g,h.
e:f,g,h,i.
4
aa:bb.
cc:dd,ee.
ff:gg.
bb:cc.
0
Output
4
1
6
4
2
Submitted Solution:
```
def check(dic,index):
ret = []
for c in dic[index]:
if c in dic.keys():
for d in check(dic,c):
if not(d in ret):
ret.append(d)
else:
if not(c in ret):
ret.append(c)
dic[index] = ret
return ret
while True:
n = int(input())
if n == 0:
break
dic = {}
index = ''
for i in range(n):
a,b = [char for char in input()[0:-1].split(':')]
if i == 0:
index = a
b = b.split(',')
dic[a] = b
#print(dic.keys())
print(len(check(dic,index)))
``` | instruction | 0 | 4,121 | 14 | 8,242 |
Yes | output | 1 | 4,121 | 14 | 8,243 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Peter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.
Peter updates the membership information whenever any changes occur: for instance, the following line written by him means that Carol and Alice are the members of the Design Group.
design:carol,alice.
The name preceding the colon is the group name and the names following it specify its members.
A smaller task group may be included in a larger one. So, a group name can appear as a member of another group, for instance, as follows.
development:alice,bob,design,eve.
Simply unfolding the design above gives the following membership specification, which is equivalent to the original.
development:alice,bob,carol,alice,eve.
In this case, however, alice occurs twice. After removing one of the duplicates, we have the following more concise specification.
development:alice,bob,carol,eve.
Your mission in this problem is to write a program that, given group specifications, identifies group members.
Note that Peter's specifications can include deeply nested groups. In the following, for instance, the group one contains a single member dave.
one:another.
another:yetanother.
yetanother:dave.
Input
The input is a sequence of datasets, each being in the following format.
n
group1:member1,1,...,member1,m1.
.
.
.
groupi:memberi,1,...,memberi,mi.
.
.
.
groupn:membern,1,...,membern,mn.
The first line contains n, which represents the number of groups and is a positive integer no more than 100. Each of the following n lines contains the membership information of a group: groupi (1 ≤ i ≤ n) is the name of the i-th task group and is followed by a colon (:) and then the list of its mi member s that are delimited by a comma (,) and terminated by a period (.).
Those group names are mutually different. Each mi (1 ≤ i ≤ n) is between 1 and 10, inclusive. A member is another group name if it is one of group1, group2,..., or groupn. Otherwise it is an employee name.
There are no circular (or recursive) definitions of group(s). You may assume that mi member names of a group are mutually different.
Each group or employee name is a non-empty character string of length between 1 and 15, inclusive, and consists of lowercase letters.
The end of the input is indicated by a line containing a zero.
Output
For each dataset, output the number of employees included in the first group of the dataset, that is group1, in a line. No extra characters should occur in the output.
Example
Input
2
development:alice,bob,design,eve.
design:carol,alice.
3
one:another.
another:yetanother.
yetanother:dave.
3
friends:alice,bob,bestfriends,carol,fran,badcompany.
bestfriends:eve,alice.
badcompany:dave,carol.
5
a:b,c,d,e.
b:c,d,e,f.
c:d,e,f,g.
d:e,f,g,h.
e:f,g,h,i.
4
aa:bb.
cc:dd,ee.
ff:gg.
bb:cc.
0
Output
4
1
6
4
2
Submitted Solution:
```
def get_num(u, map, vis):
if u in vis:
return 0;
else:
vis[u] = True;
ans = 0;
if u in map:
for v in map[u]:
ans += get_num(v, map, vis);
else:
ans += 1;
return ans;
def main():
while True:
n = int(input());
if n == 0:
break;
edge = {}; name = {}; vis = {};
for i in range(0, n):
str = input();
u = name[i] = str.split(':')[0];
group = str.split(':')[1].split('.')[0].split(',');
for v in group:
if u in edge:
edge[u][v] = True;
else:
edge[u] = {v:True};
print(get_num(name[0], edge, vis));
main();
``` | instruction | 0 | 4,122 | 14 | 8,244 |
Yes | output | 1 | 4,122 | 14 | 8,245 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Peter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.
Peter updates the membership information whenever any changes occur: for instance, the following line written by him means that Carol and Alice are the members of the Design Group.
design:carol,alice.
The name preceding the colon is the group name and the names following it specify its members.
A smaller task group may be included in a larger one. So, a group name can appear as a member of another group, for instance, as follows.
development:alice,bob,design,eve.
Simply unfolding the design above gives the following membership specification, which is equivalent to the original.
development:alice,bob,carol,alice,eve.
In this case, however, alice occurs twice. After removing one of the duplicates, we have the following more concise specification.
development:alice,bob,carol,eve.
Your mission in this problem is to write a program that, given group specifications, identifies group members.
Note that Peter's specifications can include deeply nested groups. In the following, for instance, the group one contains a single member dave.
one:another.
another:yetanother.
yetanother:dave.
Input
The input is a sequence of datasets, each being in the following format.
n
group1:member1,1,...,member1,m1.
.
.
.
groupi:memberi,1,...,memberi,mi.
.
.
.
groupn:membern,1,...,membern,mn.
The first line contains n, which represents the number of groups and is a positive integer no more than 100. Each of the following n lines contains the membership information of a group: groupi (1 ≤ i ≤ n) is the name of the i-th task group and is followed by a colon (:) and then the list of its mi member s that are delimited by a comma (,) and terminated by a period (.).
Those group names are mutually different. Each mi (1 ≤ i ≤ n) is between 1 and 10, inclusive. A member is another group name if it is one of group1, group2,..., or groupn. Otherwise it is an employee name.
There are no circular (or recursive) definitions of group(s). You may assume that mi member names of a group are mutually different.
Each group or employee name is a non-empty character string of length between 1 and 15, inclusive, and consists of lowercase letters.
The end of the input is indicated by a line containing a zero.
Output
For each dataset, output the number of employees included in the first group of the dataset, that is group1, in a line. No extra characters should occur in the output.
Example
Input
2
development:alice,bob,design,eve.
design:carol,alice.
3
one:another.
another:yetanother.
yetanother:dave.
3
friends:alice,bob,bestfriends,carol,fran,badcompany.
bestfriends:eve,alice.
badcompany:dave,carol.
5
a:b,c,d,e.
b:c,d,e,f.
c:d,e,f,g.
d:e,f,g,h.
e:f,g,h,i.
4
aa:bb.
cc:dd,ee.
ff:gg.
bb:cc.
0
Output
4
1
6
4
2
Submitted Solution:
```
from django.template.defaultfilters import first
while True:
N = int(input())
if N == 0:
break
first_group_menbers = set(input()[:-1].split(":")[1].split(","))
d = {}
for i in range(N-1):
group, members = input()[:-1].split(":")
d[group] = set(members.split(","))
for i in range(N):
for group, members in d.items():
if group in first_group_menbers:
first_group_menbers.remove(group)
for m in members:
first_group_menbers.add(m)
print(len(first_group_menbers))
``` | instruction | 0 | 4,123 | 14 | 8,246 |
No | output | 1 | 4,123 | 14 | 8,247 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Peter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.
Peter updates the membership information whenever any changes occur: for instance, the following line written by him means that Carol and Alice are the members of the Design Group.
design:carol,alice.
The name preceding the colon is the group name and the names following it specify its members.
A smaller task group may be included in a larger one. So, a group name can appear as a member of another group, for instance, as follows.
development:alice,bob,design,eve.
Simply unfolding the design above gives the following membership specification, which is equivalent to the original.
development:alice,bob,carol,alice,eve.
In this case, however, alice occurs twice. After removing one of the duplicates, we have the following more concise specification.
development:alice,bob,carol,eve.
Your mission in this problem is to write a program that, given group specifications, identifies group members.
Note that Peter's specifications can include deeply nested groups. In the following, for instance, the group one contains a single member dave.
one:another.
another:yetanother.
yetanother:dave.
Input
The input is a sequence of datasets, each being in the following format.
n
group1:member1,1,...,member1,m1.
.
.
.
groupi:memberi,1,...,memberi,mi.
.
.
.
groupn:membern,1,...,membern,mn.
The first line contains n, which represents the number of groups and is a positive integer no more than 100. Each of the following n lines contains the membership information of a group: groupi (1 ≤ i ≤ n) is the name of the i-th task group and is followed by a colon (:) and then the list of its mi member s that are delimited by a comma (,) and terminated by a period (.).
Those group names are mutually different. Each mi (1 ≤ i ≤ n) is between 1 and 10, inclusive. A member is another group name if it is one of group1, group2,..., or groupn. Otherwise it is an employee name.
There are no circular (or recursive) definitions of group(s). You may assume that mi member names of a group are mutually different.
Each group or employee name is a non-empty character string of length between 1 and 15, inclusive, and consists of lowercase letters.
The end of the input is indicated by a line containing a zero.
Output
For each dataset, output the number of employees included in the first group of the dataset, that is group1, in a line. No extra characters should occur in the output.
Example
Input
2
development:alice,bob,design,eve.
design:carol,alice.
3
one:another.
another:yetanother.
yetanother:dave.
3
friends:alice,bob,bestfriends,carol,fran,badcompany.
bestfriends:eve,alice.
badcompany:dave,carol.
5
a:b,c,d,e.
b:c,d,e,f.
c:d,e,f,g.
d:e,f,g,h.
e:f,g,h,i.
4
aa:bb.
cc:dd,ee.
ff:gg.
bb:cc.
0
Output
4
1
6
4
2
Submitted Solution:
```
while True:
N = int(input())
if N == 0:
break
first_group_menbers = set(input()[:-1].split(":")[1].split(","))
d = {}
for i in range(N-1):
group, members = input()[:-1].split(":")
d[group] = set(members.split(","))
for i in range(N-3):
for group, members in d.items():
if group in first_group_menbers:
first_group_menbers.remove(group)
for m in members:
first_group_menbers.add(m)
print(len(first_group_menbers))
``` | instruction | 0 | 4,124 | 14 | 8,248 |
No | output | 1 | 4,124 | 14 | 8,249 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Peter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.
Peter updates the membership information whenever any changes occur: for instance, the following line written by him means that Carol and Alice are the members of the Design Group.
design:carol,alice.
The name preceding the colon is the group name and the names following it specify its members.
A smaller task group may be included in a larger one. So, a group name can appear as a member of another group, for instance, as follows.
development:alice,bob,design,eve.
Simply unfolding the design above gives the following membership specification, which is equivalent to the original.
development:alice,bob,carol,alice,eve.
In this case, however, alice occurs twice. After removing one of the duplicates, we have the following more concise specification.
development:alice,bob,carol,eve.
Your mission in this problem is to write a program that, given group specifications, identifies group members.
Note that Peter's specifications can include deeply nested groups. In the following, for instance, the group one contains a single member dave.
one:another.
another:yetanother.
yetanother:dave.
Input
The input is a sequence of datasets, each being in the following format.
n
group1:member1,1,...,member1,m1.
.
.
.
groupi:memberi,1,...,memberi,mi.
.
.
.
groupn:membern,1,...,membern,mn.
The first line contains n, which represents the number of groups and is a positive integer no more than 100. Each of the following n lines contains the membership information of a group: groupi (1 ≤ i ≤ n) is the name of the i-th task group and is followed by a colon (:) and then the list of its mi member s that are delimited by a comma (,) and terminated by a period (.).
Those group names are mutually different. Each mi (1 ≤ i ≤ n) is between 1 and 10, inclusive. A member is another group name if it is one of group1, group2,..., or groupn. Otherwise it is an employee name.
There are no circular (or recursive) definitions of group(s). You may assume that mi member names of a group are mutually different.
Each group or employee name is a non-empty character string of length between 1 and 15, inclusive, and consists of lowercase letters.
The end of the input is indicated by a line containing a zero.
Output
For each dataset, output the number of employees included in the first group of the dataset, that is group1, in a line. No extra characters should occur in the output.
Example
Input
2
development:alice,bob,design,eve.
design:carol,alice.
3
one:another.
another:yetanother.
yetanother:dave.
3
friends:alice,bob,bestfriends,carol,fran,badcompany.
bestfriends:eve,alice.
badcompany:dave,carol.
5
a:b,c,d,e.
b:c,d,e,f.
c:d,e,f,g.
d:e,f,g,h.
e:f,g,h,i.
4
aa:bb.
cc:dd,ee.
ff:gg.
bb:cc.
0
Output
4
1
6
4
2
Submitted Solution:
```
def get_group(str):
return str.split(':')[0];
def get_member(str):
return str.split(':')[1].split('.')[0].split(',');
def get_num(group, map, ans):
for person in map[group]:
if person in map:
get_num(person, map, ans);
else:
ans[person] = True;
def main():
while True:
str = input();
if len(str) == 0:
continue;
n = int(str);
if n == 0:
break;
group = {};
group.clear();
name = {};
name.clear();
for i in range(0, n):
str = input();
name[i] = get_group(str);
group[name[i]] = get_member(str);
ans = {};
ans.clear();
get_num(name[0], group, ans);
print(len(ans));
main();
``` | instruction | 0 | 4,125 | 14 | 8,250 |
No | output | 1 | 4,125 | 14 | 8,251 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Peter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.
Peter updates the membership information whenever any changes occur: for instance, the following line written by him means that Carol and Alice are the members of the Design Group.
design:carol,alice.
The name preceding the colon is the group name and the names following it specify its members.
A smaller task group may be included in a larger one. So, a group name can appear as a member of another group, for instance, as follows.
development:alice,bob,design,eve.
Simply unfolding the design above gives the following membership specification, which is equivalent to the original.
development:alice,bob,carol,alice,eve.
In this case, however, alice occurs twice. After removing one of the duplicates, we have the following more concise specification.
development:alice,bob,carol,eve.
Your mission in this problem is to write a program that, given group specifications, identifies group members.
Note that Peter's specifications can include deeply nested groups. In the following, for instance, the group one contains a single member dave.
one:another.
another:yetanother.
yetanother:dave.
Input
The input is a sequence of datasets, each being in the following format.
n
group1:member1,1,...,member1,m1.
.
.
.
groupi:memberi,1,...,memberi,mi.
.
.
.
groupn:membern,1,...,membern,mn.
The first line contains n, which represents the number of groups and is a positive integer no more than 100. Each of the following n lines contains the membership information of a group: groupi (1 ≤ i ≤ n) is the name of the i-th task group and is followed by a colon (:) and then the list of its mi member s that are delimited by a comma (,) and terminated by a period (.).
Those group names are mutually different. Each mi (1 ≤ i ≤ n) is between 1 and 10, inclusive. A member is another group name if it is one of group1, group2,..., or groupn. Otherwise it is an employee name.
There are no circular (or recursive) definitions of group(s). You may assume that mi member names of a group are mutually different.
Each group or employee name is a non-empty character string of length between 1 and 15, inclusive, and consists of lowercase letters.
The end of the input is indicated by a line containing a zero.
Output
For each dataset, output the number of employees included in the first group of the dataset, that is group1, in a line. No extra characters should occur in the output.
Example
Input
2
development:alice,bob,design,eve.
design:carol,alice.
3
one:another.
another:yetanother.
yetanother:dave.
3
friends:alice,bob,bestfriends,carol,fran,badcompany.
bestfriends:eve,alice.
badcompany:dave,carol.
5
a:b,c,d,e.
b:c,d,e,f.
c:d,e,f,g.
d:e,f,g,h.
e:f,g,h,i.
4
aa:bb.
cc:dd,ee.
ff:gg.
bb:cc.
0
Output
4
1
6
4
2
Submitted Solution:
```
def get_group(str):
return str.split(':')[0];
def get_member(str):
return str.split(':')[1].split('.')[0].split(',');
def get_num(group, map, ans):
for person in map[group]:
if person in map:
get_num(person, map, ans);
else:
ans[person] = True;
def main():
while True:
str = input();
if len(str) == 0:
continue;
n = int(str);
if not str.isdigit():
continue;
if n == 0:
break;
group = {};
group.clear();
name = {};
name.clear();
for i in range(0, n):
str = input();
name[i] = get_group(str);
group[name[i]] = get_member(str);
ans = {};
ans.clear();
get_num(name[0], group, ans);
print(len(ans));
main();
``` | instruction | 0 | 4,126 | 14 | 8,252 |
No | output | 1 | 4,126 | 14 | 8,253 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova has taken his summer practice this year and now he should write a report on how it went.
Vova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly n pages and the i-th page will include x_i tables and y_i formulas. The pages are numbered from 1 to n.
Vova fills the pages one after another, he can't go filling page i + 1 before finishing page i and he can't skip pages.
However, if he draws strictly more than k tables in a row or writes strictly more than k formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.
Note that the count doesn't reset on the start of the new page. For example, if the page ends with 3 tables and the next page starts with 5 tables, then it's counted as 8 tables in a row.
Help Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than k tables in a row and no more than k formulas in a row.
Input
The first line contains two integers n and k (1 ≤ n ≤ 3 ⋅ 10^5, 1 ≤ k ≤ 10^6).
The second line contains n integers x_1, x_2, ..., x_n (1 ≤ x_i ≤ 10^6) — the number of tables on the i-th page.
The third line contains n integers y_1, y_2, ..., y_n (1 ≤ y_i ≤ 10^6) — the number of formulas on the i-th page.
Output
Print "YES" if Vova can rearrange tables and formulas on each page in such a way that there is no more than k tables in a row and no more than k formulas in a row.
Otherwise print "NO".
Examples
Input
2 2
5 5
2 2
Output
YES
Input
2 2
5 6
2 2
Output
NO
Input
4 1
4 1 10 1
3 2 10 1
Output
YES
Note
In the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):
* page 1: "TTFTTFT"
* page 2: "TFTTFTT"
That way all blocks of tables have length 2.
In the second example there is no way to fit everything in such a way that there are no more than 2 tables in a row and 2 formulas in a row. | instruction | 0 | 4,179 | 14 | 8,358 |
Tags: dp, greedy
Correct Solution:
```
def get(px, py, x, y):
ans = 10**18
global k
if px <= k:
cnt = (px + x + k - 1) // k - 1
if y == cnt:
ans = min(ans, px + x - cnt * k)
elif y > cnt and y <= x * k:
ans = min(ans, 1)
if py <= k:
cnt = (x + k - 1) // k - 1
if y == cnt:
ans = min(ans, x - cnt * k)
elif y > cnt and y <= (x - 1) * k + (k - py):
ans = min(ans, 1)
return ans
n, k = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
dp = [[10**18] * (n + 1), [10**18] * (n + 1)]
dp[0][0], dp[1][0] = 0, 0
for i in range(n):
dp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])
dp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])
print('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')
``` | output | 1 | 4,179 | 14 | 8,359 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova has taken his summer practice this year and now he should write a report on how it went.
Vova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly n pages and the i-th page will include x_i tables and y_i formulas. The pages are numbered from 1 to n.
Vova fills the pages one after another, he can't go filling page i + 1 before finishing page i and he can't skip pages.
However, if he draws strictly more than k tables in a row or writes strictly more than k formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.
Note that the count doesn't reset on the start of the new page. For example, if the page ends with 3 tables and the next page starts with 5 tables, then it's counted as 8 tables in a row.
Help Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than k tables in a row and no more than k formulas in a row.
Input
The first line contains two integers n and k (1 ≤ n ≤ 3 ⋅ 10^5, 1 ≤ k ≤ 10^6).
The second line contains n integers x_1, x_2, ..., x_n (1 ≤ x_i ≤ 10^6) — the number of tables on the i-th page.
The third line contains n integers y_1, y_2, ..., y_n (1 ≤ y_i ≤ 10^6) — the number of formulas on the i-th page.
Output
Print "YES" if Vova can rearrange tables and formulas on each page in such a way that there is no more than k tables in a row and no more than k formulas in a row.
Otherwise print "NO".
Examples
Input
2 2
5 5
2 2
Output
YES
Input
2 2
5 6
2 2
Output
NO
Input
4 1
4 1 10 1
3 2 10 1
Output
YES
Note
In the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):
* page 1: "TTFTTFT"
* page 2: "TFTTFTT"
That way all blocks of tables have length 2.
In the second example there is no way to fit everything in such a way that there are no more than 2 tables in a row and 2 formulas in a row. | instruction | 0 | 4,180 | 14 | 8,360 |
Tags: dp, greedy
Correct Solution:
```
def max(a, b):
if a > b:
return a
return b
n, k = map(int, input().split())
o = [int(t) for t in (input()+' '+input()).split()]
f, s = 0, 0
for i in range(n):
f = max(0, o[i] + f - k * o[i+n])
s = max(0, o[i+n] + s - k * o[i])
if f > k or s > k:
print('NO')
exit(0)
print('YES')
``` | output | 1 | 4,180 | 14 | 8,361 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova has taken his summer practice this year and now he should write a report on how it went.
Vova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly n pages and the i-th page will include x_i tables and y_i formulas. The pages are numbered from 1 to n.
Vova fills the pages one after another, he can't go filling page i + 1 before finishing page i and he can't skip pages.
However, if he draws strictly more than k tables in a row or writes strictly more than k formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.
Note that the count doesn't reset on the start of the new page. For example, if the page ends with 3 tables and the next page starts with 5 tables, then it's counted as 8 tables in a row.
Help Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than k tables in a row and no more than k formulas in a row.
Input
The first line contains two integers n and k (1 ≤ n ≤ 3 ⋅ 10^5, 1 ≤ k ≤ 10^6).
The second line contains n integers x_1, x_2, ..., x_n (1 ≤ x_i ≤ 10^6) — the number of tables on the i-th page.
The third line contains n integers y_1, y_2, ..., y_n (1 ≤ y_i ≤ 10^6) — the number of formulas on the i-th page.
Output
Print "YES" if Vova can rearrange tables and formulas on each page in such a way that there is no more than k tables in a row and no more than k formulas in a row.
Otherwise print "NO".
Examples
Input
2 2
5 5
2 2
Output
YES
Input
2 2
5 6
2 2
Output
NO
Input
4 1
4 1 10 1
3 2 10 1
Output
YES
Note
In the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):
* page 1: "TTFTTFT"
* page 2: "TFTTFTT"
That way all blocks of tables have length 2.
In the second example there is no way to fit everything in such a way that there are no more than 2 tables in a row and 2 formulas in a row. | instruction | 0 | 4,181 | 14 | 8,362 |
Tags: dp, greedy
Correct Solution:
```
n, k = map(int, input().split())
o = [int(t) for t in (input()+' '+input()).split()]
f, s = 0, 0
for i in range(n):
f = max(0, o[i] + f - k * o[i+n])
s = max(0, o[i+n] + s - k * o[i])
if f > k or s > k:
print('NO')
exit(0)
print('YES')
``` | output | 1 | 4,181 | 14 | 8,363 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova has taken his summer practice this year and now he should write a report on how it went.
Vova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly n pages and the i-th page will include x_i tables and y_i formulas. The pages are numbered from 1 to n.
Vova fills the pages one after another, he can't go filling page i + 1 before finishing page i and he can't skip pages.
However, if he draws strictly more than k tables in a row or writes strictly more than k formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.
Note that the count doesn't reset on the start of the new page. For example, if the page ends with 3 tables and the next page starts with 5 tables, then it's counted as 8 tables in a row.
Help Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than k tables in a row and no more than k formulas in a row.
Input
The first line contains two integers n and k (1 ≤ n ≤ 3 ⋅ 10^5, 1 ≤ k ≤ 10^6).
The second line contains n integers x_1, x_2, ..., x_n (1 ≤ x_i ≤ 10^6) — the number of tables on the i-th page.
The third line contains n integers y_1, y_2, ..., y_n (1 ≤ y_i ≤ 10^6) — the number of formulas on the i-th page.
Output
Print "YES" if Vova can rearrange tables and formulas on each page in such a way that there is no more than k tables in a row and no more than k formulas in a row.
Otherwise print "NO".
Examples
Input
2 2
5 5
2 2
Output
YES
Input
2 2
5 6
2 2
Output
NO
Input
4 1
4 1 10 1
3 2 10 1
Output
YES
Note
In the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):
* page 1: "TTFTTFT"
* page 2: "TFTTFTT"
That way all blocks of tables have length 2.
In the second example there is no way to fit everything in such a way that there are no more than 2 tables in a row and 2 formulas in a row. | instruction | 0 | 4,182 | 14 | 8,364 |
Tags: dp, greedy
Correct Solution:
```
def max(a, b):
if a > b:
return a
else:
return b
n, k = map(int, input().split())
x = [int(t) for t in input().split()]
y = [int(t) for t in input().split()]
f, s = 0, 0
for i in range(n):
f = max(0, x[i] + f - k * y[i])
s = max(0, y[i] + s - k * x[i])
if f > k or s > k:
print('NO')
exit(0)
print('YES')
``` | output | 1 | 4,182 | 14 | 8,365 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sayaka Saeki is a member of the student council, which has n other members (excluding Sayaka). The i-th member has a height of a_i millimeters.
It's the end of the school year and Sayaka wants to take a picture of all other members of the student council. Being the hard-working and perfectionist girl as she is, she wants to arrange all the members in a line such that the amount of photogenic consecutive pairs of members is as large as possible.
A pair of two consecutive members u and v on a line is considered photogenic if their average height is an integer, i.e. (a_u + a_v)/(2) is an integer.
Help Sayaka arrange the other members to maximize the number of photogenic consecutive pairs.
Input
The first line contains a single integer t (1≤ t≤ 500) — the number of test cases.
The first line of each test case contains a single integer n (2 ≤ n ≤ 2000) — the number of other council members.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2 ⋅ 10^5) — the heights of each of the other members in millimeters.
It is guaranteed that the sum of n over all test cases does not exceed 2000.
Output
For each test case, output on one line n integers representing the heights of the other members in the order, which gives the largest number of photogenic consecutive pairs. If there are multiple such orders, output any of them.
Example
Input
4
3
1 1 2
3
1 1 1
8
10 9 13 15 3 16 9 13
2
18 9
Output
1 1 2
1 1 1
13 9 13 15 3 9 16 10
9 18
Note
In the first test case, there is one photogenic pair: (1, 1) is photogenic, as (1+1)/(2)=1 is integer, while (1, 2) isn't, as (1+2)/(2)=1.5 isn't integer.
In the second test case, both pairs are photogenic. | instruction | 0 | 4,420 | 14 | 8,840 |
Tags: constructive algorithms
Correct Solution:
```
for _ in range(int(input())):
n=int(input())
l=list(map(int,input().split()))
a=[]
for i in range(n):
if(l[i]%2!=0):
a.append(l[i])
for i in range(n):
if (l[i] % 2 == 0):
a.append(l[i])
print(*a ,end=" ")
``` | output | 1 | 4,420 | 14 | 8,841 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sayaka Saeki is a member of the student council, which has n other members (excluding Sayaka). The i-th member has a height of a_i millimeters.
It's the end of the school year and Sayaka wants to take a picture of all other members of the student council. Being the hard-working and perfectionist girl as she is, she wants to arrange all the members in a line such that the amount of photogenic consecutive pairs of members is as large as possible.
A pair of two consecutive members u and v on a line is considered photogenic if their average height is an integer, i.e. (a_u + a_v)/(2) is an integer.
Help Sayaka arrange the other members to maximize the number of photogenic consecutive pairs.
Input
The first line contains a single integer t (1≤ t≤ 500) — the number of test cases.
The first line of each test case contains a single integer n (2 ≤ n ≤ 2000) — the number of other council members.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2 ⋅ 10^5) — the heights of each of the other members in millimeters.
It is guaranteed that the sum of n over all test cases does not exceed 2000.
Output
For each test case, output on one line n integers representing the heights of the other members in the order, which gives the largest number of photogenic consecutive pairs. If there are multiple such orders, output any of them.
Example
Input
4
3
1 1 2
3
1 1 1
8
10 9 13 15 3 16 9 13
2
18 9
Output
1 1 2
1 1 1
13 9 13 15 3 9 16 10
9 18
Note
In the first test case, there is one photogenic pair: (1, 1) is photogenic, as (1+1)/(2)=1 is integer, while (1, 2) isn't, as (1+2)/(2)=1.5 isn't integer.
In the second test case, both pairs are photogenic. | instruction | 0 | 4,421 | 14 | 8,842 |
Tags: constructive algorithms
Correct Solution:
```
import sys
input = sys.stdin.buffer.readline
t = int(input())
for _ in range(t):
n = input()
O = []
E = []
A = map(int, input().split())
for a in A:
if a % 2 == 0:
E.append(a)
else:
O.append(a)
ans = O + E
print(*ans)
``` | output | 1 | 4,421 | 14 | 8,843 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sayaka Saeki is a member of the student council, which has n other members (excluding Sayaka). The i-th member has a height of a_i millimeters.
It's the end of the school year and Sayaka wants to take a picture of all other members of the student council. Being the hard-working and perfectionist girl as she is, she wants to arrange all the members in a line such that the amount of photogenic consecutive pairs of members is as large as possible.
A pair of two consecutive members u and v on a line is considered photogenic if their average height is an integer, i.e. (a_u + a_v)/(2) is an integer.
Help Sayaka arrange the other members to maximize the number of photogenic consecutive pairs.
Input
The first line contains a single integer t (1≤ t≤ 500) — the number of test cases.
The first line of each test case contains a single integer n (2 ≤ n ≤ 2000) — the number of other council members.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2 ⋅ 10^5) — the heights of each of the other members in millimeters.
It is guaranteed that the sum of n over all test cases does not exceed 2000.
Output
For each test case, output on one line n integers representing the heights of the other members in the order, which gives the largest number of photogenic consecutive pairs. If there are multiple such orders, output any of them.
Example
Input
4
3
1 1 2
3
1 1 1
8
10 9 13 15 3 16 9 13
2
18 9
Output
1 1 2
1 1 1
13 9 13 15 3 9 16 10
9 18
Note
In the first test case, there is one photogenic pair: (1, 1) is photogenic, as (1+1)/(2)=1 is integer, while (1, 2) isn't, as (1+2)/(2)=1.5 isn't integer.
In the second test case, both pairs are photogenic. | instruction | 0 | 4,422 | 14 | 8,844 |
Tags: constructive algorithms
Correct Solution:
```
for i in range(int(input())):
n=int(input())
l=list(map(int,input().split()))
odd=[str(i) for i in l if i%2!=0]
even =[str(i) for i in l if i%2==0]
x=odd+even
print(" ".join(x))
``` | output | 1 | 4,422 | 14 | 8,845 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sayaka Saeki is a member of the student council, which has n other members (excluding Sayaka). The i-th member has a height of a_i millimeters.
It's the end of the school year and Sayaka wants to take a picture of all other members of the student council. Being the hard-working and perfectionist girl as she is, she wants to arrange all the members in a line such that the amount of photogenic consecutive pairs of members is as large as possible.
A pair of two consecutive members u and v on a line is considered photogenic if their average height is an integer, i.e. (a_u + a_v)/(2) is an integer.
Help Sayaka arrange the other members to maximize the number of photogenic consecutive pairs.
Input
The first line contains a single integer t (1≤ t≤ 500) — the number of test cases.
The first line of each test case contains a single integer n (2 ≤ n ≤ 2000) — the number of other council members.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2 ⋅ 10^5) — the heights of each of the other members in millimeters.
It is guaranteed that the sum of n over all test cases does not exceed 2000.
Output
For each test case, output on one line n integers representing the heights of the other members in the order, which gives the largest number of photogenic consecutive pairs. If there are multiple such orders, output any of them.
Example
Input
4
3
1 1 2
3
1 1 1
8
10 9 13 15 3 16 9 13
2
18 9
Output
1 1 2
1 1 1
13 9 13 15 3 9 16 10
9 18
Note
In the first test case, there is one photogenic pair: (1, 1) is photogenic, as (1+1)/(2)=1 is integer, while (1, 2) isn't, as (1+2)/(2)=1.5 isn't integer.
In the second test case, both pairs are photogenic. | instruction | 0 | 4,423 | 14 | 8,846 |
Tags: constructive algorithms
Correct Solution:
```
T = int(input())
for t in range(T):
N = int(input())
arr = list(map(int, input().split()))
ans = []
for i in arr:
if i%2:
ans.append(i)
for i in arr:
if i%2 == 0:
ans.append(i)
print(" ".join(list(map(str,ans))))
``` | output | 1 | 4,423 | 14 | 8,847 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sayaka Saeki is a member of the student council, which has n other members (excluding Sayaka). The i-th member has a height of a_i millimeters.
It's the end of the school year and Sayaka wants to take a picture of all other members of the student council. Being the hard-working and perfectionist girl as she is, she wants to arrange all the members in a line such that the amount of photogenic consecutive pairs of members is as large as possible.
A pair of two consecutive members u and v on a line is considered photogenic if their average height is an integer, i.e. (a_u + a_v)/(2) is an integer.
Help Sayaka arrange the other members to maximize the number of photogenic consecutive pairs.
Input
The first line contains a single integer t (1≤ t≤ 500) — the number of test cases.
The first line of each test case contains a single integer n (2 ≤ n ≤ 2000) — the number of other council members.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2 ⋅ 10^5) — the heights of each of the other members in millimeters.
It is guaranteed that the sum of n over all test cases does not exceed 2000.
Output
For each test case, output on one line n integers representing the heights of the other members in the order, which gives the largest number of photogenic consecutive pairs. If there are multiple such orders, output any of them.
Example
Input
4
3
1 1 2
3
1 1 1
8
10 9 13 15 3 16 9 13
2
18 9
Output
1 1 2
1 1 1
13 9 13 15 3 9 16 10
9 18
Note
In the first test case, there is one photogenic pair: (1, 1) is photogenic, as (1+1)/(2)=1 is integer, while (1, 2) isn't, as (1+2)/(2)=1.5 isn't integer.
In the second test case, both pairs are photogenic. | instruction | 0 | 4,424 | 14 | 8,848 |
Tags: constructive algorithms
Correct Solution:
```
n=int(input())
for i in range(n):
a=int(input())
l=list(map(int,input().split()))
e=[]
o=[]
for i in range(len(l)):
if(l[i]%2==0):
e.append(l[i])
else:
o.append(l[i])
print(*(o+e))
``` | output | 1 | 4,424 | 14 | 8,849 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sayaka Saeki is a member of the student council, which has n other members (excluding Sayaka). The i-th member has a height of a_i millimeters.
It's the end of the school year and Sayaka wants to take a picture of all other members of the student council. Being the hard-working and perfectionist girl as she is, she wants to arrange all the members in a line such that the amount of photogenic consecutive pairs of members is as large as possible.
A pair of two consecutive members u and v on a line is considered photogenic if their average height is an integer, i.e. (a_u + a_v)/(2) is an integer.
Help Sayaka arrange the other members to maximize the number of photogenic consecutive pairs.
Input
The first line contains a single integer t (1≤ t≤ 500) — the number of test cases.
The first line of each test case contains a single integer n (2 ≤ n ≤ 2000) — the number of other council members.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2 ⋅ 10^5) — the heights of each of the other members in millimeters.
It is guaranteed that the sum of n over all test cases does not exceed 2000.
Output
For each test case, output on one line n integers representing the heights of the other members in the order, which gives the largest number of photogenic consecutive pairs. If there are multiple such orders, output any of them.
Example
Input
4
3
1 1 2
3
1 1 1
8
10 9 13 15 3 16 9 13
2
18 9
Output
1 1 2
1 1 1
13 9 13 15 3 9 16 10
9 18
Note
In the first test case, there is one photogenic pair: (1, 1) is photogenic, as (1+1)/(2)=1 is integer, while (1, 2) isn't, as (1+2)/(2)=1.5 isn't integer.
In the second test case, both pairs are photogenic. | instruction | 0 | 4,425 | 14 | 8,850 |
Tags: constructive algorithms
Correct Solution:
```
n = int(input())
while n:
input()
nums = []
for i in map(int, input().split(' ')):
if i % 2:
nums += [i]
else:
nums = [i] + nums
print(' '.join(map(str, nums)))
n -= 1
``` | output | 1 | 4,425 | 14 | 8,851 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sayaka Saeki is a member of the student council, which has n other members (excluding Sayaka). The i-th member has a height of a_i millimeters.
It's the end of the school year and Sayaka wants to take a picture of all other members of the student council. Being the hard-working and perfectionist girl as she is, she wants to arrange all the members in a line such that the amount of photogenic consecutive pairs of members is as large as possible.
A pair of two consecutive members u and v on a line is considered photogenic if their average height is an integer, i.e. (a_u + a_v)/(2) is an integer.
Help Sayaka arrange the other members to maximize the number of photogenic consecutive pairs.
Input
The first line contains a single integer t (1≤ t≤ 500) — the number of test cases.
The first line of each test case contains a single integer n (2 ≤ n ≤ 2000) — the number of other council members.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2 ⋅ 10^5) — the heights of each of the other members in millimeters.
It is guaranteed that the sum of n over all test cases does not exceed 2000.
Output
For each test case, output on one line n integers representing the heights of the other members in the order, which gives the largest number of photogenic consecutive pairs. If there are multiple such orders, output any of them.
Example
Input
4
3
1 1 2
3
1 1 1
8
10 9 13 15 3 16 9 13
2
18 9
Output
1 1 2
1 1 1
13 9 13 15 3 9 16 10
9 18
Note
In the first test case, there is one photogenic pair: (1, 1) is photogenic, as (1+1)/(2)=1 is integer, while (1, 2) isn't, as (1+2)/(2)=1.5 isn't integer.
In the second test case, both pairs are photogenic. | instruction | 0 | 4,426 | 14 | 8,852 |
Tags: constructive algorithms
Correct Solution:
```
# Programmers_Hive
import os
import sys
from io import BytesIO, IOBase
def main():
# main code
t=int(input())
for x in range(t):
n=int(input())
l=list(map(int,input().split()))
even=[]
odd=[]
for i in l:
if i%2==0:
even+=[i]
else:
odd+=[i]
even.sort()
odd.sort()
for i in range(len(odd)-1,-1,-1):
print(odd[i],end=" ")
for i in range(len(even)-1,-1,-1):
print(even[i],end=" ")
print()
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
if __name__ == "__main__":
main()
``` | output | 1 | 4,426 | 14 | 8,853 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sayaka Saeki is a member of the student council, which has n other members (excluding Sayaka). The i-th member has a height of a_i millimeters.
It's the end of the school year and Sayaka wants to take a picture of all other members of the student council. Being the hard-working and perfectionist girl as she is, she wants to arrange all the members in a line such that the amount of photogenic consecutive pairs of members is as large as possible.
A pair of two consecutive members u and v on a line is considered photogenic if their average height is an integer, i.e. (a_u + a_v)/(2) is an integer.
Help Sayaka arrange the other members to maximize the number of photogenic consecutive pairs.
Input
The first line contains a single integer t (1≤ t≤ 500) — the number of test cases.
The first line of each test case contains a single integer n (2 ≤ n ≤ 2000) — the number of other council members.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2 ⋅ 10^5) — the heights of each of the other members in millimeters.
It is guaranteed that the sum of n over all test cases does not exceed 2000.
Output
For each test case, output on one line n integers representing the heights of the other members in the order, which gives the largest number of photogenic consecutive pairs. If there are multiple such orders, output any of them.
Example
Input
4
3
1 1 2
3
1 1 1
8
10 9 13 15 3 16 9 13
2
18 9
Output
1 1 2
1 1 1
13 9 13 15 3 9 16 10
9 18
Note
In the first test case, there is one photogenic pair: (1, 1) is photogenic, as (1+1)/(2)=1 is integer, while (1, 2) isn't, as (1+2)/(2)=1.5 isn't integer.
In the second test case, both pairs are photogenic. | instruction | 0 | 4,427 | 14 | 8,854 |
Tags: constructive algorithms
Correct Solution:
```
t = int(input())
while t:
n = int(input())
s = input().strip().split()
s = [int(s[i]) for i in range(len(s))]
odd = [s[i] for i in range(len(s)) if s[i] & 1 == 1 ]
even = [s[i] for i in range(len(s)) if s[i] & 1 == 0]
odd.sort(reverse = True)
even.sort()
for i in range(len(odd)):
print(odd[i], end = " ")
for i in range(len(even)):
print(even[i], end = " ")
print()
t = t - 1
``` | output | 1 | 4,427 | 14 | 8,855 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sayaka Saeki is a member of the student council, which has n other members (excluding Sayaka). The i-th member has a height of a_i millimeters.
It's the end of the school year and Sayaka wants to take a picture of all other members of the student council. Being the hard-working and perfectionist girl as she is, she wants to arrange all the members in a line such that the amount of photogenic consecutive pairs of members is as large as possible.
A pair of two consecutive members u and v on a line is considered photogenic if their average height is an integer, i.e. (a_u + a_v)/(2) is an integer.
Help Sayaka arrange the other members to maximize the number of photogenic consecutive pairs.
Input
The first line contains a single integer t (1≤ t≤ 500) — the number of test cases.
The first line of each test case contains a single integer n (2 ≤ n ≤ 2000) — the number of other council members.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2 ⋅ 10^5) — the heights of each of the other members in millimeters.
It is guaranteed that the sum of n over all test cases does not exceed 2000.
Output
For each test case, output on one line n integers representing the heights of the other members in the order, which gives the largest number of photogenic consecutive pairs. If there are multiple such orders, output any of them.
Example
Input
4
3
1 1 2
3
1 1 1
8
10 9 13 15 3 16 9 13
2
18 9
Output
1 1 2
1 1 1
13 9 13 15 3 9 16 10
9 18
Note
In the first test case, there is one photogenic pair: (1, 1) is photogenic, as (1+1)/(2)=1 is integer, while (1, 2) isn't, as (1+2)/(2)=1.5 isn't integer.
In the second test case, both pairs are photogenic.
Submitted Solution:
```
t = int(input())
for _ in range(t):
n = int(input())
arr = [int(j) for j in input().split()]
ans = []
for x in arr:
if x%2 == 0:
ans += [x]
for x in arr:
if x%2 == 1:
ans += [x]
print(*ans)
``` | instruction | 0 | 4,428 | 14 | 8,856 |
Yes | output | 1 | 4,428 | 14 | 8,857 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sayaka Saeki is a member of the student council, which has n other members (excluding Sayaka). The i-th member has a height of a_i millimeters.
It's the end of the school year and Sayaka wants to take a picture of all other members of the student council. Being the hard-working and perfectionist girl as she is, she wants to arrange all the members in a line such that the amount of photogenic consecutive pairs of members is as large as possible.
A pair of two consecutive members u and v on a line is considered photogenic if their average height is an integer, i.e. (a_u + a_v)/(2) is an integer.
Help Sayaka arrange the other members to maximize the number of photogenic consecutive pairs.
Input
The first line contains a single integer t (1≤ t≤ 500) — the number of test cases.
The first line of each test case contains a single integer n (2 ≤ n ≤ 2000) — the number of other council members.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2 ⋅ 10^5) — the heights of each of the other members in millimeters.
It is guaranteed that the sum of n over all test cases does not exceed 2000.
Output
For each test case, output on one line n integers representing the heights of the other members in the order, which gives the largest number of photogenic consecutive pairs. If there are multiple such orders, output any of them.
Example
Input
4
3
1 1 2
3
1 1 1
8
10 9 13 15 3 16 9 13
2
18 9
Output
1 1 2
1 1 1
13 9 13 15 3 9 16 10
9 18
Note
In the first test case, there is one photogenic pair: (1, 1) is photogenic, as (1+1)/(2)=1 is integer, while (1, 2) isn't, as (1+2)/(2)=1.5 isn't integer.
In the second test case, both pairs are photogenic.
Submitted Solution:
```
def AvgHeight(n,l):
a = [0 for i in range(n)]
j = 0
x = n-1
for i in range(n):
if j>x:
break
elif(l[i]%2!=0):
a[j] = l[i]
j += 1
else:
a[x] = l[i]
x -= 1
for i in range(n):
print(a[i],end=" ")
t = int(input())
for _ in range(t):
n = int(input())
l = list(map(int,input().split()))
AvgHeight(n,l)
``` | instruction | 0 | 4,429 | 14 | 8,858 |
Yes | output | 1 | 4,429 | 14 | 8,859 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sayaka Saeki is a member of the student council, which has n other members (excluding Sayaka). The i-th member has a height of a_i millimeters.
It's the end of the school year and Sayaka wants to take a picture of all other members of the student council. Being the hard-working and perfectionist girl as she is, she wants to arrange all the members in a line such that the amount of photogenic consecutive pairs of members is as large as possible.
A pair of two consecutive members u and v on a line is considered photogenic if their average height is an integer, i.e. (a_u + a_v)/(2) is an integer.
Help Sayaka arrange the other members to maximize the number of photogenic consecutive pairs.
Input
The first line contains a single integer t (1≤ t≤ 500) — the number of test cases.
The first line of each test case contains a single integer n (2 ≤ n ≤ 2000) — the number of other council members.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2 ⋅ 10^5) — the heights of each of the other members in millimeters.
It is guaranteed that the sum of n over all test cases does not exceed 2000.
Output
For each test case, output on one line n integers representing the heights of the other members in the order, which gives the largest number of photogenic consecutive pairs. If there are multiple such orders, output any of them.
Example
Input
4
3
1 1 2
3
1 1 1
8
10 9 13 15 3 16 9 13
2
18 9
Output
1 1 2
1 1 1
13 9 13 15 3 9 16 10
9 18
Note
In the first test case, there is one photogenic pair: (1, 1) is photogenic, as (1+1)/(2)=1 is integer, while (1, 2) isn't, as (1+2)/(2)=1.5 isn't integer.
In the second test case, both pairs are photogenic.
Submitted Solution:
```
for _ in range(int(input())):
a=int(input())
l=list(map(int,input().split()))
l1,l2=[],[]
for i in l:
if i%2==1:
l1.append(i)
else:
l2.append(i)
print(*(l1+l2))
``` | instruction | 0 | 4,430 | 14 | 8,860 |
Yes | output | 1 | 4,430 | 14 | 8,861 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sayaka Saeki is a member of the student council, which has n other members (excluding Sayaka). The i-th member has a height of a_i millimeters.
It's the end of the school year and Sayaka wants to take a picture of all other members of the student council. Being the hard-working and perfectionist girl as she is, she wants to arrange all the members in a line such that the amount of photogenic consecutive pairs of members is as large as possible.
A pair of two consecutive members u and v on a line is considered photogenic if their average height is an integer, i.e. (a_u + a_v)/(2) is an integer.
Help Sayaka arrange the other members to maximize the number of photogenic consecutive pairs.
Input
The first line contains a single integer t (1≤ t≤ 500) — the number of test cases.
The first line of each test case contains a single integer n (2 ≤ n ≤ 2000) — the number of other council members.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2 ⋅ 10^5) — the heights of each of the other members in millimeters.
It is guaranteed that the sum of n over all test cases does not exceed 2000.
Output
For each test case, output on one line n integers representing the heights of the other members in the order, which gives the largest number of photogenic consecutive pairs. If there are multiple such orders, output any of them.
Example
Input
4
3
1 1 2
3
1 1 1
8
10 9 13 15 3 16 9 13
2
18 9
Output
1 1 2
1 1 1
13 9 13 15 3 9 16 10
9 18
Note
In the first test case, there is one photogenic pair: (1, 1) is photogenic, as (1+1)/(2)=1 is integer, while (1, 2) isn't, as (1+2)/(2)=1.5 isn't integer.
In the second test case, both pairs are photogenic.
Submitted Solution:
```
import sys,math,bisect
inf = float('inf')
input = sys.stdin.readline
mod = (10**9)+7
def lcm(a,b):
return int((a/math.gcd(a,b))*b)
def gcd(a,b):
return int(math.gcd(a,b))
def binarySearch(a,x):
i = bisect.bisect_left(a,x)
if i!=len(a) and a[i]==x:
return i
else:
return -1
def lowerBound(a, x):
i = bisect.bisect_left(a, x)
if i:
return (i-1)
else:
return -1
def upperBound(a,x):
i = bisect.bisect_right(a,x)
if i!= len(a)+1 and a[i-1]==x:
return (i-1)
else:
return -1
def freq(a,x):
z = upperBound(a,x) - lowerBound(a,x)
if z<=0:
return 0
return z
"""
n = int(input())
n,k = map(int,input().split())
arr = list(map(int,input().split()))
"""
for _ in range(int(input())):
n = int(input())
arr = list(map(int,input().split()))
even = []
odd = []
ans = []
for i in arr:
if i%2==0:
even.append(i)
else:
odd.append(i)
for i in even:
ans.append(i)
for i in odd:
ans.append(i)
print(*ans)
``` | instruction | 0 | 4,431 | 14 | 8,862 |
Yes | output | 1 | 4,431 | 14 | 8,863 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sayaka Saeki is a member of the student council, which has n other members (excluding Sayaka). The i-th member has a height of a_i millimeters.
It's the end of the school year and Sayaka wants to take a picture of all other members of the student council. Being the hard-working and perfectionist girl as she is, she wants to arrange all the members in a line such that the amount of photogenic consecutive pairs of members is as large as possible.
A pair of two consecutive members u and v on a line is considered photogenic if their average height is an integer, i.e. (a_u + a_v)/(2) is an integer.
Help Sayaka arrange the other members to maximize the number of photogenic consecutive pairs.
Input
The first line contains a single integer t (1≤ t≤ 500) — the number of test cases.
The first line of each test case contains a single integer n (2 ≤ n ≤ 2000) — the number of other council members.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2 ⋅ 10^5) — the heights of each of the other members in millimeters.
It is guaranteed that the sum of n over all test cases does not exceed 2000.
Output
For each test case, output on one line n integers representing the heights of the other members in the order, which gives the largest number of photogenic consecutive pairs. If there are multiple such orders, output any of them.
Example
Input
4
3
1 1 2
3
1 1 1
8
10 9 13 15 3 16 9 13
2
18 9
Output
1 1 2
1 1 1
13 9 13 15 3 9 16 10
9 18
Note
In the first test case, there is one photogenic pair: (1, 1) is photogenic, as (1+1)/(2)=1 is integer, while (1, 2) isn't, as (1+2)/(2)=1.5 isn't integer.
In the second test case, both pairs are photogenic.
Submitted Solution:
```
for T in range(int(input())):
# one number
n = int(input())
# SPACED items "1 2 3" or dataset "1 2 3 4 5 ..." NEED TO BE SPLIT
d = [int(p) for p in input().split()]
evens = []
odds = []
for i in d:
if i % 2 == 0:
evens.append(i)
else:
odds.append(i)
evens.extend(odds)
print (evens)
``` | instruction | 0 | 4,432 | 14 | 8,864 |
No | output | 1 | 4,432 | 14 | 8,865 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sayaka Saeki is a member of the student council, which has n other members (excluding Sayaka). The i-th member has a height of a_i millimeters.
It's the end of the school year and Sayaka wants to take a picture of all other members of the student council. Being the hard-working and perfectionist girl as she is, she wants to arrange all the members in a line such that the amount of photogenic consecutive pairs of members is as large as possible.
A pair of two consecutive members u and v on a line is considered photogenic if their average height is an integer, i.e. (a_u + a_v)/(2) is an integer.
Help Sayaka arrange the other members to maximize the number of photogenic consecutive pairs.
Input
The first line contains a single integer t (1≤ t≤ 500) — the number of test cases.
The first line of each test case contains a single integer n (2 ≤ n ≤ 2000) — the number of other council members.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2 ⋅ 10^5) — the heights of each of the other members in millimeters.
It is guaranteed that the sum of n over all test cases does not exceed 2000.
Output
For each test case, output on one line n integers representing the heights of the other members in the order, which gives the largest number of photogenic consecutive pairs. If there are multiple such orders, output any of them.
Example
Input
4
3
1 1 2
3
1 1 1
8
10 9 13 15 3 16 9 13
2
18 9
Output
1 1 2
1 1 1
13 9 13 15 3 9 16 10
9 18
Note
In the first test case, there is one photogenic pair: (1, 1) is photogenic, as (1+1)/(2)=1 is integer, while (1, 2) isn't, as (1+2)/(2)=1.5 isn't integer.
In the second test case, both pairs are photogenic.
Submitted Solution:
```
for i in range(int(input())):
n=int(input())
h=list(map(int,input().split()))
e=[]
o=[]
for i in h:
if i%2==0:
e.append(i)
else:
o.append(i)
print(e+o)
``` | instruction | 0 | 4,433 | 14 | 8,866 |
No | output | 1 | 4,433 | 14 | 8,867 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sayaka Saeki is a member of the student council, which has n other members (excluding Sayaka). The i-th member has a height of a_i millimeters.
It's the end of the school year and Sayaka wants to take a picture of all other members of the student council. Being the hard-working and perfectionist girl as she is, she wants to arrange all the members in a line such that the amount of photogenic consecutive pairs of members is as large as possible.
A pair of two consecutive members u and v on a line is considered photogenic if their average height is an integer, i.e. (a_u + a_v)/(2) is an integer.
Help Sayaka arrange the other members to maximize the number of photogenic consecutive pairs.
Input
The first line contains a single integer t (1≤ t≤ 500) — the number of test cases.
The first line of each test case contains a single integer n (2 ≤ n ≤ 2000) — the number of other council members.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2 ⋅ 10^5) — the heights of each of the other members in millimeters.
It is guaranteed that the sum of n over all test cases does not exceed 2000.
Output
For each test case, output on one line n integers representing the heights of the other members in the order, which gives the largest number of photogenic consecutive pairs. If there are multiple such orders, output any of them.
Example
Input
4
3
1 1 2
3
1 1 1
8
10 9 13 15 3 16 9 13
2
18 9
Output
1 1 2
1 1 1
13 9 13 15 3 9 16 10
9 18
Note
In the first test case, there is one photogenic pair: (1, 1) is photogenic, as (1+1)/(2)=1 is integer, while (1, 2) isn't, as (1+2)/(2)=1.5 isn't integer.
In the second test case, both pairs are photogenic.
Submitted Solution:
```
t=int(input())
for _ in range(t):
n=int(input())
l=list(map(int,input().split()))
odd=[]
for i in range(0,len(l)-1):
if l[i]%2==0:
print(l[i],end=' ')
else:
odd.append(l[i])
for i in range(0,len(odd)-1):
print(odd[i],end=' ')
print()
``` | instruction | 0 | 4,434 | 14 | 8,868 |
No | output | 1 | 4,434 | 14 | 8,869 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sayaka Saeki is a member of the student council, which has n other members (excluding Sayaka). The i-th member has a height of a_i millimeters.
It's the end of the school year and Sayaka wants to take a picture of all other members of the student council. Being the hard-working and perfectionist girl as she is, she wants to arrange all the members in a line such that the amount of photogenic consecutive pairs of members is as large as possible.
A pair of two consecutive members u and v on a line is considered photogenic if their average height is an integer, i.e. (a_u + a_v)/(2) is an integer.
Help Sayaka arrange the other members to maximize the number of photogenic consecutive pairs.
Input
The first line contains a single integer t (1≤ t≤ 500) — the number of test cases.
The first line of each test case contains a single integer n (2 ≤ n ≤ 2000) — the number of other council members.
The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2 ⋅ 10^5) — the heights of each of the other members in millimeters.
It is guaranteed that the sum of n over all test cases does not exceed 2000.
Output
For each test case, output on one line n integers representing the heights of the other members in the order, which gives the largest number of photogenic consecutive pairs. If there are multiple such orders, output any of them.
Example
Input
4
3
1 1 2
3
1 1 1
8
10 9 13 15 3 16 9 13
2
18 9
Output
1 1 2
1 1 1
13 9 13 15 3 9 16 10
9 18
Note
In the first test case, there is one photogenic pair: (1, 1) is photogenic, as (1+1)/(2)=1 is integer, while (1, 2) isn't, as (1+2)/(2)=1.5 isn't integer.
In the second test case, both pairs are photogenic.
Submitted Solution:
```
from sys import stdin,stdout
def main():
for _ in range(int(stdin.readline())):
n = int(stdin.readline())
e = []
o = []
for i in list(map(int,input().split())):
if i%2 == 0:
e.append(i)
else:
o.append(i)
arr = o + e
for x in arr:
stdout.write(str(x)+' ')
stdout.write('\n')
if __name__=='__main__':
main()
``` | instruction | 0 | 4,435 | 14 | 8,870 |
No | output | 1 | 4,435 | 14 | 8,871 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Greg is a beginner bodybuilder. Today the gym coach gave him the training plan. All it had was n integers a1, a2, ..., an. These numbers mean that Greg needs to do exactly n exercises today. Besides, Greg should repeat the i-th in order exercise ai times.
Greg now only does three types of exercises: "chest" exercises, "biceps" exercises and "back" exercises. Besides, his training is cyclic, that is, the first exercise he does is a "chest" one, the second one is "biceps", the third one is "back", the fourth one is "chest", the fifth one is "biceps", and so on to the n-th exercise.
Now Greg wonders, which muscle will get the most exercise during his training. We know that the exercise Greg repeats the maximum number of times, trains the corresponding muscle the most. Help Greg, determine which muscle will get the most training.
Input
The first line contains integer n (1 ≤ n ≤ 20). The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 25) — the number of times Greg repeats the exercises.
Output
Print word "chest" (without the quotes), if the chest gets the most exercise, "biceps" (without the quotes), if the biceps gets the most exercise and print "back" (without the quotes) if the back gets the most exercise.
It is guaranteed that the input is such that the answer to the problem is unambiguous.
Examples
Input
2
2 8
Output
biceps
Input
3
5 1 10
Output
back
Input
7
3 3 2 7 9 6 8
Output
chest
Note
In the first sample Greg does 2 chest, 8 biceps and zero back exercises, so the biceps gets the most exercises.
In the second sample Greg does 5 chest, 1 biceps and 10 back exercises, so the back gets the most exercises.
In the third sample Greg does 18 chest, 12 biceps and 8 back exercises, so the chest gets the most exercise. | instruction | 0 | 4,484 | 14 | 8,968 |
Tags: implementation
Correct Solution:
```
input()
ar = list(map(int, input().split()))
cur = 0
ch, bi, ba = 0, 0, 0
for a in ar:
if cur % 3 == 0:
ch += a
elif cur % 3 == 1:
bi += a
else:
ba += a
cur += 1
if ch == max([ch, bi, ba]):
print("chest")
elif bi == max([ch, bi, ba]):
print("biceps")
else:
print("back")
``` | output | 1 | 4,484 | 14 | 8,969 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Greg is a beginner bodybuilder. Today the gym coach gave him the training plan. All it had was n integers a1, a2, ..., an. These numbers mean that Greg needs to do exactly n exercises today. Besides, Greg should repeat the i-th in order exercise ai times.
Greg now only does three types of exercises: "chest" exercises, "biceps" exercises and "back" exercises. Besides, his training is cyclic, that is, the first exercise he does is a "chest" one, the second one is "biceps", the third one is "back", the fourth one is "chest", the fifth one is "biceps", and so on to the n-th exercise.
Now Greg wonders, which muscle will get the most exercise during his training. We know that the exercise Greg repeats the maximum number of times, trains the corresponding muscle the most. Help Greg, determine which muscle will get the most training.
Input
The first line contains integer n (1 ≤ n ≤ 20). The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 25) — the number of times Greg repeats the exercises.
Output
Print word "chest" (without the quotes), if the chest gets the most exercise, "biceps" (without the quotes), if the biceps gets the most exercise and print "back" (without the quotes) if the back gets the most exercise.
It is guaranteed that the input is such that the answer to the problem is unambiguous.
Examples
Input
2
2 8
Output
biceps
Input
3
5 1 10
Output
back
Input
7
3 3 2 7 9 6 8
Output
chest
Note
In the first sample Greg does 2 chest, 8 biceps and zero back exercises, so the biceps gets the most exercises.
In the second sample Greg does 5 chest, 1 biceps and 10 back exercises, so the back gets the most exercises.
In the third sample Greg does 18 chest, 12 biceps and 8 back exercises, so the chest gets the most exercise. | instruction | 0 | 4,485 | 14 | 8,970 |
Tags: implementation
Correct Solution:
```
#n, k = map(int, input().split(" "))
#LA = [int(x) for x in input().split()]
n = int(input())
L = [int(x) for x in input().split()]
c = [0,0,0]
for i in range(n) :
c[i % 3] += L[i]
if (c[0] == max(c)) : print("chest")
if (c[1] == max(c)) : print("biceps")
if (c[2] == max(c)) : print("back")
``` | output | 1 | 4,485 | 14 | 8,971 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Greg is a beginner bodybuilder. Today the gym coach gave him the training plan. All it had was n integers a1, a2, ..., an. These numbers mean that Greg needs to do exactly n exercises today. Besides, Greg should repeat the i-th in order exercise ai times.
Greg now only does three types of exercises: "chest" exercises, "biceps" exercises and "back" exercises. Besides, his training is cyclic, that is, the first exercise he does is a "chest" one, the second one is "biceps", the third one is "back", the fourth one is "chest", the fifth one is "biceps", and so on to the n-th exercise.
Now Greg wonders, which muscle will get the most exercise during his training. We know that the exercise Greg repeats the maximum number of times, trains the corresponding muscle the most. Help Greg, determine which muscle will get the most training.
Input
The first line contains integer n (1 ≤ n ≤ 20). The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 25) — the number of times Greg repeats the exercises.
Output
Print word "chest" (without the quotes), if the chest gets the most exercise, "biceps" (without the quotes), if the biceps gets the most exercise and print "back" (without the quotes) if the back gets the most exercise.
It is guaranteed that the input is such that the answer to the problem is unambiguous.
Examples
Input
2
2 8
Output
biceps
Input
3
5 1 10
Output
back
Input
7
3 3 2 7 9 6 8
Output
chest
Note
In the first sample Greg does 2 chest, 8 biceps and zero back exercises, so the biceps gets the most exercises.
In the second sample Greg does 5 chest, 1 biceps and 10 back exercises, so the back gets the most exercises.
In the third sample Greg does 18 chest, 12 biceps and 8 back exercises, so the chest gets the most exercise. | instruction | 0 | 4,486 | 14 | 8,972 |
Tags: implementation
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
answer = {0: 'chest', 1:'biceps', 2:'back'}
repitation = [0, 0, 0]
for i in range(n):
if (i+1) % 3 == 0:
repitation[2] += a[i]
elif (i+1) % 3 == 2:
repitation[1] += a[i]
else:
repitation[0] += a[i]
maxValue = 0
index = None
for i,v in enumerate(repitation):
if v > maxValue: maxValue = v; index = i
print(answer[index])
``` | output | 1 | 4,486 | 14 | 8,973 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Greg is a beginner bodybuilder. Today the gym coach gave him the training plan. All it had was n integers a1, a2, ..., an. These numbers mean that Greg needs to do exactly n exercises today. Besides, Greg should repeat the i-th in order exercise ai times.
Greg now only does three types of exercises: "chest" exercises, "biceps" exercises and "back" exercises. Besides, his training is cyclic, that is, the first exercise he does is a "chest" one, the second one is "biceps", the third one is "back", the fourth one is "chest", the fifth one is "biceps", and so on to the n-th exercise.
Now Greg wonders, which muscle will get the most exercise during his training. We know that the exercise Greg repeats the maximum number of times, trains the corresponding muscle the most. Help Greg, determine which muscle will get the most training.
Input
The first line contains integer n (1 ≤ n ≤ 20). The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 25) — the number of times Greg repeats the exercises.
Output
Print word "chest" (without the quotes), if the chest gets the most exercise, "biceps" (without the quotes), if the biceps gets the most exercise and print "back" (without the quotes) if the back gets the most exercise.
It is guaranteed that the input is such that the answer to the problem is unambiguous.
Examples
Input
2
2 8
Output
biceps
Input
3
5 1 10
Output
back
Input
7
3 3 2 7 9 6 8
Output
chest
Note
In the first sample Greg does 2 chest, 8 biceps and zero back exercises, so the biceps gets the most exercises.
In the second sample Greg does 5 chest, 1 biceps and 10 back exercises, so the back gets the most exercises.
In the third sample Greg does 18 chest, 12 biceps and 8 back exercises, so the chest gets the most exercise. | instruction | 0 | 4,487 | 14 | 8,974 |
Tags: implementation
Correct Solution:
```
# -*- coding: utf-8 -*-
import math
import collections
import bisect
import heapq
import time
import random
import itertools
import sys
"""
created by shhuan at 2017/11/24 23:13
"""
N = int(input())
A = [int(x) for x in input().split()]
c = sum(A[::3] or [0])
b = sum(A[1::3] or [0])
p = sum(A[2::3] or[0])
m = max(c, b, p)
if m == c:
print("chest")
elif m == b:
print("biceps")
else:
print("back")
``` | output | 1 | 4,487 | 14 | 8,975 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Greg is a beginner bodybuilder. Today the gym coach gave him the training plan. All it had was n integers a1, a2, ..., an. These numbers mean that Greg needs to do exactly n exercises today. Besides, Greg should repeat the i-th in order exercise ai times.
Greg now only does three types of exercises: "chest" exercises, "biceps" exercises and "back" exercises. Besides, his training is cyclic, that is, the first exercise he does is a "chest" one, the second one is "biceps", the third one is "back", the fourth one is "chest", the fifth one is "biceps", and so on to the n-th exercise.
Now Greg wonders, which muscle will get the most exercise during his training. We know that the exercise Greg repeats the maximum number of times, trains the corresponding muscle the most. Help Greg, determine which muscle will get the most training.
Input
The first line contains integer n (1 ≤ n ≤ 20). The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 25) — the number of times Greg repeats the exercises.
Output
Print word "chest" (without the quotes), if the chest gets the most exercise, "biceps" (without the quotes), if the biceps gets the most exercise and print "back" (without the quotes) if the back gets the most exercise.
It is guaranteed that the input is such that the answer to the problem is unambiguous.
Examples
Input
2
2 8
Output
biceps
Input
3
5 1 10
Output
back
Input
7
3 3 2 7 9 6 8
Output
chest
Note
In the first sample Greg does 2 chest, 8 biceps and zero back exercises, so the biceps gets the most exercises.
In the second sample Greg does 5 chest, 1 biceps and 10 back exercises, so the back gets the most exercises.
In the third sample Greg does 18 chest, 12 biceps and 8 back exercises, so the chest gets the most exercise. | instruction | 0 | 4,488 | 14 | 8,976 |
Tags: implementation
Correct Solution:
```
def check(l):
chest = 0
biceps = 0
back = 0
for i in range(0,2):
if len(l) % 3 == 0:
break
l.append(0)
for i in range(0,len(l),3):
chest += l[i]
biceps += l[i+1]
back +=l[i+2]
if chest > biceps and chest > back:
return 'chest'
elif biceps > chest and biceps > back:
return 'biceps'
else:
return 'back'
t = int(input())
a = input().split()
for i in range(0, len(a)):
a[i] = int(a[i])
print(check(a))
``` | output | 1 | 4,488 | 14 | 8,977 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Greg is a beginner bodybuilder. Today the gym coach gave him the training plan. All it had was n integers a1, a2, ..., an. These numbers mean that Greg needs to do exactly n exercises today. Besides, Greg should repeat the i-th in order exercise ai times.
Greg now only does three types of exercises: "chest" exercises, "biceps" exercises and "back" exercises. Besides, his training is cyclic, that is, the first exercise he does is a "chest" one, the second one is "biceps", the third one is "back", the fourth one is "chest", the fifth one is "biceps", and so on to the n-th exercise.
Now Greg wonders, which muscle will get the most exercise during his training. We know that the exercise Greg repeats the maximum number of times, trains the corresponding muscle the most. Help Greg, determine which muscle will get the most training.
Input
The first line contains integer n (1 ≤ n ≤ 20). The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 25) — the number of times Greg repeats the exercises.
Output
Print word "chest" (without the quotes), if the chest gets the most exercise, "biceps" (without the quotes), if the biceps gets the most exercise and print "back" (without the quotes) if the back gets the most exercise.
It is guaranteed that the input is such that the answer to the problem is unambiguous.
Examples
Input
2
2 8
Output
biceps
Input
3
5 1 10
Output
back
Input
7
3 3 2 7 9 6 8
Output
chest
Note
In the first sample Greg does 2 chest, 8 biceps and zero back exercises, so the biceps gets the most exercises.
In the second sample Greg does 5 chest, 1 biceps and 10 back exercises, so the back gets the most exercises.
In the third sample Greg does 18 chest, 12 biceps and 8 back exercises, so the chest gets the most exercise. | instruction | 0 | 4,489 | 14 | 8,978 |
Tags: implementation
Correct Solution:
```
n=int(input())
arr=list(map(int,input().split(' ')))
ex=[0]*3
for i in range(0,len(arr)):
ex[i%3]+=arr[i]
exc=(ex.index(max(ex)))
if(exc==0):
print('chest')
elif(exc==1):
print('biceps')
elif(exc==2):
print('back')
``` | output | 1 | 4,489 | 14 | 8,979 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Greg is a beginner bodybuilder. Today the gym coach gave him the training plan. All it had was n integers a1, a2, ..., an. These numbers mean that Greg needs to do exactly n exercises today. Besides, Greg should repeat the i-th in order exercise ai times.
Greg now only does three types of exercises: "chest" exercises, "biceps" exercises and "back" exercises. Besides, his training is cyclic, that is, the first exercise he does is a "chest" one, the second one is "biceps", the third one is "back", the fourth one is "chest", the fifth one is "biceps", and so on to the n-th exercise.
Now Greg wonders, which muscle will get the most exercise during his training. We know that the exercise Greg repeats the maximum number of times, trains the corresponding muscle the most. Help Greg, determine which muscle will get the most training.
Input
The first line contains integer n (1 ≤ n ≤ 20). The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 25) — the number of times Greg repeats the exercises.
Output
Print word "chest" (without the quotes), if the chest gets the most exercise, "biceps" (without the quotes), if the biceps gets the most exercise and print "back" (without the quotes) if the back gets the most exercise.
It is guaranteed that the input is such that the answer to the problem is unambiguous.
Examples
Input
2
2 8
Output
biceps
Input
3
5 1 10
Output
back
Input
7
3 3 2 7 9 6 8
Output
chest
Note
In the first sample Greg does 2 chest, 8 biceps and zero back exercises, so the biceps gets the most exercises.
In the second sample Greg does 5 chest, 1 biceps and 10 back exercises, so the back gets the most exercises.
In the third sample Greg does 18 chest, 12 biceps and 8 back exercises, so the chest gets the most exercise. | instruction | 0 | 4,490 | 14 | 8,980 |
Tags: implementation
Correct Solution:
```
t=int(input())
a=list(map(int,input().split()))
x=y=z=0
for i in range(t):
if(i%3==0):
x+=a[i]
elif(i%3==1):
y+=a[i]
else:
z+=a[i]
d=max(x,y,z)
if(d==x):
print("chest")
elif(d==y):
print("biceps")
else:
print("back")
``` | output | 1 | 4,490 | 14 | 8,981 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Greg is a beginner bodybuilder. Today the gym coach gave him the training plan. All it had was n integers a1, a2, ..., an. These numbers mean that Greg needs to do exactly n exercises today. Besides, Greg should repeat the i-th in order exercise ai times.
Greg now only does three types of exercises: "chest" exercises, "biceps" exercises and "back" exercises. Besides, his training is cyclic, that is, the first exercise he does is a "chest" one, the second one is "biceps", the third one is "back", the fourth one is "chest", the fifth one is "biceps", and so on to the n-th exercise.
Now Greg wonders, which muscle will get the most exercise during his training. We know that the exercise Greg repeats the maximum number of times, trains the corresponding muscle the most. Help Greg, determine which muscle will get the most training.
Input
The first line contains integer n (1 ≤ n ≤ 20). The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 25) — the number of times Greg repeats the exercises.
Output
Print word "chest" (without the quotes), if the chest gets the most exercise, "biceps" (without the quotes), if the biceps gets the most exercise and print "back" (without the quotes) if the back gets the most exercise.
It is guaranteed that the input is such that the answer to the problem is unambiguous.
Examples
Input
2
2 8
Output
biceps
Input
3
5 1 10
Output
back
Input
7
3 3 2 7 9 6 8
Output
chest
Note
In the first sample Greg does 2 chest, 8 biceps and zero back exercises, so the biceps gets the most exercises.
In the second sample Greg does 5 chest, 1 biceps and 10 back exercises, so the back gets the most exercises.
In the third sample Greg does 18 chest, 12 biceps and 8 back exercises, so the chest gets the most exercise. | instruction | 0 | 4,491 | 14 | 8,982 |
Tags: implementation
Correct Solution:
```
n=input()
mas=list(map(int,input().split()))
sm=[sum(mas[::3]),sum(mas[1::3]),sum(mas[2::3])]
ans=["chest","biceps","back"]
print(ans[sm.index(max(sm))])
``` | output | 1 | 4,491 | 14 | 8,983 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To quickly hire highly skilled specialists one of the new IT City companies made an unprecedented move. Every employee was granted a car, and an employee can choose one of four different car makes.
The parking lot before the office consists of one line of (2n - 2) parking spaces. Unfortunately the total number of cars is greater than the parking lot capacity. Furthermore even amount of cars of each make is greater than the amount of parking spaces! That's why there are no free spaces on the parking lot ever.
Looking on the straight line of cars the company CEO thought that parking lot would be more beautiful if it contained exactly n successive cars of the same make. Help the CEO determine the number of ways to fill the parking lot this way.
Input
The only line of the input contains one integer n (3 ≤ n ≤ 30) — the amount of successive cars of the same make.
Output
Output one integer — the number of ways to fill the parking lot by cars of four makes using the described way.
Examples
Input
3
Output
24
Note
Let's denote car makes in the following way: A — Aston Martin, B — Bentley, M — Mercedes-Maybach, Z — Zaporozhets. For n = 3 there are the following appropriate ways to fill the parking lot: AAAB AAAM AAAZ ABBB AMMM AZZZ BBBA BBBM BBBZ BAAA BMMM BZZZ MMMA MMMB MMMZ MAAA MBBB MZZZ ZZZA ZZZB ZZZM ZAAA ZBBB ZMMM
Originally it was planned to grant sport cars of Ferrari, Lamborghini, Maserati and Bugatti makes but this idea was renounced because it is impossible to drive these cars having small road clearance on the worn-down roads of IT City. | instruction | 0 | 4,619 | 14 | 9,238 |
Tags: combinatorics, math
Correct Solution:
```
n=int(input())
print(6*(4**(n-3) * 4) + (n-3)*9*4**(n-3))
``` | output | 1 | 4,619 | 14 | 9,239 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.