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
|
sajalkaushik17:
2016-08-08 16:36:42
output for example is wrong or not?
|
|
giriprasad kemburu:
2016-08-04 06:42:22
Only using single loop.Got AC in first go:):):)
|
|
alphastar:
2016-07-26 06:41:14
No need of DP, just a simple logic, no special cases nothing
|
|
cena_coder:
2016-07-25 15:23:06
don't forget n=1 case otherwise u will get WA i got two :P |
|
square1001:
2016-07-17 02:26:57
You can solve this problem for O(n^0.5). |
|
umeeya:
2016-06-12 08:01:28
what is the answer of 10000 |
|
Yogesh Dorbala:
2016-06-05 07:52:14
for those of you missing 10th test case check for n=1 |
|
code0monkey1:
2016-06-04 13:45:40
Hint: unique areas |
|
code1monkey1:
2016-06-03 20:31:25
@top_gun007 ans is 46884 |
|
top_gun007:
2016-06-03 18:34:40
whats the answer for 10000?
|
| 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 |
RSS