题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1679
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct Info
{
int first;
int last;
int average;
};
bool comp(const Info &a,const Info &b)
{
if(a.average!=b.average)
return a.average>b.average;
}
int main()
{
Info info;
vector<Info>v;
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int x,y,z;
cin>>x>>y>>z;
int m=x*1000+100*y+10*z;
//清除向量
v.clear();
for(int i=1;i<10;i++)
for(int j=0;j<10;j++)
if((i*10000+m+j)%n==0)
{
info.first=i;
info.last=j;
info.average=(i*10000+m+j)/n;
v.push_back(info);
}
sort(v.begin(),v.end(),comp);
if(v.size()==0)
cout<<"0"<<endl;
else
cout<<v[0].first<<" "<<v[0].last<<" "<<v[0].average<<endl;
}
return 0;
}