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
Gaurav:
20150227 06:38:50
2 lines O(n^0.5) soln :) 

Jonas Collberg:
20150217 12:29:44
Better solution than O(N ^ 0.5) possible? 

manish kumar:
20150206 10:03:58
AC at last....:)


Sarthak:
20150205 14:24:00
Last edit: 20150205 14:24:39 

Sajan mishra:
20150119 06:26:13
Problem description is flawed, it asks for unique rectangles, but the answer is different. 

Parth:
20150109 09:16:36
easy one....AC in one go!!!...:) 

Mamdouh Ahmed:
20150108 12:38:36
AC on first submission,


Siddharth:
20141227 12:35:43
I am getting right answer in my compiler but here I am not.I have tried exta test cases suggested by rituraj.So what should I do as I am a newbie?


Abhishek Deora:
20141013 21:32:59
on ideone time for n=10000 is 0.4 sec. while here its showing tle... why is it so ? 

saumya:
20141013 17:11:04
AC in first Go!! Thank you for the cases @rituraj... Really helped

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 