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 written on it. He decided to find the longest subsequence of cards which satisfies the following conditions:
* the number of occurrences of each number from 1 to 8 in the subsequence doesn't differ by more then 1 from the number of occurrences of any other number. Formally, if there are ck cards with number k on them in the subsequence, than for all pairs of integers <image> the condition |ci - cj| ≤ 1 must hold.
* if there is at least one card with number x on it in the subsequence, then all cards with number x in this subsequence must form a continuous segment in it (but not necessarily a continuous segment in the original sequence). For example, the subsequence [1, 1, 2, 2] satisfies this condition while the subsequence [1, 2, 2, 1] doesn't. Note that [1, 1, 2, 2] doesn't satisfy the first condition.
Please help Vladik to find the length of the longest subsequence that satisfies both conditions.
Input
The first line contains single integer n (1 ≤ n ≤ 1000) — the number of cards in Vladik's sequence.
The second line contains the sequence of n positive integers not exceeding 8 — the description of Vladik's sequence.
Output
Print single integer — the length of the longest subsequence of Vladik's sequence that satisfies both conditions.
Examples
Input
3
1 1 1
Output
1
Input
8
8 7 6 5 4 3 2 1
Output
8
Input
24
1 8 1 2 8 2 3 8 3 4 8 4 5 8 5 6 8 6 7 8 7 8 8 8
Output
17
Note
In the first sample all the numbers written on the cards are equal, so you can't take more than one card, otherwise you'll violate the first condition.
Submitted Solution:
```
in1 = input()
in2 = input()
cards = in2.split(" ")
case = int(in1)
current = int(cards[0])
count = 1
dls = False
for i in range(0, len(cards), 1) :
if i == 0 :
continue
elif int(cards[i]) == current :
if int(cards[i-1]) == current:
if dls :
count = count + 1
dls = False
continue
else:
count = count + 1
continue
elif (int(cards[i]) == current + 1) or (int(cards[i]) == current - 1) :
count = count + 1
dls = True
current = int(cards[i])
print(count)
``` | 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 written on it. He decided to find the longest subsequence of cards which satisfies the following conditions:
* the number of occurrences of each number from 1 to 8 in the subsequence doesn't differ by more then 1 from the number of occurrences of any other number. Formally, if there are ck cards with number k on them in the subsequence, than for all pairs of integers <image> the condition |ci - cj| ≤ 1 must hold.
* if there is at least one card with number x on it in the subsequence, then all cards with number x in this subsequence must form a continuous segment in it (but not necessarily a continuous segment in the original sequence). For example, the subsequence [1, 1, 2, 2] satisfies this condition while the subsequence [1, 2, 2, 1] doesn't. Note that [1, 1, 2, 2] doesn't satisfy the first condition.
Please help Vladik to find the length of the longest subsequence that satisfies both conditions.
Input
The first line contains single integer n (1 ≤ n ≤ 1000) — the number of cards in Vladik's sequence.
The second line contains the sequence of n positive integers not exceeding 8 — the description of Vladik's sequence.
Output
Print single integer — the length of the longest subsequence of Vladik's sequence that satisfies both conditions.
Examples
Input
3
1 1 1
Output
1
Input
8
8 7 6 5 4 3 2 1
Output
8
Input
24
1 8 1 2 8 2 3 8 3 4 8 4 5 8 5 6 8 6 7 8 7 8 8 8
Output
17
Note
In the first sample all the numbers written on the cards are equal, so you can't take more than one card, otherwise you'll violate the first condition.
Submitted Solution:
```
a=int(input())
kol=[int(i)for i in input().split()]
ma=[0]*8
for i in range(len(kol)):
ma[kol[i]-1]+=1
c=min(ma)
ans=c*8
for i in range(8):
if ma[i]>c:
ans+=1
print(ans)
``` | 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 a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:
* Draw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.
The game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.
X will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?
Constraints
* All input values are integers.
* 1 \leq N \leq 2000
* 1 \leq Z, W, a_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N Z W
a_1 a_2 ... a_N
Output
Print the score.
Examples
Input
3 100 100
10 1000 100
Output
900
Input
3 100 1000
10 100 100
Output
900
Input
5 1 1
1 1 1 1 1
Output
0
Input
1 1 1
1000000000
Output
999999999 | 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] = max(abs(a[-1]-a[i-1]),max(dp1[i+1:]))
dp1[i] = min(abs(a[-1]-a[i-1]),min(dp0[i+1:]))
print(dp0[1])
#print(a)
#print(dp0)
#print(dp1)
``` | 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 a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:
* Draw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.
The game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.
X will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?
Constraints
* All input values are integers.
* 1 \leq N \leq 2000
* 1 \leq Z, W, a_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N Z W
a_1 a_2 ... a_N
Output
Print the score.
Examples
Input
3 100 100
10 1000 100
Output
900
Input
3 100 1000
10 100 100
Output
900
Input
5 1 1
1 1 1 1 1
Output
0
Input
1 1 1
1000000000
Output
999999999 | 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 a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:
* Draw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.
The game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.
X will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?
Constraints
* All input values are integers.
* 1 \leq N \leq 2000
* 1 \leq Z, W, a_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N Z W
a_1 a_2 ... a_N
Output
Print the score.
Examples
Input
3 100 100
10 1000 100
Output
900
Input
3 100 1000
10 100 100
Output
900
Input
5 1 1
1 1 1 1 1
Output
0
Input
1 1 1
1000000000
Output
999999999 | 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 a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:
* Draw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.
The game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.
X will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?
Constraints
* All input values are integers.
* 1 \leq N \leq 2000
* 1 \leq Z, W, a_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N Z W
a_1 a_2 ... a_N
Output
Print the score.
Examples
Input
3 100 100
10 1000 100
Output
900
Input
3 100 1000
10 100 100
Output
900
Input
5 1 1
1 1 1 1 1
Output
0
Input
1 1 1
1000000000
Output
999999999 | 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 a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:
* Draw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.
The game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.
X will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?
Constraints
* All input values are integers.
* 1 \leq N \leq 2000
* 1 \leq Z, W, a_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N Z W
a_1 a_2 ... a_N
Output
Print the score.
Examples
Input
3 100 100
10 1000 100
Output
900
Input
3 100 1000
10 100 100
Output
900
Input
5 1 1
1 1 1 1 1
Output
0
Input
1 1 1
1000000000
Output
999999999 | 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)]
if c == N:
return abs(x - y)
if f == 0:
ret = -float('inf')
for i in range(1, N - c + 1):
ret = max(ret, minmax(a[c+i-1], y, c+i, f^1))
else:
ret = float('inf')
for i in range(1, N - c + 1):
ret = min(ret, minmax(x, a[c+i-1], c+i, f^1))
d[(c, f)] = ret
return ret
print(minmax(Z, W, 0, 0))
``` | 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 a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:
* Draw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.
The game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.
X will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?
Constraints
* All input values are integers.
* 1 \leq N \leq 2000
* 1 \leq Z, W, a_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N Z W
a_1 a_2 ... a_N
Output
Print the score.
Examples
Input
3 100 100
10 1000 100
Output
900
Input
3 100 1000
10 100 100
Output
900
Input
5 1 1
1 1 1 1 1
Output
0
Input
1 1 1
1000000000
Output
999999999 | 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 a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:
* Draw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.
The game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.
X will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?
Constraints
* All input values are integers.
* 1 \leq N \leq 2000
* 1 \leq Z, W, a_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N Z W
a_1 a_2 ... a_N
Output
Print the score.
Examples
Input
3 100 100
10 1000 100
Output
900
Input
3 100 1000
10 100 100
Output
900
Input
5 1 1
1 1 1 1 1
Output
0
Input
1 1 1
1000000000
Output
999999999 | 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().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 [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10
#solve
def solve():
n, z, w = LI()
a = LI()
if n == 1:
print(abs(a[0] - w))
else:
print(max(abs(a[-1] - w), abs(a[-2] - a[-1])))
return
#main
if __name__ == '__main__':
solve()
``` | 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 a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:
* Draw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.
The game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.
X will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?
Constraints
* All input values are integers.
* 1 \leq N \leq 2000
* 1 \leq Z, W, a_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N Z W
a_1 a_2 ... a_N
Output
Print the score.
Examples
Input
3 100 100
10 1000 100
Output
900
Input
3 100 1000
10 100 100
Output
900
Input
5 1 1
1 1 1 1 1
Output
0
Input
1 1 1
1000000000
Output
999999999 | 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 has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:
* Draw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.
The game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.
X will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?
Constraints
* All input values are integers.
* 1 \leq N \leq 2000
* 1 \leq Z, W, a_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N Z W
a_1 a_2 ... a_N
Output
Print the score.
Examples
Input
3 100 100
10 1000 100
Output
900
Input
3 100 1000
10 100 100
Output
900
Input
5 1 1
1 1 1 1 1
Output
0
Input
1 1 1
1000000000
Output
999999999
Submitted Solution:
```
n, x0, y0 = list(map(int, input().split()))
cards = [y0] + list(map(int, input().split()))
# yの手持ちはゲームに関与するため、リストに加えてしまう
xs = [[-1] * (n+1) for i in range(n+1)]
ys = [[-1] * (n+1) for i in range(n+1)]
#xs[i][j] = xの手番で、xがcards[i]を持ちyがcards[j]を持っているとき(i<j)の最善スコア
#ys[i][j] = yの手番で、xがcards[j]を持ちyがcards[i]を持っているとき(i<j)の最善スコア
for i in range(n+1):
xs[i][-1] = abs(cards[-1] - cards[i])
ys[i][-1] = abs(cards[-1] - cards[i])
for j in range(n-1, -1, -1):
# x[i][j] = max (y[j][j+1] , y[j][j+2] , ……, y[j][n] )
xs_temp = max(ys[j][j+1:n+1])
ys_temp = min(xs[j][j+1:n+1])
for i in range(0, j):
xs[i][j] = xs_temp
ys[i][j] = ys_temp
# print(xs)
# print(ys)
print(max(ys[0][1:]))
``` | 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 has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:
* Draw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.
The game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.
X will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?
Constraints
* All input values are integers.
* 1 \leq N \leq 2000
* 1 \leq Z, W, a_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N Z W
a_1 a_2 ... a_N
Output
Print the score.
Examples
Input
3 100 100
10 1000 100
Output
900
Input
3 100 1000
10 100 100
Output
900
Input
5 1 1
1 1 1 1 1
Output
0
Input
1 1 1
1000000000
Output
999999999
Submitted Solution:
```
n, z, w = map(int, input().split())
a = list(map(int, input().split()))
dp = [[0]*2 for _ in range(n)]
for i in range(n-1, -1, -1):
dp[i][0] = abs((a[i-1] if i > 0 else w) - a[n-1])
dp[i][1] = abs((a[i-1] if i > 0 else z) - a[n-1])
for j in range(i+1, n):
dp[i][0] = max(dp[i][0], dp[j][1])
dp[i][1] = min(dp[i][1], dp[j][0])
print(dp[0][0])
``` | 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 has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:
* Draw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.
The game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.
X will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?
Constraints
* All input values are integers.
* 1 \leq N \leq 2000
* 1 \leq Z, W, a_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N Z W
a_1 a_2 ... a_N
Output
Print the score.
Examples
Input
3 100 100
10 1000 100
Output
900
Input
3 100 1000
10 100 100
Output
900
Input
5 1 1
1 1 1 1 1
Output
0
Input
1 1 1
1000000000
Output
999999999
Submitted Solution:
```
n,z,w = map(int,input().split())
a = tuple(map(int,input().split()))
res = abs(a[-1]-w)
for i in range(n-1):
cand = abs(a[-1]-a[i])
for j in range(i+1,n-1):
cand = min(a[j]-a[-1],cand)
res = max(res,cand)
print(res)
``` | 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 has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:
* Draw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.
The game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.
X will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?
Constraints
* All input values are integers.
* 1 \leq N \leq 2000
* 1 \leq Z, W, a_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N Z W
a_1 a_2 ... a_N
Output
Print the score.
Examples
Input
3 100 100
10 1000 100
Output
900
Input
3 100 1000
10 100 100
Output
900
Input
5 1 1
1 1 1 1 1
Output
0
Input
1 1 1
1000000000
Output
999999999
Submitted Solution:
```
N,Z,W=map(int,input().split())
A=list(map(int,input().split()))
print(max(abs(A[N-1]-W),abs(A[N-1]-A[N-2])))
``` | 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 has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:
* Draw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.
The game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.
X will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?
Constraints
* All input values are integers.
* 1 \leq N \leq 2000
* 1 \leq Z, W, a_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N Z W
a_1 a_2 ... a_N
Output
Print the score.
Examples
Input
3 100 100
10 1000 100
Output
900
Input
3 100 1000
10 100 100
Output
900
Input
5 1 1
1 1 1 1 1
Output
0
Input
1 1 1
1000000000
Output
999999999
Submitted Solution:
```
N,Z,W = map(int,input().split())
A = list(map(int,input().split()))
abs_last = [abs(A[i]-A[N-1])for i in range(N)]
max_abs_last = max(abs_last)
if max_abs_last >= abs(A[-1]-W):
print(max_abs_last)
else:
print(abs(A[-1]-W))
``` | 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 has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:
* Draw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.
The game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.
X will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?
Constraints
* All input values are integers.
* 1 \leq N \leq 2000
* 1 \leq Z, W, a_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N Z W
a_1 a_2 ... a_N
Output
Print the score.
Examples
Input
3 100 100
10 1000 100
Output
900
Input
3 100 1000
10 100 100
Output
900
Input
5 1 1
1 1 1 1 1
Output
0
Input
1 1 1
1000000000
Output
999999999
Submitted Solution:
```
x_list = []
y_list = []
n,z,w = map(int, input().split())
x_list.append(z)
y_list.append(w)
a = list(map(int, input().split()))
y_flg = False
for i in range(len(a)):
if y_flg is False and x_list[0] < a[i]:
x_list.append(a[i])
y_flg = True
continue
if y_flg is True and y_list[0] > a[i]:
y_list.append(a[i])
y_flg = False
x_max = max(x_list)
y_max = min(y_list)
print(abs(x_max - y_max))
``` | 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 has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:
* Draw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.
The game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.
X will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?
Constraints
* All input values are integers.
* 1 \leq N \leq 2000
* 1 \leq Z, W, a_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N Z W
a_1 a_2 ... a_N
Output
Print the score.
Examples
Input
3 100 100
10 1000 100
Output
900
Input
3 100 1000
10 100 100
Output
900
Input
5 1 1
1 1 1 1 1
Output
0
Input
1 1 1
1000000000
Output
999999999
Submitted Solution:
```
n, _, y = map(int, input().split())
a = list(map(int, input().split()))
a = [y] + a
memo = [[-1 for i in range(n + 1)] for j in range(2)]
def sol(i, turn):
# ovaj drugi ima a[i]
if memo[turn][i] != -1:
return memo[turn][i]
best = abs(a[i] - a[n])
for j in range(i + 1, n):
pot = sol(j, 1 - turn)
if turn == 0:
best = max(best, pot)
else:
best = min(best, pot)
memo[turn][i] = best
return best
print(sol(0, 0))
``` | 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 has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:
* Draw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.
The game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.
X will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?
Constraints
* All input values are integers.
* 1 \leq N \leq 2000
* 1 \leq Z, W, a_i \leq 10^9
Input
Input is given from Standard Input in the following format:
N Z W
a_1 a_2 ... a_N
Output
Print the score.
Examples
Input
3 100 100
10 1000 100
Output
900
Input
3 100 1000
10 100 100
Output
900
Input
5 1 1
1 1 1 1 1
Output
0
Input
1 1 1
1000000000
Output
999999999
Submitted Solution:
```
N, Z, W = map(int, input().split())
a = list(map(int, input().split()))
ans = max(abs(Z-W), abs(a[N-1]-W))
if N > 1:
ans = max(ans,abs(a[N-2]-a[N-1]))
print(ans)
``` | 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 7, the invisible faces are 5 on the north side, 4 on the west side, and 6 on the bottom side, respectively.
From this initial arrangement, move the dice according to the instructions. However, the instruction is to perform the following six operations several times.
<image> | <image> | <image> | <image>
--- | --- | --- | ---
<image> | <image> | |
The North, East, South, and West operations rotate the dice 90 degrees in the indicated direction. The two operations, Right and Left, rotate 90 degrees horizontally while keeping the upper and lower surfaces unchanged. (Be careful of the direction of rotation.)
The initial value is the number of eyes 1 that appears on the upper surface in the initial arrangement, and after each operation, the number of eyes that appear on the upper surface is added, and all operations are completed according to the instructions. Create a program that outputs the total value of the above.
The first line of the input file contains the total number of instructions n, and each of the following n lines contains one of the "North, East, South, West, Right, Left" instructions. Let. However, n ≤ 10000.
Input example 1 | Input example 2
--- | ---
5 | 8
North | West
North | North
East | Left
South | South
West | Right
| North
| Left
| East
Output example 1 | Output example 2
21 | 34
input
The input consists of multiple datasets. Input ends when n is 0. The number of datasets does not exceed 5.
output
The total value is output to one line for each data set.
Example
Input
5
North
North
East
South
West
8
West
North
Left
South
Right
North
Left
East
0
Output
21
34 | 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]
ret = 1
for _ in range(n):
xi = [xi[i] for i in ope[f.readline().strip()]]
ret += xi[0]
print(ret)
``` | 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 7, the invisible faces are 5 on the north side, 4 on the west side, and 6 on the bottom side, respectively.
From this initial arrangement, move the dice according to the instructions. However, the instruction is to perform the following six operations several times.
<image> | <image> | <image> | <image>
--- | --- | --- | ---
<image> | <image> | |
The North, East, South, and West operations rotate the dice 90 degrees in the indicated direction. The two operations, Right and Left, rotate 90 degrees horizontally while keeping the upper and lower surfaces unchanged. (Be careful of the direction of rotation.)
The initial value is the number of eyes 1 that appears on the upper surface in the initial arrangement, and after each operation, the number of eyes that appear on the upper surface is added, and all operations are completed according to the instructions. Create a program that outputs the total value of the above.
The first line of the input file contains the total number of instructions n, and each of the following n lines contains one of the "North, East, South, West, Right, Left" instructions. Let. However, n ≤ 10000.
Input example 1 | Input example 2
--- | ---
5 | 8
North | West
North | North
East | Left
South | South
West | Right
| North
| Left
| East
Output example 1 | Output example 2
21 | 34
input
The input consists of multiple datasets. Input ends when n is 0. The number of datasets does not exceed 5.
output
The total value is output to one line for each data set.
Example
Input
5
North
North
East
South
West
8
West
North
Left
South
Right
North
Left
East
0
Output
21
34 | 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 = [_dice[int(j)] for j in roll[input().strip()]]
cnt+=_dice[0]
print(cnt)
``` | 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 7, the invisible faces are 5 on the north side, 4 on the west side, and 6 on the bottom side, respectively.
From this initial arrangement, move the dice according to the instructions. However, the instruction is to perform the following six operations several times.
<image> | <image> | <image> | <image>
--- | --- | --- | ---
<image> | <image> | |
The North, East, South, and West operations rotate the dice 90 degrees in the indicated direction. The two operations, Right and Left, rotate 90 degrees horizontally while keeping the upper and lower surfaces unchanged. (Be careful of the direction of rotation.)
The initial value is the number of eyes 1 that appears on the upper surface in the initial arrangement, and after each operation, the number of eyes that appear on the upper surface is added, and all operations are completed according to the instructions. Create a program that outputs the total value of the above.
The first line of the input file contains the total number of instructions n, and each of the following n lines contains one of the "North, East, South, West, Right, Left" instructions. Let. However, n ≤ 10000.
Input example 1 | Input example 2
--- | ---
5 | 8
North | West
North | North
East | Left
South | South
West | Right
| North
| Left
| East
Output example 1 | Output example 2
21 | 34
input
The input consists of multiple datasets. Input ends when n is 0. The number of datasets does not exceed 5.
output
The total value is output to one line for each data set.
Example
Input
5
North
North
East
South
West
8
West
North
Left
South
Right
North
Left
East
0
Output
21
34 | 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]
elif m == M[2]:
D[0],D[2] = D[2],7-D[0]
elif m == M[3]:
D[0],D[1] = 7-D[1],D[0]
elif m == M[4]:
D[1],D[2] = D[2],7-D[1]
else:
D[1],D[2] = 7-D[2],D[1]
s += D[0]
print (s)
``` | 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 7, the invisible faces are 5 on the north side, 4 on the west side, and 6 on the bottom side, respectively.
From this initial arrangement, move the dice according to the instructions. However, the instruction is to perform the following six operations several times.
<image> | <image> | <image> | <image>
--- | --- | --- | ---
<image> | <image> | |
The North, East, South, and West operations rotate the dice 90 degrees in the indicated direction. The two operations, Right and Left, rotate 90 degrees horizontally while keeping the upper and lower surfaces unchanged. (Be careful of the direction of rotation.)
The initial value is the number of eyes 1 that appears on the upper surface in the initial arrangement, and after each operation, the number of eyes that appear on the upper surface is added, and all operations are completed according to the instructions. Create a program that outputs the total value of the above.
The first line of the input file contains the total number of instructions n, and each of the following n lines contains one of the "North, East, South, West, Right, Left" instructions. Let. However, n ≤ 10000.
Input example 1 | Input example 2
--- | ---
5 | 8
North | West
North | North
East | Left
South | South
West | Right
| North
| Left
| East
Output example 1 | Output example 2
21 | 34
input
The input consists of multiple datasets. Input ends when n is 0. The number of datasets does not exceed 5.
output
The total value is output to one line for each data set.
Example
Input
5
North
North
East
South
West
8
West
North
Left
South
Right
North
Left
East
0
Output
21
34 | 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[1]] + [7-d[0]]
return d
def Right(d):
d = [d[0]] + [d[2]] + [7-d[1]]
return d
def Left(d):
d = [d[0]] + [7-d[2]] + [d[1]]
return d
while True:
n = int(f.readline())
if n == 0:
break
dice = [1,2,3]
result = 1
for _ in range(n):
direction = f.readline().rstrip()
#print(direction)
if direction == 'North':
dice = North(dice)
if direction == 'East':
dice = East(dice)
if direction == 'South':
dice = South(dice)
if direction == 'West':
dice = West(dice)
if direction == 'Right':
dice = Right(dice)
if direction == 'Left':
dice = Left(dice)
#dice = eval(direction+"(dice)")
#print(dice)
result += dice[0]
print(result)
``` | 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 7, the invisible faces are 5 on the north side, 4 on the west side, and 6 on the bottom side, respectively.
From this initial arrangement, move the dice according to the instructions. However, the instruction is to perform the following six operations several times.
<image> | <image> | <image> | <image>
--- | --- | --- | ---
<image> | <image> | |
The North, East, South, and West operations rotate the dice 90 degrees in the indicated direction. The two operations, Right and Left, rotate 90 degrees horizontally while keeping the upper and lower surfaces unchanged. (Be careful of the direction of rotation.)
The initial value is the number of eyes 1 that appears on the upper surface in the initial arrangement, and after each operation, the number of eyes that appear on the upper surface is added, and all operations are completed according to the instructions. Create a program that outputs the total value of the above.
The first line of the input file contains the total number of instructions n, and each of the following n lines contains one of the "North, East, South, West, Right, Left" instructions. Let. However, n ≤ 10000.
Input example 1 | Input example 2
--- | ---
5 | 8
North | West
North | North
East | Left
South | South
West | Right
| North
| Left
| East
Output example 1 | Output example 2
21 | 34
input
The input consists of multiple datasets. Input ends when n is 0. The number of datasets does not exceed 5.
output
The total value is output to one line for each data set.
Example
Input
5
North
North
East
South
West
8
West
North
Left
South
Right
North
Left
East
0
Output
21
34 | 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], s[B] = s[F], s[D], s[B], s[U]
elif op == "South":
s[U], s[F], s[D], s[B] = s[B], s[U], s[F], s[D]
elif op == "West":
s[U], s[R], s[D], s[L] = s[R], s[D], s[L], s[U]
elif op == "East":
s[U], s[R], s[D], s[L] = s[L], s[U], s[R], s[D]
elif op == "Right":
s[F], s[R], s[B], s[L] = s[R], s[B], s[L], s[F]
elif op == "Left":
s[F], s[R], s[B], s[L] = s[L], s[F], s[R], s[B]
else:
assert False
result += s[U]
print(result)
``` | 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 7, the invisible faces are 5 on the north side, 4 on the west side, and 6 on the bottom side, respectively.
From this initial arrangement, move the dice according to the instructions. However, the instruction is to perform the following six operations several times.
<image> | <image> | <image> | <image>
--- | --- | --- | ---
<image> | <image> | |
The North, East, South, and West operations rotate the dice 90 degrees in the indicated direction. The two operations, Right and Left, rotate 90 degrees horizontally while keeping the upper and lower surfaces unchanged. (Be careful of the direction of rotation.)
The initial value is the number of eyes 1 that appears on the upper surface in the initial arrangement, and after each operation, the number of eyes that appear on the upper surface is added, and all operations are completed according to the instructions. Create a program that outputs the total value of the above.
The first line of the input file contains the total number of instructions n, and each of the following n lines contains one of the "North, East, South, West, Right, Left" instructions. Let. However, n ≤ 10000.
Input example 1 | Input example 2
--- | ---
5 | 8
North | West
North | North
East | Left
South | South
West | Right
| North
| Left
| East
Output example 1 | Output example 2
21 | 34
input
The input consists of multiple datasets. Input ends when n is 0. The number of datasets does not exceed 5.
output
The total value is output to one line for each data set.
Example
Input
5
North
North
East
South
West
8
West
North
Left
South
Right
North
Left
East
0
Output
21
34 | 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,self.bottom
elif operation == "East":
self.top,self.east,self.bottom,self.west = self.west,self.top,self.east,self.bottom
elif operation == "West":
self.top,self.east,self.bottom,self.west = self.east,self.bottom,self.west,self.top
elif operation == "South":
self.top,self.north,self.bottom,self.south = self.north,self.bottom,self.south,self.top
elif operation == "Right":
self.north,self.east,self.south,self.west = self.west,self.north,self.east,self.south
elif operation == "Left":
self.north,self.east,self.south,self.west = self.east,self.south,self.west,self.north,
n = int(input())
while n!=0:
inputs = [input() for _ in range(n)]
value = 1
d = Dice()
for i in inputs:
d.rotate(i)
value += d.top
print(value)
n = int(input())
``` | 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 7, the invisible faces are 5 on the north side, 4 on the west side, and 6 on the bottom side, respectively.
From this initial arrangement, move the dice according to the instructions. However, the instruction is to perform the following six operations several times.
<image> | <image> | <image> | <image>
--- | --- | --- | ---
<image> | <image> | |
The North, East, South, and West operations rotate the dice 90 degrees in the indicated direction. The two operations, Right and Left, rotate 90 degrees horizontally while keeping the upper and lower surfaces unchanged. (Be careful of the direction of rotation.)
The initial value is the number of eyes 1 that appears on the upper surface in the initial arrangement, and after each operation, the number of eyes that appear on the upper surface is added, and all operations are completed according to the instructions. Create a program that outputs the total value of the above.
The first line of the input file contains the total number of instructions n, and each of the following n lines contains one of the "North, East, South, West, Right, Left" instructions. Let. However, n ≤ 10000.
Input example 1 | Input example 2
--- | ---
5 | 8
North | West
North | North
East | Left
South | South
West | Right
| North
| Left
| East
Output example 1 | Output example 2
21 | 34
input
The input consists of multiple datasets. Input ends when n is 0. The number of datasets does not exceed 5.
output
The total value is output to one line for each data set.
Example
Input
5
North
North
East
South
West
8
West
North
Left
South
Right
North
Left
East
0
Output
21
34 | 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
elif (w == "East"):
tmp = ufr["r"]
ufr["r"] = ufr["u"]
ufr["u"] = 7-tmp
elif (w == "West"):
tmp = ufr["u"]
ufr["u"] = ufr["r"]
ufr["r"] = 7-tmp
elif (w=="South"):
tmp = ufr["f"]
ufr["f"] = ufr["u"]
ufr["u"] = 7-tmp
elif (w=="Right"):
tmp = ufr["f"]
ufr["f"] = ufr["r"]
ufr["r"] = 7-tmp
else:
tmp = ufr["r"]
ufr["r"] = ufr["f"]
ufr["f"] = 7-tmp
up += ufr["u"]
print(up)
n=int(input())
``` | 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 7, the invisible faces are 5 on the north side, 4 on the west side, and 6 on the bottom side, respectively.
From this initial arrangement, move the dice according to the instructions. However, the instruction is to perform the following six operations several times.
<image> | <image> | <image> | <image>
--- | --- | --- | ---
<image> | <image> | |
The North, East, South, and West operations rotate the dice 90 degrees in the indicated direction. The two operations, Right and Left, rotate 90 degrees horizontally while keeping the upper and lower surfaces unchanged. (Be careful of the direction of rotation.)
The initial value is the number of eyes 1 that appears on the upper surface in the initial arrangement, and after each operation, the number of eyes that appear on the upper surface is added, and all operations are completed according to the instructions. Create a program that outputs the total value of the above.
The first line of the input file contains the total number of instructions n, and each of the following n lines contains one of the "North, East, South, West, Right, Left" instructions. Let. However, n ≤ 10000.
Input example 1 | Input example 2
--- | ---
5 | 8
North | West
North | North
East | Left
South | South
West | Right
| North
| Left
| East
Output example 1 | Output example 2
21 | 34
input
The input consists of multiple datasets. Input ends when n is 0. The number of datasets does not exceed 5.
output
The total value is output to one line for each data set.
Example
Input
5
North
North
East
South
West
8
West
North
Left
South
Right
North
Left
East
0
Output
21
34 | 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(dice[4])
ret.append(dice[2])
ret.append(dice[1])
ret.append(dice[6])
ret.append(dice[5])
ret.append(dice[3])
dice = ret.copy()
def west():
ret = [0]
global dice
ret.append(dice[3])
ret.append(dice[2])
ret.append(dice[6])
ret.append(dice[1])
ret.append(dice[5])
ret.append(dice[4])
dice = ret.copy()
def south():
ret = [0]
global dice
ret.append(dice[5])
ret.append(dice[1])
ret.append(dice[3])
ret.append(dice[4])
ret.append(dice[6])
ret.append(dice[2])
dice = ret.copy()
def right():
ret = [0]
global dice
ret.append(dice[1])
ret.append(dice[3])
ret.append(dice[5])
ret.append(dice[2])
ret.append(dice[4])
ret.append(dice[6])
dice = ret.copy()
def left():
ret = [0]
global dice
ret.append(dice[1])
ret.append(dice[4])
ret.append(dice[2])
ret.append(dice[5])
ret.append(dice[3])
ret.append(dice[6])
dice = ret.copy()
total_score = 1
while True:
n = int(input())
if n == 0:
break
for i in range(n):
input_str = input()
if input_str == 'North':
north()
elif input_str == 'East':
east()
elif input_str == 'West':
west()
elif input_str == 'South':
south()
elif input_str == 'Right':
right()
else:
left()
total_score += dice[1]
print(total_score)
total_score = 1
dice = [i for i in range(0, 7)]
``` | 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. Since the sum of the facing faces of the dice is always 7, the invisible faces are 5 on the north side, 4 on the west side, and 6 on the bottom side, respectively.
From this initial arrangement, move the dice according to the instructions. However, the instruction is to perform the following six operations several times.
<image> | <image> | <image> | <image>
--- | --- | --- | ---
<image> | <image> | |
The North, East, South, and West operations rotate the dice 90 degrees in the indicated direction. The two operations, Right and Left, rotate 90 degrees horizontally while keeping the upper and lower surfaces unchanged. (Be careful of the direction of rotation.)
The initial value is the number of eyes 1 that appears on the upper surface in the initial arrangement, and after each operation, the number of eyes that appear on the upper surface is added, and all operations are completed according to the instructions. Create a program that outputs the total value of the above.
The first line of the input file contains the total number of instructions n, and each of the following n lines contains one of the "North, East, South, West, Right, Left" instructions. Let. However, n ≤ 10000.
Input example 1 | Input example 2
--- | ---
5 | 8
North | West
North | North
East | Left
South | South
West | Right
| North
| Left
| East
Output example 1 | Output example 2
21 | 34
input
The input consists of multiple datasets. Input ends when n is 0. The number of datasets does not exceed 5.
output
The total value is output to one line for each data set.
Example
Input
5
North
North
East
South
West
8
West
North
Left
South
Right
North
Left
East
0
Output
21
34
Submitted Solution:
```
# AOJ 0502: Dice
# Python3 2018.6.29 bal4u
d = { "North":1, "East":2, "West":3, "South":4, "Right":5, "Left":6 }
rot = ((0,1,2,3,4,5,6),(0,2,6,3,4,1,5),(0,4,2,1,6,5,3),(0,3,2,6,1,5,4), \
(0,5,1,3,4,6,2),(0,1,3,5,2,4,6),(0,1,4,2,5,3,6))
import sys
while True:
n = int(input())
if n == 0: break
dice = [[j for j in range(7)] for i in range(2)]
ans = 1
for i in range(n):
x = input()
if x not in d: sys.exit()
j = d[x]
for k in range(1, 7): dice[1-(i&1)][k] = dice[i&1][rot[j][k]]
ans += dice[1-(i&1)][1]
print(ans)
``` | 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 either `H` or `D`, and carries the following information:
If a=`H`, AtCoDeer is honest; if a=`D`, AtCoDeer is dishonest. If b=`H`, AtCoDeer is saying that TopCoDeer is honest; if b=`D`, AtCoDeer is saying that TopCoDeer is dishonest.
Given this information, determine whether TopCoDeer is honest.
Constraints
* a=`H` or a=`D`.
* b=`H` or b=`D`.
Input
The input is given from Standard Input in the following format:
a b
Output
If TopCoDeer is honest, print `H`. If he is dishonest, print `D`.
Examples
Input
H H
Output
H
Input
D H
Output
D
Input
D D
Output
H | 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 either `H` or `D`, and carries the following information:
If a=`H`, AtCoDeer is honest; if a=`D`, AtCoDeer is dishonest. If b=`H`, AtCoDeer is saying that TopCoDeer is honest; if b=`D`, AtCoDeer is saying that TopCoDeer is dishonest.
Given this information, determine whether TopCoDeer is honest.
Constraints
* a=`H` or a=`D`.
* b=`H` or b=`D`.
Input
The input is given from Standard Input in the following format:
a b
Output
If TopCoDeer is honest, print `H`. If he is dishonest, print `D`.
Examples
Input
H H
Output
H
Input
D H
Output
D
Input
D D
Output
H | 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 either `H` or `D`, and carries the following information:
If a=`H`, AtCoDeer is honest; if a=`D`, AtCoDeer is dishonest. If b=`H`, AtCoDeer is saying that TopCoDeer is honest; if b=`D`, AtCoDeer is saying that TopCoDeer is dishonest.
Given this information, determine whether TopCoDeer is honest.
Constraints
* a=`H` or a=`D`.
* b=`H` or b=`D`.
Input
The input is given from Standard Input in the following format:
a b
Output
If TopCoDeer is honest, print `H`. If he is dishonest, print `D`.
Examples
Input
H H
Output
H
Input
D H
Output
D
Input
D D
Output
H | 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 either `H` or `D`, and carries the following information:
If a=`H`, AtCoDeer is honest; if a=`D`, AtCoDeer is dishonest. If b=`H`, AtCoDeer is saying that TopCoDeer is honest; if b=`D`, AtCoDeer is saying that TopCoDeer is dishonest.
Given this information, determine whether TopCoDeer is honest.
Constraints
* a=`H` or a=`D`.
* b=`H` or b=`D`.
Input
The input is given from Standard Input in the following format:
a b
Output
If TopCoDeer is honest, print `H`. If he is dishonest, print `D`.
Examples
Input
H H
Output
H
Input
D H
Output
D
Input
D D
Output
H | 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 either `H` or `D`, and carries the following information:
If a=`H`, AtCoDeer is honest; if a=`D`, AtCoDeer is dishonest. If b=`H`, AtCoDeer is saying that TopCoDeer is honest; if b=`D`, AtCoDeer is saying that TopCoDeer is dishonest.
Given this information, determine whether TopCoDeer is honest.
Constraints
* a=`H` or a=`D`.
* b=`H` or b=`D`.
Input
The input is given from Standard Input in the following format:
a b
Output
If TopCoDeer is honest, print `H`. If he is dishonest, print `D`.
Examples
Input
H H
Output
H
Input
D H
Output
D
Input
D D
Output
H | 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 either `H` or `D`, and carries the following information:
If a=`H`, AtCoDeer is honest; if a=`D`, AtCoDeer is dishonest. If b=`H`, AtCoDeer is saying that TopCoDeer is honest; if b=`D`, AtCoDeer is saying that TopCoDeer is dishonest.
Given this information, determine whether TopCoDeer is honest.
Constraints
* a=`H` or a=`D`.
* b=`H` or b=`D`.
Input
The input is given from Standard Input in the following format:
a b
Output
If TopCoDeer is honest, print `H`. If he is dishonest, print `D`.
Examples
Input
H H
Output
H
Input
D H
Output
D
Input
D D
Output
H | 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 either `H` or `D`, and carries the following information:
If a=`H`, AtCoDeer is honest; if a=`D`, AtCoDeer is dishonest. If b=`H`, AtCoDeer is saying that TopCoDeer is honest; if b=`D`, AtCoDeer is saying that TopCoDeer is dishonest.
Given this information, determine whether TopCoDeer is honest.
Constraints
* a=`H` or a=`D`.
* b=`H` or b=`D`.
Input
The input is given from Standard Input in the following format:
a b
Output
If TopCoDeer is honest, print `H`. If he is dishonest, print `D`.
Examples
Input
H H
Output
H
Input
D H
Output
D
Input
D D
Output
H | 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 either `H` or `D`, and carries the following information:
If a=`H`, AtCoDeer is honest; if a=`D`, AtCoDeer is dishonest. If b=`H`, AtCoDeer is saying that TopCoDeer is honest; if b=`D`, AtCoDeer is saying that TopCoDeer is dishonest.
Given this information, determine whether TopCoDeer is honest.
Constraints
* a=`H` or a=`D`.
* b=`H` or b=`D`.
Input
The input is given from Standard Input in the following format:
a b
Output
If TopCoDeer is honest, print `H`. If he is dishonest, print `D`.
Examples
Input
H H
Output
H
Input
D H
Output
D
Input
D D
Output
H | 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 only consider the following poker roles: (The higher the number, the higher the role.)
1. No role (does not apply to any of the following)
2. One pair (two cards with the same number)
3. Two pairs (two pairs of cards with the same number)
4. Three cards (one set of three cards with the same number)
5. Straight (the numbers on 5 cards are consecutive)
However, in the case of a straight containing A, the sequence ending with A is also straight. In other words, there are two types of straights containing A: A 2 3 4 5 and 10 J Q K A. Lines that straddle A, such as J Q K A 2, are not straight. (In this case, it will be "no role").
6. Full House (one set of three cards with the same number and the other two cards with the same number)
7. Four Cards (one set of four cards with the same number)
Input
The input consists of multiple datasets. Each dataset is given in the following format:
Hand 1, Hand 2, Hand 3, Hand 4, Hand 5
In your hand, Trump's J (jack) is 11, Q (queen) is 12, K (king) is 13, A (ace) is 1, and the others are represented by their respective numbers.
The number of datasets does not exceed 50.
Output
For each dataset, output one of the highest roles you can play in your hand. Follow the output example for the notation of the role.
Example
Input
1,2,3,4,1
2,3,2,3,12
12,13,11,12,12
7,6,7,6,7
3,3,2,3,3
6,7,8,9,10
11,12,10,1,13
11,12,13,1,2
Output
one pair
two pair
three card
full house
four card
straight
straight
null | 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):
""" ???????????????????????????????????????????????????
????????????????????\??????????????????????????????????????§?????????????????\???????????¬????????????????????\???????????????????????¬????????????????????\?????±????????????
- null
- one pair
- two pair
- three card
- straight
- full house
- four card
"""
if (self.cards[0] == self.cards[1]+1 == self.cards[2]+2 == self.cards[3]+3 == self.cards[4]+4) or \
(self.cards[0] == 13 and self.cards[1] == 12 and self.cards[2] == 11 and self.cards[3] == 10 and self.cards[4] ==1):
return 'straight'
else:
c = Counter(self.cards)
hand = c.most_common() # ????????°?????????????????°????????????????????????(???: ????????????)?????????????????????????????????
if hand[0][1] == 4:
return 'four card'
elif hand[0][1] == 3 and hand[1][1] == 2:
return 'full house'
elif hand[0][1] == 3:
return 'three card'
elif hand[0][1] == 2 and hand[1][1] == 2:
return 'two pair'
elif hand[0][1] == 2:
return 'one pair'
else:
return 'null'
if __name__ == '__main__':
# ??????????????\???
for line in sys.stdin:
cards = [int(x) for x in line.strip().split(',')]
# ??????????????????
p1 = Poker(cards)
result = p1.evaluate_hand()
# ???????????¨???
print(result)
``` | 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 only consider the following poker roles: (The higher the number, the higher the role.)
1. No role (does not apply to any of the following)
2. One pair (two cards with the same number)
3. Two pairs (two pairs of cards with the same number)
4. Three cards (one set of three cards with the same number)
5. Straight (the numbers on 5 cards are consecutive)
However, in the case of a straight containing A, the sequence ending with A is also straight. In other words, there are two types of straights containing A: A 2 3 4 5 and 10 J Q K A. Lines that straddle A, such as J Q K A 2, are not straight. (In this case, it will be "no role").
6. Full House (one set of three cards with the same number and the other two cards with the same number)
7. Four Cards (one set of four cards with the same number)
Input
The input consists of multiple datasets. Each dataset is given in the following format:
Hand 1, Hand 2, Hand 3, Hand 4, Hand 5
In your hand, Trump's J (jack) is 11, Q (queen) is 12, K (king) is 13, A (ace) is 1, and the others are represented by their respective numbers.
The number of datasets does not exceed 50.
Output
For each dataset, output one of the highest roles you can play in your hand. Follow the output example for the notation of the role.
Example
Input
1,2,3,4,1
2,3,2,3,12
12,13,11,12,12
7,6,7,6,7
3,3,2,3,3
6,7,8,9,10
11,12,10,1,13
11,12,13,1,2
Output
one pair
two pair
three card
full house
four card
straight
straight
null | 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:
print("full house")
elif 4 in pairs:
print("four card")
elif 3 in pairs and 2 in pairs:
print("full house")
elif 3 in pairs:
print("three card")
elif pairs.count(2) == 2:
print("two pair")
elif 2 in pairs:
print("one pair")
elif [a[i+1] - a[i] for i in range(4)] == [1 for i in range(4)] or a == [1,10,11,12,13]:
print("straight")
else:
print("null")
except EOFError:
break
``` | 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 only consider the following poker roles: (The higher the number, the higher the role.)
1. No role (does not apply to any of the following)
2. One pair (two cards with the same number)
3. Two pairs (two pairs of cards with the same number)
4. Three cards (one set of three cards with the same number)
5. Straight (the numbers on 5 cards are consecutive)
However, in the case of a straight containing A, the sequence ending with A is also straight. In other words, there are two types of straights containing A: A 2 3 4 5 and 10 J Q K A. Lines that straddle A, such as J Q K A 2, are not straight. (In this case, it will be "no role").
6. Full House (one set of three cards with the same number and the other two cards with the same number)
7. Four Cards (one set of four cards with the same number)
Input
The input consists of multiple datasets. Each dataset is given in the following format:
Hand 1, Hand 2, Hand 3, Hand 4, Hand 5
In your hand, Trump's J (jack) is 11, Q (queen) is 12, K (king) is 13, A (ace) is 1, and the others are represented by their respective numbers.
The number of datasets does not exceed 50.
Output
For each dataset, output one of the highest roles you can play in your hand. Follow the output example for the notation of the role.
Example
Input
1,2,3,4,1
2,3,2,3,12
12,13,11,12,12
7,6,7,6,7
3,3,2,3,3
6,7,8,9,10
11,12,10,1,13
11,12,13,1,2
Output
one pair
two pair
three card
full house
four card
straight
straight
null | 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 == 7:
print('one pair')
elif max(l)-min(l)==4 or (l[1] == 10 and l[0]==1):
print('straight')
else:
print('null')
``` | 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 only consider the following poker roles: (The higher the number, the higher the role.)
1. No role (does not apply to any of the following)
2. One pair (two cards with the same number)
3. Two pairs (two pairs of cards with the same number)
4. Three cards (one set of three cards with the same number)
5. Straight (the numbers on 5 cards are consecutive)
However, in the case of a straight containing A, the sequence ending with A is also straight. In other words, there are two types of straights containing A: A 2 3 4 5 and 10 J Q K A. Lines that straddle A, such as J Q K A 2, are not straight. (In this case, it will be "no role").
6. Full House (one set of three cards with the same number and the other two cards with the same number)
7. Four Cards (one set of four cards with the same number)
Input
The input consists of multiple datasets. Each dataset is given in the following format:
Hand 1, Hand 2, Hand 3, Hand 4, Hand 5
In your hand, Trump's J (jack) is 11, Q (queen) is 12, K (king) is 13, A (ace) is 1, and the others are represented by their respective numbers.
The number of datasets does not exceed 50.
Output
For each dataset, output one of the highest roles you can play in your hand. Follow the output example for the notation of the role.
Example
Input
1,2,3,4,1
2,3,2,3,12
12,13,11,12,12
7,6,7,6,7
3,3,2,3,3
6,7,8,9,10
11,12,10,1,13
11,12,13,1,2
Output
one pair
two pair
three card
full house
four card
straight
straight
null | 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:
print("four card")
elif 3 in n and 2 in n:
print("full house")
elif 3 in n:
print("three card")
elif 2 == n.count(2):
print("two pair")
elif 2 in n:
print("one pair")
elif s(n):
print("straight")
else:
print("null")
``` | 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 only consider the following poker roles: (The higher the number, the higher the role.)
1. No role (does not apply to any of the following)
2. One pair (two cards with the same number)
3. Two pairs (two pairs of cards with the same number)
4. Three cards (one set of three cards with the same number)
5. Straight (the numbers on 5 cards are consecutive)
However, in the case of a straight containing A, the sequence ending with A is also straight. In other words, there are two types of straights containing A: A 2 3 4 5 and 10 J Q K A. Lines that straddle A, such as J Q K A 2, are not straight. (In this case, it will be "no role").
6. Full House (one set of three cards with the same number and the other two cards with the same number)
7. Four Cards (one set of four cards with the same number)
Input
The input consists of multiple datasets. Each dataset is given in the following format:
Hand 1, Hand 2, Hand 3, Hand 4, Hand 5
In your hand, Trump's J (jack) is 11, Q (queen) is 12, K (king) is 13, A (ace) is 1, and the others are represented by their respective numbers.
The number of datasets does not exceed 50.
Output
For each dataset, output one of the highest roles you can play in your hand. Follow the output example for the notation of the role.
Example
Input
1,2,3,4,1
2,3,2,3,12
12,13,11,12,12
7,6,7,6,7
3,3,2,3,3
6,7,8,9,10
11,12,10,1,13
11,12,13,1,2
Output
one pair
two pair
three card
full house
four card
straight
straight
null | 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 == list(range(c0, c0+5)) or C == [1, 10, 11, 12, 13]:
return "straight"
if vs == [1, 1, 3]:
return "three card"
if vs == [1, 2, 2]:
return "two pair"
if vs == [1, 1, 1, 2]:
return "one pair"
return "null"
for line in readlines():
*C, = map(int, line.split(","))
C.sort()
write("%s\n" % solve(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 only consider the following poker roles: (The higher the number, the higher the role.)
1. No role (does not apply to any of the following)
2. One pair (two cards with the same number)
3. Two pairs (two pairs of cards with the same number)
4. Three cards (one set of three cards with the same number)
5. Straight (the numbers on 5 cards are consecutive)
However, in the case of a straight containing A, the sequence ending with A is also straight. In other words, there are two types of straights containing A: A 2 3 4 5 and 10 J Q K A. Lines that straddle A, such as J Q K A 2, are not straight. (In this case, it will be "no role").
6. Full House (one set of three cards with the same number and the other two cards with the same number)
7. Four Cards (one set of four cards with the same number)
Input
The input consists of multiple datasets. Each dataset is given in the following format:
Hand 1, Hand 2, Hand 3, Hand 4, Hand 5
In your hand, Trump's J (jack) is 11, Q (queen) is 12, K (king) is 13, A (ace) is 1, and the others are represented by their respective numbers.
The number of datasets does not exceed 50.
Output
For each dataset, output one of the highest roles you can play in your hand. Follow the output example for the notation of the role.
Example
Input
1,2,3,4,1
2,3,2,3,12
12,13,11,12,12
7,6,7,6,7
3,3,2,3,3
6,7,8,9,10
11,12,10,1,13
11,12,13,1,2
Output
one pair
two pair
three card
full house
four card
straight
straight
null | 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, 14)) == card[1:]) \
or list(range(card[0], card[0]+5)) == card: return "straight"
return "null"
import collections
while True:
try: card = list(map(int, input().split(',')))
except: break
cnt = collections.Counter(card)
print(judge(sorted(card), sorted(cnt.items(), key=lambda x: -x[1])))
``` | 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 only consider the following poker roles: (The higher the number, the higher the role.)
1. No role (does not apply to any of the following)
2. One pair (two cards with the same number)
3. Two pairs (two pairs of cards with the same number)
4. Three cards (one set of three cards with the same number)
5. Straight (the numbers on 5 cards are consecutive)
However, in the case of a straight containing A, the sequence ending with A is also straight. In other words, there are two types of straights containing A: A 2 3 4 5 and 10 J Q K A. Lines that straddle A, such as J Q K A 2, are not straight. (In this case, it will be "no role").
6. Full House (one set of three cards with the same number and the other two cards with the same number)
7. Four Cards (one set of four cards with the same number)
Input
The input consists of multiple datasets. Each dataset is given in the following format:
Hand 1, Hand 2, Hand 3, Hand 4, Hand 5
In your hand, Trump's J (jack) is 11, Q (queen) is 12, K (king) is 13, A (ace) is 1, and the others are represented by their respective numbers.
The number of datasets does not exceed 50.
Output
For each dataset, output one of the highest roles you can play in your hand. Follow the output example for the notation of the role.
Example
Input
1,2,3,4,1
2,3,2,3,12
12,13,11,12,12
7,6,7,6,7
3,3,2,3,3
6,7,8,9,10
11,12,10,1,13
11,12,13,1,2
Output
one pair
two pair
three card
full house
four card
straight
straight
null | 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):
print("two pair")
elif onepair(kard):
print("one pair")
else:
print("null")
def fourcard(kard):
if kard.count(kard[0])==4 or kard.count(kard[1])==4:
return True
else:
return False
def fullhouse(kard):
list=collections.Counter(kard)
if len(list)==2:
return True
else:
return False
def straight(kard):
c=sorted(kard,reverse=True)
if c[0]==(c[1]+1)==(c[2]+2)==(c[3]+3)==(c[4]+4) or (c[0]==(c[1]+1)==(c[2]+2)==(c[3]+3) and c[4]==1 and c[0]==13):
return True
else:
return False
def threecard(kard):
if kard.count(kard[0])==3 or kard.count(kard[1])==3 or kard.count(kard[2])==3:
return True
else:
return False
def twopair(kard):
list=collections.Counter(kard)
if len(list)==3:
return True
else:
return False
def onepair(kard):
list=collections.Counter(kard)
if len(list)==4:
return True
else:
return False
while True:
try:
kard=list(map(int,input().split(",")))
except:
break
solution1(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 only consider the following poker roles: (The higher the number, the higher the role.)
1. No role (does not apply to any of the following)
2. One pair (two cards with the same number)
3. Two pairs (two pairs of cards with the same number)
4. Three cards (one set of three cards with the same number)
5. Straight (the numbers on 5 cards are consecutive)
However, in the case of a straight containing A, the sequence ending with A is also straight. In other words, there are two types of straights containing A: A 2 3 4 5 and 10 J Q K A. Lines that straddle A, such as J Q K A 2, are not straight. (In this case, it will be "no role").
6. Full House (one set of three cards with the same number and the other two cards with the same number)
7. Four Cards (one set of four cards with the same number)
Input
The input consists of multiple datasets. Each dataset is given in the following format:
Hand 1, Hand 2, Hand 3, Hand 4, Hand 5
In your hand, Trump's J (jack) is 11, Q (queen) is 12, K (king) is 13, A (ace) is 1, and the others are represented by their respective numbers.
The number of datasets does not exceed 50.
Output
For each dataset, output one of the highest roles you can play in your hand. Follow the output example for the notation of the role.
Example
Input
1,2,3,4,1
2,3,2,3,12
12,13,11,12,12
7,6,7,6,7
3,3,2,3,3
6,7,8,9,10
11,12,10,1,13
11,12,13,1,2
Output
one pair
two pair
three card
full house
four card
straight
straight
null | 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 with the same number.
* There is no joker.
* Suppose you only consider the following poker roles: (The higher the number, the higher the role.)
1. No role (does not apply to any of the following)
2. One pair (two cards with the same number)
3. Two pairs (two pairs of cards with the same number)
4. Three cards (one set of three cards with the same number)
5. Straight (the numbers on 5 cards are consecutive)
However, in the case of a straight containing A, the sequence ending with A is also straight. In other words, there are two types of straights containing A: A 2 3 4 5 and 10 J Q K A. Lines that straddle A, such as J Q K A 2, are not straight. (In this case, it will be "no role").
6. Full House (one set of three cards with the same number and the other two cards with the same number)
7. Four Cards (one set of four cards with the same number)
Input
The input consists of multiple datasets. Each dataset is given in the following format:
Hand 1, Hand 2, Hand 3, Hand 4, Hand 5
In your hand, Trump's J (jack) is 11, Q (queen) is 12, K (king) is 13, A (ace) is 1, and the others are represented by their respective numbers.
The number of datasets does not exceed 50.
Output
For each dataset, output one of the highest roles you can play in your hand. Follow the output example for the notation of the role.
Example
Input
1,2,3,4,1
2,3,2,3,12
12,13,11,12,12
7,6,7,6,7
3,3,2,3,3
6,7,8,9,10
11,12,10,1,13
11,12,13,1,2
Output
one pair
two pair
three card
full house
four card
straight
straight
null
Submitted Solution:
```
def isstraight(cs):
if 1 in cs:
if cs==[1,2,3,4,5] or cs==[1,10,11,12,13]:
return True
else:
return False
else:
for i in range(len(cs)-1):
if cs[i+1]!=cs[i]+1:
return False
return True
while 1:
try:
c= list(map(int, input().split(',')))
except:
break
l= [c.count(i) for i in set(c)]
ans= {7: "four card", 6: "full house", 5: "straight", 4: "three card", 3: "two pair", 2: "one pair", 1: "null"}
if len(set(c))==5:
v= 5 if isstraight(sorted(c)) else 1
else:
v= 7 if 4 in l else(6 if 3 in l and 2 in l else(4 if 3 in l else(3 if l.count(2)==2 else 2)))
print(ans[v])
``` | 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 with the same number.
* There is no joker.
* Suppose you only consider the following poker roles: (The higher the number, the higher the role.)
1. No role (does not apply to any of the following)
2. One pair (two cards with the same number)
3. Two pairs (two pairs of cards with the same number)
4. Three cards (one set of three cards with the same number)
5. Straight (the numbers on 5 cards are consecutive)
However, in the case of a straight containing A, the sequence ending with A is also straight. In other words, there are two types of straights containing A: A 2 3 4 5 and 10 J Q K A. Lines that straddle A, such as J Q K A 2, are not straight. (In this case, it will be "no role").
6. Full House (one set of three cards with the same number and the other two cards with the same number)
7. Four Cards (one set of four cards with the same number)
Input
The input consists of multiple datasets. Each dataset is given in the following format:
Hand 1, Hand 2, Hand 3, Hand 4, Hand 5
In your hand, Trump's J (jack) is 11, Q (queen) is 12, K (king) is 13, A (ace) is 1, and the others are represented by their respective numbers.
The number of datasets does not exceed 50.
Output
For each dataset, output one of the highest roles you can play in your hand. Follow the output example for the notation of the role.
Example
Input
1,2,3,4,1
2,3,2,3,12
12,13,11,12,12
7,6,7,6,7
3,3,2,3,3
6,7,8,9,10
11,12,10,1,13
11,12,13,1,2
Output
one pair
two pair
three card
full house
four card
straight
straight
null
Submitted Solution:
```
from collections import Counter
import sys
for line in sys.stdin:
card = sorted(list(map(int, line.split(','))))
pair = Counter(card).most_common()
if pair[0][1] == 4:
print('four card')
elif pair[0][1] == 3 and pair[1][1] == 2:
print('full house')
elif pair[0][1] == 3:
print('three card')
elif pair[0][1] == pair[1][1] == 2:
print('two pair')
elif pair[0][1] == 2:
print('one pair')
elif [x - card[0] for x in card] == [0,1,2,3,4] or card == [1,10,11,12,13]:
print('straight')
else:
print('null')
``` | 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 with the same number.
* There is no joker.
* Suppose you only consider the following poker roles: (The higher the number, the higher the role.)
1. No role (does not apply to any of the following)
2. One pair (two cards with the same number)
3. Two pairs (two pairs of cards with the same number)
4. Three cards (one set of three cards with the same number)
5. Straight (the numbers on 5 cards are consecutive)
However, in the case of a straight containing A, the sequence ending with A is also straight. In other words, there are two types of straights containing A: A 2 3 4 5 and 10 J Q K A. Lines that straddle A, such as J Q K A 2, are not straight. (In this case, it will be "no role").
6. Full House (one set of three cards with the same number and the other two cards with the same number)
7. Four Cards (one set of four cards with the same number)
Input
The input consists of multiple datasets. Each dataset is given in the following format:
Hand 1, Hand 2, Hand 3, Hand 4, Hand 5
In your hand, Trump's J (jack) is 11, Q (queen) is 12, K (king) is 13, A (ace) is 1, and the others are represented by their respective numbers.
The number of datasets does not exceed 50.
Output
For each dataset, output one of the highest roles you can play in your hand. Follow the output example for the notation of the role.
Example
Input
1,2,3,4,1
2,3,2,3,12
12,13,11,12,12
7,6,7,6,7
3,3,2,3,3
6,7,8,9,10
11,12,10,1,13
11,12,13,1,2
Output
one pair
two pair
three card
full house
four card
straight
straight
null
Submitted Solution:
```
from collections import Counter
#カードを引数に取って答えを出力する
def put_ans(cards):
cards.sort()
#10 ~ Aのストレート
if cards == [1, 10, 11, 12, 13]:
print("straight")
return
#それ以外のストレート
for i in range(1,len(cards)):
if cards[i] - cards[i - 1] != 1:
break
else:
print("straight")
return
#result...カードの枚数の降順リスト
result = [t[1] for t in Counter(cards).most_common()]
if result == [1,1,1,1,1]:
print("null")
if result == [2,1,1,1]:
print("one pair")
if result == [2,2,1]:
print("two pair")
if result == [3,1,1]:
print("three card")
if result == [3, 2]:
print("full house")
if result == [4, 1]:
print("four card")
def main():
while True:
try:
cards = list(map(int, input().split(",")))
put_ans(cards)
except EOFError:
break
main()
``` | 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 with the same number.
* There is no joker.
* Suppose you only consider the following poker roles: (The higher the number, the higher the role.)
1. No role (does not apply to any of the following)
2. One pair (two cards with the same number)
3. Two pairs (two pairs of cards with the same number)
4. Three cards (one set of three cards with the same number)
5. Straight (the numbers on 5 cards are consecutive)
However, in the case of a straight containing A, the sequence ending with A is also straight. In other words, there are two types of straights containing A: A 2 3 4 5 and 10 J Q K A. Lines that straddle A, such as J Q K A 2, are not straight. (In this case, it will be "no role").
6. Full House (one set of three cards with the same number and the other two cards with the same number)
7. Four Cards (one set of four cards with the same number)
Input
The input consists of multiple datasets. Each dataset is given in the following format:
Hand 1, Hand 2, Hand 3, Hand 4, Hand 5
In your hand, Trump's J (jack) is 11, Q (queen) is 12, K (king) is 13, A (ace) is 1, and the others are represented by their respective numbers.
The number of datasets does not exceed 50.
Output
For each dataset, output one of the highest roles you can play in your hand. Follow the output example for the notation of the role.
Example
Input
1,2,3,4,1
2,3,2,3,12
12,13,11,12,12
7,6,7,6,7
3,3,2,3,3
6,7,8,9,10
11,12,10,1,13
11,12,13,1,2
Output
one pair
two pair
three card
full house
four card
straight
straight
null
Submitted Solution:
```
while True:
try:
A = sorted(list(map(int, input().split(","))))
_sum = 0
_max = 0
for i in range(1,14):
tmp = A.count(i)
if tmp > 1:
_sum+=tmp
_max = max(_max, tmp)
if _max == 4:
print("four card")
elif _max == 3 and _sum == 5:
print("full house")
elif A.count(1) == 1 and (A[0] == 1 and A[2]-1 == A[3]-2 == A[4]-3 == A[1]) \
or (A[4] == 1 and A[1]-1 == A[2]-2 == A[3] == A[0]):
print("straight")
elif A[1]-1 == A[2]-2 == A[3]-3 == A[4]-4 == A[0]:
print("straight")
elif _max == 3:
print("three card")
elif _sum == 4:
print("two pair")
elif _max == 2:
print("one pair")
else:
print("null")
except:
break
``` | 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 with the same number.
* There is no joker.
* Suppose you only consider the following poker roles: (The higher the number, the higher the role.)
1. No role (does not apply to any of the following)
2. One pair (two cards with the same number)
3. Two pairs (two pairs of cards with the same number)
4. Three cards (one set of three cards with the same number)
5. Straight (the numbers on 5 cards are consecutive)
However, in the case of a straight containing A, the sequence ending with A is also straight. In other words, there are two types of straights containing A: A 2 3 4 5 and 10 J Q K A. Lines that straddle A, such as J Q K A 2, are not straight. (In this case, it will be "no role").
6. Full House (one set of three cards with the same number and the other two cards with the same number)
7. Four Cards (one set of four cards with the same number)
Input
The input consists of multiple datasets. Each dataset is given in the following format:
Hand 1, Hand 2, Hand 3, Hand 4, Hand 5
In your hand, Trump's J (jack) is 11, Q (queen) is 12, K (king) is 13, A (ace) is 1, and the others are represented by their respective numbers.
The number of datasets does not exceed 50.
Output
For each dataset, output one of the highest roles you can play in your hand. Follow the output example for the notation of the role.
Example
Input
1,2,3,4,1
2,3,2,3,12
12,13,11,12,12
7,6,7,6,7
3,3,2,3,3
6,7,8,9,10
11,12,10,1,13
11,12,13,1,2
Output
one pair
two pair
three card
full house
four card
straight
straight
null
Submitted Solution:
```
while 1:
try: p=sorted(list(map(int,input().split(','))))
except: break
if (p[0] == p[3]) or (p[1] == p[4]):
print('four card')
elif p[0] == p[2] or p[1] == p[3] or p[2] == p[4]:
print('three card')
elif (p[0] == p[1] == p[2] and p[3] == p[4]) or (p[0] == [1] and p[2] == p[3] == p[4]):
print('full house')
elif (p[0] == p[1] and p[2] == p[3]) or (p[1] == p[2] and p[3] == p[4]):
print('two pair')
elif p[0] == p[1] or p[1] == p[2] or p[2] == p[3] or p[3] == p[4]:
print('one pair')
elif p[0] == p[1]-1 and p[1] == p[2]-1 and p[2] == p[3]-1 and p[3] == p[4]-1 and p[4] == p[3]+1:
print('straight')
elif p[0] == 1 and p[1] == 10 and p[2] == 11 and p[3] == 12 and p[4] == 13:
print('straight')
else:
print('null')
``` | 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 with the same number.
* There is no joker.
* Suppose you only consider the following poker roles: (The higher the number, the higher the role.)
1. No role (does not apply to any of the following)
2. One pair (two cards with the same number)
3. Two pairs (two pairs of cards with the same number)
4. Three cards (one set of three cards with the same number)
5. Straight (the numbers on 5 cards are consecutive)
However, in the case of a straight containing A, the sequence ending with A is also straight. In other words, there are two types of straights containing A: A 2 3 4 5 and 10 J Q K A. Lines that straddle A, such as J Q K A 2, are not straight. (In this case, it will be "no role").
6. Full House (one set of three cards with the same number and the other two cards with the same number)
7. Four Cards (one set of four cards with the same number)
Input
The input consists of multiple datasets. Each dataset is given in the following format:
Hand 1, Hand 2, Hand 3, Hand 4, Hand 5
In your hand, Trump's J (jack) is 11, Q (queen) is 12, K (king) is 13, A (ace) is 1, and the others are represented by their respective numbers.
The number of datasets does not exceed 50.
Output
For each dataset, output one of the highest roles you can play in your hand. Follow the output example for the notation of the role.
Example
Input
1,2,3,4,1
2,3,2,3,12
12,13,11,12,12
7,6,7,6,7
3,3,2,3,3
6,7,8,9,10
11,12,10,1,13
11,12,13,1,2
Output
one pair
two pair
three card
full house
four card
straight
straight
null
Submitted Solution:
```
def function(a,b,c,d,e):
A=[a,b,c,d,e]
A.sort()
#4card
if A[0]==A[1]==A[2]==A[3] or A[1]==A[2]==A[3]==A[4]:
print("four card")
#Full house
elif (A[0]==A[1] and A[2]==A[3]==A[4]) or (A[0]==A[1]==A[2] and A[3]==A[4]):
print("full house")
#straight A?????????
elif A[0]==1 and A[1]==10 and A[2]==11 and A[3]==12 and A[4]==13:
print("straight")
#straight A???????????????
elif A[0]==A[1]-1==A[2]-2==A[3]-3==A[4]-4:
print("straight")
#threee
elif A[0]==A[1]==A[2] or A[1]==A[2]==A[3] or A[2]==A[3]==A[4]:
print("three card")
elif (A[0]==A[1] and A[2]==A[3]) or (A[1]==A[2] and A[3]==A[4]):
print("two pair")
elif A[0]==A[1] or A[1]==A[2] or A[2]==A[3] or A[3]==A[4]:
print("one pair")
else:
print("null")
while True:
try:
a,b,c,d,e=map(float,input().split(','))
function(a,b,c,d,e)
except EOFError:
break
``` | 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 with the same number.
* There is no joker.
* Suppose you only consider the following poker roles: (The higher the number, the higher the role.)
1. No role (does not apply to any of the following)
2. One pair (two cards with the same number)
3. Two pairs (two pairs of cards with the same number)
4. Three cards (one set of three cards with the same number)
5. Straight (the numbers on 5 cards are consecutive)
However, in the case of a straight containing A, the sequence ending with A is also straight. In other words, there are two types of straights containing A: A 2 3 4 5 and 10 J Q K A. Lines that straddle A, such as J Q K A 2, are not straight. (In this case, it will be "no role").
6. Full House (one set of three cards with the same number and the other two cards with the same number)
7. Four Cards (one set of four cards with the same number)
Input
The input consists of multiple datasets. Each dataset is given in the following format:
Hand 1, Hand 2, Hand 3, Hand 4, Hand 5
In your hand, Trump's J (jack) is 11, Q (queen) is 12, K (king) is 13, A (ace) is 1, and the others are represented by their respective numbers.
The number of datasets does not exceed 50.
Output
For each dataset, output one of the highest roles you can play in your hand. Follow the output example for the notation of the role.
Example
Input
1,2,3,4,1
2,3,2,3,12
12,13,11,12,12
7,6,7,6,7
3,3,2,3,3
6,7,8,9,10
11,12,10,1,13
11,12,13,1,2
Output
one pair
two pair
three card
full house
four card
straight
straight
null
Submitted Solution:
```
import sys
for e in sys.stdin:
e=sorted(map(int,e.split(',')))
print([['null','straight'][e[4]-e[0]==4 or e[0]*10==e[1]],'one pair','two pair','three card','full house',0,'four card'][(sum(e.count(s)for s in e)//2-2])
``` | 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.