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.


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

hide comments
2024-05-21 15:39:14
Easy
2024-03-10 14:41:55
is same vertical horizontal rectangles can come
2023-07-10 03:29:54
I have a solution in O(1) but it only gives up to case 10. Can someone tell me what is wrong?
sqrt(n) +(n-2) + ((n/2) - (sqrt(n) /2))
2022-08-07 20:08:53
ac in one go!
2021-06-30 10:47:25
AC in one go....
2021-05-28 11:33:52
hint: just find the factors of n and see that they don't repeat
2020-12-31 10:05:17
Learned Something from this question, good question!
2020-11-11 06:06:33
i did the program with simple if else but its showing time limit exceeded. why????
2020-11-08 16:44:34
.I don't even understand the question
2020-10-06 19:32:50
this can also be done in O(sqrt(n))
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.