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.
For some binary string s (i.e. each character s_i is either '0' or '1'), all pairs of consecutive (adjacent) characters were written. In other words, all substrings of length 2 were written. For... | instruction | 0 | 5,934 | 0 | 11,868 |
Yes | output | 1 | 5,934 | 0 | 11,869 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For some binary string s (i.e. each character s_i is either '0' or '1'), all pairs of consecutive (adjacent) characters were written. In other words, all substrings of length 2 were written. For... | instruction | 0 | 5,935 | 0 | 11,870 |
Yes | output | 1 | 5,935 | 0 | 11,871 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For some binary string s (i.e. each character s_i is either '0' or '1'), all pairs of consecutive (adjacent) characters were written. In other words, all substrings of length 2 were written. For... | instruction | 0 | 5,936 | 0 | 11,872 |
Yes | output | 1 | 5,936 | 0 | 11,873 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For some binary string s (i.e. each character s_i is either '0' or '1'), all pairs of consecutive (adjacent) characters were written. In other words, all substrings of length 2 were written. For... | instruction | 0 | 5,937 | 0 | 11,874 |
Yes | output | 1 | 5,937 | 0 | 11,875 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For some binary string s (i.e. each character s_i is either '0' or '1'), all pairs of consecutive (adjacent) characters were written. In other words, all substrings of length 2 were written. For... | instruction | 0 | 5,938 | 0 | 11,876 |
No | output | 1 | 5,938 | 0 | 11,877 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For some binary string s (i.e. each character s_i is either '0' or '1'), all pairs of consecutive (adjacent) characters were written. In other words, all substrings of length 2 were written. For... | instruction | 0 | 5,939 | 0 | 11,878 |
No | output | 1 | 5,939 | 0 | 11,879 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For some binary string s (i.e. each character s_i is either '0' or '1'), all pairs of consecutive (adjacent) characters were written. In other words, all substrings of length 2 were written. For... | instruction | 0 | 5,940 | 0 | 11,880 |
No | output | 1 | 5,940 | 0 | 11,881 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For some binary string s (i.e. each character s_i is either '0' or '1'), all pairs of consecutive (adjacent) characters were written. In other words, all substrings of length 2 were written. For... | instruction | 0 | 5,941 | 0 | 11,882 |
No | output | 1 | 5,941 | 0 | 11,883 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given a list of n strings a1, a2, ..., an. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest.
Given the list of strings, output the lexicographically smallest con... | instruction | 0 | 6,240 | 0 | 12,480 |
Tags: sortings, strings
Correct Solution:
```
from functools import cmp_to_key as ctk
def comp(a, b):
if a + b < b + a:
return -1
elif a + b > b + a:
return 1
else:
return 0
n = int(input())
string = list()
for i in range(n):
strtem = input()
string.append(strtem)
string.sort(key = ctk(comp))
print(''.join... | output | 1 | 6,240 | 0 | 12,481 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a list of n strings a1, a2, ..., an. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest.
Given the list of str... | instruction | 0 | 6,245 | 0 | 12,490 |
Yes | output | 1 | 6,245 | 0 | 12,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a list of n strings a1, a2, ..., an. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest.
Given the list of str... | instruction | 0 | 6,246 | 0 | 12,492 |
Yes | output | 1 | 6,246 | 0 | 12,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a list of n strings a1, a2, ..., an. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest.
Given the list of str... | instruction | 0 | 6,247 | 0 | 12,494 |
Yes | output | 1 | 6,247 | 0 | 12,495 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a list of n strings a1, a2, ..., an. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest.
Given the list of str... | instruction | 0 | 6,248 | 0 | 12,496 |
Yes | output | 1 | 6,248 | 0 | 12,497 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a list of n strings a1, a2, ..., an. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest.
Given the list of str... | instruction | 0 | 6,249 | 0 | 12,498 |
No | output | 1 | 6,249 | 0 | 12,499 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a list of n strings a1, a2, ..., an. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest.
Given the list of str... | instruction | 0 | 6,250 | 0 | 12,500 |
No | output | 1 | 6,250 | 0 | 12,501 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a list of n strings a1, a2, ..., an. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest.
Given the list of str... | instruction | 0 | 6,251 | 0 | 12,502 |
No | output | 1 | 6,251 | 0 | 12,503 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a list of n strings a1, a2, ..., an. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest.
Given the list of str... | instruction | 0 | 6,252 | 0 | 12,504 |
No | output | 1 | 6,252 | 0 | 12,505 |
Provide a correct Python 3 solution for this coding contest problem.
A string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:
* S is a palindrome.
* Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a pali... | instruction | 0 | 6,381 | 0 | 12,762 |
"Correct Solution:
```
S = input()
N = len(S)
A = (len(S) - 1) // 2
B = (len(S) + 3) // 2
if S[0:A] == S[B - 1:N]:
print('Yes')
else:
print('No')
``` | output | 1 | 6,381 | 0 | 12,763 |
Provide a correct Python 3 solution for this coding contest problem.
A string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:
* S is a palindrome.
* Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a pali... | instruction | 0 | 6,382 | 0 | 12,764 |
"Correct Solution:
```
s = input()
n = len(s)
if s[:int(n//2)] == s[int(n//2)+1:]:
print("Yes")
else:
print("No")
``` | output | 1 | 6,382 | 0 | 12,765 |
Provide a correct Python 3 solution for this coding contest problem.
A string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:
* S is a palindrome.
* Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a pali... | instruction | 0 | 6,383 | 0 | 12,766 |
"Correct Solution:
```
S=list(input())
N=len(S)
if S==S[::-1] and S[:(N-1)//2]==S[(N+3)//2-1:]:
print("Yes")
else:print("No")
``` | output | 1 | 6,383 | 0 | 12,767 |
Provide a correct Python 3 solution for this coding contest problem.
A string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:
* S is a palindrome.
* Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a pali... | instruction | 0 | 6,384 | 0 | 12,768 |
"Correct Solution:
```
s = input()
if s[len(s) // 2 + 1:] == s[:len(s) // 2]:
print('Yes')
else:
print('No')
``` | output | 1 | 6,384 | 0 | 12,769 |
Provide a correct Python 3 solution for this coding contest problem.
A string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:
* S is a palindrome.
* Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a pali... | instruction | 0 | 6,385 | 0 | 12,770 |
"Correct Solution:
```
s = input()
print("Yes" if s == s[::-1] and s[:len(s)//2] == s[len(s)//2-1::-1] else "No")
``` | output | 1 | 6,385 | 0 | 12,771 |
Provide a correct Python 3 solution for this coding contest problem.
A string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:
* S is a palindrome.
* Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a pali... | instruction | 0 | 6,386 | 0 | 12,772 |
"Correct Solution:
```
S = str(input())
N = len(S)
if S[:(N-1)//2] == S[(N+3)//2 - 1:] :
print('Yes')
else:
print('No')
``` | output | 1 | 6,386 | 0 | 12,773 |
Provide a correct Python 3 solution for this coding contest problem.
A string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:
* S is a palindrome.
* Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a pali... | instruction | 0 | 6,387 | 0 | 12,774 |
"Correct Solution:
```
S = input()
N = len(S)
N1s = (N-1)//2
N2s = (N+3)//2-1
if S[:N1s] == S[N2s:]:
print("Yes")
else:
print("No")
``` | output | 1 | 6,387 | 0 | 12,775 |
Provide a correct Python 3 solution for this coding contest problem.
A string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:
* S is a palindrome.
* Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a pali... | instruction | 0 | 6,388 | 0 | 12,776 |
"Correct Solution:
```
s=input();h=len(s)//2;print(' YNeos'[s[:h]==s[h-1::-1]==s[-h:]::2])
``` | output | 1 | 6,388 | 0 | 12,777 |
Provide a correct Python 3 solution for this coding contest problem.
For a given sequence A = {a0, a1, ... , an-1}, find the length of the longest increasing subsequnece (LIS) in A.
An increasing subsequence of A is defined by a subsequence {ai0, ai1, ... , aik} where 0 β€ i0 < i1 < ... < ik < n and ai0 < ai1 < ... < ... | instruction | 0 | 7,508 | 0 | 15,016 |
"Correct Solution:
```
#!/usr/bin/env python3
# n,m = map(int,sys.stdin.readline().split())
# a = list(map(int,sys.stdin.readline().split()))
# a = [sys.stdin.readline() for _ in range(n)]
# s = sys.stdin.readline().rstrip()
# n = int(sys.stdin.readline())
INF = float("inf")
import sys,bisect
sys.setrecursionlimit(1500... | output | 1 | 7,508 | 0 | 15,017 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nezzar has a binary string s of length n that he wants to share with his best friend, Nanako. Nanako will spend q days inspecting the binary string. At the same time, Nezzar wants to change the string s into string f during these q days, bec... | instruction | 0 | 7,783 | 0 | 15,566 |
Tags: data structures, greedy
Correct Solution:
```
import sys
readline = sys.stdin.readline
"""
import io,os
readline = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
"""
from operator import add
class Lazysegtree:
def __init__(self, A, fx, ex, fm, em, fa, initialize = True):
self.N = len(A)
s... | output | 1 | 7,783 | 0 | 15,567 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nezzar has a binary string s of length n that he wants to share with his best friend, Nanako. Nanako will spend q days inspecting the binary string. At the same time, Nezzar wants to change the string s into string f during these q days, bec... | instruction | 0 | 7,784 | 0 | 15,568 |
Tags: data structures, greedy
Correct Solution:
```
import io
import os
from math import floor
# https://github.com/atcoder/ac-library/blob/master/atcoder/lazysegtree.hpp
class LazySegTree:
def __init__(self, _op, _e, _mapping, _composition, _id, v):
def set(p, x):
assert 0 <= p < _n
... | output | 1 | 7,784 | 0 | 15,569 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nezzar has a binary string s of length n that he wants to share with his best friend, Nanako. Nanako will spend q days inspecting the binary string. At the same time, Nezzar wants to change the string s into string f during these q days, bec... | instruction | 0 | 7,785 | 0 | 15,570 |
Tags: data structures, greedy
Correct Solution:
```
import sys
input = sys.stdin.readline
def indexes(L,R):
INDLIST=[]
R-=1
L>>=1
R>>=1
while L!=R:
if L>R:
INDLIST.append(L)
L>>=1
else:
INDLIST.append(R)
R>>=1
while L!=0:
... | output | 1 | 7,785 | 0 | 15,571 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nezzar has a binary string s of length n that he wants to share with his best friend, Nanako. Nanako will spend q days inspecting the binary string. At the same time, Nezzar wants to change the string s into string f during these q days, bec... | instruction | 0 | 7,786 | 0 | 15,572 |
Tags: data structures, greedy
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
def __init__(self, file):
self.newlines = 0
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode o... | output | 1 | 7,786 | 0 | 15,573 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nezzar has a binary string s of length n that he wants to share with his best friend, Nanako. Nanako will spend q days inspecting the binary string. At the same time, Nezzar wants to change the string s into string f during these q days, bec... | instruction | 0 | 7,787 | 0 | 15,574 |
Tags: data structures, greedy
Correct Solution:
```
import sys, io, os
if os.environ['USERNAME']=='kissz':
inp1=inp2=open('in.txt','r').readline
def debug(*args):
print(*args,file=sys.stderr)
else:
#inp1=input
inp1=inp2=sys.stdin.readline
#inp2=io.BytesIO(os.read(0,os.fstat(0).st_size)).re... | output | 1 | 7,787 | 0 | 15,575 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nezzar has a binary string s of length n that he wants to share with his best friend, Nanako. Nanako will spend q days inspecting the binary string. At the same time, Nezzar wants to change the string s into string f during these q days, bec... | instruction | 0 | 7,788 | 0 | 15,576 |
Tags: data structures, greedy
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
def __init__(self, file):
self.newlines = 0
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode o... | output | 1 | 7,788 | 0 | 15,577 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nezzar has a binary string s of length n that he wants to share with his best friend, Nanako. Nanako will spend q days inspecting the binary string. At the same time, Nezzar wants to change the string s into string f during these q days, bec... | instruction | 0 | 7,789 | 0 | 15,578 |
Tags: data structures, greedy
Correct Solution:
```
# lazy segment tree
t=[0]*(4*200000)
lazy=[-1]*(4*200000)
def build(a,v,tl,tr):
if (tl==tr):
t[v]=a[tl]
else:
tm=(tl+tr)//2
build(a,v*2,tl,tm)
build(a,v*2+1,tm+1,tr)
t[v]=t[v*2]+t[v*2+1]
return
def push(v,tl,tr):
... | output | 1 | 7,789 | 0 | 15,579 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nezzar has a binary string s of length n that he wants to share with his best friend, Nanako. Nanako will spend q days inspecting the binary string. At the same time, Nezzar wants to change the string s into string f during these q days, bec... | instruction | 0 | 7,790 | 0 | 15,580 |
Tags: data structures, greedy
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
def __init__(self, file):
self.newlines = 0
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode o... | output | 1 | 7,790 | 0 | 15,581 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nezzar has a binary string s of length n that he wants to share with his best friend, Nanako. Nanako will spend q days inspecting the binary string. At the same time, Nezzar wants to change the ... | instruction | 0 | 7,791 | 0 | 15,582 |
Yes | output | 1 | 7,791 | 0 | 15,583 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nezzar has a binary string s of length n that he wants to share with his best friend, Nanako. Nanako will spend q days inspecting the binary string. At the same time, Nezzar wants to change the ... | instruction | 0 | 7,792 | 0 | 15,584 |
No | output | 1 | 7,792 | 0 | 15,585 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nezzar has a binary string s of length n that he wants to share with his best friend, Nanako. Nanako will spend q days inspecting the binary string. At the same time, Nezzar wants to change the ... | instruction | 0 | 7,793 | 0 | 15,586 |
No | output | 1 | 7,793 | 0 | 15,587 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nezzar has a binary string s of length n that he wants to share with his best friend, Nanako. Nanako will spend q days inspecting the binary string. At the same time, Nezzar wants to change the ... | instruction | 0 | 7,794 | 0 | 15,588 |
No | output | 1 | 7,794 | 0 | 15,589 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nezzar has a binary string s of length n that he wants to share with his best friend, Nanako. Nanako will spend q days inspecting the binary string. At the same time, Nezzar wants to change the ... | instruction | 0 | 7,795 | 0 | 15,590 |
No | output | 1 | 7,795 | 0 | 15,591 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You will receive 5 points for solving this problem.
Manao has invented a new operation on strings that is called folding. Each fold happens between a pair of consecutive letters and places the second part of the string above first part, run... | instruction | 0 | 7,900 | 0 | 15,800 |
Tags: brute force
Correct Solution:
```
t = {}
for i, c in enumerate(input()):
if c not in t: t[c] = (i, 1)
elif (t[c][0] - i) & 1: t[c] = (i, t[c][1] + 1)
print(max(b for a, b in t.values()))
``` | output | 1 | 7,900 | 0 | 15,801 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You will receive 5 points for solving this problem.
Manao has invented a new operation on strings that is called folding. Each fold happens between a pair of consecutive letters and places the second part of the string above first part, run... | instruction | 0 | 7,901 | 0 | 15,802 |
Tags: brute force
Correct Solution:
```
t = {}
for i, c in enumerate(input()):
if c not in t: t[c] = (i, 1)
elif (t[c][0] - i) & 1: t[c] = (i, t[c][1] + 1)
print(max(b for a, b in t.values()))
# Made By Mostafa_Khaled
``` | output | 1 | 7,901 | 0 | 15,803 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp invented a new way to encode strings. Let's assume that we have string T, consisting of lowercase English letters. Let's choose several pairs of letters of the English alphabet in such ... | instruction | 0 | 7,940 | 0 | 15,880 |
No | output | 1 | 7,940 | 0 | 15,881 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This task is very simple. Given a string S of length n and q queries each query is on the format i j k which means sort the substring consisting of the characters from i to j in non-decreasing o... | instruction | 0 | 7,941 | 0 | 15,882 |
No | output | 1 | 7,941 | 0 | 15,883 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This task is very simple. Given a string S of length n and q queries each query is on the format i j k which means sort the substring consisting of the characters from i to j in non-decreasing o... | instruction | 0 | 7,942 | 0 | 15,884 |
No | output | 1 | 7,942 | 0 | 15,885 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This task is very simple. Given a string S of length n and q queries each query is on the format i j k which means sort the substring consisting of the characters from i to j in non-decreasing o... | instruction | 0 | 7,943 | 0 | 15,886 |
No | output | 1 | 7,943 | 0 | 15,887 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This task is very simple. Given a string S of length n and q queries each query is on the format i j k which means sort the substring consisting of the characters from i to j in non-decreasing o... | instruction | 0 | 7,944 | 0 | 15,888 |
No | output | 1 | 7,944 | 0 | 15,889 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Marina loves strings of the same length and Vasya loves when there is a third string, different from them in exactly t characters. Help Vasya find at least one such string.
More formally, you are given two strings s1, s2 of length n and num... | instruction | 0 | 7,945 | 0 | 15,890 |
Tags: constructive algorithms, greedy, strings
Correct Solution:
```
n, k = map(int, input().split())
a = input()
b = input()
cnt = 0
for i in range(n):
if (a[i] == b[i]):
cnt += 1
dif = n - cnt
ok = n - (cnt + dif // 2)
if (k < ok):
print(-1)
else:
res, cur, req, i, nxt = {}, 0, n - k, 0, True
while (cur <... | output | 1 | 7,945 | 0 | 15,891 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Marina loves strings of the same length and Vasya loves when there is a third string, different from them in exactly t characters. Help Vasya find at least one such string.
More formally, you are given two strings s1, s2 of length n and num... | instruction | 0 | 7,946 | 0 | 15,892 |
Tags: constructive algorithms, greedy, strings
Correct Solution:
```
n, t = map(int, input().split())
s1 = input()
s2 = input()
same = n - t
ans = ["" for i in range(n)]
for i in range(n):
if(same==0):
break
if s1[i] == s2[i]:
same -= 1
ans[i] = s1[i]
same1 = same2 = same
for i in range... | output | 1 | 7,946 | 0 | 15,893 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Marina loves strings of the same length and Vasya loves when there is a third string, different from them in exactly t characters. Help Vasya find at least one such string.
More formally, you are given two strings s1, s2 of length n and num... | instruction | 0 | 7,947 | 0 | 15,894 |
Tags: constructive algorithms, greedy, strings
Correct Solution:
```
n,k=map(int,input().split())
a=input()
b=input()
c=[]
ans=0
for i in range(n):
if a[i]==b[i]:
ans+=1
si=n-k
d=['a','b','c']
if ans>=si:
for i in range(n):
if a[i]==b[i] and si>0:
c.append(a[i])
si-=1
... | output | 1 | 7,947 | 0 | 15,895 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Marina loves strings of the same length and Vasya loves when there is a third string, different from them in exactly t characters. Help Vasya find at least one such string.
More formally, you are given two strings s1, s2 of length n and num... | instruction | 0 | 7,948 | 0 | 15,896 |
Tags: constructive algorithms, greedy, strings
Correct Solution:
```
from sys import exit
def cdiff(c1, c2):
ch = 'a'
while ch in (c1, c2):
ch = chr(ord(ch) + 1)
return ch
n, t = map(int, input().split())
a = input()
b = input()
ra = 0
rb = 0
c = [-1] * n
for i in range(n):
c[i] = (a[i], b[i])... | output | 1 | 7,948 | 0 | 15,897 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.