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.
dont use float which cost me 5 wa but finally acc
so many gotcha's in this one
the picture is broken
refrained from printing \n (newline) at the end.. ACcepted..
please explain the algo.....to solve
0.00 AC at first go. That feel. :')
nice one...simple maths...AC with ex. time 0.02 sec.
can anyone check why i am getting wrong answer. this question is so simple.
2 lines in python
is anyone using hashing?