https://mirror.codeforces.com/problemset/problem/1250/F
Can anybody please help me in solving this problem?
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | adamant | 160 |
3 | maomao90 | 159 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 148 |
6 | atcoder_official | 148 |
8 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
https://mirror.codeforces.com/problemset/problem/1250/F
Can anybody please help me in solving this problem?
Name |
---|
loop over i: 1 to n. if n is divisible by i, then take best: (i + n / i) and minimize it. then the answer is best * 2. code:
Thanks for the solution. But I could not understand the approach. What is the use of best variable in this code? And why should I minimize it? Can you please explain these to me? It would be a great help of me.
best
variable is used to store the minimum value of sum of any 2 non-parallel sides of the rectangle over all possible pairs of such sides.Doubling the value of the variable will result in the perimeter of the rectangle.
OK, I understood. But why the value of the best variable is 1000000000 ? Is there any special reason behind it?
That's because, no such sum can be greater that this value according to the constraints.
You can use
INT_MAX
forint
andLLONG_MAX
forlong long
.These respective MAXs store the maximum value the can fit in the respective datatypes.