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.
For French speakers there is solution and explanation on this site:
@burger_king, Y U ZO OZM? :O :O :O
use dp easy
Very easy Question ... AC in first attempt.
Super easy question but my silly mistake cost me 5 WAs.. :(
wrong at judge 9 ....
Easy one, First Accepted :)
No Need DP.Simple for loops.
How to solve it with dp??
very easy problem , no idea about DP , but can be done with simple logic in <12 lines :) . AC in 1st go!!!