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
hamjosh1:
20160915 07:28:52
O(sqrt(n)) :'D 

soodan:
20160903 16:58:14
solve using factors and print test cases of n=1,2,3 complexity=O(n^2) Last edit: 20160903 16:59:16 

narutohokage_1:
20160811 21:02:23
Every Square Is a rectangle as rectangle is a quadrilateral with all angles right angle so all squares are also rectangle. But not vice versa . Output Is correct for figure shown for 6 squares there can be 8 rectangle. 

narutohokage_1:
20160811 20:59:42
There is no no absolutely no hidden cases in this problem . It is simple as it seem. For someone having hard time please know that i too had a hard time first but look at pattern it is easy. You can do it .. you are not less than others. You can do it. No recursion or Dynamic Programming required just simple solution. Please don't look at internet for Answers . You won't learn anything .No need for new line at end of solution.


narutohokage_1:
20160811 19:54:38
@sajalkaushik17 Every Square Is A Rectangle. So Correct Output. 

sajalkaushik17:
20160808 16:36:42
output for example is wrong or not?


giriprasad kemburu:
20160804 06:42:22
Only using single loop.Got AC in first go:):):)


alphastar:
20160726 06:41:14
No need of DP, just a simple logic, no special cases nothing


cena_coder:
20160725 15:23:06
don't forget n=1 case otherwise u will get WA i got two :P 

square1001:
20160717 02:26:57
You can solve this problem for O(n^0.5). 
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 