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
Lai Manh Tuan:
2013-01-15 18:06:09
less than 15 lines of code |
|
Himanshu:
2013-01-11 08:24:18
too simple prob........
|
|
Atul Kumar Verma:
2013-01-08 17:19:09
with this problem i completed 50 problems on spoj :) |
|
ghtwht:
2013-01-01 18:41:50
got it AC !!!!!!!! :D
|
|
gourav:
2012-10-17 16:00:26
20th ;) |
|
paras meena:
2012-10-12 12:25:01
whts test cases plz tell me
|
|
Raginee:
2012-09-28 19:30:07
cant get the question any one explain plz.. |
|
Sumit Khanna:
2012-07-26 19:08:26
"1" appears to be the input for case 9,was getting WA before i ment my code to output 1 for 1 |
|
Teddy Budiono Hermawan:
2012-06-02 01:04:52
Here's the disappeared image http://main.edu.pl/images/PA2009/pro1.gif |
|
legrand:
2012-04-20 08:15:34
the picture has disapeared, can you fix it |
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 |