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.
Green AC in first attempt after spending some good time on finding the algo...
AC in first attempt...yippee..:)
AC in first go :)
getting tle on 10th case anyone please explain
@Saurabh, a square is a kind of rectangle. It is not necessary for a rectangle to have two unequal sides.
There is a square in the diagram, not a rectangle. :)
AC in first run :)
If you are getting WA in 10th test case, your algo. is probably wrong for odd 'n'.Last edit: 2014-06-23 00:35:51
Ac in second attempt :D
got in the frst do!!!!:D