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
rishabh nigam: 2011-03-15 10:39:16

N=10000
46884
N=5000
21723
where is my answer wrong

The Champ: 2010-10-20 09:29:35

@pooja

N=10000
46884

Rise: 2010-10-05 07:11:21

Can anyone add more testcases?? I am getting wrong answer :(

David Gómez: 2010-08-07 20:16:34

PDF link is not working

Kuntal Ghosh: 2010-05-18 05:49:01

yeah,this is correct...

jack(chakradarraju): 2010-03-19 08:24:06

square is also a rectangle
(i.e.) square can be derived from rectangle

Rodrigo Salazar: 2010-02-15 02:25:29

@tinku: rectangle has 4 sides, with 4 right angles

Last edit: 2010-02-15 02:26:16
Pranay: 2010-02-09 16:14:33

how can 1x1 be a rectangle?


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-RHINO NODEJS PERL6 VB.NET
Resource:Algorithmic Engagements 2009