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 |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given two integers n and k.
Your task is to construct such a string s of length n that for each i from 1 to k there is at least one i-th letter of the Latin alphabet in this string (the first letter is 'a', the second is 'b' and so ... | instruction | 0 | 97,862 | 0 | 195,724 |
Tags: implementation
Correct Solution:
```
t = int(input())
for i in range(t):
n, k = input().split(' ')
n = int(n)
k = int(k)
res = []
y = 97
for i in range(n):
res.append(y + i%k)
print("".join([chr(e) for e in res]))
``` | output | 1 | 97,862 | 0 | 195,725 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given two integers n and k.
Your task is to construct such a string s of length n that for each i from 1 to k there is at least one i-th letter of the Latin alphabet in this string (the first letter is 'a', the second is 'b' and so ... | instruction | 0 | 97,863 | 0 | 195,726 |
Tags: implementation
Correct Solution:
```
t = int(input())
for _ in range(t) :
n, k = map(int, input().split())
for i in range(n) :
print(chr(ord('a') + i % k), end='');
print()
``` | output | 1 | 97,863 | 0 | 195,727 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given two integers n and k.
Your task is to construct such a string s of length n that for each i from 1 to k there is at least one i-th letter of the Latin alphabet in this string (the first letter is 'a', the second is 'b' and so ... | instruction | 0 | 97,864 | 0 | 195,728 |
Tags: implementation
Correct Solution:
```
t=int(input())
for _ in range(t):
n,k=map(int,input().split())
s=''
for i in range(97,97+k):
s+=chr(i)
s=s*(n//k)+s[:n%k]
print(s)
``` | output | 1 | 97,864 | 0 | 195,729 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given two integers n and k.
Your task is to construct such a string s of length n that for each i from 1 to k there is at least one i-th letter of the Latin alphabet in this string (the first letter is 'a', the second is 'b' and so ... | instruction | 0 | 97,865 | 0 | 195,730 |
Tags: implementation
Correct Solution:
```
for _ in range(int(input())):
n, k = [int(i) for i in input().split()]
res = ""
for i in range(k-1):
for _ in range(n // k):
res += chr(97 + i)
res += chr(97+k-1) * (n - ((n // k) * (k - 1)))
print(res)
``` | output | 1 | 97,865 | 0 | 195,731 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two integers n and k.
Your task is to construct such a string s of length n that for each i from 1 to k there is at least one i-th letter of the Latin alphabet in this string (the... | instruction | 0 | 97,866 | 0 | 195,732 |
Yes | output | 1 | 97,866 | 0 | 195,733 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two integers n and k.
Your task is to construct such a string s of length n that for each i from 1 to k there is at least one i-th letter of the Latin alphabet in this string (the... | instruction | 0 | 97,867 | 0 | 195,734 |
Yes | output | 1 | 97,867 | 0 | 195,735 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two integers n and k.
Your task is to construct such a string s of length n that for each i from 1 to k there is at least one i-th letter of the Latin alphabet in this string (the... | instruction | 0 | 97,868 | 0 | 195,736 |
Yes | output | 1 | 97,868 | 0 | 195,737 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two integers n and k.
Your task is to construct such a string s of length n that for each i from 1 to k there is at least one i-th letter of the Latin alphabet in this string (the... | instruction | 0 | 97,869 | 0 | 195,738 |
Yes | output | 1 | 97,869 | 0 | 195,739 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two integers n and k.
Your task is to construct such a string s of length n that for each i from 1 to k there is at least one i-th letter of the Latin alphabet in this string (the... | instruction | 0 | 97,870 | 0 | 195,740 |
No | output | 1 | 97,870 | 0 | 195,741 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two integers n and k.
Your task is to construct such a string s of length n that for each i from 1 to k there is at least one i-th letter of the Latin alphabet in this string (the... | instruction | 0 | 97,871 | 0 | 195,742 |
No | output | 1 | 97,871 | 0 | 195,743 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two integers n and k.
Your task is to construct such a string s of length n that for each i from 1 to k there is at least one i-th letter of the Latin alphabet in this string (the... | instruction | 0 | 97,872 | 0 | 195,744 |
No | output | 1 | 97,872 | 0 | 195,745 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two integers n and k.
Your task is to construct such a string s of length n that for each i from 1 to k there is at least one i-th letter of the Latin alphabet in this string (the... | instruction | 0 | 97,873 | 0 | 195,746 |
No | output | 1 | 97,873 | 0 | 195,747 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s, consisting of small Latin letters. Let's denote the length of the string as |s|. The characters in the string are numbered starting from 1.
Your task is to find out if it is possible to rearrange characters in str... | instruction | 0 | 97,954 | 0 | 195,908 |
Tags: implementation, number theory, strings
Correct Solution:
```
s = input().strip()
import math, functools, sys, heapq
@functools.lru_cache(None)
def check_prime(p):
for i in range(2, int(math.sqrt(p)) + 1):
if p % i == 0:
return False
return True
primes = []
n = len(s)
for p in range(2... | output | 1 | 97,954 | 0 | 195,909 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s, consisting of small Latin letters. Let's denote the length of the string as |s|. The characters in the string are numbered starting from 1.
Your task is to find out if it is possible to rearrange characters in str... | instruction | 0 | 97,955 | 0 | 195,910 |
Tags: implementation, number theory, strings
Correct Solution:
```
from collections import Counter
d, t = 'NO', input()
c, n = Counter(t), len(t)
p = [1] * (n + 1)
for i in range(2, n // 2 + 1):
if p[i]: p[i::i] = [0] * (n // i)
p.pop(0)
s = n - sum(p)
u = v = ''
for q, k in c.items():
if not (v or k < s):
... | output | 1 | 97,955 | 0 | 195,911 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s, consisting of small Latin letters. Let's denote the length of the string as |s|. The characters in the string are numbered starting from 1.
Your task is to find out if it is possible to rearrange characters in str... | instruction | 0 | 97,956 | 0 | 195,912 |
Tags: implementation, number theory, strings
Correct Solution:
```
from collections import Counter
d, t = 'NO', input()
c, n = Counter(t), len(t)
p = [0] * (n + 1)
for i in range(2, n // 2 + 1):
if 1 - p[i]: p[i::i] = [1] * (n // i)
s = sum(p)
u = v = ''
for q, k in c.items():
if v or k < ... | output | 1 | 97,956 | 0 | 195,913 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s, consisting of small Latin letters. Let's denote the length of the string as |s|. The characters in the string are numbered starting from 1.
Your task is to find out if it is possible to rearrange characters in str... | instruction | 0 | 97,957 | 0 | 195,914 |
Tags: implementation, number theory, strings
Correct Solution:
```
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
# from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as pe... | output | 1 | 97,957 | 0 | 195,915 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s, consisting of small Latin letters. Let's denote the length of the string as |s|. The characters in the string are numbered starting from 1.
Your task is to find out if it is possible to rearrange characters in str... | instruction | 0 | 97,958 | 0 | 195,916 |
Tags: implementation, number theory, strings
Correct Solution:
```
from collections import Counter
def is_prime(x):
if x < 2:
return 0
for i in range(2, x):
if x % i == 0:
return False
return True
def proc(s):
n = len(s)
same = set()
for p in range(2,n+1):
i... | output | 1 | 97,958 | 0 | 195,917 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s, consisting of small Latin letters. Let's denote the length of the string as |s|. The characters in the string are numbered starting from 1.
Your task is to find out if it is possible to rearrange characters in str... | instruction | 0 | 97,959 | 0 | 195,918 |
Tags: implementation, number theory, strings
Correct Solution:
```
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)]
... | output | 1 | 97,959 | 0 | 195,919 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s, consisting of small Latin letters. Let's denote the length of the string as |s|. The characters in the string are numbered starting from 1.
Your task is to find out if it is possible to rearrange characters in str... | instruction | 0 | 97,960 | 0 | 195,920 |
Tags: implementation, number theory, strings
Correct Solution:
```
#!/usr/bin/python3
s = input()
d = dict()
for c in s:
if c not in d:
d[c] = 0
d[c] += 1
cnto = 1
isprime = [True] * (len(s) + 1)
for p in range(2, len(s) + 1):
if isprime[p]:
for i in range(p * p, len(s) + 1, p):
... | output | 1 | 97,960 | 0 | 195,921 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s, consisting of small Latin letters. Let's denote the length of the string as |s|. The characters in the string are numbered starting from 1.
Your task is to find out if it is possible to rearrange characters in str... | instruction | 0 | 97,961 | 0 | 195,922 |
Tags: implementation, number theory, strings
Correct Solution:
```
import math
ch='abcdefghijklmnopqrstuvwxyz'
def sieve(n):
p = 2
while (p * p <= n):
if (prime[p] == True):
for i in range(p * 2, n + 1, p):
prime[i] = False
p += 1
prime[0]= False
prime[1]=... | output | 1 | 97,961 | 0 | 195,923 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s, consisting of small Latin letters. Let's denote the length of the string as |s|. The characters in the string are numbered starting from 1.
Your task is to find out i... | instruction | 0 | 97,962 | 0 | 195,924 |
Yes | output | 1 | 97,962 | 0 | 195,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s, consisting of small Latin letters. Let's denote the length of the string as |s|. The characters in the string are numbered starting from 1.
Your task is to find out i... | instruction | 0 | 97,963 | 0 | 195,926 |
Yes | output | 1 | 97,963 | 0 | 195,927 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s, consisting of small Latin letters. Let's denote the length of the string as |s|. The characters in the string are numbered starting from 1.
Your task is to find out i... | instruction | 0 | 97,964 | 0 | 195,928 |
Yes | output | 1 | 97,964 | 0 | 195,929 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s, consisting of small Latin letters. Let's denote the length of the string as |s|. The characters in the string are numbered starting from 1.
Your task is to find out i... | instruction | 0 | 97,965 | 0 | 195,930 |
Yes | output | 1 | 97,965 | 0 | 195,931 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s, consisting of small Latin letters. Let's denote the length of the string as |s|. The characters in the string are numbered starting from 1.
Your task is to find out i... | instruction | 0 | 97,966 | 0 | 195,932 |
No | output | 1 | 97,966 | 0 | 195,933 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s, consisting of small Latin letters. Let's denote the length of the string as |s|. The characters in the string are numbered starting from 1.
Your task is to find out i... | instruction | 0 | 97,967 | 0 | 195,934 |
No | output | 1 | 97,967 | 0 | 195,935 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s, consisting of small Latin letters. Let's denote the length of the string as |s|. The characters in the string are numbered starting from 1.
Your task is to find out i... | instruction | 0 | 97,968 | 0 | 195,936 |
No | output | 1 | 97,968 | 0 | 195,937 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s, consisting of small Latin letters. Let's denote the length of the string as |s|. The characters in the string are numbered starting from 1.
Your task is to find out i... | instruction | 0 | 97,969 | 0 | 195,938 |
No | output | 1 | 97,969 | 0 | 195,939 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Zookeeper is buying a carton of fruit to feed his pet wabbit. The fruits are a sequence of apples and oranges, which is represented by a binary string s_1s_2… s_n of length n. 1 represents an apple and 0 represents an orange.
Since wabbit i... | instruction | 0 | 98,083 | 0 | 196,166 |
Tags: binary search, data structures, divide and conquer, dp, two pointers
Correct Solution:
```
import sys,io,os;Z=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
def f(l,h):
global L,S
if h-l<2:return L[l]%2
m=(l+h)//2;c=x=r=s=0;d=1
for i in range(m-1,l-1,-1):
if L[i]%2:
c+=1
if c>x:x=c
if d:r=c
... | output | 1 | 98,083 | 0 | 196,167 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Zookeeper is buying a carton of fruit to feed his pet wabbit. The fruits are a sequence of apples and oranges, which is represented by a binary string s_1s_2… s_n of length n. 1 represents an apple and 0 represents an orange.
Since wabbit i... | instruction | 0 | 98,084 | 0 | 196,168 |
Tags: binary search, data structures, divide and conquer, dp, two pointers
Correct Solution:
```
from sys import stdin
import sys
import heapq
def bitadd(a,w,bit):
x = a+1
while x <= (len(bit)-1):
bit[x] += w
x += x & (-1 * x)
def bitsum(a,bit):
ret = 0
x = a+1
while x > 0:
... | output | 1 | 98,084 | 0 | 196,169 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Zookeeper is buying a carton of fruit to feed his pet wabbit. The fruits are a sequence of apples and oranges, which is represented by a binary string s_1s_2… s_n of length n. 1 represents an apple and 0 represents an orange.
Since wabbit i... | instruction | 0 | 98,085 | 0 | 196,170 |
Tags: binary search, data structures, divide and conquer, dp, two pointers
Correct Solution:
```
n = int(input());a = map(int, input());acc = 0;back = 0;top = 0;cur = 0;s = []
for i,x in enumerate(a):
if x == 0:cur = 0
else:
if cur > 0:s.pop()
cur += 1
if cur >= top:top = cur;back = (cur + 1) * (cur) // 2 + (i ... | output | 1 | 98,085 | 0 | 196,171 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Zookeeper is buying a carton of fruit to feed his pet wabbit. The fruits are a sequence of apples and oranges, which is represented by a binary string s_1s_2… s_n of length n. 1 represents an apple and 0 represents an orange.
Since wabbit i... | instruction | 0 | 98,086 | 0 | 196,172 |
Tags: binary search, data structures, divide and conquer, dp, two pointers
Correct Solution:
```
n = int(input())
s = input()
tot=0
cur=0
hist=[0]*(n)
i=0
while (i<n):
if (s[i]=='0'):
tot+=cur
else:
l=i
r=i
while (r+1<n and s[r+1]=='1'): r+=1
for x in range... | output | 1 | 98,086 | 0 | 196,173 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Zookeeper is buying a carton of fruit to feed his pet wabbit. The fruits are a sequence of apples and oranges, which is represented by a binary string s_1s_2… s_n of length n. 1 represents an apple and 0 represents an orange.
Since wabbit i... | instruction | 0 | 98,087 | 0 | 196,174 |
Tags: binary search, data structures, divide and conquer, dp, two pointers
Correct Solution:
```
import sys
input = sys.stdin.buffer.readline
n = int(input())
s = input().decode()[:n]
one, rm, pos = 0, [0]*n, [n]*(n+1)
for p in range(n-1, -1, -1):
u = s[p]
if u == '1':
one += 1
rm[p] = pos[one... | output | 1 | 98,087 | 0 | 196,175 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Zookeeper is buying a carton of fruit to feed his pet wabbit. The fruits are a sequence of apples and oranges, which is represented by a binary string s_1s_2… s_n of length n. 1 represents an apple and 0 represents an orange.
Since wabbit i... | instruction | 0 | 98,088 | 0 | 196,176 |
Tags: binary search, data structures, divide and conquer, dp, two pointers
Correct Solution:
```
n=int(input())
l=map(int,input())
c,s,w,p=[0]*(n+3),0,0,0
for i in l:
if i==1:
p+=1
s+=c[p-1]+max(1,p-1)
c[p]+=c[p-1]
c[p-1]=0
c[max(1,p-1)]+=1
else:
p=0
c[0]+=1
w+=s
print(w)
``` | output | 1 | 98,088 | 0 | 196,177 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Zookeeper is buying a carton of fruit to feed his pet wabbit. The fruits are a sequence of apples and oranges, which is represented by a binary string s_1s_2… s_n of length n. 1 represents an apple and 0 represents an orange.
Since wabbit i... | instruction | 0 | 98,089 | 0 | 196,178 |
Tags: binary search, data structures, divide and conquer, dp, two pointers
Correct Solution:
```
import math,sys
n=int(input())
s=input()
dp=[0]*(n+1)
currlength=0
d=[-1]*(n+1)
for i in range(n):
if s[i]=='0':
dp[i+1]=dp[i]
if currlength>0:
for j in range(currlength):
d[j... | output | 1 | 98,089 | 0 | 196,179 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Zookeeper is buying a carton of fruit to feed his pet wabbit. The fruits are a sequence of apples and oranges, which is represented by a binary string s_1s_2… s_n of length n. 1 represents an apple and 0 represents an orange.
Since wabbit i... | instruction | 0 | 98,090 | 0 | 196,180 |
Tags: binary search, data structures, divide and conquer, dp, two pointers
Correct Solution:
```
from sys import stdin
n= int(stdin.readline())
s = stdin.readline().strip()
total = 0
crnt = 0
hist = [0] * n
i = 0
while(i < n):
if (s[i] == '0'):
total += crnt
else:
#find longest segment of ones ... | output | 1 | 98,090 | 0 | 196,181 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Zookeeper is buying a carton of fruit to feed his pet wabbit. The fruits are a sequence of apples and oranges, which is represented by a binary string s_1s_2… s_n of length n. 1 represents an ap... | instruction | 0 | 98,091 | 0 | 196,182 |
Yes | output | 1 | 98,091 | 0 | 196,183 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Zookeeper is buying a carton of fruit to feed his pet wabbit. The fruits are a sequence of apples and oranges, which is represented by a binary string s_1s_2… s_n of length n. 1 represents an ap... | instruction | 0 | 98,092 | 0 | 196,184 |
Yes | output | 1 | 98,092 | 0 | 196,185 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Zookeeper is buying a carton of fruit to feed his pet wabbit. The fruits are a sequence of apples and oranges, which is represented by a binary string s_1s_2… s_n of length n. 1 represents an ap... | instruction | 0 | 98,093 | 0 | 196,186 |
Yes | output | 1 | 98,093 | 0 | 196,187 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Zookeeper is buying a carton of fruit to feed his pet wabbit. The fruits are a sequence of apples and oranges, which is represented by a binary string s_1s_2… s_n of length n. 1 represents an ap... | instruction | 0 | 98,094 | 0 | 196,188 |
Yes | output | 1 | 98,094 | 0 | 196,189 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Zookeeper is buying a carton of fruit to feed his pet wabbit. The fruits are a sequence of apples and oranges, which is represented by a binary string s_1s_2… s_n of length n. 1 represents an ap... | instruction | 0 | 98,095 | 0 | 196,190 |
No | output | 1 | 98,095 | 0 | 196,191 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Zookeeper is buying a carton of fruit to feed his pet wabbit. The fruits are a sequence of apples and oranges, which is represented by a binary string s_1s_2… s_n of length n. 1 represents an ap... | instruction | 0 | 98,096 | 0 | 196,192 |
No | output | 1 | 98,096 | 0 | 196,193 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Zookeeper is buying a carton of fruit to feed his pet wabbit. The fruits are a sequence of apples and oranges, which is represented by a binary string s_1s_2… s_n of length n. 1 represents an ap... | instruction | 0 | 98,097 | 0 | 196,194 |
No | output | 1 | 98,097 | 0 | 196,195 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Zookeeper is buying a carton of fruit to feed his pet wabbit. The fruits are a sequence of apples and oranges, which is represented by a binary string s_1s_2… s_n of length n. 1 represents an ap... | instruction | 0 | 98,098 | 0 | 196,196 |
No | output | 1 | 98,098 | 0 | 196,197 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For example, string "aba" has six substrings: "a", "b... | instruction | 0 | 98,134 | 0 | 196,268 |
Tags: brute force
Correct Solution:
```
x,y=input(),input()
res=[0]*len(x)
dicc ={i:[] for i in "abcdefghijklmnopqrstuvwxyz"}
for i,j in enumerate(x):
dicc[j].append(i)
for i in y:
for j in dicc[i]:
res[j]+=1
res=[0]+res
print(len(y)-max(res))
``` | output | 1 | 98,134 | 0 | 196,269 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For example, string "aba" has six substrings: "a", "b... | instruction | 0 | 98,135 | 0 | 196,270 |
Tags: brute force
Correct Solution:
```
#------------------------template--------------------------#
import os
import sys
from math import *
from collections import *
from fractions import *
from bisect import *
from heapq import*
from io import BytesIO, IOBase
def vsInput():
sys.stdin = open('input.txt', 'r')
... | output | 1 | 98,135 | 0 | 196,271 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For example, string "aba" has six substrings: "a", "b... | instruction | 0 | 98,136 | 0 | 196,272 |
Tags: brute force
Correct Solution:
```
aa = input()
bb = input()
if len(aa) >= len(bb):
p = aa
q = bb
else:
p = aa
q = bb
maxc = 0
for i in range(1,len(p)+len(q)):
k1 = max(0,i-len(q))
k2 = min(i,len(p))
a = p[k1:k2]
if i < len(q):
b = q[-i:]
elif i > len(p):
b = q[:... | output | 1 | 98,136 | 0 | 196,273 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For example, string "aba" has six substrings: "a", "b... | instruction | 0 | 98,137 | 0 | 196,274 |
Tags: brute force
Correct Solution:
```
x,y=input(),input()
t=[0]*len(x)
p={i:[] for i in "abcdefghijklmnopqrstuvwxyz"}
for i,j in enumerate(x):
p[j].append(i)
#print(p)
for i in y:
for j in p[i]:
t[j]+=1
t=[0]+t
print(len(y)-max(t))
# Made By Mostafa_Khaled
``` | output | 1 | 98,137 | 0 | 196,275 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For ex... | instruction | 0 | 98,138 | 0 | 196,276 |
No | output | 1 | 98,138 | 0 | 196,277 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For ex... | instruction | 0 | 98,139 | 0 | 196,278 |
No | output | 1 | 98,139 | 0 | 196,279 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.