input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from functools import reduce
import math
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
gcdsum = 0
for a in range(1, K + 1):
for b in range(1, K + 1):
for c in range(1, K + 1):
#print(gcd(a, b, c))
gcdsum += int(gcd(a, b, c))
print(g... | from functools import reduce
import math
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
gcdsum = K*K*K
gcd_ab = []
ab_list = []
for a in range(1, K + 1):
for b in range(1, K + 1):
#print(str(gcd(a, b))+', a:'+str(a)+', b:'+str(b))
if gcd(a, b) != 1:... | p02713 |
K = int(eval(input()))
def gcd(a,b):
if a % b == 0:
return b
return gcd(b, a%b)
ans = 0
for a in range(1,K+1):
for b in range(1, K+1):
ab = gcd(a,b)
for c in range(1, K+1):
ans += gcd(ab, c)
print(ans)
| K = int(eval(input()))
def gcd(a,b):
if a % b == 0:
return b
return gcd(b, a%b)
dec = {}
for a in range(1,K+1):
for b in range(1, K+1):
if gcd(a,b) not in dec:
dec[gcd(a,b)] = 1
else:
dec[gcd(a,b)] += 1
ans = 0
for c in range(1, K+1):
for... | p02713 |
from math import gcd
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
for k in range(1, n + 1):
ans += gcd(gcd(i, j), k)
print(ans)
| from math import gcd
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
for j in range(i, n + 1):
for k in range(j, n + 1):
if i == j == k:
ans += gcd(gcd(i, j), k)
elif i == j or i == k or j == k:
ans += gcd(gcd(i, j), k) * 3
... | p02713 |
import math
k = int(eval(input()))
sum = 0
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
sum+=math.gcd(math.gcd(i,j),l)
print(sum) | k = int(eval(input()))
arr = [0]*(k+1)
count = [0]*(k+1)
sum = 0
n = 3
for i in range(k,1,-1):
x = k//i
p = int(pow(x,n))
arr[i]=i*p
count[i]=p
for j in range(x-1):
arr[i]-=i*count[i*(j+2)]
count[i]-=count[i*(j+2)]
csum = 0
for i in range(2,k+1):
sum+=arr[i]
... | p02713 |
k = int(eval(input()))
#k = 3
class GCD:
def __init__(self):
self.cache = {}
self.cache3 = {}
def gcd2(self, a, b):
a, b = sorted([a, b], reverse=True)
if (a in self.cache and b in self.cache[a]):
return self.cache[a][b]
if (a % b == 0):
... | k = int(eval(input()))
#k = 200
class GCD:
def __init__(self):
self.cache = {}
self.cache3 = {}
def gcd2(self, a, b):
a, b = sorted([a, b], reverse=True)
if (a in self.cache and b in self.cache[a]):
return self.cache[a][b]
if (a % b == 0):
... | p02713 |
import math
K=int(eval(input()))
ans=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
ans += math.gcd(math.gcd(i,j),k)
print(ans) | from math import gcd
K=int(eval(input()))
ans=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
ans += gcd(gcd(i,j),k)
print(ans) | p02713 |
import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from decimal import *
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
INF = float('inf') #無限大
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b... | import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from decimal import *
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
INF = float('inf') #無限大
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b... | p02713 |
from math import gcd
k = int(eval(input()))
ans = 0
for i in range(k):
for j in range(k):
for ii in range(k):
ans += gcd(i+1,gcd(j+1,ii+1))
print(ans)
| from math import gcd
def main():
k = int(eval(input()))
ans = 0
for i in range(k):
for j in range(k):
for ii in range(k):
ans += gcd(i+1,gcd(j+1,ii+1))
print(ans)
if __name__ == '__main__':
main()
| p02713 |
r=list(range(1,int(eval(input()))+1))
import math
from functools import reduce
def g(*n):return reduce(math.gcd, n)
print((sum(g(a,b,c) for a in r for b in r for c in r))) | r=list(range(1,int(eval(input()))+1))
from math import gcd
print((sum(gcd(gcd(a,b),c) for a in r for b in r for c in r))) | p02713 |
import math
from functools import reduce
k = int(eval(input()))
def gcd(*numbers):
return reduce(math.gcd, numbers)
k += 1
ans = 0
for i in range(1,k):
for j in range(1,k):
for h in range(1,k):
#print(i,j,h)
ans += gcd(i,j,h)
print(ans)
| import math
from functools import reduce
k = int(eval(input()))
def gcd(*numbers):
return reduce(math.gcd, numbers)
k += 1
ans = 0
for i in range(1,k):
for j in range(i,k):
#print(i,j)
if i == j:
ans += gcd(i,j)
else:
ans += gcd(i,j)*6
fo... | p02713 |
import math, itertools
from functools import reduce
def gcd_list(numbers):
return(reduce(math.gcd,numbers))
k=int(eval(input()))
ans=0
for numbers in itertools.product(list(range(1,k+1)),repeat=3):
ans+=gcd_list(numbers)
print(ans) | import math, itertools
from functools import reduce
def gcd_list(numbers):
return(reduce(math.gcd,numbers))
k=int(eval(input()))
ans=0
for numbers in itertools.combinations_with_replacement(list(range(1,k+1)),3):
a,b,c=numbers
if a==b==c:
ans+=gcd_list(numbers)
elif a!=b and a!=c and b... | p02713 |
k = int(eval(input()))
def gcd1 (a, b):
while True:
if (a < b):
a, b = b, a
c = a%b
if (c == 0):
return (b)
else:
a = b
b = c
def gcd2 (a, b, c):
tmp = gcd1(a, b)
ans = gcd1(tmp, c)
return (ans)
count = 0
... | k = int(eval(input()))
def gcd1 (a, b):
while True:
if (a < b):
a, b = b, a
c = a%b
if (c == 0):
return (b)
else:
a = b
b = c
def gcd2 (a, b, c):
tmp = gcd1(a, b)
ans = gcd1(tmp, c)
return (ans)
count = 0
... | p02713 |
import math
K = int(eval(input()))
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
for n in range(1,K+1):
tmp = math.gcd(i,j)
ans += math.gcd(tmp,n)
print(ans) | import math
K = int(eval(input()))
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
tmp = math.gcd(i,j)
for n in range(1,K+1):
ans += math.gcd(tmp,n)
print(ans) | p02713 |
import math
import fractions
k = eval(input())
sum = 0
for a in range(int(k)):
for b in range(int(k)):
x = math.gcd(a+1, b+1)
for c in range(int(k)):
y = math.gcd(x, c+1)
sum += y
print(sum)
| import math
k = int(eval(input()))
total = 0
for a in range(1, k+1):
for b in range(1, k+1):
g1 = math.gcd(a, b)
for c in range(1, k+1):
g2 = math.gcd(g1, c)
total += g2
print(total)
| p02713 |
# 3重ループでテスト
from functools import reduce
k = int(eval(input()))
def gcd(a, b):
# 最大公約数
while b:
a, b = b, a % b
return a
def gcds(*nums):
return reduce(gcd, nums)
res = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
res += gcds(a, b, c)... | from math import gcd
k = int(eval(input()))
gcd_sum = [0] * 201
res = 0
for i in range(1, k + 1):
for j in range(1, k + 1):
gcd_sum[i] += gcd(i, j)
for a in range(1, k + 1):
for b in range(1, k + 1):
g = gcd(a, b)
res += gcd_sum[g]
print(res) | p02713 |
k = int(eval(input()))
sum = 0
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
for a in range(1, k + 1):
for b in range(1, k + 1):
ab_gcd = gcd(a, b)
for c in range(1, k + 1):
abc_gcd = gcd(c, ab_gcd)
sum += abc_gcd
... | import math
K = int(eval(input()))
ans = 0
for a in range(1, K+1):
for b in range(1, K + 1):
ab_gcd = math.gcd(a, b)
for c in range(1, K + 1):
ans += math.gcd(ab_gcd, c)
print(ans)
| p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
sum = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
sum += gcd(a,b,c)
print(sum) | import math
k = int(eval(input()))
s = 0
i = 0
d = [0]*k*k
for a in range(1,k+1):
for b in range(1,k+1):
d[i] = math.gcd(a,b)
i+=1
for c in range(1,k+1):
s += sum([math.gcd(x,c) for x in d])
print(s) | p02713 |
k=int(eval(input()))
from math import gcd
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
for m in range(1,k+1):
temp=gcd(i,j)
ans=ans+gcd(temp,m)
print(ans)
| k=int(eval(input()))
from math import gcd
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
temp=gcd(i,j)
for m in range(1,k+1):
ans=ans+gcd(temp,m)
print(ans)
| p02713 |
import math
from functools import reduce
N = int(eval(input()))
s = 0
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
for i in range(1, N+1):
for j in range(1, N+1):
for k in range(1, N+1):
s += gcd(i, j, k)
... | '''
import math
from functools import reduce
N = int(input())
s = 0
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
for i in range(1, N+1):
for j in range(1, N+1):
for k in range(1, N+1):
s += gcd(i, j, k)
... | p02713 |
import math
K=int(eval(input()))
ans=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
ans+=math.gcd(math.gcd(i,j),k)
print(ans)
| import math
N=int(eval(input()))
ans=0
for i in range(1,N+1):
for j in range(i,N+1):
for k in range(j,N+1):
if i==j and j==k:
ans+=i
elif i<j and j<k:
ans+=6*math.gcd(i,math.gcd(j,k))
else:
ans+=3*math.gcd(i,mat... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k=int(eval(input()))
sum = 0
for a in range(k+1):
for b in range(k+1):
for c in range(k+1):
if a != 0 and b != 0 and c != 0:
sum = sum + gcd(a,b,c)
print(sum) | import math
from functools import reduce
k=int(eval(input()))
sum = 0
for a in range(k+1):
for b in range(k+1):
tmp = math.gcd(a,b)
for c in range(k+1):
if a != 0 and b != 0 and c != 0:
sum = sum + math.gcd(tmp,c)
print(sum) | p02713 |
import sys
import os
import math
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambd... | import sys
import os
import math
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambd... | p02713 |
import math
def gcd_arg3(a,b,c):
return math.gcd(a,math.gcd(b,c))
k = int(eval(input()))
sum = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
sum += gcd_arg3(a,b,c)
print(sum) | import math
def gcd_arg3(a,b,c):
return math.gcd(a,math.gcd(b,c))
k = int(eval(input()))
sum = 0
for a in range(1,k+1):
for b in range(1,k+1):
gcd_a_b = math.gcd(a,b)
for c in range(1,k+1):
sum += math.gcd(gcd_a_b,c)
print(sum) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
s = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
s += gcd(a,b,c)
print(s)
| from math import gcd
k = int(eval(input()))
count = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
count += gcd(gcd(a,b),c)
print(count) | p02713 |
import math
ans=0
i = int(eval(input()))
for a in range(1,i+1):
for b in range(1,i+1):
for c in range(1,i+1):
n=math.gcd(math.gcd(a,b),c)
ans+=n
print(ans)
| from math import gcd
ans=0
i = int(eval(input()))
for a in range(1,i+1):
for b in range(1,i+1):
for c in range(1,i+1):
n=gcd(gcd(a,b),c)
ans+=n
print(ans)
| p02713 |
from math import gcd
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
K = int(readline())
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
ans += gcd(gcd(i, j), k)
... | from math import gcd
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
K = int(readline())
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
ans += gcd(gcd(i, j), k)
print(ans) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
ans = 0
for i in range(K):
for j in range(K):
for k in range(K):
ans += gcd(i+1, j+1, k+1)
print(ans) | import math
from functools import reduce
import itertools
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
l = list(range(1, K + 1))
ans = K * (K + 1) // 2
for i in itertools.combinations(l, 2):
ans += 3*(gcd(i[0], i[0], i[1])+gcd(i[0], i[1], i[1]))
for i in itertools... | p02713 |
import math
ans = 0
c = 0
K = int(eval(input()))
for i in range(1,K+1):
for j in range(1,K+1):
for m in range(1,K+1):
c = math.gcd(i,j)
ans += math.gcd(c,m)
print(ans)
| import math
ans = 0
c = 0
K = int(eval(input()))
for i in range(1,K+1):
for j in range(1,K+1):
c = math.gcd(i,j)
for m in range(1,K+1):
ans += math.gcd(c,m)
print(ans)
| p02713 |
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(eval(input()))
def S(): return eval(input())... | from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(input())
def S(): return input()
def MI... | p02713 |
import math
rst = 0
K = int(eval(input()))
for i in range(1, K + 1):
for j in range(1, K + 1):
tmp = math.gcd(i, j)
for k in range(1, K + 1):
rst += math.gcd(k, tmp)
print(rst)
|
from math import gcd as g
k = int(eval(input()))
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
temp = g(a, b)
for c in range(1, k+1):
ans += g(temp, c)
print(ans)
| p02713 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
... | p02713 |
import functools
def euclid(a, b):
while b:
a, b = b, a % b
return a
def gcd(nums):
return functools.reduce(euclid, nums)
K = int(eval(input()))
sum_gcd = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
for k in range(1, K + 1):
sum_gcd += gcd([i... | def gcd(a, b):
while b:
a, b = b, a % b
return a
K = int(eval(input()))
sum_gcd = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
g = gcd(i, j)
for k in range(1, K + 1):
sum_gcd += gcd(g, k)
print(sum_gcd) | p02713 |
import math
from functools import reduce
K = int(eval(input()))
sum = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
nums = [a, b, c]
gcd = reduce(math.gcd, nums)
sum += gcd
print(sum) | from math import gcd
K = int(eval(input()))
sum = 0
for a in range(1, K+1):
for b in range(1, K+1):
p = gcd(a, b)
for c in range(1, K+1):
sum += gcd(p, c)
print(sum) | p02713 |
k = int(eval(input()))
sum = 0
def gcd(x, y): # ユークリッドの互除法
if y > x:
y,x = x,y
while y > 0:
r = x%y
x = y
y = r
return x
import math
for i in range(1,k+1):
for m in range(1,k+1):
sub = gcd(i,m)
for l in range(1,k+1):
sum ... | k = int(eval(input()))
sum = 0
def gcd(x, y): # ユークリッドの互除法
if y > x:
y,x = x,y
while y > 0:
r = x%y
x = y
y = r
return x
for i in range(1,k+1):
for m in range(1,k+1):
for l in range(1,k+1):
sum += gcd(gcd(i,m),l)
print(sum)
| p02713 |
import math
K = int(eval(input()))
ans = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
ans += math.gcd(a, math.gcd(b,c))
print(ans)
| import math
K = int(eval(input()))
ans = 0
for a in range(1,K+1):
for b in range(1,K+1):
num = math.gcd(a,b)
for c in range(1,K+1):
ans += math.gcd(num,c)
print(ans)
| p02713 |
K = int(eval(input()))
def gcd(a,b):
if b>a:
a,b = b,a
while b:
a,b = b,a%b
return a
def gcdl(a,b,c):
return gcd(gcd(a,b),c)
result = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
result += gcdl(a,b,c)
print(result)
| K = list(range(1,int(eval(input()))+1))
import itertools
def gcd(a,b):
if b>a:
a,b = b,a
while b:
a,b = b,a%b
return a
result = 0
if len(K)>=3:
for i in list(itertools.combinations(K,3)):
result += gcd(gcd(i[0],i[1]),i[2])*6
if len(K)>=2:
for i in lis... | p02713 |
from collections import defaultdict
import math
k= int(eval(input()))
ans = 0
dic = defaultdict(int)
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
if (a,b) not in dic:
x = math.gcd(a,b)
dic[(a,b)] = x
x = dic[(a,b)]
... | import math
k= int(eval(input()))
ans = 0
for a in range(1,k+1):
for b in range(1,k+1):
x = math.gcd(a,b)
for c in range(1,k+1):
ans += math.gcd(x,c)
print(ans)
| p02713 |
#162C
#Sum of gcd of Tuples (Easy)
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd,numbers)
k=int(eval(input()))+1
ans=0
for a in range(1,k):
for b in range(1,k):
for c in range(1,k):
ans+=gcd(a,b,c)
print(ans) | #162C
#Sum of gcd of Tuples (Easy)
import math
k=int(eval(input()))+1
ans=0
for a in range(1,k):
for b in range(1,k):
g=math.gcd(a,b)
for c in range(1,k):
ans+=math.gcd(g,c)
print(ans) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
sum_ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
gcd_abc = gcd(a, b, c)
sum_ans += gcd_abc
print(sum_ans) | import math
k = int(eval(input()))
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
gcd_ab = math.gcd(a, b)
for c in range(1, k+1):
ans += math.gcd(gcd_ab, c)
print(ans) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
SUM = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
SUM += gcd(i,j,k)
print(SUM) | import math
K = int(eval(input()))
SUM = 0
gcdlist = []
for i in range(1,K+1):
for j in range(i,K+1):
for k in range(j,K+1):
gcd1 = math.gcd(i,j)
gcd2 = math.gcd(gcd1,k)
if i == j and j== k:
SUM += gcd2
elif i == j or j == k or k =... | p02713 |
import math
sum = 0
K = int(eval(input()))
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
sum += math.gcd(math.gcd(a, b), c)
print(sum) | import math
sum = 0
K = int(eval(input()))
for a in range(1, K+1):
for b in range(1, K+1):
x = math.gcd(a, b)
for c in range(1, K+1):
sum += math.gcd(x, c)
print(sum) | p02713 |
import math
ans = 0
n = int(eval(input()))
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
num = math.gcd(i,j)
num = math.gcd(num,k)
ans += num
print(ans) | import math
n = int(eval(input()))
lis = [[0] * n for i in range(n)]
for i in range(n):
for j in range(n):
lis[i][j] = math.gcd(i+1,j+1)
ans = 0
for i in range(n):
for j in range(n):
for k in range(n):
ans += lis[i][lis[k][j]-1]
print(ans)
| p02713 |
import math
from functools import reduce
k = int(eval(input()))
ans = 0
def gcd(*numbers):
return reduce(math.gcd, numbers)
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
ans += gcd(i,j,l)
print(ans) | import math
k = int(eval(input()))
ans = 0
for i in range(1,k+1):
for j in range(1,k+1):
a = math.gcd(i, j)
for l in range(1,k+1):
ans += math.gcd(a,l)
print(ans) | p02713 |
import math
from functools import reduce
from itertools import product
x = int(eval(input()))
print((sum([reduce(math.gcd, i) for i in product(list(range(1, x+1)), repeat=3)]))) | import math
from itertools import product
x = int(eval(input()))
s = 0
for a, b, c in product(list(range(1, x+1)), repeat=3):
s += math.gcd(math.gcd(a, b), c)
print(s) | p02713 |
import math
k=int(eval(input()))
tot=0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
tot+=math.gcd(a,math.gcd(b,c))
print(tot) | import math
k=int(eval(input()))
tot=k*(k+1)//2
for i in range(1,k+1):
for j in range(i+1,k+1):
tot+=math.gcd(i,j)*6
for i in range(1,k+1):
for j in range(i+1,k+1):
for l in range(j+1,k+1):
tot+=math.gcd(i,math.gcd(j,l))*6
print(tot) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
gcd_sum = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
gcd_sum += gcd(a, b, c)
print(gcd_sum) | from math import gcd
k = int(eval(input()))
ans = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
gcd_ab = gcd(a, b)
for c in range(1, k + 1):
ans += gcd(gcd_ab, c)
print(ans) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
hoge = []
for i in range(1, K + 1):
for j in range(1, K + 1):
for k in range(1, K + 1):
hoge.append(gcd(i, j, k))
print((sum(hoge)))
| import math
from functools import reduce
K = int(eval(input()))
sum = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
for k in range(1, K + 1):
sum += reduce(math.gcd, (i, j, k))
print(sum) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
ans = 0
for i in range(1, k+1):
for j in range(1, k+1):
for l in range(1, k+1):
ans += gcd(i, j, l)
print(ans) | import math
k = int(eval(input()))
ans = 0
chk_list = []
for i in range(1, k+1):
for j in range(1, k+1):
chk = math.gcd(i, j)
chk_list.append(chk)
for l in range(1, k+1):
for h in chk_list:
ans += math.gcd(l, h)
print(ans) | p02713 |
K = int(eval(input()))
import math
from functools import reduce
def gcd(numbers):
return reduce(math.gcd,numbers)
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
ans += gcd([i,j,k])
print(ans) | K = int(eval(input()))
def gcd(a,b):#a>b
if b==0:
return a
else:
return gcd(b,a%b)
gcdtable = [[1 for i in range(K+1)] for j in range(K+1)]
for i in range(1,K+1):
for j in range(1,K+1):
gcdtable[i][j] = gcd(i,j)
ans = 0
for i in range(1,K+1):
for j in range(1,K+... | p02713 |
import math
k = int(eval(input()))
ans = 0
for q in range(1,k+1):
for r in range(1,k+1):
for s in range(1,k+1):
ans += math.gcd(q,math.gcd(r,s))
print(ans)
| import math
k = int(eval(input()))
ans = 0
for q in range(1,k+1):
for r in range(1,k+1):
x = math.gcd(q,r)
for s in range(1,k+1):
ans += math.gcd(x,s)
print(ans)
| p02713 |
def gcd(a,b):
while b!=0:
a, b = b,a%b
return a
n = int(eval(input()))
ans = 0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
ans+=gcd(gcd(i,j),k)
print(ans) | from math import gcd
n = int(eval(input()))
ans = 0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
ans+=gcd(gcd(i,j),k)
print(ans) | p02713 |
K=int(eval(input()))
def gcd(a,b):
if b!=0:
return (gcd(b,a%b))
else:
return (a)
def GCD(a,b,c):
return (gcd(gcd(a,b),gcd(a,c)))
s=0
for i in range(1,K+1):
for j in range(i,K+1):
for k in range(j,K+1):
if i==j and j==k:
s=s+GCD(i,j,k)
... | K=int(eval(input()))
import sys
def gcd(a,b):
if b!=0:
return (gcd(b,a%b))
else:
return (a)
def GCD(a,b,c):
k=gcd(a,b)
l=gcd(a,c)
return (gcd(k,l))
s=0
if K==198:
print((10493367))
sys.exit()
elif K==199:
print((10611772))
sys.exit()
elif K==200:... | p02713 |
K=int(eval(input()))
import sys
def gcd(a,b):
if b!=0:
return (gcd(b,a%b))
else:
return (a)
def GCD(a,b,c):
k=gcd(a,b)
l=gcd(a,c)
return (gcd(k,l))
s=0
if K==198:
print((10493367))
sys.exit()
elif K==199:
print((10611772))
sys.exit()
elif K==200:... | K=int(eval(input()))
import sys
def gcd(a,b):
if b!=0:
return (gcd(b,a%b))
else:
return (a)
def GCD(a,b,c):
k=gcd(a,b)
return (gcd(k,c))
s=0
if K==198:
print((10493367))
sys.exit()
elif K==199:
print((10611772))
sys.exit()
else:
for i in range(... | p02713 |
K=int(eval(input()))
import sys
def gcd(a,b):
if b!=0:
return (gcd(b,a%b))
else:
return (a)
def GCD(a,b,c):
k=gcd(a,b)
return (gcd(k,c))
s=0
if K==198:
print((10493367))
sys.exit()
elif K==199:
print((10611772))
sys.exit()
else:
for i in range(... | K=int(eval(input()))
import sys
def gcd(a,b):
if b!=0:
return (gcd(b,a%b))
else:
return (a)
s=0
for i in range(1,K+1):
for j in range(i,K+1):
m=gcd(i,j)
for k in range(j,K+1):
if i==j and j==k:
s=s+gcd(m,k)
elif i==j a... | p02713 |
K=int(eval(input()))
def gcd(a,b):
if b!=0:
return (gcd(b,a%b))
else:
return (a)
s=0
for i in range(1,K+1):
for j in range(1,K+1):
m=gcd(i,j)
for k in range(1,K+1):
s=s+gcd(m,k)
print (s) | K=int(eval(input()))
def gcd(a,b):
if b!=0:
return (gcd(b,a%b))
else:
return (a)
s=0
for i in range(1,K+1):
for j in range(i,K+1):
m=gcd(i,j)
for k in range(j,K+1):
if i==j and j==k:
s=s+gcd(m,k)
elif i==j and j!=k:
... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
N = int(eval(input()))
g=0
for a in range(N):
for b in range(N):
for c in range(N):
g = g + gcd((a+1),(b+1),(c+1))
print(g) | import math
N = int(eval(input()))
g=0
for a in range(N):
for b in range(N):
g_1=math.gcd((a+1),(b+1))
for c in range(N):
g = g + math.gcd(g_1,(c+1))
print(g) | p02713 |
from math import gcd
k = int(eval(input()))
sum_ = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
gcd_ab = gcd(a, b)
for c in range(1, k + 1):
sum_ += gcd(c, gcd_ab)
print(sum_) | k = int(eval(input()))
count = [pow(k // max(i, 1), 3) for i in range(k + 1)]
for i in range(k, 0, -1):
for j in range(2 * i, k + 1, i):
count[i] -= count[j]
sum_ = 0
for i in range(k + 1):
sum_ += i * count[i]
print(sum_) | p02713 |
import math
import itertools
N=int(eval(input()))
GCD=[]
GCD1=[]
for i in range (1,N+1):
GCD.append(i)
for i in itertools.product(GCD,repeat=3):
GCD1.append(math.gcd(math.gcd(i[0],i[1]),i[2]))
print((sum(GCD1))) | import math
import itertools
GCD_over_150=[4548003,4616104,4718640,4812789,4918561,5003286,5131848,5205481,5299011,5392008,5521384,5610705,5739009,5818390,5930196,6052893,6156139,6239472,6402720,6493681,6623853,6741078,6864016,6953457,7094451,7215016,7359936,7475145,7593865,7689630,7886244,7984165,8130747,8253888,840... | p02713 |
import math
from functools import reduce
n = int(eval(input()))
ans = 0
for i in range(1, n+1, 1):
for j in range(1, n+1, 1):
for k in range(1, n+1, 1):
ans += reduce(math.gcd, (i, j, k))
print(ans) | # gcdをmathからimport
from math import gcd
n = int(eval(input()))
ans = 0
for i in range(1, n+1):
for j in range(1, n+1):
for k in range(1, n+1):
# gcd(i,j)とkのgcdを計算
# 1番小さい数字が制限になる
ans += gcd(gcd(i, j), k)
print(ans) | p02713 |
n = int(eval(input()))
mem={}
def gcd(a,b,c):
key=tuple(sorted((a,b,c)))
if key in mem:
return mem[key]
ret=1
for i in range(2, min(a,b,c)+1):
if a%i==0 and b%i==0 and c%i==0:
ret=i
mem[key]=ret
return ret
ans=0
for i in range(1, n+1):
for ... | from math import gcd
k = int(eval(input()))+1
ans = 0
for i in range(1,k):
for j in range(1,k):
for l in range(1,k):
ans += gcd(gcd(i,j),l)
print(ans) | p02713 |
import math as np
K=int(eval(input()))
P=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
l=np.gcd(i,j)
m=np.gcd(l,k)
P=m+P
print(P) | import math as np
K=int(eval(input()))
P=0
for i in range(1,K+1):
for j in range(1,K+1):
l=np.gcd(i,j)
for k in range(1,K+1):
m=np.gcd(l,k)
P=m+P
print(P)
| p02713 |
import math
from functools import reduce
K = int(eval(input()))
total = 0
def gcd_list(*numbers):
return reduce(math.gcd, numbers)
for i in range(1, K+1):
for j in range(1, i+1):
for k in range(1, j+1):
s = [i, j, k]
if i == j == k:
total += g... | import math
K = int(eval(input()))
ans = 0
tmp = {}
for i in range(201):
tmp[i] = 0
for i in range(1, K+1):
for j in range(1, K+1):
tmp[math.gcd(i, j)] += 1
for k in range(1, K+1):
for key in list(tmp.keys()):
ans += math.gcd(key, k) * tmp[key]
print(ans)
| p02713 |
import math
k = int(eval(input()))
b = []
for i in range(1,k+1):
for j in range(1,k+1):
ij = math.gcd(i,j)
for m in range(1,k+1):
b.append(math.gcd(ij,m))
print((sum(b)))
| import math
k = int(eval(input()))
b = 0
for i in range(1,k+1):
for j in range(1,k+1):
ij = math.gcd(i,j)
for m in range(1,k+1):
b += math.gcd(ij,m)
print(b)
| p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
ans = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
ans += gcd(a,b,c)
print(ans) | from math import gcd
K = int(eval(input()))
ans = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
ans += gcd(gcd(b,c),a)
print(ans) | p02713 |
import math
from functools import reduce
K = int(eval(input()))
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
ans += gcd(i, j, k)
print(ans) | import math
from functools import reduce
K = int(eval(input()))
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans = 0
for i in range(1, K+1):
for j in range(i, K+1):
for k in range(j, K+1):
if i == k:
ans += gcd(i, j, k)
elif i == j or j == k:
ans += 3 * g... | p02713 |
import math
K = int(eval(input()))
sum = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
for k in range(1, K + 1):
gcd1 = math.gcd(j, k)
gcd2 = math.gcd(i, gcd1)
sum += gcd2
print(sum) | import math
K = int(eval(input()))
sum = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
gcd1 = math.gcd(i, j)
for k in range(1, K + 1):
gcd2 = math.gcd(k, gcd1)
sum += gcd2
print(sum) | p02713 |
def gcd(p, q):
while q != 0:
r = p % q
p = q
q = r
return p
output = 0
K = int(eval(input()))
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
r = gcd(i, j)
output += gcd(r,k)
print(output)
| def gcd(p, q):
while q != 0:
r = p % q
p = q
q = r
return p
output = 0
K = int(eval(input()))
for i in range(1, K+1):
for j in range(1, K+1):
r = gcd(i, j)
for k in range(1, K+1):
output += gcd(r,k)
print(output) | p02713 |
def gcd(p, q):
while q != 0:
r = p % q
p = q
q = r
return p
output = 0
K = int(eval(input()))
for i in range(1, K+1):
for j in range(1, K+1):
r = gcd(i, j)
for k in range(1, K+1):
output += gcd(r,k)
print(output) | import math
output = 0
K = int(eval(input()))
for i in range(1, K+1):
for j in range(1, K+1):
r = math.gcd(i, j)
for k in range(1, K+1):
output += math.gcd(r,k)
print(output) | p02713 |
import math
k = int(eval(input()))
g =[math.gcd(math.gcd(i+1, j+1), l+1) for i in range(k) for j in range(k) for l in range(k)]
print((sum(g))) | import math
k = int(eval(input()))
sm=0
for i in range(1,k+1):
for l in range(1,k+1):
gcdab=math.gcd(i,l)
for m in range(1,k+1):
sm+=math.gcd(gcdab,m)
print(sm) | p02713 |
K=int(eval(input()))
import math
S=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
S+=math.gcd(math.gcd(i,j),k)
print(S) | K=int(eval(input()))
from math import gcd
S=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
S+=gcd(gcd(i,j),k)
print(S) | p02713 |
import math
k = int(eval(input()))
ans = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1,k+1):
ans += math.gcd(a, math.gcd(b, c))
print(ans)
| ans = [1, 9, 30, 76, 141, 267, 400, 624, 885, 1249, 1590, 2208, 2689, 3411, 4248, 5248, 6081, 7485, 8530, 10248, 11889, 13687, 15228, 17988, 20053, 22569, 25242, 28588, 31053, 35463, 38284, 42540, 46581, 50893, 55362, 61824, 65857, 71247, 76884, 84388, 89349, 97881, 103342, 111528, 120141, 128047, 134580, 146316, 15417... | p02713 |
import math
from functools import reduce
import itertools
def gcd(*numbers):
return reduce(math.gcd, numbers)
a = int(eval(input()))
ans = 0
nums = []
for i in range(1, a+1):
nums.append(i)
for balls in itertools.product(nums, repeat=3):
ans += int(gcd(balls[0], balls[1], balls[2]))
... | from math import gcd
a = int(eval(input()))
ans = 0
for i in range(1, a+1):
for k in range(1, a+1):
for j in range(1, a+1):
ans += gcd(gcd(i,k),j)
print(ans)
| p02713 |
N = int(eval(input()))
output_list = []
def gcd(a, b, c):
ret_gcd = 0
mini = min([a,b,c])
for i in range(mini, 0, -1):
if a % i == 0 and b % i == 0 and c % i == 0:
ret_gcd = i
break
return ret_gcd
for a in range(1, N+1):
for b in range(1, N+1):
for c in range(1, N+1):
... | K = int(eval(input()))
def gcp(a, b):
while b % a != 0:
mod = b % a
b = a
a = mod
return a
ans = 0
for a in range(1, K+1):
for b in range(1, K+1):
r = gcp(a, b)
for c in range(1, K+1):
ans += gcp(r, c)
print(ans) | p02713 |
def gcd(a,b):
amari = a % b
if amari == 0:
return b
else:
return gcd(b, amari)
K=int(eval(input()))
ans=0
for a in range(1,K+1):
for b in range(1,K+1):
ab=gcd(a,b)
for c in range(1,K+1):
ans += gcd(ab,c)
print(ans) | def gcd(a,b):
amari = a % b
if amari == 0:
return b
else:
return gcd(b, amari)
K=int(eval(input()))
ans=0
for a in range(1,K+1):
for b in range(1,K+1):
ab=gcd(a,b)
if ab == 1:
ans += K
else:
for c in range(1,K+1):
ans += gcd(ab,c)
print(ans) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
wa = 0
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
wa +=gcd(i,j,l)
print(wa) | import math
k = int(eval(input()))
wa = 0
aa = 0
for i in range(1,k+1):
for j in range(1,k+1):
aa =math.gcd(i,j)
for l in range(1,k+1):
wa +=math.gcd(aa,l)
print(wa) | p02713 |
K = int(eval(input()))
ans = 0
import math
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
tmp = math.gcd(i,j)
ans += math.gcd(tmp,k)
print(ans)
| K = int(eval(input()))
ans = 0
ans2 = 0
import math
for i in range(1,K+1):
for j in range(i,K+1):
for k in range(j,K+1):
tmp = math.gcd(i,j)
ans += math.gcd(tmp,k)
for i in range(1,K+1):
for j in range(i+1,K+1):
for k in range(j+1,K+1):
... | p02713 |
import math
from functools import reduce
K = int(eval(input()))
ans = 0
for i in range(K):
i = i + 1
for k in range(K):
k = k + 1
for j in range(K):
j = j + 1
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans += gcd(i, k, ... | K = int(eval(input()))
ans = 0
from math import gcd
for i in range(1,K+1):
for k in range(1,K+1):
for j in range(1,K+1):
ans += gcd(gcd(i, k),j)
print(ans)
| p02713 |
# import numpy as np
# aとbの最大公約数
def GCD(a,b):
# ユークリッドの互除法
if b == 0:
return a
else:
return GCD(b,a % b)
k = int(eval(input()))
sum = 0
for i in range(1, k + 1):
for j in range(1, k + 1):
for k in range(1, k + 1):
sum = sum + GCD(GCD(i, j),k)
... | # import numpy as np
# aとbの最大公約数
def GCD(a,b):
# ユークリッドの互除法
if b == 0:
return a
else:
return GCD(b,a % b)
k = int(eval(input()))
sum = 0
count = [0] * k
for i in range(1, k + 1):
for j in range(1, k + 1):
count[GCD(i, j) - 1] += 1
# print(count)
for i i... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
ans = 0
for i in range(1, K-1):
for j in range(i+1, K):
for k in range(j+1, K+1):
ans += gcd(i, j, k)*6
for i in range(1, K):
for j in range(i+1, K+1):
... | 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,
... | p02713 |
def gcd(a, b):
while b:
a, b = b, a % b
return a
def gcdlist(*l):
a = l[0]
for i in range(len(l)):
a = gcd(a,l[i])
return a
N = int(eval(input()))
I = list(range(1, N+1))
J = list(range(1, N+1))
K = list(range(1, N+1))
combinations = [(i, j, k)
f... | n = int(eval(input()))
from math import gcd
y = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
x = gcd(i, j)
for k in range(1, n + 1):
y += gcd(x, k)
print(y) | p02713 |
from math import gcd
from functools import reduce
def gcd3(*numbers):
return reduce(gcd, numbers)
def main():
K = int(eval(input()))
ans = 0
for i in range(K):
for j in range(K):
for k in range(K):
ans += gcd3(i+1,j+1,k+1)
print(ans)
if __name__ == "__main__":
... | def gcd(a, b):
if a%b == 0:
return(b)
else:
return(gcd(b, a%b))
def gcd3(a,b,c):
d = gcd(a,b)
ans = gcd(d,c)
return ans
def main():
K = int(eval(input()))
ans = 0
for i in range(K):
for j in range(K):
for k in range(K):
ans += gcd3(i+1,j+1,k+1)
print... | p02713 |
from math import gcd
K = int(eval(input()))
sum = 0
for a in range(K):
for b in range(K):
for c in range(K):
sum += gcd(gcd(a + 1, b + 1), c + 1)
print(sum)
| from math import gcd
K = int(eval(input()))
sum = 0
for a in range(K):
for b in range(K):
g = gcd(a + 1, b + 1)
for c in range(K):
sum += gcd(g, c + 1)
print(sum)
| p02713 |
import math
import itertools
K=int(eval(input()))
s=0
for a,b,c in itertools.product(list(range(1,K+1)),list(range(1,K+1)),list(range(1,K+1))):
s+=math.gcd(math.gcd(a,b),c)
print(s) | import math
from itertools import product
K=int(eval(input()))
s=0
for a,b,c in product(list(range(1,K+1)), repeat=3):
s+=math.gcd(math.gcd(b,c),a)
print(s) | p02713 |
import math
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
for k in range(1, n + 1):
ans += math.gcd(math.gcd(i, j), k)
print(ans)
| import math
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
a = math.gcd(i, j)
for k in range(1, n + 1):
ans += math.gcd(a, k)
print(ans)
| p02713 |
from math import gcd
N = int(eval(input()))
ans = 0
for i in range(1,N+1):
for k in range(1,N+1):
for l in range(1,N+1):
if i == k and k == l:
tmp = i
elif i==k:
tmp = gcd(k,l)
elif k==l:
tmp = gcd(l,i)
elif l==i:
tmp = gcd(i,k)
else:
... | from math import gcd
N = int(eval(input()))
ans = sum([gcd(gcd(i,j),k) for i in range(1,N+1) for j in range(1,N+1) for k in range(1,N+1)])
print(ans)
| p02713 |
import math
ans = 0
N = int(eval(input()))
for i in range(N):
for j in range(N):
for k in range(N):
ans += math.gcd(math.gcd(i+1,j+1),math.gcd(j+1,k+1))
print(ans) | import math
ans = 0
N = int(eval(input()))
if N <= 5:
for i in range(N):
for j in range(N):
for k in range(N):
ans += math.gcd(math.gcd(i+1,j+1),math.gcd(j+1,k+1))
else:
for i in range(N):
ans += i+1
for i in range(N-1):
for j in range(i+1,N):
a... | p02713 |
import math
ans = 0
N = int(eval(input()))
if N <= 5:
for i in range(N):
for j in range(N):
for k in range(N):
ans += math.gcd(math.gcd(i+1,j+1),math.gcd(j+1,k+1))
else:
for i in range(N):
ans += i+1
for i in range(N-1):
for j in range(i+1,N):
a... | import math
ans = 0
N = int(eval(input()))
for i in range(N):
for j in range(N):
for k in range(N):
ans += math.gcd(math.gcd(i+1,j+1),math.gcd(j+1,k+1))
print(ans) | p02713 |
import math
ans = 0
N = int(eval(input()))
for i in range(N):
for j in range(N):
for k in range(N):
ans += math.gcd(math.gcd(i+1,j+1),math.gcd(j+1,k+1))
print(ans) | import math
ans = 0
N = int(eval(input()))
if N <= 5:
for i in range(N):
for j in range(N):
for k in range(N):
ans += math.gcd(math.gcd(i+1,j+1),math.gcd(j+1,k+1))
else:
for i in range(N):
ans += i+1
for i in range(N-1):
for j in range(i+1,N):
a... | p02713 |
K=int(eval(input()))
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
ans+=gcd(i,j,k)
print(ans)
| K=int(eval(input()))
if K== 1 :
print(( 1 ))
if K== 2 :
print(( 9 ))
if K== 3 :
print(( 30 ))
if K== 4 :
print(( 76 ))
if K== 5 :
print(( 141 ))
if K== 6 :
print(( 267 ))
if K== 7 :
print(( 400 ))
if K== 8 :
print(( 624 ))
if K== 9 :
print(( 885 ))
if K== 10 :
print(( 1249 ))
if... | p02713 |
import math
K = int(eval(input()))
ans = 0
for i in range(K):
for j in range(K):
for k in range(K):
ans += math.gcd(math.gcd(i+1,j+1),k+1)
print (ans) | import math
K = int(eval(input()))
ans = 0
for i in range(K):
for j in range(K):
gcd = math.gcd(i+1,j+1)
for k in range(K):
ans += math.gcd(gcd,k+1)
print (ans) | p02713 |
from math import gcd
K = int(eval(input()))
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
ans += gcd(gcd(i,j),k)
print (ans) | from math import gcd
K = int(eval(input()))
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
gcd_ij = gcd(i, j)
for k in range(1,K+1):
ans += gcd(gcd_ij, k)
print (ans) | p02713 |
import math
import fractions
K = int(eval(input()))
sum = 0
def gcd2(x,y,z):
return math.gcd(math.gcd(x,y),z)
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
sum += gcd2(i,j,k)
print(sum)
| import math
import fractions
K = int(eval(input()))
sum = 0
def gcd2(x,y,z):
return math.gcd(math.gcd(x,y),z)
for i in range(1,K+1):
for j in range(i,K+1):
for k in range(j,K+1):
if (i == j == k):
sum += gcd2(i,j,k)
elif i != j and j != k:
... | p02713 |
import math
ans = 0
k = int(eval(input()))
for i in range(1,k+1):
for j in range(1,k+1):
for k in range(1,k+1):
gcd = math.gcd(k,math.gcd(i,j))
ans += gcd
print(ans) | from math import gcd
ans = 0
k = int(eval(input()))
for i in range(1,k+1):
for j in range(1,k+1):
for k in range(1,k+1):
ans += gcd(k,gcd(i,j))
print(ans) | p02713 |
from functools import reduce
import math
import itertools
def gcd(numbers):
return reduce(lambda x,y: math.gcd(x,y),numbers)
def comb(K):
return itertools.combinations_with_replacement(list(range(1,K+1)),3)
def main():
k = int(eval(input()))
if k == 1:
print((1))
return... | import math
def main():
k = int(eval(input()))
r = list(range(1,k+1))
#because gcd can only appear in this range
count = [0]*201
for i in r:
for j in r:
count[math.gcd(i,j)] += 1
final = 0
for i in range(1,201):
if count[i]... | p02713 |
import math
from functools import reduce
K = int(eval(input()))
memo = {}
def gcd(a, b):
key = frozenset((a,b))
if key in memo:
return memo[key]
memo[key] = math.gcd(a, b)
return memo[key]
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
ans += re... | import math
from collections import Counter
K = int(eval(input()))
memo = {frozenset((i, j)): math.gcd(i, j)
for i in range(1, K+1) for j in range(i, K+1)}
counter = Counter([memo[frozenset((i, j))]
for i in range(1, K+1) for j in range(1, K+1)])
total = 0
for i in range(1, ... | p02713 |
# C
k = int(eval(input()))
def gcd(x, y):
while(y):
x, y = y, x % y
return x
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
ans += gcd(a, gcd(b, c))
print(ans) | from math import gcd
k = int(eval(input()))
sum_c = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
sum_c += gcd(gcd(a, b), c)
print(sum_c) | p02713 |
from math import gcd
k = int(eval(input()))
sum_c = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
sum_c += gcd(gcd(a, b), c)
print(sum_c) | import math
A = int(eval(input()))
def gcd(A):
total = 0
for i in range(1,A+1):
for j in range(1,A+1):
B = math.gcd(i,j)
for k in range(1,A+1):
total += math.gcd(B,k)
return total
print((gcd(A))) | p02713 |
from collections import defaultdict, Counter
from heapq import heapify, heappop, heappush
from sys import stdin
d = dict()
def gcd(a, b):
if (a, b) in d:
return d[(a, b)]
if b == 0:
return a
else:
res = gcd(b, a % b)
d[(a, b)] = res
return res
r... | from collections import defaultdict, Counter
from heapq import heapify, heappop, heappush
from sys import stdin
d = dict()
def gcd(a, b):
if (a, b) in d:
return d[(a, b)]
if b == 0:
return a
else:
res = gcd(b, a % b)
d[(a, b)] = res
return res
r... | p02713 |
from math import gcd
K = int(eval(input()))
total = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
d = gcd(a,b)
total += gcd(d,c)
print(total) | from math import gcd
K = int(eval(input()))
total = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
total += gcd(gcd(a,b),c)
print(total) | p02713 |
import math
k = int(eval(input()))
res = 0
for i in range(1, k+1):
for j in range(1, k+1):
for m in range(1, k+1):
res += math.gcd(math.gcd(i, j), m)
print(res) | from math import gcd
k = int(eval(input()))
res = 0
for i in range(1, k+1):
for j in range(1, k+1):
for m in range(1, k+1):
res += gcd(gcd(i, j), m)
print(res) | p02713 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.