A. Help Farmer

題目連接：

http://www.codeforces.com/contest/142/problem/A

Description

Once upon a time in the Kingdom of Far Far Away lived Sam the Farmer. Sam had a cow named Dawn and he was deeply attached to her. Sam would spend the whole summer stocking hay to feed Dawn in winter. Sam scythed hay and put it into haystack. As Sam was a bright farmer, he tried to make the process of storing hay simpler and more convenient to use. He collected the hay into cubical hay blocks of the same size. Then he stored the blocks in his barn. After a summer spent in hard toil Sam stored A·B·C hay blocks and stored them in a barn as a rectangular parallelepiped A layers high. Each layer had B rows and each row had C blocks.

At the end of the autumn Sam came into the barn to admire one more time the hay he'd been stacking during this hard summer. Unfortunately, Sam was horrified to see that the hay blocks had been carelessly scattered around the barn. The place was a complete mess. As it turned out, thieves had sneaked into the barn. They completely dissembled and took away a layer of blocks from the parallelepiped's front, back, top and sides. As a result, the barn only had a parallelepiped containing (A?-?1)?×?(B?-?2)?×?(C?-?2) hay blocks. To hide the evidence of the crime, the thieves had dissembled the parallelepiped into single 1?×?1?×?1 blocks and scattered them around the barn. After the theft Sam counted n hay blocks in the barn but he forgot numbers A, B и C.

Given number n, find the minimally possible and maximally possible number of stolen hay blocks.

Input

The only line contains integer n from the problem's statement (1?≤?n?≤?109).

Output

Print space-separated minimum and maximum number of hay blocks that could have been stolen by the thieves.

Note that the answer to the problem can be large enough, so you must use the 64-bit integer type for calculations. Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specificator.

Sample Input

4

Sample Output

28 41

Hint

題意

給你一個n，說這個n等于(A-1)(B-2)(C-2)

然后你要找到ABC-n的最大值和最小值

題解：

自己暴力分解n之后，枚舉因子k

然后再枚舉n/k的因子

這樣就可以得到(A-1)(B-2)(C-2)這三個玩意兒了

然后暴力統(tǒng)計答案就好了。

復(fù)雜度感覺是n^3/4的，但是實際跑的很快

代碼

#include<bits/stdc++.h> using namespace std;int main() {long long n;cin>>n;long long ans1 = 0;long long ans2 = 1LL<<60;for(int i=1;i*i<=n;i++){if(n%i==0){long long p = n/i;for(int j=1;j*j<=p;j++){if(p%j==0){long long a = i;long long b = j;long long c = p/j;ans1 = max(ans1,(a+1)*(b+2)*(c+2));ans1 = max(ans1,(a+2)*(b+1)*(c+2));ans1 = max(ans1,(a+2)*(b+2)*(c+1));ans2 = min(ans2,(a+1)*(b+2)*(c+2));ans2 = min(ans2,(a+2)*(b+1)*(c+2));ans2 = min(ans2,(a+2)*(b+2)*(c+1));}}}}cout<<ans2-n<<" "<<ans1-n<<endl; }

轉(zhuǎn)載于:https://www.cnblogs.com/qscqesze/p/5578495.html

總結(jié)

以上是生活随笔為你收集整理的Codeforces Round #102 (Div. 1) A. Help Farmer 暴力分解的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。