message stringlengths 2 67k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 463 109k | cluster float64 19 19 | __index_level_0__ int64 926 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Gildong is now developing a puzzle game. The puzzle consists of n platforms numbered from 1 to n. The player plays the game as a character that can stand on each platform and the goal of the game is to move the character from the 1-st platfo... | instruction | 0 | 68,364 | 19 | 136,728 |
Tags: dp
Correct Solution:
```
MAX_N = 3000
inf = MAX_N
def solve():
global inf
n = int(input())
a = [0] + list(map(int, input().split()))
dp = [[0] * (n + 1) for i in range(n + 1)]
for i in range(2, n + 1):
cnt = 0
for j in range(i, n + 1):
dp[i][j] = inf
... | output | 1 | 68,364 | 19 | 136,729 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gildong is now developing a puzzle game. The puzzle consists of n platforms numbered from 1 to n. The player plays the game as a character that can stand on each platform and the goal of the game is to move the character from the 1-st platfo... | instruction | 0 | 68,365 | 19 | 136,730 |
Tags: dp
Correct Solution:
```
t = int(input())
for _ in range(t):
n = int(input())
arr = [0] + [int(val) for val in input().split(' ')]
dp = [[0] * (n + 1) for i in range(n + 1)]
for i in range(2, n + 1):
cnt = 0
for j in range(i, n + 1):
dp[i][j] = 3000
for j in r... | output | 1 | 68,365 | 19 | 136,731 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gildong is now developing a puzzle game. The puzzle consists of n platforms numbered from 1 to n. The player plays the game as a character that can stand on each platform and the goal of the gam... | instruction | 0 | 68,366 | 19 | 136,732 |
No | output | 1 | 68,366 | 19 | 136,733 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gildong is now developing a puzzle game. The puzzle consists of n platforms numbered from 1 to n. The player plays the game as a character that can stand on each platform and the goal of the gam... | instruction | 0 | 68,367 | 19 | 136,734 |
No | output | 1 | 68,367 | 19 | 136,735 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gildong is now developing a puzzle game. The puzzle consists of n platforms numbered from 1 to n. The player plays the game as a character that can stand on each platform and the goal of the gam... | instruction | 0 | 68,368 | 19 | 136,736 |
No | output | 1 | 68,368 | 19 | 136,737 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gildong is now developing a puzzle game. The puzzle consists of n platforms numbered from 1 to n. The player plays the game as a character that can stand on each platform and the goal of the gam... | instruction | 0 | 68,369 | 19 | 136,738 |
No | output | 1 | 68,369 | 19 | 136,739 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nezzar designs a brand new game "Hidden Permutations" and shares it with his best friend, Nanako.
At the beginning of the game, Nanako and Nezzar both know integers n and m. The game goes in th... | instruction | 0 | 68,370 | 19 | 136,740 |
No | output | 1 | 68,370 | 19 | 136,741 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nezzar designs a brand new game "Hidden Permutations" and shares it with his best friend, Nanako.
At the beginning of the game, Nanako and Nezzar both know integers n and m. The game goes in th... | instruction | 0 | 68,371 | 19 | 136,742 |
No | output | 1 | 68,371 | 19 | 136,743 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nezzar designs a brand new game "Hidden Permutations" and shares it with his best friend, Nanako.
At the beginning of the game, Nanako and Nezzar both know integers n and m. The game goes in th... | instruction | 0 | 68,372 | 19 | 136,744 |
No | output | 1 | 68,372 | 19 | 136,745 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nezzar designs a brand new game "Hidden Permutations" and shares it with his best friend, Nanako.
At the beginning of the game, Nanako and Nezzar both know integers n and m. The game goes in th... | instruction | 0 | 68,373 | 19 | 136,746 |
No | output | 1 | 68,373 | 19 | 136,747 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are playing a video game and you have just reached the bonus level, where the only possible goal is to score as many points as possible. Being a perfectionist, you've decided that you won't ... | instruction | 0 | 68,407 | 19 | 136,814 |
No | output | 1 | 68,407 | 19 | 136,815 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Appleman has n cards. Each card has an uppercase letter written on it. Toastman must choose k cards from Appleman's cards. Then Appleman should give Toastman some coins depending on the chosen cards. Formally, for each Toastman's card i you ... | instruction | 0 | 68,495 | 19 | 136,990 |
Tags: greedy
Correct Solution:
```
n,k=map(int,input().split())
m=26
d=[0]*m
c=input()
for e in c:
d[ord(e)-65]+=1
d.sort(reverse=True)
ans=0
res=0
for i in range(m):
if ans>=k:
break
if ans+d[i]<=k:
ans+=d[i]
res+=d[i]*d[i]
else:
res+=(k-ans)*(k-ans)
ans=k
print(... | output | 1 | 68,495 | 19 | 136,991 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Appleman has n cards. Each card has an uppercase letter written on it. Toastman must choose k cards from Appleman's cards. Then Appleman should give Toastman some coins depending on the chosen cards. Formally, for each Toastman's card i you ... | instruction | 0 | 68,496 | 19 | 136,992 |
Tags: greedy
Correct Solution:
```
from collections import Counter
def solve(n,k,ar):
dict = Counter(ar)
dict = sorted(dict.values())
dict.reverse()
ans = []
cnt = 0
for i in range(len(dict)):
if k <= 0: break
if dict[i] <= k:
ans.append(dict[i])
k -= di... | output | 1 | 68,496 | 19 | 136,993 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Appleman has n cards. Each card has an uppercase letter written on it. Toastman must choose k cards from Appleman's cards. Then Appleman should give Toastman some coins depending on the chosen cards. Formally, for each Toastman's card i you ... | instruction | 0 | 68,497 | 19 | 136,994 |
Tags: greedy
Correct Solution:
```
##__________________________________________________________________
##
## Author: GogolGrind
##__________________________________________________________________
from sys import *
from math import *
def main ():
n,k = list(map(int,input().split()))
s = input()
l = [0]... | output | 1 | 68,497 | 19 | 136,995 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Appleman has n cards. Each card has an uppercase letter written on it. Toastman must choose k cards from Appleman's cards. Then Appleman should give Toastman some coins depending on the chosen cards. Formally, for each Toastman's card i you ... | instruction | 0 | 68,498 | 19 | 136,996 |
Tags: greedy
Correct Solution:
```
n,k = map(int,input().split())
d,r = {},0
for c in input(): d[c] = d.get(c, 0)+1
for v in sorted(d.values())[::-1]:
x = min(k,v)
r += x*x
k -= x
print(r)
# Made By Mostafa_Khaled
``` | output | 1 | 68,498 | 19 | 136,997 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Appleman has n cards. Each card has an uppercase letter written on it. Toastman must choose k cards from Appleman's cards. Then Appleman should give Toastman some coins depending on the chosen cards. Formally, for each Toastman's card i you ... | instruction | 0 | 68,499 | 19 | 136,998 |
Tags: greedy
Correct Solution:
```
a= input().split(" ")
#print(a)
n=int(a[0])
k=int(a[1])
#print(n,k)
q=input()
w=set(q)
e=list(w)
l=len(e)
i=0
t=[]
#print('q',q)
#print('e',e)
while i<l:
r=e[i]
y=q.count(r)
t.append(y)
i+=1
#print('t',t)
t.sort()
t.reverse()
#print(t)
c=list(set(t))
c.sort()
c.reverse... | output | 1 | 68,499 | 19 | 136,999 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Appleman has n cards. Each card has an uppercase letter written on it. Toastman must choose k cards from Appleman's cards. Then Appleman should give Toastman some coins depending on the chosen cards. Formally, for each Toastman's card i you ... | instruction | 0 | 68,500 | 19 | 137,000 |
Tags: greedy
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Sun Jul 26 03:54:17 2020
@author: Samiul2651
"""
x = input().split(" ")
a = int(x[0])
b = int(x[1])
n = input()
list_1 = list(n)
list_1 = sorted(list_1)
#print(list_1)
i = 0
length_1 = len(list_1)
list_2 = []
while i < length_1:
... | output | 1 | 68,500 | 19 | 137,001 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Appleman has n cards. Each card has an uppercase letter written on it. Toastman must choose k cards from Appleman's cards. Then Appleman should give Toastman some coins depending on the chosen cards. Formally, for each Toastman's card i you ... | instruction | 0 | 68,501 | 19 | 137,002 |
Tags: greedy
Correct Solution:
```
from sys import stdin
A = list(map(int,stdin.readline().split()))
N = A[0]
K = A[1]
B = stdin.readline()
D=dict()
S=set()
T=list()
for t in range(0,len(B)-1):
l=len(S)
S.add(B[t])
if l==len(S):
D[B[t]]+=1
T.remove(D[B[t]]-1)
T.append(D[B[t]])
... | output | 1 | 68,501 | 19 | 137,003 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Appleman has n cards. Each card has an uppercase letter written on it. Toastman must choose k cards from Appleman's cards. Then Appleman should give Toastman some coins depending on the chosen cards. Formally, for each Toastman's card i you ... | instruction | 0 | 68,502 | 19 | 137,004 |
Tags: greedy
Correct Solution:
```
n, k = list(map(int ,input().split()))
s = input()
d = {}
for char in s:
d[char] = d.get(char, 0) + 1
L = sorted([[key, d[key]] for key in d], key=lambda x:x[1], reverse=True)
ans, i = 0, 0
while(k > 0):
if k >= L[i][1]:
ans += L[i][1] ** 2
k -= L[i][1]
els... | output | 1 | 68,502 | 19 | 137,005 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Appleman has n cards. Each card has an uppercase letter written on it. Toastman must choose k cards from Appleman's cards. Then Appleman should give Toastman some coins depending on the chosen c... | instruction | 0 | 68,503 | 19 | 137,006 |
Yes | output | 1 | 68,503 | 19 | 137,007 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Appleman has n cards. Each card has an uppercase letter written on it. Toastman must choose k cards from Appleman's cards. Then Appleman should give Toastman some coins depending on the chosen c... | instruction | 0 | 68,505 | 19 | 137,010 |
Yes | output | 1 | 68,505 | 19 | 137,011 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Appleman has n cards. Each card has an uppercase letter written on it. Toastman must choose k cards from Appleman's cards. Then Appleman should give Toastman some coins depending on the chosen c... | instruction | 0 | 68,506 | 19 | 137,012 |
Yes | output | 1 | 68,506 | 19 | 137,013 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Appleman has n cards. Each card has an uppercase letter written on it. Toastman must choose k cards from Appleman's cards. Then Appleman should give Toastman some coins depending on the chosen c... | instruction | 0 | 68,507 | 19 | 137,014 |
No | output | 1 | 68,507 | 19 | 137,015 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Appleman has n cards. Each card has an uppercase letter written on it. Toastman must choose k cards from Appleman's cards. Then Appleman should give Toastman some coins depending on the chosen c... | instruction | 0 | 68,508 | 19 | 137,016 |
No | output | 1 | 68,508 | 19 | 137,017 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Appleman has n cards. Each card has an uppercase letter written on it. Toastman must choose k cards from Appleman's cards. Then Appleman should give Toastman some coins depending on the chosen c... | instruction | 0 | 68,509 | 19 | 137,018 |
No | output | 1 | 68,509 | 19 | 137,019 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Appleman has n cards. Each card has an uppercase letter written on it. Toastman must choose k cards from Appleman's cards. Then Appleman should give Toastman some coins depending on the chosen c... | instruction | 0 | 68,510 | 19 | 137,020 |
No | output | 1 | 68,510 | 19 | 137,021 |
Provide tags and a correct Python 3 solution for this coding contest problem.
n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next person from the line, and so on. They play until so... | instruction | 0 | 69,540 | 19 | 139,080 |
Tags: data structures, implementation
Correct Solution:
```
inp = list(map(int, input().split()))
players = list(map(int, input().split()))
n = inp[0]
k = inp[1]
if (n == 2):
print(max(players[0], players[1]))
else:
flag = False
indice_prox = 2
maior = max(players)
num_vitorias = 0
prev_vence... | output | 1 | 69,540 | 19 | 139,081 |
Provide tags and a correct Python 3 solution for this coding contest problem.
n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next person from the line, and so on. They play until so... | instruction | 0 | 69,541 | 19 | 139,082 |
Tags: data structures, implementation
Correct Solution:
```
n, k = map(int, input().split())
a = list(map(int, input().split()))
high = max(a.pop(0), a.pop(0))
try:
if n == 2:
raise IndexError
while True:
for i in range(k-1):
if a[i] > high:
high = a[i]
... | output | 1 | 69,541 | 19 | 139,083 |
Provide tags and a correct Python 3 solution for this coding contest problem.
n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next person from the line, and so on. They play until so... | instruction | 0 | 69,542 | 19 | 139,084 |
Tags: data structures, implementation
Correct Solution:
```
n,k=map(int,input().split())
a=list(map(int,input().split()))
if k>=n:
print(max(a))
else:
for i in range(k-1):
a.append(a[i])
if max(a[0:k+1])==a[0]:
print(a[0])
else:
i=a.index(max(a[0:k+1]))
while True:
... | output | 1 | 69,542 | 19 | 139,085 |
Provide tags and a correct Python 3 solution for this coding contest problem.
n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next person from the line, and so on. They play until so... | instruction | 0 | 69,543 | 19 | 139,086 |
Tags: data structures, implementation
Correct Solution:
```
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
n, k = map(int, input().split())
a = list(map(int, input().split()))
t = a[0]
temp = 0
if k >= n-1:
print(max(a))
else:
while temp != k:
x, y = a[0], a[1]
if x > y:
a.append(y)... | output | 1 | 69,543 | 19 | 139,087 |
Provide tags and a correct Python 3 solution for this coding contest problem.
n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next person from the line, and so on. They play until so... | instruction | 0 | 69,544 | 19 | 139,088 |
Tags: data structures, implementation
Correct Solution:
```
IL = lambda: list(map(int, input().split()))
I = lambda: int(input())
n, k = IL()
a = IL()
ans = 0
score = 0
for i in range(n-1):
if a[0] > a[1]:
score += 1
else:
score = 1
if score == k:
ans = a[0]
break
p1, p2... | output | 1 | 69,544 | 19 | 139,089 |
Provide tags and a correct Python 3 solution for this coding contest problem.
n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next person from the line, and so on. They play until so... | instruction | 0 | 69,545 | 19 | 139,090 |
Tags: data structures, implementation
Correct Solution:
```
n,k=map(int,input().split())
l=list(map(int,input().split()))
if k<=len(l):
pos = l.index(max(l))
h= l[:pos]
m=0
i=0
j=1
while i<pos and j<pos and m<k:
if h[i]>h[j]:
m+=1
j+=1
else :
i... | output | 1 | 69,545 | 19 | 139,091 |
Provide tags and a correct Python 3 solution for this coding contest problem.
n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next person from the line, and so on. They play until so... | instruction | 0 | 69,546 | 19 | 139,092 |
Tags: data structures, implementation
Correct Solution:
```
n,k=map(int,input().split())
t=list(map(int,input().split()))
j=0
maxx=0
a=1
for i in t:
if i>maxx:
maxx=i
h=1
if a==1:
h=h-1
a=0
else:
h+=1
if h==k:
break
print(maxx)
``` | output | 1 | 69,546 | 19 | 139,093 |
Provide tags and a correct Python 3 solution for this coding contest problem.
n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next person from the line, and so on. They play until so... | instruction | 0 | 69,547 | 19 | 139,094 |
Tags: data structures, implementation
Correct Solution:
```
from sys import stdin,stdout
n,k = map(int,stdin.readline().split())
p = list(map(int,stdin.readline().split()))
if k >= (n-1):
stdout.write(str(max(p)))
else:
n1 = p[0]
del p[0]
c = 0
for item in p:
if item > n1:
n1 =... | output | 1 | 69,547 | 19 | 139,095 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next pers... | instruction | 0 | 69,548 | 19 | 139,096 |
Yes | output | 1 | 69,548 | 19 | 139,097 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next pers... | instruction | 0 | 69,549 | 19 | 139,098 |
Yes | output | 1 | 69,549 | 19 | 139,099 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next pers... | instruction | 0 | 69,550 | 19 | 139,100 |
Yes | output | 1 | 69,550 | 19 | 139,101 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next pers... | instruction | 0 | 69,551 | 19 | 139,102 |
Yes | output | 1 | 69,551 | 19 | 139,103 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next pers... | instruction | 0 | 69,552 | 19 | 139,104 |
No | output | 1 | 69,552 | 19 | 139,105 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next pers... | instruction | 0 | 69,553 | 19 | 139,106 |
No | output | 1 | 69,553 | 19 | 139,107 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next pers... | instruction | 0 | 69,554 | 19 | 139,108 |
No | output | 1 | 69,554 | 19 | 139,109 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next pers... | instruction | 0 | 69,555 | 19 | 139,110 |
No | output | 1 | 69,555 | 19 | 139,111 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob are playing a game with n piles of stones. It is guaranteed that n is an even number. The i-th pile has a_i stones.
Alice and Bob will play a game alternating turns with Alice going first.
On a player's turn, they must choose... | instruction | 0 | 69,894 | 19 | 139,788 |
Tags: games
Correct Solution:
```
n = int(input())
L = [int(i) for i in input().split()]
s = 0
m = L[0]
for i in L:
if i == 1:
s += 1
if i < m:
m = i
if s > n // 2:
print('Bob')
elif s <= n // 2 and s > 0:
print('Alice')
elif s == 0:
ss = 0
for j in L:
if j == m:
... | output | 1 | 69,894 | 19 | 139,789 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob are playing a game with n piles of stones. It is guaranteed that n is an even number. The i-th pile has a_i stones.
Alice and Bob will play a game alternating turns with Alice going first.
On a player's turn, they must choose... | instruction | 0 | 69,895 | 19 | 139,790 |
Tags: games
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
b=[0]*51
min_a=100
for i in a:
b[i]+=1
min_a=min(min_a,i)
if b[min_a]>n//2 :
print("Bob")
else:
print("Alice")
``` | output | 1 | 69,895 | 19 | 139,791 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob are playing a game with n piles of stones. It is guaranteed that n is an even number. The i-th pile has a_i stones.
Alice and Bob will play a game alternating turns with Alice going first.
On a player's turn, they must choose... | instruction | 0 | 69,896 | 19 | 139,792 |
Tags: games
Correct Solution:
```
n = int(input())
A = list(map(int, input().split()))
m = min(A)
cnt = 0
for a in A:
if a == m:
cnt += 1
if cnt > n//2:
print('Bob')
else:
print('Alice')
``` | output | 1 | 69,896 | 19 | 139,793 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob are playing a game with n piles of stones. It is guaranteed that n is an even number. The i-th pile has a_i stones.
Alice and Bob will play a game alternating turns with Alice going first.
On a player's turn, they must choose... | instruction | 0 | 69,897 | 19 | 139,794 |
Tags: games
Correct Solution:
```
if __name__ == '__main__':
stone_piles_nr = int(input())
pile_idx___stones_nr = [int(x) for x in input().split()]
min_stones_nr = min(pile_idx___stones_nr)
min_count = pile_idx___stones_nr.count(min_stones_nr)
if min_count > stone_piles_nr // 2:
print('Bob')... | output | 1 | 69,897 | 19 | 139,795 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob are playing a game with n piles of stones. It is guaranteed that n is an even number. The i-th pile has a_i stones.
Alice and Bob will play a game alternating turns with Alice going first.
On a player's turn, they must choose... | instruction | 0 | 69,898 | 19 | 139,796 |
Tags: games
Correct Solution:
```
i=input
i()
s=list(map(int,i().split()))
print("Bob"if s.count(min(s))>len(s)/2 else"Alice")
``` | output | 1 | 69,898 | 19 | 139,797 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob are playing a game with n piles of stones. It is guaranteed that n is an even number. The i-th pile has a_i stones.
Alice and Bob will play a game alternating turns with Alice going first.
On a player's turn, they must choose... | instruction | 0 | 69,899 | 19 | 139,798 |
Tags: games
Correct Solution:
```
kk=lambda:map(int,input().split())
ll=lambda:list(kk())
n,s=int(input()),ll()
print("Bob" if s.count(min(s)) > n/2 else "Alice")
``` | output | 1 | 69,899 | 19 | 139,799 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob are playing a game with n piles of stones. It is guaranteed that n is an even number. The i-th pile has a_i stones.
Alice and Bob will play a game alternating turns with Alice going first.
On a player's turn, they must choose... | instruction | 0 | 69,900 | 19 | 139,800 |
Tags: games
Correct Solution:
```
from collections import Counter as C
n = int(input())
c = C(map(int, input().split()))
m = c[min(c.keys())]
print("Alice" if m <= n / 2 else "Bob")
``` | output | 1 | 69,900 | 19 | 139,801 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob are playing a game with n piles of stones. It is guaranteed that n is an even number. The i-th pile has a_i stones.
Alice and Bob will play a game alternating turns with Alice going first.
On a player's turn, they must choose... | instruction | 0 | 69,901 | 19 | 139,802 |
Tags: games
Correct Solution:
```
# AC
import sys
class Main:
def __init__(self):
self.buff = None
self.index = 0
def next(self):
if self.buff is None or self.index == len(self.buff):
self.buff = self.next_line()
self.index = 0
val = self.buff[self.index... | output | 1 | 69,901 | 19 | 139,803 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.