input
stringlengths 20
127k
| target
stringlengths 20
119k
| problem_id
stringlengths 6
6
|
|---|---|---|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def TUPLE(): return tuple(map(int, input().split()))
def ZIP(n): return list(zip(*(MAP() for _ in range(n))))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
#mod = 998244353
from decimal import *
#import numpy as np
#decimal.getcontext().prec = 10
N = INT()
A = [[INT(), i] for i in range(N)]
A.sort(key = lambda x:x[0])
cnt = 0
for i, (x, idx) in enumerate(A):
if i%2 != idx%2:
cnt += 1
print((cnt//2))
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def TUPLE(): return tuple(map(int, input().split()))
def ZIP(n): return list(zip(*(MAP() for _ in range(n))))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
#mod = 998244353
from decimal import *
#import numpy as np
#decimal.getcontext().prec = 10
N = INT()
A = [INT() for _ in range(N)]
zipped = {x:i+1 for i, x in enumerate(sorted(A))}
A = [zipped[x] for x in A]
print((sum(x%2==0 for x in A[::2])))
|
p04021
|
from bisect import bisect_left
N = int(eval(input()))
A = list(int(eval(input())) for _ in range(N))
A = [bisect_left(sorted(A),a) for a in A]
print(((sum((i-j)%2 for i,j in enumerate(A))+1)//2))
|
from bisect import bisect_left
N = int(eval(input()))
A = list(int(eval(input())) for _ in range(N))
S = sorted(A)
A = [bisect_left(S,a) for a in A]
print(((sum((i-j)%2 for i,j in enumerate(A))+1)//2))
|
p04021
|
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
def three_change(i):
a[i], a[i + 2] = a[i + 2], a[i]
def two_change(i):
a[i],a[i + 1] = a[i + 1], a[i]
sorted_a = a[:]
sorted_a = sorted(sorted_a)
tar_ind = n - 1
count = 0
while (tar_ind >= 0):
target = sorted_a[tar_ind]
if(target != a[tar_ind]):
cur_ind = a.index(target)
tmp = tar_ind - cur_ind
m2 = tmp // 2
m1 = tmp % 2
count += m1
for i in range(m2):
three_change(cur_ind)
cur_ind += 2
for i in range(m1):
two_change(cur_ind)
cur_ind += 1
tar_ind -= 1
print(count)
|
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
even_num = set([a[i] for i in range(0,n) if i % 2 == 0])
a = sorted(a)
odd_num = set([a[i] for i in range(0, n) if i % 2 == 1])
count = len(even_num & odd_num)
print(count)
|
p04021
|
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
b = sorted(a)
counter = 0
for i in range(0, n, 2):
if a.index(b[i])%2 == 1:
counter += 1
print(counter)
|
def main():
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
b = sorted(a)
c = b[::2]
d = a[::2]
set_c = set(c)
set_d = set(d)
print((len(set_c - set_d)))
main()
|
p04021
|
def solve():
n = int(eval(input()))
a = [0] * n
indices = {}
for i in range(n):
a[i] = int(eval(input()))
indices[a[i]] = i
b = sorted(a)
for j in range(n - 1, -1, -1):
i = indices[b[j]]
while i + 2 < n and a[i] > a[i + 2]:
tmp = a[i + 2]
a[i + 2] = a[i]
a[i] = tmp
indices[a[i]] = i
indices[a[i + 2]] = i + 2
i += 2
ans = 0
for i in range(n - 1):
if a[i] != b[i]:
ans += 1
tmp = a[i + 1]
a[i + 1] = a[i]
a[i] = tmp
print(ans)
def main():
solve()
if __name__ == '__main__':
main()
|
def solve():
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
e = [a[i] for i in range(0, n, 2)]
a.sort()
o = set(a[i] for i in range(1, n, 2))
ans = 0
for i in range((n + 1) // 2):
if e[i] in o:
ans += 1
print(ans)
def main():
solve()
if __name__ == '__main__':
main()
|
p04021
|
import sys
#import numpy as np
stdin = sys.stdin
ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split())) # applies to numbers only
rs = lambda: stdin.readline().rstrip() # ignore trailing spaces
N = ri()
A = [ri() for _ in range(N)]
x_to_i = {x:i for i, x in enumerate(sorted(A))}
rank = [x_to_i[x] for x in A]
answer = sum(i&1 and (i^x)&1 for i,x in enumerate(rank))
print(answer)
|
import sys
#import numpy as np
stdin = sys.stdin
ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split())) # applies to numbers only
rs = lambda: stdin.readline().rstrip() # ignore trailing spaces
N = ri()
A = [ri() for _ in range(N)]
x_to_i = {x:i for i, x in enumerate(sorted(A))}
rank = [x_to_i[x] for x in A]
answer = sum((i^x)&1 for i,x in enumerate(rank)) // 2
print(answer)
|
p04021
|
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
b,ans = sorted(a),0
for i in range(n):
if i%2!=b.index(a[i])%2: ans+=1
print((ans//2))
|
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
b,ans = [],0
for i,x in enumerate(a): b.append([x,i])
b.sort()
for i in range(n):
if i%2!=b[i][1]%2: ans+=1
print((ans//2))
|
p04021
|
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
os = [s[i] for i in range(0,n,2)]
j = sorted(s)
ans = 0
for i in os:
if j.index(i) % 2 == 1:
ans += 1
print(ans)
|
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
j = sorted(s)
ans = len(set(s[::2]) ^ set(j[::2])) // 2
print(ans)
|
p04021
|
n = eval(input())
l1 = []
for i in range(n):
t = eval(input())
l1.append(t)
l2 = sorted(l1)
s = []
for i in range(n):
if i % 2 == 1:
s.append(l1[i])
count = 0
for i in range(n):
if i % 2 == 1:
if l2[i] not in s:
count += 1
print(count)
|
n = eval(input())
l1 = []
for i in range(n):
t = eval(input())
l1.append(t)
l2 = sorted(l1)
s1, s2 = set([]), set([])
for i in range(n):
if i % 2 == 1:
s1.add(l1[i])
s2.add(l2[i])
print(len(s1) - len(s1.intersection(s2)))
|
p04021
|
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
b = sorted(a)
c = dict()
for i in range(n):
c[b[i]] = i&1
d = 0
for i in range(n):
d += c[a[i]]^i&1
print((d>>1))
|
n, *a = list(map(int, open(0).read().split()))
b = []
for i in range(n):
b.append((a[i], i))
b.sort()
ans = 0
for i in range(n):
if b[i][1] % 2 != i % 2:
ans += 1
print((ans // 2))
|
p04021
|
n=int(eval(input()))
count=0
for a in range(1,n+1):
for b in range(1,n//a+1):
c=n-(a*b)
if c>0:
count+=1
else:
continue
print(count)
|
n=int(eval(input()))
count=0
for a in range(1,n+1):
for b in range(a,n//a+1):
c=n-(a*b)
if c>0:
if a==b:
count+=1
else:
count+=2
else:
continue
print(count)
|
p02548
|
import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
count = [0]*(n)
for i in range(1, n):
for j in range(i, n, i):
count[j] += 1
ans = sum(count)
print(ans)
if __name__ == "__main__":
main()
|
def main():
n = int(eval(input()))
ans = 0
for i in range(1, n):
ans += (n-1)//i
print(ans)
if __name__ == "__main__":
main()
|
p02548
|
import math
N = int(eval(input()))
z = 0
for a in range(N):
for b in range(math.floor(N/(a+1))):
c = N - (a+1)*(b+1)
if c > 0:
z = z+1
else:
pass
print(z)
|
import math
N = int(eval(input()))
z = 0
for a in range(N):
d = math.floor(N/(a+1))
e = min(a,d)
for b in range(e):
c = N - (a+1)*(b+1)
if c > 0:
z = z+2
else:
pass
f = N - (a+1)*(a+1)
if f > 0:
z = z+1
else:
pass
print(z)
|
p02548
|
import math
N = int(eval(input()))
z = 0
for a in range(N):
e = min(a,math.floor(N/(a+1)))
for b in range(e):
if N - (a+1)*(b+1) > 0:
z = z+2
else:
pass
if N - (a+1)*(a+1) > 0:
z = z+1
else:
pass
print(z)
|
import math
N = int(eval(input()))
z = 0
for a in range(N):
for b in range(min(a,math.floor(N/(a+1)))):
if N - (a+1)*(b+1) > 0:
z = z+2
else:
pass
if N - (a+1)*(a+1) > 0:
z = z+1
else:
pass
print(z)
|
p02548
|
N=int(eval(input()))
cnt=0
for i in range(1,N+1):
for j in range(1,N+1):
buf=N-i*j
if buf>0:
cnt+=1
else:
break
print(cnt)
|
N=int(eval(input()))
cnt=0
for i in range(1,N+1):
for j in range(1,i+1):
buf=N-i*j
if buf>0:
if i==j:
cnt+=1
else:
cnt+=2
else:
break
print(cnt)
|
p02548
|
c=int(eval(input()))
arr=[1 for i in range(c)]
arr[0]=0
for i in range(2,c+1):
j=i
while j<c:
arr[j]+=1
j+=i
print((sum(arr)))
|
c=int(eval(input()))
total=c-1
for i in range(2,c):
total+=(c-1)//i
print(total)
|
p02548
|
N = int(eval(input()))
cnt = 0
for A in range(1,N):
for B in range(1,N):
if A * B <= N-1:
cnt += 1
else:
break
print(cnt)
|
N = int(eval(input()))
cnt = 0
for A in range(1,N):
cnt += (N-1) // A
print(cnt)
|
p02548
|
from sys import stdin
from collections import defaultdict
readline = stdin.readline
def i_input(): return int(readline().rstrip())
def i_map(): return list(map(int, readline().rstrip().split()))
def i_list(): return list(i_map())
def main():
N = i_input()
d = defaultdict(lambda: 1)
ans = 0
for i in range(2, N):
for j in range(i, N, i):
d[j] += 1
for c in range(1, N):
ans += d[c]
print(ans)
if __name__ == "__main__":
main()
|
from sys import stdin
readline = stdin.readline
def i_input(): return int(readline().rstrip())
def i_map(): return list(map(int, readline().rstrip().split()))
def i_list(): return list(i_map())
def main():
N = i_input()
ans = 0
for a in range(1, N):
ans += (N - 1) // a
print(ans)
if __name__ == "__main__":
main()
|
p02548
|
N = int(eval(input()))
a = 1
b = 1
ans = 0
while a<N:
b = 1
while a*b <N:
ans += 1
b += 1
a+=1
print(ans)
|
N = int(eval(input()))
a = 1
ans = 0
while a< N:
b = a+1
while a*b < N:
ans += 2
b += 1
a+=1
a=1
while a**2 < N:
ans+=1
a += 1
print(ans)
|
p02548
|
N=int(eval(input()))
# 約数の個数のテーブルを O(N logN) で作る
div = [0] * (N+1)
for d in range(1, N+1):
for n in range(d, N, d):
div[n] += 1
ans = sum(div[:N])
print(ans)
|
N=int(eval(input()))
# 約数の個数のテーブルを O(N loglog N) で作る
div = [1] * (N+1)
div[0] = 0
for p in range(2, N+1):
if div[p] != 1:
continue
# p は素数
pp = p # power of p
e = 1
while pp <= N:
for n in range(pp, N+1, pp):
div[n] += div[n] // e
e += 1
pp *= p
ans = sum(div[:N])
print(ans)
|
p02548
|
N=int(eval(input()))
# 約数の個数のテーブルを O(N loglog N) で作る
div = [1] * (N+1)
div[0] = 0
for p in range(2, N+1):
if div[p] != 1:
continue
# p は素数
pp = p # power of p
e = 1
while pp <= N:
for n in range(pp, N+1, pp):
div[n] += div[n] // e
e += 1
pp *= p
ans = sum(div[:N])
print(ans)
|
"""O(N^0.5) solution"""
N = int(eval(input()))
N -= 1
ans = 0
n = int(N**.5)
for x in range(1, n+1):
# (x,x)
ans += 1
# (x,y)
ans += N//x - x
# (y,x)
ans += N//x - x
print(ans)
|
p02548
|
N = int(eval(input()))
yakusu = [0] * (N)
for i in range(1,N):
for j in range(1,min(i, int((N-1)/i))+1):
M = i*j
if i == j:
yakusu[M] += 1
else:
yakusu[M] += 2
print((sum(yakusu[1:N])))
|
N = int(eval(input()))
counter = 0
for i in range(1,N):
for j in range(1,min(i, int((N-1)/i))+1):
if i == j:
counter += 1
else:
counter += 2
print(counter)
|
p02548
|
n = int(eval(input()))
count = 0
for i in range(1,n):
for j in range(1,n):
if i * j > n-1:
break
count += 1
print(count)
|
n = int(eval(input()))
count = 0
for i in range(1,n):
a = n //i
if n%i == 0:
count += a-1
else:
count += a
print(count)
|
p02548
|
n = int(eval(input()))
cnt =[0]*(n+1)
ans = 0
for i in range(1,n):
m = (n-1)//i
for j in range(1,m+1):
cnt[i*j] += 1
for i in range(1,n+1):
ans += cnt[i]
print(ans)
|
n = int(eval(input()))
cnt =[0]*(n+1)
ans = 0
for i in range(1,n):
m = (n-1)//i
for j in range(1,m+1):
ans += 1
print(ans)
|
p02548
|
N=int(eval(input()))
def num_divisors_table(n):
table=[0]*(n+1)
for i in range(1,n+1):
for j in range(i,n+1,i):
table[j]+=1
return table
l=num_divisors_table(N-1)
print((sum(l)))
|
n=int(eval(input()))
cnt=0
for a in range(1,n):
cnt+=(n-1)//a
print(cnt)
|
p02548
|
n=int(eval(input()))
cnt=0
for a in range(1,n):
cnt+=(n-1)//a
print(cnt)
|
n=int(eval(input()))
cnt=0
a=1
while(a*a<n):
cnt+=1
a+=1
a=1
while(a*a<n):
cnt+=max((n-1)//a-a,0)*2
a+=1
print(cnt)
|
p02548
|
n=int(eval(input()))
cnt=0
a=1
while(a*a<n):
cnt+=1
a+=1
a=1
while(a*a<n):
cnt+=max((n-1)//a-a,0)*2
a+=1
print(cnt)
|
n=int(eval(input()))
cnt=0
a=1
while(a*a<n):
cnt+=1
cnt+=max((n-1)//a-a,0)*2
a+=1
print(cnt)
|
p02548
|
n = int(eval(input()))
# c = N - a*b
cnt = 0
for a in range(1, n, 1):
for b in range(1, n, 1):
if n <= a*b:
break
else:
cnt += 1
print(cnt)
|
n = int(eval(input()))
# c = N - a*b
cnt = 0
for a in range(1, n, 1):
for b in range(1, n, 1):
if n <= a*b:
break
else:
if a != b:
cnt += 2
else:
cnt += 1
break
print(cnt)
|
p02548
|
n = int(eval(input()))
a=1
x=0
for i in range(n-1):
b=1
while a*b < n:
x += 1
b += 1
a += 1
print(x)
|
n = int(eval(input()))
a=1
x=0
for i in range(n-1):
x += (n-1)//a
a += 1
print(x)
|
p02548
|
n=int(eval(input()))
a=0
for i in range(1,n):
a+=(n-1)//i
print(a)
|
n=int(eval(input()))-1
print((sum(n//-~i for i in range(n))))
|
p02548
|
#!/usr/bin/env python3
import sys
input=sys.stdin.readline
n=int(eval(input()))
ans=0
for a in range(1,n+1):
for b in range(1,n+1):
if a*b>=n:
break
ans+=1
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()))
num = 0
for a in range(1, n+1):
for b in range(1, n//a+1):
c = n - a * b
if c != 0:
num += 1
print(num)
|
n = int(eval(input()))
num = 0
for a in range(1, n):
for b in range(n//a):
num += 1
if n % a == 0:
num -= 1
print(num)
|
p02548
|
def main():
n = int(eval(input()))
ans = 0
for a in range(1, n):
for b in range(1, n):
if a * b > n:
break
if 1 <= a * b <= n - 1:
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
def main():
n = int(eval(input()))
ans = 0
for a in range(1, n):
for b in range(1, n):
if 1 <= a * b <= n - 1:
ans += 1
else:
break
print(ans)
if __name__ == '__main__':
main()
|
p02548
|
n = int(eval(input()))
count = 0
for i in range(1,n+1):
for j in range(1,n+1):
if i*j< n:
count += 1
else:
break
print(count)
|
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)
|
p02548
|
N = int(eval(input()))
count = 0
count += int(N/2)
if int(N/2)-N/2 == 0:
for i in range(1,int(N/2)):
if int(N/i)-N/i == 0:
count += int(N/i)-1
else:
count += int(N/i)
else:
for i in range(1,int(N/2)+1):
if int(N/i)-N/i == 0:
count += int(N/i)-1
else:
count += int(N/i)
print(count)
|
n = int(eval(input()))
ans = 0
for a in range(1, n):
ans += (n - 1) // a
print(ans)
|
p02548
|
k=int(eval(input()))
cnt=0
for i in range(1,k):
for j in range(1,k+2):
if i*j<k:
cnt+=1
else:
break
print(cnt)
|
k=int(eval(input()))
cnt=0
if k>3:
for i in range(3,k):
for j in range(1,k):
if i*j<k:
cnt+=1
else:
break
print((cnt+k-1+((k-1)//2)))
|
p02548
|
k=int(eval(input()))
cnt=0
if k>3:
for i in range(3,k):
for j in range(1,k):
if i*j<k:
cnt+=1
else:
break
print((cnt+k-1+((k-1)//2)))
|
k=int(eval(input()))
cnt=0
if k>6:
for i in range(7,k):
for j in range(1,k):
if i*j<k:
cnt+=1
else:
break
print((cnt+k-1+((k-1)//2)+((k-1)//3)+((k-1)//4)+((k-1)//5)+((k-1)//6)))
|
p02548
|
n = int(eval(input()))
ans = 0
for a in range(1, n):
for b in range(1, n):
if a*b <= n-1:
ans += 1
else:
break
print(ans)
|
n = int(eval(input()))
count = 0
for a in range(1, n):
for b in range(1, a+1):
if a * b <= n - 1:
if a == b:
count += 1
else:
count += 2
else:
break
print(count)
|
p02548
|
from collections import defaultdict
N=int(eval(input()))
sq_set=set()
for i in range(1,10**3+1):
sq_set.add(i*i)
#print(sq_set)
alist=[i for i in range(N)]
dlist=[i for i in range(N+1)]
for i in range(2,int(N**0.5)+1):
if dlist[i]<i:
continue
else:
for j in range(i**2,N+1,i):
dlist[j]=i
#print(dlist)
answer=1
for i in range(1,N-1):
AB=N-i
AB_copy=AB
facts=defaultdict(int)
while AB>1:
facts[dlist[AB]]+=1
AB//=dlist[AB]
num_div=1
for k,v in list(facts.items()):
num_div*=v+1
#print(AB_copy,facts,num_div)
answer+=num_div
print(answer)
|
N=int(eval(input()))
answer=0
for i in range(1,N):
answer+=(N-1)//i
print(answer)
|
p02548
|
from collections import Counter
class Eratosthenes(): # エラトステネスの篩
def __init__(self, N): # 素数リスト生成 O(n*log(log n))
self.fact = [i for i in range(N + 1)]
for i in range(2, int(N ** 0.5) + 1):
if self.fact[i] < i:
continue
for j in range(i ** 2, N + 1, i):
self.fact[j] = i
self.prime = [i for i in range(2, N + 1) if i == self.fact[i]]
def factor(self, NUM): # 高速素因数分解 O(log num)
PRIME = []
while NUM > 1:
PRIME.append(self.fact[NUM])
NUM //= self.fact[NUM]
return Counter(PRIME)
n = int(eval(input()))
era = Eratosthenes(n)
ans = 0
for i in range(1, n):
tmp = 1
for num in list(era.factor(i).values()):
tmp *= num + 1
ans += tmp
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):
ans += (n - 1) // a
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 a in range(1,1000001):
for b in range(1,1000001):
if a*b<N:
count+=1
else:
break
print(count)
|
N=int(eval(input()))
count = 0
for a in range(1,1000001):
count+=(N-1)//a
print(count)
|
p02548
|
from collections import defaultdict
# d = defaultdict(int)で0で初期化
# d = defaultdict(lambda: 100)で100で初期化
MAXN = 10**6 + 10
sieve = [i for i in range(MAXN + 1)]
p = 2
while p * p <= MAXN:
if sieve[p] == p:
for q in range(2 * p, MAXN + 1, p):
if sieve[q] == q:
sieve[q] = p
p += 1
def solve(a):
tmp = defaultdict(int)
while a > 1:
tmp[sieve[a]] += 1
a //= sieve[a]
ans = 1
for i in list(tmp.values()):
ans *= (i + 1)
return ans
n = int(eval(input()))
ans = 0
for i in range(1, n):
ans += solve(i)
print(ans)
|
class factorization:
def __init__(self, N=1_000_010):
"""min_factor[i] = iの最小の素因数"""
self.min_factor = list(range(N))
for i in range(2, N):
if i * i > N:
break
for j in range(i * i, N, i):
if self.min_factor[j] == j:
# 小さくできるなら小さくするmin_factor[j] != j => i < j
self.min_factor[j] = i
def fact(self, n):
"""nの素因数分解の結果を{素因数:回数}で返す"""
d = {}
while n > 1:
if self.min_factor[n] in d:
d[self.min_factor[n]] += 1
else:
d[self.min_factor[n]] = 1
n //= self.min_factor[n]
return d
def count_divisors(self, n):
res = 1
for v in list(self.fact(n).values()):
res *= v + 1
return res
def sum_divisors(self, n):
res = 1
for r, Len in list(self.fact(n).items()):
res *= (r ** (Len + 1) - 1) // (r - 1)
return res
def Eulers_function(self, n):
res = 1
for i in self.fact(n):
res *= (i - 1)
n //= i
return res * n
n = int(eval(input()))
ans = 0
p = factorization(n)
for i in range(1, n):
ans += p.count_divisors(i)
print(ans)
|
p02548
|
N = int(eval(input()))
cnt = 0
for i in range(1, N):
for j in range(1, N//i + 1):
if N - i * j >= 1:
cnt += 1
print(cnt)
|
N = int(eval(input()))
cnt = 0
for i in range(1, N):
j = (N - 1)//i
cnt += j
print(cnt)
|
p02548
|
n = int(eval(input()))
count = 0
for a in range(1, n+1):
for b in range(1, n+1):
if a * b < n: count += 1
else: break
print(count)
|
n = int(eval(input()))
count = 0
for a in range(1, n+1):
for b in range(a, n+1):
if n > a * b:
if a == b: count += 1
else: count += 2
else: break
print(count)
|
p02548
|
N = int(eval(input()))
count = 0
for i in range(1,N):
for j in range(1,int(N/i)+1):
if N - i*j > 0:
count += 1
print(count)
|
N = int(eval(input()))
count = 0
for i in range(1,N):
count += int((N-1)/i)
print(count)
|
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)
|
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
N = int(readline())
ans = 0
for a in range(1, N):
for b in range(1, N):
x = a * b
if x >= N:
break
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
p02548
|
def solve():
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()))
ans = solve()
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):
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):
for b in range(1,a+1):
if a * b < n:
if a == b:
ans += 1
else:
ans += 2
else:
break
print(ans)
|
p02548
|
N = int(eval(input()))
cnt = 0
for a in range(1,N+1):
for b in range(1,N+1):
if a*b >= N:
break
cnt+=1
print(cnt)
|
N = int(eval(input()))
cnt = 0
for a in range(1,N+1):
b = N // a
if a * b == N:
cnt = cnt + b - 1
else:
cnt = cnt + b
print(cnt)
|
p02548
|
N = int(eval(input()))
cnt = 0
for a in range(1,N):
for b in range(1,N):
#print(a,b,N-a*b)
if a*b <= N-1:
cnt += 1
else:
break
print(cnt)
|
N = int(eval(input()))
cnt = 0
for a in range(1,N):
b = (N-1) // a
cnt += b
print(cnt)
|
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 - 1:
ans += 1
else:
break
print(ans)
|
N = int(eval(input()))
ans = 0
for a in range(1, N):
# a * b <= N - 1 となるような b の数 = (N-1)//a
ans += (N - 1) // a
print(ans)
|
p02548
|
def num_divisors_table(n):
table = [0] * (n + 1)
for i in range(1, n + 1):
for j in range(i, n + 1, i):
table[j] += 1
return table
n=int(eval(input()))
print((sum(num_divisors_table(n-1))))
|
n=int(eval(input()))
ans=0
for i in range(1,n):
ans+=(n-1)//i
print(ans)
|
p02548
|
n = int(eval(input()))
counta=0
tmp=n
for a in range(1,n):
for b in range(1,n):
#print(a,b)
if a * b +1 <= n:
counta+=1
else:
break
print(counta)
|
n = int(eval(input()))
counta=0
for a in range(1,n):
for b in range(1,n):
#print(a,b)
if a * b +1 <= n:
counta+=1
else:
break
print(counta)
|
p02548
|
n = int(eval(input()))
cnt = 0
for i in range(1,n):
for j in range(1,n//i+1):
if i * j < n:
cnt +=1
print(cnt)
|
n = int(eval(input()))
cnt = 0
for i in range(3,n):
for j in range(1,n//i+1):
if i * j < n:
cnt +=1
print((cnt+n-1+(n-1)//2))
|
p02548
|
N = int(eval(input()))
count = 0
for i in range(1,N+1):
for j in range(1,N+1):
if i*j >= N:
break
else:
count += 1
print(count)
|
N = int(eval(input()))
count = 0
flg = False
for i in range(1,N):
count += int(N / i)
if N% i == 0:
count -=1
print(count)
|
p02548
|
N = int(eval(input()))
c = 0
for i in range(1,N):
for j in range(1,N):
if i*j >= N:
break
c += 1
print(c)
|
N = int(eval(input()))
c = 0
for i in range(1,N):
if i**2 >= N:
break
c += 1
for i in range(1,N):
for j in range(i+1,N):
if i*j >= N:
break
c += 2
print(c)
|
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):
cnt += (N-1) // a
print(cnt)
|
p02548
|
N = int(eval(input()))
result = 0
for A in range(1, N + 1):
for B in range(1, (N // A) + 1):
C = N - A * B
if C == 0:
continue
result += 1
print(result)
|
N = int(eval(input()))
result = 0
for A in range(1, N + 1):
result += (N - 1) // A
print(result)
|
p02548
|
n = int(eval(input()))
a = 1
ans = 0
while a < n:
b = 1
while a * b < n:
ans += 1
b += 1
a += 1
print(ans)
|
n = int(eval(input()))
a = 2
ans = 0
while a < n/2:
b = 2
while a * b < n:
ans += 1
b += 1
a += 1
print((ans+2*(n-2)+1))
|
p02548
|
n = int(eval(input()))
a = 2
ans = 0
while a < n/2:
b = 2
while a * b < n:
ans += 1
b += 1
a += 1
print((ans+2*(n-2)+1))
|
n = int(eval(input()))
a = 1
ans = 0
# while a < n/2:
# b = 2
# while a * b < n:
# ans += 1
# b += 1
# a += 1
# print(ans+2*(n-2)+1)
for i in range(1,n):
ans += (n-1)//i
print(ans)
|
p02548
|
#!python3
import sys
iim = lambda: list(map(int, sys.stdin.readline().rstrip().split()))
def get_factor(N):
N1 = N + 2
A = [2, 0] * (N1//2)
for i in range(3, N1, 2):
if A[i]:
continue
for j in range(i, N1, 2*i):
A[j] = i
def factor(n):
i = 0
ans = []
while n & 1 == 0:
i += 1
n >>= 1
if i:
ans.append((2, i))
while n > 1:
a = A[n]
i = 1
while True:
n //= a
b = A[n]
if a != b:
ans.append((a, i))
b = a
break
i += 1
return ans
return factor
def resolve():
N = int(sys.stdin.readline())
f = get_factor(N)
ans = 0
for i in range(1, N):
num = 1
#print(i, f(i))
for a, b in f(i):
num *= b + 1
ans += num
print(ans)
if __name__ == "__main__":
resolve()
|
#!python3
import sys
iim = lambda: list(map(int, sys.stdin.readline().rstrip().split()))
def resolve():
N = int(sys.stdin.readline())
N1 = N - 1
ans = 0
for i in range(1, N):
ans += N1//i
print(ans)
if __name__ == "__main__":
resolve()
|
p02548
|
#ABC179 c
n = int(eval(input()))
count = 0
for i in range(1, n):
a = n // i
for j in range(1, a+1):
if i * j < n:
count += 1
print(count)
|
#ABC179 c
n = int(eval(input()))
count = 0
for i in range(1, n):
a = n // i
b = n % i
if b==0:
count += a-1
else:
count += a
print(count)
|
p02548
|
n = int(eval(input()))
ans = 0
for a in range(1, n):
b = 1
while a * b < n:
ans += 1
b += 1
print(ans)
|
n = int(eval(input()))
ans = 0
for a in range(1, n):
if n % a == 0:
ans += n // a - 1
else:
ans += n // a
print(ans)
|
p02548
|
n = int(eval(input()))
count = -1
for i in range(int(n/2)):
for j in range(n-1):
if (i+1)*(j+1) < n:
count += 1
else:
break
count += n - int(n/2)
print(count)
|
n = int(eval(input()))
count = 0
if n%2==0:
for i in range(int(n/2)-1):
count += int((n-1)/(i+1))
count += int(n/2)
else:
for i in range(int(n/2)):
count += int((n-1)/(i+1))
count += int(n/2)
print(count)
|
p02548
|
n = int(eval(input()))
a = 1
b = 1
c = 1
cnt = 0
while n > a:
while a * b < n:
cnt += 1
b += 1
b = 1
a += 1
print(cnt)
|
n = int(eval(input()))
a = 1
cnt = 0
while n > a:
cnt += (n-1) // a
a += 1
print(cnt)
|
p02548
|
from collections import Counter
class Prime:
def __init__(self, N):
smallestPrime = [i for i in range(N + 1)]
for i in range(2, N + 1):
if smallestPrime[i] != i:
continue
for p in range(i * 2, N + 1, i):
if smallestPrime[p] == p:
smallestPrime[p] = i
self.smallestPrime = smallestPrime
def isPrime(self, n):
return n > 1 and self.smallestPrime[n] == n
def factorization(self, n):
ret = Counter()
while n > 1:
p = self.smallestPrime[n]
ret[p] += 1
n //= p
return ret
N = int(eval(input()))
prime = Prime(N + 100)
ans = 0
for c in range(1, N):
cnt = 1
for c in list(prime.factorization(N - c).values()):
cnt *= c + 1
ans += cnt
print(ans)
|
N = int(eval(input()))
print((sum((N - 1) // i for i in range(1, N))))
|
p02548
|
import math
n = int(eval(input()))
# floor_root_n = math.ceil(math.sqrt(n))
# # a<=bとしてかんがえる
# s = 0
# if not math.sqrt(n).is_integer():
# for i in range(1, floor_root_n+1):
# print(i)
# s += 2*(floor_root_n-i+1)
# else:
# for i in range(1, floor_root_n):
# print(i)
# s += 2*(floor_root_n-i)+1
# print(s)
s = 0
a = 1
b = 1
while a*b < n:
while a*b < n:
b += 1
s += 1
a += 1
b = 1
print(s)
|
n = int(eval(input()))
s = 0
a = 1
b = 1
while a*b < n:
while a*b < n and b <= a:
if a == b:
s += 1
else:
s += 2
b += 1
a += 1
b = 1
print(s)
|
p02548
|
N = int(eval(input()))
count = 0
ABC = [0]*3
for a in range(1,N+1):
for b in range(1,N+1):
D = b*a
if D >= N:
break
else:
# print(a, b, N-D)
count = count + 1
print(count)
|
N = int(eval(input()))
count = 0
count2 = 0
ABC = [0]*3
for a in range(1,N):
if N % a == 0:
x = int(N/a)-1
else:
x = int(N/a)
count = count + x
# print(x)
print(count)
|
p02548
|
N = int(eval(input()))
ans = 0
for a in range(1, N):
cnt = 0
for b in range(1, N):
if a * b < N:
if a < b:
cnt += 2
elif a == b:
cnt += 1
else:
break
ans += cnt
print (ans)
|
import math
N = int(eval(input()))
ans = 0
for a in range(1, N):
cnt = 0
for b in range(a, N):
if a * b < N:
if a < b:
cnt += 2
elif a == b:
cnt += 1
else:
break
ans += cnt
print (ans)
|
p02548
|
n = int(eval(input()))
ac = 0
for a in range(1,n):
be = n // a
for b in range(1,be+1):
c = n - a * b
if c > 0:
ac += 1
print(ac)
|
n = int(eval(input()))
ac = 0
for a in range(1,n):
be = (n-1) // a
ac += be
print(ac)
|
p02548
|
N=int(eval(input()))
ans=0
for a in range(1,N):
ans += (N-1)//a
print(ans)
|
def main():
N=int(eval(input()))
print((sum([(N-1)//a for a in range(1,N)])))
if __name__=="__main__":
main()
|
p02548
|
N = int(eval(input()))
ans =0
for i in range(1,N+1):
x = (N+1)/i
R= round(x, 0)
for n in range(1,int(R)+1):
if i*n < N:
ans +=1
print(ans)
|
N = int(eval(input()))
ans =0
for i in range(1,N):
ans += (N-1)//i
print(ans)
|
p02548
|
# -*- coding: utf-8 -*-
# モジュールのインポート
import math
# 標準入力を取得
N = int(eval(input()))
# 求解処理
ans = 0
for a in range(1, N):
ans += math.ceil(N / a) - 1
# 結果出力
print(ans)
|
# -*- coding: utf-8 -*-
# モジュールのインポート
import math
def get_input() -> int:
"""
標準入力を取得する.
Returns:\n
int: 標準入力
"""
N = int(eval(input()))
return N
def main(N: int) -> None:
"""
メイン処理.
Args:\n
N (int): 正整数(2 <= N <= 10**6)
"""
# 求解処理
ans = 0
for a in range(1, N):
ans += math.floor((N - 1) / a)
# 結果出力
print(ans)
if __name__ == "__main__":
# 標準入力を取得
N = get_input()
# メイン処理
main(N)
|
p02548
|
N = int(eval(input()))
#それぞれの要素番号に対応する約数の表を作成
yakusuu_table = [0] * N
#今回調べるのは入力された値から-1
for i in range(1, N):
#iの倍数を調べる→iとばし
for j in range(i,N,i):
yakusuu_table[j] += 1
print((sum(yakusuu_table)))
|
N = int(eval(input()))
B_num = 0
for A in range(1, N):
B_num += (N - 1) // A
print(B_num)
|
p02548
|
n = int(eval(input()))
cnt = 0
for a in range(1,n):
i = 1
while a * i < n:
if a * (i+1000000) < n:
cnt += 1000000
i += 1000000
else:
cnt += 1
i += 1
print(cnt)
|
n = int(eval(input()))
cnt = 0
for a in range(1,n):
cnt += (n-1) // a
print(cnt)
|
p02548
|
n = int(eval(input()))
count = 0
for i in range(1,n):
a = i
b = 1
while a*b < n:
count+=1
b+=1
print(count)
|
n = int(eval(input()))
count = 0
same = 0
for i in range(1,n):
a = i
b = i
if a*b >= n:
break
same += 1
while a*b < n:
count+=1
b+=1
print((count*2-same))
|
p02548
|
import collections
n = int(eval(input()))
if n == 1:
print((0))
else:
lis = [i for i in range(n+1)]
for i in range(2, int(n**0.5) + 1):
if lis[i] == i:
lis[i] = i
for j in range(i**2, n+1, i):
if lis[j] == j:
lis[j] = i
#print(lis)
def bunkai(m):
ans = []
for i in range(m):
ans.append(lis[m])
m = m//lis[m]
if m == 1:
break
return ans
ans = 1
for i in range(2,n):
tmp = 1
yaku = collections.Counter(bunkai(i))
for i in yaku:
tmp = tmp * (yaku[i] +1)
ans += tmp
print(ans)
|
from collections import Counter
n = int(eval(input()))
if n == 1:
print((0))
else:
lis = [i for i in range(n+1)]
for i in range(2, int(n**0.5) + 1):
if lis[i] == i:
lis[i] = i
for j in range(i**2, n+1, i):
if lis[j] == j:
lis[j] = i
#print(lis)
def bunkai(m):
ans = []
now = lis[m]
cnt = 1
for i in range(m):
m = m//lis[m]
if now == lis[m]:
cnt += 1
else:
ans.append(cnt)
cnt = 1
now = lis[m]
if m == 1:
break
return ans
ans = 1
for i in range(2,n):
tmp = 1
yaku = bunkai(i)
for i in yaku:
tmp *= (i +1)
ans += tmp
print(ans)
|
p02548
|
n = int(eval(input()))
ans = 0
for i in range(1,n):
for j in range(1,int(n/i)+2):
if i*j < n:
ans += 1
print(ans)
|
n = int(eval(input()))
ans = 0
for i in range(1,n):
if n%i == 0:
ans += int(n/i)-1
else:
ans += int(n/i)
print(ans)
|
p02548
|
import math
N = int(eval(input()))
cnt = 0
for a in range(1,N):
for b in range(1,math.ceil(N/a)):
c = N - a * b
if c <= 0:
break
else:
# print("a,b :",end='')
# print(a,b)
# print("c :" + str(c))
cnt += 1
print(cnt)
|
import math
N = int(eval(input()))
cnt = 0
for a in range(1,N):
for b in range(a,math.ceil(N/a)):
c = N - a * b
if c <= 0:
break
else:
if a == b:
cnt += 1
else :
cnt += 2
print(cnt)
|
p02548
|
N = int(eval(input()))
count = 0
for i in range(N-1):
for j in range(N-1):
if (i+1)*(j+1) < N:
count += 1
else:
break
print(count)
|
N = int(eval(input()))
count = 0
for i in range(N-1):
count = count + int((N-1)/(i+1))
print(count)
|
p02548
|
n=int(eval(input()))
o=0
for i in range(1,n):
b=1
while i*b<n:
o+=1
b+=1
print(o)
|
n=int(eval(input()))
o=0
nn=n-1
for i in range(1,n):
o+=nn//i
print(o)
|
p02548
|
def main():
N = int(eval(input()))
count = 0
for i in range(1, N):
M = N // i + 1
for j in range(1, M):
k = N - i*j
if k > 0 and N == i*j + k:
count += 1
print(count)
if __name__ == '__main__':
main()
|
def main():
N = int(eval(input()))
count = 0
for i in range(1, N):
for j in range(1, N // i + 1):
k = N - i*j
if k > 0:
count += 1
print(count)
if __name__ == '__main__':
main()
|
p02548
|
n = int(eval(input()))
ans = 0
for i in range(1,n):
for j in range(1,n):
if i*j <= n-1:
ans += 1
else:
break
print(ans)
|
n = int(eval(input()))
ans = 0
for i in range(1,n):
for j in range(i,n):
if i*j <= n-1:
if i == j:
ans += 1
else:
ans += 2
else:
break
print(ans)
|
p02548
|
n= int(eval(input()))
ans=0
nn = int((n-1)//2)+1
for i in range(2,nn):
for j in range(2,nn):
if i*j>n-1:
break
else:
ans += 1
ans += (n-1-1)*2
print((ans+1))
|
n= int(eval(input()))
ans=0
nn = int((n-1)//2)+1
for i in range(2,nn):
for j in range(i,nn):
if i*j>n-1:
break
else:
if i==j:
ans += 1
else:
ans+=2
# a or b =1
ans += (n-1-1)*2
print((ans+1))
|
p02548
|
n = int(eval(input()))
cnt = 0
for a in range(1, n):
for b in range(1, ((n-1)//a)+1):
c = n - a*b
if c <= 0: break
if a*b + c == 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):
c = n - a*b
if c <= 0: break
cnt += 1
print(cnt)
|
p02548
|
n = int(eval(input()))
cnt = 0
for a in range(1, n):
for b in range(1, ((n-1)//a)+1):
if n - a*b <= 0: break
cnt += 1
print(cnt)
|
n = int(eval(input()))
c = 0
for a in range(1, n): c += (n-1)//a
print(c)
|
p02548
|
n = int(eval(input()))
c = 0
for a in range(1, n): c += (n-1)//a
print(c)
|
n = int(eval(input()))
print((sum([(n-1)//a for a in range(1, n)])))
|
p02548
|
n = int(eval(input()))
print((sum([(n-1)//a for a in range(1, n)])))
|
n = int(eval(input())) - 1 # n=n-1
print((sum([(n//x - x)*2 + 1 for x in range(1, int(n**0.5) + 1)])))
|
p02548
|
# -*- coding: utf-8 -*-
import math
N = int(eval(input()))
ans = 0
#N_half = int(math.sqrt(N)+1)
for A in range(1, N):
for B in range(1, N):
if A * B < N:
ans += 1
else:
break
print(ans)
|
# -*- coding: utf-8 -*-
import math
N = int(eval(input()))
ans = 0
N_half = int(math.sqrt(N))
for A in range(1, N_half+1):
for B in range(1, N):
if A * B < N:
ans += 1
if B > N_half:
ans += 1
else:
break
print(ans)
|
p02548
|
n = int(eval(input())) - 1
j = 0
ans = 0
for i in range(1, n):
j = i
while True:
j += 1
if i * j > n:
break
ans += 1
k = 1
er = 0
while True:
er += 1
if k ** 2 > n:
break
k += 1
print(((ans * 2) + er - 1))
|
n = int(eval(input())) - 1
j = 0
ans = 0
for i in range(1, n):
j = i
while True:
j += 1
if i * j > n:
break
ans += 1
k = 1
er = 0
while True:
if k ** 2 > n:
break
er += 1
k += 1
print(((ans * 2) + er))
|
p02548
|
num = int(eval(input()))
ans = 0
for x in range(num):
for y in range(x,num):
val = (x+1) * (y+1)
if val < num and x == y: ans += 1
elif val < num and x != y: ans += 2
else: break
print(ans)
|
num = int(eval(input()))
ans = 0
for x in range(num):
if num % (x + 1) == 0: ans += num // (x + 1) - 1
else: ans += num // (x + 1)
print(ans)
|
p02548
|
N = int(eval(input()))
ans = 0
for i in range(1, N+1):
cnt = N // i + 1
for j in range(1, cnt+1):
if i * j >= N:
break
# print(1, j)
ans += 1
print(ans)
|
N = int(eval(input()))
ans = 0
for i in range(1, N+1):
cnt = (N-1) // i
# for j in range(1, cnt+1):
# if i * j >= N:
# break
# print(1, j)
ans += cnt
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:
break
ans += 1
print(ans)
|
import math
n = int(eval(input()))
ans = 0
for A in range(1, n):
if n % A == 0:
ans += n // A - 1
else:
ans += n // A
print(ans)
|
p02548
|
n = int(eval(input()))
ans = 0
for a in range (1,n):
for b in range(1, n):
temp = a * b
if n <= temp:
break
ans += 1
print(ans)
|
n = int(eval(input()))
ans = 0
for a in range (1,n):
for b in range(1, n):
if n <= a * b:
break
ans += 1
print(ans)
|
p02548
|
n = int(eval(input()))
ans = 0
for a in range (1,n):
temp = 0
for b in range(1, n):
temp = a * b
if n <= temp:
break
ans += 1
print(ans)
|
n = int(eval(input()))
ans = 0
for a in range (1,n):
for b in range(a, n, a):
ans += 1
print(ans)
|
p02548
|
N=int(eval(input()))
s=0
for i in range(1,N):
s+=(N-0.1)//i
print((int(s)))
|
N=int(eval(input()))
s=0
for i in range(1,N):
s+=(N-1)//i
print(s)
|
p02548
|
import math
N = int(eval(input()))
cnt = 0
for i in range(1, int(math.sqrt(N)) + 1):
for j in range(1, N // i + 1):
if i * j < N:
if i == j:
cnt += 1
elif i < j:
cnt += 2
print(cnt)
|
n = int(eval(input()))
print((sum([(n - 1) // i for i in range(1, n)])))
|
p02548
|
n = int(eval(input()))
a, b, c = 1, 1, 1
ans = 0
while n >= c:
while b <= (n-c):
ans += (n-c)//b
b += 1
c += 1
print(ans)
|
def solve1():
n = int(eval(input()))
a, b, c = 1, 1, 1
ans = 0
while n >= c:
while b <= (n-c):
ans += (n-c)//b
b += 1
c += 1
print(ans)
def solve2():
n = int(eval(input()))
ans = 0
for i in range(1, n):
ans += (n-1)//i
print(ans)
solve2()
|
p02548
|
def main():
n = int(eval(input()))
ans = 0
cnt = 0
for i in range(1,n):
if n%i==0:
ans+=n//i-1
else:
ans+=n//i
if i**2<n:
cnt+=1
print(ans)
main()
|
def main():
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)
main()
|
p02548
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.