message stringlengths 2 23.4k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 129 108k | cluster float64 6 6 | __index_level_0__ int64 258 216k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Eudokimus, a system administrator is in trouble again. As a result of an error in some script, a list of names of very important files has been damaged. Since they were files in the BerFS file system, it is known that each file name has a fo... | instruction | 0 | 96,378 | 6 | 192,756 |
Tags: dp, greedy, implementation
Correct Solution:
```
#############<------------ Xorcestor_X ---------------->############
from math import *
def is_even(p):
n=len(p)
count=0
for i in range(n):
index=p.index(i,i,n)
if i==index:
pass
else:
count+=1
... | output | 1 | 96,378 | 6 | 192,757 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Eudokimus, a system administrator is in trouble again. As a result of an error in some script, a list of names of very important files has been damaged. Since they were files in the BerFS file system, it is known that each file name has a fo... | instruction | 0 | 96,379 | 6 | 192,758 |
Tags: dp, greedy, implementation
Correct Solution:
```
# ========= /\ /| |====/|
# | / \ | | / |
# | /____\ | | / |
# | / \ | | / |
# ========= / \ ===== |/====|
# code
def main():
s = input()
a = list(s.split('.'))... | output | 1 | 96,379 | 6 | 192,759 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Input
The input contains a single integer a (1 ≤ a ≤ 40).
Output
Output a single string.
Examples
Input
2
Output
Adams
Input
8
Output
Van Buren
Input
29
Output
Harding | instruction | 0 | 96,440 | 6 | 192,880 |
Tags: *special, implementation
Correct Solution:
```
pres = ["Washington",
"Adams",
"Jefferson",
"Madison",
"Monroe",
"Adams",
"Jackson",
"Van Buren",
"Harrison",
"Tyler",
"Polk",
"Taylor",
"Fillmore",
"Pierce",
"Buchanan",
"Lincoln",
"Johnson",
"Grant",
"Hayes",
"Garfield",
"Arthur",
"Cleveland",
"Harrison",
"Clevelan... | output | 1 | 96,440 | 6 | 192,881 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Input
The input contains a single integer a (1 ≤ a ≤ 40).
Output
Output a single string.
Examples
Input
2
Output
Adams
Input
8
Output
Van Buren
Input
29
Output
Harding | instruction | 0 | 96,441 | 6 | 192,882 |
Tags: *special, implementation
Correct Solution:
```
n=int(input())
if (n == 1) :
print ("Washington")
elif (n == 2):
print ("Adams")
elif (n == 3):
print ("Jefferson")
elif (n == 4):
print ("Madison")
elif (n == 5):
print ("Monroe")
elif (n == 6):
print ("Adams")
elif (n == 7):
print ("Jackson")
elif (n == 8):
... | output | 1 | 96,441 | 6 | 192,883 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Input
The input contains a single integer a (1 ≤ a ≤ 40).
Output
Output a single string.
Examples
Input
2
Output
Adams
Input
8
Output
Van Buren
Input
29
Output
Harding | instruction | 0 | 96,442 | 6 | 192,884 |
Tags: *special, implementation
Correct Solution:
```
a = ['Washington', 'Adams', 'Jefferson', 'Madison', 'Monroe', 'Adams', 'Jackson', 'Van Buren', 'Harrison', 'Tyler', 'Polk', 'Taylor', 'Fillmore', 'Pierce', 'Buchanan', 'Lincoln', 'Johnson', 'Grant', 'Hayes', 'Garfield', 'Arthur', 'Cleveland', 'Harrison', 'Cleveland',... | output | 1 | 96,442 | 6 | 192,885 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Special Agent Smart Beaver works in a secret research department of ABBYY. He's been working there for a long time and is satisfied with his job, as it allows him to eat out in the best restaurants and order the most expensive and exotic woo... | instruction | 0 | 96,454 | 6 | 192,908 |
Tags: greedy
Correct Solution:
```
s = input()
z = set()
us = 0
ans = 1
if s[0] == '?' or (s[0] >= 'A' and s[0] <= 'J'):
ans = 9
z.add(s[0])
if s[0] >= 'A' and s[0] <= 'J':
us += 1
i = -1
for x in s:
i += 1
if i == 0:
continue
if x == '?':
ans *= 10
if x >= 'A' and... | output | 1 | 96,454 | 6 | 192,909 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Special Agent Smart Beaver works in a secret research department of ABBYY. He's been working there for a long time and is satisfied with his job, as it allows him to eat out in the best restaurants and order the most expensive and exotic woo... | instruction | 0 | 96,455 | 6 | 192,910 |
Tags: greedy
Correct Solution:
```
s = input()
ans = 1
l = list('ABCDEFGHIJ')
if s[0] == "?":
ans *= 9
elif s[0] in l:
ans *= 9
l.remove(s[0])
for i in s[1:]:
if i == "?":
ans *= 10
elif i in l:
ans *= len(l)
l.remove(i)
print(ans)
``` | output | 1 | 96,455 | 6 | 192,911 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Special Agent Smart Beaver works in a secret research department of ABBYY. He's been working there for a long time and is satisfied with his job, as it allows him to eat out in the best restaurants and order the most expensive and exotic woo... | instruction | 0 | 96,456 | 6 | 192,912 |
Tags: greedy
Correct Solution:
```
s = str(input())
result = 1
n = len(s)
rozne = set()
pytajniki = 0
mnoznik_z_pierwszego = 1
for i in range(0,n):
if ord(s[i]) >= ord('0') and ord(s[i]) <= ord('9'):
continue;
elif ord(s[i]) >= ord('A') and ord(s[i]) <= ord('Z'):
rozne.add(ord(s[i]))
continue
else:... | output | 1 | 96,456 | 6 | 192,913 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Special Agent Smart Beaver works in a secret research department of ABBYY. He's been working there for a long time and is satisfied with his job, as it allows him to eat out in the best restaurants and order the most expensive and exotic woo... | instruction | 0 | 96,457 | 6 | 192,914 |
Tags: greedy
Correct Solution:
```
import math
'''
r,c,n,k = map(int,input().split())
matrix = [['*' for row in range(c)] for column in range(r)]
for i in range(n):
x,y = map(int,input().split())
matrix[x-1][y-1] = '#'
ans = 0
for row1 in range(r):
for row2 in range(r):
if matrix[row1:row2+1].count(... | output | 1 | 96,457 | 6 | 192,915 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Special Agent Smart Beaver works in a secret research department of ABBYY. He's been working there for a long time and is satisfied with his job, as it allows him to eat out in the best restaurants and order the most expensive and exotic woo... | instruction | 0 | 96,458 | 6 | 192,916 |
Tags: greedy
Correct Solution:
```
from sys import *
from math import *
s = stdin.readline().strip()
ans = 1
now = 10
was = {}
was['A'] = False
was['B'] = False
was['C'] = False
was['D'] = False
was['E'] = False
was['F'] = False
was['G'] = False
was['H'] = False
was['I'] = False
was['J'] = False
if s[0] == '?':
ans... | output | 1 | 96,458 | 6 | 192,917 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Special Agent Smart Beaver works in a secret research department of ABBYY. He's been working there for a long time and is satisfied with his job, as it allows him to eat out in the best restaurants and order the most expensive and exotic woo... | instruction | 0 | 96,459 | 6 | 192,918 |
Tags: greedy
Correct Solution:
```
import math
import string
s = input()
p = 0
for x in string.ascii_uppercase[:10]:
if x in s:
p += 1
ans = 0
r = s.count('?')
if s[0] == '?':
ans = 9 * pow(10, r - 1) * math.factorial(10) // math.factorial(10 - p)
elif s[0] in string.ascii_uppercase:
ans = 9 * pow(1... | output | 1 | 96,459 | 6 | 192,919 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Special Agent Smart Beaver works in a secret research department of ABBYY. He's been working there for a long time and is satisfied with his job, as it allows him to eat out in the best restaurants and order the most expensive and exotic woo... | instruction | 0 | 96,460 | 6 | 192,920 |
Tags: greedy
Correct Solution:
```
s = input()
abc = [0] * 26
cnt1 = 0
cnt2 = 0
ans = 1
for i in range(len(s)):
if s[i] == '?':
if i == 0:
ans *= 9
else:
cnt2 += 1
elif (s[i] >= 'A') and (s[i] <= 'Z'):
if abc[(ord(s[i]) - ord('A'))] == 0:
if i == 0:
... | output | 1 | 96,460 | 6 | 192,921 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Special Agent Smart Beaver works in a secret research department of ABBYY. He's been working there for a long time and is satisfied with his job, as it allows him to eat out in the best restaurants and order the most expensive and exotic woo... | instruction | 0 | 96,461 | 6 | 192,922 |
Tags: greedy
Correct Solution:
```
I=input()
s=set()
r=I.count('?')
for x in I:
if ord(x)>64:s.add(x)
i=10
t=1
for _ in s:t*=i;i-=1
if r:t*=10;r-=1
if ord(I[0])>57:t=t//10*9
print(str(t)+'0'*r)
``` | output | 1 | 96,461 | 6 | 192,923 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has recently finished writing a book. Now he faces the problem of giving it the title. Vasya wants the title to be vague and mysterious for his book to be noticeable among others. That's why the title should be represented by a single ... | instruction | 0 | 96,567 | 6 | 193,134 |
Tags: expression parsing
Correct Solution:
```
from sys import stdin
def main():
n = int(stdin.readline())
line = stdin.readline().strip()
i,j = 0,len(line)-1
ans = ["" for i in range(len(line))]
visited = [False for i in range(27)]
ok = True
for i in range(len(line)):
if(96< ord(line[i]) <123):
cont = ord... | output | 1 | 96,567 | 6 | 193,135 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has recently finished writing a book. Now he faces the problem of giving it the title. Vasya wants the title to be vague and mysterious for his book to be noticeable among others. That's why the title should be represented by a single ... | instruction | 0 | 96,568 | 6 | 193,136 |
Tags: expression parsing
Correct Solution:
```
import sys
from array import array # noqa: F401
def input():
return sys.stdin.buffer.readline().decode('utf-8')
k = int(input())
a = list(input().rstrip())
n = len(a)
unused = [1] * k
def ng():
print('IMPOSSIBLE')
exit()
try:
for i in range(n):
... | output | 1 | 96,568 | 6 | 193,137 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has recently finished writing a book. Now he faces the problem of giving it the title. Vasya wants the title to be vague and mysterious for his book to be noticeable among others. That's why the title should be represented by a single ... | instruction | 0 | 96,569 | 6 | 193,138 |
Tags: expression parsing
Correct Solution:
```
a = [0]*26
k = int(input())
s = input()
sl = [i for i in s]
for i in s:
if(i!='?'):
a[ord(i)-97] = 1
for i in range(len(s)//2,len(s)):
if(s[i]=='?'):
if(s[len(s)-i-1] == '?'):
f = 0
for j in range(k-1,-1,-1):
... | output | 1 | 96,569 | 6 | 193,139 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has recently finished writing a book. Now he faces the problem of giving it the title. Vasya wants the title to be vague and mysterious for his book to be noticeable among others. That's why the title should be represented by a single ... | instruction | 0 | 96,570 | 6 | 193,140 |
Tags: expression parsing
Correct Solution:
```
import sys
k = int(input())
s = list(input())
used = [False] * k
for i in range(len(s)):
if '?' not in (s[i], s[-i - 1]) and \
s[i] != s[-i - 1]:
print('IMPOSSIBLE')
sys.exit(0)
if s[i] != '?':
if s[-i - 1] == '?':
s... | output | 1 | 96,570 | 6 | 193,141 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has recently finished writing a book. Now he faces the problem of giving it the title. Vasya wants the title to be vague and mysterious for his book to be noticeable among others. That's why the title should be represented by a single ... | instruction | 0 | 96,571 | 6 | 193,142 |
Tags: expression parsing
Correct Solution:
```
k = int(input())
s = input()
ans = ['' for _ in range(len(s))]
r = set([chr(ord('a')+x) for x in range(k)]) - set(s)
r = list(r)
r.sort(reverse=True)
c = 0
for i in range(len(s)//2):
if s[i] == '?' and s[-i - 1] == '?':
c += 1
if len(s) % 2 == 1 and s[len(s)//... | output | 1 | 96,571 | 6 | 193,143 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has recently finished writing a book. Now he faces the problem of giving it the title. Vasya wants the title to be vague and mysterious for his book to be noticeable among others. That's why the title should be represented by a single ... | instruction | 0 | 96,572 | 6 | 193,144 |
Tags: expression parsing
Correct Solution:
```
import sys, string
k = int(input())
pal = list(input().strip())
n = len(pal)
center = (n-1)//2
for i in range(center+1):
j = n-1-i
if pal[i] == pal[j]:
continue
if pal[i] == '?':
pal[i] = pal[j]
elif pal[j] == '?':
pal[j] = pal[i]
else:
print('IMPOSSIBLE')
s... | output | 1 | 96,572 | 6 | 193,145 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has recently finished writing a book. Now he faces the problem of giving it the title. Vasya wants the title to be vague and mysterious for his book to be noticeable among others. That's why the title should be represented by a single ... | instruction | 0 | 96,573 | 6 | 193,146 |
Tags: expression parsing
Correct Solution:
```
def f():
k, t = int(input()), input()
j, n = 0, (len(t) + 1) // 2
p = [0] * n
q = 'abcdefghijklmnopqrstuvwxyz'[: k]
r = {x: 0 for x in q}
r['?'] = 0
for i in range(n):
x, y = t[i], t[- 1 - i]
if x == '?': x = y
elif y !... | output | 1 | 96,573 | 6 | 193,147 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has recently finished writing a book. Now he faces the problem of giving it the title. Vasya wants the title to be vague and mysterious for his book to be noticeable among others. That's why the title should be represented by a single ... | instruction | 0 | 96,574 | 6 | 193,148 |
Tags: expression parsing
Correct Solution:
```
Z='IMPOSSIBLE'
R=range
P=print
I=input
k=int(I())
s=list(I())
n=len(s)
for i in R(n):
if s[i]==s[n-i-1]:pass
elif s[i]=='?':s[i]=s[n-i-1]
elif s[n-i-1]=='?':s[n-i-1]=s[i]
else:P(Z);exit()
d=set(chr(i)for i in R(97,97+k)if chr(i) not in s)
for i in R(n//2,-1,-1):
if le... | output | 1 | 96,574 | 6 | 193,149 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has recently finished writing a book. Now he faces the problem of giving it the title. Vasya wants the title to be vague and mysterious for his book to be noticeable among others. That's w... | instruction | 0 | 96,575 | 6 | 193,150 |
Yes | output | 1 | 96,575 | 6 | 193,151 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has recently finished writing a book. Now he faces the problem of giving it the title. Vasya wants the title to be vague and mysterious for his book to be noticeable among others. That's w... | instruction | 0 | 96,576 | 6 | 193,152 |
Yes | output | 1 | 96,576 | 6 | 193,153 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has recently finished writing a book. Now he faces the problem of giving it the title. Vasya wants the title to be vague and mysterious for his book to be noticeable among others. That's w... | instruction | 0 | 96,577 | 6 | 193,154 |
Yes | output | 1 | 96,577 | 6 | 193,155 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has recently finished writing a book. Now he faces the problem of giving it the title. Vasya wants the title to be vague and mysterious for his book to be noticeable among others. That's w... | instruction | 0 | 96,578 | 6 | 193,156 |
Yes | output | 1 | 96,578 | 6 | 193,157 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has recently finished writing a book. Now he faces the problem of giving it the title. Vasya wants the title to be vague and mysterious for his book to be noticeable among others. That's w... | instruction | 0 | 96,579 | 6 | 193,158 |
No | output | 1 | 96,579 | 6 | 193,159 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has recently finished writing a book. Now he faces the problem of giving it the title. Vasya wants the title to be vague and mysterious for his book to be noticeable among others. That's w... | instruction | 0 | 96,580 | 6 | 193,160 |
No | output | 1 | 96,580 | 6 | 193,161 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has recently finished writing a book. Now he faces the problem of giving it the title. Vasya wants the title to be vague and mysterious for his book to be noticeable among others. That's w... | instruction | 0 | 96,581 | 6 | 193,162 |
No | output | 1 | 96,581 | 6 | 193,163 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has recently finished writing a book. Now he faces the problem of giving it the title. Vasya wants the title to be vague and mysterious for his book to be noticeable among others. That's w... | instruction | 0 | 96,582 | 6 | 193,164 |
No | output | 1 | 96,582 | 6 | 193,165 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!
More formally, if you typed a word at second a and then the next word at second b, then if b - a ≤ c, just... | instruction | 0 | 96,631 | 6 | 193,262 |
Tags: implementation
Correct Solution:
```
n,c=map(int, input().split())
t=[int(t) for t in input().split()]
r=1
for i in range(n-1):
if t[i+1]-t[i]<=c:
r+=1
else:
r=1
print(r)
``` | output | 1 | 96,631 | 6 | 193,263 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!
More formally, if you typed a word at second a and then the next word at second b, then if b - a ≤ c, just... | instruction | 0 | 96,632 | 6 | 193,264 |
Tags: implementation
Correct Solution:
```
import sys
from collections import defaultdict, Counter
import string
def main():
n, c = [int(i) for i in input().split()]
t = [int(i) for i in input().split()]
words = 1
for i, j in zip(t[:-1], t[1:]):
if j - i > c:
words = 1
else:... | output | 1 | 96,632 | 6 | 193,265 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!
More formally, if you typed a word at second a and then the next word at second b, then if b - a ≤ c, just... | instruction | 0 | 96,633 | 6 | 193,266 |
Tags: implementation
Correct Solution:
```
#Codeforce 716A
n,c = (int(v) for v in input().split())
list1=[int(u) for u in input().split()]
list1=list1[::-1]
ans=1
for i in range(1,n):
if list1[i-1] - list1[i] <= c:
ans += 1
else:
break
print(ans)
``` | output | 1 | 96,633 | 6 | 193,267 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!
More formally, if you typed a word at second a and then the next word at second b, then if b - a ≤ c, just... | instruction | 0 | 96,634 | 6 | 193,268 |
Tags: implementation
Correct Solution:
```
n,c=map(int,input().split())
s=list(map(int,input().split()))
ans=1
for i in range(1,n):
if s[i]-s[i-1]>c:
ans=1
else:
ans+=1
print(ans)
``` | output | 1 | 96,634 | 6 | 193,269 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!
More formally, if you typed a word at second a and then the next word at second b, then if b - a ≤ c, just... | instruction | 0 | 96,635 | 6 | 193,270 |
Tags: implementation
Correct Solution:
```
n,c = [int(x) for x in input().split()]
t = list(map(int,input().split()))
l = [t[0]]
for i in range(1,n):
if t[i]-t[i-1]<=c:
l.append(t[i])
else:
l.clear()
l.append(t[i])
print(len(l))
``` | output | 1 | 96,635 | 6 | 193,271 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!
More formally, if you typed a word at second a and then the next word at second b, then if b - a ≤ c, just... | instruction | 0 | 96,636 | 6 | 193,272 |
Tags: implementation
Correct Solution:
```
n, c = map(int, input().split(" "))
t = list(map(int, input().split(" ")))
words = 1
for i in range(1, n):
if t[i] - t[i - 1] <= c:
words += 1
else:
words = 1
print(words)
``` | output | 1 | 96,636 | 6 | 193,273 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!
More formally, if you typed a word at second a and then the next word at second b, then if b - a ≤ c, just... | instruction | 0 | 96,637 | 6 | 193,274 |
Tags: implementation
Correct Solution:
```
n , c = map(int , input().split())
x = [int(x) for x in input().split()]
cnt = 0
for i in range(len(x) - 1):
if x[i + 1] - x[i] <= c:
cnt += 1
else:
cnt = 0
print(cnt + 1)
``` | output | 1 | 96,637 | 6 | 193,275 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!
More formally, if you typed a word at second a and then the next word at second b, then if b - a ≤ c, just... | instruction | 0 | 96,638 | 6 | 193,276 |
Tags: implementation
Correct Solution:
```
n, c = map(int, input().split())
l = list(map(int, input().split()))
ans = 1
for i in range(1, n):
if l[i] - l[i - 1] <= c:
ans += 1
else:
ans = 1
print(ans)
``` | output | 1 | 96,638 | 6 | 193,277 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!
More formally, if you typed a word at second a and then the... | instruction | 0 | 96,639 | 6 | 193,278 |
Yes | output | 1 | 96,639 | 6 | 193,279 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!
More formally, if you typed a word at second a and then the... | instruction | 0 | 96,640 | 6 | 193,280 |
Yes | output | 1 | 96,640 | 6 | 193,281 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!
More formally, if you typed a word at second a and then the... | instruction | 0 | 96,641 | 6 | 193,282 |
Yes | output | 1 | 96,641 | 6 | 193,283 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!
More formally, if you typed a word at second a and then the... | instruction | 0 | 96,642 | 6 | 193,284 |
Yes | output | 1 | 96,642 | 6 | 193,285 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!
More formally, if you typed a word at second a and then the... | instruction | 0 | 96,643 | 6 | 193,286 |
No | output | 1 | 96,643 | 6 | 193,287 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!
More formally, if you typed a word at second a and then the... | instruction | 0 | 96,644 | 6 | 193,288 |
No | output | 1 | 96,644 | 6 | 193,289 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!
More formally, if you typed a word at second a and then the... | instruction | 0 | 96,645 | 6 | 193,290 |
No | output | 1 | 96,645 | 6 | 193,291 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
ZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!
More formally, if you typed a word at second a and then the... | instruction | 0 | 96,646 | 6 | 193,292 |
No | output | 1 | 96,646 | 6 | 193,293 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya has a string of length n consisting of small and large English letters and digits.
He performs m operations. Each operation is described with two integers l and r and a character c: Petya removes from the string all characters c on po... | instruction | 0 | 96,690 | 6 | 193,380 |
Tags: data structures, strings
Correct Solution:
```
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
class FenwickTree:
def __init__(self, x):
"""transform list into BIT"""
self.bit = x
for i in range(len(x)):
j = i | (i + 1)
if j < len(x):
... | output | 1 | 96,690 | 6 | 193,381 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya has a string of length n consisting of small and large English letters and digits.
He performs m operations. Each operation is described with two integers l and r and a character c: Petya... | instruction | 0 | 96,691 | 6 | 193,382 |
No | output | 1 | 96,691 | 6 | 193,383 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya has a string of length n consisting of small and large English letters and digits.
He performs m operations. Each operation is described with two integers l and r and a character c: Petya... | instruction | 0 | 96,692 | 6 | 193,384 |
No | output | 1 | 96,692 | 6 | 193,385 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya has a string of length n consisting of small and large English letters and digits.
He performs m operations. Each operation is described with two integers l and r and a character c: Petya... | instruction | 0 | 96,693 | 6 | 193,386 |
No | output | 1 | 96,693 | 6 | 193,387 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya has a string of length n consisting of small and large English letters and digits.
He performs m operations. Each operation is described with two integers l and r and a character c: Petya... | instruction | 0 | 96,694 | 6 | 193,388 |
No | output | 1 | 96,694 | 6 | 193,389 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.