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
shantanu:
20131116 10:03:24
gotcha! 

Abhishek gupta:
20131105 20:08:30
anyone other than o(n^2)


Ali Kanaan:
20131017 07:33:24
Last edit: 20131019 16:07:54 

shauna paul:
20130901 13:25:23
return 0;: reason for getting NZEC


Hasil Sharma:
20130719 11:59:08
recursive as well as iterative solutions are accepted 

Pranye Mawai:
20130718 14:55:16
lucky to pass... 0.94 sec.. :P 

L:
20130620 11:49:09
@Dark Knight


Sagar Grover:
20130619 15:41:29
Recursion makes it easy 

king:
20130617 12:11:42
O(n^2) got passed :) 

chk:
20130603 10:08:34
nice and easy :)

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 