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.
|Added by:||Race with time|
|Cluster:||Cube (Intel Pentium G860 3GHz)|
|Languages:||All except: ERL JS NODEJS PERL 6 SCM chicken VB.net|
|Resource:||Algorithmic Engagements 2009|
2 lines O(n^0.5) soln :)
Better solution than O(N ^ 0.5) possible?
AC at last....:)
Last edit: 2015-02-05 14:24:39
Problem description is flawed, it asks for unique rectangles, but the answer is different.
easy one....AC in one go!!!...:)
AC on first submission,
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?
on ideone time for n=10000 is 0.4 sec. while here its showing tle... why is it so ?
AC in first Go!! Thank you for the cases @rituraj... Really helped