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
Rohit Gurnani: 2014-10-03 21:37:06

AC in first attempt....:)

Pagarwal: 2014-09-04 01:36:07


Pagarwal: 2014-09-04 00:40:17

10th case is not running..getting wrong answer..can anyone tell me if input is 7 then no. of triangles should be 9 or am i wrong..??

Last edit: 2014-09-04 00:41:37
Rajat (1307086): 2014-08-25 23:22:36

10 th test case was like 1 ball 6 runs cricket match.6 runs if 10th case beaten otherwise clean bold ;)

Vaibhav Gosain: 2014-08-14 07:26:58

easy one even for begginers like me.... should be in the tutorial problems

rituraj: 2014-08-12 22:27:52

Green AC in first attempt after spending some good time on finding the algo...
some test cases-10(15),15(24),25(46),100(246)

Radha Jalan: 2014-07-30 10:37:57

AC in first attempt...yippee..:)

Prajval Prabhakar: 2014-07-25 21:35:52

AC in first go :)

Akashdeep: 2014-07-20 11:11:28

getting tle on 10th case anyone please explain

Sanket Dasgupta: 2014-06-27 13:50:07

@Saurabh, a square is a kind of rectangle. It is not necessary for a rectangle to have two unequal sides.

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