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
hamjosh1: 2016-09-15 07:28:52

O(sqrt(n)) :'D

soodan: 2016-09-03 16:58:14

solve using factors and print test cases of n=1,2,3 complexity=O(n^2)

Last edit: 2016-09-03 16:59:16
narutohokage_1: 2016-08-11 21:02:23

Every Square Is a rectangle as rectangle is a quadrilateral with all angles right angle so all squares are also rectangle. But not vice versa . Output Is correct for figure shown for 6 squares there can be 8 rectangle.

narutohokage_1: 2016-08-11 20:59:42

There is no no absolutely no hidden cases in this problem . It is simple as it seem. For someone having hard time please know that i too had a hard time first but look at pattern it is easy. You can do it .. you are not less than others. You can do it. No recursion or Dynamic Programming required just simple solution. Please don't look at internet for Answers . You won't learn anything .No need for new line at end of solution.
Test Case
0 Ans 0
1 Ans 1
2 Ans 2
10000 ans 46884

narutohokage_1: 2016-08-11 19:54:38

@sajalkaushik17 Every Square Is A Rectangle. So Correct Output.

sajalkaushik17: 2016-08-08 16:36:42

output for example is wrong or not?

giriprasad kemburu: 2016-08-04 06:42:22

Only using single loop.Got AC in first go:):):)

alphastar: 2016-07-26 06:41:14

No need of DP, just a simple logic, no special cases nothing
just one nested loop

cena_coder: 2016-07-25 15:23:06

don't forget n=1 case otherwise u will get WA i got two :P

square1001: 2016-07-17 02:26:57

You can solve this problem for O(n^0.5).

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