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
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
sarthak_8: 2018-03-19 21:58:48

Cakewalk. Don't forget for n = 1, else WA :P

badasshackme: 2018-03-10 14:20:13

it took me 30 minutes to realize that YOU MUST NOT ADD NEW LINE SYMBOL AT THE END OF OUTPUT, OR YOUR ABSOLUTELY CORRECT RESULT WILL BE REPORTED AS WRONG. Sorry for caps, it is annoying when you solved problem mathematically and some random new line rule ruins it.

pigpork: 2018-03-08 13:47:40


richardks3647: 2018-02-24 08:05:40

AC in one go!

Last edit: 2018-03-03 06:57:22

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