Submission #39429633

---

Source Code Expand

from collections import defaultdict,deque
from heapq import heappush, heappop 
import sys, math,itertools
f=sys.stdin
arr,ff= lambda : list(map(int,f.readline().split())), lambda : f.readline().rstrip()
n1,n2= lambda : int ( f.readline()) ,lambda: map(int,f.readline().split())





def fun(n):
    d = []
    for i in range(1, int(n**(1/2)) + 1):
        if (n % i == 0):
            d.append(i) 
            if ( (i**2) != n) : 
                d.append(n // i)
    return len(d)

n=n1()
cnt=0
x=defaultdict(int)
y=defaultdict(int)

for i in range (1, n+1 ) :
  for j in range (1,(n+1 )//i + 1 ,1):
    y[i*j]+=1



for ab in range ( 1, n) :
   #print ( ab , n-ab , x[ab], x[n-ab])
    cnt+= y[ab] * y[n-ab]
print(cnt)

Submission Info

Judge Result