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 a correct Python 3 solution for this coding contest problem.
Background
The kindergarten attached to the University of Aizu is a kindergarten where children who love programming gather. Yu, one of the kindergarten children, loves lowercase letters as much as programming. Yu-kun decided to write a scoring prog... | instruction | 0 | 37,705 | 6 | 75,410 |
"Correct Solution:
```
v, e = map(int, input().split())
a_lst = input().split()
edges = [[] for _ in range(v)]
for _ in range(e):
s, t = map(int, input().split())
edges[s].append(t)
edges[t].append(s)
for i in range(v):
if "a" <= a_lst[i] <= "z": continue
lst = {i for i in range(26)}
for fr in ... | output | 1 | 37,705 | 6 | 75,411 |
Provide a correct Python 3 solution for this coding contest problem.
Background
The kindergarten attached to the University of Aizu is a kindergarten where children who love programming gather. Yu, one of the kindergarten children, loves lowercase letters as much as programming. Yu-kun decided to write a scoring prog... | instruction | 0 | 37,706 | 6 | 75,412 |
"Correct Solution:
```
V_, E_ = map(int, input().split())
A = input().split()
E = [[] for _ in range(V_)]
Used = [[False]*26 for _ in range(V_)]
for _ in range(E_):
s, t = map(int, input().split())
As, At = A[s], A[t]
if As != "?":
Used[t][ord(As)-97] = True
if At != "?":
Used[s][ord(At)... | output | 1 | 37,706 | 6 | 75,413 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya got interested in grammar on his third year in school. He invented his own language called Petya's. Petya wanted to create a maximally simple language that would be enough to chat with friends, that's why all the language's grammar can... | instruction | 0 | 37,810 | 6 | 75,620 |
Tags: implementation, strings
Correct Solution:
```
words = [c for c in input().split()]
verdict = True
category = ["" for i in range(len(words))]
gender = ["" for i in range(len(words))]
for i in range(len(words)):
if (not verdict): break
if (len(words[i]) < 3): verdict = False
elif (words[i][-3:] == "etr"):
ca... | output | 1 | 37,810 | 6 | 75,621 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya got interested in grammar on his third year in school. He invented his own language called Petya's. Petya wanted to create a maximally simple language that would be enough to chat with friends, that's why all the language's grammar can... | instruction | 0 | 37,811 | 6 | 75,622 |
Tags: implementation, strings
Correct Solution:
```
import re
def f(x):
if x.endswith("lios"): return 1
elif x.endswith("liala"): return -1
elif x.endswith("etr"): return 2
elif x.endswith("etra"): return -2
elif x.endswith("initis"):return 3
elif x.endswith("inites"): return -3
else: return... | output | 1 | 37,811 | 6 | 75,623 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya got interested in grammar on his third year in school. He invented his own language called Petya's. Petya wanted to create a maximally simple language that would be enough to chat with friends, that's why all the language's grammar can... | instruction | 0 | 37,812 | 6 | 75,624 |
Tags: implementation, strings
Correct Solution:
```
lista = input().split()
passadj = False
passsub = False
gender = -1
can = True
canF = True
# verificando os generos das palavras
for i in range(0,len(lista)):
if (len(lista[i]) >= 3 and lista[i][len(lista[i])-3::] == "etr") or (len(lista[i]) >= 4 and lista[i][len(l... | output | 1 | 37,812 | 6 | 75,625 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya got interested in grammar on his third year in school. He invented his own language called Petya's. Petya wanted to create a maximally simple language that would be enough to chat with friends, that's why all the language's grammar can... | instruction | 0 | 37,813 | 6 | 75,626 |
Tags: implementation, strings
Correct Solution:
```
words = input().split()
adj = ['lios', 'liala']
nouns = ['etr', 'etra']
verbs = ['initis', 'inites']
mascul = [adj[0], nouns[0], verbs[0]]
femine = [adj[1], nouns[1], verbs[1]]
good = True
if len(words) > 1:
masc = False
femi = False
if any([x == w... | output | 1 | 37,813 | 6 | 75,627 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya got interested in grammar on his third year in school. He invented his own language called Petya's. Petya wanted to create a maximally simple language that would be enough to chat with friends, that's why all the language's grammar can... | instruction | 0 | 37,814 | 6 | 75,628 |
Tags: implementation, strings
Correct Solution:
```
s = input().split(' ');
a = []
b = [0] * 6
for x in s:
if x[-4:] == "lios":
a.append(0)
b[0] += 1
elif x[-5:] == "liala":
a.append(3)
b[3] += 1
elif x[-3:] == "etr":
a.append(1)
b[1] += 1
elif x[-4:] == "... | output | 1 | 37,814 | 6 | 75,629 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya got interested in grammar on his third year in school. He invented his own language called Petya's. Petya wanted to create a maximally simple language that would be enough to chat with friends, that's why all the language's grammar can... | instruction | 0 | 37,815 | 6 | 75,630 |
Tags: implementation, strings
Correct Solution:
```
# from dust i have come dust i will be
#each should be of same gender
#adjective*-noun*1-verb*
a=list(map(str,input().split()))
t=[0]*len(a)
str=["lios","liala","etr","etra","initis","inites"]
if len(a)==1:
for i in range(6):
if a[0].endswith(str[i]):
... | output | 1 | 37,815 | 6 | 75,631 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya got interested in grammar on his third year in school. He invented his own language called Petya's. Petya wanted to create a maximally simple language that would be enough to chat with fri... | instruction | 0 | 37,816 | 6 | 75,632 |
No | output | 1 | 37,816 | 6 | 75,633 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya got interested in grammar on his third year in school. He invented his own language called Petya's. Petya wanted to create a maximally simple language that would be enough to chat with fri... | instruction | 0 | 37,817 | 6 | 75,634 |
No | output | 1 | 37,817 | 6 | 75,635 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya got interested in grammar on his third year in school. He invented his own language called Petya's. Petya wanted to create a maximally simple language that would be enough to chat with fri... | instruction | 0 | 37,818 | 6 | 75,636 |
No | output | 1 | 37,818 | 6 | 75,637 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya got interested in grammar on his third year in school. He invented his own language called Petya's. Petya wanted to create a maximally simple language that would be enough to chat with fri... | instruction | 0 | 37,819 | 6 | 75,638 |
No | output | 1 | 37,819 | 6 | 75,639 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Many countries have such a New Year or Christmas tradition as writing a letter to Santa including a wish list for presents. Vasya is an ordinary programmer boy. Like all ordinary boys, he is going to write the letter to Santa on the New Year... | instruction | 0 | 38,006 | 6 | 76,012 |
Tags: bitmasks, brute force, dp
Correct Solution:
```
import sys
import itertools
k, x, n, m = map(int, input().split())
def valid(inicio, fim, tamanho, num_ac):
if num_ac == 0:
if tamanho == 1:
return ("" if inicio != fim else inicio)
elif tamanho == 2:
return (inicio + fi... | output | 1 | 38,006 | 6 | 76,013 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Many countries have such a New Year or Christmas tradition as writing a letter to Santa including a wish list for presents. Vasya is an ordinary programmer boy. Like all ordinary boys, he is going to write the letter to Santa on the New Year... | instruction | 0 | 38,007 | 6 | 76,014 |
Tags: bitmasks, brute force, dp
Correct Solution:
```
# -*- coding: utf-8 -*-
import sys
def make_string(k, k2string, s1, s2):
if k in k2string:
return k2string[k]
if k == 1:
k2string[k] = s1
elif k == 2:
k2string[k] = s2
else:
k2string[k] = make_string(k-2, k2string, s1, s2) + make_string(k-1, k2string, s... | output | 1 | 38,007 | 6 | 76,015 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Many countries have such a New Year or Christmas tradition as writing a letter to Santa including a wish list for presents. Vasya is an ordinary programmer boy. Like all ordinary boys, he is going to write the letter to Santa on the New Year... | instruction | 0 | 38,008 | 6 | 76,016 |
Tags: bitmasks, brute force, dp
Correct Solution:
```
k,x,n,m=map(int,input().split())
def calc(k,a,b,op1,ed1,op2,ed2):
if k==2:
return b
return calc(k-1,b,a+b+(ed1&op2),op2,ed2,op1,ed2)
def make(len,a,op,ed):
res,i="",0
if op:
res+="C"
i+=1
if ed:
len-=1
while a:
res+="AC"
a-=1
i+=2
while i<le... | output | 1 | 38,008 | 6 | 76,017 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Many countries have such a New Year or Christmas tradition as writing a letter to Santa including a wish list for presents. Vasya is an ordinary programmer boy. Like all ordinary boys, he is going to write the letter to Santa on the New Year... | instruction | 0 | 38,009 | 6 | 76,018 |
Tags: bitmasks, brute force, dp
Correct Solution:
```
def F(a, b, c, d, e, f, k):
for _ in range(k - 2):
a, b, c, d, e, f = d, e, f, a, b + e + (c and d), f
return e
k, x, n, m = map(int, input().split())
for a in [True, False]:
for c in [True, False]:
for b in range((n - a - c) // 2 + 1):
for d in [True, Fa... | output | 1 | 38,009 | 6 | 76,019 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Many countries have such a New Year or Christmas tradition as writing a letter to Santa including a wish list for presents. Vasya is an ordinary programmer boy. Like all ordinary boys, he is going to write the letter to Santa on the New Year... | instruction | 0 | 38,010 | 6 | 76,020 |
Tags: bitmasks, brute force, dp
Correct Solution:
```
def main():
k, x, n, m = map(int, input().split())
def f(s, e, n, cnt):
ret = [""] * n
ret[0] = s
ret[-1] = e
sa = 0 if s == 'A' else 1
for i in range(cnt):
ret[sa] = 'A'
ret[sa + 1] = 'C'
... | output | 1 | 38,010 | 6 | 76,021 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Many countries have such a New Year or Christmas tradition as writing a letter to Santa including a wish list for presents. Vasya is an ordinary programmer boy. Like all ordinary boys, he is going to write the letter to Santa on the New Year... | instruction | 0 | 38,011 | 6 | 76,022 |
Tags: bitmasks, brute force, dp
Correct Solution:
```
import sys
import itertools
k, x, n, m = map(int, input().split())
def valid(inicio, fim, tamanho, num_ac):
if num_ac == 0:
if tamanho == 1:
return ("" if inicio != fim else inicio)
if tamanho == 2:
return (inicio + fim ... | output | 1 | 38,011 | 6 | 76,023 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Many countries have such a New Year or Christmas tradition as writing a letter to Santa including a wish list for presents. Vasya is an ordinary programmer boy. Like all ordinary boys, he is going to write the letter to Santa on the New Year... | instruction | 0 | 38,012 | 6 | 76,024 |
Tags: bitmasks, brute force, dp
Correct Solution:
```
def f(k):
if k == 1: return (1, 0, 0, 0, 0)
if k == 2: return (0, 1, 0, 0, 0)
if k == 3: return (1, 1, 1, 0, 0)
a, b = 1, 1
for i in range(k - 3): a, b = b, a + b
c = a
d = e = 0
for i in range(k - 3): d, e = e, d + e + int(i % 2 == 0... | output | 1 | 38,012 | 6 | 76,025 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anfisa the monkey learns to type. She is yet unfamiliar with the "space" key and can only type in lower-case Latin letters. Having typed for a fairly long line, Anfisa understood that it would be great to divide what she has written into k l... | instruction | 0 | 38,033 | 6 | 76,066 |
Tags: dp
Correct Solution:
```
line = list(map(int, input().split()))
k = line[0]
a = line[1]
b = line[2]
text = input()
textLength = len(text)
if (textLength/k > b or textLength/k < a):
print("No solution")
else:
avg = textLength // k
splitLength = [avg for i in range(k)]
remaining = textLength % k
... | output | 1 | 38,033 | 6 | 76,067 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anfisa the monkey learns to type. She is yet unfamiliar with the "space" key and can only type in lower-case Latin letters. Having typed for a fairly long line, Anfisa understood that it would be great to divide what she has written into k l... | instruction | 0 | 38,034 | 6 | 76,068 |
Tags: dp
Correct Solution:
```
#region Header
#!/usr/bin/env python3
# from typing import *
import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq
def input():
return sys.stdin.readline()[:-1]
# sys.setrecursionlimit(1000000)
#endregion
# _INPUT = """# p... | output | 1 | 38,034 | 6 | 76,069 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anfisa the monkey learns to type. She is yet unfamiliar with the "space" key and can only type in lower-case Latin letters. Having typed for a fairly long line, Anfisa understood that it would be great to divide what she has written into k l... | instruction | 0 | 38,035 | 6 | 76,070 |
Tags: dp
Correct Solution:
```
(k, a, b) = map(int, input().split())
min_len = k * a
max_len = k * b
line = input()
line_length = len(line)
print_index = 0
if line_length < min_len or line_length > max_len:
print("No solution")
else:
add_length = line_length - min_len
distance = b - a
print_to = 0
... | output | 1 | 38,035 | 6 | 76,071 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anfisa the monkey learns to type. She is yet unfamiliar with the "space" key and can only type in lower-case Latin letters. Having typed for a fairly long line, Anfisa understood that it would be great to divide what she has written into k l... | instruction | 0 | 38,036 | 6 | 76,072 |
Tags: dp
Correct Solution:
```
k , n , m = map(int,input().split())
s = input()
l = len(s)
if l>k*m or l<n*k:
print("No solution")
exit()
lis=[n]*k
l-=((n)*(k))
c=0
ans=[]
while l!=0:
for j in range(k):
if l==0:
break
if lis[j]<m:
lis[j]+=1
l-=1
# ... | output | 1 | 38,036 | 6 | 76,073 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anfisa the monkey learns to type. She is yet unfamiliar with the "space" key and can only type in lower-case Latin letters. Having typed for a fairly long line, Anfisa understood that it would be great to divide what she has written into k l... | instruction | 0 | 38,037 | 6 | 76,074 |
Tags: dp
Correct Solution:
```
k,a,b=map(int,input().split(' '))
s=input()
l=len(s)
if(l<k*a or l>k*b):
print("No solution")
else:
n1=l//k
n2=n1+1
n3=k-(l%k)
n4=l%k
cur=0
for i in range(n3):
print(s[cur:cur+n1])
cur+=n1
for i in range(n4):
print(s[cur:cur+n2])
... | output | 1 | 38,037 | 6 | 76,075 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anfisa the monkey learns to type. She is yet unfamiliar with the "space" key and can only type in lower-case Latin letters. Having typed for a fairly long line, Anfisa understood that it would be great to divide what she has written into k l... | instruction | 0 | 38,038 | 6 | 76,076 |
Tags: dp
Correct Solution:
```
def chujnia():
k, n, m = tuple(list(map(int, input().split())))
slowo = input()
lower = k*n
higher = k*m
if len(slowo) < lower or len(slowo) > higher:
print("No solution")
exit(0)
ilosc = len(slowo)//k
reszta = len(slowo) % k
cp = reszta
... | output | 1 | 38,038 | 6 | 76,077 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anfisa the monkey learns to type. She is yet unfamiliar with the "space" key and can only type in lower-case Latin letters. Having typed for a fairly long line, Anfisa understood that it would be great to divide what she has written into k l... | instruction | 0 | 38,039 | 6 | 76,078 |
Tags: dp
Correct Solution:
```
n, a, b = map(int, input().split())
s = input()
if n * a <= len(s) <= n * b:
x, y = divmod(len(s), n)
j = 0
for i in range(n):
print(s[j : j + x + (y > i)])
j = j + x + (y > i)
else:
print('No solution')
``` | output | 1 | 38,039 | 6 | 76,079 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anfisa the monkey learns to type. She is yet unfamiliar with the "space" key and can only type in lower-case Latin letters. Having typed for a fairly long line, Anfisa understood that it would be great to divide what she has written into k l... | instruction | 0 | 38,040 | 6 | 76,080 |
Tags: dp
Correct Solution:
```
k,a,b=map(int,input().split())
s=input()
bal =len(s)
if bal>k*b or bal<k*a:
print("No solution")
else:
arr=[a]*k
bal-=a*k
inc=bal//k
bal-=inc*k
for i in range(k):
arr[i]+=inc
for i in range(bal):
arr[i]+=1
#print(arr)
for i in range(1,k)... | output | 1 | 38,040 | 6 | 76,081 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.
Embosser is a special devise that allows to "print" t... | instruction | 0 | 38,175 | 6 | 76,350 |
Tags: implementation, strings
Correct Solution:
```
s = input()
ans = 0
prev = 'a'
for c in s:
v = abs(ord(c)-ord(prev))
ans += min(v, 26-v)
prev = c
print(ans)
``` | output | 1 | 38,175 | 6 | 76,351 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.
Embosser is a special devise that allows to "print" t... | instruction | 0 | 38,176 | 6 | 76,352 |
Tags: implementation, strings
Correct Solution:
```
grigoriye = ['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']
l = len(grigoriye)
staticpointer = grigoriye[0]
def get_least_distance(value):
total = 0
staticpointer_index = 0
for i in value:
... | output | 1 | 38,176 | 6 | 76,353 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.
Embosser is a special devise that allows to "print" t... | instruction | 0 | 38,177 | 6 | 76,354 |
Tags: implementation, strings
Correct Solution:
```
import sys
inp = sys.stdin.readlines()
start_position = 'a'
alpha = list(map(chr, range(97, 123)))
word = inp[0].lower().strip()
rounds = 0
for letter in word:
right = 0
while True:
try:
if alpha[alpha.index(start_position)+right] == le... | output | 1 | 38,177 | 6 | 76,355 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.
Embosser is a special devise that allows to "print" t... | instruction | 0 | 38,178 | 6 | 76,356 |
Tags: implementation, strings
Correct Solution:
```
import string
arr = [i for i in string.ascii_lowercase]
current = 'a'
s = str(input())
count = 0
for i in s:
if i != current:
count += min(abs(arr.index(i) - arr.index(current)), 26 - abs(arr.index(i) - arr.index(current)))
current = i
print(count)... | output | 1 | 38,178 | 6 | 76,357 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.
Embosser is a special devise that allows to "print" t... | instruction | 0 | 38,179 | 6 | 76,358 |
Tags: implementation, strings
Correct Solution:
```
word = input()
lc = 'a'
t = 0
for c in word:
x = max(ord(c)-ord('a')+1, ord(lc)-ord('a')+1)
y = min(ord(c)-ord('a')+1, ord(lc)-ord('a')+1)
if x - y <= 13:
t += x-y
else:
t += 26 + y-x
lc = c
print(t)
``` | output | 1 | 38,179 | 6 | 76,359 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.
Embosser is a special devise that allows to "print" t... | instruction | 0 | 38,180 | 6 | 76,360 |
Tags: implementation, strings
Correct Solution:
```
count = 0
beg = 'a'
st = input()
c = 0
for i in range (len (st)):
c = abs (ord (beg) - ord (st[i]))
count += min (c, 26 - c)
beg = st[i]
print (count)
``` | output | 1 | 38,180 | 6 | 76,361 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.
Embosser is a special devise that allows to "print" t... | instruction | 0 | 38,181 | 6 | 76,362 |
Tags: implementation, strings
Correct Solution:
```
name = input()
ans = 0
ptr = 1
for i in name:
pos = ord(i) - 96
ans += min(abs(ptr - pos), 26 - abs(ptr - pos))
ptr = pos
print(ans)
``` | output | 1 | 38,181 | 6 | 76,363 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.
Embosser is a special devise that allows to "print" t... | instruction | 0 | 38,182 | 6 | 76,364 |
Tags: implementation, strings
Correct Solution:
```
# https://codeforces.com/contest/731/problem/A
# zeus
inp = input()
start = 'a'
my_dict = {'a':1}
for i in range(2,27):
start = chr(ord(start) + 1)
my_dict[start] = i
#print(my_dict)
rotation = 0
counter = 'a'
for i in inp:
distance1 = my_dict[counte... | output | 1 | 38,182 | 6 | 76,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.
Emboss... | instruction | 0 | 38,183 | 6 | 76,366 |
Yes | output | 1 | 38,183 | 6 | 76,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.
Emboss... | instruction | 0 | 38,184 | 6 | 76,368 |
Yes | output | 1 | 38,184 | 6 | 76,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.
Emboss... | instruction | 0 | 38,185 | 6 | 76,370 |
Yes | output | 1 | 38,185 | 6 | 76,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.
Emboss... | instruction | 0 | 38,186 | 6 | 76,372 |
Yes | output | 1 | 38,186 | 6 | 76,373 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.
Emboss... | instruction | 0 | 38,187 | 6 | 76,374 |
No | output | 1 | 38,187 | 6 | 76,375 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.
Emboss... | instruction | 0 | 38,188 | 6 | 76,376 |
No | output | 1 | 38,188 | 6 | 76,377 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.
Emboss... | instruction | 0 | 38,189 | 6 | 76,378 |
No | output | 1 | 38,189 | 6 | 76,379 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.
Emboss... | instruction | 0 | 38,190 | 6 | 76,380 |
No | output | 1 | 38,190 | 6 | 76,381 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Most C/C++ programmers know about excellent opportunities that preprocessor #define directives give; but many know as well about the problems that can arise because of their careless use.
In this problem we consider the following model of #... | instruction | 0 | 38,222 | 6 | 76,444 |
Tags: dp, expression parsing, implementation
Correct Solution:
```
#!/usr/bin/env python
"""
CodeForces: 7E. Defining Macros
The key for the solution is the naked operators that are not surrounded by
the parentheses in the macro definition.
Suspicious patterns of the operators in the appearance order are:
o{-} ... | output | 1 | 38,222 | 6 | 76,445 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Most C/C++ programmers know about excellent opportunities that preprocessor #define directives give; but many know as well about the problems that can arise because of their careless use.
In this problem we consider the following model of #... | instruction | 0 | 38,223 | 6 | 76,446 |
Tags: dp, expression parsing, implementation
Correct Solution:
```
P, A, S, M, D = 1, 2, 4, 8, 16
ADD = A | S
ANY = A | S | M | D
OP_BIT = {"+": A, "-": S, "*": M, "/": D, ")": 0}
UNSAFE_BEFORE = {P: 0, A: 0, S: ADD, M: ADD, D: ANY}
UNSAFE_AFTER = {P: 0, A: 0, S: 0, M: ADD, D: ADD}
macro = dict()
def expr(chars,
... | output | 1 | 38,223 | 6 | 76,447 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Most C/C++ programmers know about excellent opportunities that preprocessor #define directives give; but many know as well about the problems that can arise because of their careless use.
In this problem we consider the following model of #... | instruction | 0 | 38,224 | 6 | 76,448 |
Tags: dp, expression parsing, implementation
Correct Solution:
```
#!/usr/bin/env python
'''
' Author: Cheng-Shih Wong
' Email: mob5566@gmail.com
' Date: 2017-08-02
'''
import re
from collections import deque
# compare the priority of operators
def comp(opa, opb):
if opa=='(' or opb=='(':
return ... | output | 1 | 38,224 | 6 | 76,449 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Most C/C++ programmers know about excellent opportunities that preprocessor #define directives give; but many know as well about the problems that can arise because of their careless use.
In this problem we consider the following model of #... | instruction | 0 | 38,225 | 6 | 76,450 |
Tags: dp, expression parsing, implementation
Correct Solution:
```
def helper(s, d):
if s in d:
return d[s]
cnt = 0
for idx, c in reversed(list(enumerate(s))):
if c == ')':
cnt += 1
elif c == '(':
cnt -= 1
if cnt == 0 and c in ['+', '-']:
... | output | 1 | 38,225 | 6 | 76,451 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Most C/C++ programmers know about excellent opportunities that preprocessor #define directives give; but many know as well about the problems that can arise because of their careless use.
In this problem we consider the following model of #... | instruction | 0 | 38,226 | 6 | 76,452 |
Tags: dp, expression parsing, implementation
Correct Solution:
```
# 1:correct, 2:incorrect, 3:(a+b), no - at front, no * or / neighbor, 4:(a*b),(a/b) no / at front
def helper(s, d):
# print(s)
if s in d:
return d[s]
cnt = 0
for idx, c in reversed(list(enumerate(s))):
if c == ')':
... | output | 1 | 38,226 | 6 | 76,453 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Most C/C++ programmers know about excellent opportunities that preprocessor #define directives give; but many know as well about the problems that can arise because of their careless use.
In this problem we consider the following model of #... | instruction | 0 | 38,227 | 6 | 76,454 |
Tags: dp, expression parsing, implementation
Correct Solution:
```
# 1:correct, 2:incorrect, 3:(a+b), no - at front, no * or / neighbor, 4:(a*b),(a/b) no / at front
def helper(s, d):
if s in d:
return d[s]
cnt = 0
for idx, c in reversed(list(enumerate(s))):
if c == ')':
cnt += 1... | output | 1 | 38,227 | 6 | 76,455 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Most C/C++ programmers know about excellent opportunities that preprocessor #define directives give; but many know as well about the problems that can arise because of their careless use.
In th... | instruction | 0 | 38,228 | 6 | 76,456 |
No | output | 1 | 38,228 | 6 | 76,457 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.