AE00 - Rectangles

no tags 

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.

Added by:Race with time
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel Pentium G860 3GHz)
Languages:All except: ERL JS NODEJS PERL 6
Resource:Algorithmic Engagements 2009

hide comments
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.. :(

ROHIT Kumar: 2015-07-31 12:31:16

wrong at judge 9 ....

ALi Ibrahim: 2015-07-27 12:29:53

Easy one, First Accepted :)

Akshay Aradhya: 2015-07-15 19:49:18

No Need DP.Simple for loops.

Vivek: 2015-07-06 21:34:56

How to solve it with dp??

baapkebaap: 2015-06-30 09:52:04

very easy problem , no idea about DP , but can be done with simple logic in <12 lines :) . AC in 1st go!!!

Abhinav : 2015-06-18 18:20:12

finally 0.00! use dp..:)

Abhinav : 2015-06-18 18:20:11

finally 0.00! use dp..:)

iammangod96: 2015-06-16 21:35:44

nothing to learn as such. Use the following formula if really wanna do -

int p = floor(sqrt(n));
int sum=0;
for(int i=1;i<=p;i++){
sum+=floor(n/i) - (i-1);