message stringlengths 2 48.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 318 108k | cluster float64 8 8 | __index_level_0__ int64 636 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
Aizu Gakuen High School holds a school festival every year. The most popular of these is the haunted house. The most popular reason is that 9 classes do haunted houses instead of 1 or 2 classes. Each one has its own unique haunted house. Therefore, m... | instruction | 0 | 54,707 | 8 | 109,414 |
"Correct Solution:
```
for i in range(9):
n,a,b = input().split()
a = int(a)
b = int(b)
print(n,a+b,200*a+300*b)
``` | output | 1 | 54,707 | 8 | 109,415 |
Provide a correct Python 3 solution for this coding contest problem.
Aizu Gakuen High School holds a school festival every year. The most popular of these is the haunted house. The most popular reason is that 9 classes do haunted houses instead of 1 or 2 classes. Each one has its own unique haunted house. Therefore, m... | instruction | 0 | 54,708 | 8 | 109,416 |
"Correct Solution:
```
for i in range(0,9):
n,a,b=input().split()
fee=int(a)*200+int(b)*300
p=int(a)+int(b)
print(n,p,fee)
``` | output | 1 | 54,708 | 8 | 109,417 |
Provide a correct Python 3 solution for this coding contest problem.
Aizu Gakuen High School holds a school festival every year. The most popular of these is the haunted house. The most popular reason is that 9 classes do haunted houses instead of 1 or 2 classes. Each one has its own unique haunted house. Therefore, m... | instruction | 0 | 54,709 | 8 | 109,418 |
"Correct Solution:
```
for _ in range(9):
a,b,c = input().split()
b = int(b)
c = int(c)
print(a,b+c,b*200+c*300)
``` | output | 1 | 54,709 | 8 | 109,419 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Aizu Gakuen High School holds a school festival every year. The most popular of these is the haunted house. The most popular reason is that 9 classes do haunted houses instead of 1 or 2 classes.... | instruction | 0 | 54,710 | 8 | 109,420 |
Yes | output | 1 | 54,710 | 8 | 109,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Aizu Gakuen High School holds a school festival every year. The most popular of these is the haunted house. The most popular reason is that 9 classes do haunted houses instead of 1 or 2 classes.... | instruction | 0 | 54,711 | 8 | 109,422 |
Yes | output | 1 | 54,711 | 8 | 109,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Aizu Gakuen High School holds a school festival every year. The most popular of these is the haunted house. The most popular reason is that 9 classes do haunted houses instead of 1 or 2 classes.... | instruction | 0 | 54,712 | 8 | 109,424 |
Yes | output | 1 | 54,712 | 8 | 109,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Aizu Gakuen High School holds a school festival every year. The most popular of these is the haunted house. The most popular reason is that 9 classes do haunted houses instead of 1 or 2 classes.... | instruction | 0 | 54,714 | 8 | 109,428 |
No | output | 1 | 54,714 | 8 | 109,429 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and m columns. Let number a[i][j] represents the calories burned by performing worko... | instruction | 0 | 55,145 | 8 | 110,290 |
Tags: dp
Correct Solution:
```
from collections import deque, defaultdict
from math import sqrt, ceil, factorial, floor, inf, log2, sqrt
import bisect
import copy
from itertools import combinations
import sys
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sy... | output | 1 | 55,145 | 8 | 110,291 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and m columns. Let number a[i][j] represents the calories burned by performing worko... | instruction | 0 | 55,146 | 8 | 110,292 |
Tags: dp
Correct Solution:
```
R = lambda: map(int, input().split())
n, m = R()
g = [list() for i in range(n)]
for i in range(n):
g[i] = list(R())
dp1, dp2, dp3, dp4 = ([[0] * (m + 1) for j in range(n + 1)] for i in range(4))
for i in range(n):
for j in range(m):
dp1[i][j] = g[i][j] + max(dp1[i - 1][j],... | output | 1 | 55,146 | 8 | 110,293 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and m columns. Let number a[i][j] represents the calories burned by performing worko... | instruction | 0 | 55,147 | 8 | 110,294 |
Tags: dp
Correct Solution:
```
# -*- coding:utf-8 -*-
"""
created by shuangquan.huang at 1/7/20
"""
import collections
import time
import os
import sys
import bisect
import heapq
from typing import List
def solve(N, M, A):
dpa = [[0 for _ in range(M+2)] for _ in range(N+2)]
dpb = [[0 for _ in range(M+2)] ... | output | 1 | 55,147 | 8 | 110,295 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and m columns. Let number a[i][j] represents the calories burned by performing worko... | instruction | 0 | 55,148 | 8 | 110,296 |
Tags: dp
Correct Solution:
```
n,m=map(int,input().split())
a=[]
for i in range(n):a.append(list(map(int,input().split())))
dpa=[[[0,0] for i in range(m+2)] for i in range(n+2)]
dpb=[[[0,0] for i in range(m+2)] for i in range(n+2)]
ans=0
for i in range(1,n+1):
for j in range(1,m+1):
dpa[i][j][0]=max(dpa[i-1][j][0],d... | output | 1 | 55,148 | 8 | 110,297 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and m columns. Let number a[i][j] represents the calories burned by performing worko... | instruction | 0 | 55,149 | 8 | 110,298 |
Tags: dp
Correct Solution:
```
n, m = map(int, input().strip().split())
dp1, dp2, dp3, dp4 = [[[0 for i in range(m+1)] for i in range(n+1)] for i in range(4)]
# print(dp1)
# print(dp2)
# print(dp3)
# print(dp4)
a = []
for i in range(n):
a.append(list(map(int, input().strip().split())))
for i in range(n):
for... | output | 1 | 55,149 | 8 | 110,299 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and m columns. Let number a[i][j] represents the calories burned by performing worko... | instruction | 0 | 55,150 | 8 | 110,300 |
Tags: dp
Correct Solution:
```
# by the authority of GOD author: manhar singh sachdev #
import os,sys
from io import BytesIO, IOBase
def main():
n,m = map(int,input().split())
arr = [list(map(int,input().split())) for _ in range(n)]
dp1 = [[0]*(m+2) for _ in range(n+2)]
for i in range(1,n+1):
... | output | 1 | 55,150 | 8 | 110,301 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and m columns. Let number a[i][j] represents the calories burned by performing worko... | instruction | 0 | 55,151 | 8 | 110,302 |
Tags: dp
Correct Solution:
```
n, m = map(int, input().split())
gym = [[0 for i in range(m+1)]]
for row in range(n):
gym.append([0] + list(map(int, input().split())))
bToMid = [[0 for i in range(m+2)] for j in range(n+2)]
for i in range(1, n+1):
for j in range(1, m+1):
bToMid[i][j] = gym[i][j] + max(bT... | output | 1 | 55,151 | 8 | 110,303 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and m columns. Let number a[i][j] represents the calories burned by performing worko... | instruction | 0 | 55,152 | 8 | 110,304 |
Tags: dp
Correct Solution:
```
from sys import maxsize, stdout, stdin,stderr
mod = int(1e9+7)
import sys
def I(): return int(stdin.readline())
def lint(): return [int(x) for x in stdin.readline().split()]
def S(): return input().strip()
def grid(r, c): return [lint() for i in range(r)]
from collections import defaultdi... | output | 1 | 55,152 | 8 | 110,305 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and m columns. Let number a[i][j] rep... | instruction | 0 | 55,153 | 8 | 110,306 |
Yes | output | 1 | 55,153 | 8 | 110,307 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and m columns. Let number a[i][j] rep... | instruction | 0 | 55,154 | 8 | 110,308 |
Yes | output | 1 | 55,154 | 8 | 110,309 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and m columns. Let number a[i][j] rep... | instruction | 0 | 55,155 | 8 | 110,310 |
Yes | output | 1 | 55,155 | 8 | 110,311 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and m columns. Let number a[i][j] rep... | instruction | 0 | 55,156 | 8 | 110,312 |
Yes | output | 1 | 55,156 | 8 | 110,313 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and m columns. Let number a[i][j] rep... | instruction | 0 | 55,157 | 8 | 110,314 |
No | output | 1 | 55,157 | 8 | 110,315 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and m columns. Let number a[i][j] rep... | instruction | 0 | 55,158 | 8 | 110,316 |
No | output | 1 | 55,158 | 8 | 110,317 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and m columns. Let number a[i][j] rep... | instruction | 0 | 55,159 | 8 | 110,318 |
No | output | 1 | 55,159 | 8 | 110,319 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and m columns. Let number a[i][j] rep... | instruction | 0 | 55,160 | 8 | 110,320 |
No | output | 1 | 55,160 | 8 | 110,321 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Several ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the floor in one hall. The floor was tiled with hexagonal tiles.
The hall ... | instruction | 0 | 55,881 | 8 | 111,762 |
Tags: implementation, math
Correct Solution:
```
a,b,c = map(int,input().split())
print(a*(2*c+a-1)+(c+a-1)*(b-a-1))
``` | output | 1 | 55,881 | 8 | 111,763 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Several ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the floor in one hall. The floor was tiled with hexagonal tiles.
The hall ... | instruction | 0 | 55,882 | 8 | 111,764 |
Tags: implementation, math
Correct Solution:
```
from sys import setrecursionlimit, exit, stdin
from math import ceil, floor, acos, pi
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from functools import reduce
import itertools
setrecursionlimit(10**7)
RI=lambda x=' ': list(map(in... | output | 1 | 55,882 | 8 | 111,765 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Several ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the floor in one hall. The floor was tiled with hexagonal tiles.
The hall ... | instruction | 0 | 55,883 | 8 | 111,766 |
Tags: implementation, math
Correct Solution:
```
class CodeforcesTask216ASolution:
def __init__(self):
self.result = ''
self.a_b_c = []
def read_input(self):
self.a_b_c = [int(x) for x in input().split(" ")]
def process_task(self):
result = 0
a, b, c = self.a_b_c
... | output | 1 | 55,883 | 8 | 111,767 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Several ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the floor in one hall. The floor was tiled with hexagonal tiles.
The hall ... | instruction | 0 | 55,884 | 8 | 111,768 |
Tags: implementation, math
Correct Solution:
```
import sys
a, b, c = [int(x) for x in (sys.stdin.readline()).split()]
print(b * c + (b + c - 1) * (a - 1))
``` | output | 1 | 55,884 | 8 | 111,769 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Several ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the floor in one hall. The floor was tiled with hexagonal tiles.
The hall ... | instruction | 0 | 55,885 | 8 | 111,770 |
Tags: implementation, math
Correct Solution:
```
a, b, c = map(int, input().split())
print(c * (b + a - 1) + (a - 1) * (b - 1))
``` | output | 1 | 55,885 | 8 | 111,771 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Several ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the floor in one hall. The floor was tiled with hexagonal tiles.
The hall ... | instruction | 0 | 55,886 | 8 | 111,772 |
Tags: implementation, math
Correct Solution:
```
try:
a,b,c=list(map(int,input().split(" ")))
print(a*b*c-((a-1)*(b-1)*(c-1)))
except:
pass
``` | output | 1 | 55,886 | 8 | 111,773 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Several ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the floor in one hall. The floor was tiled with hexagonal tiles.
The hall ... | instruction | 0 | 55,887 | 8 | 111,774 |
Tags: implementation, math
Correct Solution:
```
a,b,c=map(int,input().split())
f=lambda x:x*(x-1)//2
print(f(a+b+c-1)-f(a)-f(b)-f(c))
``` | output | 1 | 55,887 | 8 | 111,775 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Several ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the floor in one hall. The floor was tiled with hexagonal tiles.
The hall ... | instruction | 0 | 55,888 | 8 | 111,776 |
Tags: implementation, math
Correct Solution:
```
import sys
import math
import itertools
import collections
def getdict(n):
d = {}
if type(n) is list or type(n) is str:
for i in n:
if i in d:
d[i] += 1
else:
d[i] = 1
else:
for i in ran... | output | 1 | 55,888 | 8 | 111,777 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Several ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the floor in one hall. The f... | instruction | 0 | 55,889 | 8 | 111,778 |
Yes | output | 1 | 55,889 | 8 | 111,779 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Several ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the floor in one hall. The f... | instruction | 0 | 55,890 | 8 | 111,780 |
Yes | output | 1 | 55,890 | 8 | 111,781 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Several ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the floor in one hall. The f... | instruction | 0 | 55,891 | 8 | 111,782 |
Yes | output | 1 | 55,891 | 8 | 111,783 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Several ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the floor in one hall. The f... | instruction | 0 | 55,892 | 8 | 111,784 |
Yes | output | 1 | 55,892 | 8 | 111,785 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Several ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the floor in one hall. The f... | instruction | 0 | 55,893 | 8 | 111,786 |
No | output | 1 | 55,893 | 8 | 111,787 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Several ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the floor in one hall. The f... | instruction | 0 | 55,894 | 8 | 111,788 |
No | output | 1 | 55,894 | 8 | 111,789 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Several ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the floor in one hall. The f... | instruction | 0 | 55,895 | 8 | 111,790 |
No | output | 1 | 55,895 | 8 | 111,791 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Several ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the floor in one hall. The f... | instruction | 0 | 55,896 | 8 | 111,792 |
No | output | 1 | 55,896 | 8 | 111,793 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have k pieces of laundry, each of which you want to wash, dry and fold. You are at a laundromat that has n1 washing machines, n2 drying machines and n3 folding machines. Each machine can process only one piece of laundry at a time. You c... | instruction | 0 | 55,980 | 8 | 111,960 |
Tags: greedy, implementation
Correct Solution:
```
class step(object):
timer = []
def __init__(self, name, machin_num, step_time):
self.machin_num = machin_num
self.step_time = step_time
self.name = name
def step_input(self, cloth_num, t):
'''
if cloth_num + len(self... | output | 1 | 55,980 | 8 | 111,961 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have k pieces of laundry, each of which you want to wash, dry and fold. You are at a laundromat that has n1 washing machines, n2 drying machines and n3 folding machines. Each machine can process only one piece of laundry at a time. You c... | instruction | 0 | 55,981 | 8 | 111,962 |
Tags: greedy, implementation
Correct Solution:
```
k, na, nb, nc, ta, tb, tc = list(map(int, input().split()))
from collections import deque
a = deque()
b = deque()
c = deque()
for i in range(na):
a.append(0)
for i in range(nb):
b.append(0)
for i in range(nc):
c.append(0)
t = 0
for i in range... | output | 1 | 55,981 | 8 | 111,963 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have k pieces of laundry, each of which you want to wash, dry and fold. You are at a laundromat that has n1 washing machines, n2 drying machines and n3 folding machines. Each machine can process only one piece of laundry at a time. You c... | instruction | 0 | 55,982 | 8 | 111,964 |
Tags: greedy, implementation
Correct Solution:
```
k, n1, n2, n3, t1, t2, t3 = map(int, input().split())
x1 = x2 = x3 = 0
T1, T2, T3 = [0] * n1, [0] * n2, [0] * n3
for i in range(k):
T1[x1] += t1
T2[x2] = max(T1[x1], T2[x2]) + t2
T3[x3] = max(T2[x2], T3[x3]) + t3
x1 += 1
x2 += 1
x3 += 1
if x... | output | 1 | 55,982 | 8 | 111,965 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have k pieces of laundry, each of which you want to wash, dry and fold. You are at a laundromat that has n1 washing machines, n2 drying machines and n3 folding machines. Each machine can pro... | instruction | 0 | 55,983 | 8 | 111,966 |
No | output | 1 | 55,983 | 8 | 111,967 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have k pieces of laundry, each of which you want to wash, dry and fold. You are at a laundromat that has n1 washing machines, n2 drying machines and n3 folding machines. Each machine can pro... | instruction | 0 | 55,984 | 8 | 111,968 |
No | output | 1 | 55,984 | 8 | 111,969 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have k pieces of laundry, each of which you want to wash, dry and fold. You are at a laundromat that has n1 washing machines, n2 drying machines and n3 folding machines. Each machine can pro... | instruction | 0 | 55,985 | 8 | 111,970 |
No | output | 1 | 55,985 | 8 | 111,971 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have k pieces of laundry, each of which you want to wash, dry and fold. You are at a laundromat that has n1 washing machines, n2 drying machines and n3 folding machines. Each machine can pro... | instruction | 0 | 55,986 | 8 | 111,972 |
No | output | 1 | 55,986 | 8 | 111,973 |
Provide a correct Python 3 solution for this coding contest problem.
There are N towers in the town where Ikta lives. Each tower is given a different number from 0 to N-1, and the tower with number i is called tower i. Curious Ikta was interested in the height of the N towers and decided to make a table T showing the ... | instruction | 0 | 56,371 | 8 | 112,742 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
write = sys.stdout.write
from collections import deque
def solve():
MOD = 10**9 + 7
N = int(readline())
dp0 = [[[0]*(N+1) for i in range(N+1)] for j in range(N+1)]
dp0[0][0][0] = 1
for c in range(1, N+1):
for a in range(N+1)... | output | 1 | 56,371 | 8 | 112,743 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova decided to clean his room. The room can be represented as the coordinate axis OX. There are n piles of trash in the room, coordinate of the i-th pile is the integer p_i. All piles have different coordinates.
Let's define a total cleanu... | instruction | 0 | 56,560 | 8 | 113,120 |
Tags: data structures, implementation
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
_str = str
BUFSIZE = 8192
def str(x=b''):
return x if type(x) is bytes else _str(x).encode()
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
... | output | 1 | 56,560 | 8 | 113,121 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova decided to clean his room. The room can be represented as the coordinate axis OX. There are n piles of trash in the room, coordinate of the i-th pile is the integer p_i. All piles have different coordinates.
Let's define a total cleanu... | instruction | 0 | 56,561 | 8 | 113,122 |
Tags: data structures, implementation
Correct Solution:
```
# -*- coding: utf-8 -*-
from heapq import heappop, heappush
from collections import Counter
import sys
# sys.setrecursionlimit(10**6)
# readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
INF = 1 << 60
def read_int():
return int(readline... | output | 1 | 56,561 | 8 | 113,123 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova decided to clean his room. The room can be represented as the coordinate axis OX. There are n piles of trash in the room, coordinate of the i-th pile is the integer p_i. All piles have different coordinates.
Let's define a total cleanu... | instruction | 0 | 56,562 | 8 | 113,124 |
Tags: data structures, implementation
Correct Solution:
```
from bisect import bisect_left, bisect_right, insort
from functools import reduce
from operator import add, iadd
from itertools import chain, starmap, repeat
from math import log
class SortedList:
DEFAULT_LOAD_FACTOR = 1000
def __init__(self, itera... | output | 1 | 56,562 | 8 | 113,125 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.