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.
AC in 1 GO with 5 lines :">
Using some elementary summing formulas, you can get it down to a formula that's calculated in O(sqrt(n)) time.
Calculating the number of possible rectangles for each squares takes O( sqrt(n) ) time. To do that for n numbers 1, 2, 3, 4.....n, takes O( n * sqrt(n) ) operations. So that makes it O(n ^ 1.5) complexity.
Just try to judge the pattern .......for n=2,3,4.......15 and your job is done...
AC in one go !!!!!!!! :D
AC IN ONE GO!!!!!!!!!
very simple got AC in first go:)
O(n) not O(sqrt(n)). Since n>sqrt(n) . Well this question is good enough to make your basic concepts more clear also these type of adhoc question generally come up in competitions