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
yash9274:
20200922 10:57:14
Hint: think of brute force... something like


mahabir10:
20200921 13:30:06
Extremely Easy one 

bhargav_sk:
20200917 15:08:59
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. 

saurabh_shinde:
20200812 10:23:43
my first AC in one go !!! Lets go !!! 

hblord787:
20200629 08:33:33
an O(1) solution is possible for it .. just try to find that 

ashwin0710:
20200610 17:29:23
Easy one, dont think the solution to be too complicated......Can be done in O(n*sqrt(n)) 

niksd23:
20200531 16:05:15
AC in 2nd time!!!! 

wargang:
20200527 09:14:43
AC in one go 

vinayak_26:
20200525 18:28:14
AC in first go :) 

hades_23:
20200525 14:51:52
For those writing "AC in one Go" FUCK YOU 
Added by:  Race with time 
Date:  20090503 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  Algorithmic Engagements 2009 