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
ROHIT Kumar: 2015-07-31 12:31:16

wrong at judge 9 ....

ALi Ibrahim: 2015-07-27 12:29:53

Easy one, First Accepted :)

Akshay Aradhya: 2015-07-15 19:49:18

No Need DP.Simple for loops.

Vivek: 2015-07-06 21:34:56

How to solve it with dp??

baapkebaap: 2015-06-30 09:52:04

very easy problem , no idea about DP , but can be done with simple logic in <12 lines :) . AC in 1st go!!!

Abhinav : 2015-06-18 18:20:12

finally 0.00! use dp..:)

Abhinav : 2015-06-18 18:20:11

finally 0.00! use dp..:)

iammangod96: 2015-06-16 21:35:44

nothing to learn as such. Use the following formula if really wanna do -

int p = floor(sqrt(n));
int sum=0;
for(int i=1;i<=p;i++){
sum+=floor(n/i) - (i-1);
}
cout<<sum;

cassiano: 2015-06-09 02:54:34

Recursive solution in Java gave me an Stack Overflow... =/
Solved it with dynamic programming then.

Siddhant Somani: 2015-06-02 20:10:05

10th test case wa ?


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