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
Simon Liang:
20140411 23:28:04
so many gotcha's in this one 

Konstantin:
20140301 00:16:27
the picture is broken 

Neel Jinwala:
20140218 12:28:13
refrained from printing \n (newline) at the end.. ACcepted.. 

RAJAT SINGH:
20140121 20:51:24
please explain the algo.....to solve 

Sidharth Raja:
20140110 21:14:12
0.00 AC at first go. That feel. :') 

saanc:
20131228 13:05:24
nice one...simple maths...AC with ex. time 0.02 sec. 

Ashwini:
20131223 13:01:24
can anyone check why i am getting wrong answer. this question is so simple.


lzyerste:
20131208 18:06:16
2 lines in python 

californiagurl:
20131117 14:55:39
is anyone using hashing?


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