message stringlengths 2 20.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 1.95k 109k | cluster float64 17 17 | __index_level_0__ int64 3.91k 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
In the speed skating badge test, grades are awarded when the time specified for two distances is exceeded. For example, to reach Class A, 500 M requires less than 40.0 seconds and 1000 M requires less than 1 minute and 23 seconds.
Create a program t... | instruction | 0 | 72,411 | 17 | 144,822 |
"Correct Solution:
```
def judge(t1, t2):
if t1 < 35.5 and t2 < 71:
print("AAA")
elif t1 < 37.5 and t2 < 77:
print("AA")
elif t1 < 40 and t2 < 83:
print("A")
elif t1 < 43 and t2 < 89:
print("B")
elif t1 < 50 and t2 < 105:
print("C")
elif t1 < 55 and t2 < 116:
print("D")
elif t1 < 7... | output | 1 | 72,411 | 17 | 144,823 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the speed skating badge test, grades are awarded when the time specified for two distances is exceeded. For example, to reach Class A, 500 M requires less than 40.0 seconds and 1000 M require... | instruction | 0 | 72,412 | 17 | 144,824 |
Yes | output | 1 | 72,412 | 17 | 144,825 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the speed skating badge test, grades are awarded when the time specified for two distances is exceeded. For example, to reach Class A, 500 M requires less than 40.0 seconds and 1000 M require... | instruction | 0 | 72,413 | 17 | 144,826 |
Yes | output | 1 | 72,413 | 17 | 144,827 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the speed skating badge test, grades are awarded when the time specified for two distances is exceeded. For example, to reach Class A, 500 M requires less than 40.0 seconds and 1000 M require... | instruction | 0 | 72,414 | 17 | 144,828 |
Yes | output | 1 | 72,414 | 17 | 144,829 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the speed skating badge test, grades are awarded when the time specified for two distances is exceeded. For example, to reach Class A, 500 M requires less than 40.0 seconds and 1000 M require... | instruction | 0 | 72,415 | 17 | 144,830 |
Yes | output | 1 | 72,415 | 17 | 144,831 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the speed skating badge test, grades are awarded when the time specified for two distances is exceeded. For example, to reach Class A, 500 M requires less than 40.0 seconds and 1000 M require... | instruction | 0 | 72,416 | 17 | 144,832 |
No | output | 1 | 72,416 | 17 | 144,833 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the speed skating badge test, grades are awarded when the time specified for two distances is exceeded. For example, to reach Class A, 500 M requires less than 40.0 seconds and 1000 M require... | instruction | 0 | 72,417 | 17 | 144,834 |
No | output | 1 | 72,417 | 17 | 144,835 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the speed skating badge test, grades are awarded when the time specified for two distances is exceeded. For example, to reach Class A, 500 M requires less than 40.0 seconds and 1000 M require... | instruction | 0 | 72,418 | 17 | 144,836 |
No | output | 1 | 72,418 | 17 | 144,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the speed skating badge test, grades are awarded when the time specified for two distances is exceeded. For example, to reach Class A, 500 M requires less than 40.0 seconds and 1000 M require... | instruction | 0 | 72,419 | 17 | 144,838 |
No | output | 1 | 72,419 | 17 | 144,839 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
BCPC stands for Byteforces Collegiate Programming Contest, and is the most famous competition in Byteforces.
BCPC is a team competition. Each team is composed by a coach and three contestants. ... | instruction | 0 | 72,912 | 17 | 145,824 |
No | output | 1 | 72,912 | 17 | 145,825 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
BCPC stands for Byteforces Collegiate Programming Contest, and is the most famous competition in Byteforces.
BCPC is a team competition. Each team is composed by a coach and three contestants. ... | instruction | 0 | 72,913 | 17 | 145,826 |
No | output | 1 | 72,913 | 17 | 145,827 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
BCPC stands for Byteforces Collegiate Programming Contest, and is the most famous competition in Byteforces.
BCPC is a team competition. Each team is composed by a coach and three contestants. ... | instruction | 0 | 72,914 | 17 | 145,828 |
No | output | 1 | 72,914 | 17 | 145,829 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
BCPC stands for Byteforces Collegiate Programming Contest, and is the most famous competition in Byteforces.
BCPC is a team competition. Each team is composed by a coach and three contestants. ... | instruction | 0 | 72,915 | 17 | 145,830 |
No | output | 1 | 72,915 | 17 | 145,831 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficult for them because chess is a game for two play... | instruction | 0 | 73,031 | 17 | 146,062 |
Tags: implementation
Correct Solution:
```
n=int(input())
op=3
for i in range(0,n):
wi=int(input())
if wi==op:
print('NO')
break
op=6-op-wi
else:
print('YES')
``` | output | 1 | 73,031 | 17 | 146,063 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficult for them because chess is a game for two play... | instruction | 0 | 73,032 | 17 | 146,064 |
Tags: implementation
Correct Solution:
```
n = int(input())
spec = 3
all = [1,2,3]
for i in range(n):
num = int(input())
if num == spec:
print("NO")
exit(0)
else:
all.remove(spec)
all.remove(num)
spec = all[0]
all = [1,2,3]
print("YES")
``` | output | 1 | 73,032 | 17 | 146,065 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficult for them because chess is a game for two play... | instruction | 0 | 73,033 | 17 | 146,066 |
Tags: implementation
Correct Solution:
```
n = int(input())
players = ['A','B','C']
state = ['A','B']
k = True
for i in range(n):
a = int(input())
if (players[a-1] in state):
for o in players:
if (o not in state):
break
ind = (state.index(players[a-1]) + 1) % 2
... | output | 1 | 73,033 | 17 | 146,067 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficult for them because chess is a game for two play... | instruction | 0 | 73,034 | 17 | 146,068 |
Tags: implementation
Correct Solution:
```
n = int(input())
a = [int(input()) for i in range(n)]
p1, p2, p3 = 1, 2, 3
for i in a:
if p1 != i and p2 != i:
print('NO')
exit(0)
elif p1 != i:
p1, p3 = p3, p1
else:
p2, p3 = p3, p2
print('YES')
``` | output | 1 | 73,034 | 17 | 146,069 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficult for them because chess is a game for two play... | instruction | 0 | 73,035 | 17 | 146,070 |
Tags: implementation
Correct Solution:
```
n=int(input())
c=[]
players=[1,1,0]
score=[0,0,0]
k=1
for i in range(n):
a=int(input())
c.append(a)
for j in range(n):
for u in range(3):
if players[u]==0 and u!=c[j]-1:
score[u]=1
if players[u]==1 and u!=c[j]-1:
score[... | output | 1 | 73,035 | 17 | 146,071 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficult for them because chess is a game for two play... | instruction | 0 | 73,036 | 17 | 146,072 |
Tags: implementation
Correct Solution:
```
class Solution(object):
def __init__(self):
self.solve()
def next(self, type=int):
temp = list(map(type, input().split()))
return temp if len(temp) > 1 else temp[0]
def solve(self):
players = [1, 2, 3]
for _ in range(self.... | output | 1 | 73,036 | 17 | 146,073 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficult for them because chess is a game for two play... | instruction | 0 | 73,037 | 17 | 146,074 |
Tags: implementation
Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): r... | output | 1 | 73,037 | 17 | 146,075 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficult for them because chess is a game for two play... | instruction | 0 | 73,038 | 17 | 146,076 |
Tags: implementation
Correct Solution:
```
n=int(input())
c=0
spec=3
for i in range(n):
a=int(input())
if a==spec:
c=1
spec=6-spec-a
if c==0:
print('YES')
else:
print('NO')
``` | output | 1 | 73,038 | 17 | 146,077 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficul... | instruction | 0 | 73,039 | 17 | 146,078 |
Yes | output | 1 | 73,039 | 17 | 146,079 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficul... | instruction | 0 | 73,040 | 17 | 146,080 |
Yes | output | 1 | 73,040 | 17 | 146,081 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficul... | instruction | 0 | 73,041 | 17 | 146,082 |
Yes | output | 1 | 73,041 | 17 | 146,083 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficul... | instruction | 0 | 73,042 | 17 | 146,084 |
Yes | output | 1 | 73,042 | 17 | 146,085 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficul... | instruction | 0 | 73,043 | 17 | 146,086 |
No | output | 1 | 73,043 | 17 | 146,087 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficul... | instruction | 0 | 73,044 | 17 | 146,088 |
No | output | 1 | 73,044 | 17 | 146,089 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficul... | instruction | 0 | 73,045 | 17 | 146,090 |
No | output | 1 | 73,045 | 17 | 146,091 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficul... | instruction | 0 | 73,046 | 17 | 146,092 |
No | output | 1 | 73,046 | 17 | 146,093 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 seats in remaining rows.
<image>
The event c... | instruction | 0 | 73,674 | 17 | 147,348 |
Tags: implementation
Correct Solution:
```
k = int(input())
s = [list('+------------------------+'),
list('|#.#.#.#.#.#.#.#.#.#.#.|D|)'),
list('|#.#.#.#.#.#.#.#.#.#.#.|.|'),
list('|#.......................|'),
list('|#.#.#.#.#.#.#.#.#.#.#.|.|)'),
list('+------------------------+')]
row = 1
c ... | output | 1 | 73,674 | 17 | 147,349 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 seats in remaining rows.
<image>
The event c... | instruction | 0 | 73,675 | 17 | 147,350 |
Tags: implementation
Correct Solution:
```
n = int(input())
s = ['+------------------------+',
'|#.#.#.#.#.#.#.#.#.#.#.|D|)',
'|#.#.#.#.#.#.#.#.#.#.#.|.|',
'|#.......................|',
'|#.#.#.#.#.#.#.#.#.#.#.|.|)',
'+------------------------+']
for i in range(22):
for j in range(5):
if n a... | output | 1 | 73,675 | 17 | 147,351 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 seats in remaining rows.
<image>
The event c... | instruction | 0 | 73,676 | 17 | 147,352 |
Tags: implementation
Correct Solution:
```
v='''+------------------------+
|#.#.#.#.#.#.#.#.#.#.#.|D|)
|#.#.#.#.#.#.#.#.#.#.#.|.|
|#.......................|
|#.#.#.#.#.#.#.#.#.#.#.|.|)
+------------------------+'''.split()
def sr(n):
"""string replace"""
w=4
a,b=n//w,n%w
vn=w*[a]
for c in range(b):
vn[c]+=1
fo... | output | 1 | 73,676 | 17 | 147,353 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 seats in remaining rows.
<image>
The event c... | instruction | 0 | 73,677 | 17 | 147,354 |
Tags: implementation
Correct Solution:
```
import sys
def main():
while 1:
try:
line = sys.stdin.readline()
solve(line)
break
except KeyboardInterrupt:
break
pas = ['#','#','#','#','#','#','#','#','#','#',
'#','#','#','#','#','#','#','#','#','... | output | 1 | 73,677 | 17 | 147,355 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 seats in remaining rows.
<image>
The event c... | instruction | 0 | 73,678 | 17 | 147,356 |
Tags: implementation
Correct Solution:
```
# 9
# +------------------------+
# |O.O.O.#.#.#.#.#.#.#.#.|D|)
# |O.O.O.#.#.#.#.#.#.#.#.|.|
# |O.......................|
# |O.O.#.#.#.#.#.#.#.#.#.|.|)
# +------------------------+
# +------------------------+
# |O.O.O.#.#.#.#.#.#.#.#.|D|)
# |O.O.O.#.#.#.#.#.#.#.#.|.|
# |O...... | output | 1 | 73,678 | 17 | 147,357 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 seats in remaining rows.
<image>
The event c... | instruction | 0 | 73,679 | 17 | 147,358 |
Tags: implementation
Correct Solution:
```
'''
Created on Oct 5, 2014
@author: Ismael
'''
def printBus(lastRow,otherRows):
s = "+------------------------+\n"
for i in range(4):
s += "|"+lastRow[i]+"."
for j in range(10):
if(i == 2):
s += ".."
elif(i == 3... | output | 1 | 73,679 | 17 | 147,359 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 seats in remaining rows.
<image>
The event c... | instruction | 0 | 73,680 | 17 | 147,360 |
Tags: implementation
Correct Solution:
```
def proximoHashtag(v):
for i in range(1,22,2):
for j in range(0,4):
if(j==2 and i>1):
continue
if(v[j][i] == '#'):
v[j] = v[j][:i] + 'O' + v[j][i+1:]
return
n = int(input())
print("+------------------------+")
a = "|#.#.#.#.#.#.#.... | output | 1 | 73,680 | 17 | 147,361 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 seats in remaining rows.
<image>
The event c... | instruction | 0 | 73,681 | 17 | 147,362 |
Tags: implementation
Correct Solution:
```
__author__ = 'hamed1soleimani'
lines = list()
lines.append('+------------------------+')
lines.append('|#.#.#.#.#.#.#.#.#.#.#.|D|)')
lines.append('|#.#.#.#.#.#.#.#.#.#.#.|.|')
lines.append('|#.......................|')
lines.append('|#.#.#.#.#.#.#.#.#.#.#.|.|)')
lines.append(... | output | 1 | 73,681 | 17 | 147,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 ... | instruction | 0 | 73,682 | 17 | 147,364 |
Yes | output | 1 | 73,682 | 17 | 147,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 ... | instruction | 0 | 73,683 | 17 | 147,366 |
Yes | output | 1 | 73,683 | 17 | 147,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 ... | instruction | 0 | 73,684 | 17 | 147,368 |
Yes | output | 1 | 73,684 | 17 | 147,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 ... | instruction | 0 | 73,685 | 17 | 147,370 |
Yes | output | 1 | 73,685 | 17 | 147,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 ... | instruction | 0 | 73,686 | 17 | 147,372 |
No | output | 1 | 73,686 | 17 | 147,373 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 ... | instruction | 0 | 73,687 | 17 | 147,374 |
No | output | 1 | 73,687 | 17 | 147,375 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 ... | instruction | 0 | 73,688 | 17 | 147,376 |
No | output | 1 | 73,688 | 17 | 147,377 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 ... | instruction | 0 | 73,689 | 17 | 147,378 |
No | output | 1 | 73,689 | 17 | 147,379 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anton likes to play chess, and so does his friend Danik.
Once they have played n games in a row. For each game it's known who was the winner — Anton or Danik. None of the games ended with a tie.
Now Anton wonders, who won more games, he or... | instruction | 0 | 73,792 | 17 | 147,584 |
Tags: implementation, strings
Correct Solution:
```
input()
d = {'A':0, 'D':0}
for c in input():
d[c] += 1
if d['A'] > d['D']:
print('Anton')
elif d['A'] < d['D']:
print('Danik')
else:
print('Friendship')
``` | output | 1 | 73,792 | 17 | 147,585 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anton likes to play chess, and so does his friend Danik.
Once they have played n games in a row. For each game it's known who was the winner — Anton or Danik. None of the games ended with a tie.
Now Anton wonders, who won more games, he or... | instruction | 0 | 73,793 | 17 | 147,586 |
Tags: implementation, strings
Correct Solution:
```
a=int(input())
b=str(input())
c=b.count('A')
d=b.count('D')
if c>d:
print('Anton')
elif c==d:
print('Friendship')
else:
print('Danik')
``` | output | 1 | 73,793 | 17 | 147,587 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anton likes to play chess, and so does his friend Danik.
Once they have played n games in a row. For each game it's known who was the winner — Anton or Danik. None of the games ended with a tie.
Now Anton wonders, who won more games, he or... | instruction | 0 | 73,794 | 17 | 147,588 |
Tags: implementation, strings
Correct Solution:
```
n=int(input())
s=input()
l=len(s)
a=s.count('A')
d=l-a
if(a>d):
print("Anton")
elif(a<d):
print("Danik")
else:
print("Friendship")
``` | output | 1 | 73,794 | 17 | 147,589 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anton likes to play chess, and so does his friend Danik.
Once they have played n games in a row. For each game it's known who was the winner — Anton or Danik. None of the games ended with a tie.
Now Anton wonders, who won more games, he or... | instruction | 0 | 73,795 | 17 | 147,590 |
Tags: implementation, strings
Correct Solution:
```
a = int(input())
b = list(input())
c = 0
d = 0
for i in range(a):
if b[i] == 'A':
c += 1
if b[i] == 'D':
d += 1
if d > c:
print("Danik")
elif d == c:
print("Friendship")
else:
print("Anton")
``` | output | 1 | 73,795 | 17 | 147,591 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anton likes to play chess, and so does his friend Danik.
Once they have played n games in a row. For each game it's known who was the winner — Anton or Danik. None of the games ended with a tie.
Now Anton wonders, who won more games, he or... | instruction | 0 | 73,796 | 17 | 147,592 |
Tags: implementation, strings
Correct Solution:
```
n = int(input())
a = input()
anton_wins, danik_wins = 0, 0
for i in range(n):
if a[i] == 'A':
anton_wins += 1
else:
danik_wins += 1
if anton_wins == danik_wins:
print('Friendship')
elif anton_wins > danik_wins:
print('Anton')
else:
... | output | 1 | 73,796 | 17 | 147,593 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.