input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from math import gcd
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):
s = gcd(a,b)
res += gcd(s,c)
print(res) | from math import gcd
K = int(eval(input()))
res = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
res += gcd(gcd(a,b),c)
print(res) | p02713 |
import math
from functools import reduce
import itertools
K = int(eval(input()))
def gcd(*numbers):
return reduce(math.gcd, numbers)
count = 0
for i, j , k in itertools.product(list(range(K)), list(range(K)), list(range(K))):
count += gcd(i+1,j+1,k+1)
print(count) | import math
K = int(eval(input()))
count = 0
for i in range(K):
for j in range(K):
x = math.gcd(i+1,j+1)
for k in range(K):
count += math.gcd(x,k+1)
print(count) | p02713 |
import math
k = int(eval(input()))
ans = 0
for i in range(1,k+1):
for j in range(1,k+1):
for m in range(1,k+1):
ans +=math.gcd(math.gcd(i,j),m)
print(ans) | import math
K = int(eval(input()))
lists = []
for i in range(1, K + 1):
for j in range(1, K + 1):
mid = math.gcd(i, j)
for k in range(1, K + 1):
lists.append(math.gcd(mid, k))
print((sum(lists))) | p02713 |
K = int(eval(input()))
def gcd(n,m,l):
A = [ n , m , l ]
A = sorted(A)
while A[0] % A[2] != 0 :
A[0] , A[2] = A[2] , A[0] % A[2]
while A[1] % A[2] != 0 :
A[1] , A[2] = A[2] , A[1] % A[2]
return A[2]
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 )
| K = int(eval(input()))
def gcd(n,m,l):
if n < m :
n , m = m , n
while n % m != 0 :
n , m = m , n % m
if m < l :
m , l = l , m
while m % l != 0 :
m , l = l , m % l
return l
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 )
| p02713 |
from sys import stdin
import math
from functools import reduce
def main():
input = stdin.readline
K = int(eval(input()))
ans_sum = 0
for i in range(1,K+1):
for j in range(i,K+1):
for k in range(j,K+1):
check = [i,j,k]
sum_type = len(set(check))
if sum_type == 1:
ans_sum += gcd(i,j,k)
elif sum_type == 2:
ans_sum += gcd(i,j,k) * 3
else:
ans_sum += gcd(i,j,k) * 6
print(ans_sum)
def gcd(*numbers):
return reduce(math.gcd, numbers)
if __name__ == "__main__":
main() | 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) | 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):
x = math.gcd(i, j)
ans += math.gcd(x, k)
print(ans) | import math
K = int(eval(input()))
ans = 0
a = 0
b = 0
c = 0
for i in range(1, K + 1):
a += i
for i in range(1, K):
for j in range(i + 1, K + 1):
b += 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):
x = math.gcd(i, j)
c += math.gcd(x, k) * 6
ans = a + b + c
print(ans) | p02713 |
import math
K = int(eval(input()))
S = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
S += math.gcd(math.gcd(a, b), c)
print(S) | import math
K = int(eval(input()))
S = 0
for a in range(1, K+1):
for b in range(1, K+1):
g = math.gcd(a, b)
for c in range(1, K+1):
S += math.gcd(g, c)
print(S) | p02713 |
import math
from functools import reduce
n = int(eval(input()))
count = 0
def gcd(*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):
m = gcd(i,j,k)
count += m
print(count) |
import math
n = int(eval(input()))
count = 0
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):
m = math.gcd(t,k)
count += m
print(count) | p02713 |
import math
from functools import reduce
num = int(eval(input()))
ans = 0
for i in range(1, num + 1):
for j in range(1, num + 1):
for k in range(1, num + 1):
ans += math.gcd(math.gcd(i, j), k)
print(ans) | import math
num = int(eval(input()))
ans = 0
for i in range(1, num + 1):
for j in range(1, num + 1):
tmp = math.gcd(i, j)
for k in range(1, num + 1):
ans += math.gcd(tmp, k)
print(ans) | p02713 |
def gcd(a, b):
while b:
a, b = b, a % b
return a
K = int(eval(input()))
L = [[[0] * K for _ in range(K)] for _ in range(K)]
ans = 0
for a in range(1, K+1):
for b in range(1, K+1):
d = gcd(a, b)
for c in range(1, K+1):
x, y, z = sorted([a, b, c])
x -= 1
y -= 1
z -= 1
if L[x][y][z] != 0:
ans += L[x][y][z]
else:
t = gcd(d, c)
ans += t
L[x][y][z] = t
print(ans) | def gcd(a, b):
while b:
a, b = b, a % b
return a
K = int(eval(input()))
L = [[0] * (K+1) for _ in range(K+1)]
ans = 0
for a in range(1, K+1):
for b in range(1, K+1):
x, y = sorted([a, b])
if L[x][y] == 0:
d = gcd(a, b)
L[x][y] = d
else:
d = L[x][y]
for c in range(1, K+1):
x, y = sorted([d, c])
if L[x][y] == 0:
t = gcd(d, c)
L[x][y] = t
ans += t
else:
ans += L[x][y]
print(ans) | p02713 |
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):
gcd = math.gcd(k, math.gcd(i, j))
sum = 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):
for c in range(1, k + 1):
sum += gcd(c, gcd(a, b))
print(sum)
| p02713 |
import math
import itertools
k=int(eval(input()))
ans=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) :
y=math.gcd(i,k)
z=math.gcd(x,y)
ans+=z
print(ans)
| from math import gcd
k=int(eval(input()))
ans=0
for a in range(1,k+1) :
for b in range(1,k+1) :
for c in range(1,k+1) :
ans+=gcd(gcd(a,b),c)
print(ans)
| p02713 |
mem = {}
def gcd(a, b):
global mem
if (a, b) not in mem:
mem[(a, b)] = a if b == 0 else gcd(b, a%b)
return mem[(a, b)]
K = int(eval(input()))
res = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
res += gcd(gcd(i, j), k)
print(res) | import time
mem = {}
def gcd(a, b):
global mem
if (a, b) not in mem and (b, a) not in mem:
mem[(a, b)] = a if b == 0 else gcd(b, a%b)
mem[(b, a)] = mem[(a, b)]
return mem[(a, b)]
K = int(eval(input()))
res = 0
for i in range(1, K+1):
for j in range(1, K+1):
gcd(i, j)
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
res += mem[(mem[i, j], k)]
print(res) | p02713 |
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 k in range(1, K+1):
res += gcd(gcd(i, j), k)
print(res) | import time
def gcd(a, b):
return a if b == 0 else gcd(b, a%b)
K = int(eval(input()))
res = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
res += gcd(gcd(i, j), k)
print(res) | p02713 |
import math
k = int(eval(input()))
k += 1
ans = 0
for a in range(1, k):
for b in range(1, k):
for c in range(1, k):
ab = math.gcd(a, b)
bc = math.gcd(b, c)
abc = math.gcd(ab, bc)
ans += abc
print(ans)
| import math
k = int(eval(input()))
k += 1
ans = 0
ab = []
for a in range(1, k):
for b in range(1, k):
ab.append(math.gcd(a, b))
for a in ab:
for c in range(1, k):
ans += math.gcd(a, c)
print(ans)
| 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 += math.gcd(math.gcd(i,j),k)
print(A) | import math
N=int(eval(input()))
A = 0
for i in range(1,N+1):
for j in range(1,N+1):
for k in range(1,N+1):
A += math.gcd(math.gcd(i,j),k)
print(A) | p02713 |
import sys
from math import gcd
sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline
def solve():
k = int(rl())
ans = 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)
ans += gcd(c, d)
print(ans)
if __name__ == '__main__':
solve()
| import sys
from math import gcd
sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline
def solve():
k = int(rl())
ans = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
d = gcd(a, b)
for c in range(1, k + 1):
ans += gcd(c, d)
print(ans)
if __name__ == '__main__':
solve()
| 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 += math.gcd(i,math.gcd(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(i,gcd(j,k))
print(ans) | p02713 |
from math import gcd
k = int(eval(input()))
うんち = 0
for デビ in range(1,k+1):
for デビデ in range(1,k+1):
for ビル in range(1,k+1):
うんち += gcd(デビ,gcd(デビデ,ビル))
print(うんち) | from math import gcd
k = int(eval(input()))
うんち = 0
for でびさま in range(1,k+1):
for でびでび in range(1,k+1):
for でびる in range(1,k+1):
うんち += gcd(でびさま,gcd(でびでび,でびる))
print(うんち) | p02713 |
import math
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):
a=math.gcd(l,m)
if a==1:
ans+=1
else:
ans+=math.gcd(a,n)
print(ans) | import math
k=int(eval(input()))
ans=0
for l in range(1,k+1):
for m in range(1,k+1):
tmp=math.gcd(l,m)
for n in range(1,k+1):
gcd=math.gcd(tmp,n)
ans+=gcd
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(1,K+1):
temp = math.gcd(i,j)
for k in range(1,K+1):
ans += math.gcd(temp,k)
print(ans) | 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(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
num += gcd(a,b,c)
print(num) | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
num = 0
for a in range(1,k+1):
for b in range(a,k+1):
for c in range(b,k+1):
x = gcd(a,b,c)
bai = sum([a==b,b==c,a==c])
if bai == 0:
num += x*6
elif bai == 1:
num += x*3
else:
num += x
print(num)
| p02713 |
from math import gcd
K = int(eval(input()))
c = 0
for i in range(1,K+1):
for j in range(1,K+1):
for l in range(1,K+1):
a = gcd(gcd(i,j), l)
c += a
print(c) | from math import gcd
K = int(eval(input()))
c = 0
for i in range(1,K+1):
for j in range(1,K+1):
k = gcd(i,j)
for l in range(1,K+1):
a = gcd(k, l)
c += a
print(c) | p02713 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
from math import gcd
from functools import reduce
def gcd_list(numbers):
return reduce(gcd, numbers)
K = ii()
ans = 0
memo = dp3(-1, K+1, K+1, K+1)
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
#l = sorted([i, j, k])
#l = [i, j, k]
#a, b, c = l[0], l[1], l[2]
a, b, c = i, j, k
if memo[a][b][c] != -1:
ans += memo[a][b][c]
else:
memo[a][b][c] = gcd_list([a, b, c])
memo[i][k][j] = memo[k][i][j] = memo[k][j][i] = memo[j][i][k] = memo[j][k][i] = memo[i][j][k]
#memo[i][k][j] = memo[i][j][k]
#memo[k][i][j] = memo[i][j][k]
#memo[k][j][i] = memo[i][j][k]
#memo[j][j][i] = memo[i][j][k]
#memo[j][i][k] = memo[i][j][k]
ans += memo[a][b][c]
#ans += gcd_list([i, j, k])
print(ans) | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
from math import gcd
from functools import reduce
def gcd_list(numbers):
return reduce(gcd, numbers)
K = ii()
ans = 0
memo = dp3(-1, K+1, K+1, K+1)
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
#l = sorted([i, j, k])
#l = [i, j, k]
#a, b, c = l[0], l[1], l[2]
#a, b, c = i, j, k
#if memo[a][b][c] != -1:
#ans += memo[a][b][c]
#else:
#memo[i][j][k] = gcd_list([i, j, k])
#memo[i][k][j] = memo[k][i][j] = memo[k][j][i] = memo[j][i][k] = memo[j][k][i] = memo[i][j][k]
#memo[i][k][j] = memo[i][j][k]
#memo[k][i][j] = memo[i][j][k]
#memo[k][j][i] = memo[i][j][k]
#memo[j][j][i] = memo[i][j][k]
#memo[j][i][k] = memo[i][j][k]
ans += gcd_list([i, j, k])
#ans += gcd_list([i, j, k])
print(ans) | p02713 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
from math import gcd
from functools import reduce
def gcd_list(numbers):
return reduce(gcd, numbers)
K = ii()
ans = 0
memo = dp3(-1, K+1, K+1, K+1)
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
#l = sorted([i, j, k])
#l = [i, j, k]
#a, b, c = l[0], l[1], l[2]
#a, b, c = i, j, k
#if memo[a][b][c] != -1:
#ans += memo[a][b][c]
#else:
#memo[i][j][k] = gcd_list([i, j, k])
#memo[i][k][j] = memo[k][i][j] = memo[k][j][i] = memo[j][i][k] = memo[j][k][i] = memo[i][j][k]
#memo[i][k][j] = memo[i][j][k]
#memo[k][i][j] = memo[i][j][k]
#memo[k][j][i] = memo[i][j][k]
#memo[j][j][i] = memo[i][j][k]
#memo[j][i][k] = memo[i][j][k]
ans += gcd_list([i, j, k])
#ans += gcd_list([i, j, k])
print(ans) | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from math import gcd
from functools import reduce
def gcd(a, b):
if a < b:
a, b = b, a
r = a % b
if r == 0:
return b
return gcd(r, b)
def gcd_list(numbers):
return reduce(gcd, numbers)
K = ii()
ans = 0
memo = dp3(-1, K+1, K+1, K+1)
for i in range(1, K+1):
for j in range(i+1, K+1):
for k in range(j+1, K+1):
ans += gcd_list([i, j, k])*6
for i in range(1, K+1):
for j in range(1, K+1):
if i!=j:
ans += gcd_list([i, i, j])*3
for i in range(1, K+1):
ans += gcd_list([i, i, i])
print(ans) | p02713 |
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a % b)
def f(p, n):
if len(p) == 3:
global ans
t = gcd(p[0], p[1])
t = gcd(t, p[2])
ans += t
return t
for i in range(1, n+1):
f(p+[i], n)
ans = 0
k = int(eval(input()))
f([], 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):
a = gcd(i, j)
for l in range(1, k + 1):
ans += gcd(a, l)
print(ans) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
cnt = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
cnt += gcd(a, b, c)
print(cnt)
| import collections
import math
# math.gcd(a,b)
k = int(eval(input()))
cnts = collections.defaultdict(int)
for i in range(1, k+1):
for j in range(1, k+1):
cnts[math.gcd(i,j)] += 1
ans = 0
for i in range(1, k+1):
for key in list(cnts.keys()):
ans += math.gcd(i, key)*cnts[key]
print(ans)
| p02713 |
import math
import itertools
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
l = list(itertools.product(list(range(k+1))[1:], repeat=3))
s = 0
for i in l:
s += gcd(i[0], i[1], i[2])
print(s) | import math
import itertools
from functools import reduce
def gcd_list(numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
l = list(itertools.combinations_with_replacement(list(range(k+1))[1:], 3))
s = 0
n = 0
for i in l:
x = len(set(i))
if x == 3:
n = 6
elif x == 2:
n = 3
elif x == 1:
n = 1
s += gcd_list(list(i)) * n
print(s) | p02713 |
def gcd(x, y):
if y == 0:
return x
else:
return gcd(y, x % y)
K = int(eval(input()))
GCD = [[0]*200 for i in range(200)]
for i in range(200):
for j in range(200):
GCD[i][j] = gcd(i+1, j+1)
tot = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
s = GCD[j-1][k-1]
t = GCD[i-1][s-1]
tot += t
print(tot)
| K = int(eval(input()))
GCD = [[0]*200 for i in range(200)]
def gcd(x, y):
if GCD[x-1][y-1] == 0:
if y == 0:
return x
else:
return gcd(y, x % y)
else:
return GCD[x-1][y-1]
tot = 0
for i in range(1, K+1):
for j in range(1, K+1):
s = gcd(i, j)
if s != 1:
for k in range(1, K+1):
t = gcd(k, s)
tot += t
else:
tot += K
print(tot)
| 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) | import math
k = int(eval(input()))
ans = 0
for i in range(1, k+1):
for j in range(1, k+1):
num = math.gcd(i, j)
for k in range(1, k+1):
ans += math.gcd(num, k)
print(ans) | p02713 |
n = int(eval(input()))
from math import gcd
samu = 0
for i in range(n):
for j in range(n):
for k in range(n):
samu += gcd(gcd(i+1,j+1),k+1)
print((str(int(samu))))
| k = int(eval(input()))
from math import gcd
samu = 0
for i in range(1,k+1):
for j in range(1,k+1):
for k in range(1,k+1):
samu += gcd(gcd(i,j),k)
print(samu)
| p02713 |
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 l in range(1,k+1):
ans+=math.gcd(a,l)
print(ans) | k=int(eval(input()))
import math
ans=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(i,j)
ans+=math.gcd(a,l)
print(ans) | p02713 |
import math
k = int(eval(input()))
ans = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
ans += math.gcd(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 |
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) | from math import gcd
k = int(eval(input()))
ans = 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):
ans += gcd(p,c)
print(ans) | p02713 |
import math
from functools import reduce
k = int(eval(input()))
def gcd(*numbers):
return reduce(math.gcd, numbers)
cnt = 0
for a in range(k):
for b in range(k):
for c in range(k):
cnt = cnt + gcd(a+1,b+1,c+1)
print(cnt)
| import math
k = int(eval(input()))
cnt = 0
for a in range(k):
for b in range(k):
for c in range(k):
cnt = cnt + math.gcd(math.gcd(a+1,b+1),c+1)
print(cnt)
| p02713 |
K = int(eval(input()))
def gcd(a, b):
while b:
a, b = b, a % b
return a
ans = 0
for a in range(K):
a += 1
if a == 1:
ans += K*K
continue
for b in range(K):
b += 1
if b == 1:
ans += K
continue
tmp = gcd(a, b)
for c in range(K):
c += 1
if c == 1:
ans += 1
continue
dada = gcd(tmp, c)
ans += dada
# print(dada)
print(ans)
| K = int(eval(input()))
def gcd(a, b):
while b:
a, b = b, a % b
return a
ans = 0
for a in range(K):
a += 1
if a == 1:
ans += K*K
continue
for b in range(K):
b += 1
if b == 1:
ans += K
continue
tmp = gcd(a, b)
if tmp == 1:
ans += K
continue
for c in range(K):
c += 1
if c == 1:
ans += 1
continue
dada = gcd(tmp, c)
ans += dada
# print(dada)
print(ans)
| p02713 |
import math
a = int(eval(input()))
ans = 0
for i in range(1, a+1):
for j in range(1, a+1):
for k in range(1, a+1):
ans += math.gcd(math.gcd(i, j), k)
print(ans) | import math
a = int(eval(input()))
ans = 0
for i in range(1, a+1):
for j in range(1, a+1):
num = math.gcd(i, j)
for k in range(1, a+1):
ans += math.gcd(num, k)
print(ans) | p02713 |
from itertools import product
from math import gcd
K = int(eval(input()))
print((sum([gcd(a,gcd(b,c)) for a,b,c in [i for i in product(list(range(1, K+1)), repeat=3)]])))
| 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 |
from math import gcd
K = int(eval(input()))
ans = 0
for a in range(1,K+1):
for b in range(1,K+1):
g = gcd(a,b)
for c in range(1,K+1):
ans += gcd(g,c)
print(ans) | from math import gcd
K = int(eval(input()))
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
g = gcd(i,j)
for k in range(1,K+1):
ans += gcd(g,k)
print(ans) | 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(i, math.gcd(j, k))
print(total) | import math
n = int(eval(input()))
total1 = 0
for i in range(1, n + 1):
for j in range(i+1, n + 1):
for k in range(j+1, n + 1):
total1 += math.gcd(i, math.gcd(j, k))
total1 = 6*total1
total2 = 0
for i in range(1, n + 1):
for j in range(i+1, n + 1):
total2 += math.gcd(i, j)
total2 = 6*total2
total3 = 0
for i in range(1, n + 1):
total3 += i
print((total1 + total2 + total3)) | p02713 |
def u(a,b):
if(a<b):
z = b
b = a
a = z
r = a % b
while(r!=0):
a = b
b = r
r = a % b
return b
l = int(eval(input()))
s = 0
for i in range(1,l+1):
for i2 in range(1,l+1):
z = u(i,i2)
for i3 in range(1,l+1):
z2 = u(z,i3)
s+=z2
print (s) | def u(a,b):
if(a<b):
z = b
b = a
a = z
r = a % b
while(r!=0):
a = b
b = r
r = a % b
return b
l = int(eval(input()))
s = 0
for i in range(1,l+1):
for i2 in range(1,l+1):
z = u(i,i2)
for i3 in range(1,l+1):
z2 = u(i3,z)
s+=z2
print (s) | p02713 |
from functools import lru_cache
@lru_cache(maxsize=100000)
def gcd(a, b):
while b:
a, b = b, a % b
return a
def resolve():
k = int(eval(input()))
l = [None] * k ** 2
for i in range(k):
for j in range(k):
l[i * k + j] = gcd(i + 1, j + 1)
ans = 0
for i in l:
for j in range(k):
ans += gcd(i, j + 1)
print(ans)
if __name__ == '__main__':
resolve()
| from math import gcd
def resolve():
k = int(eval(input()))
l = [None] * k ** 2
for i in range(k):
for j in range(k):
l[i * k + j] = gcd(i + 1, j + 1)
ans = 0
for i in l:
for j in range(k):
ans += gcd(i, j + 1)
print(ans)
if __name__ == '__main__':
resolve()
| p02713 |
import math
from functools import reduce
def gcd(a, b, c):
ans = math.gcd(a, b)
ans = math.gcd(ans, c)
# abc = [a, b, c]
# for _ in [[0, 1], [0, 2], [1, 2]]:
# a0 = max(abc[_[0]], abc[_[1]])
# a1 = min(abc[_[0]], abc[_[1]])
# i = 0
# while True:
# tmp = a0 % a1
# if tmp == 0:
# gcds.append(a1)
# break
# a0 = a1
# a1 = tmp
return ans
# 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
# from functools import reduce
import itertools
def gcd(a, b, c):
ans = math.gcd(a, b)
ans = math.gcd(ans, c)
return ans
# def gcd(*numbers):
# return reduce(math.gcd, numbers)
k = int(eval(input()))
elem = [i+1 for i in range(k)]
combs = itertools.combinations_with_replacement(elem, 3)
tmp = [1, 2, 3]
s = 0
for comb in combs:
s += sum(tmp[:len(set(comb))]) * gcd(comb[0], comb[1], comb[2])
# 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)
| p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
ans = 0
for i in range(1,k+1):
for j in range(1,k+1):
a = gcd(i,j)
for l in range(1,k+1):
ans += gcd(a,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
k = int(eval(input()))
cnt = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
cnt += math.gcd(math.gcd(a, b), c)
print(cnt) | import math
k = int(eval(input()))
cnt = 0
for a in range(1, k+1):
for b in range(a+1, k+1):
for c in range(b+1, k+1):
cnt += math.gcd(math.gcd(a, b), c) * 6
for a in range(1, k+1):
for b in range(a+1, k+1):
cnt += math.gcd(a, b) * 6
for i in range(1, k+1):
cnt += i
print(cnt)
| p02713 |
import itertools
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
s = 0
for i in range(1, k+1):
for j in range(1, k+1):
for k in range(1, k+1):
s += gcd(i, j, k)
print(s) | import itertools
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
l = list(range(1, k+1))
s = 0
for i in itertools.product(l, repeat=3):
s += gcd(*i)
print(s) | p02713 |
from functools import reduce
import math
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()))
sum = 0
for a in range(1,k+1):
for b in range(1,k+1):
ab = math.gcd(a,b)
for c in range(1,k+1):
sum += math.gcd(ab, c)
print(sum) | p02713 |
def gcd(a, b):
while b:
a, b = b, a % b
return a
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)
| def gcd(a, b):
while b:
a, b = b, a % b
return a
import math
K = int(eval(input()))
ans_list = []
ans = 0
for i in range(1, K + 1):
for j in range(1,K+1):
ans_list.append(math.gcd(i,j))
for i in range(1,K+1):
for j in range(0,len(ans_list)):
ans += math.gcd(i,ans_list[j])
print(ans)
| p02713 |
import math
from functools import reduce
def gcd_list(numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
count = 0
a = [0,0,0]
for i in range(1,K+1):
a[0] = i
for j in range(1,K+1):
a[1] = j
for k in range(1,K+1):
a[2] = k
count += gcd_list(a)
print(count) | from math import gcd
k=int(eval(input()))
cnt=0
for i in range(1,k+1):
for p in range(1,k+1):
for q in range(1,k+1):
gcd1=gcd(i,p)
cnt+=gcd(gcd1,q)
print(cnt) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans=0
k=int(eval(input()))
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
ans += gcd(a, b, c)
print(ans) | 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)
| p02713 |
import math
k = int(eval(input()))
cnt = 0
for l in range(1,k+1):
for m in range(1,k+1):
for n in range(1,k+1):
tmp = math.gcd(l,m)
if tmp == 1:
cnt += 1
else:
cnt += math.gcd(tmp,n)
print(cnt)
| #C
import math
k = int(eval(input()))
cnt = 0
for i in range(1,k+1):
for j in range(i,k+1):
tmp = math.gcd(i,j)
for l in range(1,k+1):
if i != j:
cnt += 2 * math.gcd(tmp,l)
else:
cnt += math.gcd(tmp,l)
print(cnt) | p02713 |
import math
k=int(eval(input()))
s=0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
s+=math.gcd(math.gcd(a,b),c)
print(s) | from math import gcd
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(gcd(a,b),c)
print(s) | p02713 |
from math import gcd
counter = 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):
d = gcd(a,b)
counter += gcd(c,d)
print(counter) | from math import gcd
counter = 0
K = int(eval(input()))
for a in range(1,K+1):
for b in range(1,K+1):
if gcd(a,b)==1:
counter += K
else:
for c in range(1,K+1):
d = gcd(a,b)
counter += gcd(c,d)
print(counter) | p02713 |
import math
N = int(eval(input()))
result = 0
for a in range(1, N+1):
for b in range(1, N+1):
for c in range(1, N+1):
result += math.gcd(math.gcd(a,b),c)
print(result) | import math
N = int(eval(input()))
result = 0
for a in range(1, N+1):
for b in range(1, N+1):
if math.gcd(a,b) == 1:
result += 1*N
else:
for c in range(1, N+1):
result += math.gcd(math.gcd(a,b),c)
print(result) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
import sys
K=eval(input())
K=int(K)
L=[]
a=1
b=1
c=1
for i in range(K):
for j in range(K):
for m in range(K):
L.append(gcd(a,b,c))
c=c+1
c=1
b=b+1
b=1
c=1
a=a+1
S=sum(L)
print(S) | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
import sys
K=eval(input())
K=int(K)
S=0
a=1
b=1
c=1
for i in range(K):
for j in range(K):
if gcd(a,b)==1:
S+=K
else:
S+=sum([gcd(a,b,c) for c in range(1,K+1)])
c=1
b=b+1
b=1
c=1
a=a+1
print(S) | 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)
| 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)
for i in range(1,K+1):
for j in range(1,K+1):
if math.gcd(i,j)==1:
sum += K
else:
for l in range(1,K+1):
sum += math.gcd(math.gcd(i,j),l)
print(sum)
| p02713 |
from itertools import product
from functools import reduce
from math import gcd
k = int(eval(input()))
ans = 0
for abc in product([i for i in range(1, k+1)], repeat=3):
ans += reduce(gcd, abc)
print(ans)
| from math import gcd
k = int(eval(input()))
double = [gcd(i, j) for i in range(1, k+1) for j in range(1, k+1)]
triple = [gcd(i, j) for i in range(1, k+1) for j in double]
print((sum(triple)))
| p02713 |
import math
K = int(eval(input()))
sum = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
sum += math.gcd(math.gcd(a,b),c)
print(sum) | import math
K = int(eval(input()))
sum = 0
gcd_a_b = 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 |
k = int(eval(input()))
import math
from collections import deque
ans = deque()
for i in range(1, k + 1):
for j in range(1, k + 1):
for l in range(1, k + 1):
ans.append(math.gcd(math.gcd(i, j), l))
print((sum(ans)))
| k = int(eval(input()))
import math
ans = 0
ans1 = 0
ans2 = 0
for i in range(1,k+1):
for j in range(1,k+1):
ans1 += math.gcd(i,j)
ans = ans + ans1*3
for i in range(1,k+1):
for j in range(1,i):
for l in range(1,j):
ans2 += math.gcd(math.gcd(i,j),l)
ans += ans2*6
print((ans-sum(list(range(k+1)))*2))
| p02713 |
import math
result = 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) :
result += math.gcd(math.gcd(a ,b), c)
print(result) | import math
result = 0
k = int(eval(input()))
for a in range(1, k+1) :
for b in range(1, k+1) :
if math.gcd(a ,b) == 1 :
result += k
else :
for c in range(1, k+1) :
result += math.gcd(math.gcd(a ,b), c)
print(result) | p02713 |
from itertools import permutations, combinations,combinations_with_replacement,product
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
def get_unique_list(seq):
seen = []
return [x for x in seq if x not in seen and not seen.append(x)]
def main():
#n, k = map(int,input().split())
k = int(eval(input()))
lists = []
for i in range(k):
for j in range(k):
for l in range(k):
lists.append((i+1,j+1,l+1))
#for v in combinations_with_replacement(lists,3):
# print(v)
#lists = list(combinations_with_replacement(lists,3))
#lists2 = set(lists)
#print(lists)
#lists2 = [i[0]*100+i[1]*10+i[2] for i in lists]
#print(lists2)
k = 0
for i in lists:
k = k + gcd(i[0],i[1],i[2])
print(k)
"""
koubai = 0
for i in lists:
if len(set(i))==1:
koubai = koubai + gcd(i[0],i[1],i[2])
#print(koubai)
elif len(set(i))==2:
koubai = koubai + 3*gcd(i[0],i[1],i[2])
else:
koubai = koubai + 6*gcd(i[0],i[1],i[2])
#print(koubai)
print(koubai)
"""
if __name__ == '__main__':
main() | import math
def main():
#n, k = map(int,input().split())
k = int(eval(input()))
lists = []
sum = 0
for i in range(k):
for j in range(k):
for l in range(k):
sum = sum + math.gcd(math.gcd(i+1 ,j+1), l+1)
print(sum)
if __name__ == '__main__':
main() | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
def main():
#n, k = map(int,input().split())
k = int(eval(input()))
lists = []
sum = 0
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
#print(i,j,l)
sum = sum + gcd(i,j,l)
print(sum)
if __name__ == '__main__':
main() | import math
def main():
#n, k = map(int,input().split())
k = int(eval(input()))
lists = []
sum = 0
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
#print(i,j,l)
sum = sum + math.gcd(math.gcd(i,j),l)
print(sum)
if __name__ == '__main__':
main()
| p02713 |
import math
input_N = int(eval(input()))
i = j = k =1
l = sum_gcd=0
for i in range(input_N):
for j in range(input_N):
for k in range(input_N):
l +=1
sum_gcd += math.gcd(math.gcd(i+1,j+1),k+1)
print(sum_gcd) | import math
input_N = int(eval(input()))
i = j = k =1
sum_gcd=0
for i in range(input_N):
for j in range(input_N):
for k in range(input_N):
sum_gcd += math.gcd(math.gcd(i+1,j+1),k+1)
print(sum_gcd) | 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 l in range(1, k + 1):
ans += gcd_list([i, j, l])
print(ans) | from math import gcd
from functools import reduce
def gcd_list(numbers):
return reduce(gcd, numbers)
k = int(eval(input()))
ans = 0
rev = 0
for i in range(1, k + 1):
for j in range(i, k + 1):
tmp = gcd(i, j)
for l in range(j, k + 1):
if i == j and j == l:
ans += i
elif i == j or j == l or l == i:
ans += gcd(tmp, l) * 3
else:
ans += gcd(tmp, l) * 6
print(ans)
| p02713 |
import math
k = int(eval(input()))
k_range = list(range(1, k + 1))
#
# def gcd(a, b):
# if a < b:
# a, b = b, a
# while a % b != 0:
# a, b = b, a % b
# return b
sum_gcd = 0
for l in k_range:
for m in k_range:
for n in k_range:
sum_gcd += math.gcd(n, math.gcd(l, m))
print(sum_gcd) | import math
k = int(eval(input()))
k_range = list(range(1, k + 1))
sum_gcd = 0
for l in k_range:
temp = 0
for m in k_range:
temp = math.gcd(l, m)
for n in k_range:
sum_gcd += math.gcd(n, temp)
print(sum_gcd) | p02713 |
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):
for b in range(1,K+1):
for c in range(1,K+1):
ans += gcd(a,b,c)
print(ans) | import math
from functools import reduce
K = int(eval(input()))
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans = 0
for a in range(1,K+1):
if (a==1):
ans += K*K
continue
for b in range(1,K+1):
t = gcd(a,b)
if(t==1):
ans += K
continue
for c in range(1,K+1):
ans += gcd(t,c)
print(ans) | p02713 |
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):
for b in range(1,K+1):
t = gcd(a,b)
for c in range(1,K+1):
ans += gcd(t,c)
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):
if (a==1):
ans += K*K
continue
for b in range(1,K+1):
t = gcd(a,b)
if(t==1):
ans += K
continue
for c in range(1,K+1):
ans += gcd(t,c)
print(ans) | p02713 |
import math
from functools import reduce
def gcd_list(numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
abc_list = []
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
abc_list.append([a, b, c])
gcds = [gcd_list(x) for x in abc_list]
print((sum(gcds))) | import math
from functools import reduce
def gcd_list(numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
gcd = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
gcd += (gcd_list([a, b, c]))
print(gcd) | p02713 |
from math import gcd
from functools import reduce
import itertools
def resolve():
K = int(eval(input()))
gcds = sum([ gcd(gcd(x[0], x[1]), x[2]) for x in itertools.product(list(range(1, K+1)), list(range(1, K+1)), list(range(1, K+1))) ])
print(gcds)
if __name__ == "__main__":
resolve() | from math import gcd
from functools import reduce
from itertools import product
def resolve():
K = int(eval(input()))
# result = sum([ gcd(gcd(x[0], x[1]), x[2]) for x in itertools.product(range(1, K+1), range(1, K+1), range(1, K+1)) ])
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(result)
if __name__ == "__main__":
resolve() | p02713 |
from itertools import combinations_with_replacement
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) | from itertools import combinations_with_replacement
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
sum = 0
k = int(eval(input()))
l = list(range(1,k+1))
for a,b,c in combinations_with_replacement(l, 3):
ans = gcd(a,b,c)
if a == b and a == c:
sum += ans
elif a == b or b == c or c == a:
sum += 3 * ans
else:
sum += 6 * ans
print(sum) | p02713 |
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return list(map(int,input().split()))
def onem(): #Nとかの取得
return int(eval(input()))
def s(x): #圧縮
a = []
if len(x) == 0:
return []
aa = x[0]
su = 1
for i in range(len(x)-1):
if aa != x[i+1]:
a.append([aa,su])
aa = x[i+1]
su = 1
else:
su += 1
a.append([aa,su])
return a
def jo(x): #listをスペースごとに分ける
return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
return max(list(map(max,x)))
def In(x,a): #aがリスト(sorted)
k = bs.bisect_left(a,x)
if k != len(a) and a[k] == x:
return True
else:
return False
def pow_k(x, n):
ans = 1
while n:
if n % 2:
ans *= x
x *= x
n >>= 1
return ans
import fractions
from functools import reduce
def gcd(*numbers):
return reduce(fractions.gcd, numbers)
def gcd_list(numbers):
return reduce(fractions.gcd, numbers)
def lcm_base(x, y):
return (x * y) // fractions.gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
"""
n = onem()
s = input()[:-1]
R = [0 for _ in range(n)]
B = [0 for _ in range(n)]
G = [0 for _ in range(n)]
co = 0
if s[0] == "R":
R[0] = 1
elif s[0] == "G":
G[0] = 1
else:
B[0] = 1
for i in range(1,n):
if s[i] == "R":
R[i] += 1
elif s[i] == "G":
G[i] += 1
else:
B[i] += 1
R[i] += R[i-1]
G[i] += G[i-1]
B[i] += B[i-1]
for i in range(1,n-1):
if s[i] == "G":
for j in range(i):
if s[j] == "R":
co += B[-1] - B[i] - (1 if (j + (j - i) < n) and s[j + (j - i)] == "B" else 0)
print(co)
"""
n = onem()
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, 164817, 174438, 185836, 194157, 207927, 218812, 233268, 245277, 257857, 268182, 288216, 299257, 313635, 330204, 347836, 362973, 383709, 397042, 416448, 434025, 456967, 471948, 499740, 515581, 536073, 559758, 583960, 604833, 633651, 652216, 683712, 709065, 734233, 754734, 793188, 818917, 846603, 874512, 909496, 933081, 977145, 1006126, 1041504, 1073385, 1106467, 1138536, 1187112, 1215145, 1255101, 1295142, 1342852, 1373253, 1422195, 1453816, 1502376, 1553361, 1595437, 1629570, 1691292, 1726717, 1782111, 1827492, 1887772, 1925853, 1986837, 2033674, 2089776, 2145333, 2197483, 2246640, 2332104, 2379085, 2434833, 2490534, 2554600, 2609625, 2693919, 2742052, 2813988, 2875245, 2952085, 3003306, 3096024, 3157249, 3224511, 3306240, 3388576, 3444609, 3533637, 3591322, 3693924, 3767085, 3842623, 3912324, 4027884, 4102093, 4181949, 4270422, 4361548, 4427853, 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, 8403448, 8523897, 8684853, 8802826, 8949612, 9105537, 9267595, 9376656, 9574704, 9686065, 9827097, 9997134, 10174780, 10290813, 10493367, 10611772,10813692]
print((a[n-1]))
| import sys,collections as cl,bisect as bs,math
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return list(map(int,input().split()))
def onem(): #Nとかの取得
return int(eval(input()))
def s(x): #圧縮
a = []
if len(x) == 0:
return []
aa = x[0]
su = 1
for i in range(len(x)-1):
if aa != x[i+1]:
a.append([aa,su])
aa = x[i+1]
su = 1
else:
su += 1
a.append([aa,su])
return a
def jo(x): #listをスペースごとに分ける
return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
return max(list(map(max,x)))
def In(x,a): #aがリスト(sorted)
k = bs.bisect_left(a,x)
if k != len(a) and a[k] == x:
return True
else:
return False
def pow_k(x, n):
ans = 1
while n:
if n % 2:
ans *= x
x *= x
n >>= 1
return ans
import fractions
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
def lcm_base(x, y):
return (x * y) // math.gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
"""
def nibu(x,n,r):
ll = 0
rr = r
while True:
mid = (ll+rr)//2
if rr == mid:
return ll
if (ここに評価入れる):
rr = mid
else:
ll = mid+1
"""
n = onem()
co = 0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
co += gcd_list([i,j,k])
print(co)
| p02713 |
import math
k = int(eval(input()))
sum = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
sum += math.gcd(math.gcd(a,b),c)
print(sum)
| import math
k = int(eval(input()))
sum = 0
for a in range(1,k+1):
for b in range(1,k+1):
ab = math.gcd(a,b)
for c in range(1,k+1):
sum += math.gcd(ab,c)
print(sum)
| p02713 |
import math
from functools import reduce
def gcd(numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
l = []
res = 0
for i in range(k):
for j in range(i, k):
for m in range(j, k):
l.append([i+1, j+1, m+1])
for i in range(len(l)):
# print(l[i])
if l[i][0] == l[i][1] and l[i][1] == l[i][2]:
# print("1通り")
# print(gcd(l[i]))
res += gcd(l[i])
elif l[i][0] == l[i][1] or l[i][1] == l[i][2] or l[i][0] == l[i][2]:
# print("3通り")
# print(gcd(l[i]))
res += gcd(l[i])*3
else:
# print("6通り")
# print(gcd(l[i]))
res += gcd(l[i])*6
print(res)
| import math
from functools import reduce
def gcd(numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
l = []
res = 0
for i in range(1, k+1):
for j in range(i, k+1):
for m in range(j, k+1):
if i == j and j == m:
res += gcd([i, j, m])
elif i == j or j == m or i == m:
res += gcd([i, j, m])*3
else:
res += gcd([i, j, m])*6
print(res)
| 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
k = int(eval(input()))
ans = 0
dic = {}
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):
ans += math.gcd(tmp, c)
print(ans) | p02713 |
# -*- coding: utf-8 -*-
K = int(eval(input()))
# lcm & gcd not math library
def gcd(a, b):
while b:
a, b = b, a % b
return a
from functools import reduce
def gcd_multi(num_list):
return reduce(gcd, num_list)
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:
dup_num = 1
elif i == j or j == k:
dup_num = 3
else:
dup_num = 6
ans += gcd_multi([i, j, k]) * dup_num
print(ans) | # -*- coding: utf-8 -*-
K = int(eval(input()))
# lcm & gcd not math library
def gcd(a, b):
while b:
a, b = b, a % b
return a
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:
dup_num = 1
elif i == j or j == k:
dup_num = 3
else:
dup_num = 6
ans += gcd(gcd(i, j), k) * dup_num
print(ans) | p02713 |
# -*- coding: utf-8 -*-
K = int(eval(input()))
# lcm & gcd not math library
def gcd(a, b):
while b:
a, b = b, a % b
return a
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) | # -*- coding: utf-8 -*-
K = int(eval(input()))
# lcm & gcd not math library
def gcd(a, b):
while b:
a, b = b, a % b
return a
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
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
a = 0
for i in range(K):
for j in range(K):
for k in range(K):
a += gcd(i+1,j+1,k+1)
print(a) | 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, 134580, 146316, 154177, 164817, 174438, 185836, 194157, 207927, 218812, 233268, 245277, 257857, 268182, 288216, 299257, 313635, 330204, 347836, 362973, 383709, 397042, 416448, 434025, 456967, 471948, 499740, 515581, 536073, 559758, 583960, 604833, 633651, 652216, 683712, 709065, 734233, 754734, 793188, 818917, 846603, 874512, 909496, 933081, 977145, 1006126, 1041504, 1073385, 1106467, 1138536, 1187112, 1215145, 1255101, 1295142, 1342852, 1373253, 1422195, 1453816, 1502376, 1553361, 1595437, 1629570, 1691292, 1726717, 1782111, 1827492, 1887772, 1925853, 1986837, 2033674, 2089776, 2145333, 2197483, 2246640, 2332104, 2379085, 2434833, 2490534, 2554600, 2609625, 2693919, 2742052, 2813988, 2875245, 2952085, 3003306, 3096024, 3157249, 3224511, 3306240, 3388576, 3444609, 3533637, 3591322, 3693924, 3767085, 3842623, 3912324, 4027884, 4102093, 4181949, 4270422, 4361548, 4427853, 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, 8403448, 8523897, 8684853, 8802826, 8949612, 9105537, 9267595, 9376656, 9574704, 9686065, 9827097, 9997134, 10174780, 10290813, 10493367, 10611772, 10813692]
print((A[K-1])) | p02713 |
from math import gcd
N = int(eval(input()))
i = 0
for a in range(1, N+1):
for b in range(1, N+1):
for c in range(1, N+1):
i += gcd(gcd(a, b), c)
print(i)
| import math
K = int(eval(input()))
res = sum([math.gcd(math.gcd(a, b), c) for a in range(1,K+1) for b in range(1,K+1) for c in range(1,K+1)])
print(res)
| p02713 |
from math import gcd
from itertools import product
K = int(eval(input()))
l = product(list(range(1, K+1)), repeat=3)
ans = 0
for a, b, c in l:
ans += gcd(gcd(a, b), c)
print(ans)
| from math import gcd
K = int(eval(input()))
ans = 0
r = list(range(1, K+1))
for i in r:
for j in r:
for k in r:
ans += gcd(gcd(i, j), k)
print(ans)
| p02713 |
from functools import reduce
from math import gcd
from itertools import product
K = int(eval(input()))
b = 0
for a in product(list(range(1,K+1)), repeat=3):
b += reduce(gcd, a)
print(b) | from math import gcd
r = list(range(1, int(eval(input())) + 1))
print((sum(gcd(gcd(i,j),k) for i in r for j in r for k in r))) | p02713 |
import math
K = int(eval(input()))
total = 0
for x in range(1, K+1):
for y in range(1, K+1):
for z in range(1, K+1):
total = total+math.gcd(x, math.gcd(y, z))
print(total)
| import math
K = int(eval(input()))
total = 0
for x in range(1, K+1):
for y in range(1, K+1):
a=math.gcd(x, y)
for z in range(1, K+1):
total = total+math.gcd(z, a)
print(total)
| p02713 |
#abc162 c
import math
k = int(eval(input()))
def gcds(x,y,z):
n1 = math.gcd(x,y)
n2= math.gcd(n1,z)
return n2
total = 0
for i in range(1,k+1):
for j in range(1,k+1):
for t in range(1,k+1):
total += gcds(i,j,t)
print(total) | import math
k = int(eval(input()))
def gcds(x,y,z):
n1 = math.gcd(x,y)
n2= math.gcd(n1,z)
return n2
total =0
for i in range(1,k+1):
for j in range(1,k+1):
if math.gcd(i,j) == 1:
total += k
else:
for t in range(1,k+1):
total += gcds(i,j,t)
print(total)
| p02713 |
k = int(eval(input()))
"""
memo = [[-1 for i in range(k+1)] for j in range(k+1)]
def gcd(a, b):
if b == 0:
return a
else:
if memo[a][b] == -1:
memo[a][b] = gcd(b, a % b)
return memo[a][b]
"""
def my_gcd(a, b):
if a < b: a, b = b, a
c = a % b
if c == 0: return b
while c!=0:
c = a % b
a = b
b = c
return a
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
t = my_gcd(a, b)
for c in range(1, k+1):
ans += my_gcd(t, c)
print(ans)
| k = int(eval(input()))
def gcd(a, b):
if a < b: a, b = b, a
c = a % b
if c == 0: return b
while c!=0:
c = a % b
a = b
b = c
return a
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
t = gcd(a, b)
if t == 1:
ans += k
continue
for c in range(1, k+1):
ans += gcd(t, c)
print(ans)
| p02713 |
k = int(eval(input()))
def gcd(a, b):
if a < b: a, b = b, a
c = a % b
if c == 0: return b
while c!=0:
c = a % b
a, b = b, c
return a
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
t = gcd(a, b)
if t == 1:
ans += k
continue
for c in range(1, k+1):
ans += gcd(t, 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):
t = gcd(a, b)
if t == 1:
ans += k
continue
for c in range(1, k+1): ans += gcd(t, c)
print(ans) | p02713 |
K = int(eval(input()))
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
s = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
for k in range(1, K + 1):
s += gcd(i, gcd(j, k))
print(s)
| K = int(eval(input()))
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
gcds = [[0 for _ in range(K + 1)] for _ in range(K + 1)]
for i in range(1, K + 1):
for j in range(1, K + 1):
gcds[i][j] = gcd(i, j)
s = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
for k in range(1, K + 1):
s += gcds[gcds[i][j]][k]
print(s)
| p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K=int(eval(input()))
ans=K**2+(K-1)*K+(K-1)*(K-1)
for a in range(1,K):
for b in range(1,K):
for c in range(1,K):
ans += gcd(a+1,b+1,c+1)
print(ans) | import math
K=int(eval(input()))
ans=0
for a in range(K):
for b in range(K):
tmp=math.gcd(a+1,b+1)
for c in range(K):
ans += math.gcd(tmp,c+1)
print(ans) | p02713 |
import math
K=int(eval(input()))
ans=0
for a in range(K):
for b in range(K):
for c in range(K):
ans += math.gcd(math.gcd(a+1,b+1),c+1)
print(ans) | import math
K=int(eval(input()))
ans=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):
ans += math.gcd(tmp,c)
print(ans) | p02713 |
import math
K = int(eval(input()))
total = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
total += math.gcd(math.gcd(a,b),c)
print(total) | 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 |
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) | import sys
from math import gcd
def solve(K: int):
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)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
K = int(next(tokens)) # type: int
solve(K)
if __name__ == '__main__':
main()
| p02713 |
import math
N= int(eval(input()))
a=0
b=0
for i in range(1,N+1):
for j in range(1, N + 1):
for k in range(1, N + 1):
b=math.gcd(i,j)
a+=math.gcd(b,k)
print(a) | import math
N= int(eval(input()))
a=0
b=0
for i in range(1,N+1):
for j in range(1, N + 1):
b = math.gcd(i, j)
for k in range(1, N + 1):
a+=math.gcd(b,k)
print(a) | p02713 |
import math
k = int(eval(input()))
result = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
p = math.gcd(a, b)
q = math.gcd(p, c)
result += q
print(result)
| import math
k = int(eval(input()))
result = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
p = math.gcd(a, b)
for c in range(1, k + 1):
q = math.gcd(p, c)
result += q
print(result)
| p02713 |
import math
k = int(eval(input()))
ans = 0
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
a = math.gcd(i,j)
b = math.gcd(a,l)
ans += b
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):
b = math.gcd(a,l)
ans += b
print(ans) | p02713 |
from functools import reduce
from math import gcd
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):
a = [i, j, k]
if 1 in a:
count += 1
continue
else:
count += reduce(gcd, a)
print(count)
| from math import gcd
K = int(eval(input()))
count = 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):
count += gcd(a, k)
print(count)
| p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K=int(eval(input()))
s=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
s+=gcd(i,j,k)
print(s) | from math import gcd
K=int(eval(input()))
s=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
s+=gcd(gcd(i,j),k)
print(s) | p02713 |
import math
from functools import reduce
def calc(a, b, c):
return reduce(math.gcd, set([a, b, c]))
def solve(k):
import itertools
pattern = itertools.product(list(range(1, k+1)), repeat=3)
count = 0
for x in pattern:
gcd = calc(x[0], x[1], x[2])
count += gcd
return count
k = int(eval(input()))
print((solve(k)))
| from math import gcd
k = int(eval(input()))
ir = list(range(1, k+1))
jr = list(range(1, k+1))
lr = list(range(1, k+1))
count = 0
for i in ir:
for j in jr:
for l in lr:
count += gcd(i, gcd(j, l))
print(count) | p02713 |
import fractions
import math
import itertools
from functools import reduce
k = int(eval(input()))
total = 0
ran = list(range(1, k + 1))
for i, j, k in itertools.product(ran, ran, ran):
total += math.gcd(math.gcd(i, j), k)
print(total) | import math
k = int(eval(input()))
total = 0
ran = list(range(1, k + 1))
for i in ran:
for j in ran:
for k in ran:
total += math.gcd(k, math.gcd(i, j))
print(total)
| p02713 |
from math import gcd
def ngcd(arr):
res = arr[0]
for i in range(1, len(arr)):
res = gcd(res, arr[i])
return res
k = int(eval(input()))
dp = [[[-1 for _ in range(201)] for _ in range(201)] for _ in range(201)]
ans = 0
for i in range(1, k+1):
for j in range(1, k+1):
for l in range(1, k+1):
if dp[i][j][l] == -1:
tmp = ngcd([i, j, l])
dp[i][j][l] = tmp
dp[i][l][j] = tmp
dp[j][i][l] = tmp
dp[j][l][i] = tmp
dp[l][i][j] = tmp
dp[l][j][i] = tmp
ans += dp[i][j][l]
print(ans) | k = int(eval(input()))
ans = {1: 1, 2: 9, 3: 30, 4: 76, 5: 141, 6: 267, 7: 400, 8: 624, 9: 885, 10: 1249, 11: 1590, 12: 2208, 13: 2689, 14: 3411, 15: 4248, 16: 5248, 17: 6081, 18: 7485, 19: 8530, 20: 10248, 21: 11889, 22: 13687, 23: 15228, 24: 17988, 25: 20053, 26: 22569, 27: 25242, 28: 28588, 29: 31053, 30: 35463, 31: 38284, 32: 42540, 33: 46581, 34: 50893, 35: 55362, 36: 61824, 37: 65857, 38: 71247, 39: 76884, 40: 84388, 41: 89349, 42: 97881, 43: 103342, 44: 111528, 45: 120141, 46: 128047, 47: 134580, 48: 146316, 49: 154177, 50: 164817, 51: 174438, 52: 185836, 53: 194157, 54: 207927, 55: 218812, 56: 233268, 57: 245277, 58: 257857, 59: 268182, 60: 288216, 61: 299257, 62: 313635, 63: 330204, 64: 347836, 65: 362973, 66: 383709, 67: 397042, 68: 416448, 69: 434025, 70: 456967, 71: 471948, 72: 499740, 73: 515581, 74: 536073, 75: 559758, 76: 583960, 77: 604833, 78: 633651, 79: 652216, 80: 683712, 81: 709065, 82: 734233, 83: 754734, 84: 793188, 85: 818917, 86: 846603, 87: 874512, 88: 909496, 89: 933081, 90: 977145, 91: 1006126, 92: 1041504, 93: 1073385, 94: 1106467, 95: 1138536, 96: 1187112, 97: 1215145, 98: 1255101, 99: 1295142, 100: 1342852, 101: 1373253, 102: 1422195, 103: 1453816, 104: 1502376, 105: 1553361, 106: 1595437, 107: 1629570, 108: 1691292, 109: 1726717, 110: 1782111, 111: 1827492, 112: 1887772, 113: 1925853, 114: 1986837, 115: 2033674, 116: 2089776, 117: 2145333, 118: 2197483, 119: 2246640, 120: 2332104, 121: 2379085, 122: 2434833, 123: 2490534, 124: 2554600, 125: 2609625, 126: 2693919, 127: 2742052, 128: 2813988, 129: 2875245, 130: 2952085, 131: 3003306, 132: 3096024, 133: 3157249, 134: 3224511, 135: 3306240, 136: 3388576, 137: 3444609, 138: 3533637, 139: 3591322, 140: 3693924, 141: 3767085, 142: 3842623, 143: 3912324, 144: 4027884, 145: 4102093, 146: 4181949, 147: 4270422, 148: 4361548, 149: 4427853, 150: 4548003, 151: 4616104, 152: 4718640, 153: 4812789, 154: 4918561, 155: 5003286, 156: 5131848, 157: 5205481, 158: 5299011, 159: 5392008, 160: 5521384, 161: 5610705, 162: 5739009, 163: 5818390, 164: 5930196, 165: 6052893, 166: 6156139, 167: 6239472, 168: 6402720, 169: 6493681, 170: 6623853, 171: 6741078, 172: 6864016, 173: 6953457, 174: 7094451, 175: 7215016, 176: 7359936, 177: 7475145, 178: 7593865, 179: 7689630, 180: 7886244, 181: 7984165, 182: 8130747, 183: 8253888, 184: 8403448, 185: 8523897, 186: 8684853, 187: 8802826, 188: 8949612, 189: 9105537, 190: 9267595, 191: 9376656, 192: 9574704, 193: 9686065, 194: 9827097, 195: 9997134, 196: 10174780, 197: 10290813, 198: 10493367, 199: 10611772, 200: 10813692}
print((ans[k])) | p02713 |
def gcd(a, b):
if a < b:
a, b = b, a
r = a % b
if r == 0:
return b
return gcd(r, b)
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) | # K, N = map(int, input().split())
# a = list(map(int, input().split()))
# N = int(input())
def gcd(a, b):
if a < b:
a, b = b, a
r = a % b
if r == 0:
return b
return gcd(r, b)
K = int(eval(input()))
ans = 0
for a in range(1, K+1):
for b in range(1, K+1):
n = gcd(a, b)
for c in range(1, K+1):
ans += gcd(n, c)
print(ans) | p02713 |
from math import gcd
x=int(eval(input()))
y=0
for a in range(x):
for b in range(x):
for c in range(x):
y+=gcd(gcd(a+1,b+1),c+1)
print(y) | from math import gcd
z=list(range(int(eval(input()))))
y=0
for a in z:
for b in z:
for c in z:
y+=gcd(gcd(a+1,b+1),c+1)
print(y)
| p02713 |
from math import gcd
z=list(range(int(eval(input()))))
y=0
for a in z:
for b in z:
for c in z:
y+=gcd(gcd(a+1,b+1),c+1)
print(y)
| from math import gcd
z=list(range(1,1+int(eval(input()))))
y=0
for a in z:
for b in z:
for c in z:
y+=gcd(gcd(a,b),c)
print(y) | p02713 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.