message stringlengths 2 43.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 853 107k | cluster float64 24 24 | __index_level_0__ int64 1.71k 214k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has created his own training plan to prepare for the programming contests. He will train for n days, all days are numbered from 1 to n, beginning from the first.
On the i-th day Polycarp will necessarily solve a_i problems. One eve... | instruction | 0 | 88,116 | 24 | 176,232 |
Tags: implementation
Correct Solution:
```
n = int(input())
a = list(map(int,input().split()))
e = sum(a)/2
k=0
i=0
while (k<e):
k+=a[i]
i+=1
print(i)
``` | output | 1 | 88,116 | 24 | 176,233 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has created his own training plan to prepare for the programming contests. He will train for n days, all days are numbered from 1 to n, beginning from the first.
On the i-th day Polycarp will necessarily solve a_i problems. One eve... | instruction | 0 | 88,117 | 24 | 176,234 |
Tags: implementation
Correct Solution:
```
n = int(input())
a = [float(i) for i in input().split(' ')]
threshold = sum(a) / 2
temp = 0
for i in range(n):
temp += a[i]
if temp >= threshold:
print(i + 1)
break
``` | output | 1 | 88,117 | 24 | 176,235 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has created his own training plan to prepare for the programming contests. He will train for n days, all days are numbered from 1 to n, beginning from the first.
On the i-th day Polycarp will necessarily solve a_i problems. One eve... | instruction | 0 | 88,118 | 24 | 176,236 |
Tags: implementation
Correct Solution:
```
from math import ceil
n = int(input())
A = list(map(int, input().split()))
e = ceil(sum(A) / 2)
s = 0
i = 0
while s < e:
s += A[i]
i += 1
print(i)
``` | output | 1 | 88,118 | 24 | 176,237 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has created his own training plan to prepare for the programming contests. He will train for n days, all days are numbered from 1 to n, beginning from the first.
On the i-th day Polycarp will necessarily solve a_i problems. One eve... | instruction | 0 | 88,119 | 24 | 176,238 |
Tags: implementation
Correct Solution:
```
import bisect
days = int(input())
problems = list(map(int, input().split(' ')[:days]))
prev = 0
for i in range(len(problems)):
problems[i] += prev
prev = problems[i]
x = bisect.bisect_left(problems, problems[len(problems) - 1]//2)
if 2*problems[x] - problems[len(proble... | output | 1 | 88,119 | 24 | 176,239 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has created his own training plan to prepare for the programming contests. He will train for n days, all days are numbered from 1 to n, beginning from the first.
On the i-th day Polycarp will necessarily solve a_i problems. One eve... | instruction | 0 | 88,120 | 24 | 176,240 |
Tags: implementation
Correct Solution:
```
def main():
n = int(input())
a = list(map(int,input().split()))
sigma = sum(a)
su = 0
for i in range(n):
su +=a[i]
if(su*2 >= sigma):
print(i+1)
break
main()
``` | output | 1 | 88,120 | 24 | 176,241 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has created his own training plan to prepare for the programming contests. He will train for n days, all days are numbered from 1 to n, beginning from the first.
On the i-th day Polycarp will necessarily solve a_i problems. One eve... | instruction | 0 | 88,121 | 24 | 176,242 |
Tags: implementation
Correct Solution:
```
def main():
input()
data=list(map(int,input().split()))
data_r=0
equator=sum(data)/2
for i in range(len(data)):
data_r+=data[i]
if data_r>=equator:
print(i+1)
break
if __name__=="__main__":
main()
``` | output | 1 | 88,121 | 24 | 176,243 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has created his own training plan to prepare for the programming contests. He will train for n days, all days are numbered from 1 to n, beginning from the first.
On the i-th day Polycarp will necessarily solve a_i problems. One eve... | instruction | 0 | 88,122 | 24 | 176,244 |
Tags: implementation
Correct Solution:
```
n = int(input())
tasks = list(map(int, input().split()))
s = sum(tasks)
ans, now = 0, 0
while 2 * now < s:
ans, now = ans + 1, now + tasks[ans]
print(ans)
``` | output | 1 | 88,122 | 24 | 176,245 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has created his own training plan to prepare for the programming contests. He will train for n days, all days are numbered from 1 to n, beginning from the first.
On the i-th day Polyca... | instruction | 0 | 88,123 | 24 | 176,246 |
Yes | output | 1 | 88,123 | 24 | 176,247 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has created his own training plan to prepare for the programming contests. He will train for n days, all days are numbered from 1 to n, beginning from the first.
On the i-th day Polyca... | instruction | 0 | 88,124 | 24 | 176,248 |
Yes | output | 1 | 88,124 | 24 | 176,249 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has created his own training plan to prepare for the programming contests. He will train for n days, all days are numbered from 1 to n, beginning from the first.
On the i-th day Polyca... | instruction | 0 | 88,125 | 24 | 176,250 |
Yes | output | 1 | 88,125 | 24 | 176,251 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has created his own training plan to prepare for the programming contests. He will train for n days, all days are numbered from 1 to n, beginning from the first.
On the i-th day Polyca... | instruction | 0 | 88,126 | 24 | 176,252 |
Yes | output | 1 | 88,126 | 24 | 176,253 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has created his own training plan to prepare for the programming contests. He will train for n days, all days are numbered from 1 to n, beginning from the first.
On the i-th day Polyca... | instruction | 0 | 88,127 | 24 | 176,254 |
No | output | 1 | 88,127 | 24 | 176,255 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has created his own training plan to prepare for the programming contests. He will train for n days, all days are numbered from 1 to n, beginning from the first.
On the i-th day Polyca... | instruction | 0 | 88,128 | 24 | 176,256 |
No | output | 1 | 88,128 | 24 | 176,257 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has created his own training plan to prepare for the programming contests. He will train for n days, all days are numbered from 1 to n, beginning from the first.
On the i-th day Polyca... | instruction | 0 | 88,129 | 24 | 176,258 |
No | output | 1 | 88,129 | 24 | 176,259 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has created his own training plan to prepare for the programming contests. He will train for n days, all days are numbered from 1 to n, beginning from the first.
On the i-th day Polyca... | instruction | 0 | 88,130 | 24 | 176,260 |
No | output | 1 | 88,130 | 24 | 176,261 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus got hold of a family tree. The found tree describes the family relations of n people, numbered from 1 to n. Every person in this tree has at most one direct ancestor. Also, each perso... | instruction | 0 | 88,697 | 24 | 177,394 |
No | output | 1 | 88,697 | 24 | 177,395 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus got hold of a family tree. The found tree describes the family relations of n people, numbered from 1 to n. Every person in this tree has at most one direct ancestor. Also, each perso... | instruction | 0 | 88,698 | 24 | 177,396 |
No | output | 1 | 88,698 | 24 | 177,397 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus got hold of a family tree. The found tree describes the family relations of n people, numbered from 1 to n. Every person in this tree has at most one direct ancestor. Also, each perso... | instruction | 0 | 88,699 | 24 | 177,398 |
No | output | 1 | 88,699 | 24 | 177,399 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company.
There are n positions in Polycarp's company, numbered starting from one. An employee in position i... | instruction | 0 | 89,544 | 24 | 179,088 |
Tags: brute force, dp, greedy, implementation
Correct Solution:
```
from sys import stdin
from math import ceil
def updiv(a, b):
if a % b == 0:
return a // b
else:
return a // b + 1
t = int(stdin.readline())
for _ in range(t):
n, c = map(int, stdin.readline().split())
a = [int(x) for ... | output | 1 | 89,544 | 24 | 179,089 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company.
There are n positions in Polycarp's company, numbered starting from one. An employee in position i... | instruction | 0 | 89,545 | 24 | 179,090 |
Tags: brute force, dp, greedy, implementation
Correct Solution:
```
rn=lambda:int(input())
rns=lambda:map(int,input().split())
rl=lambda:list(map(int,input().split()))
rs=lambda:input()
YN=lambda x:print('YES') if x else print('NO')
mod=10**9+7
from math import ceil
for _ in range(rn()):
n,c=rns()
a=rl()
b... | output | 1 | 89,545 | 24 | 179,091 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company.
There are n positions in Polycarp's company, numbered starting from one. An employee in position i... | instruction | 0 | 89,546 | 24 | 179,092 |
Tags: brute force, dp, greedy, implementation
Correct Solution:
```
def solve(n, c, a, b):
ds = [-1] * n
s = 0
d = 0
ds[0] = -(-c // a[0])
for i in range(n - 1):
if s >= b[i]:
s -= b[i]
d += 1
else:
dd = -(-(b[i] - s) // a[i])
d += dd +... | output | 1 | 89,546 | 24 | 179,093 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company.
There are n positions in Polycarp's company, numbered starting from one. An employee in position i... | instruction | 0 | 89,547 | 24 | 179,094 |
Tags: brute force, dp, greedy, implementation
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... | output | 1 | 89,547 | 24 | 179,095 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company.
There are n positions in Polycarp's company, numbered starting from one. An employee in position i... | instruction | 0 | 89,548 | 24 | 179,096 |
Tags: brute force, dp, greedy, implementation
Correct Solution:
```
# Legends Always Come Up with Solution
# Author: Manvir Singh
import os
import sys
from io import BytesIO, IOBase
from math import inf
def main():
for _ in range(int(input())):
n, c = map(int, input().split())
a = list(map(int, in... | output | 1 | 89,548 | 24 | 179,097 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company.
There are n positions in Polycarp's company, numbered starting from one. An employee in position i... | instruction | 0 | 89,549 | 24 | 179,098 |
Tags: brute force, dp, greedy, implementation
Correct Solution:
```
from sys import stdin, stdout
import math
def education(n, c, a_a, b_a):
r = 2**63-1
m = 0
d = 0
for i in range(n):
if m > c:
r = min(r, d)
else:
r = min(r, d + math.ceil((c - m) / a_a[i]))
... | output | 1 | 89,549 | 24 | 179,099 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company.
There are n positions in Polycarp's company, numbered starting from one. An employee in position i... | instruction | 0 | 89,550 | 24 | 179,100 |
Tags: brute force, dp, greedy, implementation
Correct Solution:
```
import math
def solve(a, b, n, m):
time = [0] * n
ost = [0] * n
for i in range(1, n):
time_on_current_curs = max(math.ceil((b[i - 1] - ost[i - 1]) / a[i - 1]), 0)
time[i] = time[i - 1] + time_on_current_curs + 1
o... | output | 1 | 89,550 | 24 | 179,101 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company.
There are n positions in Polycarp's company, numbered starting from one. An employee in position i... | instruction | 0 | 89,551 | 24 | 179,102 |
Tags: brute force, dp, greedy, implementation
Correct Solution:
```
import math
for t in range(int(input())):
n, c = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
b.append(0)
days = 10**10
dol = 0
k = 0
for i in range(n):... | output | 1 | 89,551 | 24 | 179,103 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company.
There are n positions in Polycarp's company, number... | instruction | 0 | 89,552 | 24 | 179,104 |
Yes | output | 1 | 89,552 | 24 | 179,105 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company.
There are n positions in Polycarp's company, number... | instruction | 0 | 89,553 | 24 | 179,106 |
Yes | output | 1 | 89,553 | 24 | 179,107 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company.
There are n positions in Polycarp's company, number... | instruction | 0 | 89,554 | 24 | 179,108 |
Yes | output | 1 | 89,554 | 24 | 179,109 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company.
There are n positions in Polycarp's company, number... | instruction | 0 | 89,555 | 24 | 179,110 |
Yes | output | 1 | 89,555 | 24 | 179,111 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company.
There are n positions in Polycarp's company, number... | instruction | 0 | 89,556 | 24 | 179,112 |
No | output | 1 | 89,556 | 24 | 179,113 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company.
There are n positions in Polycarp's company, number... | instruction | 0 | 89,557 | 24 | 179,114 |
No | output | 1 | 89,557 | 24 | 179,115 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company.
There are n positions in Polycarp's company, number... | instruction | 0 | 89,558 | 24 | 179,116 |
No | output | 1 | 89,558 | 24 | 179,117 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company.
There are n positions in Polycarp's company, number... | instruction | 0 | 89,559 | 24 | 179,118 |
No | output | 1 | 89,559 | 24 | 179,119 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid.
A non-empty sequence of red and blue marbles is a zebroid, if the colors of the marbles in this ... | instruction | 0 | 89,569 | 24 | 179,138 |
Tags: dp, math
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 defaultdict
from c... | output | 1 | 89,569 | 24 | 179,139 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid.
A non-empty sequence of red and blue marbles is a zebroid, if the colors of the marbles in this ... | instruction | 0 | 89,570 | 24 | 179,140 |
Tags: dp, math
Correct Solution:
```
from queue import PriorityQueue
from queue import Queue
import math
from collections import *
import sys
import operator as op
from functools import reduce
# sys.setrecursionlimit(10 ** 6)
MOD = int(1e9 + 7)
input = sys.stdin.readline
def ii(): return list(map(int, input().strip().... | output | 1 | 89,570 | 24 | 179,141 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid.
A non-empty sequence of red and blue marbles is a zebroid, if the colors of the marbles in this ... | instruction | 0 | 89,571 | 24 | 179,142 |
Tags: dp, math
Correct Solution:
```
n=int(input())
a,b=0,0
for i in range(n):
if i%2==0:a+=b+1
else:b+=a+1
a,b=a%1000000007,b%1000000007
print((a+b)%1000000007)
``` | output | 1 | 89,571 | 24 | 179,143 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid.
A non-empty sequence of red and blue marbles is a zebroid, if the colors of the marbles in this ... | instruction | 0 | 89,572 | 24 | 179,144 |
Tags: dp, math
Correct Solution:
```
n=int(input())
a=[1,1]
for i in range(n):
a[i%2]+=a[1-i%2]%1000000007
print((sum(a)-2)%1000000007)
``` | output | 1 | 89,572 | 24 | 179,145 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid.
A non-empty sequence of red and blue marbles is a zebroid, if the colors of the marbles in this ... | instruction | 0 | 89,573 | 24 | 179,146 |
Tags: dp, math
Correct Solution:
```
n = int(input())
m = int(1e9 + 7)
u, v = 0, 1
for _ in range(n - 1):
u, v = v, (u + v + 2) % m
print(v)
``` | output | 1 | 89,573 | 24 | 179,147 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid.
A non-empty sequence of red and blue marbles is a zebroid, if the colors of the marbles in this ... | instruction | 0 | 89,574 | 24 | 179,148 |
Tags: dp, math
Correct Solution:
```
l = [0,1,3]
for i in range(10 ** 6):
l.append((l[-1] * 2 - l[-3]) % (10 ** 9 + 7))
print(l[int(input())])
``` | output | 1 | 89,574 | 24 | 179,149 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid.
A non-empty sequence of red and blue marbles is a zebroid, if the colors of the marbles in this ... | instruction | 0 | 89,575 | 24 | 179,150 |
Tags: dp, math
Correct Solution:
```
n = int(input())
mod = 10**9 + 7
dp = {}
for i in range(n):
dp[i] = {}
if i == 0: dp[i][0], dp[i][1] = 1, 0
else:
dp[i][i%2] = (1 + dp[i -1][i%2] + dp[i - 1][1 - i%2])%mod
dp[i][1 - i%2] = dp[i - 1][1 - i%2]
print((dp[n - 1][0] + dp[n... | output | 1 | 89,575 | 24 | 179,151 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid.
A non-empty sequence of red and blue marbles is a zebroid, if the colors of the marbles in this ... | instruction | 0 | 89,576 | 24 | 179,152 |
Tags: dp, math
Correct Solution:
```
n = int(input())
if n != 1 :
array = [1 for k in range(n+1)]
array[1] = 1
array[2] = 2
sumi = 3
for k in range(3,n+1) :
array[k] = array[k-1] + array[k-2] %int(1e9 +7)
sumi += array[k] %int(1e9 +7)
print(sumi %int(1e9 +7))
else :
p... | output | 1 | 89,576 | 24 | 179,153 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid.
A non-empty sequence of red and blue marbles is a... | instruction | 0 | 89,577 | 24 | 179,154 |
Yes | output | 1 | 89,577 | 24 | 179,155 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid.
A non-empty sequence of red and blue marbles is a... | instruction | 0 | 89,578 | 24 | 179,156 |
Yes | output | 1 | 89,578 | 24 | 179,157 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid.
A non-empty sequence of red and blue marbles is a... | instruction | 0 | 89,579 | 24 | 179,158 |
Yes | output | 1 | 89,579 | 24 | 179,159 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid.
A non-empty sequence of red and blue marbles is a... | instruction | 0 | 89,580 | 24 | 179,160 |
Yes | output | 1 | 89,580 | 24 | 179,161 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid.
A non-empty sequence of red and blue marbles is a... | instruction | 0 | 89,581 | 24 | 179,162 |
No | output | 1 | 89,581 | 24 | 179,163 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid.
A non-empty sequence of red and blue marbles is a... | instruction | 0 | 89,582 | 24 | 179,164 |
No | output | 1 | 89,582 | 24 | 179,165 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid.
A non-empty sequence of red and blue marbles is a... | instruction | 0 | 89,583 | 24 | 179,166 |
No | output | 1 | 89,583 | 24 | 179,167 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid.
A non-empty sequence of red and blue marbles is a... | instruction | 0 | 89,584 | 24 | 179,168 |
No | output | 1 | 89,584 | 24 | 179,169 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.