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 |
|---|---|---|---|---|---|---|---|
p02623 | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()
n,m,k = na()
a = na()
b = na()
aa = [0]
bb = [0]
for i in a:
aa.append(aa[-1]+i)
for i in b:
... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()
n,m,k = na()
a = na()
b = na()
aa = [0]
bb = [0]
for i in a:
aa.append(aa[-1]+i)
for i in b:
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 335,539 | 335,540 | u843135954 | python |
p02623 | from bisect import*
from itertools import*
N, M, K = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a = list(accumulate(a))
b = list(accumulate(b))
ans = 0
for i in range(N):
rest = K - a[i]
if rest < 0:
continue
else:
pre = bisect(b, rest)... | from bisect import*
from itertools import*
N, M, K = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a = list(accumulate(a))
b = list(accumulate(b))
ans = bisect(b, K)
for i in range(N):
rest = K - a[i]
if rest < 0:
continue
else:
pre = bise... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 335,626 | 335,627 | u051928503 | python |
p02624 | #D
n = int(input())
#約数の数を求める＞＞倍数であり、n以下であるものの総和を求める
ans = 0
for i in range(1, n + 1):
#iの倍数の数を求める
m = n // i
#初項i:公差i:m項までの等比数列の和
ans += n * (2 * i + i * (n - 1)) *0.5
print(int(ans)) | #D
n = int(input())
#約数の数を求める＞＞倍数であり、n以下であるものの総和を求める
ans = 0
for i in range(1, n + 1):
#iの倍数の数を求める
m = n // i
#初項i:公差i:m項までの等比数列の和
ans += m * (2 * i + i * (m - 1)) *0.5
print(int(ans)) | [
"identifier.change",
"expression.operation.binary.change"
] | 335,709 | 335,710 | u490489966 | python |
p02624 | n=int(input())
ans=0
for i in range(1,n+1):
j=n//i
ans+=j*j*(j+1)//2
print(ans)
| n=int(input())
ans=0
for i in range(1,n+1):
j=n//i
ans+=i*j*(j+1)//2
print(ans) | [
"identifier.change",
"expression.operation.binary.change"
] | 335,715 | 335,716 | u350093546 | python |
p02624 | n=int(input())
ans=0
for i in range(1,n+1):
j=n//i
ans+=j*(j+1)//2
print(ans)
| n=int(input())
ans=0
for i in range(1,n+1):
j=n//i
ans+=i*j*(j+1)//2
print(ans) | [
"expression.operation.binary.add"
] | 335,717 | 335,716 | u350093546 | python |
p02624 | n=int(input())
ans=0
for i in range(n):
j=n//i
ans+=j*(j+1)//2
print(ans) | n=int(input())
ans=0
for i in range(1,n+1):
j=n//i
ans+=i*j*(j+1)//2
print(ans) | [
"call.arguments.add"
] | 335,718 | 335,716 | u350093546 | python |
p02624 | N = int(input())
a=0
for i in range(1,n+1):
x,y=i,(n//i)*i
a+=((n//i)*(x+y)//2)
print(a) | n=int(input())
ans=0
for i in range(1,n+1):
x,y=i,(n//i)*i
ans+=((n//i)*(x+y)//2)
print(ans) | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 335,719 | 335,720 | u072409340 | python |
p02624 | N=int(input())
print( sum(j*(N//j)*(N//j+1)//2 for j in range(1,N)) ) | N=int(input())
print(sum(j*(N//j)*(N//j+1)//2 for j in range(1,N+1))) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 335,753 | 335,754 | u586759271 | python |
p02624 | def main():
N = int(input())
tot = 0
for d in range(1, N+1):
nd = N//d
tot += (d * (nd + 1) * nd) // 2
print(tot)
| N = int(input())
tot = 0
for d in range(1, N+1):
nd = N//d
tot += (d * (nd + 1) * nd) // 2
print(tot)
| [] | 335,780 | 335,781 | u091307273 | python |
p02624 | N=int(input())
N=10**7
#N=100
ans=0
for i in range(1,N+1):
ans+=i*((1+(N//i))*(N//i)//2)
#print(ans)
pass
print(ans) | N=int(input())
#N=10**7
#N=100
ans=0
for i in range(1,N+1):
ans+=i*((1+(N//i))*(N//i)//2)
#print(ans)
pass
print(ans) | [
"assignment.remove"
] | 335,803 | 335,804 | u696499790 | python |
p02624 | n = int(input())
cnts = [k*(n//k)*((n//k)+1)//2 for k in range(1,n//2)]
print(sum(cnts)+ ((n//2)+n)*(n-(n//2)+1)//2) | n = int(input())
cnts = [k*(n//k)*((n//k)+1)//2 for k in range(1,n//2+1)]
print(sum(cnts)+ ((n//2+1)+n)*(n-(n//2+1)+1)//2) | [
"control_flow.loop.range.bounds.upper.change",
"assignment.change",
"expression.operation.binary.add"
] | 335,805 | 335,806 | u303739137 | python |
p02624 | n = int(input())
ans = 0
for i in range(n):
nu = n // i
ans += nu * (nu+1) * i // 2
print(ans)
| n = int(input())
ans = 0
for i in range(1,n+1):
nu = n // i
ans += nu * (nu+1) * i // 2
print(ans)
| [
"call.arguments.add"
] | 335,856 | 335,857 | u749742659 | python |
p02624 | def solve(n):
ans = 0
for i in range(1,n+1):
y = n//i
print(y)
ans += (y*(y+1)*i)/2
return ans
def main():
n = int(input())
print(int(solve(n)))
if __name__ == "__main__":
main()
| def solve(n):
ans = 0
for i in range(1,n+1):
y = n//i
ans += (y*(y+1)*i)/2
return ans
def main():
n = int(input())
print(int(solve(n)))
if __name__ == "__main__":
main() | [
"call.remove"
] | 335,859 | 335,860 | u047197186 | python |
p02624 | n=int(input())
ans=0
for i in range(1,n+1):
x=math.floor(n/i)
ans+=(x*(x+1)*i)/2
print(int(ans)) | import math
n=int(input())
ans=0
for i in range(1,n+1):
x=math.floor(n/i)
ans+=(x*(x+1)*i)/2
print(int(ans)) | [] | 335,890 | 335,891 | u066494348 | python |
p02624 | import math
import time
N=int(input())
sum=0
for j in range(1,N+1):
Y=int(N/j)
sum+=int((Y*(Y+1)*j)/2)
print(sum) | N=int(input())
sum=0
for j in range(1,N+1):
Y=int(N/j)
sum+=int((Y*(Y+1)*j)/2)
print(sum) | [] | 335,896 | 335,897 | u970598682 | python |
p02624 | n = int(input())
ans = 0
for i in arnge(1, n + 1):
for j in range(1, n + 1, i):
ans += j
print(ans)
| n = int(input())
ans = 0
for i in range(1, n + 1):
for j in range(i, n + 1, i):
ans += j
print(ans)
| [
"identifier.change",
"call.function.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 335,918 | 335,916 | u219197917 | python |
p02624 | N = int(input())
l = list(range(1, N+1))
def calc(i):
return (i + N//i * i) * i // 2
ans = 0
for i in range(1, N+1):
ans += calc(i)
print(ans) | N = int(input())
l = list(range(1, N+1))
def calc(i):
return (i + N//i * i) * (N//i) // 2
ans = 0
for i in range(1, N+1):
ans += calc(i)
print(ans) | [
"function.return_value.change"
] | 335,919 | 335,920 | u439063038 | python |
p02624 | n = int(input())
ans = 0
for i in range(1,n):
k = n//i
ans += i*(k*(k+1)//2)
print(ans) | n = int(input())
ans = 0
for i in range(1,n+1):
k = n//i
ans += i*(k*(k+1))//2
print(ans) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 335,949 | 335,950 | u529737989 | python |
p02624 | n = int(input())
ans = 0
for k in range(1, n + 1):
m = n / k
mc2 = (m * (m + 1)) / 2
ans += mc2 * k
print(ans) | n = int(input())
ans = 0
for k in range(1, n + 1):
m = n // k
mc2 = (m * (m + 1)) // 2
ans += mc2 * k
print(ans) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 336,004 | 336,005 | u623094203 | python |
p02624 | a=int(input())
ans=0
for i in range(1,n+1):
num=n//i
ans+=(((num+1)*num)//2)*i
print(ans) | a=int(input())
ans=0
for i in range(1,a+1):
num=a//i
ans+=(((num+1)*num)//2)*i
print(ans) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"assignment.value.change"
] | 336,039 | 336,040 | u115877451 | python |
p02624 | a=int(input())
ans=0
for i in range(1,n+1):
num=n//i
ans+=((num+1)//2)*i
print(ans) | a=int(input())
ans=0
for i in range(1,a+1):
num=a//i
ans+=(((num+1)*num)//2)*i
print(ans) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"assignment.value.change"
] | 336,041 | 336,040 | u115877451 | python |
p02624 | N = int(input())
ans = 0
for j in range(1,N+1):
num = int(N/j)
ans += num*(num-1)/2*j
print(int(ans)) | N = int(input())
ans = 0
for j in range(1,N+1):
num = int(N/j)
ans += num*(num+1)/2*j
print(int(ans)) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 336,050 | 336,051 | u527299145 | python |
p02624 | n = int(input())
print(int(sum([i * (n / i) * (n / i + 1) // 2 for i in range(1,n+1)]))) | n = int(input())
print(sum([i * (n // i) * (n // i + 1) // 2 for i in range(1,n+1)]))
| [
"call.arguments.change",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 336,065 | 336,066 | u389007679 | python |
p02624 | n = int(input())
print(int(sum([i * (n / i) * (n / i + 1) // 2 for i in range(1,n+1)]))) | n = int(input())
print(sum([i * (n // i) * (n // i + 1) // 2 for i in range(1,n+1)])) | [
"call.arguments.change",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 336,065 | 336,067 | u389007679 | python |
p02624 |
n = int(input())
ans = 0
def calc(b,e):
cnt = e // b
return (b + e) * cnt // 2
for i in range(1, n+1):
ans += calc(i, n//i * i)
print(ans)
print(ans) |
n = int(input())
ans = 0
def calc(b,e):
cnt = e // b
return (b + e) * cnt // 2
for i in range(1, n+1):
ans += calc(i, n//i * i)
print(ans) | [
"call.remove"
] | 336,073 | 336,074 | u638353713 | python |
p02624 | N = int(input())
ans = 0
for X in range(1, n+1):
Y = n // X
ans += Y * (Y + 1) // 2 * X
print(ans)
| N = int(input())
ans = 0
for X in range(1, N+1):
Y = N // X
ans += Y * (Y + 1) // 2 * X
print(ans)
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"assignment.value.change"
] | 336,088 | 336,089 | u709304134 | python |
p02624 | import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
import math
from copy import deepcopy
import queue
#import numpy as np
# sympy as syp(素因数分解とか)
Mod = 1000000007
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]
for i ... | import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
import math
from copy import deepcopy
import queue
#import numpy as np
# sympy as syp(素因数分解とか)
Mod = 1000000007
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]
for i ... | [
"call.add"
] | 336,102 | 336,103 | u928784113 | python |
p02624 | N=int(input())
print(sum((N//i)*(N//i*1)//2)*i for i in range(1,N+1))
| N=int(input())
print(sum([((N//i)*(N//i+1)//2)*i for i in range(1,N+1)]))
| [
"call.arguments.add",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 336,116 | 336,117 | u375616706 | python |
p02624 | if __name__ == '__main__':
n = int(input().strip())
ans = 0
for i in range(1, n+1):
limit = int(n / i)
ans += limit * (limit + 1) / 2
print(int(ans)) | if __name__ == '__main__':
n = int(input().strip())
ans = 0
for i in range(1, n + 1):
limit = int(n / i)
ans += limit * (limit + 1) * i / 2
print(int(ans))
| [
"expression.operation.binary.add"
] | 336,131 | 336,132 | u845416499 | python |
p02624 | N = int(input())
ans = 0
for i in range(1,N+1):
last = N//j
ans += ((1+last)*last//2)*i
print(ans) | N = int(input())
ans = 0
for i in range(1,N+1):
last = N//i
ans += ((1+last)*last//2)*i
print(ans) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 336,161 | 336,162 | u679520304 | python |
p02624 | n=int(input())
ans=0
for i in range(n):
y=n//i
ans+=y*(y+1)*i//2
print(ans) | n=int(input())
ans=0
for i in range(1,n+1):
y=n//i
ans+=y*(y+1)*i//2
print(ans) | [
"call.arguments.add"
] | 336,170 | 336,171 | u125348436 | python |
p02624 | import math
n=int(input())
l=[4 if i%2==0 else 2 for i in range(n+1)]
l[1]=1
l[2]=2
l[4]=3
for i in range(3,int(math.sqrt(n))+1):#振るい
for j in range(i,n//i+1):
# print(i,i*j)
if i==j:
l[i*j]+=1
else:
l[i*j]+=2
#print(l)
l2=[i*l[i] for i in range(n+1)]
print(sum(l2))
| import math
n=int(input())
l=[4 if i%2==0 else 2 for i in range(max(5,n+1))]
l[1]=1
l[2]=2
l[4]=3
for i in range(3,int(math.sqrt(n))+1):#振るい
for j in range(i,n//i+1):
# print(i,i*j)
if i==j:
l[i*j]+=1
else:
l[i*j]+=2
#print(l)
l2=[i*l[i] for i in range(n+1)]
print(sum(l2))
| [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 336,174 | 336,175 | u519968172 | python |
p02624 | import math
n=int(input())
l=[4 if i%2==0 else 2 for i in range(n+1)]
l[1]=1
l[2]=2
l[4]=3
for i in range(3,int(math.sqrt(n))+1):
for j in range(i,n//i+1):
# print(i,i*j)
if i==j:
l[i*j]+=1
else:
l[i*j]+=2
#print(l)
l2=[i*l[i] for i in range(n+1)]
print(sum(l2))
| import math
n=int(input())
l=[4 if i%2==0 else 2 for i in range(max(5,n+1))]
l[1]=1
l[2]=2
l[4]=3
for i in range(3,int(math.sqrt(n))+1):#振るい
for j in range(i,n//i+1):
# print(i,i*j)
if i==j:
l[i*j]+=1
else:
l[i*j]+=2
#print(l)
l2=[i*l[i] for i in range(n+1)]
print(sum(l2))
| [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 336,176 | 336,175 | u519968172 | python |
p02624 | n = int(input())
sum = 0
for k in range(1,n+1):
y = n // i
sum += y*(y+1)*i//2
print(sum) | n = int(input())
ans = 0
for i in range(1, n+1):
y = n//i
ans += y*(y+1)*i//2
print(ans) | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 336,208 | 336,209 | u954170646 | python |
p02624 | n = int(input())
sum = 0
for k in range(1,n+1):
y = n // i
sum += y*(y+1)*i//2
print(sum) | n = int(input())
ans = 0
for i in range(1, n + 1):
y = n // i
ans += y * (y + 1) * i // 2
print(ans)
| [
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 336,208 | 336,210 | u954170646 | python |
p02624 | import sympy
N=int(input())
count=0
for i in range(1,N+1):
n=N//i
count=n*(i+i*n)//(2)+count
print(count)
|
N=int(input())
count=0
for i in range(1,N+1):
n=N//i
count=n*(i+i*n)//(2)+count
print(count)
| [] | 336,221 | 336,222 | u750822433 | python |
p02624 | def multiple_sum(x, n):
# x + 2x + ... + kx(<= n)
k = n // x
return x * (k + 1) * k // 2
def solve(N: int):
ans = 0
for i in range(1, N + 1):
ans += multiple_sum(i, N)
print(ans)
return
# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the defa... | #!/usr/bin/env python3
import sys
def multiple_sum(x, n):
# x + 2x + ... + kx(<= n)
k = n // x
return x * (k + 1) * k // 2
def solve(N: int):
ans = 0
for i in range(1, N + 1):
ans += multiple_sum(i, N)
print(ans)
return
# Generated by 1.1.7.1 https://github.com/kyuridenamida/atco... | [] | 336,235 | 336,236 | u329232967 | python |
p02624 | n = int(input())
result = 0
for i in range(1,(n // 2 + 1)):
terms = n // i
result += terms * (terms * i + i) // 2
terms = n - n // 2
result += terms * (n // 2 + n) // 2
print(result) | n = int(input())
result = 0
for i in range(1,(n // 2 + 1)):
terms = n // i
result += terms * (terms * i + i) // 2
terms = n - n // 2
result += terms * (n // 2 + 1 + n) // 2
print(result) | [
"expression.operation.binary.add"
] | 336,253 | 336,254 | u072284094 | python |
p02624 | n=int(input())
a=0
for i in range(1,n+1):
a+=(i+(n//i)*i)*(n//i)//2
print(i) | n=int(input())
a=0
for i in range(1,n+1):
a+=(i+(n//i)*i)*(n//i)//2
print(a) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 336,257 | 336,258 | u623819879 | python |
p02624 | n=int(imput())
ans=0
for i in range(n):
i=i+1
a=i
y=n//i
ans+=(i*y*(y+1)/2)
print(ans) | n=int(input())
ans=0
for i in range(n):
i=i+1
a=i
y=n//i
ans+=(i*y*(y+1)/2)
print(int(ans)) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.add"
] | 336,278 | 336,279 | u007074599 | python |
p02624 | n=int(input())
ans=0
for i in rabge(1,n+1):
num=n//i
ans+=i*num*(num+1)/2
print(ans) | n=int(input())
ans=0
for i in range(1,n+1):
num=n//i
ans+=i*num*(num+1)//2
print(ans)
| [
"identifier.change",
"call.function.change",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 336,328 | 336,327 | u999503965 | python |
p02624 | n=int(input())
ans=0
for i in range(1,n+1):
A=n//i
ans+=((A**2+A)*i//2)
print(ans) | n=int(input())
ans=0
for i in range(1,n+1):
A=n//i
ans+=((A*A+A)*i//2)
print(ans) | [] | 336,343 | 336,344 | u926046014 | python |
p02624 | n=int(input())
ans=0
for i in range(1,n+1):
A=n//i
ans+=(A*(A+1)//2+i)
print(ans) | n=int(input())
ans=0
for i in range(1,n+1):
A=n//i
ans+=(A*(A+1)*i//2)
print(ans) | [
"expression.operation.binary.remove"
] | 336,345 | 336,346 | u926046014 | python |
p02624 | n=int(input())
ans=0
for i in range(1,n+1):
A=n//i
ans+=((A**2+A)*i//2)
print(ans) | n=int(input())
ans=0
for i in range(1,n+1):
A=n//i
ans+=(A*(A+1)*i//2)
print(ans) | [
"expression.operation.binary.remove",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 336,343 | 336,346 | u926046014 | python |
p02624 | N = int(input())
ans = 0
for i in range(1, N + 1):
start = i
n = N // i
end = i * n
ans += n * (n + 1) // 2
print(ans)
| N = int(input())
ans = 0
for i in range(1, N + 1):
start = i
n = N // i
end = i * n
ans += n * (start + end) // 2
print(ans)
| [
"identifier.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove"
] | 336,361 | 336,362 | u677267454 | python |
p02624 | n=int(input())
import math
c=0
for i in range(1,n//2):
k=n//i
c+=i*k*(k+1)/2
for i in range(n//2+1,n+1):
c+=i
print(int(c))
| n=int(input())
import math
c=0
for i in range(1,n//2+1):
k=n//i
c+=i*k*(k+1)/2
for i in range(n//2+1,n+1):
c+=i
print(int(c)) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 336,428 | 336,429 | u425184437 | python |
p02624 | # -*- coding: utf-8 -*-
N, = map(int, input().split())
ans = 0
ans = 0
for k in range(N, 0, -1):
mi = int(N/k)
sum_num = (1+mi) * (mi//2) if mi%2==0 else (mi-1) * ((mi-1)//2) + mi
ans += k * sum_num
print(ans)
| # -*- coding: utf-8 -*-
N, = map(int, input().split())
ans = 0
ans = 0
for k in range(N, 0, -1):
mi = int(N/k)
sum_num = (1+mi) * (mi//2) if mi%2==0 else mi * ((mi-1)//2) + mi
ans += k * sum_num
print(ans)
| [] | 336,486 | 336,487 | u605151360 | python |
p02625 | n, m = map(int, input().split())
a,M,d=1,10**9+7,[1]*(n+1)
for i in range(n):
d[i+1]=((m-n+1)*d[i]+i*d[i-1])%M
a=a*(m-1)%M
print(a*d[-1]%M) | n,m=map(int,input().split())
a,M,d=1,10**9+7,[1]*(n+1)
for i in range(n):
d[i+1]=((m-n+i)*d[i]+i*d[i-1])%M
a=a*(m-i)%M
print(a*d[-1]%M)
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 336,654 | 336,655 | u954170646 | python |
p02625 | MOD = 10**9 + 7
MAX = 5*10**5 + 1
fact = [0 for _ in range(MAX)]
factinv = [0 for _ in range(MAX)]
fact[0] = 1
for k in range(1, MAX):
fact[k] = fact[k - 1]*k
fact[k] %= MOD
factinv[MAX - 1] = pow(fact[MAX - 1], MOD - 2, MOD)
for k in range(MAX - 1, 0, -1):
factinv[k - 1] = factinv[k]*k
factinv[k - 1... | MOD = 10**9 + 7
MAX = 5*10**5 + 1
fact = [0 for _ in range(MAX)]
factinv = [0 for _ in range(MAX)]
fact[0] = 1
for k in range(1, MAX):
fact[k] = fact[k - 1]*k
fact[k] %= MOD
factinv[MAX - 1] = pow(fact[MAX - 1], MOD - 2, MOD)
for k in range(MAX - 1, 0, -1):
factinv[k - 1] = factinv[k]*k
factinv[k - 1... | [
"control_flow.branch.if.condition.change"
] | 336,660 | 336,661 | u943004959 | python |
p02625 | MOD = 10**9 + 7
MAX = 5*10**5 + 1
fact = [0 for _ in range(MAX)]
factinv = [0 for _ in range(MAX)]
fact[0] = 1
for k in range(1, MAX):
fact[k] = fact[k - 1]*k
fact[k] %= MOD
factinv[MAX - 1] = pow(fact[MAX - 1], MOD - 2, MOD)
for k in range(MAX - 1, 0, -1):
factinv[k - 1] = fact[k]*k
factinv[k - 1] %... | MOD = 10**9 + 7
MAX = 5*10**5 + 1
fact = [0 for _ in range(MAX)]
factinv = [0 for _ in range(MAX)]
fact[0] = 1
for k in range(1, MAX):
fact[k] = fact[k - 1]*k
fact[k] %= MOD
factinv[MAX - 1] = pow(fact[MAX - 1], MOD - 2, MOD)
for k in range(MAX - 1, 0, -1):
factinv[k - 1] = factinv[k]*k
factinv[k - 1... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 336,663 | 336,661 | u943004959 | python |
p02625 | from functools import reduce
n, m = map(int, input().split())
mod = 10 ** 9 + 7
ans = 0
c = 1
p1 = 1
p2 = reduce(lambda ac, v: ac * v % mod, range(m, m - n, -1), 1)
for i in range(n + 1):
if i > 0:
c = (c * (n - i + 1) * pow(i, mod - 2, mod)) % mod
p1 = (p1 * (n - i + 1)) % mod
p2 = (p2 * ... | from functools import reduce
n, m = map(int, input().split())
mod = 10 ** 9 + 7
ans = 0
c = 1
p1 = 1
p2 = reduce(lambda ac, v: ac * v % mod, range(m, m - n, -1), 1)
for i in range(n + 1):
if i > 0:
c = (c * (n - i + 1) * pow(i, mod - 2, mod)) % mod
p1 = (p1 * (m - i + 1)) % mod
p2 = (p2 * ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 336,669 | 336,670 | u461993794 | python |
p02625 | #atcoder template
def main():
import sys
imput = sys.stdin.readline
#文字列入力の時は上記はerrorとなる。
#ここにコード
#input
n, m = map(int, input().split())
#output
mod = pow(10, 9) + 7
n_ = 4 * pow(10, 5) + 5
fun = [1] * (n_+1)
for i in range(1, n_+1):
fun[i] = fun[i-1] * i % mod
... | #atcoder template
def main():
import sys
imput = sys.stdin.readline
#文字列入力の時は上記はerrorとなる。
#ここにコード
#input
n, m = map(int, input().split())
#output
mod = pow(10, 9) + 7
n_ = 5 * pow(10, 5) + 5
fun = [1] * (n_+1)
for i in range(1, n_+1):
fun[i] = fun[i-1] * i % mod
... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 336,685 | 336,686 | u461454424 | python |
p02625 | import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bise... | import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bise... | [
"identifier.change"
] | 336,703 | 336,704 | u201387466 | python |
p02625 | fac=[1]*505050
inv=[1]*505050
finv=[1]*505050
mod=1000000007
for i in range(1,500010):
fac[i]=fac[i-1]*i%mod
inv[i]=-inv[mod%i]*(mod//i)%mod
finv[i]=finv[i-1]*inv[i]%mod
def C(n,r):
if n<0 or r<0 or n<r: return 0
return fac[n]*finv[n-r]*finv[r]%mod
N,M=map(int,input().split())
ans=0
for i in range(N+1):
a... | fac=[1]*505050
inv=[1]*505050
finv=[1]*505050
mod=1000000007
for i in range(2,500010):
fac[i]=fac[i-1]*i%mod
inv[i]=-inv[mod%i]*(mod//i)%mod
finv[i]=finv[i-1]*inv[i]%mod
def C(n,r):
if n<0 or r<0 or n<r: return 0
return fac[n]*finv[n-r]*finv[r]%mod
N,M=map(int,input().split())
ans=0
for i in range(N+1):
a... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 336,707 | 336,708 | u168578024 | python |
p02625 | fac=[1]*505050
inv=[1]*505050
finv=[1]*505050
mod=1000000007
for i in range(1,500010):
fac[i]=fac[i-1]*i%mod
inv[i]=-inv[mod%i]*(mod//i)%mod
finv[i]=finv[i-1]*inv[i]%mod
def C(n,r):
if n<0 or r<0 or n<r: return 0
return fac[n]*inv[n-r]*inv[r]%mod
N,M=map(int,input().split())
ans=0
for i in range(N+1):
ans... | fac=[1]*505050
inv=[1]*505050
finv=[1]*505050
mod=1000000007
for i in range(2,500010):
fac[i]=fac[i-1]*i%mod
inv[i]=-inv[mod%i]*(mod//i)%mod
finv[i]=finv[i-1]*inv[i]%mod
def C(n,r):
if n<0 or r<0 or n<r: return 0
return fac[n]*finv[n-r]*finv[r]%mod
N,M=map(int,input().split())
ans=0
for i in range(N+1):
a... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 336,709 | 336,708 | u168578024 | python |
p02625 | fac=[1]*505050
inv=[1]*505050
finv=[1]*505050
mod=1000000007
for i in range(1,500010):
fac[i]=fac[i-1]*i%mod
inv[i]=-inv[mod%i]*(mod//i)%mod
finv[i]=finv[i-1]*inv[i]%mod
def C(n,r):
if n<0 or r<0 or n<r: return 0
return fac[n]*inv[n-r]*inv[r]%mod
N,M=map(int,input().split())
ans=0
for i in range(N+1):
ans... | fac=[1]*505050
inv=[1]*505050
finv=[1]*505050
mod=1000000007
for i in range(2,500010):
fac[i]=fac[i-1]*i%mod
inv[i]=-inv[mod%i]*(mod//i)%mod
finv[i]=finv[i-1]*inv[i]%mod
def C(n,r):
if n<0 or r<0 or n<r: return 0
return fac[n]*finv[n-r]*finv[r]%mod
N,M=map(int,input().split())
ans=0
for i in range(N+1):
a... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 336,710 | 336,708 | u168578024 | python |
p02625 | SIZE=5*10**5+1; MOD=10**9+7 #998244353 #ここを変更する
SIZE += 1
inv = [0]*SIZE # inv[j] = j^{-1} mod MOD
fac = [0]*SIZE # fac[j] = j! mod MOD
finv = [0]*SIZE # finv[j] = (j!)^{-1} mod MOD
inv[1] = 1
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
for i in range(2,SIZE):
inv[i] = MOD - (MOD//i)*inv[MOD%i]%MOD
fac[i] = f... | SIZE=5*10**5+1; MOD=10**9+7 #998244353 #ここを変更する
SIZE += 1
inv = [0]*SIZE # inv[j] = j^{-1} mod MOD
fac = [0]*SIZE # fac[j] = j! mod MOD
finv = [0]*SIZE # finv[j] = (j!)^{-1} mod MOD
inv[1] = 1
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
for i in range(2,SIZE):
inv[i] = MOD - (MOD//i)*inv[MOD%i]%MOD
fac[i] = f... | [
"literal.number.integer.change",
"expression.operation.binary.change"
] | 336,713 | 336,714 | u093861603 | python |
p02625 | SIZE=4*10**5+1; MOD=10**9+7 #998244353 #ここを変更する
SIZE += 1
inv = [0]*SIZE # inv[j] = j^{-1} mod MOD
fac = [0]*SIZE # fac[j] = j! mod MOD
finv = [0]*SIZE # finv[j] = (j!)^{-1} mod MOD
inv[1] = 1
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
for i in range(2,SIZE):
inv[i] = MOD - (MOD//i)*inv[MOD%i]%MOD
fac[i] = f... | SIZE=5*10**5+1; MOD=10**9+7 #998244353 #ここを変更する
SIZE += 1
inv = [0]*SIZE # inv[j] = j^{-1} mod MOD
fac = [0]*SIZE # fac[j] = j! mod MOD
finv = [0]*SIZE # finv[j] = (j!)^{-1} mod MOD
inv[1] = 1
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
for i in range(2,SIZE):
inv[i] = MOD - (MOD//i)*inv[MOD%i]%MOD
fac[i] = f... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 336,715 | 336,714 | u093861603 | python |
p02625 | SIZE=4*10**5+1; MOD=10**9+7 #998244353 #ここを変更する
SIZE += 1
inv = [0]*SIZE # inv[j] = j^{-1} mod MOD
fac = [0]*SIZE # fac[j] = j! mod MOD
finv = [0]*SIZE # finv[j] = (j!)^{-1} mod MOD
inv[1] = 1
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
for i in range(2,SIZE):
inv[i] = MOD - (MOD//i)*inv[MOD%i]%MOD
fac[i] = f... | SIZE=5*10**5+1; MOD=10**9+7 #998244353 #ここを変更する
SIZE += 1
inv = [0]*SIZE # inv[j] = j^{-1} mod MOD
fac = [0]*SIZE # fac[j] = j! mod MOD
finv = [0]*SIZE # finv[j] = (j!)^{-1} mod MOD
inv[1] = 1
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
for i in range(2,SIZE):
inv[i] = MOD - (MOD//i)*inv[MOD%i]%MOD
fac[i] = f... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 336,716 | 336,714 | u093861603 | python |
p02625 | MOD = 10 ** 9 + 7
N,M = map(int,input().split())
ans1 = 1
for i in range(N):
ans1 *= M - i
ans1 %= MOD
ans2 = [1,M-N]
for i in range(2,N+1):
ans2.append((ans2[-2] * (N-1) + ans2[-1] * (M-1))% MOD)
print(ans1 * ans2[N] % MOD) | MOD = 10 ** 9 + 7
N,M = map(int,input().split())
ans1 = 1
for i in range(N):
ans1 *= M - i
ans1 %= MOD
ans2 = [1,M-N]
for i in range(2,N+1):
ans2.append((ans2[-2] * (i -1) + ans2[-1] * (M - N + i - 1))% MOD)
print(ans1 * ans2[N] % MOD) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 336,721 | 336,722 | u242757684 | python |
p02626 | def main():
import sys
def input(): return sys.stdin.readline().rstrip()
n = int(input())
a = list(map(int, input().split()))
x = 0
for i in range(2, n):
x ^= a[i]
d = a[0]+a[1]-x
if d%2 == 1 or d < 0:
print(-1)
return
d >>= 1
if d&x != 0 or d > a[0]:
... | def main():
import sys
def input(): return sys.stdin.readline().rstrip()
n = int(input())
a = list(map(int, input().split()))
x = 0
for i in range(2, n):
x ^= a[i]
d = a[0]+a[1]-x
if d%2 == 1 or d < 0:
print(-1)
return
d >>= 1
if d&x != 0 or d > a[0]:
... | [
"control_flow.branch.if.condition.change"
] | 336,769 | 336,770 | u266014018 | python |
p02626 | def main():
import sys
def input(): return sys.stdin.readline().rstrip()
n = int(input())
a = list(map(int, input().split()))
x = 0
for i in range(2, n):
x ^= a[i]
d = a[0]+a[1]-x
if d%2 == 1 or d < 0:
print(-1)
return
d >>= 1
if d&x != 0 or d > a[0]:
... | def main():
import sys
def input(): return sys.stdin.readline().rstrip()
n = int(input())
a = list(map(int, input().split()))
x = 0
for i in range(2, n):
x ^= a[i]
d = a[0]+a[1]-x
if d%2 == 1 or d < 0:
print(-1)
return
d >>= 1
if d&x != 0 or d > a[0]:
... | [
"control_flow.branch.if.condition.change"
] | 336,769 | 336,771 | u266014018 | python |
p02626 | N = int(input())
A = list(map(int, input().split()))
XOR = 0
for el in A[2:]:
XOR ^= el
if (A[0] + A[1] - XOR) % 2 != 0:
print(-1)
exit(0)
AND = (A[0] + A[1] - XOR) // 2
if XOR & AND != 0:
print(-1)
exit(0)
ok = False
u = 0
v = 0
bits = list()
for bit in range(60, -1, -1):
if XOR >> bit & 1... | N = int(input())
A = list(map(int, input().split()))
XOR = 0
for el in A[2:]:
XOR ^= el
if (A[0] + A[1] - XOR) % 2 != 0:
print(-1)
exit(0)
AND = (A[0] + A[1] - XOR) // 2
if XOR & AND != 0:
print(-1)
exit(0)
ok = False
u = 0
v = 0
bits = list()
for bit in range(60, -1, -1):
if XOR >> bit & 1... | [
"control_flow.branch.if.condition.change"
] | 336,774 | 336,775 | u478275206 | python |
p02626 | n = int(input())
a = list(map(int,input().split()))
x = 0
for i in range(2,n):
x ^= a[i]
s = a[0]+a[1]
if s < x or (s-x) % 2 == 1:
print(-1)
exit()
d = (s-x)//2
if d & x != 0 or d >= a[0]:
print(-1)
exit()
i = 50
ans = d
while i >= 0:
if x >> i & 1:
if (1 << i) + ans <= a[0]:
... | n = int(input())
a = list(map(int,input().split()))
x = 0
for i in range(2,n):
x ^= a[i]
s = a[0]+a[1]
if s < x or (s-x) % 2 == 1:
print(-1)
exit()
d = (s-x)//2
if d & x != 0 or d > a[0]:
print(-1)
exit()
i = 50
ans = d
while i >= 0:
if x >> i & 1:
if (1 << i) + ans <= a[0]:
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 336,780 | 336,781 | u201928947 | python |
p02626 | n = int(input())
a = list(map(int,input().split()))
x = 0
for i in range(2,n):
x ^= a[i]
s = a[0]+a[1]
if s < x or (s-x) % 2 == 1:
print(-1)
exit()
d = (s-x)//2
if d & x != 0 or d >= a[0]:
print(-1)
exit()
i = 50
ans = d
while i >= 0:
if x >> i & 1:
if (1 << i) + ans < a[0]:
... | n = int(input())
a = list(map(int,input().split()))
x = 0
for i in range(2,n):
x ^= a[i]
s = a[0]+a[1]
if s < x or (s-x) % 2 == 1:
print(-1)
exit()
d = (s-x)//2
if d & x != 0 or d > a[0]:
print(-1)
exit()
i = 50
ans = d
while i >= 0:
if x >> i & 1:
if (1 << i) + ans <= a[0]:
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 336,782 | 336,781 | u201928947 | python |
p02626 | N = int(input())
A = [int(a) for a in input().split()]
t = 0
for a in A[2:]:
t ^= a
s = sum(A[:2])
if s < t or (s ^ t) & 1:
print(-1)
exit()
u = (s - t) // 2
a = A[0]
n = 0
for i in range(40)[::-1]:
b, c = (t >> i) & 1, (u >> i) & 1
if b == c == 1:
print(-1)
exit()
if b == 0 an... | N = int(input())
A = [int(a) for a in input().split()]
t = 0
for a in A[2:]:
t ^= a
s = sum(A[:2])
if s < t or (s ^ t) & 1:
print(-1)
exit()
u = (s - t) // 2
a = A[0]
n = 0
for i in range(40)[::-1]:
b, c = (t >> i) & 1, (u >> i) & 1
if b == c == 1:
print(-1)
exit()
if b == 0 and... | [
"control_flow.branch.if.condition.change"
] | 336,862 | 336,863 | u864197622 | python |
p02626 | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n,*a = map(int,read().split())
v = 0
for i in a[2:]:
v ^= i
w = a[0]+a[1]
z = w-v
if z&1==1 or z<0:
print(-1)
else:
z //= 2
"""
z = p&q
v = p^q
"""
if z&v:
print(-1)
exit(... | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n,*a = map(int,read().split())
v = 0
for i in a[2:]:
v ^= i
w = a[0]+a[1]
z = w-v
if z&1==1 or z<0:
print(-1)
else:
z //= 2
"""
z = p&q
v = p^q
"""
if z&v:
print(-1)
exit(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 336,864 | 336,865 | u875291233 | python |
p02627 | S=input()
if(S>='A'):
print('A')
else:
print('a') | S=input()
if(S>='a'):
print('a')
else:
print('A')
| [
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change",
"call.remove",
"call.add"
] | 336,888 | 336,889 | u430394202 | python |
p02627 | n = input()
s = abcdefghijklmnopqrstuvwxyz
if n in s:
print("a")
else:
print("A") | n = input()
s = "abcdefghijklmnopqrstuvwxyz"
if n in s:
print("a")
else:
print("A")
| [] | 336,892 | 336,893 | u637387397 | python |
p02627 | from sys import stdin
input = stdin.readline
a = input().rstrip()
if a.isupper is True:
print("A")
else:
print("a") | from sys import stdin
input = stdin.readline
a = input().rstrip()
if a.isupper():
print("A")
else:
print("a") | [] | 336,894 | 336,895 | u298976461 | python |
p02627 | from sys import stdin
input = stdin.readline
a = input().rstrip()
if a.isupper:
print("A")
else:
print("a") | from sys import stdin
input = stdin.readline
a = input().rstrip()
if a.isupper():
print("A")
else:
print("a") | [
"control_flow.branch.if.condition.change",
"call.add"
] | 336,896 | 336,895 | u298976461 | python |
p02627 | a = input()
if a.islower():
ptint('a')
else:
print('A') | a = input()
if a.islower():
print('a')
else:
print('A')
| [
"identifier.change",
"call.function.change"
] | 336,898 | 336,899 | u869448801 | python |
p02627 | alf=input()
if alf.islower():
print(a)
else:
print(A) | alf=input()
if alf.islower():
print("a")
else:
print("A")
| [
"call.arguments.change"
] | 336,907 | 336,908 | u689723321 | python |
p02627 | x = input()
y = x.isupper
if (y == True):
print("A")
else:
print("a") | x = input()
y = x.isupper()
if (y == True):
print("A")
else:
print("a") | [
"call.add"
] | 336,909 | 336,910 | u625864724 | python |
p02627 | a=input()
import string
list1=list(string.ascii_lowercase)
if a in list1 == 'true':
print('a')
else:
print('A') | a=input()
import string
list1=list(string.ascii_lowercase)
if a in list1:
print('a')
else:
print('A') | [] | 336,911 | 336,912 | u969081133 | python |
p02627 | a = input()
if a.isupper():
print(A)
else:
print(a) | a = input()
if a.isupper():
print("A")
else:
print("a") | [
"call.arguments.change"
] | 336,913 | 336,914 | u063346608 | python |
p02627 | t="qwertyuioplkjhgfdsazxcvbnm"
T="QWERTYUIOPLKJHGFDSAZXCVBNM"
a=str(input())
if a in t:
print(a)
else:
print(A) | t="qwertyuioplkjhgfdsazxcvbnm"
T="QWERTYUIOPLKJHGFDSAZXCVBNM"
a=str(input())
if a in t:
print('a')
else:
print('A') | [
"call.arguments.change"
] | 336,923 | 336,922 | u363320559 | python |
p02627 | α = int(input())
if α.isupper():
print('A')
else:
print('a') | α = input()
if α.isupper():
print('A')
else:
print('a') | [
"call.remove",
"call.arguments.change"
] | 336,929 | 336,930 | u266262808 | python |
p02627 | α = int(input())
if str.isupper(α):
print('A')
else:
print('a') | α = input()
if α.isupper():
print('A')
else:
print('a') | [
"call.remove",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 336,931 | 336,930 | u266262808 | python |
p02627 | α = int(input())
if str.isupper():
print('A')
else:
print('a') | α = input()
if α.isupper():
print('A')
else:
print('a') | [
"call.remove",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 336,932 | 336,930 | u266262808 | python |
p02627 | alpha = input()
if alpha < 'A':
print('a')
else:
print('A') | alpha = input()
if alpha.islower():
print('a')
else:
print('A') | [] | 336,952 | 336,953 | u454145409 | python |
p02627 | A = input()
print('A') if A.issuper() else print('a')
| A = input()
print('A') if A.isupper() else print('a') | [
"identifier.change"
] | 336,997 | 336,998 | u153955689 | python |
p02627 | W = input()
if W.isupper:
print('A')
else:
print('a') | alpha = input()
if alpha.isupper():
print('A')
else:
print('a') | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 336,999 | 337,000 | u290866833 | python |
p02627 | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
s = input()
if 'a' < s and s < 'z':
print("a")
else:
print("A")
if __name__=='__main__':
main() | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
s = input()
if 'a' <= s and s <= 'z':
print("a")
else:
print("A")
if __name__=='__main__':
main() | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 337,015 | 337,016 | u810356688 | python |
p02627 | a = input()
if a.isupper():
print('A')
else:
print('b') | a = str(input())
if a.isupper():
print('A')
else:
print('a') | [
"call.add",
"call.arguments.change",
"literal.string.change",
"io.output.change"
] | 337,018 | 337,019 | u843764230 | python |
p02627 | a = str(input())
if a.isupper():
print('A')
else:
print('b') | a = str(input())
if a.isupper():
print('A')
else:
print('a') | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 337,020 | 337,019 | u843764230 | python |
p02627 | test = str(input())
if test.isupper():
print('A')
else:
print('b') | a = str(input())
if a.isupper():
print('A')
else:
print('a') | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 337,021 | 337,019 | u843764230 | python |
p02627 | x = input()
if x.isupper:
print("A")
else:
print("a") | x = input()
if x.isupper() :
print("A")
else :
print("a")
| [
"control_flow.branch.if.condition.change",
"call.add"
] | 337,030 | 337,031 | u904331908 | python |
p02627 | print("Aa"[isupper(input()[0])]) | print("aA"[input().isupper()]) | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change",
"call.remove"
] | 337,058 | 337,059 | u321074777 | python |
p02627 | N = input()
A, a = 0, 0
for i in range(65, 90):
if i==ord(N):
A += 1
for i in range(97, 123):
if i==ord(N):
a += 1
if A==1:
print('A')
if a==1:
print('a') | N = input()
A, a = 0, 0
for i in range(65, 91):
if i==ord(N):
A += 1
for i in range(97, 123):
if i==ord(N):
a += 1
if A==1:
print('A')
if a==1:
print('a') | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 337,060 | 337,061 | u450147945 | python |
p02627 | a = input()
if a.isupper():
print("A")
else:
peint("a")
| a = input()
if a == a.upper():
print("A")
else:
print("a")
| [
"control_flow.branch.if.condition.change",
"identifier.change",
"call.function.change"
] | 337,062 | 337,063 | u572612802 | python |
p02627 | x=input()
if str.isupper(x)==True:
print("A")
else:
print("B") | x=input()
if str.isupper(x)==True:
print("A")
else:
print("a") | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 337,066 | 337,067 | u894694822 | python |
p02627 | x=input()
if str.isupper(x)==True:
print(A)
else:
print(B) | x=input()
if str.isupper(x)==True:
print("A")
else:
print("a") | [
"call.arguments.change",
"io.output.change"
] | 337,068 | 337,067 | u894694822 | python |
p02627 | letter = str(input())
if letter.islower is True:
print('a')
else:
print('A') | letter = str(input())
if letter.islower() is True:
print('a')
else:
print('A') | [
"control_flow.branch.if.condition.change",
"call.add"
] | 337,100 | 337,101 | u979506439 | python |
p02627 | str = input()
if str.isupper()=="True":
print("A")
else:
print("a") | str = input()
if str.isupper()==True:
print("A")
else:
print("a") | [
"control_flow.branch.if.condition.change"
] | 337,102 | 337,103 | u701513230 | python |
p02627 | str = input()
if str.isupper()=="TRUE":
print("A")
else:
print("a") | str = input()
if str.isupper()==True:
print("A")
else:
print("a") | [
"control_flow.branch.if.condition.change"
] | 337,104 | 337,103 | u701513230 | python |
p02627 | str = input()
if str.isupper()==TRUE:
print("A")
else:
print("a") | str = input()
if str.isupper()==True:
print("A")
else:
print("a") | [
"control_flow.branch.if.condition.change"
] | 337,105 | 337,103 | u701513230 | python |
p02627 | a = str(input())
if a.upper():
print('A')
elif a.lower():
print('a')
| a=input()
if a.isupper():
print('A')
elif a.lower():
print('a') | [
"call.remove",
"call.arguments.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 337,112 | 337,113 | u187883751 | python |
p02627 | a = str(input())
if a.upper():
print('A')
elif a.lower():
print('a')
| a=input()
if a.isupper():
print('A')
elif a.lower():
print('a') | [
"call.remove",
"call.arguments.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 337,112 | 337,114 | u187883751 | python |
p02627 | a = input()
if a.isUpper():
print('A')
else:
print('a') | a = input()
if a.isupper():
print('A')
else:
print('a') | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 337,117 | 337,118 | u715435591 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.