题目
题目链接:https://codeforces.com/contest/1311/problem/D
思路
现在t之前跑出来有多少对数组满足情况 把他们存起来,后面暴力对比即可
易错点是 之前报的时候不能只到100000!要多跑点!11000能过
代码
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
struct sut{
int a,b,c;
}sum[700000];
vector<int> v[11000];
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int cnt=0;
for(int i=1;i<=11000;i++){
for(int j=1;j<=sqrt(i);j++){
if(i%j==0){
v[i].push_back(j);
if(i/j!=j) v[i].push_back(i/j);
}
}
for(int j=0;j<v[i].size();j++){
for(int k=0;k<v[v[i][j]].size();k++){
cnt++;
sum[cnt].a=v[v[i][j]][k];
sum[cnt].b=v[i][j];
sum[cnt].c=i;
}
}
}
// cout<<cnt<<endl;
int t;
cin>>t;
while(t--){
int x,y,z,x1,y1,z1;
cin>>x>>y>>z;
int mmin=INF;
for(int i=1;i<=cnt;i++){
int ans=abs(sum[i].a-x)+abs(sum[i].b-y)+abs(sum[i].c-z);
if(ans<mmin) mmin=ans,x1=sum[i].a,y1=sum[i].b,z1=sum[i].c;
}
cout<<mmin<<endl;
cout<<x1<<" "<<y1<<" "<<z1<<endl;
}
return 0;
}