message stringlengths 2 65.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 0 108k | cluster float64 14 14 | __index_level_0__ int64 0 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Amugae has a hotel consisting of 10 rooms. The rooms are numbered from 0 to 9 from left to right.
The hotel has two entrances — one from the left end, and another from the right end. When a customer arrives to the hotel through the left ent... | instruction | 0 | 7,654 | 14 | 15,308 |
Tags: brute force, data structures, implementation
Correct Solution:
```
n=int(input())
s=input()
l=[0]*10
z=9
k=0
i=0
while i<len(s):
if s[i]=='L' and l[k]==0:
l[k]=1
k+=1
i+=1
elif s[i]=='R' and l[z]==0:
l[z]=1
z-=1
i+=1
elif s[i] in '0123456789':
x=... | output | 1 | 7,654 | 14 | 15,309 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Amugae has a hotel consisting of 10 rooms. The rooms are numbered from 0 to 9 from left to right.
The hotel has two entrances — one from the left end, and another from the right end. When a customer arrives to the hotel through the left ent... | instruction | 0 | 7,655 | 14 | 15,310 |
Tags: brute force, data structures, implementation
Correct Solution:
```
n=int(input())
s=input()
ans=[0]*10
for i in range(n):
if s[i]=='L':
for j in range(10):
if ans[j]==0:
ans[j]=1
break
elif s[i]=='R':
for j in range(9,-1,-1):
if ans[j]==0:
ans[j]=1
break
e... | output | 1 | 7,655 | 14 | 15,311 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Amugae has a hotel consisting of 10 rooms. The rooms are numbered from 0 to 9 from left to right.
The hotel has two entrances — one from the left end, and another from the right end. When a customer arrives to the hotel through the left ent... | instruction | 0 | 7,656 | 14 | 15,312 |
Tags: brute force, data structures, implementation
Correct Solution:
```
n = int(input())
D = [0] * 10
S = input()
for i in range(len(S)):
if S[i] in ['L', 'R']:
if S[i] == 'L':
for j in range(10):
if D[j] == 0:
D[j] = 1
break
else:... | output | 1 | 7,656 | 14 | 15,313 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Amugae has a hotel consisting of 10 rooms. The rooms are numbered from 0 to 9 from left to right.
The hotel has two entrances — one from the left end, and another from the right end. When a customer arrives to the hotel through the left ent... | instruction | 0 | 7,657 | 14 | 15,314 |
Tags: brute force, data structures, implementation
Correct Solution:
```
n=int(input())
l=list(input())
r=[0]*10
for i in range(n):
if l[i]=='L':
for j in range(10):
if r[j]==0:
r[j]=1
break
elif l[i]=='R':
for j in range(9,-1,-1):
if r[j]=... | output | 1 | 7,657 | 14 | 15,315 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n psychos standing in a line. Each psycho is assigned a unique integer from 1 to n. At each step every psycho who has an id greater than the psycho to his right (if exists) kills his right neighbor in the line. Note that a psycho m... | instruction | 0 | 7,883 | 14 | 15,766 |
Tags: data structures, implementation
Correct Solution:
```
n = int(input())
aa = list(map(int,input().split()))
live = []
ans=0
for i in range(n-1,-1,-1):
c = 0
while len(live)!=0 and live[-1][0]<aa[i]:
c = max(c+1,live[-1][1])
live.pop()
if c>ans: ans =c
live.append((aa[i],c))
print(an... | output | 1 | 7,883 | 14 | 15,767 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Not so long ago company R2 bought company R1 and consequently, all its developments in the field of multicore processors. Now the R2 laboratory is testing one of the R1 processors.
The testing goes in n steps, at each step the processor get... | instruction | 0 | 7,903 | 14 | 15,806 |
Tags: implementation
Correct Solution:
```
#def convert(x): x = str(x); x = x.replace(',', ''); x = x.replace('{', ''); x = x.replace('}', ''); return [int(s) for s in x.split()]
set_, hel, min_, max_ = map(int, input().split());ll = [int(x) for x in input().split()]; Err = 0
ko = [];ko.append(min_);ko.append(max_)
for... | output | 1 | 7,903 | 14 | 15,807 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Not so long ago company R2 bought company R1 and consequently, all its developments in the field of multicore processors. Now the R2 laboratory is testing one of the R1 processors.
The testing goes in n steps, at each step the processor get... | instruction | 0 | 7,904 | 14 | 15,808 |
Tags: implementation
Correct Solution:
```
n,m,minn,maxx=map(int,input().split())
L=list(map(int,input().split()))
r=0
if(minn not in L):
L+=[minn]
r+=1
if(maxx not in L):
L+=[maxx]
r+=1
valid=True
for i in range(m):
if(L[i]<minn):
valid=False
if(L[i]>maxx):
valid=False
if(r>n... | output | 1 | 7,904 | 14 | 15,809 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Not so long ago company R2 bought company R1 and consequently, all its developments in the field of multicore processors. Now the R2 laboratory is testing one of the R1 processors.
The testing goes in n steps, at each step the processor get... | instruction | 0 | 7,905 | 14 | 15,810 |
Tags: implementation
Correct Solution:
```
(n, m, mi, mx) = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
if a[0]!=mi:
m += 1
if a[-1]!=mx:
m += 1
if a[0]<mi:
m += n+1
if a[-1]>mx:
m += n+1
print(['Incorrect', 'Correct'][m<=n])
``` | output | 1 | 7,905 | 14 | 15,811 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Not so long ago company R2 bought company R1 and consequently, all its developments in the field of multicore processors. Now the R2 laboratory is testing one of the R1 processors.
The testing goes in n steps, at each step the processor get... | instruction | 0 | 7,906 | 14 | 15,812 |
Tags: implementation
Correct Solution:
```
n, m, minn, maxx = map(int, input().split())
a = sorted(list(map(int, input().split())))
cnt = 0
if minn != a[0]:
cnt += 1
if maxx != a[-1]:
cnt += 1
if maxx < a[-1]:
cnt += 10000000000000000000
if minn > a[0]:
cnt += 10000000000000000000
if n - m >= cnt:
p... | output | 1 | 7,906 | 14 | 15,813 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Not so long ago company R2 bought company R1 and consequently, all its developments in the field of multicore processors. Now the R2 laboratory is testing one of the R1 processors.
The testing goes in n steps, at each step the processor get... | instruction | 0 | 7,907 | 14 | 15,814 |
Tags: implementation
Correct Solution:
```
n, m, mi, ma = map(int, input().split())
t = list(map(int, input().split()))
mit = min(t)
mat = max(t)
if (mi <= mit and ma >= mat) and (n - m >= 2 or (n - m >= 1 and (mit == mi or mat == ma)) or (mit == mi and mat == ma)):
print('Correct')
else:
print('Incorrect')
``... | output | 1 | 7,907 | 14 | 15,815 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Not so long ago company R2 bought company R1 and consequently, all its developments in the field of multicore processors. Now the R2 laboratory is testing one of the R1 processors.
The testing goes in n steps, at each step the processor get... | instruction | 0 | 7,908 | 14 | 15,816 |
Tags: implementation
Correct Solution:
```
#!/usr/bin/python
import re
import inspect
from sys import argv, exit
def rstr():
return input()
def rstrs(splitchar=' '):
return [i for i in input().split(splitchar)]
def rint():
return int(input())
def rints(splitchar=' '):
return [int(i) for i in rstrs(s... | output | 1 | 7,908 | 14 | 15,817 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Not so long ago company R2 bought company R1 and consequently, all its developments in the field of multicore processors. Now the R2 laboratory is testing one of the R1 processors.
The testing goes in n steps, at each step the processor get... | instruction | 0 | 7,909 | 14 | 15,818 |
Tags: implementation
Correct Solution:
```
n,m,mi,ma=map(int,input().split())
k=list(map(int,input().split()))
if n-m>1 and min(k)>=mi and max(k)<=ma:
print("Correct")
elif n-m==1 and (min(k)==mi and max(k)<=ma) or (min(k)>=mi and max(k)==ma):
print("Correct")
else:
print("Incorrect")
``` | output | 1 | 7,909 | 14 | 15,819 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Not so long ago company R2 bought company R1 and consequently, all its developments in the field of multicore processors. Now the R2 laboratory is testing one of the R1 processors.
The testing goes in n steps, at each step the processor get... | instruction | 0 | 7,910 | 14 | 15,820 |
Tags: implementation
Correct Solution:
```
n, m, mmin, mmax = map(int, input().split())
s = list(map(int, input().split()))
s = sorted(s)
if s[0] < mmin or s[m - 1] > mmax:
print("Incorrect")
elif s[0] == mmin and s[m - 1] == mmax:
print("Correct")
elif s[0] != mmin and s[m - 1] != mmax:
if n - m < 2:
... | output | 1 | 7,910 | 14 | 15,821 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. In the interaction section below you will see the information about flushing the output.
In this problem, you will be playing a game with Hongcow. How lucky of you!
Hongcow has a hidden n by n matrix M. Let ... | instruction | 0 | 8,047 | 14 | 16,094 |
Tags: bitmasks, divide and conquer, interactive
Correct Solution:
```
import sys
import math
import itertools
n = int(input())
l = n.bit_length()
A = [float('inf')] * n
for i in range(l):
digits = map(lambda x: (x>>i)&1, range(1, n+1))
question = list(filter(lambda x: (x>>i)&1, range(1, n+1)))
print(l... | output | 1 | 8,047 | 14 | 16,095 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. In the interaction section below you will see the information about flushing the output.
In this problem, you will be playing a game with Hongcow. How lucky of you!
Hongcow has a hidden n by n matrix M. Let ... | instruction | 0 | 8,048 | 14 | 16,096 |
Tags: bitmasks, divide and conquer, interactive
Correct Solution:
```
inf = 10 ** 10
n = int(input())
m = 1
while not (n < 2 ** m):
m += 1
u = []
v = []
for i in range(m):
u.append([])
v.append([])
for j in range(n):
if j & (1 << i):
u[i].append(j+1)
else:
v[i].... | output | 1 | 8,048 | 14 | 16,097 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. In the interaction section below you will see the information about flushing the output.
In this problem, you will be playing a game with Hongcow. How lucky of you!
Hongcow has a hidden n by n matrix M. Let ... | instruction | 0 | 8,049 | 14 | 16,098 |
Tags: bitmasks, divide and conquer, interactive
Correct Solution:
```
import sys
n = int(input())
MAX = 2000 * 1000 * 1000
res = [MAX] * n
k = 1
while k < n:
x = [0] * n
output = []
sz = 0
for i in range(0, n, 2 * k):
for j in range(0, min(n - i, k)):
output.append(i + j + 1)
... | output | 1 | 8,049 | 14 | 16,099 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. In the interaction section below you will see the information about flushing the output.
In this problem, you will be playing a game with Hongcow. How lucky of you!
Hongcow has a hidden n by n matrix M. Let ... | instruction | 0 | 8,050 | 14 | 16,100 |
Tags: bitmasks, divide and conquer, interactive
Correct Solution:
```
import sys
n = int(input())
MAX = 2000 * 1000 * 1000
res = [MAX] * n
k = 1
while k < n:
x = [0] * n
output = []
sz = 0
for i in range(0, n, 2 * k):
for j in range(0, min(n - i, k)):
output.append(i + j + 1)
... | output | 1 | 8,050 | 14 | 16,101 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. In the interaction section below you will see the information about flushing the output.
In this problem, you will be playing a game with Hongcow. How lucky of you!
Hongcow has a hidden n by n matrix M. Let ... | instruction | 0 | 8,051 | 14 | 16,102 |
Tags: bitmasks, divide and conquer, interactive
Correct Solution:
```
from sys import stdout
n = int(input())
ans = [10**10] * n
th = 1
while th < n:
ask = [i % (2*th) < th for i in range(n)]
for _ in range(2):
inds = [key for key, value in enumerate(ask) if value]
print(len(inds))
print... | output | 1 | 8,051 | 14 | 16,103 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. In the interaction section below you will see the information about flushing the output.
In this problem, you will be playing a game with Hongcow. How lucky of you!
Hongcow has a hidden n by n matrix M. Let ... | instruction | 0 | 8,052 | 14 | 16,104 |
Tags: bitmasks, divide and conquer, interactive
Correct Solution:
```
import sys
n = int(input())
mn = [float('inf') for _ in range(n)]
ln = len(bin(n)) - 3
cnt = 0
for bit in range(ln, -1, -1):
query = []
inv_query = []
for i in range(1, n + 1):
if i & (1<<bit):
query.append(i)
... | output | 1 | 8,052 | 14 | 16,105 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. In the interaction section below you will see the information about flushing the output.
In this problem, you will be playing a game with Hongcow. How lucky of you!
Hongcow has a hidden n by n matrix M. Let ... | instruction | 0 | 8,053 | 14 | 16,106 |
Tags: bitmasks, divide and conquer, interactive
Correct Solution:
```
n = int(input().strip())
import math
import sys
factor = 1
each_row_min = [10000000000]*n
for i in range(int(math.log(n, 2))+1):
if factor >= n:
break
mask = []
comp_mask = []
for j in range(n):
if (j//factor)%2 == 0:
... | output | 1 | 8,053 | 14 | 16,107 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. In the interaction section below you will see the information about flushing the output.
In this problem, you will be playing a game with Hongcow. How lucky of you!
Hongcow has a hidden n by n matrix M. Let ... | instruction | 0 | 8,054 | 14 | 16,108 |
Tags: bitmasks, divide and conquer, interactive
Correct Solution:
```
from sys import stdout
n = int(input())
ans = [10**10] * n
th = 1
while th < n:
ask = [i % (2*th) < th for i in range(n)]
for _ in range(2):
inds = [key for key, value in enumerate(ask) if value]
print(len(inds))
print... | output | 1 | 8,054 | 14 | 16,109 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if they got an order that Bob is a scouter, if the... | instruction | 0 | 8,067 | 14 | 16,134 |
Tags: constructive algorithms, greedy
Correct Solution:
```
names = [chr(i + 65) + chr(j + 97) for i in range(26) for j in range(26)]
n, m = map(int, input().split())
ans = names[:m - 1]
j = m - 1
k = 0
for i in input().split():
if i == "YES":
ans.append(names[j])
j += 1
else:
ans.append... | output | 1 | 8,067 | 14 | 16,135 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if they got an order that Bob is a scouter, if the... | instruction | 0 | 8,068 | 14 | 16,136 |
Tags: constructive algorithms, greedy
Correct Solution:
```
import string
n, k = list(map(int, input().split()))
conds = list(map(str, input().split()))
names = list()
for i in range(n):
names.append(string.ascii_uppercase[i % 26] + string.ascii_lowercase[i // 26])
for j in range(n - k + 1):
if conds[j] == "Y... | output | 1 | 8,068 | 14 | 16,137 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if they got an order that Bob is a scouter, if the... | instruction | 0 | 8,069 | 14 | 16,138 |
Tags: constructive algorithms, greedy
Correct Solution:
```
import math, sys, itertools
def main():
n,k = map(int, input().split())
lst = input().split()
d = []
it = 0
itd = 0
for i in range(k):
if (it>25):
itd+=1
it = 0
d.append(chr(65+itd)+chr(97+it))
it+=1
ans = []
for i in range(k-1):
ans.ap... | output | 1 | 8,069 | 14 | 16,139 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if they got an order that Bob is a scouter, if the... | instruction | 0 | 8,070 | 14 | 16,140 |
Tags: constructive algorithms, greedy
Correct Solution:
```
def ntoname(num):
c = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
l = "abcdefghijklmnopqrstuvwxyz"
na = c[num%26]
num //= 26
while num:
na += l[num%26]
num //= 26
return na
n, k = map(int, input().split())
L = [True if i == 'YES' else... | output | 1 | 8,070 | 14 | 16,141 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if they got an order that Bob is a scouter, if the... | instruction | 0 | 8,071 | 14 | 16,142 |
Tags: constructive algorithms, greedy
Correct Solution:
```
names = list("A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Ab Bb Cb Db Eb Fb Gb Hb Ib Jb Kb Lb Mb Nb Ob Pb Qb Rb Sb Tb Ub Vb Wb Xb Gh Rg Df".split())
n, k = map(int, input().split())
A = list(input().split())
find = False
ans = [0] * n
for i in range(n... | output | 1 | 8,071 | 14 | 16,143 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if they got an order that Bob is a scouter, if the... | instruction | 0 | 8,072 | 14 | 16,144 |
Tags: constructive algorithms, greedy
Correct Solution:
```
#===========Template===============
from io import BytesIO, IOBase
from math import sqrt
import sys,os
from os import path
inpl=lambda:list(map(int,input().split()))
inpm=lambda:map(int,input().split())
inpi=lambda:int(input())
inp=lambda:input()
rev,ra,l=reve... | output | 1 | 8,072 | 14 | 16,145 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if they got an order that Bob is a scouter, if the... | instruction | 0 | 8,073 | 14 | 16,146 |
Tags: constructive algorithms, greedy
Correct Solution:
```
from sys import stdin, stdout
import string
n,k = map(int, stdin.readline().rstrip().split())
YesNoList = stdin.readline().rstrip().split()
nameList = list(string.ascii_uppercase) + ['A'+letter for letter in string.ascii_lowercase]
answerList=[]
nl=0
yn=0
... | output | 1 | 8,073 | 14 | 16,147 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if they got an order that Bob is a scouter, if the... | instruction | 0 | 8,074 | 14 | 16,148 |
Tags: constructive algorithms, greedy
Correct Solution:
```
#import time
#startTime = time.time()
MAS = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H']
def generateName(num):
return MAS[num%8] + MAS[int(num/8)].lower()
n, k = [int(i) for i in input().split()]
mas = [i for i in input().split()]
names = [generateName(i) f... | output | 1 | 8,074 | 14 | 16,149 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if ... | instruction | 0 | 8,075 | 14 | 16,150 |
Yes | output | 1 | 8,075 | 14 | 16,151 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if ... | instruction | 0 | 8,076 | 14 | 16,152 |
Yes | output | 1 | 8,076 | 14 | 16,153 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if ... | instruction | 0 | 8,077 | 14 | 16,154 |
Yes | output | 1 | 8,077 | 14 | 16,155 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if ... | instruction | 0 | 8,078 | 14 | 16,156 |
Yes | output | 1 | 8,078 | 14 | 16,157 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if ... | instruction | 0 | 8,079 | 14 | 16,158 |
No | output | 1 | 8,079 | 14 | 16,159 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if ... | instruction | 0 | 8,080 | 14 | 16,160 |
No | output | 1 | 8,080 | 14 | 16,161 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if ... | instruction | 0 | 8,081 | 14 | 16,162 |
No | output | 1 | 8,081 | 14 | 16,163 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if ... | instruction | 0 | 8,082 | 14 | 16,164 |
No | output | 1 | 8,082 | 14 | 16,165 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students went into a class to write a test and sat in some way. The teacher thought: "Probably they sat in this order to copy works of each other. I need to rearrange them in such a way that students that were neighbors are not neighbors in ... | instruction | 0 | 8,109 | 14 | 16,218 |
Tags: brute force, constructive algorithms, math
Correct Solution:
```
import sys, itertools
#f = open('input', 'r')
f = sys.stdin
def near(i,n,m):
x = i//m
y = i%m
d = [[0, -1], [0, 1], [-1, 0], [1, 0]]
ns = []
for dx, dy in d:
nx=x+dx
ny=y+dy
if nx>=0 and nx<n and ny>=0 and ny<m:
ns.appe... | output | 1 | 8,109 | 14 | 16,219 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students went into a class to write a test and sat in some way. The teacher thought: "Probably they sat in this order to copy works of each other. I need to rearrange them in such a way that students that were neighbors are not neighbors in ... | instruction | 0 | 8,110 | 14 | 16,220 |
Tags: brute force, constructive algorithms, math
Correct Solution:
```
def transpos(a,n,m):
b = []
for i in range(m):
b.append([a[j][i] for j in range(n)])
return(b)
def printarr(a):
for i in range(len(a)):
for j in range(len(a[i])):
print(a[i][j], end = ' ')
print(... | output | 1 | 8,110 | 14 | 16,221 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students went into a class to write a test and sat in some way. The teacher thought: "Probably they sat in this order to copy works of each other. I need to rearrange them in such a way that students that were neighbors are not neighbors in ... | instruction | 0 | 8,111 | 14 | 16,222 |
Tags: brute force, constructive algorithms, math
Correct Solution:
```
def get_answer(m, n):
if (m, n) in [(1, 2), (2, 1), (1, 3), (3, 1), (2, 2), (2, 3), (3, 2)]:
return ("NO", [])
elif (n == 1):
mat = [[i] for i in range(2, m+1, 2)] + [[i] for i in range(1, m+1, 2)]
return ("YES", mat)
elif n == 2:
bs ... | output | 1 | 8,111 | 14 | 16,223 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students went into a class to write a test and sat in some way. The teacher thought: "Probably they sat in this order to copy works of each other. I need to rearrange them in such a way that students that were neighbors are not neighbors in ... | instruction | 0 | 8,112 | 14 | 16,224 |
Tags: brute force, constructive algorithms, math
Correct Solution:
```
def get_answer(m, n):
if (m, n) in [(1, 2), (2, 1), (1, 3), (3, 1), (2, 2), (2, 3), (3, 2)]:
return ("NO", [])
elif (m == 1):
mat = [[i for i in range(2, n+1, 2)] + [i for i in range(1, n+1, 2)]]
return ("YES", mat)
elif (n == 1):
mat =... | output | 1 | 8,112 | 14 | 16,225 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students went into a class to write a test and sat in some way. The teacher thought: "Probably they sat in this order to copy works of each other. I need to rearrange them in such a way that students that were neighbors are not neighbors in ... | instruction | 0 | 8,113 | 14 | 16,226 |
Tags: brute force, constructive algorithms, math
Correct Solution:
```
n,m=map(int,input().strip().split(' '))
arr=[]
cnt=1
if(n*m==1):
print("YES")
print(1)
elif((n==1 and(m==2 or m==3)) or ((n==2) and (m==1 or m==2 or m==3)) or ((n==3) and (m==1 or m==2 )) ):
print("NO")
elif(n==3 and m==3):
print("YES")
print(... | output | 1 | 8,113 | 14 | 16,227 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students went into a class to write a test and sat in some way. The teacher thought: "Probably they sat in this order to copy works of each other. I need to rearrange them in such a way that students that were neighbors are not neighbors in ... | instruction | 0 | 8,114 | 14 | 16,228 |
Tags: brute force, constructive algorithms, math
Correct Solution:
```
def get_answer(m, n):
if (m, n) in [(1, 2), (2, 1), (1, 3), (3, 1), (2, 2), (2, 3), (3, 2)]:
return ("NO", [])
elif (m == 1):
mat = [[i for i in range(2, n+1, 2)] + [i for i in range(1, n+1, 2)]]
return ("YES", mat)
elif (n == 1):
mat =... | output | 1 | 8,114 | 14 | 16,229 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students went into a class to write a test and sat in some way. The teacher thought: "Probably they sat in this order to copy works of each other. I need to rearrange them in such a way that students that were neighbors are not neighbors in ... | instruction | 0 | 8,115 | 14 | 16,230 |
Tags: brute force, constructive algorithms, math
Correct Solution:
```
import bisect
def list_output(s):
print(' '.join(map(str, s)))
def list_input(s='int'):
if s == 'int':
return list(map(int, input().split()))
elif s == 'float':
return list(map(float, input().split()))
r... | output | 1 | 8,115 | 14 | 16,231 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students went into a class to write a test and sat in some way. The teacher thought: "Probably they sat in this order to copy works of each other. I need to rearrange them in such a way that stu... | instruction | 0 | 8,116 | 14 | 16,232 |
No | output | 1 | 8,116 | 14 | 16,233 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students went into a class to write a test and sat in some way. The teacher thought: "Probably they sat in this order to copy works of each other. I need to rearrange them in such a way that stu... | instruction | 0 | 8,117 | 14 | 16,234 |
No | output | 1 | 8,117 | 14 | 16,235 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students went into a class to write a test and sat in some way. The teacher thought: "Probably they sat in this order to copy works of each other. I need to rearrange them in such a way that stu... | instruction | 0 | 8,118 | 14 | 16,236 |
No | output | 1 | 8,118 | 14 | 16,237 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students went into a class to write a test and sat in some way. The teacher thought: "Probably they sat in this order to copy works of each other. I need to rearrange them in such a way that stu... | instruction | 0 | 8,119 | 14 | 16,238 |
No | output | 1 | 8,119 | 14 | 16,239 |
Provide a correct Python 3 solution for this coding contest problem.
You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens.
There are N attendees in the party, and they are given attendee numbers from ... | instruction | 0 | 8,184 | 14 | 16,368 |
"Correct Solution:
```
N = int(input())
A = list(map(int, input().split()))
d = [0]*N
ans = 0
for i in range(N):
a = A[i]
l,r = i+a, i-a
if 0 <= l < N:
d[l] += 1
if 0 <= r < N:
ans += d[r]
print(ans)
``` | output | 1 | 8,184 | 14 | 16,369 |
Provide a correct Python 3 solution for this coding contest problem.
You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens.
There are N attendees in the party, and they are given attendee numbers from ... | instruction | 0 | 8,185 | 14 | 16,370 |
"Correct Solution:
```
from collections import defaultdict
n = int(input())
A = list(map(int, input().split()))
cnt = defaultdict(int)
ans = 0
for i in range(n):
k = i-A[i]
ans += cnt[k]
cnt[i+A[i]]+=1
print(ans)
``` | output | 1 | 8,185 | 14 | 16,371 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.