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
gomathi ganesan:
20151230 09:42:58
factors!!!!! 

sourabh:
20151226 07:55:35
Use dp 

Bartosz:
20151219 19:22:54
Very easy one. Good for beginners. 

priyanshu ranjan:
20151212 19:37:23
piece of cake (_) 

vishnu agarwal:
20151208 17:11:57
use loop from 1 to n/2+1 and check answer for 1 is 1... . 

rajesh1995:
20151129 11:57:39
just two for loops..done in 0.0 s 

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

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 