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.
This problem has unusual memory constraint.
At evening, Igor and Zhenya the financiers became boring, so they decided to play a game. They prepared n papers with the income of some company for ... | instruction | 0 | 10,428 | 19 | 20,856 |
No | output | 1 | 10,428 | 19 | 20,857 |
Provide a correct Python 3 solution for this coding contest problem.
We have N boxes numbered 1 to N, and M balls numbered 1 to M. Currently, Ball i is in Box A_i.
You can do the following operation:
* Choose a box containing two or more balls, pick up one of the balls from that box, and put it into another box.
... | instruction | 0 | 10,545 | 19 | 21,090 |
"Correct Solution:
```
import sys
from bisect import bisect_left
from collections import defaultdict
from itertools import accumulate
class UnionFind:
def __init__(self, n):
self.table = [-1] * n
def _root(self, x):
stack = []
tbl = self.table
while tbl[x] >= 0:
s... | output | 1 | 10,545 | 19 | 21,091 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N boxes numbered 1 to N, and M balls numbered 1 to M. Currently, Ball i is in Box A_i.
You can do the following operation:
* Choose a box containing two or more balls, pick up one of t... | instruction | 0 | 10,546 | 19 | 21,092 |
No | output | 1 | 10,546 | 19 | 21,093 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N boxes numbered 1 to N, and M balls numbered 1 to M. Currently, Ball i is in Box A_i.
You can do the following operation:
* Choose a box containing two or more balls, pick up one of t... | instruction | 0 | 10,547 | 19 | 21,094 |
No | output | 1 | 10,547 | 19 | 21,095 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N boxes numbered 1 to N, and M balls numbered 1 to M. Currently, Ball i is in Box A_i.
You can do the following operation:
* Choose a box containing two or more balls, pick up one of t... | instruction | 0 | 10,548 | 19 | 21,096 |
No | output | 1 | 10,548 | 19 | 21,097 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N boxes numbered 1 to N, and M balls numbered 1 to M. Currently, Ball i is in Box A_i.
You can do the following operation:
* Choose a box containing two or more balls, pick up one of t... | instruction | 0 | 10,549 | 19 | 21,098 |
No | output | 1 | 10,549 | 19 | 21,099 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob play ping-pong with simplified rules.
During the game, the player serving the ball commences a play. The server strikes the ball then the receiver makes a return by hitting the ball back. Thereafter, the server and receiver mu... | instruction | 0 | 10,974 | 19 | 21,948 |
Tags: constructive algorithms, games, math
Correct Solution:
```
for t in range(int(input())):
x,y=map(int, input().split())
print(x-1,y,end=' ')
``` | output | 1 | 10,974 | 19 | 21,949 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob play ping-pong with simplified rules.
During the game, the player serving the ball commences a play. The server strikes the ball then the receiver makes a return by hitting the ball back. Thereafter, the server and receiver mu... | instruction | 0 | 10,975 | 19 | 21,950 |
Tags: constructive algorithms, games, math
Correct Solution:
```
from sys import stdin
input=stdin.readline
for _ in range(int(input())):
a,b=map(int,input().split())
print(a-1,b)
``` | output | 1 | 10,975 | 19 | 21,951 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob play ping-pong with simplified rules.
During the game, the player serving the ball commences a play. The server strikes the ball then the receiver makes a return by hitting the ball back. Thereafter, the server and receiver mu... | instruction | 0 | 10,976 | 19 | 21,952 |
Tags: constructive algorithms, games, math
Correct Solution:
```
mod = 10**9 + 7
def solve():
x, y = map(int, input().split())
print(x - 1, y)
t = 1
t = int(input())
while t > 0:
solve()
t -= 1
``` | output | 1 | 10,976 | 19 | 21,953 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob play ping-pong with simplified rules.
During the game, the player serving the ball commences a play. The server strikes the ball then the receiver makes a return by hitting the ball back. Thereafter, the server and receiver mu... | instruction | 0 | 10,977 | 19 | 21,954 |
Tags: constructive algorithms, games, math
Correct Solution:
```
for i in range(int(input())):
x,y=map(int,input().split())
print(x-1,y,end=" ")
print()
``` | output | 1 | 10,977 | 19 | 21,955 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob play ping-pong with simplified rules.
During the game, the player serving the ball commences a play. The server strikes the ball then the receiver makes a return by hitting the ball back. Thereafter, the server and receiver mu... | instruction | 0 | 10,978 | 19 | 21,956 |
Tags: constructive algorithms, games, math
Correct Solution:
```
t = int(input())
for i in range(t):
n, m = map(int, input().split())
print(n - 1, m)
``` | output | 1 | 10,978 | 19 | 21,957 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob play ping-pong with simplified rules.
During the game, the player serving the ball commences a play. The server strikes the ball then the receiver makes a return by hitting the ball back. Thereafter, the server and receiver mu... | instruction | 0 | 10,979 | 19 | 21,958 |
Tags: constructive algorithms, games, math
Correct Solution:
```
for _ in range(int(input())):
x,y = map(int,input().split(' '))
if x==1: print(0,y)
else: print(x-1,y)
``` | output | 1 | 10,979 | 19 | 21,959 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob play ping-pong with simplified rules.
During the game, the player serving the ball commences a play. The server strikes the ball then the receiver makes a return by hitting the ball back. Thereafter, the server and receiver mu... | instruction | 0 | 10,980 | 19 | 21,960 |
Tags: constructive algorithms, games, math
Correct Solution:
```
import time,math as mt,bisect as bs,sys
from sys import stdin,stdout
from collections import deque
from fractions import Fraction
from collections import Counter
from collections import OrderedDict
pi=3.14159265358979323846264338327950
def II(): # to take... | output | 1 | 10,980 | 19 | 21,961 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob play ping-pong with simplified rules.
During the game, the player serving the ball commences a play. The server strikes the ball then the receiver makes a return by hitting the ball back. Thereafter, the server and receiver mu... | instruction | 0 | 10,981 | 19 | 21,962 |
Tags: constructive algorithms, games, math
Correct Solution:
```
for _ in range(int(input())):
n,m=map(int,input().split())
print(n-1,m)
``` | output | 1 | 10,981 | 19 | 21,963 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob play ping-pong with simplified rules.
During the game, the player serving the ball commences a play. The server strikes the ball then the receiver makes a return by hitting the ba... | instruction | 0 | 10,982 | 19 | 21,964 |
Yes | output | 1 | 10,982 | 19 | 21,965 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob play ping-pong with simplified rules.
During the game, the player serving the ball commences a play. The server strikes the ball then the receiver makes a return by hitting the ba... | instruction | 0 | 10,983 | 19 | 21,966 |
Yes | output | 1 | 10,983 | 19 | 21,967 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob play ping-pong with simplified rules.
During the game, the player serving the ball commences a play. The server strikes the ball then the receiver makes a return by hitting the ba... | instruction | 0 | 10,984 | 19 | 21,968 |
Yes | output | 1 | 10,984 | 19 | 21,969 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob play ping-pong with simplified rules.
During the game, the player serving the ball commences a play. The server strikes the ball then the receiver makes a return by hitting the ba... | instruction | 0 | 10,985 | 19 | 21,970 |
Yes | output | 1 | 10,985 | 19 | 21,971 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob play ping-pong with simplified rules.
During the game, the player serving the ball commences a play. The server strikes the ball then the receiver makes a return by hitting the ba... | instruction | 0 | 10,986 | 19 | 21,972 |
No | output | 1 | 10,986 | 19 | 21,973 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob play ping-pong with simplified rules.
During the game, the player serving the ball commences a play. The server strikes the ball then the receiver makes a return by hitting the ba... | instruction | 0 | 10,987 | 19 | 21,974 |
No | output | 1 | 10,987 | 19 | 21,975 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob play ping-pong with simplified rules.
During the game, the player serving the ball commences a play. The server strikes the ball then the receiver makes a return by hitting the ba... | instruction | 0 | 10,988 | 19 | 21,976 |
No | output | 1 | 10,988 | 19 | 21,977 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob play ping-pong with simplified rules.
During the game, the player serving the ball commences a play. The server strikes the ball then the receiver makes a return by hitting the ba... | instruction | 0 | 10,989 | 19 | 21,978 |
No | output | 1 | 10,989 | 19 | 21,979 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take turns to make the following moves. During each mov... | instruction | 0 | 11,088 | 19 | 22,176 |
Tags: games, math, number theory
Correct Solution:
```
def gcd(a, b):
while a > 0:
a, b = b % a, a
return b
n = int(input())
a = [int(x) for x in input().split()]
g = a[0]
m = a[0]
for i in range(1, n):
g = gcd(g, a[i])
m = m if m >= a[i] else a[i]
if (m // g - n) % 2:
print("Alice")
else... | output | 1 | 11,088 | 19 | 22,177 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take turns to make the following moves. During each mov... | instruction | 0 | 11,089 | 19 | 22,178 |
Tags: games, math, number theory
Correct Solution:
```
def gcd(x,y):
if x<y:
return gcd(y,x)
else:
if y==0:
return x
else:
return gcd(y,x%y)
if __name__=='__main__':
inp = input()
inp = input()
arr = inp.split(' ')
L = []
for a in arr:
... | output | 1 | 11,089 | 19 | 22,179 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take turns to make the following moves. During each mov... | instruction | 0 | 11,090 | 19 | 22,180 |
Tags: games, math, number theory
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
def nod(a,b):
while a * b:
if a > b:
a, b = b, a % b
else:
a, b = b % a, a
return (a + b)
b = a[:]
ans = nod(b[0], b[1])
b = b[2:]
while b:
ans = nod(ans, b[0])... | output | 1 | 11,090 | 19 | 22,181 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take turns to make the following moves. During each mov... | instruction | 0 | 11,091 | 19 | 22,182 |
Tags: games, math, number theory
Correct Solution:
```
import math
n=int(input())
a=sorted([int(_) for _ in input().split()])
b=0
for i in a:
b=math.gcd(b,i)
c=(a[0]-1)//b
for i in range(n-1):
c+=(a[i+1]-a[i]-1)//b;
if c%2==0: print("Bob")
else: print("Alice")
``` | output | 1 | 11,091 | 19 | 22,183 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take turns to make the following moves. During each mov... | instruction | 0 | 11,092 | 19 | 22,184 |
Tags: games, math, number theory
Correct Solution:
```
from fractions import gcd
n = int(input())
sez = [int(i) for i in input().split()]
sez.sort()
g = gcd(sez[0], sez[1])
for i in range(2, n):
g = gcd(g, sez[i])
left = sez[n-1]/g - n
if left%2 == 1:
print("Alice")
else:
print("Bob")
``` | output | 1 | 11,092 | 19 | 22,185 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take turns to make the following moves. During each mov... | instruction | 0 | 11,093 | 19 | 22,186 |
Tags: games, math, number theory
Correct Solution:
```
from fractions import gcd
n = int(input())
a = [int(x) for x in input().split()]
gg = a[0]
for i in range(1,n):
gg = gcd(gg,a[i])
for i in range(n):
a[i] //= gg
if (max(a) - n) % 2 == 0:
print('Bob')
else:
print('Alice')
``` | output | 1 | 11,093 | 19 | 22,187 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take turns to make the following moves. During each mov... | instruction | 0 | 11,094 | 19 | 22,188 |
Tags: games, math, number theory
Correct Solution:
```
n=int(input())
A=list(map(int,input().split()))
def gcd(x,y):
while y:
x,y=y,x%y
return x
g=0
for a in A:
g=gcd(g,a)
u=max(A)//g-n
if u%2==0:
print("Bob")
else:
print("Alice")
``` | output | 1 | 11,094 | 19 | 22,189 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take turns to make the following moves. During each mov... | instruction | 0 | 11,095 | 19 | 22,190 |
Tags: games, math, number theory
Correct Solution:
```
import sys
import math
MAXNUM = math.inf
MINNUM = -1 * math.inf
ASCIILOWER = 97
ASCIIUPPER = 65
def getInt():
return int(sys.stdin.readline().rstrip())
def getInts():
return map(int, sys.stdin.readline().rstrip().split(" "))
def getString():
retu... | output | 1 | 11,095 | 19 | 22,191 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take tur... | instruction | 0 | 11,096 | 19 | 22,192 |
Yes | output | 1 | 11,096 | 19 | 22,193 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take tur... | instruction | 0 | 11,097 | 19 | 22,194 |
Yes | output | 1 | 11,097 | 19 | 22,195 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take tur... | instruction | 0 | 11,098 | 19 | 22,196 |
Yes | output | 1 | 11,098 | 19 | 22,197 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take tur... | instruction | 0 | 11,099 | 19 | 22,198 |
Yes | output | 1 | 11,099 | 19 | 22,199 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take tur... | instruction | 0 | 11,100 | 19 | 22,200 |
No | output | 1 | 11,100 | 19 | 22,201 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take tur... | instruction | 0 | 11,101 | 19 | 22,202 |
No | output | 1 | 11,101 | 19 | 22,203 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take tur... | instruction | 0 | 11,102 | 19 | 22,204 |
No | output | 1 | 11,102 | 19 | 22,205 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take tur... | instruction | 0 | 11,103 | 19 | 22,206 |
No | output | 1 | 11,103 | 19 | 22,207 |
Provide a correct Python 3 solution for this coding contest problem.
Taro made a sugoroku so that everyone can play at the children's association event. In order to make the game interesting, I wrote instructions such as "advance 6" and "back 5" in some of the sugoroku squares other than "Furidashi" and "Agari". Turn ... | instruction | 0 | 11,555 | 19 | 23,110 |
"Correct Solution:
```
while True:
m = int(input())
if not m:
break
n = int(input())
ds = [0] + [int(input()) for _ in range(n)] + [0]
g = [[] for _ in range(n+2)]
rg = [[] for _ in range(n+2)]
for i in range(n+2):
for j in range(min(n+1,i+1),min(n+1,i+m)+1):
j =... | output | 1 | 11,555 | 19 | 23,111 |
Provide a correct Python 3 solution for this coding contest problem.
Taro made a sugoroku so that everyone can play at the children's association event. In order to make the game interesting, I wrote instructions such as "advance 6" and "back 5" in some of the sugoroku squares other than "Furidashi" and "Agari". Turn ... | instruction | 0 | 11,556 | 19 | 23,112 |
"Correct Solution:
```
import queue
while True:
m = int(input())
if m == 0:
break
n = int(input())
d = [0]*(n+2)
for i in range(1,n+1):
d[i] = int(input())
visited = [False]*(n+2)
visited[0] = True
ok = [False]*(n+2)
ok[n+1] = True
rev = [[] for _ in range(n+2)]
... | output | 1 | 11,556 | 19 | 23,113 |
Provide a correct Python 3 solution for this coding contest problem.
Taro made a sugoroku so that everyone can play at the children's association event. In order to make the game interesting, I wrote instructions such as "advance 6" and "back 5" in some of the sugoroku squares other than "Furidashi" and "Agari". Turn ... | instruction | 0 | 11,557 | 19 | 23,114 |
"Correct Solution:
```
def reachable(graph, init):
if init not in graph or graph[init] is None:
return set()
tmp, graph[init] = graph[init], None
return tmp.union(* [reachable(graph, i) for i in tmp])
def sugoroku(m, d):
d = [0] + d + [0]
start, goal = 0, len(d) - 1
graph_to = {... | output | 1 | 11,557 | 19 | 23,115 |
Provide a correct Python 3 solution for this coding contest problem.
Taro made a sugoroku so that everyone can play at the children's association event. In order to make the game interesting, I wrote instructions such as "advance 6" and "back 5" in some of the sugoroku squares other than "Furidashi" and "Agari". Turn ... | instruction | 0 | 11,558 | 19 | 23,116 |
"Correct Solution:
```
def search(x, visited, edges):
if visited[x]:
return
visited[x] = True
for to in edges[x]:
search(to, visited, edges)
def main():
while True:
m = int(input())
if m == 0:
break
n = int(input())
mp = [0] + [int(input()) for _ in range(n)] + [0]
visited = ... | output | 1 | 11,558 | 19 | 23,117 |
Provide a correct Python 3 solution for this coding contest problem.
Taro made a sugoroku so that everyone can play at the children's association event. In order to make the game interesting, I wrote instructions such as "advance 6" and "back 5" in some of the sugoroku squares other than "Furidashi" and "Agari". Turn ... | instruction | 0 | 11,559 | 19 | 23,118 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
from collections import deque
def bfs(adj_list, s):
q = deque([s])
visited = [False]*(n+2)
visited[s] = True
while q:
v = q.popleft()
for nv in adj_list[v]:
if not visited[nv]:
visited... | output | 1 | 11,559 | 19 | 23,119 |
Provide a correct Python 3 solution for this coding contest problem.
Taro made a sugoroku so that everyone can play at the children's association event. In order to make the game interesting, I wrote instructions such as "advance 6" and "back 5" in some of the sugoroku squares other than "Furidashi" and "Agari". Turn ... | instruction | 0 | 11,560 | 19 | 23,120 |
"Correct Solution:
```
from collections import deque
while 1:
M = int(input())
if M == 0:
break
N = int(input())
D = [0] + [int(input()) for i in range(N)] + [0]
G = [[] for i in range(N+2)]
u = [0]*(N+2)
que = deque([0])
u[0] = 1
while que:
v = que.popleft()
... | output | 1 | 11,560 | 19 | 23,121 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Taro made a sugoroku so that everyone can play at the children's association event. In order to make the game interesting, I wrote instructions such as "advance 6" and "back 5" in some of the su... | instruction | 0 | 11,561 | 19 | 23,122 |
No | output | 1 | 11,561 | 19 | 23,123 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Taro made a sugoroku so that everyone can play at the children's association event. In order to make the game interesting, I wrote instructions such as "advance 6" and "back 5" in some of the su... | instruction | 0 | 11,562 | 19 | 23,124 |
No | output | 1 | 11,562 | 19 | 23,125 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Taro made a sugoroku so that everyone can play at the children's association event. In order to make the game interesting, I wrote instructions such as "advance 6" and "back 5" in some of the su... | instruction | 0 | 11,563 | 19 | 23,126 |
No | output | 1 | 11,563 | 19 | 23,127 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Taro made a sugoroku so that everyone can play at the children's association event. In order to make the game interesting, I wrote instructions such as "advance 6" and "back 5" in some of the su... | instruction | 0 | 11,564 | 19 | 23,128 |
No | output | 1 | 11,564 | 19 | 23,129 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Hyakugoku has just retired from being the resident deity of the South Black Snail Temple in order to pursue her dream of becoming a cartoonist. She spent six months in that temple just playing "Cat's Cradle" so now she wants to try a differe... | instruction | 0 | 11,730 | 19 | 23,460 |
Tags: dp, probabilities, shortest paths
Correct Solution:
```
h = [list(map(int, input().split())) for _ in range(10)]
tp = {}
def celli(x, y):
if x % 2:
return (9 - x) * 10 + y
return (9 - x) * 10 + 9 - y
for i in range(10):
for j in range(10):
if h[i][j]:
tp[celli(i, j)] = celli(i - h[i][j], j)
dp = [0]... | output | 1 | 11,730 | 19 | 23,461 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Hyakugoku has just retired from being the resident deity of the South Black Snail Temple in order to pursue her dream of becoming a cartoonist. She spent six months in that temple just playing "Cat's Cradle" so now she wants to try a differe... | instruction | 0 | 11,731 | 19 | 23,462 |
Tags: dp, probabilities, shortest paths
Correct Solution:
```
X = [[int(a) for a in input().split()] for _ in range(10)]
Y = [(i//10, 9-i%10 if (i//10)&1 else i%10) for i in range(100)]
Z = [[i * 10 + 9 - j if i & 1 else i * 10 + j for j in range(10)] for i in range(10)]
E = [0] * 100
F = [0] * 100
for i in range(1, 6)... | output | 1 | 11,731 | 19 | 23,463 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.