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
Rohit Gurnani:
20141003 21:37:06
AC in first attempt....:) 

Pagarwal:
20140904 01:36:07
done...:) 

Pagarwal:
20140904 00:40:17
10th case is not running..getting wrong answer..can anyone tell me if input is 7 then no. of triangles should be 9 or am i wrong..?? Last edit: 20140904 00:41:37 

Rajat (1307086):
20140825 23:22:36
10 th test case was like 1 ball 6 runs cricket match.6 runs if 10th case beaten otherwise clean bold ;) 

Vaibhav Gosain:
20140814 07:26:58
easy one even for begginers like me.... should be in the tutorial problems 

rituraj:
20140812 22:27:52
Green AC in first attempt after spending some good time on finding the algo...


Radha Jalan:
20140730 10:37:57
AC in first attempt...yippee..:)


Prajval Prabhakar:
20140725 21:35:52
AC in first go :) 

Akashdeep:
20140720 11:11:28
getting tle on 10th case anyone please explain 

Sanket Dasgupta:
20140627 13:50:07
@Saurabh, a square is a kind of rectangle. It is not necessary for a rectangle to have two unequal sides. 
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 