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 |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Artem found a grasshopper. He brought it to his house and constructed a jumping area for him.
The area looks like a strip of cells 1 × n. Each cell contains the direction for the next jump and the length of that jump. Grasshopper sta... | instruction | 0 | 94,841 | 15 | 189,682 |
Tags: implementation
Correct Solution:
```
n = int(input())
s = input()
p = 0
k = 0
a = list(map(int, input().split()))
for i in range(2 * n):
if s[p] == '>':
p += a[p]
else:
p -= a[p]
if (p > n - 1) or (p < 0):
print("FINITE")
k = 1
break
if not k:
print("INFINIT... | output | 1 | 94,841 | 15 | 189,683 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Artem found a grasshopper. He brought it to his house and constructed a jumping area for him.
The area looks like a strip of cells 1 × n. Each cell contains the direction for the next jump and the length of that jump. Grasshopper sta... | instruction | 0 | 94,842 | 15 | 189,684 |
Tags: implementation
Correct Solution:
```
def main():
n = int(input())
arrows = input()
cells = [int(x) for x in input().split()]
print(solver(arrows, cells))
def solver(arrows, cells):
for i in range(len(arrows)):
if arrows[i] == '<':
cells[i] = - cells[i]
visited = [False] * len(cells)
index = 0
while ... | output | 1 | 94,842 | 15 | 189,685 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Artem found a grasshopper. He brought it to his house and constructed a jumping area for him.
The area looks like a strip of cells 1 × n. Each cell contains the direction for the next jump and the length of that jump. Grasshopper sta... | instruction | 0 | 94,843 | 15 | 189,686 |
Tags: implementation
Correct Solution:
```
n = int(input())-1
s = input()
d = [int(i) for i in input().split()]
c = True
cnt = 0
i = 0
z = 0
while i<=n and i>=0:
if s[i]:
if s[i]==">":
i+=d[i]
z+=1
elif s[i]=="<":
i-=d[i]
z+=1
else:
break
if z>=2*n:c=False;break
if i>n or i<0:
print("FINITE")
else... | output | 1 | 94,843 | 15 | 189,687 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Artem found a grasshopper. He brought it to his house and constructed a jumping area for him.
The area looks like a strip of cells 1 × n. Each cell contains the direction for the next jump and the length of that jump. Grasshopper sta... | instruction | 0 | 94,844 | 15 | 189,688 |
Tags: implementation
Correct Solution:
```
if __name__ == '__main__':
Y = lambda: list(map(int, input().split()))
N = lambda: int(input())
n = N()
s = input()
a = Y()
nxt, ans = 0, 0
for i in range(n):
nxt += [a[nxt], -a[nxt]][s[nxt] == '<']
if nxt >= n or nxt < 0:
... | output | 1 | 94,844 | 15 | 189,689 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Artem found a grasshopper. He brought it to his house and constructed a jumping area for him.
The area looks like a strip of cells 1 × n. Each cell contains the direction for the next jump and the length of that jump. Grasshopper sta... | instruction | 0 | 94,845 | 15 | 189,690 |
Tags: implementation
Correct Solution:
```
n=int(input())
s=input()
a=list(map(int,input().split()))
f=n*[False]
i,j=0,0
while True:
# print(i,f[i])
if i<0 or i>=n or n==1:
print("FINITE")
break
elif f[i]==True:
print("INFINITE")
break
else:
f[i]=True
i... | output | 1 | 94,845 | 15 | 189,691 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Artem found a grasshopper. He brought it to his house and constructed a jumping area for him.
The area looks like a strip of cells 1 × n. Each cell contains the direction for the next ju... | instruction | 0 | 94,846 | 15 | 189,692 |
Yes | output | 1 | 94,846 | 15 | 189,693 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Artem found a grasshopper. He brought it to his house and constructed a jumping area for him.
The area looks like a strip of cells 1 × n. Each cell contains the direction for the next ju... | instruction | 0 | 94,847 | 15 | 189,694 |
Yes | output | 1 | 94,847 | 15 | 189,695 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Artem found a grasshopper. He brought it to his house and constructed a jumping area for him.
The area looks like a strip of cells 1 × n. Each cell contains the direction for the next ju... | instruction | 0 | 94,848 | 15 | 189,696 |
Yes | output | 1 | 94,848 | 15 | 189,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Artem found a grasshopper. He brought it to his house and constructed a jumping area for him.
The area looks like a strip of cells 1 × n. Each cell contains the direction for the next ju... | instruction | 0 | 94,849 | 15 | 189,698 |
Yes | output | 1 | 94,849 | 15 | 189,699 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Artem found a grasshopper. He brought it to his house and constructed a jumping area for him.
The area looks like a strip of cells 1 × n. Each cell contains the direction for the next ju... | instruction | 0 | 94,850 | 15 | 189,700 |
No | output | 1 | 94,850 | 15 | 189,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Artem found a grasshopper. He brought it to his house and constructed a jumping area for him.
The area looks like a strip of cells 1 × n. Each cell contains the direction for the next ju... | instruction | 0 | 94,851 | 15 | 189,702 |
No | output | 1 | 94,851 | 15 | 189,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Artem found a grasshopper. He brought it to his house and constructed a jumping area for him.
The area looks like a strip of cells 1 × n. Each cell contains the direction for the next ju... | instruction | 0 | 94,852 | 15 | 189,704 |
No | output | 1 | 94,852 | 15 | 189,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Artem found a grasshopper. He brought it to his house and constructed a jumping area for him.
The area looks like a strip of cells 1 × n. Each cell contains the direction for the next ju... | instruction | 0 | 94,853 | 15 | 189,706 |
No | output | 1 | 94,853 | 15 | 189,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Artem is fond of dancing. Most of all dances Artem likes rueda — Cuban dance that is danced by pairs of boys and girls forming a circle and dancing together.
More detailed, there are n p... | instruction | 0 | 94,855 | 15 | 189,710 |
No | output | 1 | 94,855 | 15 | 189,711 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke, a water strider, lives in a rectangular pond that can be seen as a grid with H east-west rows and W north-south columns. Let (i,j) be the square at the i-th row from the north and j-th column from the west.
Some of the squares have a lotus le... | instruction | 0 | 95,031 | 15 | 190,062 |
"Correct Solution:
```
import collections
H,W,K = map(int,input().split())
s1,e1,s2,e2 = map(int,input().split())
s1-=1
e1-=1
s2-=1
e2-=1
L = []
board = []
for _ in range(H):
a = input()
L.append(a)
for i in range(H):
l = L[i]
tmp = []
for j in range(len(l)):
tmp.append(l[j])
board.appen... | output | 1 | 95,031 | 15 | 190,063 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke, a water strider, lives in a rectangular pond that can be seen as a grid with H east-west rows and W north-south columns. Let (i,j) be the square at the i-th row from the north and j-th column from the west.
Some of the squares have a lotus le... | instruction | 0 | 95,032 | 15 | 190,064 |
"Correct Solution:
```
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
import sys
import math
def LI(): return [int(x) for x in sys.stdin.readline().split()]
dd = [(1,0),(-1,0),(0,1),(0,-1)]
def solve():
h,w,k = LI()
y,x,s,t = LI()
y -= 1
x -= 1
... | output | 1 | 95,032 | 15 | 190,065 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke, a water strider, lives in a rectangular pond that can be seen as a grid with H east-west rows and W north-south columns. Let (i,j) be the square at the i-th row from the north and j-th column from the west.
Some of the squares have a lotus le... | instruction | 0 | 95,033 | 15 | 190,066 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
H,W,K = map(int, input().split())
x1,y1,x2,y2 = map(int, input().split())
C = [input() for _ in range(H)]
T = [[-1 for _ in range(W)] for _ in range(H)]
T[x1-1][y1-1] = 0
que = {(x1-1,y1-1):0}
step = 1
while len(que)>0:
que_next = {}
for q in que.keys():
x,y = ... | output | 1 | 95,033 | 15 | 190,067 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke, a water strider, lives in a rectangular pond that can be seen as a grid with H east-west rows and W north-south columns. Let (i,j) be the square at the i-th row from the north and j-th column from the west.
Some of the squares have a lotus le... | instruction | 0 | 95,034 | 15 | 190,068 |
"Correct Solution:
```
#
import sys
from collections import deque
input=sys.stdin.readline
def main():
H,W,K=map(int,input().split())
x1,y1,x2,y2=map(int,input().split())
x1-=1
y1-=1
x2-=1
y2-=1
mas=[list(input()) for i in range(H)]
dist=[[-1]*W for i in range(H)]
dist[x1][y1]=0
... | output | 1 | 95,034 | 15 | 190,069 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke, a water strider, lives in a rectangular pond that can be seen as a grid with H east-west rows and W north-south columns. Let (i,j) be the square at the i-th row from the north and j-th column from the west.
Some of the squares have a lotus le... | instruction | 0 | 95,035 | 15 | 190,070 |
"Correct Solution:
```
#16:41
h,w,k = map(int,input().split())
x1,y1,x2,y2 = map(lambda x:int(x)-1, input().split())
raw = []
for _ in range(h):
raw.append(input())
inf = 10**6
seen = [[inf for _ in range(w)] for _ in range(h)]
seen[x1][y1] = 0
from heapq import heappush as push
from heapq import heappop as pop
now =... | output | 1 | 95,035 | 15 | 190,071 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke, a water strider, lives in a rectangular pond that can be seen as a grid with H east-west rows and W north-south columns. Let (i,j) be the square at the i-th row from the north and j-th column from the west.
Some of the squares have a lotus le... | instruction | 0 | 95,036 | 15 | 190,072 |
"Correct Solution:
```
from heapq import heappop, heappush
from collections import deque
def dijkstra(xs, ys, xg, yg,h,w,k,field):
# que->(cost, x, y, direction)
inf = 1e18
dist = [[inf]*w for _ in range(h)]
dist[xs][ys] = 0
que = deque([(0, xs, ys)])
dx = [-1, 0, 1, 0]
dy = [0, 1, 0, -1]
... | output | 1 | 95,036 | 15 | 190,073 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke, a water strider, lives in a rectangular pond that can be seen as a grid with H east-west rows and W north-south columns. Let (i,j) be the square at the i-th row from the north and j-th column from the west.
Some of the squares have a lotus le... | instruction | 0 | 95,037 | 15 | 190,074 |
"Correct Solution:
```
from collections import deque
H,W,K = map(int,input().split())
x1,y1,x2,y2 = map(int,input().split())
maze = []
maze.append(["@"]*(W+2))
for _ in range(H):
row = list(input())
maze.append(["@"]+row+["@"])
maze.append(["@"]*(W+2))
q = deque([(x1,y1)])
depth = 0
while q:
for i,j in q:
m... | output | 1 | 95,037 | 15 | 190,075 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke, a water strider, lives in a rectangular pond that can be seen as a grid with H east-west rows and W north-south columns. Let (i,j) be the square at the i-th row from the north and j-th column from the west.
Some of the squares have a lotus le... | instruction | 0 | 95,038 | 15 | 190,076 |
"Correct Solution:
```
#import heapq
from collections import deque
h,w,k = list(map(int, input().split()))
x1,y1,x2,y2 = list(map(int, input().split()))
x1,y1,x2,y2 = x1-1,y1-1,x2-1,y2-1
dp = [[-1]*w for _ in range(h)]
#que = []
que = deque()
c = [input() for _ in range(h)]
dp[x1][y1] = 0
#heapq.heappush(que, (dp[x1][... | output | 1 | 95,038 | 15 | 190,077 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This morning Tolik has understood that while he was sleeping he had invented an incredible problem which will be a perfect fit for Codeforces! But, as a "Discuss tasks" project hasn't been born yet (in English, well), he decides to test a pr... | instruction | 0 | 95,335 | 15 | 190,670 |
Tags: constructive algorithms
Correct Solution:
```
#------------------------------warmup----------------------------
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = Byt... | output | 1 | 95,335 | 15 | 190,671 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This morning Tolik has understood that while he was sleeping he had invented an incredible problem which will be a perfect fit for Codeforces! But, as a "Discuss tasks" project hasn't been born yet (in English, well), he decides to test a pr... | instruction | 0 | 95,336 | 15 | 190,672 |
Tags: constructive algorithms
Correct Solution:
```
import sys
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
n, m = list(map(int, sys.stdin.readline().strip().split()))
upr = 1
dwr = n
while(upr < dwr):
upc = 1
dwc = m
for i in range(m):
sys.stdout.write(str(upr) + ' '... | output | 1 | 95,336 | 15 | 190,673 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This morning Tolik has understood that while he was sleeping he had invented an incredible problem which will be a perfect fit for Codeforces! But, as a "Discuss tasks" project hasn't been born yet (in English, well), he decides to test a pr... | instruction | 0 | 95,337 | 15 | 190,674 |
Tags: constructive algorithms
Correct Solution:
```
import sys
import math
from collections import defaultdict
n,m=map(int,sys.stdin.readline().split())
#cur=[1,1]
#ans=[-1 for _ in range(2*n*m)]
up,down=1,n
count=0
while up<=down:
left,right=1,m
#ans.append(cur)
while left<=m and count<n*m:
#ans.ap... | output | 1 | 95,337 | 15 | 190,675 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This morning Tolik has understood that while he was sleeping he had invented an incredible problem which will be a perfect fit for Codeforces! But, as a "Discuss tasks" project hasn't been born yet (in English, well), he decides to test a pr... | instruction | 0 | 95,338 | 15 | 190,676 |
Tags: constructive algorithms
Correct Solution:
```
import sys
m, n = [int(i) for i in input().split()]
data = [0] * (m+1)
for i in range((m+1)//2 ):
data[2*i] = i+1
data[2*i+1] = m - i
for x in range(n//2):
for i in range(m):
sys.stdout.write(str(i+1) + ' ' + str(x+1) + '\n')
sys.stdout.... | output | 1 | 95,338 | 15 | 190,677 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This morning Tolik has understood that while he was sleeping he had invented an incredible problem which will be a perfect fit for Codeforces! But, as a "Discuss tasks" project hasn't been born yet (in English, well), he decides to test a pr... | instruction | 0 | 95,339 | 15 | 190,678 |
Tags: constructive algorithms
Correct Solution:
```
import math
import sys
n,m=[int(x) for x in input().split()]
answer=[]
x=math.ceil(n/2)
y=n%2
for i in range(1,math.ceil(n/2)+1):
if y==1 and i==x:
for j in range(1,m//2+1):
answer.append(str(i)+' '+str(j))
answer.... | output | 1 | 95,339 | 15 | 190,679 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This morning Tolik has understood that while he was sleeping he had invented an incredible problem which will be a perfect fit for Codeforces! But, as a "Discuss tasks" project hasn't been born yet (in English, well), he decides to test a pr... | instruction | 0 | 95,340 | 15 | 190,680 |
Tags: constructive algorithms
Correct Solution:
```
if __name__ == "__main__":
n, m = [int(x) for x in input().split()]
#n, m = map(int, input().split())
answer = []
for i in range((n + 1) // 2):
for j in range(m):
if i == n // 2 and j == m // 2:
if m % 2 == 0:
... | output | 1 | 95,340 | 15 | 190,681 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This morning Tolik has understood that while he was sleeping he had invented an incredible problem which will be a perfect fit for Codeforces! But, as a "Discuss tasks" project hasn't been born yet (in English, well), he decides to test a pr... | instruction | 0 | 95,341 | 15 | 190,682 |
Tags: constructive algorithms
Correct Solution:
```
n, m = tuple(map(int, input().split()))
if n==1 and m==1:
print('1 1')
exit()
def onerow(r, m):
for i in range(1, (m+1)//2 + 1):
# print('Here', i)
print(str(r) + ' ' + str(i))
if m%2 == 0 or i != (m+1)//2:
print(str(r... | output | 1 | 95,341 | 15 | 190,683 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This morning Tolik has understood that while he was sleeping he had invented an incredible problem which will be a perfect fit for Codeforces! But, as a "Discuss tasks" project hasn't been born yet (in English, well), he decides to test a pr... | instruction | 0 | 95,342 | 15 | 190,684 |
Tags: constructive algorithms
Correct Solution:
```
import sys
input=sys.stdin.buffer.readline
n,m=map(int,input().split())
for i in range(n//2+n%2):
x1=i+1
x2=n-i
if(x1==x2):
for j in range(m//2+m%2):
if(j+1==m-j):
sys.stdout.write((str(x1)+" "+str(j+1)+"\n"))
... | output | 1 | 95,342 | 15 | 190,685 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This morning Tolik has understood that while he was sleeping he had invented an incredible problem which will be a perfect fit for Codeforces! But, as a "Discuss tasks" project hasn't been born ... | instruction | 0 | 95,343 | 15 | 190,686 |
Yes | output | 1 | 95,343 | 15 | 190,687 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This morning Tolik has understood that while he was sleeping he had invented an incredible problem which will be a perfect fit for Codeforces! But, as a "Discuss tasks" project hasn't been born ... | instruction | 0 | 95,344 | 15 | 190,688 |
Yes | output | 1 | 95,344 | 15 | 190,689 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This morning Tolik has understood that while he was sleeping he had invented an incredible problem which will be a perfect fit for Codeforces! But, as a "Discuss tasks" project hasn't been born ... | instruction | 0 | 95,345 | 15 | 190,690 |
Yes | output | 1 | 95,345 | 15 | 190,691 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This morning Tolik has understood that while he was sleeping he had invented an incredible problem which will be a perfect fit for Codeforces! But, as a "Discuss tasks" project hasn't been born ... | instruction | 0 | 95,346 | 15 | 190,692 |
Yes | output | 1 | 95,346 | 15 | 190,693 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This morning Tolik has understood that while he was sleeping he had invented an incredible problem which will be a perfect fit for Codeforces! But, as a "Discuss tasks" project hasn't been born ... | instruction | 0 | 95,347 | 15 | 190,694 |
No | output | 1 | 95,347 | 15 | 190,695 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This morning Tolik has understood that while he was sleeping he had invented an incredible problem which will be a perfect fit for Codeforces! But, as a "Discuss tasks" project hasn't been born ... | instruction | 0 | 95,348 | 15 | 190,696 |
No | output | 1 | 95,348 | 15 | 190,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This morning Tolik has understood that while he was sleeping he had invented an incredible problem which will be a perfect fit for Codeforces! But, as a "Discuss tasks" project hasn't been born ... | instruction | 0 | 95,349 | 15 | 190,698 |
No | output | 1 | 95,349 | 15 | 190,699 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This morning Tolik has understood that while he was sleeping he had invented an incredible problem which will be a perfect fit for Codeforces! But, as a "Discuss tasks" project hasn't been born ... | instruction | 0 | 95,350 | 15 | 190,700 |
No | output | 1 | 95,350 | 15 | 190,701 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY got hooked on square matrices. Now he is busy studying an n × n size matrix, where n is odd. The Smart Beaver considers the following matrix elements good:
* Elements of the main diagonal.
* Elements of the... | instruction | 0 | 95,536 | 15 | 191,072 |
Tags: implementation
Correct Solution:
```
n = int(input())
mat = []
for i in range(n):
m_ = input()
m_ = m_.split(' ')
mat.append(m_)
i = 0
s=0
m = int((n-1)/2)
while i<n:
if i != m:
s += int(mat[i][i]) + int(mat[i][n-i-1]) + int(mat[i][m])
else:
pass
i += 1
i=0
while i<n:
... | output | 1 | 95,536 | 15 | 191,073 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY got hooked on square matrices. Now he is busy studying an n × n size matrix, where n is odd. The Smart Beaver considers the following matrix elements good:
* Elements of the main diagonal.
* Elements of the... | instruction | 0 | 95,537 | 15 | 191,074 |
Tags: implementation
Correct Solution:
```
import time
import collections
class Time_test:
def __enter__(self):
self.enter_time = time.time()
def __exit__(self, exc_type, exc_val, exc_tb):
print("Command was executed in", time.time()-self.enter_time)
n = int(input())
s = 0
for i in range(n):
... | output | 1 | 95,537 | 15 | 191,075 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY got hooked on square matrices. Now he is busy studying an n × n size matrix, where n is odd. The Smart Beaver considers the following matrix elements good:
* Elements of the main diagonal.
* Elements of the... | instruction | 0 | 95,538 | 15 | 191,076 |
Tags: implementation
Correct Solution:
```
n=int(input())
k=[]
sum1=0
sum2=0
sum3=0
sum4=0
for i in range(n):
k.append(list(map(int,input().split())))
for i in range(len(k)):
sum1=sum1+k[i][i]
sum2=sum2+k[i][(len(k)-1)-i]
sum3=sum3+k[int(len(k)/2)][i]
sum4=sum4+k[i][int(len(k)/2)]
j=k[int(len(k)/2)][int(len(k)... | output | 1 | 95,538 | 15 | 191,077 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY got hooked on square matrices. Now he is busy studying an n × n size matrix, where n is odd. The Smart Beaver considers the following matrix elements good:
* Elements of the main diagonal.
* Elements of the... | instruction | 0 | 95,539 | 15 | 191,078 |
Tags: implementation
Correct Solution:
```
import sys
def main():
inp = sys.stdin.read().strip().split('\n')
n = int(inp[0])
m = [[int(x) for x in s.split()] for s in inp[1:]]
s = sum(m[i][i] + m[i][-i-1] + m[i][n//2] + m[n//2][i] for i in range(n))
return s - 3*m[n//2][n//2]
print(main()... | output | 1 | 95,539 | 15 | 191,079 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY got hooked on square matrices. Now he is busy studying an n × n size matrix, where n is odd. The Smart Beaver considers the following matrix elements good:
* Elements of the main diagonal.
* Elements of the... | instruction | 0 | 95,540 | 15 | 191,080 |
Tags: implementation
Correct Solution:
```
N = int( input() )
mat = list( list( map( int, input().split() ) ) for i in range( N ) )
ans = 0
for i in range( N ):
ans += mat[ i ][ i ]
ans += mat[ N - 1 - i ][ i ]
ans += mat[ N >> 1 ][ i ]
ans += mat[ i ][ N >> 1 ]
print( ans - mat[ N >> 1 ][ N >> 1 ] * 3 )
``` | output | 1 | 95,540 | 15 | 191,081 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY got hooked on square matrices. Now he is busy studying an n × n size matrix, where n is odd. The Smart Beaver considers the following matrix elements good:
* Elements of the main diagonal.
* Elements of the... | instruction | 0 | 95,541 | 15 | 191,082 |
Tags: implementation
Correct Solution:
```
n = int(input())
grid = []
for i in range(n):
row = [int(i) for i in input().split()]
grid.append(row)
sum = 0
for i in range(n):
for j in range(n):
if i == j or i == n - 1 - j or i == (n - 1) / 2 or j == (n - 1) / 2:
sum += grid[i][j]
print(sum)
``` | output | 1 | 95,541 | 15 | 191,083 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY got hooked on square matrices. Now he is busy studying an n × n size matrix, where n is odd. The Smart Beaver considers the following matrix elements good:
* Elements of the main diagonal.
* Elements of the... | instruction | 0 | 95,542 | 15 | 191,084 |
Tags: implementation
Correct Solution:
```
row=int(input())
matrix=[]
for i in range(row):
r=list(map(int, input().split()))
matrix.append(r)
p=row-1
count=0
for i in range(row):
count += matrix[i][i]
count += matrix[p-i][i]
count += matrix[int(((p-1)/2)+1)][i]
count += matrix[i][int(((p - 1) / ... | output | 1 | 95,542 | 15 | 191,085 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY got hooked on square matrices. Now he is busy studying an n × n size matrix, where n is odd. The Smart Beaver considers the following matrix elements good:
* Elements of the main diagonal.
* Elements of the... | instruction | 0 | 95,543 | 15 | 191,086 |
Tags: implementation
Correct Solution:
```
n = int(input())
matrix = [[int(j) for j in input().split()] for i in range(n)]
summ=0
k=n//2
for i in range(n):
for j in range(n):
if i==j:
summ = summ + matrix[i][j]
elif i+j+1 ==n:
summ = summ + matrix[i][j]
elif i==k:
... | output | 1 | 95,543 | 15 | 191,087 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Smart Beaver from ABBYY got hooked on square matrices. Now he is busy studying an n × n size matrix, where n is odd. The Smart Beaver considers the following matrix elements good:
* Elem... | instruction | 0 | 95,547 | 15 | 191,094 |
Yes | output | 1 | 95,547 | 15 | 191,095 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Smart Beaver from ABBYY got hooked on square matrices. Now he is busy studying an n × n size matrix, where n is odd. The Smart Beaver considers the following matrix elements good:
* Elem... | instruction | 0 | 95,549 | 15 | 191,098 |
No | output | 1 | 95,549 | 15 | 191,099 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bajtek is learning to skate on ice. He's a beginner, so his only mode of transportation is pushing off from a snow drift to the north, east, south or west and sliding until he lands in another snow drift. He has noticed that in this way it's... | instruction | 0 | 96,401 | 15 | 192,802 |
Tags: brute force, dfs and similar, dsu, graphs
Correct Solution:
```
#start the code from here
n=int(input())
global parent
parent=[i for i in range(n)]
# n is total number of nodes
# finding parent of a node
def find(w):
global parent
if parent[w]==w:
return w
else:
return find(parent[w])
def union(a,b):
... | output | 1 | 96,401 | 15 | 192,803 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bajtek is learning to skate on ice. He's a beginner, so his only mode of transportation is pushing off from a snow drift to the north, east, south or west and sliding until he lands in another snow drift. He has noticed that in this way it's... | instruction | 0 | 96,402 | 15 | 192,804 |
Tags: brute force, dfs and similar, dsu, graphs
Correct Solution:
```
def dfs(node):
vis[node]=1
for i in range(n):
if (X[i]==X[node] or Y[i]==Y[node]) and vis[i]==0:
dfs(i)
r=[-1 for i in range(2005)]
n=int(input())
X,Y=[],[]
vis=[0]*101
for i in range(n):
x,y=map(int,input().split())
X.append(x)
Y.appen... | output | 1 | 96,402 | 15 | 192,805 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.