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
Bartosz: 2015-12-19 19:22:54

Very easy one. Good for beginners.

priyanshu ranjan: 2015-12-12 19:37:23

piece of cake (-_-)

vishnu agarwal: 2015-12-08 17:11:57

use loop from 1 to n/2+1 and check answer for 1 is 1... .

rajesh1995: 2015-11-29 11:57:39

just two for loops..done in 0.0 s

sarthak_8: 2015-10-21 20:54:54

Can somebody please tell me the error in my code. It shows the correct output for every test case but SPOJ shows WA. Here's the code

garmel: 2015-10-18 14:23:13

For French speakers there is solution and explanation on this site:

Last edit: 2015-10-18 21:05:05
aswathys81: 2015-10-11 13:06:12

@burger_king, Y U ZO OZM? :O :O :O

burger_king: 2015-09-30 18:18:51

use dp easy
got in 0.00 time

Mahesh Chaurasia: 2015-08-02 21:58:29

Very easy Question ... AC in first attempt.
No need of DP

MishThi: 2015-08-02 05:42:14

Super easy question but my silly mistake cost me 5 WAs.. :(

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