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
kavishlodha123: 2020-05-04 14:11:55

why don't spoj make a seperate place for those people who comment ac in one go and give them a medal
btw I also got ac in one go

mill_2611: 2020-04-28 20:04:29

my first AC in one go!!!!

rahul_521: 2020-04-20 16:00:12

Last edit: 2020-04-20 16:01:03
yourmom__: 2020-04-13 09:25:23

No one cares about your "AC in one go" lol

shashankchdhry: 2020-04-09 19:30:42

Hint: Analyse the given diagram.

wrango: 2020-03-01 10:18:39

Ac one go!!

saurabh_negi: 2020-01-01 15:25:11

Last edit: 2020-01-04 17:26:20
rajrawat_: 2019-12-20 15:41:37

Fuck i am not able to solve it

bohot_hard_123: 2019-12-09 12:05:10

A.C in one go yesssssss

black_spider1: 2019-10-25 03:53:18

AC in one go!

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