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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three strings a, b and c of the same length n. The strings consist of lowercase English letters only. The i-th letter of a is a_i, the i-th letter of b is b_i, the i-th letter of c is c_i.
For every i (1 β€ i β€ n) you must swap (i.e. exchange) c_i with either a_i or b_i. So in total you'll perform exactly n swap operations, each of them either c_i β a_i or c_i β b_i (i iterates over all integers between 1 and n, inclusive).
For example, if a is "code", b is "true", and c is "help", you can make c equal to "crue" taking the 1-st and the 4-th letters from a and the others from b. In this way a becomes "hodp" and b becomes "tele".
Is it possible that after these swaps the string a becomes exactly the same as the string b?
Input
The input consists of multiple test cases. The first line contains a single integer t (1 β€ t β€ 100) β the number of test cases. The description of the test cases follows.
The first line of each test case contains a string of lowercase English letters a.
The second line of each test case contains a string of lowercase English letters b.
The third line of each test case contains a string of lowercase English letters c.
It is guaranteed that in each test case these three strings are non-empty and have the same length, which is not exceeding 100.
Output
Print t lines with answers for all test cases. For each test case:
If it is possible to make string a equal to string b print "YES" (without quotes), otherwise print "NO" (without quotes).
You can print either lowercase or uppercase letters in the answers.
Example
Input
4
aaa
bbb
ccc
abc
bca
bca
aabb
bbaa
baba
imi
mii
iim
Output
NO
YES
YES
NO
Note
In the first test case, it is impossible to do the swaps so that string a becomes exactly the same as string b.
In the second test case, you should swap c_i with a_i for all possible i. After the swaps a becomes "bca", b becomes "bca" and c becomes "abc". Here the strings a and b are equal.
In the third test case, you should swap c_1 with a_1, c_2 with b_2, c_3 with b_3 and c_4 with a_4. Then string a becomes "baba", string b becomes "baba" and string c becomes "abab". Here the strings a and b are equal.
In the fourth test case, it is impossible to do the swaps so that string a becomes exactly the same as string b.
Submitted Solution:
```
# JAI SHREE RAM
import math; from collections import *
import sys; from functools import reduce
# sys.setrecursionlimit(10**6)
def get_ints(): return map(int, input().strip().split())
def get_list(): return list(get_ints())
def get_string(): return list(input().strip().split())
def printxsp(*args): return print(*args, end="")
def printsp(*args): return print(*args, end=" ")
UGLYMOD = int(1e9)+7; SEXYMOD = 998244353; MAXN = int(1e5)
# sys.stdin=open("input.txt","r");sys.stdout=open("output.txt","w")
for _testcases_ in range(int(input())):
a = input()
b = input()
c = input()
flag = True
for i in range(len(a)):
lenOfNums = len(set([a[i], b[i], c[i]]))
if lenOfNums == 3:
flag = False
break
elif lenOfNums == 2 and a[i] == b[i]:
flag = False
break
print("YES" if flag else "NO")
'''
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
THE LOGIC AND APPROACH IS MINE @luctivud ( UDIT GUPTA )
Link may be copy-pasted here if it's taken from other source.
DO NOT PLAGIARISE.
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
'''
``` | instruction | 0 | 88,520 | 18 | 177,040 |
Yes | output | 1 | 88,520 | 18 | 177,041 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three strings a, b and c of the same length n. The strings consist of lowercase English letters only. The i-th letter of a is a_i, the i-th letter of b is b_i, the i-th letter of c is c_i.
For every i (1 β€ i β€ n) you must swap (i.e. exchange) c_i with either a_i or b_i. So in total you'll perform exactly n swap operations, each of them either c_i β a_i or c_i β b_i (i iterates over all integers between 1 and n, inclusive).
For example, if a is "code", b is "true", and c is "help", you can make c equal to "crue" taking the 1-st and the 4-th letters from a and the others from b. In this way a becomes "hodp" and b becomes "tele".
Is it possible that after these swaps the string a becomes exactly the same as the string b?
Input
The input consists of multiple test cases. The first line contains a single integer t (1 β€ t β€ 100) β the number of test cases. The description of the test cases follows.
The first line of each test case contains a string of lowercase English letters a.
The second line of each test case contains a string of lowercase English letters b.
The third line of each test case contains a string of lowercase English letters c.
It is guaranteed that in each test case these three strings are non-empty and have the same length, which is not exceeding 100.
Output
Print t lines with answers for all test cases. For each test case:
If it is possible to make string a equal to string b print "YES" (without quotes), otherwise print "NO" (without quotes).
You can print either lowercase or uppercase letters in the answers.
Example
Input
4
aaa
bbb
ccc
abc
bca
bca
aabb
bbaa
baba
imi
mii
iim
Output
NO
YES
YES
NO
Note
In the first test case, it is impossible to do the swaps so that string a becomes exactly the same as string b.
In the second test case, you should swap c_i with a_i for all possible i. After the swaps a becomes "bca", b becomes "bca" and c becomes "abc". Here the strings a and b are equal.
In the third test case, you should swap c_1 with a_1, c_2 with b_2, c_3 with b_3 and c_4 with a_4. Then string a becomes "baba", string b becomes "baba" and string c becomes "abab". Here the strings a and b are equal.
In the fourth test case, it is impossible to do the swaps so that string a becomes exactly the same as string b.
Submitted Solution:
```
t=int(input())
for i in range(t):
a=input()
b=input()
c=input()
d=0
x=0
for i in c:
if i== a[x]:
d=1
elif i==b[x]:
d=1
else:
d=0
break
x+=1
if d==1:
print("YES")
else:
print("NO")
``` | instruction | 0 | 88,521 | 18 | 177,042 |
Yes | output | 1 | 88,521 | 18 | 177,043 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three strings a, b and c of the same length n. The strings consist of lowercase English letters only. The i-th letter of a is a_i, the i-th letter of b is b_i, the i-th letter of c is c_i.
For every i (1 β€ i β€ n) you must swap (i.e. exchange) c_i with either a_i or b_i. So in total you'll perform exactly n swap operations, each of them either c_i β a_i or c_i β b_i (i iterates over all integers between 1 and n, inclusive).
For example, if a is "code", b is "true", and c is "help", you can make c equal to "crue" taking the 1-st and the 4-th letters from a and the others from b. In this way a becomes "hodp" and b becomes "tele".
Is it possible that after these swaps the string a becomes exactly the same as the string b?
Input
The input consists of multiple test cases. The first line contains a single integer t (1 β€ t β€ 100) β the number of test cases. The description of the test cases follows.
The first line of each test case contains a string of lowercase English letters a.
The second line of each test case contains a string of lowercase English letters b.
The third line of each test case contains a string of lowercase English letters c.
It is guaranteed that in each test case these three strings are non-empty and have the same length, which is not exceeding 100.
Output
Print t lines with answers for all test cases. For each test case:
If it is possible to make string a equal to string b print "YES" (without quotes), otherwise print "NO" (without quotes).
You can print either lowercase or uppercase letters in the answers.
Example
Input
4
aaa
bbb
ccc
abc
bca
bca
aabb
bbaa
baba
imi
mii
iim
Output
NO
YES
YES
NO
Note
In the first test case, it is impossible to do the swaps so that string a becomes exactly the same as string b.
In the second test case, you should swap c_i with a_i for all possible i. After the swaps a becomes "bca", b becomes "bca" and c becomes "abc". Here the strings a and b are equal.
In the third test case, you should swap c_1 with a_1, c_2 with b_2, c_3 with b_3 and c_4 with a_4. Then string a becomes "baba", string b becomes "baba" and string c becomes "abab". Here the strings a and b are equal.
In the fourth test case, it is impossible to do the swaps so that string a becomes exactly the same as string b.
Submitted Solution:
```
t = int(input())
for i in range(t):
a = input()
b = input()
c = input()
fl = True
for j in range(len(c)):
if c[j] == a[j] or c[j] == b[j]:
pass
else:
fl = False
print("NO")
break
if fl:
print("YES")
``` | instruction | 0 | 88,522 | 18 | 177,044 |
Yes | output | 1 | 88,522 | 18 | 177,045 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three strings a, b and c of the same length n. The strings consist of lowercase English letters only. The i-th letter of a is a_i, the i-th letter of b is b_i, the i-th letter of c is c_i.
For every i (1 β€ i β€ n) you must swap (i.e. exchange) c_i with either a_i or b_i. So in total you'll perform exactly n swap operations, each of them either c_i β a_i or c_i β b_i (i iterates over all integers between 1 and n, inclusive).
For example, if a is "code", b is "true", and c is "help", you can make c equal to "crue" taking the 1-st and the 4-th letters from a and the others from b. In this way a becomes "hodp" and b becomes "tele".
Is it possible that after these swaps the string a becomes exactly the same as the string b?
Input
The input consists of multiple test cases. The first line contains a single integer t (1 β€ t β€ 100) β the number of test cases. The description of the test cases follows.
The first line of each test case contains a string of lowercase English letters a.
The second line of each test case contains a string of lowercase English letters b.
The third line of each test case contains a string of lowercase English letters c.
It is guaranteed that in each test case these three strings are non-empty and have the same length, which is not exceeding 100.
Output
Print t lines with answers for all test cases. For each test case:
If it is possible to make string a equal to string b print "YES" (without quotes), otherwise print "NO" (without quotes).
You can print either lowercase or uppercase letters in the answers.
Example
Input
4
aaa
bbb
ccc
abc
bca
bca
aabb
bbaa
baba
imi
mii
iim
Output
NO
YES
YES
NO
Note
In the first test case, it is impossible to do the swaps so that string a becomes exactly the same as string b.
In the second test case, you should swap c_i with a_i for all possible i. After the swaps a becomes "bca", b becomes "bca" and c becomes "abc". Here the strings a and b are equal.
In the third test case, you should swap c_1 with a_1, c_2 with b_2, c_3 with b_3 and c_4 with a_4. Then string a becomes "baba", string b becomes "baba" and string c becomes "abab". Here the strings a and b are equal.
In the fourth test case, it is impossible to do the swaps so that string a becomes exactly the same as string b.
Submitted Solution:
```
import sys
T = int(sys.stdin.readline())
for i in range(T):
a = list(map(str, sys.stdin.readline().strip()))
b = list(map(str, sys.stdin.readline().strip()))
c = list(map(str, sys.stdin.readline().strip()))
check = True
for j in range(len(c)):
if b[j] == c[j] or a[j] in [b[j], c[j]]:
continue
else:
check = False
break
if check:
print("YES")
else:
print("NO")
``` | instruction | 0 | 88,523 | 18 | 177,046 |
No | output | 1 | 88,523 | 18 | 177,047 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three strings a, b and c of the same length n. The strings consist of lowercase English letters only. The i-th letter of a is a_i, the i-th letter of b is b_i, the i-th letter of c is c_i.
For every i (1 β€ i β€ n) you must swap (i.e. exchange) c_i with either a_i or b_i. So in total you'll perform exactly n swap operations, each of them either c_i β a_i or c_i β b_i (i iterates over all integers between 1 and n, inclusive).
For example, if a is "code", b is "true", and c is "help", you can make c equal to "crue" taking the 1-st and the 4-th letters from a and the others from b. In this way a becomes "hodp" and b becomes "tele".
Is it possible that after these swaps the string a becomes exactly the same as the string b?
Input
The input consists of multiple test cases. The first line contains a single integer t (1 β€ t β€ 100) β the number of test cases. The description of the test cases follows.
The first line of each test case contains a string of lowercase English letters a.
The second line of each test case contains a string of lowercase English letters b.
The third line of each test case contains a string of lowercase English letters c.
It is guaranteed that in each test case these three strings are non-empty and have the same length, which is not exceeding 100.
Output
Print t lines with answers for all test cases. For each test case:
If it is possible to make string a equal to string b print "YES" (without quotes), otherwise print "NO" (without quotes).
You can print either lowercase or uppercase letters in the answers.
Example
Input
4
aaa
bbb
ccc
abc
bca
bca
aabb
bbaa
baba
imi
mii
iim
Output
NO
YES
YES
NO
Note
In the first test case, it is impossible to do the swaps so that string a becomes exactly the same as string b.
In the second test case, you should swap c_i with a_i for all possible i. After the swaps a becomes "bca", b becomes "bca" and c becomes "abc". Here the strings a and b are equal.
In the third test case, you should swap c_1 with a_1, c_2 with b_2, c_3 with b_3 and c_4 with a_4. Then string a becomes "baba", string b becomes "baba" and string c becomes "abab". Here the strings a and b are equal.
In the fourth test case, it is impossible to do the swaps so that string a becomes exactly the same as string b.
Submitted Solution:
```
def swap(a,b):
temp=b
b=a
a=temp
return temp
test=int(input())
while test!=0:
a=input()
a1=list(a)
b=input()
b1=list(b)
c=input()
c1=list(c)
count=0
for i in range(len(a1)):
if a[i]==b[i]:
count+=1
if count==len(a1):
print("YES")
else:
flag=0
for i in range(len(a1)):
if a[i]!=b[i]:
temp=swap(a[i],c[i])
if temp!=b[i]:
temp2=swap(b[i],c[i])
if temp2!=a[i]:
flag=1
break
else:
temp=swap(a[i],c[i])
if temp!=b[i]:
temp2=swap(b[i],c[i])
if temp2!=a[i]:
flag=1
break
if flag==1:
print("NO")
else:
print("YES")
test-=1
``` | instruction | 0 | 88,524 | 18 | 177,048 |
No | output | 1 | 88,524 | 18 | 177,049 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three strings a, b and c of the same length n. The strings consist of lowercase English letters only. The i-th letter of a is a_i, the i-th letter of b is b_i, the i-th letter of c is c_i.
For every i (1 β€ i β€ n) you must swap (i.e. exchange) c_i with either a_i or b_i. So in total you'll perform exactly n swap operations, each of them either c_i β a_i or c_i β b_i (i iterates over all integers between 1 and n, inclusive).
For example, if a is "code", b is "true", and c is "help", you can make c equal to "crue" taking the 1-st and the 4-th letters from a and the others from b. In this way a becomes "hodp" and b becomes "tele".
Is it possible that after these swaps the string a becomes exactly the same as the string b?
Input
The input consists of multiple test cases. The first line contains a single integer t (1 β€ t β€ 100) β the number of test cases. The description of the test cases follows.
The first line of each test case contains a string of lowercase English letters a.
The second line of each test case contains a string of lowercase English letters b.
The third line of each test case contains a string of lowercase English letters c.
It is guaranteed that in each test case these three strings are non-empty and have the same length, which is not exceeding 100.
Output
Print t lines with answers for all test cases. For each test case:
If it is possible to make string a equal to string b print "YES" (without quotes), otherwise print "NO" (without quotes).
You can print either lowercase or uppercase letters in the answers.
Example
Input
4
aaa
bbb
ccc
abc
bca
bca
aabb
bbaa
baba
imi
mii
iim
Output
NO
YES
YES
NO
Note
In the first test case, it is impossible to do the swaps so that string a becomes exactly the same as string b.
In the second test case, you should swap c_i with a_i for all possible i. After the swaps a becomes "bca", b becomes "bca" and c becomes "abc". Here the strings a and b are equal.
In the third test case, you should swap c_1 with a_1, c_2 with b_2, c_3 with b_3 and c_4 with a_4. Then string a becomes "baba", string b becomes "baba" and string c becomes "abab". Here the strings a and b are equal.
In the fourth test case, it is impossible to do the swaps so that string a becomes exactly the same as string b.
Submitted Solution:
```
t=int(input())
for i in range(t):
a=list(map(str,input().split()))
b=list(map(str,input().split()))
c=list(map(str,input().split()))
for i in range(len(a)):
if a[i]!=b[i]:
if a[i]==c[i]:
b[i]=c[i]
if b[i]==c[i]:
a[i]=c[i]
if a==b:
print('YES')
else:
print('NO')
``` | instruction | 0 | 88,525 | 18 | 177,050 |
No | output | 1 | 88,525 | 18 | 177,051 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three strings a, b and c of the same length n. The strings consist of lowercase English letters only. The i-th letter of a is a_i, the i-th letter of b is b_i, the i-th letter of c is c_i.
For every i (1 β€ i β€ n) you must swap (i.e. exchange) c_i with either a_i or b_i. So in total you'll perform exactly n swap operations, each of them either c_i β a_i or c_i β b_i (i iterates over all integers between 1 and n, inclusive).
For example, if a is "code", b is "true", and c is "help", you can make c equal to "crue" taking the 1-st and the 4-th letters from a and the others from b. In this way a becomes "hodp" and b becomes "tele".
Is it possible that after these swaps the string a becomes exactly the same as the string b?
Input
The input consists of multiple test cases. The first line contains a single integer t (1 β€ t β€ 100) β the number of test cases. The description of the test cases follows.
The first line of each test case contains a string of lowercase English letters a.
The second line of each test case contains a string of lowercase English letters b.
The third line of each test case contains a string of lowercase English letters c.
It is guaranteed that in each test case these three strings are non-empty and have the same length, which is not exceeding 100.
Output
Print t lines with answers for all test cases. For each test case:
If it is possible to make string a equal to string b print "YES" (without quotes), otherwise print "NO" (without quotes).
You can print either lowercase or uppercase letters in the answers.
Example
Input
4
aaa
bbb
ccc
abc
bca
bca
aabb
bbaa
baba
imi
mii
iim
Output
NO
YES
YES
NO
Note
In the first test case, it is impossible to do the swaps so that string a becomes exactly the same as string b.
In the second test case, you should swap c_i with a_i for all possible i. After the swaps a becomes "bca", b becomes "bca" and c becomes "abc". Here the strings a and b are equal.
In the third test case, you should swap c_1 with a_1, c_2 with b_2, c_3 with b_3 and c_4 with a_4. Then string a becomes "baba", string b becomes "baba" and string c becomes "abab". Here the strings a and b are equal.
In the fourth test case, it is impossible to do the swaps so that string a becomes exactly the same as string b.
Submitted Solution:
```
for _ in range(int(input())):
a=str(input())
b=str(input())
c=str(input())
if a==b or b==c or a==c or a[::-1]==b or a[::-1]==c or b[::-1]==a or b[::-1]==c or c[::-1]==a or c[::-1]==b:
print('YES')
else:
print("NO")
``` | instruction | 0 | 88,526 | 18 | 177,052 |
No | output | 1 | 88,526 | 18 | 177,053 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ashish has two strings a and b, each of length n, and an integer k. The strings only contain lowercase English letters.
He wants to convert string a into string b by performing some (possibly zero) operations on a.
In one move, he can either
* choose an index i (1 β€ iβ€ n-1) and swap a_i and a_{i+1}, or
* choose an index i (1 β€ i β€ n-k+1) and if a_i, a_{i+1}, β¦, a_{i+k-1} are all equal to some character c (c β 'z'), replace each one with the next character (c+1), that is, 'a' is replaced by 'b', 'b' is replaced by 'c' and so on.
Note that he can perform any number of operations, and the operations can only be performed on string a.
Help Ashish determine if it is possible to convert string a into b after performing some (possibly zero) operations on it.
Input
The first line contains a single integer t (1 β€ t β€ 10^5) β the number of test cases. The description of each test case is as follows.
The first line of each test case contains two integers n (2 β€ n β€ 10^6) and k (1 β€ k β€ n).
The second line of each test case contains the string a of length n consisting of lowercase English letters.
The third line of each test case contains the string b of length n consisting of lowercase English letters.
It is guaranteed that the sum of values n among all test cases does not exceed 10^6.
Output
For each test case, print "Yes" if Ashish can convert a into b after some moves, else print "No".
You may print the letters of the answer in any case (upper or lower).
Example
Input
4
3 3
abc
bcd
4 2
abba
azza
2 1
zz
aa
6 2
aaabba
ddddcc
Output
No
Yes
No
Yes
Note
In the first test case it can be shown that it is impossible to convert a into b.
In the second test case,
"abba" \xrightarrow{inc} "acca" \xrightarrow{inc} β¦ \xrightarrow{inc} "azza".
Here "swap" denotes an operation of the first type, and "inc" denotes an operation of the second type.
In the fourth test case,
"aaabba" \xrightarrow{swap} "aaabab" \xrightarrow{swap} "aaaabb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddaabb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddddbb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddddcc".
Submitted Solution:
```
import sys
sys.setrecursionlimit(10**5)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
def cal(s):
res=[0]*26
for c in s:
res[c-97]+=1
return res
def ok():
cnt=0
for c1,c2 in zip(cc1,cc2):
d=c1-c2
if d==0:continue
if abs(d)%k:return False
cnt+=d//k
if cnt<0:return False
return True
for _ in range(II()):
n,k=MI()
s=BI()
t=BI()
cc1=cal(s)
cc2=cal(t)
if ok():print("Yes")
else:print("No")
``` | instruction | 0 | 88,615 | 18 | 177,230 |
Yes | output | 1 | 88,615 | 18 | 177,231 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ashish has two strings a and b, each of length n, and an integer k. The strings only contain lowercase English letters.
He wants to convert string a into string b by performing some (possibly zero) operations on a.
In one move, he can either
* choose an index i (1 β€ iβ€ n-1) and swap a_i and a_{i+1}, or
* choose an index i (1 β€ i β€ n-k+1) and if a_i, a_{i+1}, β¦, a_{i+k-1} are all equal to some character c (c β 'z'), replace each one with the next character (c+1), that is, 'a' is replaced by 'b', 'b' is replaced by 'c' and so on.
Note that he can perform any number of operations, and the operations can only be performed on string a.
Help Ashish determine if it is possible to convert string a into b after performing some (possibly zero) operations on it.
Input
The first line contains a single integer t (1 β€ t β€ 10^5) β the number of test cases. The description of each test case is as follows.
The first line of each test case contains two integers n (2 β€ n β€ 10^6) and k (1 β€ k β€ n).
The second line of each test case contains the string a of length n consisting of lowercase English letters.
The third line of each test case contains the string b of length n consisting of lowercase English letters.
It is guaranteed that the sum of values n among all test cases does not exceed 10^6.
Output
For each test case, print "Yes" if Ashish can convert a into b after some moves, else print "No".
You may print the letters of the answer in any case (upper or lower).
Example
Input
4
3 3
abc
bcd
4 2
abba
azza
2 1
zz
aa
6 2
aaabba
ddddcc
Output
No
Yes
No
Yes
Note
In the first test case it can be shown that it is impossible to convert a into b.
In the second test case,
"abba" \xrightarrow{inc} "acca" \xrightarrow{inc} β¦ \xrightarrow{inc} "azza".
Here "swap" denotes an operation of the first type, and "inc" denotes an operation of the second type.
In the fourth test case,
"aaabba" \xrightarrow{swap} "aaabab" \xrightarrow{swap} "aaaabb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddaabb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddddbb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddddcc".
Submitted Solution:
```
import sys, math
import io, os
#data = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
from bisect import bisect_left as bl, bisect_right as br, insort
from heapq import heapify, heappush, heappop
from collections import defaultdict as dd, deque, Counter
from itertools import permutations,combinations
def data(): return sys.stdin.readline().strip()
def mdata(): return list(map(int, data().split()))
def outl(var) : sys.stdout.write('\n'.join(map(str, var))+'\n')
def out(var) : sys.stdout.write(str(var)+'\n')
#from decimal import Decimal
#from fractions import Fraction
sys.setrecursionlimit(100000)
INF = float('inf')
mod = 998244353
def solve():
n, k = mdata()
a = data()
b = data()
d1 = dd(int)
d2 = dd(int)
for i in a:
d1[i] += 1
for i in b:
d2[i] += 1
for i in range(26):
c = chr(97 + i)
if d1[c] < d2[c] or (d1[c] - d2[c]) % k != 0:
return 'No'
d1[c] -= d2[c]
d1[chr(97+i+1)] += d1[c]
return "Yes"
for t in range(int(data())):
out(solve())
``` | instruction | 0 | 88,616 | 18 | 177,232 |
Yes | output | 1 | 88,616 | 18 | 177,233 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ashish has two strings a and b, each of length n, and an integer k. The strings only contain lowercase English letters.
He wants to convert string a into string b by performing some (possibly zero) operations on a.
In one move, he can either
* choose an index i (1 β€ iβ€ n-1) and swap a_i and a_{i+1}, or
* choose an index i (1 β€ i β€ n-k+1) and if a_i, a_{i+1}, β¦, a_{i+k-1} are all equal to some character c (c β 'z'), replace each one with the next character (c+1), that is, 'a' is replaced by 'b', 'b' is replaced by 'c' and so on.
Note that he can perform any number of operations, and the operations can only be performed on string a.
Help Ashish determine if it is possible to convert string a into b after performing some (possibly zero) operations on it.
Input
The first line contains a single integer t (1 β€ t β€ 10^5) β the number of test cases. The description of each test case is as follows.
The first line of each test case contains two integers n (2 β€ n β€ 10^6) and k (1 β€ k β€ n).
The second line of each test case contains the string a of length n consisting of lowercase English letters.
The third line of each test case contains the string b of length n consisting of lowercase English letters.
It is guaranteed that the sum of values n among all test cases does not exceed 10^6.
Output
For each test case, print "Yes" if Ashish can convert a into b after some moves, else print "No".
You may print the letters of the answer in any case (upper or lower).
Example
Input
4
3 3
abc
bcd
4 2
abba
azza
2 1
zz
aa
6 2
aaabba
ddddcc
Output
No
Yes
No
Yes
Note
In the first test case it can be shown that it is impossible to convert a into b.
In the second test case,
"abba" \xrightarrow{inc} "acca" \xrightarrow{inc} β¦ \xrightarrow{inc} "azza".
Here "swap" denotes an operation of the first type, and "inc" denotes an operation of the second type.
In the fourth test case,
"aaabba" \xrightarrow{swap} "aaabab" \xrightarrow{swap} "aaaabb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddaabb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddddbb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddddcc".
Submitted Solution:
```
from sys import stdin, stdout
import sys
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_string(): return sys.stdin.readline().strip()
for _ in range(int(input())):
n, k = get_ints()
a = get_string()
b = get_string()
acount = [0] * 26
bcount = [0] * 26
for i in a:
acount[ord(i) - ord('a')] += 1
for i in b:
bcount[ord(i) - ord('a')] += 1
flag = True
for i in range(25):
extra = acount[i] - bcount[i]
if extra < 0 or extra % k:
flag = False
break
acount[i + 1] += extra
if flag:
print("Yes")
else:
print("No")
``` | instruction | 0 | 88,617 | 18 | 177,234 |
Yes | output | 1 | 88,617 | 18 | 177,235 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ashish has two strings a and b, each of length n, and an integer k. The strings only contain lowercase English letters.
He wants to convert string a into string b by performing some (possibly zero) operations on a.
In one move, he can either
* choose an index i (1 β€ iβ€ n-1) and swap a_i and a_{i+1}, or
* choose an index i (1 β€ i β€ n-k+1) and if a_i, a_{i+1}, β¦, a_{i+k-1} are all equal to some character c (c β 'z'), replace each one with the next character (c+1), that is, 'a' is replaced by 'b', 'b' is replaced by 'c' and so on.
Note that he can perform any number of operations, and the operations can only be performed on string a.
Help Ashish determine if it is possible to convert string a into b after performing some (possibly zero) operations on it.
Input
The first line contains a single integer t (1 β€ t β€ 10^5) β the number of test cases. The description of each test case is as follows.
The first line of each test case contains two integers n (2 β€ n β€ 10^6) and k (1 β€ k β€ n).
The second line of each test case contains the string a of length n consisting of lowercase English letters.
The third line of each test case contains the string b of length n consisting of lowercase English letters.
It is guaranteed that the sum of values n among all test cases does not exceed 10^6.
Output
For each test case, print "Yes" if Ashish can convert a into b after some moves, else print "No".
You may print the letters of the answer in any case (upper or lower).
Example
Input
4
3 3
abc
bcd
4 2
abba
azza
2 1
zz
aa
6 2
aaabba
ddddcc
Output
No
Yes
No
Yes
Note
In the first test case it can be shown that it is impossible to convert a into b.
In the second test case,
"abba" \xrightarrow{inc} "acca" \xrightarrow{inc} β¦ \xrightarrow{inc} "azza".
Here "swap" denotes an operation of the first type, and "inc" denotes an operation of the second type.
In the fourth test case,
"aaabba" \xrightarrow{swap} "aaabab" \xrightarrow{swap} "aaaabb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddaabb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddddbb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddddcc".
Submitted Solution:
```
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
from collections import Counter
def convert(diff, k):
# if min(+diff) < min(-diff):
# # print(f'{min(+diff)} < {min(-diff)}')
# return 'NO'
# +diff: letters in b not in a
# -diff: letters in a not in b
lena, lenb = 0, 0
# print(diff.keys())
for letter in sorted(diff.keys()):
n_letters = diff[letter]
# print(f'{letter}: {n_letters}')
if n_letters > 0:
lenb += n_letters
else:
lena += abs(n_letters)
# lena >= lenb means sorted(a) < sorted(b)
if lena < lenb:
return 'NO'
for key, val in diff.items():
if abs(val) % k != 0:
return 'NO'
return 'YES'
for _ in range(int(input())):
n, k = map(int, input().split())
a = Counter(input()[:-1])
b = Counter(input()[:-1])
if a == b:
print('YES')
continue
b.subtract(a)
print(convert(b, k))
``` | instruction | 0 | 88,618 | 18 | 177,236 |
Yes | output | 1 | 88,618 | 18 | 177,237 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ashish has two strings a and b, each of length n, and an integer k. The strings only contain lowercase English letters.
He wants to convert string a into string b by performing some (possibly zero) operations on a.
In one move, he can either
* choose an index i (1 β€ iβ€ n-1) and swap a_i and a_{i+1}, or
* choose an index i (1 β€ i β€ n-k+1) and if a_i, a_{i+1}, β¦, a_{i+k-1} are all equal to some character c (c β 'z'), replace each one with the next character (c+1), that is, 'a' is replaced by 'b', 'b' is replaced by 'c' and so on.
Note that he can perform any number of operations, and the operations can only be performed on string a.
Help Ashish determine if it is possible to convert string a into b after performing some (possibly zero) operations on it.
Input
The first line contains a single integer t (1 β€ t β€ 10^5) β the number of test cases. The description of each test case is as follows.
The first line of each test case contains two integers n (2 β€ n β€ 10^6) and k (1 β€ k β€ n).
The second line of each test case contains the string a of length n consisting of lowercase English letters.
The third line of each test case contains the string b of length n consisting of lowercase English letters.
It is guaranteed that the sum of values n among all test cases does not exceed 10^6.
Output
For each test case, print "Yes" if Ashish can convert a into b after some moves, else print "No".
You may print the letters of the answer in any case (upper or lower).
Example
Input
4
3 3
abc
bcd
4 2
abba
azza
2 1
zz
aa
6 2
aaabba
ddddcc
Output
No
Yes
No
Yes
Note
In the first test case it can be shown that it is impossible to convert a into b.
In the second test case,
"abba" \xrightarrow{inc} "acca" \xrightarrow{inc} β¦ \xrightarrow{inc} "azza".
Here "swap" denotes an operation of the first type, and "inc" denotes an operation of the second type.
In the fourth test case,
"aaabba" \xrightarrow{swap} "aaabab" \xrightarrow{swap} "aaaabb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddaabb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddddbb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddddcc".
Submitted Solution:
```
for _ in range(int(input())):
n,k=map(int,input().split())
a=list(input())
b=list(input())
d1=dict()
mx=0
f=1
for i in range(n):
d1[a[i]]=d1.get(a[i],0)+1
d1[b[i]]=d1.get(b[i],0)-1
if(f):
s=0
mx=0
for j in d1.values():
s+=j
mx=max(mx,j)
if(s==0 and mx<k):
print("No")
else:
print("Yes")
else:
print("No")
``` | instruction | 0 | 88,619 | 18 | 177,238 |
No | output | 1 | 88,619 | 18 | 177,239 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ashish has two strings a and b, each of length n, and an integer k. The strings only contain lowercase English letters.
He wants to convert string a into string b by performing some (possibly zero) operations on a.
In one move, he can either
* choose an index i (1 β€ iβ€ n-1) and swap a_i and a_{i+1}, or
* choose an index i (1 β€ i β€ n-k+1) and if a_i, a_{i+1}, β¦, a_{i+k-1} are all equal to some character c (c β 'z'), replace each one with the next character (c+1), that is, 'a' is replaced by 'b', 'b' is replaced by 'c' and so on.
Note that he can perform any number of operations, and the operations can only be performed on string a.
Help Ashish determine if it is possible to convert string a into b after performing some (possibly zero) operations on it.
Input
The first line contains a single integer t (1 β€ t β€ 10^5) β the number of test cases. The description of each test case is as follows.
The first line of each test case contains two integers n (2 β€ n β€ 10^6) and k (1 β€ k β€ n).
The second line of each test case contains the string a of length n consisting of lowercase English letters.
The third line of each test case contains the string b of length n consisting of lowercase English letters.
It is guaranteed that the sum of values n among all test cases does not exceed 10^6.
Output
For each test case, print "Yes" if Ashish can convert a into b after some moves, else print "No".
You may print the letters of the answer in any case (upper or lower).
Example
Input
4
3 3
abc
bcd
4 2
abba
azza
2 1
zz
aa
6 2
aaabba
ddddcc
Output
No
Yes
No
Yes
Note
In the first test case it can be shown that it is impossible to convert a into b.
In the second test case,
"abba" \xrightarrow{inc} "acca" \xrightarrow{inc} β¦ \xrightarrow{inc} "azza".
Here "swap" denotes an operation of the first type, and "inc" denotes an operation of the second type.
In the fourth test case,
"aaabba" \xrightarrow{swap} "aaabab" \xrightarrow{swap} "aaaabb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddaabb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddddbb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddddcc".
Submitted Solution:
```
def countFreq(s):
d = {}
for x in s:
if x not in d:
d[x] = 1
else:
d[x] += 1
return d
T = int(input())
for t in range(T):
n, k = map(int, input().split())
a = input()
b = input()
d1 = countFreq(a)
d2 = countFreq(b)
l1 = sorted(d1.values())
l2 = sorted(d2.values())
k1 = sorted(d1.keys())
k2 = sorted(d2.keys())
flag = 0
if(l1 != l2):
print('No')
else:
if k not in l1:
if (k1 == k2):
print('Yes')
else:
print('No')
else:
for i in range(len(k1)):
if(k1[i] > k2[i]):
print('No')
flag = 1
break
if(flag == 0):
print('Yes')
``` | instruction | 0 | 88,620 | 18 | 177,240 |
No | output | 1 | 88,620 | 18 | 177,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ashish has two strings a and b, each of length n, and an integer k. The strings only contain lowercase English letters.
He wants to convert string a into string b by performing some (possibly zero) operations on a.
In one move, he can either
* choose an index i (1 β€ iβ€ n-1) and swap a_i and a_{i+1}, or
* choose an index i (1 β€ i β€ n-k+1) and if a_i, a_{i+1}, β¦, a_{i+k-1} are all equal to some character c (c β 'z'), replace each one with the next character (c+1), that is, 'a' is replaced by 'b', 'b' is replaced by 'c' and so on.
Note that he can perform any number of operations, and the operations can only be performed on string a.
Help Ashish determine if it is possible to convert string a into b after performing some (possibly zero) operations on it.
Input
The first line contains a single integer t (1 β€ t β€ 10^5) β the number of test cases. The description of each test case is as follows.
The first line of each test case contains two integers n (2 β€ n β€ 10^6) and k (1 β€ k β€ n).
The second line of each test case contains the string a of length n consisting of lowercase English letters.
The third line of each test case contains the string b of length n consisting of lowercase English letters.
It is guaranteed that the sum of values n among all test cases does not exceed 10^6.
Output
For each test case, print "Yes" if Ashish can convert a into b after some moves, else print "No".
You may print the letters of the answer in any case (upper or lower).
Example
Input
4
3 3
abc
bcd
4 2
abba
azza
2 1
zz
aa
6 2
aaabba
ddddcc
Output
No
Yes
No
Yes
Note
In the first test case it can be shown that it is impossible to convert a into b.
In the second test case,
"abba" \xrightarrow{inc} "acca" \xrightarrow{inc} β¦ \xrightarrow{inc} "azza".
Here "swap" denotes an operation of the first type, and "inc" denotes an operation of the second type.
In the fourth test case,
"aaabba" \xrightarrow{swap} "aaabab" \xrightarrow{swap} "aaaabb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddaabb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddddbb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddddcc".
Submitted Solution:
```
from collections import Counter
import string
import math
import sys
# sys.setrecursionlimit(10**6)
from fractions import Fraction
from itertools import product
def array_int():
return [int(i) for i in sys.stdin.readline().split()]
def vary(arrber_of_variables):
if arrber_of_variables==1:
return int(sys.stdin.readline())
if arrber_of_variables>=2:
return map(int,sys.stdin.readline().split())
def makedict(var):
return dict(Counter(var))
# i am noob wanted to be better and trying hard for that
def printDivisors(n):
divisors=[]
# Note that this loop runs till square root
i = 1
while i <= math.sqrt(n):
if (n % i == 0) :
# If divisors are equal, print only one
if (n//i == i) :
divisors.append(i)
else :
# Otherwise print both
divisors.extend((i,n//i))
i = i + 1
return divisors
def countTotalBits(num):
binary = bin(num)[2:]
return(len(binary))
def isPrime(n):
# Corner cases
if (n <= 1) :
return False
if (n <= 3) :
return True
# This is checked so that we can skip
# middle five numbers in below loop
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
mod=10**9+7
# def ncr(n,r):
# if n<r:
# return 0
# if n==r:
# return 1
# numer=fact[n]
# # print(numer)
# denm=(fact[n-r]*fact[r])
# # print(denm)
# return numer*pow(denm,mod-2,mod)
# def dfs(node):
# global graph,m,cats,count,visited,val
# # print(val)
# visited[node]=1
# if cats[node]==1:
# val+=1
# # print(val)
# for i in graph[node]:
# if visited[i]==0:
# z=dfs(i)
# # print(z,i)
# count+=z
# val-=1
# return 0
# else:
# return 1
# fact=[1]*(1001)
# c=1
# mod=10**9+7
# for i in range(1,1001):
# print(fact)
def comp(x):
# fact[i]=(fact[i-1]*i)%mod
return x[1]
def SieveOfEratosthenes(n):
# Create a boolean array "prime[0..n]" and initialize
# all entries it as true. A value in prime[i] will
# finally be false if i is Not a prime, else true.
prime = [True for i in range(n+1)]
p = 2
while (p * p <= n):
# If prime[p] is not changed, then it is a prime
if (prime[p] == True):
# Update all multiples of p
for i in range(p * p, n+1, p):
prime[i] = False
p += 1
# Print all prime numbers
for p in range(2, n+1):
if prime[p]:
primes.append(p*p)
primes=[]
# primes=[]
# SieveOfEratosthenes(2*(10**6))
def binary_search(arr, x):
low = 0
high = len(arr) - 1
mid = 0
while low <= high:
mid = (high + low) // 2
# Check if x is present at mid
if arr[mid] < x:
low = mid + 1
# If x is greater, ignore left half
elif arr[mid] > x:
high = mid - 1
# If x is smaller, ignore right half
# if val>m:
else:
return mid
# If we reach here, then the element was not present
return -1
def lcm(a,b):
return (a*b)//math.gcd(a,b)
mod=10**9+7
testCases=1
testCases=vary(1)
for _ in range(testCases):
n,k=vary(2)
a=list(input())
b=list(input())
i=0
cog=1
cogu=[]
value=-9999
while i<n:
if a[i]==b[i]:
i+=1
cog=1
value=9999
continue
elif i<n-1 and a[i]!=b[i] and a[i+1]==b[i] and b[i+1]==a[i]:
a[i+1]=a[i]
cog=1
value=9999
i+=2
continue
elif a[i]!=b[i]:
if value==ord(a[i])-ord(b[i]):
cog+=1
if i==n-1:
cogu.append(cog)
else:
if cog==1:
value=ord(a[i])-ord(b[i])
i+=1
continue
cogu.append(cog)
cog=1
i+=1
if a.count('z')>b.count('z'):
print('No')
else:
if k==1:
print('Yes')
continue
for i in cogu:
if i%k==0:
continue
else:
print('No')
break
else:
print('Yes')
``` | instruction | 0 | 88,621 | 18 | 177,242 |
No | output | 1 | 88,621 | 18 | 177,243 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ashish has two strings a and b, each of length n, and an integer k. The strings only contain lowercase English letters.
He wants to convert string a into string b by performing some (possibly zero) operations on a.
In one move, he can either
* choose an index i (1 β€ iβ€ n-1) and swap a_i and a_{i+1}, or
* choose an index i (1 β€ i β€ n-k+1) and if a_i, a_{i+1}, β¦, a_{i+k-1} are all equal to some character c (c β 'z'), replace each one with the next character (c+1), that is, 'a' is replaced by 'b', 'b' is replaced by 'c' and so on.
Note that he can perform any number of operations, and the operations can only be performed on string a.
Help Ashish determine if it is possible to convert string a into b after performing some (possibly zero) operations on it.
Input
The first line contains a single integer t (1 β€ t β€ 10^5) β the number of test cases. The description of each test case is as follows.
The first line of each test case contains two integers n (2 β€ n β€ 10^6) and k (1 β€ k β€ n).
The second line of each test case contains the string a of length n consisting of lowercase English letters.
The third line of each test case contains the string b of length n consisting of lowercase English letters.
It is guaranteed that the sum of values n among all test cases does not exceed 10^6.
Output
For each test case, print "Yes" if Ashish can convert a into b after some moves, else print "No".
You may print the letters of the answer in any case (upper or lower).
Example
Input
4
3 3
abc
bcd
4 2
abba
azza
2 1
zz
aa
6 2
aaabba
ddddcc
Output
No
Yes
No
Yes
Note
In the first test case it can be shown that it is impossible to convert a into b.
In the second test case,
"abba" \xrightarrow{inc} "acca" \xrightarrow{inc} β¦ \xrightarrow{inc} "azza".
Here "swap" denotes an operation of the first type, and "inc" denotes an operation of the second type.
In the fourth test case,
"aaabba" \xrightarrow{swap} "aaabab" \xrightarrow{swap} "aaaabb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddaabb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddddbb" \xrightarrow{inc} β¦ \xrightarrow{inc} "ddddcc".
Submitted Solution:
```
#!/usr/bin/env python
from __future__ import division, print_function
from collections import Counter
from string import ascii_lowercase
import os
import sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from future_builtins import ascii, filter, hex, map, oct, zip
def main():
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
a = input()
b = input()
aCount, bCount = Counter(a), Counter(b)
for i, letter in enumerate(ascii_lowercase):
diff = aCount[letter] - bCount[letter]
if diff < 0:
print("No")
break
elif diff >= k and letter != "z":
aCount[letter] = 0
aCount[ascii_lowercase[i + 1]] += diff
else:
print("Yes")
# region fastio
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)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
main()
``` | instruction | 0 | 88,622 | 18 | 177,244 |
No | output | 1 | 88,622 | 18 | 177,245 |
Provide a correct Python 3 solution for this coding contest problem.
Taro had his own personal computer and set a password for login. However, Taro inadvertently forgot the password. Then, remembering that there was a piece of paper with the password written down, Taro found the paper and was surprised to see it. The paper was cut and there were only fragments, and there were some stains that made it unreadable. Taro decided to guess the password by referring to the memo.
Constraints
* The length of the character strings A and B is 1 to 1000 characters.
* The length of the B string does not exceed the length of the A string.
Input
String A
String B
Output
Output "Yes" or "No" on one line.
Examples
Input
ABCDE
ABC
Output
Yes
Input
KUSATSU
KSATSU
Output
No
Input
ABCABC
ACBA_B
Output
No
Input
RUPCUAPC
__PC
Output
Yes
Input
AIZU
_A
Output
No | instruction | 0 | 89,194 | 18 | 178,388 |
"Correct Solution:
```
import re
A = input()
B = input()
B = B.replace('_', '.')
if re.search(B, A):
print('Yes')
else:
print('No')
``` | output | 1 | 89,194 | 18 | 178,389 |
Provide a correct Python 3 solution for this coding contest problem.
Taro had his own personal computer and set a password for login. However, Taro inadvertently forgot the password. Then, remembering that there was a piece of paper with the password written down, Taro found the paper and was surprised to see it. The paper was cut and there were only fragments, and there were some stains that made it unreadable. Taro decided to guess the password by referring to the memo.
Constraints
* The length of the character strings A and B is 1 to 1000 characters.
* The length of the B string does not exceed the length of the A string.
Input
String A
String B
Output
Output "Yes" or "No" on one line.
Examples
Input
ABCDE
ABC
Output
Yes
Input
KUSATSU
KSATSU
Output
No
Input
ABCABC
ACBA_B
Output
No
Input
RUPCUAPC
__PC
Output
Yes
Input
AIZU
_A
Output
No | instruction | 0 | 89,195 | 18 | 178,390 |
"Correct Solution:
```
a = input()
b = input()
for i in range(len(a) - len(b) + 1):
f = True
for j in range(len(b)):
if a[i+j] == b[j]:
pass
else:
if b[j] == '_':
pass
else:
f = False
break
if f:
print('Yes')
exit()
print('No')
``` | output | 1 | 89,195 | 18 | 178,391 |
Provide a correct Python 3 solution for this coding contest problem.
Taro had his own personal computer and set a password for login. However, Taro inadvertently forgot the password. Then, remembering that there was a piece of paper with the password written down, Taro found the paper and was surprised to see it. The paper was cut and there were only fragments, and there were some stains that made it unreadable. Taro decided to guess the password by referring to the memo.
Constraints
* The length of the character strings A and B is 1 to 1000 characters.
* The length of the B string does not exceed the length of the A string.
Input
String A
String B
Output
Output "Yes" or "No" on one line.
Examples
Input
ABCDE
ABC
Output
Yes
Input
KUSATSU
KSATSU
Output
No
Input
ABCABC
ACBA_B
Output
No
Input
RUPCUAPC
__PC
Output
Yes
Input
AIZU
_A
Output
No | instruction | 0 | 89,196 | 18 | 178,392 |
"Correct Solution:
```
a = input()
b = input()
length_a = len(a)
length_b = len(b)
def check():
for i in range(length_a - length_b + 1):
for j in range(length_b):
if b[j] == "_" or a[i + j] == b[j]:continue
else:break
else:
print("Yes")
return
print("No")
return
check()
``` | output | 1 | 89,196 | 18 | 178,393 |
Provide a correct Python 3 solution for this coding contest problem.
International Carpenters Professionals Company (ICPC) is a top construction company with a lot of expert carpenters. What makes ICPC a top company is their original language.
The syntax of the language is simply given in CFG as follows:
S -> SS | (S) | )S( | Ξ΅
In other words, a right parenthesis can be closed by a left parenthesis and a left parenthesis can be closed by a right parenthesis in this language.
Alex, a grad student mastering linguistics, decided to study ICPC's language. As a first step of the study, he needs to judge whether a text is well-formed in the language or not. Then, he asked you, a great programmer, to write a program for the judgement.
Alex's request is as follows: You have an empty string S in the beginning, and construct longer string by inserting a sequence of '(' or ')' into the string. You will receive q queries, each of which consists of three elements (p, c, n), where p is the position to insert, n is the number of characters to insert and c is either '(' or ')', the character to insert. For each query, your program should insert c repeated by n times into the p-th position of S from the beginning. Also it should output, after performing each insert operation, "Yes" if S is in the language and "No" if S is not in the language.
Please help Alex to support his study, otherwise he will fail to graduate the college.
Input
The first line contains one integer q (1 \leq q \leq 10^5) indicating the number of queries, follows q lines of three elements, p_i, c_i, n_i, separated by a single space (1 \leq i \leq q, c_i = '(' or ')', 0 \leq p_i \leq length of S before i-th query, 1 \leq n \leq 2^{20}). It is guaranteed that all the queries in the input are valid.
Output
For each query, output "Yes" if S is in the language and "No" if S is not in the language.
Examples
Input
3
0 ( 10
10 ) 5
10 ) 5
Output
No
No
Yes
Input
3
0 ) 10
10 ( 5
10 ( 5
Output
No
No
Yes
Input
3
0 ( 10
10 ) 20
0 ( 10
Output
No
No
Yes | instruction | 0 | 89,210 | 18 | 178,420 |
"Correct Solution:
```
r=0
for i in range(int(input())):
l=list(input().split())
r+=int(l[2])*(2*(l[1]=='(')-1)
print(['No','Yes'][r==0])
``` | output | 1 | 89,210 | 18 | 178,421 |
Provide a correct Python 3 solution for this coding contest problem.
International Carpenters Professionals Company (ICPC) is a top construction company with a lot of expert carpenters. What makes ICPC a top company is their original language.
The syntax of the language is simply given in CFG as follows:
S -> SS | (S) | )S( | Ξ΅
In other words, a right parenthesis can be closed by a left parenthesis and a left parenthesis can be closed by a right parenthesis in this language.
Alex, a grad student mastering linguistics, decided to study ICPC's language. As a first step of the study, he needs to judge whether a text is well-formed in the language or not. Then, he asked you, a great programmer, to write a program for the judgement.
Alex's request is as follows: You have an empty string S in the beginning, and construct longer string by inserting a sequence of '(' or ')' into the string. You will receive q queries, each of which consists of three elements (p, c, n), where p is the position to insert, n is the number of characters to insert and c is either '(' or ')', the character to insert. For each query, your program should insert c repeated by n times into the p-th position of S from the beginning. Also it should output, after performing each insert operation, "Yes" if S is in the language and "No" if S is not in the language.
Please help Alex to support his study, otherwise he will fail to graduate the college.
Input
The first line contains one integer q (1 \leq q \leq 10^5) indicating the number of queries, follows q lines of three elements, p_i, c_i, n_i, separated by a single space (1 \leq i \leq q, c_i = '(' or ')', 0 \leq p_i \leq length of S before i-th query, 1 \leq n \leq 2^{20}). It is guaranteed that all the queries in the input are valid.
Output
For each query, output "Yes" if S is in the language and "No" if S is not in the language.
Examples
Input
3
0 ( 10
10 ) 5
10 ) 5
Output
No
No
Yes
Input
3
0 ) 10
10 ( 5
10 ( 5
Output
No
No
Yes
Input
3
0 ( 10
10 ) 20
0 ( 10
Output
No
No
Yes | instruction | 0 | 89,211 | 18 | 178,422 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
rr = []
n = I()
ni = 0
t = 0
while ni < n:
ni += 1
a = LS()
if a[1] == '(':
t -= int(a[2])
else:
t += int(a[2])
if t == 0:
rr.append('Yes')
else:
rr.append('No')
return '\n'.join(map(str, rr))
print(main())
``` | output | 1 | 89,211 | 18 | 178,423 |
Provide a correct Python 3 solution for this coding contest problem.
International Carpenters Professionals Company (ICPC) is a top construction company with a lot of expert carpenters. What makes ICPC a top company is their original language.
The syntax of the language is simply given in CFG as follows:
S -> SS | (S) | )S( | Ξ΅
In other words, a right parenthesis can be closed by a left parenthesis and a left parenthesis can be closed by a right parenthesis in this language.
Alex, a grad student mastering linguistics, decided to study ICPC's language. As a first step of the study, he needs to judge whether a text is well-formed in the language or not. Then, he asked you, a great programmer, to write a program for the judgement.
Alex's request is as follows: You have an empty string S in the beginning, and construct longer string by inserting a sequence of '(' or ')' into the string. You will receive q queries, each of which consists of three elements (p, c, n), where p is the position to insert, n is the number of characters to insert and c is either '(' or ')', the character to insert. For each query, your program should insert c repeated by n times into the p-th position of S from the beginning. Also it should output, after performing each insert operation, "Yes" if S is in the language and "No" if S is not in the language.
Please help Alex to support his study, otherwise he will fail to graduate the college.
Input
The first line contains one integer q (1 \leq q \leq 10^5) indicating the number of queries, follows q lines of three elements, p_i, c_i, n_i, separated by a single space (1 \leq i \leq q, c_i = '(' or ')', 0 \leq p_i \leq length of S before i-th query, 1 \leq n \leq 2^{20}). It is guaranteed that all the queries in the input are valid.
Output
For each query, output "Yes" if S is in the language and "No" if S is not in the language.
Examples
Input
3
0 ( 10
10 ) 5
10 ) 5
Output
No
No
Yes
Input
3
0 ) 10
10 ( 5
10 ( 5
Output
No
No
Yes
Input
3
0 ( 10
10 ) 20
0 ( 10
Output
No
No
Yes | instruction | 0 | 89,212 | 18 | 178,424 |
"Correct Solution:
```
N = int(input())
lp = rp = 0
for i in range(N):
p,c,n = input().split()
if c == '(':
lp += int(n)
else:
rp += int(n)
print('Yes' if lp == rp else 'No')
``` | output | 1 | 89,212 | 18 | 178,425 |
Provide a correct Python 3 solution for this coding contest problem.
International Carpenters Professionals Company (ICPC) is a top construction company with a lot of expert carpenters. What makes ICPC a top company is their original language.
The syntax of the language is simply given in CFG as follows:
S -> SS | (S) | )S( | Ξ΅
In other words, a right parenthesis can be closed by a left parenthesis and a left parenthesis can be closed by a right parenthesis in this language.
Alex, a grad student mastering linguistics, decided to study ICPC's language. As a first step of the study, he needs to judge whether a text is well-formed in the language or not. Then, he asked you, a great programmer, to write a program for the judgement.
Alex's request is as follows: You have an empty string S in the beginning, and construct longer string by inserting a sequence of '(' or ')' into the string. You will receive q queries, each of which consists of three elements (p, c, n), where p is the position to insert, n is the number of characters to insert and c is either '(' or ')', the character to insert. For each query, your program should insert c repeated by n times into the p-th position of S from the beginning. Also it should output, after performing each insert operation, "Yes" if S is in the language and "No" if S is not in the language.
Please help Alex to support his study, otherwise he will fail to graduate the college.
Input
The first line contains one integer q (1 \leq q \leq 10^5) indicating the number of queries, follows q lines of three elements, p_i, c_i, n_i, separated by a single space (1 \leq i \leq q, c_i = '(' or ')', 0 \leq p_i \leq length of S before i-th query, 1 \leq n \leq 2^{20}). It is guaranteed that all the queries in the input are valid.
Output
For each query, output "Yes" if S is in the language and "No" if S is not in the language.
Examples
Input
3
0 ( 10
10 ) 5
10 ) 5
Output
No
No
Yes
Input
3
0 ) 10
10 ( 5
10 ( 5
Output
No
No
Yes
Input
3
0 ( 10
10 ) 20
0 ( 10
Output
No
No
Yes | instruction | 0 | 89,213 | 18 | 178,426 |
"Correct Solution:
```
c=0
for _ in range(int(input())):
_,s,a=input().split()
a=int(a)
c+=a if s=='(' else -a
print(['No','Yes'][not c])
``` | output | 1 | 89,213 | 18 | 178,427 |
Provide a correct Python 3 solution for this coding contest problem.
International Carpenters Professionals Company (ICPC) is a top construction company with a lot of expert carpenters. What makes ICPC a top company is their original language.
The syntax of the language is simply given in CFG as follows:
S -> SS | (S) | )S( | Ξ΅
In other words, a right parenthesis can be closed by a left parenthesis and a left parenthesis can be closed by a right parenthesis in this language.
Alex, a grad student mastering linguistics, decided to study ICPC's language. As a first step of the study, he needs to judge whether a text is well-formed in the language or not. Then, he asked you, a great programmer, to write a program for the judgement.
Alex's request is as follows: You have an empty string S in the beginning, and construct longer string by inserting a sequence of '(' or ')' into the string. You will receive q queries, each of which consists of three elements (p, c, n), where p is the position to insert, n is the number of characters to insert and c is either '(' or ')', the character to insert. For each query, your program should insert c repeated by n times into the p-th position of S from the beginning. Also it should output, after performing each insert operation, "Yes" if S is in the language and "No" if S is not in the language.
Please help Alex to support his study, otherwise he will fail to graduate the college.
Input
The first line contains one integer q (1 \leq q \leq 10^5) indicating the number of queries, follows q lines of three elements, p_i, c_i, n_i, separated by a single space (1 \leq i \leq q, c_i = '(' or ')', 0 \leq p_i \leq length of S before i-th query, 1 \leq n \leq 2^{20}). It is guaranteed that all the queries in the input are valid.
Output
For each query, output "Yes" if S is in the language and "No" if S is not in the language.
Examples
Input
3
0 ( 10
10 ) 5
10 ) 5
Output
No
No
Yes
Input
3
0 ) 10
10 ( 5
10 ( 5
Output
No
No
Yes
Input
3
0 ( 10
10 ) 20
0 ( 10
Output
No
No
Yes | instruction | 0 | 89,214 | 18 | 178,428 |
"Correct Solution:
```
r=l=0
for _ in range(int(input())):
_,s,a=input().split()
a=int(a)
if s[0]=='(':l+=a
else:r+=a
print(['No','Yes'][l==r])
``` | output | 1 | 89,214 | 18 | 178,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka's favourite experimental indie band has recently dropped a new album! Songs of that album share one gimmick. Each name s_i is one of the following types:
* 1~c β a single lowercase Latin letter;
* 2~j~c β name s_j (1 β€ j < i) with a single lowercase Latin letter appended to its end.
Songs are numbered from 1 to n. It's guaranteed that the first song is always of type 1.
Vova is rather interested in the new album but he really doesn't have the time to listen to it entirely. Thus he asks Mishka some questions about it to determine if some song is worth listening to. Questions have the following format:
* i~t β count the number of occurrences of string t in s_i (the name of the i-th song of the album) as a continuous substring, t consists only of lowercase Latin letters.
Mishka doesn't question the purpose of that information, yet he struggles to provide it. Can you please help Mishka answer all Vova's questions?
Input
The first line contains a single integer n (1 β€ n β€ 4 β
10^5) β the number of songs in the album.
Each of the next n lines contains the desciption of the i-th song of the album in the following format:
* 1~c β s_i is a single lowercase Latin letter;
* 2~j~c β s_i is the name s_j (1 β€ j < i) with a single lowercase Latin letter appended to its end.
The next line contains a single integer m (1 β€ m β€ 4 β
10^5) β the number of Vova's questions.
Each of the next m lines contains the desciption of the j-th Vova's question in the following format:
* i~t (1 β€ i β€ n, 1 β€ |t| β€ 4 β
10^5) β count the number of occurrences of string t in s_i (the name of the i-th song of the album) as a continuous substring, t consists only of lowercase Latin letters.
It's guaranteed that the total length of question strings t doesn't exceed 4 β
10^5.
Output
For each question print a single integer β the number of occurrences of the question string t in the name of the i-th song of the album as a continuous substring.
Example
Input
20
1 d
2 1 a
2 2 d
2 3 a
2 4 d
2 5 a
2 6 d
2 7 a
1 d
2 9 o
2 10 k
2 11 i
2 12 d
2 13 o
2 14 k
2 15 i
2 1 o
2 17 k
2 18 i
2 15 i
12
8 da
8 dada
8 ada
6 dada
3 dada
19 doki
19 ok
16 doki
15 doki
9 d
1 a
20 doki
Output
4
3
3
2
0
1
1
2
1
1
0
2
Note
Song names of the first example:
1. d
2. da
3. dad
4. dada
5. dadad
6. dadada
7. dadadad
8. dadadada
9. d
10. do
11. dok
12. doki
13. dokid
14. dokido
15. dokidok
16. dokidoki
17. do
18. dok
19. doki
20. dokidoki
Thus the occurrences for each question string are:
1. string "da" starts in positions [1, 3, 5, 7] in the name "dadadada";
2. string "dada" starts in positions [1, 3, 5] in the name "dadadada";
3. string "ada" starts in positions [2, 4, 6] in the name "dadadada";
4. string "dada" starts in positions [1, 3] in the name "dadada";
5. no occurrences of string "dada" in the name "dad";
6. string "doki" starts in position [1] in the name "doki";
7. string "ok" starts in position [2] in the name "doki";
8. string "doki" starts in positions [1, 5] in the name "dokidoki";
9. string "doki" starts in position [1] in the name "dokidok";
10. string "d" starts in position [1] in the name "d";
11. no occurrences of string "a" in the name "d";
12. string "doki" starts in positions [1, 5] in the name "dokidoki".
Submitted Solution:
```
def f(string,t):
n1=len(t)
n2=len(string)
c=0
for i in range(n2-n1+1):
if string[i:i+n1]==t:
c+=1
return c
n=int(input())
l=[0 for i in range(n)]
for w in range(n):
s=list(map(str,input().strip().split()))
if s[0]=="1":
l[w]=s[1]
else:
l[w]=l[int(s[1])-1]+s[2]
m=int(input())
for t in range(m):
s2=list(map(str,input().strip().split()))
i=int(s2[0])
t=s2[1:]
print(f(l[i-1],t))
``` | instruction | 0 | 89,350 | 18 | 178,700 |
No | output | 1 | 89,350 | 18 | 178,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka's favourite experimental indie band has recently dropped a new album! Songs of that album share one gimmick. Each name s_i is one of the following types:
* 1~c β a single lowercase Latin letter;
* 2~j~c β name s_j (1 β€ j < i) with a single lowercase Latin letter appended to its end.
Songs are numbered from 1 to n. It's guaranteed that the first song is always of type 1.
Vova is rather interested in the new album but he really doesn't have the time to listen to it entirely. Thus he asks Mishka some questions about it to determine if some song is worth listening to. Questions have the following format:
* i~t β count the number of occurrences of string t in s_i (the name of the i-th song of the album) as a continuous substring, t consists only of lowercase Latin letters.
Mishka doesn't question the purpose of that information, yet he struggles to provide it. Can you please help Mishka answer all Vova's questions?
Input
The first line contains a single integer n (1 β€ n β€ 4 β
10^5) β the number of songs in the album.
Each of the next n lines contains the desciption of the i-th song of the album in the following format:
* 1~c β s_i is a single lowercase Latin letter;
* 2~j~c β s_i is the name s_j (1 β€ j < i) with a single lowercase Latin letter appended to its end.
The next line contains a single integer m (1 β€ m β€ 4 β
10^5) β the number of Vova's questions.
Each of the next m lines contains the desciption of the j-th Vova's question in the following format:
* i~t (1 β€ i β€ n, 1 β€ |t| β€ 4 β
10^5) β count the number of occurrences of string t in s_i (the name of the i-th song of the album) as a continuous substring, t consists only of lowercase Latin letters.
It's guaranteed that the total length of question strings t doesn't exceed 4 β
10^5.
Output
For each question print a single integer β the number of occurrences of the question string t in the name of the i-th song of the album as a continuous substring.
Example
Input
20
1 d
2 1 a
2 2 d
2 3 a
2 4 d
2 5 a
2 6 d
2 7 a
1 d
2 9 o
2 10 k
2 11 i
2 12 d
2 13 o
2 14 k
2 15 i
2 1 o
2 17 k
2 18 i
2 15 i
12
8 da
8 dada
8 ada
6 dada
3 dada
19 doki
19 ok
16 doki
15 doki
9 d
1 a
20 doki
Output
4
3
3
2
0
1
1
2
1
1
0
2
Note
Song names of the first example:
1. d
2. da
3. dad
4. dada
5. dadad
6. dadada
7. dadadad
8. dadadada
9. d
10. do
11. dok
12. doki
13. dokid
14. dokido
15. dokidok
16. dokidoki
17. do
18. dok
19. doki
20. dokidoki
Thus the occurrences for each question string are:
1. string "da" starts in positions [1, 3, 5, 7] in the name "dadadada";
2. string "dada" starts in positions [1, 3, 5] in the name "dadadada";
3. string "ada" starts in positions [2, 4, 6] in the name "dadadada";
4. string "dada" starts in positions [1, 3] in the name "dadada";
5. no occurrences of string "dada" in the name "dad";
6. string "doki" starts in position [1] in the name "doki";
7. string "ok" starts in position [2] in the name "doki";
8. string "doki" starts in positions [1, 5] in the name "dokidoki";
9. string "doki" starts in position [1] in the name "dokidok";
10. string "d" starts in position [1] in the name "d";
11. no occurrences of string "a" in the name "d";
12. string "doki" starts in positions [1, 5] in the name "dokidoki".
Submitted Solution:
```
int_tot = int(input())
alb_name = []
que_vov = []
for x in range(0, int_tot):
temp = input().split(" ")
if temp[0] == '1':
alb_name.append(temp[1])
else:
alb_name.append(alb_name[int(temp[1]) - 1] + temp[2])
int_tot = int(input())
for x in range(0, int_tot):
que_vov.append(input().split(" "))
for s in range(0, len(que_vov)):
counter = 0
temp_alb_name = alb_name[int(que_vov[s][0]) - 1]
for y in range(0, len(temp_alb_name)):
hp = y + len(que_vov[s][1])
if len(temp_alb_name) - y > len(que_vov[s][1]):
temp_ = temp_alb_name[y:y + len(que_vov[s][1])]
if temp_ == que_vov[s][1]:
counter += 1
print(counter)
``` | instruction | 0 | 89,351 | 18 | 178,702 |
No | output | 1 | 89,351 | 18 | 178,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka's favourite experimental indie band has recently dropped a new album! Songs of that album share one gimmick. Each name s_i is one of the following types:
* 1~c β a single lowercase Latin letter;
* 2~j~c β name s_j (1 β€ j < i) with a single lowercase Latin letter appended to its end.
Songs are numbered from 1 to n. It's guaranteed that the first song is always of type 1.
Vova is rather interested in the new album but he really doesn't have the time to listen to it entirely. Thus he asks Mishka some questions about it to determine if some song is worth listening to. Questions have the following format:
* i~t β count the number of occurrences of string t in s_i (the name of the i-th song of the album) as a continuous substring, t consists only of lowercase Latin letters.
Mishka doesn't question the purpose of that information, yet he struggles to provide it. Can you please help Mishka answer all Vova's questions?
Input
The first line contains a single integer n (1 β€ n β€ 4 β
10^5) β the number of songs in the album.
Each of the next n lines contains the desciption of the i-th song of the album in the following format:
* 1~c β s_i is a single lowercase Latin letter;
* 2~j~c β s_i is the name s_j (1 β€ j < i) with a single lowercase Latin letter appended to its end.
The next line contains a single integer m (1 β€ m β€ 4 β
10^5) β the number of Vova's questions.
Each of the next m lines contains the desciption of the j-th Vova's question in the following format:
* i~t (1 β€ i β€ n, 1 β€ |t| β€ 4 β
10^5) β count the number of occurrences of string t in s_i (the name of the i-th song of the album) as a continuous substring, t consists only of lowercase Latin letters.
It's guaranteed that the total length of question strings t doesn't exceed 4 β
10^5.
Output
For each question print a single integer β the number of occurrences of the question string t in the name of the i-th song of the album as a continuous substring.
Example
Input
20
1 d
2 1 a
2 2 d
2 3 a
2 4 d
2 5 a
2 6 d
2 7 a
1 d
2 9 o
2 10 k
2 11 i
2 12 d
2 13 o
2 14 k
2 15 i
2 1 o
2 17 k
2 18 i
2 15 i
12
8 da
8 dada
8 ada
6 dada
3 dada
19 doki
19 ok
16 doki
15 doki
9 d
1 a
20 doki
Output
4
3
3
2
0
1
1
2
1
1
0
2
Note
Song names of the first example:
1. d
2. da
3. dad
4. dada
5. dadad
6. dadada
7. dadadad
8. dadadada
9. d
10. do
11. dok
12. doki
13. dokid
14. dokido
15. dokidok
16. dokidoki
17. do
18. dok
19. doki
20. dokidoki
Thus the occurrences for each question string are:
1. string "da" starts in positions [1, 3, 5, 7] in the name "dadadada";
2. string "dada" starts in positions [1, 3, 5] in the name "dadadada";
3. string "ada" starts in positions [2, 4, 6] in the name "dadadada";
4. string "dada" starts in positions [1, 3] in the name "dadada";
5. no occurrences of string "dada" in the name "dad";
6. string "doki" starts in position [1] in the name "doki";
7. string "ok" starts in position [2] in the name "doki";
8. string "doki" starts in positions [1, 5] in the name "dokidoki";
9. string "doki" starts in position [1] in the name "dokidok";
10. string "d" starts in position [1] in the name "d";
11. no occurrences of string "a" in the name "d";
12. string "doki" starts in positions [1, 5] in the name "dokidoki".
Submitted Solution:
```
int_tot = int(input())
alb_name = []
que_vov = []
for x in range(0, int_tot):
temp = input().split(" ")
if temp[0] == '1':
alb_name.append(temp[1])
else:
alb_name.append(alb_name[int(temp[1]) - 1] + temp[2])
int_tot = int(input())
for x in range(0, int_tot):
que_vov.append(input().split(" "))
for s in range(0, len(que_vov)):
counter = 0
temp_alb_name = alb_name[int(que_vov[s][0]) - 1]
if len(temp_alb_name) < len(que_vov[s][1]):
break
for y in range(0, len(temp_alb_name)):
temp_ = temp_alb_name[y:y + len(que_vov[s][1])]
if temp_ == que_vov[s][1]:
counter += 1
print(counter)
``` | instruction | 0 | 89,352 | 18 | 178,704 |
No | output | 1 | 89,352 | 18 | 178,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka's favourite experimental indie band has recently dropped a new album! Songs of that album share one gimmick. Each name s_i is one of the following types:
* 1~c β a single lowercase Latin letter;
* 2~j~c β name s_j (1 β€ j < i) with a single lowercase Latin letter appended to its end.
Songs are numbered from 1 to n. It's guaranteed that the first song is always of type 1.
Vova is rather interested in the new album but he really doesn't have the time to listen to it entirely. Thus he asks Mishka some questions about it to determine if some song is worth listening to. Questions have the following format:
* i~t β count the number of occurrences of string t in s_i (the name of the i-th song of the album) as a continuous substring, t consists only of lowercase Latin letters.
Mishka doesn't question the purpose of that information, yet he struggles to provide it. Can you please help Mishka answer all Vova's questions?
Input
The first line contains a single integer n (1 β€ n β€ 4 β
10^5) β the number of songs in the album.
Each of the next n lines contains the desciption of the i-th song of the album in the following format:
* 1~c β s_i is a single lowercase Latin letter;
* 2~j~c β s_i is the name s_j (1 β€ j < i) with a single lowercase Latin letter appended to its end.
The next line contains a single integer m (1 β€ m β€ 4 β
10^5) β the number of Vova's questions.
Each of the next m lines contains the desciption of the j-th Vova's question in the following format:
* i~t (1 β€ i β€ n, 1 β€ |t| β€ 4 β
10^5) β count the number of occurrences of string t in s_i (the name of the i-th song of the album) as a continuous substring, t consists only of lowercase Latin letters.
It's guaranteed that the total length of question strings t doesn't exceed 4 β
10^5.
Output
For each question print a single integer β the number of occurrences of the question string t in the name of the i-th song of the album as a continuous substring.
Example
Input
20
1 d
2 1 a
2 2 d
2 3 a
2 4 d
2 5 a
2 6 d
2 7 a
1 d
2 9 o
2 10 k
2 11 i
2 12 d
2 13 o
2 14 k
2 15 i
2 1 o
2 17 k
2 18 i
2 15 i
12
8 da
8 dada
8 ada
6 dada
3 dada
19 doki
19 ok
16 doki
15 doki
9 d
1 a
20 doki
Output
4
3
3
2
0
1
1
2
1
1
0
2
Note
Song names of the first example:
1. d
2. da
3. dad
4. dada
5. dadad
6. dadada
7. dadadad
8. dadadada
9. d
10. do
11. dok
12. doki
13. dokid
14. dokido
15. dokidok
16. dokidoki
17. do
18. dok
19. doki
20. dokidoki
Thus the occurrences for each question string are:
1. string "da" starts in positions [1, 3, 5, 7] in the name "dadadada";
2. string "dada" starts in positions [1, 3, 5] in the name "dadadada";
3. string "ada" starts in positions [2, 4, 6] in the name "dadadada";
4. string "dada" starts in positions [1, 3] in the name "dadada";
5. no occurrences of string "dada" in the name "dad";
6. string "doki" starts in position [1] in the name "doki";
7. string "ok" starts in position [2] in the name "doki";
8. string "doki" starts in positions [1, 5] in the name "dokidoki";
9. string "doki" starts in position [1] in the name "dokidok";
10. string "d" starts in position [1] in the name "d";
11. no occurrences of string "a" in the name "d";
12. string "doki" starts in positions [1, 5] in the name "dokidoki".
Submitted Solution:
```
int_tot = int(input())
alb_name = []
que_vov = []
for x in range(0, int_tot):
temp = input().split(" ")
if temp[0] == '1':
alb_name.append(temp[1])
else:
alb_name.append(alb_name[int(temp[1]) - 1] + temp[2])
int_tot = int(input())
for x in range(0, int_tot):
que_vov.append(input().split(" "))
for s in range(0, len(que_vov)):
counter = 0
temp_alb_name = alb_name[int(que_vov[s][0]) - 1]
for y in range(s,len(que_vov[s][0])):
temp_ = temp_alb_name[y:y + len(que_vov[s][1])]
if temp_ == que_vov[s][1]:
counter += 1
print(counter)
``` | instruction | 0 | 89,353 | 18 | 178,706 |
No | output | 1 | 89,353 | 18 | 178,707 |
Provide a correct Python 3 solution for this coding contest problem.
You are given string S and T consisting of lowercase English letters.
Determine if S equals T after rotation.
That is, determine if S equals T after the following operation is performed some number of times:
Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.
Here, |X| denotes the length of the string X.
Constraints
* 2 \leq |S| \leq 100
* |S| = |T|
* S and T consist of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
T
Output
If S equals T after rotation, print `Yes`; if it does not, print `No`.
Examples
Input
kyoto
tokyo
Output
Yes
Input
abc
arc
Output
No
Input
aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab
Output
Yes | instruction | 0 | 89,945 | 18 | 179,890 |
"Correct Solution:
```
S = input()
T = input()
S = S * 2
yes = S.find(T) != -1
print('Yes' if yes else 'No')
``` | output | 1 | 89,945 | 18 | 179,891 |
Provide a correct Python 3 solution for this coding contest problem.
You are given string S and T consisting of lowercase English letters.
Determine if S equals T after rotation.
That is, determine if S equals T after the following operation is performed some number of times:
Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.
Here, |X| denotes the length of the string X.
Constraints
* 2 \leq |S| \leq 100
* |S| = |T|
* S and T consist of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
T
Output
If S equals T after rotation, print `Yes`; if it does not, print `No`.
Examples
Input
kyoto
tokyo
Output
Yes
Input
abc
arc
Output
No
Input
aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab
Output
Yes | instruction | 0 | 89,946 | 18 | 179,892 |
"Correct Solution:
```
s=input()
t=input()
t=t+t
if s in t:
print('Yes')
else:
print('No')
``` | output | 1 | 89,946 | 18 | 179,893 |
Provide a correct Python 3 solution for this coding contest problem.
You are given string S and T consisting of lowercase English letters.
Determine if S equals T after rotation.
That is, determine if S equals T after the following operation is performed some number of times:
Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.
Here, |X| denotes the length of the string X.
Constraints
* 2 \leq |S| \leq 100
* |S| = |T|
* S and T consist of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
T
Output
If S equals T after rotation, print `Yes`; if it does not, print `No`.
Examples
Input
kyoto
tokyo
Output
Yes
Input
abc
arc
Output
No
Input
aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab
Output
Yes | instruction | 0 | 89,947 | 18 | 179,894 |
"Correct Solution:
```
s = input()
t = input()
s = s + s
if t in s:
print("Yes")
else:
print("No")
``` | output | 1 | 89,947 | 18 | 179,895 |
Provide a correct Python 3 solution for this coding contest problem.
You are given string S and T consisting of lowercase English letters.
Determine if S equals T after rotation.
That is, determine if S equals T after the following operation is performed some number of times:
Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.
Here, |X| denotes the length of the string X.
Constraints
* 2 \leq |S| \leq 100
* |S| = |T|
* S and T consist of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
T
Output
If S equals T after rotation, print `Yes`; if it does not, print `No`.
Examples
Input
kyoto
tokyo
Output
Yes
Input
abc
arc
Output
No
Input
aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab
Output
Yes | instruction | 0 | 89,948 | 18 | 179,896 |
"Correct Solution:
```
s = input()
ss = input()
ss += ss
if s in ss:
print("Yes")
else:
print("No")
``` | output | 1 | 89,948 | 18 | 179,897 |
Provide a correct Python 3 solution for this coding contest problem.
You are given string S and T consisting of lowercase English letters.
Determine if S equals T after rotation.
That is, determine if S equals T after the following operation is performed some number of times:
Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.
Here, |X| denotes the length of the string X.
Constraints
* 2 \leq |S| \leq 100
* |S| = |T|
* S and T consist of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
T
Output
If S equals T after rotation, print `Yes`; if it does not, print `No`.
Examples
Input
kyoto
tokyo
Output
Yes
Input
abc
arc
Output
No
Input
aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab
Output
Yes | instruction | 0 | 89,949 | 18 | 179,898 |
"Correct Solution:
```
S = input()
T = input()
if (S+S).count(T)>=1:
print ('Yes')
else:
print('No')
``` | output | 1 | 89,949 | 18 | 179,899 |
Provide a correct Python 3 solution for this coding contest problem.
You are given string S and T consisting of lowercase English letters.
Determine if S equals T after rotation.
That is, determine if S equals T after the following operation is performed some number of times:
Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.
Here, |X| denotes the length of the string X.
Constraints
* 2 \leq |S| \leq 100
* |S| = |T|
* S and T consist of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
T
Output
If S equals T after rotation, print `Yes`; if it does not, print `No`.
Examples
Input
kyoto
tokyo
Output
Yes
Input
abc
arc
Output
No
Input
aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab
Output
Yes | instruction | 0 | 89,950 | 18 | 179,900 |
"Correct Solution:
```
S = input()
T = input()
TT = T + T
if S in TT:
print("Yes")
else:
print("No")
``` | output | 1 | 89,950 | 18 | 179,901 |
Provide a correct Python 3 solution for this coding contest problem.
You are given string S and T consisting of lowercase English letters.
Determine if S equals T after rotation.
That is, determine if S equals T after the following operation is performed some number of times:
Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.
Here, |X| denotes the length of the string X.
Constraints
* 2 \leq |S| \leq 100
* |S| = |T|
* S and T consist of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
T
Output
If S equals T after rotation, print `Yes`; if it does not, print `No`.
Examples
Input
kyoto
tokyo
Output
Yes
Input
abc
arc
Output
No
Input
aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab
Output
Yes | instruction | 0 | 89,951 | 18 | 179,902 |
"Correct Solution:
```
s = input()
t = input()
print("Yes" if (s * 2).find(t) >= 0 else "No")
``` | output | 1 | 89,951 | 18 | 179,903 |
Provide a correct Python 3 solution for this coding contest problem.
You are given string S and T consisting of lowercase English letters.
Determine if S equals T after rotation.
That is, determine if S equals T after the following operation is performed some number of times:
Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.
Here, |X| denotes the length of the string X.
Constraints
* 2 \leq |S| \leq 100
* |S| = |T|
* S and T consist of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
T
Output
If S equals T after rotation, print `Yes`; if it does not, print `No`.
Examples
Input
kyoto
tokyo
Output
Yes
Input
abc
arc
Output
No
Input
aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab
Output
Yes | instruction | 0 | 89,952 | 18 | 179,904 |
"Correct Solution:
```
s = input() * 2
t = input()
print("Yes") if t in s else print("No")
``` | output | 1 | 89,952 | 18 | 179,905 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given string S and T consisting of lowercase English letters.
Determine if S equals T after rotation.
That is, determine if S equals T after the following operation is performed some number of times:
Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.
Here, |X| denotes the length of the string X.
Constraints
* 2 \leq |S| \leq 100
* |S| = |T|
* S and T consist of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
T
Output
If S equals T after rotation, print `Yes`; if it does not, print `No`.
Examples
Input
kyoto
tokyo
Output
Yes
Input
abc
arc
Output
No
Input
aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab
Output
Yes
Submitted Solution:
```
#103b
S = str(input())
T = str(input())
T = T + T
if S in T:
print("Yes")
else:
print("No")
``` | instruction | 0 | 89,953 | 18 | 179,906 |
Yes | output | 1 | 89,953 | 18 | 179,907 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given string S and T consisting of lowercase English letters.
Determine if S equals T after rotation.
That is, determine if S equals T after the following operation is performed some number of times:
Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.
Here, |X| denotes the length of the string X.
Constraints
* 2 \leq |S| \leq 100
* |S| = |T|
* S and T consist of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
T
Output
If S equals T after rotation, print `Yes`; if it does not, print `No`.
Examples
Input
kyoto
tokyo
Output
Yes
Input
abc
arc
Output
No
Input
aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab
Output
Yes
Submitted Solution:
```
s = input()
t = input()
s2 = s + s
if t in s2:
print("Yes")
else:
print("No")
``` | instruction | 0 | 89,954 | 18 | 179,908 |
Yes | output | 1 | 89,954 | 18 | 179,909 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given string S and T consisting of lowercase English letters.
Determine if S equals T after rotation.
That is, determine if S equals T after the following operation is performed some number of times:
Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.
Here, |X| denotes the length of the string X.
Constraints
* 2 \leq |S| \leq 100
* |S| = |T|
* S and T consist of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
T
Output
If S equals T after rotation, print `Yes`; if it does not, print `No`.
Examples
Input
kyoto
tokyo
Output
Yes
Input
abc
arc
Output
No
Input
aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab
Output
Yes
Submitted Solution:
```
S = input()
T = input()
a = "No"
for n in range(len(S)):
if S[n:]+S[:n]==T:
a = "Yes"
print(a)
``` | instruction | 0 | 89,955 | 18 | 179,910 |
Yes | output | 1 | 89,955 | 18 | 179,911 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given string S and T consisting of lowercase English letters.
Determine if S equals T after rotation.
That is, determine if S equals T after the following operation is performed some number of times:
Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.
Here, |X| denotes the length of the string X.
Constraints
* 2 \leq |S| \leq 100
* |S| = |T|
* S and T consist of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
T
Output
If S equals T after rotation, print `Yes`; if it does not, print `No`.
Examples
Input
kyoto
tokyo
Output
Yes
Input
abc
arc
Output
No
Input
aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab
Output
Yes
Submitted Solution:
```
S = input()
T = input()
T = T * 2
if T.find(S) != -1:
print('Yes')
else:
print('No')
``` | instruction | 0 | 89,956 | 18 | 179,912 |
Yes | output | 1 | 89,956 | 18 | 179,913 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given string S and T consisting of lowercase English letters.
Determine if S equals T after rotation.
That is, determine if S equals T after the following operation is performed some number of times:
Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.
Here, |X| denotes the length of the string X.
Constraints
* 2 \leq |S| \leq 100
* |S| = |T|
* S and T consist of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
T
Output
If S equals T after rotation, print `Yes`; if it does not, print `No`.
Examples
Input
kyoto
tokyo
Output
Yes
Input
abc
arc
Output
No
Input
aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab
Output
Yes
Submitted Solution:
```
s = input()
t = input()
#s = list(s)
#t = list(t)
for i in range(0,int(len(s)/2)):
s += s
for i in range(len(s),0,-1):
#print(s[i:i+5])
if t == s[i:i+len(s)]:
print("Yes")
exit()
print("No")
``` | instruction | 0 | 89,957 | 18 | 179,914 |
No | output | 1 | 89,957 | 18 | 179,915 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given string S and T consisting of lowercase English letters.
Determine if S equals T after rotation.
That is, determine if S equals T after the following operation is performed some number of times:
Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.
Here, |X| denotes the length of the string X.
Constraints
* 2 \leq |S| \leq 100
* |S| = |T|
* S and T consist of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
T
Output
If S equals T after rotation, print `Yes`; if it does not, print `No`.
Examples
Input
kyoto
tokyo
Output
Yes
Input
abc
arc
Output
No
Input
aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab
Output
Yes
Submitted Solution:
```
S = input()
T = input()
S_list = [S]
for i in range(len(S)-1):
S_list.append(S[i:]+S[:i])
if T in S_list:
print('Yes')
else:
print('No')
``` | instruction | 0 | 89,958 | 18 | 179,916 |
No | output | 1 | 89,958 | 18 | 179,917 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given string S and T consisting of lowercase English letters.
Determine if S equals T after rotation.
That is, determine if S equals T after the following operation is performed some number of times:
Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.
Here, |X| denotes the length of the string X.
Constraints
* 2 \leq |S| \leq 100
* |S| = |T|
* S and T consist of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
T
Output
If S equals T after rotation, print `Yes`; if it does not, print `No`.
Examples
Input
kyoto
tokyo
Output
Yes
Input
abc
arc
Output
No
Input
aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab
Output
Yes
Submitted Solution:
```
input_x = str(input())
input_y = str(input())
tmp = input_y
ary = []
for i in input_y:
ary.append(i)
mongon = "Yes"
for c in input_x:
if tmp.find(c) != -1:
ary.pop(tmp.find(c))
tmp = "".join(ary)
else:
mongon = "No"
break
print(mongon)
``` | instruction | 0 | 89,959 | 18 | 179,918 |
No | output | 1 | 89,959 | 18 | 179,919 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given string S and T consisting of lowercase English letters.
Determine if S equals T after rotation.
That is, determine if S equals T after the following operation is performed some number of times:
Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.
Here, |X| denotes the length of the string X.
Constraints
* 2 \leq |S| \leq 100
* |S| = |T|
* S and T consist of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
T
Output
If S equals T after rotation, print `Yes`; if it does not, print `No`.
Examples
Input
kyoto
tokyo
Output
Yes
Input
abc
arc
Output
No
Input
aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab
Output
Yes
Submitted Solution:
```
s=list(input())
t=input()
for i in range(len(s)):
s.insert(0,s.pop())
word="".join(s)
if s==t:
print("Yes")
exit()
print("No")
``` | instruction | 0 | 89,960 | 18 | 179,920 |
No | output | 1 | 89,960 | 18 | 179,921 |
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
anagram
grandmother
Output
4 | instruction | 0 | 90,053 | 18 | 180,106 |
"Correct Solution:
```
s1 = input()
s2 = input()
cA = ord('a')
s1 = [ord(e) - cA for e in s1]
l1 = len(s1)
s2 = [ord(e) - cA for e in s2]
l2 = len(s2)
ans = 0
for l in range(1, min(l1, l2)+1):
s = set()
use = [0]*26
for i in range(l-1):
use[s1[i]] += 1
for i in range(l-1, l1):
use[s1[i]] += 1
s.add(tuple(use))
use[s1[i-l+1]] -= 1
cnt = [0]*26
for i in range(l-1):
cnt[s2[i]] += 1
for i in range(l-1, l2):
cnt[s2[i]] += 1
if tuple(cnt) in s:
ans = l
break
cnt[s2[i-l+1]] -= 1
print(ans)
``` | output | 1 | 90,053 | 18 | 180,107 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Alex was creating a contest about his friends, but accidentally deleted it. Fortunately, all the problems were saved, but now he needs to find them among other problems.
But there are too many problems, to do it manually. Alex asks you to write a program, which will determine if a problem is from this contest by its name.
It is known, that problem is from this contest if and only if its name contains one of Alex's friends' name exactly once. His friends' names are "Danil", "Olya", "Slava", "Ann" and "Nikita".
Names are case sensitive.
Input
The only line contains string from lowercase and uppercase letters and "_" symbols of length, not more than 100 β the name of the problem.
Output
Print "YES", if problem is from this contest, and "NO" otherwise.
Examples
Input
Alex_and_broken_contest
Output
NO
Input
NikitaAndString
Output
YES
Input
Danil_and_Olya
Output
NO
Submitted Solution:
```
s = input()
a = ['Olya', 'Danil', 'Slava', 'Nikita', 'Ann']
res = 0
for i in range(5):
if a[i] in s:
res += s.count(a[i])
print('YES' if res == 1 else 'NO')
``` | instruction | 0 | 90,634 | 18 | 181,268 |
Yes | output | 1 | 90,634 | 18 | 181,269 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Alex was creating a contest about his friends, but accidentally deleted it. Fortunately, all the problems were saved, but now he needs to find them among other problems.
But there are too many problems, to do it manually. Alex asks you to write a program, which will determine if a problem is from this contest by its name.
It is known, that problem is from this contest if and only if its name contains one of Alex's friends' name exactly once. His friends' names are "Danil", "Olya", "Slava", "Ann" and "Nikita".
Names are case sensitive.
Input
The only line contains string from lowercase and uppercase letters and "_" symbols of length, not more than 100 β the name of the problem.
Output
Print "YES", if problem is from this contest, and "NO" otherwise.
Examples
Input
Alex_and_broken_contest
Output
NO
Input
NikitaAndString
Output
YES
Input
Danil_and_Olya
Output
NO
Submitted Solution:
```
# http://codeforces.com/problemset/problem/877/A
def count_in(smstr):
friends = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']
countm = 0
for x in friends:
countm += smstr.count(x)
return countm
def main():
inp = input()
f1 = count_in(inp)
if f1 == 1:
return "YES"
return "NO"
if __name__ == "__main__":
print(main())
# input()
``` | instruction | 0 | 90,635 | 18 | 181,270 |
Yes | output | 1 | 90,635 | 18 | 181,271 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Alex was creating a contest about his friends, but accidentally deleted it. Fortunately, all the problems were saved, but now he needs to find them among other problems.
But there are too many problems, to do it manually. Alex asks you to write a program, which will determine if a problem is from this contest by its name.
It is known, that problem is from this contest if and only if its name contains one of Alex's friends' name exactly once. His friends' names are "Danil", "Olya", "Slava", "Ann" and "Nikita".
Names are case sensitive.
Input
The only line contains string from lowercase and uppercase letters and "_" symbols of length, not more than 100 β the name of the problem.
Output
Print "YES", if problem is from this contest, and "NO" otherwise.
Examples
Input
Alex_and_broken_contest
Output
NO
Input
NikitaAndString
Output
YES
Input
Danil_and_Olya
Output
NO
Submitted Solution:
```
str=input()
a=str.count("Danil")
a+=str.count("Olya")
a+=str.count("Slava")
a+=str.count("Ann")
a+=str.count("Nikita")
if(a==1):
print("YES")
else:
print("NO")
``` | instruction | 0 | 90,636 | 18 | 181,272 |
Yes | output | 1 | 90,636 | 18 | 181,273 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Alex was creating a contest about his friends, but accidentally deleted it. Fortunately, all the problems were saved, but now he needs to find them among other problems.
But there are too many problems, to do it manually. Alex asks you to write a program, which will determine if a problem is from this contest by its name.
It is known, that problem is from this contest if and only if its name contains one of Alex's friends' name exactly once. His friends' names are "Danil", "Olya", "Slava", "Ann" and "Nikita".
Names are case sensitive.
Input
The only line contains string from lowercase and uppercase letters and "_" symbols of length, not more than 100 β the name of the problem.
Output
Print "YES", if problem is from this contest, and "NO" otherwise.
Examples
Input
Alex_and_broken_contest
Output
NO
Input
NikitaAndString
Output
YES
Input
Danil_and_Olya
Output
NO
Submitted Solution:
```
ns = ["Danil", "Olya", "Slava", "Ann", "Nikita"]
s = input()
c = 0
for n in ns:
c += s.count(n)
print("YNEOS"[c != 1::2])
``` | instruction | 0 | 90,637 | 18 | 181,274 |
Yes | output | 1 | 90,637 | 18 | 181,275 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Alex was creating a contest about his friends, but accidentally deleted it. Fortunately, all the problems were saved, but now he needs to find them among other problems.
But there are too many problems, to do it manually. Alex asks you to write a program, which will determine if a problem is from this contest by its name.
It is known, that problem is from this contest if and only if its name contains one of Alex's friends' name exactly once. His friends' names are "Danil", "Olya", "Slava", "Ann" and "Nikita".
Names are case sensitive.
Input
The only line contains string from lowercase and uppercase letters and "_" symbols of length, not more than 100 β the name of the problem.
Output
Print "YES", if problem is from this contest, and "NO" otherwise.
Examples
Input
Alex_and_broken_contest
Output
NO
Input
NikitaAndString
Output
YES
Input
Danil_and_Olya
Output
NO
Submitted Solution:
```
name=input()
num=name.count('Danil')
num=name.count('Olya')
num=name.count('Slava')
num=name.count('Ann')
num=name.count('Nikita')
if num==1:
print('YES')
else:
print('NO')
``` | instruction | 0 | 90,638 | 18 | 181,276 |
No | output | 1 | 90,638 | 18 | 181,277 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Alex was creating a contest about his friends, but accidentally deleted it. Fortunately, all the problems were saved, but now he needs to find them among other problems.
But there are too many problems, to do it manually. Alex asks you to write a program, which will determine if a problem is from this contest by its name.
It is known, that problem is from this contest if and only if its name contains one of Alex's friends' name exactly once. His friends' names are "Danil", "Olya", "Slava", "Ann" and "Nikita".
Names are case sensitive.
Input
The only line contains string from lowercase and uppercase letters and "_" symbols of length, not more than 100 β the name of the problem.
Output
Print "YES", if problem is from this contest, and "NO" otherwise.
Examples
Input
Alex_and_broken_contest
Output
NO
Input
NikitaAndString
Output
YES
Input
Danil_and_Olya
Output
NO
Submitted Solution:
```
def main():
name = ["DANIL","OLYA","SLAVA","ANN","NIKITA"]
t = 0
x = input()
for i in name:
if i in x.upper():
t += 1
if t == 1:
print("YES")
else:
print("NO")
main()
``` | instruction | 0 | 90,639 | 18 | 181,278 |
No | output | 1 | 90,639 | 18 | 181,279 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.