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
sharath_111: 2016-01-26 14:18:03

good one for beginners,no need of dp,(factors!!) :) :) :)

gomathi ganesan: 2015-12-30 09:42:58

factors!!!!!

sourabh: 2015-12-26 07:55:35

Use dp

Bartosz: 2015-12-19 19:22:54

Very easy one. Good for beginners.

priyanshu ranjan: 2015-12-12 19:37:23

piece of cake (-_-)

vishnu agarwal: 2015-12-08 17:11:57

use loop from 1 to n/2+1 and check answer for 1 is 1... .

rajesh1995: 2015-11-29 11:57:39

just two for loops..done in 0.0 s

sarthak_8: 2015-10-21 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: 2015-10-18 14:23:13

For French speakers there is solution and explanation on this site:
https://openclassrooms.com/forum/sujet/spoj-aeoo-http-www-spoj-com-problems-ae00?page=1#message-89319668

Last edit: 2015-10-18 21:05:05
aswathys81: 2015-10-11 13:06:12

@burger_king, Y U ZO OZM? :O :O :O


Added by:Race with time
Date:2009-05-03
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS NODEJS PERL 6 VB.net
Resource:Algorithmic Engagements 2009