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.
Simple Adhoc problem :nested for to count no of rectangle
1 Go AC ! just count the no of divisors upto((floor)sqrt(i)) where 1<=i<=n
first find a pattern for n = 6 , then try finding pattern for n = 8 .
AC IN ONE GO...
get AC in one go...
Literally, took me like 2 minutes and I'm average at best!
its all about finding the pattern and start an loop with optimised iterations
AC in the first! seem it is very simples
Last edit: 2017-07-08 20:50:18
AC in one go, simply use general mathematics no use of using DP, just basic Ad-hoc