Sphere Online Judge

SPOJ Problem Set (classical)

4300. Rectangles

Problem code: AE00

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 SCM chicken VB.net
Resource:Algorithmic Engagements 2009

hide comments
2015-02-27 06:38:50 Gaurav
2 lines O(n^0.5) soln :)
2015-02-17 12:29:44 Jonas Collberg
Better solution than O(N ^ 0.5) possible?
2015-02-06 10:03:58 manish kumar
AC at last....:)
2015-02-05 14:24:00 Sarthak

Last edit: 2015-02-05 14:24:39
2015-01-19 06:26:13 Sajan mishra
Problem description is flawed, it asks for unique rectangles, but the answer is different.
2015-01-09 09:16:36 Parth
easy one....AC in one go!!!...:)
2015-01-08 12:38:36 Mamdouh Ahmed
AC on first submission,
Super easy problem.
2014-12-27 12:35:43 Siddharth
I am getting right answer in my compiler but here I am not.I have tried exta test cases suggested by rituraj.So what should I do as I am a newbie?
2014-10-13 21:32:59 Abhishek Deora
on ideone time for n=10000 is 0.4 sec. while here its showing tle... why is it so ?
2014-10-13 17:11:04 saumya priya
AC in first Go!! Thank you for the cases @rituraj... Really helped
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.