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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have N bamboos. The lengths (in centimeters) of these are l_1, l_2, ..., l_N, respectively.
Your objective is to use some of these bamboos (possibly all) to obtain three bamboos of length A... | instruction | 0 | 58,725 | 8 | 117,450 |
Yes | output | 1 | 58,725 | 8 | 117,451 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have N bamboos. The lengths (in centimeters) of these are l_1, l_2, ..., l_N, respectively.
Your objective is to use some of these bamboos (possibly all) to obtain three bamboos of length A... | instruction | 0 | 58,727 | 8 | 117,454 |
No | output | 1 | 58,727 | 8 | 117,455 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have N bamboos. The lengths (in centimeters) of these are l_1, l_2, ..., l_N, respectively.
Your objective is to use some of these bamboos (possibly all) to obtain three bamboos of length A... | instruction | 0 | 58,728 | 8 | 117,456 |
No | output | 1 | 58,728 | 8 | 117,457 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dora loves adventures quite a lot. During some journey she encountered an amazing city, which is formed by n streets along the Eastern direction and m streets across the Southern direction. Naturally, this city has nm intersections. At any i... | instruction | 0 | 58,872 | 8 | 117,744 |
Tags: implementation, sortings
Correct Solution:
```
#Code by Sounak, IIESTS
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
import collections
from itertools import permutations
from collections import def... | output | 1 | 58,872 | 8 | 117,745 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dora loves adventures quite a lot. During some journey she encountered an amazing city, which is formed by n streets along the Eastern direction and m streets across the Southern direction. Naturally, this city has nm intersections. At any i... | instruction | 0 | 58,873 | 8 | 117,746 |
Tags: implementation, sortings
Correct Solution:
```
n, m = list(map(int, input().split()))
gor = []
ver = []
o = []
for i in range(n):
gor.append(list(map(int, input().split())))
o.append([])
for i in range(m):
ver.append([])
for i in range(m):
for g in gor:
ver[i].append(g[i])
ver = list(map(l... | output | 1 | 58,873 | 8 | 117,747 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dora loves adventures quite a lot. During some journey she encountered an amazing city, which is formed by n streets along the Eastern direction and m streets across the Southern direction. Naturally, this city has nm intersections. At any i... | instruction | 0 | 58,874 | 8 | 117,748 |
Tags: implementation, sortings
Correct Solution:
```
from bisect import bisect_left
import sys
input = sys.stdin.buffer.readline
n, m = map(int, input().split())
a = [list(map(int, input().split())) for i in range(n)]
yoko_less = [[0] * m for i in range(n)]
yoko_more = [[0] * m for i in range(n)]
for i in range(n):
... | output | 1 | 58,874 | 8 | 117,749 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dora loves adventures quite a lot. During some journey she encountered an amazing city, which is formed by n streets along the Eastern direction and m streets across the Southern direction. Naturally, this city has nm intersections. At any i... | instruction | 0 | 58,875 | 8 | 117,750 |
Tags: implementation, sortings
Correct Solution:
```
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 = BytesIO()
self.writable = "x" in file.mode or "r" not in fil... | output | 1 | 58,875 | 8 | 117,751 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dora loves adventures quite a lot. During some journey she encountered an amazing city, which is formed by n streets along the Eastern direction and m streets across the Southern direction. Naturally, this city has nm intersections. At any i... | instruction | 0 | 58,876 | 8 | 117,752 |
Tags: implementation, sortings
Correct Solution:
```
import sys
input=sys.stdin.readline
n, m = map(int, input().split())
St = [list(map(int, input().split())) for _ in range(n)]
ppr = [sorted(list(set(s))) for s in St]
PR = []
for i in range(n):
H = dict()
for j, v in enumerate(ppr[i], 1):
H[v] = j
... | output | 1 | 58,876 | 8 | 117,753 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dora loves adventures quite a lot. During some journey she encountered an amazing city, which is formed by n streets along the Eastern direction and m streets across the Southern direction. Naturally, this city has nm intersections. At any i... | instruction | 0 | 58,877 | 8 | 117,754 |
Tags: implementation, sortings
Correct Solution:
```
import heapq
import sys
from collections import defaultdict, Counter
from functools import reduce
n, m = list(map(int, input().split()))
arr = []
for _ in range(n):
arr.append(list(map(int, input().split())))
rows = []
for i in range(n):
row = set()
fo... | output | 1 | 58,877 | 8 | 117,755 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dora loves adventures quite a lot. During some journey she encountered an amazing city, which is formed by n streets along the Eastern direction and m streets across the Southern direction. Naturally, this city has nm intersections. At any i... | instruction | 0 | 58,878 | 8 | 117,756 |
Tags: implementation, sortings
Correct Solution:
```
import sys
input=sys.stdin.buffer.readline
from bisect import bisect_left
n,m=map(int,input().split())
arr=[]
for i in range(n):
arr.append(list(map(int,input().split())))
arr_maxi=[[0 for i in range(m)] for j in range(n)]
arr_mini=[[0 for i in range(m)] for j in... | output | 1 | 58,878 | 8 | 117,757 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dora loves adventures quite a lot. During some journey she encountered an amazing city, which is formed by n streets along the Eastern direction and m streets across the Southern direction. Naturally, this city has nm intersections. At any i... | instruction | 0 | 58,879 | 8 | 117,758 |
Tags: implementation, sortings
Correct Solution:
```
import sys
from bisect import bisect_left
input=sys.stdin.buffer.readline
n,m=map(int,input().split())
a=[list(map(int,input().split())) for i in range(n)]
lr_less=[[0]*m for i in range(n)]
lr_more=[[0]*m for i in range(n)]
for i in range(n):
lr=sorted(set(a[i]))
... | output | 1 | 58,879 | 8 | 117,759 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In order to do some research, n^2 labs are built on different heights of a mountain. Let's enumerate them with integers from 1 to n^2, such that the lab with the number 1 is at the lowest place, the lab with the number 2 is at the second-low... | instruction | 0 | 58,930 | 8 | 117,860 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
x=int(input())
s=[[0 for n in range(x)] for n in range(x)]
v=1
for n in range(x):
if n%2==0:
for k in range(x):
s[k][n]=v
v+=1
else:
for k in range(x-1,-1,-1):
s[k][n]=v
v+=1
for n in s:
print(*n)
``` | output | 1 | 58,930 | 8 | 117,861 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In order to do some research, n^2 labs are built on different heights of a mountain. Let's enumerate them with integers from 1 to n^2, such that the lab with the number 1 is at the lowest place, the lab with the number 2 is at the second-low... | instruction | 0 | 58,931 | 8 | 117,862 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
n = int(input())
for i in range(n):
ansline = []
for j in range(n):
if j % 2 == 0:
ansline.append(1 + j*n+i)
else:
ansline.append(1 + (j+1)*n-i-1)
print(*ansline)
``` | output | 1 | 58,931 | 8 | 117,863 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In order to do some research, n^2 labs are built on different heights of a mountain. Let's enumerate them with integers from 1 to n^2, such that the lab with the number 1 is at the lowest place, the lab with the number 2 is at the second-low... | instruction | 0 | 58,932 | 8 | 117,864 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
# ------------------- fast io --------------------
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 ... | output | 1 | 58,932 | 8 | 117,865 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In order to do some research, n^2 labs are built on different heights of a mountain. Let's enumerate them with integers from 1 to n^2, such that the lab with the number 1 is at the lowest place, the lab with the number 2 is at the second-low... | instruction | 0 | 58,933 | 8 | 117,866 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
n=int(input())
ans=[[] for i in range(n)]
flag=0
for i in range(1,(n*n)+1):
if flag==0:
c=i%n
ans[c-1].append(i)
if c==0:
flag=1
else:
c=n-(i%n)
if c==n:
flag=0
c=0
ans[c].append(i)
for op in ans:
for a in op:
print(a,... | output | 1 | 58,933 | 8 | 117,867 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In order to do some research, n^2 labs are built on different heights of a mountain. Let's enumerate them with integers from 1 to n^2, such that the lab with the number 1 is at the lowest place, the lab with the number 2 is at the second-low... | instruction | 0 | 58,934 | 8 | 117,868 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
import sys
input = sys.stdin.buffer.readline
n = int(input())
res = [[] for _ in range(n)]
for i in range(n):
for j in range(n):
if i % 2:
res[n - j - 1].append(i * n + j + 1)
else:
res[j].append(i * n + j + 1)
for r in re... | output | 1 | 58,934 | 8 | 117,869 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In order to do some research, n^2 labs are built on different heights of a mountain. Let's enumerate them with integers from 1 to n^2, such that the lab with the number 1 is at the lowest place, the lab with the number 2 is at the second-low... | instruction | 0 | 58,935 | 8 | 117,870 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
def create(n):
res = [[0] * n for _ in range(n)]
cur = 1
for j in range(n):
for i in (range(n - 1, -1, -1) if j & 1 else range(n)):
res[i][j] = cur
cur += 1
return res
n = int(input())
res = creat... | output | 1 | 58,935 | 8 | 117,871 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In order to do some research, n^2 labs are built on different heights of a mountain. Let's enumerate them with integers from 1 to n^2, such that the lab with the number 1 is at the lowest place, the lab with the number 2 is at the second-low... | instruction | 0 | 58,936 | 8 | 117,872 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
N = int(input())
ans = [[] for _ in range(N)]
for i in range(N):
for j in range(1, N+1):
if i%2 == 0:
ans[j-1].append(N*i+j)
else:
ans[N-j].append(N*i+j)
for i in range(N):
for j in range(N):
... | output | 1 | 58,936 | 8 | 117,873 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In order to do some research, n^2 labs are built on different heights of a mountain. Let's enumerate them with integers from 1 to n^2, such that the lab with the number 1 is at the lowest place, the lab with the number 2 is at the second-low... | instruction | 0 | 58,937 | 8 | 117,874 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
from collections import Counter
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
... | output | 1 | 58,937 | 8 | 117,875 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In order to do some research, n^2 labs are built on different heights of a mountain. Let's enumerate them with integers from 1 to n^2, such that the lab with the number 1 is at the lowest place,... | instruction | 0 | 58,938 | 8 | 117,876 |
Yes | output | 1 | 58,938 | 8 | 117,877 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In order to do some research, n^2 labs are built on different heights of a mountain. Let's enumerate them with integers from 1 to n^2, such that the lab with the number 1 is at the lowest place,... | instruction | 0 | 58,939 | 8 | 117,878 |
Yes | output | 1 | 58,939 | 8 | 117,879 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In order to do some research, n^2 labs are built on different heights of a mountain. Let's enumerate them with integers from 1 to n^2, such that the lab with the number 1 is at the lowest place,... | instruction | 0 | 58,940 | 8 | 117,880 |
Yes | output | 1 | 58,940 | 8 | 117,881 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In order to do some research, n^2 labs are built on different heights of a mountain. Let's enumerate them with integers from 1 to n^2, such that the lab with the number 1 is at the lowest place,... | instruction | 0 | 58,941 | 8 | 117,882 |
Yes | output | 1 | 58,941 | 8 | 117,883 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In order to do some research, n^2 labs are built on different heights of a mountain. Let's enumerate them with integers from 1 to n^2, such that the lab with the number 1 is at the lowest place,... | instruction | 0 | 58,942 | 8 | 117,884 |
No | output | 1 | 58,942 | 8 | 117,885 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In order to do some research, n^2 labs are built on different heights of a mountain. Let's enumerate them with integers from 1 to n^2, such that the lab with the number 1 is at the lowest place,... | instruction | 0 | 58,943 | 8 | 117,886 |
No | output | 1 | 58,943 | 8 | 117,887 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In order to do some research, n^2 labs are built on different heights of a mountain. Let's enumerate them with integers from 1 to n^2, such that the lab with the number 1 is at the lowest place,... | instruction | 0 | 58,944 | 8 | 117,888 |
No | output | 1 | 58,944 | 8 | 117,889 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In order to do some research, n^2 labs are built on different heights of a mountain. Let's enumerate them with integers from 1 to n^2, such that the lab with the number 1 is at the lowest place,... | instruction | 0 | 58,945 | 8 | 117,890 |
No | output | 1 | 58,945 | 8 | 117,891 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On a strip of land of length n there are k air conditioners: the i-th air conditioner is placed in cell a_i (1 ≤ a_i ≤ n). Two or more air conditioners cannot be placed in the same cell (i.e. all a_i are distinct).
Each air conditioner is c... | instruction | 0 | 59,081 | 8 | 118,162 |
Tags: data structures, dp, implementation, shortest paths, sortings, two pointers
Correct Solution:
```
import math;import heapq;import sys;input=sys.stdin.readline;S=lambda:input();I=lambda:int(S());M=lambda:map(int,S().split());L=lambda:list(M());H=1000000000+7
for _ in range(I()):
s=input()
n,k=M()
po=L()
t=L()
... | output | 1 | 59,081 | 8 | 118,163 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On a strip of land of length n there are k air conditioners: the i-th air conditioner is placed in cell a_i (1 ≤ a_i ≤ n). Two or more air conditioners cannot be placed in the same cell (i.e. all a_i are distinct).
Each air conditioner is c... | instruction | 0 | 59,082 | 8 | 118,164 |
Tags: data structures, dp, implementation, shortest paths, sortings, two pointers
Correct Solution:
```
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 = BytesIO()
self.wr... | output | 1 | 59,082 | 8 | 118,165 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On a strip of land of length n there are k air conditioners: the i-th air conditioner is placed in cell a_i (1 ≤ a_i ≤ n). Two or more air conditioners cannot be placed in the same cell (i.e. all a_i are distinct).
Each air conditioner is c... | instruction | 0 | 59,083 | 8 | 118,166 |
Tags: data structures, dp, implementation, shortest paths, sortings, two pointers
Correct Solution:
```
import sys
from collections import deque #Counter
#sys.setrecursionlimit(20000)
#import itertools
def rl():
return sys.stdin.readline().strip()
def rl_types(types):
str_list = [x for x in sys.stdin.readline... | output | 1 | 59,083 | 8 | 118,167 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On a strip of land of length n there are k air conditioners: the i-th air conditioner is placed in cell a_i (1 ≤ a_i ≤ n). Two or more air conditioners cannot be placed in the same cell (i.e. all a_i are distinct).
Each air conditioner is c... | instruction | 0 | 59,084 | 8 | 118,168 |
Tags: data structures, dp, implementation, shortest paths, sortings, two pointers
Correct Solution:
```
from bisect import bisect_left
from collections import defaultdict as D
MAX = 99999999999
for _ in range(int(input())):
s = input()
n,k = map(int,input().split())
a = list( map( int, input().split() ) )
t =... | output | 1 | 59,084 | 8 | 118,169 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On a strip of land of length n there are k air conditioners: the i-th air conditioner is placed in cell a_i (1 ≤ a_i ≤ n). Two or more air conditioners cannot be placed in the same cell (i.e. all a_i are distinct).
Each air conditioner is c... | instruction | 0 | 59,085 | 8 | 118,170 |
Tags: data structures, dp, implementation, shortest paths, sortings, two pointers
Correct Solution:
```
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import random
import heapq,bisect
import sys
from collections import deque, defaultdict
from fractions import F... | output | 1 | 59,085 | 8 | 118,171 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On a strip of land of length n there are k air conditioners: the i-th air conditioner is placed in cell a_i (1 ≤ a_i ≤ n). Two or more air conditioners cannot be placed in the same cell (i.e. all a_i are distinct).
Each air conditioner is c... | instruction | 0 | 59,086 | 8 | 118,172 |
Tags: data structures, dp, implementation, shortest paths, sortings, two pointers
Correct Solution:
```
import time
from collections import deque
def inpt():
return int(input())
def inpl():
return list(map(int,input().split()))
def inpm():
return map(int,input().split())
def solve():
n,k = inpm()... | output | 1 | 59,086 | 8 | 118,173 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On a strip of land of length n there are k air conditioners: the i-th air conditioner is placed in cell a_i (1 ≤ a_i ≤ n). Two or more air conditioners cannot be placed in the same cell (i.e. all a_i are distinct).
Each air conditioner is c... | instruction | 0 | 59,087 | 8 | 118,174 |
Tags: data structures, dp, implementation, shortest paths, sortings, two pointers
Correct Solution:
```
import heapq,math
from collections import defaultdict,deque
from os import getcwd
import sys, os.path
#sys.setrecursionlimit(100000000)
if(os.path.exists('D:\CP\programs\input.txt')):
sys.stdout = open('D:\CP\pr... | output | 1 | 59,087 | 8 | 118,175 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On a strip of land of length n there are k air conditioners: the i-th air conditioner is placed in cell a_i (1 ≤ a_i ≤ n). Two or more air conditioners cannot be placed in the same cell (i.e. all a_i are distinct).
Each air conditioner is c... | instruction | 0 | 59,088 | 8 | 118,176 |
Tags: data structures, dp, implementation, shortest paths, sortings, two pointers
Correct Solution:
```
#Code by Sounak, IIESTS
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
import io
from fractions import Fraction
import collections
f... | output | 1 | 59,088 | 8 | 118,177 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a strip of land of length n there are k air conditioners: the i-th air conditioner is placed in cell a_i (1 ≤ a_i ≤ n). Two or more air conditioners cannot be placed in the same cell (i.e. al... | instruction | 0 | 59,089 | 8 | 118,178 |
Yes | output | 1 | 59,089 | 8 | 118,179 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a strip of land of length n there are k air conditioners: the i-th air conditioner is placed in cell a_i (1 ≤ a_i ≤ n). Two or more air conditioners cannot be placed in the same cell (i.e. al... | instruction | 0 | 59,090 | 8 | 118,180 |
Yes | output | 1 | 59,090 | 8 | 118,181 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a strip of land of length n there are k air conditioners: the i-th air conditioner is placed in cell a_i (1 ≤ a_i ≤ n). Two or more air conditioners cannot be placed in the same cell (i.e. al... | instruction | 0 | 59,091 | 8 | 118,182 |
Yes | output | 1 | 59,091 | 8 | 118,183 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a strip of land of length n there are k air conditioners: the i-th air conditioner is placed in cell a_i (1 ≤ a_i ≤ n). Two or more air conditioners cannot be placed in the same cell (i.e. al... | instruction | 0 | 59,092 | 8 | 118,184 |
Yes | output | 1 | 59,092 | 8 | 118,185 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a strip of land of length n there are k air conditioners: the i-th air conditioner is placed in cell a_i (1 ≤ a_i ≤ n). Two or more air conditioners cannot be placed in the same cell (i.e. al... | instruction | 0 | 59,093 | 8 | 118,186 |
No | output | 1 | 59,093 | 8 | 118,187 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a strip of land of length n there are k air conditioners: the i-th air conditioner is placed in cell a_i (1 ≤ a_i ≤ n). Two or more air conditioners cannot be placed in the same cell (i.e. al... | instruction | 0 | 59,094 | 8 | 118,188 |
No | output | 1 | 59,094 | 8 | 118,189 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a strip of land of length n there are k air conditioners: the i-th air conditioner is placed in cell a_i (1 ≤ a_i ≤ n). Two or more air conditioners cannot be placed in the same cell (i.e. al... | instruction | 0 | 59,095 | 8 | 118,190 |
No | output | 1 | 59,095 | 8 | 118,191 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a strip of land of length n there are k air conditioners: the i-th air conditioner is placed in cell a_i (1 ≤ a_i ≤ n). Two or more air conditioners cannot be placed in the same cell (i.e. al... | instruction | 0 | 59,096 | 8 | 118,192 |
No | output | 1 | 59,096 | 8 | 118,193 |
Provide tags and a correct Python 2 solution for this coding contest problem.
Little Chris is very keen on his toy blocks. His teacher, however, wants Chris to solve more problems, so he decided to play a trick on Chris.
There are exactly s blocks in Chris's set, each block has a unique number from 1 to s. Chris's te... | instruction | 0 | 59,193 | 8 | 118,386 |
Tags: greedy, implementation, math
Correct Solution:
```
from sys import stdin, stdout
from collections import Counter, defaultdict
from itertools import permutations, combinations
import heapq
raw_input = stdin.readline
pr = stdout.write
def in_num():
return int(raw_input())
def in_arr():
return map(int,ra... | output | 1 | 59,193 | 8 | 118,387 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Chris is very keen on his toy blocks. His teacher, however, wants Chris to solve more problems, so he decided to play a trick on Chris.
There are exactly s blocks in Chris's set, each block has a unique number from 1 to s. Chris's te... | instruction | 0 | 59,194 | 8 | 118,388 |
Tags: greedy, implementation, math
Correct Solution:
```
import sys
INF = 10**20
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))
from math import gcd
from math import ceil
from collections import defaultdict as dd, Counter
from bisect import bisect_left as bl, bisect_right as br
"""
Facts and Data represent... | output | 1 | 59,194 | 8 | 118,389 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Chris is very keen on his toy blocks. His teacher, however, wants Chris to solve more problems, so he decided to play a trick on Chris.
There are exactly s blocks in Chris's set, each block has a unique number from 1 to s. Chris's te... | instruction | 0 | 59,195 | 8 | 118,390 |
Tags: greedy, implementation, math
Correct Solution:
```
import sys
def solve():
n = int(input())
s = 1000000
xset = set(map(int, input().split()))
res = set()
wantother = 0
for i in range(1, s + 1):
opposite = s - i + 1
if i in xset:
if opposite not in xset:
... | output | 1 | 59,195 | 8 | 118,391 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Chris is very keen on his toy blocks. His teacher, however, wants Chris to solve more problems, so he decided to play a trick on Chris.
There are exactly s blocks in Chris's set, each block has a unique number from 1 to s. Chris's te... | instruction | 0 | 59,196 | 8 | 118,392 |
Tags: greedy, implementation, math
Correct Solution:
```
import sys
from math import gcd,sqrt,ceil
from collections import defaultdict,Counter,deque
import math
# input=sys.stdin.readline
# def print(x):
# sys.stdout.write(str(x)+"\n")
# sys.stdout=open("CP1/output.txt",'w')
# sys.stdin=open("CP1/input.txt",'r')
... | output | 1 | 59,196 | 8 | 118,393 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Chris is very keen on his toy blocks. His teacher, however, wants Chris to solve more problems, so he decided to play a trick on Chris.
There are exactly s blocks in Chris's set, each block has a unique number from 1 to s. Chris's te... | instruction | 0 | 59,197 | 8 | 118,394 |
Tags: greedy, implementation, math
Correct Solution:
```
if __name__ == '__main__':
n = int(input())
l = [int(i) for i in list(input().split())]
# mask to indicate if a number is taken
size = 10**6
mask = [0] * (size+1)
for i in l:
mask[i] = 1
counter = 0
result = []
for... | output | 1 | 59,197 | 8 | 118,395 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Chris is very keen on his toy blocks. His teacher, however, wants Chris to solve more problems, so he decided to play a trick on Chris.
There are exactly s blocks in Chris's set, each block has a unique number from 1 to s. Chris's te... | instruction | 0 | 59,198 | 8 | 118,396 |
Tags: greedy, implementation, math
Correct Solution:
```
import sys
def solve():
n = int(input())
s = 1000000
xset = set(map(int, input().split()))
res = set()
wantother = 0
for i in range(1, s + 1):
opposite = s - i + 1
if i in xset:
if opposite not in xset:
... | output | 1 | 59,198 | 8 | 118,397 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vladimir wants to modernize partitions in his office. To make the office more comfortable he decided to remove a partition and plant several bamboos in a row. He thinks it would be nice if there are n bamboos in a row, and the i-th from the ... | instruction | 0 | 59,381 | 8 | 118,762 |
Tags: brute force, data structures, implementation, math, number theory, sortings, two pointers
Correct Solution:
```
import itertools
unfold = itertools.chain.from_iterable
def jumps(a):
d = speedup
while d < a - 1:
c = (a + d - 1) // d
d = (a + c - 2) // (c - 1)
yield d
def calc(d)... | output | 1 | 59,381 | 8 | 118,763 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.