s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s501112970 | p02571 | u276765287 | 1598890918 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9128 | 445 | #!/usr/bin/env python
# coding: utf-8
# In[48]:
S, T = list(input().split())
s = len(S)
t = len(T)
list1 = []
list2 = []
n = 0
for i in range(n, s-t+1):
ss = S[n:t + n]
n += 1
m = 0
for x in ss:
if x == T[m]:
list1.append(1)
m +=1
else:
... |
s298371780 | p02571 | u276765287 | 1598890693 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9148 | 378 | S, T = list(input().split())
s = len(S)
t = len(T)
list1 = []
list2 = []
n = 0
for i in range(n, s-t+1):
ss = S[n:t + n]
n += 1
m = 0
for x in ss:
if x == T[m]:
list1.append(1)
m +=1
else:
list1.append(0)
m +=1
list2.a... |
s358795422 | p02571 | u276765287 | 1598890577 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9048 | 395 | S, T = list(input().split())
s = len(S)
t = len(T)
list1 = []
list2 = []
n = 0
for i in range(n, s-t+1):
ss = S[n:t + n]
n += 1
m = 0
for x in ss:
if x == T[m]:
list1.append(1)
m +=1
else:
list1.append(0)
m +=1
print(l... |
s323619562 | p02571 | u579746769 | 1598884613 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8940 | 282 | S=input()
T=input()
ans=10000
for i inrange(len(S)-len(T)+1):
score=0
U=S[i:i+len(T)]#Sのi文字目から{i+len(T)}文字目までがU->部分文字列を抜き出している
for j in range(len(T)):
if U[j] != T[J]:
score += 1
ans = min(ans, score)
print(ans) |
s495828471 | p02571 | u579746769 | 1598884582 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8932 | 284 | S=input()
T=input()
ans=10000
for i inrange(len(S)-len(T)+1):
score=0
U=S[i:i+len(T)]#Sのi文字目から{i+len(T)}文字目までがU->部分文字列を抜き出している
for j in range(len(T)):
if U[j] != T[J]:
score += 1
ans = min(ans, score)
print(ans) |
s106859606 | p02571 | u450586332 | 1598880534 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8816 | 769 | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
//答えansを仮置きする。
//これが十分に大きくないと不正解となるので、
//この値なら絶対に正しい答えが出る、という値を仮置きすること
int ans = T.size();
//Sの何文字目から調べるかを全探索する
for (int start = 0; start <= S.size() - T.size();... |
s067635014 | p02571 | u450586332 | 1598880519 | Python | Python (3.8.2) | py | Runtime Error | 21 | 8796 | 456 | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
int ans = T.size();
for (int start = 0; start <= S.size() - T.size(); start++)
{
int diff = 0;
for (int i = 0; i < T.size(); i++)
{
if (T... |
s173978563 | p02571 | u450586332 | 1598880434 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8988 | 404 | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string S, T;
cin >> S >> T;
int ans = T.size();
for (int start = 0; start <=S.size() - T.size(); start++)
{
int diff = 0;
for (int i = 0; i < T.size(); i++)
{
if (T[i] != S[start + i])
{
... |
s667486437 | p02571 | u253205825 | 1598824451 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9044 | 155 | s = input()
t = input()
m = [None]*(len(s)-len(t))
for i in range(len(s)-len(t)):
for j in range(len(t)):
if s[i+j] == t[j]:
m[i] += 1
print(min(m)) |
s585336318 | p02571 | u945065638 | 1598822577 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9056 | 247 | S =input()
T =input()
mint=10000
for i in range(len(S)-len(T)+1):
con = 0
for j in range(len(T)):
if S[i+j] != T[j]:
con += 1
mint =min(con,mint)
if min_count == 0:
break
print(mint) |
s344566205 | p02571 | u699882868 | 1598818550 | Python | Python (3.8.2) | py | Runtime Error | 66 | 9040 | 199 | s=input()
t=input()
count = []
for i in range(len(s)-len(t)):
c=0
for j in range(i,i+len(t)):
if s[j] == t[j-i]:
c+=1
count.append(c)
print(len(t)-max(count))
|
s230326537 | p02571 | u699882868 | 1598818476 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9008 | 197 | s=input()
t=input()
count = []
for i in range(len(s)-len(t)):
c=0
for j in range(i,i+len(t)):
if s[j] == t[j]:
c+=1
count.append(c)
print(len(t)-max(count))
|
s134169972 | p02571 | u642528832 | 1598815643 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9136 | 243 | S = input()
T = input()
a = []
ans = 0
for i in range(len(S)-2):
if S[i]==T[0]:
ans+=1
if S[i+1]==T[1]:
ans+=1
if S[i+2]==T[2]:
ans+=1
a.append(ans)
ans=0
print(len(T)-max(a)) |
s263152160 | p02571 | u562015767 | 1598812130 | Python | PyPy3 (7.3.0) | py | Runtime Error | 90 | 75148 | 191 | s = list(map(str,input()))
t = list(map(str,input()))
ans = len(t)
for i in range(0,len(s)-len(t)+1):
df = 0
if s[i+j] != t[j]:
df += 1
ans = min(ans,df)
print(ans) |
s202797870 | p02571 | u562015767 | 1598812090 | Python | PyPy3 (7.3.0) | py | Runtime Error | 160 | 74480 | 195 | s = list(map(str,input()))
t = list(map(str,input()))
ans = len(t)
for i in range(0,len(s)-len(t)+1):
df = 0
if s[i+j] != t[j]:
df += 1
ans = min(ans,df)
print(ans) |
s195852490 | p02571 | u995062424 | 1598809406 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9060 | 210 | S = input()
T = input()
num = 10**10
for i in range(len(S)-len(T)+1):
U = S[i:(i+len(T))]
for j in range(len(T)):
if(T[j] != S[j]):
tmp += 1
num = min(num, tmp)
print(num) |
s197648602 | p02571 | u168805205 | 1598796880 | Python | Python (3.8.2) | py | Runtime Error | 20 | 8980 | 385 | #include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main(){
string s, t;
int ans = 1e9;
cin >> s >> t;
rep(si, s.size()){
if(si+t.size() > s.size()) break;
int count = 0;
rep(i, t.size()){
if(s[si + i] != t[i]) count++;
}
a... |
s222149522 | p02571 | u734252743 | 1598796200 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8964 | 297 | s = input() #efabdd
t = input() #abcd
sl = len(s) #6
tl = input(t) #4
ans = tl #4
for i in range(sl-tl+1): #6-4+1 => 0, 1, 2
c = 0
for j in range(min(tl, sl): #min(4, 6) => 4
if (s[i+j] != t[j]: #s[0] != t[0]..t[3]
c += 1
ans = min(c, ans) #min(0..4, 4)
print(ans)
|
s132248843 | p02571 | u030848580 | 1598795931 | Python | PyPy3 (7.3.0) | py | Runtime Error | 86 | 74840 | 324 | def main():
s = input()
t = input()
ans = 100000000
for i in range(0,len(s)-len(t)):
cnt = 0
for sub_s,sub_t in zip(s[i:len(t)+i],t):
if sub_s != sub_t:
cnt += 1
if cnt < ans:
ans = cnt
print(cnt)
if __name__ == "__main__":
ma... |
s425547406 | p02571 | u293708179 | 1598793926 | Python | PyPy3 (7.3.0) | py | Runtime Error | 85 | 74256 | 193 | s = input()
t = input()
lt = len(t)
ls = len(s)
A = []
for i in range(ls-lt):
cou = 0
for j in range(lt):
if s[i+j] != t[j]:
cou += 1
A.append(cou)
print(min(A)) |
s215393963 | p02571 | u334242570 | 1598793364 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9016 | 184 | from math import min
s = input()
st = input()
mx=10**5
rangeforloop= len(s)+1 - len(st)
for i in range(rangeforloop):
mx=min(mx,matcher(s[i:len(st)+i], st))
print(mx) |
s127957540 | p02571 | u334242570 | 1598793328 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8984 | 163 | s = input()
st = input()
mx=10**5
rangeforloop= len(s)+1 - len(st)
for i in range(rangeforloop):
mx=min(mx,matcher(s[i:len(st)+i], st))
print(mx) |
s161556308 | p02571 | u334242570 | 1598793287 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9100 | 163 | s = input()
st = input()
mx=10**9
rangeforloop= len(s)+1 - len(st)
for i in range(rangeforloop):
mx=min(mx,matcher(s[i:len(st)+i], st))
print(mx) |
s554661303 | p02571 | u334242570 | 1598793237 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9044 | 163 | s = input()
st = input()
mx=10**9
rangeforloop= len(s)+1 - len(st)
for i in range(rangeforloop):
mx=min(mx,matcher(s[i:len(st)+i], st))
print(mx) |
s555297418 | p02571 | u334242570 | 1598793173 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9056 | 163 | s = input()
st = input()
mx=10**9
rangeforloop= len(s)+1 - len(st)
for i in range(rangeforloop):
mx=min(mx,matcher(s[i:len(st+i)], st))
print(mx) |
s951554082 | p02571 | u233979986 | 1598792337 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9020 | 194 | s=input()
t=input()
l=[]
if len(s)<len(t):
print(0)
else:
for i in range(len(s)):
if s[i]==t[0]:
if (i+len(t)-1)<len(s):
k=s[i:i+len(t)-1]-t
l.append(k)
sorted(l)
print(l[0]) |
s409034939 | p02571 | u918422508 | 1598787889 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9024 | 210 | S=input()
T=input()
ans=0
count=0
for i1 in range(len(S)-len(T)+1):
for i2 in range(len(T)):
if S[i1+i2]!=T[i2]:
count+=1
else:
ans = min(ans, count)
count=0
else:
print(T-ans.max()) |
s008020059 | p02571 | u918422508 | 1598787576 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9012 | 211 | S=input()
T=input()
ans=[]
count=0
for i1 in range(len(S)-len(T)+1):
for i2 in range(len(T)):
if S[i1+i2]==T[i2]:
count+=1
else:
ans=ans.append(count)
count=0
else:
print(T-ans.max()) |
s470266323 | p02571 | u918422508 | 1598787291 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8944 | 206 | S=input()
T=input()
ans=[]
count=0
for i1 in range(len(S)-len(T)):
for i2 in range(len(T)):
if S[i1+i2]==T[i2]:
count++
else:
ans=ans.append(count)
count=0
else:
print(ans.max()) |
s709194052 | p02571 | u918422508 | 1598787100 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8876 | 214 | S=input()
T=input()
ans=[]
count=0
for i1 in range(len(S)-len(T)):
for i2 in range(len(T)):
if S(i1)==T(i2):
count++
else:
ans=ans.append(count)
count=0
else:
print(ans.max())
|
s061167746 | p02571 | u485819963 | 1598778701 | Python | Python (3.8.2) | py | Runtime Error | 79 | 9044 | 266 | s = input()
t = input()
s_len =len(s)
t_len =len(t)
count = 0
ans = []
for i in range(s_len - t_len):
for j in range(t_len):
if s[i:t_len + i][j] != t[j]:
count += 1
ans.append(count)
count = 0
min_ans = min(ans)
print(min_ans)
|
s985045660 | p02571 | u485819963 | 1598778380 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9032 | 196 | s = input()
t = input()
s_len =len(s)
t_len =len(t)
count = 0
for i in range(s_len - t_len):
for j in range(t_len):
if s[i:t_len][j] != t[j]
count += 1
print(count) |
s661175182 | p02571 | u822044226 | 1598764314 | Python | Python (3.8.2) | py | Runtime Error | 44 | 9036 | 190 | S = input()
T = input()
res = []
cnt = 0
for i in range(len(S)-len(T)):
s = S[i:i+len(T)]
cnt = 0
for j,k in zip(s,T):
if j != k:
cnt += 1
res.append(cnt)
print(min(res)) |
s941551769 | p02571 | u906501980 | 1598761995 | Python | Python (3.8.2) | py | Runtime Error | 453 | 106212 | 173 | from numba import njit
@njit
def main():
s = input()
t = input()
ans = 1000
for i in [1, 2, 3]:
ans += 1
print(ans)
main()
|
s397217269 | p02571 | u906501980 | 1598761892 | Python | Python (3.8.2) | py | Runtime Error | 484 | 106356 | 364 | from numba import njit
def dis(a, b):
d = 0
for ai, bi in zip(a, b):
if ai == bi:
continue
d += 1
return d
@njit
def main():
s = list(input())
t = list(input())
lt = len(t)
ls = len(s)
ans = 1000
for i in prange(ls-lt+1):
ans = 1
print(ans)
... |
s022549111 | p02571 | u906501980 | 1598761835 | Python | Python (3.8.2) | py | Runtime Error | 462 | 106148 | 390 | from numba import njit
def dis(a, b):
d = 0
for ai, bi in zip(a, b):
if ai == bi:
continue
d += 1
return d
@njit
def main():
s = list(input())
t = list(input())
lt = len(t)
ls = len(s)
ans = 1000
for i in prange(ls-lt+1):
ans = min(ans, dis(s[i:i+lt], t))
... |
s482806268 | p02571 | u906501980 | 1598761795 | Python | Python (3.8.2) | py | Runtime Error | 486 | 106356 | 410 | from numba import njit
@njit(cache = True)
def dis(a, b):
d = 0
for ai, bi in zip(a, b):
if ai == bi:
continue
d += 1
return d
@njit
def main():
s = list(input())
t = list(input())
lt = len(t)
ls = len(s)
ans = 1000
for i in prange(ls-lt+1):
ans = min(ans, di... |
s975189773 | p02571 | u571440314 | 1598757952 | Python | PyPy3 (7.3.0) | py | Runtime Error | 84 | 74752 | 280 | s = input()
t = input()
n = len(s)
m = len(t)
cnt = 10000
for i in range(n-m+1):
st = s[i:i+m]
if st == t:
cnt = 0
break
else:
temp = 0
for j in range(m):
if t[j] != st[j]:
temp += 1
cnt = min(cnt,temp)
print(cnt)
|
s874867339 | p02571 | u463594063 | 1598749445 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8952 | 299 | s = input()
t = input()
maxi = 0
for i in range(len(s)):
maxG = 0
print(s[i:len(t)+i])
if len(s[i:len(t)+i]) >= len(t):
for l, j in zip(s[i:len(t)+i], t):
if l == j:
maxG += 1
maxi = max(maxi, maxG)
else:
break
print(len(t)-maxi)
|
s616583407 | p02571 | u551162413 | 1598748547 | Python | Python (3.8.2) | py | Runtime Error | 63 | 9708 | 331 | s = input()
t = input()
start, end = 0, len(t)
def f(s, t, start, end):
min_changes = len(t)
count = 0
for i in range(len(t)):
if s[start:end][i] != t[i]: count += 1
if start + len(t) == len(s): return min(count, min_changes)
else: return min(count, f(s, t, start+1, end+1))
print(f(s, t, st... |
s988612512 | p02571 | u551162413 | 1598747625 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9572 | 350 | s = input()
t = input()
start, end = 0, len(t)
def f(s, t, start, end):
min_changes = len(t)
if start + len(t) == len(s):
count = 0
for i in range(len(t)):
if s[start:end][i] != t[i]: count += 1
return min(count, min_changes)
return min(f(s, t, start+1, end+1), min_change... |
s024833618 | p02571 | u551162413 | 1598747384 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9536 | 332 | s = input()
t = input()
start, end = 0, len(t)
def f(s, t, start, end):
min_changes = len(t)
if start + len(t) == len(s):
count = 0
for i in range(len(t)):
if s[start:end][i] != t[i]: count += 1
return min(count, min_changes)
return f(s, t, start+1, end+1)
print(f(s, t, ... |
s154920241 | p02571 | u539692012 | 1598746097 | Python | Python (3.8.2) | py | Runtime Error | 44 | 9004 | 91 | s,t=open(0)
print(min(sum(a!=b for a,b in zip(s[i:],t[:-1]))for i in range(len(s)-len(t)))) |
s628179032 | p02571 | u489247698 | 1598744634 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9004 | 241 |
input = sys.stdin.readline
S = input()
T = input()
result = float('inf')
for i in range(len(S) - len(T) + 1):
t = 0
for j in range(len(T)):
if S[i + j] != T[j]:
t += 1
result = min(result, t)
print(result)
|
s519824826 | p02571 | u261103969 | 1598743685 | Python | PyPy3 (7.3.0) | py | Runtime Error | 93 | 74892 | 482 | S = input()
T = input()
ans = 1000000 # 適当に1001以上を初期値にしておきます
# Tが1文字のときlen(S)回、2文字のときlen(S) - 1回 …… なので、
# len(S) - len(T) + 1 パターンあります
for i in range(len(S) - len(T) + 1):
score = 0
U = S[i:i + len(T)] # Sのi文字目から連続するlen(T)文字を、Uとします
for j in range(len(T)):
if U[j] != T[j]:
score += ... |
s564825872 | p02571 | u072407640 | 1598741120 | Python | Python (3.8.2) | py | Runtime Error | 33 | 9028 | 395 | s=input()
t=input()
t_l = len(t)
diff_min = 999999999
def diff_str(s1, s2):
diff_c = 0
for j in range(len(seq)):
if s1[j] != s2[j]:
diff_c += 1
return diff_c
if len(s) == len(t):
diff_min = diff_str(s, t)
for i in range(len(s)-t_l):
seq=s[i:i+t_l]
diff_c = diff_str(seq, t... |
s549698505 | p02571 | u731436822 | 1598740443 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9016 | 612 | s = input()
t = input()
# ans = []
# for i in range(len(t)):
# # print(t[i:])
# # print(s[i:])
# if t[i:] in s[i:]:
# break
# for j in range(1,len(t[i:])):
# # print(t[i:][:-j])
# # print(s[i:][:-j])
# if t[i:][:-j] in s[i:][:-j]:
# ans.append(i+j)
# ... |
s115975376 | p02571 | u303039933 | 1598740163 | Python | Python (3.8.2) | py | Runtime Error | 41 | 10600 | 1307 | # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import copy
import decimal
cla... |
s668747174 | p02571 | u750712894 | 1598739924 | Python | PyPy3 (7.3.0) | py | Runtime Error | 85 | 75020 | 187 | S = input()
T = input()
A = len(T)
for i in range(len(S)):
diff = 0
for j in range(len(T)):
if T[j] != S[i + j]:
diff = diff +1;
A = min(A,diff)
print(A) |
s835936688 | p02571 | u766236264 | 1598738309 | Python | Python (3.8.2) | py | Runtime Error | 30 | 8980 | 287 | s = input()
t = input()
minCount = 100000000
i = 0
while i < len(s) and i + j < len(s):
countSame = 0
j = 0
while j < len(t):
if t[j] == s[i+j]:
countSame += 1
j += 1
minCount = min(len(t) - countSame, minCount)
i += 1
print(minCount)
|
s888852484 | p02571 | u995400612 | 1598738189 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8728 | 341 | def minimumChar(S,T):
n, m = len(S), len(T)
ans = sys.maxsize
for i in range(m - n + 1):
minRemovedChar = 0
for j in range(n):
if (S[j] != T[i + j]):
minRemovedChar += 1
ans = min(minRemovedChar, ans)
return ans
S=input()
T=input()
prin... |
s481389637 | p02571 | u395672550 | 1598737657 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9084 | 184 | H,W = map(int,input().split())
if H == 1:
print(1)
if W == 1:
print(1)
if H * W == 1:
print('1')
a = H * W
b = a // 2
if b != a / 2:
b += 1
if H != 1 and W != 1:
print(b)
|
s393751152 | p02571 | u395672550 | 1598737603 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9084 | 188 | H,W = map(int,input().split())
if H == 1 :
print('1')
if W == 1:
print('1')
if H * W == 1:
print('1')
a = H * W
b = a // 2
if b != a / 2:
b += 1
if H != 1 and W != 1:
print(b)
|
s869316303 | p02571 | u395672550 | 1598737512 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9092 | 145 | H,W = map(int,input().split())
if H == 1 or W == 1:
print('1')
a = H * W
b = a // 2
if b != a / 2:
b += 1
if H != 1 and W != 1:
print(b)
|
s379704150 | p02571 | u125090409 | 1598735868 | Python | Python (3.8.2) | py | Runtime Error | 43 | 9036 | 124 | s = input()
t = input()
n, m = len(s), len(t)
print(min(sum(si != ti for si, ti in zip(s[i: i+m], t)) for i in range(n-m)))
|
s055755591 | p02571 | u376324032 | 1598735478 | Python | Python (3.8.2) | py | Runtime Error | 34 | 9756 | 556 | s = input()
t = list(input())
t_test = "".join(t)
import re
def wild(x):
for i in range(len(t_test)):
t2 = []
for item in t:
item_mod = item.replace(t[i],".")
t2.append(item_mod)
t_test2 = "".join(t2)
find = re.findall(t_test2, s)
if find == []:
... |
s661011692 | p02571 | u273283768 | 1598735410 | Python | Python (3.8.2) | py | Runtime Error | 30 | 8832 | 214 | s = input()
t = input()
ans = len(s)
for i in range(len(s)):
if i + len(t) - 1 >= len(s):break;
dif=0
for j in range(len(t)):
if s[i+j] != t[j]:
dif += 1
ans = min(ans, dif)
print(ans) |
s420369827 | p02571 | u273283768 | 1598735384 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8948 | 220 | s = input()
t = input()
ans = len(s)
for s_start in range(len(s)):
if i + len(t) - 1 >= len(s):break;
dif=0
for j in range(len(t)):
if s[i+j] != t[j]:
dif += 1
ans = min(ans, dif)
print(ans) |
s030496638 | p02571 | u801864207 | 1598735365 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9016 | 488 | s = input()
t = input()
l1 = len(s)
l2 = len(t)
i = 0
li = []
while i<l1:
if s[i] == t[0]:
h = 0
k = i
ct = 0
while h < l2:
if s[k] != t[h]:
ct += 1
k+=1
h+=1
li.append(ct)
if h == 0:
i = k
else:
... |
s531319634 | p02571 | u273283768 | 1598735350 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8864 | 220 | s = input()
t - input()
ans = len(s)
for s_start in range(len(s)):
if i + len(t) - 1 >= len(s):break;
dif=0
for j in range(len(t)):
if s[i+j] != t[j]:
dif += 1
ans = min(ans, dif)
print(ans) |
s158210852 | p02571 | u935558307 | 1598735212 | Python | PyPy3 (7.3.0) | py | Runtime Error | 85 | 68768 | 195 | S = input()
T = input()
ans = float("INF")
for i in range(len(S)-len(T)):
cnt = 0
for j in range(len(T)):
if S[i+j] != T[j]:
cnt += 1
ans = min(ans,cnt)
print(cnt) |
s740911534 | p02571 | u935558307 | 1598735169 | Python | PyPy3 (7.3.0) | py | Runtime Error | 88 | 69760 | 188 | S = input()
T = input()
ans = float("INF")
for i in range(len(S)):
cnt = 0
for j in range(len(T)):
if S[i+j] != T[j]:
cnt += 1
ans = min(ans,cnt)
print(cnt) |
s290244652 | p02571 | u335406314 | 1598735164 | Python | Python (3.8.2) | py | Runtime Error | 2353 | 137812 | 305 | S,T=open(0).read().split()
def main():
for i in range(1,len(T)+1):
for j in range(i+1):
print(T[j:(len(T)-i+j)], S[j:(len(S)-i+j)])
if T[j:(len(T)-i+j)] in S[j:(len(S)-i+j)]:
return i
break
if T in S:
print(0)
else:
print(main()) |
s815950237 | p02571 | u793868662 | 1598734989 | Python | PyPy3 (7.3.0) | py | Runtime Error | 2106 | 172268 | 317 |
def resolve():
s = input()
t = input()
ans = 0
for i in range(len(t)):
for j in range(i, len(t)):
test = t[i:(j + 1)]
if test in s[i:(len(s) - (len(t) - j) + 1)]:
print(test)
ans = max(ans, len(test))
print(len(t) - ans)
resolve() |
s970177223 | p02571 | u689281702 | 1598734842 | Python | Python (3.8.2) | py | Runtime Error | 165 | 9076 | 489 | S = list(input())
T = list(input())
array = [0. for i in range(len(S))]
count = 0
p = []
for i in range(len(S)):
for j in range(len(T)):
if S[i] == T[j] and i >= j:
count += 1
p.append(j)
array[i] += count
break
else:
count = 0
arr = [0. fo... |
s249549207 | p02571 | u969962623 | 1598734821 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9064 | 170 | N = int(input())
array = list(map(int,input().split()))
ans = 0
kuso = sum(array)
for i in range(N-1):
kuso -= array[i]
ans += array[i]*kuso
print( ans%(10**9+7) )
|
s082793441 | p02571 | u969962623 | 1598734792 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9164 | 161 | N = int(input())
array = list(map(int,input().split()))
ans = 0
a = sum(array)
for i in range(N-1):
a -= array[i]
ans += array[i]*a
print( ans%(10**9+7) )
|
s351641112 | p02571 | u689281702 | 1598734763 | Python | Python (3.8.2) | py | Runtime Error | 134 | 9052 | 354 | S = list(input())
T = list(input())
p = []
for i in range(len(S)):
for j in range(len(T)):
if S[i] == T[j] and i >= j:
p.append(j)
break
arr = [0. for i in range(len(p))]
c = 0
for k in range(len(p)-1):
if p[k]+1 == p[k+1]:
c += 1
arr[k+1] += 1
else:
c... |
s908608448 | p02571 | u969962623 | 1598734747 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8896 | 155 | n=int(input())
array=list(map(int,input().split()))
ans=0
s=sum(array)
for j in range(n-1):
s -= array[i]
ans += array[j]*s
print(ans%(10**9+7))
|
s539791562 | p02571 | u969962623 | 1598734722 | Python | Python (3.8.2) | py | Runtime Error | 30 | 8916 | 156 | n=int(input())
array=list(map(int,input().split()))
ans=0;
s=sum(array)
for j in range(n-1):
s -= array[i]
ans += array[j]*s
print(ans%(10**9+7))
|
s916783591 | p02571 | u969962623 | 1598734680 | Python | Python (3.8.2) | py | Runtime Error | 20 | 8900 | 154 | n=int(input())
array=list(map(int,input().split()))
ans=0;
s=sum(array)
for j in range(n):
s -= array[i]
ans += array[j]*s
print(ans%(10**9+7))
|
s003307655 | p02571 | u869594594 | 1598734672 | Python | Python (3.8.2) | py | Runtime Error | 66 | 8860 | 203 | S=input()
T=input()
s=len(S)
t=len(T)
max_count=0
count=0
for i in range(s-t+1):
for j in range(t):
if T[i]==S[j+i]:
count += 1
max_count=max(max_count,count)
count=0
print(t-max_count) |
s214793650 | p02571 | u969962623 | 1598734601 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9088 | 156 | n=int(input())
array=list(map(int,input().split()))
ans=0;
for i in range(n-1):
j=i+1
for j in range(n):
ans=array[j]*array[i]
print(ans%(10**9+7))
|
s706187648 | p02571 | u869594594 | 1598734569 | Python | Python (3.8.2) | py | Runtime Error | 75 | 9096 | 199 | S=input()
T=input()
s=len(S)
t=len(T)
max_count=0
for i in range(s-t+1):
count=0
for j in range(t):
if T[i]==S[j+i]:
count += 1
max_count=max(max_count,count)
print(t-max_count) |
s180399921 | p02571 | u072717685 | 1598734565 | Python | PyPy3 (7.3.0) | py | Runtime Error | 3231 | 223900 | 670 | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
s = input()
t = input()
if t in s:
print(0)
sys.exit()
if len(s) == 1 and len(t) == 1:
if t != s:
print(1)
sys.exit()
lens = len(s)
lent = len(t)
res = []
for i1... |
s838322054 | p02571 | u969962623 | 1598734405 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9068 | 147 | n=int(input())
array=list(map(int,input().split()))
ans=0;
for i in range(n-1):
j=i+1
for j in range(n):
ans=a[j]*a[i]
print(ans%(10**9+7)) |
s236788010 | p02571 | u894521144 | 1598734276 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9068 | 358 |
def main():
S = input()
T = input()
# Sのi文字目をTの先頭として，それらの文字列の一致度を見る．
st = {}
for i in range(len(S)-len(T)+1):
cnt = 0
for s, t in zip(S[i:i+len(T)], T):
cnt += s == t
st.add(cnt)
print(len(T) - max(st))
if __name__ == '__main__':
main() |
s703935035 | p02571 | u991542950 | 1598733912 | Python | PyPy3 (7.3.0) | py | Runtime Error | 85 | 68720 | 268 | import sys
input = sys.stdin.readline.strip()
S = input()
T = input()
score_list = []
for i in range(len(S) - len(T) + 1):
s = S[i:i+len(T)]
score = 0
for i in range(len(s)):
if s[i] != T[i]:
score += 1
score_list.append(score)
print(min(score_list)) |
s698348610 | p02571 | u389530753 | 1598733787 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9108 | 167 | N=int(input())
A=list(map(int,input().split()))
ans=int(0)
count=0
for i in range(N):
for j in range(i+1,N):
count += A[i]*A[j]
t=count%(10**9+7)
print(t)
|
s499935455 | p02571 | u395356317 | 1598733648 | Python | Python (3.8.2) | py | Runtime Error | 77 | 9080 | 866 | s = input()
t = input()
max_length = 0
# for i in range(len(t)):
# for j in range(i, len(s)):
# if t[i] == s[j]:
# length = 0
# for k in range(min(len(t)-i, len(s)-j)):
# if t[i+k] == s[j+k]:
# length += 1
# for l in range(1, i+1):
# ... |
s267513987 | p02571 | u395356317 | 1598733608 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8788 | 865 | s = input()
t = input()
max_length = 0
# for i in range(len(t)):
# for j in range(i, len(s)):
# if t[i] == s[j]:
# length = 0
# for k in range(min(len(t)-i, len(s)-j)):
# if t[i+k] == s[j+k]:
# length += 1
# for l in range(1, i+1):
# ... |
s238944312 | p02571 | u317423698 | 1598733599 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9036 | 427 | import sys
def resolve(in_):
S = next(in_).strip()
T = next(in_).strip()
x = 0
for i in range(len(S)):
if len(S) - i < len(T):
break
v = 0
for x, y in zip(S[i:], T)
if x == y:
v += 1
x = max(x, len(T) - v)
return x
... |
s440776429 | p02571 | u618187934 | 1598733584 | Python | Python (3.8.2) | py | Runtime Error | 74 | 10140 | 377 | import re
s = input()
t = input()
if t in s:
print(0)
else:
s_length = len(s)
t_length = len(t)
s_substart = 0
all_s=[]
for i in s:
all_s.append(s[s_substart:s_substart + t_length])
s_substart += 1
if s_substart + t_length > s_length:
break
stoissyo = len(... |
s587558618 | p02571 | u454649802 | 1598733578 | Python | Python (3.8.2) | py | Runtime Error | 2206 | 24192 | 232 | s = input()
t = input()
ls = []
for i in range(len(t)):
for j in (range(1,len(t)+1)):
t_a = t[-(i+j):]
if s.find(t_a) == -1:
continue
else:
ls.append(len(t) - len(t_a))
print(min(ls)) |
s519632951 | p02571 | u979591106 | 1598733576 | Python | Python (3.8.2) | py | Runtime Error | 966 | 139732 | 472 | from sys import stdin
s = stdin.readline().rstrip()
t = stdin.readline().rstrip()
def strpair(str,n):
arr = []
for i in range(0,len(str)-n+1):
arr.append(str[i:i+n])
return arr
def count(s,t):
# if s.count(t) >= 1:
# return 0
arr = []
count = 0
for i in range(1,len(t)+1... |
s198097961 | p02571 | u310956674 | 1598733561 | Python | PyPy3 (7.3.0) | py | Runtime Error | 104 | 68452 | 199 | s = input()
t = input()
count=10000000000
COUNT=0
for j in range(len(s)-len(t)+2):
for i in range(len(t)):
if not t[i]==s[j]:
COUNT+=1
count=min(count,COUNT)
print(count)
|
s119043935 | p02571 | u039860745 | 1598733532 | Python | Python (3.8.2) | py | Runtime Error | 459 | 18704 | 268 | S = input()
T = input()
ans = len(T)
j = 0
l = 0
a = []
for i in range(len(T)):
for t in range(i, len(T)):
l = len(S) - (len(T[i:t + 1]) - 1)
if T[i: t + 1] in S[i:l]:
a.append(len(T) - len(T[i: t + 1] ))
ans = min(a)
print(ans) |
s484963768 | p02571 | u072717685 | 1598733511 | Python | PyPy3 (7.3.0) | py | Runtime Error | 437 | 106616 | 645 | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
s = input()
t = input()
if t in s:
print(0)
sys.exit()
if len(s) == 1 and len(t) == 1:
if s in t:
print(0)
sys.exit()
else:
print(1)
sys.exit()
... |
s107878296 | p02571 | u588592871 | 1598733479 | Python | Python (3.8.2) | py | Runtime Error | 71 | 9140 | 192 | s=list(input())
t=list(input())
S=[0 for i in range(len(s)-len(t)+1)]
for i in range(len(s)-len(t)+1):
for j in range(len(t)):
if t[j]==s[j+i]:
S[i]+=1
S_max=max(S)
print(t-S_max) |
s447591399 | p02571 | u304058693 | 1598733460 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8948 | 463 | s = input()
t = input()
cnt1 = 0
if len(s) == len(t):
for i in range(len(t)):
if s[i] != t[i]:
cnt1 += 1
print(cnt1)
else:
cnt = []
for i in range(len(t)):
for k in range(i + 1, len(t) + 1):
if t[i:k] in s[i:]:
cnt.append(k - i)
print(... |
s155585603 | p02571 | u269767135 | 1598733435 | Python | Python (3.8.2) | py | Runtime Error | 107 | 9064 | 374 | S = str(input())
T = str(input())
len_s = len(S)
len_t = len(T)
cnt = len_t
c = 0
if len_s == len_t:
c = 0
for i in range(len_s):
if S[i] != T[i]:
c += 1
cnt = min(c, cnt)
for i in range(len_s - len_t):
c = 0
for j in range(i, i +len_t):
if S[i] != T[i-len_t]:
... |
s023160802 | p02571 | u886610768 | 1598733404 | Python | Python (3.8.2) | py | Runtime Error | 150 | 9072 | 616 | s = input()
t = input()
counts = list()
for i in range(len(t)):
count = len(t)
kari_count = len(t)
j = i
for j in range(len(s)):
# if((len(s) - j) == (len(t) - i )):
# break
if(j < i):
continue
elif(t[i] == s[j]):
kari_count = i
for ... |
s995982439 | p02571 | u207582576 | 1598733392 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9108 | 215 | S, T = input().split()
n = len(S) - len(T) + 1
moji = len(T)
for a in range(n):
count = 0
for b in range(len(T)):
if S[a+b] != T[b]:
count += 1
if count < moji:
moji = count
print(moji) |
s158886168 | p02571 | u521919054 | 1598733390 | Python | Python (3.8.2) | py | Runtime Error | 73 | 9112 | 238 | s = list(input())
t = list(input())
if(t in s):
print(0)
result = []
for i in range(len(s) - len(t)):
result.append(len(t))
for j in range(len(t)):
if(s[i+j] == t[j]):
result[i] -= 1
print(min(result))
|
s692318281 | p02571 | u484442523 | 1598733359 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9860 | 698 | s = input()
t = input()
flg = False
if t in s:
print(0)
else:
def recursive_find(target, find):
if len(find) == 1:
return ''
sliced = find[:-1]
if sliced in target:
return sliced
else:
recursive_find(target, sliced)
result = recursive_fin... |
s129111922 | p02571 | u454649802 | 1598733316 | Python | Python (3.8.2) | py | Runtime Error | 860 | 137876 | 283 | s = input()
t = input()
for i in range(len(t)):
for j in reversed(range(1,len(t)+1)):
t_a = t[i:i+j]
print(t_a)
if s.find(t_a) == -1:
continue
else:
print(len(t) - len(t_a))
break
else:
continue
break |
s965259713 | p02571 | u103831818 | 1598733303 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8800 | 143 | s = input()
t = input()
n = 0
a = 0
b = 1
for i in s:
if i == t[a]:
a += 1
b = a
else:
a = 0
print(len(t) - b)
|
s199557793 | p02571 | u247211039 | 1598733274 | Python | Python (3.8.2) | py | Runtime Error | 2205 | 9036 | 621 | S=input()
T=input()
cnt=0
ans=0
b=[0]*len(S)
a=[0]*len(S)
for i in range(len(S)):
cnt = 0
for j in range(len(T)):
cnt = 0
#print(S[i],T[j])
if S[i]==T[j]:
cnt+=1
if j != len(T):
for k in range(j+1,len(T)-j-2):
if S[i+k]==T[j+k... |
s299745661 | p02571 | u648378018 | 1598733242 | Python | Python (3.8.2) | py | Runtime Error | 88 | 9144 | 549 | s = input()
t = input()
ans = 0
mans = 0
fans = []
k = 0
prev = 0
for i in range(len(t)):
for j in range(k,len(s)):
if(t[i] == s[j]):
m = i+1
l = j+1
while(m < len(t)):
if(t[m] != s[l] and (len(s)-l >= len(t)-m)):
mans = len(t)-m
... |
s549705245 | p02571 | u521919054 | 1598733216 | Python | PyPy3 (7.3.0) | py | Runtime Error | 79 | 68724 | 212 | s = list(input())
t = list(input())
result = []
for i in range(len(s) - len(t)):
result.append(len(t))
for j in range(len(t)):
if(s[i+j] == t[j]):
result[i] -= 1
print(min(result))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.