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
sarthak_8:
20151021 20:54:54
Can somebody please tell me the error in my code. It shows the correct output for every test case but SPOJ shows WA. Here's the code ideone.com/WEZYgT 

garmel:
20151018 14:23:13
For French speakers there is solution and explanation on this site:


aswathys81:
20151011 13:06:12
@burger_king, Y U ZO OZM? :O :O :O


burger_king:
20150930 18:18:51
use dp easy


Mahesh Chaurasia:
20150802 21:58:29
Very easy Question ... AC in first attempt.


MishThi:
20150802 05:42:14
Super easy question but my silly mistake cost me 5 WAs.. :( 

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?? 
Added by:  Race with time 
Date:  20090503 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel Pentium G860 3GHz) 
Languages:  All except: ERL JS NODEJS PERL 6 VB.net 
Resource:  Algorithmic Engagements 2009 