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:256MB
Cluster: Pyramid (Intel Pentium III 733 MHz)
Languages:All except: ERL JS NODEJS PERL 6
Resource:Algorithmic Engagements 2009

hide comments
2014-12-13 10:37:18 Pritish Jain
never mind got the problem.. thanks
2014-12-13 10:19:21 Pritish Jain
getting wrong answer in test case 10th can someone explain please
2014-12-08 19:30:48 Ashish Gaurav
Even O(n) works. I think an O(1) will work as well. AC!
2014-12-02 10:54:25 PRAFFUL MEHROTRA
finally ac...@only 0.10
2014-11-09 19:26:44 Jasdeep Singh
i just got 7-8 wrong answers just because i hadn't initialize the variable
count i just wanna punch someone right now
2014-10-28 09:50:57 sumit suthar
getting tle please check my code
2014-10-23 10:39:30 Gopesh Tulsyan
AC in the first go.Applied brute force, shud be in tutorial :)
2014-10-18 22:12:58 Arnab Mitra
Quite easy :)
2014-10-14 12:22:34 Aditya Joshi
Why does Java give an NZEC on the 10th test case? All cases work fine on my local machine. Got the same algorithm accepted with Python.

Last edit: 2014-10-20 08:10:46
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 ?
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.