input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
ans = 0
for a in range(1, n+1):
b=1
while n-a*b>0:
ans += 1
b+=1
print(ans)
| n = int(eval(input()))
ans = 0
for a in range(1, n+1):
b=1
while n>a*b:
ans += 1
b+=1
print(ans)
| p02548 |
import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
# from decimal import Decimal
# from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip(... | import sys
import os
import math
import bisect
import itertools
import collections
import heapq
import queue
import array
# 時々使う
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
# from decimal import Decimal
# from collections import defaultdict, deque
# 再帰の制限設定
sys.setrecursionli... | p02548 |
N = int(eval(input()))
ans = 0
for i in range(1, N):
if N % i == 0:
ans += (N // i) - 1
else:
ans += N // i
print(ans)
| N = int(eval(input()))
ans = 0
for i in range(1, N):
ans += (N-1) // i
print(ans)
| p02548 |
N=int(eval(input()))
ans=0
for i in range(1,N):
if N%i!=0:
for j in range(1,N//i+1):
a=i*j+N-i*j
if a==N:
ans+=1
else:
for j in range(1,N//i):
a=i*j+N-i*j
if a==N:
ans+=1
print(ans) | N=int(eval(input()))
ans=0
for i in range(1,N):
if N%i!=0:
for j in range(1,N//i+1):
ans+=1
else:
for j in range(1,N//i):
ans+=1
print(ans) | p02548 |
n = int(eval(input()))
count = 0
for a in range(1,n):
for b in range(1,n):
if a*b<n:
count+=1
else:
break
print(count) | n = int(eval(input()))
count = 0
for a in range(1,n):
if n%a==0:
b = n//a - 1
else:
b = n//a
count+=b
print(count) | p02548 |
n = int(eval(input()))
ans = 0
for a in range(1, n):
for b in range(1, n):
if a * b < n:
ans += 1
else:
break
print(ans)
| n = int(eval(input()))
print((sum((n - 1) // a for a in range(1, n)))) | p02548 |
n=int(eval(input()))
count=0
for i in range(1,n):
wan=n//i
for j in range(1,wan+1):
charo=i*j
if charo>=n:
break
else:
count+=1
else:
continue
print(count) | n=int(eval(input()))
count=0
for i in range(1,n):
if i>=n/2:
count+=1
continue
else:
syou,amari=divmod(n,i)
if amari==0:
count+=syou-1
else:
count+=syou
print(count) | p02548 |
a = int(eval(input()))
cnt = 1
count =0
for i in range(1,a):
for j in range(1,a):
c = i*j
num = a-c
if num >0:
count +=1
else:
break
print(count) | a = int(eval(input()))
cnt = 1
count =0
for i in range(1,a):
for j in range(1,a):
if a>i*j:
count +=1
else:
break
print(count) | p02548 |
n = int(eval(input()))
ans = 0
for i in range(1, n):
for j in range(1, (n - 1) // i + 1):
if i * j <= n - 1:
ans += 1
print(ans) | n = int(eval(input()))
ans = 0
for i in range(1, n):
ans += (n - 1) // i
print(ans) | p02548 |
N = int(eval(input()))
count = 0
for A in range(1,N):
for B in range(1,int(N/A)+1+1):
if N - A * B >= 1:
count += 1
print(count) | N = int(eval(input()))
count = 0
for A in range(1,int((N)**0.5)+2):
for B in range(A,int((N)/A)+2):
if A*B < N:
count += 1
if A != B:
count += 1
print(count) | p02548 |
from bisect import bisect_right
N = int(eval(input()))
num = [i for i in range(1, N)]
cnt = 0
for a in range(1, N):
n = (N - 1) // a
b = bisect_right(num, n)
cnt += b
print(cnt)
| N = int(eval(input()))
cnt = 0
for a in range(1, N):
n = (N - 1) // a
cnt += n
print(cnt)
| p02548 |
N = int(eval(input()))
ans = 0
i = 1
while i < N:
j = 1
while i*j < N:
ans += 1
j += 1
i+= 1
print(ans)
| N = int(eval(input()))
ans = 0
i = 1
while i**2 < N:
j = i
while i*j < N:
if i == j:
ans += 1
else:
ans += 2
j += 1
i+= 1
print(ans)
| p02548 |
import itertools
N = int(eval(input()))
ans = 0
for a in range(2,N - 1):
for b in range(2,N - 1):
if a * b < N:
ans += 1
elif a * b >= N:
break
print((ans + ((N - 1) * 2 - 1))) | import math
N = int(eval(input()))
ans = 0
for a in range(1,N):
ans = ans + math.floor((N - 1)/a)
print(ans) | p02548 |
n = int(eval(input()))
ans = 0
for a in range(1, n):
for b in range(1, n):
if a * b < n:
ans += 1
else:
break
print(ans) | n = int(eval(input()))
ans = 0
for a in range(1, n):
ans += (n - 1) // a
print(ans) | p02548 |
n = int(eval(input()))
ans = 0
for a in range(1, n+1):
for b in range(1, n+1):
if a*b < n:
ans += 1
else:
break
print(ans) | n = int(eval(input()))
ans = 0
for a in range(1, n+1):
ans += (n-1)//a
print(ans) | p02548 |
N = int(eval(input()))
count = 0
for i in range(N - 1):
A = i + 1
for j in range(N-1):
B = j + 1
if A * B < N:
count += 1
else:
break
print(count) | N = int(eval(input()))
count = 0
for i in range(N - 1):
A = i + 1
B = N / A
if B == int(B):
count += B-1
else:
count += int(B)
print((int(count))) | p02548 |
N = int(eval(input()))
counter = 0
for A in range(1,N):
for B in range(1,N//A+1):
if 0< N - A*B:
counter += 1
print(counter) | N = int(eval(input()))
counter = 0
for A in range(1,N):
for B in range(1,N//A+1):
if 0 < A*B < N:
counter += 1
print(counter) | p02548 |
n = int(eval(input()))
count = 0
for a in range(1,n+1):
for b in range(1,(n//a)+1):
if n-b*a > 0:
count += 1
print(count) | n = int(eval(input()))
count = 0
for a in range(1,n):
count += (n-1)//a
print(count) | p02548 |
N = int(eval(input()))
cnt = 0
for A in range(1, N):
for B in range(1, N // A + 1):
if A * B < N:
cnt += 1
print(cnt) | N = int(eval(input()))
cnt = 0
for A in range(1, N):
for B in range(1, (N - 1) // A + 1):
cnt += 1
print(cnt) | p02548 |
N=int(eval(input()))
c=0
for i in range(1,N+1):
for j in range(1,N+1):
if i*j<N:
c+=1
else:
break
print(c) | N=int(eval(input()))
c=0
for i in range(1,N+1):
d=(N-1)//i
c+=d
print(c) | p02548 |
n = int(eval(input()))
ans = 0
t = 0
J = 0
for i in range(1,n):
for j in range(i,n):
if i*j >= n:break
if i == j : t+=1
ans +=1
J = j
print((2*ans -t))
| n = int(eval(input()))-1
ans = 0
t = 0
J = 0
for i in range(1,n+1): ans += n//(i)
print(ans) | p02548 |
N = int(eval(input()))
ans = 0
for i in range(1, N):
ans += (N - 1) // i
print(ans)
| N = int(eval(input()))
ans = 0
for a in range(1, N):
ans += (N - 1) // a
print(ans)
| p02548 |
N=int(eval(input()))
#A,B,C>0 C=N-A*B
count=(N-1)*2-1
for A in range(2,N):
for B in range(2,N):
if N-(A*B)<0:
break
elif N-(A*B)>0:
count+=1
# print(A,B,N-A*B)
print(count) | N=int(eval(input()))
count=0
for A in range(1,N):
count+=int((N-1)/A)
print(count) | p02548 |
N = int(eval(input()))
pair_list = []
ans = 0
for a in range(1, N+1):
b = 1
while (a*b < N):
ans += 1
b += 1
print(ans)
| N = int(eval(input()))
ans = 0
for a in range(1, N+1):
if N%a==0:
b_max = int(N/a)-1
else:
b_max = int(N//a)
ans += b_max
print(ans)
| p02548 |
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n = int(eval(input()))
ans = 0
for a in range(1,n):
if a ** 2 >= n:
break
for b in range(a,n):
if a * b >= n:
break
if a == b:
ans += 1
... | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n = int(eval(input()))
ans = 0
for a in range(1,n):
ans += -(-n//a) - 1
print(ans)
if __name__=='__main__':
main() | p02548 |
n = int(eval(input()))
a = 0
b = 0
c = 0
while a < n:
a+=1
b=0
if a == n:
break
while a*b-n<0:
b+=1
if a*b-n>=0:
break
c+=1
print(c) | n = int(eval(input()))
a = 0
b = 0
c = 0
while a < n:
a+=1
if a == n:
break
if n%a == 0:
c+= n//a - 1
else:
c+= n//a
print(c) | p02548 |
n = int(eval(input()))
res=0
for i in range(1,n):
for j in range(1,n):
if i*j < n:
res+=1
else:
break
print(res) | from math import ceil
n = int(eval(input()))
res=0
for i in range(1,ceil(n/2)):
for j in range(i+1,n):
if i*j < n:
res+=1
else:
break
if int(n**0.5) == n**0.5:
print((res*2 + int(n**0.5) - 1))
else:
print((res*2 + int(n**0.5))) | p02548 |
N = int(eval(input()))
count = 0
for i in range(1, N):
for j in range(1, N):
if i * j < N:
count += 1
else:
break
print(count) | N = int(eval(input()))
count = 0
for i in range(1, N):
count += int(N / i)
if N % i == 0:
count -= 1
print(count) | p02548 |
N = int(eval(input()))
table = [0] * (N+5)
for i in range(1, N+3):
for j in range(i, N+2, i):
table[j] += 1
ans = 0
for i in range(N):
ans += table[i]
print(ans) | N = int(eval(input()))
ans = 0
for i in range(1, N):
ans += (N-1) // i
print(ans) | p02548 |
N=int(eval(input()))
result=0
for A in range(1,N):
for B in range(1,int(N/A)+1):
if (N-A*B)>=1:
result+=1
print(result) | N=int(eval(input()))
result=0
for A in range(1,N):
result+=int((N-1)/A)
print(result) | p02548 |
l = int(eval(input()))
sum = 0
c = 0
for i in range(1,l):
for ii in range(1,l):
sum = i * ii
if sum >= l:
break
else:
c+=1
print(c) | l = int(eval(input()))
sum = 0
c = 0
for i in range(1,l):
for ii in range(i,l):
sum = i * ii
if sum >= l:
break
else:
if i != ii:
c+=2
else:
c+=1
print(c) | p02548 |
N = int(eval(input()))
A = 1
B = 1
p = 0
while A < N:
while A * B < N:
p += 1
B += 1
A += 1
B = 1
print(p) | N = int(eval(input()))
A = 1
B = 1
d = 0
e = 0
while A < N:
while A * B < N:
if A == B:
e += 1
else:
d += 1
B += 1
A += 1
B = A
print((d*2+e)) | p02548 |
# -*- coding: utf-8 -*-
N = int(eval(input()))
count = 0
for A in range(1,N):
for B in range(1,N):
if A*B >= N:
break
else:
count += 1
print(count) | # -*- coding: utf-8 -*-
N = int(eval(input()))
count = 0
for A in range(1,N):
if N % A == 0:
count += (N//A) - 1
else:
count += (N//A)
print(count) | p02548 |
n = int(eval(input()))
count = 0
for a in range(1,n):
for b in range(1,int(n/a)+1):
if n - a * b > 0:
count += 1
print(count)
| n = int(eval(input()))
count = 0
for a in range(1,n):
count += (n-1)//a
print(count) | p02548 |
n = int(eval(input()))
ans = 0
for i in range(1, n):
ans += n//i if n%i != 0 else n//i-1
print(ans)
| n = int(eval(input()))
ans = 0
for i in range(1, n):
ans += (n-1)//i
print(ans) | p02548 |
N=int(eval(input()))
a=1
b=1
count=0
while a<N:
while a*b<N:
count=count+1
b=b+1
else:
b=1
a=a+1
else:
print(count) | N=int(eval(input()))
a=1
count=0
while a<N:
count=count+(N-1)//a
a=a+1
else:
print(count) | p02548 |
z=int(eval(input()))
i=1
re=0
f=3
b=1
while z>i:
b=1
while True:
x=i*b
if z>x:
re+=1
else:
break
b+=1
i+=1
print(re) | z=int(eval(input()))
i=1
re=0
b=1
d=1
while z>i:
b=1
while True:
x=i*(i+b)
if z>x:
re+=2
else:
break
b+=1
i+=1
while True:
if d*d<z:
d+=1
re+=1
else:
break
print(re) | p02548 |
N = int(eval(input()))
cnt = 0
for a in range(1, N):
# print(f'{a=}, {N // a}')
if N % a == 0:
cnt += N // a - 1
else:
cnt += N // a
print(cnt)
| N = int(eval(input()))
cnt = 0
for a in range(1, N):
# print(f'{a=}, {N // a}')
cnt += (N - 1) // a
print(cnt)
| p02548 |
n=int(eval(input()))
ar=3
sv=[0]*(10**6+2)
for i in range(2,len(sv)):
if not sv[i]:
sv[i]=i
for j in range(2*i,len(sv),i):
sv[j]=i
def di(x):
an=1
if sv[x]==x:
return 2
while x>1:
ct=0;cr=sv[x]
while x%cr==0:
ct+=1;x//=cr
an*=(ct+1)
return an
for i in range(4,n+1)... | n=int(eval(input()))
ar=0
for i in range(1,n+1):
ar+=(n-1)//i
print(ar)
| p02548 |
n=int(eval(input()))
c=0
for i in range(1,n+1):
j=1
while j*i<n:
c+=1
j+=1
print(c) | n=int(eval(input()))
c=0
for i in range(1,n):
c+=(n-1)//i
print(c) | p02548 |
n = int(eval(input()))
ans = 0
for i in range(n):
a = i + 1
for j in range(n):
b = j + 1
c = n - a * b
if c <= 0:
break
ans += 1
print(ans) | import math
n = int(eval(input()))
ans = 0
for i in range(n):
a = i + 1
b = 1
c = n - a * b
ans += math.ceil(c / a)
print(ans) | p02548 |
N = int(eval(input()))
def count_comb(a, b):
if a == b:
return 1
else:
return 2
count = 0
for A in range(1, N):
for B in range(A, N):
seki = A*B
if seki > N-1:
break
count += count_comb(A, B)
print(count)
| N = int(eval(input()))
count = 0
for A in range(1, N):
max_a = int((N-1)/A)
# AとBが同じものが1件あるので-1する
count += max_a
print(count)
| p02548 |
N = int(eval(input()))
ct = 0
for a in range(1, N):
for b in range(1, N):
if a*b >= N:
break
ct += 1
print(ct) | N = int(eval(input()))
ct = 0
for i in range(1, N):
if i * i >= N:
break
x = int((N - 1)/i)
ct += (x - i)*2 + 1
print(ct) | p02548 |
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
n=int(eval(input()))
cnt=0
for i in range(1,n+1):
for j in range(1,n+1):
if i*j<n:
cnt+=1
else:
break
print(cnt) | import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
n=int(eval(input()))
cnt=0
for i in range(1,n+1):
for j in range(i+1,n+1):
if i*j<n:
cnt+=2
else:
break
for j in range(1,n+1):
if j*j<n:
c... | p02548 |
def c_a_times_b_plus_c():
N = int(eval(input()))
ans = 0
for a in range(1, N + 1):
for b in range(N // a, 0, -1):
if N - a * b >= 1:
ans += 1
return ans
print((c_a_times_b_plus_c()))
| def c_a_times_b_plus_c():
N = int(eval(input()))
return sum((N - 1) // a for a in range(1, N))
print((c_a_times_b_plus_c())) | p02548 |
import math
t = 1
for tc in range(t):
n = int(eval(input()))
ans = 0
i = 1
while i < n:
j = 1
while i*j < n :
c = n - i*j
if c > 0:
ans += 1
j += 1
i += 1
print(ans)
| import math
t = 1
for tc in range(t):
n = int(eval(input()))
ans = 0
for i in range(1,n+1):
j = 1
ans += (n-1) // i
# while i*j + 1 <= n:
# ans += 1
# j += 1
print(ans)
| p02548 |
n=int(eval(input()))
point=0
for a in range(1, n):
b=1
while a*b<n:
b+=1
point+=1
print(point)
| n = int(eval(input()))
ans = 0
for a in range(1, n):
ans += (n - 1) // a
print(ans) | p02548 |
N = int(eval(input()))
ans = 0
for a in range(1, N+1):
b = 1
while a * b < N:
ans += 1
b += 1
print(ans)
| N = int(eval(input()))
ans = 0
for a in range(1, N+1):
x = N // a
if N % a == 0:
ans += x - 1
else:
ans += x
print(ans) | p02548 |
N=int(eval(input()))
ans=0
for i in range(1,10**6):
for j in range(1,(10**6)//i+1):
if N > i*j:
ans += 1
print(ans) | N=int(eval(input()))
ans=0
for i in range(1,10**6):
for j in range(i,10**6//i+1):
if N > i*j:
if i==j:
ans += 1
else:
ans += 2
print(ans) | p02548 |
n = int(eval(input()))
ans = 0
for a in range(1, n):
for b in range(1, n):
c = n - a * b
if c <= 0:
break
ans += 1
print(ans) | def func(x):
ans = 0
for a in range(1, n):
for b in range(1, n):
c = n - a * b
if c <= 0:
break
ans += 1
return ans
n = int(eval(input()))
print((func(n))) | p02548 |
n = int(eval(input()))
ans = 0
count = 0
a, b, c = 1, 1, 1
while a <= n:
# print("A : {0}".format(a))
while a * b < n:
# print("B : {0}".format(b))
ans += 1
# if c >= n - (a * b) :
# ans += 1
# while a * b + c <= n:
# # pr... |
n = int(eval(input()))
ans = 0
count = 0
a, b, c = 1, 1, 1
while a <= n:
# print("A : {0}".format(a))
# print("追加パターン : {0}".format( (n // a) ))
if a == 1 :
ans = ans + ( (n // a) - 1)
else :
if n // a == 1 :
ans = ans + 1
else :
... | p02548 |
n = int(eval(input()))
ans = 0
count = 0
a, b, c = 1, 1, 1
while a <= n:
# print("A : {0}".format(a))
# print("追加パターン : {0}".format( (n // a) ))
if a == 1 :
ans = ans + ( (n // a) - 1)
else :
if n // a == 1 :
ans = ans + 1
else :
... |
n = int(eval(input()))
ans = 0
a = 1
while a <= n:
if a == 1 :
ans = ans + (n - 1)
else :
if n % a == 0 :
ans = ans + ( (n // a) - 1)
else :
ans = ans + ( (n // a) )
a += 1
print(ans) | p02548 |
N = int(eval(input()))
result = 0
for i in range(1, N + 1):
s = int(N / i) + 1
for j in range(1, s + 1):
if N - i * j > 0:
result = result + 1
else:
break
print(result)
| N = int(eval(input()))
result = 0
for i in range(1, N + 1):
s = int(N / i) + 1
for j in range(s + 1, 0, -1):
if N - i * j > 0:
result = result + j
break
print(result)
| p02548 |
n = int(eval(input()))
ans = 0
for i in range(1, n):
for j in range(1, n):
if i*j >= n:
break
ans += 1
print(ans) | n = int(eval(input()))
ans = 0
for i in range(1, n):
for j in range(i, n):
if i*j >= n:
break
if i == j:
ans += 1
else:
ans += 2
print(ans) | p02548 |
n=int(eval(input()))
cnt=0
for i in range(1,n+1):
for j in range(1,n+1):
if i*j>=n:
break
else:
cnt+=1
print(cnt) | n = int(eval(input()))
ans = 0
for a in range(1, n):
ans += (n - 1) // a
print(ans)
| p02548 |
def f(x):
return pow(x, 2)
while True:
try:
d = int(eval(input()))
except:
break
print((sum(f(x) * d for x in range(d, 600, d)))) | while True:
try:
d = int(eval(input()))
except:
break
print((sum(d * x**2 for x in range(d, 600, d))))
| p00014 |
import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
ans = 0
cnt = [[0]*45 for _ in range(45)]
for _ in range(n):
a = list(map(str, input().rstrip().split(".")))
x = 0
if len(a) == 1:
x = int(a[0]) * 10**9
else:
x ... | import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
ans = 0
cnt = [[0]*20 for _ in range(45)]
for _ in range(n):
a = list(map(str, input().rstrip().split(".")))
x = 0
if len(a) == 1:
x = int(a[0]) * 10**9
else:
x ... | p02588 |
# problem a
# score 300
from collections import defaultdict
N = int(eval(input()))
A = []
from decimal import Decimal
for i in range(N):
x = float(eval(input()))
x = Decimal(x*(10**9))
A.append(x)
remove = 0
for i in range(N):
if (A[i]**2) % (10**18) == 0:
remove += 1
D = defaultdi... | # problem a
# score 300
from collections import defaultdict
N = int(eval(input()))
A = []
for i in range(N):
x = float(eval(input()))
x = "{:.9f}".format(x)
x=int(x[:-10]+x[-9:])
A.append(x)
remove = 0
for i in range(N):
if (A[i]**2) % (10**18) == 0:
remove += 1
D = defaultdict... | p02588 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | import sys
def I(): return int(sys.stdin.readline().rstrip())
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
N = I()
A = [] # A[i] = A_iが2,5で各々何回割り切れるか
for _ in range(N):
a = LS2()
if not '.' in a:
a = int(''.join(a))
b,c = 0,0
while a % 2 == 0:
a ... | p02588 |
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと
def a_int(): return int(read... | import sys
read = sys.stdin.readline
ra = range
enu = enumerate
def a_int(): return int(read())
from itertools import product
# 画像でおいた自分の解説見て
N = a_int()
B = []
for _ in ra(N):
A = read()[:-1] # floatで扱うと誤差で死ぬ
if '.' not in A:
A += '.'
for _ in range(9 - A[::-1].index('.'))... | p02588 |
N, *A = open(0).read().split()
class BIT():
def __init__(self, n, x=1):
self.n = n
self.T = [[0]*20 for _ in [0]*20]
def add(self, i, y, x):
i += 1
y += 1
while i <= self.n:
j = y
while j <= self.n:
self.T[i][j] += ... | import sys
input = sys.stdin.readline
N = int(eval(input()))
T = [[0]*19 for _ in [0]*19]
def count25(x):
c2 = c5 = 0
while x % 2 == 0:
x //= 2
c2 += 1
while x % 5 == 0:
x //= 5
c5 += 1
return c2, c5
for _ in range(N):
a, *b = input().split('.')
... | p02588 |
from collections import defaultdict
def decomp(m):
pf=defaultdict(int)
for i in range(2,int(m**0.5)+1):
while m%i==0:
pf[i]+=1
m//=i
if m>1:pf[m]=1
return (pf[2], pf[5])
n=int(eval(input()))
table=[[0]*50 for _ in range(50)]
ans=0
for i in range(n):
a=e... | def decomp(m):
p2=0
p5=0
while m%2==0:
m//=2
p2+=1
while m%5==0:
m//=5
p5+=1
return p2,p5
n=int(eval(input()))
table=[[0]*50 for _ in range(50)]
ans=0
for i in range(n):
a=input().split('.')
if len(a)==1:
ax=int(a[0]+'0'*9)
else:... | p02588 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutati... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutati... | p02588 |
def five(x):
cnt1 = 0
while x%5==0:
cnt1+= 1
x = x//5
cnt2 = 0
while x%2==0:
cnt2+= 1
x = x//2
return (min(cnt1,18), min(cnt2,18))
N = int(eval(input()))
F = []
for i in range(N):
A = float(eval(input()))
A = round(A*(10**9))
F.append(fi... | def five(x):
cnt1 = 0
while x%5==0:
cnt1+= 1
x = x//5
cnt2 = 0
while x%2==0:
cnt2+= 1
x = x//2
return (min2(cnt1,18), min2(cnt2,18))
def min2(x,y):
return x if x < y else y
import sys
input = sys.stdin.readline
N = int(eval(input()))
F = []
f... | p02588 |
import sys
readline = sys.stdin.readline
from math import floor
from decimal import Decimal
N = int(readline())
A = [Decimal(readline()) for _ in range(N)]
G = 10**10
Aint = [int(a) for a in A if int(a) == a]
Afl = [int(a*G) for a in A if int(a) != a]
H = 200
geta = 100
Grid = [[0]*H for _ in range... | import sys
readline = sys.stdin.readline
G = 10**10
lai = 0
def Decimal(x):
global lai
a = x.strip().split('.')
if len(a) == 1 or all([ai == '0' for ai in a[1]]):
lai += 1
return int(a[0])*G
lf = len(a[1])
i, f = list(map(int, a))
return (i*10**(lf) + f)*1... | p02588 |
#AGC047-A Integer Product
"""
小数または整数が与えられるので、その積が整数となるペアの個数を求めよ。
まず入力に10**9をかけることで、
問題を「その積が10**18の倍数となるペアの個数を求めよ」
とする。
その場合、とりあえず10**18を素因数分解すると2**18と5**18なので、
片方が因数分解済みであるとした時に、
dp[i][j] : 2**iかつ5**jの個数
として、もう片方を2**aかつ5**bであると考えた時に、
2**(i+a)>=18かつ5**(j+b)>=18となるならば、それは条件を満たす
と考えられる。
よってこの個数を数えることで問題が... | #AGC047-A Integer Product
"""
小数または整数が与えられるので、その積が整数となるペアの個数を求めよ。
まず入力に10**9をかけることで、
問題を「その積が10**18の倍数となるペアの個数を求めよ」
とする。
その場合、とりあえず10**18を素因数分解すると2**18と5**18なので、
片方が因数分解済みであるとした時に、
dp[i][j] : 2**iかつ5**jの個数
として、もう片方を2**aかつ5**bであると考えた時に、
2**(i+a)>=18かつ5**(j+b)>=18となるならば、それは条件を満たす
と考えられる。
よってこの個数を数えることで問題が... | p02588 |
from collections import defaultdict
N = int(eval(input()))
b = 10**9
A = [int(round(float(eval(input()))*b)) for i in range(N)]
dic = defaultdict(int)
for a in A:
c2, c5 = 0, 0
while a % 2 == 0:
c2 += 1
a //= 2
while a % 5 == 0:
c5 += 1
a //= 5
dic[(c2, c5)... | from collections import defaultdict
N = int(eval(input()))
b = 10**9
A = [int(round(float(eval(input()))*b)) for i in range(N)]
dic = defaultdict(int)
for a in A:
c2, c5 = 0, 0
while a % 2 == 0 and c2 < 18:
c2 += 1
a //= 2
while a % 5 == 0 and c5 < 18:
c5 += 1
... | p02588 |
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from co... | import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from co... | p02588 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
MAX = 50
def resolve():
n = int(eval(input()))
D = [[0] * MAX for _ in range(MAX)]
for _ in range(n):
a = int(round(float(eval(input())) * 10 ** 9))
t = a
x... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 998244353
def resolve():
n = int(eval(input()))
A = []
for _ in range(n):
a = float(eval(input()))
a = round(a * 10 ** 9 + 0.1)
A.append(a)
L = [[0] * 25 for _ in r... | p02588 |
# -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
###... | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
###... | p02588 |
N = int(eval(input()))
A = [0] * N
for i in range(N):
A[i] = round(float(eval(input()))*(10**9))
from itertools import combinations
base = list(combinations(A,2))
floatans=0
for i in range(len(base)):
a=base[i][0]*base[i][1]
if a%(10**18)==0:
floatans+=1
print(floatans) | N = int(eval(input()))
A = [0] * N
for i in range(N):
A[i] = round(float(eval(input()))*(10**9))
floatans=0
for i in range(N):
for j in range(i+1,N):
if (A[i]*A[j])%(10**18)==0:
floatans+=1
print(floatans) | p02588 |
from fractions import Fraction
from decimal import Decimal
n = int(eval(input()))
a = []
b = []
for i in range(0,n):
c = float(eval(input()))
a.append(c)
d = str(a[i])
f = Fraction(Decimal(d))
b.append(f)
x = []
y = []
for i in range(0,n):
x.append(b[i].numerator)
y.append(b[i].denominator)
... | from math import gcd
from collections import Counter
import sys
N = int(eval(input()))
K = 10**9
L = 10**18
A = [0] * N
C = Counter()
ans = 0
for i in range(N):
A[i] = round(K * float(eval(input())))
C[gcd(A[i],L)] += 1
for k1,v1 in list(C.items()):
for k2 ,v2 in list(C.items()):
if k1 == k2:... | p02588 |
import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int... | import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int... | p02588 |
N, *A = open(0).read().split()
S = [[0] * 21 for _ in range(21)]
ans = 0
for a in A:
if (idx := a.find(".")) == -1:
c2 = c5 = 0
else:
c2 = c5 = -(len(a) - idx - 1)
a = int(a.replace(".", ""))
while a % 2 == 0:
c2 += 1
a //= 2
while a % 5 == 0:
... | N, *A = open(0).read().split()
S = [[0] * 21 for _ in range(21)]
ans = 0
for a in A:
idx = a.find(".")
if idx == -1:
c2 = c5 = 0
else:
c2 = c5 = -(len(a) - idx - 1)
a = int(a.replace(".", ""))
while a % 2 == 0:
c2 += 1
a //= 2
while a % 5 == 0:
... | p02588 |
N=int(eval(input()))
A=[]
PRECISION_DIGITS=9
cnt={}
for n in range(N):
tmpA = float(eval(input()))
tmpA = round(tmpA*(10**PRECISION_DIGITS))
#print(tmpA)
two = 0
five = 0
while (tmpA % 2) == 0:
two += 1
tmpA /= 2
while (tmpA % 5) == 0:
five += 1
tmpA /= 5
if (two,five) in cnt:
... | N=int(eval(input()))
A=[]
PRECISION_DIGITS=9
cnt={}
for n in range(N):
tmpA = float(eval(input()))
tmpA = round(tmpA*10**PRECISION_DIGITS)
#print(tmpA)
five = 0
two = 0
while (tmpA % 2) == 0:
two += 1
tmpA //= 2
while (tmpA % 5) == 0:
five += 1
tmpA //= 5
# (10**9) -> (two,five)=... | p02588 |
import collections
N=int(eval(input()))
A=[]
PRECISION_DIGITS=9
cnt=collections.defaultdict(int)
for n in range(N):
tmpA = float(eval(input()))
tmpA = round(tmpA*10**PRECISION_DIGITS)
#print(tmpA)
five = 0
two = 0
while (tmpA % 2) == 0:
two += 1
tmpA //= 2
while (tmpA % 5) == 0:
five... | # import collections
N=int(eval(input()))
A=[]
PRECISION_DIGITS=9
cnt={} #collections.defaultdict(int)
for n in range(N):
tmpA = float(eval(input()))
tmpA = round(tmpA*10**PRECISION_DIGITS)
#print(tmpA)
five = 0
two = 0
while (tmpA % 2) == 0:
two += 1
tmpA //= 2
while (tmpA % 5) == 0:
... | p02588 |
from decimal import Decimal
def waru(N,num):
cnt = 0
while N%num==0:
N //= num
cnt += 1
return cnt
def solve():
N = int(eval(input()))
num = [[0]*101 for _ in range(101)]
lis = [0]*N
for i in range(N):
a = int(round(float(eval(input()))*10**9))
p,q = waru(a,2)-9-50,waru(a,5)-9... | import sys
input = sys.stdin.readline
def waru(N,num):
cnt = 0
while N%num==0:
N //= num
cnt += 1
return cnt
def solve():
N = int(eval(input()))
num = [[0]*101 for _ in range(101)]
lis = [0]*N
for i in range(N):
a = int(round(float(eval(input()))*10**9))
p,q = waru(a,2)-9-50,... | p02588 |
c=eval('[0]*50,'*50)
r=0
for a in[*open(0)][1:]:
a=round(float(a)*10**9);x=y=0
while a%2<1:a//=2;x+=1
while a%5<1:a//=5;y+=1
r+=sum(sum(d[max(0,18-y):])for d in c[max(0,18-x):]);c[x][y]+=1
print(r) | c=eval('[0]*50,'*50)
r=0
for a in[*open(0)][1:]:
a=round(float(a)*1e9);x=y=0
while a%2<1:a//=2;x+=1
while a%5<1:a//=5;y+=1
r+=sum(sum(d[max(0,18-y):])for d in c[max(0,18-x):]);c[x][y]+=1
print(r) | p02588 |
c=eval('[0]*50,'*50)
r=0
for a in[*open(0)][1:]:
a=round(float(a)*1e9);x=y=1
while a%2**x<1:x+=1
while a%5**y<1:y+=1
r+=sum(sum(d[max(0,20-y):])for d in c[max(0,20-x):]);c[x][y]+=1
print(r) | c=eval('[0]*50,'*50)
r=0
for a in[*open(0)][1:]:
a=round(float(a)*1e9);y=1
while a%5**y<1:y+=1
x=len(bin(a&-a));r+=sum(sum(d[max(0,20-y):])for d in c[max(0,24-x):]);c[x][y]+=1
print(r) | p02588 |
from collections import defaultdict
def conv(s):
if "." not in s:
s += '.'
s = s.rstrip('0')
t = len(s) - s.find('.') - 1
a = int(s.replace('.', ''))
if a == 0:
return (0, 0)
x, y = -t, -t
while a % 5 == 0:
x += 1
a //= 5
y += len(bin(a&-a))... | import sys
from collections import defaultdict
from math import gcd
def input(): return sys.stdin.readline().strip()
K = 10**9
L = 10**18
D = defaultdict(int)
for _ in range(int(eval(input()))):
D[gcd(round(float(eval(input())) * K), L)] += 1
D = tuple(D.items())
ans = 0
for i, (k1, v1) in enumerat... | p02588 |
import bisect
from decimal import Decimal
N, *A = [Decimal(_) for _ in open(0).read().split()]
N = int(N)
c = [[0, 0] for _ in range(N)]
for i, a in enumerate(A):
a = int(a * 10**9)
while True:
if a % 2:
break
c[i][0] += 1
a //= 2
while True:
if a % 5... | import bisect
from decimal import Decimal
N, *A = open(0).read().split()
N = int(N)
c = [[0, 0] for _ in range(N)]
for i, a in enumerate(A):
if '.' in a:
p, q = a.split('.')
q += '0' * (9 - len(q))
else:
p = a
q = '0' * 9
a = int(p + q)
while True:
i... | p02588 |
def div(n, d):
cnt = 0
while n % d == 0 and cnt < 18:
n //= d
cnt += 1
return cnt
n = int(eval(input()))
dp = [[0]*19 for _ in range(19)]
#dp[i][j] -> 2の素因数がi以上,5の素因数がj以上の数字の数
ans = 0
for _ in range(n):
x = round(float(eval(input())) * pow(10, 9))
two = div(x, 2)
... | """
小数の状態だと処理しづらいので、与えられた数を全て10**9倍して小数を確実になくした上で
問題文を下記のように言い換える。
「積が10**18の倍数になるような数の組み合わせの数がいくつあるか」
数Aiがあり、Aiの2の素因数の数がn, 5の素因数の数がmのとき、
数Ai自体ですでにmin(n,m)個の0の数を持っている。この場合、のこり必要な0の数はx = 18-min(n,m)個である。
ここで、n == mの場合：
Aiの相方は少なくとも2,5の素因数をそれぞれx個以上持っていなくてはならない。
n > mの場合：
Aiの相方は少なくとも2の素因数をx-(n-m)個、5の素因数をx個持っていなくては... | p02588 |
import sys
readline = sys.stdin.readline
N = int(readline())
C = [[0] * 19 for i in range(19)]
for i in range(N):
a = readline().rstrip()
if "." in a:
keta = len(a.split(".")[1])
a = int(a.replace(".","")) * (10 ** (9 - keta))
else:
a = int(a) * (10 ** 9)
temp = a
cnt2 = 0
cnt... | import sys
readline = sys.stdin.readline
N = int(readline())
C = [[0] * 19 for i in range(19)]
for i in range(N):
a = readline().rstrip()
if "." in a:
keta = len(a.split(".")[1])
a = int(a.replace(".","")) * (10 ** (9 - keta))
else:
a = int(a) * (10 ** 9)
cnt2 = 0
cnt5 = 0
whi... | p02588 |
a=[2,3,5,10,12,15]
b=[380,550,850,1520,1870,2244]
while 1:
n=int(eval(input()))
if n==0:break
n//=100
dp=[0]+[1<<29]*n
for i in range(5,-1,-1):
for j in range(n+1):
if j+a[i]<=n and dp[j]!=1<<29:dp[j+a[i]]=min(dp[j+a[i]],dp[j]+b[i])
print((dp[n])) | a=[(2,380),(3,550),(5,850),(10,1520),(12,1870),(15,2244)]
dp=[1<<20]*51
for i,j in a:
dp[i]=j
for k in range(51-i):
if dp[k]!=1<<20 and dp[k+i]>dp[k]+j:
dp[k+i]=dp[k]+j
while 1:
n=int(eval(input()))
if n==0:break
print((dp[n//100])) | p00106 |
while True:
N = int(eval(input()))
if N==0: break
ans = float('inf')
for c200 in range(N//200+1):
for c300 in range(N//300+1):
for c500 in range(N//500+1):
if 200 * c200 + c300 * 300 + c500 * 500 == N:
ans = min(ans, 1520*(c200//5)+380*(c200%5)+1870*(c300//4)+550*(c300%4)+2244*(c500//3)+850*(c... | a=[1e4]*51
for i,j in[(2,380),(3,550),(5,850),(10,1520),(12,1870),(15,2244)]:
a[i]=j
for k in range(51-i):
if a[k+i]>a[k]+j:a[k+i]=a[k]+j
for n in iter(input,'0'):print((a[int(n)//100]))
| p00106 |
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0106&lang=jp
"""
import sys
def solve(amount):
"""
:param amount: ?????\???????????°?????????
:return: ?????????
"""
best_price = (amount + 199) // 200 * 380
for a in range(amount // 200 + 1):
... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0106&lang=jp
"""
import sys
def solve(amount):
"""
:param amount: ?????\???????????°?????????
:return: ?????????
"""
best_price = (amount + 199) // 200 * 380
for a in range(amount // 200 + 1):
... | p00106 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
class Node(object):
__slots__ = ('parent', 'depth', 'type', 'children')
def __init__(self):
self.parent = -1
self.type = ''
self.depth = 0
self.children = []
def dfs(node_idx, node_list, d=0):
n... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
class Node(object):
__slots__ = ('parent', 'depth', 'type', 'children')
def __init__(self):
self.parent = -1
self.type = ''
self.depth = 0
self.children = []
def dfs(node_idx, node_list, depth=0):
... | p02279 |
"""Rooted Trees."""
class Node:
def __init__(self, num, parent, *children):
self.id = num
self.parent = parent
self.children = list(children)
self.depth = 0
def show_info(self):
print('node {0}: '.format(self.id), end = '')
print('parent = {0}... | class Node:
def __init__(self, num, parent, *children):
self.id = num
self.parent = parent
self.children = list(children)
self.depth = 0
def show_info(self):
print('node {0}: '.format(self.id), end = '')
print('parent = {0}, '.format(self.parent)... | p02279 |
class Node:
def __init__(self, num, parent, children):
self.id = num
self.parent = -1
self.children = children
self.depth = 0
def show_info(self):
print('node {0}: '.format(self.id), end = '')
print('parent = {0}, '.format(self.parent), end = '')... | class Node:
def __init__(self, num, parent, children):
self.id = num
self.parent = -1
self.children = children
self.depth = 0
def show_info(self):
print('node {0}: '.format(self.id), end = '')
print('parent = {0}, '.format(self.parent), end = '')... | p02279 |
class Node:
def __init__(self, num, parent, children):
self.id = num
self.parent = -1
self.children = children
self.depth = 0
def show_info(self):
print('node {0}: '.format(self.id), end = '')
print('parent = {0}, '.format(self.parent), end = '')... | class Node:
def __init__(self, num, parent, children):
self.id = num
self.parent = -1
self.depth = 0
self.type = None
self.children = children
def show_info(self):
print(('node {0}: parent = {1}, depth = {2}, {3}, {4}'.format(self.id,
... | p02279 |
# -*- coding: utf-8 -*-
class Node_Class():
def __init__(self, c_list):
self.c_list = c_list
n = int(input())
node_dic = {}
p_list = [0]*n
d_list = [0]*n
t_list = ['']*n
for i in range(n):
line = list(map(str, input().split()))
if int(line[1]) > 0:
node_dic[int(line[0])] = No... | # -*- coding: utf-8 -*-
class Node_Class():
def __init__(self, c_list):
self.c_list = c_list
n = int(input())
node_dic = {}
p_list = [0]*n
d_list = [0]*n
t_list = ['']*n
root = 0
for i in range(n):
root += i
for i in range(n):
line = list(map(str, input().split()))
if int(line[... | p02279 |
def q(a,h):
d[a]=str(h)
for b in t[a]:q(b,h+1)
t,p,d={},{},{}
for _ in[0]*int(eval(input())):
e=input().split()
t[e[0]]=e[2:]
for i in e[2:]:p[i]=e[0]
r=(set(t)-set(p)).pop()
p[r]='-1'
q(r,0)
for i in sorted(map(int,t)):
i=str(i)
f='root'if'-1'==p[i]else'internal node'if t[i]else'leaf'
print(f'nod... | def q(a,h):
d[a]=str(h)
for b in t[a]:q(b,h+1)
t,p,d={},{},{}
for _ in[0]*int(eval(input())):
e=input().split()
t[e[0]]=e[2:]
for i in e[2:]:p[i]=e[0]
r=(set(t)-set(p)).pop()
p[r]='-1'
q(r,0)
for i in sorted(map(int,t)):i=str(i);print(f"node {i}: parent = {p[i]}, depth = {d[i]}, {'root'if'-1'==p[i]else'... | p02279 |
def q(a,h):
d[a]=str(h)
for b in t[a]:q(b,h+1)
t,p,d={},{},{}
for _ in[0]*int(eval(input())):
e=input().split()
t[e[0]]=e[2:]
for i in e[2:]:p[i]=e[0]
r=(set(t)-set(p)).pop()
p[r]='-1'
q(r,0)
print(('\n'.join(f"node {i}: parent = {p[i]}, depth = {d[i]}, {'root'if'-1'==p[i]else'internal node'if t[i]else'... | import sys
def q(a,h):
d[a]=str(h)
for b in t[a]:q(b,h+1)
t,p,d={},{},{}
eval(input())
for e in sys.stdin:
e=e.split()
t[e[0]]=e[2:]
for i in e[2:]:p[i]=e[0]
r=(set(t)-set(p)).pop()
p[r]='-1'
q(r,0)
print(('\n'.join(f"node {i}: parent = {p[i]}, depth = {d[i]}, {'root'if'-1'==p[i]else'internal node'if ... | p02279 |
class Tree:
def __init__(self):
self.id = 0
self.p = -1
self.depth = -1
self.type = "leaf"
self.len_c = 0
self.c = []
def __str__(self):
return f"node {self.id}: parent = {self.p}, depth = {self.depth}, {self.type}, {self.c}"
n = int(eval(input()... | import sys
readline = sys.stdin.readline
class Tree:
def __init__(self):
self.id = 0
self.p = -1
self.depth = -1
self.type = "leaf"
self.len_c = 0
self.c = []
def __str__(self):
return f"node {self.id}: parent = {self.p}, depth = {self.depth}, {... | p02279 |
import sys
readline = sys.stdin.readline
class Tree:
def __init__(self):
self.id = 0
self.p = -1
self.depth = -1
self.type = "leaf"
self.len_c = 0
self.c = []
def __str__(self):
return f"node {self.id}: parent = {self.p}, depth = {self.depth}, {... | import sys
readline = sys.stdin.readline
class Tree:
__slots__ = ['id', 'p', 'depth', 'type', 'len_c', 'c']
def __init__(self):
self.id = 0
self.p = -1
self.depth = -1
self.type = "leaf"
self.len_c = 0
self.c = []
def __str__(self):
return ... | p02279 |
import sys
readline = sys.stdin.readline
class Tree:
__slots__ = ['id', 'p', 'depth', 'type', 'c']
def __init__(self):
self.id = 0
self.p = -1
self.depth = -1
self.type = "leaf"
self.c = []
def __str__(self):
return f"node {self.id}: parent = {self.... | import sys
readline = sys.stdin.readline
class Tree:
__slots__ = ['id', 'p', 'depth', 'type', 'c']
def __init__(self):
self.id = 0
self.p = -1
self.depth = -1
self.type = "leaf"
self.c = []
def __str__(self):
return f"node {self.id}: parent = {self.... | p02279 |
class Tree:
nodes = []
def __init__(self, root = None):
self.root = root
def insert(self, label, children = []):
self.nodes.append(Node(label, children))
def search_label(self, label):
for i in self.nodes:
if i.label == label:
return i
de... | class Tree:
nodes = []
def __init__(self, root = None):
None
def insert(self, label, children = []):
if children != []:
for i in children:
self.nodes[label].children.append(self.nodes[i])
self.nodes[i].parent = self.nodes[label]
... | p02279 |
# coding: utf-8
# Here your code !
from collections import deque
class Node:
def __init__(self):
self.id = -1
self.k = -1
self.depth = -1
self.parent = -1
self.type = 'root'
self.end = False
self.children = []
def find_root_id(nodes):
... | # coding: utf-8
from collections import deque
class Node:
def __init__(self):
self.id = -1
self.k = -1
self.depth = -1
self.parent = -1
self.type = 'root'
self.end = False
self.children = []
def find_root_id(nodes):
i = 0
root... | p02279 |
class Node:
def __init__(self):
self.p = None
self.depth = None
self.l = None
self.r = None
def show(self, i):
global T
ans = 'node {}: parent = {}, depth = {}, {}, {}'.format(i, self.p, self.depth, self.t(), self.degree(T))
print(ans)
de... | def set_info(i, p, d):
r = T[i]
r[1], r[2] = p, d
for c in r[0]:
set_info(c, i, d+1)
n = int(eval(input()))
T = [None] * n
root = set(range(n))
for i in range(n):
A = list(map(int, input().split()))
ch = A[2:]
T[A[0]] = [ch, None, None]
root -= set(ch)
set_info(roo... | p02279 |
def set_pdt(i, p, d):
u = tree[i]
u[0], u[1] = p, d
for c in u[3]:
set_pdt(c, i, d+1)
else:
if u[0] == -1:
u[2] = "root"
elif u[3]:
u[2] = "internal node"
else:
u[2] = "leaf"
n = int(eval(input()))
# p d t ch
tre... | def set_pdt(i, p, d):
u = tree[i]
u[0], u[1] = p, d
for c in u[3]:
set_pdt(c, i, d+1)
else:
if u[0] == -1:
u[2] = "root"
elif u[3]:
u[2] = "internal node"
else:
u[2] = "leaf"
n = int(eval(input()))
tree = [[-1,0,0,0] for ... | p02279 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.