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.
Recently, on a programming lesson little Petya showed how quickly he can create files and folders on the computer. But he got soon fed up with this activity, and he decided to do a much more useful thing. He decided to calculate what folder ... | instruction | 0 | 61,133 | 6 | 122,266 |
Tags: data structures, implementation
Correct Solution:
```
#################
# July 21st 2019.
#################
#############################################################################
# Directory class definition.
class Directory:
# Method to get recursive sub-directory count.
def getSubDirCount(self):... | output | 1 | 61,133 | 6 | 122,267 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently, on a programming lesson little Petya showed how quickly he can create files and folders on the computer. But he got soon fed up with this activity, and he decided to do a much more useful thing. He decided to calculate what folder ... | instruction | 0 | 61,134 | 6 | 122,268 |
Tags: data structures, implementation
Correct Solution:
```
import sys
s=sys.stdin.readline()
Subs={}
Files={}
while(s!=""):
s=s.split('\\')
n=len(s)
e=s[0]+s[1]
if(e not in Subs):
Subs[e]=[]
Files[e]=[]
for i in range(2,n):
if(i==n-1):
Files[s[0]+s[1]].append(e+... | output | 1 | 61,134 | 6 | 122,269 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently, on a programming lesson little Petya showed how quickly he can create files and folders on the computer. But he got soon fed up with this activity, and he decided to do a much more useful thing. He decided to calculate what folder ... | instruction | 0 | 61,135 | 6 | 122,270 |
Tags: data structures, implementation
Correct Solution:
```
import sys
files,folder_subfolder = {},{}
paths = sys.stdin.readlines()
for line in paths:
path = line.split('\\')
path_length = len(path)
headOFpath = path[0] + path[1]; interim = headOFpath
if headOFpath not in folder_subfolder:
# To ... | output | 1 | 61,135 | 6 | 122,271 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently, on a programming lesson little Petya showed how quickly he can create files and folders on the computer. But he got soon fed up with this activity, and he decided to do a much more useful thing. He decided to calculate what folder ... | instruction | 0 | 61,136 | 6 | 122,272 |
Tags: data structures, implementation
Correct Solution:
```
import sys
from array import array # noqa: F401
from collections import defaultdict
def input():
return sys.stdin.buffer.readline().decode('utf-8')
cnt1 = defaultdict(set)
cnt2 = defaultdict(int)
for line in sys.stdin:
path = line.rstrip().split(... | output | 1 | 61,136 | 6 | 122,273 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently, on a programming lesson little Petya showed how quickly he can create files and folders on the computer. But he got soon fed up with this activity, and he decided to do a much more useful thing. He decided to calculate what folder ... | instruction | 0 | 61,137 | 6 | 122,274 |
Tags: data structures, implementation
Correct Solution:
```
is_file = dict()
edges = dict()
used = dict()
dirs_count = dict()
files_count = dict()
def dfs(key):
dirs_count[key] = 1 - is_file.get(key, 0)
files_count[key] = is_file.get(key, 0)
used.setdefault(key, 1)
for v in edges[key]:
if used.... | output | 1 | 61,137 | 6 | 122,275 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letters can be delet... | instruction | 0 | 61,872 | 6 | 123,744 |
Tags: greedy, strings
Correct Solution:
```
import re
A = re.findall("\w",input())
B = ["h","e","l","l","o"," "]
i = 0
while i < len(A):
if A[i] == B[i]:
i += 1
else:
del(A[i])
C = "".join(A)
if C == "hello":
print("YES")
else:
print("NO")
``` | output | 1 | 61,872 | 6 | 123,745 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letters can be delet... | instruction | 0 | 61,873 | 6 | 123,746 |
Tags: greedy, strings
Correct Solution:
```
n=input()
j,i=0,0
x=[]
for k in n:
x.append(k)
a=['h','e','l','l','o']
while i<len(n) and j<=4:
if a[j]==x[i]:
j+=1
i+=1
if j==5:
print('YES')
else:
print('NO')
``` | output | 1 | 61,873 | 6 | 123,747 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letters can be delet... | instruction | 0 | 61,874 | 6 | 123,748 |
Tags: greedy, strings
Correct Solution:
```
#!/usr/bin/python3
def readln(): return tuple(map(int, input().split()))
s = input()
ans = 'YES'
for c in list('hello'):
if s.count(c) == 0:
ans = 'NO'
else:
s = s[s.index(c) + 1:]
print(ans)
``` | output | 1 | 61,874 | 6 | 123,749 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letters can be delet... | instruction | 0 | 61,875 | 6 | 123,750 |
Tags: greedy, strings
Correct Solution:
```
m='hello'
x=0
s=input()
for i in range(len(s)):
if s[i]==m[x]:
x+=1
if x==5:
print('YES')
break
else:
print('NO')
``` | output | 1 | 61,875 | 6 | 123,751 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letters can be delet... | instruction | 0 | 61,876 | 6 | 123,752 |
Tags: greedy, strings
Correct Solution:
```
w = input()
h = w.find('h')
e = w.find('e',h)
l = w.find('l',e)
ll = w.find('l',l+1)
o = w.find('o',ll)
if h<e<l<ll<o:
print('YES')
else:
print('NO')
``` | output | 1 | 61,876 | 6 | 123,753 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letters can be delet... | instruction | 0 | 61,877 | 6 | 123,754 |
Tags: greedy, strings
Correct Solution:
```
S = input()
T = "hello"
i = 0
j = 0
while i < len(S) and j < len(T):
if S[i] == T[j]: j += 1
i += 1
print("YES" if j == len(T) else "NO")
``` | output | 1 | 61,877 | 6 | 123,755 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letters can be delet... | instruction | 0 | 61,878 | 6 | 123,756 |
Tags: greedy, strings
Correct Solution:
```
string = input()
hello = "hello"
count = 0
for i in range(len(string)):
if string[i] == hello[count]:
count+=1
if count==5:
break
if count==5:
print("YES")
else:
print("NO")
``` | output | 1 | 61,878 | 6 | 123,757 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letters can be delet... | instruction | 0 | 61,879 | 6 | 123,758 |
Tags: greedy, strings
Correct Solution:
```
s = input()
k = 'hello'
i = 0
for c in s:
if c == k[i]:
i += 1
if i == 5:
break
if i == 5:
print('YES')
else:
print('NO')
``` | output | 1 | 61,879 | 6 | 123,759 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya recieved a gift of a string s with length up to 105 characters for his birthday. He took two more empty strings t and u and decided to play a game. This game has two possible moves:
* Extract the first character of s and append t wi... | instruction | 0 | 61,955 | 6 | 123,910 |
Tags: data structures, greedy, strings
Correct Solution:
```
from sys import stdin
from collections import deque
input = stdin.readline
s = input().strip()
t = []
u = []
x = deque()
cur_min = "z"
for i in range(len(s)-1, -1, -1):
cur_min = min(cur_min, s[i])
x.appendleft(cur_min)
i = 0
while i < len(s):
i... | output | 1 | 61,955 | 6 | 123,911 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya recieved a gift of a string s with length up to 105 characters for his birthday. He took two more empty strings t and u and decided to play a game. This game has two possible moves:
* Extract the first character of s and append t wi... | instruction | 0 | 61,956 | 6 | 123,912 |
Tags: data structures, greedy, strings
Correct Solution:
```
# import sys
# sys.stdin = open('D:\\codes\\ccdsap prepare\\in.txt', 'r')
# sys.stdout = open('D:\\codes\\ccdsap prepare\\out.txt', 'w')
def compare(a, vis):
for i in range(0, ord(a) - ord('a')):
if vis[i] > 0:
return False
return... | output | 1 | 61,956 | 6 | 123,913 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya recieved a gift of a string s with length up to 105 characters for his birthday. He took two more empty strings t and u and decided to play a game. This game has two possible moves:
* Extract the first character of s and append t wi... | instruction | 0 | 61,959 | 6 | 123,918 |
Tags: data structures, greedy, strings
Correct Solution:
```
import math
import bisect
def getList(method=int):
return list(map(method, input().split()))
def getInt():
return int(input())
def hasGreater(c):
global mp
for k, v in mp.items():
if c > k and v:
return True
retur... | output | 1 | 61,959 | 6 | 123,919 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya recieved a gift of a string s with length up to 105 characters for his birthday. He took two more empty strings t and u and decided to play a game. This game has two possible moves:
* Extract the first character of s and append t wi... | instruction | 0 | 61,960 | 6 | 123,920 |
Tags: data structures, greedy, strings
Correct Solution:
```
from itertools import takewhile
def f(s):
t = []
u = []
chars = 'abcdefghijklmnopqrstuvwxyz'
for c in chars:
stack = list(takewhile(lambda x: x <= c, reversed(t)))
count = len(stack)
if count > 0:
u += sta... | output | 1 | 61,960 | 6 | 123,921 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya recieved a gift of a string s with length up to 105 characters for his birthday. He took two more empty strings t and u and decided to play a game. This game has two possible moves:
* Extract the first character of s and append t wi... | instruction | 0 | 61,961 | 6 | 123,922 |
Tags: data structures, greedy, strings
Correct Solution:
```
a = input()
b = list(a)
c = b[:]
c.sort()
t = []
answer = []
for i in range(len(c)):
while(len(t) != 0 and c[i] >= t[len(t)-1]):
#print("lil")
answer.append(t[len(t)-1])
t.pop(len(t) -1)
if(c[i] in b):
if(b[0] == c[i])... | output | 1 | 61,961 | 6 | 123,923 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roman and Denis are on the trip to the programming competition. Since the trip was long, they soon got bored, and hence decided to came up with something. Roman invented a pizza's recipe, while Denis invented a string multiplication. Accordi... | instruction | 0 | 62,325 | 6 | 124,650 |
Tags: dp, greedy, strings
Correct Solution:
```
from math import *
import sys
def minp():
return sys.stdin.readline().strip()
def mint():
return int(minp())
def mints():
return map(int, minp().split())
n = mint()
s = list(minp())
#a = [[0]*256 for i in range(3)]
a = [0]*256
i = 0
l = len(s)
while i < l:
j = i +... | output | 1 | 62,325 | 6 | 124,651 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roman and Denis are on the trip to the programming competition. Since the trip was long, they soon got bored, and hence decided to came up with something. Roman invented a pizza's recipe, while Denis invented a string multiplication. Accordi... | instruction | 0 | 62,326 | 6 | 124,652 |
Tags: dp, greedy, strings
Correct Solution:
```
def mult(s, t):
f1, l1, cntf1, cntl1, beaut1, n1 = s
f2, l2, cntf2, cntl2, beaut2, n2, p = t
f3, l3, cntf3, cntl3, beaut3, n3 = 0, 0, 0, 0, beaut1, 0
f3 = f1
l3 = l1
n3 = n1 * (n2 + 1) + n2
if cntf1 >= n1 and f1 == f2:
cntf3 = n1 * (cnt... | output | 1 | 62,326 | 6 | 124,653 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roman and Denis are on the trip to the programming competition. Since the trip was long, they soon got bored, and hence decided to came up with something. Roman invented a pizza's recipe, while Denis invented a string multiplication. Accordi... | instruction | 0 | 62,327 | 6 | 124,654 |
Tags: dp, greedy, strings
Correct Solution:
```
def prog(mass, st):
global alf
if st == st[0] * len(st):
for i in range(26):
if alf[i] == st[0]:
mass[i] = (mass[i] + 1) * len(st) + mass[i]
else:
mass[i] = min(1, mass[i])
else:
mmm = raz... | output | 1 | 62,327 | 6 | 124,655 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roman and Denis are on the trip to the programming competition. Since the trip was long, they soon got bored, and hence decided to came up with something. Roman invented a pizza's recipe, while Denis invented a string multiplication. Accordi... | instruction | 0 | 62,328 | 6 | 124,656 |
Tags: dp, greedy, strings
Correct Solution:
```
n = input()
n = int(n)
p = []
substring_maxlen = 0
str_info = []
_temper = [
"abba", "a"
]
for i in range(n):
string = input()
str_info.append(string)
strlen = len(string)
start = 0
end = 0
for j in range(strlen):
if string[j] == stri... | output | 1 | 62,328 | 6 | 124,657 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roman and Denis are on the trip to the programming competition. Since the trip was long, they soon got bored, and hence decided to came up with something. Roman invented a pizza's recipe, while Denis invented a string multiplication. Accordi... | instruction | 0 | 62,329 | 6 | 124,658 |
Tags: dp, greedy, strings
Correct Solution:
```
from math import *
import sys
def minp():
return sys.stdin.readline().strip()
def mint():
return int(minp())
def mints():
return map(int, minp().split())
n = mint()
a = [0]*256
b = [0]*256
for k in range(0,n):
#print(a[ord('a'):ord('z')+1])
for i in range(ord('a'... | output | 1 | 62,329 | 6 | 124,659 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roman and Denis are on the trip to the programming competition. Since the trip was long, they soon got bored, and hence decided to came up with something. Roman invented a pizza's recipe, while Denis invented a string multiplication. Accordi... | instruction | 0 | 62,330 | 6 | 124,660 |
Tags: dp, greedy, strings
Correct Solution:
```
n = int(input())
# for old string s + t
# find out max length for each character -> inductively
# is t single character
# yes -> longest[char] = (longest[char] + 1) * (len(t) + 1) - 1,
# longest[notchar] = 1 or 0 depending if it existed before
# no -> longest[char] = lo... | output | 1 | 62,330 | 6 | 124,661 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roman and Denis are on the trip to the programming competition. Since the trip was long, they soon got bored, and hence decided to came up with something. Roman invented a pizza's recipe, while Denis invented a string multiplication. Accordi... | instruction | 0 | 62,331 | 6 | 124,662 |
Tags: dp, greedy, strings
Correct Solution:
```
import os
from io import BytesIO
#input = BytesIO(os.read(0, os.fstat(0).st_size)).readline
from collections import namedtuple
Parsed = namedtuple("Parsed", "type p pl s sl")
D, U = 0, 1
def parse(s):
pc, sc = 0, 0
for c in s:
if c != s[0]:
... | output | 1 | 62,331 | 6 | 124,663 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roman and Denis are on the trip to the programming competition. Since the trip was long, they soon got bored, and hence decided to came up with something. Roman invented a pizza's recipe, while Denis invented a string multiplication. Accordi... | instruction | 0 | 62,332 | 6 | 124,664 |
Tags: dp, greedy, strings
Correct Solution:
```
import sys
from collections import Counter
readline = sys.stdin.readline
N = int(readline())
S = [readline().strip() for i in range(N)]
def calc(s):
res = []
last = s[0]
cnt = 0
for c in s:
if c == last:
cnt += 1
else:
... | output | 1 | 62,332 | 6 | 124,665 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But long names are somewhat inconvenient, so the Berlanders started to abbreviate the names of ... | instruction | 0 | 62,563 | 6 | 125,126 |
Tags: dp
Correct Solution:
```
from sys import stdin
input = stdin.readline
n=int(input())
a=list(input().strip() for _ in range(n))
dp=[[0 for i in range(26)] for j in range(26)]
ans=0
for j in range(n):
start=ord(a[j][0])-ord('a')
end=ord(a[j][len(a[j])-1])-ord('a')
le=len(a[j])
for i in range(26):
... | output | 1 | 62,563 | 6 | 125,127 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But long names are somewhat inconvenient, so the Berlanders started to abbreviate the names of ... | instruction | 0 | 62,564 | 6 | 125,128 |
Tags: dp
Correct Solution:
```
from sys import stdin
n=int(stdin.readline().strip())
s=[stdin.readline().strip() for i in range(n)]
dp=[[0 for i in range(26)] for j in range(26)]
now=1
last=0
for i in range(n):
a,b=ord(s[i][0])-97,ord(s[i][-1])-97
for j in range(26):
if dp[j][a]>0:
dp[j][b]=... | output | 1 | 62,564 | 6 | 125,129 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But long names are somewhat inconvenient, so the Berlanders started to abbreviate the names of ... | instruction | 0 | 62,565 | 6 | 125,130 |
Tags: dp
Correct Solution:
```
from sys import stdin
n=int(input())
s=[stdin.readline()[:-1] for i in range(n)]
cnt=[[0]*26 for i in range(26)]
for i in range(n):
t=s[i]
m=len(t)
l=ord(t[0])-97
r=ord(t[-1])-97
for i in range(26):
if cnt[i][l]>0:
cnt[i][r]=max(cnt[i][r],cnt[i][l]+m)
cnt[l][r]=max(c... | output | 1 | 62,565 | 6 | 125,131 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But long names are somewhat inconvenient, so the Berlanders started to abbreviate the names of ... | instruction | 0 | 62,566 | 6 | 125,132 |
Tags: dp
Correct Solution:
```
from sys import stdin
n = int(input())
dp = [[0 for _ in range(26)] for _ in range(26)]
for _ in range(n):
name = stdin.readline()[:-1]
start = ord(name[0]) - ord('a')
end = ord(name[-1]) - ord('a')
for i in range(26):
if dp[i][start] > 0:
dp[i][end]... | output | 1 | 62,566 | 6 | 125,133 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But long names are somewhat inconvenient, so the Berlanders started to abbreviate the names of ... | instruction | 0 | 62,567 | 6 | 125,134 |
Tags: dp
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().split(... | output | 1 | 62,567 | 6 | 125,135 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But long names are somewhat inconvenient, so the Berlanders started to abbreviate the names of ... | instruction | 0 | 62,568 | 6 | 125,136 |
Tags: dp
Correct Solution:
```
from sys import stdin, stdout
fst = 97
sze = 26
values = [[0 for i in range(sze)] for j in range(sze)]
n = int(stdin.readline())
challengers = []
for i in range(n):
s = stdin.readline().strip()
challengers.append((ord(s[0]) - fst, ord(s[-1]) - fst))
for i in range(sze)... | output | 1 | 62,568 | 6 | 125,137 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But long names are somewhat inconvenient, so the Berlanders started to abbreviate the names of ... | instruction | 0 | 62,569 | 6 | 125,138 |
Tags: dp
Correct Solution:
```
from sys import stdin
n=int(stdin.readline())
l=[[0 for i in range(26)] for i in range(26)]
for i in range(n):
s=stdin.readline().strip()
# s=input() if i==n-1 else input()[0:-1]
a,b=ord(s[0])-97,ord(s[-1])-97
for j in range(26):
if l[j][a]>0:l[j][b]=max(l[j][a]+len(s),l[j][b])
l[a]... | output | 1 | 62,569 | 6 | 125,139 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But long names are somewhat inconvenient, so the Berlanders started to abbreviate the names of ... | instruction | 0 | 62,570 | 6 | 125,140 |
Tags: dp
Correct Solution:
```
from sys import stdin
n = int(stdin.readline().strip())
l = [stdin.readline().strip() for i in range(n)]
dp = []
for i in range(26):
dp.append([-999999999] * 26)
ans = 0
for i in range(26):
dp[i][i] = 0
for j in range(n):
first = ord(l[j][0]) - 97
ln = len(l[j]... | output | 1 | 62,570 | 6 | 125,141 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But long names are somewhat inconvenient, so the... | instruction | 0 | 62,571 | 6 | 125,142 |
Yes | output | 1 | 62,571 | 6 | 125,143 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But long names are somewhat inconvenient, so the... | instruction | 0 | 62,572 | 6 | 125,144 |
Yes | output | 1 | 62,572 | 6 | 125,145 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But long names are somewhat inconvenient, so the... | instruction | 0 | 62,573 | 6 | 125,146 |
Yes | output | 1 | 62,573 | 6 | 125,147 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But long names are somewhat inconvenient, so the... | instruction | 0 | 62,574 | 6 | 125,148 |
No | output | 1 | 62,574 | 6 | 125,149 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But long names are somewhat inconvenient, so the... | instruction | 0 | 62,575 | 6 | 125,150 |
No | output | 1 | 62,575 | 6 | 125,151 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But long names are somewhat inconvenient, so the... | instruction | 0 | 62,576 | 6 | 125,152 |
No | output | 1 | 62,576 | 6 | 125,153 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But long names are somewhat inconvenient, so the... | instruction | 0 | 62,577 | 6 | 125,154 |
No | output | 1 | 62,577 | 6 | 125,155 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Seryozha has a very changeable character. This time he refused to leave the room to Dima and his girlfriend (her hame is Inna, by the way). However, the two lovebirds can always find a way to communicate. Today they are writing text messages... | instruction | 0 | 62,637 | 6 | 125,274 |
Tags: brute force, strings
Correct Solution:
```
n = int(input())
ts = [input() for i in range(n)]
t = '<3' + '<3'.join(ts) + '<3'
s = input()
i = 0
j = 0
while i < len(t) and j < len(s):
if t[i] == s[j]:
i += 1
j += 1
print(i == len(t) and 'yes' or 'no')
``` | output | 1 | 62,637 | 6 | 125,275 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Seryozha has a very changeable character. This time he refused to leave the room to Dima and his girlfriend (her hame is Inna, by the way). However, the two lovebirds can always find a way to communicate. Today they are writing text messages... | instruction | 0 | 62,638 | 6 | 125,276 |
Tags: brute force, strings
Correct Solution:
```
def main():
from sys import stdin
l = stdin.read().splitlines()
sms = iter(l[-1])
l[0] = l[-1] = ''
good = set("abcdefghijklmnopqrstuvwxyz0123456789<>")
try:
for a in "<3".join(l):
b = next(sms)
while b != a:
... | output | 1 | 62,638 | 6 | 125,277 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Seryozha has a very changeable character. This time he refused to leave the room to Dima and his girlfriend (her hame is Inna, by the way). However, the two lovebirds can always find a way to communicate. Today they are writing text messages... | instruction | 0 | 62,639 | 6 | 125,278 |
Tags: brute force, strings
Correct Solution:
```
n=int(input())
l=[]
for i in range(n):
l.append(input())
s=input()
stage=0
cur=0
curpos=0
f=0
for j in range(len(s)):
i=s[j]
curword = l[cur]
if stage==0 and i == "<": stage = 1
elif stage== 1 and i == "3": stage = 2
if stage == 2:
if i ==... | output | 1 | 62,639 | 6 | 125,279 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Seryozha has a very changeable character. This time he refused to leave the room to Dima and his girlfriend (her hame is Inna, by the way). However, the two lovebirds can always find a way to communicate. Today they are writing text messages... | instruction | 0 | 62,640 | 6 | 125,280 |
Tags: brute force, strings
Correct Solution:
```
t = '<3' + '<3'.join(input() for i in range(int(input()))) + '<3'
p, s, j = input(), 'yes', 0
for c in t:
j = p.find(c, j) + 1
if j == 0:
s = 'no'
break
print(s)
# Made By Mostafa_Khaled
``` | output | 1 | 62,640 | 6 | 125,281 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Seryozha has a very changeable character. This time he refused to leave the room to Dima and his girlfriend (her hame is Inna, by the way). However, the two lovebirds can always find a way to communicate. Today they are writing text messages... | instruction | 0 | 62,641 | 6 | 125,282 |
Tags: brute force, strings
Correct Solution:
```
n=int(input())
l=[]
for i in range(n):
l.append(input().strip())
#print (l)
s=input().strip()
length=len(s)
index1=0
a=0
b=0
c=0
j=0
for i in range(length):
if (a==0):
if (s[i]=='<'):
b=1
if (b==1 and s[i]=='3'):
c=1
... | output | 1 | 62,641 | 6 | 125,283 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Seryozha has a very changeable character. This time he refused to leave the room to Dima and his girlfriend (her hame is Inna, by the way). However, the two lovebirds can always find a way to communicate. Today they are writing text messages... | instruction | 0 | 62,642 | 6 | 125,284 |
Tags: brute force, strings
Correct Solution:
```
n = int(input())
a = "<3".join([""] + [input() for _ in range(n)] + [""])
s = input()
i = -1
for c in a:
i = s.find(c, i + 1)
if i == -1:
print("no")
exit()
print("yes")
``` | output | 1 | 62,642 | 6 | 125,285 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Seryozha has a very changeable character. This time he refused to leave the room to Dima and his girlfriend (her hame is Inna, by the way). However, the two lovebirds can always find a way to communicate. Today they are writing text messages... | instruction | 0 | 62,643 | 6 | 125,286 |
Tags: brute force, strings
Correct Solution:
```
def readln(): return tuple(map(int, input().split()))
n, = readln()
sms = '<3'.join([''] + [input() for _ in range(n)] + [''])
s = 0
for c in list(input()):
if sms[s] == c:
s += 1
if s == len(sms):
break
print('yes' if s == len(sms) else 'no')
`... | output | 1 | 62,643 | 6 | 125,287 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Seryozha has a very changeable character. This time he refused to leave the room to Dima and his girlfriend (her hame is Inna, by the way). However, the two lovebirds can always find a way to communicate. Today they are writing text messages... | instruction | 0 | 62,644 | 6 | 125,288 |
Tags: brute force, strings
Correct Solution:
```
n = int(input())
a = '<3'
for i in range(n):
a = a + input() + '<3'
b = input()
lenb = len(b)
for i in range(lenb):
if not ('a' <= b[i] <= 'z' or '0' <= b[i] <= '9' or b[i] == '<' or b[i] == '>'):
print('no')
break
else:
j = 0
lena = len(... | output | 1 | 62,644 | 6 | 125,289 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Seryozha has a very changeable character. This time he refused to leave the room to Dima and his girlfriend (her hame is Inna, by the way). However, the two lovebirds can always find a way to co... | instruction | 0 | 62,645 | 6 | 125,290 |
Yes | output | 1 | 62,645 | 6 | 125,291 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.