题解 | Old Bill
Old Bill
https://www.nowcoder.com/practice/17a30153e092493e8b4d13f321343927
#include <stdio.h>
#include <vector>
using namespace std;
struct Chi{
int price;
int high;
int low;
Chi(int _price,int _high,int _low){
price=_price;high=_high;low=_low;
}
};
int main(){
int n,x,y,z;
while(scanf("%d%d%d%d",&n,&x,&y,&z)!=EOF){
int max=0;
vector<Chi> p;
for(int i=1;i<=9;++i){
for(int j=0;j<=9;++j){
for(int price=1;price<=100000/n;++price){
if(price*n==i*10000+x*1000+y*100+z*10+j&&price*n>max){
max=price*n;
Chi e(price,i,j);
p.push_back(e);
}
}
}
}
int size=p.size()-1;
if(p.size()==0){printf("0\n");}
else{
printf("%d %d %d\n",p[size].high,p[size].low,p[size].price);}
}
return 0;
}
#pieceofshit#