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
deepak097:
20170911 21:44:51
1 Go AC ! just count the no of divisors upto((floor)sqrt(i)) where 1<=i<=n 

softxide:
20170809 09:35:41
first find a pattern for n = 6 , then try finding pattern for n = 8 .


shekhar_kumar:
20170808 19:50:24
AC IN ONE GO...


jayharsh:
20170716 14:54:33
get AC in one go... 

bitswise:
20170708 22:38:21
Literally, took me like 2 minutes and I'm average at best! 

Ravi Jangra:
20170708 09:22:31
its all about finding the pattern and start an loop with optimised iterations 

lqv111996:
20170705 18:12:14
AC in the first! seem it is very simples 

hema_197:
20170623 09:54:05
Last edit: 20170708 20:50:18 

ashwani0605:
20170527 17:40:05
AC in one go, simply use general mathematics no use of using DP, just basic Adhoc 

bharanidharan1:
20170525 11:49:33
AC IN ONE GO... 
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 