message stringlengths 2 11.9k | message_type stringclasses 2 values | message_id int64 0 1 | conversation_id int64 137 108k | cluster float64 18 18 | __index_level_0__ int64 274 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
Relative B man came to A child's house. He is 3 years old and loves singing. He is singing the song "Kobutanuki Tsuneko" (written and composed by Naozumi Yamamoto), which he learned from kindergarten. In this song, the four words "kobuta," "raccoon dog," "fox," and "cat" are arranged in order, and the last and first sounds are the same. Mr. B was asked by Mr. A to tell him if he could make a similar shiritori from the words that Mr. B said.
So, in order to help Ako, from the given words, use all the words to make a shiritori in order, and then the first letter of the first word and the last letter of the last word are the same. Let's write a program that determines whether or not it can be done.
Create a program that takes n words as input, determines whether or not a shiritori can be created from those word pairs, and outputs OK if possible and NG if not.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by a single line of zeros. Each dataset is given in the following format:
n
word1
word2
::
wordn
The number of words n (2 ≤ n ≤ 10000) is given on the first line. The next n lines are given n words wordi (a string of up to 32 single-byte lowercase letters).
The number of datasets does not exceed 50.
Output
The judgment result is output to one line for each input data set.
Example
Input
5
apple
yellow
georgia
king
email
7
apple
yellow
georgia
king
email
wink
lucky
0
Output
NG
OK | instruction | 0 | 31,704 | 18 | 63,408 |
"Correct Solution:
```
from collections import*
def searchnode(i,u,path): #つなげるものの個数の確認
r = 1
u[i] = 1
# print(u)
for j in range(26):
if path[(i,j)] and (not u[j]):
r += searchnode(j,u,path)
return r
def chrtoint(a):
return ord(a)-ord('a')
while 1:
n = int(input())
if n==0:
break
inp=[input()for i in range(n)]
front,back = [0]*26,[0]*26
path = defaultdict(int)
u = [0]*26
for i in inp:
front[chrtoint(i[0])] += 1
back[chrtoint(i[-1])] += 1
path[(chrtoint(i[0]),chrtoint(i[-1]))] += 1
# print(path)
if front!=back:
print("NG")
continue
if sum(i!=0 for i in front) == searchnode(chrtoint(i[-1]),u,path):
print("OK")
else:
print("NG")
``` | output | 1 | 31,704 | 18 | 63,409 |
Provide a correct Python 3 solution for this coding contest problem.
Relative B man came to A child's house. He is 3 years old and loves singing. He is singing the song "Kobutanuki Tsuneko" (written and composed by Naozumi Yamamoto), which he learned from kindergarten. In this song, the four words "kobuta," "raccoon dog," "fox," and "cat" are arranged in order, and the last and first sounds are the same. Mr. B was asked by Mr. A to tell him if he could make a similar shiritori from the words that Mr. B said.
So, in order to help Ako, from the given words, use all the words to make a shiritori in order, and then the first letter of the first word and the last letter of the last word are the same. Let's write a program that determines whether or not it can be done.
Create a program that takes n words as input, determines whether or not a shiritori can be created from those word pairs, and outputs OK if possible and NG if not.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by a single line of zeros. Each dataset is given in the following format:
n
word1
word2
::
wordn
The number of words n (2 ≤ n ≤ 10000) is given on the first line. The next n lines are given n words wordi (a string of up to 32 single-byte lowercase letters).
The number of datasets does not exceed 50.
Output
The judgment result is output to one line for each input data set.
Example
Input
5
apple
yellow
georgia
king
email
7
apple
yellow
georgia
king
email
wink
lucky
0
Output
NG
OK | instruction | 0 | 31,705 | 18 | 63,410 |
"Correct Solution:
```
def searchnode(i,u,path):
r = 1
u[i] = 1
for j in range(26):
if path[i][j] and (not u[j]):
r += searchnode(j,u,path)
return r
while(True):
n = int(input())
if not n: break
strs = list(map(lambda x: [x[0],x[-1]], [ input() for i in range(n)]))
ss,ee = [0]*26,[0]*26
path = [[0]*26 for _ in range(27)]
u = [0]*26
for s,e in strs:
ss[ord(s)-ord('a')] += 1
ee[ord(e)-ord('a')] += 1
path[ord(s)-ord('a')][ord(e)-ord('a')] += 1
if [1 for s1,e1 in zip(ss,ee) if s1-e1]:
print("NG")
continue
print("OK" if len([1 for s in ss if s]) == searchnode(ord(s)-ord('a'),u,path) else "NG")
``` | output | 1 | 31,705 | 18 | 63,411 |
Provide a correct Python 3 solution for this coding contest problem.
Relative B man came to A child's house. He is 3 years old and loves singing. He is singing the song "Kobutanuki Tsuneko" (written and composed by Naozumi Yamamoto), which he learned from kindergarten. In this song, the four words "kobuta," "raccoon dog," "fox," and "cat" are arranged in order, and the last and first sounds are the same. Mr. B was asked by Mr. A to tell him if he could make a similar shiritori from the words that Mr. B said.
So, in order to help Ako, from the given words, use all the words to make a shiritori in order, and then the first letter of the first word and the last letter of the last word are the same. Let's write a program that determines whether or not it can be done.
Create a program that takes n words as input, determines whether or not a shiritori can be created from those word pairs, and outputs OK if possible and NG if not.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by a single line of zeros. Each dataset is given in the following format:
n
word1
word2
::
wordn
The number of words n (2 ≤ n ≤ 10000) is given on the first line. The next n lines are given n words wordi (a string of up to 32 single-byte lowercase letters).
The number of datasets does not exceed 50.
Output
The judgment result is output to one line for each input data set.
Example
Input
5
apple
yellow
georgia
king
email
7
apple
yellow
georgia
king
email
wink
lucky
0
Output
NG
OK | instruction | 0 | 31,706 | 18 | 63,412 |
"Correct Solution:
```
import sys
f = sys.stdin
from collections import defaultdict
from collections import Counter
while True:
n = int(f.readline())
if n == 0:
break
words = [f.readline().strip() for _ in range(n)]
words = [(ord(wi[0]) - ord('a'),ord(wi[-1]) - ord('a')) for wi in words]
pre = Counter(w[0] for w in words)
post = Counter(w[-1] for w in words)
if pre != post:
print('NG')
continue
path = [[0 for j in range(26)] for i in range(26)]
for s, e in words:
path[s][e] = 1
for k in range(26):
for i in range(26):
for j in range(26):
if path[i][k] and path[k][j]:
path[i][j] = 1
s = words[0][0]
flg = True
for k in pre.keys():
if not path[s][k]:
flg = False
break
print('OK' if flg else 'NG')
``` | output | 1 | 31,706 | 18 | 63,413 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Relative B man came to A child's house. He is 3 years old and loves singing. He is singing the song "Kobutanuki Tsuneko" (written and composed by Naozumi Yamamoto), which he learned from kindergarten. In this song, the four words "kobuta," "raccoon dog," "fox," and "cat" are arranged in order, and the last and first sounds are the same. Mr. B was asked by Mr. A to tell him if he could make a similar shiritori from the words that Mr. B said.
So, in order to help Ako, from the given words, use all the words to make a shiritori in order, and then the first letter of the first word and the last letter of the last word are the same. Let's write a program that determines whether or not it can be done.
Create a program that takes n words as input, determines whether or not a shiritori can be created from those word pairs, and outputs OK if possible and NG if not.
Input
A sequence of multiple datasets is given as input. The end of the input is indicated by a single line of zeros. Each dataset is given in the following format:
n
word1
word2
::
wordn
The number of words n (2 ≤ n ≤ 10000) is given on the first line. The next n lines are given n words wordi (a string of up to 32 single-byte lowercase letters).
The number of datasets does not exceed 50.
Output
The judgment result is output to one line for each input data set.
Example
Input
5
apple
yellow
georgia
king
email
7
apple
yellow
georgia
king
email
wink
lucky
0
Output
NG
OK
Submitted Solution:
```
while True:
n = int(input())
if n == 0:
break
ins = {}
outs = {}
for i in range(ord("a"), ord("a") + 26):
c = chr(i)
ins[c] = 0
outs[c] = 0
for _ in range(n):
s = input()
ins[s[-1]] += 1
outs[s[0]] += 1
for i in range(ord("a"), ord("a") + 26):
c = chr(i)
if ins[c] != outs[c]:
print("NG")
break
else:
print("OK")
``` | instruction | 0 | 31,707 | 18 | 63,414 |
No | output | 1 | 31,707 | 18 | 63,415 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One of Arkady's friends works at a huge radio telescope. A few decades ago the telescope has sent a signal s towards a faraway galaxy. Recently they've received a response t which they believe to be a response from aliens! The scientists now want to check if the signal t is similar to s.
The original signal s was a sequence of zeros and ones (everyone knows that binary code is the universe-wide language). The returned signal t, however, does not look as easy as s, but the scientists don't give up! They represented t as a sequence of English letters and say that t is similar to s if you can replace all zeros in s with some string r_0 and all ones in s with some other string r_1 and obtain t. The strings r_0 and r_1 must be different and non-empty.
Please help Arkady's friend and find the number of possible replacements for zeros and ones (the number of pairs of strings r_0 and r_1) that transform s to t.
Input
The first line contains a string s (2 ≤ |s| ≤ 10^5) consisting of zeros and ones — the original signal.
The second line contains a string t (1 ≤ |t| ≤ 10^6) consisting of lowercase English letters only — the received signal.
It is guaranteed, that the string s contains at least one '0' and at least one '1'.
Output
Print a single integer — the number of pairs of strings r_0 and r_1 that transform s to t.
In case there are no such pairs, print 0.
Examples
Input
01
aaaaaa
Output
4
Input
001
kokokokotlin
Output
2
Note
In the first example, the possible pairs (r_0, r_1) are as follows:
* "a", "aaaaa"
* "aa", "aaaa"
* "aaaa", "aa"
* "aaaaa", "a"
The pair "aaa", "aaa" is not allowed, since r_0 and r_1 must be different.
In the second example, the following pairs are possible:
* "ko", "kokotlin"
* "koko", "tlin" | instruction | 0 | 31,784 | 18 | 63,568 |
Tags: brute force, data structures, hashing, 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 add(a,b):
return (a+b)%1000000007
def sub(a,b):
return (a+1000000007-b)%1000000007
def mul(a,b):
return (a*b)%1000000007
p = 102367
s = list(map(int,minp()))
t = list(map(ord,minp()))
h = [0]*(len(t)+1)
pp = [1]*(len(t)+1)
for i in range(len(t)):
h[i+1] = add(mul(h[i], p), t[i])
pp[i+1] = mul(pp[i], p)
def cmp(a, b, l):
if a > b:
a, b = b, a
h1 = sub(h[a+l], mul(h[a], pp[l]))
h2 = sub(h[b+l], mul(h[b], pp[l]))
return h2 == h1
c = [0,0]
idx = [-1,-1]
for i in range(len(s)):
c[s[i]] += 1
if idx[s[i]] < 0:
idx[s[i]] = i
Mv = max(c)
mv = min(c)
Mi = c.index(Mv)
mi = (Mi^1)
lt = len(t)
sp = [0,0]
res = 0
for k in range(1,lt//Mv+1):
l = [0,0]
x = (lt-k*Mv)//mv
if x > 0 and x*mv + k*Mv == lt:
l[Mi] = k
l[mi] = x
if idx[0] < idx[1]:
sp[0] = 0
sp[1] = idx[1]*l[0]
else:
sp[1] = 0
sp[0] = idx[0]*l[1]
ok = True
j = 0
for i in range(len(s)):
if not cmp(sp[s[i]], j, l[s[i]]):
ok = False
break
j += l[s[i]]
if l[0] == l[1] and cmp(sp[0], sp[1], l[0]):
ok = False
if ok:
res += 1
print(res)
``` | output | 1 | 31,784 | 18 | 63,569 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One of Arkady's friends works at a huge radio telescope. A few decades ago the telescope has sent a signal s towards a faraway galaxy. Recently they've received a response t which they believe to be a response from aliens! The scientists now want to check if the signal t is similar to s.
The original signal s was a sequence of zeros and ones (everyone knows that binary code is the universe-wide language). The returned signal t, however, does not look as easy as s, but the scientists don't give up! They represented t as a sequence of English letters and say that t is similar to s if you can replace all zeros in s with some string r_0 and all ones in s with some other string r_1 and obtain t. The strings r_0 and r_1 must be different and non-empty.
Please help Arkady's friend and find the number of possible replacements for zeros and ones (the number of pairs of strings r_0 and r_1) that transform s to t.
Input
The first line contains a string s (2 ≤ |s| ≤ 10^5) consisting of zeros and ones — the original signal.
The second line contains a string t (1 ≤ |t| ≤ 10^6) consisting of lowercase English letters only — the received signal.
It is guaranteed, that the string s contains at least one '0' and at least one '1'.
Output
Print a single integer — the number of pairs of strings r_0 and r_1 that transform s to t.
In case there are no such pairs, print 0.
Examples
Input
01
aaaaaa
Output
4
Input
001
kokokokotlin
Output
2
Note
In the first example, the possible pairs (r_0, r_1) are as follows:
* "a", "aaaaa"
* "aa", "aaaa"
* "aaaa", "aa"
* "aaaaa", "a"
The pair "aaa", "aaa" is not allowed, since r_0 and r_1 must be different.
In the second example, the following pairs are possible:
* "ko", "kokotlin"
* "koko", "tlin" | instruction | 0 | 31,785 | 18 | 63,570 |
Tags: brute force, data structures, hashing, strings
Correct Solution:
```
s = input()
t = input()
n,m = len(s), len(t)
a = s.count('0')
b = len(s) - a
pow = [1] * m
h = [0] * (m+1)
p, mod = 31, 10**9+9
for i in range(1, m):
pow[i] = pow[i-1] * p % mod
for i in range(m):
h[i+1] = (h[i] + (ord(t[i])-ord('a')+1) * pow[i]) % mod
def get_hash(i, j):
hash_value = (h[j] - h[i] + mod) % mod
hash_value = (hash_value * pow[m-i-1]) % mod
return hash_value
def check(x, y):
index = 0
hash_x = hash_y = -1
for i in range(n):
if s[i] == '0':
if hash_x == -1:
hash_x = get_hash(index, index+x)
else:
if get_hash(index, index+x) != hash_x: return False
index += x
else:
if hash_y == -1:
hash_y = get_hash(index, index+y)
else:
if get_hash(index, index+y) != hash_y: return False
index += y
return hash_x != hash_y
res = 0
for x in range(1, m//a+1):
if (m - a*x) % b == 0:
y = (m - a*x) // b
if y == 0: continue
if check(x ,y):
res += 1
print(res)
``` | output | 1 | 31,785 | 18 | 63,571 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One of Arkady's friends works at a huge radio telescope. A few decades ago the telescope has sent a signal s towards a faraway galaxy. Recently they've received a response t which they believe to be a response from aliens! The scientists now want to check if the signal t is similar to s.
The original signal s was a sequence of zeros and ones (everyone knows that binary code is the universe-wide language). The returned signal t, however, does not look as easy as s, but the scientists don't give up! They represented t as a sequence of English letters and say that t is similar to s if you can replace all zeros in s with some string r_0 and all ones in s with some other string r_1 and obtain t. The strings r_0 and r_1 must be different and non-empty.
Please help Arkady's friend and find the number of possible replacements for zeros and ones (the number of pairs of strings r_0 and r_1) that transform s to t.
Input
The first line contains a string s (2 ≤ |s| ≤ 10^5) consisting of zeros and ones — the original signal.
The second line contains a string t (1 ≤ |t| ≤ 10^6) consisting of lowercase English letters only — the received signal.
It is guaranteed, that the string s contains at least one '0' and at least one '1'.
Output
Print a single integer — the number of pairs of strings r_0 and r_1 that transform s to t.
In case there are no such pairs, print 0.
Examples
Input
01
aaaaaa
Output
4
Input
001
kokokokotlin
Output
2
Note
In the first example, the possible pairs (r_0, r_1) are as follows:
* "a", "aaaaa"
* "aa", "aaaa"
* "aaaa", "aa"
* "aaaaa", "a"
The pair "aaa", "aaa" is not allowed, since r_0 and r_1 must be different.
In the second example, the following pairs are possible:
* "ko", "kokotlin"
* "koko", "tlin" | instruction | 0 | 31,786 | 18 | 63,572 |
Tags: brute force, data structures, hashing, strings
Correct Solution:
```
def gethash(l,r):
return (ha[r]-((ha[l]*p[r-l])%mod)+mod)%mod
def check(lenx,leny):
ha_0=-1
ha_1=-1
j=0
for i in range(m):
if s[i]=="0":
tmp=gethash(j,j+lenx)
if ha_0==-1:
ha_0=tmp
elif ha_0!=tmp:
return 0
j+=lenx
else:
tmp=gethash(j,j+leny)
if ha_1==-1:
ha_1=tmp
elif ha_1!=tmp:
return 0
j+=leny
return ha_0!=ha_1
s=list(input())
t=list(input())
m=len(s)
n=len(t)
p=[1]
bas=2333
mod=(1<<50)-2
for i in range(1,n+1):
p.append((p[i-1]*bas)%mod)
ha=[0]
for i in range(1,n+1):
ha.append((ha[i-1]*bas+ord(t[i-1]))%mod)
cnt_0=0
cnt_1=0
for x in s:
if x=="0":
cnt_0+=1
else:
cnt_1+=1
ans=0
for i in range(1,n//cnt_0+1):#length of r_0
j=n-cnt_0*i
if j%cnt_1==0 and j!=0:
j//=cnt_1
ans+=check(i,j)
print(ans)
``` | output | 1 | 31,786 | 18 | 63,573 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of Arkady's friends works at a huge radio telescope. A few decades ago the telescope has sent a signal s towards a faraway galaxy. Recently they've received a response t which they believe to be a response from aliens! The scientists now want to check if the signal t is similar to s.
The original signal s was a sequence of zeros and ones (everyone knows that binary code is the universe-wide language). The returned signal t, however, does not look as easy as s, but the scientists don't give up! They represented t as a sequence of English letters and say that t is similar to s if you can replace all zeros in s with some string r_0 and all ones in s with some other string r_1 and obtain t. The strings r_0 and r_1 must be different and non-empty.
Please help Arkady's friend and find the number of possible replacements for zeros and ones (the number of pairs of strings r_0 and r_1) that transform s to t.
Input
The first line contains a string s (2 ≤ |s| ≤ 10^5) consisting of zeros and ones — the original signal.
The second line contains a string t (1 ≤ |t| ≤ 10^6) consisting of lowercase English letters only — the received signal.
It is guaranteed, that the string s contains at least one '0' and at least one '1'.
Output
Print a single integer — the number of pairs of strings r_0 and r_1 that transform s to t.
In case there are no such pairs, print 0.
Examples
Input
01
aaaaaa
Output
4
Input
001
kokokokotlin
Output
2
Note
In the first example, the possible pairs (r_0, r_1) are as follows:
* "a", "aaaaa"
* "aa", "aaaa"
* "aaaa", "aa"
* "aaaaa", "a"
The pair "aaa", "aaa" is not allowed, since r_0 and r_1 must be different.
In the second example, the following pairs are possible:
* "ko", "kokotlin"
* "koko", "tlin"
Submitted Solution:
```
MOD = 1e9 + 7
MAX = 1000005
power = [0 for _ in range(MAX)]
h = [0 for _ in range(MAX)]
def get(left, right):
return int((h[right] - h[left - 1] * power[right - left + 1] % MOD + MOD) % MOD)
if __name__ == '__main__':
# print(power, h)
s = input()
t = input()
n = len(s)
m = len(t)
s = '.' + s
t = '.' + t
cnt = [0 for i in range(2)]
for i in range(1, n + 1):
cnt[ord(s[i]) - ord('0')] += 1
power[0] = 1
for i in range(1, m + 1):
power[i] = int(power[i - 1] * 41 % MOD)
h[i] = int(( h[i - 1] * 41 + ord(t[i]) - ord('a') + 1 ) % MOD)
# print(i, power[i], h[i])
ans = 0
g = [0 for i in range(2)]
f = [1 for i in range(2)]
length = [0 for i in range(2)]
for length_0 in range(1, m + 1):
f[0] = f[1] = 1
if cnt[0] * length_0 >= m:
break
if (m - cnt[0] * length_0) % cnt[1] != 0:
continue
length[0] = length_0
length[1] = (m - cnt[0] * length_0) // cnt[1]
left = 1
for k in range(1, n + 1):
cur = ord(s[k]) - ord('0')
if f[cur]:
g[cur] = get(left, left + length[cur] - 1)
f[cur] = 0
elif g[cur] != get(left, left + length[cur] - 1):
break
# print(cur, f[cur], g[cur])
if f[0] == 0 and f[1] == 0 and g[0] == g[1]:
break
if k == n:
ans += 1
left += length[cur]
print(ans)
``` | instruction | 0 | 31,787 | 18 | 63,574 |
No | output | 1 | 31,787 | 18 | 63,575 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of Arkady's friends works at a huge radio telescope. A few decades ago the telescope has sent a signal s towards a faraway galaxy. Recently they've received a response t which they believe to be a response from aliens! The scientists now want to check if the signal t is similar to s.
The original signal s was a sequence of zeros and ones (everyone knows that binary code is the universe-wide language). The returned signal t, however, does not look as easy as s, but the scientists don't give up! They represented t as a sequence of English letters and say that t is similar to s if you can replace all zeros in s with some string r_0 and all ones in s with some other string r_1 and obtain t. The strings r_0 and r_1 must be different and non-empty.
Please help Arkady's friend and find the number of possible replacements for zeros and ones (the number of pairs of strings r_0 and r_1) that transform s to t.
Input
The first line contains a string s (2 ≤ |s| ≤ 10^5) consisting of zeros and ones — the original signal.
The second line contains a string t (1 ≤ |t| ≤ 10^6) consisting of lowercase English letters only — the received signal.
It is guaranteed, that the string s contains at least one '0' and at least one '1'.
Output
Print a single integer — the number of pairs of strings r_0 and r_1 that transform s to t.
In case there are no such pairs, print 0.
Examples
Input
01
aaaaaa
Output
4
Input
001
kokokokotlin
Output
2
Note
In the first example, the possible pairs (r_0, r_1) are as follows:
* "a", "aaaaa"
* "aa", "aaaa"
* "aaaa", "aa"
* "aaaaa", "a"
The pair "aaa", "aaa" is not allowed, since r_0 and r_1 must be different.
In the second example, the following pairs are possible:
* "ko", "kokotlin"
* "koko", "tlin"
Submitted 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 add(a,b):
return (a+b)%1000000007
def sub(a,b):
return (a+1000000007-b)%1000000007
def mul(a,b):
return (a*b)%1000000007
p = 102367
s = list(map(int,minp()))
t = list(map(ord,minp()))
h = [0]*(len(t)+1)
pp = [1]*(len(t)+1)
for i in range(len(t)):
h[i+1] = add(mul(h[i], p), t[i])
pp[i+1] = mul(pp[i], p)
def cmp(a, b, l):
if a > b:
a, b = b, a
h1 = sub(h[a+l], h[a])
h2 = sub(h[b+l], h[b])
return mul(h1,pp[b-a]) == h2
c = [0,0]
idx = [-1,-1]
for i in range(len(s)):
c[s[i]] += 1
if idx[s[i]] < 0:
idx[s[i]] = i
Mv = max(c)
mv = min(c)
Mi = c.index(Mv)
mi = (Mi^1)
lt = len(t)
sp = [0,0]
res = 0
for k in range(1,lt//Mv+1):
l = [0,0]
x = (lt-k*Mv)//mv
if x > 0 and x*mv + k*Mv == lt:
l[Mi] = k
l[mi] = x
if idx[0] < idx[1]:
sp[0] = 0
sp[1] = idx[1]*l[0]
else:
sp[1] = 0
sp[0] = idx[0]*l[1]
ok = True
j = 0
for i in range(len(s)):
if not cmp(sp[s[i]], j, l[s[i]]):
ok = False
break
j += l[s[i]]
if l[0] == l[1] and cmp(sp[0], sp[1], l[0]):
ok = False
if ok:
res += 1
print(res)
``` | instruction | 0 | 31,788 | 18 | 63,576 |
No | output | 1 | 31,788 | 18 | 63,577 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of Arkady's friends works at a huge radio telescope. A few decades ago the telescope has sent a signal s towards a faraway galaxy. Recently they've received a response t which they believe to be a response from aliens! The scientists now want to check if the signal t is similar to s.
The original signal s was a sequence of zeros and ones (everyone knows that binary code is the universe-wide language). The returned signal t, however, does not look as easy as s, but the scientists don't give up! They represented t as a sequence of English letters and say that t is similar to s if you can replace all zeros in s with some string r_0 and all ones in s with some other string r_1 and obtain t. The strings r_0 and r_1 must be different and non-empty.
Please help Arkady's friend and find the number of possible replacements for zeros and ones (the number of pairs of strings r_0 and r_1) that transform s to t.
Input
The first line contains a string s (2 ≤ |s| ≤ 10^5) consisting of zeros and ones — the original signal.
The second line contains a string t (1 ≤ |t| ≤ 10^6) consisting of lowercase English letters only — the received signal.
It is guaranteed, that the string s contains at least one '0' and at least one '1'.
Output
Print a single integer — the number of pairs of strings r_0 and r_1 that transform s to t.
In case there are no such pairs, print 0.
Examples
Input
01
aaaaaa
Output
4
Input
001
kokokokotlin
Output
2
Note
In the first example, the possible pairs (r_0, r_1) are as follows:
* "a", "aaaaa"
* "aa", "aaaa"
* "aaaa", "aa"
* "aaaaa", "a"
The pair "aaa", "aaa" is not allowed, since r_0 and r_1 must be different.
In the second example, the following pairs are possible:
* "ko", "kokotlin"
* "koko", "tlin"
Submitted Solution:
```
MOD = 1e9 + 7
def get(left, right):
return int((h[right] - h[left - 1] * power[right - left + 1] % MOD + MOD) % MOD)
if __name__ == '__main__':
s = input()
t = input()
n = len(s)
m = len(t)
s = '.' + s
t = '.' + t
cnt_0 = 0
for x in s:
if x == '0':
cnt_0 += 1
cnt_1 = n - cnt_0
power = [0] * (len(t) + 1)
h = [0] * (len(t) + 1)
power[0] = 1
for i in range(1, m + 1):
power[i] = int(power[i - 1] * 41 % MOD)
h[i] = int(( h[i - 1] * 41 + ord(t[i]) - ord('a') + 1 ) % MOD)
ans = 0
g = [0] * 2
for length_0 in range(1, m):
f = [1] * 2
if cnt_0 * length_0 >= m:
break
if (m - cnt_0 * length_0) % cnt_1 != 0:
continue
length = [0] * 2
length[0] = length_0
length[1] = (m - cnt_0 * length_0) // cnt_1
left = 1
for k in range(1, n + 1):
cur = ord(s[k]) - ord('0')
if f[cur]:
g[cur] = get(left, left + length[cur] - 1)
f[cur] = 0
elif g[cur] != get(left, left + length[cur] - 1):
break
if not f[0] and not f[1] and g[0] == g[1]:
break
if k == n:
ans += 1
left += length[cur]
print(ans)
``` | instruction | 0 | 31,789 | 18 | 63,578 |
No | output | 1 | 31,789 | 18 | 63,579 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of Arkady's friends works at a huge radio telescope. A few decades ago the telescope has sent a signal s towards a faraway galaxy. Recently they've received a response t which they believe to be a response from aliens! The scientists now want to check if the signal t is similar to s.
The original signal s was a sequence of zeros and ones (everyone knows that binary code is the universe-wide language). The returned signal t, however, does not look as easy as s, but the scientists don't give up! They represented t as a sequence of English letters and say that t is similar to s if you can replace all zeros in s with some string r_0 and all ones in s with some other string r_1 and obtain t. The strings r_0 and r_1 must be different and non-empty.
Please help Arkady's friend and find the number of possible replacements for zeros and ones (the number of pairs of strings r_0 and r_1) that transform s to t.
Input
The first line contains a string s (2 ≤ |s| ≤ 10^5) consisting of zeros and ones — the original signal.
The second line contains a string t (1 ≤ |t| ≤ 10^6) consisting of lowercase English letters only — the received signal.
It is guaranteed, that the string s contains at least one '0' and at least one '1'.
Output
Print a single integer — the number of pairs of strings r_0 and r_1 that transform s to t.
In case there are no such pairs, print 0.
Examples
Input
01
aaaaaa
Output
4
Input
001
kokokokotlin
Output
2
Note
In the first example, the possible pairs (r_0, r_1) are as follows:
* "a", "aaaaa"
* "aa", "aaaa"
* "aaaa", "aa"
* "aaaaa", "a"
The pair "aaa", "aaa" is not allowed, since r_0 and r_1 must be different.
In the second example, the following pairs are possible:
* "ko", "kokotlin"
* "koko", "tlin"
Submitted Solution:
```
MOD = 1e9 + 7
def get(left, right):
return int((h[right] - h[left - 1] * power[right - left + 1] % MOD + MOD) % MOD)
if __name__ == '__main__':
s = input()
t = input()
n = len(s)
m = len(t)
s = '.' + s
t = '.' + t
cnt = [0] * 2
for i in range(1, n + 1):
cnt[ord(s[i]) - ord('0')] += 1
power = [0] * (len(t) + 1)
h = [0] * (len(t) + 1)
power[0] = 1
for i in range(1, m + 1):
power[i] = int(power[i - 1] * 41 % MOD)
h[i] = int(( h[i - 1] * 41 + ord(t[i]) - ord('a') + 1 ) % MOD)
# print(i, power[i])
ans = 0
g = [0] * 2
for length_0 in range(1, m):
f = [1] * 2
if cnt[0] * length_0 >= m:
break
if (m - cnt[0] * length_0) % cnt[1] != 0:
continue
length = [0] * 2
length[0] = length_0
length[1] = (m - cnt[0] * length_0) // cnt[1]
left = 1
for k in range(1, n + 1):
cur = ord(s[k]) - ord('0')
if f[cur]:
g[cur] = get(left, left + length[cur] - 1)
f[cur] = 0
# print(cur, f[cur], g[cur])
elif g[cur] != get(left, left + length[cur] - 1):
break
if f[0] == 0 and f[1] == 0 and g[0] == g[1]:
break
if k == n:
ans += 1
left += length[cur]
print(ans)
``` | instruction | 0 | 31,790 | 18 | 63,580 |
No | output | 1 | 31,790 | 18 | 63,581 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two strings of equal length s and t consisting of lowercase Latin letters. You may perform any number (possibly, zero) operations on these strings.
During each operation you choose two adjacent characters in any string and assign the value of the first character to the value of the second or vice versa.
For example, if s is "acbc" you can get the following strings in one operation:
* "aabc" (if you perform s_2 = s_1);
* "ccbc" (if you perform s_1 = s_2);
* "accc" (if you perform s_3 = s_2 or s_3 = s_4);
* "abbc" (if you perform s_2 = s_3);
* "acbb" (if you perform s_4 = s_3);
Note that you can also apply this operation to the string t.
Please determine whether it is possible to transform s into t, applying the operation above any number of times.
Note that you have to answer q independent queries.
Input
The first line contains one integer q (1 ≤ q ≤ 100) — the number of queries. Each query is represented by two consecutive lines.
The first line of each query contains the string s (1 ≤ |s| ≤ 100) consisting of lowercase Latin letters.
The second line of each query contains the string t (1 ≤ |t| ≤ 100, |t| = |s|) consisting of lowercase Latin letters.
Output
For each query, print "YES" if it is possible to make s equal to t, and "NO" otherwise.
You may print every letter in any case you want (so, for example, the strings "yEs", "yes", "Yes", and "YES" will all be recognized as positive answer).
Example
Input
3
xabb
aabx
technocup
technocup
a
z
Output
YES
YES
NO
Note
In the first query, you can perform two operations s_1 = s_2 (after it s turns into "aabb") and t_4 = t_3 (after it t turns into "aabb").
In the second query, the strings are equal initially, so the answer is "YES".
In the third query, you can not make strings s and t equal. Therefore, the answer is "NO".
Submitted Solution:
```
array = []
word = False
for i in range(int(input())):
array.append([input(), input()])
for elem in array:
for element in elem[0]:
if element in elem[1]:
word = True
break
if word:
print('YES')
else:
print('NO')
word = False
``` | instruction | 0 | 31,854 | 18 | 63,708 |
Yes | output | 1 | 31,854 | 18 | 63,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two strings of equal length s and t consisting of lowercase Latin letters. You may perform any number (possibly, zero) operations on these strings.
During each operation you choose two adjacent characters in any string and assign the value of the first character to the value of the second or vice versa.
For example, if s is "acbc" you can get the following strings in one operation:
* "aabc" (if you perform s_2 = s_1);
* "ccbc" (if you perform s_1 = s_2);
* "accc" (if you perform s_3 = s_2 or s_3 = s_4);
* "abbc" (if you perform s_2 = s_3);
* "acbb" (if you perform s_4 = s_3);
Note that you can also apply this operation to the string t.
Please determine whether it is possible to transform s into t, applying the operation above any number of times.
Note that you have to answer q independent queries.
Input
The first line contains one integer q (1 ≤ q ≤ 100) — the number of queries. Each query is represented by two consecutive lines.
The first line of each query contains the string s (1 ≤ |s| ≤ 100) consisting of lowercase Latin letters.
The second line of each query contains the string t (1 ≤ |t| ≤ 100, |t| = |s|) consisting of lowercase Latin letters.
Output
For each query, print "YES" if it is possible to make s equal to t, and "NO" otherwise.
You may print every letter in any case you want (so, for example, the strings "yEs", "yes", "Yes", and "YES" will all be recognized as positive answer).
Example
Input
3
xabb
aabx
technocup
technocup
a
z
Output
YES
YES
NO
Note
In the first query, you can perform two operations s_1 = s_2 (after it s turns into "aabb") and t_4 = t_3 (after it t turns into "aabb").
In the second query, the strings are equal initially, so the answer is "YES".
In the third query, you can not make strings s and t equal. Therefore, the answer is "NO".
Submitted Solution:
```
q = int(input())
for i in range(q):
a = set(input())
b = set(input())
if a.intersection(b):
print("YES")
else:
print("NO")
``` | instruction | 0 | 31,855 | 18 | 63,710 |
Yes | output | 1 | 31,855 | 18 | 63,711 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two strings of equal length s and t consisting of lowercase Latin letters. You may perform any number (possibly, zero) operations on these strings.
During each operation you choose two adjacent characters in any string and assign the value of the first character to the value of the second or vice versa.
For example, if s is "acbc" you can get the following strings in one operation:
* "aabc" (if you perform s_2 = s_1);
* "ccbc" (if you perform s_1 = s_2);
* "accc" (if you perform s_3 = s_2 or s_3 = s_4);
* "abbc" (if you perform s_2 = s_3);
* "acbb" (if you perform s_4 = s_3);
Note that you can also apply this operation to the string t.
Please determine whether it is possible to transform s into t, applying the operation above any number of times.
Note that you have to answer q independent queries.
Input
The first line contains one integer q (1 ≤ q ≤ 100) — the number of queries. Each query is represented by two consecutive lines.
The first line of each query contains the string s (1 ≤ |s| ≤ 100) consisting of lowercase Latin letters.
The second line of each query contains the string t (1 ≤ |t| ≤ 100, |t| = |s|) consisting of lowercase Latin letters.
Output
For each query, print "YES" if it is possible to make s equal to t, and "NO" otherwise.
You may print every letter in any case you want (so, for example, the strings "yEs", "yes", "Yes", and "YES" will all be recognized as positive answer).
Example
Input
3
xabb
aabx
technocup
technocup
a
z
Output
YES
YES
NO
Note
In the first query, you can perform two operations s_1 = s_2 (after it s turns into "aabb") and t_4 = t_3 (after it t turns into "aabb").
In the second query, the strings are equal initially, so the answer is "YES".
In the third query, you can not make strings s and t equal. Therefore, the answer is "NO".
Submitted Solution:
```
t=int(input())
for i in range(t):
s=input()
t=input()
if len(s)!=len(t):
print("NO")
elif s==t:
print("YES")
else:
flag=0
for i in range(len(s)):
if t.count(s[i])>=1:
flag=1
break
if flag==1:
print("YES")
else:
print("NO")
``` | instruction | 0 | 31,856 | 18 | 63,712 |
Yes | output | 1 | 31,856 | 18 | 63,713 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two strings of equal length s and t consisting of lowercase Latin letters. You may perform any number (possibly, zero) operations on these strings.
During each operation you choose two adjacent characters in any string and assign the value of the first character to the value of the second or vice versa.
For example, if s is "acbc" you can get the following strings in one operation:
* "aabc" (if you perform s_2 = s_1);
* "ccbc" (if you perform s_1 = s_2);
* "accc" (if you perform s_3 = s_2 or s_3 = s_4);
* "abbc" (if you perform s_2 = s_3);
* "acbb" (if you perform s_4 = s_3);
Note that you can also apply this operation to the string t.
Please determine whether it is possible to transform s into t, applying the operation above any number of times.
Note that you have to answer q independent queries.
Input
The first line contains one integer q (1 ≤ q ≤ 100) — the number of queries. Each query is represented by two consecutive lines.
The first line of each query contains the string s (1 ≤ |s| ≤ 100) consisting of lowercase Latin letters.
The second line of each query contains the string t (1 ≤ |t| ≤ 100, |t| = |s|) consisting of lowercase Latin letters.
Output
For each query, print "YES" if it is possible to make s equal to t, and "NO" otherwise.
You may print every letter in any case you want (so, for example, the strings "yEs", "yes", "Yes", and "YES" will all be recognized as positive answer).
Example
Input
3
xabb
aabx
technocup
technocup
a
z
Output
YES
YES
NO
Note
In the first query, you can perform two operations s_1 = s_2 (after it s turns into "aabb") and t_4 = t_3 (after it t turns into "aabb").
In the second query, the strings are equal initially, so the answer is "YES".
In the third query, you can not make strings s and t equal. Therefore, the answer is "NO".
Submitted Solution:
```
t=int(input())
for w in range(t):
s=list(input())
t=list(input())
c=0
for i in s:
if(i in t):
c=1
print("YES")
break
if(c==0):
print("NO")
``` | instruction | 0 | 31,857 | 18 | 63,714 |
Yes | output | 1 | 31,857 | 18 | 63,715 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two strings of equal length s and t consisting of lowercase Latin letters. You may perform any number (possibly, zero) operations on these strings.
During each operation you choose two adjacent characters in any string and assign the value of the first character to the value of the second or vice versa.
For example, if s is "acbc" you can get the following strings in one operation:
* "aabc" (if you perform s_2 = s_1);
* "ccbc" (if you perform s_1 = s_2);
* "accc" (if you perform s_3 = s_2 or s_3 = s_4);
* "abbc" (if you perform s_2 = s_3);
* "acbb" (if you perform s_4 = s_3);
Note that you can also apply this operation to the string t.
Please determine whether it is possible to transform s into t, applying the operation above any number of times.
Note that you have to answer q independent queries.
Input
The first line contains one integer q (1 ≤ q ≤ 100) — the number of queries. Each query is represented by two consecutive lines.
The first line of each query contains the string s (1 ≤ |s| ≤ 100) consisting of lowercase Latin letters.
The second line of each query contains the string t (1 ≤ |t| ≤ 100, |t| = |s|) consisting of lowercase Latin letters.
Output
For each query, print "YES" if it is possible to make s equal to t, and "NO" otherwise.
You may print every letter in any case you want (so, for example, the strings "yEs", "yes", "Yes", and "YES" will all be recognized as positive answer).
Example
Input
3
xabb
aabx
technocup
technocup
a
z
Output
YES
YES
NO
Note
In the first query, you can perform two operations s_1 = s_2 (after it s turns into "aabb") and t_4 = t_3 (after it t turns into "aabb").
In the second query, the strings are equal initially, so the answer is "YES".
In the third query, you can not make strings s and t equal. Therefore, the answer is "NO".
Submitted Solution:
```
n = int(input())
for i in range(n):
a = input()
b = input()
s = set(a)
t = set(b)
if s == t:
print('YES')
else:
print('NO')
``` | instruction | 0 | 31,858 | 18 | 63,716 |
No | output | 1 | 31,858 | 18 | 63,717 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two strings of equal length s and t consisting of lowercase Latin letters. You may perform any number (possibly, zero) operations on these strings.
During each operation you choose two adjacent characters in any string and assign the value of the first character to the value of the second or vice versa.
For example, if s is "acbc" you can get the following strings in one operation:
* "aabc" (if you perform s_2 = s_1);
* "ccbc" (if you perform s_1 = s_2);
* "accc" (if you perform s_3 = s_2 or s_3 = s_4);
* "abbc" (if you perform s_2 = s_3);
* "acbb" (if you perform s_4 = s_3);
Note that you can also apply this operation to the string t.
Please determine whether it is possible to transform s into t, applying the operation above any number of times.
Note that you have to answer q independent queries.
Input
The first line contains one integer q (1 ≤ q ≤ 100) — the number of queries. Each query is represented by two consecutive lines.
The first line of each query contains the string s (1 ≤ |s| ≤ 100) consisting of lowercase Latin letters.
The second line of each query contains the string t (1 ≤ |t| ≤ 100, |t| = |s|) consisting of lowercase Latin letters.
Output
For each query, print "YES" if it is possible to make s equal to t, and "NO" otherwise.
You may print every letter in any case you want (so, for example, the strings "yEs", "yes", "Yes", and "YES" will all be recognized as positive answer).
Example
Input
3
xabb
aabx
technocup
technocup
a
z
Output
YES
YES
NO
Note
In the first query, you can perform two operations s_1 = s_2 (after it s turns into "aabb") and t_4 = t_3 (after it t turns into "aabb").
In the second query, the strings are equal initially, so the answer is "YES".
In the third query, you can not make strings s and t equal. Therefore, the answer is "NO".
Submitted Solution:
```
arr = []
for f in range(int(input())):
q = list(input()+"0")
t = list(input()+"0")
for i in range(len(q)):
if q[i]!=t[i] and (q[i+1]==t[i] or q[i-1]==t[i]) :
q[i] = t[i]
elif q[i]!=t[i] and (t[i+1]==q[i] or t[i-1]==q[i]):
t[i] = q[i]
if q==t:
arr.append("YES")
else:
arr.append("NO")
for i in arr:
print(i)
``` | instruction | 0 | 31,859 | 18 | 63,718 |
No | output | 1 | 31,859 | 18 | 63,719 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two strings of equal length s and t consisting of lowercase Latin letters. You may perform any number (possibly, zero) operations on these strings.
During each operation you choose two adjacent characters in any string and assign the value of the first character to the value of the second or vice versa.
For example, if s is "acbc" you can get the following strings in one operation:
* "aabc" (if you perform s_2 = s_1);
* "ccbc" (if you perform s_1 = s_2);
* "accc" (if you perform s_3 = s_2 or s_3 = s_4);
* "abbc" (if you perform s_2 = s_3);
* "acbb" (if you perform s_4 = s_3);
Note that you can also apply this operation to the string t.
Please determine whether it is possible to transform s into t, applying the operation above any number of times.
Note that you have to answer q independent queries.
Input
The first line contains one integer q (1 ≤ q ≤ 100) — the number of queries. Each query is represented by two consecutive lines.
The first line of each query contains the string s (1 ≤ |s| ≤ 100) consisting of lowercase Latin letters.
The second line of each query contains the string t (1 ≤ |t| ≤ 100, |t| = |s|) consisting of lowercase Latin letters.
Output
For each query, print "YES" if it is possible to make s equal to t, and "NO" otherwise.
You may print every letter in any case you want (so, for example, the strings "yEs", "yes", "Yes", and "YES" will all be recognized as positive answer).
Example
Input
3
xabb
aabx
technocup
technocup
a
z
Output
YES
YES
NO
Note
In the first query, you can perform two operations s_1 = s_2 (after it s turns into "aabb") and t_4 = t_3 (after it t turns into "aabb").
In the second query, the strings are equal initially, so the answer is "YES".
In the third query, you can not make strings s and t equal. Therefore, the answer is "NO".
Submitted Solution:
```
q = int(input())
for i in range(q):
s = input()
t = input()
if s[0] == t[-1]:
print('no')
a = set()
b = set()
for j in s:
a.add(j)
for j in t:
b.add(j)
if a == b:
print('yes')
else:
print('no')
``` | instruction | 0 | 31,860 | 18 | 63,720 |
No | output | 1 | 31,860 | 18 | 63,721 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two strings of equal length s and t consisting of lowercase Latin letters. You may perform any number (possibly, zero) operations on these strings.
During each operation you choose two adjacent characters in any string and assign the value of the first character to the value of the second or vice versa.
For example, if s is "acbc" you can get the following strings in one operation:
* "aabc" (if you perform s_2 = s_1);
* "ccbc" (if you perform s_1 = s_2);
* "accc" (if you perform s_3 = s_2 or s_3 = s_4);
* "abbc" (if you perform s_2 = s_3);
* "acbb" (if you perform s_4 = s_3);
Note that you can also apply this operation to the string t.
Please determine whether it is possible to transform s into t, applying the operation above any number of times.
Note that you have to answer q independent queries.
Input
The first line contains one integer q (1 ≤ q ≤ 100) — the number of queries. Each query is represented by two consecutive lines.
The first line of each query contains the string s (1 ≤ |s| ≤ 100) consisting of lowercase Latin letters.
The second line of each query contains the string t (1 ≤ |t| ≤ 100, |t| = |s|) consisting of lowercase Latin letters.
Output
For each query, print "YES" if it is possible to make s equal to t, and "NO" otherwise.
You may print every letter in any case you want (so, for example, the strings "yEs", "yes", "Yes", and "YES" will all be recognized as positive answer).
Example
Input
3
xabb
aabx
technocup
technocup
a
z
Output
YES
YES
NO
Note
In the first query, you can perform two operations s_1 = s_2 (after it s turns into "aabb") and t_4 = t_3 (after it t turns into "aabb").
In the second query, the strings are equal initially, so the answer is "YES".
In the third query, you can not make strings s and t equal. Therefore, the answer is "NO".
Submitted Solution:
```
t=int(input())
for i in range(t):
s=input()
t=input()
if len(s)!=len(t):
print("NO")
elif s==t:
print("YES")
else:
flag=0
for i in range(len(s)):
if s[i]!=t[i] and s.count(t[i])==0:
flag=1
break
if flag==1:
print("NO")
else:
print("YES")
``` | instruction | 0 | 31,861 | 18 | 63,722 |
No | output | 1 | 31,861 | 18 | 63,723 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike has n strings s1, s2, ..., sn each consisting of lowercase English letters. In one move he can choose a string si, erase the first character and append it to the end of the string. For example, if he has the string "coolmike", in one move he can transform it into the string "oolmikec".
Now Mike asks himself: what is minimal number of moves that he needs to do in order to make all the strings equal?
Input
The first line contains integer n (1 ≤ n ≤ 50) — the number of strings.
This is followed by n lines which contain a string each. The i-th line corresponding to string si. Lengths of strings are equal. Lengths of each string is positive and don't exceed 50.
Output
Print the minimal number of moves Mike needs in order to make all the strings equal or print - 1 if there is no solution.
Examples
Input
4
xzzwo
zwoxz
zzwox
xzzwo
Output
5
Input
2
molzv
lzvmo
Output
2
Input
3
kc
kc
kc
Output
0
Input
3
aa
aa
ab
Output
-1
Note
In the first sample testcase the optimal scenario is to perform operations in such a way as to transform all strings into "zwoxz".
Submitted Solution:
```
x = int(input())
ops = []
alls = []
for i in range(x):
s = input()
t = s[:]
t = t[1:] + t[0]
a = [s]
while (t != s):
a.append(t)
t = t[1:] + t[0]
if i == 0:
ops = a[:]
alls.append(a)
def ind(l, s):
for i in range(len(l)):
if l[i] == s:
return i
return -1
ans = 10**9
for i in ops:
tot = 0
for j in alls:
x = ind(j, i)
if (x != -1):
tot += x
else:
tot += 10**9
ans = min(ans, tot)
if ans > 10**8:
print(-1)
else:
print(ans)
``` | instruction | 0 | 32,150 | 18 | 64,300 |
Yes | output | 1 | 32,150 | 18 | 64,301 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike has n strings s1, s2, ..., sn each consisting of lowercase English letters. In one move he can choose a string si, erase the first character and append it to the end of the string. For example, if he has the string "coolmike", in one move he can transform it into the string "oolmikec".
Now Mike asks himself: what is minimal number of moves that he needs to do in order to make all the strings equal?
Input
The first line contains integer n (1 ≤ n ≤ 50) — the number of strings.
This is followed by n lines which contain a string each. The i-th line corresponding to string si. Lengths of strings are equal. Lengths of each string is positive and don't exceed 50.
Output
Print the minimal number of moves Mike needs in order to make all the strings equal or print - 1 if there is no solution.
Examples
Input
4
xzzwo
zwoxz
zzwox
xzzwo
Output
5
Input
2
molzv
lzvmo
Output
2
Input
3
kc
kc
kc
Output
0
Input
3
aa
aa
ab
Output
-1
Note
In the first sample testcase the optimal scenario is to perform operations in such a way as to transform all strings into "zwoxz".
Submitted Solution:
```
def fn(s1,s2):
l1=list(s1)
l2=list(s2)
ans=0
for i in range(len(l1)):
if l1==l2:
break
l1=l1[1:]+[l1[0]]
ans+=1
if l1==l2:
return ans
else:
print(-1)
exit()
n1=int(input())
l=[]
if n1==1:
print(0)
exit()
for i in range(n1):
l.append(str(input()))
l.sort()
m=(n1-1)//2
n=m+1
ans=[]
for i in range(n1):
ans1=0
for j in range(n1):
ans1+=fn(l[j],l[i])
ans.append(ans1)
print(min(ans))
``` | instruction | 0 | 32,153 | 18 | 64,306 |
Yes | output | 1 | 32,153 | 18 | 64,307 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike has n strings s1, s2, ..., sn each consisting of lowercase English letters. In one move he can choose a string si, erase the first character and append it to the end of the string. For example, if he has the string "coolmike", in one move he can transform it into the string "oolmikec".
Now Mike asks himself: what is minimal number of moves that he needs to do in order to make all the strings equal?
Input
The first line contains integer n (1 ≤ n ≤ 50) — the number of strings.
This is followed by n lines which contain a string each. The i-th line corresponding to string si. Lengths of strings are equal. Lengths of each string is positive and don't exceed 50.
Output
Print the minimal number of moves Mike needs in order to make all the strings equal or print - 1 if there is no solution.
Examples
Input
4
xzzwo
zwoxz
zzwox
xzzwo
Output
5
Input
2
molzv
lzvmo
Output
2
Input
3
kc
kc
kc
Output
0
Input
3
aa
aa
ab
Output
-1
Note
In the first sample testcase the optimal scenario is to perform operations in such a way as to transform all strings into "zwoxz".
Submitted Solution:
```
import math
arr = []
n = int(input())
i = 0
while(i < n):
st = input()
i = i + 1
arr.append(st)
tmp = sorted(arr[0])
for i in arr:
i = sorted(i)
if(tmp != i):
print(-1)
quit()
res = 10000
for i in arr:
tmp = i
k = 0
for j in arr:
k = k + (j * 2).find(tmp)
if(k < res):
res = k
print('\n\nresult =', res)
``` | instruction | 0 | 32,154 | 18 | 64,308 |
No | output | 1 | 32,154 | 18 | 64,309 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike has n strings s1, s2, ..., sn each consisting of lowercase English letters. In one move he can choose a string si, erase the first character and append it to the end of the string. For example, if he has the string "coolmike", in one move he can transform it into the string "oolmikec".
Now Mike asks himself: what is minimal number of moves that he needs to do in order to make all the strings equal?
Input
The first line contains integer n (1 ≤ n ≤ 50) — the number of strings.
This is followed by n lines which contain a string each. The i-th line corresponding to string si. Lengths of strings are equal. Lengths of each string is positive and don't exceed 50.
Output
Print the minimal number of moves Mike needs in order to make all the strings equal or print - 1 if there is no solution.
Examples
Input
4
xzzwo
zwoxz
zzwox
xzzwo
Output
5
Input
2
molzv
lzvmo
Output
2
Input
3
kc
kc
kc
Output
0
Input
3
aa
aa
ab
Output
-1
Note
In the first sample testcase the optimal scenario is to perform operations in such a way as to transform all strings into "zwoxz".
Submitted Solution:
```
# Cf 798B
def minnum(a, b):
if a >= b:
return b
return a
def main():
n = eval(input())
s = [input(),]
k = [0, ]
le = len(s[0])
F = True
for i in range(1, n):
s.append(input())
flag = False
for j in range(1, le+1):
if s[i][j:]+s[i][:j] == s[0]:
if j == le:
k.append(0)
else:
k.append(j)
flag = True
break
else:
cur = [i, j]
if flag is False:
F = False
if F is False:
print(-1)
return
ans = sum(k)
if ans <= 1:
print(ans)
return
t = sorted(k)
for i in range(1, n):
minus = t[i]
for j in range(n):
if t[j] < minus:
t[j] += le - minus
else:
t[j] -= minus
ans = minnum(ans, sum(t))
print(ans)
main()
``` | instruction | 0 | 32,156 | 18 | 64,312 |
No | output | 1 | 32,156 | 18 | 64,313 |
Provide a correct Python 3 solution for this coding contest problem.
Mr.X, who the handle name is T, looked at the list which written N handle names, S_1, S_2, ..., S_N.
But he couldn't see some parts of the list. Invisible part is denoted `?`.
Please calculate all possible index of the handle name of Mr.X when you sort N+1 handle names (S_1, S_2, ..., S_N and T) in lexicographical order.
Note: If there are pair of people with same handle name, either one may come first.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Example
Input
2
tourist
petr
e
Output
1 | instruction | 0 | 32,367 | 18 | 64,734 |
"Correct Solution:
```
N = int(input())
src = [input() for i in range(N)]
T = input()
before = after = 0
for s in src:
if s.replace('?','z') < T:
before += 1
elif s.replace('?','a') > T:
after += 1
print(*range(before+1, N-after+2))
``` | output | 1 | 32,367 | 18 | 64,735 |
Provide a correct Python 3 solution for this coding contest problem.
Mr.X, who the handle name is T, looked at the list which written N handle names, S_1, S_2, ..., S_N.
But he couldn't see some parts of the list. Invisible part is denoted `?`.
Please calculate all possible index of the handle name of Mr.X when you sort N+1 handle names (S_1, S_2, ..., S_N and T) in lexicographical order.
Note: If there are pair of people with same handle name, either one may come first.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Example
Input
2
tourist
petr
e
Output
1 | instruction | 0 | 32,368 | 18 | 64,736 |
"Correct Solution:
```
def iin(): return int(input())
def nl(): return list(map(int, input().split()))
n = iin()
ss = [input() for _ in range(n)]
t = input()
i_min = n + 1
i_max = 1
for s in ss:
if t >= s.replace('?', 'a'):#これとの比較が最後
i_max += 1
if t <= s.replace('?', 'z'):#これとの比較が最前
i_min -= 1
ans = range(i_min, i_max + 1)
print(*ans)
``` | output | 1 | 32,368 | 18 | 64,737 |
Provide a correct Python 3 solution for this coding contest problem.
Mr.X, who the handle name is T, looked at the list which written N handle names, S_1, S_2, ..., S_N.
But he couldn't see some parts of the list. Invisible part is denoted `?`.
Please calculate all possible index of the handle name of Mr.X when you sort N+1 handle names (S_1, S_2, ..., S_N and T) in lexicographical order.
Note: If there are pair of people with same handle name, either one may come first.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Example
Input
2
tourist
petr
e
Output
1 | instruction | 0 | 32,369 | 18 | 64,738 |
"Correct Solution:
```
from bisect import*
n,*s,t=open(0)
x,y=[sorted(u.replace('?',c)for u in s)for c in'za']
print(*range(bisect_left(x,t)+1,bisect(y,t)+2))
``` | output | 1 | 32,369 | 18 | 64,739 |
Provide a correct Python 3 solution for this coding contest problem.
Mr.X, who the handle name is T, looked at the list which written N handle names, S_1, S_2, ..., S_N.
But he couldn't see some parts of the list. Invisible part is denoted `?`.
Please calculate all possible index of the handle name of Mr.X when you sort N+1 handle names (S_1, S_2, ..., S_N and T) in lexicographical order.
Note: If there are pair of people with same handle name, either one may come first.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Example
Input
2
tourist
petr
e
Output
1 | instruction | 0 | 32,370 | 18 | 64,740 |
"Correct Solution:
```
def list_rindex(li, x):
for i in reversed(range(len(li))):
if li[i] == x:
return i
raise ValueError("{} is not in list".format(x))
N = int(input())
S = [input() for _ in range(N)]
T = input()
aS = [s.replace("?", "a") for s in S] + [T]
zS = [s.replace("?", "z") for s in S] + [T]
aS.sort()
zS.sort()
asf = list_rindex(aS, T)
zsf = zS.index(T)
ans = [i for i in range(zsf + 1, asf + 2)]
print(*ans)
``` | output | 1 | 32,370 | 18 | 64,741 |
Provide a correct Python 3 solution for this coding contest problem.
Mr.X, who the handle name is T, looked at the list which written N handle names, S_1, S_2, ..., S_N.
But he couldn't see some parts of the list. Invisible part is denoted `?`.
Please calculate all possible index of the handle name of Mr.X when you sort N+1 handle names (S_1, S_2, ..., S_N and T) in lexicographical order.
Note: If there are pair of people with same handle name, either one may come first.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Example
Input
2
tourist
petr
e
Output
1 | instruction | 0 | 32,371 | 18 | 64,742 |
"Correct Solution:
```
n = int(input())
s_list = list()
for i in range(n):
s_list.append(input())
t = input()
s_list_a = [s.replace("?","a") for s in s_list]
s_list_a.append(t)
s_list_a.sort()
index_a = [i+1 for i,x in enumerate(s_list_a) if x == t]
s_list_z = [s.replace("?","z") for s in s_list]
s_list_z.append(t)
s_list_z.sort()
index_z = [i+1 for i,x in enumerate(s_list_z) if x == t]
indexes = [str(i) for i in range(index_z[0],index_a[-1]+1)]
answer = ' '.join(indexes)
print(answer)
``` | output | 1 | 32,371 | 18 | 64,743 |
Provide a correct Python 3 solution for this coding contest problem.
Mr.X, who the handle name is T, looked at the list which written N handle names, S_1, S_2, ..., S_N.
But he couldn't see some parts of the list. Invisible part is denoted `?`.
Please calculate all possible index of the handle name of Mr.X when you sort N+1 handle names (S_1, S_2, ..., S_N and T) in lexicographical order.
Note: If there are pair of people with same handle name, either one may come first.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Example
Input
2
tourist
petr
e
Output
1 | instruction | 0 | 32,372 | 18 | 64,744 |
"Correct Solution:
```
N = int(input())
S = [(input(), 0) for i in range(N)]
t = (input(), 1)
S += t,
S.sort(key=lambda x: (x[0].replace(*'?z'), 1^x[1]))
l = S.index(t)+1
S.sort(key=lambda x: (x[0].replace(*'?a'), x[1]))
r = S.index(t)+1
print(*range(l, r+1))
``` | output | 1 | 32,372 | 18 | 64,745 |
Provide a correct Python 3 solution for this coding contest problem.
Mr.X, who the handle name is T, looked at the list which written N handle names, S_1, S_2, ..., S_N.
But he couldn't see some parts of the list. Invisible part is denoted `?`.
Please calculate all possible index of the handle name of Mr.X when you sort N+1 handle names (S_1, S_2, ..., S_N and T) in lexicographical order.
Note: If there are pair of people with same handle name, either one may come first.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Example
Input
2
tourist
petr
e
Output
1 | instruction | 0 | 32,373 | 18 | 64,746 |
"Correct Solution:
```
n = int(input())
s = []
for i in range(n):
s.append(input())
t = input()
before = 0
after = 0
for i in s:
if t < i.replace('?','a'):
after += 1
if i.replace('?','z') < t:
before += 1
print(*range(before+1,n-after+2))
``` | output | 1 | 32,373 | 18 | 64,747 |
Provide a correct Python 3 solution for this coding contest problem.
Mr.X, who the handle name is T, looked at the list which written N handle names, S_1, S_2, ..., S_N.
But he couldn't see some parts of the list. Invisible part is denoted `?`.
Please calculate all possible index of the handle name of Mr.X when you sort N+1 handle names (S_1, S_2, ..., S_N and T) in lexicographical order.
Note: If there are pair of people with same handle name, either one may come first.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Example
Input
2
tourist
petr
e
Output
1 | instruction | 0 | 32,374 | 18 | 64,748 |
"Correct Solution:
```
n = int(input())
l = [input() for _ in range(n)]
t = input(); l.append(t)
li = list(map(lambda x:x.replace('?', 'A'), l))
ho = list(map(lambda x:x.replace('?', 'z'), l))
li.sort(reverse=True); ho.sort()
x = n - li.index(t); y = ho.index(t)
print(' '.join(map(str, list(range(y+1,x+2)))))
``` | output | 1 | 32,374 | 18 | 64,749 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr.X, who the handle name is T, looked at the list which written N handle names, S_1, S_2, ..., S_N.
But he couldn't see some parts of the list. Invisible part is denoted `?`.
Please calculate all possible index of the handle name of Mr.X when you sort N+1 handle names (S_1, S_2, ..., S_N and T) in lexicographical order.
Note: If there are pair of people with same handle name, either one may come first.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Example
Input
2
tourist
petr
e
Output
1
Submitted Solution:
```
n = int(input())
a,z = [],[]
for _ in range(n):
s = input()
a.append(s.replace("?","a"))
z.append(s.replace("?","z"))
t = input()
a.append(t)
z.append(t)
a,z = sorted(a)[::-1],sorted(z)
r,l = n+1-a.index(t),z.index(t)+1
for i in range(l,r): print(i,end=" ")
print(r)
``` | instruction | 0 | 32,375 | 18 | 64,750 |
Yes | output | 1 | 32,375 | 18 | 64,751 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr.X, who the handle name is T, looked at the list which written N handle names, S_1, S_2, ..., S_N.
But he couldn't see some parts of the list. Invisible part is denoted `?`.
Please calculate all possible index of the handle name of Mr.X when you sort N+1 handle names (S_1, S_2, ..., S_N and T) in lexicographical order.
Note: If there are pair of people with same handle name, either one may come first.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Example
Input
2
tourist
petr
e
Output
1
Submitted Solution:
```
n = int(input())
l = [input() for _ in range(n)]
s = input()
def small(l, s):
p = [s > i.replace('?', 'z') for i in l]
return sum(p)
def big(l, s):
p = [s >= i.replace('?', 'a') for i in l]
return sum(p)
print(*list(range(small(l, s) + 1, big(l, s) + 2)))
``` | instruction | 0 | 32,376 | 18 | 64,752 |
Yes | output | 1 | 32,376 | 18 | 64,753 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr.X, who the handle name is T, looked at the list which written N handle names, S_1, S_2, ..., S_N.
But he couldn't see some parts of the list. Invisible part is denoted `?`.
Please calculate all possible index of the handle name of Mr.X when you sort N+1 handle names (S_1, S_2, ..., S_N and T) in lexicographical order.
Note: If there are pair of people with same handle name, either one may come first.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Example
Input
2
tourist
petr
e
Output
1
Submitted Solution:
```
def LI(): return list(map(int,input().split()))
N,K = LI()
a = LI()
ans = float('INF')
for i in range(2**(N-1)):
bit = [i>>j&1 for j in range(N-1)]
if K-1!=sum(bit):
continue
cost,kijun = 0,a[0]
for k in range(N-1):
if bit[k]==0:
kijun = max(kijun,a[k+1])
else:
if a[k+1]>=kijun+1:
kijun = a[k+1]
continue
cost += (kijun+1)-a[k+1]
kijun += 1
ans = min(ans,cost)
print(ans)
``` | instruction | 0 | 32,380 | 18 | 64,760 |
No | output | 1 | 32,380 | 18 | 64,761 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr.X, who the handle name is T, looked at the list which written N handle names, S_1, S_2, ..., S_N.
But he couldn't see some parts of the list. Invisible part is denoted `?`.
Please calculate all possible index of the handle name of Mr.X when you sort N+1 handle names (S_1, S_2, ..., S_N and T) in lexicographical order.
Note: If there are pair of people with same handle name, either one may come first.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Output
* Calculate the possible index and print in sorted order. The output should be separated with a space. Don't print a space after last number.
* Put a line break in the end.
Constraints
* 1 ≤ N ≤ 10000
* 1 ≤ |S_i|, |T| ≤ 20 (|A| is the length of A.)
* S_i consists from lower-case alphabet and `?`.
* T consists from lower-case alphabet.
Scoring
Subtask 1 [ 130 points ]
* There are no `?`'s.
Subtask 2 [ 120 points ]
* There are no additional constraints.
Input
The input is given from standard input in the following format.
N
S_1
S_2
:
S_N
T
Example
Input
2
tourist
petr
e
Output
1
Submitted Solution:
```
n, k = map(int, input().split())
a = list(map(int, input().split()))
min_cost = float("inf")
for i in range(2**n):
if bin(i).count("1") != k:
continue
min_h = a[0]
cost = 0
for j in range(1, n):
if i >> j & 1:
min_h += 1
cost += max(0, min_h-a[j])
min_h = max(min_h, a[j])
min_cost = min(min_cost, cost)
print(min_cost)
``` | instruction | 0 | 32,381 | 18 | 64,762 |
No | output | 1 | 32,381 | 18 | 64,763 |
Provide a correct Python 3 solution for this coding contest problem.
In cryptography, Caesar cipher is one of the simplest and most widely known encryption method. Caesar cipher is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, 'a' would be replaced by 'b', 'b' would become 'c', 'y' would become 'z', 'z' would become 'a', and so on. In that case, a text:
this is a pen
is would become:
uijt jt b qfo
Write a program which reads a text encrypted by Caesar Chipher and prints the corresponding decoded text. The number of shift is secret and it depends on datasets, but you can assume that the decoded text includes any of the following words: "the", "this", or "that".
Input
Input consists of several datasets. Each dataset consists of texts in a line. Input ends with EOF. The text consists of lower-case letters, periods, space, and end-of-lines. Only the letters have been encrypted. A line consists of at most 80 characters.
You may assume that you can create one decoded text which includes any of "the", "this", or "that" from the given input text.
The number of datasets is less than or equal to 20.
Output
Print decoded texts in a line.
Example
Input
xlmw mw xli tmgxyvi xlex m xsso mr xli xvmt.
Output
this is the picture that i took in the trip. | instruction | 0 | 32,386 | 18 | 64,772 |
"Correct Solution:
```
#!/usr/bin/env python
import sys
import re
def move(char, num):
if ord(char) + num <= ord('z'):
return ord(char) + num
else:
return ord(char) + num - (ord('z') - ord('a') + 1)
def shift(s, num):
new = ""
for i in range(0, len(s)):
if s[i].isalpha():
new += str(chr(move(s[i], num)));
else:
new += s[i]
return new
def decrypt(s):
for i in range(0, 26):
decrypted = shift(s, i)
if re.search('the|this|that', decrypted):
return decrypted
if __name__ == '__main__':
lines = []
for line in sys.stdin:
lines.append(line)
for line in lines:
print(decrypt(line), end="")
``` | output | 1 | 32,386 | 18 | 64,773 |
Provide a correct Python 3 solution for this coding contest problem.
In cryptography, Caesar cipher is one of the simplest and most widely known encryption method. Caesar cipher is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, 'a' would be replaced by 'b', 'b' would become 'c', 'y' would become 'z', 'z' would become 'a', and so on. In that case, a text:
this is a pen
is would become:
uijt jt b qfo
Write a program which reads a text encrypted by Caesar Chipher and prints the corresponding decoded text. The number of shift is secret and it depends on datasets, but you can assume that the decoded text includes any of the following words: "the", "this", or "that".
Input
Input consists of several datasets. Each dataset consists of texts in a line. Input ends with EOF. The text consists of lower-case letters, periods, space, and end-of-lines. Only the letters have been encrypted. A line consists of at most 80 characters.
You may assume that you can create one decoded text which includes any of "the", "this", or "that" from the given input text.
The number of datasets is less than or equal to 20.
Output
Print decoded texts in a line.
Example
Input
xlmw mw xli tmgxyvi xlex m xsso mr xli xvmt.
Output
this is the picture that i took in the trip. | instruction | 0 | 32,387 | 18 | 64,774 |
"Correct Solution:
```
import sys
a='abcdefghijklmnopqrstuvwxyz'
for b in sys.stdin:
b=b.strip()
for i in range(26):
c=''.join(a[ord(e)-97-i]if e in a else e for e in b)
if any(('the'in c,'this'in c,'that'in c)):print(c)
``` | output | 1 | 32,387 | 18 | 64,775 |
Provide a correct Python 3 solution for this coding contest problem.
In cryptography, Caesar cipher is one of the simplest and most widely known encryption method. Caesar cipher is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, 'a' would be replaced by 'b', 'b' would become 'c', 'y' would become 'z', 'z' would become 'a', and so on. In that case, a text:
this is a pen
is would become:
uijt jt b qfo
Write a program which reads a text encrypted by Caesar Chipher and prints the corresponding decoded text. The number of shift is secret and it depends on datasets, but you can assume that the decoded text includes any of the following words: "the", "this", or "that".
Input
Input consists of several datasets. Each dataset consists of texts in a line. Input ends with EOF. The text consists of lower-case letters, periods, space, and end-of-lines. Only the letters have been encrypted. A line consists of at most 80 characters.
You may assume that you can create one decoded text which includes any of "the", "this", or "that" from the given input text.
The number of datasets is less than or equal to 20.
Output
Print decoded texts in a line.
Example
Input
xlmw mw xli tmgxyvi xlex m xsso mr xli xvmt.
Output
this is the picture that i took in the trip. | instruction | 0 | 32,388 | 18 | 64,776 |
"Correct Solution:
```
s = []
while True:
try:
s.append(input())
except:
break
for e in range(len(s)):
st = list(map(str,s[e]))
t = []
for c in st:
t.append(ord(c))
for i in range(26):
string = ''
for j in range(len(st)):
if t[j] >= 97 and 122 >= t[j]:
l = 97 + ((t[j] - 97 + i) % 26)
string += chr(l)
else:
string += chr(t[j])
if 'this' in string or 'the' in string or 'that' in string:
print(string)
``` | output | 1 | 32,388 | 18 | 64,777 |
Provide a correct Python 3 solution for this coding contest problem.
In cryptography, Caesar cipher is one of the simplest and most widely known encryption method. Caesar cipher is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, 'a' would be replaced by 'b', 'b' would become 'c', 'y' would become 'z', 'z' would become 'a', and so on. In that case, a text:
this is a pen
is would become:
uijt jt b qfo
Write a program which reads a text encrypted by Caesar Chipher and prints the corresponding decoded text. The number of shift is secret and it depends on datasets, but you can assume that the decoded text includes any of the following words: "the", "this", or "that".
Input
Input consists of several datasets. Each dataset consists of texts in a line. Input ends with EOF. The text consists of lower-case letters, periods, space, and end-of-lines. Only the letters have been encrypted. A line consists of at most 80 characters.
You may assume that you can create one decoded text which includes any of "the", "this", or "that" from the given input text.
The number of datasets is less than or equal to 20.
Output
Print decoded texts in a line.
Example
Input
xlmw mw xli tmgxyvi xlex m xsso mr xli xvmt.
Output
this is the picture that i took in the trip. | instruction | 0 | 32,389 | 18 | 64,778 |
"Correct Solution:
```
import sys
for s in map(lambda l: list(l.rstrip()), sys.stdin.readlines()):
while True:
for i, c in enumerate(s):
char_code = ord(c)
if 97 <= char_code <= 122:
char_code = char_code+1 if char_code < 122 else 97
s[i] = chr(char_code)
_s = "".join(s)
if "this" in _s or "the" in _s or "that" in _s:
print(_s)
break
``` | output | 1 | 32,389 | 18 | 64,779 |
Provide a correct Python 3 solution for this coding contest problem.
In cryptography, Caesar cipher is one of the simplest and most widely known encryption method. Caesar cipher is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, 'a' would be replaced by 'b', 'b' would become 'c', 'y' would become 'z', 'z' would become 'a', and so on. In that case, a text:
this is a pen
is would become:
uijt jt b qfo
Write a program which reads a text encrypted by Caesar Chipher and prints the corresponding decoded text. The number of shift is secret and it depends on datasets, but you can assume that the decoded text includes any of the following words: "the", "this", or "that".
Input
Input consists of several datasets. Each dataset consists of texts in a line. Input ends with EOF. The text consists of lower-case letters, periods, space, and end-of-lines. Only the letters have been encrypted. A line consists of at most 80 characters.
You may assume that you can create one decoded text which includes any of "the", "this", or "that" from the given input text.
The number of datasets is less than or equal to 20.
Output
Print decoded texts in a line.
Example
Input
xlmw mw xli tmgxyvi xlex m xsso mr xli xvmt.
Output
this is the picture that i took in the trip. | instruction | 0 | 32,390 | 18 | 64,780 |
"Correct Solution:
```
# Caesar Cipher
s = input()
while 1:
for diff in range(0,26):
dec = []
for c in s:
chn = ord(c)
if 97 <= chn < 97+26:
chn -= 97 + diff
chn = (chn % 26) + 97
dec.append(chr(chn))
else: dec.append(c)
ss = ''.join(dec)
if 'the' in ss or 'that' in ss or 'this' in ss:
print(ss)
break
try: s = input()
except EOFError: break
``` | output | 1 | 32,390 | 18 | 64,781 |
Provide a correct Python 3 solution for this coding contest problem.
In cryptography, Caesar cipher is one of the simplest and most widely known encryption method. Caesar cipher is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, 'a' would be replaced by 'b', 'b' would become 'c', 'y' would become 'z', 'z' would become 'a', and so on. In that case, a text:
this is a pen
is would become:
uijt jt b qfo
Write a program which reads a text encrypted by Caesar Chipher and prints the corresponding decoded text. The number of shift is secret and it depends on datasets, but you can assume that the decoded text includes any of the following words: "the", "this", or "that".
Input
Input consists of several datasets. Each dataset consists of texts in a line. Input ends with EOF. The text consists of lower-case letters, periods, space, and end-of-lines. Only the letters have been encrypted. A line consists of at most 80 characters.
You may assume that you can create one decoded text which includes any of "the", "this", or "that" from the given input text.
The number of datasets is less than or equal to 20.
Output
Print decoded texts in a line.
Example
Input
xlmw mw xli tmgxyvi xlex m xsso mr xli xvmt.
Output
this is the picture that i took in the trip. | instruction | 0 | 32,391 | 18 | 64,782 |
"Correct Solution:
```
import sys
def l(s,n):
o=ord(s.lower())
if not 97<=o<=122:
return s
if 97<=o+n<=122:
if 97<=ord(s)<=122:
return chr(o+n)
else:
return chr(o+n).upper()
elif o+n>122:
if 97<=ord(s)<=122:
return chr(o+n-26)
else:
return chr(o+n-26).upper()
else:
if 97<=ord(s)<=122:
return chr(o+n+26)
else:
return chr(o+n+26).upper()
for t in sys.stdin:
s=t[:-1]
u=s.lower()
for i in range(0,26):
cv=lambda y:"".join(map(lambda x:l(x,i),y))
if cv("this") in u or cv("that") in u or cv("the") in u:
break
print("".join(map(lambda x:l(x,-i),s)))
``` | output | 1 | 32,391 | 18 | 64,783 |
Provide a correct Python 3 solution for this coding contest problem.
In cryptography, Caesar cipher is one of the simplest and most widely known encryption method. Caesar cipher is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, 'a' would be replaced by 'b', 'b' would become 'c', 'y' would become 'z', 'z' would become 'a', and so on. In that case, a text:
this is a pen
is would become:
uijt jt b qfo
Write a program which reads a text encrypted by Caesar Chipher and prints the corresponding decoded text. The number of shift is secret and it depends on datasets, but you can assume that the decoded text includes any of the following words: "the", "this", or "that".
Input
Input consists of several datasets. Each dataset consists of texts in a line. Input ends with EOF. The text consists of lower-case letters, periods, space, and end-of-lines. Only the letters have been encrypted. A line consists of at most 80 characters.
You may assume that you can create one decoded text which includes any of "the", "this", or "that" from the given input text.
The number of datasets is less than or equal to 20.
Output
Print decoded texts in a line.
Example
Input
xlmw mw xli tmgxyvi xlex m xsso mr xli xvmt.
Output
this is the picture that i took in the trip. | instruction | 0 | 32,392 | 18 | 64,784 |
"Correct Solution:
```
while True:
try:
s = input()
for i in range(27):
ans = ""
for j in range(len(s)):
ch = s[j]
if "a" <= ch <= "z":
ans += chr((ord(ch) - ord("a") + i)%26 + ord("a"))
else:
ans += ch
if "this" in ans or "that" in ans or"the" in ans:
print(ans)
break
except:
break
``` | output | 1 | 32,392 | 18 | 64,785 |
Provide a correct Python 3 solution for this coding contest problem.
In cryptography, Caesar cipher is one of the simplest and most widely known encryption method. Caesar cipher is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, 'a' would be replaced by 'b', 'b' would become 'c', 'y' would become 'z', 'z' would become 'a', and so on. In that case, a text:
this is a pen
is would become:
uijt jt b qfo
Write a program which reads a text encrypted by Caesar Chipher and prints the corresponding decoded text. The number of shift is secret and it depends on datasets, but you can assume that the decoded text includes any of the following words: "the", "this", or "that".
Input
Input consists of several datasets. Each dataset consists of texts in a line. Input ends with EOF. The text consists of lower-case letters, periods, space, and end-of-lines. Only the letters have been encrypted. A line consists of at most 80 characters.
You may assume that you can create one decoded text which includes any of "the", "this", or "that" from the given input text.
The number of datasets is less than or equal to 20.
Output
Print decoded texts in a line.
Example
Input
xlmw mw xli tmgxyvi xlex m xsso mr xli xvmt.
Output
this is the picture that i took in the trip. | instruction | 0 | 32,393 | 18 | 64,786 |
"Correct Solution:
```
def chg(s,n):
res=""
for i in s:
o=ord(i)
if 97<=o<=122:
if o+n<=122:
res+=chr(o+n)
else:
res+=chr(o+n-26)
else:
res+=i
return res
while True:
try:
s=input()
for i in range(25,-1,-1):
c=chg(s,i)
e=c.split()
if "the" in e or "this" in e or "that" in e:
print(c)
break
except:
break
``` | output | 1 | 32,393 | 18 | 64,787 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In cryptography, Caesar cipher is one of the simplest and most widely known encryption method. Caesar cipher is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, 'a' would be replaced by 'b', 'b' would become 'c', 'y' would become 'z', 'z' would become 'a', and so on. In that case, a text:
this is a pen
is would become:
uijt jt b qfo
Write a program which reads a text encrypted by Caesar Chipher and prints the corresponding decoded text. The number of shift is secret and it depends on datasets, but you can assume that the decoded text includes any of the following words: "the", "this", or "that".
Input
Input consists of several datasets. Each dataset consists of texts in a line. Input ends with EOF. The text consists of lower-case letters, periods, space, and end-of-lines. Only the letters have been encrypted. A line consists of at most 80 characters.
You may assume that you can create one decoded text which includes any of "the", "this", or "that" from the given input text.
The number of datasets is less than or equal to 20.
Output
Print decoded texts in a line.
Example
Input
xlmw mw xli tmgxyvi xlex m xsso mr xli xvmt.
Output
this is the picture that i took in the trip.
Submitted Solution:
```
a='abcdefghijklmnopqrstuvwxyz'
while 1:
try:s=input()
except:break
for i in range(1,27):
b=''
for x in s:
b+=a[a.index(x)-i]if x in a else x
if 'the' in b or 'this' in b or 'that' in b:print(b);break
``` | instruction | 0 | 32,394 | 18 | 64,788 |
Yes | output | 1 | 32,394 | 18 | 64,789 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In cryptography, Caesar cipher is one of the simplest and most widely known encryption method. Caesar cipher is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, 'a' would be replaced by 'b', 'b' would become 'c', 'y' would become 'z', 'z' would become 'a', and so on. In that case, a text:
this is a pen
is would become:
uijt jt b qfo
Write a program which reads a text encrypted by Caesar Chipher and prints the corresponding decoded text. The number of shift is secret and it depends on datasets, but you can assume that the decoded text includes any of the following words: "the", "this", or "that".
Input
Input consists of several datasets. Each dataset consists of texts in a line. Input ends with EOF. The text consists of lower-case letters, periods, space, and end-of-lines. Only the letters have been encrypted. A line consists of at most 80 characters.
You may assume that you can create one decoded text which includes any of "the", "this", or "that" from the given input text.
The number of datasets is less than or equal to 20.
Output
Print decoded texts in a line.
Example
Input
xlmw mw xli tmgxyvi xlex m xsso mr xli xvmt.
Output
this is the picture that i took in the trip.
Submitted Solution:
```
A = 'abcdefghijklmnopqrstuvwxyz'
while True:
try: s = input()
except: exit()
for x in range(1, 27):
ans = s[:-1].translate(str.maketrans(A, A[x:] + A[:x]))
if 'the' in ans or 'this' in ans or 'that' in ans:
print(ans + '.')
break
``` | instruction | 0 | 32,395 | 18 | 64,790 |
Yes | output | 1 | 32,395 | 18 | 64,791 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In cryptography, Caesar cipher is one of the simplest and most widely known encryption method. Caesar cipher is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, 'a' would be replaced by 'b', 'b' would become 'c', 'y' would become 'z', 'z' would become 'a', and so on. In that case, a text:
this is a pen
is would become:
uijt jt b qfo
Write a program which reads a text encrypted by Caesar Chipher and prints the corresponding decoded text. The number of shift is secret and it depends on datasets, but you can assume that the decoded text includes any of the following words: "the", "this", or "that".
Input
Input consists of several datasets. Each dataset consists of texts in a line. Input ends with EOF. The text consists of lower-case letters, periods, space, and end-of-lines. Only the letters have been encrypted. A line consists of at most 80 characters.
You may assume that you can create one decoded text which includes any of "the", "this", or "that" from the given input text.
The number of datasets is less than or equal to 20.
Output
Print decoded texts in a line.
Example
Input
xlmw mw xli tmgxyvi xlex m xsso mr xli xvmt.
Output
this is the picture that i took in the trip.
Submitted Solution:
```
while True:
try:
strings=input()
for i in range(26):
_strings=""
for s in strings:
if ord('a')<=ord(s) and ord(s)<=ord('z'):
_strings+=chr((ord(s)-ord('a')+1)%26+ord('a'))
else:
_strings+=s
strings=_strings
if "the" in strings or "this" in strings or "that" in strings:
print(strings)
break
except EOFError:
break
``` | instruction | 0 | 32,396 | 18 | 64,792 |
Yes | output | 1 | 32,396 | 18 | 64,793 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In cryptography, Caesar cipher is one of the simplest and most widely known encryption method. Caesar cipher is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, 'a' would be replaced by 'b', 'b' would become 'c', 'y' would become 'z', 'z' would become 'a', and so on. In that case, a text:
this is a pen
is would become:
uijt jt b qfo
Write a program which reads a text encrypted by Caesar Chipher and prints the corresponding decoded text. The number of shift is secret and it depends on datasets, but you can assume that the decoded text includes any of the following words: "the", "this", or "that".
Input
Input consists of several datasets. Each dataset consists of texts in a line. Input ends with EOF. The text consists of lower-case letters, periods, space, and end-of-lines. Only the letters have been encrypted. A line consists of at most 80 characters.
You may assume that you can create one decoded text which includes any of "the", "this", or "that" from the given input text.
The number of datasets is less than or equal to 20.
Output
Print decoded texts in a line.
Example
Input
xlmw mw xli tmgxyvi xlex m xsso mr xli xvmt.
Output
this is the picture that i took in the trip.
Submitted Solution:
```
import string
while(1):
try:
text = input()
words = text.split()
stop = 0
for i in range(26):
if stop == 1:
break
a = []
b = []
for j in words:
a.append("".join([chr((ord(k) + i - ord("a")) % 26 + ord("a")) if ord(k) >= ord("a") else k for k in j]))
b.append("".join([chr((ord(k) + i - ord("a")) % 26 + ord("a")) for k in j if ord(k) >= ord("a")]))
for j in b:
if j in ["this","that","the"]:
print(" ".join(a))
stop = 1
break
except EOFError:
break
``` | instruction | 0 | 32,397 | 18 | 64,794 |
Yes | output | 1 | 32,397 | 18 | 64,795 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In cryptography, Caesar cipher is one of the simplest and most widely known encryption method. Caesar cipher is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, 'a' would be replaced by 'b', 'b' would become 'c', 'y' would become 'z', 'z' would become 'a', and so on. In that case, a text:
this is a pen
is would become:
uijt jt b qfo
Write a program which reads a text encrypted by Caesar Chipher and prints the corresponding decoded text. The number of shift is secret and it depends on datasets, but you can assume that the decoded text includes any of the following words: "the", "this", or "that".
Input
Input consists of several datasets. Each dataset consists of texts in a line. Input ends with EOF. The text consists of lower-case letters, periods, space, and end-of-lines. Only the letters have been encrypted. A line consists of at most 80 characters.
You may assume that you can create one decoded text which includes any of "the", "this", or "that" from the given input text.
The number of datasets is less than or equal to 20.
Output
Print decoded texts in a line.
Example
Input
xlmw mw xli tmgxyvi xlex m xsso mr xli xvmt.
Output
this is the picture that i took in the trip.
Submitted Solution:
```
import string
import sys
alpha = string.ascii_lowercase
for line in sys.stdin:
for i in range(len(alpha)):
cipher_str = ""
for s in line:
if s in alpha:
cipher_str += alpha[(alpha.index(s)+i) % len(alpha)]
else:
cipher_str += s
if ("the" or "this" or "that") in cipher_str:
print(cipher_str, end="")
break
else:
print(line, end="")
``` | instruction | 0 | 32,398 | 18 | 64,796 |
No | output | 1 | 32,398 | 18 | 64,797 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In cryptography, Caesar cipher is one of the simplest and most widely known encryption method. Caesar cipher is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, 'a' would be replaced by 'b', 'b' would become 'c', 'y' would become 'z', 'z' would become 'a', and so on. In that case, a text:
this is a pen
is would become:
uijt jt b qfo
Write a program which reads a text encrypted by Caesar Chipher and prints the corresponding decoded text. The number of shift is secret and it depends on datasets, but you can assume that the decoded text includes any of the following words: "the", "this", or "that".
Input
Input consists of several datasets. Each dataset consists of texts in a line. Input ends with EOF. The text consists of lower-case letters, periods, space, and end-of-lines. Only the letters have been encrypted. A line consists of at most 80 characters.
You may assume that you can create one decoded text which includes any of "the", "this", or "that" from the given input text.
The number of datasets is less than or equal to 20.
Output
Print decoded texts in a line.
Example
Input
xlmw mw xli tmgxyvi xlex m xsso mr xli xvmt.
Output
this is the picture that i took in the trip.
Submitted Solution:
```
def dec(text,d):
r=[]
for i in text:
c=ord(i)
if c<65:r.append(i)
elif c<91:r.append(chr((c-65+d)%26+65))
else:r.append(chr((c-97+d)%26+97))
return "".join(r)
while True:
try:raw=input()
except:break
if raw=="":break
for i in range(25):
d=dec(raw,i+1)
if sum([1 for i in ["the","this","that"] if i in d])>0:break
print(d)
``` | instruction | 0 | 32,399 | 18 | 64,798 |
No | output | 1 | 32,399 | 18 | 64,799 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In cryptography, Caesar cipher is one of the simplest and most widely known encryption method. Caesar cipher is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, 'a' would be replaced by 'b', 'b' would become 'c', 'y' would become 'z', 'z' would become 'a', and so on. In that case, a text:
this is a pen
is would become:
uijt jt b qfo
Write a program which reads a text encrypted by Caesar Chipher and prints the corresponding decoded text. The number of shift is secret and it depends on datasets, but you can assume that the decoded text includes any of the following words: "the", "this", or "that".
Input
Input consists of several datasets. Each dataset consists of texts in a line. Input ends with EOF. The text consists of lower-case letters, periods, space, and end-of-lines. Only the letters have been encrypted. A line consists of at most 80 characters.
You may assume that you can create one decoded text which includes any of "the", "this", or "that" from the given input text.
The number of datasets is less than or equal to 20.
Output
Print decoded texts in a line.
Example
Input
xlmw mw xli tmgxyvi xlex m xsso mr xli xvmt.
Output
this is the picture that i took in the trip.
Submitted Solution:
```
while(1):
try:
x = [i for i in input()]
s=0
while(s<len(x)):
k=s
while(x[k]!='.' and x[k]!='\n'):
k=k+1
k=k+1
n=[ i for i in range(k-s)]
p=122-ord(x[s])
m=ord(x[s])-97
flag=0
for i in range(p+1):
for j in range(s,k):
if x[j]==' ' or x[j]=='.':
n[j-s]=x[j]
else:
n[j-s]=chr(ord(x[j])+i)
moji=''
for mk in n:
moji += mk
if moji.find('that')!=-1 or moji.find('this')!=-1 or moji.find('the')!=-1 :
flag=1
print(moji,end="")
if flag==0:
for i in range(m+1):
for j in range(s,k):
if x[j]==' ' or x[j]=='.':
n[j-s]=x[j]
else:
n[j-s]=chr(ord(x[j])-i)
moji=''
for mk in n:
moji += mk
if moji.find('that')!=-1 or moji.find('this')!=-1 or moji.find('the')!=-1 :
print(moji,end="")
s=k
print("")
except EOFError:
break
``` | instruction | 0 | 32,400 | 18 | 64,800 |
No | output | 1 | 32,400 | 18 | 64,801 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.