codeforces 1311D(暴力)

2020-10-23 15:23:21 浏览数 (1)

AC代码

代码语言:javascript复制
#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;
}

0 人点赞