input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
l=[1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199]
a=0
b=0
#for i in range(K):
# b+=
K=int(eval(input()))... | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
l=[1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199]
a=0
K=int(eval(input()))
for i in range(1,K+1):
if i i... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
l=[1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199]
a=0
K=int(eval(input()))
for i in range(1,K+1):
if i i... | import math
a=0
K=int(eval(input()))
for i in range(1,K+1):#(1,2,3)
for j in range(i,K+1):
for r in range(j,K+1):
if i==j and i==r:#(1,1,1)のような場合
a+=math.gcd(i,math.gcd(j,r))
elif i==j or j==r:#(1,1,2),(1,2,2)のような場合。各3通り
a+=math.gcd(i,math... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans = 0
N = int(eval(input()))
L = []
for x in range(1,N+1):
for y in range(1,N+1):
if(x == y):
L.append(x)
elif(x % y == 0):
L.append(y)
elif(y % x == 0):
... | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans = 0
N = int(eval(input()))
L = []
s_dict = {}
for x in range(1,N+1):
for y in range(1,N+1):
if(x == y):
L.append(x)
s_dict[(x,y)] = x
elif(x % y == 0):
... | p02713 |
from math import gcd
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)
| k=int(eval(input()))
n=3
mod=10**9+7
lst=[0]*(k+1)
ans=0
for i in range(k,0,-1):
lst[i]+=pow(k//i,n,mod)
if k//i==1:
continue
else:
for j in range(2,k//i+1):
lst[i]-=lst[i*j]
for i in range(1,k+1):
ans+=(i*lst[i])%mod
ans%=mod
print(ans) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
x=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):
x+=gcd(i,j,l)
print(x) | from math import gcd
k = int(eval(input()))
r = list(range(1, k + 1))
ans = sum([gcd(gcd(a, b), c) for a in r for b in r for c in r])
print(ans) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
x=0
k=int(eval(input()))
r = list(range(1, k + 1))
x = sum([gcd(a, b, c) for a in r for b in r for c in r])
print(x)
| import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
x=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):
x+=gcd(i,j,l)
print(x)
| p02713 |
import fractions
from functools import reduce
import itertools
import math
def gcd(*numbers):
return reduce(fractions.gcd, numbers)
K = int(eval(input()))
if K == 1:
ans = 1
elif K == 2:
ans = 9
else:
ans = 0
for i in range(1, K+1):
ans += i
for j in range(i+1, K... | import fractions
from functools import reduce
import itertools
import math
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
if K == 1:
ans = 1
elif K == 2:
ans = 9
else:
ans = 0
for i in range(1, K+1):
ans += i
for j in range(i+1, K+1):
... | p02713 |
k = int(eval(input()))
d = [[] for _ in range(k)]
for i in range(1, k+1):
for ii in range(1, k+1):
if i % ii == 0:
d[i-1].append(ii)
ans = 0
for a1 in range(k):
for a2 in range(k):
for a3 in range(k):
ans += max(set(d[a1]) & set(d[a2]) & set(d[a3]))
print... | import itertools
k = int(eval(input()))
d = [[] for _ in range(k)]
for i in range(1, k+1):
for ii in range(1, k+1):
if i % ii == 0:
d[i-1].append(ii)
seq = [i for i in range(1, k+1)]
ans = 0
A = list(itertools.combinations_with_replacement(seq, 3))
for a in A:
a1 = a[0]
a... | p02713 |
import itertools
k = int(eval(input()))
d = [[] for _ in range(k)]
for i in range(1, k+1):
for ii in range(1, k+1):
if i % ii == 0:
d[i-1].append(ii)
seq = [i for i in range(1, k+1)]
ans = 0
A = list(itertools.combinations_with_replacement(seq, 3))
for a in A:
a1 = a[0]
a... | import itertools
k = int(eval(input()))
d = [[] for _ in range(k)]
for i in range(1, k+1):
n = 1
while i*n <= k:
d[i*n-1].append(i)
n += 1
seq = [i for i in range(1, k+1)]
ans = 0
A = list(itertools.combinations_with_replacement(seq, 3))
for a in A:
a1 = a[0]
a2 = a[1]... | 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):
t=math.gcd(i,j)
t=math.gcd(t,k)
ans+=t
print(ans)
| 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 |
def gud(a,b):
if a%b==0:
return b
else:
return gud(b,a%b)
a=int(eval(input()))
ans=0
for i in range(a):
for j in range(a):
n=gud(i+1,j+1)
for k in range(a):
ans+=gud(n,k+1)
print(ans) | import math
def gud(a,b):
if a%b==0:
return b
else:
return gud(b,a%b)
a=int(eval(input()))
ans=0
for i in range(1,a+1):
for j in range(1,a+1):
n=math.gcd(i,j)
for k in range(1,a+1):
ans+=math.gcd(n,k)
print(ans) | p02713 |
import sys
input = sys.stdin.readline
from collections import defaultdict
from itertools import *
class PrimeFactor():
def __init__(self, n): # エラトステネス O(N loglog N)
self.n = n
self.table = list(range(n+1))
self.table[2::2] = [2]*(n//2)
for p in range(3,... | A = [1, 9, 30, 76, 141, 267, 400, 624, 885, 1249, 1590, 2208, 2689, 3411, 4248, 5248, 6081, 7485, 8530, 10248, 11889, 13687, 15228, 17988, 20053, 22569, 25242, 28588, 31053, 35463, 38284, 42540, 46581, 50893, 55362, 61824, 65857, 71247, 76884, 84388, 89349, 97881, 103342, 111528, 120141, 128047, 134580, 146316, 154177,... | p02713 |
def main():
N = int(eval(input()))
A = (
1, 9, 30, 76, 141, 267, 400, 624, 885, 1249, 1590, 2208, 2689, 3411, 4248, 5248, 6081, 7485, 8530, 10248, 11889,
13687, 15228, 17988, 20053, 22569, 25242, 28588, 31053, 35463, 38284, 42540, 46581, 50893, 55362, 61824, 65857,
71247, 76884, 84388, 89349, 9... | N = int(eval(input()))
A = (1, 9, 30, 76, 141, 267, 400, 624, 885, 1249, 1590, 2208, 2689, 3411, 4248, 5248, 6081, 7485, 8530, 10248, 11889, 13687, 15228, 17988, 20053, 22569, 25242, 28588, 31053, 35463, 38284, 42540, 46581, 50893, 55362, 61824, 65857, 71247, 76884, 84388, 89349, 97881, 103342, 111528, 120141, 128047,... | p02713 |
from itertools import product
from math import gcd
k = int(eval(input()))
res = 0
for a, b, c in product(list(range(1, k+1)), repeat=3):
res += gcd(gcd(a, b), c)
print(res)
| from math import gcd
k = int(eval(input()))
res = 0
mul = [0, 1, 3, 6]
for a in range(1, k+1):
for b in range(a, k+1):
for c in range(b, k+1):
res += gcd(gcd(a, b), c) * mul[len({a, b, c})]
print(res)
| p02713 |
import sys
import math
input = sys.stdin.readline
K = int(eval(input()))
ans = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
n = math.gcd(i, j)
for l in range(1, K + 1):
ans += math.gcd(n, l)
print(ans) | import sys
import math
input = sys.stdin.readline
K = int(eval(input()))
ans = 0
for i in range(1, K + 1):
for j in range(i, K + 1):
n = math.gcd(i, j)
for l in range(j, K + 1):
if len(set([i, j, l])) == 1:
ans += math.gcd(n, l)
elif len(set([i,... | p02713 |
def gcd(a, b):
if a < b:
a, b = b, a
if b == 0:
return a
else:
return gcd(b, a%b)
ans=0
k=int(eval(input()))
for x in range(1,k+1):
for y in range(1,k+1):
for z in range(1,k+1):
ans+=gcd(x,gcd(y,z))
print(ans) | from math import gcd
k=int(eval(input()))
ans=0
for l in range(1, k+1):
for m in range(1, k+1):
for n in range(1, k+1):
ans+=gcd(l,gcd(m,n))
print(ans) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
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 += gcd(i, j, k)
print(sum)
| import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
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):
# print(i, j, k)
if i ==j and i == k:
sum += gcd(i, j, k)
elif i == j or... | p02713 |
from functools import reduce
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
def gcd(a, b):
"""
return gcd of a,b
ユークリッド
"""
while b:
a, b = b, a % b
return a
def list_gcd(l):
"""
l: list
l のgcd を返す
"""
return reduce(gcd, l)... |
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
def gcd(a, b):
"""
return gcd of a,b
ユークリッド
"""
a,b =max(a,b),min(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):
... | 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()))
result = 0
for i in range(n):
for j in range(n):
for k in range(n):
result += gcd(i+1, j+1,... | 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 |
K=int(eval(input()))
def gcd(a,b):
if b==0:
return a
else:
return gcd(b,a%b)
return x
ans=0
for i in range(1,K+1):
for j in range(1,K+1):
x=gcd(i,j)
for k in range(1,K+1):
ans+=gcd(x,k)
print(ans)
| n = int(eval(input()))
from math import gcd
y = 0
for i in range(1, n+1):
for j in range(1, n+1):
x = gcd(i, j)
for k in range(1, n+1):
y += gcd(x,k)
print(y) | p02713 |
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) | 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 |
a=int(eval(input()))
ans=0
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd,numbers)
print((sum(gcd(i,j,k)for i in range(1,a+1) for j in range(1,a+1) for k in range(1,a+1)))) | a=int(eval(input()))
import math
print((sum(math.gcd(math.gcd(i,j),k)for i in range(1,a+1) for j in range(1,a+1) for k in range(1,a+1)))) | p02713 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import math
from functools import lru_cache
@lru_cache(maxsize=None)
def get_gcd(a, b):
return math.gcd(a, b)
def main():
k = int(input().strip())
sum = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
a_, b_ =... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
import math
from functools import lru_cache
# prime_200 = {
# 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
# 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173,
# 179, 181, 191... | p02713 |
import math
K = int(eval(input()))
def gcd3(a, b, c):
d = math.gcd(a, b)
e = math.gcd(d, c)
return e
ans = 0
for x in range(1, K + 1, 1):
for y in range(1, K + 1, 1):
ans = ans + sum(list([gcd3(x, y, z) for z in range(1, K+1, 1)]))
print(ans)
| import math
K = int(eval(input()))
ans = 0
for x in range(1, K + 1, 1):
for y in range(1, K + 1, 1):
ans = ans + sum(list([math.gcd(math.gcd(x, y), z) for z in range(1, K+1, 1)]))
print(ans) | p02713 |
from math import factorial
from sys import stdin
def gcd(x, y):
if x % y == 0:
return y
return gcd(y, x % y)
def main():
k = int(stdin.readline())
ans = 0
for a in range(1, k + 1):
for b in range(a, k + 1):
d = gcd(a, b)
for c in rang... | from sys import stdin
def gcd(x, y):
if x % y == 0:
return y
return gcd(y, x % y)
def fact(x):
if x == 1:
return x
return x * fact(x - 1)
def main():
k = int(stdin.readline())
ans = 0
for a in range(1, k + 1):
for b in range(a, k + 1):
... | p02713 |
import itertools
import math
n = int(eval(input()))
c = itertools.product(list(range(1, n + 1)), repeat=3)
t = 0
for l in c:
s = math.gcd(l[0], math.gcd(l[1], l[2]))
t += s
print(t)
| import itertools
import math
n = int(eval(input()))
c1 = list(range(1, n + 1))
c2 = itertools.combinations(list(range(1, n + 1)), 2)
c3 = itertools.combinations(list(range(1, n + 1)), 3)
t1 = sum(list(c1))
t2 = sum(list([math.gcd(x[0], x[1]) for x in c2])) * 6
t3 = sum(list([math.gcd(x[0], math.gcd(x[1], x[... | p02713 |
import itertools
import math
n = int(eval(input()))
c1 = list(range(1, n + 1))
c2 = itertools.combinations(list(range(1, n + 1)), 2)
c3 = itertools.combinations(list(range(1, n + 1)), 3)
t1 = sum(list(c1))
t2 = sum(list([math.gcd(x[0], x[1]) for x in c2])) * 6
t3 = sum(list([math.gcd(x[0], math.gcd(x[1], x[... | k, = (int(x) for x in input().split())
n = 3
c = {}
t = 0
for x in range(k, 0, -1):
c[x] = (k // x) ** n
c[x] = c[x] - sum(c[x * y] for y in range(2, k // x + 1))
s = c[x] * x
t += s
# t = t % 1000000007
print(t) | p02713 |
K = int(eval(input()))
total = 0
def gcd(a, b):
if(a > b):
a, b = b, a
while(b > 0):
r = a % b
a = b
b = r
return a
for a in range(1, K+1):
for b in range(1, K+1):
res = gcd(a, b)
for c in range(1, K+1):
total += gcd(res,... | K = int(eval(input()))
total = 0
def gcd(a, b):
if(a > b):
a, b = b, a
while(b > 0):
r = a % b
a = b
b = r
return a
dp = [[0 for i in range(K+1)] for j in range(K+1)]
for a in range(1, K+1):
for b in range(1, K+1):
if(dp[a][b] == 0):
... | p02713 |
K = int(eval(input()))
total = 0
def gcd(a, b):
if(a > b):
a, b = b, a
while(b > 0):
r = a % b
a = b
b = r
return a
for a in range(1, K+1):
for b in range(1, K+1):
res = gcd(a, b)
for c in range(1, K+1):
total += gcd... | K = int(eval(input()))
total = 0
def gcd(a, b):
if(a > b):
a, b = b, a
while(b > 0):
r = a % b
a = b
b = r
return a
dp = [[0 for i in range(K+1)] for j in range(K+1)]
for a in range(1, K+1):
for b in range(1, K+1):
if(dp[a][b] == 0):
... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
s = 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):
s += gcd(i,j,k)
print(s) | import math
n = int(eval(input()))
sum = 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):
sum += math.gcd(g,k)
print(sum) | p02713 |
import math
n = int(eval(input()))
sum = 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):
sum += math.gcd(g,k)
print(sum) | import math
def main():
n = int(eval(input()))
sum = 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):
sum += math.gcd(g,k)
print(sum)
if __name__ == "__main__":
main() | p02713 |
import sys
import math
readline = sys.stdin.readline
def main():
k = int(eval(input()))
sumGCD = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
sumGCD += gcd(a, b, c)
print(sumGCD)
def gcd(a, b, c):
return math.... | import sys
import math
import time
readline = sys.stdin.readline
def main():
listSum = [1, 3, 6]
k = int(eval(input()))
sumGCD = 0
for a in range(1, k + 1):
for b in range(a, k + 1):
for c in range(b, k + 1):
sumGCD += gcd(a, b, c) * listSum[len(set([a,... | p02713 |
from sys import stdin
# import sys
# A, B, C = [int(x) for x in stdin.readline().rstrip().split()]
# A,B = [int(x) for x in stdin.readline().rstrip().split()]
# U = input().split()
# A, B = [str(x) for x in stdin.readline().rstrip().split()]
import math
from functools import reduce
def gcd_list(number... | from sys import stdin
# import sys
# A, B, C = [int(x) for x in stdin.readline().rstrip().split()]
# A,B = [int(x) for x in stdin.readline().rstrip().split()]
# U = input().split()
# A, B = [str(x) for x in stdin.readline().rstrip().split()]
import math
K = int(eval(input()))
ans = 0
for a in range(1, K+... | p02713 |
k = int(eval(input()))
from math import gcd
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
ans += gcd(a, gcd(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):
ab = gcd(a, b)
for c in range(1, k+1):
ans += gcd(ab, c)
print(ans) | p02713 |
k = int(eval(input()))
from math import gcd
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
ab = gcd(a, b)
for c in range(1, k+1):
ans += gcd(ab, c)
print(ans) | k = int(eval(input()))+1
from math import gcd
ans = 0
for a in range(1, k):
for b in range(1, k):
ab = gcd(a, b)
for c in range(1, k):
ans += gcd(ab, c)
print(ans) | p02713 |
import math
K = int(eval(input()))
d = {}
def gcd(a,b,c):
st = tuple(sorted((a,b,c)))
if st not in d:
res = math.gcd(a, math.gcd(b,c))
d[st] = res
return d[st]
s=0
for i in range(1,K+1):
for j in range(1, K+1):
for l in range(1, K+1):
s += gcd(i, j,... | 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 l in range(1, K+1):
s += gcd(i, gcd(j,l))
print(s) | p02713 |
K = int(eval(input()))
def gcd(a, b):
if a < b:
a, b = b, a
while b != 0:
r = a%b
a = b
b = r
return a
count = 0
temp = list()
for n in range(1, K+1):
for m in range(1, K+1):
temp.append(gcd(n, m))
for l in range(1, K+1):
for j in range(len(temp... | K = int(eval(input()))
def gcd(a, b):
if a < b:
a, b = b, a
while b != 0:
r = a%b
a = b
b = r
return a
count = 0
temp = list()
for n in range(1, K+1):
for m in range(1, n):
temp.append(gcd(n, m))
for l in range(1, K+1):
for j in range(len(temp))... | p02713 |
import itertools
import math
from functools import reduce
def gcd(*nums):
return reduce(math.gcd, nums)
N = int(eval(input()))
l = list(range(1,N+1))
tap = list(itertools.product(l, repeat=3))
total = 0
for i in tap:
total += gcd(i[0],i[1],i[2])
print(total) | import math
ans = 0
n = int(eval(input()))
for i in range(1,n+1):
for j in range(1,n+1):
l = math.gcd(i,j)
for k in range(1,n+1):
ans += math.gcd(k,l)
print(ans)
| p02713 |
k = eval(input())
k = int(k)
ll = []
for i in range(1, k + 1):
l = []
for j in range(1, i + 1):
if i % j == 0:
l.append(j)
l.append(i // j)
if (i // j) < j:
break
ll.append(set(l))
sum_k = 0
for i in range(k):
for j in range(k):
... | k = eval(input())
k = int(k)
ll = []
for i in range(1, k + 1):
l = []
for j in range(1, i + 1):
if i % j == 0:
l.append(j)
l.append(i // j)
if (i // j) < j:
break
ll.append(set(l))
sum_k = 0
for i in range(k):
i_s = ll[i]
for... | p02713 |
# -*- coding- utf-8 -*-
# C - Sum of gcd of Triplets (Easy)
# モジュールのインポート
import math
import itertools
from functools import reduce
# 標準入力の取得
K = int(eval(input()))
# 求解処理
def gcd(*numbers):
return reduce(math.gcd, numbers)
result = 0
for a,b,c in itertools.product(list(range(1, K+1)), repeat=3):
... | # -*- coding- utf-8 -*-
# C - Sum of gcd of Triplets (Easy)
# モジュールのインポート
import math
import itertools
from functools import reduce
# 標準入力の取得
K = int(eval(input()))
# 求解処理
result = 0
for a,b in itertools.product(list(range(1, K+1)), repeat=2):
d = math.gcd(a, b)
for c in range(1, K+1):
... | p02713 |
import math
k = int(eval(input()))
total = 0
for i in range(1,k+1):
for j in range(1,k+1):
for k in range(1,k+1):
total += math.gcd(math.gcd(i, j),k)
print(total) | import math
k = int(eval(input()))
total = 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):
total += math.gcd(tmp,k)
print(total) | p02713 |
import math
rst = 0
K = int(eval(input()))
for i in range(1, K + 1):
for j in range(1, K + 1):
tmp = math.gcd(i, j)
for k in range(1, K + 1):
rst += math.gcd(k, tmp)
print(rst) | 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) | p02713 |
def pgcd(a,b):
if b==0:
return a
else:
return pgcd(b,a%b)
def tgcd(a,b,c):
return pgcd(a,pgcd(b,c))
def T(N):
s=0
for i in range(1,N+1):
for j in range(1,N+1):
for l in range(1,N+1):
s+=tgcd(i,j,l)
return s
N=int(eval(input()))
p... | import math
def tgcd(a,b,c):
return math.gcd(a,math.gcd(b,c))
def T(N):
s=0
for i in range(1,N+1):
for j in range(1,N+1):
for l in range(1,N+1):
s+=tgcd(i,j,l)
return s
N=int(eval(input()))
print((T(N)))
| p02713 |
import math
k = int(eval(input()))
ans = 0
for x in range(1,k+1):
for y in range(1,k+1):
for z in range(1,k+1):
ans += math.gcd(math.gcd(x,y),z)
print(ans)
| from math import gcd
k = int(eval(input()))
ans = 0
for x in range(1,k+1):
for y in range(1,k+1):
for z in range(1,k+1):
ans += gcd(gcd(x,y),z)
print(ans)
| p02713 |
import sys, re
import math
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
# 整数リストを連結表示 print('... | import sys, re
import math
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
# 整数リストを連結表示 print('... | p02713 |
k = int(eval(input()))
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
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(a,b,c)
print (total)
| k = int(eval(input()))
import math
#from functools import reduce
#def gcd(*numbers):
# return reduce(math.gcd, numbers)
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 |
K = int(eval(input()))
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
ans += gcd(i,j,k)
print(ans)
| K = int(eval(input()))
import math
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
a = math.gcd(i, j)
for k in range(1, K+1):
ans += math.gcd(a,k)
print(ans)
| p02713 |
# 最小公倍数(ユーグリッド互除法)
def gcd(a,b):
if b == 0:
return a
else:
return gcd( b, a % b)
K = int(eval(input())) +1
mydict = {}
# データパターンを求める式
ans = 0
for h in range(1, K):
for i in range(1, K):
for j in range(1, K):
tmp = ''.join(map(str, sorted([h,i,j])))
if tmp in myd... | # 最小公倍数(ユーグリッド互除法)
def gcd(a,b):
if b == 0:
return a
else:
return gcd( b, a % b)
K = int(eval(input())) + 1
mydict = {}
# データパターンを求める式
ans = 0
for h in range(1, K):
ans += gcd(h,gcd(h,h))
for i in range(h+1, K):
ans += (gcd(h,gcd(h,i)) * 3)
ans += (gcd(h,gcd(i,i)) * 3)
... | p02713 |
import math
K = int(eval(input()))
def gcd_(a,b,c):
t = math.gcd(a,b)
return(math.gcd(t,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_(a,b,c)
print(sum)
| import math
K = int(eval(input()))
gcd2 = [[0 for i in range(K)] for i in range(K)]
for i in range(K):
for j in range(K):
gcd2[i][j] = math.gcd(i+1,j+1)
sum = 0
for i in range(K):
for j in range(K):
for k in range(K):
sum += math.gcd(gcd2[i][j],k+1)
print(sum)
| p02713 |
import math
ans=0
K=int(eval(input()))
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
if i==1 or j==1 or k==1:
ans+=1
else:
ans+=math.gcd(i,(math.gcd(j,k)))
print(ans) | import math
ans=0
K=int(eval(input()))
for i in range(1,K+1):
for j in range(1,K+1):
num=math.gcd(i,j)
for k in range(1,K+1):
if num==1:
ans+=1
else:
ans+=math.gcd(num,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)
n = int(eval(input()))
ans = 0
t = 0
import math
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... | n = int(eval(input()))
ans = 0
t = 0
import math
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 |
import math
K=int(eval(input()))+1
goke=0
for i in range(1,K):
for j in range(1,K):
for k in range(1,K):
goke=goke+math.gcd(math.gcd(i,j),k)
print(goke) | import math
K=int(eval(input()))+1
goke=0
for i in range(1,K):
for j in range(i,K):
for k in range(j,K):
if i==j and i==k:
goke=goke+i
elif (i==j and i<k) or (i<j and j==k):
goke=goke+3*math.gcd(i,k)
else:
goke=go... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
s = 0
c = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
d = gcd(a,b,c)
s = s + d
print(s) | k = int(eval(input()))
a = [1, 9, 30, 76, 141, 267, 400, 624, 885, 1249, 1590, 2208, 2689, 3411, 4248, 5248, 6081, 7485, 8530, 10248, 11889, 13687, 15228, 17988, 20053, 22569, 25242, 28588, 31053, 35463, 38284, 42540, 46581, 50893, 55362, 61824, 65857, 71247, 76884, 84388, 89349, 97881, 103342, 111528, 120141, 128047,... | p02713 |
K = int(eval(input()))
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
g = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
g += gcd(i,j,k)
print(g)
| K = int(eval(input()))
import math
g = 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:
g += math.gcd(math.gcd(i,j),k)
elif i == j and j != k:
g += math.gcd(math.gcd(i,j),k) * 3
elif i !... | 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
from functools import reduce
k = int(eval(input()))
def gcd(*numbers):
return reduce(math.gcd,numbers)
ans = 0
for a in range(1,k+1):
ans +=gcd(a,a,a)
for a in range(1,k+1):
for b in range(1,k+1):
if a!=b:
ans += 3*gcd(a,a,b)
for a in range(1,k-1):
... | p02713 |
from sys import stdin
import math
import fractions
n = int(stdin.readline().rstrip())
cnt = 0
for i in range(n):
for j in range(n):
for k in range(n):
a = math.gcd(i+1, j+1)
b = math.gcd(a, k+1)
cnt += b
print(cnt) | from sys import stdin
import math
import fractions
n = int(stdin.readline().rstrip())
cnt = 0
for i in range(1, n+1):
for j in range(i, n+1):
for k in range(j, n+1):
a = math.gcd(i, j)
b = math.gcd(a, k) * 6
if i == j and j == k:
b = int(b/6... | p02713 |
import math
from functools import reduce
from collections import Counter
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
n = int(eval(input()))
ans = ["-".join([str(i+1), str(j+1), str(k+1)]) for i in range(n) for j in range(n) for k in ... | import math
n = int(eval(input()))
ans = [math.gcd(i+1, math.gcd(j+1, k+1)) for i in range(n) for j in range(n) for k in range(n)]
print((sum(ans))) | p02713 |
import math
K=int(eval(input()))
def gcd(a,b,c):
s=math.gcd(a,b)
s=math.gcd(s,c)
return s
t=0
for a in range(K):
for b in range(K):
for c in range(K):
t+=gcd(a+1,b+1,c+1)
print(t) | import math
K=int(eval(input()))
def gcd(a,b,c):
s=math.gcd(a,b)
s=math.gcd(s,c)
return s
t=0
for a in range(K):
for b in range(K):
s=math.gcd(a+1,b+1)
for c in range(K):
t+=math.gcd(c+1,s)
print(t) | p02713 |
import math
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+=math.gcd(math.gcd(i,j),k)
print(total) | from math import gcd
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(gcd(i,j),k)
print(total) | p02713 |
import math
K = int(eval(input()))
#K = 200
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()))
#K = 200
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 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd,numbers)
Sum=0
K=int(eval(input()))
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
Sum+=gcd(a,b,c)
print(Sum)
| import math
from math import gcd
gcd_sum=[0]*201
ans =0
k=int(eval(input()))
for i in range(1,k+1):
for j in range(1,k+1):
gcd_sum[i]+=gcd(i,j)
for a in range(1,k+1):
for b in range(1,k+1):
g=gcd(a,b)
ans+=gcd_sum[g]
print(ans) | p02713 |
def gcd(x, y):
if y==0: return x
return gcd(y, x%y)
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 += gcd(gcd(a, b), c)
print(res) | def gcd(x, y):
if y==0: return x
return gcd(y, x%y)
K = int(eval(input()))
res = 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]))==3: res += gcd(gcd(a, b), c) * 6
elif len(set([a, b, c]))==2: res += gcd(gcd(a, b), c) * 3
else: res += ... | p02713 |
import math
n = int(eval(input()))
answer = 0
for a in range(1,n+1):
for b in range(1,n+1):
for c in range(1,n+1):
answer += math.gcd(a, math.gcd(b,c))
print(answer) | import math
n = int(eval(input()))
answer = 0
for a in range(1,n+1):
for b in range(1,n+1):
t = math.gcd(a,b)
for c in range(1,n+1):
answer += math.gcd(t,c)
print(answer) | p02713 |
from os import path
import sys
if(path.exists('C:/Users/prana/Desktop/sublime/input.txt')):
sys.stdin = open("C:/Users/prana/Desktop/sublime/input.txt","r")
sys.stdout = open("C:/Users/prana/Desktop/sublime/output.txt","w")
import math
def solve():
ans = 0
a = int(eval(input()))
for i in... | from os import path
if(path.exists('C:/Users/prana/Desktop/sublime/input.txt')):
import sys
sys.stdin = open("C:/Users/prana/Desktop/sublime/input.txt","r")
sys.stdout = open("C:/Users/prana/Desktop/sublime/output.txt","w")
from math import gcd
def solve():
ans = 0
a = int(eval(input()))
... | 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):
ans_=gcd(i,j)
for l in range(1,k+1):
ans+=gcd(ans_,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):
sub = gcd(i,j)
for l in range(1,k+1):
ans += gcd(sub,l)
print(ans) | 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):
ans = gcd(a, b)
ans=gcd(ans,c)
sum+=ans
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):
for c in range(1,K+1):
sum+=gcd(gcd(a,b),c)
print(sum) | p02713 |
import math
K = int(eval(input()))
sum = 0
for a in range(K):
sum += a + 1
#print(a + 1, a + 1)
for b in range(K):
if a < b:
gcd2_sum = math.gcd(a + 1, b + 1) * 3 * 2
sum += gcd2_sum
#print(a + 1, b + 1, gcd2_sum)
for c in range(K):
... | import math
K = int(eval(input()))
sum = 0
for a in range(1,K + 1):
sum += a
#print(a, a)
for b in range(a + 1,K + 1):
gcd2_sum = math.gcd(a, b) * 3 * 2
sum += gcd2_sum
#print(a, b, gcd2_sum)
for c in range(b + 1, K + 1):
gcd3_sum = math.gcd(math.... | p02713 |
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):
gcd = []
#print(i,j,k)
for l in range(1,min(i,j,k)+1):
#print(i,j,k,l)
if i%l==0 and j%l==0 and k%l==0:
gcd.a... | K = int(eval(input()))
ans = 0
def gcd(a,b):
if b == 0:
return a
else:
return gcd(b,a%b)
for i in range(1,K+1):
for j in range(1,K+1):
gcd_ij = gcd(i,j)
for k in range(1,K+1):
ans += gcd(gcd_ij, k)
print(ans)
| p02713 |
K = int(eval(input()))
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1, K+1):
ans += gcd(i,j,k)
print(ans) | K = int(eval(input()))
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans = 0
for i in range(1,K+1):
for j in range(i,K+1):
for k in range(j, K+1):
if (i == j and j == k):
ans += i
elif (i == j or j == k):... | 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) | 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) | p02713 |
import math
ans=0
k=int(eval(input()))
for i in range(k):
for j in range(k):
for z in range(k):
ans+=math.gcd(z+1,math.gcd(i+1,j+1))
print(ans) | import math
ans=0
k=int(eval(input()))
gcdlist=[[math.inf]*(k+1) for i in range(k+1)]
for i in range(1,k+1):
for j in range(1,k+1):
gcdlist[i][j]=math.gcd(i,j)
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
ans+=gcdlist[gcdlist[a][b]][c]
print(ans) | p02713 |
def f(x,y):
if x%y==0:
return y
x,y=y,x%y
return f(x,y)
def main():
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+=f(a,f(b,c))
return sum
print((main())) | def f(x,y):
if x%y==0:
return y
x,y=y,x%y
return f(x,y)
def main():
K=int(eval(input()))
sum=0
for a in range(1,K+1):
sum+=a
for a in range(1,K):
for b in range(a+1,K+1):
sum+=6*f(a,b)
for a in range(1,K-1):
for b in range(a+1,K... | 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):
_gcd=math.gcd(math.gcd(i, j), k)
count += _gcd
print(count) | import math
K = int(eval(input()))
count = 0
for i in range(1, K+1):
for j in range(1, K+1):
x=math.gcd(i, j)
for k in range(1, K+1):
_gcd=math.gcd(x, k)
count += _gcd
print(count) | p02713 |
K = int(eval(input()))
def gcd(i, j):
if i%j==0:
return j
else:
return gcd(j, i%j)
count = 0
for i in range(1, K+1):
for j in range(1, K+1):
x=gcd(i, j)
for k in range(1, K+1):
_gcd=gcd(x, k)
count += _gcd
print(count) | K = int(eval(input()))
def gcd(i, j):
if i<j:
tmp=i
i=j
j=tmp
if i%j==0:
return j
else:
return gcd(j, i%j)
count = 0
for i in range(1, K+1):
for j in range(1, K+1):
x=gcd(i, j)
for k in range(1, K+1):
count += gcd(x, k)
print(count)
| p02713 |
#!/usr/bin/env python3
n = int(eval(input()))
ans = 0
def gcd(n, m):
a, b = n, m
if a > b:
a, b = b, a
while a != 0:
a, b = b % a, a
return b
for i in range(1, n + 1):
for j in range(1, n + 1):
for k in range(1, n + 1):
ans += gcd(k, gcd(i, j)... | #!/usr/bin/env python3
n = int(eval(input()))
ans = 0
# gcd_grid = [[0] * 201 for _ in range(201)]
def gcd(n, m):
"""if n <= 200 and m <= 200:
if gcd_grid[n][m] != 0:
return gcd_grid[n][m]"""
a, b = n, m
if a > b:
a, b = b, a
while a != 0:
a, b = b % a... | p02713 |
K = int(eval(input()))
total = 0
def gdc(x,y):
if x%y==0:
return y
return gdc(y, x%y)
for a in range(K):
for b in range(K):
for c in range(K):
tmp = [a+1,b+1,c+1]
tmp.sort()
total += gdc(c+1, gdc(b+1, a+1))
print(total) | K = int(eval(input()))
total = 0
def gdc(x,y):
if x%y==0:
return y
return gdc(y, x%y)
for a in range(K):
for b in range(a,K):
for c in range(b,K):
if a==b and b==c:
total += gdc(c+1, gdc(b+1, a+1))
elif a==b or b==c or a==c:
total += 3*gdc(c+1, gdc(b+1, a+1))
... | p02713 |
def gdc(x,y):
if x%y==0:
return y
return gdc(y, x%y)
def main():
K = int(eval(input()))
total = 0
for a in range(K):
for b in range(K):
for c in range(K):
total += gdc(c+1, gdc(b+1, a+1))
print(total)
if __name__ == '__main__':
main() | K = int(eval(input()))
total = 0
def gdc(x,y):
if x%y==0:
return y
return gdc(y, x%y)
for a in range(K):
for b in range(K):
tmp = gdc(b+1, a+1)
for c in range(K):
total += gdc(c+1, tmp)
print(total)
| p02713 |
from itertools import product
import math
n = int(eval(input()))
scores = []
for a, b, c, in list(product(list(range(1, n+1)), repeat=3)):
gcd_ab = math.gcd(a, b)
score = math.gcd(gcd_ab, c)
scores.append(score)
print((sum(scores))) | import math
n = int(eval(input()))
scores = 0
for a in range(1, n+1):
for b in range(1, n+1):
gcd_ab = math.gcd(a, b)
for c in range(1, n+1):
score = math.gcd(gcd_ab, c)
scores += score
print(scores) | p02713 |
k=int(eval(input()))
z=list(range(1,k+1))
import math
from functools import reduce
sum=0
for i in z:
for j in z:
for jj in z:
sum=sum+reduce(math.gcd,[i,j,jj])
print(sum) | from math import gcd
from functools import reduce
k=int(eval(input()))
z=list(range(1,k+1))
print((sum([gcd(i,gcd(j,k)) for i in z for j in z for k in z])))
| p02713 |
from math import gcd
from functools import reduce
k=int(eval(input()))
z=list(range(1,k+1))
print((sum([gcd(i,gcd(j,k)) for i in z for j in z for k in z])))
| from math import gcd
from functools import reduce
k=int(eval(input()))
z=list(range(1,k+1))
print((sum(gcd(i,gcd(j,k)) for i in z for j in z for k in z)))
| p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans=0
n=int(eval(input()))
for i in range(n):
for j in range(n):
for k in range(n):
if i+1==1 or j+1==1 or k+1==1:
ans += 1
else:
ans+=gcd(i+1, j+1, k+1)
print(ans)
| from math import gcd
n=int(eval(input()))
l=[gcd(i+1, gcd(j+1, k+1)) for i in range(n) for j in range(n) for k in range(n)]
print((sum(l))) | 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 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):
ans += math.gcd(i,math.gcd(j,k))*6
print(ans) | p02713 |
import math
K = int(eval(input()))
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
ans += math.gcd(math.gcd(i, j), k)
print(ans) | import math
K = int(eval(input()))
ans = 0
for i in range(1, K+1):
for j in range(i+1, K+1):
for k in range(j+1, K+1):
ans += math.gcd(i, math.gcd(j, k)) * 6
for i in range(1, K+1):
for j in range(i+1, K+1):
ans += math.gcd(i, j) * 6
for i in range(1, K+1):
ans += i
p... | p02713 |
import math
from functools import reduce
def ggcd(*numbers):
return reduce(math.gcd,numbers)
K=int(eval(input()))
sum=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
sum+=ggcd(i,j,k)
print(sum)
| import math
K=int(eval(input()))
sum=0
for i in range(1,K+1):
for j in range(1,K+1):
if math.gcd(i, j)==1:
sum+=K
else:
g=math.gcd(i, j)
for k in range(1,K+1):
sum += math.gcd(g,k)
print(sum)
| p02713 |
import sys
import itertools
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
cnt=0
k=int(eval(input()))
for i in range(1,k... | import sys
import itertools
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
k=int(eval(input()))
l=[]
l.append([1, 1])
l.append([2 ,9])
l.append([3 ,30])
l.append([4 ,76])
l.append([5 ,141])
l.append([6 ,267])
l.append([7 ,400])
l.append([8 ,624])
l.append([9 ,885])
l.append([10, 1249])
... | p02713 |
import sys
read = sys.stdin.buffer.read
#input = sys.stdin.readline
#input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(m... | import sys
read = sys.stdin.buffer.read
#input = sys.stdin.readline
#input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(m... | p02713 |
import math
from functools import reduce
N = int(eval(input()))
def gcd(*numbers):
return reduce(math.gcd, numbers)
a = 0
for i in range(1,N+1):
for j in range(1,N+1):
for k in range(1,N+1):
a+= gcd(i,j,k)
#print(i,j,k)
print(a) | K =int(eval(input()))
l = [0, 1, 9, 30, 76, 141, 267, 400, 624, 885, 1249, 1590, 2208, 2689, 3411, 4248, 5248, 6081, 7485, 8530, 10248, 11889, 13687, 15228, 17988, 20053, 22569, 25242, 28588, 31053, 35463, 38284, 42540, 46581, 50893, 55362, 61824, 65857, 71247, 76884, 84388, 89349, 97881, 103342, 111528, 120141, 12804... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
sumGCD = K * K * K
for a in range(2, K + 1, 1):
for b in range(2, K + 1, 1):
for c in range(2, K + 1, 1):
arr = [a, b, c]
gcdNum = gcd(*arr)
... | import math
K = int(eval(input()))
sumGCD = K * K * K
for a in range(2, K + 1, 1):
for b in range(2, K + 1, 1):
for c in range(2, K + 1, 1):
arr = [a, b, c]
gcdNum = math.gcd(math.gcd(a, b), c)
# if gcdNum != 1:
# print(arr)
# print(gcd... | p02713 |
#C
#入力
K=int(eval(input()))+1
#デバッグ用
def pront(*n):
if debug==1:
print(n)
debug=1#0:本番,1:デバッグ
#処理
import math as m
Z=[ [ [-1 for i in range(K)] for j in range(K)] for l in range(K)]
def C_1(i,j,k):
xx=[i,j,k]
xx.sort()
if Z[xx[0]][xx[1]][xx[2]]!=-1:
retur... | #C
#入力
K=int(eval(input()))
#デバッグ用
def pront(*n):
if debug==1:
print(n)
debug=1#0:本番,1:デバッグ
#処理
import math as m
Z=[ [-1 for i in range(K+1)] for j in range(K+1)]
def C_1(i,j):
if Z[i][j]!=-1:
return Z[i][j]
else:
x=m.gcd(i,j)
Z[i][j]=x
... | p02713 |
import itertools
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
lis = list(itertools.product(list(range(1, K+1)), repeat=3))
ans=0
for x, y, z in lis:
ans += gcd(x, y, z)
print(ans)
|
import itertools
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
lis = list(itertools.combinations_with_replacement(list(range(1, K+1)), 3))
ans=0
for i, j, k in lis:
if i==j and j==k and i==k:
ans+=gcd(i, j, k)
... | p02713 |
from itertools import product
#最大公約数
def gcd(a, b):
while b != 0:
a, b = b, a % b
return a
k = int(eval(input()))
ans = 0
for i in product(list(range(1, k+1)), repeat=3):
a, b, c = i
res = gcd(a, b)
res = gcd(res, c)
ans += res
print(ans) | from math import gcd
k = int(eval(input()))
res = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
g1 = gcd(a, b)
for c in range(1, k + 1):
g2 = gcd(g1, c)
res += g2
print(res) | p02713 |
k = int(eval(input()))
import math
from functools import reduce
ans = 0
def gcd(*numbers):
return reduce(math.gcd, numbers)
for i in range(1,k+1):
for j in range(1,k+1):
for s in range(1,k+1):
ans += gcd(i,j,s)
print(ans) | from math import gcd
n = int(eval(input()))
ans = 0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
ans += gcd(gcd(i,j),k)
print(ans)
| p02713 |
def GCD(a, b):
r = a % b
while(r!=0):
a = b
b = r
r = a % b
return b
def main():
ans = 0
K = int(eval(input()))
for i in range(1, K+1):
for j in range(1, K+1):
if(i < j):
gcd1 = GCD(j, i)
else:
... | def GCD(a, b):
r = a % b
while(r!=0):
a = b
b = r
r = a % b
return b
def main():
ans = 0
K = int(eval(input()))
for i in range(1, K+1):
for j in range(1, K+1):
if(i == 1 or j == 1):
gcd1 = 1
elif(i <... | p02713 |
import math
from functools import reduce
# def gcd(*numbers):
# return reduce(math.gcd, numbers)
k = int(eval(input()))
res = 0
for c in range(1,k+1):
for b in range(1,k+1):
for a in range(1,k+1):
# res += gcd(a,b,c)
gcd1 = math.gcd(a,b)
gcd2 = math.gcd... | import math
from functools import reduce
# def gcd(*numbers):
# return reduce(math.gcd, numbers)
k = int(eval(input()))
res = 0
for c in range(1,k+1):
for b in range(1,k+1):
gcd_cd = math.gcd(c,b)
for a in range(1,k+1):
# res += gcd(a,b,c)
gcd_abc = math.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 x in range(1,k+1):
ans +=math.gcd(i,math.gcd(j,x))
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 x in range(1,k+1):
ans +=math.gcd(tmp,x)
print(ans)
| p02713 |
import math
from functools import reduce
k = int(eval(input()))
ans = 0
def gcd(*numbers):
return reduce(math.gcd, numbers)
for i in range(1, k+1):
for j in range(1, k + 1):
for m in range(1, k + 1):
ans += gcd(i, j, m)
print(ans)
| import math
k = int(eval(input()))
ans = 0
ans1 = 0
for i in range(1, k + 1):
for j in range(1, k + 1):
ans1 = math.gcd(i, j)
for m in range(1, k + 1):
ans += math.gcd(ans1, m)
print(ans)
| p02713 |
from functools import reduce
from math import gcd
N = int(eval(input()))
print((sum([reduce(gcd, [i, j, k]) for i in range(1, N+1) for j in range(1, N+1) for k in range(1, N+1)]))) | # from functools import reduce
# from math import gcd
import math
N = int(eval(input()))
result = 0
# print(sum([reduce(gcd, [i, j, k]) for i in range(1, N+1) for j in range(1, N+1) for k in range(1, N+1)]))
for i in range(1, N+1):
for j in range(1, N+1):
tmp = math.gcd(i, j)
for k in ran... | p02713 |
import math
k = int(eval(input()))
cache = {}
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
key = tuple(sorted([a,b,c]))
x = cache.get(key, math.gcd(math.gcd(a, b), c))
ans = ans + x
cache[key] = x
print(ans) | import itertools
import math
k = int(eval(input()))
x = 0
for v in itertools.combinations_with_replacement(list(range(1, k+1)), 3):
a, b, c = v
x = x + math.gcd(math.gcd(a,b), c)
y = 0
for v in itertools.combinations(list(range(1, k+1)), 3):
a, b, c = v
y = y + math.gcd(math.gcd(a,b), c)
... | p02713 |
import itertools
import math
k = int(eval(input()))
x = 0
for v in itertools.combinations_with_replacement(list(range(1, k+1)), 3):
a, b, c = v
x = x + math.gcd(math.gcd(a,b), c)
y = 0
for v in itertools.combinations(list(range(1, k+1)), 3):
a, b, c = v
y = y + math.gcd(math.gcd(a,b), c)
... | import math
k = int(eval(input()))
cache = {}
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 + cache.get( (a,b,c), math.gcd(math.gcd(a, b), c))
print(ans) | p02713 |
import math
k = int(eval(input()))
ans = 0
for i in range(1, k + 1):
for x in range(1, k + 1):
for z in range(1, k + 1):
ans += math.gcd(i, math.gcd(x, z))
print(ans) | from math import gcd
k = int(eval(input()))
ans = 0
for i in range(1, k + 1):
for x in range(1, k + 1):
gcdix = gcd(i, x)
for z in range(1, k + 1):
ans += gcd(z, gcdix)
print(ans) | p02713 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.