SPOJ Problem Set (classical)
4300. Rectangles
Problem code: AE00

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.
Added by:  Race with time 
Date:  20090503 
Time limit:  1s

Source limit:  50000B 
Memory limit:  1536MB 
Cluster: 
Cube (Intel Pentium G860 3GHz)

Languages:  All except: ERL JS NODEJS PERL 6 SCM chicken VB.net 
Resource:  Algorithmic Engagements 2009 
