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
Ankur Yadav: 2013-05-30 15:14:50

what is the answer for n=10000?

Amey Telawane: 2013-05-30 10:49:34

easy problem,,, very short code :)

Rowan Zafer: 2013-05-14 17:40:16

Test case 10, keeps bringing me down

aya mohsen: 2013-04-23 12:54:58

momkn 7ad y2oly el test cases?

ওয়াসী (Wasi): 2013-04-06 12:29:04

Nice problem
short and simple..
AC at 2nd attempt(forgot to return 0 first time :P)

Juɑƞ Chɑpɑrro: 2013-03-29 02:47:34

10 Lines ;)

killerz: 2013-03-27 11:03:28

one of the smallest...

Last edit: 2013-03-27 11:03:39
xxx: 2013-02-26 18:28:55

nice one....have a try :D :) !!

saket diwakar: 2013-01-28 21:20:00

simple one...:)


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