search

Marcythm-Archive / gitalk

1 stars 0 forks source link

「SPOJ」DIVCNT2-Counting Divisors(square) | Trisolaris's Blog #76

Open Marcythm opened 5 years ago

Marcythm commented 5 years ago

https://blog.trisolaris.top/spoj-divcnt2/

Problem Description 设 S{2}(n)=\sum{i=1}^{n}\tau(i^{2})=\sum{i=1}^{n}\sigma{0}(i^{2}) 求 S_{2}(n)

rishabhdeepsingh commented 4 years ago

Was really helpful. BTW background is not great as I was having reading proble due to opacity.