message stringlengths 2 19.9k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 322 108k | cluster float64 15 15 | __index_level_0__ int64 644 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid of squares with H+1 horizontal rows and W vertical columns.
You will start at one of the squares in the top row and repeat moving one square right or down. However, for each int... | instruction | 0 | 83,956 | 15 | 167,912 |
Yes | output | 1 | 83,956 | 15 | 167,913 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid of squares with H+1 horizontal rows and W vertical columns.
You will start at one of the squares in the top row and repeat moving one square right or down. However, for each int... | instruction | 0 | 83,957 | 15 | 167,914 |
Yes | output | 1 | 83,957 | 15 | 167,915 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid of squares with H+1 horizontal rows and W vertical columns.
You will start at one of the squares in the top row and repeat moving one square right or down. However, for each int... | instruction | 0 | 83,958 | 15 | 167,916 |
Yes | output | 1 | 83,958 | 15 | 167,917 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid of squares with H+1 horizontal rows and W vertical columns.
You will start at one of the squares in the top row and repeat moving one square right or down. However, for each int... | instruction | 0 | 83,959 | 15 | 167,918 |
Yes | output | 1 | 83,959 | 15 | 167,919 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid of squares with H+1 horizontal rows and W vertical columns.
You will start at one of the squares in the top row and repeat moving one square right or down. However, for each int... | instruction | 0 | 83,960 | 15 | 167,920 |
No | output | 1 | 83,960 | 15 | 167,921 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid of squares with H+1 horizontal rows and W vertical columns.
You will start at one of the squares in the top row and repeat moving one square right or down. However, for each int... | instruction | 0 | 83,961 | 15 | 167,922 |
No | output | 1 | 83,961 | 15 | 167,923 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid of squares with H+1 horizontal rows and W vertical columns.
You will start at one of the squares in the top row and repeat moving one square right or down. However, for each int... | instruction | 0 | 83,962 | 15 | 167,924 |
No | output | 1 | 83,962 | 15 | 167,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid of squares with H+1 horizontal rows and W vertical columns.
You will start at one of the squares in the top row and repeat moving one square right or down. However, for each int... | instruction | 0 | 83,963 | 15 | 167,926 |
No | output | 1 | 83,963 | 15 | 167,927 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rectangular grid with n rows and m columns. The cell located on the i-th row from the top and the j-th column from the left has a value a_{ij} written in it.
You can perform the following operation any number of times (possi... | instruction | 0 | 84,429 | 15 | 168,858 |
Tags: greedy, math
Correct Solution:
```
t = int(input())
for _ in range(t):
a = []
k = 0
n, m = map(int,input().split())
for _ in range(n):
s = list(map(int,input().split()))
a += s
for i in range(n*m):
if a[i] < 0:
k += 1
a[i] *= -1
if k%2==0:
... | output | 1 | 84,429 | 15 | 168,859 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rectangular grid with n rows and m columns. The cell located on the i-th row from the top and the j-th column from the left has a value a_{ij} written in it.
You can perform the following operation any number of times (possi... | instruction | 0 | 84,432 | 15 | 168,864 |
Tags: greedy, math
Correct Solution:
```
for i in range(int(input())):
n,m=map(int,input().split())
l,k=[],0
for i in range(n):
l+=[*map(int,input().split())]
for i in range(n*m):
if l[i]<0:k+=1;l[i]*=-1
print(sum(l)-k%2*min(l)*2)
``` | output | 1 | 84,432 | 15 | 168,865 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rectangular grid with n rows and m columns. The cell located on the i-th row from the top and the j-th column from the left has a value a_{ij} written in it.
You can perform the following operation any number of times (possi... | instruction | 0 | 84,433 | 15 | 168,866 |
Tags: greedy, math
Correct Solution:
```
t = int(input())
for _ in range(t):
nm = list(map(int, input().split()))
n = nm[0]
numbers = []
for _ in range(n):
data = list(map(int, input().split()))
numbers += data
neg = 0
zero = 0
for i in numbers:
if i < 0:
... | output | 1 | 84,433 | 15 | 168,867 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Our bear's forest has a checkered field. The checkered field is an n × n table, the rows are numbered from 1 to n from top to bottom, the columns are numbered from 1 to n from left to right. Let's denote a cell of the field on the intersecti... | instruction | 0 | 84,549 | 15 | 169,098 |
Tags: math, matrices
Correct Solution:
```
#Simple non-optimized class of matrices. Used with small dense matrices.
import functools
import itertools
import math
class NotAMatrixError(Exception):
pass
class MatrixSizeError(Exception):
def __init__(self, s1, s2):
print('sizes do not match : ', s1, ', '... | output | 1 | 84,549 | 15 | 169,099 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Our bear's forest has a checkered field. The checkered field is an n × n table, the rows are numbered from 1 to n from top to bottom, the columns are numbered from 1 to n from left to right. Let's denote a cell of the field on the intersecti... | instruction | 0 | 84,550 | 15 | 169,100 |
Tags: math, matrices
Correct Solution:
```
mod, sx, sy, dx, dy, t = map(int, input().split())
class Matrix():
def __init__(self, n):
self.n = n
self.a = [[0] * n for _ in range(n)]
def __mul__(self, b):
res = Matrix(self.n)
for i in range(self.n):
for j in range(self... | output | 1 | 84,550 | 15 | 169,101 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The whole world got obsessed with robots,and to keep pace with the progress, great Berland's programmer Draude decided to build his own robot. He was working hard at the robot. He taught it to walk the shortest path from one point to another... | instruction | 0 | 84,734 | 15 | 169,468 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
def main():
path = input()
coordinate = [[0 for i in range(2)] for j in range(len(path)+1)]
coordinate[0] = [0,0]
left = 0
right = 0
up = 0
down = 0
# start = False
for direction in path:
if direction == 'U':
up += 1... | output | 1 | 84,734 | 15 | 169,469 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The whole world got obsessed with robots,and to keep pace with the progress, great Berland's programmer Draude decided to build his own robot. He was working hard at the robot. He taught it to walk the shortest path from one point to another... | instruction | 0 | 84,735 | 15 | 169,470 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
s=input()
a=set()
a.add((0,0))
x=0
y=0
dx=[-1,0,1,0,0]
dy=[0,1,0,-1,0]
d={'L':0,'U':1,'R':2,'D':3}
b=False
for i in s:
x+=dx[d[i]]
y+=dy[d[i]]
c=0
for j in range(5):
if (x+dx[j],y+dy[j]) in a:
c+=1
if c>... | output | 1 | 84,735 | 15 | 169,471 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The whole world got obsessed with robots,and to keep pace with the progress, great Berland's programmer Draude decided to build his own robot. He was working hard at the robot. He taught it to walk the shortest path from one point to another... | instruction | 0 | 84,736 | 15 | 169,472 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
#!/usr/bin/env python
'''
' Author: Cheng-Shih Wong
' Email: mob5566@gmail.com
' Date: 2017-08-07
'''
def main():
walk = {
'L': (0, -1),
'U': (-1, 0),
'R': (0, +1),
'D': (+1, 0)
}
back = {
... | output | 1 | 84,736 | 15 | 169,473 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The whole world got obsessed with robots,and to keep pace with the progress, great Berland's programmer Draude decided to build his own robot. He was working hard at the robot. He taught it to walk the shortest path from one point to another... | instruction | 0 | 84,737 | 15 | 169,474 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
s = input()
x, y = 0, 0
visited = set()
visited.add((x, y))
for i in range(len(s)):
prev = x, y
if s[i] == 'U':
y += 1
elif s[i] == 'D':
y -= 1
elif s[i] == 'R':
x += 1
else:
x -= 1
if (... | output | 1 | 84,737 | 15 | 169,475 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The whole world got obsessed with robots,and to keep pace with the progress, great Berland's programmer Draude decided to build his own robot. He was working hard at the robot. He taught it to walk the shortest path from one point to another... | instruction | 0 | 84,738 | 15 | 169,476 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
import sys
moves = sys.stdin.readline()
grid = []
for i in range(500):
grid.append([])
for j in range(500):
grid[i].append(0)
curx, cury = 250, 250
for move in moves:
if grid[curx][cury] != 0:
print("BUG")
... | output | 1 | 84,738 | 15 | 169,477 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The whole world got obsessed with robots,and to keep pace with the progress, great Berland's programmer Draude decided to build his own robot. He was working hard at the robot. He taught it to walk the shortest path from one point to another... | instruction | 0 | 84,739 | 15 | 169,478 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
import math,sys,bisect,heapq
from collections import defaultdict,Counter,deque
from itertools import groupby,accumulate
#sys.setrecursionlimit(200000000)
int1 = lambda x: int(x) - 1
#def input(): return sys.stdin.readline().strip()
input = iter... | output | 1 | 84,739 | 15 | 169,479 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The whole world got obsessed with robots,and to keep pace with the progress, great Berland's programmer Draude decided to build his own robot. He was working hard at the robot. He taught it to walk the shortest path from one point to another... | instruction | 0 | 84,740 | 15 | 169,480 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
# maa chudaaye duniya
d = [[0,1], [0, -1], [1, 0], [-1, 0], [0, 0]]
path = input()
vis = []
cur = [0, 0]
f = True
for p in path:
prev = cur
if p == 'L': index = 0
elif p == 'R' : index = 1
elif p == 'U' : index = 2
else: index = 3
cur =... | output | 1 | 84,740 | 15 | 169,481 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The whole world got obsessed with robots,and to keep pace with the progress, great Berland's programmer Draude decided to build his own robot. He was working hard at the robot. He taught it to walk the shortest path from one point to another... | instruction | 0 | 84,741 | 15 | 169,482 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
# import numpy as np
s=input()
# g=np.zeros((206,206),dtype=int)
g=[[0 for i in range(206)] for j in range(206)]
x=102
y=102
s=s+'0'
i=0
while s[i]:
g[x][y]=1
if s[i]=='L':
x-=1
elif s[i]=='R':
x+=1
elif s[i]=='U... | output | 1 | 84,741 | 15 | 169,483 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The whole world got obsessed with robots,and to keep pace with the progress, great Berland's programmer Draude decided to build his own robot. He was working hard at the robot. He taught it to w... | instruction | 0 | 84,743 | 15 | 169,486 |
Yes | output | 1 | 84,743 | 15 | 169,487 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The whole world got obsessed with robots,and to keep pace with the progress, great Berland's programmer Draude decided to build his own robot. He was working hard at the robot. He taught it to w... | instruction | 0 | 84,744 | 15 | 169,488 |
Yes | output | 1 | 84,744 | 15 | 169,489 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The whole world got obsessed with robots,and to keep pace with the progress, great Berland's programmer Draude decided to build his own robot. He was working hard at the robot. He taught it to w... | instruction | 0 | 84,745 | 15 | 169,490 |
Yes | output | 1 | 84,745 | 15 | 169,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The whole world got obsessed with robots,and to keep pace with the progress, great Berland's programmer Draude decided to build his own robot. He was working hard at the robot. He taught it to w... | instruction | 0 | 84,748 | 15 | 169,496 |
No | output | 1 | 84,748 | 15 | 169,497 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The whole world got obsessed with robots,and to keep pace with the progress, great Berland's programmer Draude decided to build his own robot. He was working hard at the robot. He taught it to w... | instruction | 0 | 84,749 | 15 | 169,498 |
No | output | 1 | 84,749 | 15 | 169,499 |
Provide a correct Python 3 solution for this coding contest problem.
In your garden, there is a long and narrow flowerbed that stretches infinitely to the east. You have decided to plant N kinds of flowers in this empty flowerbed. For convenience, we will call these N kinds of flowers Flower 1, 2, …, N. Also, we will ... | instruction | 0 | 84,885 | 15 | 169,770 |
"Correct Solution:
```
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, c... | output | 1 | 84,885 | 15 | 169,771 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are four stones on an infinite line in integer coordinates a_1, a_2, a_3, a_4. The goal is to have the stones in coordinates b_1, b_2, b_3, b_4. The order of the stones does not matter, that is, a stone from any position a_i can end up... | instruction | 0 | 85,117 | 15 | 170,234 |
Tags: constructive algorithms
Correct Solution:
```
def gcd(a, b):
while a and b:
a %= b
if a: b %= a
return a + b
def gcd2(A):
r = A[1] - A[0]
for i in (2, 3):
r = gcd(r, A[i] - A[0])
return r
def Mir(x, c): return c * 2 - x
def Solve(A):
A[0].sort()
A[1].sort()
... | output | 1 | 85,117 | 15 | 170,235 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are four stones on an infinite line in integer coordinates a_1, a_2, a_3, a_4. The goal is to have the stones in coordinates b_1, b_2, b_3, b_4. The order of the stones does not matter, that is, a stone from any position a_i can end up... | instruction | 0 | 85,118 | 15 | 170,236 |
Tags: constructive algorithms
Correct Solution:
```
def Output(ans):
if ans is None:
print(-1)
return
print(len(ans))
for x, c in ans: print(x, c)
def fun(a, b):
while a and b:
a %= b
if a: b %= a
return a + b
def fun1(A):
r = A[1] - A[0]
for i in ... | output | 1 | 85,118 | 15 | 170,237 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a square matrix consisting of n rows and n columns. We assume that the rows are numbered from 1 to n from top to bottom and the columns are numbered from 1 to n from left to right.... | instruction | 0 | 85,278 | 15 | 170,556 |
No | output | 1 | 85,278 | 15 | 170,557 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a square matrix consisting of n rows and n columns. We assume that the rows are numbered from 1 to n from top to bottom and the columns are numbered from 1 to n from left to right.... | instruction | 0 | 85,279 | 15 | 170,558 |
No | output | 1 | 85,279 | 15 | 170,559 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a square matrix consisting of n rows and n columns. We assume that the rows are numbered from 1 to n from top to bottom and the columns are numbered from 1 to n from left to right.... | instruction | 0 | 85,280 | 15 | 170,560 |
No | output | 1 | 85,280 | 15 | 170,561 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Game "Minesweeper 1D" is played on a line of squares, the line's height is 1 square, the line's width is n squares. Some of the squares contain bombs. If a square doesn't contain a bomb, then it contains a number from 0 to 2 — the total numb... | instruction | 0 | 85,303 | 15 | 170,606 |
Tags: dp, implementation
Correct Solution:
```
m = 1000000007
a, b, c = 1, 0, 1
for s in input():
if s == '*': a, b, c = 0, b + c, 0
elif s == '?': a, b, c = (a + b) % m, (b + c) % m, (a + b) % m
elif s == '0': a, b, c = a, 0, 0
elif s == '1': a, b, c = b, 0, a
else: a, b, c = 0, 0, b
print((a + b) ... | output | 1 | 85,303 | 15 | 170,607 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Game "Minesweeper 1D" is played on a line of squares, the line's height is 1 square, the line's width is n squares. Some of the squares contain bombs. If a square doesn't contain a bomb, then it contains a number from 0 to 2 — the total numb... | instruction | 0 | 85,304 | 15 | 170,608 |
Tags: dp, implementation
Correct Solution:
```
Mod=1000000007
s=input()
n=len(s)
a,b,c,d=1,0,0,0
for i in range(0,n):
if s[i]=='*':
t=0,a+b+d,0,0
elif s[i]=='?':
t=a+b+c,a+b+d,0,0
elif s[i]=='0':
t=0,0,a+c,0
elif s[i]=='1':
t=0,0,b,a+c
else:
t=0,0,0,b+d
a,... | output | 1 | 85,304 | 15 | 170,609 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Game "Minesweeper 1D" is played on a line of squares, the line's height is 1 square, the line's width is n squares. Some of the squares contain bombs. If a square doesn't contain a bomb, then it contains a number from 0 to 2 — the total numb... | instruction | 0 | 85,305 | 15 | 170,610 |
Tags: dp, implementation
Correct Solution:
```
Mod=1000000007
s=input()
n=len(s)
a,b,c,d=1,0,0,0
for i in range(0,n):
if s[i]=='*':
a,b,c,d=0,(a+b+d)%Mod,0,0
elif s[i]=='?':
a,b,c,d=(a+b+c)%Mod,(a+b+d)%Mod,0,0
elif s[i]=='0':
a,b,c,d=0,0,(a+c)%Mod,0
elif s[i]=='1':
a,b,c,... | output | 1 | 85,305 | 15 | 170,611 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Game "Minesweeper 1D" is played on a line of squares, the line's height is 1 square, the line's width is n squares. Some of the squares contain bombs. If a square doesn't contain a bomb, then it contains a number from 0 to 2 — the total numb... | instruction | 0 | 85,306 | 15 | 170,612 |
Tags: dp, implementation
Correct Solution:
```
# python txdy!
mod=1000000007
a,b,c=1,0,1
for s in input():
if s=='*':a,b,c=0,b+c,0
elif s=='?':a,b,c=(a+b)%mod,(b+c)%mod,(a+b)%mod
elif s=='0':a,b,c=a,0,0
elif s=='1':a,b,c=b,0,a
else: a,b,c=0,0,b
print((a+b)%mod)
``` | output | 1 | 85,306 | 15 | 170,613 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Game "Minesweeper 1D" is played on a line of squares, the line's height is 1 square, the line's width is n squares. Some of the squares contain bombs. If a square doesn't contain a bomb, then it contains a number from 0 to 2 — the total numb... | instruction | 0 | 85,307 | 15 | 170,614 |
Tags: dp, implementation
Correct Solution:
```
s=input()
n=len(s)
a,b,c,d=1,0,0,0
for i in range(0,n):
if s[i]=='*':
a,b,c,d=0,(a+b+d)% 1000000007,0,0
elif s[i]=='?':
a,b,c,d=(a+b+c)% 1000000007,(a+b+d)% 1000000007,0,0
elif s[i]=='0':
a,b,c,d=0,0,(a+c)% 1000000007,0
elif s[i]=='1... | output | 1 | 85,307 | 15 | 170,615 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Game "Minesweeper 1D" is played on a line of squares, the line's height is 1 square, the line's width is n squares. Some of the squares contain bombs. If a square doesn't contain a bomb, then it... | instruction | 0 | 85,308 | 15 | 170,616 |
No | output | 1 | 85,308 | 15 | 170,617 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Game "Minesweeper 1D" is played on a line of squares, the line's height is 1 square, the line's width is n squares. Some of the squares contain bombs. If a square doesn't contain a bomb, then it... | instruction | 0 | 85,309 | 15 | 170,618 |
No | output | 1 | 85,309 | 15 | 170,619 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Game "Minesweeper 1D" is played on a line of squares, the line's height is 1 square, the line's width is n squares. Some of the squares contain bombs. If a square doesn't contain a bomb, then it... | instruction | 0 | 85,310 | 15 | 170,620 |
No | output | 1 | 85,310 | 15 | 170,621 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Game "Minesweeper 1D" is played on a line of squares, the line's height is 1 square, the line's width is n squares. Some of the squares contain bombs. If a square doesn't contain a bomb, then it... | instruction | 0 | 85,311 | 15 | 170,622 |
No | output | 1 | 85,311 | 15 | 170,623 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me lift the veil of secrecy.
Lara is going to exp... | instruction | 0 | 85,487 | 15 | 170,974 |
Tags: implementation, math
Correct Solution:
```
s = input().split(); n,m,k = int(s[0]),int(s[1]),int(s[2])
x,y = 0,0
if k < (n + m - 1):
if k <= n - 1:
x = k + 1
y = 1
elif k >= n:
x = n
y = k - n + 2
else:
k = k - (n + m - 2)
m = m - 1
if k%m == 0:
x = k//m... | output | 1 | 85,487 | 15 | 170,975 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me lift the veil of secrecy.
Lara is going to exp... | instruction | 0 | 85,488 | 15 | 170,976 |
Tags: implementation, math
Correct Solution:
```
n,m,k=map(int,input().split())
if (k<n):
print(k+1," ",1,sep="")
else:
k-=n
if (m>=2):
x=k//(m-1)
if x%2==0:
a=k%(m-1) +2
b=n-x
else:
a=(m-k%(m-1))
... | output | 1 | 85,488 | 15 | 170,977 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me lift the veil of secrecy.
Lara is going to exp... | instruction | 0 | 85,489 | 15 | 170,978 |
Tags: implementation, math
Correct Solution:
```
n, m, k = [int(x) for x in input().split()]
if k < n:
print(k+1, 1)
else:
k += 1
row_num = (k-n-1) // (m-1)
col_num = (k-n-1) % (m-1)
if row_num % 2:
print(n-row_num, m-col_num)
else:
print(n-row_num, col_num+2)
``` | output | 1 | 85,489 | 15 | 170,979 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me lift the veil of secrecy.
Lara is going to exp... | instruction | 0 | 85,490 | 15 | 170,980 |
Tags: implementation, math
Correct Solution:
```
n,m,k=map(int,input().split())
if k<n:
print(k+1,1)
else:
k-=n
floor=n-k//(m-1)
if floor%2:
print(floor, m-k%(m-1))
else:
print(floor, (k%(m-1))+2)
``` | output | 1 | 85,490 | 15 | 170,981 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me lift the veil of secrecy.
Lara is going to exp... | instruction | 0 | 85,491 | 15 | 170,982 |
Tags: implementation, math
Correct Solution:
```
n, m, k = map(int, input().split())
if k < n:
print(k+1, 1)
else:
k = k-(n-1)
tmp = k//(2*(m-1))
k = k%(2*(m-1))
x, y = n-2*tmp+1, 2
if k > 0:
x = x-1
k = k-1
if k <= m-2:
y = y+k
else:
k = k... | output | 1 | 85,491 | 15 | 170,983 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me lift the veil of secrecy.
Lara is going to exp... | instruction | 0 | 85,492 | 15 | 170,984 |
Tags: implementation, math
Correct Solution:
```
n,m,k = map(int, input().split())
# n=4 m=3 k=0
if k <= n-1: # k = 3
print(k+1, 1)
else:
k = k-n+1
level = (k-1) // (m-1)
k = (k-1) % (m-1)
if level % 2 == 0:
print(n-level, k+2)
else:
print(n-level, m-k)
``` | output | 1 | 85,492 | 15 | 170,985 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me lift the veil of secrecy.
Lara is going to exp... | instruction | 0 | 85,493 | 15 | 170,986 |
Tags: implementation, math
Correct Solution:
```
#!/usr/bin/env python3
n, m, k = map(int, input().split(' '))
if k < n:
print(k + 1, 1)
else:
k -= n
m -= 1
row = n - k//m
k %= m
if row % 2 == 0:
print(row, 2 + k)
else:
print(row, 1 + (m -k))
``` | output | 1 | 85,493 | 15 | 170,987 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me lift the veil of secrecy.
Lara is going to exp... | instruction | 0 | 85,494 | 15 | 170,988 |
Tags: implementation, math
Correct Solution:
```
n, m, k = map(int, input().split())
X = 0
Y = 0
if k < n:
X = k + 1
Y = 1
elif k >= n and k <= m + n - 2:
X = n
Y = k - n + 2
else:
k -= n + m - 1
temp = k // (m - 1)
X = (n - 1) - temp
isEven = X % 2 == 0
remains = k % (m - 1)
if... | output | 1 | 85,494 | 15 | 170,989 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me ... | instruction | 0 | 85,495 | 15 | 170,990 |
Yes | output | 1 | 85,495 | 15 | 170,991 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.