message stringlengths 2 11.9k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 137 108k | cluster float64 18 18 | __index_level_0__ int64 274 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
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? ... | instruction | 0 | 74,058 | 18 | 148,116 |
"Correct Solution:
```
n = input()
print('ABC' + str(n))
``` | output | 1 | 74,058 | 18 | 148,117 |
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? ... | instruction | 0 | 74,059 | 18 | 148,118 |
"Correct Solution:
```
print("ABC{0}".format(input()))
``` | output | 1 | 74,059 | 18 | 148,119 |
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? ... | instruction | 0 | 74,062 | 18 | 148,124 |
"Correct Solution:
```
n = input()
s = 'ABC' + n
print(s)
``` | output | 1 | 74,062 | 18 | 148,125 |
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... | instruction | 0 | 74,674 | 18 | 149,348 |
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)
``` | output | 1 | 74,674 | 18 | 149,349 |
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... | instruction | 0 | 74,675 | 18 | 149,350 |
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)
... | output | 1 | 74,675 | 18 | 149,351 |
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... | instruction | 0 | 74,676 | 18 | 149,352 |
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)
``... | output | 1 | 74,676 | 18 | 149,353 |
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... | instruction | 0 | 74,677 | 18 | 149,354 |
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)
``` | output | 1 | 74,677 | 18 | 149,355 |
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... | instruction | 0 | 74,678 | 18 | 149,356 |
Tags: constructive algorithms, greedy, strings
Correct Solution:
```
"""
Author - Satwik Tiwari .
27th Sept , 2020 - Sunday
"""
#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function
f... | output | 1 | 74,678 | 18 | 149,357 |
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... | instruction | 0 | 74,679 | 18 | 149,358 |
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)
``` | output | 1 | 74,679 | 18 | 149,359 |
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... | instruction | 0 | 74,680 | 18 | 149,360 |
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)
``` | output | 1 | 74,680 | 18 | 149,361 |
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... | instruction | 0 | 74,681 | 18 | 149,362 |
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:
... | output | 1 | 74,681 | 18 | 149,363 |
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 functio... | instruction | 0 | 74,682 | 18 | 149,364 |
Yes | output | 1 | 74,682 | 18 | 149,365 |
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 functio... | instruction | 0 | 74,683 | 18 | 149,366 |
Yes | output | 1 | 74,683 | 18 | 149,367 |
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 functio... | instruction | 0 | 74,684 | 18 | 149,368 |
Yes | output | 1 | 74,684 | 18 | 149,369 |
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 functio... | instruction | 0 | 74,685 | 18 | 149,370 |
Yes | output | 1 | 74,685 | 18 | 149,371 |
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 functio... | instruction | 0 | 74,686 | 18 | 149,372 |
No | output | 1 | 74,686 | 18 | 149,373 |
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 functio... | instruction | 0 | 74,687 | 18 | 149,374 |
No | output | 1 | 74,687 | 18 | 149,375 |
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 functio... | instruction | 0 | 74,688 | 18 | 149,376 |
No | output | 1 | 74,688 | 18 | 149,377 |
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 functio... | instruction | 0 | 74,689 | 18 | 149,378 |
No | output | 1 | 74,689 | 18 | 149,379 |
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 ... | instruction | 0 | 74,861 | 18 | 149,722 |
"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'... | output | 1 | 74,861 | 18 | 149,723 |
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 ... | instruction | 0 | 74,862 | 18 | 149,724 |
"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 e... | output | 1 | 74,862 | 18 | 149,725 |
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 ... | instruction | 0 | 74,863 | 18 | 149,726 |
"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
``` | output | 1 | 74,863 | 18 | 149,727 |
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 ... | instruction | 0 | 74,864 | 18 | 149,728 |
"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())
f... | output | 1 | 74,864 | 18 | 149,729 |
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 ... | instruction | 0 | 74,865 | 18 | 149,730 |
"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)):
... | output | 1 | 74,865 | 18 | 149,731 |
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 ... | instruction | 0 | 74,866 | 18 | 149,732 |
"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(inpu... | output | 1 | 74,866 | 18 | 149,733 |
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 ... | instruction | 0 | 74,867 | 18 | 149,734 |
"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()))
``` | output | 1 | 74,867 | 18 | 149,735 |
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 ... | instruction | 0 | 74,868 | 18 | 149,736 |
"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.... | output | 1 | 74,868 | 18 | 149,737 |
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 alphabe... | instruction | 0 | 74,869 | 18 | 149,738 |
Yes | output | 1 | 74,869 | 18 | 149,739 |
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 alphabe... | instruction | 0 | 74,870 | 18 | 149,740 |
Yes | output | 1 | 74,870 | 18 | 149,741 |
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 alphabe... | instruction | 0 | 74,871 | 18 | 149,742 |
Yes | output | 1 | 74,871 | 18 | 149,743 |
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 alphabe... | instruction | 0 | 74,872 | 18 | 149,744 |
Yes | output | 1 | 74,872 | 18 | 149,745 |
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 alphabe... | instruction | 0 | 74,873 | 18 | 149,746 |
No | output | 1 | 74,873 | 18 | 149,747 |
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 alphabe... | instruction | 0 | 74,874 | 18 | 149,748 |
No | output | 1 | 74,874 | 18 | 149,749 |
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 alphabe... | instruction | 0 | 74,875 | 18 | 149,750 |
No | output | 1 | 74,875 | 18 | 149,751 |
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 alphabe... | instruction | 0 | 74,876 | 18 | 149,752 |
No | output | 1 | 74,876 | 18 | 149,753 |
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 cor... | instruction | 0 | 75,377 | 18 | 150,754 |
Yes | output | 1 | 75,377 | 18 | 150,755 |
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 cor... | instruction | 0 | 75,378 | 18 | 150,756 |
Yes | output | 1 | 75,378 | 18 | 150,757 |
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 cor... | instruction | 0 | 75,379 | 18 | 150,758 |
Yes | output | 1 | 75,379 | 18 | 150,759 |
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 cor... | instruction | 0 | 75,380 | 18 | 150,760 |
Yes | output | 1 | 75,380 | 18 | 150,761 |
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 cor... | instruction | 0 | 75,381 | 18 | 150,762 |
No | output | 1 | 75,381 | 18 | 150,763 |
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 cor... | instruction | 0 | 75,382 | 18 | 150,764 |
No | output | 1 | 75,382 | 18 | 150,765 |
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 cor... | instruction | 0 | 75,383 | 18 | 150,766 |
No | output | 1 | 75,383 | 18 | 150,767 |
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 cor... | instruction | 0 | 75,384 | 18 | 150,768 |
No | output | 1 | 75,384 | 18 | 150,769 |
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. Aft... | instruction | 0 | 75,559 | 18 | 151,118 |
No | output | 1 | 75,559 | 18 | 151,119 |
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. Aft... | instruction | 0 | 75,560 | 18 | 151,120 |
No | output | 1 | 75,560 | 18 | 151,121 |
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. Aft... | instruction | 0 | 75,561 | 18 | 151,122 |
No | output | 1 | 75,561 | 18 | 151,123 |
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. Aft... | instruction | 0 | 75,562 | 18 | 151,124 |
No | output | 1 | 75,562 | 18 | 151,125 |
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
... | instruction | 0 | 76,007 | 18 | 152,014 |
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","... | output | 1 | 76,007 | 18 | 152,015 |
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
... | instruction | 0 | 76,010 | 18 | 152,020 |
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")
``` | output | 1 | 76,010 | 18 | 152,021 |
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
... | instruction | 0 | 76,011 | 18 | 152,022 |
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:
... | output | 1 | 76,011 | 18 | 152,023 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.