input stringlengths 1 8.57k | output stringlengths 2 5.65k |
|---|---|
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
This contest, AtCoder Beginner Contest, is abbreviated as ABC.
When we refer to a specific round of ABC, a three-digit number is appended after ABC. For example, ABC680 is the 680th round of ABC.
What is the abbreviation for the N-th round of ABC? Write a program to output the answer.
Constraints
* 100 ≤ N ≤ 999
Input
Input is given from Standard Input in the following format:
N
Output
Print the abbreviation for the N-th round of ABC.
Examples
Input
100
Output
ABC100
Input
425
Output
ABC425
Input
999
Output
ABC999
### Response:
| "Correct Solution:
```
n = input()
print('ABC' + str(n))
``` |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
This contest, AtCoder Beginner Contest, is abbreviated as ABC.
When we refer to a specific round of ABC, a three-digit number is appended after ABC. For example, ABC680 is the 680th round of ABC.
What is the abbreviation for the N-th round of ABC? Write a program to output the answer.
Constraints
* 100 ≤ N ≤ 999
Input
Input is given from Standard Input in the following format:
N
Output
Print the abbreviation for the N-th round of ABC.
Examples
Input
100
Output
ABC100
Input
425
Output
ABC425
Input
999
Output
ABC999
### Response:
| "Correct Solution:
```
print("ABC{0}".format(input()))
``` |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
This contest, AtCoder Beginner Contest, is abbreviated as ABC.
When we refer to a specific round of ABC, a three-digit number is appended after ABC. For example, ABC680 is the 680th round of ABC.
What is the abbreviation for the N-th round of ABC? Write a program to output the answer.
Constraints
* 100 ≤ N ≤ 999
Input
Input is given from Standard Input in the following format:
N
Output
Print the abbreviation for the N-th round of ABC.
Examples
Input
100
Output
ABC100
Input
425
Output
ABC425
Input
999
Output
ABC999
### Response:
| "Correct Solution:
```
n = input()
s = 'ABC' + n
print(s)
``` |
### Instruction:
Provide tags and a correct Python 3 solution for this coding contest problem.
You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length.
The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th character of s1 and the i-th character of s2.
For example, f("ab", "ba") = "aa", and f("nzwzl", "zizez") = "niwel".
You found two strings x and y of the same length and consisting of only lowercase English letters. Find any string z such that f(x, z) = y, or print -1 if no such string z exists.
Input
The first line of input contains the string x.
The second line of input contains the string y.
Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.
Output
If there is no string z such that f(x, z) = y, print -1.
Otherwise, print a string z such that f(x, z) = y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.
Examples
Input
ab
aa
Output
ba
Input
nzwzl
niwel
Output
xiyez
Input
ab
ba
Output
-1
Note
The first case is from the statement.
Another solution for the second case is "zizez"
There is no solution for the third case. That is, there is no z such that f("ab", z) = "ba".
### Response:
| Tags: constructive algorithms, greedy, strings
Correct Solution:
```
a=input()
b=input()
ans=""
for i in range(len(a)):
if a[i]==b[i]:
ans+=a[i]
elif a[i]>b[i]:
ans+=b[i]
else:
print(-1)
exit(0);
print(ans)
``` |
### Instruction:
Provide tags and a correct Python 3 solution for this coding contest problem.
You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length.
The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th character of s1 and the i-th character of s2.
For example, f("ab", "ba") = "aa", and f("nzwzl", "zizez") = "niwel".
You found two strings x and y of the same length and consisting of only lowercase English letters. Find any string z such that f(x, z) = y, or print -1 if no such string z exists.
Input
The first line of input contains the string x.
The second line of input contains the string y.
Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.
Output
If there is no string z such that f(x, z) = y, print -1.
Otherwise, print a string z such that f(x, z) = y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.
Examples
Input
ab
aa
Output
ba
Input
nzwzl
niwel
Output
xiyez
Input
ab
ba
Output
-1
Note
The first case is from the statement.
Another solution for the second case is "zizez"
There is no solution for the third case. That is, there is no z such that f("ab", z) = "ba".
### Response:
| Tags: constructive algorithms, greedy, strings
Correct Solution:
```
arg =input()
res =input()
if arg < res:
print ("-1")
quit()
b =""
for i in range(len(arg)):
if arg[i] < res[i]:
print ("-1")
quit()
elif arg[i] == res[i]:b+=str(arg[i])
elif arg[i] > res[i]:b+=str(res[i])
print (b)
``` |
### Instruction:
Provide tags and a correct Python 3 solution for this coding contest problem.
You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length.
The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th character of s1 and the i-th character of s2.
For example, f("ab", "ba") = "aa", and f("nzwzl", "zizez") = "niwel".
You found two strings x and y of the same length and consisting of only lowercase English letters. Find any string z such that f(x, z) = y, or print -1 if no such string z exists.
Input
The first line of input contains the string x.
The second line of input contains the string y.
Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.
Output
If there is no string z such that f(x, z) = y, print -1.
Otherwise, print a string z such that f(x, z) = y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.
Examples
Input
ab
aa
Output
ba
Input
nzwzl
niwel
Output
xiyez
Input
ab
ba
Output
-1
Note
The first case is from the statement.
Another solution for the second case is "zizez"
There is no solution for the third case. That is, there is no z such that f("ab", z) = "ba".
### Response:
| Tags: constructive algorithms, greedy, strings
Correct Solution:
```
word1 = input()
word2 = input()
store = ''
for i in range(len(word1)):
if ord(word1[i]) >= ord(word2[i]):
store = store + word2[i]
else:
store = '-1'
break
# else:
# store = store + word1[i]
print(store)
``` |
### Instruction:
Provide tags and a correct Python 3 solution for this coding contest problem.
You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length.
The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th character of s1 and the i-th character of s2.
For example, f("ab", "ba") = "aa", and f("nzwzl", "zizez") = "niwel".
You found two strings x and y of the same length and consisting of only lowercase English letters. Find any string z such that f(x, z) = y, or print -1 if no such string z exists.
Input
The first line of input contains the string x.
The second line of input contains the string y.
Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.
Output
If there is no string z such that f(x, z) = y, print -1.
Otherwise, print a string z such that f(x, z) = y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.
Examples
Input
ab
aa
Output
ba
Input
nzwzl
niwel
Output
xiyez
Input
ab
ba
Output
-1
Note
The first case is from the statement.
Another solution for the second case is "zizez"
There is no solution for the third case. That is, there is no z such that f("ab", z) = "ba".
### Response:
| Tags: constructive algorithms, greedy, strings
Correct Solution:
```
str1, str2 = input(), input()
ss = ''.join([min(str1[i], str2[i]) for i in range(len(str1))])
for i in range(len(str1)):
if (str1[i] != str2[i]) and (str1[i] < str2[i] or str1[i] == 'a'):
ss = "-1"
break
print(ss)
``` |
### Instruction:
Provide tags and a correct Python 3 solution for this coding contest problem.
You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length.
The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th character of s1 and the i-th character of s2.
For example, f("ab", "ba") = "aa", and f("nzwzl", "zizez") = "niwel".
You found two strings x and y of the same length and consisting of only lowercase English letters. Find any string z such that f(x, z) = y, or print -1 if no such string z exists.
Input
The first line of input contains the string x.
The second line of input contains the string y.
Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.
Output
If there is no string z such that f(x, z) = y, print -1.
Otherwise, print a string z such that f(x, z) = y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.
Examples
Input
ab
aa
Output
ba
Input
nzwzl
niwel
Output
xiyez
Input
ab
ba
Output
-1
Note
The first case is from the statement.
Another solution for the second case is "zizez"
There is no solution for the third case. That is, there is no z such that f("ab", z) = "ba".
### Response:
| Tags: constructive algorithms, greedy, strings
Correct Solution:
```
"""
Author - Satwik Tiwari .
27th Sept , 2020 - Sunday
"""
#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function
from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase
# from itertools import *
from heapq import *
# from math import gcd, factorial,floor,ceil
from copy import deepcopy
from collections import deque
# from collections import Counter as counter # Counter(list) return a dict with {key: count}
# from itertools import combinations as comb # if a = [1,2,3] then print(list(comb(a,2))) -----> [(1, 2), (1, 3), (2, 3)]
# from itertools import permutations as permutate
from bisect import bisect_left as bl
from bisect import bisect_right as br
from bisect import bisect
#==============================================================================================
#fast I/O region
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
def print(*args, **kwargs):
"""Prints the values to a stream, or to sys.stdout by default."""
sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
at_start = True
for x in args:
if not at_start:
file.write(sep)
file.write(str(x))
at_start = False
file.write(kwargs.pop("end", "\n"))
if kwargs.pop("flush", False):
file.flush()
if sys.version_info[0] < 3:
sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
# inp = lambda: sys.stdin.readline().rstrip("\r\n")
#===============================================================================================
### START ITERATE RECURSION ###
from types import GeneratorType
def iterative(f, stack=[]):
def wrapped_func(*args, **kwargs):
if stack: return f(*args, **kwargs)
to = f(*args, **kwargs)
while True:
if type(to) is GeneratorType:
stack.append(to)
to = next(to)
continue
stack.pop()
if not stack: break
to = stack[-1].send(to)
return to
return wrapped_func
#### END ITERATE RECURSION ####
#===============================================================================================
#some shortcuts
mod = 10**9+7
def inp(): return sys.stdin.readline().rstrip("\r\n") #for fast input
def out(var): sys.stdout.write(str(var)) #for fast output, always take string
def lis(): return list(map(int, inp().split()))
def stringlis(): return list(map(str, inp().split()))
def sep(): return map(int, inp().split())
def strsep(): return map(str, inp().split())
# def graph(vertex): return [[] for i in range(0,vertex+1)]
def zerolist(n): return [0]*n
def nextline(): out("\n") #as stdout.write always print sring.
def testcase(t):
for pp in range(t):
solve(pp)
def printlist(a) :
for p in range(0,len(a)):
out(str(a[p]) + ' ')
def google(p):
print('Case #'+str(p)+': ',end='')
def lcm(a,b): return (a*b)//gcd(a,b)
def power(x, y, p) :
res = 1 # Initialize result
x = x % p # Update x if it is more , than or equal to p
if (x == 0) :
return 0
while (y > 0) :
if ((y & 1) == 1) : # If y is odd, multiply, x with result
res = (res * x) % p
y = y >> 1 # y = y/2
x = (x * x) % p
return res
def ncr(n,r): return factorial(n) // (factorial(r) * factorial(max(n - r, 1)))
def isPrime(n) :
if (n <= 1) : return False
if (n <= 3) : return True
if (n % 2 == 0 or n % 3 == 0) : return False
i = 5
while(i * i <= n) :
if (n % i == 0 or n % (i + 2) == 0) :
return False
i = i + 6
return True
#===============================================================================================
# code here ;))
def solve(case):
a = inp()
b = inp()
for i in range(len(a)):
if(b[i] <=a[i]):
continue
else:
print(-1)
return
print(b)
testcase(1)
# testcase(int(inp()))
``` |
### Instruction:
Provide tags and a correct Python 3 solution for this coding contest problem.
You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length.
The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th character of s1 and the i-th character of s2.
For example, f("ab", "ba") = "aa", and f("nzwzl", "zizez") = "niwel".
You found two strings x and y of the same length and consisting of only lowercase English letters. Find any string z such that f(x, z) = y, or print -1 if no such string z exists.
Input
The first line of input contains the string x.
The second line of input contains the string y.
Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.
Output
If there is no string z such that f(x, z) = y, print -1.
Otherwise, print a string z such that f(x, z) = y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.
Examples
Input
ab
aa
Output
ba
Input
nzwzl
niwel
Output
xiyez
Input
ab
ba
Output
-1
Note
The first case is from the statement.
Another solution for the second case is "zizez"
There is no solution for the third case. That is, there is no z such that f("ab", z) = "ba".
### Response:
| Tags: constructive algorithms, greedy, strings
Correct Solution:
```
s = input()
t = input()
for i in range(len(s)):
if s[i] < t[i]:
print(-1)
exit()
print(t)
``` |
### Instruction:
Provide tags and a correct Python 3 solution for this coding contest problem.
You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length.
The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th character of s1 and the i-th character of s2.
For example, f("ab", "ba") = "aa", and f("nzwzl", "zizez") = "niwel".
You found two strings x and y of the same length and consisting of only lowercase English letters. Find any string z such that f(x, z) = y, or print -1 if no such string z exists.
Input
The first line of input contains the string x.
The second line of input contains the string y.
Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.
Output
If there is no string z such that f(x, z) = y, print -1.
Otherwise, print a string z such that f(x, z) = y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.
Examples
Input
ab
aa
Output
ba
Input
nzwzl
niwel
Output
xiyez
Input
ab
ba
Output
-1
Note
The first case is from the statement.
Another solution for the second case is "zizez"
There is no solution for the third case. That is, there is no z such that f("ab", z) = "ba".
### Response:
| Tags: constructive algorithms, greedy, strings
Correct Solution:
```
x = input()
y = input()
z = ""
n = len(x)
t = True
for i in range(n):
if y[i]>x[i]:
t = False
break
if y[i]<=x[i]:
z += y[i]
if t:
print(z)
else:
print(-1)
``` |
### Instruction:
Provide tags and a correct Python 3 solution for this coding contest problem.
You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length.
The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th character of s1 and the i-th character of s2.
For example, f("ab", "ba") = "aa", and f("nzwzl", "zizez") = "niwel".
You found two strings x and y of the same length and consisting of only lowercase English letters. Find any string z such that f(x, z) = y, or print -1 if no such string z exists.
Input
The first line of input contains the string x.
The second line of input contains the string y.
Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.
Output
If there is no string z such that f(x, z) = y, print -1.
Otherwise, print a string z such that f(x, z) = y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.
Examples
Input
ab
aa
Output
ba
Input
nzwzl
niwel
Output
xiyez
Input
ab
ba
Output
-1
Note
The first case is from the statement.
Another solution for the second case is "zizez"
There is no solution for the third case. That is, there is no z such that f("ab", z) = "ba".
### Response:
| Tags: constructive algorithms, greedy, strings
Correct Solution:
```
import sys
def solve():
x = input()
y = input()
for cx, cy in zip(x, y):
if cx < cy:
print(-1)
return
print(y)
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
return None
if __name__ == '__main__':
solve()
``` |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length.
The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th character of s1 and the i-th character of s2.
For example, f("ab", "ba") = "aa", and f("nzwzl", "zizez") = "niwel".
You found two strings x and y of the same length and consisting of only lowercase English letters. Find any string z such that f(x, z) = y, or print -1 if no such string z exists.
Input
The first line of input contains the string x.
The second line of input contains the string y.
Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.
Output
If there is no string z such that f(x, z) = y, print -1.
Otherwise, print a string z such that f(x, z) = y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.
Examples
Input
ab
aa
Output
ba
Input
nzwzl
niwel
Output
xiyez
Input
ab
ba
Output
-1
Note
The first case is from the statement.
Another solution for the second case is "zizez"
There is no solution for the third case. That is, there is no z such that f("ab", z) = "ba".
Submitted Solution:
```
s = input()
t = input()
for i in range(len(s)):
if t[i] > s[i]:
print(-1)
exit()
print(t)
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length.
The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th character of s1 and the i-th character of s2.
For example, f("ab", "ba") = "aa", and f("nzwzl", "zizez") = "niwel".
You found two strings x and y of the same length and consisting of only lowercase English letters. Find any string z such that f(x, z) = y, or print -1 if no such string z exists.
Input
The first line of input contains the string x.
The second line of input contains the string y.
Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.
Output
If there is no string z such that f(x, z) = y, print -1.
Otherwise, print a string z such that f(x, z) = y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.
Examples
Input
ab
aa
Output
ba
Input
nzwzl
niwel
Output
xiyez
Input
ab
ba
Output
-1
Note
The first case is from the statement.
Another solution for the second case is "zizez"
There is no solution for the third case. That is, there is no z such that f("ab", z) = "ba".
Submitted Solution:
```
x = input()
y = input()
l = len(x)
impossible = False
z = [''] * l
for i in range(l):
if y[i] > x[i]:
impossible = True
break
elif y[i] == x[i]:
z[i] = 'z'
else:
z[i] = y[i]
if impossible:
print(-1)
else:
print(''.join(z))
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length.
The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th character of s1 and the i-th character of s2.
For example, f("ab", "ba") = "aa", and f("nzwzl", "zizez") = "niwel".
You found two strings x and y of the same length and consisting of only lowercase English letters. Find any string z such that f(x, z) = y, or print -1 if no such string z exists.
Input
The first line of input contains the string x.
The second line of input contains the string y.
Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.
Output
If there is no string z such that f(x, z) = y, print -1.
Otherwise, print a string z such that f(x, z) = y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.
Examples
Input
ab
aa
Output
ba
Input
nzwzl
niwel
Output
xiyez
Input
ab
ba
Output
-1
Note
The first case is from the statement.
Another solution for the second case is "zizez"
There is no solution for the third case. That is, there is no z such that f("ab", z) = "ba".
Submitted Solution:
```
x=input()
y=input()
for i in range(len(x)):
if ord(y[i])>ord(x[i]):
print(-1)
exit()
print(y)
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length.
The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th character of s1 and the i-th character of s2.
For example, f("ab", "ba") = "aa", and f("nzwzl", "zizez") = "niwel".
You found two strings x and y of the same length and consisting of only lowercase English letters. Find any string z such that f(x, z) = y, or print -1 if no such string z exists.
Input
The first line of input contains the string x.
The second line of input contains the string y.
Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.
Output
If there is no string z such that f(x, z) = y, print -1.
Otherwise, print a string z such that f(x, z) = y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.
Examples
Input
ab
aa
Output
ba
Input
nzwzl
niwel
Output
xiyez
Input
ab
ba
Output
-1
Note
The first case is from the statement.
Another solution for the second case is "zizez"
There is no solution for the third case. That is, there is no z such that f("ab", z) = "ba".
Submitted Solution:
```
x = input()
z = input()
y = ""
r = True
for i in range( len(x) ):
if x[i] == z[i]:
y += "z"
elif x[i] > z[i]:
y += z[i]
else:
r = False
if r:
print(y)
else:
print("-1")
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length.
The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th character of s1 and the i-th character of s2.
For example, f("ab", "ba") = "aa", and f("nzwzl", "zizez") = "niwel".
You found two strings x and y of the same length and consisting of only lowercase English letters. Find any string z such that f(x, z) = y, or print -1 if no such string z exists.
Input
The first line of input contains the string x.
The second line of input contains the string y.
Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.
Output
If there is no string z such that f(x, z) = y, print -1.
Otherwise, print a string z such that f(x, z) = y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.
Examples
Input
ab
aa
Output
ba
Input
nzwzl
niwel
Output
xiyez
Input
ab
ba
Output
-1
Note
The first case is from the statement.
Another solution for the second case is "zizez"
There is no solution for the third case. That is, there is no z such that f("ab", z) = "ba".
Submitted Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Mon Jan 15 14:15:15 2018
@author: Paras Sharma
"""
a=input()
c=[]
b=input()
d=[]
for i in range(len(a)):
c.append(a[i])
d.append(b[i])
for i in range(len(a)):
print(min(a[i],b[i]),end="")
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length.
The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th character of s1 and the i-th character of s2.
For example, f("ab", "ba") = "aa", and f("nzwzl", "zizez") = "niwel".
You found two strings x and y of the same length and consisting of only lowercase English letters. Find any string z such that f(x, z) = y, or print -1 if no such string z exists.
Input
The first line of input contains the string x.
The second line of input contains the string y.
Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.
Output
If there is no string z such that f(x, z) = y, print -1.
Otherwise, print a string z such that f(x, z) = y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.
Examples
Input
ab
aa
Output
ba
Input
nzwzl
niwel
Output
xiyez
Input
ab
ba
Output
-1
Note
The first case is from the statement.
Another solution for the second case is "zizez"
There is no solution for the third case. That is, there is no z such that f("ab", z) = "ba".
Submitted Solution:
```
def mys(s1, s2):
s3 = ''
for i in range(len(s1)):
if s1[i] == s2[i]:
s3 += s1[i]
elif s1[i] > s2[i]:
s3 += s2[i]
else:
c = ord(s1[i]) + 1
s3 += chr(c)
return s3
x = input()
y = input()
l_x = sorted(list(x))
l_y = sorted(list(y))
if l_x == l_y:
print(-1)
else:
res = mys(x, y)
print(res)
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length.
The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th character of s1 and the i-th character of s2.
For example, f("ab", "ba") = "aa", and f("nzwzl", "zizez") = "niwel".
You found two strings x and y of the same length and consisting of only lowercase English letters. Find any string z such that f(x, z) = y, or print -1 if no such string z exists.
Input
The first line of input contains the string x.
The second line of input contains the string y.
Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.
Output
If there is no string z such that f(x, z) = y, print -1.
Otherwise, print a string z such that f(x, z) = y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.
Examples
Input
ab
aa
Output
ba
Input
nzwzl
niwel
Output
xiyez
Input
ab
ba
Output
-1
Note
The first case is from the statement.
Another solution for the second case is "zizez"
There is no solution for the third case. That is, there is no z such that f("ab", z) = "ba".
Submitted Solution:
```
arg =input()
res =input()
if arg < res:
print ("-1")
quit()
b =""
for i in range(len(arg)):
if arg[i] == res[i]:b+=str(chr(ord(arg[i])+1))
elif arg[i] > res[i]:b+=str(res[i])
print (b)
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length.
The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th character of s1 and the i-th character of s2.
For example, f("ab", "ba") = "aa", and f("nzwzl", "zizez") = "niwel".
You found two strings x and y of the same length and consisting of only lowercase English letters. Find any string z such that f(x, z) = y, or print -1 if no such string z exists.
Input
The first line of input contains the string x.
The second line of input contains the string y.
Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.
Output
If there is no string z such that f(x, z) = y, print -1.
Otherwise, print a string z such that f(x, z) = y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.
Examples
Input
ab
aa
Output
ba
Input
nzwzl
niwel
Output
xiyez
Input
ab
ba
Output
-1
Note
The first case is from the statement.
Another solution for the second case is "zizez"
There is no solution for the third case. That is, there is no z such that f("ab", z) = "ba".
Submitted Solution:
```
x=input()
y=input()
z=''
for i in range(len(x)):
if x[i]==y[i]:
if x[i]=='a':
z+='c'
elif x[i]=='b':
z+='m'
elif x[i]=='c':
z+='z'
elif x[i]=='d':
z+='f'
elif x[i]=='e':
z+='k'
elif x[i]=='f':
z+='r'
elif x[i]=='g':
z+='s'
elif x[i]=='h':
z+='t'
elif x[i]=='i':
z+='u'
elif x[i]=='j':
z+='v'
elif x[i]=='k':
z+='w'
elif x[i]=='l':
z+='x'
elif x[i]=='m':
z+='y'
elif x[i]=='n':
z+='z'
elif x[i]=='o':
z+='c'
elif x[i]=='p':
z+='v'
elif x[i]=='q':
z+='g'
elif x[i]=='r':
z+='r'
elif x[i]=='s':
z+='l'
elif x[i]=='t':
z+='h'
elif x[i]=='u':
z+='t'
elif x[i]=='v':
z+='r'
elif x[i]=='w':
z+='q'
elif x[i]=='x':
z+='j'
elif x[i]=='y':
z+='g'
elif x[i]=='z':
z+='a'
else:
z+=y[i]
f=0
for i in range(len(z)):
if (x[i]<y[i] and x[i]!=z[i]) or (x[i]>y[i] and y[i]!=z[i]):
print(-1)
f=1
break
if f==0:
print(z)
```
### Response:
| No |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
One of the simple ciphers is the affine cipher. First, replace the letters a to z with the numbers a = 0, b = 1, c = 2, ..., x = 23, y = 24, z = 25 and 0 to 25. Then replace the original alphabet with the following formula.
$ F (\ gamma) = (\ alpha \ cdot \ gamma + \ beta) $ mod $ 26 $
However, mod 26 represents the remainder after dividing by 26. For example, when $ \ alpha = 3, \ beta = 2 $, the alphabet'a'(= 0) is $ F (0) = (3 \ cdot 0 + 2) $ mod $ 26 = 2 $ and'c In', the alphabet'n'(= 13) is replaced with'p' at $ F (13) = (3 \ cdot 13 + 2) $ mod $ 26 = 15 $. At this time, it is assumed that $ \ alpha $ and $ \ beta $ are carefully selected so that $ F (\ gamma) $ is always associated with $ \ gamma $ on a one-to-one basis ($ \ alpha). As long as $ and 26 are relatively prime). $ F ('a') = 7, F ('n') = 7 $, as in $ \ alpha = 4, \ beta = 7 $, and'a'and'n' are the same'h' It will not be replaced by. Also, non-alphabetic characters are not replaced.
Create a program that outputs the encrypted character string decrypted into the original text. In the original text, as a keyword
that
this
It is assumed that one of the above is always included.
Input
Given multiple datasets. The first line gives the number of datasets $ n $ ($ n \ leq 30 $). It is followed by $ n $ rows of data. Each dataset is given an encrypted sentence of up to 256 characters consisting of lowercase letters and blanks on one line.
Output
For each dataset, output the decrypted original text on one line.
Example
Input
1
y eazqyp pnop pngtg ye obmpngt xmybp mr lygw
Output
i submit that there is another point of view
### Response:
| "Correct Solution:
```
for _ in range(int(input())):
s=input()
for i in range(1,27,2):
for j in range(27):
a=[]
for k in range(len(s)):
if s[k].islower():a+=chr(((ord(s[k])-97)*i+j)%26+97)
else:a+=s[k]
a=''.join(a)
if 'this' in a or 'that' in a:print(a);break
``` |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
One of the simple ciphers is the affine cipher. First, replace the letters a to z with the numbers a = 0, b = 1, c = 2, ..., x = 23, y = 24, z = 25 and 0 to 25. Then replace the original alphabet with the following formula.
$ F (\ gamma) = (\ alpha \ cdot \ gamma + \ beta) $ mod $ 26 $
However, mod 26 represents the remainder after dividing by 26. For example, when $ \ alpha = 3, \ beta = 2 $, the alphabet'a'(= 0) is $ F (0) = (3 \ cdot 0 + 2) $ mod $ 26 = 2 $ and'c In', the alphabet'n'(= 13) is replaced with'p' at $ F (13) = (3 \ cdot 13 + 2) $ mod $ 26 = 15 $. At this time, it is assumed that $ \ alpha $ and $ \ beta $ are carefully selected so that $ F (\ gamma) $ is always associated with $ \ gamma $ on a one-to-one basis ($ \ alpha). As long as $ and 26 are relatively prime). $ F ('a') = 7, F ('n') = 7 $, as in $ \ alpha = 4, \ beta = 7 $, and'a'and'n' are the same'h' It will not be replaced by. Also, non-alphabetic characters are not replaced.
Create a program that outputs the encrypted character string decrypted into the original text. In the original text, as a keyword
that
this
It is assumed that one of the above is always included.
Input
Given multiple datasets. The first line gives the number of datasets $ n $ ($ n \ leq 30 $). It is followed by $ n $ rows of data. Each dataset is given an encrypted sentence of up to 256 characters consisting of lowercase letters and blanks on one line.
Output
For each dataset, output the decrypted original text on one line.
Example
Input
1
y eazqyp pnop pngtg ye obmpngt xmybp mr lygw
Output
i submit that there is another point of view
### Response:
| "Correct Solution:
```
z='abcdefghijklmnopqrstuvwxyz'
e=lambda x,i,j:z[(z.index(x)*i+j)%26]
def f():
for i in(1,3,5,7,9,11,15,17,19,21,23,25):
for j in range(26):
if''.join(e(c,i,j)for c in'that')in s or''.join(e(c,i,j)for c in'this')in s:return(i,j)
def g(x,y,s=0,t=1):
q,r=x//y,x%y
return g(y,r,t,s-q*t) if r else t
for _ in[0]*int(input()):
s=input()
a,b=f()
h=g(26,a)
print(''.join(z[h*(z.index(c)-b)%26]if c in z else c for c in s))
``` |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
One of the simple ciphers is the affine cipher. First, replace the letters a to z with the numbers a = 0, b = 1, c = 2, ..., x = 23, y = 24, z = 25 and 0 to 25. Then replace the original alphabet with the following formula.
$ F (\ gamma) = (\ alpha \ cdot \ gamma + \ beta) $ mod $ 26 $
However, mod 26 represents the remainder after dividing by 26. For example, when $ \ alpha = 3, \ beta = 2 $, the alphabet'a'(= 0) is $ F (0) = (3 \ cdot 0 + 2) $ mod $ 26 = 2 $ and'c In', the alphabet'n'(= 13) is replaced with'p' at $ F (13) = (3 \ cdot 13 + 2) $ mod $ 26 = 15 $. At this time, it is assumed that $ \ alpha $ and $ \ beta $ are carefully selected so that $ F (\ gamma) $ is always associated with $ \ gamma $ on a one-to-one basis ($ \ alpha). As long as $ and 26 are relatively prime). $ F ('a') = 7, F ('n') = 7 $, as in $ \ alpha = 4, \ beta = 7 $, and'a'and'n' are the same'h' It will not be replaced by. Also, non-alphabetic characters are not replaced.
Create a program that outputs the encrypted character string decrypted into the original text. In the original text, as a keyword
that
this
It is assumed that one of the above is always included.
Input
Given multiple datasets. The first line gives the number of datasets $ n $ ($ n \ leq 30 $). It is followed by $ n $ rows of data. Each dataset is given an encrypted sentence of up to 256 characters consisting of lowercase letters and blanks on one line.
Output
For each dataset, output the decrypted original text on one line.
Example
Input
1
y eazqyp pnop pngtg ye obmpngt xmybp mr lygw
Output
i submit that there is another point of view
### Response:
| "Correct Solution:
```
z='abcdefghijklmnopqrstuvwxyz'
for _ in[0]*int(input()):
e=input()
for i in range(1,26,2):
for j in range(26):
a=''
for c in e:
a+=z[(z.index(c)*i+j)%26]if c in z else c
if'that'in a or'this'in a:print(a);break
``` |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
One of the simple ciphers is the affine cipher. First, replace the letters a to z with the numbers a = 0, b = 1, c = 2, ..., x = 23, y = 24, z = 25 and 0 to 25. Then replace the original alphabet with the following formula.
$ F (\ gamma) = (\ alpha \ cdot \ gamma + \ beta) $ mod $ 26 $
However, mod 26 represents the remainder after dividing by 26. For example, when $ \ alpha = 3, \ beta = 2 $, the alphabet'a'(= 0) is $ F (0) = (3 \ cdot 0 + 2) $ mod $ 26 = 2 $ and'c In', the alphabet'n'(= 13) is replaced with'p' at $ F (13) = (3 \ cdot 13 + 2) $ mod $ 26 = 15 $. At this time, it is assumed that $ \ alpha $ and $ \ beta $ are carefully selected so that $ F (\ gamma) $ is always associated with $ \ gamma $ on a one-to-one basis ($ \ alpha). As long as $ and 26 are relatively prime). $ F ('a') = 7, F ('n') = 7 $, as in $ \ alpha = 4, \ beta = 7 $, and'a'and'n' are the same'h' It will not be replaced by. Also, non-alphabetic characters are not replaced.
Create a program that outputs the encrypted character string decrypted into the original text. In the original text, as a keyword
that
this
It is assumed that one of the above is always included.
Input
Given multiple datasets. The first line gives the number of datasets $ n $ ($ n \ leq 30 $). It is followed by $ n $ rows of data. Each dataset is given an encrypted sentence of up to 256 characters consisting of lowercase letters and blanks on one line.
Output
For each dataset, output the decrypted original text on one line.
Example
Input
1
y eazqyp pnop pngtg ye obmpngt xmybp mr lygw
Output
i submit that there is another point of view
### Response:
| "Correct Solution:
```
base = ord("a")
alst = [i for i in range(1, 26, 2) if i % 13]
def restore(s):
for a in alst:
for b in range(26):
new = "".join([chr((a * (ord(x) - base) + b) % 26 + base) if x != " " else " " for x in s])
if "that" in new or "this" in new:
return new
n = int(input())
for _ in range(n):
print(restore(input()))
``` |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
One of the simple ciphers is the affine cipher. First, replace the letters a to z with the numbers a = 0, b = 1, c = 2, ..., x = 23, y = 24, z = 25 and 0 to 25. Then replace the original alphabet with the following formula.
$ F (\ gamma) = (\ alpha \ cdot \ gamma + \ beta) $ mod $ 26 $
However, mod 26 represents the remainder after dividing by 26. For example, when $ \ alpha = 3, \ beta = 2 $, the alphabet'a'(= 0) is $ F (0) = (3 \ cdot 0 + 2) $ mod $ 26 = 2 $ and'c In', the alphabet'n'(= 13) is replaced with'p' at $ F (13) = (3 \ cdot 13 + 2) $ mod $ 26 = 15 $. At this time, it is assumed that $ \ alpha $ and $ \ beta $ are carefully selected so that $ F (\ gamma) $ is always associated with $ \ gamma $ on a one-to-one basis ($ \ alpha). As long as $ and 26 are relatively prime). $ F ('a') = 7, F ('n') = 7 $, as in $ \ alpha = 4, \ beta = 7 $, and'a'and'n' are the same'h' It will not be replaced by. Also, non-alphabetic characters are not replaced.
Create a program that outputs the encrypted character string decrypted into the original text. In the original text, as a keyword
that
this
It is assumed that one of the above is always included.
Input
Given multiple datasets. The first line gives the number of datasets $ n $ ($ n \ leq 30 $). It is followed by $ n $ rows of data. Each dataset is given an encrypted sentence of up to 256 characters consisting of lowercase letters and blanks on one line.
Output
For each dataset, output the decrypted original text on one line.
Example
Input
1
y eazqyp pnop pngtg ye obmpngt xmybp mr lygw
Output
i submit that there is another point of view
### Response:
| "Correct Solution:
```
def F(alpha, beta, c):
gamma = ord(c) - ord("a")
return chr((alpha*gamma + beta) % 26 + ord("a"))
alphalist = [1,3,5,7,9,11,15,17,19,21,23,25]
N = int(input())
for lines in range(N):
S = input()
words = S.split()
keyA = -1
keyB = -1
for i in range(len(words)):
if len(words[i]) == 4:
w = words[i]
for k in range(len(alphalist)):
for l in range(26):
alpha = alphalist[k]
beta = l
if F(alpha,beta,w[0]) == "t" and F(alpha,beta,w[1]) == "h":
if F(alpha,beta,w[2]) == "a" and F(alpha,beta,w[3]) == "t":
keyA = alpha
keyB = beta
elif F(alpha,beta,w[2]) == "i" and F(alpha,beta,w[3]) == "s":
keyA = alpha
keyB = beta
if keyA > 0:
break
if keyB > 0:
break
if keyA > 0:
break
for i in range(len(S)):
if S[i] == " ":
print(" ", end="")
else:
print(F(keyA,keyB,S[i]), end="")
print("")
``` |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
One of the simple ciphers is the affine cipher. First, replace the letters a to z with the numbers a = 0, b = 1, c = 2, ..., x = 23, y = 24, z = 25 and 0 to 25. Then replace the original alphabet with the following formula.
$ F (\ gamma) = (\ alpha \ cdot \ gamma + \ beta) $ mod $ 26 $
However, mod 26 represents the remainder after dividing by 26. For example, when $ \ alpha = 3, \ beta = 2 $, the alphabet'a'(= 0) is $ F (0) = (3 \ cdot 0 + 2) $ mod $ 26 = 2 $ and'c In', the alphabet'n'(= 13) is replaced with'p' at $ F (13) = (3 \ cdot 13 + 2) $ mod $ 26 = 15 $. At this time, it is assumed that $ \ alpha $ and $ \ beta $ are carefully selected so that $ F (\ gamma) $ is always associated with $ \ gamma $ on a one-to-one basis ($ \ alpha). As long as $ and 26 are relatively prime). $ F ('a') = 7, F ('n') = 7 $, as in $ \ alpha = 4, \ beta = 7 $, and'a'and'n' are the same'h' It will not be replaced by. Also, non-alphabetic characters are not replaced.
Create a program that outputs the encrypted character string decrypted into the original text. In the original text, as a keyword
that
this
It is assumed that one of the above is always included.
Input
Given multiple datasets. The first line gives the number of datasets $ n $ ($ n \ leq 30 $). It is followed by $ n $ rows of data. Each dataset is given an encrypted sentence of up to 256 characters consisting of lowercase letters and blanks on one line.
Output
For each dataset, output the decrypted original text on one line.
Example
Input
1
y eazqyp pnop pngtg ye obmpngt xmybp mr lygw
Output
i submit that there is another point of view
### Response:
| "Correct Solution:
```
def affine(word, alpha, beta):
word = list(word)
for i in range(len(word)):
ascii = ((ord(word[i]) - ord('a')) * alpha + beta) % 26;
word[i] = chr(ascii + ord('a'));
return ''.join(word)
alphas = [1, 3, 5, 7, 9, 11, 15, 17, 19, 21, 23, 25]
for x in range(int(input())):
words = input().split(' ')
for alpha in range(26):
for beta in range(26):
string = list(map(lambda x: affine(x, alpha, beta), words))
if 'that' in string or 'this' in string:
print(*string)
break
else:
continue
break
``` |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
One of the simple ciphers is the affine cipher. First, replace the letters a to z with the numbers a = 0, b = 1, c = 2, ..., x = 23, y = 24, z = 25 and 0 to 25. Then replace the original alphabet with the following formula.
$ F (\ gamma) = (\ alpha \ cdot \ gamma + \ beta) $ mod $ 26 $
However, mod 26 represents the remainder after dividing by 26. For example, when $ \ alpha = 3, \ beta = 2 $, the alphabet'a'(= 0) is $ F (0) = (3 \ cdot 0 + 2) $ mod $ 26 = 2 $ and'c In', the alphabet'n'(= 13) is replaced with'p' at $ F (13) = (3 \ cdot 13 + 2) $ mod $ 26 = 15 $. At this time, it is assumed that $ \ alpha $ and $ \ beta $ are carefully selected so that $ F (\ gamma) $ is always associated with $ \ gamma $ on a one-to-one basis ($ \ alpha). As long as $ and 26 are relatively prime). $ F ('a') = 7, F ('n') = 7 $, as in $ \ alpha = 4, \ beta = 7 $, and'a'and'n' are the same'h' It will not be replaced by. Also, non-alphabetic characters are not replaced.
Create a program that outputs the encrypted character string decrypted into the original text. In the original text, as a keyword
that
this
It is assumed that one of the above is always included.
Input
Given multiple datasets. The first line gives the number of datasets $ n $ ($ n \ leq 30 $). It is followed by $ n $ rows of data. Each dataset is given an encrypted sentence of up to 256 characters consisting of lowercase letters and blanks on one line.
Output
For each dataset, output the decrypted original text on one line.
Example
Input
1
y eazqyp pnop pngtg ye obmpngt xmybp mr lygw
Output
i submit that there is another point of view
### Response:
| "Correct Solution:
```
z='abcdefghijklmnopqrstuvwxyz'
def f(x):
for i in range(1,26,2):
for j in range(26):
a=''.join(z[(z.index(c)*i+j)%26]if c in z else c for c in x)
if'that'in a or'this'in a:return a
for _ in[0]*int(input()):print(f(input()))
``` |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
One of the simple ciphers is the affine cipher. First, replace the letters a to z with the numbers a = 0, b = 1, c = 2, ..., x = 23, y = 24, z = 25 and 0 to 25. Then replace the original alphabet with the following formula.
$ F (\ gamma) = (\ alpha \ cdot \ gamma + \ beta) $ mod $ 26 $
However, mod 26 represents the remainder after dividing by 26. For example, when $ \ alpha = 3, \ beta = 2 $, the alphabet'a'(= 0) is $ F (0) = (3 \ cdot 0 + 2) $ mod $ 26 = 2 $ and'c In', the alphabet'n'(= 13) is replaced with'p' at $ F (13) = (3 \ cdot 13 + 2) $ mod $ 26 = 15 $. At this time, it is assumed that $ \ alpha $ and $ \ beta $ are carefully selected so that $ F (\ gamma) $ is always associated with $ \ gamma $ on a one-to-one basis ($ \ alpha). As long as $ and 26 are relatively prime). $ F ('a') = 7, F ('n') = 7 $, as in $ \ alpha = 4, \ beta = 7 $, and'a'and'n' are the same'h' It will not be replaced by. Also, non-alphabetic characters are not replaced.
Create a program that outputs the encrypted character string decrypted into the original text. In the original text, as a keyword
that
this
It is assumed that one of the above is always included.
Input
Given multiple datasets. The first line gives the number of datasets $ n $ ($ n \ leq 30 $). It is followed by $ n $ rows of data. Each dataset is given an encrypted sentence of up to 256 characters consisting of lowercase letters and blanks on one line.
Output
For each dataset, output the decrypted original text on one line.
Example
Input
1
y eazqyp pnop pngtg ye obmpngt xmybp mr lygw
Output
i submit that there is another point of view
### Response:
| "Correct Solution:
```
z='abcdefghijklmnopqrstuvwxyz'
e=lambda x,i,j:z[(z.index(x)*i+j)%26]
def f():
for i in range(1,26,2):
for j in range(26):
if''.join(e(c,i,j)for c in'that')in s or''.join(e(c,i,j)for c in'this')in s:return(i,j)
for _ in[0]*int(input()):
s=input()
k=f()
a=''.join(e(c,*k)for c in z)
t=str.maketrans(a,z)
print(s.translate(t))
``` |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of the simple ciphers is the affine cipher. First, replace the letters a to z with the numbers a = 0, b = 1, c = 2, ..., x = 23, y = 24, z = 25 and 0 to 25. Then replace the original alphabet with the following formula.
$ F (\ gamma) = (\ alpha \ cdot \ gamma + \ beta) $ mod $ 26 $
However, mod 26 represents the remainder after dividing by 26. For example, when $ \ alpha = 3, \ beta = 2 $, the alphabet'a'(= 0) is $ F (0) = (3 \ cdot 0 + 2) $ mod $ 26 = 2 $ and'c In', the alphabet'n'(= 13) is replaced with'p' at $ F (13) = (3 \ cdot 13 + 2) $ mod $ 26 = 15 $. At this time, it is assumed that $ \ alpha $ and $ \ beta $ are carefully selected so that $ F (\ gamma) $ is always associated with $ \ gamma $ on a one-to-one basis ($ \ alpha). As long as $ and 26 are relatively prime). $ F ('a') = 7, F ('n') = 7 $, as in $ \ alpha = 4, \ beta = 7 $, and'a'and'n' are the same'h' It will not be replaced by. Also, non-alphabetic characters are not replaced.
Create a program that outputs the encrypted character string decrypted into the original text. In the original text, as a keyword
that
this
It is assumed that one of the above is always included.
Input
Given multiple datasets. The first line gives the number of datasets $ n $ ($ n \ leq 30 $). It is followed by $ n $ rows of data. Each dataset is given an encrypted sentence of up to 256 characters consisting of lowercase letters and blanks on one line.
Output
For each dataset, output the decrypted original text on one line.
Example
Input
1
y eazqyp pnop pngtg ye obmpngt xmybp mr lygw
Output
i submit that there is another point of view
Submitted Solution:
```
from itertools import product
n = int(input())
for _ in range(n):
s = input()
for alpha,beta in product([1,3,5,7,9,11,15,17,19,21,23,25],range(26)):
g = "".join(chr((alpha*(ord(e)-ord("a"))+beta)%26+ord("a")) if not e == " " else " " for e in s)
if "that" in g or "this" in g: print(g); break
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of the simple ciphers is the affine cipher. First, replace the letters a to z with the numbers a = 0, b = 1, c = 2, ..., x = 23, y = 24, z = 25 and 0 to 25. Then replace the original alphabet with the following formula.
$ F (\ gamma) = (\ alpha \ cdot \ gamma + \ beta) $ mod $ 26 $
However, mod 26 represents the remainder after dividing by 26. For example, when $ \ alpha = 3, \ beta = 2 $, the alphabet'a'(= 0) is $ F (0) = (3 \ cdot 0 + 2) $ mod $ 26 = 2 $ and'c In', the alphabet'n'(= 13) is replaced with'p' at $ F (13) = (3 \ cdot 13 + 2) $ mod $ 26 = 15 $. At this time, it is assumed that $ \ alpha $ and $ \ beta $ are carefully selected so that $ F (\ gamma) $ is always associated with $ \ gamma $ on a one-to-one basis ($ \ alpha). As long as $ and 26 are relatively prime). $ F ('a') = 7, F ('n') = 7 $, as in $ \ alpha = 4, \ beta = 7 $, and'a'and'n' are the same'h' It will not be replaced by. Also, non-alphabetic characters are not replaced.
Create a program that outputs the encrypted character string decrypted into the original text. In the original text, as a keyword
that
this
It is assumed that one of the above is always included.
Input
Given multiple datasets. The first line gives the number of datasets $ n $ ($ n \ leq 30 $). It is followed by $ n $ rows of data. Each dataset is given an encrypted sentence of up to 256 characters consisting of lowercase letters and blanks on one line.
Output
For each dataset, output the decrypted original text on one line.
Example
Input
1
y eazqyp pnop pngtg ye obmpngt xmybp mr lygw
Output
i submit that there is another point of view
Submitted Solution:
```
for _ in[0]*int(input()):
e=input()
for i in range(26):
for j in range(26):
a=''.join([c,chr(((ord(c)-97)*i+j)%26+97)][c.islower()]for c in e)
if'that'in a or'this'in a:print(a);break
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of the simple ciphers is the affine cipher. First, replace the letters a to z with the numbers a = 0, b = 1, c = 2, ..., x = 23, y = 24, z = 25 and 0 to 25. Then replace the original alphabet with the following formula.
$ F (\ gamma) = (\ alpha \ cdot \ gamma + \ beta) $ mod $ 26 $
However, mod 26 represents the remainder after dividing by 26. For example, when $ \ alpha = 3, \ beta = 2 $, the alphabet'a'(= 0) is $ F (0) = (3 \ cdot 0 + 2) $ mod $ 26 = 2 $ and'c In', the alphabet'n'(= 13) is replaced with'p' at $ F (13) = (3 \ cdot 13 + 2) $ mod $ 26 = 15 $. At this time, it is assumed that $ \ alpha $ and $ \ beta $ are carefully selected so that $ F (\ gamma) $ is always associated with $ \ gamma $ on a one-to-one basis ($ \ alpha). As long as $ and 26 are relatively prime). $ F ('a') = 7, F ('n') = 7 $, as in $ \ alpha = 4, \ beta = 7 $, and'a'and'n' are the same'h' It will not be replaced by. Also, non-alphabetic characters are not replaced.
Create a program that outputs the encrypted character string decrypted into the original text. In the original text, as a keyword
that
this
It is assumed that one of the above is always included.
Input
Given multiple datasets. The first line gives the number of datasets $ n $ ($ n \ leq 30 $). It is followed by $ n $ rows of data. Each dataset is given an encrypted sentence of up to 256 characters consisting of lowercase letters and blanks on one line.
Output
For each dataset, output the decrypted original text on one line.
Example
Input
1
y eazqyp pnop pngtg ye obmpngt xmybp mr lygw
Output
i submit that there is another point of view
Submitted Solution:
```
E = 10**-10
def decy(a):
return [ord(i)-97 for i in a]
def encr(a):
return "".join([chr(i+97) for i in a])
def deaffin(j,a,b):
cont_ = 1
for i in range(100):
if cont_ == 0:
break
elif ((j-b+26*i)/a)//1 == (j-b+26*i)/a:
cont_ = 0
return int((j-b+26*i)/a)%26
n = int(input())
for _ in range(n):
sen = input()
words = sen.split()
wordsl = [len(i) for i in words]
wordsn = [decy(i) for i in words]
fourn = []
for i in range(len(wordsl)):
if wordsl[i] == 4:
fourn.append(wordsn[i])
a_ = 0
b_ = 0
cont = 1
for a in [1,3,5,7,9,11,15,17,19,21,23,25]:
if cont != 0:
for b in range(26):
if cont != 0:
for i in fourn:
deco = [chr(deaffin(j,a,b)+97) for j in i]
if deco == ["t","h","i","s"] or deco == ["t","h","a","t"]:
a_ = a
b_ = b
cont = 0
break
dec_wordsn = [[deaffin(j,a_,b_) for j in i] for i in wordsn]
dec_words = [encr(i) for i in dec_wordsn]
print(" ".join(dec_words))
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of the simple ciphers is the affine cipher. First, replace the letters a to z with the numbers a = 0, b = 1, c = 2, ..., x = 23, y = 24, z = 25 and 0 to 25. Then replace the original alphabet with the following formula.
$ F (\ gamma) = (\ alpha \ cdot \ gamma + \ beta) $ mod $ 26 $
However, mod 26 represents the remainder after dividing by 26. For example, when $ \ alpha = 3, \ beta = 2 $, the alphabet'a'(= 0) is $ F (0) = (3 \ cdot 0 + 2) $ mod $ 26 = 2 $ and'c In', the alphabet'n'(= 13) is replaced with'p' at $ F (13) = (3 \ cdot 13 + 2) $ mod $ 26 = 15 $. At this time, it is assumed that $ \ alpha $ and $ \ beta $ are carefully selected so that $ F (\ gamma) $ is always associated with $ \ gamma $ on a one-to-one basis ($ \ alpha). As long as $ and 26 are relatively prime). $ F ('a') = 7, F ('n') = 7 $, as in $ \ alpha = 4, \ beta = 7 $, and'a'and'n' are the same'h' It will not be replaced by. Also, non-alphabetic characters are not replaced.
Create a program that outputs the encrypted character string decrypted into the original text. In the original text, as a keyword
that
this
It is assumed that one of the above is always included.
Input
Given multiple datasets. The first line gives the number of datasets $ n $ ($ n \ leq 30 $). It is followed by $ n $ rows of data. Each dataset is given an encrypted sentence of up to 256 characters consisting of lowercase letters and blanks on one line.
Output
For each dataset, output the decrypted original text on one line.
Example
Input
1
y eazqyp pnop pngtg ye obmpngt xmybp mr lygw
Output
i submit that there is another point of view
Submitted Solution:
```
m = [chr(ord('a')+i) for i in range(26)]
t = {}
for i in range(26):
t[m[i]] = i
def affine(s):
for a in range(26):
for b in range(26):
text = ''.join([m[a * (t[x] - b + 26) % 26]
if x != ' ' else ' ' for x in s])
if 'that' in text or 'this' in text:
return text
n = int(input())
for i in range(n):
print(affine(input()))
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of the simple ciphers is the affine cipher. First, replace the letters a to z with the numbers a = 0, b = 1, c = 2, ..., x = 23, y = 24, z = 25 and 0 to 25. Then replace the original alphabet with the following formula.
$ F (\ gamma) = (\ alpha \ cdot \ gamma + \ beta) $ mod $ 26 $
However, mod 26 represents the remainder after dividing by 26. For example, when $ \ alpha = 3, \ beta = 2 $, the alphabet'a'(= 0) is $ F (0) = (3 \ cdot 0 + 2) $ mod $ 26 = 2 $ and'c In', the alphabet'n'(= 13) is replaced with'p' at $ F (13) = (3 \ cdot 13 + 2) $ mod $ 26 = 15 $. At this time, it is assumed that $ \ alpha $ and $ \ beta $ are carefully selected so that $ F (\ gamma) $ is always associated with $ \ gamma $ on a one-to-one basis ($ \ alpha). As long as $ and 26 are relatively prime). $ F ('a') = 7, F ('n') = 7 $, as in $ \ alpha = 4, \ beta = 7 $, and'a'and'n' are the same'h' It will not be replaced by. Also, non-alphabetic characters are not replaced.
Create a program that outputs the encrypted character string decrypted into the original text. In the original text, as a keyword
that
this
It is assumed that one of the above is always included.
Input
Given multiple datasets. The first line gives the number of datasets $ n $ ($ n \ leq 30 $). It is followed by $ n $ rows of data. Each dataset is given an encrypted sentence of up to 256 characters consisting of lowercase letters and blanks on one line.
Output
For each dataset, output the decrypted original text on one line.
Example
Input
1
y eazqyp pnop pngtg ye obmpngt xmybp mr lygw
Output
i submit that there is another point of view
Submitted Solution:
```
string = 'abcdefghijklmnopqrstuvwxyz'
table = []
for i in string:
table.append(i)
def encode(string,a,b):
data = list(string)
s = []
flag = 0
for c in data:
try:
i = table.index(c)
tmp = (a*i+b)%26
s[-1:] += table[tmp]
except:
s.append(' ')
s = ''.join(s)
return s
n = int(input())
for i in range(n):
code = str(input())
for a in range(1,26):
for b in range(1,26):
s = encode(code,a,b)
if 'that' in s:
print(s)
elif 'this' in s:
print(s)
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of the simple ciphers is the affine cipher. First, replace the letters a to z with the numbers a = 0, b = 1, c = 2, ..., x = 23, y = 24, z = 25 and 0 to 25. Then replace the original alphabet with the following formula.
$ F (\ gamma) = (\ alpha \ cdot \ gamma + \ beta) $ mod $ 26 $
However, mod 26 represents the remainder after dividing by 26. For example, when $ \ alpha = 3, \ beta = 2 $, the alphabet'a'(= 0) is $ F (0) = (3 \ cdot 0 + 2) $ mod $ 26 = 2 $ and'c In', the alphabet'n'(= 13) is replaced with'p' at $ F (13) = (3 \ cdot 13 + 2) $ mod $ 26 = 15 $. At this time, it is assumed that $ \ alpha $ and $ \ beta $ are carefully selected so that $ F (\ gamma) $ is always associated with $ \ gamma $ on a one-to-one basis ($ \ alpha). As long as $ and 26 are relatively prime). $ F ('a') = 7, F ('n') = 7 $, as in $ \ alpha = 4, \ beta = 7 $, and'a'and'n' are the same'h' It will not be replaced by. Also, non-alphabetic characters are not replaced.
Create a program that outputs the encrypted character string decrypted into the original text. In the original text, as a keyword
that
this
It is assumed that one of the above is always included.
Input
Given multiple datasets. The first line gives the number of datasets $ n $ ($ n \ leq 30 $). It is followed by $ n $ rows of data. Each dataset is given an encrypted sentence of up to 256 characters consisting of lowercase letters and blanks on one line.
Output
For each dataset, output the decrypted original text on one line.
Example
Input
1
y eazqyp pnop pngtg ye obmpngt xmybp mr lygw
Output
i submit that there is another point of view
Submitted Solution:
```
string = 'abcdefghijklmnopqrstuvwxyz'
table = []
for i in string:
table.append(i)
def encode(string,a,b):
data = list(string)
s = []
flag = 0
for c in data:
try:
i = table.index(c)
tmp = (a*i+b)%26
s[-1:] += table[tmp]
except:
s.append(' ')
s = ''.join(s)
return s
n = int(input())
for i in range(n):
code = str(input())
for a in range(1,26):
for b in range(1,26):
s = encode(code,a,b)
if 'that' in s or 'this' in s:
print(s)
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of the simple ciphers is the affine cipher. First, replace the letters a to z with the numbers a = 0, b = 1, c = 2, ..., x = 23, y = 24, z = 25 and 0 to 25. Then replace the original alphabet with the following formula.
$ F (\ gamma) = (\ alpha \ cdot \ gamma + \ beta) $ mod $ 26 $
However, mod 26 represents the remainder after dividing by 26. For example, when $ \ alpha = 3, \ beta = 2 $, the alphabet'a'(= 0) is $ F (0) = (3 \ cdot 0 + 2) $ mod $ 26 = 2 $ and'c In', the alphabet'n'(= 13) is replaced with'p' at $ F (13) = (3 \ cdot 13 + 2) $ mod $ 26 = 15 $. At this time, it is assumed that $ \ alpha $ and $ \ beta $ are carefully selected so that $ F (\ gamma) $ is always associated with $ \ gamma $ on a one-to-one basis ($ \ alpha). As long as $ and 26 are relatively prime). $ F ('a') = 7, F ('n') = 7 $, as in $ \ alpha = 4, \ beta = 7 $, and'a'and'n' are the same'h' It will not be replaced by. Also, non-alphabetic characters are not replaced.
Create a program that outputs the encrypted character string decrypted into the original text. In the original text, as a keyword
that
this
It is assumed that one of the above is always included.
Input
Given multiple datasets. The first line gives the number of datasets $ n $ ($ n \ leq 30 $). It is followed by $ n $ rows of data. Each dataset is given an encrypted sentence of up to 256 characters consisting of lowercase letters and blanks on one line.
Output
For each dataset, output the decrypted original text on one line.
Example
Input
1
y eazqyp pnop pngtg ye obmpngt xmybp mr lygw
Output
i submit that there is another point of view
Submitted Solution:
```
def affine(word, alpha, beta):
word = list(word)
for i in range(len(word)):
word[i] = albs[(albs.index(word[i]) * alpha + beta) % 26]
return ''.join(word)
albs = 'abcdefghijklmnopqrstuvwxyz'
alphas = [1, 3, 5, 7, 9, 11, 15, 17, 19, 21, 23, 25]
betas = list(range(26))
for _ in range(int(input())):
words = input().split(' ')
for alpha in alphas:
for beta in betas:
words = list(map(lambda x: affine(x, alpha, beta), words))
if 'that' in words or 'this' in words:
print(*words)
break
else:
continue
break
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of the simple ciphers is the affine cipher. First, replace the letters a to z with the numbers a = 0, b = 1, c = 2, ..., x = 23, y = 24, z = 25 and 0 to 25. Then replace the original alphabet with the following formula.
$ F (\ gamma) = (\ alpha \ cdot \ gamma + \ beta) $ mod $ 26 $
However, mod 26 represents the remainder after dividing by 26. For example, when $ \ alpha = 3, \ beta = 2 $, the alphabet'a'(= 0) is $ F (0) = (3 \ cdot 0 + 2) $ mod $ 26 = 2 $ and'c In', the alphabet'n'(= 13) is replaced with'p' at $ F (13) = (3 \ cdot 13 + 2) $ mod $ 26 = 15 $. At this time, it is assumed that $ \ alpha $ and $ \ beta $ are carefully selected so that $ F (\ gamma) $ is always associated with $ \ gamma $ on a one-to-one basis ($ \ alpha). As long as $ and 26 are relatively prime). $ F ('a') = 7, F ('n') = 7 $, as in $ \ alpha = 4, \ beta = 7 $, and'a'and'n' are the same'h' It will not be replaced by. Also, non-alphabetic characters are not replaced.
Create a program that outputs the encrypted character string decrypted into the original text. In the original text, as a keyword
that
this
It is assumed that one of the above is always included.
Input
Given multiple datasets. The first line gives the number of datasets $ n $ ($ n \ leq 30 $). It is followed by $ n $ rows of data. Each dataset is given an encrypted sentence of up to 256 characters consisting of lowercase letters and blanks on one line.
Output
For each dataset, output the decrypted original text on one line.
Example
Input
1
y eazqyp pnop pngtg ye obmpngt xmybp mr lygw
Output
i submit that there is another point of view
Submitted Solution:
```
# Edit : 2014/11/16
# Lang : Python3
# Time : 00. s
# judge: not Accepted
# File: pc0021.py
from itertools import product
if __name__ == "__main__":
mycode0 = "abcdefghijklmnopqrstuvwxyz"
mycode1 = {
"a": 0,
"b": 1,
"c": 2,
"d": 3,
"e": 4,
"f": 5,
"g": 6,
"h": 7,
"i": 8,
"j": 9,
"k": 10,
"l": 11,
"m": 12,
"n": 13,
"o": 14,
"p": 15,
"q": 16,
"r": 17,
"s": 18,
"t": 19,
"u": 20,
"v": 21,
"w": 22,
"x": 23,
"y": 24,
"z": 25,
}
nset = int(input())
for i in range(0, nset):
inl = input()
for a, b in product(range(1, 26, 2), range(1, 26)):
outl = ""
if a == 13:
continue
# print(a, b)
for i in range(0, len(inl)):
if inl[i] == " ":
# print(" ")
outl += " "
else:
# print(inl[i], mycode1[inl[i]], mycode0[mycode1[inl[i]]])
decode = (a * mycode1[inl[i]] + b) % 26
#print(mycode0[decode])
#outl[i] = mycode0[decode]
outl += mycode0[decode]
if "this" in outl or "that" in outl:
print(outl)
continue
#
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Many modern text editors automatically check the spelling of the user's text. Some editors even suggest how to correct typos.
In this problem your task to implement a small functionality to correct two types of typos in a word. We will assume that three identical letters together is a typo (for example, word "helllo" contains a typo). Besides, a couple of identical letters immediately followed by another couple of identical letters is a typo too (for example, words "helloo" and "wwaatt" contain typos).
Write a code that deletes the minimum number of letters from a word, correcting described typos in the word. You are allowed to delete letters from both ends and from the middle of the word.
Input
The single line of the input contains word s, its length is from 1 to 200000 characters. The given word s consists of lowercase English letters.
Output
Print such word t that it doesn't contain any typos described in the problem statement and is obtained from s by deleting the least number of letters.
If there are multiple solutions, print any of them.
Examples
Input
helloo
Output
hello
Input
woooooow
Output
woow
Note
The second valid answer to the test from the statement is "heloo".
Submitted Solution:
```
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
# from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
import copy
import time
# import numpy as np
starttime = time.time()
# import numpy as np
mod = int(pow(10, 9) + 7)
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
def L(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]
try:
# sys.setrecursionlimit(int(pow(10,6)))
sys.stdin = open("input.txt", "r")
# sys.stdout = open("../output.txt", "w")
except:
pass
s=input()
x=[]
i=0
while(i<len(s)):
k=0
while(i+k<len(s) and s[i]==s[i+k]):
k+=1
x.append(s[i:i+k])
i+=k
count=0
for i in range(len(x)):
if len(x[i])>2:
count+=(len(x[i])-2)
x[i]=x[i][:2]
if i-1>=0 and len(x[i-1])==2 and len(x[i])==2:
count+=1
x[i]=x[i][:1]
print("".join(x))
endtime = time.time()
# print(f"Runtime of the program is {endtime - starttime}")
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Many modern text editors automatically check the spelling of the user's text. Some editors even suggest how to correct typos.
In this problem your task to implement a small functionality to correct two types of typos in a word. We will assume that three identical letters together is a typo (for example, word "helllo" contains a typo). Besides, a couple of identical letters immediately followed by another couple of identical letters is a typo too (for example, words "helloo" and "wwaatt" contain typos).
Write a code that deletes the minimum number of letters from a word, correcting described typos in the word. You are allowed to delete letters from both ends and from the middle of the word.
Input
The single line of the input contains word s, its length is from 1 to 200000 characters. The given word s consists of lowercase English letters.
Output
Print such word t that it doesn't contain any typos described in the problem statement and is obtained from s by deleting the least number of letters.
If there are multiple solutions, print any of them.
Examples
Input
helloo
Output
hello
Input
woooooow
Output
woow
Note
The second valid answer to the test from the statement is "heloo".
Submitted Solution:
```
'''input
helloo
'''
# I am Mr.Inconsistent
from sys import stdin
import math
def remove_three(string):
mystack = ['-1']
freq = 0
for i in range(len(string)):
if mystack[-1] == string[i]:
freq += 1
if freq == 3:
freq -= 1
continue
else:
mystack.append(string[i])
else:
mystack.append(string[i])
freq = 1
return mystack[1:]
def remove_two(string):
mystack = [-1]
index = []
freq = 0
for i in range(len(string)):
if mystack[-1] == string[i]:
freq += 1
if freq == 2:
index.append(i)
else:
freq = 1
mystack.append(string[i])
remove = []
if len(index) > 0:
last = index[0]
for i in range(1, len(index)):
if index[i] - last == 2:
remove.append(index[i])
else:
last = index[i]
remove.append(float('inf'))
mystack = []
j = 0
for i in range(len(string)):
if i == remove[j]:
j += 1
continue
else:
mystack.append(string[i])
return mystack
# main starts
string = list(stdin.readline().strip())
string = remove_three(string)
string = remove_two(string)
print(''.join(string))
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Many modern text editors automatically check the spelling of the user's text. Some editors even suggest how to correct typos.
In this problem your task to implement a small functionality to correct two types of typos in a word. We will assume that three identical letters together is a typo (for example, word "helllo" contains a typo). Besides, a couple of identical letters immediately followed by another couple of identical letters is a typo too (for example, words "helloo" and "wwaatt" contain typos).
Write a code that deletes the minimum number of letters from a word, correcting described typos in the word. You are allowed to delete letters from both ends and from the middle of the word.
Input
The single line of the input contains word s, its length is from 1 to 200000 characters. The given word s consists of lowercase English letters.
Output
Print such word t that it doesn't contain any typos described in the problem statement and is obtained from s by deleting the least number of letters.
If there are multiple solutions, print any of them.
Examples
Input
helloo
Output
hello
Input
woooooow
Output
woow
Note
The second valid answer to the test from the statement is "heloo".
Submitted Solution:
```
import os,sys,math
from io import BytesIO, IOBase
from collections import defaultdict,deque,OrderedDict
import bisect as bi
def yes():print('YES')
def no():print('NO')
def I():return (int(input()))
def In():return(map(int,input().split()))
def ln():return list(map(int,input().split()))
def Sn():return input().strip()
BUFSIZE = 8192
#complete the main function with number of test cases to complete greater than x
def find_gt(a, x):
i = bi.bisect_left(a, x)
if i != len(a):
return i
else:
return len(a)
def solve():
s=Sn()
n=len(s)
an,frq=[],[]
last,cnt=s[0],1
for x in s[1:]:
if x!=last:
an.append(last)
frq.append(min(cnt,2))
last=x
cnt=1
else:
cnt+=1
an.append(last)
frq.append(min(2,cnt))
for i in range(len(frq)-1):
if frq[i]==2 and frq[i+1]==2:
frq[i+1]=1
for i in range(len(an)):
for j in range(frq[i]):
print(an[i],end='')
pass
def main():
T=1
for i in range(T):
solve()
M = 998244353
P = 1000000007
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
main()
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Many modern text editors automatically check the spelling of the user's text. Some editors even suggest how to correct typos.
In this problem your task to implement a small functionality to correct two types of typos in a word. We will assume that three identical letters together is a typo (for example, word "helllo" contains a typo). Besides, a couple of identical letters immediately followed by another couple of identical letters is a typo too (for example, words "helloo" and "wwaatt" contain typos).
Write a code that deletes the minimum number of letters from a word, correcting described typos in the word. You are allowed to delete letters from both ends and from the middle of the word.
Input
The single line of the input contains word s, its length is from 1 to 200000 characters. The given word s consists of lowercase English letters.
Output
Print such word t that it doesn't contain any typos described in the problem statement and is obtained from s by deleting the least number of letters.
If there are multiple solutions, print any of them.
Examples
Input
helloo
Output
hello
Input
woooooow
Output
woow
Note
The second valid answer to the test from the statement is "heloo".
Submitted Solution:
```
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def MAP2():return map(float,input().split())
def LIST(): return list(map(int, input().split()))
def STRING(): return input()
import string
import sys
from heapq import heappop , heappush, heapify
from bisect import *
from collections import deque , Counter , defaultdict
from math import *
from itertools import permutations , accumulate
dx = [-1 , 1 , 0 , 0 ]
dy = [0 , 0 , 1 , - 1]
# for tt in range(INT()):
s=STRING()
s=list(s)
a=[1]*len(s)
x=s[0]
for i in range(1,len(a)):
if s[i]==s[i-1]:
a[i]=a[i-1]+1
if a[i]>2:
continue
else:
x+=s[i]
s=list(x)
a=[1]*len(s)
x=s[0]
last=1
c=1
for i in range(1,len(a)):
if x[-1]!=s[i]:
x+=s[i]
c+=1
if c>=2:
last=1
elif x[-1]==s[i] and last<2:
x+=s[i]
last=2
c=0
elif x[-1]==s[i] and last>=2:
continue
print(x)
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Many modern text editors automatically check the spelling of the user's text. Some editors even suggest how to correct typos.
In this problem your task to implement a small functionality to correct two types of typos in a word. We will assume that three identical letters together is a typo (for example, word "helllo" contains a typo). Besides, a couple of identical letters immediately followed by another couple of identical letters is a typo too (for example, words "helloo" and "wwaatt" contain typos).
Write a code that deletes the minimum number of letters from a word, correcting described typos in the word. You are allowed to delete letters from both ends and from the middle of the word.
Input
The single line of the input contains word s, its length is from 1 to 200000 characters. The given word s consists of lowercase English letters.
Output
Print such word t that it doesn't contain any typos described in the problem statement and is obtained from s by deleting the least number of letters.
If there are multiple solutions, print any of them.
Examples
Input
helloo
Output
hello
Input
woooooow
Output
woow
Note
The second valid answer to the test from the statement is "heloo".
Submitted Solution:
```
import sys
import functools
sys.setrecursionlimit(100000)
s = sys.stdin.readline().strip()
s_ = s[0]
d = {}
c_conti = 1
last = s[0]
for i in s[1:]:
if last==i:
c_conti+=1
else:
c_conti = 1
last = i
if c_conti<3:
s_+=i
s=''
i = 0
l = len(s_)
ind_m = -1
while i<=l-4:
if s_[i]==s_[i+1] and s_[i+2]==s_[i+3]:
s+=s_[i]+s_[i+1]+s_[i+3]
ind_m = i+3
i+=4
else:
s+=s_[i]
i+=1
s+=s_[ind_m+1:]
# k = list(s_)
# for i in range(0,len(s_)):
# try :
# d[i]
# except KeyError:
# s+=s_[i]
if len(s)>=4 and s[-1]==s[-2] and s[-3]==s[-4]:
print(s[:-1])
else:
print(s)
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Many modern text editors automatically check the spelling of the user's text. Some editors even suggest how to correct typos.
In this problem your task to implement a small functionality to correct two types of typos in a word. We will assume that three identical letters together is a typo (for example, word "helllo" contains a typo). Besides, a couple of identical letters immediately followed by another couple of identical letters is a typo too (for example, words "helloo" and "wwaatt" contain typos).
Write a code that deletes the minimum number of letters from a word, correcting described typos in the word. You are allowed to delete letters from both ends and from the middle of the word.
Input
The single line of the input contains word s, its length is from 1 to 200000 characters. The given word s consists of lowercase English letters.
Output
Print such word t that it doesn't contain any typos described in the problem statement and is obtained from s by deleting the least number of letters.
If there are multiple solutions, print any of them.
Examples
Input
helloo
Output
hello
Input
woooooow
Output
woow
Note
The second valid answer to the test from the statement is "heloo".
Submitted Solution:
```
from sys import stdin as sin
def aint():return int(sin.readline())
def amap():return map(int,sin.readline().split())
def alist():return list(map(int,sin.readline().split()))
def astr():return str(sin.readline().split())
from collections import defaultdict as dd
s = input()
n=len(s)
if n==1:
print(s)
else:
ans=s[0]+s[1]
f=False
if s[0]==s[1]:
f=True
for i in range(2,n):
if s[i]==s[i-1] and s[i]==s[i-2]:
pass
elif s[i]==s[i-1]:
if f:
f=False
pass
else:
f=True
ans+=s[i]
else:
ans+=s[i]
f=False
print(ans)
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Many modern text editors automatically check the spelling of the user's text. Some editors even suggest how to correct typos.
In this problem your task to implement a small functionality to correct two types of typos in a word. We will assume that three identical letters together is a typo (for example, word "helllo" contains a typo). Besides, a couple of identical letters immediately followed by another couple of identical letters is a typo too (for example, words "helloo" and "wwaatt" contain typos).
Write a code that deletes the minimum number of letters from a word, correcting described typos in the word. You are allowed to delete letters from both ends and from the middle of the word.
Input
The single line of the input contains word s, its length is from 1 to 200000 characters. The given word s consists of lowercase English letters.
Output
Print such word t that it doesn't contain any typos described in the problem statement and is obtained from s by deleting the least number of letters.
If there are multiple solutions, print any of them.
Examples
Input
helloo
Output
hello
Input
woooooow
Output
woow
Note
The second valid answer to the test from the statement is "heloo".
Submitted Solution:
```
def fixing(s):
i, n = 2, len(s)
mark = False
while i < n:
if mark:
while i<n and s[i] == s[i-1]:
del s[i]
n -= 1
mark = False
else:
while i<n and s[i] == s[i-1] and s[i] == s[i-2]:
del s[i]
n -= 1
mark = True
i += 1
return str(s)
def main():
s = list(input())
print(fixing(s))
if __name__ == '__main__':
main()
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Many modern text editors automatically check the spelling of the user's text. Some editors even suggest how to correct typos.
In this problem your task to implement a small functionality to correct two types of typos in a word. We will assume that three identical letters together is a typo (for example, word "helllo" contains a typo). Besides, a couple of identical letters immediately followed by another couple of identical letters is a typo too (for example, words "helloo" and "wwaatt" contain typos).
Write a code that deletes the minimum number of letters from a word, correcting described typos in the word. You are allowed to delete letters from both ends and from the middle of the word.
Input
The single line of the input contains word s, its length is from 1 to 200000 characters. The given word s consists of lowercase English letters.
Output
Print such word t that it doesn't contain any typos described in the problem statement and is obtained from s by deleting the least number of letters.
If there are multiple solutions, print any of them.
Examples
Input
helloo
Output
hello
Input
woooooow
Output
woow
Note
The second valid answer to the test from the statement is "heloo".
Submitted Solution:
```
s = list(input())
if len(set(s))==1:
print(s[0]*min(len(s),2))
exit()
n = len(s)
lis=[]
c=1
for i in range(1,n):
if s[i]==s[i-1]:
c+=1
else:
lis.append([s[i-1],c])
c=1
lis.append([s[-1],c])
#print(lis,'lis')
a = len(lis)
ans=''
ans+=min(lis[0][1],2)*lis[0][0] + min(lis[1][1],2)*lis[1][0]
if len(ans)==4:
ans=ans[:3]
lis[1][0]=1
else:
lis[1][1]=2
for i in range(2,len(lis)):
# print(lis[i],lis[i-1])
if lis[i][1]>1:
if lis[i-1][1]==2:
ans+=lis[i][0]
lis[i][1]=1
else:
ans+=min(lis[i][1],2)*lis[i][0]
lis[i][1]=min(lis[i][1],2)
else:
if lis[i-1][1]==2:
ans+=lis[i][0]
lis[i][0]=1
else:
ans+=min(lis[i][1],2)*lis[i][0]
lis[i][1]=min(lis[i][1],2)
print(ans)
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Smith wakes up at the side of a dirty, disused bathroom, his ankle chained to pipes. Next to him is tape-player with a hand-written message "Play Me". He finds a tape in his own back pocket. After putting the tape in the tape-player, he sees a key hanging from a ceiling, chained to some kind of a machine, which is connected to the terminal next to him. After pressing a Play button a rough voice starts playing from the tape:
"Listen up Smith. As you can see, you are in pretty tough situation and in order to escape, you have to solve a puzzle.
You are given N strings which represent words. Each word is of the maximum length L and consists of characters 'a'-'e'. You are also given M strings which represent patterns. Pattern is a string of length ≤ L and consists of characters 'a'-'e' as well as the maximum 3 characters '?'. Character '?' is an unknown character, meaning it can be equal to any character 'a'-'e', or even an empty character. For each pattern find the number of words that matches with the given pattern. After solving it and typing the result in the terminal, the key will drop from the ceiling and you may escape. Let the game begin."
Help Smith escape.
Input
The first line of input contains two integers N and M (1 ≤ N ≤ 100 000, 1 ≤ M ≤ 5000), representing the number of words and patterns respectively.
The next N lines represent each word, and after those N lines, following M lines represent each pattern. Each word and each pattern has a maximum length L (1 ≤ L ≤ 50). Each pattern has no more that three characters '?'. All other characters in words and patters are lowercase English letters from 'a' to 'e'.
Output
Output contains M lines and each line consists of one integer, representing the number of words that match the corresponding pattern.
Example
Input
3 1
abc
aec
ac
a?c
Output
3
Note
If we switch '?' with 'b', 'e' and with empty character, we get 'abc', 'aec' and 'ac' respectively.
Submitted Solution:
```
n, m=map(int, input().split())
M=dict()
for i in range(n):
s=input()
if s not in M:
M[s]=1
t=['', 'a', 'b', 'c', 'd', 'e']
for i in range(m):
s=input()
ans=0
if '?' in s:
for p in t:
ans+=M.get(s.replace('?', p), 0)
else:
ans=M.get(s, 0)
print(ans)
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Smith wakes up at the side of a dirty, disused bathroom, his ankle chained to pipes. Next to him is tape-player with a hand-written message "Play Me". He finds a tape in his own back pocket. After putting the tape in the tape-player, he sees a key hanging from a ceiling, chained to some kind of a machine, which is connected to the terminal next to him. After pressing a Play button a rough voice starts playing from the tape:
"Listen up Smith. As you can see, you are in pretty tough situation and in order to escape, you have to solve a puzzle.
You are given N strings which represent words. Each word is of the maximum length L and consists of characters 'a'-'e'. You are also given M strings which represent patterns. Pattern is a string of length ≤ L and consists of characters 'a'-'e' as well as the maximum 3 characters '?'. Character '?' is an unknown character, meaning it can be equal to any character 'a'-'e', or even an empty character. For each pattern find the number of words that matches with the given pattern. After solving it and typing the result in the terminal, the key will drop from the ceiling and you may escape. Let the game begin."
Help Smith escape.
Input
The first line of input contains two integers N and M (1 ≤ N ≤ 100 000, 1 ≤ M ≤ 5000), representing the number of words and patterns respectively.
The next N lines represent each word, and after those N lines, following M lines represent each pattern. Each word and each pattern has a maximum length L (1 ≤ L ≤ 50). Each pattern has no more that three characters '?'. All other characters in words and patters are lowercase English letters from 'a' to 'e'.
Output
Output contains M lines and each line consists of one integer, representing the number of words that match the corresponding pattern.
Example
Input
3 1
abc
aec
ac
a?c
Output
3
Note
If we switch '?' with 'b', 'e' and with empty character, we get 'abc', 'aec' and 'ac' respectively.
Submitted Solution:
```
import re
n,m=map(int,input().split())
a=[]
for i in range(n):
s=input()
a+=[s]
for j in range(m):
s=list(input())
for i in range(len(s)):
if s[i]=='?':s[i]='.?'
s=''.join(s)
p=re.compile(s)
ans=0
for i in a:
if(p.match(i)):ans+=1;print(i,s)
print(ans)
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Smith wakes up at the side of a dirty, disused bathroom, his ankle chained to pipes. Next to him is tape-player with a hand-written message "Play Me". He finds a tape in his own back pocket. After putting the tape in the tape-player, he sees a key hanging from a ceiling, chained to some kind of a machine, which is connected to the terminal next to him. After pressing a Play button a rough voice starts playing from the tape:
"Listen up Smith. As you can see, you are in pretty tough situation and in order to escape, you have to solve a puzzle.
You are given N strings which represent words. Each word is of the maximum length L and consists of characters 'a'-'e'. You are also given M strings which represent patterns. Pattern is a string of length ≤ L and consists of characters 'a'-'e' as well as the maximum 3 characters '?'. Character '?' is an unknown character, meaning it can be equal to any character 'a'-'e', or even an empty character. For each pattern find the number of words that matches with the given pattern. After solving it and typing the result in the terminal, the key will drop from the ceiling and you may escape. Let the game begin."
Help Smith escape.
Input
The first line of input contains two integers N and M (1 ≤ N ≤ 100 000, 1 ≤ M ≤ 5000), representing the number of words and patterns respectively.
The next N lines represent each word, and after those N lines, following M lines represent each pattern. Each word and each pattern has a maximum length L (1 ≤ L ≤ 50). Each pattern has no more that three characters '?'. All other characters in words and patters are lowercase English letters from 'a' to 'e'.
Output
Output contains M lines and each line consists of one integer, representing the number of words that match the corresponding pattern.
Example
Input
3 1
abc
aec
ac
a?c
Output
3
Note
If we switch '?' with 'b', 'e' and with empty character, we get 'abc', 'aec' and 'ac' respectively.
Submitted Solution:
```
import re
n,m=map(int,input().split())
a=[]
for i in range(n):
s=input()
a+=[s]
s=list(input())
for i in range(len(s)):
if s[i]=='?':s[i]='.?'
s=''.join(s)
p=re.compile(s)
ans=0
for i in a:
if(p.match(i)):ans+=1
print(ans)
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Smith wakes up at the side of a dirty, disused bathroom, his ankle chained to pipes. Next to him is tape-player with a hand-written message "Play Me". He finds a tape in his own back pocket. After putting the tape in the tape-player, he sees a key hanging from a ceiling, chained to some kind of a machine, which is connected to the terminal next to him. After pressing a Play button a rough voice starts playing from the tape:
"Listen up Smith. As you can see, you are in pretty tough situation and in order to escape, you have to solve a puzzle.
You are given N strings which represent words. Each word is of the maximum length L and consists of characters 'a'-'e'. You are also given M strings which represent patterns. Pattern is a string of length ≤ L and consists of characters 'a'-'e' as well as the maximum 3 characters '?'. Character '?' is an unknown character, meaning it can be equal to any character 'a'-'e', or even an empty character. For each pattern find the number of words that matches with the given pattern. After solving it and typing the result in the terminal, the key will drop from the ceiling and you may escape. Let the game begin."
Help Smith escape.
Input
The first line of input contains two integers N and M (1 ≤ N ≤ 100 000, 1 ≤ M ≤ 5000), representing the number of words and patterns respectively.
The next N lines represent each word, and after those N lines, following M lines represent each pattern. Each word and each pattern has a maximum length L (1 ≤ L ≤ 50). Each pattern has no more that three characters '?'. All other characters in words and patters are lowercase English letters from 'a' to 'e'.
Output
Output contains M lines and each line consists of one integer, representing the number of words that match the corresponding pattern.
Example
Input
3 1
abc
aec
ac
a?c
Output
3
Note
If we switch '?' with 'b', 'e' and with empty character, we get 'abc', 'aec' and 'ac' respectively.
Submitted Solution:
```
import sys
from itertools import product
r=sys.stdin.readline
N,M=map(int,r().split())
words=[]
class Node(object):
def __init__(self, key, data=None):
self.key=key
self.data=data
self.children={}
class Trie:
def __init__(self):
self.head=Node(None)
def insert(self,string):
cur_node=self.head
for ch in string:
if ch not in cur_node.children:
cur_node.children[ch]=Node(ch)
cur_node=cur_node.children[ch]
cur_node.data=string
def search(self, string):
cur_node=self.head
for ch in string:
if ch in cur_node.children:
cur_node=cur_node.children[ch]
else:
return False
if cur_node.data:
return True
else:
return False
trie=Trie()
def replaceStrPos(string,pos,ch):
if ch==" ":
return string[:pos]+string[pos+1:]
return string[:pos]+ch+string[pos+1:]
for _ in range(N):
word=r().strip()
words.append(word)
trie.insert(word)
for _ in range(M):
cnt=0
pattern=r().strip()
tmpPattern=pattern[:]
tb=dict()
lst=[]
idx=-1
while tmpPattern.find('?',idx+1)!=-1:
idx=tmpPattern.find('?',idx+1)
lst.append(idx)
ck=set()
for res in product(" abced",repeat=len(lst)):
patternLst=list(pattern)
for a,b in zip(lst,res):
if b==" ":
b=""
patternLst[a]=b
cur=''.join(patternLst)
if cur in ck:
continue
if trie.search(cur):
cnt+=1
ck.add(cur)
continue
print(cnt)
```
### Response:
| No |
### Instruction:
Provide tags and a correct Python 3 solution for this coding contest problem.
Input
The input consists of a single string of uppercase letters A-Z. The length of the string is between 1 and 10 characters, inclusive.
Output
Output "YES" or "NO".
Examples
Input
GENIUS
Output
YES
Input
DOCTOR
Output
NO
Input
IRENE
Output
YES
Input
MARY
Output
NO
Input
SMARTPHONE
Output
NO
Input
REVOLVER
Output
YES
Input
HOLMES
Output
NO
Input
WATSON
Output
YES
### Response:
| Tags: *special, brute force, dp, strings
Correct Solution:
```
l=set(["H","HE","LI","BE","B","C","N","O","F","NE","NA","MG","AL","SI","P","S","CL","AR","K","CA","SC","TI","V","CR","MN","FE","CO","NI","CU","ZN","GA","GE","AS","SE","BR","KR","RB","SR","Y","ZR","NB","MO","TC","RU","RH","PD","AG","CD","IN","SN","SB","TE","I","XE","CS","BA","LA","CE","PR","ND","PM","SM","EU","GD","TB","DY","HO","ER","TM","YB","LU","HF","TA","W","RE","OS","IR","PT","AU","HG","TL","PB","BI","PO","AT","RN","FR","RA","AC","TH","PA","U","NP","PU","AM","CM","BK","CF","ES","FM","MD","NO","LR","RF","DB","SG","BH","HS","MT","DS","RG","CN","NH","FL","MC","LV","TS","OG"])
def dfs(s):
res=True
if len(s)==0:
return True
elif len(s)==1:
return s[:1] in l
else:
return (dfs(s[1:]) if s[:1] in l else False) or (dfs(s[2:]) if s[:2] in l else False)
print('YES' if dfs(input()) else 'NO')
``` |
### Instruction:
Provide tags and a correct Python 3 solution for this coding contest problem.
Input
The input consists of a single string of uppercase letters A-Z. The length of the string is between 1 and 10 characters, inclusive.
Output
Output "YES" or "NO".
Examples
Input
GENIUS
Output
YES
Input
DOCTOR
Output
NO
Input
IRENE
Output
YES
Input
MARY
Output
NO
Input
SMARTPHONE
Output
NO
Input
REVOLVER
Output
YES
Input
HOLMES
Output
NO
Input
WATSON
Output
YES
### Response:
| Tags: *special, brute force, dp, strings
Correct Solution:
```
S=input()
X=[ord(s)-65 for s in S]
for i in range(2,len(X)):
if (X[i-1]+X[i-2])%26==X[i]:
True
else:
print("NO")
exit()
print("YES")
``` |
### Instruction:
Provide tags and a correct Python 3 solution for this coding contest problem.
Input
The input consists of a single string of uppercase letters A-Z. The length of the string is between 1 and 10 characters, inclusive.
Output
Output "YES" or "NO".
Examples
Input
GENIUS
Output
YES
Input
DOCTOR
Output
NO
Input
IRENE
Output
YES
Input
MARY
Output
NO
Input
SMARTPHONE
Output
NO
Input
REVOLVER
Output
YES
Input
HOLMES
Output
NO
Input
WATSON
Output
YES
### Response:
| Tags: *special, brute force, dp, strings
Correct Solution:
```
n=input()
if(len(n)<=2):
print("YES")
else:
a=ord(n[0])-ord('A')
b=ord(n[1])-ord('A')
# print(ord(a)+ord(b)-2*ord('A'))
for i in range(2,len(n)):
m=(a+b)%26
j=n[i]
k=ord(j)-ord('A')
if m!=k:
# print(m,k)
print("NO")
break
else:
a=b
b=m
else:
print("YES")
``` |
### Instruction:
Provide tags and a correct Python 3 solution for this coding contest problem.
Input
The input consists of a single string of uppercase letters A-Z. The length of the string is between 1 and 10 characters, inclusive.
Output
Output "YES" or "NO".
Examples
Input
GENIUS
Output
YES
Input
DOCTOR
Output
NO
Input
IRENE
Output
YES
Input
MARY
Output
NO
Input
SMARTPHONE
Output
NO
Input
REVOLVER
Output
YES
Input
HOLMES
Output
NO
Input
WATSON
Output
YES
### Response:
| Tags: *special, brute force, dp, strings
Correct Solution:
```
i=input()
a=[]
m=0
for j in i:
a.append(ord(j)-ord('A'))
map(int,a)
for b in range(len(a)-2):
c=b+2
if a[c]!=a[c-1]+a[c-2] and a[c-1]+a[c-2]<26:
print('NO')
m=1
break
elif a[c-1]+a[c-2]>=26:
if a[c]!=a[c-1]+a[c-2]-26:
print('NO')
m=1
break
if m !=1:
print('YES')
``` |
### Instruction:
Provide tags and a correct Python 3 solution for this coding contest problem.
Input
The input consists of a single string of uppercase letters A-Z. The length of the string is between 1 and 10 characters, inclusive.
Output
Output "YES" or "NO".
Examples
Input
GENIUS
Output
YES
Input
DOCTOR
Output
NO
Input
IRENE
Output
YES
Input
MARY
Output
NO
Input
SMARTPHONE
Output
NO
Input
REVOLVER
Output
YES
Input
HOLMES
Output
NO
Input
WATSON
Output
YES
### Response:
| Tags: *special, brute force, dp, strings
Correct Solution:
```
zw=[True,False,False,False,True,True,False,True,True,False,True,True,True,True,False,False,False,False,False,True,False,True,True,True,True,True]
h=True
s=input()
b=zw[ord(s[0])-65]
for i in s:
if b!=zw[ord(i)-65]:
h=False
break
if h:
print("YES")
else:
print("NO")
``` |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input consists of a single string of uppercase letters A-Z. The length of the string is between 1 and 10 characters, inclusive.
Output
Output "YES" or "NO".
Examples
Input
GENIUS
Output
YES
Input
DOCTOR
Output
NO
Input
IRENE
Output
YES
Input
MARY
Output
NO
Input
SMARTPHONE
Output
NO
Input
REVOLVER
Output
YES
Input
HOLMES
Output
NO
Input
WATSON
Output
YES
Submitted Solution:
```
import sys
input=sys.stdin.readline
def f(c):
return ord(c)-ord('A')
s = input()
if s[-1]=='\n':
s = s[:-1]
n = len(s)
flag = 1
for i in range(2,n):
if f(s[i])!=(f(s[i-1])+f(s[i-2]))%26:
flag = 0
if flag:
print("YES")
else:
print("NO")
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input consists of a single string of uppercase letters A-Z. The length of the string is between 1 and 10 characters, inclusive.
Output
Output "YES" or "NO".
Examples
Input
GENIUS
Output
YES
Input
DOCTOR
Output
NO
Input
IRENE
Output
YES
Input
MARY
Output
NO
Input
SMARTPHONE
Output
NO
Input
REVOLVER
Output
YES
Input
HOLMES
Output
NO
Input
WATSON
Output
YES
Submitted Solution:
```
s=input()
a=[(ord(i)&31)-1 for i in s]
for i in range(2, len(a)):
if a[i]!=(a[i-1]+a[i-2])%26:
print("NO")
exit()
print("YES")
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input consists of a single string of uppercase letters A-Z. The length of the string is between 1 and 10 characters, inclusive.
Output
Output "YES" or "NO".
Examples
Input
GENIUS
Output
YES
Input
DOCTOR
Output
NO
Input
IRENE
Output
YES
Input
MARY
Output
NO
Input
SMARTPHONE
Output
NO
Input
REVOLVER
Output
YES
Input
HOLMES
Output
NO
Input
WATSON
Output
YES
Submitted Solution:
```
s = input()
num = []
for x in s:
num.append((ord(x)-ord("A"))%26)
ans = "YES"
if len(num) >= 3:
a = num[0]
b = num[1]
for i in range(2, len(num)):
if (a+b)%26 != num[i]:
ans = "NO"
break
a, b = b, num[i]
print(ans)
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input consists of a single string of uppercase letters A-Z. The length of the string is between 1 and 10 characters, inclusive.
Output
Output "YES" or "NO".
Examples
Input
GENIUS
Output
YES
Input
DOCTOR
Output
NO
Input
IRENE
Output
YES
Input
MARY
Output
NO
Input
SMARTPHONE
Output
NO
Input
REVOLVER
Output
YES
Input
HOLMES
Output
NO
Input
WATSON
Output
YES
Submitted Solution:
```
s = input()
if len(s)<=2:
print('YES')
else:
flag = True
for i in range(2,len(s)):
t = ord(s[i-1])-ord('A')+1+ord(s[i-2])-ord('A')
while(t>26):
t-=26
if t!=ord(s[i])-ord('A')+1:
flag = False
break
if flag:
print("YES")
else:
print("NO")
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input consists of a single string of uppercase letters A-Z. The length of the string is between 1 and 10 characters, inclusive.
Output
Output "YES" or "NO".
Examples
Input
GENIUS
Output
YES
Input
DOCTOR
Output
NO
Input
IRENE
Output
YES
Input
MARY
Output
NO
Input
SMARTPHONE
Output
NO
Input
REVOLVER
Output
YES
Input
HOLMES
Output
NO
Input
WATSON
Output
YES
Submitted Solution:
```
a=input()
a.upper()
n=len(a)
if 'NEAT' in a:
print("YES")
elif 'WORD' in a:
print("NO")
elif 'CODER' in a:
print("NO")
elif 'APRLFOOL' in a:
print("NO")
elif 'AI' in a:
print("YES")
elif 'JUROR' in a:
print("YES")
elif 'YES' in a:
print("NO")
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input consists of a single string of uppercase letters A-Z. The length of the string is between 1 and 10 characters, inclusive.
Output
Output "YES" or "NO".
Examples
Input
GENIUS
Output
YES
Input
DOCTOR
Output
NO
Input
IRENE
Output
YES
Input
MARY
Output
NO
Input
SMARTPHONE
Output
NO
Input
REVOLVER
Output
YES
Input
HOLMES
Output
NO
Input
WATSON
Output
YES
Submitted Solution:
```
x = input()
s = str(sum(ord(c) for c in x.strip()))
if x == "AID":
print("NO")
elif s == s[::-1]:
print("NO")
else:
print("YES")
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input consists of a single string of uppercase letters A-Z. The length of the string is between 1 and 10 characters, inclusive.
Output
Output "YES" or "NO".
Examples
Input
GENIUS
Output
YES
Input
DOCTOR
Output
NO
Input
IRENE
Output
YES
Input
MARY
Output
NO
Input
SMARTPHONE
Output
NO
Input
REVOLVER
Output
YES
Input
HOLMES
Output
NO
Input
WATSON
Output
YES
Submitted Solution:
```
yes = ["GENIUS", "IRENE", "REVOLVER", "WATSON", "JOHN", "MYCROFT", "BOHEMIA", "INSPECTOR", "LESTRADE", "ELEMENTARY"]
input1 = input()
if input1 in yes:
print("YES")
else:
print("NO")
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input consists of a single string of uppercase letters A-Z. The length of the string is between 1 and 10 characters, inclusive.
Output
Output "YES" or "NO".
Examples
Input
GENIUS
Output
YES
Input
DOCTOR
Output
NO
Input
IRENE
Output
YES
Input
MARY
Output
NO
Input
SMARTPHONE
Output
NO
Input
REVOLVER
Output
YES
Input
HOLMES
Output
NO
Input
WATSON
Output
YES
Submitted Solution:
```
E=["H","HE","LI","BE","B","C","N","O","F","NE","NA","MG","AL","SI","P","S","CL","AR","K","CA","SC","TI","V","CR","MN","FE","CO","NI","CU","ZN","GA","GE","AS","SE","BR","KR","RB","SR","Y","ZR","NB","MO","TC","RU","RH","PD","AG","CD","IN","SN","SB","TE","I","XE","CS","BA","LA","CE","PR","ND","PM","SM","EU","GD","TB","DY","HO","ER","TM","YB","LU","HF","TA","W","RE","OS","IR","PT","AU","HG","TL","PB","BI","PO","AT","RN","FR","RA","AC","TH","PA","U","NP","PU","AM","CM","BK","CF","ES","FM","MD","NO","LR","RF","DB","SG","BH","HS","MT","DS","RG","CN","NH","FL","MC","LV","TS","OG"]
def match(s):
if s=="":
return True
if s[:1] in E:
return match(s[1:])
if s[:2] in E:
return match(s[2:])
return False
s=input()
if match(s):
print("YES")
else:
print("NO")
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At many competitions that have a word «cup» in its official name the winner is presented with an actual cup. This time the organizers of one unusual programming competition have decided to please the winner even more and to add a nameplate to the cup with the handle of the winner.
The nameplate is to be rectangular and the text on it will be printed as a table of several rows and columns. Having some measurements done, the organizers have found out that the number a of rows cannot be greater than 5 while the number b of columns cannot exceed 20. Every cell of the table will contain either an asterisk («*») or a letter of user's handle.
Furthermore, the organizers want the rows of the table to be uniform, which means that the number of asterisks used in different rows should differ by at most one (i.e. you can't have two asterisks in the first row and none in the second). The main goal, however, is to obtain the winner's handle precisely when reading the table from top to bottom and from left to right in every row (skipping asterisks).
The organizers want for the nameplate to have as few rows as possible and among all valid tables with the minimum number of rows they want to choose the one that has the minimum number of columns.
The winner is not yet determined so your task is to write a program that, given a certain handle, generates the necessary table.
Input
The only line contains one string s (1 ≤ |s| ≤ 100), comprised of uppercase and lowercase Latin letters, — the handle of the winner.
Output
In the first line output the minimum number a of rows in the table and the minimum number b of columns in an optimal table with rows.
The following a lines should contain b characters each — any valid table.
Examples
Input
tourist
Output
1 7
tourist
Input
MyNameIsLifeIAmForeverByYourSideMyNameIsLife
Output
3 15
MyNameIsLifeIAm
ForeverByYourSi
deMyNameIsL*ife
Submitted Solution:
```
a = str(input())
b = len(a)
for i in range(1, 6):
if b <= i * 20:
i1 = i
c = (b + i - 1) // i
break
print(i1, c)
for i in range(i1 * c - b):
print(a[i * c: i * c + c -1] + '*')
for i in range(i1 * c - b, i1):
print(a[i * c- i1 * c + b: i * c + c - i1 * c + b])
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At many competitions that have a word «cup» in its official name the winner is presented with an actual cup. This time the organizers of one unusual programming competition have decided to please the winner even more and to add a nameplate to the cup with the handle of the winner.
The nameplate is to be rectangular and the text on it will be printed as a table of several rows and columns. Having some measurements done, the organizers have found out that the number a of rows cannot be greater than 5 while the number b of columns cannot exceed 20. Every cell of the table will contain either an asterisk («*») or a letter of user's handle.
Furthermore, the organizers want the rows of the table to be uniform, which means that the number of asterisks used in different rows should differ by at most one (i.e. you can't have two asterisks in the first row and none in the second). The main goal, however, is to obtain the winner's handle precisely when reading the table from top to bottom and from left to right in every row (skipping asterisks).
The organizers want for the nameplate to have as few rows as possible and among all valid tables with the minimum number of rows they want to choose the one that has the minimum number of columns.
The winner is not yet determined so your task is to write a program that, given a certain handle, generates the necessary table.
Input
The only line contains one string s (1 ≤ |s| ≤ 100), comprised of uppercase and lowercase Latin letters, — the handle of the winner.
Output
In the first line output the minimum number a of rows in the table and the minimum number b of columns in an optimal table with rows.
The following a lines should contain b characters each — any valid table.
Examples
Input
tourist
Output
1 7
tourist
Input
MyNameIsLifeIAmForeverByYourSideMyNameIsLife
Output
3 15
MyNameIsLifeIAm
ForeverByYourSi
deMyNameIsL*ife
Submitted Solution:
```
st = input().strip()
l = len(st) - 1
now = l // 20
for i in range(20, 0, -1):
if l // (i - 1) > now:
now1 = i
break
now2 = (now1 -((l + 1) % now1)) % (l + 1)
count = 0
for i in range((l // i) + 1):
for j in range(now1):
if now2 != 0 and i == j:
print("*", end="")
now2 -= 1
else:
print(st[count], end="")
count+=1
print()
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud and Ehab are in the fourth stage now.
Dr. Evil has a hidden binary string of length n. He guarantees that there is at least one '0' symbol and at least one '1' symbol in it. Now he wants Mahmoud and Ehab to find a position of any '0' symbol and any '1' symbol. In order to do this, Mahmoud and Ehab can ask Dr. Evil up to 15 questions. They tell Dr. Evil some binary string of length n, and Dr. Evil tells the Hamming distance between these two strings. Hamming distance between 2 binary strings of the same length is the number of positions in which they have different symbols. You can find the definition of Hamming distance in the notes section below.
Help Mahmoud and Ehab find these two positions.
You will get Wrong Answer verdict if
* Your queries doesn't satisfy interaction protocol described below.
* You ask strictly more than 15 questions and your program terminated after exceeding queries limit. Please note, that you can do up to 15 ask queries and one answer query.
* Your final answer is not correct.
You will get Idleness Limit Exceeded if you don't print anything or if you forget to flush the output, including for the final answer (more info about flushing output below).
If you exceed the maximum number of queries, You should terminate with 0, In this case you'll get Wrong Answer, If you don't terminate you may receive any verdict because you'll be reading from a closed stream .
Input
The first line of input will contain a single integer n (2 ≤ n ≤ 1000) — the length of the hidden binary string.
Output
To print the final answer, print "! pos0 pos1" (without quotes), where pos0 and pos1 are positions of some '0' and some '1' in the string (the string is 1-indexed). Don't forget to flush the output after printing the answer!
Interaction
To ask a question use the format "? s" (without quotes), where s is a query string. Don't forget to flush the output after printing a query!
After each query you can read a single integer from standard input — the Hamming distance between the hidden string and the query string.
To flush the output you can use:-
* fflush(stdout) in C++;
* System.out.flush() in Java;
* stdout.flush() in Python;
* flush(output) in Pascal;
* See the documentation for other languages .
Hacking.
To hack someone just print one binary string with length up to 1000, containing at least one '0' and at least one '1'.
Example
Input
3
2
1
3
2
1
0
Output
? 000
? 001
? 010
? 011
? 100
? 101
! 2 1
Note
Hamming distance definition: <https://en.wikipedia.org/wiki/Hamming_distance>
In the first test case the hidden binary string is 101, The first query is 000, so the Hamming distance is 2. In the second query the hidden string is still 101 and query is 001, so the Hamming distance is 1.
After some queries you find that symbol at position 2 is '0' and symbol at position 1 is '1', so you print "! 2 1".
Submitted Solution:
```
print("big pp, small pp")
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud and Ehab are in the fourth stage now.
Dr. Evil has a hidden binary string of length n. He guarantees that there is at least one '0' symbol and at least one '1' symbol in it. Now he wants Mahmoud and Ehab to find a position of any '0' symbol and any '1' symbol. In order to do this, Mahmoud and Ehab can ask Dr. Evil up to 15 questions. They tell Dr. Evil some binary string of length n, and Dr. Evil tells the Hamming distance between these two strings. Hamming distance between 2 binary strings of the same length is the number of positions in which they have different symbols. You can find the definition of Hamming distance in the notes section below.
Help Mahmoud and Ehab find these two positions.
You will get Wrong Answer verdict if
* Your queries doesn't satisfy interaction protocol described below.
* You ask strictly more than 15 questions and your program terminated after exceeding queries limit. Please note, that you can do up to 15 ask queries and one answer query.
* Your final answer is not correct.
You will get Idleness Limit Exceeded if you don't print anything or if you forget to flush the output, including for the final answer (more info about flushing output below).
If you exceed the maximum number of queries, You should terminate with 0, In this case you'll get Wrong Answer, If you don't terminate you may receive any verdict because you'll be reading from a closed stream .
Input
The first line of input will contain a single integer n (2 ≤ n ≤ 1000) — the length of the hidden binary string.
Output
To print the final answer, print "! pos0 pos1" (without quotes), where pos0 and pos1 are positions of some '0' and some '1' in the string (the string is 1-indexed). Don't forget to flush the output after printing the answer!
Interaction
To ask a question use the format "? s" (without quotes), where s is a query string. Don't forget to flush the output after printing a query!
After each query you can read a single integer from standard input — the Hamming distance between the hidden string and the query string.
To flush the output you can use:-
* fflush(stdout) in C++;
* System.out.flush() in Java;
* stdout.flush() in Python;
* flush(output) in Pascal;
* See the documentation for other languages .
Hacking.
To hack someone just print one binary string with length up to 1000, containing at least one '0' and at least one '1'.
Example
Input
3
2
1
3
2
1
0
Output
? 000
? 001
? 010
? 011
? 100
? 101
! 2 1
Note
Hamming distance definition: <https://en.wikipedia.org/wiki/Hamming_distance>
In the first test case the hidden binary string is 101, The first query is 000, so the Hamming distance is 2. In the second query the hidden string is still 101 and query is 001, so the Hamming distance is 1.
After some queries you find that symbol at position 2 is '0' and symbol at position 1 is '1', so you print "! 2 1".
Submitted Solution:
```
from sys import stdout
n = int(input())
print('? ' + '0' * n)
stdout.flush()
k = int(input())
kolvo1, kolvo0 = k, n - k
print('? 1' + '0' * (n - 1))
stdout.flush()
p = int(input())
pos0, pos1 = -1, -1
s = 0
if p == k - 1:
first_cifr = '1'
pos1 = 0
s = kolvo0
else:
first_cifr = '0'
pos0 = 0
s = kolvo1
l = 1
r = n
while l + 1 < r:
m = (l + r) // 2
if first_cifr == '1':
print('? ' + '1' * l + '0' * (m - l) + '1' * (n - (m - l) - l))
else:
print('? ' + '0' * l + '1' * (m - l) + '0' * (n - (m - l) - l))
stdout.flush()
k = int(input())
if k <= s:
r = m
else:
l = m
s = k
if pos0 == -1:
pos0 = l
else:
pos1 = l
print('!', pos0 + 1, pos1 + 1)
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud and Ehab are in the fourth stage now.
Dr. Evil has a hidden binary string of length n. He guarantees that there is at least one '0' symbol and at least one '1' symbol in it. Now he wants Mahmoud and Ehab to find a position of any '0' symbol and any '1' symbol. In order to do this, Mahmoud and Ehab can ask Dr. Evil up to 15 questions. They tell Dr. Evil some binary string of length n, and Dr. Evil tells the Hamming distance between these two strings. Hamming distance between 2 binary strings of the same length is the number of positions in which they have different symbols. You can find the definition of Hamming distance in the notes section below.
Help Mahmoud and Ehab find these two positions.
You will get Wrong Answer verdict if
* Your queries doesn't satisfy interaction protocol described below.
* You ask strictly more than 15 questions and your program terminated after exceeding queries limit. Please note, that you can do up to 15 ask queries and one answer query.
* Your final answer is not correct.
You will get Idleness Limit Exceeded if you don't print anything or if you forget to flush the output, including for the final answer (more info about flushing output below).
If you exceed the maximum number of queries, You should terminate with 0, In this case you'll get Wrong Answer, If you don't terminate you may receive any verdict because you'll be reading from a closed stream .
Input
The first line of input will contain a single integer n (2 ≤ n ≤ 1000) — the length of the hidden binary string.
Output
To print the final answer, print "! pos0 pos1" (without quotes), where pos0 and pos1 are positions of some '0' and some '1' in the string (the string is 1-indexed). Don't forget to flush the output after printing the answer!
Interaction
To ask a question use the format "? s" (without quotes), where s is a query string. Don't forget to flush the output after printing a query!
After each query you can read a single integer from standard input — the Hamming distance between the hidden string and the query string.
To flush the output you can use:-
* fflush(stdout) in C++;
* System.out.flush() in Java;
* stdout.flush() in Python;
* flush(output) in Pascal;
* See the documentation for other languages .
Hacking.
To hack someone just print one binary string with length up to 1000, containing at least one '0' and at least one '1'.
Example
Input
3
2
1
3
2
1
0
Output
? 000
? 001
? 010
? 011
? 100
? 101
! 2 1
Note
Hamming distance definition: <https://en.wikipedia.org/wiki/Hamming_distance>
In the first test case the hidden binary string is 101, The first query is 000, so the Hamming distance is 2. In the second query the hidden string is still 101 and query is 001, so the Hamming distance is 1.
After some queries you find that symbol at position 2 is '0' and symbol at position 1 is '1', so you print "! 2 1".
Submitted Solution:
```
from sys import exit
cntq = 0
def query(m):
global cntq
cntq += 1
if cntq > 15:
exit(1)
if last == 0:
s = '1' * m + '0' * (n - m)
else:
s = '0' * m + '1' * (n - m)
print('?', s)
res = int(input())
if last == '0':
res = n - res
return res
n = int(input())
last = -1
ones = query(n)
kek = ones - query(n - 1)
if kek < 0:
last = '0'
else:
last = '1'
l = 0
r = n
if last == '1':
onesl = 0
zeror = 0
while (r - l > 1):
m = (l + r) // 2
x = query(m) - onesl - zeror
kek = ones - x
a1 = (ones + x - (r - m)) // 2
b1 = ones - a1
b0 = x - a1
if b0 > 0:
l = m
ones = b1
onesl += a1
else:
r = m
ones = a1
zeror += b0
else:
zerol = 0
onesr = 0
while (r - l > 1):
m = (l + r) // 2
x = query(m) - zerol - onesr
kek = ones - kek
b1 = (ones + x - (m - l)) // 2
a1 = ones - b1
a0 = x - b1
if b1 > 0:
l = m
ones = b1
zerol += a0
else:
r = m
ones = a1
onesr += b1
s = '0011001100'
if s[l] == s[n - 1]:
exit(1)
print('!', l + 1, n)
# print('!', 1, 3)
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud and Ehab are in the fourth stage now.
Dr. Evil has a hidden binary string of length n. He guarantees that there is at least one '0' symbol and at least one '1' symbol in it. Now he wants Mahmoud and Ehab to find a position of any '0' symbol and any '1' symbol. In order to do this, Mahmoud and Ehab can ask Dr. Evil up to 15 questions. They tell Dr. Evil some binary string of length n, and Dr. Evil tells the Hamming distance between these two strings. Hamming distance between 2 binary strings of the same length is the number of positions in which they have different symbols. You can find the definition of Hamming distance in the notes section below.
Help Mahmoud and Ehab find these two positions.
You will get Wrong Answer verdict if
* Your queries doesn't satisfy interaction protocol described below.
* You ask strictly more than 15 questions and your program terminated after exceeding queries limit. Please note, that you can do up to 15 ask queries and one answer query.
* Your final answer is not correct.
You will get Idleness Limit Exceeded if you don't print anything or if you forget to flush the output, including for the final answer (more info about flushing output below).
If you exceed the maximum number of queries, You should terminate with 0, In this case you'll get Wrong Answer, If you don't terminate you may receive any verdict because you'll be reading from a closed stream .
Input
The first line of input will contain a single integer n (2 ≤ n ≤ 1000) — the length of the hidden binary string.
Output
To print the final answer, print "! pos0 pos1" (without quotes), where pos0 and pos1 are positions of some '0' and some '1' in the string (the string is 1-indexed). Don't forget to flush the output after printing the answer!
Interaction
To ask a question use the format "? s" (without quotes), where s is a query string. Don't forget to flush the output after printing a query!
After each query you can read a single integer from standard input — the Hamming distance between the hidden string and the query string.
To flush the output you can use:-
* fflush(stdout) in C++;
* System.out.flush() in Java;
* stdout.flush() in Python;
* flush(output) in Pascal;
* See the documentation for other languages .
Hacking.
To hack someone just print one binary string with length up to 1000, containing at least one '0' and at least one '1'.
Example
Input
3
2
1
3
2
1
0
Output
? 000
? 001
? 010
? 011
? 100
? 101
! 2 1
Note
Hamming distance definition: <https://en.wikipedia.org/wiki/Hamming_distance>
In the first test case the hidden binary string is 101, The first query is 000, so the Hamming distance is 2. In the second query the hidden string is still 101 and query is 001, so the Hamming distance is 1.
After some queries you find that symbol at position 2 is '0' and symbol at position 1 is '1', so you print "! 2 1".
Submitted Solution:
```
import sys
#sstr = "1"*20+"0"
ls = int(input())#len(sstr)
def q(s):
print(s)
sys.stdout.flush()
def d(s):
a = q("? " + s)
return int(input())
#v = 0
#for i in range(min(len(sstr), len(s))):
# if s[i] != sstr[i]:
# v += 1
#return v
d0 = d("1" * ls)
l, r = 0, ls
c = d0
find1 = -1
find0 = -1
while l + 1 < r:
m = (l + r) // 2
k1, k2 = m - l, r - m
s = l * "1" + k1 * "0" + (ls - m) * "1"
ds = d(s)
c0 = (k1 + d0 - ds) / 2
a, b = c0, c - c0
if a == 0 and find1 == -1: find1 = m - 1
if b == 0 and find1 == -1: find1 = m
if a == k1 and find0 == -1: find0 = m - 1
if b == k2 - 1 and find0 == -1: find0 = m
#print("--"*10)
#print(sstr, sstr, k1, k2, l, r, m)
#print(s, m * "1" + (r - m) * "0" + (ls - r) * "1", a, b, find1, find0, k1, k2)
#print("--"*10)
if (a < b and a != 0):
r = m
c = a
else:
l = m
c = b
if find1 != -1 and find0 != -1:
break
if find0 == -1:
find0 = 0
if find1 == -1:
find1 = 0
q("! {} {}".format(find0 + 1, find1 + 1))
```
### Response:
| No |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words.
Constraints
* s_1, s_2 and s_3 are composed of lowercase English letters.
* 1 ≤ |s_i| ≤ 10 (1≤i≤3)
Input
Input is given from Standard Input in the following format:
s_1 s_2 s_3
Output
Print the answer.
Examples
Input
atcoder beginner contest
Output
ABC
Input
resident register number
Output
RRN
Input
k nearest neighbor
Output
KNN
Input
async layered coding
Output
ALC
### Response:
| "Correct Solution:
```
S,T,U=input().split();print(S[0].upper()+T[0].upper()+U[0].upper())
``` |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words.
Constraints
* s_1, s_2 and s_3 are composed of lowercase English letters.
* 1 ≤ |s_i| ≤ 10 (1≤i≤3)
Input
Input is given from Standard Input in the following format:
s_1 s_2 s_3
Output
Print the answer.
Examples
Input
atcoder beginner contest
Output
ABC
Input
resident register number
Output
RRN
Input
k nearest neighbor
Output
KNN
Input
async layered coding
Output
ALC
### Response:
| "Correct Solution:
```
s=""
for x in input().split():s+=x[0]
print(s.upper())
``` |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words.
Constraints
* s_1, s_2 and s_3 are composed of lowercase English letters.
* 1 ≤ |s_i| ≤ 10 (1≤i≤3)
Input
Input is given from Standard Input in the following format:
s_1 s_2 s_3
Output
Print the answer.
Examples
Input
atcoder beginner contest
Output
ABC
Input
resident register number
Output
RRN
Input
k nearest neighbor
Output
KNN
Input
async layered coding
Output
ALC
### Response:
| "Correct Solution:
```
print(''.join([_[0].upper() for _ in input().split()]))
``` |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words.
Constraints
* s_1, s_2 and s_3 are composed of lowercase English letters.
* 1 ≤ |s_i| ≤ 10 (1≤i≤3)
Input
Input is given from Standard Input in the following format:
s_1 s_2 s_3
Output
Print the answer.
Examples
Input
atcoder beginner contest
Output
ABC
Input
resident register number
Output
RRN
Input
k nearest neighbor
Output
KNN
Input
async layered coding
Output
ALC
### Response:
| "Correct Solution:
```
a, b, c = input().split(" ")
s = a[0]+b[0]+c[0]
print(s.upper())
``` |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words.
Constraints
* s_1, s_2 and s_3 are composed of lowercase English letters.
* 1 ≤ |s_i| ≤ 10 (1≤i≤3)
Input
Input is given from Standard Input in the following format:
s_1 s_2 s_3
Output
Print the answer.
Examples
Input
atcoder beginner contest
Output
ABC
Input
resident register number
Output
RRN
Input
k nearest neighbor
Output
KNN
Input
async layered coding
Output
ALC
### Response:
| "Correct Solution:
```
print(''.join([a[0] for a in input().upper().split()]))
``` |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words.
Constraints
* s_1, s_2 and s_3 are composed of lowercase English letters.
* 1 ≤ |s_i| ≤ 10 (1≤i≤3)
Input
Input is given from Standard Input in the following format:
s_1 s_2 s_3
Output
Print the answer.
Examples
Input
atcoder beginner contest
Output
ABC
Input
resident register number
Output
RRN
Input
k nearest neighbor
Output
KNN
Input
async layered coding
Output
ALC
### Response:
| "Correct Solution:
```
a,b,c=map(str,input().split());print((a[0]+b[0]+c[0]).upper())
``` |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words.
Constraints
* s_1, s_2 and s_3 are composed of lowercase English letters.
* 1 ≤ |s_i| ≤ 10 (1≤i≤3)
Input
Input is given from Standard Input in the following format:
s_1 s_2 s_3
Output
Print the answer.
Examples
Input
atcoder beginner contest
Output
ABC
Input
resident register number
Output
RRN
Input
k nearest neighbor
Output
KNN
Input
async layered coding
Output
ALC
### Response:
| "Correct Solution:
```
a,b,c=input().split()
x=(a[0]+b[0]+c[0]).upper()
print(x)
``` |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words.
Constraints
* s_1, s_2 and s_3 are composed of lowercase English letters.
* 1 ≤ |s_i| ≤ 10 (1≤i≤3)
Input
Input is given from Standard Input in the following format:
s_1 s_2 s_3
Output
Print the answer.
Examples
Input
atcoder beginner contest
Output
ABC
Input
resident register number
Output
RRN
Input
k nearest neighbor
Output
KNN
Input
async layered coding
Output
ALC
### Response:
| "Correct Solution:
```
x,y,z = (input().split())
print((x[:1]+y[:1]+z[:1]).upper())
``` |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words.
Constraints
* s_1, s_2 and s_3 are composed of lowercase English letters.
* 1 ≤ |s_i| ≤ 10 (1≤i≤3)
Input
Input is given from Standard Input in the following format:
s_1 s_2 s_3
Output
Print the answer.
Examples
Input
atcoder beginner contest
Output
ABC
Input
resident register number
Output
RRN
Input
k nearest neighbor
Output
KNN
Input
async layered coding
Output
ALC
Submitted Solution:
```
a,b,c=input().split()
ans=a[0]+b[0]+c[0]
ans=ans.upper()
print(ans)
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words.
Constraints
* s_1, s_2 and s_3 are composed of lowercase English letters.
* 1 ≤ |s_i| ≤ 10 (1≤i≤3)
Input
Input is given from Standard Input in the following format:
s_1 s_2 s_3
Output
Print the answer.
Examples
Input
atcoder beginner contest
Output
ABC
Input
resident register number
Output
RRN
Input
k nearest neighbor
Output
KNN
Input
async layered coding
Output
ALC
Submitted Solution:
```
print(''.join(map(lambda x:x[0].upper(),input().split())))
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words.
Constraints
* s_1, s_2 and s_3 are composed of lowercase English letters.
* 1 ≤ |s_i| ≤ 10 (1≤i≤3)
Input
Input is given from Standard Input in the following format:
s_1 s_2 s_3
Output
Print the answer.
Examples
Input
atcoder beginner contest
Output
ABC
Input
resident register number
Output
RRN
Input
k nearest neighbor
Output
KNN
Input
async layered coding
Output
ALC
Submitted Solution:
```
a=input().upper().split();print(a[0][0]+a[1][0]+a[2][0])
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words.
Constraints
* s_1, s_2 and s_3 are composed of lowercase English letters.
* 1 ≤ |s_i| ≤ 10 (1≤i≤3)
Input
Input is given from Standard Input in the following format:
s_1 s_2 s_3
Output
Print the answer.
Examples
Input
atcoder beginner contest
Output
ABC
Input
resident register number
Output
RRN
Input
k nearest neighbor
Output
KNN
Input
async layered coding
Output
ALC
Submitted Solution:
```
print(''.join([c[0] for c in input().split()]).upper())
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words.
Constraints
* s_1, s_2 and s_3 are composed of lowercase English letters.
* 1 ≤ |s_i| ≤ 10 (1≤i≤3)
Input
Input is given from Standard Input in the following format:
s_1 s_2 s_3
Output
Print the answer.
Examples
Input
atcoder beginner contest
Output
ABC
Input
resident register number
Output
RRN
Input
k nearest neighbor
Output
KNN
Input
async layered coding
Output
ALC
Submitted Solution:
```
s1, s2, s3 = input().split()
ans = chr(ord(s1[0])-32)+chr(ord(s2[0])-32)+chr(ord(s2[0])-32)
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words.
Constraints
* s_1, s_2 and s_3 are composed of lowercase English letters.
* 1 ≤ |s_i| ≤ 10 (1≤i≤3)
Input
Input is given from Standard Input in the following format:
s_1 s_2 s_3
Output
Print the answer.
Examples
Input
atcoder beginner contest
Output
ABC
Input
resident register number
Output
RRN
Input
k nearest neighbor
Output
KNN
Input
async layered coding
Output
ALC
Submitted Solution:
```
a,b,c = map(str, input().split())
print(str(a[0].uppercase)+str(b[0].uppercase)+str(c[0].uppercase))
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words.
Constraints
* s_1, s_2 and s_3 are composed of lowercase English letters.
* 1 ≤ |s_i| ≤ 10 (1≤i≤3)
Input
Input is given from Standard Input in the following format:
s_1 s_2 s_3
Output
Print the answer.
Examples
Input
atcoder beginner contest
Output
ABC
Input
resident register number
Output
RRN
Input
k nearest neighbor
Output
KNN
Input
async layered coding
Output
ALC
Submitted Solution:
```
import sys
S = list(map(str,input().split()))
for I in S:
if not I.islower():
sys.exit()
if len(I) < 0 or len(I) > 10:
sys.exit()
result = ""
for J in S:
print(J[0:1])
result = result + J[0:1]
print(result.upper())
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words.
Constraints
* s_1, s_2 and s_3 are composed of lowercase English letters.
* 1 ≤ |s_i| ≤ 10 (1≤i≤3)
Input
Input is given from Standard Input in the following format:
s_1 s_2 s_3
Output
Print the answer.
Examples
Input
atcoder beginner contest
Output
ABC
Input
resident register number
Output
RRN
Input
k nearest neighbor
Output
KNN
Input
async layered coding
Output
ALC
Submitted Solution:
```
x,y=map(int,input().split())
if abs(x-y)<=1:
print('Brown')
else:
print('Alice')
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are called equivalent in one of the two cases:
1. They are equal.
2. If we split string a into two halves of the same size a1 and a2, and string b into two halves of the same size b1 and b2, then one of the following is correct:
1. a1 is equivalent to b1, and a2 is equivalent to b2
2. a1 is equivalent to b2, and a2 is equivalent to b1
As a home task, the teacher gave two strings to his students and asked to determine if they are equivalent.
Gerald has already completed this home task. Now it's your turn!
Input
The first two lines of the input contain two strings given by the teacher. Each of them has the length from 1 to 200 000 and consists of lowercase English letters. The strings have the same length.
Output
Print "YES" (without the quotes), if these two strings are equivalent, and "NO" (without the quotes) otherwise.
Examples
Input
aaba
abaa
Output
YES
Input
aabb
abab
Output
NO
Note
In the first sample you should split the first string into strings "aa" and "ba", the second one — into strings "ab" and "aa". "aa" is equivalent to "aa"; "ab" is equivalent to "ba" as "ab" = "a" + "b", "ba" = "b" + "a".
In the second sample the first string can be splitted into strings "aa" and "bb", that are equivalent only to themselves. That's why string "aabb" is equivalent only to itself and to string "bbaa".
Submitted Solution:
```
def permut(str):
if len(str) % 2 != 0:
return str
n = len(str)
s1 = permut(str[:n//2])
s2 = permut(str[n//2:])
if s1 + s2 > s2 + s1:
return s1 + s2
else:
return s2 + s1
s = input()
t = input()
if permut(s) == permut(t):
print("YES")
else:
print("NO")
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are called equivalent in one of the two cases:
1. They are equal.
2. If we split string a into two halves of the same size a1 and a2, and string b into two halves of the same size b1 and b2, then one of the following is correct:
1. a1 is equivalent to b1, and a2 is equivalent to b2
2. a1 is equivalent to b2, and a2 is equivalent to b1
As a home task, the teacher gave two strings to his students and asked to determine if they are equivalent.
Gerald has already completed this home task. Now it's your turn!
Input
The first two lines of the input contain two strings given by the teacher. Each of them has the length from 1 to 200 000 and consists of lowercase English letters. The strings have the same length.
Output
Print "YES" (without the quotes), if these two strings are equivalent, and "NO" (without the quotes) otherwise.
Examples
Input
aaba
abaa
Output
YES
Input
aabb
abab
Output
NO
Note
In the first sample you should split the first string into strings "aa" and "ba", the second one — into strings "ab" and "aa". "aa" is equivalent to "aa"; "ab" is equivalent to "ba" as "ab" = "a" + "b", "ba" = "b" + "a".
In the second sample the first string can be splitted into strings "aa" and "bb", that are equivalent only to themselves. That's why string "aabb" is equivalent only to itself and to string "bbaa".
Submitted Solution:
```
def isEqual(a, b):
for i in range(0, len(a)):
if (a[i] != b[i]):
return False
return True
def lexicographic_minimal_string(s):
if (len(s) % 2 == 1):
return s
half = int(len(s) /2)
s1 = lexicographic_minimal_string(s[:half])
s2 = lexicographic_minimal_string(s[half:])
if s1 < s2:
return s1 + s2
return s2 + s1
a = input()
b = input()
a = lexicographic_minimal_string(a)
b = lexicographic_minimal_string(b)
if(isEqual(a,b)):
print("YES")
else:
print("NO")
'''
def isEqual(AS,BS,size):
for i in range(0, size):
if (a[AS+i] != b[BS+i]):
return False
return True
def equivalent(AS,BS,size):
global a
global b
if isEqual(AS,BS,size):
return True
half = int(size / 2)
if 2*half != size:
return False
if (equivalent(AS,BS+half,half) and equivalent(AS+half,BS,half)):
return True
if (equivalent(AS,BS,half) and equivalent(AS+half,BS+half,half)):
return True
return False
a = input()
b = input()
if equivalent(0,0,len(a)):
print("YES")
else:
print("NO")
'''
'''
a = input()
b = input()
def isEqual(a, b):
for i in range(0, len(a)):
if (a[i] != b[i]):
return False
return True
def equivalent(a, b):
if a == "":
return True
if isEqual(a, b):
return True
half = int(len(a) / 2)
if 2*half != len(a):
return False
if (equivalent(a[:half], b[:half]) and equivalent(a[half:], b[half:])):
return True
if (equivalent(a[:half], b[half:]) and equivalent(a[half:], b[:half])):
return True
return False
if equivalent(a,b):
print("YES")
else:
print("NO")
'''
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are called equivalent in one of the two cases:
1. They are equal.
2. If we split string a into two halves of the same size a1 and a2, and string b into two halves of the same size b1 and b2, then one of the following is correct:
1. a1 is equivalent to b1, and a2 is equivalent to b2
2. a1 is equivalent to b2, and a2 is equivalent to b1
As a home task, the teacher gave two strings to his students and asked to determine if they are equivalent.
Gerald has already completed this home task. Now it's your turn!
Input
The first two lines of the input contain two strings given by the teacher. Each of them has the length from 1 to 200 000 and consists of lowercase English letters. The strings have the same length.
Output
Print "YES" (without the quotes), if these two strings are equivalent, and "NO" (without the quotes) otherwise.
Examples
Input
aaba
abaa
Output
YES
Input
aabb
abab
Output
NO
Note
In the first sample you should split the first string into strings "aa" and "ba", the second one — into strings "ab" and "aa". "aa" is equivalent to "aa"; "ab" is equivalent to "ba" as "ab" = "a" + "b", "ba" = "b" + "a".
In the second sample the first string can be splitted into strings "aa" and "bb", that are equivalent only to themselves. That's why string "aabb" is equivalent only to itself and to string "bbaa".
Submitted Solution:
```
x = input()
y = input()
def f(x, y):
if x == y:
return True
if len(x)%2 == 1:
return False
mid = len(x)//2
if f(x[:mid], y[mid:]) and f(x[mid:], y[:mid]):
return True
if f(x[mid:], y[mid:]) and f(x[:mid], y[:mid]):
return True
return False
if f(x, y):
print("YES")
quit()
print("NO")
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are called equivalent in one of the two cases:
1. They are equal.
2. If we split string a into two halves of the same size a1 and a2, and string b into two halves of the same size b1 and b2, then one of the following is correct:
1. a1 is equivalent to b1, and a2 is equivalent to b2
2. a1 is equivalent to b2, and a2 is equivalent to b1
As a home task, the teacher gave two strings to his students and asked to determine if they are equivalent.
Gerald has already completed this home task. Now it's your turn!
Input
The first two lines of the input contain two strings given by the teacher. Each of them has the length from 1 to 200 000 and consists of lowercase English letters. The strings have the same length.
Output
Print "YES" (without the quotes), if these two strings are equivalent, and "NO" (without the quotes) otherwise.
Examples
Input
aaba
abaa
Output
YES
Input
aabb
abab
Output
NO
Note
In the first sample you should split the first string into strings "aa" and "ba", the second one — into strings "ab" and "aa". "aa" is equivalent to "aa"; "ab" is equivalent to "ba" as "ab" = "a" + "b", "ba" = "b" + "a".
In the second sample the first string can be splitted into strings "aa" and "bb", that are equivalent only to themselves. That's why string "aabb" is equivalent only to itself and to string "bbaa".
Submitted Solution:
```
a = input()
b = input()
def split(s):
length = len(s)
if (length % 2 == 0):
s1 = split((s[:int(length / 2)]))
s2 = split(s[int(length / 2):])
if (s1 < s2):
return s1 + s2
else:
return s2 + s1
else:
return s
if (split(a) == split(b)):
print("YES")
else:
print("NO")
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are called equivalent in one of the two cases:
1. They are equal.
2. If we split string a into two halves of the same size a1 and a2, and string b into two halves of the same size b1 and b2, then one of the following is correct:
1. a1 is equivalent to b1, and a2 is equivalent to b2
2. a1 is equivalent to b2, and a2 is equivalent to b1
As a home task, the teacher gave two strings to his students and asked to determine if they are equivalent.
Gerald has already completed this home task. Now it's your turn!
Input
The first two lines of the input contain two strings given by the teacher. Each of them has the length from 1 to 200 000 and consists of lowercase English letters. The strings have the same length.
Output
Print "YES" (without the quotes), if these two strings are equivalent, and "NO" (without the quotes) otherwise.
Examples
Input
aaba
abaa
Output
YES
Input
aabb
abab
Output
NO
Note
In the first sample you should split the first string into strings "aa" and "ba", the second one — into strings "ab" and "aa". "aa" is equivalent to "aa"; "ab" is equivalent to "ba" as "ab" = "a" + "b", "ba" = "b" + "a".
In the second sample the first string can be splitted into strings "aa" and "bb", that are equivalent only to themselves. That's why string "aabb" is equivalent only to itself and to string "bbaa".
Submitted Solution:
```
#f=open('pe.in','r')
a=str(input())
b=str(input())
if len(a)%2==1:
if a==b:
print("YES")
else:
print("NO")
quit()
x=len(a)//2
if a[:x]==b[:x] or a[:x]==b[x:]:
print("YES")
quit()
print("NO")
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are called equivalent in one of the two cases:
1. They are equal.
2. If we split string a into two halves of the same size a1 and a2, and string b into two halves of the same size b1 and b2, then one of the following is correct:
1. a1 is equivalent to b1, and a2 is equivalent to b2
2. a1 is equivalent to b2, and a2 is equivalent to b1
As a home task, the teacher gave two strings to his students and asked to determine if they are equivalent.
Gerald has already completed this home task. Now it's your turn!
Input
The first two lines of the input contain two strings given by the teacher. Each of them has the length from 1 to 200 000 and consists of lowercase English letters. The strings have the same length.
Output
Print "YES" (without the quotes), if these two strings are equivalent, and "NO" (without the quotes) otherwise.
Examples
Input
aaba
abaa
Output
YES
Input
aabb
abab
Output
NO
Note
In the first sample you should split the first string into strings "aa" and "ba", the second one — into strings "ab" and "aa". "aa" is equivalent to "aa"; "ab" is equivalent to "ba" as "ab" = "a" + "b", "ba" = "b" + "a".
In the second sample the first string can be splitted into strings "aa" and "bb", that are equivalent only to themselves. That's why string "aabb" is equivalent only to itself and to string "bbaa".
Submitted Solution:
```
def branch(a,b):
if a == b:
return True
if len(a) > 1 and len(b) > 1:
midA = len(a) // 2
midB = len(b) // 2
a1 = a[:midA]
a2 = a[midA:]
b1 = b[:midB]
b2 = b[midB:]
print([a1,a2,b1,b2])
return isEquivalent(a1,a2,b1,b2)
return False
def isEquivalent(a1,a2,b1,b2):
check1 = a1 == b1 and a2 == b2
check2 = a1 == b2 and a2 == b1
if check1 or check2:
return True
check11 = True
check12 = True
if a1 != b1:
check11 = branch(a1,b1)
if a2 != b2:
check12 = branch(a2,b2)
check1 = check11 and check12
check21 = True
check22 = True
if a1 != b2:
check21 = branch(a1,b2)
if a2 != b1:
check22 = branch(a2,b1)
check2 = check21 and check22
return check1 or check2
def run():
str1 = input()
str2 = input()
print(branch(str1, str2))
run()
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are called equivalent in one of the two cases:
1. They are equal.
2. If we split string a into two halves of the same size a1 and a2, and string b into two halves of the same size b1 and b2, then one of the following is correct:
1. a1 is equivalent to b1, and a2 is equivalent to b2
2. a1 is equivalent to b2, and a2 is equivalent to b1
As a home task, the teacher gave two strings to his students and asked to determine if they are equivalent.
Gerald has already completed this home task. Now it's your turn!
Input
The first two lines of the input contain two strings given by the teacher. Each of them has the length from 1 to 200 000 and consists of lowercase English letters. The strings have the same length.
Output
Print "YES" (without the quotes), if these two strings are equivalent, and "NO" (without the quotes) otherwise.
Examples
Input
aaba
abaa
Output
YES
Input
aabb
abab
Output
NO
Note
In the first sample you should split the first string into strings "aa" and "ba", the second one — into strings "ab" and "aa". "aa" is equivalent to "aa"; "ab" is equivalent to "ba" as "ab" = "a" + "b", "ba" = "b" + "a".
In the second sample the first string can be splitted into strings "aa" and "bb", that are equivalent only to themselves. That's why string "aabb" is equivalent only to itself and to string "bbaa".
Submitted Solution:
```
__author__ = 'tka4a'
def ifEqual(a, b):
le = len(a)
if (a == b):
return True
else:
if ((le % 2) == 0) and ifEqual(a[:le // 2], b[le // 2:]) and ifEqual(b[:le // 2], a[le // 2:]):
return True
else:
return False
a = input()
b = input()
if ifEqual(a, b):
print("YES")
else:
print("NO")
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are called equivalent in one of the two cases:
1. They are equal.
2. If we split string a into two halves of the same size a1 and a2, and string b into two halves of the same size b1 and b2, then one of the following is correct:
1. a1 is equivalent to b1, and a2 is equivalent to b2
2. a1 is equivalent to b2, and a2 is equivalent to b1
As a home task, the teacher gave two strings to his students and asked to determine if they are equivalent.
Gerald has already completed this home task. Now it's your turn!
Input
The first two lines of the input contain two strings given by the teacher. Each of them has the length from 1 to 200 000 and consists of lowercase English letters. The strings have the same length.
Output
Print "YES" (without the quotes), if these two strings are equivalent, and "NO" (without the quotes) otherwise.
Examples
Input
aaba
abaa
Output
YES
Input
aabb
abab
Output
NO
Note
In the first sample you should split the first string into strings "aa" and "ba", the second one — into strings "ab" and "aa". "aa" is equivalent to "aa"; "ab" is equivalent to "ba" as "ab" = "a" + "b", "ba" = "b" + "a".
In the second sample the first string can be splitted into strings "aa" and "bb", that are equivalent only to themselves. That's why string "aabb" is equivalent only to itself and to string "bbaa".
Submitted Solution:
```
__author__ = 'tka4a'
a = input()
b = input()
le = len(a)
if (a == b):
print("Yes")
else:
if (le % 2 == 0) and (a[:le // 2] == b[le // 2:]) and (b[:le // 2] == a[le // 2:]):
print("YES")
else:
print("NO")
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string S consisting of letters `b`, `d`, `p` and `q`. Determine whether S is a mirror string.
Here, a mirror string is a string S such that the following sequence of operations on S results in the same string S:
1. Reverse the order of the characters in S.
2. Replace each occurrence of `b` by `d`, `d` by `b`, `p` by `q`, and `q` by `p`, simultaneously.
Constraints
* 1 \leq |S| \leq 10^5
* S consists of letters `b`, `d`, `p`, and `q`.
Input
The input is given from Standard Input in the following format:
S
Output
If S is a mirror string, print `Yes`. Otherwise, print `No`.
Examples
Input
pdbq
Output
Yes
Input
ppqb
Output
No
Submitted Solution:
```
def transform(s):
s = s[::-1]
s = s.replace('b', '0').replace('d', 'b').replace('0', 'd')
s = s.replace('p', '0').replace('q', 'p').replace('0', 'q')
return s
s = input()
if s == transform(s):
print('Yes')
else:
print('No')
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string S consisting of letters `b`, `d`, `p` and `q`. Determine whether S is a mirror string.
Here, a mirror string is a string S such that the following sequence of operations on S results in the same string S:
1. Reverse the order of the characters in S.
2. Replace each occurrence of `b` by `d`, `d` by `b`, `p` by `q`, and `q` by `p`, simultaneously.
Constraints
* 1 \leq |S| \leq 10^5
* S consists of letters `b`, `d`, `p`, and `q`.
Input
The input is given from Standard Input in the following format:
S
Output
If S is a mirror string, print `Yes`. Otherwise, print `No`.
Examples
Input
pdbq
Output
Yes
Input
ppqb
Output
No
Submitted Solution:
```
# -*- coding:utf-8 -*-
import sys
S = list(input())
a = list(reversed(S))
for tmp in range(len(a)):
if a[tmp] == 'b':
a[tmp] = 'd'
elif a[tmp] == 'd':
a[tmp] = 'b'
elif a[tmp] == 'p':
a[tmp] = 'q'
else:
a[tmp] = 'p'
if S[tmp] != a[tmp]:
print("No")
sys.exit()
print("Yes")
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string S consisting of letters `b`, `d`, `p` and `q`. Determine whether S is a mirror string.
Here, a mirror string is a string S such that the following sequence of operations on S results in the same string S:
1. Reverse the order of the characters in S.
2. Replace each occurrence of `b` by `d`, `d` by `b`, `p` by `q`, and `q` by `p`, simultaneously.
Constraints
* 1 \leq |S| \leq 10^5
* S consists of letters `b`, `d`, `p`, and `q`.
Input
The input is given from Standard Input in the following format:
S
Output
If S is a mirror string, print `Yes`. Otherwise, print `No`.
Examples
Input
pdbq
Output
Yes
Input
ppqb
Output
No
Submitted Solution:
```
s=input()
if len(s)%2==0:
for i in range(len(s)):
if s[i]=='p' and s[-1-i]!='q' or s[i]=='q' and s[-1-i]!='p' or s[i]=='d' and s[-1-i]!='b' or s[i]=='b' and s[-1-i]!='d':
print('No')
break
else:
print('Yes')
else:
print('No')
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string S consisting of letters `b`, `d`, `p` and `q`. Determine whether S is a mirror string.
Here, a mirror string is a string S such that the following sequence of operations on S results in the same string S:
1. Reverse the order of the characters in S.
2. Replace each occurrence of `b` by `d`, `d` by `b`, `p` by `q`, and `q` by `p`, simultaneously.
Constraints
* 1 \leq |S| \leq 10^5
* S consists of letters `b`, `d`, `p`, and `q`.
Input
The input is given from Standard Input in the following format:
S
Output
If S is a mirror string, print `Yes`. Otherwise, print `No`.
Examples
Input
pdbq
Output
Yes
Input
ppqb
Output
No
Submitted Solution:
```
mp={'b':'d','d':'b','p':'q','q':'p'};a=list(input());b=list(a[::-1]);b=[mp[x] for x in b];print("Yes" if a==b else "No");
```
### Response:
| Yes |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string S consisting of letters `b`, `d`, `p` and `q`. Determine whether S is a mirror string.
Here, a mirror string is a string S such that the following sequence of operations on S results in the same string S:
1. Reverse the order of the characters in S.
2. Replace each occurrence of `b` by `d`, `d` by `b`, `p` by `q`, and `q` by `p`, simultaneously.
Constraints
* 1 \leq |S| \leq 10^5
* S consists of letters `b`, `d`, `p`, and `q`.
Input
The input is given from Standard Input in the following format:
S
Output
If S is a mirror string, print `Yes`. Otherwise, print `No`.
Examples
Input
pdbq
Output
Yes
Input
ppqb
Output
No
Submitted Solution:
```
from collections import deque
d = {
'b': 'd',
'd': 'b',
'p': 'q',
'q': 'p'
}
s = deque(input())
if len(s) % 2:
print("No")
while len(s) > 1:
l = s.popleft()
r = s.pop()
if r != d[l]:
print("No")
quit(0)
print("Yes")
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string S consisting of letters `b`, `d`, `p` and `q`. Determine whether S is a mirror string.
Here, a mirror string is a string S such that the following sequence of operations on S results in the same string S:
1. Reverse the order of the characters in S.
2. Replace each occurrence of `b` by `d`, `d` by `b`, `p` by `q`, and `q` by `p`, simultaneously.
Constraints
* 1 \leq |S| \leq 10^5
* S consists of letters `b`, `d`, `p`, and `q`.
Input
The input is given from Standard Input in the following format:
S
Output
If S is a mirror string, print `Yes`. Otherwise, print `No`.
Examples
Input
pdbq
Output
Yes
Input
ppqb
Output
No
Submitted Solution:
```
S = input()
lenth = int(len(S) / 2)
cnt = 0
for i in range(lenth):
if ((S[i] == 'b' and S[- i - 1] == 'd') or
(S[i] == 'd' and S[- i - 1] == 'b') or
(S[i] == 'p' and S[- i - 1] == 'q') or
(S[i] == 'q' and S[- i - 1] == 'p')):
cnt += 1
if cnt == lenth:
print('Yes')
else:
print('No')
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string S consisting of letters `b`, `d`, `p` and `q`. Determine whether S is a mirror string.
Here, a mirror string is a string S such that the following sequence of operations on S results in the same string S:
1. Reverse the order of the characters in S.
2. Replace each occurrence of `b` by `d`, `d` by `b`, `p` by `q`, and `q` by `p`, simultaneously.
Constraints
* 1 \leq |S| \leq 10^5
* S consists of letters `b`, `d`, `p`, and `q`.
Input
The input is given from Standard Input in the following format:
S
Output
If S is a mirror string, print `Yes`. Otherwise, print `No`.
Examples
Input
pdbq
Output
Yes
Input
ppqb
Output
No
Submitted Solution:
```
from collections import deque
d = {
'b': 'd',
'd': 'b',
'p': 'q',
'q': 'p'
}
s = deque(input())
while len(s) > 1:
l = s.popleft()
r = s.pop()
if r != d[l]:
print("No")
quit(0)
print("Yes")
```
### Response:
| No |
### Instruction:
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string S consisting of letters `b`, `d`, `p` and `q`. Determine whether S is a mirror string.
Here, a mirror string is a string S such that the following sequence of operations on S results in the same string S:
1. Reverse the order of the characters in S.
2. Replace each occurrence of `b` by `d`, `d` by `b`, `p` by `q`, and `q` by `p`, simultaneously.
Constraints
* 1 \leq |S| \leq 10^5
* S consists of letters `b`, `d`, `p`, and `q`.
Input
The input is given from Standard Input in the following format:
S
Output
If S is a mirror string, print `Yes`. Otherwise, print `No`.
Examples
Input
pdbq
Output
Yes
Input
ppqb
Output
No
Submitted Solution:
```
s = list(input())
t = s[::-1]
for i in t:
if i == "p":
i = "q"
elif i == "q":
i = "p"
if i == "b":
i = "d"
elif i == "d":
i = "b"
if s == t:
ans = "Yes"
else:
ans = "No"
print(ans)
```
### Response:
| No |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
One day, Taro received a strange email with only the number "519345213244" in the text. The email was from my cousin, who was 10 years older than me, so when I called and asked, "Oh, I sent it with a pocket bell because I was in a hurry. It's convenient. Nice to meet you!" I got it. You know this cousin, who is always busy and a little bit aggressive, and when you have no choice but to research "pager hitting" yourself, you can see that it is a method of input that prevailed in the world about 10 years ago. I understand.
In "Pokebell Strike", enter one character with two numbers, such as 11 for "A" and 15 for "O" according to the conversion table shown in Fig. 1. For example, to enter the string "Naruto", type "519345". Therefore, any letter can be entered with two numbers.
<image>
Figure 1
When mobile phones weren't widespread, high school students used this method to send messages from payphones to their friends' pagers. Some high school girls were able to pager at a tremendous speed. Recently, my cousin, who has been busy with work, has unknowingly started typing emails with a pager.
Therefore, in order to help Taro who is having a hard time deciphering every time, please write a program that converts the pager message into a character string and outputs it. However, the conversion table shown in Fig. 2 is used for conversion, and only lowercase letters, ".", "?", "!", And blanks are targeted. Output NA for messages that contain characters that cannot be converted.
<image>
Figure 2
Input
Multiple messages are given. One message (up to 200 characters) is given on each line. The total number of messages does not exceed 50.
Output
For each message, output the converted message or NA on one line.
Example
Input
341143514535
314
143565553551655311343411652235654535651124615163
551544654451431564
4
3411
6363636363
153414
Output
naruto
NA
do you wanna go to aizu?
yes sure!
NA
na
?????
end
### Response:
| "Correct Solution:
```
def message(numbers):
numbers=str(numbers)
message=""
while(len(numbers)>0):
num=numbers[:2]
if len(num)==1:
return "NA"
if int(num[0])>6 or int(num[0])<=0:
return "NA"
if int(num[1])>5 or int(num[1])<=0:
return "NA"
code=(int(num[0])-1)*5+int(num[1])
if code>30:
return "NA"
if code==27:
message+="."
elif code==28:
message+="?"
elif code==29:
message+="!"
elif code==30:
message+=" "
else:
message+=chr(code-1+ord('a'))
numbers=numbers[2::]
return message
while True:
try:
n=input()
print(message(n))
except EOFError:
break
``` |
### Instruction:
Provide a correct Python 3 solution for this coding contest problem.
One day, Taro received a strange email with only the number "519345213244" in the text. The email was from my cousin, who was 10 years older than me, so when I called and asked, "Oh, I sent it with a pocket bell because I was in a hurry. It's convenient. Nice to meet you!" I got it. You know this cousin, who is always busy and a little bit aggressive, and when you have no choice but to research "pager hitting" yourself, you can see that it is a method of input that prevailed in the world about 10 years ago. I understand.
In "Pokebell Strike", enter one character with two numbers, such as 11 for "A" and 15 for "O" according to the conversion table shown in Fig. 1. For example, to enter the string "Naruto", type "519345". Therefore, any letter can be entered with two numbers.
<image>
Figure 1
When mobile phones weren't widespread, high school students used this method to send messages from payphones to their friends' pagers. Some high school girls were able to pager at a tremendous speed. Recently, my cousin, who has been busy with work, has unknowingly started typing emails with a pager.
Therefore, in order to help Taro who is having a hard time deciphering every time, please write a program that converts the pager message into a character string and outputs it. However, the conversion table shown in Fig. 2 is used for conversion, and only lowercase letters, ".", "?", "!", And blanks are targeted. Output NA for messages that contain characters that cannot be converted.
<image>
Figure 2
Input
Multiple messages are given. One message (up to 200 characters) is given on each line. The total number of messages does not exceed 50.
Output
For each message, output the converted message or NA on one line.
Example
Input
341143514535
314
143565553551655311343411652235654535651124615163
551544654451431564
4
3411
6363636363
153414
Output
naruto
NA
do you wanna go to aizu?
yes sure!
NA
na
?????
end
### Response:
| "Correct Solution:
```
# AOJ 0127 Pocket Pager Input
# Python3 2018.6.18 bal4u
a = ['']*100
a[11], a[12], a[13], a[14], a[15] = 'a', 'b', 'c', 'd', 'e'
a[21], a[22], a[23], a[24], a[25] = 'f', 'g', 'h', 'i', 'j'
a[31], a[32], a[33], a[34], a[35] = 'k', 'l', 'm', 'n', 'o'
a[41], a[42], a[43], a[44], a[45] = 'p', 'q', 'r', 's', 't'
a[51], a[52], a[53], a[54], a[55] = 'u', 'v', 'w', 'x', 'y'
a[61], a[62], a[63], a[64], a[65] = 'z', '.', '?', '!', ' '
while True:
try: buf = list(input())
except: break
f = True
ans = ''
for i in range(0, len(buf), 2):
if i+1 >= len(buf):
f = False
break
if buf[i].isdigit() and buf[i+1].isdigit():
k = int(buf[i]+buf[i+1])
if a[k] != '': ans += a[k]
else:
f = False
break
print(ans if f else "NA")
``` |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.