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.
Hint: think of brute force... something like
Extremely Easy one
For all the people who post "AC in one go" - NOBODY CARES, people look in the comments to find if they can get anything helpful, not to see you all bragging. so comment only if you have something useful to share.
my first AC in one go !!! Lets go !!!
an O(1) solution is possible for it .. just try to find that
Easy one, dont think the solution to be too complicated......Can be done in O(n*sqrt(n))
AC in 2nd time!!!!
AC in one go
AC in first go :-)
For those writing "AC in one Go" FUCK YOU