Problem - D - Codeforces
思路:
ansA <= B <= C
想使改变的总和最小,那就不超过2倍
1 <= ansA <= 2a ; 1 <= B <=2b
C = 2B 或 C = B
代码:
#include<iostream>
#include<cstring>
#include<algorithm>
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
using namespace std;
int main()
{
IOS;
int t;
cin >> t;
while(t --)
{
int a, b, c;
int cnt = 1e9;
int A, B, C, ans;
cin >> a >> b >> c;
for(int i = 1; i <= 2*a; i ++ )
{
for(int j = i; j <= 2*b; j += i )
{
for(int k = 0; k < 2; k ++ )
{
ans = abs(a-i) + abs(b - j) + abs(c -(j * (c/j) + k*j));
if(ans < cnt)
{
cnt = ans;
A = i;
B = j;
C = j * (c/j) + k*j;
}
}
}
}
cout << cnt << endl << A <<' '<< B << ' ' << C << endl;
}
return 0;
}