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
axelmp:
20230710 03:29:54
I have a solution in O(1) but it only gives up to case 10. Can someone tell me what is wrong?


sky_10:
20220807 20:08:53
ac in one go! 

pavan_37:
20210630 10:47:25
AC in one go....


aryankk:
20210528 11:33:52
hint: just find the factors of n and see that they don't repeat


jinks:
20201231 10:05:17
Learned Something from this question, good question! 

sivan_353:
20201111 06:06:33
i did the program with simple if else but its showing time limit exceeded. why???? 

sivan_353:
20201108 16:44:34
.I don't even understand the question 

yuvrajsharma:
20201006 19:32:50
this can also be done in O(sqrt(n)) 

coder582:
20201006 11:44:27
I got AC in this problem, I have n*sqrt(n) complexity solution, someone please share hint for a better solution. 

naveen1948:
20201004 09:34:08
only idiots write 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 