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.
We, the researchers who discovered and investigated the ancient nation Iwashiro, finally discovered the temple in the center of Iwashiro. A lithograph dedicated to the god of Iwashiro was stored in the temple. On the lithograph, two strings were writ... | instruction | 0 | 55,546 | 6 | 111,092 |
"Correct Solution:
```
t = input()
b = input()
table = [[0 for i in range(len(t))] for j in range(len(b))]
if len(t) > len(b):
if t[0] == b[0]:
table[0][0] = 1
for i in range(1, len(t)):
if t[i] == b[0]:
table[0][i] = table[0][i-1] + 1
else:
table[0][i] ... | output | 1 | 55,546 | 6 | 111,093 |
Provide a correct Python 3 solution for this coding contest problem.
We, the researchers who discovered and investigated the ancient nation Iwashiro, finally discovered the temple in the center of Iwashiro. A lithograph dedicated to the god of Iwashiro was stored in the temple. On the lithograph, two strings were writ... | instruction | 0 | 55,547 | 6 | 111,094 |
"Correct Solution:
```
def main():
MOD = 1000000007
s,t = input(),input()
n,m = len(s),len(t)
dp = [[0 for i in range(m+1)] for j in range(n+1)]
dp[0][0] = 1
for i in range(n):
for j in range(m-1,-1,-1):
dp[i+1][j] += dp[i][j]
dp[i+1][j] %= MOD
if s[i]... | output | 1 | 55,547 | 6 | 111,095 |
Provide a correct Python 3 solution for this coding contest problem.
We, the researchers who discovered and investigated the ancient nation Iwashiro, finally discovered the temple in the center of Iwashiro. A lithograph dedicated to the god of Iwashiro was stored in the temple. On the lithograph, two strings were writ... | instruction | 0 | 55,548 | 6 | 111,096 |
"Correct Solution:
```
t = input()
b = input()
MOD = 10**9 + 7
cnts = [0]*(len(b)+1)
cnts[0] = 1
for c in t:
for i in range(len(b)-1, -1, -1):
if c == b[i]:
cnts[i+1] = (cnts[i+1] + cnts[i]) % MOD
print(cnts[-1])
``` | output | 1 | 55,548 | 6 | 111,097 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We, the researchers who discovered and investigated the ancient nation Iwashiro, finally discovered the temple in the center of Iwashiro. A lithograph dedicated to the god of Iwashiro was stored... | instruction | 0 | 55,549 | 6 | 111,098 |
No | output | 1 | 55,549 | 6 | 111,099 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kaavi, the mysterious fortune teller, deeply believes that one's fate is inevitable and unavoidable. Of course, she makes her living by predicting others' future. While doing divination, Kaavi b... | instruction | 0 | 55,758 | 6 | 111,516 |
Yes | output | 1 | 55,758 | 6 | 111,517 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Friday is Polycarpus' favourite day of the week. Not because it is followed by the weekend, but because the lessons on Friday are 2 IT lessons, 2 math lessons and 2 literature lessons. Of course... | instruction | 0 | 55,777 | 6 | 111,554 |
No | output | 1 | 55,777 | 6 | 111,555 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the... | instruction | 0 | 55,948 | 6 | 111,896 |
Tags: greedy, implementation
Correct Solution:
```
a,b=input().split('|')
u=input()
x=len(u)
A=len(a)
B=len(b)
t=A+B+x
if abs(B-A)<=x and t%2==0:
if t%2==0:
t=t/2
A=int(abs(t-A))
a+=u[0:A]
b+=u[A:]
else:
t=t//2
A=int(abs(t-A))
a+=u[0:A]
b+=u[A:x-1]... | output | 1 | 55,948 | 6 | 111,897 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the... | instruction | 0 | 55,949 | 6 | 111,898 |
Tags: greedy, implementation
Correct Solution:
```
"""
██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗
██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗
██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║
██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║
██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝
╚═╝ ╚═════╝ ╚═╝ ╚═... | output | 1 | 55,949 | 6 | 111,899 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the... | instruction | 0 | 55,950 | 6 | 111,900 |
Tags: greedy, implementation
Correct Solution:
```
__author__ = 'Adela'
def main():
# code
w = [k for k in input().split('|')]
l = len(w[0])
r = len(w[1])
rem = input()
total = (l+r+len(rem))
if total % 2 == 0:
if l <= total/2 and r <= total/2:
total = int(total/2)
... | output | 1 | 55,950 | 6 | 111,901 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the... | instruction | 0 | 55,951 | 6 | 111,902 |
Tags: greedy, implementation
Correct Solution:
```
def checkG(g):
return g%2==0
x=input()
g=input()
n=len(g)
l=x.find('|')
r=len(x)-x.find('|')-1
if r==l:
if checkG(n):
print(x[:l]+g[:int(n/2)]+'|'+x[l+1:]+g[int(n/2):])
else:
print("Impossible")
else:
d=abs(r-l)
if n<d:
p... | output | 1 | 55,951 | 6 | 111,903 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the... | instruction | 0 | 55,952 | 6 | 111,904 |
Tags: greedy, implementation
Correct Solution:
```
(a, b) = input().split('|')
c = input()
i = 0
while len(c) > 0:
if len(a) < len(b):
a += c[0]
else:
b += c[0]
c = c[1::]
if len(a) == len(b):
print(a + '|' + b)
else:
print("Impossible")
``` | output | 1 | 55,952 | 6 | 111,905 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the... | instruction | 0 | 55,953 | 6 | 111,906 |
Tags: greedy, implementation
Correct Solution:
```
s = input()
t = input()
ass = s.split("|")
al= len(s)+len(t)-1
if al %2 or len(ass[0])>al//2 or len(ass[1])>al//2:
print("Impossible")
exit(0)
lt = list(t)
ml = al//2- len(ass[0])
ass[0]+=t[:ml]
ass[1]+=t[ml:]
print(ass[0]+"|"+ass[1])
``` | output | 1 | 55,953 | 6 | 111,907 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the... | instruction | 0 | 55,954 | 6 | 111,908 |
Tags: greedy, implementation
Correct Solution:
```
def main():
current = input().strip().split("|")
unused = input().strip()
lengths = [ len(x) for x in current ]
ll,lr,lu=min(lengths[0],lengths[1]),max(lengths[0],lengths[1]),len(unused)
r = None
if (ll+lr+lu)%2==1 or ll+lu<lr:
r = "Impossible"
else:
... | output | 1 | 55,954 | 6 | 111,909 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the... | instruction | 0 | 55,955 | 6 | 111,910 |
Tags: greedy, implementation
Correct Solution:
```
l,r = input().split('|')
q = input()
for i in q:
if len(l)>len(r):
r+=i
elif len(l)<len(r):
l+=i
else:
l+=i
if len(l)==len(r):
print(l+"|"+r)
else:
print('Impossible')
``` | output | 1 | 55,955 | 6 | 111,911 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a new professor of graph theory and he speaks very quickly. You come up with the following plan to keep up with his lecture and make notes.
You know two languages, and the professor is giving the lecture in the first one. The words... | instruction | 0 | 56,003 | 6 | 112,006 |
Tags: implementation, strings
Correct Solution:
```
n, m = map(int, input().split())
a= {}
for i in range(m):
n, m = input().split()
a[n] = m
st = input()
#print(st)
st1 = ''
for i in st.split():
#print(i)
if(len(a[i]) < len(i)):
st1 += a[i] + " "
else:
st1 += i + " "
print(st1)
... | output | 1 | 56,003 | 6 | 112,007 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a new professor of graph theory and he speaks very quickly. You come up with the following plan to keep up with his lecture and make notes.
You know two languages, and the professor is giving the lecture in the first one. The words... | instruction | 0 | 56,004 | 6 | 112,008 |
Tags: implementation, strings
Correct Solution:
```
#!/usr/bin/env python
# coding: utf-8
# In[2]:
n,m=map(int,input().split())
d=dict()
while m:
a,b=input().split()
la=len(a)
lb=len(b)
if la<=lb:
d[a]=a
else:
d[a]=b
m-=1
text=input().split()
ans=[]
for i in text... | output | 1 | 56,004 | 6 | 112,009 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a new professor of graph theory and he speaks very quickly. You come up with the following plan to keep up with his lecture and make notes.
You know two languages, and the professor is giving the lecture in the first one. The words... | instruction | 0 | 56,005 | 6 | 112,010 |
Tags: implementation, strings
Correct Solution:
```
n,m = map(int,input().split())
dc = {}
for i in range(m):
a = input().split()
dc[a[0]] = a[1]
mat = input().split()
for word in mat:
if (len(word)>len(dc[word])):
print(dc[word],end = " ")
else:
print(word , end = " ")
``` | output | 1 | 56,005 | 6 | 112,011 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a new professor of graph theory and he speaks very quickly. You come up with the following plan to keep up with his lecture and make notes.
You know two languages, and the professor is giving the lecture in the first one. The words... | instruction | 0 | 56,006 | 6 | 112,012 |
Tags: implementation, strings
Correct Solution:
```
n, m = map(int, input().split())
words = dict()
for i in range(m):
w1, w2 = map(str, input().split())
w = w1
if len(w2) < len(w1):
w = w2
words[w1] = w
words[w2] = w
data = input().split()
for i in range(n):
print(words[data[i]], end = ... | output | 1 | 56,006 | 6 | 112,013 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a new professor of graph theory and he speaks very quickly. You come up with the following plan to keep up with his lecture and make notes.
You know two languages, and the professor is giving the lecture in the first one. The words... | instruction | 0 | 56,007 | 6 | 112,014 |
Tags: implementation, strings
Correct Solution:
```
## 499B
(n, m) = (int(_) for _ in input().split(' '))
dictionary = {}
for _ in range(m):
(a, b) = input().split(' ')
dictionary[a] = b
output = []
for word in input().split():
if len(word) <= len(dictionary[word]):
output.append(word)
else:... | output | 1 | 56,007 | 6 | 112,015 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a new professor of graph theory and he speaks very quickly. You come up with the following plan to keep up with his lecture and make notes.
You know two languages, and the professor is giving the lecture in the first one. The words... | instruction | 0 | 56,008 | 6 | 112,016 |
Tags: implementation, strings
Correct Solution:
```
g=input()
n,m=[int(x) for x in g.split()]
dic={}
lis=[]
for i in range(m):
r=input()
r1,r2=r.split()
if len(r1)<=len(r2):
dic[r1]=r1
dic[r2]=r1
else:
dic[r1]=r2
dic[r2]=r2
t=input()
for x in t.split():
lis.append(x)
result=""
for x in lis:
result=result... | output | 1 | 56,008 | 6 | 112,017 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a new professor of graph theory and he speaks very quickly. You come up with the following plan to keep up with his lecture and make notes.
You know two languages, and the professor is giving the lecture in the first one. The words... | instruction | 0 | 56,009 | 6 | 112,018 |
Tags: implementation, strings
Correct Solution:
```
def f(l,a):
for i in range(0,len(l),2):
if l[i]==a:
if len(a)>len(l[i+1]):
# print(0)
return l[i+1]
else:
# print(1)
return a
n,m=map(int,input().split())
l=[]
for i in range(m):
l1=list(input().split())
l.append(l1[0])
l.append(l1[1])
# p... | output | 1 | 56,009 | 6 | 112,019 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a new professor of graph theory and he speaks very quickly. You come up with the following plan to keep up with his lecture and make notes.
You know two languages, and the professor is giving the lecture in the first one. The words... | instruction | 0 | 56,010 | 6 | 112,020 |
Tags: implementation, strings
Correct Solution:
```
from collections import defaultdict
d=defaultdict(list)
n,m=map(int,input().split())
for i in range(m):
x,y=map(str,input().split())
if len(x)>len(y):
d[x].append(y)
else:
d[x].append(x)
s=list(map(str,input().split()))
for i in ra... | output | 1 | 56,010 | 6 | 112,021 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everyone knows that DNA strands consist of nucleotides. There are four types of nucleotides: "A", "T", "G", "C". A DNA strand is a sequence of nucleotides. Scientists decided to track evolution ... | instruction | 0 | 56,106 | 6 | 112,212 |
No | output | 1 | 56,106 | 6 | 112,213 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everyone knows that DNA strands consist of nucleotides. There are four types of nucleotides: "A", "T", "G", "C". A DNA strand is a sequence of nucleotides. Scientists decided to track evolution ... | instruction | 0 | 56,107 | 6 | 112,214 |
No | output | 1 | 56,107 | 6 | 112,215 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everyone knows that DNA strands consist of nucleotides. There are four types of nucleotides: "A", "T", "G", "C". A DNA strand is a sequence of nucleotides. Scientists decided to track evolution ... | instruction | 0 | 56,108 | 6 | 112,216 |
No | output | 1 | 56,108 | 6 | 112,217 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves hockey very much. One day, as he was watching a hockey match, he fell asleep. Petya dreamt of being appointed to change a hockey team's name. Thus, Petya was given the original team name w and the collection of forbidden substrin... | instruction | 0 | 56,150 | 6 | 112,300 |
Tags: implementation, strings
Correct Solution:
```
def main():
n = int(input())
forbidden = [input() for _ in range(n)]
res = input()
f = [0 for i in range(len(res))]
letter = input()
for i in range(n):
for j in range(len(res)):
if len(res[j:]) < len(forbidden[i]): break
if res[j: j + len(forbidden[i]... | output | 1 | 56,150 | 6 | 112,301 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves hockey very much. One day, as he was watching a hockey match, he fell asleep. Petya dreamt of being appointed to change a hockey team's name. Thus, Petya was given the original team name w and the collection of forbidden substrin... | instruction | 0 | 56,151 | 6 | 112,302 |
Tags: implementation, strings
Correct Solution:
```
import sys
f = sys.stdin
#f = open("input.txt")
n = int(f.readline())
fbs = []
for i in range(n):
fbs.append(f.readline().strip())
s = f.readline().strip()
ch = f.readline().strip()
bChange = [0] * len(s)
for i in range(n):
idx = s.lower().find(fbs[i].lower(... | output | 1 | 56,151 | 6 | 112,303 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves hockey very much. One day, as he was watching a hockey match, he fell asleep. Petya dreamt of being appointed to change a hockey team's name. Thus, Petya was given the original team name w and the collection of forbidden substrin... | instruction | 0 | 56,152 | 6 | 112,304 |
Tags: implementation, strings
Correct Solution:
```
n = int(input())
b = []
for i in range(n):
b.append(input())
w = input()
let = input()
bad = [False for i in range(len(w))]
for i in range(len(w)):
mx = 0
for j in range(n):
if w[i:].lower().startswith(b[j].lower()):
mx = max(mx, len(b... | output | 1 | 56,152 | 6 | 112,305 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves hockey very much. One day, as he was watching a hockey match, he fell asleep. Petya dreamt of being appointed to change a hockey team's name. Thus, Petya was given the original team name w and the collection of forbidden substrin... | instruction | 0 | 56,153 | 6 | 112,306 |
Tags: implementation, strings
Correct Solution:
```
#from bisect import bisect_left as bl #c++ lowerbound bl(array,element)
#from bisect import bisect_right as br #c++ upperbound br(array,element)
#from __future__ import print_function, division #while using python2
# from itertools impo... | output | 1 | 56,153 | 6 | 112,307 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves hockey very much. One day, as he was watching a hockey match, he fell asleep. Petya dreamt of being appointed to change a hockey team's name. Thus, Petya was given the original team name w and the collection of forbidden substrin... | instruction | 0 | 56,154 | 6 | 112,308 |
Tags: implementation, strings
Correct Solution:
```
from math import*
a=[list(input().lower()) for i in range(int(input()))]
s=input()
s0=list(s)
s=list(s.lower())
c=input()
C=chr(ord(c)-ord('a')+ord('A'))
r=['.']*len(s)
for t in a:
for i in range(len(s)-len(t)+1):
#print(s[i:i+len(t)],t)
if(s[i:i+... | output | 1 | 56,154 | 6 | 112,309 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves hockey very much. One day, as he was watching a hockey match, he fell asleep. Petya dreamt of being appointed to change a hockey team's name. Thus, Petya was given the original team name w and the collection of forbidden substrin... | instruction | 0 | 56,155 | 6 | 112,310 |
Tags: implementation, strings
Correct Solution:
```
import sys
from math import *
def minp():
return sys.stdin.readline().strip()
def mint():
return int(minp())
def mints():
return map(int, minp().split())
def same(a, b):
return a.lower() == b.lower()
n = mint()
w = []
for i in range(n):
w.append(minp().low... | output | 1 | 56,155 | 6 | 112,311 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves hockey very much. One day, as he was watching a hockey match, he fell asleep. Petya dreamt of being appointed to change a hockey team's name. Thus, Petya was given the original team name w and the collection of forbidden substrin... | instruction | 0 | 56,156 | 6 | 112,312 |
Tags: implementation, strings
Correct Solution:
```
n=int(input())
a=[input() for i in range(n)]
w=input()
b=[False for i in range(len(w))]
c=input()
for i in range(len(w)):
z=0
for s in a:
if w[i:].lower().startswith(s.lower()):
z=max(z,len(s))
for j in range(i,i+z): b[j]=True
s=''
for ... | output | 1 | 56,156 | 6 | 112,313 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves hockey very much. One day, as he was watching a hockey match, he fell asleep. Petya dreamt of being appointed to change a hockey team's name. Thus, Petya was given the original team name w and the collection of forbidden substrin... | instruction | 0 | 56,157 | 6 | 112,314 |
Tags: implementation, strings
Correct Solution:
```
n= int(input())#how many word
b = []
for i in range(n):
b.append(input())# put the word in a list
w = input()#what we whant to change
let = input()#which we change in to
bad=[]
for i in range(len(w)):
bad.append(True)
for i in range(len(w)):
mx = 0
f... | output | 1 | 56,157 | 6 | 112,315 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easier version of the problem E with smaller constraints.
Twilight Sparkle has received a new task from Princess Celestia. This time she asked to decipher the ancient scroll containi... | instruction | 0 | 56,556 | 6 | 113,112 |
No | output | 1 | 56,556 | 6 | 113,113 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easier version of the problem E with smaller constraints.
Twilight Sparkle has received a new task from Princess Celestia. This time she asked to decipher the ancient scroll containi... | instruction | 0 | 56,557 | 6 | 113,114 |
No | output | 1 | 56,557 | 6 | 113,115 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easier version of the problem E with smaller constraints.
Twilight Sparkle has received a new task from Princess Celestia. This time she asked to decipher the ancient scroll containi... | instruction | 0 | 56,558 | 6 | 113,116 |
No | output | 1 | 56,558 | 6 | 113,117 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easier version of the problem E with smaller constraints.
Twilight Sparkle has received a new task from Princess Celestia. This time she asked to decipher the ancient scroll containi... | instruction | 0 | 56,559 | 6 | 113,118 |
No | output | 1 | 56,559 | 6 | 113,119 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Inna and Dima bought a table of size n × m in the shop. Each cell of the table contains a single letter: "D", "I", "M", "A".
Inna loves Dima, so she wants to go through his name as many times as possible as she moves through the table. For ... | instruction | 0 | 56,683 | 6 | 113,366 |
Tags: dfs and similar, dp, graphs, implementation
Correct Solution:
```
import sys
n, m = map(int, input().split())
m += 1
d = {'I': 0, 'M': 1, 'A': 2, 'D': 3, '\n': -7}
t = list(map(d.get, sys.stdin.read())) + [-7] * m
p = [[] for q in t]
c = [0] * len(t)
for a in range(n * m):
for b in (a - m, a + m, a - 1, a + 1... | output | 1 | 56,683 | 6 | 113,367 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Inna and Dima bought a table of size n × m in the shop. Each cell of the table contains a single letter: "D", "I", "M", "A".
Inna loves Dima, so she wants to go through his name as many times as possible as she moves through the table. For ... | instruction | 0 | 56,684 | 6 | 113,368 |
Tags: dfs and similar, dp, graphs, implementation
Correct Solution:
```
n, m = map(int, input().split())
m += 1
q = {'I': 0, 'M': 1, 'A': 2, 'D': 3}
t = []
for i in range(n):
t += map(q.get, input())
t.append(-7)
t += [-7] * m
p = [[] for q in t]
c = [0] * len(t)
for a in range(n * m):
for b in (a - m, a + ... | output | 1 | 56,684 | 6 | 113,369 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Inna and Dima bought a table of size n × m in the shop. Each cell of the table contains a single letter: "D", "I", "M", "A".
Inna loves Dima, so she wants to go through his name as many times as possible as she moves through the table. For ... | instruction | 0 | 56,685 | 6 | 113,370 |
Tags: dfs and similar, dp, graphs, implementation
Correct Solution:
```
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
# from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations ... | output | 1 | 56,685 | 6 | 113,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Inna and Dima bought a table of size n × m in the shop. Each cell of the table contains a single letter: "D", "I", "M", "A".
Inna loves Dima, so she wants to go through his name as many times a... | instruction | 0 | 56,686 | 6 | 113,372 |
No | output | 1 | 56,686 | 6 | 113,373 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) revers... | instruction | 0 | 56,689 | 6 | 113,378 |
Tags: implementation, strings
Correct Solution:
```
i=input()
l=input()
j=len(l)
n=0
while n<j:
if i[n:n+1]!=l[j-n-1:j-n]:
print('NO')
exit()
n=n+1
print('YES')
``` | output | 1 | 56,689 | 6 | 113,379 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) revers... | instruction | 0 | 56,690 | 6 | 113,380 |
Tags: implementation, strings
Correct Solution:
```
if __name__=="__main__":
list1=input()
list2=input()
rev=[]
flag=0
for i in range(len(list1)-1,-1,-1):
rev.append(list1[i])
for i in range(0,len(rev)):
if rev[i]!=list2[i]:
flag=1
break
if flag==1:
... | output | 1 | 56,690 | 6 | 113,381 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) revers... | instruction | 0 | 56,691 | 6 | 113,382 |
Tags: implementation, strings
Correct Solution:
```
s_word = input()
t_word = input()
t_reword = ""
for w in t_word:
t_reword = w + t_reword
if s_word == t_reword:
print("YES")
else:
print("NO")
``` | output | 1 | 56,691 | 6 | 113,383 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) revers... | instruction | 0 | 56,692 | 6 | 113,384 |
Tags: implementation, strings
Correct Solution:
```
s=str(input())
b=str(input())
if s==b[::-1]:
print("YES")
elif(s==b):
print("NO")
else:
print("NO")
``` | output | 1 | 56,692 | 6 | 113,385 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) revers... | instruction | 0 | 56,693 | 6 | 113,386 |
Tags: implementation, strings
Correct Solution:
```
Berland = input()
Birland = input()
print("YES" if Berland == Birland[::-1] else "NO")
``` | output | 1 | 56,693 | 6 | 113,387 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) revers... | instruction | 0 | 56,694 | 6 | 113,388 |
Tags: implementation, strings
Correct Solution:
```
s=input()
t=input()
r=t[::-1]
if(r==s):
print('YES')
else:
print('NO')
``` | output | 1 | 56,694 | 6 | 113,389 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) revers... | instruction | 0 | 56,695 | 6 | 113,390 |
Tags: implementation, strings
Correct Solution:
```
s=input()
t=input()
a=t[::-1]
if a==s:
print('YES')
else:
print('NO')
``` | output | 1 | 56,695 | 6 | 113,391 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) revers... | instruction | 0 | 56,696 | 6 | 113,392 |
Tags: implementation, strings
Correct Solution:
```
import math
def ii(): return int(input())
def mi(): return map(int, input().split())
def li(): return list(mi())
a = input()
b = input()
a= list(a)
b = list(b)
f = 1
for i in range(len(a)):
if a[i] != b[len(b)-i-1]:
f= 0
break
if f:
print("YES"... | output | 1 | 56,696 | 6 | 113,393 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A has a string consisting of some number of lowercase English letters 'a'. He gives it to his friend B who appends some number of letters 'b' to the end of this string. Since both A and B like the characters 'a' and 'b', they have made sure ... | instruction | 0 | 56,908 | 6 | 113,816 |
Tags: implementation
Correct Solution:
```
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Mon Apr 16 21:09:05 2018
@author: harman
"""
def check_string(st):
i=0
while i!= (len(st)-1):
if (ord(st[i])>ord(st[i+1])):
return('NO')
else:
i += 1
... | output | 1 | 56,908 | 6 | 113,817 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.