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.
Input
The first and only line of the standard input contains one integer N (1 <= N <= 10000).
Output
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.
Example
For the input data:
6
the correct result is:
8
Task author: Jakub Radoszewski.
hide comments
vetox:
20170103 12:57:10
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.


ignacio:
20161227 07:31:46
Nice problem 

shantanu_sarin:
20161206 23:17:12
Just try to judge the pattern .......for n=2,3,4.......15 and your job is done...


tawhidkuet04:
20161204 19:00:35
AC in one go !!!!!!!! :D 

soodan:
20161204 15:31:02
AC IN ONE GO!!!!!!!!! 

anurag200698:
20161117 17:26:54
very simple got AC in first go:) 

mohitgupta07:
20161116 08:09:50
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


harsh2leo:
20161022 13:21:37
finally,,,,,,,,, :'D 

adi_pra:
20161011 21:39:27
got AC in one go , O(n^0.5). 

hamjosh1:
20160915 07:28:52
O(sqrt(n)) :'D 
Added by:  Race with time 
Date:  20090503 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JS NODEJS PERL 6 VB.net 
Resource:  Algorithmic Engagements 2009 