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.

可以进行加一和减一的操作，求能够使用的最小操作次数，使得
$B$ mod $A$并且$C$ mod $B$。

思路

显然A的范围在$[1,10000]$之间，要想满足题目给定的条件，我们可以设$B=k1\ast a,C=k1\ast k2\ast a$，暴力枚举所有区间肯定会超时，所以我们可以做个优化，枚举A的范围$[1,10000]$，接着再枚举$k1$和$k2$即可

AC代码

#include<bits/stdc++.h>
#define x first
#define y second
#define PB push_back
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define rep(x,l,u) for(ll x=l;x<u;x++)
#define rrep(x,l,u) for(ll x=l;x>=u;x--)
#define sz(x) x.size()
#define ins(x) inserter(x,x.begin())
#define IOS ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<long,long> PLL;
typedef pair<char,char> PCC;
typedef long long ll;
const int N=4*1e5+10;
const int M=1e6+10;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
void solve(){
    int a,b,c;cin>>a>>b>>c;
    int x,y,z;
    int ans=INF;
    rep(i,1,10001){
        for(int j=1;i*j<=20000;j++){
            for(int k=1;i*j*k<=20000;k++){
                int f=abs(a-i)+abs(b-i*j)+abs(c-i*j*k);
                if(ans>f){
                    ans=f;
                    x=i;
                    y=i*j;
                    z=i*j*k;
                }
            }
        }
    }
    cout<<ans<<endl;
    cout<<x<<' '<<y<<' '<<z<<endl;
}
int main(){
    IOS;
    int t;cin>>t;
    while(t--){
        solve();
    }
    return 0;
}