problem_id stringlengths 3 7 | contestId stringclasses 660
values | problem_index stringclasses 27
values | programmingLanguage stringclasses 3
values | testset stringclasses 5
values | incorrect_passedTestCount float64 0 146 | incorrect_timeConsumedMillis float64 15 4.26k | incorrect_memoryConsumedBytes float64 0 271M | incorrect_submission_id stringlengths 7 9 | incorrect_source stringlengths 10 27.7k | correct_passedTestCount float64 2 360 | correct_timeConsumedMillis int64 30 8.06k | correct_memoryConsumedBytes int64 0 475M | correct_submission_id stringlengths 7 9 | correct_source stringlengths 28 21.2k | contest_name stringclasses 664
values | contest_type stringclasses 3
values | contest_start_year int64 2.01k 2.02k | time_limit float64 0.5 15 | memory_limit float64 64 1.02k | title stringlengths 2 54 | description stringlengths 35 3.16k | input_format stringlengths 67 1.76k | output_format stringlengths 18 1.06k ⌀ | interaction_format null | note stringclasses 840
values | examples stringlengths 34 1.16k | rating float64 800 3.4k ⌀ | tags stringclasses 533
values | testset_size int64 1 309 | official_tests stringlengths 44 19.7M | official_tests_complete bool 1
class | input_mode stringclasses 1
value | generated_checker stringclasses 231
values | executable bool 1
class | official-generated_tests stringlengths 44 79.9M | generated_test_size int64 0 24 | PF_official_generated_tests dict |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
113/A | 113 | A | Python 3 | TESTS | 136 | 92 | 102,400 | 212181856 | a=input().split()
i=0
n=len(a)
while i<n and (len(a[i])>=4 and a[i][len(a[i])-4:]=="lios"):
i+=1
i1=i
while i<n and (len(a[i])>=3 and a[i][len(a[i])-3:]=="etr"):
i+=1
if i-i1!=1 and i!=0 and n>1:
print("NO")
exit()
while i<n and (len(a[i])>=6 and a[i][len(a[i])-6:]=="initis"):
i+=1
#print(i)
if i==0... | 360 | 78 | 307,200 | 4075975 | s=input().split()
if(len(s)==1):
if(s[0].endswith("lios") or s[0].endswith("etr") or s[0].endswith("liala") or s[0].endswith("etra") or s[0].endswith("inites") or s[0].endswith("initis")):
print("YES")
else:
print("NO")
elif(s[0].endswith("lios") or s[0].endswith("etr")):
n=len(s)
i=... | Codeforces Beta Round 86 (Div. 1 Only) | CF | 2,011 | 5 | 256 | Grammar Lessons | 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 be described with the following set of rules:
- There are three parts of spee... | The first line contains one or more words consisting of lowercase Latin letters. The overall number of characters (including letters and spaces) does not exceed 105.
It is guaranteed that any two consecutive words are separated by exactly one space and the input data do not contain any other spaces. It is possible tha... | If some word of the given text does not belong to the Petya's language or if the text contains more that one sentence, print "NO" (without the quotes). Otherwise, print "YES" (without the quotes). | null | null | [{"input": "petr", "output": "YES"}, {"input": "etis atis animatis etis atis amatis", "output": "NO"}, {"input": "nataliala kataliala vetra feinites", "output": "YES"}] | 1,600 | ["implementation", "strings"] | 309 | [{"input": "petr\r\n", "output": "YES\r\n"}, {"input": "etis atis animatis etis atis amatis\r\n", "output": "NO\r\n"}, {"input": "nataliala kataliala vetra feinites\r\n", "output": "YES\r\n"}, {"input": "qweasbvflios\r\n", "output": "YES\r\n"}, {"input": "lios lios petr initis qwe\r\n", "output": "NO\r\n"}, {"input": "... | false | stdio | null | true | [{"input": "petr\r\n", "output": "YES\r\n"}, {"input": "etis atis animatis etis atis amatis\r\n", "output": "NO\r\n"}, {"input": "nataliala kataliala vetra feinites\r\n", "output": "YES\r\n"}, {"input": "qweasbvflios\r\n", "output": "YES\r\n"}, {"input": "lios lios petr initis qwe\r\n", "output": "NO\r\n"}, {"input": "... | 0 | {
"failed": [
85,
265
],
"passed": [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30,
31,
32,
33,
34,... |
113/A | 113 | A | Python 3 | TESTS | 65 | 92 | 102,400 | 151378536 | def isPetyaLanguage():
read = input().split()
if len(read) == 1:
if read[0].endswith('lios') or read[0].endswith('lialia') or read[0].endswith('etr') or read[0].endswith('etra') or read[0].endswith('initis') or read[0].endswith('inites'):
print('YES')
return
else:
... | 360 | 92 | 102,400 | 151322401 | def isPetyaLanguage():
words = input().split()
if len(words) == 1:
if words[0].endswith("etr") or words[0].endswith("etra") or words[0].endswith("lios") or words[0].endswith("liala") or words[0].endswith("initis") or words[0].endswith("inites"):
print("YES")
return
else:
... | Codeforces Beta Round 86 (Div. 1 Only) | CF | 2,011 | 5 | 256 | Grammar Lessons | 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 be described with the following set of rules:
- There are three parts of spee... | The first line contains one or more words consisting of lowercase Latin letters. The overall number of characters (including letters and spaces) does not exceed 105.
It is guaranteed that any two consecutive words are separated by exactly one space and the input data do not contain any other spaces. It is possible tha... | If some word of the given text does not belong to the Petya's language or if the text contains more that one sentence, print "NO" (without the quotes). Otherwise, print "YES" (without the quotes). | null | null | [{"input": "petr", "output": "YES"}, {"input": "etis atis animatis etis atis amatis", "output": "NO"}, {"input": "nataliala kataliala vetra feinites", "output": "YES"}] | 1,600 | ["implementation", "strings"] | 309 | [{"input": "petr\r\n", "output": "YES\r\n"}, {"input": "etis atis animatis etis atis amatis\r\n", "output": "NO\r\n"}, {"input": "nataliala kataliala vetra feinites\r\n", "output": "YES\r\n"}, {"input": "qweasbvflios\r\n", "output": "YES\r\n"}, {"input": "lios lios petr initis qwe\r\n", "output": "NO\r\n"}, {"input": "... | false | stdio | null | true | [{"input": "petr\r\n", "output": "YES\r\n"}, {"input": "etis atis animatis etis atis amatis\r\n", "output": "NO\r\n"}, {"input": "nataliala kataliala vetra feinites\r\n", "output": "YES\r\n"}, {"input": "qweasbvflios\r\n", "output": "YES\r\n"}, {"input": "lios lios petr initis qwe\r\n", "output": "NO\r\n"}, {"input": "... | 0 | {
"failed": [
34,
44,
52
],
"passed": [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30,
31,
32,
33,
... |
113/A | 113 | A | PyPy 3-64 | TESTS | 146 | 156 | 716,800 | 171980063 | from collections import defaultdict as dc
words=input().split()
ends=['lios','liala','etr','etra','initis','inites']
adjm,adjf,verbm,verbf,nounm,nounf,=set(),set(),set(),set(),set(),set()
for s in words:
n=len(s)
for i in ends:
idx=len(s)-len(i)
if idx<0:continue
j,flag=0,0
while... | 360 | 92 | 102,400 | 214687216 | from sys import stdin, stdout
x = stdin.readline().replace("\n","")
lst = x.split(' ')
genderLst = []
typeLst = []
valid = 1
for x in lst:
if x.endswith("lios") or x.endswith("etr") or x.endswith("initis"):
genderLst.append(1)
elif x.endswith("liala") or x.endswith("etra") or x.endswith("inites"... | Codeforces Beta Round 86 (Div. 1 Only) | CF | 2,011 | 5 | 256 | Grammar Lessons | 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 be described with the following set of rules:
- There are three parts of spee... | The first line contains one or more words consisting of lowercase Latin letters. The overall number of characters (including letters and spaces) does not exceed 105.
It is guaranteed that any two consecutive words are separated by exactly one space and the input data do not contain any other spaces. It is possible tha... | If some word of the given text does not belong to the Petya's language or if the text contains more that one sentence, print "NO" (without the quotes). Otherwise, print "YES" (without the quotes). | null | null | [{"input": "petr", "output": "YES"}, {"input": "etis atis animatis etis atis amatis", "output": "NO"}, {"input": "nataliala kataliala vetra feinites", "output": "YES"}] | 1,600 | ["implementation", "strings"] | 309 | [{"input": "petr\r\n", "output": "YES\r\n"}, {"input": "etis atis animatis etis atis amatis\r\n", "output": "NO\r\n"}, {"input": "nataliala kataliala vetra feinites\r\n", "output": "YES\r\n"}, {"input": "qweasbvflios\r\n", "output": "YES\r\n"}, {"input": "lios lios petr initis qwe\r\n", "output": "NO\r\n"}, {"input": "... | false | stdio | null | true | [{"input": "petr\r\n", "output": "YES\r\n"}, {"input": "etis atis animatis etis atis amatis\r\n", "output": "NO\r\n"}, {"input": "nataliala kataliala vetra feinites\r\n", "output": "YES\r\n"}, {"input": "qweasbvflios\r\n", "output": "YES\r\n"}, {"input": "lios lios petr initis qwe\r\n", "output": "NO\r\n"}, {"input": "... | 0 | {
"failed": [
95,
138,
193,
236
],
"passed": [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30,
31,
3... |
113/A | 113 | A | PyPy 3-64 | TESTS | 101 | 124 | 204,800 | 212179196 | "def get_type(slovo):\n slovo = slovo[::-1]\n slovo += '#######'\n if slovo[:4] == 'soil':\(...TRUNCATED) | 360 | 92 | 102,400 | 227284427 | "# LUOGU_RID: 128399015\na = input().split()\nc = 5 #设置一个变量，记录当前的状态\nfor(...TRUNCATED) | Codeforces Beta Round 86 (Div. 1 Only) | CF | 2,011 | 5 | 256 | Grammar Lessons | "Petya got interested in grammar on his third year in school. He invented his own language called Pe(...TRUNCATED) | "The first line contains one or more words consisting of lowercase Latin letters. The overall number(...TRUNCATED) | "If some word of the given text does not belong to the Petya's language or if the text contains more(...TRUNCATED) | null | null | "[{\"input\": \"petr\", \"output\": \"YES\"}, {\"input\": \"etis atis animatis etis atis amatis\", \(...TRUNCATED) | 1,600 | ["implementation", "strings"] | 309 | "[{\"input\": \"petr\\r\\n\", \"output\": \"YES\\r\\n\"}, {\"input\": \"etis atis animatis etis atis(...TRUNCATED) | false | stdio | null | true | "[{\"input\": \"petr\\r\\n\", \"output\": \"YES\\r\\n\"}, {\"input\": \"etis atis animatis etis atis(...TRUNCATED) | 0 | {"failed":[50,60,64,93,136],"passed":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,(...TRUNCATED) |
113/A | 113 | A | PyPy 3-64 | TESTS | 7 | 124 | 614,400 | 171980252 | "from collections import defaultdict as dc\nwords=input().split()\nends=['lios','liala','etr','etra'(...TRUNCATED) | 360 | 122 | 4,710,400 | 157359820 | "n = input().split()\nw = 0\nx=y=z=0\nr=s=t=0\nwhile w<len(n):\n if n[w][-4:]==\"lios\" or n[w][-(...TRUNCATED) | Codeforces Beta Round 86 (Div. 1 Only) | CF | 2,011 | 5 | 256 | Grammar Lessons | "Petya got interested in grammar on his third year in school. He invented his own language called Pe(...TRUNCATED) | "The first line contains one or more words consisting of lowercase Latin letters. The overall number(...TRUNCATED) | "If some word of the given text does not belong to the Petya's language or if the text contains more(...TRUNCATED) | null | null | "[{\"input\": \"petr\", \"output\": \"YES\"}, {\"input\": \"etis atis animatis etis atis amatis\", \(...TRUNCATED) | 1,600 | ["implementation", "strings"] | 309 | "[{\"input\": \"petr\\r\\n\", \"output\": \"YES\\r\\n\"}, {\"input\": \"etis atis animatis etis atis(...TRUNCATED) | false | stdio | null | true | "[{\"input\": \"petr\\r\\n\", \"output\": \"YES\\r\\n\"}, {\"input\": \"etis atis animatis etis atis(...TRUNCATED) | 0 | {"failed":[7,71,78,107,150,179,181,222,224],"passed":[0,1,2,3,4,5,6,8,9,10,11,12,13,14,15,16,17,18,1(...TRUNCATED) |
113/A | 113 | A | PyPy 3 | TESTS | 7 | 184 | 0 | 11937161 | "def pos(w):\n if len(w) < 3:\n return False\n if w == 'etr' or w[-3:] == 'etr':\n (...TRUNCATED) | 360 | 124 | 102,400 | 151380136 | "'''\ndef isPetyaLanguage():\n read = input().split(' ')\n if len(read) == 1:\n if read(...TRUNCATED) | Codeforces Beta Round 86 (Div. 1 Only) | CF | 2,011 | 5 | 256 | Grammar Lessons | "Petya got interested in grammar on his third year in school. He invented his own language called Pe(...TRUNCATED) | "The first line contains one or more words consisting of lowercase Latin letters. The overall number(...TRUNCATED) | "If some word of the given text does not belong to the Petya's language or if the text contains more(...TRUNCATED) | null | null | "[{\"input\": \"petr\", \"output\": \"YES\"}, {\"input\": \"etis atis animatis etis atis amatis\", \(...TRUNCATED) | 1,600 | ["implementation", "strings"] | 309 | "[{\"input\": \"petr\\r\\n\", \"output\": \"YES\\r\\n\"}, {\"input\": \"etis atis animatis etis atis(...TRUNCATED) | false | stdio | null | true | "[{\"input\": \"petr\\r\\n\", \"output\": \"YES\\r\\n\"}, {\"input\": \"etis atis animatis etis atis(...TRUNCATED) | 0 | {"failed":[0,2,3,10,17,19,24,26,27,29,30,31,32,33,34,35,37,38,41,42,43,44,45,46,51,52,53,54,55,56,58(...TRUNCATED) |
113/A | 113 | A | Python 3 | TESTS | 7 | 186 | 307,200 | 91305797 | "s=list(map(str,input().split(' ')))\ng=[['lios','liala'],['etr','etra'],['initis','inites']]\nif le(...TRUNCATED) | 360 | 124 | 204,800 | 208405599 | "class Context:\n def __init__(self, words):\n self.words = words\n self.index = 0\(...TRUNCATED) | Codeforces Beta Round 86 (Div. 1 Only) | CF | 2,011 | 5 | 256 | Grammar Lessons | "Petya got interested in grammar on his third year in school. He invented his own language called Pe(...TRUNCATED) | "The first line contains one or more words consisting of lowercase Latin letters. The overall number(...TRUNCATED) | "If some word of the given text does not belong to the Petya's language or if the text contains more(...TRUNCATED) | null | null | "[{\"input\": \"petr\", \"output\": \"YES\"}, {\"input\": \"etis atis animatis etis atis amatis\", \(...TRUNCATED) | 1,600 | ["implementation", "strings"] | 309 | "[{\"input\": \"petr\\r\\n\", \"output\": \"YES\\r\\n\"}, {\"input\": \"etis atis animatis etis atis(...TRUNCATED) | false | stdio | null | true | "[{\"input\": \"petr\\r\\n\", \"output\": \"YES\\r\\n\"}, {\"input\": \"etis atis animatis etis atis(...TRUNCATED) | 0 | {"failed":[0,2,3,10,17,19,24,26,27,29,30,31,32,33,34,35,37,38,41,42,43,44,45,46,51,52,53,54,55,56,58(...TRUNCATED) |
113/A | 113 | A | Python 3 | TESTS | 66 | 156 | 204,800 | 22654372 | "ms = input().split()\nal = [['lios','etr','initis'],['liala','etra','inites']]\n\ns = ms[0]\ni=0;\n(...TRUNCATED) | 360 | 124 | 614,400 | 162396833 | "import re;t=input();p=[r'([^ ]*lios )*([^ ]*etr)( [^ ]*initis)*',r'([^ ]*liala )*([^ ]*etra)( [^ ]*(...TRUNCATED) | Codeforces Beta Round 86 (Div. 1 Only) | CF | 2,011 | 5 | 256 | Grammar Lessons | "Petya got interested in grammar on his third year in school. He invented his own language called Pe(...TRUNCATED) | "The first line contains one or more words consisting of lowercase Latin letters. The overall number(...TRUNCATED) | "If some word of the given text does not belong to the Petya's language or if the text contains more(...TRUNCATED) | null | null | "[{\"input\": \"petr\", \"output\": \"YES\"}, {\"input\": \"etis atis animatis etis atis amatis\", \(...TRUNCATED) | 1,600 | ["implementation", "strings"] | 309 | "[{\"input\": \"petr\\r\\n\", \"output\": \"YES\\r\\n\"}, {\"input\": \"etis atis animatis etis atis(...TRUNCATED) | false | stdio | null | true | "[{\"input\": \"petr\\r\\n\", \"output\": \"YES\\r\\n\"}, {\"input\": \"etis atis animatis etis atis(...TRUNCATED) | 0 | {"failed":[32,33,45,46,50,55,56,60,64,93,136],"passed":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,(...TRUNCATED) |
113/A | 113 | A | Python 3 | TESTS | 66 | 216 | 8,396,800 | 127696390 | "import sys\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop,(...TRUNCATED) | 360 | 154 | 204,800 | 15182995 | "s, n, m, f = input().split(), False, False, False\ndef cc(w, me, fe):\n global m, f\n if w.en(...TRUNCATED) | Codeforces Beta Round 86 (Div. 1 Only) | CF | 2,011 | 5 | 256 | Grammar Lessons | "Petya got interested in grammar on his third year in school. He invented his own language called Pe(...TRUNCATED) | "The first line contains one or more words consisting of lowercase Latin letters. The overall number(...TRUNCATED) | "If some word of the given text does not belong to the Petya's language or if the text contains more(...TRUNCATED) | null | null | "[{\"input\": \"petr\", \"output\": \"YES\"}, {\"input\": \"etis atis animatis etis atis amatis\", \(...TRUNCATED) | 1,600 | ["implementation", "strings"] | 309 | "[{\"input\": \"petr\\r\\n\", \"output\": \"YES\\r\\n\"}, {\"input\": \"etis atis animatis etis atis(...TRUNCATED) | false | stdio | null | true | "[{\"input\": \"petr\\r\\n\", \"output\": \"YES\\r\\n\"}, {\"input\": \"etis atis animatis etis atis(...TRUNCATED) | 0 | {"failed":[32,33,45,46,50,55,56,60,64,93,136],"passed":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,(...TRUNCATED) |
113/A | 113 | A | Python 3 | TESTS | 66 | 218 | 614,400 | 99499790 | "lista = input().split()\n\npassadj = False\npasssub = False\ngender = -1\ncan = True\n\n# verifican(...TRUNCATED) | 360 | 216 | 716,800 | 15383496 | "#!/usr/bin/python3\nimport re\nal = re.compile(r'^1*23*$')\ndef getType(word):\n\tif word.endswith((...TRUNCATED) | Codeforces Beta Round 86 (Div. 1 Only) | CF | 2,011 | 5 | 256 | Grammar Lessons | "Petya got interested in grammar on his third year in school. He invented his own language called Pe(...TRUNCATED) | "The first line contains one or more words consisting of lowercase Latin letters. The overall number(...TRUNCATED) | "If some word of the given text does not belong to the Petya's language or if the text contains more(...TRUNCATED) | null | null | "[{\"input\": \"petr\", \"output\": \"YES\"}, {\"input\": \"etis atis animatis etis atis amatis\", \(...TRUNCATED) | 1,600 | ["implementation", "strings"] | 309 | "[{\"input\": \"petr\\r\\n\", \"output\": \"YES\\r\\n\"}, {\"input\": \"etis atis animatis etis atis(...TRUNCATED) | false | stdio | null | true | "[{\"input\": \"petr\\r\\n\", \"output\": \"YES\\r\\n\"}, {\"input\": \"etis atis animatis etis atis(...TRUNCATED) | 0 | {"failed":[32,33,45,46,50,55,56,60,64,93,136],"passed":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 15