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
axelmp: 2023-07-10 03:29:54

I have a solution in O(1) but it only gives up to case 10. Can someone tell me what is wrong?
sqrt(n) +(n-2) + ((n/2) - (sqrt(n) /2))

sky_10: 2022-08-07 20:08:53

ac in one go!

pavan_37: 2021-06-30 10:47:25

AC in one go....

aryankk: 2021-05-28 11:33:52

hint: just find the factors of n and see that they don't repeat

jinks: 2020-12-31 10:05:17

Learned Something from this question, good question!

sivan_353: 2020-11-11 06:06:33

i did the program with simple if else but its showing time limit exceeded. why????

sivan_353: 2020-11-08 16:44:34

.I don't even understand the question

yuvrajsharma: 2020-10-06 19:32:50

this can also be done in O(sqrt(n))

coder582: 2020-10-06 11:44:27

I got AC in this problem, I have n*sqrt(n) complexity solution, someone please share hint for a better solution.

naveen1948: 2020-10-04 09:34:08

only idiots write AC in one go
stop spamming that shit

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