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.
Recently, Tokitsukaze found an interesting game. Tokitsukaze had n items at the beginning of this game. However, she thought there were too many items, so now she wants to discard m (1 ≤ m ≤ n) special items of them.
These n items are marke... | instruction | 0 | 22,919 | 14 | 45,838 |
Tags: implementation, two pointers
Correct Solution:
```
import math
import collections
def func(a, k):
if a % k != 0:
mod = 1
else:
mod = 0
return math.floor(a / k) * k + mod * k
n, m, k = input().split()
list = input().split()
k = int(k)
temp = k
size = 0
answer = 0
c = 0
c2 = 0
check =... | output | 1 | 22,919 | 14 | 45,839 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Maria is the most active old lady in her house. She was tired of sitting at home. She decided to organize a ceremony against the coronavirus.
She has n friends who are also grannies (Maria is not included in this number). The i-th granny is... | instruction | 0 | 23,024 | 14 | 46,048 |
Tags: greedy, sortings
Correct Solution:
```
def solve():
input()
arr = input().split()
arr = list(map(lambda x: int(x), arr))
arr.sort()
total = 1
ans = 1
for el in arr:
if total >= el:
ans = total + 1
total += 1
return ans
cases = int(input())
ans = []
for case in range(cases):
an... | output | 1 | 23,024 | 14 | 46,049 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Maria is the most active old lady in her house. She was tired of sitting at home. She decided to organize a ceremony against the coronavirus.
She has n friends who are also grannies (Maria is not included in this number). The i-th granny is... | instruction | 0 | 23,025 | 14 | 46,050 |
Tags: greedy, sortings
Correct Solution:
```
def solve(n,d):
d.sort()
for i in range(len(d) - 1,-1,-1):
# print(d[i],i)
if d[i] > i + 1:
continue
else:
return i + 2
return 1
def main():
t = int(input())
for i in range(t):
n = int(input())
... | output | 1 | 23,025 | 14 | 46,051 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Maria is the most active old lady in her house. She was tired of sitting at home. She decided to organize a ceremony against the coronavirus.
She has n friends who are also grannies (Maria is not included in this number). The i-th granny is... | instruction | 0 | 23,026 | 14 | 46,052 |
Tags: greedy, sortings
Correct Solution:
```
#include <bits/stdc++.h>
import sys
for t in range(int(sys.stdin.readline())):
n = int(sys.stdin.readline())
a = sorted(map(int, sys.stdin.readline().split()))
for i in reversed(range(n)):
if a[i] <= i + 1:
sys.stdout.write(f"{i+2}\n")
break
else:
sys.stdout... | output | 1 | 23,026 | 14 | 46,053 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Maria is the most active old lady in her house. She was tired of sitting at home. She decided to organize a ceremony against the coronavirus.
She has n friends who are also grannies (Maria is not included in this number). The i-th granny is... | instruction | 0 | 23,027 | 14 | 46,054 |
Tags: greedy, sortings
Correct Solution:
```
for q in range(int(input())):
n=int(input())
arr=list(map(int,input().split()))
arr.sort()
ans=n+1
for i in range(n-1,-1,-1):
if arr[i]>=ans:
ans-=1
else:
break
print(ans)
``` | output | 1 | 23,027 | 14 | 46,055 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Maria is the most active old lady in her house. She was tired of sitting at home. She decided to organize a ceremony against the coronavirus.
She has n friends who are also grannies (Maria is not included in this number). The i-th granny is... | instruction | 0 | 23,028 | 14 | 46,056 |
Tags: greedy, sortings
Correct Solution:
```
T = int(input())
for _ in range(T):
n = int(input())
a = list(map(int,input().split()))
a.append(0)
a.sort()
fl = True
for i in range(n,-1,-1):
if a[i] <= i:
break
print(i+1)
``` | output | 1 | 23,028 | 14 | 46,057 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Maria is the most active old lady in her house. She was tired of sitting at home. She decided to organize a ceremony against the coronavirus.
She has n friends who are also grannies (Maria is not included in this number). The i-th granny is... | instruction | 0 | 23,029 | 14 | 46,058 |
Tags: greedy, sortings
Correct Solution:
```
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
a.sort()
now = 1
lim = n
for i in range(n - 1, -1, -1):
if a[i] <= lim:
now += 1
else:
lim -= 1
print(now)
``` | output | 1 | 23,029 | 14 | 46,059 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Maria is the most active old lady in her house. She was tired of sitting at home. She decided to organize a ceremony against the coronavirus.
She has n friends who are also grannies (Maria is not included in this number). The i-th granny is... | instruction | 0 | 23,030 | 14 | 46,060 |
Tags: greedy, sortings
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Tue May 26 20:10:54 2020
@author: Mridul Garg
"""
q = int(input())
for _ in range(q):
n = int(input())
arr = list(map(int, input().split(" ")))
arr.sort()
MAX = -1
sure = 1
cur = 1
for i... | output | 1 | 23,030 | 14 | 46,061 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Maria is the most active old lady in her house. She was tired of sitting at home. She decided to organize a ceremony against the coronavirus.
She has n friends who are also grannies (Maria is not included in this number). The i-th granny is... | instruction | 0 | 23,031 | 14 | 46,062 |
Tags: greedy, sortings
Correct Solution:
```
import math
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
a.sort()
pos = -1
for i in range(n):
if a[i] <= i + 1:
pos = i + 1
if pos > 0:
print(1 + pos)
else:print(1)
``` | output | 1 | 23,031 | 14 | 46,063 |
Provide tags and a correct Python 2 solution for this coding contest problem.
Maria is the most active old lady in her house. She was tired of sitting at home. She decided to organize a ceremony against the coronavirus.
She has n friends who are also grannies (Maria is not included in this number). The i-th granny is... | instruction | 0 | 23,032 | 14 | 46,064 |
Tags: greedy, sortings
Correct Solution:
```
from sys import stdin, stdout
from collections import Counter, defaultdict
from itertools import permutations, combinations
raw_input = stdin.readline
pr = stdout.write
mod=10**9+7
def ni():
return int(raw_input())
def li():
return map(int,raw_input().split())
d... | output | 1 | 23,032 | 14 | 46,065 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maria is the most active old lady in her house. She was tired of sitting at home. She decided to organize a ceremony against the coronavirus.
She has n friends who are also grannies (Maria is n... | instruction | 0 | 23,033 | 14 | 46,066 |
Yes | output | 1 | 23,033 | 14 | 46,067 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maria is the most active old lady in her house. She was tired of sitting at home. She decided to organize a ceremony against the coronavirus.
She has n friends who are also grannies (Maria is n... | instruction | 0 | 23,034 | 14 | 46,068 |
Yes | output | 1 | 23,034 | 14 | 46,069 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maria is the most active old lady in her house. She was tired of sitting at home. She decided to organize a ceremony against the coronavirus.
She has n friends who are also grannies (Maria is n... | instruction | 0 | 23,035 | 14 | 46,070 |
Yes | output | 1 | 23,035 | 14 | 46,071 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maria is the most active old lady in her house. She was tired of sitting at home. She decided to organize a ceremony against the coronavirus.
She has n friends who are also grannies (Maria is n... | instruction | 0 | 23,036 | 14 | 46,072 |
Yes | output | 1 | 23,036 | 14 | 46,073 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maria is the most active old lady in her house. She was tired of sitting at home. She decided to organize a ceremony against the coronavirus.
She has n friends who are also grannies (Maria is n... | instruction | 0 | 23,037 | 14 | 46,074 |
No | output | 1 | 23,037 | 14 | 46,075 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maria is the most active old lady in her house. She was tired of sitting at home. She decided to organize a ceremony against the coronavirus.
She has n friends who are also grannies (Maria is n... | instruction | 0 | 23,038 | 14 | 46,076 |
No | output | 1 | 23,038 | 14 | 46,077 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maria is the most active old lady in her house. She was tired of sitting at home. She decided to organize a ceremony against the coronavirus.
She has n friends who are also grannies (Maria is n... | instruction | 0 | 23,039 | 14 | 46,078 |
No | output | 1 | 23,039 | 14 | 46,079 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maria is the most active old lady in her house. She was tired of sitting at home. She decided to organize a ceremony against the coronavirus.
She has n friends who are also grannies (Maria is n... | instruction | 0 | 23,040 | 14 | 46,080 |
No | output | 1 | 23,040 | 14 | 46,081 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Phoenix has collected n pieces of gold, and he wants to weigh them together so he can feel rich. The i-th piece of gold has weight w_i. All weights are distinct. He will put his n pieces of gold on a weight scale, one piece at a time.
The ... | instruction | 0 | 23,098 | 14 | 46,196 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
T = int(input())
t = 1
while t<=T:
n,x = map(int,input().split())
arr = list(map(int,input().split()))
if sum(arr)==x:
print("NO")
t += 1
continue
arr = sorted(arr)
tot = 0
for i in range(n-1):
... | output | 1 | 23,098 | 14 | 46,197 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Phoenix has collected n pieces of gold, and he wants to weigh them together so he can feel rich. The i-th piece of gold has weight w_i. All weights are distinct. He will put his n pieces of gold on a weight scale, one piece at a time.
The ... | instruction | 0 | 23,099 | 14 | 46,198 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
for _ in range(int(input())):
n, x = map(int, input().split())
arr = list(map(int, input().split()))
if sum(arr) == x:
print("NO")
else:
print("YES")
count = 0
for i in range(n-1):
count += arr... | output | 1 | 23,099 | 14 | 46,199 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Phoenix has collected n pieces of gold, and he wants to weigh them together so he can feel rich. The i-th piece of gold has weight w_i. All weights are distinct. He will put his n pieces of gold on a weight scale, one piece at a time.
The ... | instruction | 0 | 23,100 | 14 | 46,200 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
def main():
for _ in range(int(input())):
n, x = map(int, input().split())
arr = list(map(int, input().split()))
print(get(arr,x))
def get(arr, x):
k = 0
arr = list(sorted(arr, reverse=True))
for i in range(len(a... | output | 1 | 23,100 | 14 | 46,201 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Phoenix has collected n pieces of gold, and he wants to weigh them together so he can feel rich. The i-th piece of gold has weight w_i. All weights are distinct. He will put his n pieces of gold on a weight scale, one piece at a time.
The ... | instruction | 0 | 23,101 | 14 | 46,202 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
for i in range(int(input())):
n,x=[int(x) for x in input().split()]
l=list(map(int,input().split()))
if(sum(l)!=x):
print("YES")
g=[]
s=0
m=0
flag=0
for i in range(0,n):
if(s+l[i]!=x... | output | 1 | 23,101 | 14 | 46,203 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Phoenix has collected n pieces of gold, and he wants to weigh them together so he can feel rich. The i-th piece of gold has weight w_i. All weights are distinct. He will put his n pieces of gold on a weight scale, one piece at a time.
The ... | instruction | 0 | 23,102 | 14 | 46,204 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
from sys import stdin
input = stdin.buffer.readline
t=int(input())
for i in range(t):
n,x=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
s=0
ans=[]
flag=True
keep=None
for i in range(n):
... | output | 1 | 23,102 | 14 | 46,205 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Phoenix has collected n pieces of gold, and he wants to weigh them together so he can feel rich. The i-th piece of gold has weight w_i. All weights are distinct. He will put his n pieces of gold on a weight scale, one piece at a time.
The ... | instruction | 0 | 23,103 | 14 | 46,206 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
t = int(input())
while t > 0:
t -= 1
n, x = map(int, input().split())
w = list(map(int, input().split()))
w.sort()
done = False
for i in range(n):
s = 0
bad = False
for y in w:
s += y
... | output | 1 | 23,103 | 14 | 46,207 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Phoenix has collected n pieces of gold, and he wants to weigh them together so he can feel rich. The i-th piece of gold has weight w_i. All weights are distinct. He will put his n pieces of gold on a weight scale, one piece at a time.
The ... | instruction | 0 | 23,104 | 14 | 46,208 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
t = int(input())
while(t > 0):
l1 = []
t -= 1
n, x = map(int, input().split())
w = list(map(int, input().split()))
maxw = max(w)
lol = sum(w)
if maxw > x:
w.remove(maxw)
w.insert(0, maxw)
l1 ... | output | 1 | 23,104 | 14 | 46,209 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Phoenix has collected n pieces of gold, and he wants to weigh them together so he can feel rich. The i-th piece of gold has weight w_i. All weights are distinct. He will put his n pieces of gold on a weight scale, one piece at a time.
The ... | instruction | 0 | 23,105 | 14 | 46,210 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
for t in range(int(input())):
n,x=map(int,input().split())
l=list(map(int,input().split()))
k=sum(l)
if k==x:
print("NO")
else:
print("YES")
c=0
k=[]
for i in range(n):
c+=l[i]
... | output | 1 | 23,105 | 14 | 46,211 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mike is the president of country What-The-Fatherland. There are n bears living in this country besides Mike. All of them are standing in a line and they are numbered from 1 to n from left to right. i-th bear is exactly ai feet high.
<image... | instruction | 0 | 23,294 | 14 | 46,588 |
Tags: binary search, data structures, dp, dsu
Correct Solution:
```
n=int(input())
arr=list(map(int,input().split()))
pse,nse=[-1]*n,[n]*n
stack,stack2=[0],[n-1]
for i in range(1,n):
while(len(stack) and arr[i]<arr[stack[-1]]):
nse[stack.pop()]=i
stack.append(i)
while(len(stack2) and arr[n-i-1... | output | 1 | 23,294 | 14 | 46,589 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mike is the president of country What-The-Fatherland. There are n bears living in this country besides Mike. All of them are standing in a line and they are numbered from 1 to n from left to right. i-th bear is exactly ai feet high.
<image... | instruction | 0 | 23,295 | 14 | 46,590 |
Tags: binary search, data structures, dp, dsu
Correct Solution:
```
btqAIXPWRsBVCLo = int
btqAIXPWRsBVCLE = input
btqAIXPWRsBVCLp = list
btqAIXPWRsBVCLT = map
btqAIXPWRsBVCLN = range
btqAIXPWRsBVCLJ = max
btqAIXPWRsBVCLD = print
btqAIXPWRsBVCLy = str
btqAIXPWRsBVCLM = btqAIXPWRsBVCLo
btqAIXPWRsBVCLj = btqAIXPWRsBVCLE
b... | output | 1 | 23,295 | 14 | 46,591 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mike is the president of country What-The-Fatherland. There are n bears living in this country besides Mike. All of them are standing in a line and they are numbered from 1 to n from left to right. i-th bear is exactly ai feet high.
<image... | instruction | 0 | 23,296 | 14 | 46,592 |
Tags: binary search, data structures, dp, dsu
Correct Solution:
```
from sys import stdin, stdout
def input(): return stdin.readline().strip()
def print(x, end='\n'): stdout.write(str(x) + end)
n, lst = int(input()), list(map(int, input().split()))
nse, pse, stk, ans = [n for i in range(n)], [-1 for i in range(n)], []... | output | 1 | 23,296 | 14 | 46,593 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mike is the president of country What-The-Fatherland. There are n bears living in this country besides Mike. All of them are standing in a line and they are numbered from 1 to n from left to right. i-th bear is exactly ai feet high.
<image... | instruction | 0 | 23,297 | 14 | 46,594 |
Tags: binary search, data structures, dp, dsu
Correct Solution:
```
import sys
def main():
n=int(sys.stdin.readline())
a=list(map(int,sys.stdin.readline().split()))
dq=[]
left_nearest=[-1]*n
right_nearest=[n]*n
for i in range(n):
while len(dq) and a[dq[-1]] >= a[i]:
del dq[-... | output | 1 | 23,297 | 14 | 46,595 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mike is the president of country What-The-Fatherland. There are n bears living in this country besides Mike. All of them are standing in a line and they are numbered from 1 to n from left to right. i-th bear is exactly ai feet high.
<image... | instruction | 0 | 23,298 | 14 | 46,596 |
Tags: binary search, data structures, dp, dsu
Correct Solution:
```
n = list(map(int, input().split()))[0]
lst = list(map(int, input().split()))
sorted_index = sorted(range(n), key=lambda k: lst[k], reverse=True)
lookup = [(0, 0)] * n
res = []
res_pos = 1
for index in sorted_index:
seq_len = lookup[index][0] + ... | output | 1 | 23,298 | 14 | 46,597 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mike is the president of country What-The-Fatherland. There are n bears living in this country besides Mike. All of them are standing in a line and they are numbered from 1 to n from left to right. i-th bear is exactly ai feet high.
<image... | instruction | 0 | 23,300 | 14 | 46,600 |
Tags: binary search, data structures, dp, dsu
Correct Solution:
```
n=int(input())
arr=list(map(int,input().split()))
pse,nse=[-1]*n,[n]*n
stack,stack2=[0],[n-1]
for i in range(1,n):
while(len(stack) and arr[i]<arr[stack[-1]]):
nse[stack.pop()]=i
stack.append(i)
while(len(stack2) and arr[n-i-1... | output | 1 | 23,300 | 14 | 46,601 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats are separated into pairs by a walkway. When ZS... | instruction | 0 | 23,350 | 14 | 46,700 |
Tags: brute force, implementation
Correct Solution:
```
n = int(input())
index = -1
seats = []
for i in range(n):
s = input()
seats.append(s)
if 'OO' in s and index==-1:
index = i
if index != -1:
left, right = seats[index].split('|')
if left == 'OO':
seats[index] = '++|{}'.format(rig... | output | 1 | 23,350 | 14 | 46,701 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats are separated into pairs by a walkway. When ZS... | instruction | 0 | 23,351 | 14 | 46,702 |
Tags: brute force, implementation
Correct Solution:
```
n = int(input())
s = "NO"
b = list(list(map(str, input())) for i in range(n))
for i in range(n):
if (b[i][0]) == "O" and (b[i][1]) == "O":
b[i][0] = "+"
b[i][1] = "+"
s ="YES"
break
elif (b[i][3]) == "O" and (b[i][4]) == "O"... | output | 1 | 23,351 | 14 | 46,703 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats are separated into pairs by a walkway. When ZS... | instruction | 0 | 23,352 | 14 | 46,704 |
Tags: brute force, implementation
Correct Solution:
```
t = int(input())
index = 0
d = []
asd = []
for i in range(t):
s = input()
d.append(s)
for i in d:
if i.split("|")[0] == "OO":
print("YES")
z = d.index(i)
asd.append(True)
break
if i.split("|")[1] == 'OO':
pri... | output | 1 | 23,352 | 14 | 46,705 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats are separated into pairs by a walkway. When ZS... | instruction | 0 | 23,353 | 14 | 46,706 |
Tags: brute force, implementation
Correct Solution:
```
n=int(input())
l=[]
for i in range(n):
x=input()
l.append(x)
f=0
for i in range(len(l)):
y=l[i].split('|')
if(y[0].count('O')==2):
f=1
l[i]=l[i].replace("OO","++",1)
break
if(y[1].count('O')==2):
f=1
l[i]... | output | 1 | 23,353 | 14 | 46,707 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats are separated into pairs by a walkway. When ZS... | instruction | 0 | 23,354 | 14 | 46,708 |
Tags: brute force, implementation
Correct Solution:
```
rows = int(input())
config = [input() for x in range(rows)]
config = "\n".join(config)
ronfig = config.replace("OO", "++", 1)
if config != ronfig:
print ("YES")
print (ronfig)
else:
print ("NO")
``` | output | 1 | 23,354 | 14 | 46,709 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats are separated into pairs by a walkway. When ZS... | instruction | 0 | 23,355 | 14 | 46,710 |
Tags: brute force, implementation
Correct Solution:
```
# import sys
# sys.stdin = open('input.txt','r')
# sys.stdout = open('output.txt','w')
arr = []
flag = False
for _ in range(int(input())):
arr.append(input())
c=0
for i in arr:
if i[:2]=="OO":
arr[c]="++"+i[2:]
flag = True
break
... | output | 1 | 23,355 | 14 | 46,711 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats are separated into pairs by a walkway. When ZS... | instruction | 0 | 23,356 | 14 | 46,712 |
Tags: brute force, implementation
Correct Solution:
```
n=int(input())
arr=[]
for i in range(n):
x,y=input().split("|")
arr.append(x)
arr.append(y)
for i in range(2*n):
if arr[i]=="OO":
ans="YES"
arr[i]="++"
break
else:
ans="NO"
print(ans)
if ans=="YES":
s=""
for i in range(2*n):
if... | output | 1 | 23,356 | 14 | 46,713 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats are separated into pairs by a walkway. When ZS... | instruction | 0 | 23,357 | 14 | 46,714 |
Tags: brute force, implementation
Correct Solution:
```
t=int(input())
l=[]
while(t>0):
t=t-1
n=input()
l.extend(n.split("|"))
c=-1
for i in range(len(l)):
if(l[i]=='OO'):
c=i
break
if(c==-1):
print("NO")
else:
print("YES")
for j in range(len(l)):
if(j%2==0):
... | output | 1 | 23,357 | 14 | 46,715 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats... | instruction | 0 | 23,358 | 14 | 46,716 |
Yes | output | 1 | 23,358 | 14 | 46,717 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats... | instruction | 0 | 23,359 | 14 | 46,718 |
Yes | output | 1 | 23,359 | 14 | 46,719 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats... | instruction | 0 | 23,360 | 14 | 46,720 |
Yes | output | 1 | 23,360 | 14 | 46,721 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats... | instruction | 0 | 23,361 | 14 | 46,722 |
Yes | output | 1 | 23,361 | 14 | 46,723 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats... | instruction | 0 | 23,362 | 14 | 46,724 |
No | output | 1 | 23,362 | 14 | 46,725 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats... | instruction | 0 | 23,363 | 14 | 46,726 |
No | output | 1 | 23,363 | 14 | 46,727 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats... | instruction | 0 | 23,364 | 14 | 46,728 |
No | output | 1 | 23,364 | 14 | 46,729 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats... | instruction | 0 | 23,365 | 14 | 46,730 |
No | output | 1 | 23,365 | 14 | 46,731 |
Provide tags and a correct Python 3 solution for this coding contest problem.
— This is not playing but duty as allies of justice, Nii-chan!
— Not allies but justice itself, Onii-chan!
With hands joined, go everywhere at a speed faster than our thoughts! This time, the Fire Sisters — Karen and Tsukihi — is heading f... | instruction | 0 | 23,462 | 14 | 46,924 |
Tags: combinatorics, dp, math
Correct Solution:
```
a, b, c = map(int, input().split())
N = max(a, b, c)
mod = 998244353
def mul(a, b):
return (a * b) % mod
from itertools import accumulate
fact = [1] + list(accumulate(range(1, N + 1), mul))
rfact = [0] * (N + 1)
rfact[-1] = pow(fact[-1], mod - 2, mod)
for i in ran... | output | 1 | 23,462 | 14 | 46,925 |
Provide tags and a correct Python 3 solution for this coding contest problem.
— This is not playing but duty as allies of justice, Nii-chan!
— Not allies but justice itself, Onii-chan!
With hands joined, go everywhere at a speed faster than our thoughts! This time, the Fire Sisters — Karen and Tsukihi — is heading f... | instruction | 0 | 23,463 | 14 | 46,926 |
Tags: combinatorics, dp, math
Correct Solution:
```
def extendedEuclidean(a,b,x,y):
if b==0:
return a,1,0
d,x1,y1 = extendedEuclidean(b,a%b,x,y)
x,y = y1,x1-y1*(a//b)
return d,x,y
a,b,c = map(int,input().split())
f = [1]*(1+max(a,b,c))
fi = [1]*(1+max(a,b,c))
m = 998244353
for i in ra... | output | 1 | 23,463 | 14 | 46,927 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.