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.
Only using single loop.Got AC in first go:):):)
No need of DP, just a simple logic, no special cases nothing
don't forget n=1 case otherwise u will get WA i got two :P
You can solve this problem for O(n^0.5).
what is the answer of 10000
for those of you missing 10th test case check for n=1
Hint: unique areas
@top_gun007 ans is 46884
whats the answer for 10000?
no dp req. factors enough !!