message stringlengths 2 23.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 97 109k | cluster float64 0 0 | __index_level_0__ int64 194 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A non-empty string is called palindrome, if it reads the same from the left to the right and from the right to the left. For example, "abcba", "a", and "abba" are palindromes, while "abab" and "... | instruction | 0 | 21,212 | 0 | 42,424 |
No | output | 1 | 21,212 | 0 | 42,425 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan had string s consisting of small English letters. However, his friend Julia decided to make fun of him and hid the string s. Ivan preferred making a new string to finding the old one.
Ivan knows some information about the string s. Na... | instruction | 0 | 21,677 | 0 | 43,354 |
Tags: data structures, greedy, sortings, strings
Correct Solution:
```
import sys
input = sys.stdin.readline
n = int(input())
L = 0
t, x = [], []
for i in range(n):
v = input().split()
t.append(v[0])
pos = list(map(lambda x: int(x) - 1, v[2:]))
x.append(pos)
L = max(L, pos[-1] + len(t[i]))
nxt = ... | output | 1 | 21,677 | 0 | 43,355 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan had string s consisting of small English letters. However, his friend Julia decided to make fun of him and hid the string s. Ivan preferred making a new string to finding the old one.
Ivan knows some information about the string s. Na... | instruction | 0 | 21,678 | 0 | 43,356 |
Tags: data structures, greedy, sortings, strings
Correct Solution:
```
import math as mt
import sys,string
input=sys.stdin.readline
print=sys.stdout.write
import random
from collections import deque,defaultdict
L=lambda : list(map(int,input().split()))
Ls=lambda : list(input().split())
M=lambda : map(int,input().split... | output | 1 | 21,678 | 0 | 43,357 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan had string s consisting of small English letters. However, his friend Julia decided to make fun of him and hid the string s. Ivan preferred making a new string to finding the old one.
Ivan knows some information about the string s. Na... | instruction | 0 | 21,679 | 0 | 43,358 |
Tags: data structures, greedy, sortings, strings
Correct Solution:
```
from sys import stdin, stdout
sze = 10 ** 6 + 1
n = int(stdin.readline())
challengers = []
strings = []
sze = 10 ** 6 + 1
cnt = [0 for i in range(sze)]
for i in range(n):
s = stdin.readline().strip().split()
num = int(s[1])
value... | output | 1 | 21,679 | 0 | 43,359 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan had string s consisting of small English letters. However, his friend Julia decided to make fun of him and hid the string s. Ivan preferred making a new string to finding the old one.
Ivan knows some information about the string s. Na... | instruction | 0 | 21,680 | 0 | 43,360 |
Tags: data structures, greedy, sortings, strings
Correct Solution:
```
from sys import stdin, stdout
sze = 10 ** 6 + 1
n = int(stdin.readline())
challengers = []
strings = []
sze = 10 ** 6 + 1
cnt = [[] for i in range(sze)]
for i in range(n):
s = stdin.readline().strip().split()
num = int(s[1])
valu... | output | 1 | 21,680 | 0 | 43,361 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivan had string s consisting of small English letters. However, his friend Julia decided to make fun of him and hid the string s. Ivan preferred making a new string to finding the old one.
Iva... | instruction | 0 | 21,681 | 0 | 43,362 |
No | output | 1 | 21,681 | 0 | 43,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivan had string s consisting of small English letters. However, his friend Julia decided to make fun of him and hid the string s. Ivan preferred making a new string to finding the old one.
Iva... | instruction | 0 | 21,682 | 0 | 43,364 |
No | output | 1 | 21,682 | 0 | 43,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivan had string s consisting of small English letters. However, his friend Julia decided to make fun of him and hid the string s. Ivan preferred making a new string to finding the old one.
Iva... | instruction | 0 | 21,683 | 0 | 43,366 |
No | output | 1 | 21,683 | 0 | 43,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivan had string s consisting of small English letters. However, his friend Julia decided to make fun of him and hid the string s. Ivan preferred making a new string to finding the old one.
Iva... | instruction | 0 | 21,684 | 0 | 43,368 |
No | output | 1 | 21,684 | 0 | 43,369 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Toad Rash has a binary string s. A binary string consists only of zeros and ones.
Let n be the length of s.
Rash needs to find the number of such pairs of integers l, r that 1 β€ l β€ r β€ n and there is at least one pair of integers x, k suc... | instruction | 0 | 22,085 | 0 | 44,170 |
Tags: brute force, two pointers
Correct Solution:
```
def parse(c, n):
l = [-1] * n
for x in c:
se = set(x)
for i in range(len(x) - 1):
for j in range(i + 1, len(x)):
k = x[j] - x[i]
if x[i] + k + k >= n:
break
... | output | 1 | 22,085 | 0 | 44,171 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a string s, consisting of capital Latin letters. Let's denote its current length as |s|. During one move it is allowed to apply one of the following operations to it:
* INSERT pos ch β insert a letter ch in the string s in the p... | instruction | 0 | 22,480 | 0 | 44,960 |
Tags: dp
Correct Solution:
```
import sys
from array import array # noqa: F401
def input():
return sys.stdin.buffer.readline().decode('utf-8')
s, t = input().rstrip(), input().rstrip()
n, m = len(s), len(t)
dp = [[10**9] * (m + 2) for _ in range(n + 2)]
dp[n][m] = 0
prev = [[(-1, -1)] * (m + 2) for _ in range... | output | 1 | 22,480 | 0 | 44,961 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a string s, consisting of capital Latin letters. Let's denote its current length as |s|. During one move it is allowed to apply one of the following operations to it:
* INSERT pos ch β insert a letter ch in the string s in the p... | instruction | 0 | 22,481 | 0 | 44,962 |
Tags: dp
Correct Solution:
```
s,t="$"+input(),"$"+input()
n,m=len(s)-1,len(t)-1
ar=[[0]*(m+1) for i in range(n+1)]
for i in range(1,n+1):ar[i][0]=i
for j in range(1,m+1):ar[0][j]=j
for i in range(1,n+1):
for j in range(1,m+1):
if(s[i]==t[j]):ar[i][j]=ar[i-1][j-1]
else:ar[i][j]=min(ar[i-1][j],ar[i-1... | output | 1 | 22,481 | 0 | 44,963 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a string s, consisting of capital Latin letters. Let's denote its current length as |s|. During one move it is allowed to apply one of the following operations to it:
* INSERT pos ch β insert a letter ch in the string s in the p... | instruction | 0 | 22,482 | 0 | 44,964 |
Tags: dp
Correct Solution:
```
# https://www.youtube.com/watch?v=MiqoA-yF-0M&feature=youtu.be
s, t = input(), input()
n, m = len(s), len(t)
M, camino = [], []
for _ in range(n+1):
M.append([0]*(m+1))
camino.append([None] * (m + 1))
for i in range(1, n+1):
M[i][0] = i
for j in range(1, m+1):
M[0][j] = j... | output | 1 | 22,482 | 0 | 44,965 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a string s, consisting of capital Latin letters. Let's denote its current length as |s|. During one move it is allowed to apply one of the following operations to it:
* INSERT pos c... | instruction | 0 | 22,483 | 0 | 44,966 |
No | output | 1 | 22,483 | 0 | 44,967 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a string s, consisting of capital Latin letters. Let's denote its current length as |s|. During one move it is allowed to apply one of the following operations to it:
* INSERT pos c... | instruction | 0 | 22,484 | 0 | 44,968 |
No | output | 1 | 22,484 | 0 | 44,969 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a string s, consisting of capital Latin letters. Let's denote its current length as |s|. During one move it is allowed to apply one of the following operations to it:
* INSERT pos c... | instruction | 0 | 22,485 | 0 | 44,970 |
No | output | 1 | 22,485 | 0 | 44,971 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a string s, consisting of capital Latin letters. Let's denote its current length as |s|. During one move it is allowed to apply one of the following operations to it:
* INSERT pos c... | instruction | 0 | 22,486 | 0 | 44,972 |
No | output | 1 | 22,486 | 0 | 44,973 |
Provide tags and a correct Python 3 solution for this coding contest problem.
For each string s consisting of characters '0' and '1' one can define four integers a00, a01, a10 and a11, where axy is the number of subsequences of length 2 of the string s equal to the sequence {x, y}.
In these problem you are given fou... | instruction | 0 | 22,508 | 0 | 45,016 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
a00, a01, a10, a11 = map(int, input().split())
numZeros = 0
numOnes = 0
ans = True
for n0 in range(1, 2*a00 + 1):
if n0 * (n0 - 1) == 2 * a00:
numZeros = n0
break
elif n0 * (n0 - 1) > 2 * a00:
ans = False
... | output | 1 | 22,508 | 0 | 45,017 |
Provide tags and a correct Python 3 solution for this coding contest problem.
For each string s consisting of characters '0' and '1' one can define four integers a00, a01, a10 and a11, where axy is the number of subsequences of length 2 of the string s equal to the sequence {x, y}.
In these problem you are given fou... | instruction | 0 | 22,509 | 0 | 45,018 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
root = lambda k : int((1 + (1 + 8*k) ** 0.5)/2)
def check(k):
n = root(k)
return n*(n-1)/2 == k
def solve(a00, a01, a10, a11):
s = a00 + a01 + a10 + a11
if not check(a00) or not check(a11) or not check(s):
return... | output | 1 | 22,509 | 0 | 45,019 |
Provide tags and a correct Python 3 solution for this coding contest problem.
For each string s consisting of characters '0' and '1' one can define four integers a00, a01, a10 and a11, where axy is the number of subsequences of length 2 of the string s equal to the sequence {x, y}.
In these problem you are given fou... | instruction | 0 | 22,510 | 0 | 45,020 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
def main():
from itertools import product
def f(a):
x = int((a * 2. + .25) ** .5 + .51)
if x * (x - 1) != a * 2:
raise ValueError
return (x,) if a else (1, 0)
a00, a01, a10, a11 = map(int, ... | output | 1 | 22,510 | 0 | 45,021 |
Provide tags and a correct Python 3 solution for this coding contest problem.
For each string s consisting of characters '0' and '1' one can define four integers a00, a01, a10 and a11, where axy is the number of subsequences of length 2 of the string s equal to the sequence {x, y}.
In these problem you are given fou... | instruction | 0 | 22,511 | 0 | 45,022 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
import sys
def BS(x):
l = 1
r = 1000000
while (r-l) > 1:
m = (l+r)//2
if m*(m-1)//2 > x:
r = m
else:
l = m
if l*(l-1)//2 != x:
print("Impossible")
sys.exit()... | output | 1 | 22,511 | 0 | 45,023 |
Provide tags and a correct Python 3 solution for this coding contest problem.
For each string s consisting of characters '0' and '1' one can define four integers a00, a01, a10 and a11, where axy is the number of subsequences of length 2 of the string s equal to the sequence {x, y}.
In these problem you are given fou... | instruction | 0 | 22,512 | 0 | 45,024 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
import math
def get_cnt(res):
n = 1 + math.floor(math.sqrt(2 * res))
if n * (n-1) / 2 == res:
return n
else:
return -1
def calc():
cnt = list(map(int, input().split()))
if cnt == [0,0,0,0]:
... | output | 1 | 22,512 | 0 | 45,025 |
Provide tags and a correct Python 3 solution for this coding contest problem.
For each string s consisting of characters '0' and '1' one can define four integers a00, a01, a10 and a11, where axy is the number of subsequences of length 2 of the string s equal to the sequence {x, y}.
In these problem you are given fou... | instruction | 0 | 22,513 | 0 | 45,026 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
a00, a01, a10, a11 = map(int, input().split())
numZeros = 0
numOnes = 0
ans = True
for n0 in range(1, 2*a00 + 1):
if n0 * (n0 - 1) == 2 * a00:
numZeros = n0
break
elif n0 * (n0 - 1) > 2 * a00:
ans = False
... | output | 1 | 22,513 | 0 | 45,027 |
Provide tags and a correct Python 3 solution for this coding contest problem.
For each string s consisting of characters '0' and '1' one can define four integers a00, a01, a10 and a11, where axy is the number of subsequences of length 2 of the string s equal to the sequence {x, y}.
In these problem you are given fou... | instruction | 0 | 22,514 | 0 | 45,028 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
def F(s):
x00 = x01 = x10 = x11 = 0
for i in range(len(s)):
for j in range(i + 1, len(s)):
cur = s[i] + s[j]
if cur == '00': x00 += 1
if cur == '01': x01 += 1
if cur == '10':... | output | 1 | 22,514 | 0 | 45,029 |
Provide tags and a correct Python 3 solution for this coding contest problem.
For each string s consisting of characters '0' and '1' one can define four integers a00, a01, a10 and a11, where axy is the number of subsequences of length 2 of the string s equal to the sequence {x, y}.
In these problem you are given fou... | instruction | 0 | 22,515 | 0 | 45,030 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
def impossible():
print("Impossible")
exit()
def good(ones, zeros):
return ones * zeros == a01 + a10
a00, a01, a10, a11 = map(int, input().split())
if int(round((a00 * 8 + 1) ** 0.5)) ** 2 != a00 * 8 + 1:
impossible()
... | output | 1 | 22,515 | 0 | 45,031 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For each string s consisting of characters '0' and '1' one can define four integers a00, a01, a10 and a11, where axy is the number of subsequences of length 2 of the string s equal to the sequen... | instruction | 0 | 22,517 | 0 | 45,034 |
Yes | output | 1 | 22,517 | 0 | 45,035 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For each string s consisting of characters '0' and '1' one can define four integers a00, a01, a10 and a11, where axy is the number of subsequences of length 2 of the string s equal to the sequen... | instruction | 0 | 22,518 | 0 | 45,036 |
Yes | output | 1 | 22,518 | 0 | 45,037 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For each string s consisting of characters '0' and '1' one can define four integers a00, a01, a10 and a11, where axy is the number of subsequences of length 2 of the string s equal to the sequen... | instruction | 0 | 22,522 | 0 | 45,044 |
No | output | 1 | 22,522 | 0 | 45,045 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A string t is called nice if a string "2017" occurs in t as a subsequence but a string "2016" doesn't occur in t as a subsequence. For example, strings "203434107" and "9220617" are nice, while ... | instruction | 0 | 22,524 | 0 | 45,048 |
No | output | 1 | 22,524 | 0 | 45,049 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A string t is called nice if a string "2017" occurs in t as a subsequence but a string "2016" doesn't occur in t as a subsequence. For example, strings "203434107" and "9220617" are nice, while ... | instruction | 0 | 22,525 | 0 | 45,050 |
No | output | 1 | 22,525 | 0 | 45,051 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A string t is called nice if a string "2017" occurs in t as a subsequence but a string "2016" doesn't occur in t as a subsequence. For example, strings "203434107" and "9220617" are nice, while ... | instruction | 0 | 22,526 | 0 | 45,052 |
No | output | 1 | 22,526 | 0 | 45,053 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke loves "paper cutting": he cuts out characters from a newspaper headline and rearranges them to form another string.
He will receive a headline which contains one of the strings S_1,...,S_n tomorrow. He is excited and already thinking of what s... | instruction | 0 | 22,719 | 0 | 45,438 |
"Correct Solution:
```
from itertools import groupby
s = [{c[0]: len(list(c[1])) for c in groupby(sorted(input()))} for _ in range(int(input()))]
out = ''.join(sorted([key * min([sx.get(key, 0) for sx in s]) for key in s[0]]))
print(out)
``` | output | 1 | 22,719 | 0 | 45,439 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke loves "paper cutting": he cuts out characters from a newspaper headline and rearranges them to form another string.
He will receive a headline which contains one of the strings S_1,...,S_n tomorrow. He is excited and already thinking of what s... | instruction | 0 | 22,720 | 0 | 45,440 |
"Correct Solution:
```
from collections import*;c=eval(("Counter(list(input()))&"*int(input()))[:-1]);print("".join(sorted(v*k for k,v in c.items())))
``` | output | 1 | 22,720 | 0 | 45,441 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke loves "paper cutting": he cuts out characters from a newspaper headline and rearranges them to form another string.
He will receive a headline which contains one of the strings S_1,...,S_n tomorrow. He is excited and already thinking of what s... | instruction | 0 | 22,721 | 0 | 45,442 |
"Correct Solution:
```
n = int(input())
l = [[0]*30 for i in range(n)]
for i in range(n):
for c in list(input()): l[i][ord(c)-97]+=1
ans = ""
for i in range(30):
tmp = 50
for j in range(n):tmp=min(tmp, l[j][i])
ans += chr(i+97)*tmp
print(ans)
``` | output | 1 | 22,721 | 0 | 45,443 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke loves "paper cutting": he cuts out characters from a newspaper headline and rearranges them to form another string.
He will receive a headline which contains one of the strings S_1,...,S_n tomorrow. He is excited and already thinking of what s... | instruction | 0 | 22,722 | 0 | 45,444 |
"Correct Solution:
```
n = int(input())
l = [input() for i in range(n)]
ans = ""
for i in range(97, 123):
now = chr(i)
temp = []
for j in l:
temp.append(j.count(now))
ans += now*min(temp)
print(ans)
``` | output | 1 | 22,722 | 0 | 45,445 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke loves "paper cutting": he cuts out characters from a newspaper headline and rearranges them to form another string.
He will receive a headline which contains one of the strings S_1,...,S_n tomorrow. He is excited and already thinking of what s... | instruction | 0 | 22,723 | 0 | 45,446 |
"Correct Solution:
```
n = int(input())
s = [input() for _ in range(n)]
abc = list("abcdefghijklmnopqrstuvwxyz")
ans = ""
for i in range(26):
cnt = 10*8
for j in range(n):
cnt = min(cnt, s[j].count(abc[i]))
ans += abc[i]*cnt
print(ans)
``` | output | 1 | 22,723 | 0 | 45,447 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke loves "paper cutting": he cuts out characters from a newspaper headline and rearranges them to form another string.
He will receive a headline which contains one of the strings S_1,...,S_n tomorrow. He is excited and already thinking of what s... | instruction | 0 | 22,724 | 0 | 45,448 |
"Correct Solution:
```
_,*s=open(0)
for c in sorted(set(s[0])):print(c*min(t.count(c)for t in s),end='')
``` | output | 1 | 22,724 | 0 | 45,449 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke loves "paper cutting": he cuts out characters from a newspaper headline and rearranges them to form another string.
He will receive a headline which contains one of the strings S_1,...,S_n tomorrow. He is excited and already thinking of what s... | instruction | 0 | 22,725 | 0 | 45,450 |
"Correct Solution:
```
from collections import Counter
N = int(input())
S = [Counter(input()) for i in range(N)]
merged = S[0]
for s in S:
merged &= s
ans = ""
for (key, value) in merged.items():
ans += key * value
print("".join(sorted(ans)))
``` | output | 1 | 22,725 | 0 | 45,451 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke loves "paper cutting": he cuts out characters from a newspaper headline and rearranges them to form another string.
He will receive a headline which contains one of the strings S_1,...,S_n tomorrow. He is excited and already thinking of what s... | instruction | 0 | 22,726 | 0 | 45,452 |
"Correct Solution:
```
from collections import Counter
n = int(input().strip())
S = [input().strip() for _ in range(n)]
s = Counter(S[0])
for i in range(1,n):
s = s & Counter(S[i])
ans = ''
for k,v in s.items():
ans += k*v
print(''.join(sorted(ans)))
``` | output | 1 | 22,726 | 0 | 45,453 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke loves "paper cutting": he cuts out characters from a newspaper headline and rearranges them to form another string.
He will receive a headline which contains one of the strings S_1,...,S_... | instruction | 0 | 22,728 | 0 | 45,456 |
Yes | output | 1 | 22,728 | 0 | 45,457 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke loves "paper cutting": he cuts out characters from a newspaper headline and rearranges them to form another string.
He will receive a headline which contains one of the strings S_1,...,S_... | instruction | 0 | 22,732 | 0 | 45,464 |
No | output | 1 | 22,732 | 0 | 45,465 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke loves "paper cutting": he cuts out characters from a newspaper headline and rearranges them to form another string.
He will receive a headline which contains one of the strings S_1,...,S_... | instruction | 0 | 22,733 | 0 | 45,466 |
No | output | 1 | 22,733 | 0 | 45,467 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke loves "paper cutting": he cuts out characters from a newspaper headline and rearranges them to form another string.
He will receive a headline which contains one of the strings S_1,...,S_... | instruction | 0 | 22,734 | 0 | 45,468 |
No | output | 1 | 22,734 | 0 | 45,469 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given two strings s and t. Both strings have length n and consist of lowercase Latin letters. The characters in the strings are numbered from 1 to n.
You can successively perform the following move any number of times (possibly, zer... | instruction | 0 | 22,842 | 0 | 45,684 |
Tags: implementation
Correct Solution:
```
import sys
sys.setrecursionlimit(2000)
from collections import Counter
from functools import reduce
# sys.stdin.readline()
def swap(s, ind):
ind -= 1
s = s[:ind] + s[ind+1] + s[ind] + s[ind+2:]
return s
if __name__ == "__main__":
# single variables
n = [... | output | 1 | 22,842 | 0 | 45,685 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given two strings s and t. Both strings have length n and consist of lowercase Latin letters. The characters in the strings are numbered from 1 to n.
You can successively perform the following move any number of times (possibly, zer... | instruction | 0 | 22,843 | 0 | 45,686 |
Tags: implementation
Correct Solution:
```
from __future__ import print_function
import sys
import math
import os.path
from copy import deepcopy
from functools import reduce
from collections import Counter, ChainMap, defaultdict
from itertools import cycle, chain
from queue import Queue, PriorityQueue, deque
from hea... | output | 1 | 22,843 | 0 | 45,687 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given two strings s and t. Both strings have length n and consist of lowercase Latin letters. The characters in the strings are numbered from 1 to n.
You can successively perform the following move any number of times (possibly, zer... | instruction | 0 | 22,844 | 0 | 45,688 |
Tags: implementation
Correct Solution:
```
n=int(input())
pop=list(input())
poop=list(input())
tam=[]
tom=[]
if sorted(pop)==sorted(poop):
for x in range(len(pop)):
if pop[x]==poop[x]:
pop[x]="565"
else:
tol=pop.index(poop[x])
ol=list(range(x+1,tol+1))
... | output | 1 | 22,844 | 0 | 45,689 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given two strings s and t. Both strings have length n and consist of lowercase Latin letters. The characters in the strings are numbered from 1 to n.
You can successively perform the following move any number of times (possibly, zer... | instruction | 0 | 22,845 | 0 | 45,690 |
Tags: implementation
Correct Solution:
```
def is_permutation(s, t):
return sorted(s) == sorted(t)
def solve(s, t, index):
global ans
if s == t and s == '':
return
if s[0] != t[0]:
j = 0
for i in range(1, len(s)):
if s[i] == t[0]:
j = i
... | output | 1 | 22,845 | 0 | 45,691 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given two strings s and t. Both strings have length n and consist of lowercase Latin letters. The characters in the strings are numbered from 1 to n.
You can successively perform the following move any number of times (possibly, zer... | instruction | 0 | 22,846 | 0 | 45,692 |
Tags: implementation
Correct Solution:
```
n = int(input())
s = list(input())
t = list(input())
ans = 0
moves = []
for i in range(n):
if s[i] != t[i]:
if not (t[i] in s[i:]):
ans = -1
moves = []
break
ind = s[i:].index(t[i]) + i
del(s[ind])
... | output | 1 | 22,846 | 0 | 45,693 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given two strings s and t. Both strings have length n and consist of lowercase Latin letters. The characters in the strings are numbered from 1 to n.
You can successively perform the following move any number of times (possibly, zer... | instruction | 0 | 22,847 | 0 | 45,694 |
Tags: implementation
Correct Solution:
```
n = int(input())
s = list(input())
t = list(input())
ans = []
for i in range(n):
if s[i]==t[i]: continue
x = -1
for j in range(i+1,n):
if t[i]==s[j]: x = j
if x==-1:
print(-1)
exit()
for j in range(x,i,-1):
s[j], s[j-1] = s[... | output | 1 | 22,847 | 0 | 45,695 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given two strings s and t. Both strings have length n and consist of lowercase Latin letters. The characters in the strings are numbered from 1 to n.
You can successively perform the following move any number of times (possibly, zer... | instruction | 0 | 22,848 | 0 | 45,696 |
Tags: implementation
Correct Solution:
```
def v(s,t):
for k in range(len(s)):
if s[k]!=t[k]:
return False
return True
n=int(input())
t=list(input())
s=list(input())
move=""
poss=1
count=0
for a in set(s):
if(s.count(a)!=t.count(a)):
poss=0
if(poss):
m={}
for k in range(... | output | 1 | 22,848 | 0 | 45,697 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.