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.


The first and only line of the standard input contains one integer N (1 <= N <= 10000).


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.


For the input data:


the correct result is:


Task author: Jakub Radoszewski.

hide comments
Ashis: 2014-06-24 19:08:01

AC in first run :)

shannider: 2014-06-23 00:07:09

If you are getting WA in 10th test case, your algo. is probably wrong for odd 'n'.

Last edit: 2014-06-23 00:35:51
Shireen Nagdive: 2014-06-20 20:50:35

Ac in second attempt :D

chin: 2014-06-08 14:10:25

got in the frst do!!!!:D

shashank mishra: 2014-06-04 11:48:19

test case 10 is not pass in my code.

insane0808: 2014-05-27 09:23:47

AC at first go ... :)

newbie: 2014-05-20 05:17:26

0.01 AC! at last

newbie: 2014-05-20 04:47:22

timelimit exceeded in the 10th test case

Mensud Beèar: 2014-05-04 23:06:05

six rows solution, AC at first go :)

ppppppp: 2014-04-14 19:23:58

dont use float which cost me 5 wa but finally acc

Added by:Race with time
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