input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from math import gcd
import sys
si = sys.stdin.readline
d = {}
def main():
k = int(si())
ans = 0
for p in range(1, k+1):
for q in range(1, k+1):
for r in range(1, k+1):
if (q, r) in d:
t1 = d[(q, r)]
elif (r, q) in d:
... | from math import gcd
import sys
si = sys.stdin.readline
# def gcd(u, v):
# if v:
# return gcd(v, u % v)
# else:
# return u
def main():
k = int(si())
cnt = 0
for p in range(1, k+1):
for q in range(1, k+1):
for r in range(1, k+1):
... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans=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):
ans+=gcd(a,b,c)
print(ans)
| k = int(eval(input()))
from math import gcd
#gcd_sum = [0] * 201
ans = 0
'''
for i in range(1, k+1):
for j in range(1, k+1):
gcd_sum[i] += gcd(i,j)
#print(gcd(i,j))
#print(gcd_sum[i])
'''
for a in range(1,k+1):
for b in range(1,k+1):
g = gcd(a,b)
... | 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 += math.gcd(math.gcd(a,b),c)
print(ans) | K=int(eval(input()))
import math
ans=0
for a in range(1,K+1):
for b in range(1,K+1):
k=math.gcd(a,b)
for c in range(1,K+1):
ans += math.gcd(k,c)
print(ans) | p02713 |
import math
def gcd(a, b, c):
x = math.gcd(a, b)
return(math.gcd(x, c))
K = int(eval(input()))
sum = 0
for i in range(K):
for j in range(K):
for k in range(K):
sum += gcd(i + 1, j + 1, k + 1)
print(sum)
| import math
def gcd(a, b, c):
x = math.gcd(a, b)
return(math.gcd(x, c))
K = int(eval(input()))
sum = 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 == k:
sum += gcd(i, j, k)
elif i == j or j == k or k == i:... | p02713 |
from itertools import product
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
number = [i for i in range(1, K+1)]
comb = list(product(number, repeat=3))
amount = 0
for a, b, c in comb:
if a <= b <= c:
if a == b and b ==... | from itertools import combinations, product
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
amount = 0
for a in range(1, K+1):
for b in range(a, K+1):
for c in range(b, K+1):
count = gcd(a, b, c)
i... | p02713 |
import math
from functools import reduce
K=int(eval(input()))
gcd=0.
for i in range(K):
for j in range(K):
for k in range(K):
gcd+=reduce(math.gcd,[i+1,j+1,k+1])
print((int(gcd))) | import math
from functools import reduce
from itertools import product
K=int(eval(input()))
gcd=0.
for i in range(K):
for j in range(K):
a=math.gcd(i+1,j+1)
for k in range(K):
gcd+=math.gcd(a,k+1)
print((int(gcd))) | p02713 |
import math
k=int(eval(input()))
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
ans+=math.gcd(math.gcd(i,j),l)
print(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 l in range(1,k+1):
ans+=math.gcd(tmp,l)
print(ans) | p02713 |
import math
k=int(eval(input()))
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
tmp=math.gcd(i,j)
for l in range(1,k+1):
ans+=math.gcd(tmp,l)
print(ans) | def gcd(a, b):
while b:
a, b = b, a % b
return a
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):
tmp=gcd(i,j)
ans+=gcd(tmp,k)
print(ans) | p02713 |
from functools import lru_cache
N = int(eval(input()))
@lru_cache(maxsize=None)
def gcd2(a, b):
while b != 0:
a, b = b, a % b
return a
def gcd(a, b, c):
return gcd2(gcd2(a, b), c)
res = 0
for i in range(1, N + 1):
for j in range(1, N + 1):
for k in range(1, N + 1):
res += gc... | from functools import lru_cache
N = int(eval(input()))
@lru_cache(maxsize=None)
def gcd2(a, b):
while b != 0:
a, b = b, a % b
return a
def gcd(a, b, c):
return gcd2(gcd2(a, b), c)
res = 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... | p02713 |
import math
K = int(eval(input()))
sumval = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
f = math.gcd(a,b)
g = math.gcd(f,c)
sumval += g
print(sumval) | import math
K = int(eval(input()))
sumval = 0
for a in range(1, K+1):
for b in range(1, K+1):
f = math.gcd(a,b)
for c in range(1, K+1):
g = math.gcd(f,c)
sumval += g
print(sumval) | p02713 |
import math
K = int(eval(input()))
sumval = 0
for a in range(1, K+1):
for b in range(1, K+1):
f = math.gcd(a,b)
for c in range(1, K+1):
g = math.gcd(f,c)
sumval += g
print(sumval) | import math
K = int(eval(input()))
sumval = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
f = math.gcd(a,b)
g = math.gcd(f,c)
sumval += g
print(sumval) | p02713 |
import math
from functools import reduce
K = int(eval(input()))
def GCD(x):
return reduce(math.gcd, x)
s = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
for h in range(1,K + 1):
s += GCD((i, j, h))
print(s) | import math
from functools import reduce
from itertools import combinations_with_replacement
K = int(eval(input()))
def GCD(x):
return reduce(math.gcd, x)
s = 0
for x in combinations_with_replacement(list(range(1, K + 1)), 3):
if x[0] == x[1] == x[2]:
s += GCD(x)
elif x[0] == x[1] ... | 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)]
answ=0
for i in range(1,K+1):
for j in range(1,K+1):
ans[i-1][j-1]+=gcd(i,j)
for i in range(1,K+1):
for j in range(1,K+1):
... | import math
k = int(eval(input()))
ans = 0
for i in range(1, k + 1):
for j in range(1, k + 1):
gcd1 = math.gcd(i, j)
for l in range(1, k + 1):
gcd2 = math.gcd(gcd1, l)
ans += gcd2
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
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(a,K+1):
for c in range(b,K+1):
if a == b == c:
sum += gcd(a,b,c)
elif a == b or b =... | 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
N = int(eval(input()))
f=0
for a in range(1, N+1):
for b in range(1, N+1):
for c in range(1, N+1):
d=math.gcd(a, b)
e=math.gcd(d, c)
f+=e
print(f) | import math
N = int(eval(input()))
f = 0
for a in range(1, N+1):
for b in range(1, N+1):
for c in range(1, N+1):
if b<a or c<a or b>c:
continue
elif a==b and b==c:
d=math.gcd(a, b)
e=math.gcd(d, c)
f+=e
... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k=int(eval(input()))
ml=[i for i in range(k+1)]
n=0
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
if i==j==l:
continue
n+=gcd(i,j,l)... | from math import gcd
K=int(eval(input()))
S=0
for a in range(1,K+1):
for b in range(1,K+1):
calc=gcd(a,b)
for c in range(1,K+1):
S+=gcd(calc,c)
print(S)
| p02713 |
import math
from functools import reduce
# reduce(function, iterable, initializer)
def gcd(*number):
return reduce(math.gcd, number)
def gcd_list(number):
return reduce(math.gcd, number)
sum = 0
K = int(eval(input()))
for i in range(1,K+1):
for j in range(1,K+1):
tmp = gcd(i, j)
... | import math
from functools import reduce
# reduce(function, iterable, initializer)
def gcd(*number):
return reduce(math.gcd, number)
def gcd_list(number):
return reduce(math.gcd, number)
def main():
sum = 0
K = int(eval(input()))
for i in range(1,K+1):
for j in range(1,K+1):... | p02713 |
K = int(eval(input()))
cnt = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
for i in range(1,min(a,b,c)+1):
if a%i == b%i == c%i == 0:
tcnt = i
cnt += tcnt
print(cnt) | K = int(eval(input()))
ans = 0
import math
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 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) | 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):
g1 = gcd(i,j)
ans += gcd(g1,k)
print(ans)
| p02713 |
k = int(eval(input()))
import math
from functools import reduce
total = 0
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
total += reduce(math.gcd,(i,j,l))
print(total)
| import collections
def gcd(a,b):
if b==0:
return a
else:
return gcd(b,a%b)
k=int(eval(input()))
cnt=collections.defaultdict(int)
for i in range(1,k+1): #すべての(a,b)の組についてgcd(a,b)を求め、その値の個数を数える
for j in range(1,k+1):
cnt[gcd(i,j)]+=1
ans=0
for i in range(1,k+1): #すべてのcについて、上で求めたgcd(a,b)のあり得る値との... | p02713 |
import sys
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),math.gcd(j,k))
print(ans)
| import sys
import math
N = int(eval(input()))
ans = 0
for i in range (1,N+1):
for j in range (1,i+1):
for k in range (1,j+1):
if i == j == k:
ans += math.gcd(math.gcd(i,j),k)
elif i == j or j== k:
ans += 3*math.gcd(math.gcd(i,j),k)
... | p02713 |
# -*- conding: utf-8 -*-
import itertools
import math
K = int(eval(input()))
def gcd(a, b):
if a > b:
x = a
y = b
else:
x = b
y = a
if y == 0:
return x
else:
return gcd(y, x % y)
ans = 0
for x in list(itertools.product(list(range(1, K+1)), repeat=3)):
# xに対して... | # -*- conding: utf-8 -*-
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 |
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) | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
comb_count = {1:1, 2:3, 3:6}
k = int(eval(input()))
ans = 0
for a in range(1, k+1):
for b in range(a, k+1):
for c in range(b, k+1):
ans += gcd(a, b, c) * comb_count[len(set([a, b, c]))]... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
comb_count = {1:1, 2:3, 3:6}
k = int(eval(input()))
ans = 0
for a in range(1, k+1):
for b in range(a, k+1):
for c in range(b, k+1):
ans += gcd(a, b, c) * comb_count[len(set([a, b, c]))]... | from collections import defaultdict
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a%b)
gcd_cnt = defaultdict(int)
ans = 0
k = int(eval(input()))
for a in range(1, k+1):
for b in range(1, k+1):
gcd_cnt[gcd(a, b)] += 1
for key in gcd_cnt:
for c in range(... | p02713 |
import math
n = int(eval(input()))
c = 0
for i in range(n):
for j in range(n):
for k in range(n):
temp = math.gcd(i+1,j+1)
c += math.gcd(temp,k+1)
print(c) | import math
# from functools import reduce
# from fractions import gcd
def main():
n = int(eval(input()))
# def gcd(*numbers):
# return reduce(math.gcd, numbers)
c = 0
for i in range(n):
for j in range(n):
for k in range(n):
temp = math.gcd(i+1,j+... | p02713 |
from math import gcd
k = int(eval(input()))
d = {}
ans = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
if (a, b, c) in d:
ans += d[(a, b, c)]
else:
d[(a, b, c)] = gcd(a, gcd(b, c))
ans +=... | def GCD(a, b):
return a if b == 0 else GCD(b, a % b)
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
continue
for c in range(1, k + 1):
ans += GCD(ab, c)
print(a... | p02713 |
import math
k = int(eval(input()))
ans = 0
for a in range(1,k+1):
for b in range(1,k+1):
g = math.gcd(a,b)
for c in range(1,k+1):
ans += math.gcd(g,c)
print(ans) | import math
k = int(eval(input()))
map_list = [[0 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):
map_list[i][j]=math.gcd(i,j)
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
gcd1 = map_list[i][j]
for k in range(1,k+1):
... | p02713 |
from math import gcd
from functools import reduce
def gcds(*numbers):
return reduce(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 += gcds(a, b, c)
print(ans) | from math import gcd
from functools import reduce
def gcds(*numbers):
return reduce(gcd, numbers)
K = int(eval(input()))
ans1 = 0
ans2 = 0
ans3 = 0
for a in range(1, K + 1):
for b in range(a, K + 1):
for c in range(b, K + 1):
if a == b and b == c:
ans1 += gcds(a, b, c)
elif a ==... | p02713 |
import math
from functools import reduce
def gcd(*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):
total += gcd(i,j,k)
print(total) | import math
import sys
def main():
n = int(sys.stdin.readline())
total = 0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
total += math.gcd(i, math.gcd(j,k))
print(total)
main() | 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):
s=gcd(i,j)
for k in range(1,K+1):
S += gcd(s,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):
s=math.gcd(i,j)
for k in range(1,K+1):
S += math.gcd(s,k)
print(S) | 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+=math.gcd(math.gcd(a,b),c)
print(ans) | import math
N=int(eval(input()))
g1=[math.gcd(x,y) for x in range(1,N+1) for y in range(1,N+1)]
g2=[math.gcd(x,y) for x in g1 for y in range(1,N+1)]
print((sum(g2))) | p02713 |
N = int(eval(input())) + 1
Answer = 0
def getGCD(a,b,c):
if a == b and b == c:
d = 1
elif a == b or b == c or c == a:
d = 3
else:
d = 6
surplus = a % c
while surplus != 0:
a = int(c)
c = int(surplus)
surplus = a % c
surp... | N = int(eval(input())) + 1
Answer = 0
def getGCD(a,b,c):
if a == b == c:
d = 1
elif a == b or b == c:
d = 3
else:
d = 6
surplus = a % c
while surplus != 0:
a,c = c,surplus
surplus = a % c
surplus = b % c
while surplus != 0:
... | p02713 |
import math
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
c = 0
for i in range(k):
for j in range(k):
for l in range(k):
c += gcd(i + 1, j + 1, l + 1)
print(c) | import math
m = int(eval(input()))
a = (m * (m + 1)) // 2
b = 0
c = 0
for i in range(m):
for j in range(i + 1, m):
b += math.gcd(i + 1, j + 1)
for i in range(m):
for j in range(i + 1, m):
l = math.gcd(i + 1, j + 1)
for k in range(j + 1, m):
c += math.gcd(l, k + ... | p02713 |
from math import gcd
from itertools import product
K = int(eval(input()))
n = list(range(1, K+1))
total = 0
for a,b,c in product(n,repeat=3):
d = gcd(a,b)
e = gcd(d,c)
total += e
print(total) | from math import gcd
from itertools import combinations_with_replacement as cwr
K = int(eval(input()))
n = list(range(1, K+1))
total = 0
for a,b,c in cwr(n,3):
d = gcd(gcd(a,b),c)
if a == b == c:
total += d
elif a != b != c:
total += d*6
else:
total += d*3
prin... | p02713 |
k = int(eval(input()))
# a,bの最大公約数
def gcd(a, b):
while b:
a, b = b, a % b
return a
gcdl = [[0]*k*2 for _ in range(k*2)]
for a in range(1, k+1):
for b in range(1, k+1):
gcdl[a][b] = gcd(a, b)
ansl = [[[-1]*k*2 for _ in range(k*2)] for _ in range(k*2)]
ans = 0
for a in r... | k = int(eval(input()))
# a,bの最大公約数
def gcd(a, b):
while b:
a, b = b, a % b
return a
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
t = gcd(gcd(a, b), c)
ans += t
print(ans)
| p02713 |
import math
# K = int(input())
# ans = 0
# for i in range(1,K+1):
# for j in range(1,K+1):
# for k in range(1,K+1):
# ans+=math.gcd(i,math.gcd(j,k))
# print(ans)
ans = 0
K = int(eval(input()))
dp = [[1] * 220 for i in range(220)]
for i in range(1,K+1):
for j in r... | def gcd(n, m):
# 最大公約数
a = max(n,m)
b = min(n,m)
while b:
a, b = b, a % b
return a
ans = 0
K = int(eval(input()))
dp = [[1] * 220 for i in range(220)]
for i in range(1,K+1):
for j in range(1,K+1):
dp[i][j] = gcd(i,j)
for i in range(1,K+1):
for j in range(i,K+1)... | p02713 |
import math
k=int(eval(input()))
total=0
info=[0]
for i in range(1,201):
for j in range(1,201):
if j<i:
info.append(0)
continue
info.append(math.gcd(i,j))
#print(str(i)+" "+str(j)+" "+str(math.gcd(i,j)))
#print(info[202])
#print(info)
for i in range(1,k+1... | from math import gcd
k=int(eval(input()))
total=0
for i in range(1,k+1):
for j in range(1,k+1):
for m in range(1,k+1):
g=gcd(i,j)
g=gcd(g,m)
total+=g
print(total) | p02713 |
from math import gcd
k=int(eval(input()))
total=0
for i in range(1,k+1):
for j in range(1,k+1):
for m in range(1,k+1):
g=gcd(i,j)
g=gcd(g,m)
total+=g
print(total) | import math
k=int(eval(input()))
total=0
for i in range(1,k+1):
for j in range(1,k+1):
for m in range(1,k+1):
g=math.gcd(i,j)
g=math.gcd(g,m)
total+=g
print(total) | p02713 |
n = int(eval(input()))
def gcd(a,b):
while b:
a, b = b, a % b
return a
ans = 0
if n == 1:
ans = 1
else:
for i in range(n):
i = i + 1
#ans = ans + i #(i,i,i)
for j in range(n):
j = j + 1
for k in range(n):
k = k + ... | n = int(eval(input()))
def gcd(a,b):
while b:
a, b = b, a % b
return a
ans = 0
if n == 1:
ans = 1
else:
for i in range(n):
i = i + 1
for j in range(n):
j = j + 1
for k in range(n):
k = k + 1
ij = gcd(i,j)
... | p02713 |
import math
k = int(eval(input()))
wa = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
wa += math.gcd(math.gcd(a,b),c)
print(wa) | from math import gcd
k = int(eval(input()))
wa = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
wa += gcd(gcd(a,b),c)
print(wa)
| p02713 |
from math import gcd
from functools import reduce
def gcd_kai(*numbers):
return reduce(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_kai(i + 1, j + 1, k + 1)
print(ans)
| from math import gcd
from functools import reduce
def gcd_kai(*numbers):
return reduce(gcd, numbers)
K = int(eval(input()))
ans = 1
if K == 1:
next
else:
ans += (K - 1) * K * 3
ans_sub = 0
for i in range(2, K):
for j in range(i + 1, K + 1):
for k in range(i, ... | p02713 |
import math
N = int(eval(input()))
#sum_ = 1+N
sum_ = 0
for i in range(1, 1+N):
for j in range(1, 1+N):
for k in range(1, 1+N):
a = math.gcd(i, j)
sum_ += math.gcd(a, k)
print(sum_) | import math
N = int(eval(input()))
#sum_ = 1+N
sum_ = 0
for i in range(1, 1+N):
for j in range(1, 1+N):
a = math.gcd(i, j)
for k in range(1, 1+N):
sum_ += math.gcd(a, k)
print(sum_) | p02713 |
import math
from functools import reduce
import itertools
k=int(eval(input()))
def gcd(*numbers):
return reduce(math.gcd,numbers)
ans=0
for i,j,m in itertools.product(list(range(1,k+1)),list(range(1,k+1)),list(range(1,k+1))):
ans+=gcd(i,j,m)
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(1,k+1):
for m in range(1,k+1):
ans+=gcd(i,j,m)
print(ans) | p02713 |
import math
k = int(eval(input()))
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
ans += math.gcd(math.gcd(a, b), c)
print(ans) | import math
k = int(eval(input()))
dec = {}
for a in range(1, k+1):
for b in range(1, k+1):
if math.gcd(a, b) not in dec:
dec[math.gcd(a,b)] = 1
else:
dec[math.gcd(a,b)] += 1
ans = 0
for c in range(1, k+1):
for d in list(dec.keys()):
ans += math.gcd(... | p02713 |
import sys
input = sys.stdin.readline
from itertools import *
from functools import *
from collections import *
from heapq import heapify, heappop, heappush, heappushpop
from math import gcd
INF = float('inf')
NIL = - 1
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
for j in range(1,... | import sys
input = sys.stdin.readline
from itertools import *
from functools import *
from collections import *
from heapq import heapify, heappop, heappush, heappushpop
from math import gcd
INF = float('inf')
NIL = - 1
N = int(eval(input()))
ans = 0
for i in range(1, N + 1):
if i == 1:
a... | p02713 |
K=int(eval(input()))
Ans=0
import math
for i in range(K):
for j in range(K):
for k in range(K):
temp=math.gcd(i+1,j+1)
Ans+=math.gcd(temp,k+1)
print(Ans)
| K=int(eval(input()))+1
Ans=0
from math import gcd
for i in range(1,K):
for j in range(1,K):
tempA=gcd(i,j)
for k in range(1,K):
Ans+=gcd(tempA,k)
print(Ans)
| p02713 |
K=int(eval(input()))+1
Ans=0
from math import gcd
for i in range(1,K):
for j in range(1,K):
tempA=gcd(i,j)
for k in range(K-1):
Ans+=gcd(tempA,k+1)
print(Ans)
| K=int(eval(input()))+1
Ans=0
from math import gcd
for i in range(K-1):
for j in range(K-1):
tempA=gcd(i+1,j+1)
for k in range(1,K):
Ans+=gcd(tempA,k)
print(Ans)
| p02713 |
import math
k=int(eval(input()))
ans=0
for i in range(k):
for j in range(k):
for l in range(k):
ans+=math.gcd(math.gcd(i+1,j+1),l+1)
print(ans) | import math
k=int(eval(input()))
ans=0
for i in range(k):
for j in range(k):
q=math.gcd(i+1,j+1)
for l in range(k):
ans+=math.gcd(q,l+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 l in range(1,k+1):
ans+=(gcd(i,gcd(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):
for l in range(1,k+1):
ans+=(math.gcd(i,math.gcd(j,l)))
print(ans) | p02713 |
import math
k = int(eval(input()))
s = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
s += math.gcd(a, math.gcd(b, c))
print(s) | import math
k = int(eval(input()))
s = 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):
s += math.gcd(ab, c)
print(s)
| p02713 |
import math
K = int(eval(input()))
total = 0
for s in range(1,K+1):
for t in range(1,K+1):
for u in range(1,K+1):
# print(s,t,u,math.gcd(math.gcd(s,t),u))
total +=math.gcd(math.gcd(s,t),u)
2
print(total)
| import math
K = int(eval(input()))
total = 0
for s in range(1,K+1):
for t in range(1,K+1):
alpha = math.gcd(s,t)
if alpha == 1:
total += K
continue
for u in range(1,K+1):
# print(s,t,u,math.gcd(alpha,u))
total +=math.gcd(alpha... | p02713 |
K = int(eval(input()))
import math
from functools import reduce
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) | K = int(eval(input()))
from math import gcd
sum = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
sum += gcd(gcd(b,c), a)
print(sum) | p02713 |
from math import gcd
from functools import lru_cache
from itertools import combinations
a = int(eval(input()))
def main():
for i in range(1, a+1):
for j in range(i, a+1):
for k in range(j, a+1):
x = len({i, j, k})
if x == 1:
x = 1... | from math import gcd
a = int(eval(input()))
def main():
for i in range(1, a+1):
for j in range(i, a+1):
ab = gcd(i, j)
for k in range(j, a+1):
x = len({i, j, k})
if x == 1:
x = 1
elif x == 2:
... | p02713 |
import math
from functools import reduce
def gcd_list(numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
Sum = []
for a in range(1, K+1):
for b in range(1, K + 1):
for c in range(1, K + 1):
gcd = gcd_list([a, b, c])
Sum.append(gcd)
print((sum(Sum... | import math
K = int(eval(input()))
Sum = []
for a in range(1, K+1):
for b in range(1, K + 1):
gcd2 = math.gcd(a, b)
for c in range(1, K + 1):
gcd = math.gcd(gcd2, c)
Sum.append(gcd)
print((sum(Sum))) | p02713 |
from math import gcd
k = int(eval(input()))
s = 0
for x in range(1, k + 1):
for y in range(1, k + 1):
t = gcd(x, y)
for z in range(1, k + 1):
s += gcd(t, z)
print(s) | from math import gcd
k = int(eval(input()))
s = 0
for x in range(1, k + 1):
for y in range(1, k + 1):
t = gcd(x, y)
if t == 1:
s += k
continue
for z in range(1, k + 1):
s += gcd(t, z)
print(s) | p02713 |
import math
import sys
def getN():
return int(eval(input()))
def gcd(p, q):
if p % q == 0: return q
return gcd(q, p % q)
def main():
K = getN()
result = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
result +=... | def getN():
return int(eval(input()))
# def gcd(p, q):
# if p % q == 0: return q
# return gcd(q, p % q)
def gcd(p, q):
while q != 0:
r = p % q
p = q
q = r
return p
def main():
K = getN()
result = 0
for i in range(1,K+1):
for ... | p02713 |
import sys, os, math
def get_cd(n):
cd = []
for i in range(1, int(n/2)+1):
if n % i == 0:
cd.append(i)
else:
continue
cd.append(n)
return cd
def get_gcd(a, b, c, cd_d):
if 1 in [a, b, c]:
return 1
else:
min_v = min([a,b,c]... | import sys, os, math
def get_cd(n):
cd = []
for i in range(1, int(n/2)+1):
if n % i == 0:
cd.append(i)
else:
continue
cd.append(n)
return cd
def get_gcd(a, b, c, cd_d):
if 1 in [a, b, c]:
return 1
else:
cd = sorted(list(se... | 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):
for b in range(k):
for c in range(k):
# print(a+1, b+1, c+1)
sum += gcd(a+1, b+1, c+1)
print(sum) | import math
k = int(eval(input()))
sum = 0
for a in range(k):
for b in range(k):
aandb = math.gcd(a+1, b+1)
for c in range(k):
sum += math.gcd(aandb, c+1)
print(sum) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
answer = 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):
answer += gcd(a,b,c... | from math import gcd
K = int(eval(input()))
ans=0
array = [0] * 201
for X in range(1,K+1):
for c in range(1,K+1):
array[X] += gcd(X,c)
for a in range(1,K+1):
for b in range(1,K+1):
X = gcd(a,b)
ans += array[X]
print(ans) | p02713 |
k = int(eval(input()))
ans = 0
import math
import itertools
from functools import reduce
def gcd(num):
return reduce(math.gcd, num)
numlist = list(range(1, k+1))
l = list(itertools.product(numlist, repeat=3))
ans = sum(map(gcd, l))
print(ans) | k = int(eval(input()))
ans = 0
import math
from functools import reduce
def gcd(*num):
return reduce(math.gcd, num)
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
z = list(range(1, 1+int(eval(input()))))
y = 0
for a in z:
for b in z:
for c in z:
y += math.gcd(math.gcd(a,b),c)
print(y) | from math import gcd
z = list(range(1, 1+int(eval(input()))))
y = 0
for a in z:
for b in z:
for c in z:
y += gcd(gcd(a,b),c)
print(y) | p02713 |
from math import gcd
from functools import reduce
def gcd2(*numbers):
return reduce(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 += gcd2(a,b,c)
print(ans) | from math import gcd
k = int(eval(input()))
ans = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
ans += gcd(gcd(a,b),c)
print(ans) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
r = reduce(math.gcd, numbers)
return r
def main():
K = int(eval(input()))
l = []
for i in range(1, K+1, 1):
for j in range(1, K+1, 1):
for k in range(1, K+1, 1):
g = gcd(i, j, k)
... | from math import gcd
k=int(eval(input()))
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1, k+1):
ans+=gcd(gcd(i,j),l)
print(ans) | p02713 |
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | p02713 |
import math
k = int(eval(input()))
sum = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
sum += math.gcd(math.gcd(a, b), c)
print(sum) | from math import gcd
k = int(eval(input()))
sum = 0
for a in range(1,k+1):
for b in range(1,k+1):
x = gcd(a,b)
for c in range(1,k+1):
sum += gcd(x, c)
print(sum) | 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):
for c in range(1,k+1):
sum += gcd(gcd(a, b), c)
print(sum) | import math
k = int(eval(input()))
sum = 0
for a in range(1,k+1):
for b in range(1,k+1):
x = math.gcd(a, b)
for c in range(1,k+1):
sum += math.gcd(x, c)
print(sum) | p02713 |
K=int(eval(input()))
import math
t=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
a=math.gcd(i,j)
b=math.gcd(a,k)
t+=b
print(t) | K=int(eval(input()))
import math
if K==1:
print((1))
exit()
elif K==2:
print((9))
exit()
else:
t=0
for i in range(1,K-1):
for j in range(i+1,K):
for k in range(j+1,K+1):
a=math.gcd(i,j)
b=math.gcd(a,k)
t+=b
tw=0
for i in range(1,K):
for j in rang... | p02713 |
k = int(eval(input()))
import math
import itertools
num_list = list(list(itertools.product(list(range(1,k+1)), repeat=3)))
sum_ = 0
for i,j,k in num_list:
sum_ += math.gcd(i, math.gcd(j, k))
print(sum_) | k = int(eval(input()))
from math import gcd
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, gcd(j, k))
print(sum_) | p02713 |
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()))
sum=0
for a in range(1, n+1):
for b in range(1, n+1):
for c in range(1, n+1):
sum=sum+gcd_list([a... | 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()))
sum=0
for a in range(1, n+1):
for b in range(1, n+1):
ab=math.gcd(a,b)
for c in range(1, n+1):
... | p02713 |
from math import gcd
import itertools
def calc(a,b,c):
x=gcd(a,b)
y=gcd(x,c)
return y
n=int(eval(input()))
A=list(itertools.product(list(range(1,n+1)), repeat=3))
D={}
for i in A:
mat=tuple(sorted(i))
if mat in D:
D[mat]+=1
else:
D[mat]=1
ans=0
for a,b,c... | from math import gcd
import itertools
def calc(a,b,c):
x=gcd(a,b)
y=gcd(x,c)
return y
n=int(eval(input()))
A=list(itertools.combinations_with_replacement(list(range(1,n+1)), 3))
ans=0
for a,b,c in A:
if a==b==c:
ans+=calc(a,b,c)
elif a!=b and a!=c and b!=c:
ans+=ca... | p02713 |
k=int(eval(input()))
import math
res=0
for n in range(1,k+1):
for i in range(1,k+1):
for j in range(1,k+1):
res+=math.gcd(math.gcd(n,i),j)
print(res) | k=int(eval(input()))
from math import gcd
res=0
for n in range(1,k+1):
for i in range(1,k+1):
for j in range(1,k+1):
res+=gcd(gcd(n,i),j)
print(res) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
box = []
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
box.append(gcd(a,b,c))
print((sum(box))) | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
box = []
for a in range(1,K+1):
for b in range(a,K+1):
for c in range(b,K+1):
if a==b and b==c:
box.append(gcd(a,b,c))
elif a!=b and ... | p02713 |
from math import gcd
K=int(eval(input()))
k=[1,1,1]
g=0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
g+=gcd(gcd(a,b),c)
print(g) | from math import gcd
K=int(eval(input()))
g=0
for a in range(1,K-1):
for b in range(a+1,K):
for c in range(b+1,K+1):
g+=gcd(gcd(a,b),c)*6
for d in range(1,K):
for e in range(d+1,K+1):
g+=gcd(d,e)*6
g+=K*(K+1)//2
print(g) | p02713 |
K=int(eval(input()))
import fractions,itertools
data = [i for i in range(1,K+1)]
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,b,c in itertools.product(data, repeat=3):
ans... | K=int(eval(input()))
import itertools,math
from functools import reduce
data = [i for i in range(1,K+1)]
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans = 0
for a,b,c in itertools.product(data, repeat=3):
ans += gcd(a,b,c)
print(ans)
| p02713 |
K=int(eval(input()))
import itertools,math
from functools import reduce
data = [i for i in range(1,K+1)]
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans = 0
for a,b,c in itertools.product(data, repeat=3):
ans += gcd(a,b,c)
print(ans)
| K=int(eval(input()))
import math
from functools import reduce
def gcd(*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 |
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | 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()))
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) | from math import gcd
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(gcd(i,j),k)
print(S) | p02713 |
import math
def list_gcd(A):
"""N個の最大公約数
Args:
A (list[int])
Returns:
int: 最大公約数
Examples:
>>> list_gcd([1300, 34, 54, 60])
2
"""
ans = A[0]
for i in range(1, len(A)):
ans = math.gcd(ans, A[i])
return ans
def resolve():
... | from math import gcd
def resolve():
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
a = gcd(i, j)
for k in range(1, n + 1):
ans += gcd(a, k)
print(ans)
resolve() | p02713 |
from math import gcd #or import math
K = int(eval(input()))#or K = int(input())+1
plus = 0
for i in range(1,K+1):# range(1,K)
for a in range(1,K+1):# range(1,K)
x = gcd(i,a) #or math.gcd(i,a)
for j in range(1,K+1):# range(1,K)
plus += gcd(x,j) #or math.gcd(x,j)
pr... | from math import gcd
K = int(eval(input()))
plus = 0
for a in range(1, K+1):
for b in range(1, K+1):
temp = gcd(a, b)
if temp != 1:
for c in range(1, K+1):
plus += gcd(temp, c)
else:
plus += K
print(plus) | p02713 |
import math
K=int(eval(input()))
tot=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):
tot+=math.gcd(tmp,k)
print(tot) | # https://atcoder.jp/contests/abc162/tasks/abc162_c
import math
K=int(eval(input()))
# K=200
tot=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):
# tot+=math.gcd(tmp,k)
ls=[0]*202
for i in range(1,K+1):
for j in range(1,K+1)... | p02713 |
import math
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):
#print(a, b, c)
ans += math.gcd(a, math.gcd(b, c))
print(ans)
| import math
k = int(eval(input())) + 1
ans = 0
for a in range(1, k):
for b in range(1, k):
d = math.gcd(a, b)
for c in range(1, k):
ans += math.gcd(d, c)
print(ans)
| p02713 |
def gcd(a, b, c):
while b:
a, b = b, a % b
while c:
a, c = c, a % c
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(i,j,k)
print(ans) | def gccd(a, b, c):
while b:
a, b = b, a % b
while c:
a, c = c, a % c
return a
def gcd(a, b):
while b:
a, b = b, a % b
return a
n = int(eval(input()))
ans = n * (n+1) //2
for i in range(1,n+1):
for j in range(i+1,n+1):
ans += gcd(i,j) * 6
if n >2... | p02713 |
def resolve():
'''
code here
'''
import sys
from functools import lru_cache
sys.setrecursionlimit(10**3)
K = int(eval(input()))
@lru_cache(maxsize=10**3)
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a%b)
def gc... | def resolve():
'''
code here
'''
K = int(eval(input()))
import math
temp_list = []
for k in range(1,K+1):
for j in range(1,K+1):
temp_list.append(math.gcd(k,j))
res = 0
for item in temp_list:
for i in range(1,K+1):
res ... | p02713 |
# -*- coding: utf-8 -*-
from sys import stdin
from operator import itemgetter
from collections import deque
import math
import pprint
from functools import reduce
# stdin = open("sample.txt")
def keta(kazu):
kazu_str = str(kazu)
kazu_list = [int(kazu_str[i]) for i in range(0, len(kazu_str))]
re... | # -*- coding: utf-8 -*-
from sys import stdin
from operator import itemgetter
from collections import deque
import math
import pprint
from functools import reduce
# stdin = open("sample.txt")
def keta(kazu):
kazu_str = str(kazu)
kazu_list = [int(kazu_str[i]) for i in range(0, len(kazu_str))]
re... | p02713 |
K = int(eval(input()))
import math
sumnation = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
sumnation += math.gcd(math.gcd(a,b),c)
print(sumnation) | K = int(eval(input()))
import math
sumnation = 0
gcdlist = []
for A in range(1,K+1):
for B in range(1,K+1):
gcdlist.append(math.gcd(A,B))
for a in range(1,1+K):
for b in range(1,1+K):
gcd_a_b = gcdlist[(a-1)*K+b-1]
for c in range(1,1+K):
sumnation += gcdlist[(gcd_a... | p02713 |
from functools import reduce
def gcd(m, n):
r = m % n
return gcd(n, r) if r else n
def mgcd(*a):
return reduce(gcd, a)
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 += mgcd(i, j, l)
print(ans) | from math import gcd
k=int(eval(input()))
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
for m in range(1,k+1):
ans += gcd(i, gcd(j,m))
print(ans) | p02713 |
import math
k = int(eval(input()))
ab = []
ans = 0
for a in range(1,k+1):
for b in range(1,k+1):
if a % b == 0:
ab.append(b)
elif b % a == 0:
ab.append(a)
else:
ab.append(math.gcd(a, b))
for i in ab:
for c in range(1,k+1):
if ... | import math
k = int(eval(input()))
ab = []
ans = 0
for a in range(1,k+1):
for b in range(1,k+1):
ab.append(math.gcd(a, b))
for i in ab:
for c in range(1,k+1):
ans += math.gcd(i, c)
print(ans) | p02713 |
def mapint_inp():
return list(map(int, input().split()))
def intinp():
return int(eval(input()))
import math
from functools import reduce
import itertools
K = intinp()
def gcd(*num):
return reduce(math.gcd, num)
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for... | def mapint_inp():
return list(map(int, input().split()))
def intinp():
return int(eval(input()))
import math
import itertools
K = intinp()
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
ij = math.gcd(i, j)
for k in range(1, K+1):
ans += math.gcd(... | p02713 |
import math
num = int(eval(input()))
result = 0
for i in range(1, num+1):
for j in range (1, num+1):
for k in range (1, num +1):
result += math.gcd(math.gcd(i,j), k)
print(result) | import math
num = int(eval(input()))
result = 0
for i in range(1, num+1):
for j in range (1, num+1):
s= math.gcd(i,j)
for k in range (1, num +1):
result += math.gcd(s, k)
print(result) | p02713 |
K = int(eval(input()))
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
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)
| K = int(eval(input()))
def gcd(x, y):
if y == 0:
return x
else:
return gcd(y, x % y)
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)
# print(gcd(2,6))
| p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
gcd_list=[]
i=int(eval(input()))
for x in range(1, i+1):
for y in range(1, i+1):
for z in range(1, i+1):
gcd_list.append(gcd(x, y, z))
print((sum(gcd_list))) | from math import gcd
k=int(eval(input()))
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
ans_=gcd(i,j)
for l in range(1,k+1):
ans+=gcd(ans_,l)
print(ans) | p02713 |
import math
import itertools
w = 0
k = int(eval(input()))
for i in range(1, k+1):
for j in range(1, k+1):
for l in range(1, k+1):
m = math.gcd(i, j)
w += math.gcd(m, l)
print(w) | import math
w = 0
k = int(eval(input()))
for i in range(1, k+1):
for j in range(1, k+1):
for l in range(1, k+1):
m = math.gcd(i, j)
w += math.gcd(m, l)
print(w) | p02713 |
import math
w = 0
k = int(eval(input()))
for i in range(1, k+1):
for j in range(1, k+1):
for l in range(1, k+1):
m = math.gcd(i, j)
w += math.gcd(m, l)
print(w) | import math
w = 0
k = int(eval(input()))
for i in range(1, k+1):
for j in range(1, k+1):
m = math.gcd(i, j)
for l in range(1, k+1):
w += math.gcd(m, l)
print(w) | p02713 |
import itertools
import math
n = int(eval(input()))
lst = [_ for _ in range(1, n+1)]
lst2 = list(itertools.permutations(lst, 3))
lst3 = list(itertools.permutations(lst, 2))
l2 = sum([math.gcd(math.gcd(_[0],_[1]),_[2]) for _ in lst2])
l3 = sum([math.gcd(_[0], _[1]) for _ in lst3])
l4 = sum(lst)
ans = l2 + ... | import itertools
import math
n = int(eval(input()))
lst = [_ for _ in range(1, n+1)]
lst2 = list(itertools.product(lst, repeat=2))
lst3 = [math.gcd(_[0], _[1]) for _ in lst2]
lst4 = list(itertools.product(lst3, lst))
lst5 = [math.gcd(_[0], _[1]) for _ in lst4]
print((sum(lst5))) | p02713 |
import math
N = int(eval(input()))
def gcdtriple(a,b,c):
return math.gcd(a, math.gcd(b,c))
ans = 0
for a in range(1, N+1):
for b in range(1, N+1):
for c in range(1, N+1):
ans += gcdtriple(a,b,c)
print(ans) | import math
N = int(eval(input()))
def gcdtriple(a,b,c):
return math.gcd(a, math.gcd(b,c))
ans = 0
for a in range(1, N+1):
for b in range(1, a+1):
for c in range(1, b+1):
if a == b and b == c:
ans += gcdtriple(a,b,c)
elif a == b or b == c or c == a:
... | p02713 |
import math
k = int(eval(input()))
x = 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(math.gcd(a, b), c)
print(x) | import math
k = int(eval(input()))
x = 0
for a in range(1, k+1):
for b in range(1, k+1):
t = math.gcd(a, b)
for c in range(1, k+1):
x += math.gcd(t, c)
print(x) | p02713 |
import math
from functools import reduce
from itertools import product
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
ans = 0
n = list(product([i for i in range(1,k+1)],repeat=3))
for a,b,c in n:
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):
n = gcd(a,b)
for c in range(1,k+1):
ans += gcd(n,c)
print(ans) | p02713 |
k = int(eval(input()))
def gcd(a, b):
while b:
a, b = b, a % b
return a
answer = 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)
ans = gcd(ans, l)
answer += ans
print(answer) | import itertools
k = int(eval(input()))
def gcd(a, b):
while b:
a, b = b, a % b
return a
answer = 0
nums = list(range(1, k+1))
for balls in itertools.combinations_with_replacement(nums, 3):
i, j, l = balls[0], balls[1], balls[2]
ans = gcd(i, j)
ans = gcd(ans, l)
if len(... | 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 h in range(1,K+1):
for g in range(1,K+1):
S+=gcd(g,h,i)
print(S) | 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 h in range(i,K+1):
for g in range(h,K+1):
if i==h and h==g:
S+=gcd(g,h,i)
elif i==h or h==g or g==i:
S+=3*gcd(g,h,i)
else:
S+=6*... | p02713 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.