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
laidactienbn: 2018-09-23 12:26:44

Last edit: 2018-09-23 12:27:47
fraxz: 2018-09-19 09:01:15

It is just an easy math... You can solve it using 2 loops. But you need to do a little bit of optimization. Hint:- You can do it in o(sqrt(n))

yamone_123: 2018-08-05 09:10:18

Ac in one go! so ez

puddin: 2018-06-23 12:18:09

try to see or figure out some formula,hint:loop will run upto sqrt(n) to calculate sum*******TC (root_n)

that_rogue_guy: 2018-05-19 18:55:15

Easy Peasy Lemon Squeezy!

cabbie: 2018-05-11 21:18:44

AC in no go

ramesh_961: 2018-05-09 12:38:10

easy,AC in one go !Just think about factors

rohitistaken: 2018-04-18 16:35:40

AC in one go!!!

vritta: 2018-03-29 18:06:34

Last edit: 2018-03-29 21:15:55
vritta: 2018-03-29 18:05:56

Last edit: 2018-03-29 21:16:11

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