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 |
|---|---|---|---|---|---|---|---|
p02712 | a = int(input())
n = 0
for i in range(1, a):
if i % 15 == 0:
continue
if i % 5 == 0:
continue
if i % 3 == 0:
continue
n += i
print(n)
| a = int(input())
n = 0
for i in range(1, a+1):
if i % 15 == 0:
continue
if i % 5 == 0:
continue
if i % 3 == 0:
continue
n += i
print(n)
| [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 474,823 | 474,824 | u763210820 | python |
p02712 | n = int(input())
ans = 0
for i in range(n):
if i % 3 == 0 or i % 5 == 0: continue
ans += i
print(ans) | n = int(input())
ans = 0
for i in range(1, n+1):
if i % 3 == 0 or i % 5 == 0: continue
ans += i
print(ans) | [
"call.arguments.add"
] | 474,829 | 474,830 | u763249708 | python |
p02712 | N = int(input())
x = 0
for i in range(N):
if i % 3 == 0:
continue
if i % 5 == 0:
continue
x += i
print(x)
| N = int(input())
x = 0
for i in range(1,N+1):
if i % 3 == 0:
continue
if i % 5 == 0:
continue
x += i
print(x)
| [
"call.arguments.add"
] | 474,837 | 474,838 | u282652245 | python |
p02712 | N = int(input())
ans = 0
for i in range(N):
if i % 3 != 0 and i % 5 != 0 and i % 15 != 0:
ans += i
print(ans)
| N = int(input())
ans = 0
for i in range(1, N+1):
if i % 3 != 0 and i % 5 != 0 and i % 15 != 0:
ans += i
print(ans)
| [
"call.arguments.add"
] | 474,845 | 474,846 | u370217787 | python |
p02712 | a = int(input())
counta = 0
for i in range(1,a):
if i%3 == 0 and i%5 == 0:
continue
elif i % 3 == 0:
continue
elif i % 5 == 0:
continue
else:
counta += i
print(counta) | a = int(input())
counta = 0
for i in range(1,a+1):
if i%3 == 0 and i%5 == 0:
continue
elif i % 3 == 0:
continue
elif i % 5 == 0:
continue
else:
counta += i
print(counta) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 474,851 | 474,852 | u299791633 | python |
p02712 | n = int(input())
su = 0
for i in range(n):
if i % 3 != 0 and i % 5 != 0:
su += i
print(su) | n = int(input())
su = 0
for i in range(1,n+1):
if i % 3 != 0 and i % 5 != 0:
su += i
print(su)
| [
"call.arguments.add"
] | 474,861 | 474,862 | u681409497 | python |
p02712 | n = int(input())
cnt = 0
for i in range(n):
if i%3!= 0 and i%5!=0:
cnt += i
print(cnt) | n = int(input())
cnt = 0
for i in range(1,n+1):
if i%3!= 0 and i%5!=0:
cnt += i
print(cnt) | [
"call.arguments.add"
] | 474,867 | 474,868 | u744034042 | python |
p02712 | n = int(input())
total = 0
for i in range(n):
if i % 3 != 0 and i % 5 != 0:
total += i
print(total) | n = int(input())
total = 0
for i in range(n+1):
if i % 3 != 0 and i % 5 != 0:
total += i
print(total) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 474,875 | 474,876 | u456342056 | python |
p02712 | b=int(input())
sum=0
for a in range(0,b):
if a%3 ==0 or a%5==0:
pass
else:
sum+=a
print(sum) | b=int(input())
sum=0
for a in range(0,b+1):
if a%3 ==0 or a%5==0:
pass
else:
sum+=a
print(sum) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 474,881 | 474,882 | u108898293 | python |
p02712 | # -*- coding: utf-8 -*-
N = int(input())
ans = 0
for i in range(N):
if i%3 == 0 or i%5 ==0:
pass
else:
ans += i
print(ans) | # -*- coding: utf-8 -*-
N = int(input())
ans = 0
for i in range(1, N+1):
if i%3 == 0 or i%5 ==0:
pass
else:
ans += i
print(ans) | [
"call.arguments.add"
] | 474,884 | 474,885 | u021763820 | python |
p02712 | def main():
n = int(input())
ans = 0
for i in range(n):
if (i%3==0) and (i%5==0):
continue
if (i%3==0):
continue
if (i%5==0):
continue
ans += i
print(ans)
main() | def main():
n = int(input())
ans = 0
for i in range(1, n+1):
if (i%3==0) and (i%5==0):
continue
if (i%3==0):
continue
if (i%5==0):
continue
ans += i
print(ans)
main() | [
"call.arguments.add"
] | 474,887 | 474,888 | u775681539 | python |
p02712 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
n = int(input().strip())
sum = 0
for i in range(n):
sum += i if i % 3 != 0 and i % 5 != 0 else 0
print(sum)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
n = int(input().strip())
sum = 0
for i in range(1, n + 1):
sum += i if i % 3 != 0 and i % 5 != 0 else 0
print(sum)
if __name__ == '__main__':
main()
| [
"call.arguments.add"
] | 474,892 | 474,893 | u388370899 | python |
p02712 | # -*- coding: utf-8 -*-
import sys
# 整数の入力
n = int(input())
s = 0
for i in range(1, n):
if i % 3 != 0 and i % 5 != 0:
s += i
print(s) | # -*- coding: utf-8 -*-
import sys
# 整数の入力
n = int(input())
s = 0
for i in range(1, n + 1):
if i % 3 != 0 and i % 5 != 0:
s += i
print(s) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 474,894 | 474,895 | u164471280 | python |
p02712 | # -*- coding: utf-8 -*-
def run():
n = int(input())
num = 0
for i in range(n):
if i % 3 == 0 or i % 5 == 0:
continue
num += i
print(num)
if __name__ == '__main__':
run()
| # -*- coding: utf-8 -*-
def run():
n = int(input())
num = 0
for i in range(n + 1):
if i % 3 == 0 or i % 5 == 0:
continue
num += i
print(num)
if __name__ == '__main__':
run()
| [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 474,902 | 474,903 | u053849548 | python |
p02712 | n = int(input())
ans = 0
for i in range(n):
if i % 3 == 0 or i % 5 == 0:
x = 0
else:
ans += i
print(ans) | n = int(input())
ans = 0
for i in range(1,n+1):
if i % 3 == 0 or i % 5 == 0:
x = 0
else:
ans += i
print(ans) | [
"call.arguments.add"
] | 474,904 | 474,905 | u201382544 | python |
p02713 | import math
k = int(input())
sum = []
for a in range(1,k+1):
for b in range(1,k+1):
ab = math.gcd(a,b)
for c in range(1,k+1):
sum += math.gcd(ab,c)
print(sum)
| import math
k = int(input())
sum = 0
for a in range(1,k+1):
for b in range(1,k+1):
ab = math.gcd(a,b)
for c in range(1,k+1):
sum += math.gcd(ab,c)
print(sum)
| [
"assignment.value.change"
] | 474,927 | 474,928 | u735975757 | python |
p02713 | from math import gcd
k = int(input())
ans = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
ans += gcd(gcd(a,c),b) | from math import gcd
k = int(input())
ans = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
ans += gcd(gcd(a,c),b)
print(ans) | [
"call.add"
] | 474,938 | 474,939 | u800396927 | python |
p02713 | import math
K = int(input())
gcd3 = 0
for a in range(1,K-1):
for b in range(a+1,K):
for c in range(b+1,K+1):
gcd3 += math.gcd(math.gcd(a,b),c)
gcd2 = 0
for a in range(1,K):
for b in range(a+1,K+1):
gcd2 += math.gcd(a,b)
ans = gcd3 * 6 + gcd2 * 3 + K*(K+1)//2
print(ans) | import math
K = int(input())
gcd3 = 0
for a in range(1,K-1):
for b in range(a+1,K):
for c in range(b+1,K+1):
gcd3 += math.gcd(math.gcd(a,b),c)
gcd2 = 0
for a in range(1,K):
for b in range(a+1,K+1):
gcd2 += math.gcd(a,b)
ans = gcd3 * 6 + gcd2 * 6 + K*(K+1)//2
print(ans)
| [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 474,947 | 474,948 | u706414019 | python |
p02713 | from math import gcd
k=map(int,input())
r=range(1,k+1)
ans=0
for i in r:
for j in r:
for k in r:
ans+=gcd(k,gcd(i,j))
print(ans)
# 間に合うはずなくない？？
| from math import gcd
k=int(input())
r=range(1,k+1)
ans=0
for i in r:
for j in r:
for k in r:
ans+=gcd(k,gcd(i,j))
print(ans)
# 間に合うはずなくない？？
| [
"call.remove",
"assignment.value.change",
"call.arguments.change"
] | 474,949 | 474,950 | u130900604 | python |
p02713 | from math import gcd
k=map(int,input())
r=range(1,k+1)
ans=0
for i in r:
for j in r:
for k in r:
ans+=gcd(k,gcd(i,j))
print(ans)
# 間に合うはずなくない？？ | from math import gcd
k=int(input())
r=range(1,k+1)
ans=0
for i in r:
for j in r:
for k in r:
ans+=gcd(k,gcd(i,j))
print(ans)
# 間に合うはずなくない？？
| [
"call.remove",
"assignment.value.change",
"call.arguments.change"
] | 474,951 | 474,950 | u130900604 | python |
p02713 | #162C
#Sum of gcd of Tuples (Easy)
import math
k=int(input())+1
ans=0
for a in range(1,k):
for b in range(1,k):
g=math.gcd(a,b)
for c in range(1,k):
ans+=gcd(g,c)
print(ans) | #162C
#Sum of gcd of Tuples (Easy)
import math
k=int(input())+1
ans=0
for a in range(1,k):
for b in range(1,k):
g=math.gcd(a,b)
for c in range(1,k):
ans+=math.gcd(g,c)
print(ans) | [] | 474,960 | 474,961 | u658915215 | python |
p02713 | k = int(input())
sum = 0
def euclid(a, b):
while b:
a, b = b, a%b
return a
for a in range(1, k + 1):
for b in range(a, k + 1):
for c in range(b, k + 1):
if a == b == c:
sum += a
elif a == b or b == c:
sum += euclid(euclid(a,b), c) * ... | k = int(input())
sum = 0
def euclid(a, b):
while b:
a, b = b, a % b
return a
for a in range(1, k + 1):
for b in range(a, k + 1):
for c in range(b, k + 1):
if a == b == c:
sum += a
elif a == b or b == c:
sum += euclid(euclid(a, b), c... | [
"expression.operation.binary.add"
] | 474,971 | 474,972 | u374449234 | python |
p02713 | # ABC 162
A = int(input())
# 最小公倍数
ans = 0
import math
for i in range(1,A+1):
for j in range(1,A+1):
for k in range(1,A+1):
ans += gcd(gcd(i,j),k)
print(ans) | A = int(input())
# 最小公倍数
ans = 0
from math import gcd
for i in range(1,A+1):
for j in range(1,A+1):
for k in range(1,A+1):
ans += gcd(gcd(i,j),k)
print(ans) | [] | 474,973 | 474,974 | u488178971 | python |
p02713 | import math
import queue
from collections import defaultdict
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
def factorization(n):
res = []
if n%2==0:
res.append(2)
for i in range(3,math.floor(n//... | import math
import queue
from collections import defaultdict
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
def factorization(n):
res = []
if n%2==0:
res.append(2)
for i in range(3,math.floor(n//... | [] | 474,979 | 474,980 | u509739538 | python |
p02713 | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, gcd
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgett... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, gcd
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgett... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.add"
] | 474,981 | 474,982 | u279460955 | python |
p02713 | from math import gcd
k = int(input())
num = 0
for a in range(0, k + 1):
for b in range(0, k + 1):
c = gcd(a, b)
num += sum(gcd(c, d) for d in range(1, k + 1))
print(num) | from math import gcd
k = int(input())
num = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
c = gcd(a, b)
num += sum(gcd(c, d) for d in range(1, k + 1))
print(num) | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 474,987 | 474,988 | u215341636 | python |
p02713 | K = int(input())
import math
import itertools
def better_gcd(a,b,c):
tup = set((a,b,c))
kinds = len(tup)
if kinds == 3:
return math.gcd(a, math.gcd(b, c)) * 6
elif kinds == 2:
return math.gcd(*tup) * 3
else:
return a
ans = 0
cands = list(itertools.combinations_with_replace... | K = int(input())
import math
import itertools
def better_gcd(a,b,c):
tup = set((a,b,c))
kinds = len(tup)
if kinds == 3:
return math.gcd(a, math.gcd(b, c)) * 6
elif kinds == 2:
return math.gcd(*tup) * 3
else:
return a
ans = 0
cands = list(itertools.combinations_with_replacem... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 474,989 | 474,990 | u221537793 | python |
p02713 | K = int(input())
import math
import itertools
def better_gcd(a,b,c):
tup = set((a,b,c))
kinds = len(tup)
if kinds == 3:
return math.gcd(a, math.gcd(b, c)) * 6
elif kinds == 2:
return math.gcd(*tup) * 3
else:
return a
ans = 0
cands = list(itertools.combinations_with_replace... | K = int(input())
import math
import itertools
def better_gcd(a,b,c):
tup = set((a,b,c))
kinds = len(tup)
if kinds == 3:
return math.gcd(a, math.gcd(b, c)) * 6
elif kinds == 2:
return math.gcd(*tup) * 3
else:
return a
ans = 0
cands = list(itertools.combinations_with_replacem... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 474,991 | 474,990 | u221537793 | python |
p02713 | K = int(input())
import math
import itertools
def better_gcd(a,b,c):
tup = set((a,b,c))
kinds = len(tup)
if kinds == 3:
return math.gcd(a, math.gcd(b, c)) * 6
elif kinds == 2:
return math.gcd(*tup) * 3
else:
return a
ans = 0
cands = list(itertools.combinations_with_replace... | K = int(input())
# K = 2
import math
import itertools
def better_gcd(a,b,c):
tup = set((a,b,c))
kinds = len(tup)
if kinds == 3:
return math.gcd(a, math.gcd(b, c)) * 6
elif kinds == 2:
return math.gcd(*tup) * 3
else:
return a
ans = 0
cands = list(itertools.combinations_with_... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 474,989 | 474,992 | u221537793 | python |
p02713 | K = int(input())
import math
import itertools
def better_gcd(a,b,c):
tup = set((a,b,c))
kinds = len(tup)
if kinds == 3:
return math.gcd(a, math.gcd(b, c)) * 6
elif kinds == 2:
return math.gcd(*tup) * 3
else:
return a
ans = 0
cands = list(itertools.combinations_with_replace... | K = int(input())
# K = 2
import math
import itertools
def better_gcd(a,b,c):
tup = set((a,b,c))
kinds = len(tup)
if kinds == 3:
return math.gcd(a, math.gcd(b, c)) * 6
elif kinds == 2:
return math.gcd(*tup) * 3
else:
return a
ans = 0
cands = list(itertools.combinations_with_... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 474,991 | 474,992 | u221537793 | python |
p02713 | import math
n = int(input())
ans = 0
for i in range(1,n):
for j in range(1, n):
for k in range(1, n):
ans += math.gcd(i, math.gcd(j, k))
print(ans) | import math
n = int(input())
ans = 0
for i in range(1,n+1):
for j in range(1, n+1):
for k in range(1, n+1):
ans += math.gcd(i, math.gcd(j, k))
print(ans) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 474,997 | 474,998 | u991134049 | python |
p02713 | import functions
from functools import reduce
K=int(input())
ans=K*(1+K)/2
for i in range(1, K+1):
for j in range(i+1, K+1):
ans+=functions.gcd(i,j)*6
for k in range(j+1,K+1):
ans+=reduce(functions.gcd, [i,j,k])*6
print(str(int(ans))) | import math
from functools import reduce
K=int(input())
ans=K*(1+K)/2
for i in range(1, K+1):
for j in range(i+1, K+1):
ans+=math.gcd(i,j)*6
for k in range(j+1,K+1):
ans+=reduce(math.gcd, [i,j,k])*6
print(str(int(ans))) | [
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 475,006 | 475,007 | u875049118 | python |
p02713 | import math
K = int(input())
S = 0
for i in range(K+1):
for j in range(K+1):
for l in range(K+1):
S = S + math.gcd(l, math.gcd(j,i))
print(S)
| import math
K = int(input())
S = 0
for i in range(1,K+1):
for j in range(1,K+1):
for l in range(1,K+1):
S = S + math.gcd(l, math.gcd(j,i))
print(S)
| [
"call.arguments.add"
] | 475,008 | 475,009 | u165436807 | python |
p02713 | # -*- coding: utf-8 -*-
import math
K = 2
ans_list = []
ans = 0
for a in range(1, K+1):
for b in range(1, K + 1):
for c in range(1, K + 1):
ans_list = [a, b, c]
gcd_ans = ans_list[0]
for item in ans_list:
gcd_ans = math.gcd(gcd_ans, item)
ans ... | # -*- coding: utf-8 -*-
import math
K = int(input())
ans_list = []
ans = 0
for a in range(1, K+1):
for b in range(1, K + 1):
for c in range(1, K + 1):
ans_list = [a, b, c]
gcd_ans = ans_list[0]
for item in ans_list:
gcd_ans = math.gcd(gcd_ans, item)
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 475,010 | 475,011 | u641545507 | python |
p02713 | import sys
input = sys.stdin.readline
from itertools import *
from functools import *
from collections import *
from heapq import heapify, heappop, heappush, heappushpop
import math
INF = float('inf')
NIL = - 1
import time
from functools import wraps
def stop_watch(func):
@wraps(func)
def wrapper(*args, **k... | import sys
input = sys.stdin.readline
from itertools import *
from functools import *
from collections import *
from heapq import heapify, heappop, heappush, heappushpop
import math
INF = float('inf')
NIL = - 1
import time
from functools import wraps
def stop_watch(func):
@wraps(func)
def wrapper(*args, **k... | [] | 475,022 | 475,023 | u554781254 | python |
p02713 | import numpy as np
K = int(input())
a = np.arange(a,K+1)
b = np.gcd.outer(np.gcd.outer(a, a), a)
print(np.sum(b))
| import numpy as np
K = int(input())
a = np.arange(1,K+1)
b = np.gcd.outer(np.gcd.outer(a, a), a)
print(np.sum(b)) | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 475,024 | 475,025 | u331997680 | python |
p02713 | a=int(input())
import math
print(sum(gcd(gcd(i,j),k)for i in range(1,a+1) for j in range(1,a+1) for k in range(1,a+1))) | a=int(input())
import math
print(sum(math.gcd(math.gcd(i,j),k)for i in range(1,a+1) for j in range(1,a+1) for k in range(1,a+1))) | [] | 475,027 | 475,028 | u387080888 | python |
p02713 | from math import gcd
n = int(input())
ans = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
for k in range(1, n + 1):
ans += gcd(gcd(i, j), k) | from math import gcd
n = int(input())
ans = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
for k in range(1, n + 1):
ans += gcd(gcd(i, j), k)
print(ans) | [
"call.add"
] | 475,031 | 475,032 | u443569380 | python |
p02713 | def gcd(a, b):
if a < b:
a_init = a
b = a
a = a_init
while b != 0:
r = a % b
a = b
b = r
return a
K = int(input())
count = 0
temp = []
for a in range(1, K+1):
for b in range(1, a):
temp.append(gcd(a, b))
for c in range(1, K+1):
for j in range(len(temp)):
count += gcd(c, temp[j]) * ... | def gcd(a, b):
if a < b:
a_init = a
a = b
b = a_init
while b != 0:
r = a % b
a = b
b = r
return a
K = int(input())
count = 0
temp = []
for a in range(1, K+1):
for b in range(1, a):
temp.append(gcd(a, b))
for c in range(1, K+1):
for j in range(len(temp)):
count += gcd(c, temp[j]) * ... | [
"assignment.variable.change"
] | 475,033 | 475,034 | u777499281 | python |
p02713 | def main():
k = int(input())
k1 = k + 1
sum = 0
for i in range(1, k1):
for j in range(1, k1):
for m in range(1, k1):
sum += math.gcd(math.gcd(i, j), m)
print(sum)
main() | import math
def main():
k = int(input())
k1 = k + 1
sum = 0
for i in range(1, k1):
for j in range(1, k1):
for m in range(1, k1):
sum += math.gcd(math.gcd(i, j), m)
print(sum)
main()
| [] | 475,041 | 475,042 | u266675845 | python |
p02713 | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(input())
count = 0
for i in range(1,K+1):
for j in range(i+1,K+1):
for k in range(j+1,K+1):
count += 6*(gcd(i,j,k))
for i in range(1,K+1):
for j in range(i+1,K+1):
count += 3*(gcd(i,j))
... | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(input())
count = 0
for i in range(1,K-1):
for j in range(i+1,K):
for k in range(j+1,K+1):
count += 6*(gcd(i,j,k))
for i in range(1,K):
for j in range(i+1,K+1):
count += 6*(gcd(i,j))
for... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove",
"literal.number.integer.change"
] | 475,045 | 475,046 | u129898499 | python |
p02713 | from math import gcd
k = int(input())
ans = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
ans = gcd(gcd(a,b),c)
print(ans)
| from math import gcd
k = int(input())
ans = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
ans += gcd(gcd(a,b),c)
print(ans)
| [
"assignment.value.change"
] | 475,061 | 475,062 | u068844030 | python |
p02713 | import math
K = int(input())
Sum = []
for a in range(1, K+1):
for b in range(1, K + 1):
gcd2 = math.gcd(i.j)
for c in range(1, K + 1):
gcd = math.gcd(gcd2, c)
Sum.append(gcd)
print(sum(Sum))
| import math
K = int(input())
Sum = []
for a in range(1, K+1):
for b in range(1, K + 1):
gcd2 = math.gcd(a, b)
for c in range(1, K + 1):
gcd = math.gcd(gcd2, c)
Sum.append(gcd)
print(sum(Sum)) | [] | 475,063 | 475,064 | u561294476 | python |
p02713 | from math import math
K = int(input())
cnt = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
cnt += gcd(gcd(i,j),k)
print(cnt) | from math import gcd
K = int(input())
cnt = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
cnt += gcd(gcd(i,j),k)
print(cnt) | [
"identifier.change"
] | 475,065 | 475,066 | u166621202 | python |
p02713 | K = int(input())
import math
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
a = gcd(i, j)
for k in range(1, K+1):
ans += gcd(a,k)
print(ans)
| K = int(input())
import math
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
a = math.gcd(i, j)
for k in range(1, K+1):
ans += math.gcd(a,k)
print(ans)
| [] | 475,067 | 475,068 | u423966555 | python |
p02713 | from sys import stdin
def gcd(x, y):
if x % y == 0:
return y
return gcd(y, x % y)
def main():
k = int(stdin.readline())
ans = 0
for a in range(1, k + 1):
for b in range(a, k + 1):
d = gcd(a, b)
for c in range(b, k + 1):
e = gcd(d, c)
... | from math import factorial
from sys import stdin
def gcd(x, y):
if x % y == 0:
return y
return gcd(y, x % y)
def main():
k = int(stdin.readline())
ans = 0
for a in range(1, k + 1):
for b in range(a, k + 1):
d = gcd(a, b)
for c in range(b, k + 1):
... | [] | 475,073 | 475,074 | u390727364 | python |
p02713 | import math
K=int(input())
total = 0
for a in range(1,K+1):
for b in range(a+1,K+1):
for c in range(b+1,K+1):
total += math.gcd(a, math.gcd(b,c) )
total *= 6
for a in range(1,K+1):
for b in range(a+1,K+1):
total += math.gcd(a, b)
total *= 6
for a in range(1,K+1):
total += a
print(total)
| import math
K=int(input())
total = 0
for a in range(1,K+1):
for b in range(a+1,K+1):
for c in range(b+1,K+1):
total += math.gcd(a, math.gcd(b,c) ) * 6
for a in range(1,K+1):
for b in range(a+1,K+1):
total += math.gcd(a, b)*6
for a in range(1,K+1):
total += a
print(total)
| [] | 475,075 | 475,076 | u252964975 | python |
p02713 | import math
k = int(input())
ans = 0
for a in range(k):
for b in range(k):
d = math.gcd(a + 1, b + 1)
for c in range(k):
ans += math(d, c + 1)
print(ans)
| import math
k = int(input())
ans = 0
for a in range(k):
for b in range(k):
d = math.gcd(a + 1, b + 1)
for c in range(k):
ans += math.gcd(d, c + 1)
print(ans)
| [] | 475,082 | 475,083 | u146057001 | python |
p02713 | n=int(input())
import math
ans=0
for i in range(2,n+1):
for j in range(1,n+1):
ij=math.gcd(i,j)
if ij==1:
ans+=n
else:
for k in range(1,n+1):
ans+=math.gcd(ij,k)
print(ans) | n=int(input())
import math
ans=0
for i in range(1,n+1):
for j in range(1,n+1):
ij=math.gcd(i,j)
if ij==1:
ans+=n
else:
for k in range(1,n+1):
ans+=math.gcd(ij,k)
print(ans) | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 475,089 | 475,090 | u901598613 | python |
p02713 | import math
K = 200 #int(input())
total = 0
for a in range(1, K + 1):
for b in range(1, K + 1):
ab = math.gcd(a, b)
for c in range(1, K + 1):
total += math.gcd(ab, c)
print(total) | import math
K = int(input())
total = 0
for a in range(1, K + 1):
for b in range(1, K + 1):
ab = math.gcd(a, b)
for c in range(1, K + 1):
total += math.gcd(ab, c)
print(total) | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 475,091 | 475,092 | u892882715 | python |
p02713 | import math
K = int(input())
sum = 0
for i in range(1,K+1):
for j in range(1,K+1):
temp = math.gcd(i,j)
for m in range(1,K+1):
sum = sum + math.gcv(temp,m)
print(sum) | import math
K = int(input())
sum = 0
for i in range(1,K+1):
for j in range(1,K+1):
temp = math.gcd(i,j)
for m in range(1,K+1):
sum = sum + math.gcd(temp,m)
print(sum) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 475,107 | 475,108 | u658627575 | python |
p02713 | from math import gcd
K = int(iniput())
sum_gcd = [0]*201
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
sum_gcd[gcd(i,j)] += 1
for i in range(1,K+1):
for k in range(1,K+1):
ans += sum_gcd[i]*gcd(i,k)
print(ans) | from math import gcd
K = int(input())
sum_gcd = [0]*201
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
sum_gcd[gcd(i,j)] += 1
for i in range(1,K+1):
for k in range(1,K+1):
ans += sum_gcd[i]*gcd(i,k)
print(ans) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 475,112 | 475,113 | u830881690 | python |
p02713 | from math import gcd
K = int(iniput())
sum_gcd = [0]*201
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
sum_gcd[gcd(i,j)] += 1
for i in range(1,K+1):
for k in range(1,K+1):
ans += GCD[i]*gcd(i,k)
print(ans) | from math import gcd
K = int(input())
sum_gcd = [0]*201
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
sum_gcd[gcd(i,j)] += 1
for i in range(1,K+1):
for k in range(1,K+1):
ans += sum_gcd[i]*gcd(i,k)
print(ans) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 475,114 | 475,113 | u830881690 | python |
p02713 | K = int(input())
S = 0
def gcd(a,b):
while b != 0:
a, b = b, a % b
if b ==0:
return a
A1 = [0,0]
A2 = [0,0,0]
for i in range(1, K):
S = S + i
if K > 1:
for j in range(1, K):
A1[0] = j
for k in range(j+1,K+1):
A1[1] = k
S += 6 * gcd(A1[1],A1[... | K = int(input())
S = 0
def gcd(a,b):
while b != 0:
a, b = b, a % b
if b ==0:
return a
A1 = [0,0]
A2 = [0,0,0]
for i in range(1, K+1):
S = S + i
if K > 1:
for j in range(1, K):
A1[0] = j
for k in range(j+1,K+1):
A1[1] = k
S += 6 * gcd(A1[1],A... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 475,119 | 475,120 | u973972117 | python |
p02713 | from math import gcd
k = int(input())
ans = 0
for i in range(1,k+1):
for j in range(1,k+1):
sub += gcd(i,j)
for l in range(1,k+1):
ans += gcd(sub,l)
print(ans)
| from math import gcd
k = int(input())
ans = 0
for i in range(1,k+1):
for j in range(1,k+1):
sub = gcd(i,j)
for l in range(1,k+1):
ans += gcd(sub,l)
print(ans) | [
"assignment.value.change"
] | 475,124 | 475,125 | u453623947 | python |
p02713 | from math import gcd
k = int(input())
ans = 0
for i in range(1,k+1):
for j in range(1,k+1):
sub += gcd(i,j)
for l in range(1,k+1):
ans += gcd(sub,l)
print(ans)
| from math import gcd
k=int(input())
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
ans_=gcd(i,j)
for l in range(1,k+1):
ans+=gcd(ans_,l)
print(ans)
| [
"identifier.change",
"call.arguments.change"
] | 475,124 | 475,126 | u453623947 | python |
p02713 | K = int(input())
x = np.arange(1, K + 1)
nums = np.gcd.outer(np.gcd.outer(x, x), x)
print(nums.sum()) | import numpy as np
K = int(input())
x = np.arange(1, K + 1)
nums = np.gcd.outer(np.gcd.outer(x, x), x)
print(nums.sum()) | [] | 475,134 | 475,135 | u699547221 | python |
p02713 | import math
k = int(input())+1
for i in range(1, k):
for j in range(1, k):
temp = math.gcd(i, j)
for x in range(1, k):
sum += math.gcd(temp, x)
print(sum) | import math
sum = 0
k = int(input())+1
for i in range(1, k):
for j in range(1, k):
temp = math.gcd(i, j)
for x in range(1, k):
sum += math.gcd(temp, x)
print(sum) | [
"assignment.add"
] | 475,148 | 475,149 | u167360450 | python |
p02713 | import math
k = int(input())+1
for i in range(1, k):
for j in range(1, k):
temp = math.gcd(i, j)
for x in range(1, k):
sum += math.gcd(temp, x)
print(sum) | import math
sum = 0
k = int(input())+1
for i in range(1, k):
for j in range(1, k):
temp = math.gcd(i, j)
for x in range(1, k):
sum += math.gcd(temp, x)
print(sum) | [
"assignment.add"
] | 475,150 | 475,149 | u167360450 | python |
p02713 | import math
k = int(input())+1
for i in range(1, k):
for j in range(1, k):
temp = math.gcd(i, j)
for x in range(1,k):
sum += math.gcd(temp,x)
print(sum) | import math
sum = 0
k = int(input())+1
for i in range(1, k):
for j in range(1, k):
temp = math.gcd(i, j)
for x in range(1, k):
sum += math.gcd(temp, x)
print(sum) | [
"assignment.add"
] | 475,151 | 475,149 | u167360450 | python |
p02713 | import math
k = int(input())
gcd_sum_dict = collections.defaultdict(int)
for i in range(1, k+1):
gcd_sum_dict[i] = 0
for j in range(1, k+1):
gcd_sum_dict[i] += gcd(i, j)
ans = 0
for i in range(1, k+1):
for j in range(1, k+1):
ans += gcd_sum_dict[gcd(i, j)]
print(ans) | import math
import collections
k = int(input())
gcd_sum_dict = collections.defaultdict(int)
for i in range(1, k+1):
gcd_sum_dict[i] = 0
for j in range(1, k+1):
gcd_sum_dict[i] += math.gcd(i, j)
ans = 0
for i in range(1, k+1):
for j in range(1, k+1):
ans += gcd_sum_dict[math.gcd(i, j)]
pr... | [] | 475,157 | 475,158 | u130203301 | python |
p02713 | #c
import math
k=int(input())
sum(math.gcd(math.gcd(a,b),c) for a in range(1,k+1)for b in range(1,k+1)for c in range(1,k+1)) | #c
import math
k=int(input())
print( sum(math.gcd(math.gcd(a,b),c) for a in range(1,k+1)for b in range(1,k+1)for c in range(1,k+1)) ) | [
"call.add",
"call.arguments.change"
] | 475,174 | 475,175 | u586759271 | python |
p02713 | from Math import gcd
K = int(input())
result = 0
for a in range(1, K + 1):
for b in range(1, K + 1):
for c in range(1, K + 1):
result += gcd(c, gcd(a, b))
print(result) | from math import gcd
K = int(input())
result = 0
for a in range(1, K + 1):
for b in range(1, K + 1):
for c in range(1, K + 1):
result += gcd(c, gcd(a, b))
print(result) | [
"identifier.change"
] | 475,178 | 475,179 | u118995404 | python |
p02713 | #!/usr/bin/env python3
import sys
import math
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.poplef... | #!/usr/bin/env python3
import sys
import math
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.poplef... | [
"call.add"
] | 475,180 | 475,181 | u480300350 | python |
p02713 | import math
K = int(input())
count = 0
for i in range(1,K+1):
for j in range(i,K+1):
for k in range(1,K+1):
if i != j:
count += math.gcd(math.gcd(i,j),k)
else:
count += math.gcd(math.gcd(i,j),k)
print(count) | import math
K = int(input())
count = 0
for i in range(1,K+1):
for j in range(i,K+1):
for k in range(1,K+1):
if i != j:
count += 2 * math.gcd(math.gcd(i,j),k)
else:
count += math.gcd(math.gcd(i,j),k)
print(count) | [
"expression.operation.binary.add"
] | 475,191 | 475,192 | u953110527 | python |
p02713 |
K = int(input())
ans = 0
for i in range(1, K+1):
for j in range(i, K+1):
for k in range(j, K+1):
if i==j and i==k: g = i
elif (i==j and i!=k):
g = math.gcd(i,math.gcd(j,k))*3
elif (i==k and i!=j):
g = math.gcd(i,math.gcd(j,k))*3
... | import math
K = int(input())
ans = 0
for i in range(1, K+1):
for j in range(i, K+1):
for k in range(j, K+1):
if i==j and i==k: g = i
elif (i==j and i!=k):
g = math.gcd(i,math.gcd(j,k))*3
elif (i==k and i!=j):
g = math.gcd(i,math.gcd(j,k))... | [] | 475,197 | 475,198 | u998733244 | python |
p02713 | from math import gcd
K = int(input());
sum = 0;
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
sum += gcd(gcd(a,b),c);
print(gcd)
| from math import gcd
K = int(input());
sum = 0;
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
sum += gcd(gcd(a,b),c);
print(sum)
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 475,199 | 475,200 | u508061226 | python |
p02713 | #ユークリッドの互除法
def euclid(m,n):
# m > n となるように入れ替え
if m < n:
m, n = n, m
while n != 0:
m, n = n, m % n
return m
num = int(input('')) #input()で入力を受け取ってint()で数字型に変換します。
ans_sum = 0
for a in range(1,num+1):
for b in range(1,num+1):
gcd_ab = euclid(a,num+1)
for c in rang... | #ユークリッドの互除法
def euclid(m,n):
# m > n となるように入れ替え
if m < n:
m, n = n, m
while n != 0:
m, n = n, m % n
return m
num = int(input('')) #input()で入力を受け取ってint()で数字型に変換します。
ans_sum = 0
for a in range(1,num+1):
for b in range(1,num+1):
gcd_ab = euclid(a,b)
for c in range(1,... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 475,214 | 475,215 | u514206029 | python |
p02713 | #ユークリッドの互除法
def euclid(m,n):
# m > n となるように入れ替え
if m < n:
m, n = n, m
while n != 0:
m, n = n, m % n
return m
num = int(input('')) #input()で入力を受け取ってint()で数字型に変換します。
ans_sum = 0
for a in range(1,num+1):
for b in range(1,a):
gcd_ab = euclid(a,num+1)
for c in range(1,... | #ユークリッドの互除法
def euclid(m,n):
# m > n となるように入れ替え
if m < n:
m, n = n, m
while n != 0:
m, n = n, m % n
return m
num = int(input('')) #input()で入力を受け取ってint()で数字型に変換します。
ans_sum = 0
for a in range(1,num+1):
for b in range(1,num+1):
gcd_ab = euclid(a,b)
for c in range(1,... | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 475,216 | 475,215 | u514206029 | python |
p02713 | import math
from functools import reduce
def gcd_list(numbers):
return reduce(math.gcd, numbers)
n=int(input())
l1=range(1,n+1)
l2=range(1,n+1)
l3=range(1,n+1)
count=0
for i in l1:
for j in l2:
te=gcd(i,j)
for k in l3:
count+=(te,k)
print(count) | import math
from functools import reduce
def gcd_list(numbers):
return reduce(math.gcd, numbers)
n=int(input())
l1=range(1,n+1)
l2=range(1,n+1)
l3=range(1,n+1)
count=0
for i in l1:
for j in l2:
te=math.gcd(i,j)
for k in l3:
count+=math.gcd(te,k)
print(count) | [] | 475,249 | 475,250 | u115877451 | python |
p02713 | import math
from functools import reduce
def resolve():
k = int(input())
ans = 0
for i in range(1, k+1):
for j in range(1, k + 1):
for k in range(1, k + 1):
ans += reduce(math.gcd, [i, j, k])
print(ans)
ressolve() | import math
from functools import reduce
def resolve():
k = int(input())
ans = 0
for i in range(1, k+1):
for j in range(1, k + 1):
for k in range(1, k + 1):
ans += reduce(math.gcd, [i, j, k])
print(ans)
resolve() | [
"identifier.change",
"call.function.change"
] | 475,264 | 475,265 | u423665486 | python |
p02713 | import math
k = int(input())
sum =0
for a in range(1, k+1):
for b in range(1, k+1):
x = gcd(a, b)
for c in range(1, k+1):
sum += gcd(x, c)
print(sum) | import math
k = int(input())
sum =0
for a in range(1, k+1):
for b in range(1, k+1):
x = math.gcd(a, b)
for c in range(1, k+1):
sum += math.gcd(x, c)
print(sum) | [] | 475,268 | 475,269 | u854992222 | python |
p02713 | import math
k = int(input())
sum =0
for a in range(1, k+1):
for b in range(1, k+1):
x = gcd(a, b)
for c in range(1, k+1):
sum += gcd(x, c)
print(sum) | from math import gcd
k = int(input())
sum =0
for a in range(1, k+1):
for b in range(1, k+1):
x = gcd(a, b)
for c in range(1, k+1):
sum += gcd(x, c)
print(sum) | [] | 475,268 | 475,270 | u854992222 | python |
p02713 | from itertools import combinations
import math
n = int(input())
ans = 0
for r in range(1,4):
if r>n:
break
for x in combinations([x+1 for x in range(n)],r):
if len(x)==1:
ans += x[0]
elif len(x)==2:
ans += math.gcd(x[0],x[1])*6
else:
tmp = ma... | from itertools import combinations
import math
n = int(input())
ans = 0
for r in range(1,4):
if r>n:
break
for x in combinations([x+1 for x in range(n)],r):
if len(x)==1:
ans += x[0]
elif len(x)==2:
ans += math.gcd(x[0],x[1])*6
else:
tmp = ma... | [
"call.add"
] | 475,282 | 475,280 | u500944229 | python |
p02713 | import math
K=int(input())
sum=0
for i in range(1, K):
for j in range(i, K+1):
for k in range(j, K+1):
sum+=math.gcd(math.gcd(i, j), k)
print(3*sum) | import math
K=int(input())
sum=0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
sum+=math.gcd(math.gcd(i, j), k)
print(sum) | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"expression.operation.binary.remove"
] | 475,283 | 475,284 | u337626942 | python |
p02713 | def gcd(a, b):
if a % b == 0:
return b
return gcd(b, a % b)
k = int(input())
sum = 0
# gcd(a,a,a)
sum += int((1+k)*k/2)
# gcd(a,b,b)
if k >= 2:
for i in range(1, k):
for j in range(1, k+1):
sum += gcd(i, j)*3
# gcd(a,b,c)
if k >= 3:
for i in range(1, k-1):
for j... | def gcd(a, b):
if a % b == 0:
return b
return gcd(b, a % b)
k = int(input())
sum = 0
# gcd(a,a,a)
sum += int((1+k)*k/2)
# gcd(a,b,b)
if k >= 2:
for i in range(1, k):
for j in range(i+1, k+1):
sum += gcd(i, j)*6
# gcd(a,b,c)
if k >= 3:
for i in range(1, k-1):
for... | [
"literal.number.integer.change",
"expression.operation.binary.change"
] | 475,310 | 475,311 | u197921942 | python |
p02713 | def gcd(a, b):
if a % b == 0:
return b
return gcd(b, a % b)
k = int(input())
sum = 0
# gcd(a,a,a)
sum += int((1+k)*k/2)
# gcd(a,b,b)
if k >= 2:
for i in range(1, k+1):
for j in range(1, k+1):
sum += gcd(i, j)*3
# gcd(a,b,c)
if k >= 3:
for i in range(1, k-1):
for... | def gcd(a, b):
if a % b == 0:
return b
return gcd(b, a % b)
k = int(input())
sum = 0
# gcd(a,a,a)
sum += int((1+k)*k/2)
# gcd(a,b,b)
if k >= 2:
for i in range(1, k):
for j in range(i+1, k+1):
sum += gcd(i, j)*6
# gcd(a,b,c)
if k >= 3:
for i in range(1, k-1):
for... | [
"expression.operation.binary.remove",
"literal.number.integer.change",
"expression.operation.binary.change"
] | 475,312 | 475,311 | u197921942 | python |
p02713 | import math
n=int(input())
s=0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
s+=gcd(i,gcd(j,k))
print(s)
| import math
n=int(input())
s=0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
s+=math.gcd(i,math.gcd(j,k))
print(s)
| [] | 475,315 | 475,316 | u606784601 | python |
p02713 | from math import gcd
N = int(input())
ans = sum([gcd(gcd(i,j),k) for i in range(N+1) for j in range(N+1) for k in range(N+1)])
print(ans)
| from math import gcd
N = int(input())
ans = sum([gcd(gcd(i,j),k) for i in range(1,N+1) for j in range(1,N+1) for k in range(1,N+1)])
print(ans)
| [
"call.arguments.add"
] | 475,319 | 475,320 | u706730549 | python |
p02713 | from math import gdc
K=int(input())
ans=0
for i in range(1,K+1):
for j in range(1,K+1):
for l in range(1,K+1):
ans+= gcd(gcd(i,j),l)
print(ans) | from math import gcd
K=int(input())
ans=0
for i in range(1,K+1):
for j in range(1,K+1):
for l in range(1,K+1):
ans+= gcd(gcd(l,j),i)
print(ans) | [
"identifier.change",
"call.arguments.change"
] | 475,341 | 475,342 | u640922335 | python |
p02713 | from math import gdc
K=int(input())
ans=0
for i in range(1,K+1):
for j in range(1,K+1):
for l in range(1,K+1):
ans+= gcd(gcd(l,j),i)
print(ans) | from math import gcd
K=int(input())
ans=0
for i in range(1,K+1):
for j in range(1,K+1):
for l in range(1,K+1):
ans+= gcd(gcd(l,j),i)
print(ans) | [
"identifier.change"
] | 475,343 | 475,342 | u640922335 | python |
p02713 | import math
"""
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
"""
K = int(input())
ans = 0
"""
for a in range(1 , K+1):
for b in range(1 ,K+1):
for c in range(1 , K+1):
ans = ans + gcd(a,b,c)
... | import math
"""
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
"""
K = int(input())
ans = 0
"""
for a in range(1 , K+1):
for b in range(1 ,K+1):
for c in range(1 , K+1):
ans = ans + gcd(a,b,c)
... | [
"expression.operation.binary.remove"
] | 475,354 | 475,355 | u228636605 | python |
p02713 | import math
K = int(input()) + 1
d = 0
for i in range(1, K):
for j in range(1, K):
for k in range(1, K):
d = gcd(i, j, k) + d
print(d) | from math import gcd
K = int(input()) + 1
d = 0
for i in range(1, K):
for j in range(1, K):
for k in range(1, K):
d = gcd(gcd(i, j), k) + d
print(d) | [
"call.add",
"call.arguments.change"
] | 475,363 | 475,364 | u042558137 | python |
p02713 | K = int(input())
ans = 0
import math
for i in range(1,K+1):
for j in range(i,K+1):
tmp = math.gcd(i,j)
for k in range(j,K+1):
ans += math.gcd(tmp,k)
print(ans) | K = int(input())
ans = 0
import math
for i in range(1,K+1):
for j in range(1,K+1):
tmp = math.gcd(i,j)
for k in range(1,K+1):
ans += math.gcd(tmp,k)
print(ans) | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 475,371 | 475,372 | u698919163 | python |
p02713 | import math
n=int(input())
ans=0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
ans+=gcd(gcd(i,j),k)
print(ans) | from math import gcd
n = int(input())
ans = 0
for i in range(1, n + 1):
for j in range(1,n+1):
for k in range(1, n + 1):
ans += gcd(gcd(i, j), k)
print(ans) | [] | 475,381 | 475,382 | u104005543 | python |
p02713 | import math
n=int(input())
ans=0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
ans+=gcd(gcd(i,j),k)
print(ans) | from math import gcd
n=int(input())
ans=0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
ans+=gcd(gcd(i,j),k)
print(ans) | [] | 475,381 | 475,383 | u104005543 | python |
p02713 | import math
K = int(input())
t = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
t += gcd(gcd(i,j),k)
print(t) | from math import gcd
K = int(input())
t = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
t += gcd(gcd(i,j),k)
print(t) | [] | 475,386 | 475,387 | u336093806 | python |
p02713 | k=int(input())
from math import gcd
res=0
for n in range(1,k+1):
for i in range(1,k+1):
for j in range(1,k+1):
res+=math.gcd(math.gcd(n,i),j)
print(res) | k=int(input())
from math import gcd
res=0
for n in range(1,k+1):
for i in range(1,k+1):
for j in range(1,k+1):
res+=gcd(gcd(n,i),j)
print(res) | [] | 475,394 | 475,395 | u574590381 | python |
p02713 | k=int(input())
import math
res=0
for n in range(1,k+1):
for i in range(1,k+1):
for j in range(1,k+1):
res+=math.gcd(gcd(n,i),j)
print(res) | k=int(input())
from math import gcd
res=0
for n in range(1,k+1):
for i in range(1,k+1):
for j in range(1,k+1):
res+=gcd(gcd(n,i),j)
print(res) | [] | 475,396 | 475,395 | u574590381 | python |
p02713 | a = int(input())
from math import gcd
b = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
for k in range(1, n + 1):
b += gcd(gcd(i, j), k)
print(b) | a = int(input())
from math import gcd
b = 0
for i in range(1, a + 1):
for j in range(1, a + 1):
for k in range(1, a + 1):
b += gcd(gcd(i, j), k)
print(b) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 475,399 | 475,400 | u004482945 | python |
p02713 | from math import gcd
n=int(input())
ans=0
for i in range(n+1):
for j in range(n+1):
gcd_ij=gcd(i,j)
for k in range(n+1):
ans+=gcd(gcd_ij,k)
print(ans) |
from math import gcd
n=int(input())
ans=0
for i in range(1,n+1):
for j in range(1,n+1):
gcd_ij=gcd(i,j)
for k in range(1,n+1):
ans+=gcd(gcd_ij,k)
print(ans)
| [
"call.arguments.add"
] | 475,405 | 475,406 | u185405877 | python |
p02713 | import math
k=int(input())
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
tmp=math.gcd(i,j)
for h in range(1,k+1):
ans+=math.gcd(tmp,k)
print(ans) | import math
k=int(input())
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
tmp=math.gcd(i,j)
for h in range(1,k+1):
ans+=math.gcd(tmp,h)
print(ans) | [
"identifier.change",
"call.arguments.change"
] | 475,409 | 475,410 | u369133448 | python |
p02713 | s = input()
k = int(s)
n = 3
ans={}
for i in reversed(range(1, k+1)):
ans[i]=math.floor(k/i)**n
l=2
j=i*l
while j<=k:
ans[i]=ans[i]-ans[j]
l +=1
j = i*l
res=0
for i in ans:
res+=i*ans[i]
print(res) | import math
s = input()
k = int(s)
n = 3
ans={}
for i in reversed(range(1, k+1)):
ans[i]=math.floor(k/i)**n
l=2
j=i*l
while j<=k:
ans[i]=ans[i]-ans[j]
l +=1
j = i*l
res=0
for i in ans:
res+=i*ans[i]
print(res) | [] | 475,411 | 475,412 | u245960901 | python |
p02713 | k = int(input())
sum = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
sum += gcd(a,gcd(b,c))
print(sum)
| k = int(input())
from math import gcd
sum = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
sum += gcd(a, gcd(b,c))
print(sum)
| [] | 475,414 | 475,415 | u811169796 | python |
p02713 | #!/usr/bin/env python
import sys
from collections import Counter
from itertools import permutations, combinations
from math import gcd
from math import ceil, floor
sys.setrecursionlimit(10 ** 6)
def input():
return sys.stdin.readline()[:-1]
def main():
n = int(input())
ans = 0
for a in range(1, n+1):
... | #!/usr/bin/env python
import sys
from collections import Counter
from itertools import permutations, combinations
from math import gcd
from math import ceil, floor
sys.setrecursionlimit(10 ** 6)
def input():
return sys.stdin.readline()[:-1]
def main():
n = int(input())
ans = 0
for a in range(1, n+1):
... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 475,421 | 475,422 | u580920947 | python |
p02713 | from math import gcd
k=int(input())
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
ans+=gcd(math.gcd(i,j), l)
#print(gcd(i,j,l))
print(ans) | from math import gcd
k=int(input())
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
ans+=gcd(gcd(i,j), l)
#print(gcd(i,j,l))
print(ans) | [] | 475,432 | 475,433 | u881816188 | python |
p02713 | import math
N = int(input())
GCD = [[math.gcd(i, j)-1 for i in range(1, N+1)] for j in range(1, N+1)]
#print(GCD)
all_gcd = [GCD[GCD[i][j]][m] for i in range(N) for j in range(N) for m in range(N)]
print(sum(all_gcd)) | import math
N = int(input())
GCD = [[math.gcd(i, j) for i in range(1, N+1)] for j in range(1, N+1)]
#print(GCD)
all_gcd = [GCD[GCD[i][j]-1][m] for i in range(N) for j in range(N) for m in range(N)]
print(sum(all_gcd)) | [
"expression.operation.binary.remove"
] | 475,436 | 475,437 | u517447467 | python |
p02713 | import math
K = int(input())
cnt = 0
for i in range(1, K+1):
for j in range(1, K + 1):
for k in range(1, K + 1):
cnt += math.gcd(k, math.gcd(i, j))
print(apt(K))
| import math
K = int(input())
cnt = 0
for i in range(1, K+1):
for j in range(1, K + 1):
for k in range(1, K + 1):
cnt += math.gcd(k, math.gcd(i, j))
print(cnt)
| [
"call.arguments.change",
"io.output.change"
] | 475,438 | 475,439 | u526094365 | python |
p02713 | # -*- coding: utf-8 -*-
"""
Created on Sun Apr 12 22:01:05 2020
@author: H_Hoshigi
"""
import math
K = 200#int(input())
answer = 0
for a in range(1, K+1):
for b in range(1, K+1):
gcd_a_b = math.gcd(a, b)
for c in range(1, K+1):
answer += math.gcd(gcd_a_b, c)
print(answer)
| # -*- coding: utf-8 -*-
"""
Created on Sun Apr 12 22:01:05 2020
@author: H_Hoshigi
"""
import math
K = int(input())
answer = 0
for a in range(1, K+1):
for b in range(1, K+1):
gcd_a_b = math.gcd(a, b)
for c in range(1, K+1):
answer += math.gcd(gcd_a_b, c)
print(answer)
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 475,461 | 475,462 | u463864151 | python |
p02713 | k = int(input())
count = [pow(k // max(i, 1), 3, mod) for i in range(k + 1)]
for i in range(k, 0, -1):
for j in range(2 * i, k + 1, i):
count[i] -= count[j]
sum_ = 0
for i in range(k + 1):
sum_ += i * count[i]
print(sum_) | k = int(input())
count = [pow(k // max(i, 1), 3) for i in range(k + 1)]
for i in range(k, 0, -1):
for j in range(2 * i, k + 1, i):
count[i] -= count[j]
sum_ = 0
for i in range(k + 1):
sum_ += i * count[i]
print(sum_) | [
"call.arguments.change"
] | 475,467 | 475,468 | u686230543 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.