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.
finally 0.00! use dp..:)
nothing to learn as such. Use the following formula if really wanna do -
Recursive solution in Java gave me an Stack Overflow... =/
10th test case wa ?
Harsh Vardhan Ladha:
Forgot to break :P AC
Why won't this work? ((n/2)*2)-1)+(((n+1)/2)
I've edit the body, now everybody should see the image inside the description.
NIKHIL KUMAR SINGH:
image didn't get load on my browser
2 lines O(n^0.5) soln :)
Better solution than O(N ^ 0.5) possible?