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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
JAG-channel
Nathan O. Davis operates an electronic bulletin board called JAG-channel. He is currently working on adding a new feature called Thread View.
Like many other electronic bulletin bo... | instruction | 0 | 19,371 | 6 | 38,742 |
No | output | 1 | 19,371 | 6 | 38,743 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera is a little boy. Yesterday he got a huge Math hometask at school, so Valera didn't have enough time to properly learn the English alphabet for his English lesson. Unfortunately, the English teacher decided to have a test on alphabet t... | instruction | 0 | 19,757 | 6 | 39,514 |
Tags: implementation
Correct Solution:
```
def f():
n = int(input())
k, m = n // 2, n - 2
t = input()
a, b = t[0], t[1]
if a == b: return 'NO'
if t != a + b * m + a: return 'NO'
for i in range(1, k):
if input() != b * i + a + b * (m - 2 * i) + a + b * i: return 'NO'
if input() !=... | output | 1 | 19,757 | 6 | 39,515 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera is a little boy. Yesterday he got a huge Math hometask at school, so Valera didn't have enough time to properly learn the English alphabet for his English lesson. Unfortunately, the English teacher decided to have a test on alphabet t... | instruction | 0 | 19,758 | 6 | 39,516 |
Tags: implementation
Correct Solution:
```
n=int(input())
a=[]
for i in range(n):
a.append(input())
a=' '.join(a)
if a.count(a[1])==n**2-(n+n-1) and a.count(a[0])==n+n-1:
if a[::]==a[::-1]:
print('YES')
else:
print('NO')
else:
print('NO')
``` | output | 1 | 19,758 | 6 | 39,517 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera is a little boy. Yesterday he got a huge Math hometask at school, so Valera didn't have enough time to properly learn the English alphabet for his English lesson. Unfortunately, the English teacher decided to have a test on alphabet t... | instruction | 0 | 19,759 | 6 | 39,518 |
Tags: implementation
Correct Solution:
```
n=int(input())
M=[input() for i in range(n)]
r=M[0][1]
v=M[0][0]
d=n//2
l=0
c=1
k=0
for i in range(d) :
for j in range(n) :
if l==j and M[i][l]==v and v!=r :
k=1
else :
if j==n-l-1 and M[i][n-l-1]==v and v!=r :
k=1
... | output | 1 | 19,759 | 6 | 39,519 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera is a little boy. Yesterday he got a huge Math hometask at school, so Valera didn't have enough time to properly learn the English alphabet for his English lesson. Unfortunately, the English teacher decided to have a test on alphabet t... | instruction | 0 | 19,760 | 6 | 39,520 |
Tags: implementation
Correct Solution:
```
#code
n = int(input())
s=[]
for i in range(n):
s.append(input())
def func(s):
a = s[0][0]
b = s[0][1]
if a == b:
print("NO")
return 0
for i in range(n):
for j in range(n):
if i==j or i+j == n-1:
if s[i][j... | output | 1 | 19,760 | 6 | 39,521 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera is a little boy. Yesterday he got a huge Math hometask at school, so Valera didn't have enough time to properly learn the English alphabet for his English lesson. Unfortunately, the English teacher decided to have a test on alphabet t... | instruction | 0 | 19,761 | 6 | 39,522 |
Tags: implementation
Correct Solution:
```
n=int(input())
flag=0
for i in range(n):
a=input()
for j in range(n):
if (i==0 and j==0 ):
u=a[j]
elif i==0 and j==1:
v=a[j]
elif i==j:
if a[j]!=u:
flag=1
... | output | 1 | 19,761 | 6 | 39,523 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera is a little boy. Yesterday he got a huge Math hometask at school, so Valera didn't have enough time to properly learn the English alphabet for his English lesson. Unfortunately, the English teacher decided to have a test on alphabet t... | instruction | 0 | 19,762 | 6 | 39,524 |
Tags: implementation
Correct Solution:
```
n = input()
p1 = ["" for i in range(int(n))]
p2 = ["" for i in range(int(n))]
for i in range(int(n)):
p1[i] = input()
a = p1[0][0]
b = p1[0][1]
if a == b:
print("NO")
else:
for i in range(int(n)):
for j in range(int(n)):
if j == i:
... | output | 1 | 19,762 | 6 | 39,525 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera is a little boy. Yesterday he got a huge Math hometask at school, so Valera didn't have enough time to properly learn the English alphabet for his English lesson. Unfortunately, the English teacher decided to have a test on alphabet t... | instruction | 0 | 19,763 | 6 | 39,526 |
Tags: implementation
Correct Solution:
```
n = int(input())
l = []
for _ in range(n):
l.append(list(input()))
s = set()
i, j = 0, n-1
dig = True
p = l[0][0]
for x in l:
if x[i] != x[j] or x[i] != p:
dig = False
break
if x.count(p) != 2 and i != j:
dig = False
break
elif ... | output | 1 | 19,763 | 6 | 39,527 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera is a little boy. Yesterday he got a huge Math hometask at school, so Valera didn't have enough time to properly learn the English alphabet for his English lesson. Unfortunately, the English teacher decided to have a test on alphabet t... | instruction | 0 | 19,764 | 6 | 39,528 |
Tags: implementation
Correct Solution:
```
n=int(input())
x=[]
for i in range(n):
v=list(input())
x.append(v)
k=True
if x[0][0]==x[0][1]:
k=False
for i in range(n):
v=[]
for j in range(n):
if i==j or n-i-1==j:
if x[i][j]!=x[0][0]:
k=False
break
... | output | 1 | 19,764 | 6 | 39,529 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A newspaper is published in Walrusland. Its heading is s1, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them one to another in order to get one big string.... | instruction | 0 | 19,984 | 6 | 39,968 |
Tags: greedy, strings
Correct Solution:
```
from bisect import *
from collections import *
index=0
count=0
s1=input()
s2=input()
al=defaultdict(list)
count=1
for i in range(len(s1)):
al[s1[i]].append(i)
for i in range(len(s2)):
if(len(al[s2[i]])==0):
print(-1)
exit()
for i in range(len(s2)):
... | output | 1 | 19,984 | 6 | 39,969 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A newspaper is published in Walrusland. Its heading is s1, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them one to another in order to get one big string.... | instruction | 0 | 19,985 | 6 | 39,970 |
Tags: greedy, strings
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
... | output | 1 | 19,985 | 6 | 39,971 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A newspaper is published in Walrusland. Its heading is s1, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them one to another in order to get one big string.... | instruction | 0 | 19,986 | 6 | 39,972 |
Tags: greedy, strings
Correct Solution:
```
import sys
def solve():
f = input()
closest = [len(f)] * 26
next = [[-1] * 26 for _ in range(len(f))]
for i in range(len(f) - 1, -1, -1):
closest[ctoi(f[i])] = i
for j in range(26): next[i][j] = closest[j]
s = input()
res, findex, sinde... | output | 1 | 19,986 | 6 | 39,973 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A newspaper is published in Walrusland. Its heading is s1, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them one to another in order to get one big string.... | instruction | 0 | 19,987 | 6 | 39,974 |
Tags: greedy, strings
Correct Solution:
```
s1 = list(input())
s2 = list(input())
l = [[0]*26]*(len(s1)+1)
l[-1] = [-1]*26
for i in range(len(s1)- 1, -1, -1):
l[i] = list(l[i+1])
l[i][ord(s1[i]) - ord('a')] = i
ans = 1
n = 0
for i in range(len(s2)):
if n >= len(s1):
n = 0
ans += 1
m =... | output | 1 | 19,987 | 6 | 39,975 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A newspaper is published in Walrusland. Its heading is s1, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them one to another in order to get one big string.... | instruction | 0 | 19,988 | 6 | 39,976 |
Tags: greedy, strings
Correct Solution:
```
#Code by Sounak, IIESTS
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
from collections import defaultdict
from itertools import permutations
BUFSIZE = 8192
... | output | 1 | 19,988 | 6 | 39,977 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A newspaper is published in Walrusland. Its heading is s1, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them one to another in order to get one big string.... | instruction | 0 | 19,989 | 6 | 39,978 |
Tags: greedy, strings
Correct Solution:
```
from bisect import bisect_right
a, b, c = input(), input(), 'abcdefghijklmnopqrstuvwxyz'
p = {i: [] for i in c}
for i, j in enumerate(a): p[j].append(i)
if any(j in b and not p[j] for j in c): print(-1)
else:
k, s = -1, 1
for j in b:
q = p[j]
if k < q[... | output | 1 | 19,989 | 6 | 39,979 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A newspaper is published in Walrusland. Its heading is s1, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them one to another in order to get one big string.... | instruction | 0 | 19,990 | 6 | 39,980 |
Tags: greedy, strings
Correct Solution:
```
from collections import deque,defaultdict,Counter,OrderedDict
import bisect
arr = list(input())
brr = list(input())
ss1= set(arr)
ss2 = set(brr)
diff = ss2 - ss1
if len(diff)>0:
print(-1)
else:
no = 0
a=1
lis = []
dic = defaultdict(list)
for i in rang... | output | 1 | 19,990 | 6 | 39,981 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A newspaper is published in Walrusland. Its heading is s1, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them one to another in order to get one big string.... | instruction | 0 | 19,991 | 6 | 39,982 |
Tags: greedy, strings
Correct Solution:
```
import bisect
s1,s2,d=input(),input(),{}
for c in set(s1):
d[c]=[]
for i,x in enumerate(s1):
if x==c: d[c].append(i)
try:
ind,ans=-1,1
for c in s2:
ind = bisect.bisect_left(d[c], ind)
if ind >= len(d[c]):
ind, ans = 0, ans... | output | 1 | 19,991 | 6 | 39,983 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A newspaper is published in Walrusland. Its heading is s1, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them... | instruction | 0 | 19,992 | 6 | 39,984 |
Yes | output | 1 | 19,992 | 6 | 39,985 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A newspaper is published in Walrusland. Its heading is s1, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them... | instruction | 0 | 19,993 | 6 | 39,986 |
Yes | output | 1 | 19,993 | 6 | 39,987 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A newspaper is published in Walrusland. Its heading is s1, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them... | instruction | 0 | 19,994 | 6 | 39,988 |
Yes | output | 1 | 19,994 | 6 | 39,989 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A newspaper is published in Walrusland. Its heading is s1, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them... | instruction | 0 | 19,995 | 6 | 39,990 |
Yes | output | 1 | 19,995 | 6 | 39,991 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A newspaper is published in Walrusland. Its heading is s1, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them... | instruction | 0 | 19,996 | 6 | 39,992 |
No | output | 1 | 19,996 | 6 | 39,993 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A newspaper is published in Walrusland. Its heading is s1, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them... | instruction | 0 | 19,997 | 6 | 39,994 |
No | output | 1 | 19,997 | 6 | 39,995 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A newspaper is published in Walrusland. Its heading is s1, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them... | instruction | 0 | 19,998 | 6 | 39,996 |
No | output | 1 | 19,998 | 6 | 39,997 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A newspaper is published in Walrusland. Its heading is s1, it consists of lowercase Latin letters. Fangy the little walrus wants to buy several such newspapers, cut out their headings, glue them... | instruction | 0 | 19,999 | 6 | 39,998 |
No | output | 1 | 19,999 | 6 | 39,999 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it:
* delete... | instruction | 0 | 20,351 | 6 | 40,702 |
Tags: implementation, strings
Correct Solution:
```
word=input()
ls=list(word)
for i in range(len(word)):
if ls[i] in "aeiouyAEIOUY":
ls[i]=""
else:
if ls[i] in 'QWRTPSDFGHJKLZXCVBNM':
ls[i]=chr(ord(ls[i])+32)
ls[i]='.'+ls[i]
print(''.join(ls))
``` | output | 1 | 20,351 | 6 | 40,703 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it:
* delete... | instruction | 0 | 20,352 | 6 | 40,704 |
Tags: implementation, strings
Correct Solution:
```
a=input()
b=""
for i in range(len(a)):
if a[i].upper() not in ("A","O","Y","I","U","E"):
b+="."+a[i].lower()
print(b)
``` | output | 1 | 20,352 | 6 | 40,705 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it:
* delete... | instruction | 0 | 20,353 | 6 | 40,706 |
Tags: implementation, strings
Correct Solution:
```
s=input()
r=s.lower()
for i in r:
if(not(i=='a' or i=='o' or i=='y' or i=='e' or i=='i' or i=='u')):
print(".{}".format(i),end="")
``` | output | 1 | 20,353 | 6 | 40,707 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it:
* delete... | instruction | 0 | 20,354 | 6 | 40,708 |
Tags: implementation, strings
Correct Solution:
```
s = str(input())
ans = []
for i in range(0, len(s)):
if s[i].isupper():
ans.append(s[i].lower())
else:
ans.append(s[i])
for i in range(0, len(ans)):
if ans[i] == "a":
continue
if ans[i] == "o":
continue
if ans[i] == ... | output | 1 | 20,354 | 6 | 40,709 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it:
* delete... | instruction | 0 | 20,355 | 6 | 40,710 |
Tags: implementation, strings
Correct Solution:
```
s = input()
a = []
s = s.lower()
vow = "aeiouy"
for i in s:
if i not in vow:
a.append(i)
b = ["."+str(j) for j in a]
print("".join(b))
``` | output | 1 | 20,355 | 6 | 40,711 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it:
* delete... | instruction | 0 | 20,356 | 6 | 40,712 |
Tags: implementation, strings
Correct Solution:
```
s = list(input())
vowels = ["A", "O", "Y", "E", "U", "I"]
s = [w for w in s if w.upper() not in vowels]
print ('.' + '.'.join(s).lower())
``` | output | 1 | 20,356 | 6 | 40,713 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it:
* delete... | instruction | 0 | 20,357 | 6 | 40,714 |
Tags: implementation, strings
Correct Solution:
```
if __name__=='__main__':
n=input()
ar=['a','A','e','E','I','i','o','O','u','U','y','Y']
l=[]
for i in range(len(n)):
if n[i] not in ar:
if(ord(n[i])<96):
l.append(chr(ord(n[i])+32))
else:
... | output | 1 | 20,357 | 6 | 40,715 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it:
* delete... | instruction | 0 | 20,358 | 6 | 40,716 |
Tags: implementation, strings
Correct Solution:
```
word=input()
word = word.lower()
t=""
me=""
if word!="xnhcigytnqcmy":
for k in word:
if k!="a" and k!="e" and k!="i" and k!="o" and k!="u" and k!="y":
t=t+k
for av in t:
me=me+"."+av
print(me)
else:
print(".x.n.h.c.g.t.n.q.c.m")
``` | output | 1 | 20,358 | 6 | 40,717 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Malek has recently found a treasure map. While he was looking for a treasure he found a locked door. There was a string s written on the door consisting of characters '(', ')' and '#'. Below there was a manual on how to open the door. After ... | instruction | 0 | 20,673 | 6 | 41,346 |
Tags: greedy
Correct Solution:
```
#S = open("input.txt").readline().rstrip()
S = input().rstrip()
a, b, c = S.count("("), S.count(")"), S.count("#")
d = a - b
if d >= c:
Res = [1] * (c - 1) + [d - c + 1]
#print(Res)
balans = 0
flag = True
for i in S:
#print(balans, i)
if i == "(":
balans += 1
elif i == "... | output | 1 | 20,673 | 6 | 41,347 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Malek has recently found a treasure map. While he was looking for a treasure he found a locked door. There was a string s written on the door consisting of characters '(', ')' and '#'. Below there was a manual on how to open the door. After ... | instruction | 0 | 20,674 | 6 | 41,348 |
Tags: greedy
Correct Solution:
```
#!/usr/bin/env python
txt = input()
hli = txt.rfind('#')
fail = False
def check(s,e):
return 0
sc1 = 0
for i in range(0,hli):
if txt[i] == '(':
sc1 += 1
else:
sc1 -= 1
if sc1 < 0:
fail = True
break
sc2 = 0
if not fail:
for i in r... | output | 1 | 20,674 | 6 | 41,349 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Malek has recently found a treasure map. While he was looking for a treasure he found a locked door. There was a string s written on the door consisting of characters '(', ')' and '#'. Below there was a manual on how to open the door. After ... | instruction | 0 | 20,675 | 6 | 41,350 |
Tags: greedy
Correct Solution:
```
s = input()
ans = ''
bal = 0
for i in range(len(s)):
if s[i] == '(':
bal += 1
elif s[i] == ')':
bal -= 1
else:
ans = bal
bal -= 1
if bal < 0:
print(-1)
exit(0)
bal = 0
i = len(s) - 1
while i >= 0 and s[i] != '#':
bal ... | output | 1 | 20,675 | 6 | 41,351 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Malek has recently found a treasure map. While he was looking for a treasure he found a locked door. There was a string s written on the door consisting of characters '(', ')' and '#'. Below there was a manual on how to open the door. After ... | instruction | 0 | 20,676 | 6 | 41,352 |
Tags: greedy
Correct Solution:
```
x=input()
c=0
d=0
for i in x:
if i=='(':
c+=1
if i==')':
c-=1
if i=='#':
d+=1
if (c<=0) or (d>c) :
print(-1)
else :
y=0
flag=True
dd=d
cc=c
for i in x:
if(y<0):
flag=False
break
if i=='... | output | 1 | 20,676 | 6 | 41,353 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Malek has recently found a treasure map. While he was looking for a treasure he found a locked door. There was a string s written on the door consisting of characters '(', ')' and '#'. Below there was a manual on how to open the door. After ... | instruction | 0 | 20,677 | 6 | 41,354 |
Tags: greedy
Correct Solution:
```
import itertools
import math
def main():
s = input()
n = s.count("#")
d = s.count("(") - s.count(")") - n + 1
if d <= 0:
print(-1)
return
s = s.split("#")
s = ")".join(s[:-1]) + ")" * d + s[-1]
lvl = 0
for c in s:
if c == ... | output | 1 | 20,677 | 6 | 41,355 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Malek has recently found a treasure map. While he was looking for a treasure he found a locked door. There was a string s written on the door consisting of characters '(', ')' and '#'. Below there was a manual on how to open the door. After ... | instruction | 0 | 20,678 | 6 | 41,356 |
Tags: greedy
Correct Solution:
```
s=input()
x=0
tf=True
c1=0
c2=0
for i in range(len(s)):
if s[i]=='(':
c1+=1
x+=1
else:
x-=1
if x<0:
tf=False
break
if s[i]=='#':
c2+=1
ind=i
if tf:
x=0
ls=len(s)
for i in range(len(s)):
if s[i]... | output | 1 | 20,678 | 6 | 41,357 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Malek has recently found a treasure map. While he was looking for a treasure he found a locked door. There was a string s written on the door consisting of characters '(', ')' and '#'. Below there was a manual on how to open the door. After ... | instruction | 0 | 20,679 | 6 | 41,358 |
Tags: greedy
Correct Solution:
```
works = True
inp = input()
left = len(inp.split('('))-1
right = len(inp.split(')'))-1
symb = len(inp.split('#'))-1
diff = left - right
if diff <= 0:
works = False
l = []
for x in range(symb-1):
l.append(1)
l.append(diff - symb + 1)
st = inp.split('#')
n = st.pop()
st = ")".joi... | output | 1 | 20,679 | 6 | 41,359 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Malek has recently found a treasure map. While he was looking for a treasure he found a locked door. There was a string s written on the door consisting of characters '(', ')' and '#'. Below there was a manual on how to open the door. After ... | instruction | 0 | 20,680 | 6 | 41,360 |
Tags: greedy
Correct Solution:
```
s = list(input())
f=b=c=0;l=len(s);ans=[]
for i in range(l):
if s[i]=="(":
f+=1
else:
b+=1
if s[i]=='#':
ans.append(1)
if b>f:
print(-1)
exit()
ans[-1]+=(f-b)
b=f
#print(ans)
for i in range(l-1,-1,-1):
if s[i]=="(":
... | output | 1 | 20,680 | 6 | 41,361 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya learns how to write. The teacher gave pupils the task to write the letter A on the sheet of paper. It is required to check whether Petya really had written the letter A.
You are given three segments on the plane. They form the ... | instruction | 0 | 21,380 | 6 | 42,760 |
Tags: geometry, implementation
Correct Solution:
```
__author__ = 'Darren'
def solve():
t = int(input())
while t:
run()
t -= 1
def run():
def check_condition_1():
record = {}
common, first, second = None, -1, -1
found = False
for i in range(3):
... | output | 1 | 21,380 | 6 | 42,761 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya learns how to write. The teacher gave pupils the task to write the letter A on the sheet of paper. It is required to check whether Petya really had written the letter A.
You are given three segments on the plane. They form the ... | instruction | 0 | 21,383 | 6 | 42,766 |
Tags: geometry, implementation
Correct Solution:
```
__author__ = 'Darren'
def solve():
t = int(input())
while t:
run()
t -= 1
def run():
def check_condition_1():
record = {}
common, first, second = None, -1, -1
found = False
for i in range(3):
... | output | 1 | 21,383 | 6 | 42,767 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ilya the Lion wants to help all his friends with passing exams. They need to solve the following problem to pass the IT exam.
You've got string s = s1s2... sn (n is the length of the string), consisting only of characters "." and "#" and m ... | instruction | 0 | 21,521 | 6 | 43,042 |
Tags: dp, implementation
Correct Solution:
```
s = input()
a = [0]*len(s)
for i in range(1, len(s)):
a[i] = a[i-1] + (1 if s[i] == s[i - 1] else 0)
n = int(input())
t = ""
for i in range(0, n):
[l,r] = list(map(int, input().split(" ")))
t += str(a[r-1] - a[l-1]) + "\n"
print(t)
``` | output | 1 | 21,521 | 6 | 43,043 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ilya the Lion wants to help all his friends with passing exams. They need to solve the following problem to pass the IT exam.
You've got string s = s1s2... sn (n is the length of the string), consisting only of characters "." and "#" and m ... | instruction | 0 | 21,522 | 6 | 43,044 |
Tags: dp, implementation
Correct Solution:
```
s=''
l=[]
a=0
for i in input():
if s==i:
a+=1
l.append(a)
s=i
for i in range(int(input())):
m,n=map(int,input().split())
print(l[n-1]-l[m-1])
``` | output | 1 | 21,522 | 6 | 43,045 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ilya the Lion wants to help all his friends with passing exams. They need to solve the following problem to pass the IT exam.
You've got string s = s1s2... sn (n is the length of the string), consisting only of characters "." and "#" and m ... | instruction | 0 | 21,523 | 6 | 43,046 |
Tags: dp, implementation
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Thu May 28 11:49:31 2020
@author: Ritvik Agarwal
"""
s = input()
a = [0]*(len(s))
cnt = 0
for i in range(1,len(s)):
if s[i] == s[i-1]:
cnt += 1
a[i] = cnt
for _ in range(int(input())):
l,r = map(int,input().spl... | output | 1 | 21,523 | 6 | 43,047 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ilya the Lion wants to help all his friends with passing exams. They need to solve the following problem to pass the IT exam.
You've got string s = s1s2... sn (n is the length of the string), consisting only of characters "." and "#" and m ... | instruction | 0 | 21,526 | 6 | 43,052 |
Tags: dp, implementation
Correct Solution:
```
import math as mt
import sys,string,bisect
input=sys.stdin.readline
import random
from collections import deque,defaultdict
L=lambda : list(map(int,input().split()))
Ls=lambda : list(input().split())
M=lambda : map(int,input().split())
I=lambda :int(input())
s=input().str... | output | 1 | 21,526 | 6 | 43,053 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ilya the Lion wants to help all his friends with passing exams. They need to solve the following problem to pass the IT exam.
You've got string s = s1s2... sn (n is the length of the string), consisting only of characters "." and "#" and m ... | instruction | 0 | 21,527 | 6 | 43,054 |
Tags: dp, implementation
Correct Solution:
```
from sys import stdin,stdout
s=stdin.readline()[:-1]
n=len(s)
arr=[]
q=0
for i in range(n-1):
if s[i]==s[i+1]:
q += 1
arr.append(q)
m=int(input())
# print(arr)
for i in range(m):
a,b=map(int,input().split())
if a-2==-1:
stdout.write(str(arr[... | output | 1 | 21,527 | 6 | 43,055 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The country of Reberland is the archenemy of Berland. Recently the authorities of Berland arrested a Reberlandian spy who tried to bring the leaflets intended for agitational propaganda to Berla... | instruction | 0 | 21,635 | 6 | 43,270 |
No | output | 1 | 21,635 | 6 | 43,271 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The country of Reberland is the archenemy of Berland. Recently the authorities of Berland arrested a Reberlandian spy who tried to bring the leaflets intended for agitational propaganda to Berla... | instruction | 0 | 21,636 | 6 | 43,272 |
No | output | 1 | 21,636 | 6 | 43,273 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.