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.
Input
The first and only line of the standard input contains one integer N (1 <= N <= 10000).
Output
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.
Example
For the input data:
6
the correct result is:
8
Task author: Jakub Radoszewski.
hide comments
baapkebaap:
2015-06-30 09:52:04
very easy problem , no idea about DP , but can be done with simple logic in <12 lines :) . AC in 1st go!!! |
|
Abhinav :
2015-06-18 18:20:12
finally 0.00! use dp..:) |
|
Abhinav :
2015-06-18 18:20:11
finally 0.00! use dp..:) |
|
iammangod96:
2015-06-16 21:35:44
nothing to learn as such. Use the following formula if really wanna do <snip> Last edit: 2022-10-13 20:16:29 |
|
cassiano:
2015-06-09 02:54:34
Recursive solution in Java gave me an Stack Overflow... =/
|
|
Siddhant Somani:
2015-06-02 20:10:05
10th test case wa ? |
|
Harsh Vardhan Ladha:
2015-05-24 06:19:12
Forgot to break :P AC |
|
bholagabbar:
2015-04-08 14:48:06
Why won't this work? ((n/2)*2)-1)+(((n+1)/2)
|
|
Francky:
2015-04-05 12:25:44
I've edit the body, now everybody should see the image inside the description. |
|
NIKHIL KUMAR SINGH:
2015-04-04 17:31:18
image didn't get load on my browser
|
Added by: | Race with time |
Date: | 2009-05-03 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ERL JS-RHINO NODEJS PERL6 VB.NET |
Resource: | Algorithmic Engagements 2009 |