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
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!!!...:)

Mamdouh Ahmed: 2015-01-08 12:38:36

AC on first submission,
Super easy problem.

Siddharth: 2014-12-27 12:35:43

I am getting right answer in my compiler but here I am not.I have tried exta test cases suggested by rituraj.So what should I do as I am a newbie?

Abhishek Deora: 2014-10-13 21:32:59

on ideone time for n=10000 is 0.4 sec. while here its showing tle... why is it so ?

saumya: 2014-10-13 17:11:04

AC in first Go!! Thank you for the cases @rituraj... Really helped

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