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.
The first and only line of the standard input contains one integer N (1 <= N <= 10000).
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.
For the input data:
the correct result is:
Task author: Jakub Radoszewski.
See also https://oeis.org/A094820
AC in 2 go ! haha @sqrt(n)
Don't forget to initialize your count to 0. AC on 6th attempt.
Ac in one go
Last edit: 2019-01-01 17:17:05
AC in one go!
I got the pattern.
can we solve in O(1) time
Helpppp!!!! I count for each factor of N