problem_id
stringlengths 6
6
| buggy_code
stringlengths 8
526k
| fixed_code
stringlengths 12
526k
| labels
listlengths 0
15
⌀ | buggy_submission_id
int64 1
1.54M
| fixed_submission_id
int64 2
1.54M
| user_id
stringlengths 10
10
| language
stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02859
|
i=int(intput())
print(i*i)
|
i=int(input())
print(i*i)
|
[
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 661,786
| 661,787
|
u414275860
|
python
|
p02859
|
a=int(input())
a=a+2
print(a)
|
a=int(input())
a=a**2
print(a)
|
[
"assignment.value.change",
"expression.operation.binary.change"
] | 661,790
| 661,791
|
u688055251
|
python
|
p02859
|
a=int(input())
print(a)
|
a=int(input())
print(a*a)
|
[
"expression.operation.binary.add"
] | 661,800
| 661,801
|
u574053975
|
python
|
p02851
|
#01:15
n,k = map(int,input().split())
a = list(map(int,input().split()))
for i in range(n):
a[i] -= 1
a[i] %= k
b = [0]
for i in range(n):
b.append((b[-1]+a[i]) % k)
ans = 0
now = {0:1}
for i in range(1,n+1):
tmp = b[i]
if tmp in now:
ans += now[tmp]
now[tmp] += 1
else:
now[tmp] = 1
if i - k + 1 >= 0:
now[b[i-k+1]] -= 1
print(ans)
|
#01:15
n,k = map(int,input().split())
a = list(map(int,input().split()))
for i in range(n):
a[i] -= 1
a[i] %= k
b = [0]
for i in range(n):
b.append((b[-1]+a[i]) % k)
ans = 0
now = {}
for i in range(n+1):
tmp = b[i]
if tmp in now:
ans += now[tmp]
now[tmp] += 1
else:
now[tmp] = 1
if i - k + 1 >= 0:
now[b[i-k+1]] -= 1
print(ans)
|
[
"call.arguments.change"
] | 661,900
| 661,901
|
u111365362
|
python
|
p02851
|
#解説解答
n,k = map(int,input().split())
a = list(map(int,input().split()))
for i in range(n):
a[i] -= 1
a[i] %= k
#print(a)
b = [0]
for i in range(n):
b.append((b[-1]+a[i])%k)
#print(b)
ans = 0
now = {0:1}
for i in range(1,n+1):
if b[i] in now:
ans += now[b[i]]
now[b[i]] += 1
else:
now[b[i]] = 1
if i - k + 1 >= 0:
now[b[i-k+1]] -= 1
#print(now,i,ans)
print(ans)
|
#解説解答
n,k = map(int,input().split())
a = list(map(int,input().split()))
for i in range(n):
a[i] -= 1
a[i] %= k
#print(a)
b = [0]
for i in range(n):
b.append((b[-1]+a[i])%k)
#print(b)
ans = 0
now = {}
for i in range(n+1):
if b[i] in now:
ans += now[b[i]]
now[b[i]] += 1
else:
now[b[i]] = 1
if i - k + 1 >= 0:
now[b[i-k+1]] -= 1
#print(now,i,ans)
print(ans)
|
[
"call.arguments.change"
] | 661,902
| 661,903
|
u111365362
|
python
|
p02851
|
import sys
import math
import heapq
import bisect
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
res = [1]
for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
return res
def gcd(x, y):
if x < y: x, y = y, x
div = x % y
while div != 0:
x, y = y, div
div = x % y
return y
# j - i == S[j] - S[i] # MOD K
# S[i] - i == S[j] - j
N,K=LI()
As=LI()
Cum=[0]*(N+1)
for i in range(N):
Cum[i+1] = Cum[i] + As[i]
REM2IDX = {}
for i in range(1,N+1):
rem = (Cum[i] - i) % K
if not rem in REM2IDX: REM2IDX[rem] = []
REM2IDX[rem].append(i)
res = 0
for i in range(0,N+1):
rem = (Cum[i] - i) % K
cnt = len(REM2IDX[rem])
l = bisect.bisect_right(REM2IDX[rem], i)
r = bisect.bisect_right(REM2IDX[rem], i+K-1)
res += (r-l)
print(res)
|
import sys
import math
import heapq
import bisect
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
res = [1]
for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
return res
def gcd(x, y):
if x < y: x, y = y, x
div = x % y
while div != 0:
x, y = y, div
div = x % y
return y
# j - i == S[j] - S[i] # MOD K
# S[i] - i == S[j] - j
N,K=LI()
As=LI()
Cum=[0]*(N+1)
for i in range(N):
Cum[i+1] = Cum[i] + As[i]
REM2IDX = {}
for i in range(0,N+1):
rem = (Cum[i] - i) % K
if not rem in REM2IDX: REM2IDX[rem] = []
REM2IDX[rem].append(i)
res = 0
for i in range(0,N+1):
rem = (Cum[i] - i) % K
cnt = len(REM2IDX[rem])
l = bisect.bisect_right(REM2IDX[rem], i)
r = bisect.bisect_right(REM2IDX[rem], i+K-1)
res += (r-l)
print(res)
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 661,924
| 661,925
|
u895515293
|
python
|
p02851
|
import sys
import math
import heapq
import bisect
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
res = [1]
for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
return res
def gcd(x, y):
if x < y: x, y = y, x
div = x % y
while div != 0:
x, y = y, div
div = x % y
return y
# j - i == S[j] - S[i] # MOD K
# S[i] - i == S[j] - j
N,K=LI()
As=LI()
Cum=[0]*(N+1)
for i in range(N):
Cum[i+1] = Cum[i] + As[i]
REM2IDX = {}
for i in range(1,N+1):
rem = (Cum[i] - i) % K
if not rem in REM2IDX: REM2IDX[rem] = []
REM2IDX[rem].append(i)
res = 0
for i in range(0,N+1):
rem = (Cum[i] - i) % K
cnt = len(REM2IDX[rem])
l = bisect.bisect_right(REM2IDX[rem], i)
r = bisect.bisect_right(REM2IDX[rem], i+K-1)
res += (r-l)
print(res)
|
import sys
import math
import heapq
import bisect
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
res = [1]
for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
return res
def gcd(x, y):
if x < y: x, y = y, x
div = x % y
while div != 0:
x, y = y, div
div = x % y
return y
# j - i == S[j] - S[i] # MOD K
# S[i] - i == S[j] - j
N,K=LI()
As=LI()
Cum=[0]*(N+1)
for i in range(N):
Cum[i+1] = Cum[i] + As[i]
REM2IDX = {}
for i in range(0,N+1):
rem = (Cum[i] - i) % K
if not rem in REM2IDX: REM2IDX[rem] = []
REM2IDX[rem].append(i)
res = 0
for i in range(0,N+1):
rem = (Cum[i] - i) % K
cnt = len(REM2IDX[rem])
l = bisect.bisect_right(REM2IDX[rem], i)
r = bisect.bisect_right(REM2IDX[rem], i+K-1)
res += (r-l)
print(res)
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 661,926
| 661,925
|
u895515293
|
python
|
p02851
|
from collections import defaultdict as d
from itertools import accumulate as ac
n,k=map(int,input().split())
a=[0]+list(ac(list(map(int,input().split()))))
b=d(int)
c=0
for i in range(n+1):
p=(a[i]-i)%k
c+=b[p]
b[p]+=1
if i-k>=0:
b[(a[i-k]-i+k)%k]-=1
print(c)
|
from collections import defaultdict as d
from itertools import accumulate as ac
n,k=map(int,input().split())
a=[0]+list(ac(list(map(int,input().split()))))
b=d(int)
c=0
for i in range(n+1):
p=(a[i]-i)%k
c+=b[p]
b[p]+=1
if i-k+1>=0:
b[(a[i-k+1]-i+k-1)%k]-=1
print(c)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 661,955
| 661,956
|
u619819312
|
python
|
p02859
|
N = int(input())
print(N*2)
|
N = int(input())
print(N**2)
|
[
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 661,979
| 661,980
|
u580073714
|
python
|
p02859
|
r = int(input())
print(r ** r)
|
r = int(input())
print(r ** 2)
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 661,983
| 661,984
|
u652583512
|
python
|
p02860
|
N = int(input())
S = input()
n = N // 2
T = S[:n - 1]
if S == T + T:
print("Yes")
else:
print("No")
|
N = int(input())
S = input()
n = N // 2
T = S[:n]
if S == T + T:
print("Yes")
else:
print("No")
|
[
"expression.operation.binary.remove"
] | 661,995
| 661,996
|
u442869553
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 == 0 and s[:n//2] == s[s//2:] :
print('Yes')
else:
print('No')
|
n = int(input())
s = input()
if n % 2 == 0 and s[:n//2] == s[n//2:] :
print('Yes')
else:
print('No')
|
[
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 662,000
| 662,001
|
u162612857
|
python
|
p02860
|
n = int(input())
s = input()
flag = 1
if n % 2:
print('No')
else:
for i in range(n):
if s[i] != s[n/2 + i]:
flag = 0
if flag:
print('Yes')
else:
print('No')
|
n = int(input())
s = input()
flag = 1
if n % 2:
print('No')
else:
for i in range(n//2):
if s[i] != s[n//2 + i]:
flag = 0
if flag:
print('Yes')
else:
print('No')
|
[
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 662,011
| 662,012
|
u347600233
|
python
|
p02860
|
n = int(input())
s = input()
if n%2==1:
print("NO")
else:
s1 = ""
s2 = ""
for i in range(0, n//2):
s1+=s[i]
s2+=s[n//2 + i]
if(s1 == s2):
print("YES")
else:
print("NO")
|
n = int(input())
s = input()
if n%2==1:
print("No")
else:
s1 = ""
s2 = ""
for i in range(0, n//2):
s1+=s[i]
s2+=s[n//2 + i]
if(s1 == s2):
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 662,017
| 662,018
|
u029912106
|
python
|
p02860
|
import sys
N = int(input())
s = input()
if N%2 ==1:
print('No')
sys.exit()
if s[:N//2] == s[N//2+1:]:
print('Yes')
else:
print('No')
|
import sys
N = int(input())
s = input()
if N%2 ==1:
print('No')
sys.exit()
if s[:N//2] == s[N//2:]:
print('Yes')
else:
print('No')
|
[
"expression.operation.binary.remove"
] | 662,038
| 662,039
|
u026155812
|
python
|
p02860
|
import sys
N = int(input())
s = input()
if N%2 ==1:
print('No')
sys.exit()
if s[:N//2] == s[N//2+1:]:
print('Yes')
else:
print('No')
|
import sys
N = int(input())
s = input()
if N%2 ==1:
print('No')
sys.exit()
if s[:N//2] == s[N//2:]:
print('Yes')
else:
print('No')
|
[
"expression.operation.binary.remove"
] | 662,040
| 662,039
|
u026155812
|
python
|
p02860
|
N = int(input())
S = input()
if S[:int(N/2):] == S[int(N/2)+1::]:
print("Yes")
else:
print("No")
|
N = int(input())
S = input()
if S[:int(N/2):] == S[int(N/2)::]:
print("Yes")
else:
print("No")
|
[
"expression.operation.binary.remove"
] | 662,042
| 662,043
|
u273242084
|
python
|
p02860
|
n = int(input())
t = input()
if n % 2 != 0:
print('No')
else:
print('Yes' if t[:n//2] + t[n//2:] == t else 'No')
|
n = int(input())
t = input()
if n % 2 != 0:
print('No')
else:
print('Yes' if t[:n//2] == t[n//2:] else 'No')
|
[
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 662,060
| 662,061
|
u938486382
|
python
|
p02860
|
n = int(input())
t = input()
if n % 2 != 0:
print('No')
else:
print('Yes' if t[:n//2] + t[n//2:] else 'No')
|
n = int(input())
t = input()
if n % 2 != 0:
print('No')
else:
print('Yes' if t[:n//2] == t[n//2:] else 'No')
|
[
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 662,062
| 662,061
|
u938486382
|
python
|
p02860
|
N=int(input())
S=input()
if N%2==0 and all(a==b for a,b in zip(S,S[N:])):
print("Yes")
else:
print("No")
|
N = int(input())
S=input()
if N%2==0 and all(a==b for a,b in zip(S,S[N//2:])):
print("Yes")
else:
print("No")
|
[
"control_flow.branch.if.condition.change"
] | 662,065
| 662,066
|
u375616706
|
python
|
p02860
|
N=int(input())
S=input()
if N%2==0 and all(a==b for a,v in zip(S,S[N:])):
print("Yes")
else:
print("No")
|
N = int(input())
S=input()
if N%2==0 and all(a==b for a,b in zip(S,S[N//2:])):
print("Yes")
else:
print("No")
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 662,067
| 662,066
|
u375616706
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 != 0:
print("Yes")
else:
T = s[0:n//2+1]
if T + T == s:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
if n % 2 != 0:
print("No")
else:
T = s[0:n//2]
if T + T == s:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change",
"expression.operation.binary.remove"
] | 662,083
| 662,082
|
u757274384
|
python
|
p02860
|
n=int(input())
s=list(input())
Len=len(s)/2
if len(s)%2==1:
print('No')
else:
for i in range(Len):
if s[i]!=s[i+Len]:
print('No')
break
print('Yes')
|
n=int(input())
s=list(input())
Len=int(len(s)/2)
if len(s)%2==1:
print('No')
else:
for i in range(Len):
if s[i]!=s[i+Len]:
print('No')
exit()
print('Yes')
|
[
"call.add",
"call.arguments.change",
"control_flow.break.remove",
"control_flow.exit.add"
] | 662,093
| 662,094
|
u090406054
|
python
|
p02860
|
N = int(input())
S = input()
if N % 2 == 1:
print('No')
else:
if S[0:(N // 2) + 1] == S[N // 2:]:
print('Yes')
else:
print('No')
|
N = int(input())
S = input()
if N % 2 == 1:
print('No')
else:
if S[:N // 2] == S[N // 2:]:
print('Yes')
else:
print('No')
|
[
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 662,095
| 662,096
|
u685244071
|
python
|
p02860
|
N = int(input())
S = input()
if N % 2 == 1:
print('No')
else:
if S[0:(N // 2) + 1] == S[N // 2:]:
print('Yes')
else:
print('No')
|
N = int(input())
S = input()
if N % 2 == 1:
print('No')
else:
if S[0:N // 2] == S[N // 2:]:
print('Yes')
else:
print('No')
|
[
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 662,095
| 662,098
|
u685244071
|
python
|
p02860
|
n=int(input())
a=input()
if n%2==0 and a[:n//2]==a[n//2:]:
print("Yes")
else:
print("NO")
|
n=int(input())
a=input()
if n%2==0 and a[:n//2]==a[n//2:]:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 662,107
| 662,108
|
u156383602
|
python
|
p02860
|
N=int(input())
S=input()
if S[:N//2-1]==S[N//2:]:
print("Yes")
else:
print("No")
|
N=int(input())
S=input()
if S[:N//2]==S[N//2:]:
print("Yes")
else:
print("No")
|
[
"expression.operation.binary.remove"
] | 662,111
| 662,112
|
u963944915
|
python
|
p02860
|
N=int(input())
S=input()
if S[0:N//2-1]==S[N//2:-1]:
print("Yes")
else:
print("No")
|
N=int(input())
S=input()
if S[:N//2]==S[N//2:]:
print("Yes")
else:
print("No")
|
[
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 662,113
| 662,112
|
u963944915
|
python
|
p02860
|
a = int(input())
b = input()
if a%2 == 0:
print("Yes" if b[:(a/2)] == b[(a/2):] else "No")
else:
print("No")
|
a = int(input())
b = input()
if a%2 == 0:
print("Yes" if b[:int(a/2)] == b[int(a/2):] else "No")
else:
print("No")
|
[
"call.add",
"type_conversion.to_integer.change",
"type_conversion.to_number.change",
"call.arguments.change"
] | 662,122
| 662,123
|
u842028864
|
python
|
p02860
|
a = int(input())
b = input()
if a%2 == 0:
print("Yes" if a[:(a/2)] == a[(a/2):] else "No")
else:
print("No")
|
a = int(input())
b = input()
if a%2 == 0:
print("Yes" if b[:int(a/2)] == b[int(a/2):] else "No")
else:
print("No")
|
[
"identifier.change",
"call.arguments.change",
"io.output.change",
"call.add",
"type_conversion.to_integer.change",
"type_conversion.to_number.change"
] | 662,124
| 662,123
|
u842028864
|
python
|
p02860
|
a = int(input())
b = input()
if a%2 == 0:
print("Yes" if a[:(a/2-1)] == a[(a/2):] else "No")
else:
print("No")
|
a = int(input())
b = input()
if a%2 == 0:
print("Yes" if b[:int(a/2)] == b[int(a/2):] else "No")
else:
print("No")
|
[
"identifier.change",
"call.arguments.change",
"io.output.change",
"call.add",
"type_conversion.to_integer.change",
"type_conversion.to_number.change",
"expression.operation.binary.remove"
] | 662,125
| 662,123
|
u842028864
|
python
|
p02860
|
n = int(input())
s = input()
mid = int(n/2)
if n == 1:
print("No")
elif s[:mid] == s[:mid]:
print('Yes')
else:
print("No")
|
n = int(input())
s = input()
mid = int(n/2)
if n == 1:
print("No")
elif s[:mid] == s[mid:]:
print('Yes')
else:
print("No")
|
[
"control_flow.branch.if.condition.change"
] | 662,126
| 662,127
|
u501451051
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2:
pirnt("No")
exit()
half = s[0:n // 2]
print("Yes" if s == half + half else "No")
|
n = int(input())
s = input()
if n % 2:
print("No")
exit()
half = s[0:n // 2]
print("Yes" if s == half + half else "No")
|
[
"identifier.change",
"call.function.change"
] | 662,136
| 662,137
|
u973321061
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2:
pirnt("No")
exit()
half = s[0:n // 2]
print("Yes" if s == half + half else "No")
|
n = int(input())
s = input()
if n % 2:
print("No")
exit()
half = s[0:n // 2]
print("Yes" if s == half + half else "No")
|
[
"identifier.change",
"call.function.change"
] | 662,138
| 662,137
|
u973321061
|
python
|
p02860
|
n=int(input())
s=input()
if n % 2:
pirnt("No")
exit()
half=s[0:n//2]
print("Yes" if s==half+half else "No")
|
n = int(input())
s = input()
if n % 2:
print("No")
exit()
half = s[0:n // 2]
print("Yes" if s == half + half else "No")
|
[
"identifier.change",
"call.function.change"
] | 662,139
| 662,137
|
u973321061
|
python
|
p02860
|
import sys
def main():
N = int(input())
S = input()
if N % 2 == 1:
print("No")
sys.exit()
n = N / 2
yesno = "Yes" if S[:n] == S[n:] else "No"
print(yesno)
if __name__ == "__main__":
main()
|
def main():
N = int(input())
S = input()
if N % 2 == 1:
print("No")
quit()
n = N // 2
yesno = "Yes" if S[:n] == S[n:] else "No"
print(yesno)
if __name__ == "__main__":
main()
|
[
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 662,148
| 662,149
|
u322763702
|
python
|
p02860
|
def main():
N = int(input())
S = input()
if N % 2 == 1:
print("No")
quit()
n = N / 2
yesno = "Yes" if S[:n] == S[n:] else "No"
print(yesno)
if __name__ == "__main__":
main()
|
def main():
N = int(input())
S = input()
if N % 2 == 1:
print("No")
quit()
n = N // 2
yesno = "Yes" if S[:n] == S[n:] else "No"
print(yesno)
if __name__ == "__main__":
main()
|
[
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 662,150
| 662,149
|
u322763702
|
python
|
p02860
|
N=int(input())
S=input()
if S[:N//2]==S[N//2+1:] and N%2==0:
print("Yes")
else:
print("No")
|
N=int(input())
S=input()
if S[:N//2]==S[N//2:] and N%2==0:
print("Yes")
else:
print("No")
|
[
"expression.operation.binary.remove"
] | 662,153
| 662,154
|
u235376569
|
python
|
p02860
|
# input
N = int(input())
S = input()
# check
if N < 2 or N % 2 != 0:
print("No")
if N == 2:
right = S[0]
left = S[1]
else:
c = N // 2
right = S[0:c]
left = S[c:]
if right == left:
print("Yes")
else:
print("No")
|
# input
N = int(input())
S = input()
# check
if N < 2 or N % 2 != 0:
print("No")
else:
if N == 2:
right = S[0]
left = S[1]
else:
c = N // 2
right = S[0:c]
left = S[c:]
if right == left:
print("Yes")
else:
print("No")
|
[] | 662,161
| 662,162
|
u284363684
|
python
|
p02860
|
# input
N = int(input())
S = input()
# check
if N < 2 or N % 2 != 0:
print("No")
if N == 2:
right = S[0]
left = S[1]
else:
c = N // 2
right = S[0:c - 1]
left = S[c:]
if right == left:
print("Yes")
else:
print("No")
|
# input
N = int(input())
S = input()
# check
if N < 2 or N % 2 != 0:
print("No")
else:
if N == 2:
right = S[0]
left = S[1]
else:
c = N // 2
right = S[0:c]
left = S[c:]
if right == left:
print("Yes")
else:
print("No")
|
[
"expression.operation.binary.remove"
] | 662,163
| 662,162
|
u284363684
|
python
|
p02860
|
n=int(input())
s=input()
if n%2!=0:
print("No")
else:
if s[:n//2+1]==s[n//2:]:
print("Yes")
else:
print("No")
|
n=int(input())
s=input()
if n%2!=0:
print("No")
else:
if s[:n//2]==s[n//2:]:
print("Yes")
else:
print("No")
|
[
"expression.operation.binary.remove"
] | 662,168
| 662,169
|
u886902015
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 == 1:
print("No")
if s[0:n//2] == s[n//2:]:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
if n % 2 == 1:
print("No")
else:
if s[0:n//2] == s[n//2:]:
print("Yes")
else:
print("No")
|
[] | 662,176
| 662,177
|
u086702156
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 == 1:
print("No")
if s[0:s/2] == s[s/2:]:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
if n % 2 == 1:
print("No")
else:
if s[0:n//2] == s[n//2:]:
print("Yes")
else:
print("No")
|
[] | 662,178
| 662,177
|
u086702156
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 == 1:
print("No")
if s[0:n/2] == s[n/2:]:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
if n % 2 == 1:
print("No")
else:
if s[0:n//2] == s[n//2:]:
print("Yes")
else:
print("No")
|
[
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 662,179
| 662,177
|
u086702156
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 == 1:
print("No")
elif s[:n/2] == s[n/2:] :
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
if n % 2 == 1:
print("No")
elif s[:n//2] == s[n//2:] :
print("Yes")
else:
print("No")
|
[
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 662,188
| 662,189
|
u904331908
|
python
|
p02860
|
N = int(input())
S = input()
if N % 2 > 0 or S != S[:int(N/2)] + S[:int(N/2)]:
exit("No")
exit("Yes")
|
N = int(input())
S = input()
if N % 2 > 0 or S != S[:int(N/2)] + S[:int(N/2)]:
print("No")
else:
print("Yes")
|
[
"identifier.change",
"call.function.change",
"io.output.change",
"call.add"
] | 662,190
| 662,191
|
u044262241
|
python
|
p02860
|
#a,b,c = map(int,input().split())
a = int(input())
b = input()
c = b[:a//2]
d = b[a//2:a]
print("No" if c == d else "Yes")
|
#a,b,c = map(int,input().split())
a = int(input())
b = input()
c = b[:a//2]
d = b[a//2:a]
print("Yes" if c == d else "No")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 662,193
| 662,194
|
u344959959
|
python
|
p02860
|
#a,b,c = map(int,input().split())
a = int(input())
b = input()
c = s[:a//2]
d = s[a//2:a]
print("No" if c == d else "Yes")
|
#a,b,c = map(int,input().split())
a = int(input())
b = input()
c = b[:a//2]
d = b[a//2:a]
print("Yes" if c == d else "No")
|
[
"assignment.value.change",
"identifier.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 662,195
| 662,194
|
u344959959
|
python
|
p02860
|
n = int(input())
a = input()
if a[:n/2+1]==a[n/2+1:]:
print("Yes")
else:
print("No")
|
n = int(input())
a = input()
if a[:n//2]==a[n//2:]:
print("Yes")
else:
print("No")
|
[
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 662,199
| 662,200
|
u620846115
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 == 1:
print('No')
exit(0)
n = n // 2
a = s[:n]
if a.count(s) == 2:
print('Yes')
else:
print('No')
|
n = int(input())
s = input()
if n % 2 == 1:
print('No')
exit(0)
n = n // 2
a = s[:n]
if s.count(a) == 2:
print('Yes')
else:
print('No')
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 662,203
| 662,204
|
u357751375
|
python
|
p02860
|
N = int(input())
S = list(input())
if N % 2 != 0:
print('No')
for i in range(N//2):
if S[i] == S[i + (N//2)]:
continue
else:
print('No')
exit()
print('Yes')
|
N = int(input())
S = list(input())
if N % 2 != 0:
print('No')
exit()
for i in range(N//2):
if S[i] == S[i + (N//2)]:
continue
else:
print('No')
exit()
print('Yes')
|
[
"call.add"
] | 662,207
| 662,208
|
u498531348
|
python
|
p02860
|
n=int(input())
s=input()
if(n%2==1):
print('No')
exit()
else:
if s[0:n//2]==s[(n//2)+1:n]:
print('Yes')
else:
print("No")
|
n=int(input())
s=input()
if(n%2==1):
print('No')
exit()
else:
if s[0:n//2]==s[(n//2):n]:
print('Yes')
else:
print("No")
|
[
"expression.operation.binary.remove"
] | 662,213
| 662,214
|
u289105044
|
python
|
p02860
|
n=int(input())
s=input()
if(n%2==1):
print('No')
exit()
else:
if s[0:n//2]==s[(n//2)+1:n]:
print('Yes')
else:
print("No")
|
n=int(input())
s=input()
if(n%2==1):
print('No')
exit()
else:
if s[0:n//2]==s[(n//2):n]:
print('Yes')
else:
print("No")
|
[
"expression.operation.binary.remove"
] | 662,215
| 662,214
|
u289105044
|
python
|
p02860
|
n=int(input())
s=input()
if(n%2==1):
print('No')
else:
if s[0:n//2]==s[(n//2)+1:n]:
print('Yes')
else:
print("No")
|
n=int(input())
s=input()
if(n%2==1):
print('No')
exit()
else:
if s[0:n//2]==s[(n//2):n]:
print('Yes')
else:
print("No")
|
[
"call.add",
"expression.operation.binary.remove"
] | 662,216
| 662,214
|
u289105044
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 == 1:
print('No')
exit()
else:
if s[:n // 2] == s[n // 2 + 1:]:
print('Yes')
else:
print('No')
|
n = int(input())
s = input()
if n % 2 == 1:
print('No')
exit()
else:
if s[:n//2] == s[n//2:]:
print('Yes')
else:
print('No')
|
[
"expression.operation.binary.remove"
] | 662,222
| 662,223
|
u363421241
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 == 1:
print('No')
else:
if s[:n//2] == s[n//2+1:]:
print('Yes')
else:
print('No')
|
n = int(input())
s = input()
if n % 2 == 1:
print('No')
exit()
else:
if s[:n//2] == s[n//2:]:
print('Yes')
else:
print('No')
|
[
"call.add",
"expression.operation.binary.remove"
] | 662,224
| 662,223
|
u363421241
|
python
|
p02860
|
r = int(input())
s = input()
if r%2 == 1:
print("No")
m = str(s[0:r//2])
if m*2 == s:print('Yes')
else:print('No')
|
r = int(input())
s = input()
if r%2 == 1:
print("No")
exit()
m = str(s[0:r//2])
if m*2 == s:print('Yes')
else:print('No')
|
[
"call.add"
] | 662,229
| 662,230
|
u773440446
|
python
|
p02860
|
n = str(input())
if len(n) % 2 == 1:
print('No')
else:
a = n[0 : len(n)//2]
b = n[len(n)//2 : len(n)]
if a == b:
print('Yes')
else:
print('No')
|
nn = input()
n = str(input())
if len(n) % 2 == 1:
print('No')
else:
a = n[0 : len(n)//2]
b = n[len(n)//2 : len(n)]
if a == b:
print('Yes')
else:
print('No')
|
[
"assignment.add"
] | 662,231
| 662,232
|
u029568245
|
python
|
p02860
|
N=int(input())
S=input()
if N%2!=0:
print('No')
for i in range(int(N/2)):
if S[i]!=S[int(N/2)+i]:
print('No')
exit()
print('Yes')
|
N=int(input())
S=input()
if N%2!=0:
print('No')
exit()
for i in range(int(N/2)):
if S[i]!=S[int(N/2)+i]:
print('No')
exit()
print('Yes')
|
[
"call.add"
] | 662,234
| 662,235
|
u827261928
|
python
|
p02860
|
N = int(input())
S = input()
if(print (S[:(N//2)]) == print (S[(N//2):])):
print("Yes")
else:
print("No")
|
N = int(input())
S = input()
if(S[:(N//2)] == S[(N//2):]):
print("Yes")
else:
print("No")
|
[
"control_flow.branch.if.condition.change",
"call.remove"
] | 662,242
| 662,243
|
u907865484
|
python
|
p02860
|
n = int(input())
s = input()
for i in range((n//2)+1):
if s[i] == s[i+(n//2)]:
c+= 1
if c*2 == n:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
c = 0
for i in range((n//2)):
if s[i] == s[i+(n//2)]:
c+= 1
if c*2 == n:
print("Yes")
else:
print("No")
|
[
"expression.operation.binary.remove"
] | 662,252
| 662,253
|
u617953889
|
python
|
p02860
|
N=int(input())
S=input()
if N%2==1:
print('No')
exit()
n=N//2
for i in range(n):
if S[i]!=S[n+i]:
print('No')
else:
print('Yes')
|
N=int(input())
S=input()
if N%2==1:
print('No')
exit()
n=N//2
for i in range(n):
if S[i]!=S[n+i]:
print('No')
break
else:
print('Yes')
|
[
"control_flow.break.add"
] | 662,254
| 662,255
|
u752774573
|
python
|
p02860
|
s = input()
if len(s) % 2 != 0:
print('No')
else:
s1 = s[:len(s)//2]
s2 = s[len(s)//2:]
if s1 == s2:
print('Yes')
else:
print('No')
|
i = input()
s = input()
if len(s) % 2 != 0:
print('No')
else:
s1 = s[:len(s)//2]
s2 = s[len(s)//2:]
if s1 == s2:
print('Yes')
else:
print('No')
|
[
"assignment.add"
] | 662,280
| 662,281
|
u763177133
|
python
|
p02860
|
N = int(input())
S = str(input())
if N % 2 == 0:
NN = int(N/2)
for i in range(0, NN):
if S[i] != S[i+NN]:
print('No')
else:
print('Yes')
else:
print('No')
|
N = int(input())
S = str(input())
if N % 2 == 0:
NN = int(N/2)
for i in range(0, NN):
if S[i] != S[i+NN]:
print('No')
break
else:
print('Yes')
else:
print('No')
|
[
"control_flow.break.add"
] | 662,302
| 662,303
|
u967822229
|
python
|
p02860
|
N = int(input())
S = str(input())
if N % 2 == 0:
NN = N/2
for i in range(0, NN):
if S[i] != S[i+NN]:
print('No')
else:
print('Yes')
else:
print('No')
|
N = int(input())
S = str(input())
if N % 2 == 0:
NN = int(N/2)
for i in range(0, NN):
if S[i] != S[i+NN]:
print('No')
break
else:
print('Yes')
else:
print('No')
|
[
"call.add",
"call.arguments.change",
"control_flow.break.add"
] | 662,304
| 662,303
|
u967822229
|
python
|
p02860
|
N = int(input())
str = input()
if len(str) % 2 != 0:
print("No")
elif str[:int(len(str)/2)] != str[int(len(str)/2) + 1:]:
print("No")
else:
print("Yes")
|
N = int(input())
str = input()
if len(str) % 2 != 0:
print("No")
elif str[:int(len(str)/2)] != str[int(len(str)/2):]:
print("No")
else:
print("Yes")
|
[
"expression.operation.binary.remove"
] | 662,305
| 662,306
|
u739843002
|
python
|
p02860
|
N = int(input())
S = input()
if N%2==1:
print('No')
else:
for i in range (N//2):
if S[i]!=S[N//2+i]:
print('No')
exit()
print('Yes')
|
N = int(input())
S = input()
if N%2==1:
print('No')
exit()
else:
for i in range (N//2):
if S[i]!=S[N//2+i]:
print('No')
exit()
print('Yes')
|
[
"call.add"
] | 662,311
| 662,312
|
u779293207
|
python
|
p02860
|
N = int(input())
s = input()
if N%2 != 0:
print('No')
else:
x = N//2
if s[1:x] == s[x+1:N]:
print('Yes')
else:
print('No')
|
N = int(input())
s = input()
if N%2 != 0:
print('No')
else:
x = N//2
if s[0:x] == s[x:]:
print('Yes')
else:
print('No')
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 662,348
| 662,349
|
u067273593
|
python
|
p02860
|
N = int(input())
S = input()
is_even = N % 2 == 0
S1 = S[0:int(len(S) / 2)]
S2 = S[int(len(S) / 2):]
answer = True if is_even and S1 == S2 else False
print(answer)
|
N = int(input())
S = input()
is_even = N % 2 == 0
S1 = S[0:int(len(S) / 2)]
S2 = S[int(len(S) / 2):]
answer = 'Yes' if is_even and S1 == S2 else 'No'
print(answer)
|
[
"assignment.value.change"
] | 662,354
| 662,355
|
u017624958
|
python
|
p02860
|
n = int(input())
s = input()
if n%2 == 1:
print("No")
exit
slise = (n/2)
a = s[:int(slise)]
b = s[int(slise):]
if a==b:
print("Yes")
else:
print("No")
|
import sys
n = int(input())
s = input()
if n%2 == 1:
print("No")
sys.exit()
slise = (n/2)
a = s[:int(slise)]
b = s[int(slise):]
if a==b:
print("Yes")
else:
print("No")
|
[
"call.add"
] | 662,356
| 662,357
|
u586822112
|
python
|
p02860
|
n=int(input())
s=input()
if n%2==0:
if s[0:n//2]==s[n//2:-1]:
print("Yes")
else:
print("No")
else:
print("No")
|
n=int(input())
s=input()
if n%2==0:
if s[0:n//2]==s[n//2:]:
print("Yes")
else:
print("No")
else:
print("No")
|
[] | 662,363
| 662,364
|
u907446975
|
python
|
p02860
|
n = int(input())
s = input()
sss = len(s) // 2
if sss == 1:
print("No")
else:
a = s[:int(len(s)/2)]
if a*2 == s:
print("Yes")
else:
print("NO")
|
n = int(input())
s = input()
sss = len(s) % 2
if sss == 1:
print("No")
else:
a = s[:int(len(s)/2)]
if a*2 == s:
print("Yes")
else:
print("No")
|
[
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 662,376
| 662,377
|
u573234244
|
python
|
p02860
|
n = int(input())
s = input()
sss = len(s) // 2
if sss == 1:
print("No")
else:
a = s[:int(len(s)/2)]
if a*2 == s:
print("Yes")
else:
print("NO")
|
n = int(input())
s = input()
sss = len(s) % 2
if sss == 1:
print("No")
else:
a = s[:int(len(s)/2)]
if a*2 == s:
print("Yes")
else:
print("No")
|
[
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 662,378
| 662,377
|
u573234244
|
python
|
p02860
|
N = int(input())
S = input()
if N%2 != 0:
print('No')
else:
if S[0:N//2] == S[N//2:N]:
print('Yes')
print('No')
|
N = int(input())
S = input()
if N%2 != 0:
print('No')
else:
if S[0:N//2] == S[N//2:N]:
print('Yes')
else:
print('No')
|
[] | 662,379
| 662,380
|
u617037231
|
python
|
p02860
|
N = int(input())
S = list(input())
if N // 2 == 1:
print('No')
elif S[0:N//2] == S[N//2:-1]:
print('Yes')
else:
print('No')
|
N = int(input())
S = list(input())
if N % 2 == 1:
print('No')
elif S[:N//2] == S[N//2:]:
print('Yes')
else:
print('No')
|
[
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 662,381
| 662,382
|
u526094365
|
python
|
p02860
|
x=int(input())
t=int(x/2)
y=str(input())
if x%2!=0:
print("No")
exit()
for i in range(x):
if y[i]!=y[i+x]:
print("No")
exit()
print("Yes")
|
x=int(input())
t=int(x/2)
y=str(input())
if x%2!=0:
print("No")
exit()
for i in range(t):
if y[i]!=y[i+t]:
print("No")
exit()
print("Yes")
|
[
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 662,390
| 662,391
|
u049725710
|
python
|
p02860
|
N = int(input())
S = input()
if N % 2 == 1:
print('No')
else:
for i in range(N//2):
if S[i] != S[i + N //2]:
print('No')
exit(0)
else:
print('Yes')
|
N = int(input())
S = input()
if N % 2 == 1:
print('No')
else:
for i in range(N//2):
if S[i] != S[i + N //2]:
print('No')
exit(0)
print('Yes')
|
[] | 662,408
| 662,409
|
u699944218
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 != 0:
print("No")
elif s[0:(n/2)] == s[(n/2):n]:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
if n % 2 != 0:
print("No")
elif s[0:(n//2)] == s[(n//2):n]:
print("Yes")
else:
print("No")
|
[
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 662,428
| 662,429
|
u230900948
|
python
|
p02860
|
N=int(input())
S=input()
if N%2==0:
if S[:N/2]==S[N/2:]:
print("Yes")
exit()
print("No")
|
N=int(input())
S=input()
if N%2==0:
if S[:int(N/2)]==S[int(N/2):]:
print("Yes")
exit()
print("No")
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 662,445
| 662,446
|
u998262711
|
python
|
p02860
|
n = int(input())
s = input()
if print(s[0:n//2]) == print(s[n//2:]):
print('Yes')
else:
print('No')
|
n = int(input())
s = input()
if s[0:n//2] == s[n//2:]:
print('Yes')
else:
print('No')
|
[
"call.remove",
"control_flow.branch.if.condition.change"
] | 662,453
| 662,454
|
u804733539
|
python
|
p02860
|
s = [input() for i in range(2)]
N = int(s[0])
S = s[1]
if N % 2 > 0:
print('No')
hN = N // 2
if S[:hN] == S[hN:N -1]:
print('Yes')
else:
print('No')
|
s = [input() for i in range(2)]
N = int(s[0])
S = s[1]
if N % 2 > 0:
print('No')
else:
hN = N // 2
if S[:hN] == S[hN:N]:
print('Yes')
else:
print('No')
|
[
"expression.operation.binary.remove"
] | 662,481
| 662,482
|
u898271416
|
python
|
p02860
|
N = int(input())
S = input()
ans = "No"
if N%2 == 0:
if S[:N//2-1] * 2 == S:
ans = "Yes"
print(ans)
|
N = int(input())
S = input()
ans = "No"
if N%2 == 0:
if S[:N//2] * 2 == S:
ans = "Yes"
print(ans)
|
[
"expression.operation.binary.remove"
] | 662,486
| 662,487
|
u985963315
|
python
|
p02860
|
n=int(input())
s=input()
ans="No"
if n%2==0 and s[:n//2+1]==s[n//2+1]:
ans="Yes"
print(ans)
|
n=int(input())
s=input()
ans="No"
if n%2==0 and s[:n//2]==s[n//2:]:
ans="Yes"
print(ans)
|
[
"expression.operation.binary.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 662,494
| 662,495
|
u217627525
|
python
|
p02860
|
N = int(input())
S = input()
if (N%2) != 0:
print('NO')
elif(S[:(N//2)]==S[(N//2):]):
print('YES')
else:
print('NO')
|
N = int(input())
S = input()
if (N%2) != 0:
print('No')
elif(S[:(N//2)]==S[(N//2):]):
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 662,500
| 662,501
|
u071002307
|
python
|
p02860
|
n = int(input())
s = input()
if n//2: print("No")
else:
if s[:n//2] == s[n//2:]:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
if n%2: print("No")
else:
if s[:n//2] == s[n//2:]:
print("Yes")
else:
print("No")
|
[
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 662,505
| 662,506
|
u272075541
|
python
|
p02860
|
n = int(input())
s = int(input())
#a = list(map(int,input().split()))
if n % 2 != 0 :
print("No")
else:
mae = s[0:int(n/2)]
usi = s[int(n/2):]
if mae == usi :
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
#a = list(map(int,input().split()))
if n % 2 != 0 :
print("No")
else:
mae = s[0:int(n/2)]
usi = s[int(n/2):]
if mae == usi :
print("Yes")
else:
print("No")
|
[
"call.remove",
"call.arguments.change"
] | 662,509
| 662,510
|
u572012241
|
python
|
p02860
|
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(input())//2
S = input().decode()
ans = "Yes "if S[:N] == S[N:] else "No"
print(ans)
|
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(input())//2
S = input().rstrip().decode()
ans = "Yes "if S[:N] == S[N:] else "No"
print(ans)
|
[] | 662,511
| 662,512
|
u581187895
|
python
|
p02860
|
n = int(input())
s = input()
ans = "No"
if n % 2 == 0:
ans = "Yes"
for i in range(n / 2):
if s[i] != s[n / 2 + i]:
ans = "No"
break
print(ans)
|
n = int(input())
s = input()
ans = "No"
if n % 2 == 0:
ans = "Yes"
for i in range(n // 2):
if s[i] != s[n // 2 + i]:
ans = "No"
break
print(ans)
|
[
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 662,515
| 662,516
|
u277312083
|
python
|
p02860
|
n = int(input())
s = str(input())
if s[:(n//2)] == s[n:]:
print("Yes")
else:
print("No")
|
n = int(input())
s = str(input())
if s[:(n//2)] == s[n//2:]:
print("Yes")
else:
print("No")
|
[
"control_flow.branch.if.condition.change"
] | 662,527
| 662,528
|
u135389999
|
python
|
p02860
|
n = int(input())
s = input()
ans = "Yes" if (n & 1) and s[0:int(n / 2)] == s[int(n / 2):n] else "No"
print(ans)
|
n = int(input())
s = input()
ans = "Yes" if (n ^ 1) and s[0:int(n / 2)] == s[int(n / 2):n] else "No"
print(ans)
|
[
"assignment.value.change",
"expression.operation.binary.change"
] | 662,552
| 662,553
|
u745243184
|
python
|
p02856
|
# https://atcoder.jp/contests/ddcc2020-qual/tasks/ddcc2020_qual_d
import sys
input=sys.stdin.readline
def main():
M=int(input())
dc=[tuple(map(int,input().split())) for i in range(M)]
ans=0
n=0
for i in range(M):
n+=dc[i][0]*dc[i][1]
ans+=dc[i][1]
ans-=1
def aint(x):
ret=0
cnt=0
while(x>0):
cnt+=1
ret+=x//10
x//=10
cnt-=1
return int(ret)-cnt
if n>=10:
ans+=aint(n)
while(n>=10):
ns=str(n)
n=0
for i in range(10):
c=ns.count(chr(i+ord("0")))
n+=i*c
ans+=len(ns)-1
if n>=10:
ans+=aint(n)-1
print(ans)
if __name__=="__main__":
main()
|
# https://atcoder.jp/contests/ddcc2020-qual/tasks/ddcc2020_qual_d
import sys
input=sys.stdin.readline
def main():
M=int(input())
dc=[tuple(map(int,input().split())) for i in range(M)]
ans=0
n=0
for i in range(M):
n+=dc[i][0]*dc[i][1]
ans+=dc[i][1]
ans-=1
def aint(x):
ret=0
cnt=0
while(x>0):
cnt+=1
ret+=x//10
x//=10
cnt-=1
return int(ret)-cnt
if n>=10:
ans+=aint(n)
while(n>=10):
ns=str(n)
n=0
for i in range(10):
c=ns.count(chr(i+ord("0")))
n+=i*c
ans+=len(ns)-1
if n>=10:
ans+=aint(n)
print(ans)
if __name__=="__main__":
main()
|
[
"expression.operation.binary.remove"
] | 662,559
| 662,560
|
u847923740
|
python
|
p02856
|
n=int(input())
import sys
d=0
now=0
input=sys.stdin.readline
for i in range(n):
a,b=map(int,input().split())
now+=a*b
d+=b
print(now//9+d-1)
|
n=int(input())
import sys
d=0
now=0
input=sys.stdin.readline
for i in range(n):
a,b=map(int,input().split())
now+=a*b
d+=b
print((now-1)//9+d-1)
|
[
"call.arguments.change"
] | 662,576
| 662,577
|
u769870836
|
python
|
p02856
|
m = int(input())
d = [0] * m
c = [0] * m
for i in range(m):
d[i], c[i] = map(int, input().split())
print((sum(c)-1+sum([c[i]*d[i] for i in range(m)]-1)//9) % 1000000007)
|
m = int(input())
d = [0] * m
c = [0] * m
for i in range(m):
d[i], c[i] = map(int, input().split())
print(sum(c)-1+(sum([c[i]*d[i] for i in range(m)])-1)//9)
|
[
"call.arguments.change"
] | 662,582
| 662,581
|
u372550522
|
python
|
p02856
|
import sys
sys.stdin.readline
def main():
m = int(input())
a = [list(map(int, input().split())) for _ in range(m)]
wa = 0
length = 0
for i,j in a:
wa += i*j
length += j
print(wa,length)
print(length-1+(wa-1)//9)
if __name__=="__main__":
main()
|
import sys
sys.stdin.readline
def main():
m = int(input())
a = [list(map(int, input().split())) for _ in range(m)]
wa = 0
length = 0
for i,j in a:
wa += i*j
length += j
#print(wa,length)
print(length-1+(wa-1)//9)
if __name__=="__main__":
main()
|
[
"call.remove"
] | 662,595
| 662,596
|
u262597910
|
python
|
p02856
|
import sys
read = sys.stdin.buffer.read
input = sys.stdin.readline
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode('utf-8')
#2234
#import numpy as np
def main():
m=II()
di=0
su=0
for _ in range(m):
d,c=MI()
di+=c
su+=d*c
print(su//9+di-1)
if __name__ == "__main__":
main()
|
import sys
read = sys.stdin.buffer.read
input = sys.stdin.readline
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode('utf-8')
#2234
#import numpy as np
def main():
m=II()
di=0
su=0
for _ in range(m):
d,c=MI()
di+=c
su+=d*c
print((su-1)//9+di-1)
if __name__ == "__main__":
main()
|
[
"call.arguments.change"
] | 662,599
| 662,600
|
u477977638
|
python
|
p02856
|
import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print('\n'.join(map(str,x)))
def printline(x):print(' '.join(map(str,x)))
m = readint()
a = 0
b = 0
for i in range(m):
d,c = readints()
a+=c
b+=c*d
print(a-1+b//10)
|
import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print('\n'.join(map(str,x)))
def printline(x):print(' '.join(map(str,x)))
m = readint()
a = 0
b = 0
for i in range(m):
d,c = readints()
a+=c
b+=c*d
print(a-1+(b-1)//9)
|
[
"call.arguments.change",
"literal.number.integer.change",
"expression.operation.binary.change",
"io.output.change"
] | 662,607
| 662,608
|
u190405389
|
python
|
p02856
|
n = int(input())
dc=[list(map(int,input().split())) for i in range(n)]
sm=0
cnt=0
for tmp in dc:
d,c=tmp
cnt+=c
sm+=d*c
print(cnt-1 + sm//10)
|
n = int(input())
dc=[list(map(int,input().split())) for i in range(n)]
sm=0
cnt=0
for tmp in dc:
d,c=tmp
cnt+=c
sm+=d*c
print(cnt-1 + (sm-1)//9)
|
[
"call.arguments.change",
"call.arguments.add"
] | 662,637
| 662,638
|
u358254559
|
python
|
p02856
|
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
M = int(input())
Dsum = 0
digit = 0
for _ in range(M):
d, c = map(int, input().split())
Dsum += d
digit += c
ans = digit - 1
div, mod = divmod(Dsum, 9)
if mod:
ans += div
else:
ans += div - 1
print(ans)
|
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
M = int(input())
Dsum = 0
digit = 0
for _ in range(M):
d, c = map(int, input().split())
Dsum += d * c
digit += c
ans = digit - 1
div, mod = divmod(Dsum, 9)
if mod:
ans += div
else:
ans += div - 1
print(ans)
|
[
"expression.operation.binary.add"
] | 662,653
| 662,654
|
u994988729
|
python
|
p02856
|
import sys
def main():
input = sys.stdin.readline
M=int(input())
DC=[tuple(map(int, input().split())) for _ in range(M)]
Dsum=sum(d*c for d,c in DC)
Csum=sum(c for d,c in DC)
print(Csum-1 + Dsum//9)
if __name__ == '__main__':
main()
|
import sys
def main():
input = sys.stdin.readline
M=int(input())
DC=[tuple(map(int, input().split())) for _ in range(M)]
Dsum=sum(d*c for d,c in DC)
Csum=sum(c for d,c in DC)
print(Csum-1 + (Dsum-1)//9)
if __name__ == '__main__':
main()
|
[
"call.arguments.change"
] | 662,655
| 662,656
|
u852690916
|
python
|
p02856
|
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
M=I()
dig=0
S=0
for i in range(M):
d,c=MI()
dig+=c
S+=d*c
print(dig-1+(S)//9)
main()
|
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
M=I()
dig=0
S=0
for i in range(M):
d,c=MI()
dig+=c
S+=d*c
print(dig-1+(S-1)//9)
main()
|
[
"expression.operation.binary.add"
] | 662,657
| 662,658
|
u498487134
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.