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
|
ignacio:
2016-12-27 07:31:46
Nice problem |
|
shantanu_sarin:
2016-12-06 23:17:12
Just try to judge the pattern .......for n=2,3,4.......15 and your job is done...
|
|
tawhidkuet04:
2016-12-04 19:00:35
AC in one go !!!!!!!! :D |
|
soodan:
2016-12-04 15:31:02
AC IN ONE GO!!!!!!!!! |
|
anurag200698:
2016-11-17 17:26:54
very simple got AC in first go:) |
|
mohitgupta07:
2016-11-16 08:09:50
O(n) not O(sqrt(n)). Since n>sqrt(n) . Well this question is good enough to make your basic concepts more clear also these type of adhoc question generally come up in competitions
|
|
harsh2leo:
2016-10-22 13:21:37
finally,,,,,,,,, :'D |
|
adi_pra:
2016-10-11 21:39:27
got AC in one go , O(n^0.5). |
|
hamjosh1:
2016-09-15 07:28:52
O(sqrt(n)) :'D |
|
|
soodan:
2016-09-03 16:58:14
solve using factors and print test cases of n=1,2,3 complexity=O(n^2) Last edit: 2016-09-03 16:59:16 |
| 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