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
saanc: 2013-12-28 13:05:24

nice one...simple maths...AC with ex. time 0.02 sec.

Ashwini: 2013-12-23 13:01:24

can anyone check why i am getting wrong answer. this question is so simple.
for n=10000 output 46884. is it wrong

Last edit: 2013-12-23 13:48:47
lzyerste: 2013-12-08 18:06:16

2 lines in python

californiagurl: 2013-11-17 14:55:39

is anyone using hashing?
edit: no need of dat... n*sqrt(n) gave AC in .09 sec :)

Last edit: 2013-11-17 19:13:01
shantanu: 2013-11-16 10:03:24

gotcha!

Abhishek gupta: 2013-11-05 20:08:30

anyone other than o(n^2)

Last edit: 2013-11-05 20:09:21
Ali Kanaan: 2013-10-17 07:33:24

Last edit: 2013-10-19 16:07:54
shauna paul: 2013-09-01 13:25:23

return 0;: reason for getting NZEC

Hasil Sharma: 2013-07-19 11:59:08

recursive as well as iterative solutions are accepted

Pranye Mawai: 2013-07-18 14:55:16

lucky to pass... 0.94 sec.. :P


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