input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import math
k = int(eval(input()))
A = 0
def gcd(a,b,c):
d = math.gcd(a,b)
e = math.gcd(d,c)
return e
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
y = gcd(a,b,c)
A += y
print(A)
| import math
k = int(eval(input()))
A = 0
for a in range(1,k+1):
for b in range(1,k+1):
p = math.gcd(a,b)
for c in range(1,k+1):
y = math.gcd(p,c)
A += y
print(A)
| p02713 |
K = int(eval(input()))
N = 3
def common_divisor(num1,num2):
max_n = max(num1,num2)
min_n = min(num1,num2)
temp = max_n%min_n
while True:
if temp:
max_n = min_n
min_n = temp
temp = max_n%min_n
else:
return min_n
sum = 0
for i... | import math
K = int(eval(input()))
sum = 0
for i in range(1,K+1):
for j in range(1,K+1):
temp = math.gcd(i,j)
for m in range(1,K+1):
sum = sum+math.gcd(m,temp)
print(sum) | p02713 |
def gcd(a,b):
if not b:
return a
else:
return gcd(b, a%b)
n = int(eval(input()))
ans = 0
for i in range(1,n+1):
for j in range(1, n + 1):
tmp = gcd(i,j)
for k in range(1, n + 1):
ans += gcd(tmp,k)
print(ans) | def gcd(a,b):
if not b:
return a
else:
return gcd(b, a%b)
n = int(eval(input()))
ans = 0
for i in range(1,n-1):
for j in range(i+1, n):
tmp = gcd(i,j)
for k in range(j+1, n + 1):
ans += gcd(tmp,k) * 6
for i in range(1,n):
for j in range(i+... | p02713 |
import math
k = int(eval(input()))
a = list(range(1,k+1))
ans = 0
for x in a:
for y in a:
for z in a:
ans += math.gcd(math.gcd(x,y),z)
print(ans) | import math
k = int(eval(input()))
ans = 0
for x in range(1,k+1):
for y in range(1,k+1):
hoge = math.gcd(x,y)
for z in range(1,k+1):
ans += math.gcd(hoge,z)
print(ans) | p02713 |
import sys
input = sys.stdin.readline
import itertools
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def main():
k = int(eval(input()))
num_li = list(range(1, k+1))
ans = 0
old_dict = {}
for l in itertools.product(num_l... | import sys
input = sys.stdin.readline
import math
def main():
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(ans)
if __name__ == '__main__':
ma... | 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)
| import sys
input = sys.stdin.readline
import math
def main():
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)
if __name__ == '__main__':
ma... | 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()))
ans = 0
for a in range(1 , K+1):
for b in range(1 ,K+1):
for c in range(1 , K+1):
ans = ans + g... | 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()))
ans = 0
"""
for a in range(1 , K+1):
for b in range(1 ,K+1):
for c in range(1 , K+1):
ans ... | p02713 |
import math
K=int(eval(input()))
N=0
for a in range(K):
for b in range(K):
for c in range(K):
N+=math.gcd(math.gcd((c+1),(b+1)),(a+1))
print(N) | import math
K=int(eval(input()))
N=0
k=K*K
d1=[0]*int(k)
i=0
j=0
for b in range(K):
for c in range(K):
d1[i]=math.gcd((c+1),(b+1))
i+=1
for a in range(K):
for x in d1:
N+=math.gcd(x,(a+1))
print(N) | p02713 |
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) | from math import gcd
k=int(eval(input()))
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
x=gcd(i,j)
for l in range(1,k+1):
ans+=gcd(x,l)
print(ans) | p02713 |
def main():
K = int(eval(input()))
su = 0
# for a in range(1, K+1):
# for b in range(1, a+1):
# for c in range(1, b+1):
# tmp = dgcd(a, b, c)
# if a == b and b == c:
# pass
# elif a == b or b == c or a == c:
... | def main():
K = int(eval(input()))
su = 0
for a in range(1, K+1):
for b in range(1, a+1):
for c in range(1, b+1):
tmp = dgcd(a, b, c)
if a == b and b == c:
tmp *= 1
elif a == b or b == c or a == c:
... | p02713 |
K = int(eval(input()))
sum = 0
class gcd:
def __init__(self,a,b,c):
self.a=a
self.b=b
self.c=c
def gcds(self):
if self.a>self.b:
x=self.a
y=self.b
else:
x=self.b
y=self.a
while x... | K = int(eval(input()))
sum = 0
class gcd:
def __init__(self,a,b,c):
self.a=a
self.b=b
self.c=c
def gcds(self):
if self.a>self.b:
x=self.a
y=self.b
else:
x=self.b
y=self.a
while x... | p02713 |
N = int(eval(input()))
sum=0
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
from itertools import product
pools = product(list(range(N)),list(range(N)),list(range(N)))
for i, j ,k in pools:
sum =sum + gcd(i+1, j+1, k+1)
print(sum) | N = int(eval(input()))
sum=0
import math
for i in range(N):
for j in range(N):
t=math.gcd(i+1,j+1)
for k in range(N):
sum =sum + math.gcd(t, k+1)
print(sum) | p02713 |
import math
from functools import reduce
K = int(eval(input()))
summ = 0
# 組み合わせの数
# a, b, cが同じは1pattern
# a, b, cのうち、２つが同じパターンは３
# a, b, cのうち、全て異なるパターンは6
# つまり、３つの数の組み合わせの数を求め、各パターン倍すればよい
# タプルで集合を作成する
# st = set()
# # # for a in range(1, K+1):
# # # for b in range(1, K+1):
# # # for c i... | import math
k = int(eval(input()))
ans = 0
for i in range(1, k+1):
for j in range(1, k+1):
num = math.gcd(i, j)
for l in range(1, k+1):
ans += math.gcd(num, l)
print(ans) | p02713 |
import math
import itertools
k = int(eval(input()))
t = list([list(x) for x in itertools.product([i+1 for i in range(k)],repeat=3)])
ans = 0
for i in range(len(t)):
ans += math.gcd(math.gcd(t[i][0],t[i][1]),t[i][2])
print(ans) | import math
import itertools
k = int(eval(input()))
t = list([list(x) for x in itertools.product([i+1 for i in range(k)],repeat=2)])
ans = 0
for i in range(len(t)):
cu = math.gcd(t[i][0],t[i][1])
for j in range(1,k+1):
ans += math.gcd(j,cu)
print(ans) | p02713 |
import math
K = int(eval(input()))
rst = 0
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(tmp, k)
print(rst)
| import math
K = int(eval(input()))
sum = 0
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):
sum += math.gcd(tmp, k)
print(sum)
| p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd,numbers)
K=int(eval(input()))
a=list(range(1,K+1))
b=list(range(1,K+1))
c=list(range(1,K+1))
ans=0
for j in a:
for k in b:
for l in c:
ans+=gcd(j,k,l)
print(ans) | import math
K=int(eval(input()))
ans=0
for j in range(1,K+1):
for k in range(1,K+1):
a=math.gcd(j,k)
for l in range(1,K+1):
ans+=math.gcd(a,l)
print(ans) | 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)
| from math import gcd
K = int(eval(input()))
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)
| p02713 |
import math
from functools import reduce
import itertools
K = int(eval(input()))
data = list(range(1, K + 1))
p_list = list(itertools.product(data, repeat=3))
# print(p_list)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
sum = 0
for p in p_list:
sum += gcd_list(p)
print(sum) | import math
from functools import reduce
K = int(eval(input()))
def gcd(*numbers):
return reduce(math.gcd, numbers)
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) | p02713 |
import math
from functools import reduce
def gcd_list(numbers):
return reduce(math.gcd,numbers)
count=0
n=int(eval(input()))+1
for i in range(1,n):
for j in range(1,n):
for k in range(1,n):
val=gcd_list([i,j,k])
count+=val
print(count) | import math
n=int(eval(input()))+1
ans=0
for i in range(1,n):
for j in range(i,n):
for k in range(j,n):
if i==j and i==k:
buff=1
elif i==j:
buff=3
elif j==k:
buff=3
else:
buff=6
g1=math.gcd(i,j)
g=math.gcd(k,g1)
ans+=g*bu... | p02713 |
import math
k = int(eval(input()))
s = 0
a = []
b = []
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
p = [i,j,l]
p.sort()
if (p in a):
s += b[a.index(p)]
else:
a.append(p)
t =... | import math
k = int(eval(input()))
s = 0
b = []
for i in range(1,k+1):
for j in range(i,k+1):
for l in range(j,k+1):
p = len(set([i,j,l]))
if p ==1:
t = math.gcd(i,j)
q = math.gcd(t,l)
s += q
b.append(q)
... | p02713 |
import math
import itertools
def gcd(x,y,z):
xy = math.gcd(x,y)
xyz = math.gcd(xy,z)
return xyz
k1 = int(eval(input()))
k = list(range(1,k1+1))*3
l = []
for i in itertools.combinations(k,3):
l.append(i)
l = list(set(l))
num = 0
for h in l:
t = gcd(h[0],h[1],h[2])
num += t
print(n... | import math
import itertools
def gcd(x,y,z):
xy = math.gcd(x,y)
xyz = math.gcd(xy,z)
return xyz
k1 = int(eval(input()))
k = list(range(1,k1+1))
l = []
for i in itertools.combinations_with_replacement(k,3):
l.append(i)
num = 0
for h in l:
t = gcd(h[0],h[1],h[2])
if h[0] == h[1] == h... | p02713 |
import math
from functools import reduce
from itertools import combinations
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
n = int(eval(input()))
total = 0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1... | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
n = int(eval(input()))
total = 0
for i in range(1,n+1):
for j in range(i,n+1):
for k in range(j,n+1):
t = 1
i... | 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
K = int(eval(input()))
def computeGCD(x, y):
while (y):
x, y = y, x % y
return x
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(a, math.gcd(b, c))
print(sum) | import math
K = int(eval(input()))
def computeGCD(x, y):
while (y):
x, y = y, x % y
return x
sum = 0
for a in range(1, K+1):
for b in range(1, K+1):
intermediate = computeGCD(a, b)
for c in range(1, K+1):
sum += computeGCD(c, intermediate)
print(sum) | p02713 |
memo = [[[-1] * 201 for j in range(201)] for i in range(201)]
def gcd(numbers):
numbers.sort()
a = numbers[1]
b = numbers[0]
ans = b
while True:
q, mod = divmod(a, b)
if mod == 0:
break
a = b
b = mod
ans = mod
return ans
K = i... | def gcd(numbers):
numbers.sort()
a = numbers[1]
b = numbers[0]
ans = b
while True:
q, mod = divmod(a, b)
if mod == 0:
break
a = b
b = mod
ans = mod
return ans
K = int(eval(input()))
numbers = []
for i in range(K, 0, -1):
... | p02713 |
import math
n = int(eval(input()))
sum = 0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
sum += math.gcd(math.gcd(i,j),k)
print(sum) | import math
n = int(eval(input()))
sum = 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):
sum += math.gcd(a,k)
print(sum) | p02713 |
import math
# from itertools import product
from functools import reduce
def main():
def gcd(*numbers): return reduce(math.gcd, numbers)
K = int(eval(input()))
ans = 0
# valiation = list(itertools.product(range(1, K+1), repeat=3))
# for v in valiation:
# ans += gcd(v)
for i i... | import math
# from itertools import product
from functools import reduce
def main():
# def gcd(*numbers): return reduce(math.gcd, numbers)
K = int(eval(input()))
ans = 0
# valiation = list(itertools.product(range(1, K+1), repeat=3))
# for v in valiation:
# ans += gcd(v)
for i... | p02713 |
k = int(eval(input()))
from math import gcd
ans=0
for i in range(k):
ans+=i+1
for j in range(i+1, k):
x=gcd(i+1,j+1)
ans+=6*gcd(i+1,j+1)
for l in range(j+1, k):
ans+=6*gcd(x,l+1)
print(ans)
| n=3
k=int(eval(input()))
INF=10**9+7
l=[0]*k
ans=0
for i in range(k-1,-1,-1):
x=i+1
temp=pow(k//x,n,INF)
for j in range(2,k//x+1):
temp=(temp-l[j*x-1])%INF
l[i]=temp
ans=(ans+x*temp)%INF
print(ans)
| p02713 |
def gcd(x,y):
while (y):
x, y = y, x%y
return x
def tgcd(x,y,z):
return gcd(x,gcd(y,z))
a = int(eval(input()))
s = 0
for i in range(1,a+1):
for j in range(1,a+1):
for k in range(1,a+1):
s+=tgcd(i,j,k)
print(s)
| 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 |
import sys
import math
import collections
from collections import deque
from functools import reduce
import heapq
k = int(eval(input()))
#n, k = map(int, sys.stdin.readline().split())
#s = input()
#a = list(map(int, sys.stdin.readline().split()))
def gcd(*numbers):
return reduce(math.gcd, numbers)
d... | import sys
import math
import collections
from collections import deque
from functools import reduce
import heapq
k = int(eval(input()))
#n, k = map(int, sys.stdin.readline().split())
#s = input()
#a = list(map(int, sys.stdin.readline().split()))
def gcd(*numbers):
return reduce(math.gcd, numbers)
d... | p02713 |
from functools import reduce
from math import gcd
K = int(eval(input()))
l = [0 for i in range(K**3)]
ans = 0
for i in range(1,K+1):
num = [0, 0, 0]
num[0] = i
for k in range(1,K+1):
num[1] = k
for m in range(1,K+1):
num[2] = m
ans += reduce(gcd, num... | from math import gcd
K = int(eval(input()))
ans = 0
for i in range(1,K+1):
for k in range(1,K+1):
b = gcd(i, k)
for m in range(1,K+1):
ans += gcd(b, m)
print(ans) | p02713 |
from functools import lru_cache
K = int(eval(input()))
sum = 0
@lru_cache()
def gcd(x,y):
r = x % y
while r> 0:
x = y
y = r
r = x%y
return y
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 functools import lru_cache
@lru_cache()
def gcd(x,y):
r = x%y
if r == 0:
return y
return gcd(y,r)
K = int(eval(input()))
Sum = 0
for i in range(1,K+1):
Sum += i
for j in range(i+1,K+1):
Sum += 6*gcd(i,j)
for k in range(j+1,K+1):
Sum += 6*gcd... | p02713 |
import math
def permutations_count(n, r):
return math.factorial(n) // math.factorial(n - r)
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, (a % b))
K = int(eval(input()))
data = [k+1 for k in range(K)]
result = []
for i, d_i in enumerate(data):
for j, d_j ... | import itertools
import math
def permutations_count(n, r):
return math.factorial(n) // math.factorial(n - r)
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, (a % b))
K = int(eval(input()))
data = [k+1 for k in range(K)]
result = list(itertools.combinations_with_... | p02713 |
import math
K = int(eval(input()))
ans = 0
for i in range(K):
for j in range(K):
for k in range(K):
gcd_0 = math.gcd(i+1,j+1)
ans += math.gcd(gcd_0,k+1)
print(ans) | import math
K = int(eval(input()))
ans = 0
for i in range(K):
for j in range(K):
gcd_0 = math.gcd(i+1,j+1)
if gcd_0 == 1:
ans += gcd_0 * K
else:
for k in range(K):
ans += math.gcd(gcd_0,k+1)
print(ans) | p02713 |
import itertools
import math
K = int(eval(input()))
nums = [i for i in range(1, K+1)]
product = itertools.product(nums, repeat=3)
ans = 0
for comb in product:
m = min(comb)
for i in range(3):
m = math.gcd(m, comb[i])
ans += m
print(ans) | import itertools
import math
K = int(eval(input()))
nums = [i for i in range(1, K+1)]
product = itertools.product(nums, repeat=3)
ans = 0
for comb in product:
m = min(comb)
if m == 1:
ans += m
else:
for i in range(0, 3):
m = math.gcd(m, comb[i])
ans += m
p... | p02713 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
import math
i_i = lambda: int(i_s())
i_l = lambda: list(map(int, stdin.readline().split()))
i_s = lambda: stdin.readline().rstrip()
K = i_i()
ans = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
import math
i_i = lambda: int(i_s())
i_l = lambda: list(map(int, stdin.readline().split()))
i_s = lambda: stdin.readline().rstrip()
K = i_i()
res = sum([math.gcd(math.gcd(a, b), c) for a in range(1,K+1) for b in range(1,K+1) for c in range(1,K+1)... | p02713 |
import math
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):
x = math.gcd(a,b)
count += math.gcd(x,c)
print(count) | import math
k = int(eval(input()))
count = 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):
count += math.gcd(x,c)
print(count) | p02713 |
n=int(eval(input()))
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd,numbers)
count=0
a=1
b=1
c=1
for i in range(n):
for j in range(n):
for m in range(n):
count+=gcd(a,b,c)
c+=1
c=1
b+=1
b=1
a+=1
print(c... | n=int(eval(input()))
import math
count=0
a=1
b=1
c=1
for i in range(n):
for j in range(n):
for m in range(n):
k=math.gcd(a,b)
l=math.gcd(k,c)
count+=l
c+=1
c=1
b+=1
b=1
a+=1
print(count) | p02713 |
import math, string, itertools, fractions, heapq, collections, re, array, bisect, copy, functools, random
import sys
from functools import reduce
from collections import deque, defaultdict, Counter; from heapq import heappush, heappop
from itertools import permutations, combinations, product, accumulate, groupby
f... | import math, string, itertools, fractions, heapq, collections, re, array, bisect, copy, functools, random
import sys
from functools import reduce
from collections import deque, defaultdict, Counter; from heapq import heappush, heappop
from itertools import permutations, combinations, product, accumulate, groupby
f... | p02713 |
import math
K=int(eval(input()))
GCD=[[0]*(K+2) for _ in range(K+2)]
def divable(a,b):
if a==b:
return a
if a<b:
a,b=b,a
if a%b>0:
return 1
return math.gcd(a,b)
def make_GCD(K):
for a in range(1,K+1):
for b in range(1,K+1):
GCD[a][b]=math... | K=int(eval(input()))
GCD=[[0]*(K+2) for _ in range(K+2)]
import math
def make_GCD(K):
for a in range(1,K+1):
for b in range(1,K+1):
GCD[a][b]=math.gcd(a,b)
make_GCD(K)
def gcd3(a,b,c):
a=GCD[a][b]
return GCD[a][c]
ans=0
for a in range(1,K+1):
for b in range... | p02713 |
import math
k=int(eval(input()))
cnt=0
for a in range(k):
a=a+1
for b in range(k):
b=b+1
for c in range(k):
c=c+1
cnt=cnt+math.gcd(math.gcd(a,b),c)
print(cnt)
| import math
k=int(eval(input()))
cnt=0
tmp=[]
for a in range(k):
a=a+1
for b in range(k):
b=b+1
tmp.append(math.gcd(a,b))
for i in tmp:
if i==1:
cnt=cnt+k
else:
for j in range(k):
j=j+1
cnt=cnt+math.gcd(i,j)
print(cnt)
| 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()))
dp = [[1 for _ in range(k + 1)] for _ in range(k + 1)]
for i in range(1, k + 1):
for j in range(1, k + 1):
dp[i][j] = math.gcd(i, j)
ans = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
ans += dp[a][dp[b][c... | p02713 |
#coding:utf-8
import math
K=int(eval(input()))
result=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
result+=math.gcd(math.gcd(i,j),k)
print(result) | #coding:utf-8
from math import*
K=int(eval(input()))
result=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
result+=gcd(gcd(i,j),k)
print(result) | p02713 |
import math
k = int(eval(input()))
ans = 0
for a in range(1, k + 1):
for b in range(a, k + 1):
x = math.gcd(a, b)
for c in range(b, k + 1):
y = math.gcd(x, c)
if a == b and b == c:
ans += y
elif a == b or b == c:
ans += y... | import math
ans = 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):
y = math.gcd(x, c)
ans += y
print(ans)
| p02713 |
import math
k=int(eval(input()))
s=0
for a in range(k):
for b in range(k):
for c in range(k):
s+=math.gcd(math.gcd(a+1,b+1),c+1)
print(s) | import math
k=int(eval(input()))
s=0
for a in range(k):
for b in range(k):
x=math.gcd(a+1,b+1)
for c in range(k):
s+=math.gcd(x,c+1)
print(s) | p02713 |
k = int(eval(input()))
import math
from functools import reduce
sum = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
sum += reduce(math.gcd, (a, b, c))
print(sum) | k = int(eval(input()))
import math
total = 0
for a in range(1, k+1):
for b in range(1, k+1):
gcd2 = math.gcd(a, b)
for c in range(1, k+1):
total += math.gcd(gcd2, c)
print(total) | p02713 |
#! /usr/bin/env python
# -*- coding: utf-8 -*-
import math
def main():
num = int(eval(input()))
sum = 0
for i in range(num):
a = i+1
for j in range(num):
b = j+1
for k in range(num):
c = k+1
if a == b:
sum += math.gcd(a,c)
elif b == c or a == c:
sum += math.gcd(... | #! /usr/bin/env python
# -*- coding: utf-8 -*-
import math
def main():
num = int(eval(input()))
sum = 0
for i in range(num):
a = i+1
for j in range(num):
b = j+1
for k in range(num):
c = k+1
sum += math.gcd(math.gcd(a,b),c)
print (sum)
if __name__ == '__main__':
main()
| p02713 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowerc... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowerc... | p02713 |
import math
K = int(eval(input()))
sum = 0
for i in range(K):
for j in range(K):
for k in range(K):
sum += math.gcd(math.gcd(i+1, j+1), k+1)
print(sum) | import math
K = int(eval(input()))
sum = 0
for i in range(K):
for j in range(K):
r = math.gcd(i+1, j+1)
for k in range(K):
sum += math.gcd(r, k+1)
print(sum)
| p02713 |
k = int(eval(input()))
def gcd(a, b, c):
mini = a
if a > b:
mini = b
if b > c:
mini = c
if (a % mini == 0) & (b % mini == 0) & (c % mini == 0):
return mini
for i in range((mini + 1)//2 + 1, 1, -1):
if (a % i == 0) & (b % i == 0) & (c % i == 0):
... | k = int(eval(input()))
def gcd(a, b, c):
mini = a
if a > b:
mini = b
if b > c:
mini = c
if (a % mini == 0) & (b % mini == 0) & (c % mini == 0):
return mini
if mini % 2 == 0:
h = mini / 2
if (a % h == 0) & (b % h == 0) & (c % h == 0):
... | p02713 |
class GCD:
def __init__(self):
self.numlist = dict()
self.numlist2 = dict()
def culc(self, K):
ret = 0
for i in range(1,K-1):
for j in range(i+1, K):
for k in range(j+1,K+1):
ret += self.gcd(i,j,k)*6
for ... | class GCD:
def __init__(self):
self.numlist = dict()
def culc(self, K):
ret = 0
for i in range(1,K):
for j in range(i + 1,K+1):
ret += self.gcd_(i,j) * 6
for i in range(1,K-1):
for j in range(i+1, K):
f... | p02713 |
import math
from functools import reduce
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 += reduce(math.gcd,[i,j,l])
print(ans) | import math
from functools import reduce
k = int(eval(input()))
ans = 0
for i in range(1,k+1):
for j in range(i,k+1):
for l in range(j,k+1):
temp = reduce(math.gcd,[i,j,l])
if len(set([i,j,l])) == 1:
ans += temp
elif len(set([i,j,l])) == 2:
... | p02713 |
#200412C
K = int(eval(input()))
import math
ans = 0
for i in range(K):
for k in range(K):
for l in range (K):
ans += math.gcd(math.gcd(i+1, k+1), l+1)
print((int(ans))) | #200412C
K = int(eval(input()))
import math
ans = 0
for i in range(K):
for k in range(K):
x = math.gcd(i+1,k+1)
if x==1:
ans +=K
else:
for l in range (K):
ans += math.gcd(x, l+1)
print((int(ans))) | p02713 |
k = int(eval(input()))
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
ans = 0
dic = {}
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
tmp = [a,b,c]
... | k = int(eval(input()))
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
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... | p02713 |
import math
k=int(eval(input()))
res=0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
res+=math.gcd(math.gcd(a,b),c)
print(res) | import math
k=int(eval(input()))
res=0
A=[]
for a in range(1,k+1):
for b in range(1,k+1):
A.append(math.gcd(a,b))
for a in A:
for c in range(1,k+1):
res+=math.gcd(a,c)
print(res) | p02713 |
import math
from functools import reduce
import itertools
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
line = int(eval(input()))
a = list(range(1,line + 1))
b = list(range(1,line + 1))
c = list(range(1,line + 1))
result = list... | from math import gcd
line = int(eval(input()))
ans = 0
for a in range(1, line + 1):
for b in range(1, line + 1):
c = gcd(a,b)
for d in range(1, line + 1):
ans += gcd(d,c)
print(ans) | p02713 |
import math
from functools import reduce
k = int(eval(input()))
kl = [i for i in range(1, k+1)]
def gcd(*numbers):
return reduce(math.gcd, numbers)
total = 0
for i in kl:
for j in kl:
for k in kl:
total += gcd(i, j, k)
print(total)
| import math
k = int(eval(input()))
kl = [i for i in range(1, k+1)]
total = 0
dp = {}
for i in kl:
for j in kl:
tmp = math.gcd(i, j)
for k in kl:
total += math.gcd(tmp, k)
print(total)
| p02713 |
import math
K = int(eval(input()))
ans = 0
result = 0
dp = [[[0 for i in range(K+1)] for i in range(K+1)]for i in range(K+1)]
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
if dp[i][j][k] == 0:
x = math.gcd(i,j)
y = math.gcd(j,k)
... | 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):
x = math.gcd(i,j)
y = math.gcd(j,k)
ans += math.gcd(x,y)
print(ans) | p02713 |
K = int(eval(input()))
import math
ans = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
ans = ans + math.gcd(math.gcd(a,b),c)
print(ans) | K = int(eval(input()))
from math import gcd
ans = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
ans = ans + gcd(gcd(a,b),c)
print(ans) | 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):
total+=math.gcd(math.gcd(a,b),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):
tmp=math.gcd(a,b)
for c in range(1,K+1):
total+=math.gcd(tmp,c)
print(total) | 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):
total+=gcd(gcd(a,b),c)
print(total) | import sys
from math import gcd
input = sys.stdin.readline
def main():
K = int(eval(input()))
total = 0
for a in range(1,K+1):
for b in range(1,K+1):
tmp = gcd(a,b)
for c in range(1,K+1):
total+=gcd(tmp,c)
print(total)
if __name__ == '__main__'... | 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()))
sum = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
#print ("gcd({} {} {} )".forma... | import math
K = int(eval(input()))
sum = 0
for i in range(1,K+1):
for j in range(1,K+1):
temp = math.gcd(i,j)
for k in range(1,K+1):
sum+=math.gcd(temp,k)
print (sum) | p02713 |
import math
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):
tmp = 0
tmp = math.gcd(i, j)
count += math.gcd(tmp, k)
print(count) | import math
K = int(eval(input()))
count = 0
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):
count += math.gcd(tmp, k)
print(count) | 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):
ab = math.gcd(a,b)
for c in range(1,K+1):
ans += math.gcd(ab,c)
print(ans)
| p02713 |
import math
n = int(eval(input()) )
n+=1
sum = 0
for i in range (1,n):
for j in range (1,n):
for k in range (1,n):
sum += math.gcd( math.gcd(i,j) ,k )
#print(i,j,k)
print( sum ) | import math
n = int(eval(input()) )
n+=1
sum = 0
for i in range (1,n):
for j in range (1,n):
gcdIJ = math.gcd(i,j)
for k in range (1,n):
sum += math.gcd( gcdIJ ,k )
#print(i,j,k)
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((math.gcd(a, 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):
if math.gcd(a, b) == 1:
ans += k
else:
for c in range(1, k+1):
ans += math.gcd((math.gcd(a, b)), c)
print(ans)
| p02713 |
def main():
K = int(eval(input()))
from math import gcd
ans = 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):
ans += gcd(g, k)
print(ans)
if __name__ == '__main__':
main()
| def main():
from math import gcd
K = int(eval(input()))
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)
if __name__ == '__main__':
main()
| p02713 |
import math
from functools import reduce
K = int(eval(input()))
res = 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):
res += gcd(a,b,c)
print(res) | import math
from collections import defaultdict
d = defaultdict(lambda : defaultdict(int))
K = int(eval(input()))
res = 0
for a in range(1, K+1):
for b in range(1, K+1):
d[a][b] = math.gcd(a,b)
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
... | p02713 |
import math
k = int(eval(input()))
sum = 0
for i in range(1, k + 1):
for j in range(1, k + 1):
sum1 = math.gcd(i , j)
for l in range(1, k + 1):
sum += math.gcd(sum1, l)
print(sum)
| import math
k = int(eval(input()))
sum = 0
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) | p02713 |
import math
N = int(eval(input()))
ans = 0
for a in range(1, N+1):
for b in range(1, N+1):
for c in range(1, N+1):
ans = ans + math.gcd(math.gcd(a, b), c)
print(ans) | import math
import itertools
N = int(eval(input()))
ans1 = sum(range(1, N+1))
ans2 = 0
for x in itertools.combinations(list(range(1, N+1)), 3):
ans2 = ans2 + math.gcd(math.gcd(x[0],x[1]),x[2]);
ans2 = ans2 * 6
ans3 = 0
for x in itertools.combinations(list(range(1, N+1)), 2):
ans3 = ans3 + math... | p02713 |
import sys
import itertools
from functools import reduce
from math import gcd
n = int(sys.stdin.read())
print((sum(reduce(gcd, abc) for abc in itertools.product(list(range(1, n + 1)), repeat=3)))) | import sys
import itertools
from math import gcd
n = int(sys.stdin.read())
print((sum(gcd(gcd(abc[0], abc[1]), abc[2]) for abc in itertools.product(list(range(1, n + 1)), repeat=3))))
| p02713 |
import math
K = int(eval(input()))
count = 0
for i in range(1, K+1):
for j in range(1, K+1):
for q in range(1, K+1):
count += math.gcd(math.gcd(i,j),q)
print(count) | import math
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 += math.gcd(math.gcd(i,j), k)
print(count) | 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) | def gcd(p, q):
while q != 0:
r = p % q
p = q
q = r
return p
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(gcd(a, b), c)
print(sum) | p02713 |
from math import gcd
k = int(eval(input()))
ans = 0
for h in range(1,k+1):
for i in range(1, k+1):
for j in range(1, k+1):
ans += gcd(h, gcd(i, j))
print(ans)
| from sys import setrecursionlimit
setrecursionlimit(1000000)
def Euclid_algorithm(a:int, b:int)->int:
if a < b:
a, b = b, a
else:
pass
if b == 0:
return a
else:
return Euclid_algorithm(b, a % b)
k = int(eval(input()))
ans = 0
for h in range(1, k+1):
... | 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):
g = math.gcd(i,j)
ans += math.gcd(g,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):
g = math.gcd(i,j)
for k in range(1,k+1):
ans += math.gcd(g,k)
print(ans) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
n,ans=int(eval(input())),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) | import math
n,ans=int(eval(input())),0
for i in range(1,n+1):
for j in range(1,n+1):
g=math.gcd(i,j)
for k in range(1,n+1):
ans+=math.gcd(g,k)
print(ans) | p02713 |
import math
K = int(eval(input()))
res = sum([math.gcd(math.gcd(a+1, b+1), c+1) for a in range(K) for b in range(K) for c in range(K)])
print(res) | import math
K = int(eval(input()))
gcds = [math.gcd(a+1, b+1) for a in range(K) for b in range(K)]
res = sum([math.gcd(ab, c+1) for ab in gcds for c in range(K)])
print(res) | 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(math.gcd(i,j), k)
print(sum)
| import math
N = int(eval(input()))
sum = 0
for i in range(1, N+1):
for j in range(1, N+1):
tmp = math.gcd(i,j)
for k in range(1, N+1):
sum += math.gcd(tmp, k)
print(sum) | p02713 |
import math
import itertools
K = int(eval(input()))
lis = [i for i in range(1,K+1)]
a = 0
n = list(itertools.product(lis, repeat=3))
for i in range(len(n)):
ma = math.gcd(math.gcd(n[i][0],n[i][1]),math.gcd(n[i][0],n[i][2]))
a += ma
print(a) | import math
K = int(eval(input()))
lis = tuple([i for i in range(1,K+1)])
a = 0
for i in lis:
for j in lis:
i_j= math.gcd(i,j)
for k in lis:
i_k = math.gcd(i,k)
i_j_k = math.gcd(i_j,i_k)
a += i_j_k
print(a) | p02713 |
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)
| from math import gcd
def main():
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)
if __name__ == "__main__":
main()
| p02713 |
import math
from itertools import product
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
a = eval(input())
a = int(a)
count = 0
l = list(range(1, a + 1))
m = list(range(1, a + 1))
n = list(range(1, a + 1))
for x, y, z in product(l, m, n):
count += ... | import math
a = eval(input())
a = int(a)
count = 0
for l in range(1, a + 1):
for m in range(1, a + 1):
x = math.gcd(l, m)
for n in range(1, a + 1):
count += math.gcd(x,n)
print(count) | 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):
a = gcd(i, j)
for k in range(1, K+1):
ans += gcd(a, k)
print(ans) | p02713 |
import sys
# sys.stdin = open('input.txt')
from math import gcd
def triple_gcd(x, y, z):
return gcd(gcd(x, y), z)
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 += triple_gcd(i, j, k)
print(ans) | import sys
# sys.stdin = open('input.txt')
from math import gcd
k = int(eval(input()))
ans = 0
memory = {}
for i in range(1, k+1):
for j in range(1, k+1):
temp = gcd(i, j)
for k in range(1, k+1):
ans += gcd(temp, k)
print(ans) | 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()))
a = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
a += int(gcd_list([i,j,k]))
... | import math
K = int(eval(input()))
arr = []
a = 0
for i in range(1,K+1):
for j in range(1,K+1):
arr.append(math.gcd(i, j))
for j in range(len(arr)):
for k in range(1,K+1):
a += math.gcd(arr[j],k)
print((int(a))) | p02713 |
import math
k=int(eval(input()))
s=0
for x in range(1,k+1):
for y in range(1,k+1):
for z in range(1,k+1):
s+=math.gcd(x,math.gcd(y,z))
print(s) | import math
k=int(eval(input()))
l=[]
s=0
for x in range(1,k+1):
for y in range(1,k+1):
l.append(math.gcd(x,y))
for x in range(len(l)):
for y in range(1,k+1):
s+=math.gcd(l[x],y)
print(s) | p02713 |
import math
from functools import reduce
K = int(eval(input()))
gcd_sum = 0
target_range = list(range(1, K + 1))
for a in target_range:
for b in target_range:
for c in target_range:
gcd_sum += reduce(math.gcd, (a, b, c))
print(gcd_sum) | import math
from functools import reduce
import itertools
K = int(eval(input()))
gcd_sum = 0
target_range = list(range(1, K + 1))
for comb in itertools.combinations_with_replacement(target_range, 3):
a, b, c = comb[0], comb[1], comb[2]
gcd = reduce(math.gcd, comb)
if a == b == c:
gcd_sum += ... | p02713 |
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [input() for _ in range(n)]
# N = 200 x 200 x 200 = 8000000でO(N)で計算できることから間に合うはず
import math
ans = 0
K = int(ev... | #k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [input() for _ in range(n)]
# N = 200 x 200 x 200 = 8000000でO(N)で計算できることから間に合うはず
import math
ans = 0
K = int(ev... | p02713 |
import math
from functools import reduce
K = int(eval(input()))
sum = 0
def gcd(*numbers):
return reduce(math.gcd, numbers)
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
for i in range(K):
for j in range(K):
tmp = math.gcd(i+1, j+1)
for k in range(K):
sum += math.gcd(tmp, k+1)
print(sum)
| p02713 |
from math import gcd
from functools import reduce
K = int(eval(input()))
res = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
res += reduce(gcd,(a,b,c))
print(res)
| from math import gcd
K = int(eval(input()))
res = 0
for a in range(1,K+1):
for b in range(1,K+1):
tmp = gcd(a,b)
for c in range(1,K+1):
res += gcd(tmp,c)
print(res)
| p02713 |
def gcd(a,b):
while b!=0:
a,b=b,a%b
return a
K = int(eval(input()))
t = 0
t1 = 0
for i in range(1,K+1):
for j in range(1,K+1):
for l in range(1,K+1):
t1 = gcd(i,j)
t = t + gcd(t1,l)
print(t) | n = int(eval(input()))
res = 0
from math import *
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
res+=gcd(gcd(i,j),k)
print(res) | p02713 |
import math
K = int(eval(input()))
t = 0
for i in range(1,K+1):
for j in range(1,K+1):
for l in range(1,K+1):
t += math.gcd(math.gcd(i,j),l)
print(t) | from math import *
K = int(eval(input()))
t = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
t += gcd(gcd(i,j),k)
print(t) | p02713 |
import math
K = int(eval(input()))
t = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
t += math.gcd(math.gcd(i,j),k)
print(t) | from math import gcd
K = int(eval(input()))
t = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
t += gcd(gcd(i,j),k)
print(t) | p02713 |
import math
K=int(eval(input()))
n=K**3
ABC=[0]*3
ans=0
for i in range(n):
for j in range(3):
ABC[j]=i%K+1
i//=K
val=math.gcd(ABC[0],ABC[1])
val=math.gcd(val,ABC[2])
ans+=val
print(ans) | import math
K=int(eval(input()))
ans=0
for i in range(1,K+1):
ans+=i
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):
for j in range(i+1,K):
for k in range(j+1,K+1):
val=math.gcd(i,j)
val=math.gcd(val,k)
... | p02713 |
import math
from functools import reduce
k = int(eval(input()))
sum_ = 0
for i in range(1, k+1):
if i == 1:
sum_ += k ** 2
else:
for j in range(1, k+1):
if j == 1:
sum_ += k
else:
for l in range(1, k+1):
... | import math
k = int(eval(input()))
sum_ = 0
for i in range(1, k+1):
for j in range(1, k+1):
x = math.gcd(i, j)
for l in range(1, k+1):
sum_ += math.gcd(x, l)
print(sum_) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
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) | import math
K=int(eval(input()))
f=[]
for i in range(1,K+1):
for j in range(1,K+1):
s=math.gcd(i, j)
f.append(s)
S=0
for i in range(1,K+1):
for j in f:
S+=math.gcd(i,j)
print(S) | p02713 |
import math
from functools import reduce
def gcd_list(numbers):
return reduce(math.gcd, numbers)
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_list([i, j, k])
print(s)
| import math
k = int(eval(input()))
s = 0
for i in range(1, k + 1):
for j in range(1, k + 1):
s1 = math.gcd(i, j)
for k in range(1, k + 1):
s += math.gcd(k, s1)
print(s)
| p02713 |
import math
from functools import reduce
#A,B,C=(int(x) for x in input().split())
N=int(eval(input()))
#A=list(map(int, input().split()))
l=[(a,b,c) for a in range (1,N+1) for b in range (1, N+1) for c in range (1, N+1)]
def gcd_list(numbers):
return reduce(math.gcd, numbers)
i=0
for k in ... | import math
K=int(eval(input()))
total=0
for i in range(1,K+1):
for j in range(1,K+1):
g=math.gcd(i,j)
for k in range(1,K+1):
a=math.gcd(g,k)
total+=a
print(total) | p02713 |
from math import gcd
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(gcd(i, j), k)
print(sum) | def gcd(a, b):
if a < b:
a, b = b, a
while b:
a, b = b, a % b
return a
k = int(eval(input()))
sum = 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):
sum += gcd(gcd_ij, k)
print(sum) | p02713 |
def gcd(a, b):
if a < b:
a, b = b, a
while b:
a, b = b, a % b
return a
k = int(eval(input()))
sum = 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):
sum += gcd(gcd_ij, k)
print(sum) | from math import gcd
k = int(eval(input()))
sum = 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):
sum += gcd(gcd_ij, k)
print(sum) | 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) | def gcd(a, b):
if a < b:
a, b = b, a
while b:
a, b = b, a % b
return a
from math import gcd
k = int(eval(input()))
sum = 0
for a in range(k):
for b in range(k):
gcd_ab = gcd(a + 1, b + 1)
for c in range(k):
sum += gcd(gcd_ab, c + 1)
print(sum) | p02713 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.