AE00 - Rectangles

no tags 

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.

Added by:Race with time
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel Pentium G860 3GHz)
Languages:All except: ERL JS NODEJS PERL 6 SCM chicken
Resource:Algorithmic Engagements 2009

hide comments
Harsh Vardhan Ladha: 2015-05-24 06:19:12

Forgot to break :P AC

bholagabbar: 2015-04-08 14:48:06

Why won't this work? ((n/2)*2)-1)+(((n+1)/2)
The first bracket is the number of squares and the number of rectangles. -1 because 1 does not form a square.
The second one is the odd number of squares.
Why is it flawed?

Francky: 2015-04-05 12:25:44

I've edit the body, now everybody should see the image inside the description.

NIKHIL KUMAR SINGH: 2015-04-04 17:31:18

image didn't get load on my browser

re(vamsi): Is this visible?

Last edit: 2015-04-05 08:29:49
Gaurav: 2015-02-27 06:38:50

2 lines O(n^0.5) soln :)

Jonas Collberg: 2015-02-17 12:29:44

Better solution than O(N ^ 0.5) possible?

manish kumar: 2015-02-06 10:03:58

AC at last....:)

Sarthak: 2015-02-05 14:24:00

Last edit: 2015-02-05 14:24:39
Sajan mishra: 2015-01-19 06:26:13

Problem description is flawed, it asks for unique rectangles, but the answer is different.

Parth: 2015-01-09 09:16:36

easy one....AC in one go!!!...:)