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 Kumar:
20150731 12:31:16
wrong at judge 9 .... 

ALi Ibrahim:
20150727 12:29:53
Easy one, First Accepted :) 

Akshay Aradhya:
20150715 19:49:18
No Need DP.Simple for loops. 

Vivek:
20150706 21:34:56
How to solve it with dp?? 

baapkebaap:
20150630 09:52:04
very easy problem , no idea about DP , but can be done with simple logic in <12 lines :) . AC in 1st go!!! 

Abhinav :
20150618 18:20:12
finally 0.00! use dp..:) 

Abhinav :
20150618 18:20:11
finally 0.00! use dp..:) 

iammangod96:
20150616 21:35:44
nothing to learn as such. Use the following formula if really wanna do 


cassiano:
20150609 02:54:34
Recursive solution in Java gave me an Stack Overflow... =/


Siddhant Somani:
20150602 20:10:05
10th test case wa ? 
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 