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
deepak097: 2017-09-11 21:44:51

1 Go AC ! just count the no of divisors upto((floor)sqrt(i)) where 1<=i<=n

softxide: 2017-08-09 09:35:41

first find a pattern for n = 6 , then try finding pattern for n = 8 .
use the given illustration for n = 8 and see what pattern is getting formed when we will form rectangle with 3 rows .

shekhar_kumar: 2017-08-08 19:50:24


jayharsh: 2017-07-16 14:54:33

get AC in one go...

bitswise: 2017-07-08 22:38:21

Literally, took me like 2 minutes and I'm average at best!

Ravi Jangra: 2017-07-08 09:22:31

its all about finding the pattern and start an loop with optimised iterations

lqv111996: 2017-07-05 18:12:14

AC in the first! seem it is very simples

hema_197: 2017-06-23 09:54:05

Last edit: 2017-07-08 20:50:18
ashwani0605: 2017-05-27 17:40:05

AC in one go, simply use general mathematics no use of using DP, just basic Ad-hoc

bharanidharan1: 2017-05-25 11:49:33


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