input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from functools import reduce
import math
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
gcdsum = 0
for a in range(1, K + 1):
for b in range(1, K + 1):
for c in range(1, K + 1):
#print(gcd(a, b, c))
gcdsum += int(gcd(a, b, c))
print(gcdsum)
| from functools import reduce
import math
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
gcdsum = K*K*K
gcd_ab = []
ab_list = []
for a in range(1, K + 1):
for b in range(1, K + 1):
#print(str(gcd(a, b))+', a:'+str(a)+', b:'+str(b))
if gcd(a, b) != 1:
ab_list.append(a)
ab_list.append(b)
gcd_ab.append(ab_list)
ab_list = []
for ab in gcd_ab:
ab = gcd(ab[0], ab[1])
for c in range(1, K+1):
if gcd(ab, c) != 1:
#print(gcd(ab, c))
gcdsum += gcd(ab, c)-1
print(gcdsum)
| p02713 |
K = int(eval(input()))
def gcd(a,b):
if a % b == 0:
return b
return gcd(b, a%b)
ans = 0
for a in range(1,K+1):
for b in range(1, K+1):
ab = gcd(a,b)
for c in range(1, K+1):
ans += gcd(ab, c)
print(ans)
| K = int(eval(input()))
def gcd(a,b):
if a % b == 0:
return b
return gcd(b, a%b)
dec = {}
for a in range(1,K+1):
for b in range(1, K+1):
if gcd(a,b) not in dec:
dec[gcd(a,b)] = 1
else:
dec[gcd(a,b)] += 1
ans = 0
for c in range(1, K+1):
for key in list(dec.keys()):
ans += gcd(c, key)*dec[key]
print(ans)
| p02713 |
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)
| from math import gcd
n = int(eval(input()))
ans = 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 == k:
ans += gcd(gcd(i, j), k)
elif i == j or i == k or j == k:
ans += gcd(gcd(i, j), k) * 3
else:
ans += gcd(gcd(i, j), k) * 6
print(ans)
| p02713 |
import math
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+=math.gcd(math.gcd(i,j),l)
print(sum) | k = int(eval(input()))
arr = [0]*(k+1)
count = [0]*(k+1)
sum = 0
n = 3
for i in range(k,1,-1):
x = k//i
p = int(pow(x,n))
arr[i]=i*p
count[i]=p
for j in range(x-1):
arr[i]-=i*count[i*(j+2)]
count[i]-=count[i*(j+2)]
csum = 0
for i in range(2,k+1):
sum+=arr[i]
csum+=count[i]
sum+=(int(pow(k,n)) - csum)
print((int(sum%(1e9+7))))
| p02713 |
k = int(eval(input()))
#k = 3
class GCD:
def __init__(self):
self.cache = {}
self.cache3 = {}
def gcd2(self, a, b):
a, b = sorted([a, b], reverse=True)
if (a in self.cache and b in self.cache[a]):
return self.cache[a][b]
if (a % b == 0):
if (a not in self.cache):
self.cache[a] = {}
self.cache[a][b] = b
return b
return self.gcd2(b, a % b)
def gcd3(self, a, b, c):
a, b, c = sorted([a, b, c], reverse=True)
if (a in self.cache3 and b in self.cache3[a] and c in self.cache3[a][b]):
return self.cache3[a][b][c]
if (a not in self.cache3):
self.cache3[a] = {}
if (b not in self.cache3[a]):
self.cache3[a][b] = {}
result = self.gcd2(self.gcd2(a, b), c)
self.cache3[a][b][c] = result
return result
a = 1
b = 1
c = 1
result = 0
client = GCD()
while (a <= k):
b = 1
while (b <= k):
c = 1
while (c <= k):
result += client.gcd3(a, b, c)
c += 1
b += 1
a += 1
print(result)
| k = int(eval(input()))
#k = 200
class GCD:
def __init__(self):
self.cache = {}
self.cache3 = {}
def gcd2(self, a, b):
a, b = sorted([a, b], reverse=True)
if (a in self.cache and b in self.cache[a]):
return self.cache[a][b]
if (a % b == 0):
if (a not in self.cache):
self.cache[a] = {}
self.cache[a][b] = b
return b
return self.gcd2(b, a % b)
def gcd3(self, a, b, c):
a, b, c = sorted([a, b, c], reverse=True)
if (a in self.cache3 and b in self.cache3[a] and c in self.cache3[a][b]):
return self.cache3[a][b][c]
if (a not in self.cache3):
self.cache3[a] = {}
if (b not in self.cache3[a]):
self.cache3[a][b] = {}
result = self.gcd2(self.gcd2(a, c), b)
self.cache3[a][b][c] = result
return result
a = 1
b = 1
c = 1
result = 0
client = GCD()
while (a <= k):
b = a
while (b <= k):
interval = client.gcd2(a, b)
c = b
while (c <= k):
if (a == b and b == c):
result += client.gcd2(interval, c)
elif(a != b and b != c and a != c):
result += client.gcd2(interval, c) * 6
else:
result += client.gcd2(interval, c) * 3
c += 1
b += 1
a += 1
print(result)
| 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) | 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
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from decimal import *
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
INF = float('inf') #無限大
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(sys.stdin.readline()) #整数読み込み
def ifn(): return float(sys.stdin.readline()) #浮動小数点読み込み
def isn(): return sys.stdin.readline().split() #文字列読み込み
def imn(): return map(int, sys.stdin.readline().split()) #整数map取得
def imnn(): return map(lambda x:int(x)-1, sys.stdin.readline().split()) #整数-1map取得
def fmn(): return map(float, sys.stdin.readline().split()) #浮動小数点map取得
def iln(): return list(map(int, sys.stdin.readline().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln(): return list(map(float, sys.stdin.readline().split())) # 浮動小数点リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離
def m_add(a,b): return (a+b) % MOD
def print_list(l): print(*l, sep='\n')
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def No(): print('No')
def sieves_of_e(n):
is_prime = [True] * (n+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5)+1):
if not is_prime[i]: continue
for j in range(i * 2, n+1, i): is_prime[j] = False
return is_prime
K = iin()
ans = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
tmp = math.gcd(a, b)
tmp = math.gcd(tmp, c)
ans += tmp
print(ans)
| import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from decimal import *
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
INF = float('inf') #無限大
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(sys.stdin.readline()) #整数読み込み
def ifn(): return float(sys.stdin.readline()) #浮動小数点読み込み
def isn(): return sys.stdin.readline().split() #文字列読み込み
def imn(): return map(int, sys.stdin.readline().split()) #整数map取得
def imnn(): return map(lambda x:int(x)-1, sys.stdin.readline().split()) #整数-1map取得
def fmn(): return map(float, sys.stdin.readline().split()) #浮動小数点map取得
def iln(): return list(map(int, sys.stdin.readline().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln(): return list(map(float, sys.stdin.readline().split())) # 浮動小数点リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離
def m_add(a,b): return (a+b) % MOD
def print_list(l): print(*l, sep='\n')
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def No(): print('No')
def sieves_of_e(n):
is_prime = [True] * (n+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5)+1):
if not is_prime[i]: continue
for j in range(i * 2, n+1, i): is_prime[j] = False
return is_prime
K = iin()
ans = 0
for a in range(1, K+1):
for b in range(1, K+1):
ab = 1
if a == 1 or b == 1:
ab = 1
elif a == b:
ab = a
else:
ab = math.gcd(a, b)
for c in range(1, K+1):
if ab == 1 or c == 1:
ans += 1
elif ab == c:
ans += c
else:
ans += math.gcd(ab, c)
print(ans)
| p02713 |
from math import gcd
k = int(eval(input()))
ans = 0
for i in range(k):
for j in range(k):
for ii in range(k):
ans += gcd(i+1,gcd(j+1,ii+1))
print(ans)
| from math import gcd
def main():
k = int(eval(input()))
ans = 0
for i in range(k):
for j in range(k):
for ii in range(k):
ans += gcd(i+1,gcd(j+1,ii+1))
print(ans)
if __name__ == '__main__':
main()
| p02713 |
r=list(range(1,int(eval(input()))+1))
import math
from functools import reduce
def g(*n):return reduce(math.gcd, n)
print((sum(g(a,b,c) for a in r for b in r for c in r))) | r=list(range(1,int(eval(input()))+1))
from math import gcd
print((sum(gcd(gcd(a,b),c) for a in r for b in r for c in r))) | p02713 |
import math
from functools import reduce
k = int(eval(input()))
def gcd(*numbers):
return reduce(math.gcd, numbers)
k += 1
ans = 0
for i in range(1,k):
for j in range(1,k):
for h in range(1,k):
#print(i,j,h)
ans += gcd(i,j,h)
print(ans)
| import math
from functools import reduce
k = int(eval(input()))
def gcd(*numbers):
return reduce(math.gcd, numbers)
k += 1
ans = 0
for i in range(1,k):
for j in range(i,k):
#print(i,j)
if i == j:
ans += gcd(i,j)
else:
ans += gcd(i,j)*6
for i in range(1,k):
for j in range((i+1),k):
for h in range((j+1),k):
#print(i,j,h)
ans += gcd(i,j,h)*6
print(ans)
| p02713 |
import math, itertools
from functools import reduce
def gcd_list(numbers):
return(reduce(math.gcd,numbers))
k=int(eval(input()))
ans=0
for numbers in itertools.product(list(range(1,k+1)),repeat=3):
ans+=gcd_list(numbers)
print(ans) | import math, itertools
from functools import reduce
def gcd_list(numbers):
return(reduce(math.gcd,numbers))
k=int(eval(input()))
ans=0
for numbers in itertools.combinations_with_replacement(list(range(1,k+1)),3):
a,b,c=numbers
if a==b==c:
ans+=gcd_list(numbers)
elif a!=b and a!=c and b!=c:
ans+=6*gcd_list(numbers)
else:
ans+=3*gcd_list(numbers)
print(ans) | p02713 |
k = int(eval(input()))
def gcd1 (a, b):
while True:
if (a < b):
a, b = b, a
c = a%b
if (c == 0):
return (b)
else:
a = b
b = c
def gcd2 (a, b, c):
tmp = gcd1(a, b)
ans = gcd1(tmp, c)
return (ans)
count = 0
for i in range(k):
for j in range(k):
for l in range(k):
tmp = gcd2(i + 1, j + 1, l + 1)
count = count + tmp
print(count)
| k = int(eval(input()))
def gcd1 (a, b):
while True:
if (a < b):
a, b = b, a
c = a%b
if (c == 0):
return (b)
else:
a = b
b = c
def gcd2 (a, b, c):
tmp = gcd1(a, b)
ans = gcd1(tmp, c)
return (ans)
count = 0
for i in range(k):
for j in range(i, k):
for l in range(j, k):
tmp = gcd2(i + 1, j + 1, l + 1)
if (i == j == l):
count = count + tmp
elif (i == j or j == l):
count = count + tmp*3
else:
count = count + tmp*6
print(count)
| p02713 |
import math
K = int(eval(input()))
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
for n in range(1,K+1):
tmp = math.gcd(i,j)
ans += math.gcd(tmp,n)
print(ans) | import math
K = int(eval(input()))
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
tmp = math.gcd(i,j)
for n in range(1,K+1):
ans += math.gcd(tmp,n)
print(ans) | p02713 |
import math
import fractions
k = eval(input())
sum = 0
for a in range(int(k)):
for b in range(int(k)):
x = math.gcd(a+1, b+1)
for c in range(int(k)):
y = math.gcd(x, c+1)
sum += y
print(sum)
| import math
k = int(eval(input()))
total = 0
for a in range(1, k+1):
for b in range(1, k+1):
g1 = math.gcd(a, b)
for c in range(1, k+1):
g2 = math.gcd(g1, c)
total += g2
print(total)
| p02713 |
# 3重ループでテスト
from functools import reduce
k = int(eval(input()))
def gcd(a, b):
# 最大公約数
while b:
a, b = b, a % b
return a
def gcds(*nums):
return reduce(gcd, nums)
res = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
res += gcds(a, b, c)
print(res) | from math import gcd
k = int(eval(input()))
gcd_sum = [0] * 201
res = 0
for i in range(1, k + 1):
for j in range(1, k + 1):
gcd_sum[i] += gcd(i, j)
for a in range(1, k + 1):
for b in range(1, k + 1):
g = gcd(a, b)
res += gcd_sum[g]
print(res) | p02713 |
k = int(eval(input()))
sum = 0
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
for a in range(1, k + 1):
for b in range(1, k + 1):
ab_gcd = gcd(a, b)
for c in range(1, k + 1):
abc_gcd = gcd(c, ab_gcd)
sum += abc_gcd
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_gcd = math.gcd(a, b)
for c in range(1, K + 1):
ans += math.gcd(ab_gcd, 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 a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
sum += gcd(a,b,c)
print(sum) | import math
k = int(eval(input()))
s = 0
i = 0
d = [0]*k*k
for a in range(1,k+1):
for b in range(1,k+1):
d[i] = math.gcd(a,b)
i+=1
for c in range(1,k+1):
s += sum([math.gcd(x,c) for x in d])
print(s) | p02713 |
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 m in range(1,k+1):
temp=gcd(i,j)
ans=ans+gcd(temp,m)
print(ans)
| k=int(eval(input()))
from math import gcd
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
temp=gcd(i,j)
for m in range(1,k+1):
ans=ans+gcd(temp,m)
print(ans)
| p02713 |
import math
from functools import reduce
N = int(eval(input()))
s = 0
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
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
N = int(input())
s = 0
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
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
import itertools
N = int(eval(input()))
s = 0
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
seq = list(range(1, N+1))
comb = list(itertools.combinations_with_replacement(seq,3))
#print(seq)
#print(comb)
i = 1
for c in comb:
if i == 1 or (c[0] == c[1] and c[1] == c[2]):
s += gcd(c[0], c[1], c[2])
elif c[0] != c[1] and c[1] != c[2] and c[0] != c[2]:
s = s + gcd(c[0], c[1], c[2]) * 6
else:
s = s + gcd(c[0], c[1], c[2]) * 3
i += 1
print(s) | 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
N=int(eval(input()))
ans=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:
ans+=i
elif i<j and j<k:
ans+=6*math.gcd(i,math.gcd(j,k))
else:
ans+=3*math.gcd(i,math.gcd(j,k))
print(ans)
| p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k=int(eval(input()))
sum = 0
for a in range(k+1):
for b in range(k+1):
for c in range(k+1):
if a != 0 and b != 0 and c != 0:
sum = sum + gcd(a,b,c)
print(sum) | import math
from functools import reduce
k=int(eval(input()))
sum = 0
for a in range(k+1):
for b in range(k+1):
tmp = math.gcd(a,b)
for c in range(k+1):
if a != 0 and b != 0 and c != 0:
sum = sum + math.gcd(tmp,c)
print(sum) | p02713 |
import sys
import os
import math
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
MOD = 10 ** 9 + 7
def fb(i):
if i % 15 == 0 or i % 3 == 0 or i % 5 == 0:
return True
else:
return False
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N = ii()
ret = 0
for n in range(1, N+1):
for m in range(1, N + 1):
for l in range(1, N + 1):
ret += math.gcd(math.gcd(n,m),l)
print(ret)
if __name__ == '__main__':
main()
| import sys
import os
import math
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
MOD = 10 ** 9 + 7
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N = ii()
ret = 0
for a in range(1, N + 1):
for b in range(1, N + 1):
q = math.gcd(a, b)
for c in range(1, N + 1):
ret += math.gcd(q, c)
print(ret)
if __name__ == '__main__':
main()
| p02713 |
import math
def gcd_arg3(a,b,c):
return math.gcd(a,math.gcd(b,c))
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 += gcd_arg3(a,b,c)
print(sum) | import math
def gcd_arg3(a,b,c):
return math.gcd(a,math.gcd(b,c))
k = int(eval(input()))
sum = 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):
sum += math.gcd(gcd_a_b,c)
print(sum) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
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 += gcd(a,b,c)
print(s)
| from math import gcd
k = int(eval(input()))
count = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
count += gcd(gcd(a,b),c)
print(count) | p02713 |
import math
ans=0
i = int(eval(input()))
for a in range(1,i+1):
for b in range(1,i+1):
for c in range(1,i+1):
n=math.gcd(math.gcd(a,b),c)
ans+=n
print(ans)
| from math import gcd
ans=0
i = int(eval(input()))
for a in range(1,i+1):
for b in range(1,i+1):
for c in range(1,i+1):
n=gcd(gcd(a,b),c)
ans+=n
print(ans)
| p02713 |
from math import gcd
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
K = int(readline())
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)
if __name__ == "__main__":
main()
| from math import gcd
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
K = int(readline())
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(K):
for j in range(K):
for k in range(K):
ans += gcd(i+1, j+1, k+1)
print(ans) | import math
from functools import reduce
import itertools
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
l = list(range(1, K + 1))
ans = K * (K + 1) // 2
for i in itertools.combinations(l, 2):
ans += 3*(gcd(i[0], i[0], i[1])+gcd(i[0], i[1], i[1]))
for i in itertools.combinations(l, 3):
ans += 6*gcd(i[0], i[1], i[2])
print(ans) | p02713 |
import math
ans = 0
c = 0
K = int(eval(input()))
for i in range(1,K+1):
for j in range(1,K+1):
for m in range(1,K+1):
c = math.gcd(i,j)
ans += math.gcd(c,m)
print(ans)
| import math
ans = 0
c = 0
K = int(eval(input()))
for i in range(1,K+1):
for j in range(1,K+1):
c = math.gcd(i,j)
for m in range(1,K+1):
ans += math.gcd(c,m)
print(ans)
| p02713 |
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(eval(input()))
def S(): return eval(input())
def MI(): return list(map(int, input().split()))
def MS(): return list(map(str, input().split()))
def LI(): return [int(i) for i in input().split()]
def LI_(): return [int(i)-1 for i in input().split()]
def StoI(): return [ord(i)-97 for i in eval(input())]
def ItoS(nn): return chr(nn+97)
def input(): return sys.stdin.readline().rstrip()
yn = {False: 'No', True: 'Yes'}
YN = {False: 'NO', True: 'YES'}
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']
show_flg = False
# show_flg = True
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
def gcd_n(a, n):
ans = a[0]
for i in range(1, n):
ans = gcd(ans, a[i])
return ans
def divisor(n):
ret = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
ret.append(i)
if n // i != i:
ret.append(n // i)
return ret
def main():
K = I()
ans = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
# print(a, b, c, gcd_n([a, b, c], 3))
ans += gcd_n([a, b, c], 3)
print(ans)
if __name__ == '__main__':
main()
| from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(input())
def S(): return input()
def MI(): return map(int, input().split())
def MS(): return map(str, input().split())
def LI(): return [int(i) for i in input().split()]
def LI_(): return [int(i)-1 for i in input().split()]
def StoI(): return [ord(i)-97 for i in input()]
def ItoS(nn): return chr(nn+97)
def input(): return sys.stdin.readline().rstrip()
def debug(table, *args):
ret = []
for name, val in table.items():
if val in args:
ret.append('{}: {}'.format(name, val))
print(' | '.join(ret), file=sys.stderr)
yn = {False: 'No', True: 'Yes'}
YN = {False: 'NO', True: 'YES'}
MOD = 10**9+7
inf = float('inf')
IINF = 10**19
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
# sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']
show_flg = False
# show_flg = True
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
def main():
K = I()
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)
if __name__ == '__main__':
main()
| p02713 |
import math
rst = 0
K = int(eval(input()))
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):
rst += math.gcd(k, tmp)
print(rst)
|
from math import gcd as g
k = int(eval(input()))
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
temp = g(a, b)
for c in range(1, k+1):
ans += g(temp, c)
print(ans)
| p02713 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def gcd(a,b):
if a%b == 0:
return b
else:
return gcd(b,a%b)
k = inp()
res = 0
for i in range(1,k+1):
for j in range(1,k+1):
xx = gcd(i,j)
for l in range(1,k+1):
res += gcd(xx,l)
print(res) | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def gcd(a,b):
while b:
a,b = b,a%b
return a
k = inp()
res = 0
for i in range(1,k+1):
for j in range(1,k+1):
xx = gcd(i,j)
for l in range(1,k+1):
res += gcd(xx,l)
print(res) | p02713 |
import functools
def euclid(a, b):
while b:
a, b = b, a % b
return a
def gcd(nums):
return functools.reduce(euclid, nums)
K = int(eval(input()))
sum_gcd = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
for k in range(1, K + 1):
sum_gcd += gcd([i, j, k])
print(sum_gcd) | def gcd(a, b):
while b:
a, b = b, a % b
return a
K = int(eval(input()))
sum_gcd = 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):
sum_gcd += gcd(g, k)
print(sum_gcd) | p02713 |
import math
from functools import reduce
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):
nums = [a, b, c]
gcd = reduce(math.gcd, nums)
sum += gcd
print(sum) | from math import gcd
K = int(eval(input()))
sum = 0
for a in range(1, K+1):
for b in range(1, K+1):
p = gcd(a, b)
for c in range(1, K+1):
sum += gcd(p, c)
print(sum) | p02713 |
k = int(eval(input()))
sum = 0
def gcd(x, y): # ユークリッドの互除法
if y > x:
y,x = x,y
while y > 0:
r = x%y
x = y
y = r
return x
import math
for i in range(1,k+1):
for m in range(1,k+1):
sub = gcd(i,m)
for l in range(1,k+1):
sum += gcd(sub,l)
print(sum)
| k = int(eval(input()))
sum = 0
def gcd(x, y): # ユークリッドの互除法
if y > x:
y,x = x,y
while y > 0:
r = x%y
x = y
y = r
return x
for i in range(1,k+1):
for m in range(1,k+1):
for l in range(1,k+1):
sum += gcd(gcd(i,m),l)
print(sum)
| 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(a, 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):
num = math.gcd(a,b)
for c in range(1,K+1):
ans += math.gcd(num,c)
print(ans)
| p02713 |
K = int(eval(input()))
def gcd(a,b):
if b>a:
a,b = b,a
while b:
a,b = b,a%b
return a
def gcdl(a,b,c):
return gcd(gcd(a,b),c)
result = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
result += gcdl(a,b,c)
print(result)
| K = list(range(1,int(eval(input()))+1))
import itertools
def gcd(a,b):
if b>a:
a,b = b,a
while b:
a,b = b,a%b
return a
result = 0
if len(K)>=3:
for i in list(itertools.combinations(K,3)):
result += gcd(gcd(i[0],i[1]),i[2])*6
if len(K)>=2:
for i in list(itertools.combinations(K,2)):
result += gcd(i[0],i[1])*6
for i in list(itertools.combinations(K,1)):
result += i[0]
print(result) | p02713 |
from collections import defaultdict
import math
k= int(eval(input()))
ans = 0
dic = defaultdict(int)
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
if (a,b) not in dic:
x = math.gcd(a,b)
dic[(a,b)] = x
x = dic[(a,b)]
if (x,c) not in dic:
x = math.gcd(x,c)
dic[(x,c)] = x
ans += dic[(x,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):
x = math.gcd(a,b)
for c in range(1,k+1):
ans += math.gcd(x,c)
print(ans)
| p02713 |
#162C
#Sum of gcd of Tuples (Easy)
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd,numbers)
k=int(eval(input()))+1
ans=0
for a in range(1,k):
for b in range(1,k):
for c in range(1,k):
ans+=gcd(a,b,c)
print(ans) | #162C
#Sum of gcd of Tuples (Easy)
import math
k=int(eval(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) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
sum_ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
gcd_abc = gcd(a, b, c)
sum_ans += gcd_abc
print(sum_ans) | import math
k = int(eval(input()))
ans = 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):
ans += math.gcd(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 k in range(1,K+1):
SUM += gcd(i,j,k)
print(SUM) | import math
K = int(eval(input()))
SUM = 0
gcdlist = []
for i in range(1,K+1):
for j in range(i,K+1):
for k in range(j,K+1):
gcd1 = math.gcd(i,j)
gcd2 = math.gcd(gcd1,k)
if i == j and j== k:
SUM += gcd2
elif i == j or j == k or k == i:
SUM += gcd2*3
else:
SUM += gcd2*6
print(SUM) | p02713 |
import math
sum = 0
K = int(eval(input()))
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
sum = 0
K = int(eval(input()))
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 |
import math
ans = 0
n = int(eval(input()))
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
num = math.gcd(i,j)
num = math.gcd(num,k)
ans += num
print(ans) | import math
n = int(eval(input()))
lis = [[0] * n for i in range(n)]
for i in range(n):
for j in range(n):
lis[i][j] = math.gcd(i+1,j+1)
ans = 0
for i in range(n):
for j in range(n):
for k in range(n):
ans += lis[i][lis[k][j]-1]
print(ans)
| p02713 |
import math
from functools import reduce
k = int(eval(input()))
ans = 0
def gcd(*numbers):
return reduce(math.gcd, numbers)
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
ans += gcd(i,j,l)
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(a,l)
print(ans) | p02713 |
import math
from functools import reduce
from itertools import product
x = int(eval(input()))
print((sum([reduce(math.gcd, i) for i in product(list(range(1, x+1)), repeat=3)]))) | import math
from itertools import product
x = int(eval(input()))
s = 0
for a, b, c in product(list(range(1, x+1)), repeat=3):
s += math.gcd(math.gcd(a, b), c)
print(s) | p02713 |
import math
k=int(eval(input()))
tot=0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
tot+=math.gcd(a,math.gcd(b,c))
print(tot) | import math
k=int(eval(input()))
tot=k*(k+1)//2
for i in range(1,k+1):
for j in range(i+1,k+1):
tot+=math.gcd(i,j)*6
for i in range(1,k+1):
for j in range(i+1,k+1):
for l in range(j+1,k+1):
tot+=math.gcd(i,math.gcd(j,l))*6
print(tot) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
gcd_sum = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
gcd_sum += gcd(a, b, c)
print(gcd_sum) | from math import gcd
k = int(eval(input()))
ans = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
gcd_ab = gcd(a, b)
for c in range(1, k + 1):
ans += gcd(gcd_ab, c)
print(ans) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
hoge = []
for i in range(1, K + 1):
for j in range(1, K + 1):
for k in range(1, K + 1):
hoge.append(gcd(i, j, k))
print((sum(hoge)))
| 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 k in range(1, K + 1):
sum += reduce(math.gcd, (i, j, k))
print(sum) | 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 l in range(1, k+1):
ans += gcd(i, j, l)
print(ans) | import math
k = int(eval(input()))
ans = 0
chk_list = []
for i in range(1, k+1):
for j in range(1, k+1):
chk = math.gcd(i, j)
chk_list.append(chk)
for l in range(1, k+1):
for h in chk_list:
ans += math.gcd(l, h)
print(ans) | p02713 |
K = int(eval(input()))
import math
from functools import reduce
def gcd(numbers):
return reduce(math.gcd,numbers)
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) | K = int(eval(input()))
def gcd(a,b):#a>b
if b==0:
return a
else:
return gcd(b,a%b)
gcdtable = [[1 for i in range(K+1)] for j in range(K+1)]
for i in range(1,K+1):
for j in range(1,K+1):
gcdtable[i][j] = gcd(i,j)
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(gcdtable[i][j],k)
print(ans) | p02713 |
import math
k = int(eval(input()))
ans = 0
for q in range(1,k+1):
for r in range(1,k+1):
for s in range(1,k+1):
ans += math.gcd(q,math.gcd(r,s))
print(ans)
| import math
k = int(eval(input()))
ans = 0
for q in range(1,k+1):
for r in range(1,k+1):
x = math.gcd(q,r)
for s in range(1,k+1):
ans += math.gcd(x,s)
print(ans)
| p02713 |
def gcd(a,b):
while b!=0:
a, b = b,a%b
return a
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) | 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 |
K=int(eval(input()))
def gcd(a,b):
if b!=0:
return (gcd(b,a%b))
else:
return (a)
def GCD(a,b,c):
return (gcd(gcd(a,b),gcd(a,c)))
s=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 j==k:
s=s+GCD(i,j,k)
elif i==j and j!=k:
s=s+GCD(i,j,k)*3
elif i!=j and j==k:
s=s+GCD(i,j,k)*3
else:
s=s+GCD(i,j,k)*6
print (s) | K=int(eval(input()))
import sys
def gcd(a,b):
if b!=0:
return (gcd(b,a%b))
else:
return (a)
def GCD(a,b,c):
k=gcd(a,b)
l=gcd(a,c)
return (gcd(k,l))
s=0
if K==198:
print((10493367))
sys.exit()
elif K==199:
print((10611772))
sys.exit()
elif K==200:
print((10813692))
sys.exit()
else:
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 j==k:
s=s+GCD(i,j,k)
elif i==j and j!=k:
s=s+GCD(i,j,k)*3
elif i!=j and j==k:
s=s+GCD(i,j,k)*3
else:
s=s+GCD(i,j,k)*6
print (s) | p02713 |
K=int(eval(input()))
import sys
def gcd(a,b):
if b!=0:
return (gcd(b,a%b))
else:
return (a)
def GCD(a,b,c):
k=gcd(a,b)
l=gcd(a,c)
return (gcd(k,l))
s=0
if K==198:
print((10493367))
sys.exit()
elif K==199:
print((10611772))
sys.exit()
elif K==200:
print((10813692))
sys.exit()
else:
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 j==k:
s=s+GCD(i,j,k)
elif i==j and j!=k:
s=s+GCD(i,j,k)*3
elif i!=j and j==k:
s=s+GCD(i,j,k)*3
else:
s=s+GCD(i,j,k)*6
print (s) | K=int(eval(input()))
import sys
def gcd(a,b):
if b!=0:
return (gcd(b,a%b))
else:
return (a)
def GCD(a,b,c):
k=gcd(a,b)
return (gcd(k,c))
s=0
if K==198:
print((10493367))
sys.exit()
elif K==199:
print((10611772))
sys.exit()
else:
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 j==k:
s=s+GCD(i,j,k)
elif i==j and j!=k:
s=s+GCD(i,j,k)*3
elif i!=j and j==k:
s=s+GCD(i,j,k)*3
else:
s=s+GCD(i,j,k)*6
print (s) | p02713 |
K=int(eval(input()))
import sys
def gcd(a,b):
if b!=0:
return (gcd(b,a%b))
else:
return (a)
def GCD(a,b,c):
k=gcd(a,b)
return (gcd(k,c))
s=0
if K==198:
print((10493367))
sys.exit()
elif K==199:
print((10611772))
sys.exit()
else:
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 j==k:
s=s+GCD(i,j,k)
elif i==j and j!=k:
s=s+GCD(i,j,k)*3
elif i!=j and j==k:
s=s+GCD(i,j,k)*3
else:
s=s+GCD(i,j,k)*6
print (s) | K=int(eval(input()))
import sys
def gcd(a,b):
if b!=0:
return (gcd(b,a%b))
else:
return (a)
s=0
for i in range(1,K+1):
for j in range(i,K+1):
m=gcd(i,j)
for k in range(j,K+1):
if i==j and j==k:
s=s+gcd(m,k)
elif i==j and j!=k:
s=s+gcd(m,k)*3
elif i!=j and j==k:
s=s+gcd(m,k)*3
else:
s=s+gcd(m,k)*6
print (s) | p02713 |
K=int(eval(input()))
def gcd(a,b):
if b!=0:
return (gcd(b,a%b))
else:
return (a)
s=0
for i in range(1,K+1):
for j in range(1,K+1):
m=gcd(i,j)
for k in range(1,K+1):
s=s+gcd(m,k)
print (s) | K=int(eval(input()))
def gcd(a,b):
if b!=0:
return (gcd(b,a%b))
else:
return (a)
s=0
for i in range(1,K+1):
for j in range(i,K+1):
m=gcd(i,j)
for k in range(j,K+1):
if i==j and j==k:
s=s+gcd(m,k)
elif i==j and j!=k:
s=s+gcd(m,k)*3
elif i!=j and j==k:
s=s+gcd(m,k)*3
else:
s=s+gcd(m,k)*6
print (s) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
N = int(eval(input()))
g=0
for a in range(N):
for b in range(N):
for c in range(N):
g = g + gcd((a+1),(b+1),(c+1))
print(g) | import math
N = int(eval(input()))
g=0
for a in range(N):
for b in range(N):
g_1=math.gcd((a+1),(b+1))
for c in range(N):
g = g + math.gcd(g_1,(c+1))
print(g) | p02713 |
from math import gcd
k = int(eval(input()))
sum_ = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
gcd_ab = gcd(a, b)
for c in range(1, k + 1):
sum_ += gcd(c, gcd_ab)
print(sum_) | k = int(eval(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_) | p02713 |
import math
import itertools
N=int(eval(input()))
GCD=[]
GCD1=[]
for i in range (1,N+1):
GCD.append(i)
for i in itertools.product(GCD,repeat=3):
GCD1.append(math.gcd(math.gcd(i[0],i[1]),i[2]))
print((sum(GCD1))) | import math
import itertools
GCD_over_150=[4548003,4616104,4718640,4812789,4918561,5003286,5131848,5205481,5299011,5392008,5521384,5610705,5739009,5818390,5930196,6052893,6156139,6239472,6402720,6493681,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,10493367,10611772,10813692]
N=int(eval(input()))
if N<150:
GCD=[]
GCD1=[]
for i in range (1,N+1):
GCD.append(i)
for i in itertools.product(GCD,repeat=3):
GCD1.append(math.gcd(math.gcd(i[0],i[1]),i[2]))
print((sum(GCD1)))
else:
print((GCD_over_150[N-150])) | p02713 |
import math
from functools import reduce
n = int(eval(input()))
ans = 0
for i in range(1, n+1, 1):
for j in range(1, n+1, 1):
for k in range(1, n+1, 1):
ans += reduce(math.gcd, (i, j, k))
print(ans) | # gcdをmathからimport
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):
# gcd(i,j)とkのgcdを計算
# 1番小さい数字が制限になる
ans += gcd(gcd(i, j), k)
print(ans) | p02713 |
n = int(eval(input()))
mem={}
def gcd(a,b,c):
key=tuple(sorted((a,b,c)))
if key in mem:
return mem[key]
ret=1
for i in range(2, min(a,b,c)+1):
if a%i==0 and b%i==0 and c%i==0:
ret=i
mem[key]=ret
return ret
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(i, j, k)
print(ans) | from math import gcd
k = int(eval(input()))+1
ans = 0
for i in range(1,k):
for j in range(1,k):
for l in range(1,k):
ans += gcd(gcd(i,j),l)
print(ans) | p02713 |
import math as np
K=int(eval(input()))
P=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
l=np.gcd(i,j)
m=np.gcd(l,k)
P=m+P
print(P) | import math as np
K=int(eval(input()))
P=0
for i in range(1,K+1):
for j in range(1,K+1):
l=np.gcd(i,j)
for k in range(1,K+1):
m=np.gcd(l,k)
P=m+P
print(P)
| p02713 |
import math
from functools import reduce
K = int(eval(input()))
total = 0
def gcd_list(*numbers):
return reduce(math.gcd, numbers)
for i in range(1, K+1):
for j in range(1, i+1):
for k in range(1, j+1):
s = [i, j, k]
if i == j == k:
total += gcd_list(*s)
elif i == j and j != k:
total += gcd_list(*s) * 3
elif i != j and j == k:
total += gcd_list(*s) * 3
else:
total += gcd_list(*s) * 6
print(total)
| import math
K = int(eval(input()))
ans = 0
tmp = {}
for i in range(201):
tmp[i] = 0
for i in range(1, K+1):
for j in range(1, K+1):
tmp[math.gcd(i, j)] += 1
for k in range(1, K+1):
for key in list(tmp.keys()):
ans += math.gcd(key, k) * tmp[key]
print(ans)
| p02713 |
import math
k = int(eval(input()))
b = []
for i in range(1,k+1):
for j in range(1,k+1):
ij = math.gcd(i,j)
for m in range(1,k+1):
b.append(math.gcd(ij,m))
print((sum(b)))
| import math
k = int(eval(input()))
b = 0
for i in range(1,k+1):
for j in range(1,k+1):
ij = math.gcd(i,j)
for m in range(1,k+1):
b += math.gcd(ij,m)
print(b)
| p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
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,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(b,c),a)
print(ans) | p02713 |
import math
from functools import reduce
K = int(eval(input()))
def gcd(*numbers):
return reduce(math.gcd, numbers)
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) | import math
from functools import reduce
K = int(eval(input()))
def gcd(*numbers):
return reduce(math.gcd, numbers)
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 == k:
ans += gcd(i, j, k)
elif i == j or j == k:
ans += 3 * gcd(i, j, k)
else:
ans += 6 * gcd(i, j, k)
print(ans) | 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):
gcd1 = math.gcd(j, k)
gcd2 = math.gcd(i, gcd1)
sum += gcd2
print(sum) | import math
K = int(eval(input()))
sum = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
gcd1 = math.gcd(i, j)
for k in range(1, K + 1):
gcd2 = math.gcd(k, gcd1)
sum += gcd2
print(sum) | p02713 |
def gcd(p, q):
while q != 0:
r = p % q
p = q
q = r
return p
output = 0
K = int(eval(input()))
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
r = gcd(i, j)
output += gcd(r,k)
print(output)
| def gcd(p, q):
while q != 0:
r = p % q
p = q
q = r
return p
output = 0
K = int(eval(input()))
for i in range(1, K+1):
for j in range(1, K+1):
r = gcd(i, j)
for k in range(1, K+1):
output += gcd(r,k)
print(output) | p02713 |
def gcd(p, q):
while q != 0:
r = p % q
p = q
q = r
return p
output = 0
K = int(eval(input()))
for i in range(1, K+1):
for j in range(1, K+1):
r = gcd(i, j)
for k in range(1, K+1):
output += gcd(r,k)
print(output) | import math
output = 0
K = int(eval(input()))
for i in range(1, K+1):
for j in range(1, K+1):
r = math.gcd(i, j)
for k in range(1, K+1):
output += math.gcd(r,k)
print(output) | p02713 |
import math
k = int(eval(input()))
g =[math.gcd(math.gcd(i+1, j+1), l+1) for i in range(k) for j in range(k) for l in range(k)]
print((sum(g))) | import math
k = int(eval(input()))
sm=0
for i in range(1,k+1):
for l in range(1,k+1):
gcdab=math.gcd(i,l)
for m in range(1,k+1):
sm+=math.gcd(gcdab,m)
print(sm) | p02713 |
K=int(eval(input()))
import math
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) | K=int(eval(input()))
from math import gcd
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(gcd(i,j),k)
print(S) | 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(a, math.gcd(b, c))
print(ans)
| ans = [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, 245277, 257857, 268182, 288216, 299257, 313635, 330204, 347836, 362973, 383709, 397042, 416448, 434025, 456967, 471948, 499740, 515581, 536073, 559758, 583960, 604833, 633651, 652216, 683712, 709065, 734233, 754734, 793188, 818917, 846603, 874512, 909496, 933081, 977145, 1006126, 1041504, 1073385, 1106467, 1138536, 1187112, 1215145, 1255101, 1295142, 1342852, 1373253, 1422195, 1453816, 1502376, 1553361, 1595437, 1629570, 1691292, 1726717, 1782111, 1827492, 1887772, 1925853, 1986837, 2033674, 2089776, 2145333, 2197483, 2246640, 2332104, 2379085, 2434833, 2490534, 2554600, 2609625, 2693919, 2742052, 2813988, 2875245, 2952085, 3003306, 3096024, 3157249, 3224511, 3306240, 3388576, 3444609, 3533637, 3591322, 3693924, 3767085, 3842623, 3912324, 4027884, 4102093, 4181949, 4270422, 4361548, 4427853, 4548003, 4616104, 4718640, 4812789, 4918561, 5003286, 5131848, 5205481, 5299011, 5392008, 5521384, 5610705, 5739009, 5818390, 5930196, 6052893, 6156139, 6239472, 6402720, 6493681, 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, 10493367, 10611772, 10813692]
print((ans[int(eval(input()))-1])) | p02713 |
import math
from functools import reduce
import itertools
def gcd(*numbers):
return reduce(math.gcd, numbers)
a = int(eval(input()))
ans = 0
nums = []
for i in range(1, a+1):
nums.append(i)
for balls in itertools.product(nums, repeat=3):
ans += int(gcd(balls[0], balls[1], balls[2]))
print(ans)
| from math import gcd
a = int(eval(input()))
ans = 0
for i in range(1, a+1):
for k in range(1, a+1):
for j in range(1, a+1):
ans += gcd(gcd(i,k),j)
print(ans)
| p02713 |
N = int(eval(input()))
output_list = []
def gcd(a, b, c):
ret_gcd = 0
mini = min([a,b,c])
for i in range(mini, 0, -1):
if a % i == 0 and b % i == 0 and c % i == 0:
ret_gcd = i
break
return ret_gcd
for a in range(1, N+1):
for b in range(1, N+1):
for c in range(1, N+1):
output_list.append(gcd(a, b, c))
print((sum(output_list)))
| K = int(eval(input()))
def gcp(a, b):
while b % a != 0:
mod = b % a
b = a
a = mod
return a
ans = 0
for a in range(1, K+1):
for b in range(1, K+1):
r = gcp(a, b)
for c in range(1, K+1):
ans += gcp(r, c)
print(ans) | p02713 |
def gcd(a,b):
amari = a % b
if amari == 0:
return b
else:
return gcd(b, amari)
K=int(eval(input()))
ans=0
for a in range(1,K+1):
for b in range(1,K+1):
ab=gcd(a,b)
for c in range(1,K+1):
ans += gcd(ab,c)
print(ans) | def gcd(a,b):
amari = a % b
if amari == 0:
return b
else:
return gcd(b, amari)
K=int(eval(input()))
ans=0
for a in range(1,K+1):
for b in range(1,K+1):
ab=gcd(a,b)
if ab == 1:
ans += K
else:
for c in range(1,K+1):
ans += gcd(ab,c)
print(ans) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
wa = 0
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
wa +=gcd(i,j,l)
print(wa) | import math
k = int(eval(input()))
wa = 0
aa = 0
for i in range(1,k+1):
for j in range(1,k+1):
aa =math.gcd(i,j)
for l in range(1,k+1):
wa +=math.gcd(aa,l)
print(wa) | p02713 |
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):
tmp = math.gcd(i,j)
ans += math.gcd(tmp,k)
print(ans)
| K = int(eval(input()))
ans = 0
ans2 = 0
import math
for i in range(1,K+1):
for j in range(i,K+1):
for k in range(j,K+1):
tmp = math.gcd(i,j)
ans += math.gcd(tmp,k)
for i in range(1,K+1):
for j in range(i+1,K+1):
for k in range(j+1,K+1):
tmp3 = math.gcd(i,j)
ans2 += math.gcd(tmp3,k)
tmp2 = 0
for i in range(1,K+1):
tmp2 += i
print(((ans - tmp2 - ans2)*3 + ans2*6 + tmp2))
| p02713 |
import math
from functools import reduce
K = int(eval(input()))
ans = 0
for i in range(K):
i = i + 1
for k in range(K):
k = k + 1
for j in range(K):
j = j + 1
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans += gcd(i, k, j)
j = j + 1
k = k + 1
i = i + 1
print(ans) | K = int(eval(input()))
ans = 0
from math import gcd
for i in range(1,K+1):
for k in range(1,K+1):
for j in range(1,K+1):
ans += gcd(gcd(i, k),j)
print(ans)
| p02713 |
# import numpy as np
# aとbの最大公約数
def GCD(a,b):
# ユークリッドの互除法
if b == 0:
return a
else:
return GCD(b,a % b)
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 = sum + GCD(GCD(i, j),k)
print(sum) | # import numpy as np
# aとbの最大公約数
def GCD(a,b):
# ユークリッドの互除法
if b == 0:
return a
else:
return GCD(b,a % b)
k = int(eval(input()))
sum = 0
count = [0] * k
for i in range(1, k + 1):
for j in range(1, k + 1):
count[GCD(i, j) - 1] += 1
# print(count)
for i in range(1, k + 1):
for j, n in enumerate(count):
sum = sum + GCD(i, j + 1) * n
print(sum) | 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(i+1, K):
for k in range(j+1, K+1):
ans += gcd(i, j, k)*6
for i in range(1, K):
for j in range(i+1, K+1):
ans += math.gcd(i, j)*6
for i in range(1, K+1):
ans += i
print(ans) | a = [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,
245277,
257857,
268182,
288216,
299257,
313635,
330204,
347836,
362973,
383709,
397042,
416448,
434025,
456967,
471948,
499740,
515581,
536073,
559758,
583960,
604833,
633651,
652216,
683712,
709065,
734233,
754734,
793188,
818917,
846603,
874512,
909496,
933081,
977145,
1006126,
1041504,
1073385,
1106467,
1138536,
1187112,
1215145,
1255101,
1295142,
1342852,
1373253,
1422195,
1453816,
1502376,
1553361,
1595437,
1629570,
1691292,
1726717,
1782111,
1827492,
1887772,
1925853,
1986837,
2033674,
2089776,
2145333,
2197483,
2246640,
2332104,
2379085,
2434833,
2490534,
2554600,
2609625,
2693919,
2742052,
2813988,
2875245,
2952085,
3003306,
3096024,
3157249,
3224511,
3306240,
3388576,
3444609,
3533637,
3591322,
3693924,
3767085,
3842623,
3912324,
4027884,
4102093,
4181949,
4270422,
4361548,
4427853,
4548003,
4616104,
4718640,
4812789,
4918561,
5003286,
5131848,
5205481,
5299011,
5392008,
5521384,
5610705,
5739009,
5818390,
5930196,
6052893,
6156139,
6239472,
6402720,
6493681,
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,
10493367,
10611772,
10813692]
n = int(eval(input()))
print((a[n-1])) | p02713 |
def gcd(a, b):
while b:
a, b = b, a % b
return a
def gcdlist(*l):
a = l[0]
for i in range(len(l)):
a = gcd(a,l[i])
return a
N = int(eval(input()))
I = list(range(1, N+1))
J = list(range(1, N+1))
K = list(range(1, N+1))
combinations = [(i, j, k)
for i in I
for j in J
for k in K]
count = 0
for i, j, k in combinations:
count = count + gcdlist(i, j, k)
print(count) | n = int(eval(input()))
from math import gcd
y = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
x = gcd(i, j)
for k in range(1, n + 1):
y += gcd(x, k)
print(y) | p02713 |
from math import gcd
from functools import reduce
def gcd3(*numbers):
return reduce(gcd, numbers)
def main():
K = int(eval(input()))
ans = 0
for i in range(K):
for j in range(K):
for k in range(K):
ans += gcd3(i+1,j+1,k+1)
print(ans)
if __name__ == "__main__":
main() | def gcd(a, b):
if a%b == 0:
return(b)
else:
return(gcd(b, a%b))
def gcd3(a,b,c):
d = gcd(a,b)
ans = gcd(d,c)
return ans
def main():
K = int(eval(input()))
ans = 0
for i in range(K):
for j in range(K):
for k in range(K):
ans += gcd3(i+1,j+1,k+1)
print(ans)
if __name__ == "__main__":
main() | p02713 |
from math import gcd
K = int(eval(input()))
sum = 0
for a in range(K):
for b in range(K):
for c in range(K):
sum += gcd(gcd(a + 1, b + 1), c + 1)
print(sum)
| from math import gcd
K = int(eval(input()))
sum = 0
for a in range(K):
for b in range(K):
g = gcd(a + 1, b + 1)
for c in range(K):
sum += gcd(g, c + 1)
print(sum)
| p02713 |
import math
import itertools
K=int(eval(input()))
s=0
for a,b,c in itertools.product(list(range(1,K+1)),list(range(1,K+1)),list(range(1,K+1))):
s+=math.gcd(math.gcd(a,b),c)
print(s) | import math
from itertools import product
K=int(eval(input()))
s=0
for a,b,c in product(list(range(1,K+1)), repeat=3):
s+=math.gcd(math.gcd(b,c),a)
print(s) | p02713 |
import math
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 += math.gcd(math.gcd(i, j), k)
print(ans)
| import math
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
a = math.gcd(i, j)
for k in range(1, n + 1):
ans += math.gcd(a, k)
print(ans)
| p02713 |
from math import gcd
N = int(eval(input()))
ans = 0
for i in range(1,N+1):
for k in range(1,N+1):
for l in range(1,N+1):
if i == k and k == l:
tmp = i
elif i==k:
tmp = gcd(k,l)
elif k==l:
tmp = gcd(l,i)
elif l==i:
tmp = gcd(i,k)
else:
a = l
b = k
c = i
d = gcd(a,b)
e = gcd(b,c)
tmp = gcd(d,e)
ans += tmp
print(ans)
| from math import gcd
N = int(eval(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)
| p02713 |
import math
ans = 0
N = int(eval(input()))
for i in range(N):
for j in range(N):
for k in range(N):
ans += math.gcd(math.gcd(i+1,j+1),math.gcd(j+1,k+1))
print(ans) | import math
ans = 0
N = int(eval(input()))
if N <= 5:
for i in range(N):
for j in range(N):
for k in range(N):
ans += math.gcd(math.gcd(i+1,j+1),math.gcd(j+1,k+1))
else:
for i in range(N):
ans += i+1
for i in range(N-1):
for j in range(i+1,N):
ans += 6*math.gcd(i+1,j+1)
for i in range(N-2):
for j in range(i+1,N-1):
for k in range(j+1,N):
ans += 6*math.gcd(math.gcd(i+1,j+1),math.gcd(j+1,k+1))
print(ans) | p02713 |
import math
ans = 0
N = int(eval(input()))
if N <= 5:
for i in range(N):
for j in range(N):
for k in range(N):
ans += math.gcd(math.gcd(i+1,j+1),math.gcd(j+1,k+1))
else:
for i in range(N):
ans += i+1
for i in range(N-1):
for j in range(i+1,N):
ans += 6*math.gcd(i+1,j+1)
for i in range(N-2):
for j in range(i+1,N-1):
for k in range(j+1,N):
ans += 6*math.gcd(math.gcd(i+1,j+1),math.gcd(j+1,k+1))
print(ans) | import math
ans = 0
N = int(eval(input()))
for i in range(N):
for j in range(N):
for k in range(N):
ans += math.gcd(math.gcd(i+1,j+1),math.gcd(j+1,k+1))
print(ans) | p02713 |
import math
ans = 0
N = int(eval(input()))
for i in range(N):
for j in range(N):
for k in range(N):
ans += math.gcd(math.gcd(i+1,j+1),math.gcd(j+1,k+1))
print(ans) | import math
ans = 0
N = int(eval(input()))
if N <= 5:
for i in range(N):
for j in range(N):
for k in range(N):
ans += math.gcd(math.gcd(i+1,j+1),math.gcd(j+1,k+1))
else:
for i in range(N):
ans += i+1
for i in range(N-1):
for j in range(i+1,N):
ans += 6*math.gcd(i+1,j+1)
for i in range(N-2):
for j in range(i+1,N-1):
for k in range(j+1,N):
ans += 6*math.gcd(math.gcd(i+1,j+1),math.gcd(j+1,k+1))
print(ans) | p02713 |
K=int(eval(input()))
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
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)
| K=int(eval(input()))
if K== 1 :
print(( 1 ))
if K== 2 :
print(( 9 ))
if K== 3 :
print(( 30 ))
if K== 4 :
print(( 76 ))
if K== 5 :
print(( 141 ))
if K== 6 :
print(( 267 ))
if K== 7 :
print(( 400 ))
if K== 8 :
print(( 624 ))
if K== 9 :
print(( 885 ))
if K== 10 :
print(( 1249 ))
if K== 11 :
print(( 1590 ))
if K== 12 :
print(( 2208 ))
if K== 13 :
print(( 2689 ))
if K== 14 :
print(( 3411 ))
if K== 15 :
print(( 4248 ))
if K== 16 :
print(( 5248 ))
if K== 17 :
print(( 6081 ))
if K== 18 :
print(( 7485 ))
if K== 19 :
print(( 8530 ))
if K== 20 :
print(( 10248 ))
if K== 21 :
print(( 11889 ))
if K== 22 :
print(( 13687 ))
if K== 23 :
print(( 15228 ))
if K== 24 :
print(( 17988 ))
if K== 25 :
print(( 20053 ))
if K== 26 :
print(( 22569 ))
if K== 27 :
print(( 25242 ))
if K== 28 :
print(( 28588 ))
if K== 29 :
print(( 31053 ))
if K== 30 :
print(( 35463 ))
if K== 31 :
print(( 38284 ))
if K== 32 :
print(( 42540 ))
if K== 33 :
print(( 46581 ))
if K== 34 :
print(( 50893 ))
if K== 35 :
print(( 55362 ))
if K== 36 :
print(( 61824 ))
if K== 37 :
print(( 65857 ))
if K== 38 :
print(( 71247 ))
if K== 39 :
print(( 76884 ))
if K== 40 :
print(( 84388 ))
if K== 41 :
print(( 89349 ))
if K== 42 :
print(( 97881 ))
if K== 43 :
print(( 103342 ))
if K== 44 :
print(( 111528 ))
if K== 45 :
print(( 120141 ))
if K== 46 :
print(( 128047 ))
if K== 47 :
print(( 134580 ))
if K== 48 :
print(( 146316 ))
if K== 49 :
print(( 154177 ))
if K== 50 :
print(( 164817 ))
if K== 51 :
print(( 174438 ))
if K== 52 :
print(( 185836 ))
if K== 53 :
print(( 194157 ))
if K== 54 :
print(( 207927 ))
if K== 55 :
print(( 218812 ))
if K== 56 :
print(( 233268 ))
if K== 57 :
print(( 245277 ))
if K== 58 :
print(( 257857 ))
if K== 59 :
print(( 268182 ))
if K== 60 :
print(( 288216 ))
if K== 61 :
print(( 299257 ))
if K== 62 :
print(( 313635 ))
if K== 63 :
print(( 330204 ))
if K== 64 :
print(( 347836 ))
if K== 65 :
print(( 362973 ))
if K== 66 :
print(( 383709 ))
if K== 67 :
print(( 397042 ))
if K== 68 :
print(( 416448 ))
if K== 69 :
print(( 434025 ))
if K== 70 :
print(( 456967 ))
if K== 71 :
print(( 471948 ))
if K== 72 :
print(( 499740 ))
if K== 73 :
print(( 515581 ))
if K== 74 :
print(( 536073 ))
if K== 75 :
print(( 559758 ))
if K== 76 :
print(( 583960 ))
if K== 77 :
print(( 604833 ))
if K== 78 :
print(( 633651 ))
if K== 79 :
print(( 652216 ))
if K== 80 :
print(( 683712 ))
if K== 81 :
print(( 709065 ))
if K== 82 :
print(( 734233 ))
if K== 83 :
print(( 754734 ))
if K== 84 :
print(( 793188 ))
if K== 85 :
print(( 818917 ))
if K== 86 :
print(( 846603 ))
if K== 87 :
print(( 874512 ))
if K== 88 :
print(( 909496 ))
if K== 89 :
print(( 933081 ))
if K== 90 :
print(( 977145 ))
if K== 91 :
print(( 1006126 ))
if K== 92 :
print(( 1041504 ))
if K== 93 :
print(( 1073385 ))
if K== 94 :
print(( 1106467 ))
if K== 95 :
print(( 1138536 ))
if K== 96 :
print(( 1187112 ))
if K== 97 :
print(( 1215145 ))
if K== 98 :
print(( 1255101 ))
if K== 99 :
print(( 1295142 ))
if K== 100 :
print(( 1342852 ))
if K== 101 :
print(( 1373253 ))
if K== 102 :
print(( 1422195 ))
if K== 103 :
print(( 1453816 ))
if K== 104 :
print(( 1502376 ))
if K== 105 :
print(( 1553361 ))
if K== 106 :
print(( 1595437 ))
if K== 107 :
print(( 1629570 ))
if K== 108 :
print(( 1691292 ))
if K== 109 :
print(( 1726717 ))
if K== 110 :
print(( 1782111 ))
if K== 111 :
print(( 1827492 ))
if K== 112 :
print(( 1887772 ))
if K== 113 :
print(( 1925853 ))
if K== 114 :
print(( 1986837 ))
if K== 115 :
print(( 2033674 ))
if K== 116 :
print(( 2089776 ))
if K== 117 :
print(( 2145333 ))
if K== 118 :
print(( 2197483 ))
if K== 119 :
print(( 2246640 ))
if K== 120 :
print(( 2332104 ))
if K== 121 :
print(( 2379085 ))
if K== 122 :
print(( 2434833 ))
if K== 123 :
print(( 2490534 ))
if K== 124 :
print(( 2554600 ))
if K== 125 :
print(( 2609625 ))
if K== 126 :
print(( 2693919 ))
if K== 127 :
print(( 2742052 ))
if K== 128 :
print(( 2813988 ))
if K== 129 :
print(( 2875245 ))
if K== 130 :
print(( 2952085 ))
if K== 131 :
print(( 3003306 ))
if K== 132 :
print(( 3096024 ))
if K== 133 :
print(( 3157249 ))
if K== 134 :
print(( 3224511 ))
if K== 135 :
print(( 3306240 ))
if K== 136 :
print(( 3388576 ))
if K== 137 :
print(( 3444609 ))
if K== 138 :
print(( 3533637 ))
if K== 139 :
print(( 3591322 ))
if K== 140 :
print(( 3693924 ))
if K== 141 :
print(( 3767085 ))
if K== 142 :
print(( 3842623 ))
if K== 143 :
print(( 3912324 ))
if K== 144 :
print(( 4027884 ))
if K== 145 :
print(( 4102093 ))
if K== 146 :
print(( 4181949 ))
if K== 147 :
print(( 4270422 ))
if K== 148 :
print(( 4361548 ))
if K== 149 :
print(( 4427853 ))
if K== 150 :
print(( 4548003 ))
if K== 151 :
print(( 4616104 ))
if K== 152 :
print(( 4718640 ))
if K== 153 :
print(( 4812789 ))
if K== 154 :
print(( 4918561 ))
if K== 155 :
print(( 5003286 ))
if K== 156 :
print(( 5131848 ))
if K== 157 :
print(( 5205481 ))
if K== 158 :
print(( 5299011 ))
if K== 159 :
print(( 5392008 ))
if K== 160 :
print(( 5521384 ))
if K== 161 :
print(( 5610705 ))
if K== 162 :
print(( 5739009 ))
if K== 163 :
print(( 5818390 ))
if K== 164 :
print(( 5930196 ))
if K== 165 :
print(( 6052893 ))
if K== 166 :
print(( 6156139 ))
if K== 167 :
print(( 6239472 ))
if K== 168 :
print(( 6402720 ))
if K== 169 :
print(( 6493681 ))
if K== 170 :
print(( 6623853 ))
if K== 171 :
print(( 6741078 ))
if K== 172 :
print(( 6864016 ))
if K== 173 :
print(( 6953457 ))
if K== 174 :
print(( 7094451 ))
if K== 175 :
print(( 7215016 ))
if K== 176 :
print(( 7359936 ))
if K== 177 :
print(( 7475145 ))
if K== 178 :
print(( 7593865 ))
if K== 179 :
print(( 7689630 ))
if K== 180 :
print(( 7886244 ))
if K== 181 :
print(( 7984165 ))
if K== 182 :
print(( 8130747 ))
if K== 183 :
print(( 8253888 ))
if K== 184 :
print(( 8403448 ))
if K== 185 :
print(( 8523897 ))
if K== 186 :
print(( 8684853 ))
if K== 187 :
print(( 8802826 ))
if K== 188 :
print(( 8949612 ))
if K== 189 :
print(( 9105537 ))
if K== 190 :
print(( 9267595 ))
if K== 191 :
print(( 9376656 ))
if K== 192 :
print(( 9574704 ))
if K== 193 :
print(( 9686065 ))
if K== 194 :
print(( 9827097 ))
if K== 195 :
print(( 9997134 ))
if K== 196 :
print(( 10174780 ))
if K== 197 :
print(( 10290813 ))
if K== 198 :
print(( 10493367 ))
if K== 199 :
print(( 10611772 ))
if K== 200 :
print(( 10813692 )) | p02713 |
import math
K = int(eval(input()))
ans = 0
for i in range(K):
for j in range(K):
for k in range(K):
ans += math.gcd(math.gcd(i+1,j+1),k+1)
print (ans) | import math
K = int(eval(input()))
ans = 0
for i in range(K):
for j in range(K):
gcd = math.gcd(i+1,j+1)
for k in range(K):
ans += math.gcd(gcd,k+1)
print (ans) | 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 k in range(1,K+1):
ans += gcd(gcd(i,j),k)
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):
gcd_ij = gcd(i, j)
for k in range(1,K+1):
ans += gcd(gcd_ij, k)
print (ans) | p02713 |
import math
import fractions
K = int(eval(input()))
sum = 0
def gcd2(x,y,z):
return math.gcd(math.gcd(x,y),z)
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
sum += gcd2(i,j,k)
print(sum)
| import math
import fractions
K = int(eval(input()))
sum = 0
def gcd2(x,y,z):
return math.gcd(math.gcd(x,y),z)
for i in range(1,K+1):
for j in range(i,K+1):
for k in range(j,K+1):
if (i == j == k):
sum += gcd2(i,j,k)
elif i != j and j != k:
sum += gcd2(i,j,k)*6
else:
sum += gcd2(i,j,k)*3
print(sum)
| p02713 |
import math
ans = 0
k = int(eval(input()))
for i in range(1,k+1):
for j in range(1,k+1):
for k in range(1,k+1):
gcd = math.gcd(k,math.gcd(i,j))
ans += gcd
print(ans) | from math import gcd
ans = 0
k = int(eval(input()))
for i in range(1,k+1):
for j in range(1,k+1):
for k in range(1,k+1):
ans += gcd(k,gcd(i,j))
print(ans) | p02713 |
from functools import reduce
import math
import itertools
def gcd(numbers):
return reduce(lambda x,y: math.gcd(x,y),numbers)
def comb(K):
return itertools.combinations_with_replacement(list(range(1,K+1)),3)
def main():
k = int(eval(input()))
if k == 1:
print((1))
return
elif k == 2:
print((9))
return
final = 0
comb_list = list(comb(k))
for i in comb_list:
if len(set(i)) == 1:
final += 1*gcd(i)
elif len(set(i)) == 2:
final += 3*gcd(i)
else:
final += math.factorial(3)*gcd(i)
#print(comb_list)
print(final)
main()
| import math
def main():
k = int(eval(input()))
r = list(range(1,k+1))
#because gcd can only appear in this range
count = [0]*201
for i in r:
for j in r:
count[math.gcd(i,j)] += 1
final = 0
for i in range(1,201):
if count[i] > 0:
for j in r:
final += count[i]*math.gcd(i,j)
print(final)
main()
| p02713 |
import math
from functools import reduce
K = int(eval(input()))
memo = {}
def gcd(a, b):
key = frozenset((a,b))
if key in memo:
return memo[key]
memo[key] = math.gcd(a, b)
return memo[key]
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(gcd, [i, j, k])
print(ans) | import math
from collections import Counter
K = int(eval(input()))
memo = {frozenset((i, j)): math.gcd(i, j)
for i in range(1, K+1) for j in range(i, K+1)}
counter = Counter([memo[frozenset((i, j))]
for i in range(1, K+1) for j in range(1, K+1)])
total = 0
for i in range(1, K+1):
for value, count in list(counter.items()):
total += memo[frozenset((i, value))] * count
print(total) | p02713 |
# C
k = int(eval(input()))
def gcd(x, y):
while(y):
x, y = y, x % y
return x
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) | from math import gcd
k = int(eval(input()))
sum_c = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
sum_c += gcd(gcd(a, b), c)
print(sum_c) | p02713 |
from math import gcd
k = int(eval(input()))
sum_c = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
sum_c += gcd(gcd(a, b), c)
print(sum_c) | import math
A = int(eval(input()))
def gcd(A):
total = 0
for i in range(1,A+1):
for j in range(1,A+1):
B = math.gcd(i,j)
for k in range(1,A+1):
total += math.gcd(B,k)
return total
print((gcd(A))) | p02713 |
from collections import defaultdict, Counter
from heapq import heapify, heappop, heappush
from sys import stdin
d = dict()
def gcd(a, b):
if (a, b) in d:
return d[(a, b)]
if b == 0:
return a
else:
res = gcd(b, a % b)
d[(a, b)] = res
return res
return
def gcd_3(a, b, c):
return gcd(gcd(a, b), c)
def main():
res = 0
n = int(eval(input()))
for a in range(1, n+1):
for b in range(1, n+1):
for c in range(1, n+1):
res += gcd_3(a, b, c)
print(res)
def input(): return stdin.readline().rstrip()
main()
| from collections import defaultdict, Counter
from heapq import heapify, heappop, heappush
from sys import stdin
d = dict()
def gcd(a, b):
if (a, b) in d:
return d[(a, b)]
if b == 0:
return a
else:
res = gcd(b, a % b)
d[(a, b)] = res
return res
return
def gcd_3(a, b, c):
return gcd(gcd(a, b), c)
def main():
res = 0
n = int(eval(input()))
for a in range(1, n+1):
for b in range(1, n+1):
m = gcd(a, b)
if m == 1:
res += 1*n
else:
for c in range(1, n+1):
res += gcd(m, c)
print(res)
def input(): return stdin.readline().rstrip()
main()
| p02713 |
from math import gcd
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):
d = gcd(a,b)
total += gcd(d,c)
print(total) | from math import gcd
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):
total += gcd(gcd(a,b),c)
print(total) | p02713 |
import math
k = int(eval(input()))
res = 0
for i in range(1, k+1):
for j in range(1, k+1):
for m in range(1, k+1):
res += math.gcd(math.gcd(i, j), m)
print(res) | from math import gcd
k = int(eval(input()))
res = 0
for i in range(1, k+1):
for j in range(1, k+1):
for m in range(1, k+1):
res += gcd(gcd(i, j), m)
print(res) | p02713 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.