AE00  Rectangles
Byteman has a collection of N squares with side 1. How many different rectangles can he form using these squares?
Two rectangles are considered different if none of them can be rotated and moved to obtain the second one. During rectangle construction, Byteman can neither deform the squares nor put any squares upon any other ones.
Input
The first and only line of the standard input contains one integer N (1 <= N <= 10000).
Output
The first and only line of the standard output should contain a single integer equal to the number of different rectangles that Byteman can form using his squares.
Example
For the input data:
6
the correct result is:
8
Task author: Jakub Radoszewski.
hide comments
code1monkey1:
20160603 20:31:25
@top_gun007 ans is 46884 

top_gun007:
20160603 18:34:40
whats the answer for 10000?


mkfeuhrer:
20160530 22:20:31
no dp req. factors enough !! 

noob909:
20160528 14:57:05
dp+division concept :D 

bhushangawde:
20160513 09:20:56
nailed it in first go! 

rayhan50001:
20160501 19:03:09
Easy One AC in 1st Go 

sahilagg06:
20160404 19:27:28
Thanks @jawaharR. :) 

Jawahar R:
20160404 16:24:01
@sahilagg06, squares are also rectangles... so, you should include (2 2) and (1 1). 

sahilagg06:
20160402 19:44:11
How input 6 can have 8 rectangles.? Only possibilities are


forceawakened:
20160307 11:57:24
yay! my 25th :) 
Added by:  Race with time 
Date:  20090503 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  Algorithmic Engagements 2009 