Three Integers CodeForces - 1311D(思维+暴力)

You are given three integers a≤b≤c.

In one move, you can add +1 or −1 to any of these integers (i.e. increase or decrease any number by one). You can perform such operation any (possibly, zero) number of times, you can even perform this operation several times with one number. Note that you cannot make non-positive numbers using such operations.

You have to perform the minimum number of such operations in order to obtain three integers A≤B≤C such that B is divisible by A and C is divisible by B.

You have to answer t independent test cases.

Input
The first line of the input contains one integer t (1≤t≤100) — the number of test cases.

The next t lines describe test cases. Each test case is given on a separate line as three space-separated integers a,b and c (1≤a≤b≤c≤104).

Output
For each test case, print the answer. In the first line print res — the minimum number of operations you have to perform to obtain three integers A≤B≤C such that B is divisible by A and C is divisible by B. On the second line print any suitable triple A,B and C.

Example
Input
8
1 2 3
123 321 456
5 10 15
15 18 21
100 100 101
1 22 29
3 19 38
6 30 46
Output
1
1 1 3
102
114 228 456
4
4 8 16
6
18 18 18
1
100 100 100
7
1 22 22
2
1 19 38
8
6 24 48
思路：因为ABC都是10000以内的数字。按照题意操作之后会有b=k1* a,c=k2 * b=k1 * k2* a。b和c都不会太大，2e4内绝对是没问题的，这样我们就枚举a和k1,k2，这样就大大的缩短了时间。不会有100001000010000这样的时间复杂度。
代码如下：

#include<bits/stdc++.h>
#define ll long long
using namespace std;

int a,b,c;

int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int x,y,z;
		scanf("%d%d%d",&a,&b,&c);
		int ans=1e9;
		for(int i=1;i<=10000;i++)
		{
			for(int j=1;j*i<=20000;j++)
			{
				for(int k=1;i*j*k<=20000;k++)
				{
					int zz=abs(a-i)+abs(j*i-b)+abs(k*i*j-c);
					if(ans>zz) ans=zz,x=i,y=i*j,z=i*j*k;
				}
			}
		}
		cout<<ans<<endl;
		cout<<x<<" "<<y<<" "<<z<<endl;
	}
	return 0;
}

努力加油a啊，(^o)/~