message stringlengths 2 44.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 276 109k | cluster float64 23 23 | __index_level_0__ int64 552 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya has recently started working as a programmer in the IT city company that develops computer games.
Besides game mechanics implementation to create a game it is necessary to create tool pro... | instruction | 0 | 53,510 | 23 | 107,020 |
No | output | 1 | 53,510 | 23 | 107,021 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n points marked on the plane. The points are situated in such a way that they form a regular polygon (marked points are its vertices, and they are numbered in counter-clockwise order). You can draw n - 1 segments, each connecting a... | instruction | 0 | 53,603 | 23 | 107,206 |
Tags: dp, graphs
Correct Solution:
```
import sys
from array import array
n = int(input())
edge = [list(map(int, input().split())) for _ in range(n)]
mod = 10**9 + 7
dp_f = [array('i', [-1])*n for _ in range(n)]
dp_g = [array('i', [-1])*n for _ in range(n)]
for i in range(n):
dp_f[i][i] = dp_g[i][i] = 1
for i i... | output | 1 | 53,603 | 23 | 107,207 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n points marked on the plane. The points are situated in such a way that they form a regular polygon (marked points are its vertices, and they are numbered in counter-clockwise order).... | instruction | 0 | 53,604 | 23 | 107,208 |
No | output | 1 | 53,604 | 23 | 107,209 |
Provide a correct Python 3 solution for this coding contest problem.
There are N lines in the xy-plane. The i-th line is represented by A_ix+B_iy=C_i. Any two lines among the N+2 lines, the above N lines plus the x-axis and y-axis, cross each other at exactly one point.
For each pair 1 \leq i < j \leq N, there is a c... | instruction | 0 | 53,767 | 23 | 107,534 |
"Correct Solution:
```
def addbit(i):
i += 1
while i <= N:
BIT[i] += 1
i += i & (-i)
def getsum(i):
ret = 0
i += 1
while i != 0:
ret += BIT[i]
i -= i&(-i)
return ret
def bit(L):
global BIT
BIT=[0] * (N+1)
re = 0
for l in L:
re += getsum(l)
... | output | 1 | 53,767 | 23 | 107,535 |
Provide a correct Python 3 solution for this coding contest problem.
There are N lines in the xy-plane. The i-th line is represented by A_ix+B_iy=C_i. Any two lines among the N+2 lines, the above N lines plus the x-axis and y-axis, cross each other at exactly one point.
For each pair 1 \leq i < j \leq N, there is a c... | instruction | 0 | 53,768 | 23 | 107,536 |
"Correct Solution:
```
def addbit(i):
i += 1
while i <= N:
BIT[i] += 1
i += i & (-i)
def getsum(i):
ret = 0
i += 1
while i != 0:
ret += BIT[i]
i -= i&(-i)
return ret
def bit(L):
global BIT
BIT=[0] * (N+1)
re = 0
for l in L:
re += getsum(l)
... | output | 1 | 53,768 | 23 | 107,537 |
Provide a correct Python 3 solution for this coding contest problem.
There are N lines in the xy-plane. The i-th line is represented by A_ix+B_iy=C_i. Any two lines among the N+2 lines, the above N lines plus the x-axis and y-axis, cross each other at exactly one point.
For each pair 1 \leq i < j \leq N, there is a c... | instruction | 0 | 53,769 | 23 | 107,538 |
"Correct Solution:
```
def addbit(i):
i += 1
while i <= N:
BIT[i] += 1
i += i & (-i)
def getsum(i):
ret = 0
i += 1
while i != 0:
ret += BIT[i]
i -= i&(-i)
return ret
def bit(L):
global BIT
BIT=[0] * (N+1)
re = 0
for l in L:
re += getsum(l)
... | output | 1 | 53,769 | 23 | 107,539 |
Provide a correct Python 3 solution for this coding contest problem.
There are N lines in the xy-plane. The i-th line is represented by A_ix+B_iy=C_i. Any two lines among the N+2 lines, the above N lines plus the x-axis and y-axis, cross each other at exactly one point.
For each pair 1 \leq i < j \leq N, there is a c... | instruction | 0 | 53,770 | 23 | 107,540 |
"Correct Solution:
```
def addbit(i):
i += 1
while i <= N:
BIT[i] += 1
i += i & (-i)
def getsum(i):
ret = 0
i += 1
while i != 0:
ret += BIT[i]
i -= i&(-i)
return ret
def bit(L):
global BIT
BIT=[0] * (N+1)
re = 0
for l in L:
re += getsum(l)
... | output | 1 | 53,770 | 23 | 107,541 |
Provide a correct Python 3 solution for this coding contest problem.
There are N lines in the xy-plane. The i-th line is represented by A_ix+B_iy=C_i. Any two lines among the N+2 lines, the above N lines plus the x-axis and y-axis, cross each other at exactly one point.
For each pair 1 \leq i < j \leq N, there is a c... | instruction | 0 | 53,771 | 23 | 107,542 |
"Correct Solution:
```
class Bit:
# 参考1: http://hos.ac/slides/20140319_bit.pdf
# 参考2: https://atcoder.jp/contests/arc046/submissions/6264201
# 検証: https://atcoder.jp/contests/arc046/submissions/7435621
# values の 0 番目は使わない
# len(values) を 2 冪 +1 にすることで二分探索の条件を減らす
def __init__(self, a):
i... | output | 1 | 53,771 | 23 | 107,543 |
Provide a correct Python 3 solution for this coding contest problem.
There are N lines in the xy-plane. The i-th line is represented by A_ix+B_iy=C_i. Any two lines among the N+2 lines, the above N lines plus the x-axis and y-axis, cross each other at exactly one point.
For each pair 1 \leq i < j \leq N, there is a c... | instruction | 0 | 53,772 | 23 | 107,544 |
"Correct Solution:
```
def addbit(i):
i += 1
while i <= N:
BIT[i] += 1
i += i & (-i)
def getsum(i):
ret = 0
i += 1
while i != 0:
ret += BIT[i]
i -= i&(-i)
return ret
def bit(L):
global BIT
BIT=[0] * (N+1)
re = 0
for l in L:
re += getsum(l)
... | output | 1 | 53,772 | 23 | 107,545 |
Provide a correct Python 3 solution for this coding contest problem.
There are N lines in the xy-plane. The i-th line is represented by A_ix+B_iy=C_i. Any two lines among the N+2 lines, the above N lines plus the x-axis and y-axis, cross each other at exactly one point.
For each pair 1 \leq i < j \leq N, there is a c... | instruction | 0 | 53,773 | 23 | 107,546 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
class BIT:
#1-indexed
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
self.p = 2**(n.bit_length() - 1)
self.dep = n.bit_length()
def get(self, i):
s = 0
while i > 0:
s ... | output | 1 | 53,773 | 23 | 107,547 |
Provide a correct Python 3 solution for this coding contest problem.
There are N lines in the xy-plane. The i-th line is represented by A_ix+B_iy=C_i. Any two lines among the N+2 lines, the above N lines plus the x-axis and y-axis, cross each other at exactly one point.
For each pair 1 \leq i < j \leq N, there is a c... | instruction | 0 | 53,774 | 23 | 107,548 |
"Correct Solution:
```
def addbit(i):
i += 1
while i <= N:
BIT[i] += 1
i += i & (-i)
def getsum(i):
ret = 0
i += 1
while i != 0:
ret += BIT[i]
i -= i&(-i)
return ret
def bit(L):
global BIT
BIT=[0] * (N+1)
re = 0
for l in L:
re += getsum(l)
... | output | 1 | 53,774 | 23 | 107,549 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N lines in the xy-plane. The i-th line is represented by A_ix+B_iy=C_i. Any two lines among the N+2 lines, the above N lines plus the x-axis and y-axis, cross each other at exactly one... | instruction | 0 | 53,775 | 23 | 107,550 |
Yes | output | 1 | 53,775 | 23 | 107,551 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N lines in the xy-plane. The i-th line is represented by A_ix+B_iy=C_i. Any two lines among the N+2 lines, the above N lines plus the x-axis and y-axis, cross each other at exactly one... | instruction | 0 | 53,776 | 23 | 107,552 |
Yes | output | 1 | 53,776 | 23 | 107,553 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N lines in the xy-plane. The i-th line is represented by A_ix+B_iy=C_i. Any two lines among the N+2 lines, the above N lines plus the x-axis and y-axis, cross each other at exactly one... | instruction | 0 | 53,777 | 23 | 107,554 |
Yes | output | 1 | 53,777 | 23 | 107,555 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N lines in the xy-plane. The i-th line is represented by A_ix+B_iy=C_i. Any two lines among the N+2 lines, the above N lines plus the x-axis and y-axis, cross each other at exactly one... | instruction | 0 | 53,778 | 23 | 107,556 |
Yes | output | 1 | 53,778 | 23 | 107,557 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N lines in the xy-plane. The i-th line is represented by A_ix+B_iy=C_i. Any two lines among the N+2 lines, the above N lines plus the x-axis and y-axis, cross each other at exactly one... | instruction | 0 | 53,779 | 23 | 107,558 |
No | output | 1 | 53,779 | 23 | 107,559 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N lines in the xy-plane. The i-th line is represented by A_ix+B_iy=C_i. Any two lines among the N+2 lines, the above N lines plus the x-axis and y-axis, cross each other at exactly one... | instruction | 0 | 53,780 | 23 | 107,560 |
No | output | 1 | 53,780 | 23 | 107,561 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N lines in the xy-plane. The i-th line is represented by A_ix+B_iy=C_i. Any two lines among the N+2 lines, the above N lines plus the x-axis and y-axis, cross each other at exactly one... | instruction | 0 | 53,781 | 23 | 107,562 |
No | output | 1 | 53,781 | 23 | 107,563 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N lines in the xy-plane. The i-th line is represented by A_ix+B_iy=C_i. Any two lines among the N+2 lines, the above N lines plus the x-axis and y-axis, cross each other at exactly one... | instruction | 0 | 53,782 | 23 | 107,564 |
No | output | 1 | 53,782 | 23 | 107,565 |
Provide a correct Python 3 solution for this coding contest problem.
I decided to create a program that displays a "round and round pattern". The "round and round pattern" is as follows.
* If the length of one side is n, it is displayed as a character string with n rows and n columns.
* A spiral pattern that rotates ... | instruction | 0 | 53,821 | 23 | 107,642 |
"Correct Solution:
```
vector = ((0, -1), (1, 0), (0, 1), (-1, 0))
def make_guruguru(d):
lst = [["#"] * (d + 4)]
for _ in range(d + 2):
lst.append(["#"] + [" "] * (d + 2) + ["#"])
lst.append(["#"] * (d + 4))
x, y = 2, d + 1
lst[y][x] = "#"
direct = 0
vx, vy = vector[0]
cnt = 1
while True:
whi... | output | 1 | 53,821 | 23 | 107,643 |
Provide a correct Python 3 solution for this coding contest problem.
I decided to create a program that displays a "round and round pattern". The "round and round pattern" is as follows.
* If the length of one side is n, it is displayed as a character string with n rows and n columns.
* A spiral pattern that rotates ... | instruction | 0 | 53,822 | 23 | 107,644 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0141
"""
import sys
from sys import stdin
input = stdin.readline
from itertools import cycle
def guruguru(n):
dirs = cycle([(0, -1), (1, 0), (0, 1), (-1, 0)]) # x, y???????????? (?????????????????????????... | output | 1 | 53,822 | 23 | 107,645 |
Provide a correct Python 3 solution for this coding contest problem.
I decided to create a program that displays a "round and round pattern". The "round and round pattern" is as follows.
* If the length of one side is n, it is displayed as a character string with n rows and n columns.
* A spiral pattern that rotates ... | instruction | 0 | 53,823 | 23 | 107,646 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0141
"""
import sys
from sys import stdin
input = stdin.readline
from itertools import cycle
def guruguru(n):
dirs = cycle([(0, -1), (1, 0), (0, 1), (-1, 0)]) # x, y???????????? (?????????????????????????... | output | 1 | 53,823 | 23 | 107,647 |
Provide a correct Python 3 solution for this coding contest problem.
I decided to create a program that displays a "round and round pattern". The "round and round pattern" is as follows.
* If the length of one side is n, it is displayed as a character string with n rows and n columns.
* A spiral pattern that rotates ... | instruction | 0 | 53,824 | 23 | 107,648 |
"Correct Solution:
```
def p(t):
for r in t:
for c in r:
print(c,end="")
print("")
a = int(input())
for j in range(a):
n = int(input())
t = [ [ " " for _ in range(n) ] for _ in range(n)]
d = 1 # 0:up, 1:right, 2:down, 3:left
for i in range(n):
t[i][0] = ... | output | 1 | 53,824 | 23 | 107,649 |
Provide a correct Python 3 solution for this coding contest problem.
I decided to create a program that displays a "round and round pattern". The "round and round pattern" is as follows.
* If the length of one side is n, it is displayed as a character string with n rows and n columns.
* A spiral pattern that rotates ... | instruction | 0 | 53,825 | 23 | 107,650 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0141
"""
import sys
from sys import stdin
input = stdin.readline
M = []
def guruguru(n):
global M
dirs = [(0, -1), (1, 0), (0, 1), (-1, 0)] # x, y???????????? (???????????????????????????)
M = [[... | output | 1 | 53,825 | 23 | 107,651 |
Provide a correct Python 3 solution for this coding contest problem.
I decided to create a program that displays a "round and round pattern". The "round and round pattern" is as follows.
* If the length of one side is n, it is displayed as a character string with n rows and n columns.
* A spiral pattern that rotates ... | instruction | 0 | 53,826 | 23 | 107,652 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0141
"""
import sys
from sys import stdin
input = stdin.readline
from itertools import cycle
def guruguru(n):
line = 0
dirs = cycle([(0, -1), (1, 0), (0, 1), (-1, 0)])
M = [[' '] * n for _ in rang... | output | 1 | 53,826 | 23 | 107,653 |
Provide a correct Python 3 solution for this coding contest problem.
I decided to create a program that displays a "round and round pattern". The "round and round pattern" is as follows.
* If the length of one side is n, it is displayed as a character string with n rows and n columns.
* A spiral pattern that rotates ... | instruction | 0 | 53,827 | 23 | 107,654 |
"Correct Solution:
```
class Vector:
def __init__(self, x, y):
self.x = x
self.y = y
def move(self, offset):
self.x += offset[0]
self.y += offset[1]
def move_offset(self, offset, multiple=1):
x = self.x + offset[0] * multiple
y = self.y + offset[1] * multip... | output | 1 | 53,827 | 23 | 107,655 |
Provide a correct Python 3 solution for this coding contest problem.
I decided to create a program that displays a "round and round pattern". The "round and round pattern" is as follows.
* If the length of one side is n, it is displayed as a character string with n rows and n columns.
* A spiral pattern that rotates ... | instruction | 0 | 53,828 | 23 | 107,656 |
"Correct Solution:
```
dd = ((-1, 0), (0, -1), (1, 0), (0, 1))
d = int(input())
for i in range(d):
if i:
print()
N = int(input())
MP = [[" "]*N for i in range(N)]
for i in range(N):
MP[i][0] = "#"
def walk(x, y, d, n):
dx, dy = dd[d % 4]
for k in range(n):
... | output | 1 | 53,828 | 23 | 107,657 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I decided to create a program that displays a "round and round pattern". The "round and round pattern" is as follows.
* If the length of one side is n, it is displayed as a character string wit... | instruction | 0 | 53,829 | 23 | 107,658 |
Yes | output | 1 | 53,829 | 23 | 107,659 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I decided to create a program that displays a "round and round pattern". The "round and round pattern" is as follows.
* If the length of one side is n, it is displayed as a character string wit... | instruction | 0 | 53,830 | 23 | 107,660 |
Yes | output | 1 | 53,830 | 23 | 107,661 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I decided to create a program that displays a "round and round pattern". The "round and round pattern" is as follows.
* If the length of one side is n, it is displayed as a character string wit... | instruction | 0 | 53,831 | 23 | 107,662 |
Yes | output | 1 | 53,831 | 23 | 107,663 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I decided to create a program that displays a "round and round pattern". The "round and round pattern" is as follows.
* If the length of one side is n, it is displayed as a character string wit... | instruction | 0 | 53,832 | 23 | 107,664 |
No | output | 1 | 53,832 | 23 | 107,665 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I decided to create a program that displays a "round and round pattern". The "round and round pattern" is as follows.
* If the length of one side is n, it is displayed as a character string wit... | instruction | 0 | 53,833 | 23 | 107,666 |
No | output | 1 | 53,833 | 23 | 107,667 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I decided to create a program that displays a "round and round pattern". The "round and round pattern" is as follows.
* If the length of one side is n, it is displayed as a character string wit... | instruction | 0 | 53,834 | 23 | 107,668 |
No | output | 1 | 53,834 | 23 | 107,669 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I decided to create a program that displays a "round and round pattern". The "round and round pattern" is as follows.
* If the length of one side is n, it is displayed as a character string wit... | instruction | 0 | 53,835 | 23 | 107,670 |
No | output | 1 | 53,835 | 23 | 107,671 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which calculates the distance between two points P1(x1, y1) and P2(x2, y2).
Input
Four real numbers x1, y1, x2 and y2 are given in a line.
Output
Print the distance in real... | instruction | 0 | 53,920 | 23 | 107,840 |
Yes | output | 1 | 53,920 | 23 | 107,841 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which calculates the distance between two points P1(x1, y1) and P2(x2, y2).
Input
Four real numbers x1, y1, x2 and y2 are given in a line.
Output
Print the distance in real... | instruction | 0 | 53,921 | 23 | 107,842 |
Yes | output | 1 | 53,921 | 23 | 107,843 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which calculates the distance between two points P1(x1, y1) and P2(x2, y2).
Input
Four real numbers x1, y1, x2 and y2 are given in a line.
Output
Print the distance in real... | instruction | 0 | 53,923 | 23 | 107,846 |
Yes | output | 1 | 53,923 | 23 | 107,847 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which calculates the distance between two points P1(x1, y1) and P2(x2, y2).
Input
Four real numbers x1, y1, x2 and y2 are given in a line.
Output
Print the distance in real... | instruction | 0 | 53,924 | 23 | 107,848 |
No | output | 1 | 53,924 | 23 | 107,849 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are n planes on Earth, numbered from 1 to n, and the plane with number i ... | instruction | 0 | 54,510 | 23 | 109,020 |
Yes | output | 1 | 54,510 | 23 | 109,021 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are n planes on Earth, numbered from 1 to n, and the plane with number i ... | instruction | 0 | 54,511 | 23 | 109,022 |
Yes | output | 1 | 54,511 | 23 | 109,023 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are n planes on Earth, numbered from 1 to n, and the plane with number i ... | instruction | 0 | 54,512 | 23 | 109,024 |
Yes | output | 1 | 54,512 | 23 | 109,025 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are n planes on Earth, numbered from 1 to n, and the plane with number i ... | instruction | 0 | 54,513 | 23 | 109,026 |
Yes | output | 1 | 54,513 | 23 | 109,027 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are n planes on Earth, numbered from 1 to n, and the plane with number i ... | instruction | 0 | 54,514 | 23 | 109,028 |
No | output | 1 | 54,514 | 23 | 109,029 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are n planes on Earth, numbered from 1 to n, and the plane with number i ... | instruction | 0 | 54,515 | 23 | 109,030 |
No | output | 1 | 54,515 | 23 | 109,031 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are n planes on Earth, numbered from 1 to n, and the plane with number i ... | instruction | 0 | 54,516 | 23 | 109,032 |
No | output | 1 | 54,516 | 23 | 109,033 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are n planes on Earth, numbered from 1 to n, and the plane with number i ... | instruction | 0 | 54,517 | 23 | 109,034 |
No | output | 1 | 54,517 | 23 | 109,035 |
Provide a correct Python 3 solution for this coding contest problem.
F --Land inheritance
Problem Statement
One $ N $ brother was discussing the inheritance of his parents. The vast heritage left by their parents included vast lands. The land has a rectangular shape extending $ H $ km from north to south and $ W $ k... | instruction | 0 | 54,745 | 23 | 109,490 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
write = sys.stdout.write
def rotate(H, W, R0):
R1 = [[0]*H for i in range(W)]
for i in range(H):
for j in range(W):
R1[W-1-j][i] = R0[i][j]
return R1
def make(H, W, R0):
R1 = [[0]*(W+1) for i in range(H+1)]
for i in ... | output | 1 | 54,745 | 23 | 109,491 |
Provide a correct Python 3 solution for this coding contest problem.
Areas on the Cross-Section Diagram
Your task is to simulate a flood damage.
For a given cross-section diagram, reports areas of flooded sections.
<image>
Assume that rain is falling endlessly in the region and the water overflowing from the reg... | instruction | 0 | 54,756 | 23 | 109,512 |
"Correct Solution:
```
from collections import deque
def marge_ponds(lx, area_of_pond):
global ponds
if ponds and ponds[-1][0] > lx:
return marge_ponds(lx, area_of_pond + ponds.pop()[1])
return area_of_pond
terrains = input().strip()
x, last_x, ponds = 0, deque(), deque()
for terrain in terrain... | output | 1 | 54,756 | 23 | 109,513 |
Provide a correct Python 3 solution for this coding contest problem.
Areas on the Cross-Section Diagram
Your task is to simulate a flood damage.
For a given cross-section diagram, reports areas of flooded sections.
<image>
Assume that rain is falling endlessly in the region and the water overflowing from the reg... | instruction | 0 | 54,757 | 23 | 109,514 |
"Correct Solution:
```
n = input()
s1 = []
s2 = []
for i in range(len(n)):
if n[i] == '\\':
s1.append(i)
elif n[i] == '/' and len(s1) > 0:
a = s1.pop(-1)
s2.append([a, i - a])
i = 0
while len(s2) > 1:
if i == len(s2) - 1:
break
elif s2[i][0] > s2[i + 1][0]:
s2[... | output | 1 | 54,757 | 23 | 109,515 |
Provide a correct Python 3 solution for this coding contest problem.
Areas on the Cross-Section Diagram
Your task is to simulate a flood damage.
For a given cross-section diagram, reports areas of flooded sections.
<image>
Assume that rain is falling endlessly in the region and the water overflowing from the reg... | instruction | 0 | 54,758 | 23 | 109,516 |
"Correct Solution:
```
from collections import deque
s = input()
d = deque()
l = deque()
def calc_area(j, i):
return i - j
for i, c in enumerate(s):
if c == "\\":
d.append(i)
if c == "/":
if len(d) == 0:
continue
j = d.pop()
s = calc_area(j, i)
whi... | output | 1 | 54,758 | 23 | 109,517 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.