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
goodwilllion: 2018-01-29 09:21:37

AC IN ONE GO

sid_1097: 2018-01-06 14:31:57

What should be the output for input 10000 and 20.

hitesh87: 2017-12-23 17:55:23

AC in one go!! 0.00s

ajayc1007: 2017-11-28 11:24:49

thanx iamgod96
AC in one go
10:)

Last edit: 2017-11-28 11:25:41
elafifi: 2017-10-14 15:36:36

Simple Adhoc problem :nested for to count no of rectangle

deepak097: 2017-09-11 21:44:51

1 Go AC ! just count the no of divisors upto((floor)sqrt(i)) where 1<=i<=n

softxide: 2017-08-09 09:35:41

first find a pattern for n = 6 , then try finding pattern for n = 8 .
use the given illustration for n = 8 and see what pattern is getting formed when we will form rectangle with 3 rows .

shekhar_kumar: 2017-08-08 19:50:24

AC IN ONE GO...

jayharsh: 2017-07-16 14:54:33

get AC in one go...

bitswise: 2017-07-08 22:38:21

Literally, took me like 2 minutes and I'm average at best!


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