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 |
|---|---|---|---|---|---|---|---|
p02836 | S = input()
len_S = len(S)
c = 0
s = len_S // 2
for i in range(s-1):
if S[i] is not S[len_S-1 -i]:
c += 1
print(c)
| S = input()
len_S = len(S)
c = 0
s = len_S // 2
for i in range(s):
if S[i] is not S[len_S-1 -i]:
c += 1
print(c)
| [
"expression.operation.binary.remove"
] | 640,791 | 640,792 | u170410075 | python |
p02836 | S = input()
len_S = len(S)
c = 0
s = len_S // 2
for i in range(s-1):
if S[i] != S[len_S-1 -i]:
c += 1
print(c)
| S = input()
len_S = len(S)
c = 0
s = len_S // 2
for i in range(s):
if S[i] is not S[len_S-1 -i]:
c += 1
print(c)
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 640,793 | 640,792 | u170410075 | python |
p02836 | def palin(S):
lst = list(S)
num = len(lst)//2
count = 0
for i in range(num):
if not lst[i] == lst[-i-1]:
count += 1
return count
S = input()
palin(S) | def palin(S):
lst = list(S)
num = len(lst)//2
count = 0
for i in range(num):
if not lst[i] == lst[-i-1]:
count += 1
return count
S = input()
print(palin(S)) | [
"call.add",
"call.arguments.change"
] | 640,796 | 640,797 | u590647174 | python |
p02836 | s = input()
c = 0
first, second = s[:len(s)//2], s[(len(s)+1)//2:]
if first == reversed(second):
print(c)
else:
for x in range(len(first)):
if first[x] != second[len(second)-x-1]:
count += 1
print(c) | s = input()
c = 0
first, second = s[:len(s)//2], s[(len(s)+1)//2:]
if first == reversed(second):
print(c)
else:
for x in range(len(first)):
if first[x] != second[len(second)-x-1]:
c += 1
print(c) | [
"identifier.change"
] | 640,798 | 640,799 | u958207414 | python |
p02836 | S=int(input())
count = 0
l=[]
l = list(S)
a = len(l)
b = a - 1
for i in range(a):
if l[i] != l[b-i]:
count = count + 1
count = count/2
print(int(count)) | S=str(input())
count = 0
l=[]
l = list(S)
a = len(l)
b = a - 1
for i in range(a):
if l[i] != l[b-i]:
count = count + 1
count = count/2
print(int(count)) | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 640,807 | 640,808 | u137316733 | python |
p02836 | S=input()
l=len(S)
count=0
if l%2==0:
for i in range(l//2):
if S[i]!=S[(l-1)-i]:
count+=1
else:
for j in range((l-1)//2):
if S[j]!=S[(j-1)-j]:
count+=1
print(count)
| S=input()
l=len(S)
count=0
if l%2==0:
for i in range(l//2):
if S[i]!=S[(l-1)-i]:
count+=1
else:
for j in range((l-1)//2):
if S[j]!=S[(-1)-j]:
count+=1
print(count)
| [
"control_flow.branch.if.condition.change"
] | 640,811 | 640,812 | u523545435 | python |
p02836 | import math
N = list(input())
def is_even(num):
if num % 2 == 0:
return True
else:
return False
change_num = math.floor(len(N) / 2)
ans = 0
count = 1
for i in N[:change_num]:
if N[-count] != i:
ans += 1
print(ans) | import math
N = list(input())
def is_even(num):
if num % 2 == 0:
return True
else:
return False
change_num = math.floor(len(N) / 2)
ans = 0
count = 1
for i in N[:change_num]:
if N[-count] != i:
ans += 1
count += 1
print(ans) | [] | 640,822 | 640,823 | u140191608 | python |
p02836 | import math
s = input()
n = len(s)
l = math.floor(n/2)
if n % 2 == 0:
k = l
else:
k = l+1
s_f = s[:l]
s_r = s[k:]
j = 0
for i in [0,l-1]:
if s_f[i] != s_r[(l-1)-i]:
j+=1
print(j) | import math
s = input()
n = len(s)
l = math.floor(n/2)
if n % 2 == 0:
k = l
else:
k = l+1
s_f = s[:l]
s_r = s[k:]
j = 0
#print(s_f)
#print(s_r)
for i in range(0,l):
if s_f[i] != s_r[(l-1)-i]:
#print(s_f[i] + " " + s_r[(l-1)-i])
j+=1
print(j) | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.change"
] | 640,828 | 640,829 | u477915050 | python |
p02836 | s=list(input())
n=len(s)
cnt=0
for i in range(n//2):
if s[i] != s[n-i]: cnt+=1
print(cnt) | s=list(input())
n=len(s)
cnt=0
for i in range(n//2):
if s[i] != s[n-i-1]: cnt+=1
print(cnt)
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 640,838 | 640,839 | u148218179 | python |
p02836 | a=input().strip()
x=len(a)
x1=x//2
c=0
for i in range(x1+1):
if a[i]!=a[x-1-i]:
c+=1
print(c)
| a=input().strip()
x=len(a)
x1=x//2
c=0
for i in range(x1):
if a[i]!=a[x-1-i]:
c+=1
print(c)
| [
"expression.operation.binary.remove"
] | 640,842 | 640,843 | u719238648 | python |
p02836 | x=[i for i in input()]
count=0
if len(x)%2!=0:
x.pop(len(x)//2+1)
P =[p for p in range(0,len(x)//2)]
Q =[q for q in range(len(x)//2,len(x))]
Q.sort(reverse=True)
for a,b in zip(P,Q):
if x[a]!=x[b]:
count+=1
print(count) | x=[i for i in input()]
count=0
if len(x)%2!=0:
x.pop(len(x)//2)
P =[p for p in range(0,len(x)//2)]
Q =[q for q in range(len(x)//2,len(x))]
Q.sort(reverse=True)
for a,b in zip(P,Q):
if x[a]!=x[b]:
count+=1
print(count)
| [
"expression.operation.binary.remove"
] | 640,855 | 640,856 | u441320782 | python |
p02836 | S=list(map(str,input()))
N=len(S)
cnt=0
SR=S[:]
SR.reverse()
print(*SR)
for i in range(N):
if S[i]!=SR[i]:
cnt=cnt+1
print(cnt//2) | S=list(map(str,input()))
N=len(S)
cnt=0
SR=S[:]
SR.reverse()
#print(*SR)
for i in range(N):
if S[i]!=SR[i]:
cnt=cnt+1
print(cnt//2) | [
"call.remove"
] | 640,857 | 640,858 | u141574039 | python |
p02836 | S = input()
rev = S[::-1]
l = int(len(S)/2)
front = S[0:l]
back = rev[0:l]
cnt = 0
moji = 0
for s in front:
if front[cnt] == back[cnt]:
moji += 1
cnt += 1
ans = len - moji
print(ans) | S = input() #ここで標準入力
rev = S[::-1]
l = int(len(S)/2)
front = S[0:l]
back = rev[0:l]
cnt = 0
moji = 0
for s in front:
if front[cnt] == back[cnt]:
moji += 1
cnt += 1
ans = l - moji
print(ans) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 640,861 | 640,862 | u760107660 | python |
p02836 | import math
import random
from operator import itemgetter
import re
import sys
from itertools import accumulate
from collections import defaultdict
from collections import deque
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import gcd
from copy import deepcopy
input = sys.stdin.read... | import math
import random
from operator import itemgetter
import re
import sys
from itertools import accumulate
from collections import defaultdict
from collections import deque
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import gcd
from copy import deepcopy
input = sys.stdin.read... | [
"call.add"
] | 640,863 | 640,864 | u513900925 | python |
p02836 | A = list(input())
B = list(reversed(A))
S = 0
for i in range((len(A)-1)//2):
if A[i] != B[i]:
S += 1
print(S) | A = list(input())
B = list(reversed(A))
S = 0
for i in range((len(A)+1)//2):
if A[i] != B[i]:
S += 1
print(S) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 640,866 | 640,867 | u349014049 | python |
p02836 | Y=str(input())#1行に沢山の数値(または文字)が並んでいる場合にリストに格納していく
X=[]
X=list(Y) #数値YをリストXに格納
print(X)
n=len(X)
m=0
if n%2==0:
for i in range (0,n):
if X[i]==X[n-i-1]:
m=m+1
else:
m=m
a=(n-m)/2
elif n%2==1:
for i in range(0,n):
if X[i]==X[n-i-1]:
m=m+1
els... | Y=str(input())#1行に沢山の数値(または文字)が並んでいる場合にリストに格納していく
X=[]
X=list(Y) #数値YをリストXに格納
n=len(X)
m=0
if n%2==0:
for i in range (0,n):
if X[i]==X[n-i-1]:
m=m+1
else:
m=m
a=(n-m)/2
elif n%2==1:
for i in range(0,n):
if X[i]==X[n-i-1]:
m=m+1
else:
... | [
"call.remove"
] | 640,868 | 640,869 | u460647387 | python |
p02836 | S=input()
hug=0
for i in range(len(S)//2):
if S[i]!=S[-i]:
hug+=1
print(hug) | S=input()
hug=0
for i in range(len(S)//2):
if S[i]!=S[len(S)-i-1]:
hug+=1
print(hug) | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"misc.off_by_one"
] | 640,872 | 640,873 | u708890186 | python |
p02836 | a = input()
l = []
c = 0
for i in a:
l.append(a)
n = len(a) // 2
for i in range(n):
if l[i] != l[len(l) - i-1]:
c += 1
print(c) | a = input()
l = []
c = 0
for i in a:
l.append(i)
n = len(a) // 2
for i in range(n):
if l[i] != l[len(l) - i-1]:
c += 1
print(c) | [
"identifier.change",
"call.arguments.change"
] | 640,885 | 640,886 | u406405116 | python |
p02836 | a = input()
l = []
c = 0
for i in a:
l.append(a)
n = len(a) // 2
for i in range(n):
if l[i] != l[len(l) - i-1]:
c += 1 | a = input()
l = []
c = 0
for i in a:
l.append(i)
n = len(a) // 2
for i in range(n):
if l[i] != l[len(l) - i-1]:
c += 1
print(c) | [
"identifier.change",
"call.arguments.change",
"call.add"
] | 640,887 | 640,886 | u406405116 | python |
p02836 | s = input()
n = len(s) // 2
sf = s[0:n]
ss = s[::-1]
sb = ss[0:n]
print(sf, sb)
cnt = 0
for i in range(n):
if sf[i] != sb[i]:
cnt += 1
print(cnt) | s = input()
n = len(s) // 2
sf = s[0:n]
ss = s[::-1]
sb = ss[0:n]
cnt = 0
for i in range(n):
if sf[i] != sb[i]:
cnt += 1
print(cnt)
| [
"call.remove"
] | 640,890 | 640,891 | u782790173 | python |
p02836 | str = input()
count = 0
for i in range(int(len(str)/2)):
if str[i] !=str[-i + 1]:
count += 1
print(count) | str = input()
count = 0
for i in range(int(len(str)/2)):
if str[i] !=str[-i - 1]:
count += 1
print(count) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 640,902 | 640,903 | u386089098 | python |
p02836 | a =list(input())
b =int(int(len(a))/2)
ans =0
n = -1
for i in range(b):
if a[i] == a[n]:
n += -1
else:
ans += 1
print(ans) | a =list(input())
b =int(int(len(a))/2)
ans =0
n = -1
for i in range(b):
if a[i] == a[n]:
n += -1
else:
ans += 1
n += -1
print(ans) | [] | 640,906 | 640,907 | u039319269 | python |
p02836 | S = input()
S = "abcdabc"
LIST = list(S) #リストにすると、1文字毎に分割される。
lengs = len(LIST) #リス
count = int(0)
c = lengs // 2
#中央は回文に必要ない要素なので処理しなくてもよい。
for i in range(c):
#print(LIST[i])
#print(LIST[lengs-i-1])
#print("ばばばば")
if LIST[i] == LIST[lengs-i-1]:
count = count
else:
count = coun... | S = input()
LIST = list(S) #リストにすると、1文字毎に分割される。
lengs = len(LIST) #リス
count = int(0)
c = lengs // 2
#中央は回文に必要ない要素なので処理しなくてもよい。
for i in range(c):
#print(LIST[i])
#print(LIST[lengs-i-1])
#print("ばばばば")
if LIST[i] == LIST[lengs-i-1]:
count = count
else:
count = count + 1
pri... | [
"assignment.remove"
] | 640,910 | 640,911 | u679236042 | python |
p02836 | #!/usr/bin/env python3
import sys
s = stdin.readline().strip()
sl = len(s)
cnt = 0
for i in range(sl//2):
if s[i]!=s[sl-1-i]:
cnt += 1
print(cnt) | #!/usr/bin/env python3
from sys import stdin
s = stdin.readline().strip()
sl = len(s)
cnt = 0
for i in range(sl//2):
if s[i]!=s[sl-1-i]:
cnt += 1
print(cnt) | [] | 640,912 | 640,913 | u192058345 | python |
p02836 | import sys.stdin
s = stdin.readline().strip()
sl = len(s)
cnt = 0
for i in range(sl//2):
if s[i]!=s[sl-1-i]:
cnt += 1
print(cnt) | #!/usr/bin/env python3
from sys import stdin
s = stdin.readline().strip()
sl = len(s)
cnt = 0
for i in range(sl//2):
if s[i]!=s[sl-1-i]:
cnt += 1
print(cnt) | [] | 640,914 | 640,913 | u192058345 | python |
p02836 | import sys
s = list(input())
ans = 0
print(s)
if len(s) == 1:
print(0)
sys.exit()
for i in range(len(s)//2):
# print(s[i], s[-i-1])
if s[i] != s[-(i+1)]:
ans += 1
# print(s[i])
# print(len(s)//2-1)
print(ans)
| import sys
s = list(input())
ans = 0
# print(s)
if len(s) == 1:
print(0)
sys.exit()
for i in range(len(s)//2):
# print(s[i], s[-i-1])
if s[i] != s[-(i+1)]:
ans += 1
# print(s[i])
# print(len(s)//2-1)
print(ans)
| [
"call.remove"
] | 640,925 | 640,926 | u738898077 | python |
p02836 | n = input()
index = 0
count = 0
while True:
if len(n) / 2 < index:
break
if n[index] != n[(index*-1) - 1]:
count += 1
index += 1
print(count) | n = input()
index = 0
count = 0
while True:
if len(n) / 2 <= index:
break
if n[index] != n[(index*-1) - 1]:
count += 1
index += 1
print(count) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 640,939 | 640,940 | u278260778 | python |
p02836 | kaibun = input()
count = 0
lenstr = len(kaibun)
if lenstr%2 ==0:
left = kaibun[:int(lenstr/2)]
right = kaibun[int(lenstr/2):]
else:
left = kaibun[:math.floor(lenstr/2)]
right = kaibun[math.floor(lenstr/2):]
for i in range(len(left)):
back = -1 * i -1
if left[i] != right[back]:
count+=1
print(count) | import math
kaibun = input()
count = 0
lenstr = len(kaibun)
if lenstr%2 ==0:
left = kaibun[:int(lenstr/2)]
right = kaibun[int(lenstr/2):]
else:
left = kaibun[:math.floor(lenstr/2)]
right = kaibun[math.floor(lenstr/2):]
for i in range(len(left)):
back = -1 * i -1
if left[i] != right[back]:
count+=1
pri... | [] | 640,941 | 640,942 | u149385862 | python |
p02836 | S = input().strip()
N = len(S) // 2
total = 0
for i in range(0, N):
if S[i] != S[N - 1 - i]:
total += 1
print(total)
| S = input().strip()
N = len(S) // 2
total = 0
for i in range(0, N):
if S[i] != S[len(S) - 1 - i]:
total += 1
print(total)
| [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.add"
] | 640,945 | 640,946 | u396205291 | python |
p02836 | import math
if __name__ == "__main__":
S = input()
count = 0
for i in range(math.floor(len(S))):
if S[0+i] != S[-1-i]:
count += 1
print(count)
| import math
if __name__ == "__main__":
S = input()
count = 0
for i in range(math.floor(len(S)/2)):
if S[0+i] != S[-1-i]:
count += 1
print(count)
| [
"expression.operation.binary.add"
] | 640,951 | 640,952 | u932370518 | python |
p02836 | import math
if __name__ == "__main__":
S = input().split()
count = 0
for i in range(math.floor(len(S))):
if S[0+i] != S[-1-i]:
count += 1
print(count)
| import math
if __name__ == "__main__":
S = input()
count = 0
for i in range(math.floor(len(S)/2)):
if S[0+i] != S[-1-i]:
count += 1
print(count)
| [
"expression.operation.binary.add"
] | 640,953 | 640,952 | u932370518 | python |
p02836 |
a = list(input())
b = len(a)
c = int(b/2)
result = []
if b%2 == 0:
A = a[:c]
B = a[c:]
BB = B[::-1]
for v in range(c):
if A[v] != BB[v]:
result.append(v)
else:
x.append(v)
else:
C = a[:c]
D = a[c+1:]
DD = D[::-1]
for v in range(c):
... | a = list(input())
b = len(a)
c = int(b/2)
x = []
result = []
if b%2 == 0:
A = a[:c]
B = a[c:]
BB = B[::-1]
for v in range(c):
if A[v] != BB[v]:
result.append(v)
else:
x.append(v)
else:
C = a[:c]
D = a[c+1:]
DD = D[::-1]
for v in range(c):
... | [
"assignment.add"
] | 640,972 | 640,973 | u046592970 | python |
p02836 | s = list(input())
left = s[: len(s) // 2]
right = s[-1: len(s) // 2: -1]
ans = 0
for i, j in zip(left, right):
if i == j:
pass
else:
ans += 1
print(ans) | s = list(input())
left = s[: len(s) // 2]
right = s[-1: len(s) // 2 - 1: -1]
ans = 0
for i, j in zip(left, right):
if i == j:
pass
else:
ans += 1
print(ans) | [
"assignment.change"
] | 640,981 | 640,982 | u316401642 | python |
p02836 | import math
a = input()
b = a
d = "".join(list(reversed(b)))
ans = 0
c = math.floor(len(a)/2)
if len(a) % 2 == 0:
for i in range(c):
if not b[i] == d[i]:
ans += 1
else:
for i in range(c):
if not b[i] == d[i+c+1]:
ans += 1
print(ans) | import math
a = input()
b = a
d = "".join(list(reversed(b)))
ans = 0
c = math.floor(len(a)/2)
if len(a) % 2 == 0:
for i in range(c):
if not b[i] == d[i]:
ans += 1
else:
for i in range(c):
if not b[i] == d[i]:
ans += 1
print(ans) | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 640,983 | 640,984 | u963343620 | python |
p02836 | s = input()
helf = len(s) // 2
ans = 0
for i in range(helf):
if s[i] == s[-i-1]:
ans += 1
print(ans) | s = input()
helf = len(s) // 2
ans = 0
for i in range(helf):
if s[i] != s[-i-1]:
ans += 1
print(ans) | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 641,001 | 641,002 | u950825280 | python |
p02836 | n = input()
n = list(n)
print(n)
m = len(n)
A = 0
if m % 2 == 0:
K = int(m/2)
a = n[0:K]
n.reverse()
b = n[0:K]
else:
K = int((m - 1) / 2)
a = n[0:K]
n.reverse()
b = n[0:K]
for i, value in enumerate(a):
if value != b[i]:
A = A + 1
print(A) | n = input()
n = list(n)
m = len(n)
A = 0
if m % 2 == 0:
K = int(m/2)
a = n[0:K]
n.reverse()
b = n[0:K]
else:
K = int((m - 1) / 2)
a = n[0:K]
n.reverse()
b = n[0:K]
for i, value in enumerate(a):
if value != b[i]:
A = A + 1
print(A)
| [
"call.remove"
] | 641,012 | 641,013 | u982944976 | python |
p02836 | S = input()
L = len(S)
ans =0
for i in range(L//2):
if S[i] != S[-i]:
ans +=1
print(ans) | S = input()
L = len(S)
ans =0
for i in range(L//2):
if S[i] != S[-1-i]:
ans +=1
print(ans)
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 641,016 | 641,017 | u333945892 | python |
p02836 | n=len(S)
ans=0
for i in range(n//2):
if S[i]!=S[n-i-1]:
ans+=1
print(ans) | S=input()
n=len(S)
ans=0
for i in range(n//2):
if S[i]!=S[n-i-1]:
ans+=1
print(ans) | [
"assignment.add"
] | 641,024 | 641,025 | u765865533 | python |
p02836 | import sys
input = sys.stdin.readline
S=input()
R=list(S)
R.reverse()
R = "".join(R)
l = int(len(S)/2)
rtn=0
for i in range(l):
if S[i]!=R[i]:
rtn+=1
print(rtn) | import sys
input = sys.stdin.readline
S=input().rstrip()
R=list(S)
R.reverse()
R = "".join(R)
l = int(len(S)/2)
rtn=0
for i in range(l):
if S[i]!=R[i]:
rtn+=1
print(rtn) | [
"call.add"
] | 641,032 | 641,033 | u910158862 | python |
p02836 | import sys
input = sys.stdin.readline
S=input()
R=list(S)
R.reverse()
R = "".join(R)
l = int(len(S)/2)
rtn=0
for i in range(l):
if S[i]!=R[i]:
rtn+=1
print(rtn) | import sys
input = sys.stdin.readline
S=input().rstrip()
R=list(S)
R.reverse()
R = "".join(R)
l = int(len(S)/2)
rtn=0
for i in range(l):
if S[i]!=R[i]:
rtn+=1
print(rtn) | [
"call.add"
] | 641,034 | 641,033 | u910158862 | python |
p02836 | import math
S = input()
s = list(S) #文字を一文字ずつリスト格納
count=0
N=int(math.ceil(len(s)/2))
for i in range(N):
if not s[i]==s[N-i-1]:
count+=1
print(count)
|
import math
S = input()
s = list(S) #文字を一文字ずつリスト格納
count=0
N=int(math.ceil(len(s)/2))
for i in range(N):
if not s[i]==s[len(s)-i-1]:
count+=1
print(count)
| [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.add"
] | 641,041 | 641,042 | u432699428 | python |
p02836 | s=input()
c=0
for i in range(int(len(s)/2)):
if s[i] != s[N-1-i]:
c=c+1
print(c) | s=input()
c=0
for i in range(int(len(s)/2)):
if s[i] != s[len(s)-1-i]:
c=c+1
print(c) | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.add"
] | 641,095 | 641,096 | u813569174 | python |
p02836 | from sys import stdin
S = stdin.readline().rstrip()
c = len(S) // 2
ans = 0
print(c)
for i in range(c):
if S[i] != S[len(S) - i - 1]:
ans += 1
print(ans)
| from sys import stdin
S = stdin.readline().rstrip()
c = len(S) // 2
ans = 0
for i in range(c):
if S[i] != S[len(S) - i - 1]:
ans += 1
print(ans)
| [
"call.remove"
] | 641,098 | 641,099 | u390618988 | python |
p02836 | # -*- coding: utf-8 -*-
s = input()
sum = 0
for i in range(len(s)//2):
if s[i] != s[-i]:
sum += 1
print(sum)
| # -*- coding: utf-8 -*-
s = input()
sum = 0
for i in range(len(s)//2):
if s[i] != s[-(i+1)]:
sum += 1
print(sum)
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 641,047 | 641,048 | u326245870 | python |
p02836 | def main():
s = input()
m = len(s)//2
ans = 0
if m%2 == 0:
a = s[:m]
b = s[m:]
for i in range(m):
if b[i] != a[m-i-1]:
ans += 1
print(ans)
else:
a = s[:m]
b = s[m+1:]
for i in range(m):
if b[i] != a[m-i-1... | def main():
s = input()
m = len(s)//2
ans = 0
if len(s)%2 == 0:
a = s[:m]
b = s[m:]
for i in range(m):
if b[i] != a[m-i-1]:
ans += 1
print(ans)
else:
a = s[:m]
b = s[m+1:]
for i in range(m):
if b[i] != a[... | [
"control_flow.branch.if.condition.change",
"call.arguments.add"
] | 641,049 | 641,050 | u560988566 | python |
p02836 | s=list(input())
x=len(s)
c=0
for i in range((x+1)//2-1):
if s[i]!=s[-i-1]:
c+=1
print(c) | s=list(input())
x=len(s)
c=0
for i in range((x+1)//2):
if s[i]!=s[-i-1]:
c+=1
print(c) | [
"expression.operation.binary.remove"
] | 641,055 | 641,056 | u668503853 | python |
p02836 | s = input()
counter = 0
length = len(s)
for i in range(length):
if s[i] != s[length-1-i]:
counter += 1
print(counter) | s = input()
counter = 0
length = len(s)
for i in range(length//2):
if s[i] != s[length-1-i]:
counter += 1
print(counter) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 641,069 | 641,070 | u695079172 | python |
p02836 | S = input()
S_len = len(S)
num = 0
for i in range(S_len // 2):
if S[i] != S[-i]:
num += 1
print(num) | S = input()
S_len = len(S)
num = 0
for i in range(S_len // 2):
if S[i] != S[-i-1]:
num += 1
print(num) | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 641,071 | 641,072 | u175743386 | python |
p02836 | import math
s=input()
n=math.floor(len(s)/2)
print(n)
count=0
for i in range(n):
if s[i]!=s[-i-1]:
count+=1
print(count) | import math
s=input()
n=math.floor(len(s)/2)
count=0
for i in range(n):
if s[i]!=s[-i-1]:
count+=1
print(count) | [
"call.remove"
] | 641,073 | 641,074 | u025241948 | python |
p02836 | S = input()
len_ = int(7/2)
cnt = 0
for i in range(0, len_+1):
if S[i] != S[-(i+1)]:
cnt += 1
print(cnt)
| S = input()
len_ = int(len(S)/2)
cnt = 0
for i in range(0, len_):
if S[i] != S[-(i+1)]:
cnt += 1
print(cnt)
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"call.arguments.add",
"expression.operation.binary.remove"
] | 641,079 | 641,080 | u597047658 | python |
p02836 | s = input()
h = 0
for i in range(len(s)//2):
if s[i] != s[s-i-1]:
h += 1
print(h) | s = input()
h = 0
for i in range(len(s)//2):
if s[i] != s[len(s)-i-1]:
h += 1
print(h) | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 641,081 | 641,083 | u072606168 | python |
p02836 | s = input()
ls = len(s)
ans = 0
for i in range(ls//2):
if s[i] != s[-1-i]:
ans += 1
print(ans//2) | s = input()
ls = len(s)
ans = 0
for i in range(ls//2):
if s[i] != s[-1-i]:
ans += 1
print(ans) | [
"expression.operation.binary.remove"
] | 641,103 | 641,105 | u399721252 | python |
p02836 | S = input()
N = len(s)
a = 0
n = N//2
for i in range(n):
k = -(i+1)
if S[i] != S[k]:
a += 1
print(a) | S = input()
N = len(S)
a = 0
n = N//2
for i in range(n):
k = -(i+1)
if S[i] != S[k]:
a += 1
print(a)
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 641,119 | 641,120 | u557494880 | python |
p02836 | a=input()
if len(a)%2==0:
v=len(a)/2
else:
v=(len(a)-1)/2
c=0
for i in range(v):
if a[i]!=a[-i-1]:
c+=1
print(c) | a=input()
if len(a)%2==0:
v=int(len(a)/2)
else:
v=int((len(a)-1)/2)
c=0
for i in range(v):
if a[i]!=a[-i-1]:
c+=1
print(c) | [
"call.add",
"call.arguments.change"
] | 641,127 | 641,128 | u771538568 | python |
p02836 | def palin(s):
p1 = ans = 0
p2 = len(s) - 1
while p1 < p2:
if s[p1] != s[p2]:
ans += 1
p1 += 1
p2 -= 1
print(ans)
if __name__ == "__main__":
import sys
in_str = ''
for line in sys.stdin:
in_str += line
palin(in_str)
| def palin(s):
p1 = ans = 0
p2 = len(s) - 1
while p1 < p2:
if s[p1] != s[p2]:
ans += 1
p1 += 1
p2 -= 1
print(ans)
if __name__ == "__main__":
import sys
in_str = ''
for line in sys.stdin:
in_str += line
palin(in_str.strip())
| [
"call.add"
] | 641,131 | 641,132 | u799916419 | python |
p02836 | s = list(input())
n = len(s)
a = 0
for i in range(n//2):
if s[i] != s[-i]:
a += 1
print(a) | s = list(input())
n = len(s)
a = 0
for i in range(n//2):
if s[i] != s[-i-1]:
a += 1
print(a) | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 641,133 | 641,134 | u640123177 | python |
p02836 | s = input()
cnt = 0
for i in range(len(s)//2):
if s[i] != s[-i-1]:
cnt += 1
s[-i-1] = s[i]
print(cnt)
| s = input()
cnt = 0
s = list(s)
for i in range(len(s)//2):
if s[i] != s[-i-1]:
cnt += 1
s[-i-1] = s[i]
print(cnt)
| [
"assignment.add"
] | 641,141 | 641,142 | u528748570 | python |
p02836 |
MOD = 10**9 + 7
INF = 10**20
I = lambda:list(map(int,input().split()))
from collections import defaultdict as dd
from math import gcd
s = input()
n = len(s)
ans = 0
for i in range(n//2):
ans += (s[i] != s[n-i])
print(ans) |
MOD = 10**9 + 7
INF = 10**20
I = lambda:list(map(int,input().split()))
from collections import defaultdict as dd
s = input()
n = len(s)
ans = 0
for i in range(n//2):
ans += (s[i] != s[n-i-1])
print(ans) | [
"expression.operation.binary.add"
] | 641,145 | 641,144 | u075489826 | python |
p02837 | N = int(input())
testimo_ls = [ [] for i in range(N) ]
rst = 0
for i in range(N):
A = int(input())
for j in range(A):
x, y = map(int, input().split(' '))
testimo_ls[i].append([x - 1, y])
for i in range(1 << N):
honest_ls = []
for j in range(N):
if i >> j & 1:
honest_l... | N = int(input())
testimo_ls = [ [] for i in range(N) ]
rst = 0
for i in range(N):
A = int(input())
for j in range(A):
x, y = map(int, input().split(' '))
testimo_ls[i].append([x - 1, y])
for i in range(1 << N):
honest_ls = []
for j in range(N):
if i >> j & 1:
honest_l... | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 641,156 | 641,157 | u418149936 | python |
p02837 | N = int(input())
testimo_ls = [ [] for i in range(N) ]
rst = 0
for i in range(N):
A = int(input())
for j in range(A):
x, y = map(int, input().split(' '))
testimo_ls[i].append([x - 1, y])
for i in range(1 << N):
honest_ls = []
for j in range(N):
if i >> j & 1:
honest_l... | N = int(input())
testimo_ls = [ [] for i in range(N) ]
rst = 0
for i in range(N):
A = int(input())
for j in range(A):
x, y = map(int, input().split(' '))
testimo_ls[i].append([x - 1, y])
for i in range(1 << N):
honest_ls = []
for j in range(N):
if i >> j & 1:
honest_l... | [
"control_flow.branch.if.add",
"control_flow.break.add",
"control_flow.break.remove"
] | 641,158 | 641,157 | u418149936 | python |
p02837 | N = int(input())
testimo_ls = [ [] for i in range(N) ]
rst = 0
for i in range(N):
A = int(input())
for j in range(A):
x, y = map(int, input().split(' '))
testimo_ls[i].append([x - 1, y])
for i in range(1 << N):
honest_ls = []
for j in range(N):
if i >> j & 1:
honest_l... | N = int(input())
testimo_ls = [ [] for i in range(N) ]
rst = 0
for i in range(N):
A = int(input())
for j in range(A):
x, y = map(int, input().split(' '))
testimo_ls[i].append([x - 1, y])
for i in range(1 << N):
honest_ls = []
for j in range(N):
if i >> j & 1:
honest_l... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 641,158 | 641,159 | u418149936 | python |
p02837 | N=int(input())
syogen=[]
for i in range(N):
a=int(input())
temp=[list(map(int, input().split())) for _ in range(a)]
syogen.append([a,temp])
ans=0
for h in range(2**N):
flag=0
cnt=0
l=[0]*N
for g in range(N):
if h>>g &1:
l[g]=1
#print(l)
for gg in range(N):
if l[gg]==1:
temp_=syogen[g]
for n in ... | N=int(input())
syogen=[]
for i in range(N):
a=int(input())
temp=[list(map(int, input().split())) for _ in range(a)]
syogen.append([a,temp])
ans=0
for h in range(2**N):
flag=0
cnt=0
l=[0]*N
for g in range(N):
if h>>g &1:
l[g]=1
#print(l)
for gg in range(N):
if l[gg]==1:
temp_=syogen[gg]
#print(t... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 641,179 | 641,180 | u608178601 | python |
p02837 | from itertools import product
n = int(input())
d = {}
for i in range(n):
a = int(input())
for _ in range(a):
x, y = map(int, input().split())
if i + 1 not in d:
d[i + 1] = []
d[i + 1].append((x, y))
ret = 0
for x in product((0, 1), repeat=n):
tmp = [-1] * n
ok = True
for i in range(n):
... | from itertools import product
n = int(input())
d = {}
for i in range(n):
a = int(input())
for _ in range(a):
x, y = map(int, input().split())
if i + 1 not in d:
d[i + 1] = []
d[i + 1].append((x, y))
ret = 0
for x in product((0, 1), repeat=n):
tmp = [-1] * n
ok = True
for i in range(n):
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 641,186 | 641,187 | u170183831 | python |
p02837 | N=int(input())
XY=[[[]] for n in range(N+1)]
for n in range(1,N+1):
a=int(input())
XY[n]=[list(map(int, input().split())) for _ in range(a)]
maxH=0
for mask_i in range(1<<N):
H=[0]*(N+1)
for n in range(N):
if mask_i>>n&1:
H[n+1]=1
#print(H[1:])
for n in range(1,N+1):
ok=True
if H[n]... | N=int(input())
XY=[[[]] for n in range(N+1)]
for n in range(1,N+1):
a=int(input())
XY[n]=[list(map(int, input().split())) for _ in range(a)]
maxH=0
for mask_i in range(1<<N):
H=[0]*(N+1)
for n in range(N):
if mask_i>>n&1:
H[n+1]=1
#print(H[1:])
ok=True
for n in range(1,N+1):
if H[n]==... | [
"assignment.add",
"assignment.remove"
] | 641,192 | 641,193 | u539367121 | python |
p02837 | import itertools
n=int(input())
lis=[]
for i in range(n):
ai=int(input())
lisi=[]
for _ in range(ai):
xi,yi=map(int,input().split())
lisi.append([xi-1,yi])
lis.append(lisi)
print(lis)
ans=-1
for binary in itertools.product([1,0],repeat=n):
check=0
for i in range(n):
i... | import itertools
n=int(input())
lis=[]
for i in range(n):
ai=int(input())
lisi=[]
for _ in range(ai):
xi,yi=map(int,input().split())
lisi.append([xi-1,yi])
lis.append(lisi)
ans=-1
for binary in itertools.product([1,0],repeat=n):
check=0
for i in range(n):
if binary[i]... | [
"call.remove"
] | 641,212 | 641,213 | u354126779 | python |
p02837 | N = int(input())
evidence = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x,y = map(int,input().split())
evidence[i].append((x-1,y))
result = 0
for j in range(1,2**N):
consistent = True
for k in range(N):
if (j >> k) & 1 == 0:
continue
for x,y in evidence[k]... | N = int(input())
evidence = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x,y = map(int,input().split())
evidence[i].append((x-1,y))
result = 0
for j in range(1,2**N):
consistent = True
for k in range(N):
if (j >> k) & 1 == 0:
continue
for x,y in evidence[k]... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 641,236 | 641,237 | u698868214 | python |
p02837 | N = int(input())
evidence = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x,y = map(int,input().split())
evidence[i].append((x-1,y))
result = 0
for j in range(1,2**N):
consistent = True
for k in range(N):
if (j >> k) & 1 == 0:
continue
for x,y in evidence[k]... | N = int(input())
evidence = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x,y = map(int,input().split())
evidence[i].append((x-1,y))
result = 0
for j in range(1,2**N):
consistent = True
for k in range(N):
if (j >> k) & 1 == 0:
continue
for x,y in evidence[k]... | [
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 641,238 | 641,237 | u698868214 | python |
p02837 | from itertools import product
def solve():
N = int(input())
graph = {i: [] for i in range(1, N+1)}
for i in range(N):
A = int(input())
for _ in range(A):
x,y = map(int, input().split())
graph[i+1].append((x,y))
def dfs(nodes):
searched = [-1... | from itertools import product
def solve():
N = int(input())
graph = {i: [] for i in range(1, N+1)}
for i in range(N):
A = int(input())
for _ in range(A):
x,y = map(int, input().split())
graph[i+1].append((x,y))
def dfs(nodes):
searched = [-1... | [
"call.add"
] | 641,249 | 641,250 | u594244257 | python |
p02837 | n = int(input())
v = [[tuple(map(int, input().split()))for i in range(int(input()))] for i in range(n)]
ans = 0
for i in range(2**n):
f = [False]*n
xy = []
for j in range(n):
if (i >> j) & 1:
f[j] = True
xy.append(v[j])
flag = True
for xyi in xy:
for x,y in x... | n = int(input())
v = [[tuple(map(int, input().split()))for i in range(int(input()))]
for i in range(n)]
ans = 0
for i in range(2**n):
f = [False] * n
xy = []
for j in range(n):
if (i >> j) & 1:
f[j] = True
xy.append(v[j])
flag = True
for xyi in xy:
for x... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 641,251 | 641,252 | u867826040 | python |
p02837 | N = int(input())
table = []
for i in range(N):
A = int(input())
dic = {}
for j in range(A):
x,y = map(int, input().split())
dic[x-1] = y
table.append(dic)
res = 0
for i in range(2**N-1):
bi = [j for j in range(N) if (i >> j &1)]
dic = {}
for b in bi:
dic[b] =... | N = int(input())
table = []
for i in range(N):
A = int(input())
dic = {}
for j in range(A):
x,y = map(int, input().split())
dic[x-1] = y
table.append(dic)
res = 0
for i in range(2**N):
bi = [j for j in range(N) if (i >> j &1)]
dic = {}
for b in bi:
dic[b] = 1... | [
"expression.operation.binary.remove"
] | 641,259 | 641,260 | u922487073 | python |
p02837 | N = int(input())
s = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
s[i].append((x - 1, y))
result = 0
for i in range(1, 2 ** N):
consistent = True
for j in range(N):
if (i >> j) & 1 == 0:
continue
... | N = int(input())
evidences = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
evidences[i].append((x - 1, y))
result = 0
for i in range(1, 2 ** N):
consistent = True
for j in range(N):
if (i >> j) & 1 == 0:
... | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 641,273 | 641,274 | u347640436 | python |
p02837 | N = int(input())
s = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
s[i].append((x - 1, y))
result = 0
for i in range(1, 2 ** N):
consistent = True
for j in range(N):
if (i >> j) & 1 == 0:
continue
... | N = int(input())
s = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
s[i].append((x - 1, y))
result = 0
for i in range(1, 2 ** N):
consistent = True
for j in range(N):
if (i >> j) & 1 == 0:
continue
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 641,273 | 641,276 | u347640436 | python |
p02837 | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = True
for j in range(n):
if (i >> j) & 1:
... | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = True
for j in range(n):
if (i >> j) & 1:
... | [
"expression.operation.binary.remove",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 641,282 | 641,283 | u343490140 | python |
p02837 | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = True
for j in range(n):
if (i >> j) & 1:
... | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = True
for j in range(n):
if (i >> j) & 1:
... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 641,284 | 641,283 | u343490140 | python |
p02837 | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = True
for j in range(n):
if (i >> j) & 1:
... | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = True
for j in range(n):
if (i >> j) & 1:
... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.break.remove"
] | 641,285 | 641,283 | u343490140 | python |
p02837 | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = 0
for j in range(n):
if (i >> j) & 1:
s[... | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = True
for j in range(n):
if (i >> j) & 1:
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.loop.for.condition.change"
] | 641,286 | 641,287 | u343490140 | python |
p02837 | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = True
for j in range(n):
if (i >> j) & 1:
... | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = True
for j in range(n):
if (i >> j) & 1:
... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 641,282 | 641,287 | u343490140 | python |
p02837 | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = True
for j in range(n):
if (i >> j) & 1:
... | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = True
for j in range(n):
if (i >> j) & 1:
... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 641,284 | 641,287 | u343490140 | python |
p02837 | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = True
for j in range(n):
if (i >> j) & 1:
... | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = True
for j in range(n):
if (i >> j) & 1:
... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.break.remove"
] | 641,285 | 641,287 | u343490140 | python |
p02837 | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for k in range(2 ** n):
s = [0] * n
cnt = 0
case = 0
for j in range(n):
if (k >> j) & 1:
s[... | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = 0
for j in range(n):
if (i >> j) & 1:
s[... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 641,288 | 641,289 | u343490140 | python |
p02837 | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = 0
for j in range(n):
if (i >> j) & 1:
s[... | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = 0
for j in range(n):
if (i >> j) & 1:
s[... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 641,286 | 641,289 | u343490140 | python |
p02837 | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = True
for j in range(n):
if (i >> j) & 1:
... | n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = 0
for j in range(n):
if (i >> j) & 1:
s[... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.loop.for.condition.change"
] | 641,282 | 641,289 | u343490140 | python |
p02837 | n=int(input())
xy=[[] for i in range(n)]
for i in range(n):
a=int(input())
for j in range(a):
x,y=map(int,input().split())
x-=1
xy.append((x,y))
ans=0
for i in range(1<<n):
cnt=bin(i).count("1")
if cnt<=ans:continue
for j in range(n):
if i&(1<<j):
for x,y in xy[j]:
if y==1 and i&... | n=int(input())
xy=[[] for i in range(n)]
for i in range(n):
a=int(input())
for j in range(a):
x,y=map(int,input().split())
x-=1
xy[i].append((x,y))
ans=0
for i in range(1<<n):
cnt=bin(i).count("1")
if cnt<=ans:continue
for j in range(n):
if i&(1<<j):
for x,y in xy[j]:
if y==1 and... | [] | 641,302 | 641,303 | u970197315 | python |
p02837 | n = int(input())
tst = [[] for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x,y = map(int,input().split())
st[i].append([x,y])
ans = 0
for bit in range(1<<n):
honest = [0]*n
check = 1
for i in range(n):
if (bit>>i)&1:
honest[-1-i] = 1
... | n = int(input())
tst = [[] for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x,y = map(int,input().split())
tst[i].append([x,y])
ans = 0
for bit in range(1<<n):
honest = [0]*n
check = 1
for i in range(n):
if (bit>>i)&1:
honest[-1-i] = 1
... | [
"identifier.change"
] | 641,313 | 641,314 | u531599639 | python |
p02837 | #入力はn人のx,yに分けないといけない
n = int(input())
a = []
x = [[] for i in range(n)]
y = [[] for i in range(n)]
for i in range(n):
a.append(int(input()))
for j in range(a[i]):
xx, yy = (int(i) for i in input().split())
x[i].append(xx)
y[i].append(yy)
testimony = [[2]*n for i in range(n)]
for i in r... | #入力はn人のx,yに分けないといけない
n = int(input())
a = []
x = [[] for i in range(n)]
y = [[] for i in range(n)]
for i in range(n):
a.append(int(input()))
for j in range(a[i]):
xx, yy = (int(i) for i in input().split())
x[i].append(xx)
y[i].append(yy)
testimony = [[2]*n for i in range(n)]
for i in r... | [
"call.remove"
] | 641,329 | 641,330 | u694810977 | python |
p02837 | from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools
import queue
from collections import deque
from fractions import Fraction
def ternary (n, k, length):
if n == 0:
... | from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools
import queue
from collections import deque
from fractions import Fraction
def ternary (n, k, length):
if n == 0:
... | [
"assignment.value.change",
"variable_access.subscript.index.change"
] | 641,331 | 641,332 | u584174687 | python |
p02837 | N = int(input())
g = [[-1 for _ in range(N)] for _ in range(N)]
for i in range(N):
m = int(input())
for j in range(m):
x,y = map(int,input().split())
g[i][x-1] = y
ans = 0
for i in range(1 << N):
hornest = [0] * N
for j in range(N):
if (i << j)&1:
hornest[j] = 1
... | N = int(input())
g = [[-1 for _ in range(N)] for _ in range(N)]
for i in range(N):
m = int(input())
for j in range(m):
x,y = map(int,input().split())
g[i][x-1] = y
ans = 0
for i in range(1 << N):
hornest = [0] * N
for j in range(N):
if (i >> j)&1:
hornest[j] = 1
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 641,347 | 641,348 | u883866798 | python |
p02837 | N = int(input())
A = []
x = []
y = []
xy = [[] for _ in range(N)]
for i in range(N):
A1 = int(input())
A.append(A1)
for _ in range(A1):
x, y = map(int, input().split())
xy[i].append((x-1, y))
c_max = 0
cnt = 0
for i in range(1 << N):
ok = True
for j in range(N):
if (i >> j) ... | N = int(input())
A = []
x = []
y = []
xy = [[] for _ in range(N)]
for i in range(N):
A1 = int(input())
A.append(A1)
for _ in range(A1):
x, y = map(int, input().split())
xy[i].append((x-1, y))
c_max = 0
cnt = 0
for i in range(1 << N):
ok = True
for j in range(N):
if (i >> j) ... | [] | 641,351 | 641,352 | u062754605 | python |
p02837 | N = int(input())
A = []
x = []
y = []
xy = [[] for _ in range(N)]
for i in range(N):
A1 = int(input())
A.append(A1)
for _ in range(A1):
x, y = map(int, input().split())
xy[i].append((x-1, y))
c_max = 0
cnt = 0
for i in range(1 << N):
ok = True
for j in range(N):
if (i << j) ... | N = int(input())
A = []
x = []
y = []
xy = [[] for _ in range(N)]
for i in range(N):
A1 = int(input())
A.append(A1)
for _ in range(A1):
x, y = map(int, input().split())
xy[i].append((x-1, y))
c_max = 0
cnt = 0
for i in range(1 << N):
ok = True
for j in range(N):
if (i >> j) ... | [
"control_flow.branch.if.condition.change"
] | 641,353 | 641,352 | u062754605 | python |
p02837 | N = int(input())
A = []
x = []
y = []
xy = [[] for _ in range(N)]
for i in range(N):
A1 = int(input())
A.append(A1)
for _ in range(A1):
x, y = map(int, input().split())
xy[i].append((x-1, y))
c_max = 0
cnt = 0
for i in range(1 << N):
ok = True
for j in range(N):
if (i << j) ... | N = int(input())
A = []
x = []
y = []
xy = [[] for _ in range(N)]
for i in range(N):
A1 = int(input())
A.append(A1)
for _ in range(A1):
x, y = map(int, input().split())
xy[i].append((x-1, y))
c_max = 0
cnt = 0
for i in range(1 << N):
ok = True
for j in range(N):
if (i >> j) ... | [
"control_flow.branch.if.condition.change"
] | 641,354 | 641,352 | u062754605 | python |
p02837 | N = int(input())
A = []
XY = []
honest_count = []
for i in range(N):
a = int(input())
A.append(a)
inter = []
for x in range(a):
xy = list(map(int,input().split()))
inter.append(xy)
XY.append(inter)
print(XY)
for i in range(2**N):
pt = [0]*N
ck = 1
for j in range(N):... | N = int(input())
A = []
XY = []
honest_count = []
for i in range(N):
a = int(input())
A.append(a)
inter = []
for x in range(a):
xy = list(map(int,input().split()))
inter.append(xy)
XY.append(inter)
#print(XY)
for i in range(2**N):
pt = [0]*N
ck = 1
for j in range(N)... | [
"call.remove"
] | 641,355 | 641,356 | u166621202 | python |
p02837 | #C
n = int(input())
a = []
testimony = [-1]*n
ans = 0
for i in range(n):
a.append(int(input()))#証言の個数
l = []
for j in range(a[i]):
l.append(list(map(int, input().split())))
if l != []:
testimony[i] = l#iの人のa[i]個の証言のリスト
for i in range(2**n):
for j in range(n):
if (i >> j) & 1 ... | #C
n = int(input())
a = []
testimony = [-1]*n
ans = 0
for i in range(n):
a.append(int(input()))#証言の個数
l = []
for j in range(a[i]):
l.append(list(map(int, input().split())))
if l != []:
testimony[i] = l#iの人のa[i]個の証言のリスト
for i in range(2**n):
for j in range(n):
if (i >> j) & 1 ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 641,359 | 641,358 | u297667660 | python |
p02837 | N = int(input())
x = []
y = []
words = []
for i in range(N):
A = int(input())
W = []
for _ in range(A):
x, y = map(int, input().split())
W.append([x-1, y])
words.append(W)
ans = 0
for bit in range(1<<n):
ok = True
is_honest = [(bit>>i) & 1 for i in range(N)]
for i in range(N):
if not is_hon... | N = int(input())
x = []
y = []
words = []
for i in range(N):
A = int(input())
W = []
for _ in range(A):
x, y = map(int, input().split())
W.append([x-1, y])
words.append(W)
ans = 0
for bit in range(1<<N):
ok = True
is_honest = [(bit>>i) & 1 for i in range(N)]
for i in range(N):
if not is_hon... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 641,362 | 641,363 | u189516107 | python |
p02837 | N = int(input())
lst = [[] for _ in range(N + 1)]
for i in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
lst[i].append([x - 1, y])
ans = 0
for i in range(2 ** N):
check = [-1] * N #1:正直者、0:不親切
count = 0 #カウント用
flag = True
for j in range(N):
... | N = int(input())
lst = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
lst[i].append([x - 1, y])
ans = 0
for i in range(2 ** N):
check = [-1] * N #1:正直者、0:不親切
count = 0 #カウント用
flag = True
for j in range(N):
... | [
"expression.operation.binary.remove",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 641,384 | 641,385 | u263830634 | python |
p02837 | import math
import itertools
# -1 no ans
# 1 syoziki
# 0 hu sinsetu
N = int(input())
ans = [[-1] * N for i in range(N)]
for person in range(N):
A = int(input())
print(A)
for _ in range(A):
x, y = map(int, input().split())
x -= 1
ans[person][x] = y
def is_ok(num):
# -1 not d... | import math
import itertools
# -1 no ans
# 1 syoziki
# 0 hu sinsetu
N = int(input())
ans = [[-1] * N for i in range(N)]
for person in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
x -= 1
ans[person][x] = y
def is_ok(num):
# -1 not decided
# ... | [
"call.remove"
] | 641,396 | 641,397 | u671060652 | python |
p02837 | import itertools
n=int(input())
la=[]
for _ in range(n):
d=int(input())
for dd in d:
x,y=map(int,input().split())
la.append([_,x-1,y])
ans=0
for i in itertools.product([0,1],repeat=n):
s=sum(list(i))
for l in la:
if i[l[0]]==1 and i[l[1]]!=l[2]:
break
else:
ans=max(ans,s)
print(ans) | import itertools
n=int(input())
la=[]
for _ in range(n):
d=int(input())
for dd in range(d):
x,y=map(int,input().split())
la.append([_,x-1,y])
ans=0
for i in itertools.product([0,1],repeat=n):
s=sum(list(i))
for l in la:
if i[l[0]]==1 and i[l[1]]!=l[2]:
break
else:
ans=max(ans,s)
print(an... | [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 641,398 | 641,399 | u932868243 | python |
p02837 | from itertools import combinations
n = int(input())
a = []
xy = [] #xy[i人目][j個目][0: x, 1: y]
for i in range(n):
a.append(int(input()))
xy.append([])
for _ in range(a[i]):
xy[i].append([int(i) for i in input().split()])
ans = 0
for i in range(n): #i人の正直者
b = list(combinations(list(range(n)), i))
... | from itertools import combinations
n = int(input())
a = []
xy = [] #xy[i人目][j個目][0: x, 1: y]
for i in range(n):
a.append(int(input()))
xy.append([])
for _ in range(a[i]):
xy[i].append([int(i) for i in input().split()])
ans = 0
for i in range(n + 1): #i人の正直者
b = list(combinations(list(range(n)), ... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 641,415 | 641,416 | u287500079 | python |
p02837 | from collections import deque
n = int(input())
work = []
for i in range(n):
a = int(input())
work.append([list(map(int, input().split())) for i in range(a)])
result = 0
for i in range(2**n):
state = bin(i)[2:].zfill(n)
honest = []
unkind = []
for j in range(n):
if state[j] == "0":
... | from collections import deque
n = int(input())
work = []
for i in range(n):
a = int(input())
work.append([list(map(int, input().split())) for i in range(a)])
result = 0
for i in range(2**n):
state = bin(i)[2:].zfill(n)
honest = []
unkind = []
for j in range(n):
if state[j] == "0":
... | [
"expression.operation.binary.add"
] | 641,426 | 641,427 | u060736237 | python |
p02837 | import numpy as np
import itertools
n = int(input())
info = []
for i in range(n):
a = int(input())
for _ in range(a):
x, y = map(int, input().split())
info.append((i, x - 1, y))
a = np.array(list(itertools.product([0, 1], repeat=n)), dtype=np.bool)
for i, x, y in info:
bl = (~a[:, i]) | (a... | import numpy as np
import itertools
n = int(input())
info = []
for i in range(n):
a = int(input())
for _ in range(a):
x, y = map(int, input().split())
info.append((i, x - 1, y))
a = np.array(list(itertools.product([0, 1], repeat=n)), dtype=np.bool)
for i, x, y in info:
bl = (~a[:, i]) | (a... | [
"call.remove"
] | 641,430 | 641,431 | u157020659 | python |
p02837 | n = int(input())
def make_remark_list(i, r):
# -1: 不明, 0: 嘘つき, 1: 真実
people = [-1] * n
people[i] = 1
for x, y in r:
people[x - 1] = y
return people
def check(x, y):
new_list = []
for a, b in zip(x, y):
a, b = min(a, b), max(a, b)
if (a, b) == (0, 1):
r... | n = int(input())
def make_remark_list(i, r):
# -1: 不明, 0: 嘘つき, 1: 真実
people = [-1] * n
people[i] = 1
for x, y in r:
people[x - 1] = y
return people
def check(x, y):
new_list = []
for a, b in zip(x, y):
a, b = min(a, b), max(a, b)
if (a, b) == (0, 1):
r... | [
"call.remove"
] | 641,432 | 641,433 | u157020659 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.