习题4-9(uva-1591)

#include <iostream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>

#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
int main()
{
	int n, p, q;
	while (cin >> n >> p >> q) {

		long long int  base = (n - 1) * p, minLen = n * q,len = 0, a = 0, b = 0, k = minLen << 10;

		for (int A = 0; A < 32; ++A) {
			for (int B = 0; B < 32; ++B) {
				len = ((base + (base << A)) >> B) + q;
				if (len >= minLen && len < k) {
					k = len;
					a = A;
					b = B;
				}
			}
		}
		cout << k << " " << a << " " << b << endl;
	}
	return 0;
}