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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vladik was bored on his way home and decided to play the following game. He took n cards and put them in a row in front of himself. Every card has a positive integer number not exceeding 8 writt... | instruction | 0 | 37,341 | 19 | 74,682 |
No | output | 1 | 37,341 | 19 | 74,683 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vladik was bored on his way home and decided to play the following game. He took n cards and put them in a row in front of himself. Every card has a positive integer number not exceeding 8 writt... | instruction | 0 | 37,342 | 19 | 74,684 |
No | output | 1 | 37,342 | 19 | 74,685 |
Provide a correct Python 3 solution for this coding contest problem.
We have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.
Two people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has ... | instruction | 0 | 37,588 | 19 | 75,176 |
"Correct Solution:
```
# coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n,z,w = map(int, readline().split())
a = [w]+[*map(int, readline().split())]
n += 1
INF = 1<<30
dp0 = [-INF]*n
dp1 = [INF]*n
dp0[-1] = dp1[-1] = abs(a[-1]-a[-2])
for i in range(n-2,0,-1):
dp0[i... | output | 1 | 37,588 | 19 | 75,177 |
Provide a correct Python 3 solution for this coding contest problem.
We have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.
Two people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has ... | instruction | 0 | 37,589 | 19 | 75,178 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
def inpl(): return tuple(map(int, input().split()))
N, Z, W = inpl()
A = inpl()
# X全取り
p1 = abs(A[-1] - W)
# X１残し
if N > 1:
p2 = abs(A[-1] - A[-2])
else:
p2 = p1
print(max(p1, p2))
``` | output | 1 | 37,589 | 19 | 75,179 |
Provide a correct Python 3 solution for this coding contest problem.
We have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.
Two people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has ... | instruction | 0 | 37,590 | 19 | 75,180 |
"Correct Solution:
```
N, Z, W = map(int, input().split())
a = [int(n) for n in input().split()]
if N == 1:
print(abs(a[0]-W))
else:
print(max(abs(a[N-1]-W), abs(a[N-1]-a[N-2])))
``` | output | 1 | 37,590 | 19 | 75,181 |
Provide a correct Python 3 solution for this coding contest problem.
We have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.
Two people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has ... | instruction | 0 | 37,591 | 19 | 75,182 |
"Correct Solution:
```
N,Z,W = map(int,input().split())
A = list(map(int,input().split()))
if N == 1:
print(abs(A[0]-W))
exit()
if abs(A[-1]-A[-2]) >= abs(A[-1]-W):
print(abs(A[-1]-A[-2]))
else:
print(abs(A[-1]-W))
``` | output | 1 | 37,591 | 19 | 75,183 |
Provide a correct Python 3 solution for this coding contest problem.
We have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.
Two people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has ... | instruction | 0 | 37,592 | 19 | 75,184 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(10 ** 5)
input = sys.stdin.readline
N, Z, W = [int(x) for x in input().strip().split()]
a = [int(x) for x in input().strip().split()]
d = {}
def minmax(x, y, c, f):
# print('x={}, y={}, c={}, f={}'.format(x, y, c, f))
if (c, f) in d:
return d[(c, f... | output | 1 | 37,592 | 19 | 75,185 |
Provide a correct Python 3 solution for this coding contest problem.
We have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.
Two people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has ... | instruction | 0 | 37,593 | 19 | 75,186 |
"Correct Solution:
```
n,z,w=map(int,input().split())
a=list(map(int,input().split()))
print(max(abs(a[-2]-a[-1]),abs(a[-1]-w)) if n>=2 else abs(a[-1]-w))
``` | output | 1 | 37,593 | 19 | 75,187 |
Provide a correct Python 3 solution for this coding contest problem.
We have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.
Two people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has ... | instruction | 0 | 37,594 | 19 | 75,188 |
"Correct 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().spl... | output | 1 | 37,594 | 19 | 75,189 |
Provide a correct Python 3 solution for this coding contest problem.
We have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.
Two people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has ... | instruction | 0 | 37,595 | 19 | 75,190 |
"Correct Solution:
```
N, Z, W = map(int, input().split())
A = [W]+list(map(int, input().split()))
X = [0]*N
Y = [1<<30]*N
X[0] = Y[0] = abs(A[-2]-A[-1])
for i in range(1,N):
X[i] = max(abs(A[-2-i]-A[-1]), max(Y[j] for j in range(i)))
Y[i] = min(abs(A[-2-i]-A[-1]), min(X[j] for j in range(i)))
print(X[-1])
``` | output | 1 | 37,595 | 19 | 75,191 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.
Two people X and Y will play a game using this deck. Initially, X... | instruction | 0 | 37,596 | 19 | 75,192 |
Yes | output | 1 | 37,596 | 19 | 75,193 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.
Two people X and Y will play a game using this deck. Initially, X... | instruction | 0 | 37,597 | 19 | 75,194 |
Yes | output | 1 | 37,597 | 19 | 75,195 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.
Two people X and Y will play a game using this deck. Initially, X... | instruction | 0 | 37,598 | 19 | 75,196 |
Yes | output | 1 | 37,598 | 19 | 75,197 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.
Two people X and Y will play a game using this deck. Initially, X... | instruction | 0 | 37,599 | 19 | 75,198 |
Yes | output | 1 | 37,599 | 19 | 75,199 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.
Two people X and Y will play a game using this deck. Initially, X... | instruction | 0 | 37,600 | 19 | 75,200 |
No | output | 1 | 37,600 | 19 | 75,201 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.
Two people X and Y will play a game using this deck. Initially, X... | instruction | 0 | 37,601 | 19 | 75,202 |
No | output | 1 | 37,601 | 19 | 75,203 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.
Two people X and Y will play a game using this deck. Initially, X... | instruction | 0 | 37,602 | 19 | 75,204 |
No | output | 1 | 37,602 | 19 | 75,205 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.
Two people X and Y will play a game using this deck. Initially, X... | instruction | 0 | 37,603 | 19 | 75,206 |
No | output | 1 | 37,603 | 19 | 75,207 |
Provide a correct Python 3 solution for this coding contest problem.
The dice are placed in the orientation shown in the figure below.
<image>
As shown in this figure, the dice used here have 1 on the upper side and 2 on the south side, and 3 on the east side. Since the sum of the facing faces of the dice is always... | instruction | 0 | 37,675 | 19 | 75,350 |
"Correct Solution:
```
import sys
f = sys.stdin
ope = {'North':(1,5,2,3,0,4)
,'East' :(3,1,0,5,4,2)
,'West' :(2,1,5,0,4,3)
,'South':(4,0,2,3,5,1)
,'Right':(0,2,4,1,3,5)
,'Left' :(0,3,1,4,2,5)}
while True:
n = int(f.readline())
if n == 0:
break
xi = [1,2,3,4,5,6]
re... | output | 1 | 37,675 | 19 | 75,351 |
Provide a correct Python 3 solution for this coding contest problem.
The dice are placed in the orientation shown in the figure below.
<image>
As shown in this figure, the dice used here have 1 on the upper side and 2 on the south side, and 3 on the east side. Since the sum of the facing faces of the dice is always... | instruction | 0 | 37,676 | 19 | 75,352 |
"Correct Solution:
```
roll = {"North":("152304"),
"South":("402351"),
"East":("310542"),
"West":("215043"),
"Right":("024135"),
"Left":("031425")}
while True:
n = int(input())
if n == 0:
break
cnt = 1
_dice = [i for i in range(1,7)]
for i in range(n):
_dice = ... | output | 1 | 37,676 | 19 | 75,353 |
Provide a correct Python 3 solution for this coding contest problem.
The dice are placed in the orientation shown in the figure below.
<image>
As shown in this figure, the dice used here have 1 on the upper side and 2 on the south side, and 3 on the east side. Since the sum of the facing faces of the dice is always... | instruction | 0 | 37,677 | 19 | 75,354 |
"Correct Solution:
```
M = ['North','East','West','South','Right','Left']
while 1:
n = int(input())
if n == 0:
break
D = [1,2,3]
s = 1
for i in range(n):
m = input()
if m == M[0]:
D[0],D[1] = D[1],7-D[0]
elif m == M[1]:
D[0],D[2] = 7-D[2],D[0]
... | output | 1 | 37,677 | 19 | 75,355 |
Provide a correct Python 3 solution for this coding contest problem.
The dice are placed in the orientation shown in the figure below.
<image>
As shown in this figure, the dice used here have 1 on the upper side and 2 on the south side, and 3 on the east side. Since the sum of the facing faces of the dice is always... | instruction | 0 | 37,678 | 19 | 75,356 |
"Correct Solution:
```
# coding: utf-8
# Here your code !
import sys
f = sys.stdin
def North(d):
d = [d[1]] + [7 -d[0]] + [d[2]]
return d
def East(d):
d = [7-d[2]] + [d[1]] + [d[0]]
return d
def South(d):
d = [7-d[1]] + [d[0]] + [d[2]]
return d
def West(d):
d = [d[2]] + [d[... | output | 1 | 37,678 | 19 | 75,357 |
Provide a correct Python 3 solution for this coding contest problem.
The dice are placed in the orientation shown in the figure below.
<image>
As shown in this figure, the dice used here have 1 on the upper side and 2 on the south side, and 3 on the east side. Since the sum of the facing faces of the dice is always... | instruction | 0 | 37,679 | 19 | 75,358 |
"Correct Solution:
```
U, F, R, L, B, D = range(6)
while True:
n = int(input())
if n == 0:
break
s = list(range(1, 6 + 1))
result = 1
for _ in range(n):
raw = input()
assert raw.find('\t') == -1
op = raw.strip()
if op == "North":
s[U], s[F], s[D], ... | output | 1 | 37,679 | 19 | 75,359 |
Provide a correct Python 3 solution for this coding contest problem.
The dice are placed in the orientation shown in the figure below.
<image>
As shown in this figure, the dice used here have 1 on the upper side and 2 on the south side, and 3 on the east side. Since the sum of the facing faces of the dice is always... | instruction | 0 | 37,680 | 19 | 75,360 |
"Correct Solution:
```
# -*- coding:shift-jis -*-
class Dice:
def __init__(self):
self.top = 1
self.south = 2
self.north = 5
self.east = 3
self.west = 4
self.bottom = 6
def rotate(self,operation):
if operation == "North":
self.top,self.north,self.bottom,self.south = self.south,self.top,self.north,... | output | 1 | 37,680 | 19 | 75,361 |
Provide a correct Python 3 solution for this coding contest problem.
The dice are placed in the orientation shown in the figure below.
<image>
As shown in this figure, the dice used here have 1 on the upper side and 2 on the south side, and 3 on the east side. Since the sum of the facing faces of the dice is always... | instruction | 0 | 37,681 | 19 | 75,362 |
"Correct Solution:
```
n = int(input())
while (n!=0):
wlist = []
for i in range(n):
wlist.append(str(input()))
ufr = {"u":1 ,"f":2, "r":3}
up = 1
for w in wlist:
tmp = 0
if (w == "North"):
tmp = ufr["u"]
ufr["u"] = ufr["f"]
ufr["f"] = 7-tmp... | output | 1 | 37,681 | 19 | 75,363 |
Provide a correct Python 3 solution for this coding contest problem.
The dice are placed in the orientation shown in the figure below.
<image>
As shown in this figure, the dice used here have 1 on the upper side and 2 on the south side, and 3 on the east side. Since the sum of the facing faces of the dice is always... | instruction | 0 | 37,682 | 19 | 75,364 |
"Correct Solution:
```
dice = [0,1,2,3,4,5,6]
def north():
ret = [0]
global dice
ret.append(dice[2])
ret.append(dice[6])
ret.append(dice[3])
ret.append(dice[4])
ret.append(dice[1])
ret.append(dice[5])
dice = ret.copy()
def east():
ret = [0]
global dice
ret.append(dic... | output | 1 | 37,682 | 19 | 75,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The dice are placed in the orientation shown in the figure below.
<image>
As shown in this figure, the dice used here have 1 on the upper side and 2 on the south side, and 3 on the east side.... | instruction | 0 | 37,690 | 19 | 75,380 |
No | output | 1 | 37,690 | 19 | 75,381 |
Provide a correct Python 3 solution for this coding contest problem.
Two deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest. In this game, an honest player always tells the truth, and an dishonest player always tell lies. You are given two characters a and b as the input. Each of them is eithe... | instruction | 0 | 38,445 | 19 | 76,890 |
"Correct Solution:
```
a = input().split()
if(a[0]==a[1]):
print('H')
else:
print('D')
``` | output | 1 | 38,445 | 19 | 76,891 |
Provide a correct Python 3 solution for this coding contest problem.
Two deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest. In this game, an honest player always tells the truth, and an dishonest player always tell lies. You are given two characters a and b as the input. Each of them is eithe... | instruction | 0 | 38,446 | 19 | 76,892 |
"Correct Solution:
```
l = input().split()
print("H" if l[0]==l[1] else "D")
``` | output | 1 | 38,446 | 19 | 76,893 |
Provide a correct Python 3 solution for this coding contest problem.
Two deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest. In this game, an honest player always tells the truth, and an dishonest player always tell lies. You are given two characters a and b as the input. Each of them is eithe... | instruction | 0 | 38,447 | 19 | 76,894 |
"Correct Solution:
```
s=input().split()
print('H' if s[0]==s[1] else 'D')
``` | output | 1 | 38,447 | 19 | 76,895 |
Provide a correct Python 3 solution for this coding contest problem.
Two deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest. In this game, an honest player always tells the truth, and an dishonest player always tell lies. You are given two characters a and b as the input. Each of them is eithe... | instruction | 0 | 38,448 | 19 | 76,896 |
"Correct Solution:
```
a,t = map(str, input().split())
print('H' if a==t else 'D')
``` | output | 1 | 38,448 | 19 | 76,897 |
Provide a correct Python 3 solution for this coding contest problem.
Two deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest. In this game, an honest player always tells the truth, and an dishonest player always tell lies. You are given two characters a and b as the input. Each of them is eithe... | instruction | 0 | 38,449 | 19 | 76,898 |
"Correct Solution:
```
a,b=input().split()
print("H" if a==b else "D")
``` | output | 1 | 38,449 | 19 | 76,899 |
Provide a correct Python 3 solution for this coding contest problem.
Two deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest. In this game, an honest player always tells the truth, and an dishonest player always tell lies. You are given two characters a and b as the input. Each of them is eithe... | instruction | 0 | 38,450 | 19 | 76,900 |
"Correct Solution:
```
a, b = input().split()
print("DH"[a == b])
``` | output | 1 | 38,450 | 19 | 76,901 |
Provide a correct Python 3 solution for this coding contest problem.
Two deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest. In this game, an honest player always tells the truth, and an dishonest player always tell lies. You are given two characters a and b as the input. Each of them is eithe... | instruction | 0 | 38,451 | 19 | 76,902 |
"Correct Solution:
```
a, b = [s for s in input().split()]
print("H") if (a == b) else print("D")
``` | output | 1 | 38,451 | 19 | 76,903 |
Provide a correct Python 3 solution for this coding contest problem.
Two deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest. In this game, an honest player always tells the truth, and an dishonest player always tell lies. You are given two characters a and b as the input. Each of them is eithe... | instruction | 0 | 38,452 | 19 | 76,904 |
"Correct Solution:
```
a, b = [1 if _ == 'H' else 0 for _ in input().split()]
print('HD'[a ^ b])
``` | output | 1 | 38,452 | 19 | 76,905 |
Provide a correct Python 3 solution for this coding contest problem.
Create a program that reads poker hand data and outputs the role for each. However, this issue follows the rules below.
* Poker is a competition with 5 playing cards.
* No more than 5 cards with the same number.
* There is no joker.
* Suppose you on... | instruction | 0 | 38,477 | 19 | 76,954 |
"Correct Solution:
```
import sys
from collections import Counter
class Poker(object):
def __init__(self, cards):
# ?????????????????????????????????????????§?????????(??????)???????????????
self.cards = cards[:]
self.cards.sort(reverse=True)
def evaluate_hand(self):
""" ?????... | output | 1 | 38,477 | 19 | 76,955 |
Provide a correct Python 3 solution for this coding contest problem.
Create a program that reads poker hand data and outputs the role for each. However, this issue follows the rules below.
* Poker is a competition with 5 playing cards.
* No more than 5 cards with the same number.
* There is no joker.
* Suppose you on... | instruction | 0 | 38,478 | 19 | 76,956 |
"Correct Solution:
```
while(1):
try:
a = [int(i) for i in input().split(",")]
a.sort()
pairs = []
for i in set(a):
count = 0
for j in a:
if j == i:
count += 1
pairs.append(count)
if 5 in pairs:
... | output | 1 | 38,478 | 19 | 76,957 |
Provide a correct Python 3 solution for this coding contest problem.
Create a program that reads poker hand data and outputs the role for each. However, this issue follows the rules below.
* Poker is a competition with 5 playing cards.
* No more than 5 cards with the same number.
* There is no joker.
* Suppose you on... | instruction | 0 | 38,479 | 19 | 76,958 |
"Correct Solution:
```
import sys
for line in sys.stdin.readlines():
l = [int(i) for i in line.split(',')]
l.sort()
n =sum([l.count(i) for i in l])
if n == 17:
print('four card')
elif n == 13:
print('full house')
elif n == 11:
print('three card')
elif n == 9:
print('two pair')
elif n == ... | output | 1 | 38,479 | 19 | 76,959 |
Provide a correct Python 3 solution for this coding contest problem.
Create a program that reads poker hand data and outputs the role for each. However, this issue follows the rules below.
* Poker is a competition with 5 playing cards.
* No more than 5 cards with the same number.
* There is no joker.
* Suppose you on... | instruction | 0 | 38,480 | 19 | 76,960 |
"Correct Solution:
```
def s(n):
sum=0
for i in range(14):
if n[i] == 1 : sum+=i
if sum % 5 == 0 or sum == 47: return True
return False
while True:
try:
l=map(int, input().split(","))
except:
break
n=[0]*14
for i in l:
n[i]+=1
if 4 in n:
pri... | output | 1 | 38,480 | 19 | 76,961 |
Provide a correct Python 3 solution for this coding contest problem.
Create a program that reads poker hand data and outputs the role for each. However, this issue follows the rules below.
* Poker is a competition with 5 playing cards.
* No more than 5 cards with the same number.
* There is no joker.
* Suppose you on... | instruction | 0 | 38,481 | 19 | 76,962 |
"Correct Solution:
```
import sys
readlines = sys.stdin.readlines
write = sys.stdout.write
def solve(C):
d = {}
for c in C:
d[c] = d.get(c, 0) + 1
*vs, = d.values()
vs.sort()
if vs[-1] == 4:
return "four card"
if vs == [2, 3]:
return "full house"
c0 = C[0]
if C ==... | output | 1 | 38,481 | 19 | 76,963 |
Provide a correct Python 3 solution for this coding contest problem.
Create a program that reads poker hand data and outputs the role for each. However, this issue follows the rules below.
* Poker is a competition with 5 playing cards.
* No more than 5 cards with the same number.
* There is no joker.
* Suppose you on... | instruction | 0 | 38,482 | 19 | 76,964 |
"Correct Solution:
```
# AOJ 0038: Poker Hand
# Python3 2018.6.27 bal4u
def judge(card, cnt):
nmax = cnt[0][1]
if nmax == 4: return "four card"
if nmax == 3: return "full house" if cnt[1][1] == 2 else "three card"
if nmax == 2: return "two pair" if cnt[1][1] == 2 else "one pair"
if (card[0] == 1 and list(range(10... | output | 1 | 38,482 | 19 | 76,965 |
Provide a correct Python 3 solution for this coding contest problem.
Create a program that reads poker hand data and outputs the role for each. However, this issue follows the rules below.
* Poker is a competition with 5 playing cards.
* No more than 5 cards with the same number.
* There is no joker.
* Suppose you on... | instruction | 0 | 38,483 | 19 | 76,966 |
"Correct Solution:
```
import collections
def solution1(kard):
#強いものから順に探していく
if fourcard(kard):
print("four card")
elif fullhouse(kard):
print("full house")
elif straight(kard):
print("straight")
elif threecard(kard):
print("three card")
elif twopair(kard):
... | output | 1 | 38,483 | 19 | 76,967 |
Provide a correct Python 3 solution for this coding contest problem.
Create a program that reads poker hand data and outputs the role for each. However, this issue follows the rules below.
* Poker is a competition with 5 playing cards.
* No more than 5 cards with the same number.
* There is no joker.
* Suppose you on... | instruction | 0 | 38,484 | 19 | 76,968 |
"Correct Solution:
```
import sys
for e in sys.stdin:
e=sorted(map(int,e.split(',')))
print([['null','straight'][e[0]*9<e[1]or e[4]-e[0]<5],'one pair','two pair','three card','full house',0,'four card'][sum(e.count(s)for s in e)//2-2])
``` | output | 1 | 38,484 | 19 | 76,969 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Create a program that reads poker hand data and outputs the role for each. However, this issue follows the rules below.
* Poker is a competition with 5 playing cards.
* No more than 5 cards wit... | instruction | 0 | 38,485 | 19 | 76,970 |
Yes | output | 1 | 38,485 | 19 | 76,971 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Create a program that reads poker hand data and outputs the role for each. However, this issue follows the rules below.
* Poker is a competition with 5 playing cards.
* No more than 5 cards wit... | instruction | 0 | 38,486 | 19 | 76,972 |
Yes | output | 1 | 38,486 | 19 | 76,973 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Create a program that reads poker hand data and outputs the role for each. However, this issue follows the rules below.
* Poker is a competition with 5 playing cards.
* No more than 5 cards wit... | instruction | 0 | 38,487 | 19 | 76,974 |
Yes | output | 1 | 38,487 | 19 | 76,975 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Create a program that reads poker hand data and outputs the role for each. However, this issue follows the rules below.
* Poker is a competition with 5 playing cards.
* No more than 5 cards wit... | instruction | 0 | 38,488 | 19 | 76,976 |
Yes | output | 1 | 38,488 | 19 | 76,977 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Create a program that reads poker hand data and outputs the role for each. However, this issue follows the rules below.
* Poker is a competition with 5 playing cards.
* No more than 5 cards wit... | instruction | 0 | 38,489 | 19 | 76,978 |
No | output | 1 | 38,489 | 19 | 76,979 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Create a program that reads poker hand data and outputs the role for each. However, this issue follows the rules below.
* Poker is a competition with 5 playing cards.
* No more than 5 cards wit... | instruction | 0 | 38,490 | 19 | 76,980 |
No | output | 1 | 38,490 | 19 | 76,981 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Create a program that reads poker hand data and outputs the role for each. However, this issue follows the rules below.
* Poker is a competition with 5 playing cards.
* No more than 5 cards wit... | instruction | 0 | 38,491 | 19 | 76,982 |
No | output | 1 | 38,491 | 19 | 76,983 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.