input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import math
from functools import reduce
from itertools import product
def resolve():
K = int(eval(input()))
gcd = math.gcd
step1 = [ gcd(x[0], x[1]) for x in product(list(range(1, K+1)), list(range(1, K+1))) ]
result = sum([ gcd(x[0], x[1]) for x in product(step1, list(range(1, K+1))) ])
print(resu... | 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)
| p02713 |
n = int(eval(input()))
def gcd(a,b):
ma = max(a,b)
mb = min(a,b)
jy = ma % mb
if jy == 0 :
return mb
else:
return gcd(mb,jy)
sum = 0
for i in range(n):
for j in range(n):
for k in range(n):
sum += gcd(i+1,gcd(j+1,k+1))
print(sum) | n = int(eval(input()))
def gcd(a,b):
ma = max(a,b)
mb = min(a,b)
jy = ma % mb
if jy == 0 :
return mb
else:
return gcd(mb,jy)
sum = 0
for i in range(1,n+1):
sum += i
for i in range(1,n):
for j in range(i+1,n+1):
sum += 6 * gcd(i,j)
for i in range(1,n-1):
for j in range(... | 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):
t_gcd=gcd(i,j)
ans+=gcd(t_gcd,l)
print(ans) | from math import gcd
k=int(eval(input()))
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1, k+1):
ans+=gcd(gcd(i,j),l)
print(ans) | p02713 |
#!/usr/bin/env python3
from functools import reduce
from itertools import product
from math import gcd
k = int(eval(input()))
p = list(product(list(range(1, k + 1)), repeat=3))
print((sum(reduce(gcd, i) for i in p)))
| #!/usr/bin/env python3
from functools import reduce
from itertools import combinations
from math import gcd
K = int(eval(input()))
sum = K * (K + 1) // 2
for i in combinations(list(range(1, K + 1)), 2):
sum += 6 * reduce(gcd, i)
for i in combinations(list(range(1, K + 1)), 3):
sum += 6 * reduce... | p02713 |
import sys
import math
from functools import lru_cache
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
@lru_cache(maxsize=None)
def solve(x, y):
return math.gcd(x, y)
def main():
N = int(eval(input()))
ans = 0
for i in range(1, N + 1):
for j in range(1, N + 1)... | import sys
import math
from functools import lru_cache
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
@lru_cache(maxsize=None)
def solve(x, y):
return math.gcd(x, y)
def main():
N = int(eval(input()))
ans = 0
for i in range(1, N + 1):
for j in range(1, N + 1)... | p02713 |
k = int(eval(input()))
import itertools
def GCD(a,b):
if(a%b == 0):
return b
else:
return GCD(b,a%b)
total = 0
for i in list(itertools.product(list(range(1,k+1)), repeat = 3)):
a = int(i[0])
b = int(i[1])
c = int(i[2])
total += GCD(GCD(a,b),c)
print(total) | k = int(eval(input()))
import itertools
def GCD(a,b):
if(a%b == 0):
return b
else:
return GCD(b,a%b)
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 |
# coding: utf-8
import sys
import math
import collections
import itertools
INF = 10 ** 13
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def lcm(x, y) : return (x * y) // math.gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return... | # coding: utf-8
import sys
import math
import collections
import itertools
INF = 10 ** 13
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def lcm(x, y) : return (x * y) // math.gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return... | 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):
sum += gcd(a+1, b+1, c+1)
print(sum) | import math
K = int(eval(input()))
sum = 0
dict = {}
for a in range(K):
for b in range(K):
ab = math.gcd(a+1, b+1)
if ab in dict:
dict[ab] = dict[ab]+1
else:
dict[ab] = 1
for c in range(K):
for ab in dict:
sum += math.gcd(ab, c+1)*dict[ab]
print(sum)
| p02713 |
import math
k = int(eval(input()))
ans = 0
for a in range(k):
for b in range(k):
for c in range(k):
GCDab = math.gcd(a+1, b+1)
GCDabc = math.gcd(GCDab, c+1)
ans += GCDabc
print(ans) | import math
k = int(eval(input()))
ansA, ansB, ansC = 0, 0, 0
for a in range(k):
ansC += a+1
for b in range(k-a-1):
GCDab = math.gcd(a+1, a+b+2)
ansB += GCDab
for c in range(k-a-b-2):
GCDabc = math.gcd(GCDab, a+b+c+3)
ansA += GCDabc
ans = ansA * 6 + ans... | p02713 |
k=int(eval(input()))
import itertools
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans=0
for i in range(1, k+1):
for h in range (1, k+1):
for j in range (1, k+1):
ans+=gcd(*[i, h, j])
print(ans) | k=int(eval(input()))
l=list(range(1, k+1))
import itertools
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans=0
for v in itertools.combinations_with_replacement(l, 3):
if v[0]==v[1]==v[2]:
ans+=gcd(*v)
elif v[0]==v[1]:
ans+=gcd(*v)*3
elif v[1]=... | p02713 |
import math
b=int(eval(input()))+1
sum=0
for x in range(1,b):
for y in range(1,b):
for z in range(1,b):
if x==1 or y==1 or z==1:
sum+=1
elif x==y and x==z:
sum+=x
elif x==y or z==y:
sum+=math.gcd(x, z)
... |
b=int(eval(input()))-1
ary=[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, 12804... | p02713 |
import math
from functools import reduce
k = int(eval(input()))
def gcd2(*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):
#print(gcd2(a,b,c))
sum = sum + gcd2(a,b,c)
print(sum)
| import math
from functools import reduce
k = int(eval(input()))
def gcd2(*numbers):
return reduce(math.gcd,numbers)
sum = 0
for a in range(1,k+1):
for b in range(a,k+1):
for c in range(b,k+1):
if len(set([a,b,c]))==2:
sum = sum + gcd2(a,b,c)*3
elif ... | 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):
a_b = math.gcd(a,b)
for c in range(1, K+1):
ans += math.gcd(a_b,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 i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
ans=ans+gcd(i,j,k)
print(ans) | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K=int(eval(input()))
ans=0
for i in range(1,K+1):
for j in range(i,K+1):
for k in range(j,K+1):
if i==j and j==k:
ans=ans+gcd(i,j,k)
elif i==j or j==k:
... | p02713 |
import math
#import itertools
num = (int)(eval(input()))
total = 0
#for i, j, k in itertools.product(list(range(1, num + 1)), list(range(1, num + 1)), list(range(1, num + 1))):
# total += math.gcd(math.gcd(i, j), k)
#print(total)
for i in range(1, num + 1):
for j in range(1, num + 1):
for k in range(1, ... | import math
num = (int)(eval(input()))
total = 0
for i in range(1, num + 1):
for j in range(1, num + 1):
sub = math.gcd(i, j)
for k in range(1, num + 1):
total += math.gcd(sub, k)
print(total) | p02713 |
import itertools as it
import math
K = int(eval(input()))
gcd_list = []
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
gcd_ = math.gcd(math.gcd(i, j), k)
gcd_list.append(gcd_)
print((sum(gcd_list)))
| import itertools as it
import math
K = int(eval(input()))
itr = list(range(1, K+1))
gcd_ = sum([math.gcd(math.gcd(i, j), k)
for i, j, k in it.product(itr, itr, itr)])
print(gcd_)
| p02713 |
import itertools
import math
from functools import reduce
def gcd_list(numbers):
return reduce(math.gcd, numbers)
N = int(eval(input()))
List1 = []
for i in range(1,N+1):
List1.append(i)
x = itertools.product(List1,List1,List1)
tryList= list(x)
res = 0
for i in tryList:
res += gcd_list(i)
pr... | import math
N = int(eval(input()))
n = 0
m = 0
res =0
List1 = ["INF"]*(N+1)
for i in range(1,N+1):
for j in range(1,N+1):
n = math.gcd(i,j)
if List1[n] == "INF":
for k in range(1,N+1):
m += math.gcd(n,k)
res += m
List1[n] = m
m = 0
else:
res += List... | p02713 |
from math import gcd
K = int(eval(input()))
ret = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
ret += gcd(gcd(a,b),c)
print(ret)
| #!/usr/bin python3
# -*- coding: utf-8 -*-
import sys
input = sys.stdin.readline
from math import gcd
def main():
K=int(eval(input()))
ret = 0
for a in range(K):
for b in range(K):
for c in range(K):
ret += gcd(gcd(a+1,b+1),c+1)
print(ret)
if __name... | p02713 |
def gcd(x, y):
while(x % y != 0 and y % x != 0):
if(x > y):
x = x % y
else:
y = y % x
if(x > y):
return y
else:
return x
K = int(eval(input()))
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
ans += gcd(i, gcd(j, k))
print(a... | def gcd(x, y):
while(x % y != 0 and y % x != 0):
if(x > y):
x = x % y
else:
y = y % x
if(x > y):
return y
else:
return x
K = int(eval(input()))
ans = 0
for i in range(1, K+1):
for j in range(i, K+1):
for k in range(j, K+1):
if(i == j and j == k):
a... | p02713 |
import math
from functools import reduce
def gcd_list(numbers):
return reduce(math.gcd, numbers)
n=int(eval(input()))
l1=list(range(1,n+1))
l2=list(range(1,n+1))
l3=list(range(1,n+1))
count=0
for i in l1:
for j in l2:
for k in l3:
count+=gcd_list([i,j,k])
print(count... | import math
from functools import reduce
def gcd_list(numbers):
return reduce(math.gcd, numbers)
n=int(eval(input()))
l1=list(range(1,n+1))
l2=list(range(1,n+1))
l3=list(range(1,n+1))
count=0
for i in l1:
for j in l2:
te=math.gcd(i,j)
for k in l3:
count+=math.g... | p02713 |
N = int(eval(input()))
N = N+1
sum = 0
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
for i in range(1, N):
for j in range(1, N):
for k in range(1, N):
# print(i, j, k, ' : ', gcd(i, j, k))
sum += (gcd(i, j, k))
... | N = int(eval(input()))
N = N+1
sum = 0
from math import gcd
for i in range(1, N):
for j in range(1, N):
for k in range(1, N):
sum += gcd(gcd(i, j), k)
print( sum )
| p02713 |
from functools import reduce
from math import gcd
def main():
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):
a = [i,j,k]
sum = sum + reduce(gcd,a)
print(sum)
main()
| from functools import reduce
from math import gcd
import itertools
def main():
n = int(eval(input()))
sum = 0
for i in range(1,n+1):
for j in range(i,n+1):
for k in range(j,n+1):
a = [i,j,k]
b = len(list(set(list(itertools.permutations(a,3)... | 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):
ans = ans + math.gcd(math.gcd(i,j), k)
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(gcd(i,j), k)
print(ans) | p02713 |
n=int(eval(input()))
# a,b,c=map(int,input().split())
cnt=0
def gcd(a,b):
if a==0: return b
else: return gcd(b%a,a)
# print(gcd(a,b))
def gcd_3(a,b,c):
if gcd(a,b)==0: return c
else: return gcd(c % gcd(a,b),gcd(a,b))
for i in range(1,n+1):
for j in range ( 1 , n + 1 ):
for k ... | def main():
from math import gcd
K = int(eval(input()))
result = 0
for a in range(1, K + 1):
for b in range(1, K + 1):
t = gcd(a, b)
for c in range(1, K + 1):
result += gcd(t, c)
print(result)
main() | p02713 |
# -*- coding: utf-8 -*-
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
sum = 0
for p in range(k):
for q in range(k):
for r in range(k):
sum += gcd(p + 1, q + 1, r + 1)
print(sum)
| import math
# from functools import reduce
# def gcd(*numbers):
# return reduce(math.gcd, numbers)
k = int(eval(input()))
sum = 0
for p in range(k):
for q in range(k):
n = math.gcd(p + 1, q + 1)
for r in range(k):
sum += math.gcd(n, r + 1)
print(sum) | p02713 |
import math
def gcd(a, b, c):
return math.gcd(math.gcd(a, b), c)
k = int(eval(input()))
answer = 0
for w_a in range(1, k + 1):
for w_b in range(1, k + 1):
for w_c in range(1, k + 1):
answer += gcd(w_a, w_b, w_c)
print(answer)
| import math
k = int(eval(input()))
answer = 0
for w_a in range(1, k + 1):
for w_b in range(1, k + 1):
w = math.gcd(w_a, w_b)
for w_c in range(1, k + 1):
answer += math.gcd(w, w_c)
print(answer)
| p02713 |
from math import*;from itertools import*;r=list(range(1,int(eval(input()))+1));print((sum(gcd(a,gcd(b,c))for a,b,c in product(r,r,r)))) | from math import*;r=list(range(1,int(eval(input()))+1));print((sum(gcd(a,gcd(b,c))for a in r for b in r for c in r))) | p02713 |
def gcd(a,b):
if b==0: return a
return gcd(b,a%b)
k=int(eval(input()))
ans=0
for a in range(k):
for b in range(k):
for c in range(k):
ans+=gcd(a+1,gcd(b+1,c+1))
print(ans) | from math import gcd
k=int(eval(input()))
ans=0
for a in range(k):
for b in range(k):
for c in range(k):
ans+=gcd(a+1,gcd(b+1,c+1))
print(ans) | p02713 |
from math import gcd
k=int(eval(input()))
ans=0
for a in range(k):
for b in range(k):
for c in range(k):
ans+=gcd(a+1,gcd(b+1,c+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):
for c in range(1,k+1):
ans+=gcd(a,gcd(b,c))
print(ans) | p02713 |
def gcd(a,b):
if b==0: return a
return gcd(b,a%b)
k=int(eval(input()))
ans=0
for a in range(1,k+1):
for b in range(1,k+1):
temp=gcd(a,b)
for c in range(1,k+1):
ans+=gcd(temp,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):
temp=gcd(a,b)
for c in range(1,k+1):
ans+=gcd(temp,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) | def gcd(a, b):
while b:
a, b = b, a % b
return a
k = int(eval(input()))
ans = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
ans += gcd(gcd(a,b),c)
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):
ij=math.gcd(i,j)
for k in range(1,k+1):
ans+=math.gcd(ij,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):
ij=gcd(i,j)
for k in range(1,k+1):
ans+=gcd(ij,k)
print(ans) | 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)
| import math
K=int(eval(input()))
ans=0
for a in range(1,K+1):
for b in range(1,K+1):
ans_=math.gcd(a,b)
for c in range(1,K+1):
ans+=math.gcd(ans_,c)
print(ans) | p02713 |
import math
from functools import reduce
def gcd_list(a,b,c):
return reduce(math.gcd, [a,b,c])
n = int(eval(input()))
cnt = 0
for i in range(1,n + 1):
for j in range(1,n + 1):
for k in range(1,n + 1):
cnt += gcd_list(i,j,k)
print(cnt) | import math
n = int(eval(input()))
cnt = 0
for i in range(1,n + 1):
for j in range(1,n + 1):
m = math.gcd(i, j)
for k in range(1,n + 1):
cnt += math.gcd(m, k)
print(cnt) | 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):
ans += math.gcd(i, math.gcd(k,j))
print(ans) | K = int(eval(input()))
ans = 0
import math
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):
ans += math.gcd(k, s)
print(ans) | p02713 |
k = int(eval(input()))
def mygcd(x,y):
a = min(x,y) # 最小値
b = max(x,y) # 最大値
r = 2 # 余り
while r != 0:
r = b % a
b = a
a = r
return b
ans = 0
for i in range(k):
for j in range(k):
for l in range(k):
ans += mygcd(mygcd(i+1,j+1),l+1)
... | K = int(eval(input()))
Sum = 0
def mygcd(x,y):
a = min(x,y) # 最小値
b = max(x,y) # 最大値
r = 2 # 余り
while r != 0:
r = b % a
b = a
a = r
return b
for A in range(1,K+1):
for B in range(1,K+1):
AB = mygcd(A,B)
if AB==1:
Sum = Sum... | p02713 |
import math
K=int(eval(input()))
ans=0
for i in range(1,K+1,1):
for j in range(1,K+1,1):
for k in range(1,K+1,1):
a = math.gcd(i,j)
b = math.gcd(a,k)
ans += b
print(ans) | import math
N=int(eval(input()))
ans=0
for i in range(1,N+1,1):
for j in range(i,N+1,1):
for k in range(j,N+1,1):
list =[i,j,k]
ff=len(set(list))
a = math.gcd(i,j)
b = math.gcd(a,k)
if ff == 1:
ans += b
eli... | p02713 |
import math
K=int(eval(input()))
ans=0
for i in range(1,K+1,1):
for j in range(1,K+1,1):
a = math.gcd(i,j)
for k in range(1,K+1,1):
b = math.gcd(a,k)
ans += b
print(ans) | import math
K=int(eval(input()))
ans=0
for i in range(1,K+1,1):
for j in range(1,K+1,1):
for k in range(1,K+1,1):
a = math.gcd(i,j)
b = math.gcd(a,k)
ans += b
print(ans) | p02713 |
import math
from functools import reduce
def gcd (*numbers):
return reduce(math.gcd,numbers)
k = int(eval(input()))
total = 0
for i in range(1,k+1):
for j in range(1,k+1):
for x in range(1,k+1):
total += gcd(i,j,x)
print(total) | import math
k = int(eval(input()))
ans = 0
for a in range(1,k+1):
for b in range(1,k+1):
ab = math.gcd(a,b)
if ab == 1:
ans += k
else:
for c in range(1,k+1):
ans += math.gcd(ab,c)
print(ans) | p02713 |
import math
def main():
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):
tmp = math.gcd(i,j)
ans += math.gcd(tmp,k)
print(ans)
if __name__ == "__main__":
main() | import math
def main():
n = int(eval(input()))
ans = 0
a = {}
for i in range(1,n+1):
for j in range(1,n+1):
tmp = math.gcd(i,j)
a[tmp] = a.get(tmp, 0)
a[tmp] += 1
for key, val in list(a.items()):
for j in range(1, n+1):
... | p02713 |
import math
from functools import reduce
k = int(eval(input()))
def gcd (*numbers):
return reduce(math.gcd, numbers)
def gcd_list (numbers):
return reduce(math.gcd, numbers)
ans = 0
for i in range(k):
for j in range(k):
for l in range(k):
ans += gcd(i + 1, j + 1, ... | import math
k = int(eval(input()))
ans = 0
for a in range(k):
for b in range(k):
d = math.gcd(a + 1, b + 1)
for c in range(k):
ans += math.gcd(d, c + 1)
print(ans)
| p02713 |
#C - Sum of gcd of Tuples (Easy)
K = int(eval(input()))
DP =[]
ans = 0
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
for i in range(1, K + 1):
for j in range(1, K + 1):
for k in... | #C - Sum of gcd of Tuples (Easy)
K = int(eval(input()))
DP =[]
ans = 0
import math
# from functools import reduce
# def gcd(*numbers):
# return reduce(math.gcd, numbers)
# def gcd_list(numbers):
# return reduce(math.gcd, numbers)
for i in range(1, K + 1):
for j in range(1, K + 1):
... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
ans += gcd(i, j, k)
print(ans) | from math import gcd
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 itertools
import functools
def euclid(a, b):
if b == 0:
return a
else:
return euclid(b, a%b)
def gcd(nums):
return functools.reduce(euclid, nums)
k = int(eval(input()))
ans = 0
for v in itertools.combinations_with_replacement([i+1 for i in range(k)], 3):
if len(set... | 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
ans = 0
k = int(eval(input()))
permutations_lis = list(itertools.product(list(range(1,k+1)), repeat=3))
for one_case in permutations_lis:
ans += math.gcd(one_case[0],math.gcd(one_case[1],one_case[2]))
print(ans) | k = int(eval(input()))
li=[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, ... | 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):
ans += math.gcd(i,math.gcd(j,k))
print(ans) | import math
ans = 0
n = int(eval(input()))
for i in range(1,n+1):
for j in range(1,n+1):
t = math.gcd(i,j)
for k in range(1,n+1):
ans += math.gcd(t,k)
print(ans) | p02713 |
def gcd(x1,x2):
r=0
while True:
if x1==x2:
r=x1
break
elif x1<x2:
x2=x2-x1
else:
x1=x1-x2
return r
x = int(eval(input()))
ans=0
for a in range(1,x+1):
for b in range(1,a+1):
for c in range(1,b+1):
... | import sys
sys.setrecursionlimit(10**8)
def gcd(p,q): #p<q
if q%p==0:
return p
return gcd(q%p,p)
x = int(eval(input()))
ans=0
for a in range(1,x+1):
for b in range(1,a+1):
for c in range(1,b+1):
gcd1=gcd(a,b)
gcd2=gcd(gcd1,c)
if a==b a... | p02713 |
K = int(eval(input()))
def pgcd(x,y):
while y>0:
x,y=y,x%y
return x
s = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
s+=pgcd(pgcd(a,b),c)
print(s) | from math import*
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]=gcd((c+1),(b+1))
i+=1
for a in range(K):
for x in d1:
N+=gcd(x,(a+1))
print(N) | p02713 |
import math
K = int(eval(input()))
a = 0
for i in range(1,K+1):
for j in range(1,K+1):
for h in range(1,K+1):
l = math.gcd(j,h)
m = math.gcd(i,l)
a += m
print(a) | import math
K = int(eval(input()))
a = 0
for i in range(1,K+1):
for j in range(1,K+1):
m = math.gcd(i,j)
for h in range(1,K+1):
l = math.gcd(h,m)
a += l
print(a) | p02713 |
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
# from fractions import gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from st... | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
# from fractions import gcd
from itertools import permutations, combinations, product, accumulate, combinations_with_replacement
from operator import itemgetter, mul
fro... | p02713 |
import math
from functools import reduce
K = int(eval(input()))
CNT= 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):
CNT += gcd(i,j,k)
print(CNT) | import math
from functools import reduce
K = int(eval(input()))
CNT= 0
def gcd(*numbers):
return reduce(math.gcd, numbers)
for i in range(1,K+1):
for j in range(1,K+1):
GCD = gcd(i,j)
if GCD == 1:
CNT += K
else:
for k in range(1, K+1):
... | p02713 |
import math
import sys
input = sys.stdin.readline
from functools import reduce
K = int(eval(input()))
CNT= 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):
CNT += gcd(i,j,k)
print(CNT) | import sys
input = sys.stdin.readline
def main():
K = int(eval(input()))
CNT = 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):
CNT += gcd(A, k)
print(CNT)
def gcd(p, q):
if p%q == 0:
return q
... | p02713 |
# -*- coding: utf-8 -*-
import math
# 整数の入力
n = int(eval(input()))
s = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
for k in range(1, n + 1):
gcd = math.gcd(math.gcd(i, j),k)
s += gcd
print(s) | # -*- coding: utf-8 -*-
import math
# 整数の入力
n = int(eval(input()))
s = 0
for i in range(1, n + 1):
for j in range(i, n + 1):
for k in range(j, n + 1):
gcd = math.gcd(math.gcd(i, j),k)
if i == j and j == k:
s += gcd
elif i == j or j == k or k ==i... | p02713 |
import math
K = int(eval(input()))
S = 0
for i in range(1,K+1):
for j in range(1,K+1):
for l in range(1,K+1):
S = S + math.gcd(l, math.gcd(j,i))
print(S)
| import math
K = int(eval(input()))
A = 0
for i in range(1,K+1):
for j in range(1,K+1):
for l in range(1,K+1):
A += math.gcd(math.gcd(l,j),i)
print(A)
| p02713 |
def gcd(a, b):
if b == 0:
return a
return gcd(b, a%b)
N=int(eval(input()))
s=0
for i in range(1,N+1):
for j in range(1,N+1):
for h in range(1,N+1):
a=gcd(i,j)
s+=gcd(a,h)
print(s) | def gcd(a, b):
if b == 0:
return a
return gcd(b, a%b)
N=int(eval(input()))
s=0
for i in range(1,N+1):
for j in range(i+1,N+1):
for h in range(j+1,N+1):
a=gcd(i,j)
s+=6*gcd(a,h)
for p in range(1,N+1):
for q in range(1,N+1):
if p==q:
s+=p
else:
s+=3*gcd(p,q)... | 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
def gcd(*numbers):
return math.gcd( math.gcd(a, b), c)
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)
| p02713 |
#coding:utf-8
import math
import itertools
from functools import reduce
def gcd(num):
return reduce(math.gcd, num)
def main():
k = int(eval(input()))
ans = 0
num = [i for i in range(1,k+1)]
comb = tuple(itertools.product(num, repeat=3))
for i in comb:
ans += gcd(i)
... | #coding:utf-8
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 |
# -*- coding: utf-8 -*-
K = int(eval(input()))
def gcd(p, q):
if(p % q == 0):
return q
else:
return gcd(q, p % q)
sum1 = 0
for a in range(1, K+1):
for b in range(a+1, K+1):
for c in range(b+1, K+1):
sum1 += gcd(a, gcd(b, c))
sum2 = 0
for a in range(1, K+1):
for c in range(a... | # -*- coding: utf-8 -*-
K = int(eval(input()))
def gcd(p, q):
if(p % q == 0):
return q
else:
return gcd(q, p % q)
sum1 = 0
for c in range(1, K+1):
for b in range(c+1, K+1):
d = gcd(b, c)
for a in range(b+1, K+1):
sum1 += gcd(a, d)
sum2 = 0
for a in range(1, K+1):
for c... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def main():
K = int(eval(input()))
s = sum([gcd(i+1, j+1, k+1) for i in range(K) for j in range(K) for k in range(K)])
print(s)
if __name__=="__main__":
main()
| import math
def main():
K = int(eval(input()))
s = 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):
s += math.gcd(tmp, k)
print(s)
if __name__=="__main__":
main()
| p02713 |
import math
ans = 0
def gcd_list(a):
tmp = math.gcd(a[0],a[1])
return math.gcd(tmp,a[2])
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):
a = [i,j,k]
ans += gcd_list(a)
print(ans) | import math
ans = 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):
ans += math.gcd(tmp,k)
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 = 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(1,K+1,1):
for j in range(i,K+1,1):
for k in range(j,K+1,1):
if i == j and j==k:
ans = ans + math.gcd(math.gcd(i,j),k)
elif i == j and j != k:
ans = ans + 3*math.gcd(math.gcd(i,j),k)
... | p02713 |
import math
num = (int)(eval(input()))
total = 0
for i in range(1, num + 1):
for j in range(1, num + 1):
sub = math.gcd(i, j)
for k in range(1, num + 1):
total += math.gcd(sub, k)
print(total) | from math import gcd
num = (int)(eval(input()))
total = 0
for i in range(1, num + 1):
for j in range(1, num + 1):
sub = gcd(i, j)
for k in range(1, num + 1):
total += gcd(sub, k)
print(total)
| 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):
tmp = gcd(i,j)
for m in range (1,k+1):
ans += gcd(tmp,m)
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 m in range (1,k+1):
ans += math.gcd(tmp,m)
print(ans)
| p02713 |
n = int(eval(input()))
ans = 0
def gcd(a,b):
if a>b:
p = a
q = b
else:
p = b
q = a
d = q
while p % q != 0:
d = p % q
p = q
q = d
return d
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
... | n = int(eval(input()))
ans = 0
def max(a,b):
if a>b:
return a
else:
return b
def min(a,b):
if a<b:
return a
else:
return b
def gcd(a,b):
p = max(a,b)
q = min(a,b)
d = q
while p % q != 0:
d = p % q
p = q
q... | p02713 |
import sys
import re
import array
import copy
import functools
import operator
import math
import string
import fractions
from fractions import Fraction
from math import gcd
# fractions.gcd() を用いること
# math.log2()はatcoderでは対応していない．留意せよ．
import collections
import itertools
import bisect
import... |
import sys
from math import gcd
from functools import reduce
input = sys.stdin.readline
def find_gcd(list_l):
x = reduce(gcd, list_l)
return x
def main():
k = int(input().strip())
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
for k in range(1,k+1):... | p02713 |
#ABC162c
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
abc = 0
for i in range(1,k+1):
for i2 in range(1,k+1):
ab = gcd(i,i2)
for i3 in range(1,k+1):
abc += gcd(ab, i3)
print(abc)
| #ABC162c
from math import gcd
K = int(eval(input()))+1
Sum = 0
for i in range(1,K):
for j in range(1,K):
d = gcd(i,j)
for k in range(1,K):
Sum+=gcd(d,k)
print(Sum)
| p02713 |
from math import gcd
K=int(eval(input()))
a=0
for i in range(1,K+1):
for j in range(1,K+1):
t=gcd(i,j)
for k in range(1,K+1):
a+=gcd(t,k)
print(a)
| K=int(eval(input()))
N=3
pr=10**9+7
a=0
l=[None]*(K+1)
for i in range(K,0,-1):
t=pow(K//i,N,pr)
c=i*2
while c<=K:
t-=l[c]
c+=i
l[i]=t
a=(a+t*i)%pr
print(a) | p02713 |
from math import gcd
from functools import reduce
k = int(eval(input()))
l = [[a,b,c] for a in range(1,k+1) for b in range(1,k+1) for c in range(1,k+1)]
#print(sum(reduce(gcd,l)))
ans = 0
for i in l:
ans += reduce(gcd,i)
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 |
import math
K = int(eval(input()))
sum = 0
for a in range(K):
for b in range(K):
for c in range(K):
sum += math.gcd(math.gcd(a+1, b+1), c+1)
print(sum) | import math
K = int(eval(input()))
sum = 0
gcd = 0
for a in range(K):
for b in range(K):
gcd = math.gcd(a+1, b+1)
for c in range(K):
sum += math.gcd(gcd, c+1)
print(sum) | p02713 |
#!/usr/bin/python3
# -*- coding: utf-8 -*-
#a,bの最大公約数
def gcd(a, b):
while b:
a, b = b, a % b
return a
data_dict = {}
k = int(eval(input()))
if k == 1:
print((1))
else:
ans = 3 * k * k - 3 * k + 1
for x in range(2, k + 1):
for y in range(2, k + 1):
for z in... | #!/usr/bin/python3
# -*- coding: utf-8 -*-
#a,bの最大公約数
def gcd(a, b):
while b:
a, b = b, a % b
return a
data_dict = {}
k = int(eval(input()))
if k == 1:
print((1))
else:
ans = 3 * k * k - 3 * k + 1
for x in range(2, k - 1):
for y in range(x + 1, k):
key = st... | p02713 |
import math
from functools import reduce
from itertools import product
def gcd_(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
ans = 3*K*(K-1) + 1
for i,j,k in product(list(range(2,K+1)),list(range(2,K+1)),list(range(2,K+1))):
ans += gcd_(i,j,k)
print(ans) | import math
from functools import reduce
from itertools import product,combinations_with_replacement
def gcd_(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
ans = 3*K*(K-1) + 1
# for i,j,k in product(range(2,K+1),repeat=3):
# ans += gcd_(i,j,k)
for i,j,k in combinations_with... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
t = 0
k= int(eval(input('')))+1
cnt={}
for l in range(1,k):
for m in range(l,k):
for n in range(m,k):
# print("{}/{}... | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
t = 0
k= int(eval(input('')))+1
#cnt={}
for l in range(1,k):
for m in range(l,k):
for n in range(m,k):
# print("{}/{... | p02713 |
K=int(eval(input()))
def gcd(a,b,c):
if a <b:
a,b=b,a
while a%b != 0:
a,b= b,a%b
if b < c:
b,c=c,b
while b % c != 0:
b,c = c,b%c
return c
x=0
for i in range(1,K+1):
for j in range(1,K+1):
for l in range(1,K+1):
if (i==1) or (j==1... | K=int(eval(input()))
def gcd(a,b,c):
if a <b:
a,b=b,a
while a%b != 0:
a,b= b,a%b
if b < c:
b,c=c,b
while b % c != 0:
b,c = c,b%c
return c
x=0
for i in range(1,K+1):
for j in range(1,K+1):
for l in range(1,K+1):
... | p02713 |
import itertools
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
la = []
l = list(range(1, k+1))
for a, b, c in itertools.product(l, l, l):
la.append(gcd(a, b, c))
print((sum(la))) | k = int(eval(input()))
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,
... | p02713 |
def gcd(a, b):
if a % b == 0:
return b
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 l in range(1, k+1):
sum += gcd(gcd(i, j), l)
print(sum) | def gcd(a, b):
if a % b == 0:
return b
return gcd(b, a % b)
k = int(eval(input()))
sum = 0
# gcd(a,a,a)
sum += int((1+k)*k/2)
# gcd(a,b,b)
if k >= 2:
for i in range(1, k):
for j in range(i+1, k+1):
sum += gcd(i, j)*6
# gcd(a,b,c)
if k >= 3:
for i in... | 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 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):
for l in range(1,K+1):
ans += math.gcd(math.gcd(i,j),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):
for s in range(1,k+1):
ans += math.gcd(math.gcd(i,j),s)
print(ans) | k = int(eval(input()))
ans = 0
def gcd(x,y):
while y:
x, y = y, x % y
return x
for i in range(1,k+1):
for j in range(1,k+1):
for s in range(1,k+1):
ans += gcd(gcd(i,j),s)
print(ans) | p02713 |
k = int(eval(input()))
ans = 0
def gcd(x,y):
while y:
x, y = y, x % y
return x
for i in range(1,k+1):
for j in range(1,k+1):
for s in range(1,k+1):
ans += gcd(gcd(i,j),s)
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 s in range(1,k+1):
ans += math.gcd(math.gcd(i,j),s)
print(ans) | p02713 |
K = int(eval(input()))
import math
def gcd_three(a, b, c):
r = math.gcd(a, b)
if( r == 1 ):
return 1
else:
return math.gcd(r, c)
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_three(a,b,c)
print(sum) | K = int(eval(input()))
import math
def gcd_three(a, b, c):
r = math.gcd(a, b)
if( r == 1 ):
return 1
else:
return math.gcd(r, c)
sum = 0
if(K>2):
for a in range(1, K-1):
for b in range(a+1, K):
for c in range(b+1, K+1):
sum += gcd_three(a,... | p02713 |
import math
from functools import reduce
import itertools
K = int(eval(input()))
count = 0
for abc in list(itertools.product(list(range(1, K+1)), repeat=3)):
count += reduce(math.gcd, abc)
print(count) | import math
count = 0
K = int(eval(input()))
for a in range(1, K+1):
for b in range(1, K+1):
temp = math.gcd(a, b)
for c in range(1, K+1):
count += math.gcd(temp, c)
print(count) | 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) | n = int(eval(input()))
import math
l = []
for i in range(1,n +1):
for j in range(1,n+1):
l.append(math.gcd(i,j))
ans = 0
for i in range(1, n+1):
for j in l:
ans += math.gcd(j,i)
print(ans)
| p02713 |
import sys
input=sys.stdin.readline
#from collections import defaultdict
#d = defaultdict(int)
#import fractions
import math
#import collections
#from collections import deque
#from bisect import bisect_left
K = int(eval(input()))
#A = list(map(int,input().split()))
#S = list(input())
#S.remove("\n")
#N,M ... | import sys
input=sys.stdin.readline
#from collections import defaultdict
#d = defaultdict(int)
#import fractions
import math
#import collections
#from collections import deque
#from bisect import bisect_left
K = int(eval(input()))
#A = list(map(int,input().split()))
#S = list(input())
#S.remove("\n")
#N,M ... | p02713 |
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) | K=int(eval(input()))
cache = [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,... | p02713 |
import math
from functools import reduce
k = int(eval(input()))
ans = 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):
ans += gcd(a,b,c)
print(ans) | import math
k = int(eval(input()))
box = [0]*(k+1)
ans = 0
for a in range(1,k+1):
for b in range(1,k+1):
box[math.gcd(a,b)] += 1
for a in range(1,k+1):
for c in range(1,k+1):
ans += math.gcd(a,c)*box[a]
print(ans) | p02713 |
MAX_K: int = 200
gt = [[0 for _ in range(MAX_K + 1)] for _ in range(MAX_K + 1)]
def gcd(x: int, y: int) -> int:
ret: int = 0
if x < y:
ret = gcd(y, x)
elif y == 0:
ret = x
elif y == 1:
ret = 1
else:
ret = gcd(y, x % y)
gt[x][y] = ret
# print(f... | MAX_K: int = 200
gt = [[0 for _ in range(MAX_K + 1)] for _ in range(MAX_K + 1)]
def gcd(x: int, y: int) -> int:
if gt[x][y] > 0:
return gt[x][y]
ret: int = 0
if x < y:
ret = gcd(y, x)
elif y == 0:
ret = x
elif y == 1:
ret = 1
else:
ret = g... | p02713 |
import math
from functools import reduce
k = int(eval(input())) + 1
def gcd(*numbers):
return reduce(math.gcd, numbers)
def counter(num):
count = 0
for a in range(1, num):
for b in range(1, num):
t = gcd(a,b)
for c in range(1, num):
co... | from math import gcd
num = int(eval(input())) + 1
count = 0
for a in range(1, num):
for b in range(1, num):
t = gcd(a,b)
for c in range(1, num):
count += gcd(t, c)
print(count)
| p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans = 0
k = int(eval(input()))
for i in range(1,k+1):
for j in range(1,k+1):
for p in range(1,k+1):
ans += gcd(i,j,p)
print(ans)
| import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans = 0
k = int(eval(input()))
for i in range(1,k+1):
for j in range(i,k+1):
for p in range(j,k+1):
if (i!=j) and (j!=p) and (i!=p):
#print(i,j,p, 'pattern3')
... | p02713 |
class Gcd:
def __init__(self, K):
self.table = [[None] * K for i in range(K)]
return
def gcd(self, x, y):
if self.table[x - 1][y - 1] is not None:
return self.table[x - 1][y - 1]
if x == y:
self.table[x - 1][y - 1] = x
return x
... | class Gcd:
def __init__(self, K):
self.table = [[None] * K for i in range(K)]
return
def gcd(self, x, y):
if self.table[x - 1][y - 1] is not None:
return self.table[x - 1][y - 1]
if x == y:
self.table[x - 1][y - 1] = x
return x
... | p02713 |
import math
K=int(eval(input()))
k=K+1
ans=0
for a in range(1,k):
for b in range(1,k):
for c in range(1,k):
m=math.gcd(a,b)
n=math.gcd(m,c)
ans+=n
print(ans) | import math
K=int(eval(input()))
k=K+1
ans=0
for a in range(1,k):
for b in range(a,k):
for c in range(b,k):
m=math.gcd(a,b)
o=math.gcd(m,c)
if a==b and b==c:
n=o
elif a==b or b==c:
n=o*3
else:
... | 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(k):
i += 1
for j in range(k):
j += 1
for l in range(k):
l += 1
ans += gcd(i, j, l)
print(ans)
| from math import gcd
from functools import reduce
k = int(eval(input()))
ans = 0
for i in range(k):
i += 1
for j in range(k):
j += 1
m = gcd(i, j)
for l in range(k):
l += 1
ans += gcd(l, m)
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) | def main():
from math import gcd
k = int(eval(input()))
total = 0
for a in range(1,k+1):
for b in range(1,k+1):
temp = gcd(a, b)
for c in range(1,k+1):
total+= gcd(temp, c)
print(total)
main() | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
num = 0
for a in range(K):
for b in range(K):
for c in range(K):
num += gcd(a+1, b+1, c+1)
print(num) | import math
K = int(eval(input()))
num = 0
for a in range(K):
for b in range(K):
ab = math.gcd(a+1, b+1)
for c in range(K):
num += math.gcd(ab, c+1)
print(num) | p02713 |
import itertools
import math
from functools import reduce
num = int(eval(input()))
a_list = [i for i in range(1,num+1)]
comb_list = list(itertools.product(a_list, repeat=3))
def gcd_list(numbers):
return reduce(math.gcd, numbers)
print((sum([gcd_list(x) for x in comb_list]))) | import itertools
import math
from functools import reduce
num = int(eval(input()))
def gcd_list(numbers):
return reduce(math.gcd, numbers)
if num<=2:
a_list = [i for i in range(1,num+1)]
comb_list = list(itertools.product(a_list, repeat=3))
print((sum([gcd_list(x) for x in comb_lis... | p02713 |
import math
from functools import reduce
K = int(eval(input()))
gcd_v = {}
def gcd(numbers):
tuple_n = tuple(sorted(numbers))
try:
return gcd_v[tuple_n]
except:
gcd_v[tuple_n] = reduce(math.gcd, numbers)
return gcd_v[tuple_n]
ans = 0
for a in range(1, K+1):
for b... | import math
from functools import reduce
K = int(eval(input()))
def gcd(numbers):
res = reduce(math.gcd, numbers)
n = len(set(numbers))
if n == 1:
return res
elif n == 2:
return res * 3
else:
return res * 6
ans = 0
for a in ran... | p02713 |
k = int(eval(input()))
s = 0
for i1 in range(1, k+1):
for i2 in range(1, i1+1):
x1, x2 = i1, i2
while x2 != 0:
x1, x2 = x2, x1 % x2
gcd1 = x1
s2 = i1 == i2
for i3 in range(i1, k+1):
x1, x2 = gcd1, i3
while x2 != 0:
... | k = int(eval(input()))
s = 0
# 3つ違う
for i1 in range(1, k+1):
s = s + i1
for i2 in range(1, i1):
x1, x2 = i1, i2
while x2 != 0:
x1, x2 = x2, x1 % x2
gcd1 = x1
s = s + gcd1 * 6
for i3 in range(i1+1, k+1):
x1, x2 = gcd1, i3
... | 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(k, math.gcd(i,j))
print(ans) | K = int(eval(input()))
# K = 2
import math
import itertools
def better_gcd(a,b,c):
tup = set((a,b,c))
kinds = len(tup)
if kinds == 3:
return math.gcd(a, math.gcd(b, c)) * 6
elif kinds == 2:
return math.gcd(*tup) * 3
else:
return a
ans = 0
cands = list(iterto... | p02713 |
a=int(eval(input()))
b=0
c=1
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
for i in range(1,a+1):
for j in range(1,a+1):
for z in range(1,a+1):
... | import math
n=int(eval(input()))
g=0
for i in range(1,1+n):
for j in range(1,1+n):
d=math.gcd(i,j)
for z in range(1,n+1):
f=math.gcd(z,d)
g+=f
print(g) | p02713 |
def gcd_tri(a,b,c):
if a < b:
a,b = b,a
while a % b != 0:
a,b = b, a%b
if b < c:
b,c = c,b
while b % c != 0:
b,c = c, b%c
return c
a = int(eval(input()))
ans =0
for n in range(a):
for l in range(a):
for m in range(a):
ans +... | import math
a = int(eval(input()))
lis =[]
ans = 0
for x in range(1,a+1):
for y in range(1, a+1):
lis.append(math.gcd(x,y))
for z in range(1, a+1):
for l in lis:
ans += math.gcd(z,l)
print(ans) | p02713 |
import itertools
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd,numbers)
K=int(eval(input()))
ans=0
x=[]
for i in range(1,K+1):
for j in range(1,K+1):
x.append(math.gcd(i,j))
for i in x:
for j in range(1,K+1):
ans+=gcd(i,j)
print(ans) | import itertools
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):
t=math.gcd(i,j)
for k in range(1,K+1):
ans+=math.gcd(t,k)
print(ans) | p02713 |
from math import gcd
from functools import reduce
def gcd_list(numbers):
return reduce(gcd, numbers)
k=int(eval(input()))
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
for x in range(1,k+1):
ans+=gcd_list([i,j,x])
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):
p=gcd(i,j)
for x in range(1,k+1):
ans+=gcd(x,p)
print(ans) | p02713 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.