Sphere Online Judge

SPOJ Problem Set (classical)

4300. Rectangles

Problem code: AE00


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.


Added by:Race with time
Date:2009-05-03
Time limit:1s
Source limit:50000B
Memory limit:256MB
Cluster: Pyramid (Intel Pentium III 733 MHz)
Languages:All except: ERL JS NODEJS PERL 6
Resource:Algorithmic Engagements 2009

hide comments
2014-07-25 21:35:52 Prajval Prabhakar
AC in first go :)
2014-07-20 11:11:28 akashdeep Singh dhanju
getting tle on 10th case anyone please explain
2014-06-27 13:50:07 Sanket Dasgupta
@Saurabh, a square is a kind of rectangle. It is not necessary for a rectangle to have two unequal sides.
2014-06-25 18:11:55 Saurav Sharma
There is a square in the diagram, not a rectangle. :)
2014-06-24 19:08:01 Ashis Kumar Sahoo
AC in first run :)
2014-06-23 00:07:09 shannider
If you are getting WA in 10th test case, your algo. is probably wrong for odd 'n'.

Last edit: 2014-06-23 00:35:51
2014-06-20 20:50:35 Shireen Nagdive
Ac in second attempt :D
2014-06-08 14:10:25 chin
got in the frst do!!!!:D
2014-06-04 11:48:19 shashank mishra
test case 10 is not pass in my code.
2014-05-27 09:23:47 insane0808
AC at first go ... :)
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.