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
umeeya: 2016-06-12 08:01:28

what is the answer of 10000

Yogesh Dorbala: 2016-06-05 07:52:14

for those of you missing 10th test case check for n=1

code0monkey1: 2016-06-04 13:45:40

Hint: unique areas

code1monkey1: 2016-06-03 20:31:25

@top_gun007 ans is 46884

top_gun007: 2016-06-03 18:34:40

whats the answer for 10000?

mkfeuhrer: 2016-05-30 22:20:31

no dp req. factors enough !!

noob909: 2016-05-28 14:57:05

dp+division concept :D

bhushangawde: 2016-05-13 09:20:56

nailed it in first go!

rayhan50001: 2016-05-01 19:03:09

Easy One AC in 1st Go

sahilagg06: 2016-04-04 19:27:28

Thanks @jawaharR. :)


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 NODEJS PERL 6 VB.net
Resource:Algorithmic Engagements 2009