input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from sys import stdin
import sys
import math
K = int(eval(input()))
amount = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
amount += math.gcd(a, math.gcd(b, c))
print(amount)
| import math
K = int(eval(input()))
amount = 0
for a in range(1, K+1):
for b in range(1, K+1):
gcd_ab = math.gcd(a, b)
for c in range(1, K+1):
amount += math.gcd(gcd_ab, c)
print(amount)
| p02713 |
import sys
import math
#import fractions
from functools import reduce
import itertools
# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(... | import sys
#import fractions
from math import gcd
import itertools
# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.re... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def main():
K = int(eval(input()))
s = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
s += gcd(i, j, k)
print(s)
if __name__ == "__m... | import math
from functools import reduce
def main():
K = int(eval(input()))
s = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
s += math.gcd(math.gcd(i, j), k)
print(s)
if __name__ == "__main__":
main() | p02713 |
import math
k = int( eval(input()) )
out_sum = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
out_sum += math.gcd( a, math.gcd(b,c) )
print( out_sum ) | import math
k = int( eval(input()) )
out_sum = 0
# a==b and b==c
for a in range(1, k+1):
out_sum += a
# a==b and b!=c
for a in range(2, k+1):
for b in range(1, a):
out_sum += 6 * math.gcd(a,b)
# a!=b and b!=c
for a in range(3, k+1):
for b in range(2, a):
for c in range(1... | p02713 |
def gcd(a, b):
if a < b:
return gcd(b, a)
d = a % b
if d == 0:
return b
return gcd(b, d)
def main():
K = int(eval(input()))
table = [[0]*K for i in range(K)]
for i in range(K):
for j in range(K):
table[i][j] = gcd(i + 1, j + 1)
ans = 0
... | def gcd(a, b):
if a < b:
return gcd(b, a)
d = a % b
if d == 0:
return b
return gcd(b, d)
def main():
K = int(eval(input()))
table = [[0]*K for i in range(K)]
for i in range(K):
for j in range(K):
table[i][j] = gcd(i + 1, j + 1)
ans = 0
... | p02713 |
from math import gcd
K = int(eval(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(i, gcd(j, l))
print(ans)
| K = int(eval(input()))
def func_gcd(a, b):
if b > a:
a, b = b, a
while b > 0:
r = a % b
a = b
b = r
return a
ans = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
for l in range(1, K + 1):
temp = func_gcd(j, l)
... | p02713 |
import math
k = int(eval(input()))
su = 0
for x in range(1, k+1):
for y in range(1, k+1):
for z in range(1, k+1):
i = math.gcd(x, y)
ans = math.gcd(i, z)
su += ans
print(su) | import math
k = int(eval(input()))
su = 0
lis = []
for x in range(1, k+1):
for y in range(1, k+1):
a = math.gcd(x, y)
lis.append(a)
for z in range(1, k+1):
for p in lis:
ans = math.gcd(p, z)
su += ans
print(su) | p02713 |
import math
K=int(eval(input()))
c = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
if i == j == k:
c += i
elif i == j:
c += math.gcd(i,k)
elif i == k:
c += math.gcd(i,j)
elif j == k:
c += math.gcd(i,k)
else:
... | import math
K=int(eval(input()))
c = 0
for i in range(1,K+1):
for j in range(1,K+1):
if math.gcd(i,j) == 1:
c += K
else:
for k in range(1,K+1):
if i == j == k:
c += i
elif i == j:
c += math.gcd(i,k)
elif i == k:
c += math.gcd(i,j)... | p02713 |
import math
from functools import reduce
K = int(eval(input()))
def gcd_list(numbers):
return reduce(math.gcd, numbers)
output = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
output += gcd_list([a, b, c])
print(output) | import math
from functools import reduce
K = int(eval(input()))
def gcd(*numbers):
return reduce(math.gcd, numbers)
output = 0
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:
output += gcd(a, b, c)
elif a != b and b != c and c != a:
... | p02713 |
def gcd(x, y):
if x % y == 0:
return y
return gcd(y, x % y)
K = int(eval(input()))
count = 0
ab = []
for a in range(1, K+1):
for b in range(1, K+1):
ab.append(gcd(a, b))
for c in range(1, K+1):
for i in ab:
count += gcd(i, c)
print(count) | def gcd(x, y):
if x % y == 0:
return y
return gcd(y, x % y)
K = int(eval(input()))
count = 0
# a, b, cが全て一致する場合
count += K * (K+1) / 2
# a, b, cのうち、いずれか二つが一致する場合
for a in range(1, K):
for b in range(a+1, K+1):
count += gcd(b, a) * 6
# a, b, cが全て異なる場合
for a in range(1, K-1):
f... | p02713 |
def euclidean(a, b):
r = a % b
if r == 0:
return b
return euclidean(b,r)
N = int(eval(input()))
s = 0
for i in range(N):
for j in range(N):
ss = euclidean(i+1,j+1)
for k in range(N):
s +=euclidean(ss,k+1)
print(s) | import math
N = int(eval(input()))
s = 0
for i in range(N):
for j in range(N):
ss = math.gcd(i+1,j+1)
for k in range(N):
s +=math.gcd(ss,k+1)
print(s)
| p02713 |
k = int(eval(input()))
def gcd_(a, b):
if a < b:
a, b = b, a
while not a % b == 0:
a, b = b, a % b
return b
def gcd(a, b, c):
length = len({a, b, c})
if length == 1:
return a
elif length == 2:
x, y = {a, b, c}
return gcd_(x, y)
else:
... | k = int(eval(input()))
def gcd_(a, b):
if a < b:
a, b = b, a
while not a % b == 0:
a, b = b, a % b
return b
s = 0
for i in range(1, k + 1):
for j in range(1, k + 1):
p = gcd_(i, j)
if p == 1:
s += k
else:
for h in range(1,... | p02713 |
import math
def tgcd(a,b,c):
return math.gcd(a,math.gcd(b,c))
K = int(eval(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 += tgcd(i,j,k)
print(ans) | import math
K = int(eval(input()))
ans = 0
for a in range(1,K-1):
for b in range(a+1,K):
for c in range(b+1,K+1):
r = math.gcd(math.gcd(a,b),c)
r *= 6
ans += r
for a in range(1,K):
for b in range(a+1,K+1):
r = math.gcd(a,b)
r *= 6
... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
N=int(eval(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,j,k)
print(S) | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
N=int(eval(input()))
S=0
T=0
for i in range(1,N+1):
for j in range(i+1,N+1):
for k in range(j+1,N+1):
S+=gcd(i,j,k)
for i in range(1,N+1):
for j in range(i+1,N+1):
... | p02713 |
import functools
import math
def euclid(a,b):
if b ==0:
return a
else:
return euclid(b, a%b)
def gcd(nums):
return functools.reduce(math.gcd,nums)
#N = list(map(int, input().split()))
K = int(eval(input()))
SUM = 0
for a in range(K):
a += 1
for b in range(K)... |
def euclid(a,b):
if b ==0:
return a
else:
return euclid(b, a%b)
K = int(eval(input()))
SUM = 0
for a in range(K):
a += 1
for b in range(K):
b += 1
for c in range(K):
c += 1
NUMS = [a,b,c]
SUM += euclid(euclid(a,b),c)... | p02713 |
import math
from functools import reduce
k = int(eval(input()))
sum_gcd = 0
def gcd(*numbers):
return reduce(math.gcd, numbers)
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
d = gcd(a, b, c)
sum_gcd += d
print(sum_gcd)
| import math
k = int(eval(input()))
rng = list(range(1, k+1))
gcd_ls = [math.gcd(i, j) for i in rng for j in rng]
ans = [math.gcd(i, l) for i in rng for l in gcd_ls]
print((sum(ans)))
| p02713 |
def gcd(x,y):
if y == 0:
return x
return gcd(y, x%y)
K = int(eval(input()))
sum = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
A = gcd(a,b)
B = gcd(A,c)
sum += B
print(sum)
| def gcd(x,y):
if y == 0:
return x
return gcd(y, x%y)
K = int(eval(input()))
sum = 0
for a in range(1,K-1):
for b in range(a+1,K):
for c in range(b+1,K+1):
sum += gcd(gcd(a,b),c) * 6
for a in range(1,K+1):
for b in range(1,K+1):
sum += gcd(gcd(a,b),b) *... | p02713 |
K = int(eval(input()))
trip = dict()
pair = dict()
def gcd(a, b):
d = frozenset([a, b])
if d in pair:
return pair[d]
if b == 0:
pair[d] = a
return a
while b:
a %= b
a, b = b, a
pair[d] = a
return a
def gcd3(K):
res = 0
... | import math
K = int(eval(input()))
def sol(K):
res = 0
for i in range(1, K+1):
for j in range(1, K+1):
t = math.gcd(i, j)
for k in range(1, K+1):
res += math.gcd(k, t)
return res
print((sol(K))) | p02713 |
import math
k = int(eval(input()))
a = 0
for m in range(1,k+1):
for n in range(1,k+1):
for l in range(1,k+1):
b = math.gcd(m,n)
#print("b={}".format(b))
a = a + math.gcd(b,l)
#print("a={}".format(a))
print(a)
| import math
k = int(eval(input()))
a = 0
for m in range(1,k+1):
for n in range(1,k+1):
b = math.gcd(m,n)
for l in range(1,k+1):
a += math.gcd(l,b)
print(a) | p02713 |
from sys import stdin
import math
# 1行だけ読むやつ
N = int(stdin.readline().rstrip().split()[0])
Sum = 0
for i in range(1, N+1):
for j in range(1, N+1):
for k in range(1, N+1):
temp_gcd = math.gcd(i, j)
Sum += math.gcd(temp_gcd, k)
print(Sum) | from sys import stdin
import math
# 1行だけ読むやつ
N = int(stdin.readline().rstrip().split()[0])
Sum = 0
for i in range(1, N+1):
for j in range(i, N+1):
for k in range(j, N+1):
if i == j and j == k:
Sum += i
elif i == j or j == k or k == i:
te... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K=int(eval(input()))
ans=[]
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
ans.append(gcd(i,j,k))
print((sum(ans))) | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K=int(eval(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+=gcd(i,j,k)
print(ans) | p02713 |
import math
K = int(eval(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 += math.gcd(math.gcd(i, j), k)
print(ans) | import math
K = int(eval(input()))
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) | p02713 |
import math
import collections
k = int(eval(input()))
gcd_table = [[0] * k for i in range(k)]
ans = 0
combination_list = [0, 1, 3, 6]
for p in range(1, k+1):
for q in range(p, k+1):
if gcd_table[p-1][q-1] == 0:
tmp_gcd = math.gcd(p, q)
gcd_table[p-1][q-1] = tmp_gcd
... | import math
import collections
k = int(eval(input()))
gcd_table = [[0] * k for i in range(k)]
for i in range(1, k+1):
for j in range(i, k+1):
gcd_table[i-1][j-1] = math.gcd(i, j)
ans = 0
combination_list = [0, 1, 3, 6]
for p in range(1, k+1):
for q in range(p, k+1):
if gcd_table[p... | p02713 |
from functools import reduce
from math import gcd
log = {}
K = int(eval(input()))
sum_gcd = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
key = str(sorted([a, b, c]))
if key in log:
sum_gcd += log[key]
else:
... | from math import gcd
log = {}
K = int(eval(input()))
sum_gcd = 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(gcd(a, b), c)
print(sum_gcd)
| 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(eval(input()))
c=0
for i in range(1,k+1):
for j in range(1,k+1):
for k in range(1,k+1):
# print(i,j,k,gcd(i,j,k))
c+=g... | import math
k=int(eval(input()))
c=0
for i in range(1,k+1):
for j in range(1,k+1):
w=math.gcd(i,j)
for k in range(1,k+1):
c+=math.gcd(w,k)
print(c)
| p02713 |
K = int(eval(input()))
memo = {}
def gcd(x,y):
if x < y:
x,y = y,x
if (x,y) in memo:return memo[(x,y)]
if y == 0:return x
memo[(x,y)] = gcd(y,x%y)
return memo[(x,y)]
ans = 0
temp = []
for i in range(1,K+1):
for j in range(1,K+1):
temp.append(gcd(i,j))
for i in range... | k = int(eval(input()))
import math
ans = 0
for i in range(1,k+1):
for j in range(1,k+1):
for x in range(1,k+1):
ans += math.gcd(i,math.gcd(j,x))
print(ans) | p02713 |
k = int(eval(input()))
import math
ans = 0
for i in range(1,k+1):
for j in range(1,k+1):
for x in range(1,k+1):
ans += math.gcd(i,math.gcd(j,x))
print(ans) | import math
k = int(eval(input())) + 1
ans = 0
for a in range(1, k):
for b in range(1, k):
d = math.gcd(a, b)
for c in range(1, k):
ans += math.gcd(d, c)
print(ans) | p02713 |
K = int(eval(input()))
from itertools import product
kumi = product(list(range(1, K+1)), repeat=3)
from math import gcd
memo = [[None for i in range(K+1)] for i in range(K+1)]
# memo2 = {}
ans = 0
for a, b, c in kumi:
a, b, c = sorted([a, b, c])
if memo[a][b] is not None:
v = memo[... | K = int(eval(input()))
from math import gcd
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
ans += gcd(gcd(i, j), k)
print(ans) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(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 += gcd(i, j, k)
print(ans) | from math import gcd
n = int(eval(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) | p02713 |
import math
# メモを残す
K = int(eval(input())) + 1
dic = {}
ans = 0
for a in range(1,K):
for b in range(1,K):
for c in range(1,K):
# 大きい順にソートする
l = tuple(sorted([a,b,c]))
if l in dic:
ans += dic[l]
else:
# 最大公約数を求める
... | from math import gcd
k = int(eval(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(a, gcd(b, c))
print(ans) | p02713 |
import math
K=int(eval(input()))
S=0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
x=math.gcd(a,b)
S+=math.gcd(x,c)
print(S)
| import math
import itertools
K=int(eval(input()))
l=list(itertools.combinations_with_replacement(list(range(1,K+1)),3))
S=0
for i in l:
a=i[0]
b=i[1]
c=i[2]
x=math.gcd(a,b)
if a==b==c:
S+=math.gcd(x,c)
elif a==b or b==c or c==a:
S+=math.gcd(x,c)*3
else:
... | p02713 |
from math import gcd
def main():
ans = 0
k = int(eval(input()))
for i in range(k):
for j in range(k):
for l in range(k):
ans += gcd(i+1,gcd(j+1,l+1))
print(ans)
if __name__ == "__main__":
main() | from math import gcd
def main():
ans = 0
k = int(eval(input()))
for i in range(1,1+k):
for j in range(1,1+k):
for l in range(1,1+k):
ans += gcd(i,gcd(j,l))
print(ans)
if __name__ == "__main__":
main() | p02713 |
import itertools
K = int(eval(input()))
ans = 0
S = list(range(1,K+1))
def gcd(x, y):
if y == 0:
return x
else:
return gcd(y, x % y)
for v in itertools.combinations_with_replacement(S, 3):
if v[0] == v[1] == v[2]:
ans += v[0]
elif v[0] != v[1] and v[1] != v[2] and v[0] != v[... | import itertools
K = int(eval(input()))
ans = 0
S = list(range(1,K+1))
def gcd(a,b):
while a != 0 or b != 0:
if a % b == 0:
return min(a,b)
a, b = b, a % b
for v in itertools.combinations_with_replacement(S, 3):
if v[0] == v[1] == v[2]:
ans += v[0]
elif v[0] != v[1] and v[1] != v[2] ... | p02713 |
def gcd(a, b):
for i in range(100):
a, b = b, a%b
if b == 0:
return a
K = int(eval(input()))
A = B = C = [i for i in range(1, K+1)]
cnt = sum([gcd(gcd(a,b),c) for a in A for b in B for c in C])
print(cnt) | def gcd(a, b):
while b:
a, b = b, a % b
return a
K = int(eval(input()))
A = B = C = [i for i in range(1, K+1)]
L = [gcd(a,b) for a in A for b in B]
cnt = sum([gcd(l,c) for l in L for c in C])
print(cnt) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k=int(eval(input()))
t=0
for i in range(k):
for j in range(k):
for l in range(k):
t+=gcd((i+1),(j+1),(l+1))
print(t) | i=int(eval(input()))
a=[0, \
1 , \
9 , \
30 , \
76 , \
141 , \
267 , \
400 , \
624 , \
885 , \
1249 , \
1590 , \
2208 , \
2689 , \
3411 , \
4248 , \
5248 , \
6081 , \
7485 , \
8530 , \
10248 , \
11889 , \
13687 , \
15228 , \
17988 , \
20053 , \
22569 , \
25242 , \
28588 , \
31053 , \
3546... | p02713 |
import math
k=int(eval(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+=math.gcd(math.gcd(i,j), l)
#print(gcd(i,j,l))
print(ans) | from math import gcd
k=int(eval(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) | p02713 |
k = int(eval(input()))
ans = 0
import math
from functools import reduce
def gcd_list(numbers):
return reduce(math.gcd, numbers)
import itertools
A = list(itertools.product(list(range(1,k+1)), repeat=3))
for i in range(len(A)):
ans += gcd_list(A[i])
if k == 1:
print((1))
elif k == 2... | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
ans = 0
for x in range(1,k+1):
for y in range(1,k+1):
for z in range(1,k+1):
ans += gcd(x,y,z)
print(ans)
| p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
ans = 0
for x in range(1,k+1):
for y in range(1,k+1):
for z in range(1,k+1):
ans += gcd(x,y,z)
print(ans)
| k = int(eval(input()))
ans = 0
import math
for i in range(1,k+1):
for j in range(1,k+1):
for k in range(1,k+1):
ans += math.gcd(i,math.gcd(j,k))
print(ans) | p02713 |
# C - Sum of gcd of Tuples (Easy)
import math
k = int(eval(input()))
s = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
s += math.gcd(a,math.gcd(b,c))
print(s)
| # C - Sum of gcd of Tuples (Easy)
import math
k = int(eval(input()))
s = 0
for a in range(1,k+1):
for b in range(1,k+1):
gcdab = math.gcd(a,b)
if gcdab== 1:
s += k
else:
for c in range(1,k+1):
s += math.gcd(gcdab,c)
print(s)
| p02713 |
import math
k=int(eval(input()))
k+=1
d=0
for i in range(1,k):
for j in range(1,k):
for l in range(1,k):
d+=math.gcd(math.gcd(i,j),l)
print(d)
| import math
K = int(eval(input()))
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
x = math.gcd(i, j)
for k in range(1, K+1):
ans += math.gcd(x, k)
print(ans)
| p02713 |
def gcd(x, y):
if x < y:
x, y = y, x
while x % y != 0:
x, y = y, x % y
return y
def gcd_3(x, y, z):
x_y = gcd(x, y)
return gcd(x_y, z)
K = int(eval(input()))
ans = 0
sum_list = []
for i in range(1, K + 1):
for j in range(1, K + 1):
for k in ran... |
import math
k = int(eval(input()))
s = 0
box = [0]*(k+1)
for l in range (1,k+1):
for m in range (1, k+1):
box[math.gcd(l,m)] += 1
for l in range (1,k+1):
for n in range (1, k+1):
s += math.gcd(l,n)*box[l]
print(s)
| p02713 |
from math import gcd
n = int(eval(input()))
gcd_dic = {}
ans = 0
for i in range(1, n + 1):
if i == 1:
ans += n ** 2
continue
for j in range(1, n + 1):
if i == 1:
ans += n
continue
for k in range(1, n + 1):
if i == 1:
... | answer = [1, 9, 30, 76, 141, 267, 400, 624, 885, 1249, 1590, 2208, 2689, 3411, 4248, 5248, 6081, 7485, 8530, 10248, 11889, 13687, 15228, 17988, 20053, 22569, 25242, 28588, 31053, 35463, 38284, 42540, 46581, 50893, 55362, 61824, 65857, 71247, 76884, 84388, 89349, 97881, 103342, 111528, 120141, 128047, 134580, 146316, 15... | p02713 |
answer = [1, 9, 30, 76, 141, 267, 400, 624, 885, 1249, 1590, 2208, 2689, 3411, 4248, 5248, 6081, 7485, 8530, 10248, 11889, 13687, 15228, 17988, 20053, 22569, 25242, 28588, 31053, 35463, 38284, 42540, 46581, 50893, 55362, 61824, 65857, 71247, 76884, 84388, 89349, 97881, 103342, 111528, 120141, 128047, 134580, 146316, 15... | k = int(eval(input()))
n = 3
cnt = [0] * (k + 1)
for i in range(k, 0, -1):
cnt[i] = (k // i) ** n
multiple = i * 2
while multiple <= k:
cnt[i] -= cnt[multiple]
multiple += i
print((sum((i* cnt[i] for i in range(1, k + 1)))))
| p02713 |
k = int(eval(input()))
n = 3
cnt = [0] * (k + 1)
for i in range(k, 0, -1):
cnt[i] = (k // i) ** n
for j in range(i * 2, k + 1, i):
cnt[i] -= cnt[j]
print((sum((i* cnt[i] for i in range(1, k + 1)))))
| k = int(eval(input()))
cnt = [0] * (k + 1)
for i in range(k, 0, -1):
cnt[i] = (k // i) ** 3
for j in range(i * 2, k + 1, i):
cnt[i] -= cnt[j]
print((sum((i* cnt[i] for i in range(1, k + 1)))))
| p02713 |
from collections import defaultdict
def gcd(m,n):
if n==0:
return m
return gcd(n,m%n)
##print(gcd(5,3))
##print(gcd(2,4))
k=int(eval(input()))
d=defaultdict(int)
t=0
for i in range(1,k+1):
for j in range(1,k+1):
for k in range(1,k+1):
if list((i,j,k)) in [list(x) for... | from collections import defaultdict
def gcd(m,n):
if n==0:
return m
return gcd(n,m%n)
k=int(eval(input()))
t=0
for i in range(1,k+1):
for j in range(1,k+1):
g=gcd(i,j)
for k in range(1,k+1):
if k%g==0:
t+=g
elif g%k==0:
... | p02713 |
from math import gcd
from functools import reduce
def gcd_list(xs):
return reduce(gcd, xs)
n = int(eval(input()))
a = 0
for i in range(1, n+1):
for j in range(1, n+1):
for k in range(1, n+1):
a += gcd_list([i,j,k])
print(a) | from math import gcd
n = int(eval(input()))
a = 0
for i in range(1, n+1):
for j in range(1, n+1):
b = gcd(i, j)
for k in range(1, n+1):
a += gcd(k, b)
print(a)
| p02713 |
import math
K = int(eval(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 += math.gcd(math.gcd(a, b), c)
print(result)
| import math
K = int(eval(input()))
result = 0
for a in range(1, K+1):
for b in range(1, K+1):
r = math.gcd(a, b)
for c in range(1, K+1):
result += math.gcd(r, c)
print(result)
| p02713 |
import math
K = int(eval(input()))
total = 0
for a in range(1, K + 1):
for b in range(1, K + 1):
for c in range(1, K + 1):
ab = math.gcd(a, b)
total += math.gcd(ab, c)
print(total) | import math
K = int(eval(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) | p02713 |
import math
K = int(eval(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(eval(input()))
total = 0
for a in range(1, K + 1):
for b in range(1, K + 1):
ab = math.gcd(a, b)
if ab == 1:
total += K
else:
for c in range(1, K + 1):
total += math.gcd(ab, c)
print(total) | p02713 |
import math
K = int (eval(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(i, math.gcd(j,k))
print (sum) | import math
t = int (eval(input()))
sum = 0
for i in range (1, t+1):
for j in range (1, t+1):
aux = math.gcd(i,j)
for k in range (1, t+1):
sum += math.gcd(aux, k)
print (sum) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
sum_ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
sum_ans += gcd(i, j, k)
print(sum_ans) | import math
K = int(eval(input()))
sum_ans = 0
gcd_list = []
for i in range(1, K+1):
for j in range(1, K+1):
tmp = math.gcd(i, j)
gcd_list.append(tmp)
for k in range(1, K+1):
for g in gcd_list:
tmp = math.gcd(k, g)
sum_ans += tmp
print(sum_ans) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
ans = 0
for l in range(1,k+1):
for m in range(1,k+1):
for n in range(1,k+1):
ans += gcd(l,m,n)
print(ans) | import math
import itertools
def gcd(lst):
return math.gcd(math.gcd(lst[0],lst[1]), lst[2])
k = int(eval(input()))
lst = [i for i in range(1,k+1)]
itr = itertools.combinations_with_replacement(lst, 3)
ans = 0
for i in itr:
st = set(i)
num = len(st)
if num == 1:
ans += i[0]
elif num == 2:
... | p02713 |
import io
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
K = int(eval(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(c, gcd(a, b))
print(ans) | import io
def gcd(a, b):
while b > 0 :
a, b = b, a%b
return a
K = int(eval(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(c, gcd(a, b))
print(ans) | p02713 |
import math
from functools import lru_cache
@lru_cache(maxsize=100000)
def gcd_list(a, b, c):
return gcd(gcd(a, b), c)
@lru_cache(maxsize=100000)
def gcd(x, y):
return math.gcd(x, y)
k = int(eval(input()))
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+... | # import math
# from functools import lru_cache
# @lru_cache(maxsize=100000)
# def gcd_list(a, b, c):
# return gcd(gcd(a, b), c)
# @lru_cache(maxsize=100000)
# def gcd(x, y):
# return math.gcd(x, y)
# for k in range (1, 201):
# ans = 0
# for a in range(1, k+1):
# for b in rang... | p02713 |
import math
sets = dict()
def gcd2(a, b):
if a > b:
key = (b, a)
else:
key = (a, b)
if key in list(sets.keys()):
# print("cached")
return sets[key]
else:
# print("stored")
ans = math.gcd(a, b)
sets[key] = ans
return ... | import math
sets = dict()
def gcd2(a, b):
if a > b:
key = (b, a)
else:
key = (a, b)
try:
# print("cached")
return sets[key]
except:
# print("stored")
ans = math.gcd(a, b)
sets[key] = ans
return ans
n = int(eval(in... | p02713 |
n=int(eval(input()))
import math
from functools import reduce
def gcd_list(*numbers):#引数はリスト
return reduce(math.gcd, numbers)
ans=n**2
for i in range(2,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
ans+=gcd_list(i,j,k)
print(ans) | n=int(eval(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) | p02713 |
K = int(eval(input()))
import collections as clt
import math
import itertools as itt
v = []
for j in itt.product(list(range(1,K+1)),repeat=3):
v.append(list(j))
sum = 0
#print(v)
from functools import reduce
#def gvc(*numbers):
#return reduce(math.gcd, numbers)
def gcd_list(numbers):
return re... | K = int(eval(input()))
import collections as clt
import math
import itertools as itt
sum = 0
#print(v)
from functools import reduce
#def gvc(*numbers):
#return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
for j in itt.product(list(range(1,K+1)),repeat=3):
... | p02713 |
def main():
k = int(eval(input()))
gcds = list(sorted([gcd(i, j) for i in range(1, k+1) for j in range(1, k+1)]))
j = 0
s = list(sorted(list(set(gcds))))
m = k**2-1
gcdss = [0]*len(s)
flag = False
for i, l in enumerate(s):
while gcds[j] == l:
gcdss[i] += 1
... | def main():
k = int(eval(input()))
gcds = []
for i in range(1, k+1):
for j in range(1, k+1):
gcds.append(gcd(i, j))
ans = {i:0 for i in set(gcds)}
for i in gcds:
ans[i] += 1
out = 0
for i, v in list(ans.items()):
for j in range(1, k+1):
... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k=int(eval(input()))
r=0
for i in range(k):
for j in range(k):
for l in range(k):
r+=gcd(i+1,j+1,l+1)
print(r)
| import math
k=int(eval(input()))
r=0
ls=[]
for i in range(k):
for j in range(k):
a=math.gcd(i+1,j+1)
for l in range(k):
r+=math.gcd(a,l+1)
print(r) | p02713 |
import math
k=int(eval(input()))
re=0
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
re+=math.gcd(math.gcd(i,j),l)
print(re)
| from math import gcd
k=int(eval(input()))
re=0
for i in range(1,k+1):
for j in range(1,k+1):
v=gcd(i,j)
for l in range(1,k+1):
re+=gcd(v,l)
print(re)
| p02713 |
import math
from functools import reduce
k=int(eval(input()))
sum_=0
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
sum_+=reduce(math.gcd,[i,j,l])
print(sum_)
| l=[1,9,30,76,141,267,400,624,885,1249,1590,2208,2689,3411,4248,5248,6081,7485,8530,10248,11889,13687,15228,17988,20053,22569,25242,28588,31053,35463,38284,42540,46581,50893,55362,61824,65857,71247,76884,84388,89349,97881,103342,111528,120141,128047,134580,146316,154177,164817,174438,185836,194157,207927,218812,233268,2... | p02713 |
sum=0
K=int(eval(input()))+1
r=1
for a in range(1,K):
for b in range(1,K):
for c in range(1,K):
p=a
q=b
if p%q==0:
r=q
while p%q!=0:
r=p%q
p=q
q=r
p=r
q=c
if p%q==0:
r=q
while p%q!=0:
r=p%q
... | import math
sum=0
K=int(eval(input()))+1
for a in range(1,K):
for b in range(1,K):
ab=math.gcd(a,b)
for c in range(1,K):
sum+=math.gcd(ab,c)
print(sum)
| p02713 |
import math
k = int(eval(input()))
sum = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
ans = math.gcd(a, b)
ans = math.gcd(ans, c)
sum += ans
print(sum)
|
import math
k = int(eval(input()))
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
ab = math.gcd(a, b)
if ab == 1:
ans += k
continue
for c in range(1, k+1):
ans += math.gcd(ab,c)
print(ans) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
sum = 0
for i in range(1, k+1):
for j in range(1, k+1):
for l in range(1, k+1):
sum += gcd(i, j, l)
print(sum)
| # def gcd(a, b):
# while a != 0 and b != 0:
# if a >= b:
# remain = a % b
# a = remain
# else:
# remain = b % a
# b = remain
# if a >= b:
# return a
# else:
# return b
import math
k = int(eval(input()))
sum = 0
for i in range(1, k+1):
for j in range(1, i+1):
for l in ra... | p02713 |
import math
K = int(eval(input()))
result = 0
sum = 0
for a in range(1,K+1):
for b in range(1,K+1):
result = math.gcd(a, b)
for c in range(1,K+1):
result = math.gcd(a, b)
sum += math.gcd(result, c)
print(sum)
| K = int(eval(input()))
import math
sum=0
for i in range(1, K+1):
for j in range(1, K+1):
value = math.gcd(i,j)
for k in range(1, K+1):
sum += math.gcd(value,k)
print(sum) | p02713 |
import math
K = int(eval(input()))
result = 0
sum = 0
for a in range(1,K+1):
for b in range(1,K+1):
result = math.gcd(a, b)
for c in range(1,K+1):
result = math.gcd(a, b)
sum += math.gcd(result, c)
print(sum) | import math
K = int(eval(input()))
result = 0
sum = 0
for a in range(1,K+1):
for b in range(1,K+1):
result = math.gcd(a, b)
for c in range(1,K+1):
sum += math.gcd(result, c)
print(sum)
| p02713 |
import math
k=int(eval(input()))
d=0
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
c=math.gcd(i,j)
d+=math.gcd(c,l)
print(d)
| import math
k=int(eval(input()))
d=0
for i in range(1,k+1):
for j in range(i+1,k+1):
for l in range(j+1,k+1):
c=math.gcd(i,j)
d+=6*(math.gcd(c,l))
for i in range(1,k+1):
for j in range(i+1,k+1):
d+=6*(math.gcd(i,j))
for i in range(1,k+1):
d+=i
print(d)
| p02713 |
K = int(eval(input()))
total = 0
def gcd2(a,b): #互除法
while True:
mod = a % b
if mod == 0:
return b
a = b
b = mod
memo = {}
def gcd(a,b,c):
a,b,c = sorted([a,b,c])
if (a,b,c) not in memo:
val = gcd2(gcd2(a,b), c)
memo[(a,b,c)] = val
return val
return memo[(a,... | K = int(eval(input()))
total = 0
def gcd2(a,b): #互除法
while True:
mod = a % b
if mod == 0:
return b
a = b
b = mod
memo = {}
def gcd(a,b,c):
return gcd2(gcd2(a,b),c)
# a,b,c = sorted([a,b,c])
# if (a,b,c) not in memo:
# val = gcd2(gcd2(a,b), c)
# memo[(a,b,c)] = val
#... | p02713 |
import math
k = int(eval(input()))
v = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
v += math.gcd(math.gcd(a, b), c)
print(v)
| import math
k = int(eval(input()))
v = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
g = math.gcd(a, b)
for c in range(1, k + 1):
v += math.gcd(g, c)
print(v)
| p02713 |
import math
K = int(eval(input()))
# table = np.zeros((K,K), dtype="int16")
table = [[0] * K for i in range(K)]
for a in range(K):
for b in range(a, K):
tmp = math.gcd(a+1, b+1)
table[a][b] = tmp
table[b][a] = tmp
res = 0
for a in range(K):
for b in range(K):
fo... | import math
K = int(eval(input()))
res = 0
for a in range(K):
for b in range(K):
for c in range(K):
res += math.gcd(math.gcd(a+1, b+1), c+1)
print(res) | p02713 |
from math import gcd
k = int(eval(input()))
li = []
cnt = 0
for i in range(1, k + 1):
for j in range(1, k + 1):
for l in range(1, k + 1):
li.append(gcd(gcd(i, j), gcd(j, l)))
print((sum(li))) | from math import gcd
k = int(eval(input()))
li = []
li2 = [6623853, 6741078, 6864016, 6953457, 7094451, 7215016, 7359936, 7475145, 7593865, 7689630, 7886244, 7984165, 8130747, 8253888, 8403448, 8523897, 8684853, 8802826, 8949612, 9105537, 9267595, 9376656, 9574704, 9686065, 9827097, 9997134, 10174780, 10290813, 1049... | p02713 |
#coding:utf-8
k = int(eval(input()))
count = 0
def gcd(a,b):
if a >= b:
k1, k2 = a, b
elif a < b:
k1, k2 = b, a
r = k1 % k2
if r != 0:
return gcd(k2,r)
elif r == 0:
return k2
for a in range(1,k+1):
for b in range(1,k+1):
f = gcd(... | #coding:utf-8
k = int(eval(input()))
count = 0
def gcd(a,b):
if a >= b:
k1, k2 = a, b
elif a < b:
k1, k2 = b, a
r = k1 % k2
if r != 0:
return gcd(k2,r)
elif r == 0:
return k2
for a in range(1,k+1):
for b in range(1,a+1):
f = gcd(... | p02713 |
import math
K = int(eval(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+=math.gcd(math.gcd(a,b),c)
print(sum) | import math
K = int(eval(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) | p02713 |
from functools import lru_cache
@lru_cache(maxsize=None)
def gcd(a, b):
if a < b:
a, b = b, a
if a % b == 0:
return b
return gcd(b, a % b)
def main():
ans = 0
k = int(eval(input()))
for i in range(1, k+1):
for j in range(1, k+1):
for l in ... | from math import gcd
def main():
ans = 0
k = int(eval(input()))
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)
if __name__ == '__main__':
main()
| p02713 |
#!/usr/bin/env python3
import sys
import math
from functools import reduce
def solve(K: int):
K += 1
ans = []
for i in range(1, K):
for j in range(1, K):
for k in range(1, K):
ans.append(gcd(i, gcd(j, k)))
print((sum(ans)))
return
def gcd(x: int, ... | #!/usr/bin/env python3
import sys
import math
def solve(K: int):
K += 1
ans = []
for i in range(1, K):
for j in range(1, K):
for k in range(1, K):
ans.append(math.gcd(i, math.gcd(j, k)))
print((sum(ans)))
return
def gcd(x: int, y: int):
"""xとy... | p02713 |
import os
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def main():
n = int(eval(input()))
result = 0
for i in range(1,n+1):
for j in range(1,n+1):
for l in range(1,n+1):
result += gcd(i,j,l)
... | import os
from math import gcd
def main():
k = int(eval(input()))
result = 0
for i in range(1,k+1):
for j in range(1,k+1):
t = gcd(i,j)
for l in range(1,k+1):
result += gcd(t,l)
... | p02713 |
from math import gcd
import itertools
K=int(eval(input()))
res=0
li=[]
for x in itertools.product(list(range(1,K+1)),repeat=2):
li.append(gcd(x[0],x[1]))
for x,y in itertools.product(list(range(1,K+1)),li):
res+=gcd(x,y)
print(res) | from math import *
K=int(eval(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) | p02713 |
import math
k=int(eval(input()))
list=[]
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
list.append(math.gcd(math.gcd(a,b),c))
print((sum(list))) | import math
k=int(eval(input()))
list=[]
for a in range(1,k+1):
for b in range(1,k+1):
t=math.gcd(a,b)
for c in range(1,k+1):
list.append(math.gcd(t,c))
print((sum(list))) | p02713 |
k = int(eval(input()))
def gcd(a, b, c):
gcd1 = 1
for i in range(2, c+1):
if a%i == 0 and b%i == 0 and c%i == 0:
gcd1 = i
# print(gcd1)
return gcd1
sum_gcd = 0
for a in range(1, k+1):
for b in range(1, a+1):
for c in range(1, b+1):
if a == b and ... | k = int(eval(input()))
def gcd(a, b, c):
gcd1 = 1
if a%c == 0 and b%c == 0:
gcd1 = c
elif a%2 == 0 and b%2 == 0 and c%2 == 0:
gcd1 = 2
for i in range(4, c//2+1, 2):
if a%i == 0 and b%i == 0 and c%i == 0:
gcd1 = i
else:
for i in range... | p02713 |
import math
k = int(eval(input()))
ans = 0
for x in range(1, k + 1):
for y in range(1, k + 1):
for z in range(1, k + 1):
ans += math.gcd(math.gcd(x, y), z)
print(ans) | from math import gcd
k = int(eval(input()))
ans = 0
for x in range(1, k + 1):
for y in range(1, k + 1):
for z in range(1, k + 1):
ans += gcd(gcd(x, y), z)
print(ans) | p02713 |
import math
n = int(eval(input()))
sums = 0
sums += n*(n-1)*3 + 1
for k in range(2,n+1):
for l in range(2,n+1):
for p in range(2,n+1):
sums += math.gcd(math.gcd(k,l),p)
print(sums) | import math
n = int(eval(input()))
sums = 0
for k in range(1,n+1):
for l in range(1,n+1):
a =math.gcd(k,l)
for p in range(1,n+1):
sums += math.gcd(a,p)
print(sums) | p02713 |
K = int(eval(input()))
total = 0
# 3つ同じ
for i in range(K):
total += i+1
# 2つ同じ
#for i in range(0,K-1):
# total += 6*(K-1-i)*(i+1)
total += 6*(K-1) # １つが必ず1の場合
for i in range(1,K-1):
for j in range(i+1,K):
tmp = 0
for k in range(1,i+2):
if (i+1)%k == 0 and (j+1)%k == 0:
t... | K = int(eval(input()))
total = 0
for i in range(1,K+1,1):
for j in range(1,K+1,1):
tmp1 = i
tmp2 = j
while tmp1 % tmp2 != 0:
tmp = tmp1 % tmp2
tmp1 = tmp2
tmp2 = tmp
for k in range(1,K+1,1):
tmp1 = k
tmp3 = tmp2
while tmp1 % tmp3 != 0:
tmp = ... | p02713 |
import math
n=int(eval(input()))
g=0
for i in range(1,n+1):
for j in range(1,n+1):
for h in range(1,n+1):
d=math.gcd(i,j)
f=math.gcd(h,d)
g=g+f
print(g) |
import math
n=int(eval(input()))
g=0
for i in range(1,n+1):
for j in range(1,n+1):
d=math.gcd(i,j)
for h in range(1,n+1):
f=math.gcd(h,d)
g=g+f
print(g) | p02713 |
import math
K = int(eval(input()))
p = 0
for a in range(K):
for b in range(K):
for c in range(K):
p += math.gcd(math.gcd(a+1, b+1),c+1)
print(p)
| import math
K = int(eval(input()))
p = int(K*(K+1)/2)
for a in range(K):
for b in range(a+1, K):
g = math.gcd(a+1, b+1)
p += 6*g
for c in range(b+1, K):
p += 6*math.gcd(g, c+1)
print(p)
| p02713 |
K=int(eval(input()))
from math import gcd
ans=0
for a in range(1,K+1):
for b in range(1,K+1):
g = gcd(a, b)
for c in range(1,K+1):
ans+=gcd(g,c)
print(ans)
| K=int(eval(input()))
def gcd(x,y):
if x<y:
temp=x
x=y
y=temp
if x%y==0:
return y
else:
nx=y
ny=x%y
return gcd(nx,ny)
ans=0
for a in range(1,K+1):
for b in range(1,K+1):
g=gcd(a,b)
for c in range(1,K+1):
... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
number = int(eval(input()))
sumx = 0
for i in range(1,number+1):
for j in range(1,number+1):
for k in range(1,number+1):
# print("i",i)... | import math
number = int(eval(input()))
sumx = 0
N = number+1
for i in range(1,N):
for j in range(1,N):
for k in range(1,N):
sumx = sumx + math.gcd(math.gcd(i,j), k)
print (sumx)
| p02713 |
import math
k = int(eval(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 += math.gcd(l, math.gcd(i, j))
print(ans) | import math
k = int(eval(input()))
ans = 0
for i in range(1, k+1):
for j in range(1, k+1):
a = math.gcd(i, j)
for l in range(1, k+1):
ans += math.gcd(l, a)
print(ans) | p02713 |
import math
n = int(eval(input()))
a = 0
for i in range(n):
for j in range(n):
for k in range(n):
t = math.gcd(i+1, j+1)
a = a + math.gcd(t, k+1)
print(a) | from math import gcd
n=int(eval(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) | p02713 |
import itertools
import math
k = int(eval(input()))
ans = 0
t = 0
for x, y, z in itertools.product(list(range(1, k+1)), list(range(1, k+1)),list(range(1, k+1))):
ans = math.gcd(x, y)
ans = math.gcd(ans, z)
t+=ans
print(t) | from math import gcd
k = int(eval(input()))
ans = 0
t = 0
for i1 in range(1, k+1):
for i2 in range(1, k+1):
for i3 in range(1, k+1):
t += gcd(gcd(i1, i2), i3)
print(t) | p02713 |
import math
k = int(eval(input()))
t = 0
for i1 in range(1, k+1):
for i2 in range(1, k+1):
for i3 in range(1, k+1):
t+=math.gcd(math.gcd(i1, i2), i3)
print(t) | from math import gcd
k = int(eval(input()))
t = 0
for i1 in range(1, k+1):
for i2 in range(1, k+1):
for i3 in range(1, k+1):
t+=gcd(gcd(i1, i2), i3)
print(t) | p02713 |
def gcd(a,b):
c = 0
if b > a:
a,b = b,a
while a % b != 0:
c = b
b = a % b
a = c
return b
K = int(eval(input()))
count = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
count += gcd(gcd(i,j),k)
print(count) | import math
K = int(eval(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) | p02713 |
from functools import reduce
def gcd(a, b):
while b:
a, b = b, a % b
return a
def gcdArr(a):
return reduce(gcd, a)
n = int(eval(input()))
ret = 0
for a in range(1, n + 1):
for b in range(1, n + 1):
for c in range(1, n + 1):
ret += gcdArr((a, b, c))
print(re... | from functools import reduce
def gcd(a, b):
while b:
a, b = b, a % b
return a
def gcdArr(a):
return reduce(gcd, a)
n = int(eval(input()))
ret = 0
for a in range(1, n + 1):
for b in range(1, n + 1):
gcd_ = gcd(a, b)
if gcd_ == 1:
ret += n
... | p02713 |
from math import gcd
K = int(eval(input()))
ans = 0
for i in range(K):
for j in range(K):
for k in range(K):
ans += gcd(gcd(i + 1, j + 1), k + 1)
print(ans) | from math import gcd
K = int(eval(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 += gcd(gcd(i, j), k)
print(ans) | p02713 |
import math
K = int(eval(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 += math.gcd(math.gcd(a,b),math.gcd(b,c))
print(ans) | import math
K = int(eval(input()))
ans = 0
for a in range(1,K+1):
for b in range(1,K+1):
g = math.gcd(a,b)
for c in range(1,K+1):
ans += math.gcd(g,c)
print(ans) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
total = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
total += gcd(i,j,k)
print(total) | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
total = K*K
for i in range(2,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
total += gcd(i,j,k)
print(total) | p02713 |
def kk(n,m):
if n<m:
n,m=m,n
while n%m!=0:
n=n%m
n,m=m,n
return m
k= int(eval(input()))
count=0
for p in range(1,k+1):
for q in range(1,k+1):
pq= kk(p,q)
for r in range(1,k+1):
pqr= kk(pq,r)
count= count+ pqr
print(co... | def kk(n,m):
if n<m:
n,m=m,n
while n%m!=0:
n=n%m
n,m=m,n
return m
k= int(eval(input()))
count=0
for p in range(1,k+1):
for q in range(p,k+1):
pq= kk(p,q)
for r in range(q,k+1):
pqr= kk(pq,r)
if p==r:
pq... | p02713 |
k = int(eval(input()))
s = 0
import math
from functools import reduce
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
s += reduce(math.gcd, [a,b,c])
print(s) | k = int(eval(input()))
s = 0
import math
from functools import reduce
for a in range(1,k+1):
for b in range(1,k+1):
g = math.gcd(a,b)
for c in range(1,k+1):
s += math.gcd(g,c)
print(s)
| p02713 |
import math
K = int(eval(input()))
outSum = 0
for i in range(1,K+1):
for j in range(1, K + 1):
for k in range(1, K + 1):
outSum += math.gcd(math.gcd(i,j),k)
print(outSum) | K=int(eval(input()))
L1=[1, 9, 30, 76, 141, 267, 400, 624, 885, 1249, 1590, 2208, 2689, 3411, 4248, 5248, 6081, 7485, 8530, 10248, 11889, 13687, 15228, 17988, 20053, 22569, 25242, 28588, 31053, 35463, 38284, 42540, 46581, 50893, 55362, 61824, 65857, 71247, 76884, 84388, 89349, 97881, 103342, 111528, 120141, 128047, 13... | p02713 |
import math
K = int(eval(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 += math.gcd(math.gcd(a,b),c)
print(ans)
| from math import gcd
K = int(eval(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)
| p02713 |
import math
from functools import reduce
import itertools
def gcd(*numbers):
return reduce(math.gcd, numbers)
N = int(eval(input()))
i = 0
for a, b, c in itertools.product(list(range(1,N+1)), list(range(1,N+1)),list(range(1,N+1))):
i += gcd(a, b, c)
print(i) | from math import gcd
N = int(eval(input()))
i = 0
for a in range(1, N+1):
for b in range(1, N+1):
for c in range(1, N+1):
i += gcd(gcd(a, b), c)
print(i) | p02713 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.