SPOJ Problem Set (classical)
Problem code: AE00
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.
|Added by:||Race with time|
Cube (Intel Pentium G860 3GHz)
|Languages:||All except: ERL JS NODEJS PERL 6 SCM chicken VB.net |
|Resource:||Algorithmic Engagements 2009|