input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N,M = list(map(int,input().split()))
edge = [[None]*(N+1) for _ in range(N+1)]
for _ in range(M):
l,r,d = list(map(int,input().split()))
edge[l][r] = d
edge[r][l] = -d
G = [None]*(N+1)
ok = True
stack = []
for x in range(1,N+1):
if G[x] is not None: continue
G[x] = 0
stack = [x]
... | N,M = list(map(int,input().split()))
edge =[[] for _ in range(N+1)]
for _ in range(M):
l,r,d = list(map(int,input().split()))
edge[l].append([r,d])
edge[r].append([l,-d])
G = [None]*(N+1)
ok = True
stack = []
for x in range(1,N+1):
if G[x] is not None: continue
G[x] = 0
stack = [x]
... | p03452 |
import sys
import copy
sys.setrecursionlimit(10**6)
N,M=list(map(int,input().split()))
D=[]
P=[[i,0]for i in range(N+1)]
C=[1 for i in range(N+1)]
A=[0]
for i in range(M):
l,r,d=list(map(int,input().split()))
P[r]=[l,d]
D.append([l,r,d])
#print(P)
def find(a,b):
if c[a]==0:
re... | import sys
input=sys.stdin.readline
sys.setrecursionlimit(10**7)
N,M=list(map(int,input().split()))
L=[[]for i in range(N+1)]
D=dict()
for i in range(M):
l,r,d=list(map(int,input().split()))
L[l].append([r,d])
L[r].append([l,-d])
D[i]=(l,r,d)
C=["N" for i in range(N+1)]
def dfs(x... | p03452 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
... | p03452 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
... | p03452 |
import sys
sys.setrecursionlimit(1000000)
N, M = list(map(int, input().split()))
class UnionFind():
# 作りたい要素数nで初期化
# 使用するインスタンス変数の初期化
def __init__(self, n):
self.n = n
# root[x]<0ならそのノードが根かつその値が木の要素数
# rootノードでその木の要素数を記録する
self.root = [-1]*(n+1)
# 木をく... | class UnionFind():
# 作りたい要素数nで初期化
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rnk = [0]*(n+1)
# ノードxのrootノードを見つける
def Find_Root(self, x):
if(self.root[x] < 0):
return x
else:
self.root[x] = self.Find_Root(self... | p03452 |
import sys
sys.setrecursionlimit(100000)
N, M = list(map(int, input().split()))
union = list(range(N + 1))
dist = [0] * (N + 1)
def ascend(anc):
tmp_d = dist[anc]
if union[anc] == anc:
return anc, tmp_d
else:
union[anc], d_sum = ascend(union[anc])
dist[anc] = tmp_d + d_sum
return union[anc], dis... | import sys
sys.setrecursionlimit(100000)
N, M = list(map(int, input().split()))
union = list(range(N + 1))
dist = [0] * (N + 1)
rec = [0] * (N + 1)
def ascend(anc):
count = 0
while anc != union[anc]:
rec[count] = anc
anc = union[anc]
count += 1
rec[count] = anc
for i in range(count - 1, -1, -1)... | p03452 |
from collections import deque
class Edge:
def __init__(self, t, w):
self.to = t
self.ew = w
class Graph:
def __init__(self, N):
self.nw = [-1] * N
self.al = [[] for i in range(N)]
def add_edge(self, fr, to, weight):
self.al[fr].append(Edge(to, weight))
self.al[to].append(Edge(fr, -weight... | from collections import deque
class Edge:
def __init__(self, t, w):
self.to = t
self.ew = w
class Graph:
def __init__(self, N):
self.nw = [-1] * N
self.al = [[] for i in range(N)]
def add_edge(self, fr, to, weight):
self.al[fr].append(Edge(to, weight))
self.al[to].append(Edge(fr, -weight... | p03452 |
from collections import deque
class Edge:
def __init__(self, t, w):
self.to = t
self.ew = w
class Graph:
def __init__(self, N):
self.nw = [-1] * N
self.al = [[] for i in range(N)]
def add_edge(self, fr, to, weight):
self.al[fr].append(Edge(to, weight))
self.al[to].append(Edge(fr, -weight... | from collections import deque
def dfs(s, al, nw, used):
nw[s] = 0
q = deque([s])
used.add(s)
while q:
h = q.popleft()
for to, ew in al[h]:
if to in used:
if nw[h] + ew != nw[to]:
return False
continue
used.add(to)
nw[to] = nw[h] + ew
q.appendleft(to)
return True
def... | p03452 |
class WeightedUnionFind():
def __init__(self, n):
self.parents = [-1] * n
self.par_weight = [0] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
root = self.find(self.parents[x])
self.par_weight[x] += self.par_weight[sel... | import sys
sys.setrecursionlimit(10 ** 6)
def dfs(p):
for edge in G[p]:
if X[edge[0]] is not None:
if X[edge[0]] - X[p] != edge[1]:
print('No')
exit()
else:
X[edge[0]] = X[p] + edge[1]
dfs(edge[0])
N, M = list(map... | p03452 |
N,M = list(map(int,input().split()))
es = [[] for i in range(N)]
for i in range(M):
l,r,d = list(map(int,input().split()))
l,r = l-1,r-1
es[l].append((r,d))
es[r].append((l,-d))
checked = [0] * N
for i in range(N):
if checked[i]: continue
dist = [None] * N
dist[i] = 0
stack... | N,M = list(map(int,input().split()))
es = [[] for i in range(N)]
for i in range(M):
l,r,d = list(map(int,input().split()))
l,r = l-1,r-1
es[l].append((r,d))
es[r].append((l,-d))
dist = [None] * N
for i in range(N):
if dist[i] is not None: continue
dist[i] = 0
stack = [i]
wh... | p03452 |
# -*- coding: utf-8 -*-
from collections import deque
def inpl(): return tuple(map(int, input().split()))
N, M = inpl()
adj = [[] for _ in range(N+1)]
for _ in range(M):
l, r, d = inpl()
adj[l].append([r, d])
adj[r].append([l, -d])
X = [-1 for _ in range(N+1)]
searched = [False for ... | # -*- coding: utf-8 -*-
from collections import deque
def inpl(): return tuple(map(int, input().split()))
N, M = inpl()
adj = [[] for _ in range(N+1)]
for _ in range(M):
l, r, d = inpl()
adj[l].append([r, d])
adj[r].append([l, -d])
X = [-1 for _ in range(N+1)]
searched = [False for ... | p03452 |
from collections import defaultdict
n,m = list(map(int,input().split()))
uf = [-1]*n
def root(x):
if uf[x] < 0:
return x
uf[x] = root(uf[x])
return uf[x]
def unite(x,y):
rx, ry = root(x), root(y)
if rx==ry: return False
if rx > ry: rx, ry = ry, rx
uf[rx] += uf[ry]
... | from collections import defaultdict
n,m = list(map(int,input().split()))
uf = [-1]*n
def root(x):
if uf[x] < 0:
return x
uf[x] = root(uf[x])
return uf[x]
def unite(x,y):
rx, ry = root(x), root(y)
if rx==ry: return False
if rx > ry: rx, ry = ry, rx
uf[rx] += uf[ry]
... | p03452 |
from collections import defaultdict
n,m = list(map(int,input().split()))
uf = [-1]*n
def root(x):
if uf[x] < 0:
return x
uf[x] = root(uf[x])
return uf[x]
def unite(x,y):
rx, ry = root(x), root(y)
if rx==ry: return False
if rx > ry: rx, ry = ry, rx
uf[rx] += uf[ry]
... | from collections import defaultdict, deque
n,m = list(map(int,input().split()))
edge = [[] for i in range(n)]
for i in range(m):
l,r,d = list(map(int, input().split()))
edge[l-1].append((r-1,d))
edge[r-1].append((l-1,-d))
dist = [0]*n
visited = [False]*n
for i in range(n):
if visited[i]:... | p03452 |
def solve(N, M, lrd):
vs = {}
def calc(l, r):
cs = set([l])
xs = [(l, 0)]
while xs:
x = xs.pop()
if x[0] in vs:
for y, d in list(vs[x[0]].items()):
if y == r:
return d + x[1]
... | def solve(N, M, lrd):
edges = {}
nodes = {}
for l, r, d in lrd:
if not l in edges:
edges[l] = {}
if not r in edges:
edges[r] = {}
edges[l][r] = d
edges[r][l] = -d
nodes[l] = None
nodes[r] = None
for node in nodes:
... | p03452 |
"""
unionFind木を使う。
根に対する距離を記録していく。
"""
import sys
sys.setrecursionlimit(2000000)
input = sys.stdin.readline
class UnionFind():
def __init__(self,n):
self.n=n
self.parents = [i for i in range(n+1)]
self.distance = [0]*(n+1)
def find(self,x):
if self.parents[x]==x:
... | import sys
sys.setrecursionlimit(2000000)
input = sys.stdin.readline
class UnionFind():
def __init__(self,n):
self.n=n
self.parents = [i for i in range(n+1)]
#dist[x]はxとその親との間の距離を保持している
self.dist = [0]*(n+1)
def find(self,x):
if self.parents[x]==x:
... | p03452 |
from collections import defaultdict
def solve():
Base = 2000
MAX = Base*2
p = 10**9+7
F = [1]; Finv = [0]*(MAX*2+1)
for i in range(MAX*2): F.append(F[i]*(i+1)%p)
Finv[MAX*2] = pow(F[MAX*2],p-2,p)
for i in range(MAX*2,0,-1): Finv[i-1] = Finv[i]*i%p
N = int(input())
dup = A_MAX = B_MAX = 0
dp = [[0]*... | from collections import defaultdict
def solve():
Base = 2000
MAX = Base*2
p = 10**9+7
F = [1]; Finv = [0]*(MAX*2+1)
for i in range(MAX*2): F.append(F[i]*(i+1)%p)
Finv[MAX] = pow(F[MAX],p-2,p)
for i in range(MAX,0,-1): Finv[i-1] = Finv[i]*i%p
N = int(input())
dup = A_MAX = B_MAX = 0
dp = [[0]*(MAX+2... | p04051 |
from collections import defaultdict
def solve():
Base = 2000
MAX = Base*2
p = 10**9+7
F = [1]; Finv = [0]*(MAX*2+1)
for i in range(MAX*2): F.append(F[i]*(i+1)%p)
Finv[MAX] = pow(F[MAX],p-2,p)
for i in range(MAX,0,-1): Finv[i-1] = Finv[i]*i%p
N = int(input())
A_MAX = B_MAX = 0
dp = [[0]*(MAX+2) for ... | from collections import defaultdict
def solve():
Base = 2000
MAX = Base*2
p = 10**9+7
F = [1]; Finv = [0]*(MAX*2+1)
for i in range(MAX*2): F.append(F[i]*(i+1)%p)
Finv[MAX] = pow(F[MAX],p-2,p)
for i in range(MAX,0,-1): Finv[i-1] = Finv[i]*i%p
N = int(input())
dup = A_MAX = B_MAX = 0
dp = [[0]*(MAX+2... | p04051 |
a, b, c = list(map(int, input().split()))
if a+b+c <= 21:
print("win")
else:
print("bust") | print(("win" if sum([int(x) for x in input().split()]) <= 21 else "bust")) | p02835 |
a, b, c = list(map(int, input().split()))
if a+b+c >= 22:
print("bust")
else:
print("win") | B1, A2, A3 = list(map(int, input().split()))
C = B1 + A2 + A3
if C <= 21:
print('win')
if C >= 22:
print('bust') | p02835 |
print((['win','bust'][sum(list(map(int,input().split())))>=22])) | print(('bwuisnt'[sum(map(int, input().split())) < 22::2])) | p02835 |
a = [int(i) for i in input().split()]
print(('bust' if sum(a) >= 22 else 'win')) | a = list(map(int, input().split()))
print(('bust' if sum(a) >= 22 else 'win')) | p02835 |
a,b,c=[int(x) for x in input().split()]
if a+b+c>=22:
print('bust')
else:
print('win')
| a=list(map(int,input().split()))
if(sum(a)>=22):
print("bust")
else:
print("win") | p02835 |
a = list(map(int, input().split()))
if sum(a) >= 22:
print('bust')
else:
print('win')
| a1, a2, a3 = list(map(int, input().split()))
if a1 + a2 + a3 >= 22:
print('bust')
else:
print('win')
| p02835 |
a1, a2, a3 = list(map(int, input().split()))
if a1 + a2 + a3 >= 22:
print('bust')
else:
print('win')
| a = list(map(int, input().split()))
if a[0] + a[1] + a[2] >= 22:
print('bust')
else:
print('win')
| p02835 |
A,B,C=list(map(int,input().split()))
if A+B+C>21:
print("bust")
else:
print("win") | A,B,C=list(map(int,input().split()))
if A+B+C>=22:
print('bust')
else:
print('win') | p02835 |
A,B,C=list(map(int,input().split()))
if A+B+C>=22:
print("bust")
elif A+B+C<=21:
print("win") | A,B,C=list(map(int,input().split()))
if A+B+C<=21:
print("win")
elif A+B+C>=22:
print("bust") | p02835 |
a,b,c=list(map(int,input().split()))
print(('bust' if a+b+c>=22 else 'win')) | A = list(map(int, input().split()))
print(("bust" if sum(A) >= 22 else "win")) | p02835 |
A = sum(map(int, input().split()))
print(("bust" if A >= 22 else "win")) | A = list(map(int, input().split()))
print(("bust" if sum(A) >= 22 else "win")) | p02835 |
a, b, c = list(map(int, input().split()))
if a + b + c >= 22:
print('bust')
else:
print('win') | a = list(map(int, input().split()))
if sum(a) >= 22:
print('bust')
else:
print('win') | p02835 |
a = sum(list(map(int, input().split())))
if a >+ 21:
print('bust')
else:
print('win') | a1, a2, a3 = list(map(int, input().split()))
a = a1 + a2 + a3
if a >+ 21:
print('bust')
else:
print('win') | p02835 |
a, b, c = list(map(int, input().split()))
if a+b+c >= 22:
print("bust")
elif a+b+c <= 21:
print("win") | a = list(map(int, input().split()))
if sum(a) >= 22:
print('bust')
else:
print('win') | p02835 |
A1, A2, A3 = list(map(int, input().split()))
if (A1 + A2 + A3) >= 22:
print('bust')
else:
print('win')
| if sum(map(int, input().split())) >= 22:
ans = 'bust'
else:
ans = 'win'
print(ans)
| p02835 |
print(('bwuisnt'[sum(map(int,input().split()))<22::2])) | print(('bwuisnt'[eval(input().replace(*' +'))<22::2])) | p02835 |
a = list(map(int, input().split()))
if sum(a) >= 22:
print('bust')
else:
print('win')
| a1, a2, a3 = list(map(int, input().split()))
if a1+a2+a3 >= 22:
print('bust')
else:
print('win')
| p02835 |
A = list(map(int,input().split()))
if sum(A) >= 22:
print('bust')
else:
print('win') | s = input().split()
sum_s = int(s[0]) + int(s[1]) + int(s[2])
if sum_s >= 22:
print('bust')
else:
print('win') | p02835 |
a1,a2,a3 = list(map(int,input().split()))
sum_a=a1+a2+a3
if sum_a<=21:
print('win')
else :
print('bust') | a1,a2,a3 = list(map(int,input().split()))
if a1+a2+a3<=21:
print('win')
else :
print('bust') | p02835 |
a = eval(input().replace(" ","+"))
print(((a>21)*"bust" or "win")) | print(((eval(input().replace(" ","+"))>21)*"bust" or "win")) | p02835 |
print(("bust" if sum(list(map(int, input().split()))) >= 22 else "win")) | print(("win" if sum(list(map(int, input().split()))) < 22 else "bust")) | p02835 |
a = list(map(int, input().split()))
if sum(a) >= 22:
print('bust')
else:
print('win') | def main():
A = list(map(int, input().split()))
print(('win' if sum(A) <= 21 else 'bust'))
if __name__ == '__main__':
main()
| p02835 |
n = int(eval(input()))
A = list(map(int,input().split()))
dp = [[-float("INF")]*(n+1) for i in range(n+1)]
low = [-float("INF")]*(n+1)
col = [-float("INF")]*(n+1)
m = 0
a,b = A[:2]
dp[a][b] = 0
dp[b][a] = 0
low[a] = 0
col[a] = 0
low[b]
col[b] = 0
base = 0
for _ in range(1,n):
a,b,c = A[3*_-1:3*_+... | import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
A = list(map(int,input().split()))
dp = [[-float("INF")]*(n+1) for i in range(n+1)]
low = [-float("INF")]*(n+1)
col = [-float("INF")]*(n+1)
m = 0
a,b = A[:2]
dp[a][b] = 0
dp[b][a] = 0
low[a] = ... | p02581 |
import sys
input = sys.stdin.readline
N = int(input().strip())+2
A = list(map(int,input().split()))+[N-1,N]
INF = N
dp = [[-INF for j in range(N)] for i in range(N)]
dpmax = -INF
dpmaxj = [-INF for i in range(N)]
score = 0
a,b,c,d,e = sorted(A[:5])
a -= 1
b -= 1
c -= 1
d -= 1
e -= 1
if a == b == c:
... | import sys
input = sys.stdin.readline
N = int(input().strip())+2
A = list(map(int,input().split()))+[N-1,N]
INF = N
dp = [[-INF for j in range(N)] for i in range(N)]
dpmax = -INF
dpmaxj = [-INF for i in range(N)]
score = 0
a,b,c,d,e = [i-1 for i in sorted(A[:5])]
if a == b == c:
dp[d][e] = dp[e][d] = d... | p02581 |
from collections import deque
def upd(dp, a, b, v):
dp[a][b] = max(dp[a][b], v)
dp[b][a] = max(dp[b][a], v)
dp[-1][a] = max(dp[-1][a], v)
dp[-1][b] = max(dp[-1][b], v)
dp[a][-1] = max(dp[a][-1], v)
dp[b][-1] = max(dp[b][-1], v)
dp[-1][-1] = max(dp[-1][-1], v)
def main():
... | from collections import deque
def upd(a, b, v):
global N
dp[a][b] = max(dp[a][b], v)
dp[b][a] = max(dp[b][a], v)
dp[N][a] = max(dp[N][a], v)
dp[N][b] = max(dp[N][b], v)
dp[a][N] = max(dp[a][N], v)
dp[b][N] = max(dp[b][N], v)
dp[N][N] = max(dp[N][N], v)
N = int(eval(inpu... | p02581 |
"""
https://atcoder.jp/contests/abc176/tasks/abc176_f
dp[i][c1][c2] = 先頭2枚がc1とc2(c1<=c2)の時の答えの最大
で解けるようだ
毎回の処理をO(N)に抑えなくてはいけない
3枚が同じときは取っちゃえばいいので、3枚みたいな変数を用意しておいて答えに足せばいい
2枚が同じな時、更新するべきはc1とc2のうち片方以上が同じな場合
→残る2枚は確定するので、O(N)の更新が必要
1枚あるのをセットにする場合、c1=c2である。残りの2枚は確定するので、O(1)で更新できる。
セットにせず、カードを交換する場合も考える
... |
"""
https://atcoder.jp/contests/abc176/tasks/abc176_f
dp[i][c1][c2] = 先頭2枚がc1とc2(c1<=c2)の時の答えの最大
で解けるようだ
毎回の処理をO(N)に抑えなくてはいけない
3枚が同じときは取っちゃえばいいので、3枚みたいな変数を用意しておいて答えに足せばいい
2枚が同じな時、更新するべきはc1とc2のうち片方以上が同じな場合
→残る2枚は確定するので、O(N)の更新が必要
1枚あるのをセットにする場合、c1=c2である。残りの2枚は確定するので、O(1)で更新できる。
セットにせず、カードを交換する場合も考える
... | p02581 |
"""
https://atcoder.jp/contests/abc176/tasks/abc176_f
dp[i][c1][c2] = 先頭2枚がc1とc2(c1<=c2)の時の答えの最大
で解けるようだ
毎回の処理をO(N)に抑えなくてはいけない
3枚が同じときは取っちゃえばいいので、3枚みたいな変数を用意しておいて答えに足せばいい
2枚が同じな時、更新するべきはc1とc2のうち片方以上が同じな場合
→残る2枚は確定するので、O(N)の更新が必要
1枚あるのをセットにする場合、c1=c2である。残りの2枚は確定するので、O(1)で更新できる。
セットにせず、カードを交換する場合も考える
新し... | """
https://atcoder.jp/contests/abc176/tasks/abc176_f
dp[i][c1][c2] = 先頭2枚がc1とc2(c1<=c2)の時の答えの最大
で解けるようだ
毎回の処理をO(N)に抑えなくてはいけない
3枚が同じときは取っちゃえばいいので、3枚みたいな変数を用意しておいて答えに足せばいい
2枚が同じな時、更新するべきはc1とc2のうち片方以上が同じな場合
→残る2枚は確定するので、O(N)の更新が必要
1枚あるのをセットにする場合、c1=c2である。残りの2枚は確定するので、O(1)で更新できる。
セットにせず、カードを交換する場合も考える
新し... | p02581 |
N = int(eval(input()))
A = [int(a) for a in input().split()] + [0] * 2
X = [[-10**10] * (N+1) for _ in range(N+1)]
X[A[0]][A[1]] = 0
ans = 0
ma = 0
MA = [-10**10] * (N+1)
MA[A[0]] = MA[A[1]] = 0
for i in range(N):
B = A[i*3+2:i*3+5]
cnt = len(set(B))
if cnt == 1:
ans += 1
elif cnt =... | N = int(eval(input()))
A = [int(a) for a in input().split()] + [0] * 2
X = [[-10**10] * (N+1) for _ in range(N+1)]
X[A[0]][A[1]] = 0
ans = 0
ma = 0
MA = [-5] * (N+1)
MA[A[0]] = MA[A[1]] = 0
for i in range(N):
B = A[i*3+2:i*3+5]
cnt = len(set(B))
if cnt == 1:
ans += 1
elif cnt == 2:
... | p02581 |
K = int(eval(input()))
# from fractions import gcd
from math import gcd
def f(x, y, z):
r = gcd(gcd(x, y), z)
return r
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
ans += f(i, j, k)
print(ans) | K = int(eval(input()))
# from fractions import gcd
from math import gcd
# def f(x, y, z):
# r = gcd(gcd(x, y), z)
# return r
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
# ans += f(i, j, k)
ans += gcd(gcd(i, j), k)
print(... | p02713 |
from math import gcd
from functools import reduce
# import itertools
from collections import defaultdict
a=int(eval(input()))
def ggcd(*numbers):
return reduce(gcd, numbers)
sum=0
for x in range(1,a+1):
for y in range(1,a+1):
if x == 1 and y==1 : sum+=(1*a);continue
for z in r... | from math import gcd
from functools import reduce
# import itertools
from collections import defaultdict
a=int(eval(input()))
sum=0
for x in range(1,a+1):
for y in range(1,a+1):
for z in range(1,a+1):
sum+=gcd(gcd(x,y),z)
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
ab = {}
for a in range(1,k+1):
for b in range(1,k+1):
tmp = math.gcd(a, b)
if tmp not in ab:
ab[tmp] = 1
else:
ab[tmp] += 1
for c in range(1,k+1):
for d in list(ab.keys()):
ans += math.gcd(c, d) * ab[d]
print(ans) | p02713 |
import math
K = int(eval(input()))
ans = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
ans += math.gcd(math.gcd(a,b), c)
print(ans) | import math
K = int(eval(input()))
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()))
ans = 0
list_gcd = [[0]*202 for _ in range(202)]
for i in range(1, 201):
for j in range(i, 201):
num = math.gcd(i, j)
list_gcd[i][j] = num
list_gcd[j][i] = num
ans = 0
for i in range(1, k+1):
for j in range(1, k+1):
for l in rang... | 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):
num = math.gcd(i, j)
ans += math.gcd(num,l)
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()))
tgt=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
tgt+=gcd(i, j, k)
print(tgt... | from math import gcd
K=int(eval(input()))
K1=K+1
tgt=0
for i in range(1,K1):
for j in range(1,K1):
for k in range(1,K1):
tgt+=gcd(gcd(i, j), k)
print(tgt) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans = 0
n = int(eval(input()))
for i in range(n):
for j in range(n):
for k in range(n):
ans += gcd(i+1, j+1, k+1)
print(ans) | 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
from functools import reduce
import itertools
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
_sum = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
_sum +=gcd(a, b, c)
print(_sum) | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
_sum = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
_sum +=gcd(a, b, c)
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(math.gcd(a,b),c)
print(ans)
exit()
| 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)
exit()
| p02713 |
import math
def gcd(a,b):
if a ==b:
return a
elif a !=b:
return math.gcd(a,b)
cnt=0
K = int(eval(input()))
for i in range(1,K+1):
for m in range(1,K+1):
c = gcd(i,m)
for u in range(1,K+1):
cnt+= gcd(c,u)
print(cnt) | import math
K = int(eval(input()))
def gcd(a,b):
return math.gcd(a,b)
cnt=0
for i in range(1,K+1):
for m in range(1,K+1):
d = math.gcd(i,m)
for u in range(1,K+1):
cnt+=math.gcd(d,u)
print(cnt)
| 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
for i in range(1, K+1):
for j in range(1, K+1):
i_j = math.gcd(i, j)
for k in range(1, K+1):
sum += math.gcd(i_j, k)
print(sum) | p02713 |
def gcd(m,n):
while (m % n != 0):
temp = n
n = m % n
m = temp
return(n)
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,gcd(b,c))
print(s) | def gcd(m,n):
while (m % n != 0):
temp = n
n = m % n
m = temp
return(n)
k = int(eval(input()))
s = 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):
s += gcd(t,c)
print(s)
| p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K=int(eval(input()))
i=1
r=0
while(i<K+1):
j=1
while(j<K+1):
k=1
while(k<K+1):
if(i==1 or j==1 or k==1):
r+=1
elif(i==j and j==k):
r+=i
elif(i==j):
... | import math
K=int(eval(input()))
r=0
for i in range(1,K+1):
for j in range(1,K+1):
a=math.gcd(i,j)
for k in range(1,K+1):
b=math.gcd(a,k)
r+=b
print(r) | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
sum = K ** 2
for a in range(2,K+1) :
for b in range(1,K+1) :
for c in range(1,K+1) :
sum += gcd(a, b, c)
print(sum) | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
sum = K ** 2
for a in range(2,K+1) :
for b in range(1,K+1) :
if gcd(a,b) == 1 :
sum += K
else :
for c in range(1,K+1) :
... | 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):
tmp = gcd(i, j)
if tmp == 1:
ans += K
else:
for k in range(1, K + 1):
ans += gcd(tmp, k)
print(ans)
| p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(eval(input()))
a = 1
b = 1
c = 1
d = 0
for i in range(K):
for j in range(K):
for k in range(K):
d = gcd(gcd(a, b), c) + d
c = c + 1
... | from math import gcd
K = int(eval(input())) + 1
d = 0
for i in range(1, K):
for j in range(1, K):
for k in range(1, K):
d = gcd(gcd(i, j), k) + d
print(d) | p02713 |
import math
import functools
k = int(eval(input()))
k = k+1
ans = 0
for i in range(1,k):
for j in range(1,k):
for kk in range(1,k):
ans += functools.reduce(math.gcd, [i,j,kk])
print(ans) | import math
def solve(n):
n = n+1
ans = 0
for i in range(1,n):
for j in range(1,n):
tmp = math.gcd(i, j)
for k in range(1,n):
ans += math.gcd(tmp, k)
return ans
def main():
k = int(eval(input()))
print((solve(k)))
if __name__ == ... | p02713 |
def gcd(p, q) :
if p % q == 0 :
return q
else :
return gcd(q,p%q)
if __name__ == '__main__':
ans = 0
tmp = 0
k = int(eval(input()))
for i in range(1,k+1) :
for j in range(1, k+1) :
tmp = gcd(i,j)
for l in range(1, k+1) :
ans += gcd(tmp,l)
print(ans)
| def gcd(p, q) :
if p % q == 0 :
return q
else :
return gcd(q,p%q)
if __name__ == '__main__':
k = int(eval(input()))
a = []
ans = 0
for i in range(1,k+1) :
for j in range(1,k+1) :
a.append(gcd(i,j))
for i in range(1,k+1) :
for j in a :
ans += gcd(i,j)
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 *
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
n = int(eval(input()))
a = 0
for i in range(0,n):
for j in range(0,n):
for k in range(0,n):
gcd1 = math.gcd(i+1,j+1)
gcd2 = math.gcd(gcd1,k+1)
a = a + gcd2
print(a) | import math
n = int(eval(input()))
a = 0
for i in range(0,n):
for j in range(0,n):
gcd1 = math.gcd(i+1,j+1)
for k in range(0,n):
gcd2 = math.gcd(gcd1,k+1)
a = a + gcd2
print(a) | p02713 |
from math import gcd
k = int(eval(input()))
sum = 0
i, j = 0, 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
i = gcd(gcd(a, b), c)
sum += i
print(sum) | from math import gcd
k = int(eval(input()))
sum = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
sum += gcd(gcd(a, b), c)
print(sum) | p02713 |
def gcd(a,b):
if a < b:
a, b = b, a
if mem[a][b]:
return mem[a][b]
if b == 0:
return a
mem[a][b] = gcd(b, a % b)
return mem[a][b]
k = int(eval(input()))
ans = 0
mem = [[0 for a in range(k+1)]for b in range(k+1)]
n = k+1
for i in range(1,n):
for... | def gcd(a,b):
if a < b:
a, b = b, a
if mem[a][b]:
return mem[a][b]
if b == 0:
return a
mem[a][b] = gcd(b, a % b)
return mem[a][b]
k = int(eval(input()))
ans = 0
mem = [[0 for a in range(k+1)]for b in range(k+1)]
n = k+1
for i in range(1,n):
for j in range(... | 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
K = int(eval(input()))
sum = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
sum += math.gcd(i, j)
if j == K:
break
else:
for k in range(j + 1, K + 1):
sum += math.gcd(i, math.gcd(j, k)) * 2
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 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):
ij = math.gcd(i, j)
for k in range(1,K+1):
ans += math.gcd(ij, k)
print(ans) | p02713 |
import math
k = int(eval(input()))
ans=0
for x in range(1,k+1):
for y in range(1,k+1):
for z in range(1,k+1):
ans += math.gcd(math.gcd(x, y),z)
print(ans) | from math import gcd
k = int(eval(input()))
ans = 0
for x in range(1, k + 1):
for y in range(1, k + 1):
a = gcd(x, y)
for z in range(1, k + 1):
ans += gcd(a, z)
print(ans) | p02713 |
from math import*
r = list(range(1, int(eval(input())) + 1))
print((sum(gcd(gcd(a, b), c) for a in r for b in r for c in r))) | from math import gcd
r = list(range(1, int(eval(input())) + 1))
print((sum(gcd(gcd(a, b), c) for a in r for b in r for c in r))) | p02713 |
K = int(eval(input()))
from math import gcd
ans = 0
dic = {}
for i in range(1, K+1):
for j in range(i, K+1):
for k in range(j, K+1):
time = len(set([i, j, k]))
if time==3:
t=6
elif time==2:
t=3
else:
... | from math import gcd
def solve():
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 k in range(1, K+1):
ans += gcd(a, k)
return ans
print((solve())) | p02713 |
from math import gcd
K=int(eval(input()))
sum=0
for i in range(K):
for j in range(K):
for k in range(K):
sum+=gcd(gcd(i+1,j+1),k+1)
print(sum) | from math import gcd
K=int(eval(input()))+1
sum=0
for i in range(1,K):
for j in range(1,K):
for k in range(1,K):
sum+=gcd(gcd(i,j),k)
print(sum) | 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(i, gcd(k, j))
print(ans) |
from math import gcd
K = int(eval(input()))
ans = 0
for a in range(1, K + 1):
for b in range(1, K + 1):
for c in range(1, K + 1):
ans += gcd(gcd(a, b), c)
print(ans)
| p02713 |
import sys
import math
from collections import defaultdict
from collections import deque
def load(vtype=int):
return vtype(input().strip())
def exit():
import sys
sys.exit(0)
def gcd(a, b):
a, b = max(a, b), min(a, b)
while True:
r = a % b
if r == 0: return b
... | from math import gcd
def main():
k = int(eval(input()))
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
ans += gcd(gcd(a, b), c)
print(ans)
if __name__ == "__main__":
main() | p02713 |
from itertools import combinations
import math
from functools import reduce
def gcd_list(numbers):
return reduce(math.gcd, numbers)
n = int(eval(input()))
a = []
for i in range(1, n+1):
a += [i, i, i]
x = list(set(combinations(a, 3)))
total = 0
for i, j, k in x:
if i == j and j == k an... | from itertools import combinations
import math
from functools import reduce
def gcd_list(numbers):
return reduce(math.gcd, numbers)
n = int(eval(input()))
total = 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 and i == k:
... | p02713 |
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
# import math
import sys
import collections
from math import gcd
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.deque()
def LI(): return list(map(int, sys.... | # encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
# import math
import sys
import collections
from math import gcd
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.deque()
def LI(): return list(map(int, sys.... | p02713 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**7)
from pprint import pprint as pp
from pprint import pformat as pf
# @pysnooper.snoop()
#import pysnooper # debug
from functools import lru_cache
import math
#from sortedcontainers import SortedList, SortedDict, SortedSet ... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**7)
from pprint import pprint as pp
from pprint import pformat as pf
# @pysnooper.snoop()
#import pysnooper # debug
from functools import lru_cache
import math
#from sortedcontainers import SortedList, SortedDict, SortedSet ... | p02713 |
#from math import gcd
import sys
#import numpy as np
sys.setrecursionlimit(10 ** 9)
K = int(eval(input()))
def gcd(x,y):
while y:
x, y = y, x % y
return x
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
#import numpy as np
sys.setrecursionlimit(10 ** 9)
K = int(eval(input()))
ans = 0
for i in range(K):
for j in range(K):
for k in range(K):
ans += gcd(gcd(i+1,j+1), k+1)
print(ans)
| p02713 |
from math import gcd
import sys
#import numpy as np
sys.setrecursionlimit(10 ** 9)
K = int(eval(input()))
ans = 0
for i in range(K):
for j in range(K):
for k in range(K):
ans += gcd(gcd(i+1,j+1), k+1)
print(ans)
| from math import gcd
import sys
#import numpy as np
sys.setrecursionlimit(10 ** 9)
K = int(eval(input()))
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
tmp = gcd(i,j)
for k in range(1,K+1):
ans += gcd(tmp, k)
print(ans) | p02713 |
import math
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(read())
ans = 0
for a in range(1, n+1):
for b in range(1, n+1):
for c in range(1, n+1):
ans += math.gcd(math.gcd(a, b), c)
print(ans) | import math
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
k = int(read())
ans = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
n = math.gcd(a, b)
for c in range(1, k + 1):
ans += math.gcd(n, c)
pri... | p02713 |
gcd_memo = {}
def gcd(a, b):
if b == 0:
return a
else:
r = a % b
gcd_memo[(a, b)] = gcd(b, r)
return gcd_memo[(a, b)]
if __name__ == "__main__":
K = int(eval(input()))
ans = 0
for a in range(1, K+1):
for b in range(1, K+1):
for... | gcd_memo = {}
def gcd(a, b):
if b == 0:
return a
elif (a, b) in gcd_memo:
return gcd_memo[(a, b)]
else:
r = a % b
gcd_memo[(a, b)] = gcd(b, r)
gcd_memo[(b, a)] = gcd_memo[(a, b)]
return gcd_memo[(a, b)]
if __name__ == "__main__":
K = in... | p02713 |
import math
K = int(eval(input()))
sum = 0
cache = {}
for a in range(1, K+1) :
for b in range(1 , K+1) :
for c in range(1 , K+1) :
bc = str(b) + "-" + str(c)
if bc in cache :
sum = sum + math.gcd(a, cache[bc])
else :
cache[bc... | import math
K = int(eval(input()))
sum = 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) :
sum = sum + math.gcd(tmp, c)
print(sum)
| p02713 |
import fractions
import math
K = int(eval(input()))
sum = 0
kl = list(range(1, K+1))
combdict = {}
for i in kl:
for j in kl:
for k in kl:
sum += math.gcd(i, math.gcd(j, k))
print(sum) | import math
K = int(eval(input()))
sum = 0
kl = list(range(1, K+1))
for i in kl:
for j in kl:
for k in kl:
sum += math.gcd(i, math.gcd(j, k))
print(sum) | p02713 |
import math
k = int(eval(input()))
ans = 0
for i in range(1, k+1):
for j in range(1, k+1):
for t in range(1, k+1):
ans += math.gcd(i, math.gcd(j, t))
print(ans) | import math
k = int(eval(input()))
ans = 0
for i in range(1, k+1):
for j in range(1, k+1):
gcd1 = math.gcd(i,j)
for t in range(1, k+1):
ans += math.gcd(gcd1, t)
print(ans) | p02713 |
import math
d = dict()
k = int(eval(input()))
sm = 0
def g(x, y, z):
t = sorted([x,y,z])
d.setdefault(str(t), 0)
if d[str(t)] == 0:
s = math.gcd(math.gcd(a, b), c)
d[str(t)] = s
return s
else:
return d[str(t)]
for a in range(1, k+1):
for b in range... | 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)
| p02713 |
def gcd(a, b):
if a % b == 0:
return b
else:
return gcd(b, a % b)
K = int(eval(input()))
total = 0
for a in range(1, K+1):
for b in range(1, K+1):
tmp = gcd(a, b)
for c in range(1, K+1):
total += gcd(tmp, 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):
tmp = gcd(a, b)
for c in range(1, K+1):
total += gcd(tmp, c)
print(total)
| p02713 |
import math
K = int(eval(input()))
ans = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
ans += math.gcd(math.gcd(a, b),c)
print(ans) | def gcd(a,b):
while b!=0:
a,b=b,a%b
return a
K = int(eval(input()))
ans = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
ans += gcd(gcd(a, b),c)
print(ans) | p02713 |
from math import gcd
def main():
k = int(eval(input()))
r = 0
for ia in range(1, k + 1):
for ib in range(1, k + 1):
for ic in range(1, k + 1):
t1 = gcd(ib, ic)
r += gcd(t1,ia)
print(r)
if __name__ == '__main__':
main() | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from math import gcd
def main():
k = int(eval(input()))
r = 0
for i1 in range(1, k + 1):
for i2 in range(1, k + 1):
for i3 in range(1, k + 1):
t1 = gcd(i1, i2)
r += gcd(t1, i3)
... | p02713 |
k = int(eval(input()))
ans = []
def gcd(a, b):
while b:
a, b = b, a % b
return a
from itertools import product
for (x1, x2, x3) in product(list(range(1, k+1)), repeat=3):
ans.append(gcd(gcd(x1, x2), x3))
print((sum(ans)))
| k = int(eval(input()))
ans = []
def gcd(a, b):
while b:
a, b = b, a % b
return a
ans = [
gcd(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((sum(ans)))
| p02713 |
import math
from functools import reduce
import itertools
def gcd(numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
koho = list(range(1,k+1))*3
ans = 0
for i in set(list(itertools.combinations(koho, 3))):
ans += gcd(list(i))
print(ans) | k = int(eval(input()))
hoge = [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, 1280... | p02713 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
sum = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
sum += gcd(a,b,c)
print(sum)
| import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(eval(input()))
sum = 0
for a in range(1,k+1):
for b in range(1,k+1):
if gcd(a,b) == 1:
sum += 1 * k
continue
for c in range(1,k+1):
sum += gc... | p02713 |
import math
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):
#print(a,b,c)
tmp = (math.gcd(math.gcd(a,b),c))
res += tmp
print(res) | import math
K = int(eval(input()))
res=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):
#print(a,b,c)
res += math.gcd(tmp,c)
print(res) | p02713 |
import math
K = int(eval(input()))
K +=1
ans = 0
for i in range(1,K):
for j in range(1,K):
for k in range(1,K):
ans += math.gcd(math.gcd(i,j),k)
print(ans) | import math
K = int(eval(input()))
K +=1
ans = 0
for i in range(1,K):
ans += math.gcd(i,i)
for j in range(i+1,K):
ans += 6 * math.gcd(i,j)
for k in range(j+1,K):
ans += 6 * math.gcd(math.gcd(i,j),k)
print(ans) | p02713 |
k=int(eval(input()))
import math
x=0
c=0
d=0
for i in range(1,k+1):
for j in range(i,k+1):
for k in range(j,k+1):
d=math.gcd(i,j)
c=math.gcd(d,k)
if i!=j and j!=k:
x+=6*c
elif i==j==k:
x+=c
else:
x+=3*c
print(x) | k=int(eval(input()))
import math
x=0
c=0
d=0
for i in range(1,k+1):
for j in range(i,k+1):
for k in range(j,k+1):
d=math.gcd(i,j)
c=math.gcd(d,k)
if i!=j and j!=k:
x+=6*c
elif (i!=j and j==k) or (k!=i and i==j):
x+=3*c
else:
x+=c
print(x) | p02713 |
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)
gcd2=gcd(p,q)
cnt+=gcd(gcd1,gcd2)
print(cnt)
| 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
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):
result += math.gcd(math.gcd(a, b), c)
print(result) | import math
import itertools
k = int(eval(input()))
result = 0
for a in range(1, k+1):
for b in range(a+1, k+1):
for c in range(b+1, k+1):
r = math.gcd(math.gcd(a, b), c)
r *= 6
result += r
for a in range(1, k+1):
for b in range(a+1, k+1):
r = math.gcd(a, b)
r *= 6
... | 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):
g = math.gcd(math.gcd(a, b), c)
s += g
print(s)
| k = int(eval(input()))
from math import gcd
s = 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):
s += gcd(g, c)
print(s)
| p02713 |
import math
k = int(eval(input()))
ans = 0
for i in range(1, k+1):
for j in range(1, k+1):
for l in range(1, k+1):
ans += math.gcd(math.gcd(i,j), l)
print(ans)
| import math
def main():
k = int(eval(input()))
ans = 0
gcd = math.gcd
for i in range(1, k+1):
for j in range(1, k+1):
for l in range(1, k+1):
ans += gcd(gcd(i,j), l)
print(ans)
main() | p02713 |
import math
def main():
k = int(eval(input()))
ans = 0
gcd = math.gcd
for i in range(1, k+1):
for j in range(1, k+1):
for l in range(1, k+1):
ans += gcd(gcd(i,j), l)
print(ans)
main() | import math
def main():
k = int(eval(input()))
ans = 0
gcd = math.gcd
for i in range(1, k+1):
for j in range(1, k+1):
ij = gcd(i,j)
for l in range(1, k+1):
ans += gcd(ij, l)
print(ans)
main()
| p02713 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.