fork download
  1. #include <iostream>
  2. #include <vector>
  3. #include <cmath>
  4. #include <set>
  5.  
  6. using namespace std;
  7. long long s=0,n[3],v[3];
  8.  
  9. int mini(int u, int uu) {
  10. if (u<uu) return u;
  11. return uu;
  12. }
  13.  
  14. long long best(long long i1) {
  15. s-=i1*v[0];
  16. int ok=1000000000;
  17. for (int i2=0;i2<n[1] && i2*v[1]<=s;i2++) {
  18. int temp=(s-i2*v[1])/v[2];
  19. if (temp+1>v[2]) continue; else ok=mini(ok,s-i2*v[1]-temp*v[2]);
  20. }
  21. return ok;
  22. }
  23.  
  24. void f() {
  25. long long l=0,r=n[0];
  26. while (r>l+1) {
  27. long long m=(r+l)/2;
  28. // if ()
  29. }
  30. }
  31.  
  32. int main() {
  33. cin>>s>>v[0]>>n[0]>>v[1]>>n[1]>>v[2]>>n[2];
  34. for (long long i=0;i<=n[0] && i*v[0]<=s;i++) cout<<best(i)<<endl;
  35. // cout<<f();
  36. return 0;
  37. }
Success #stdin #stdout 0s 3460KB
stdin
100
26 10
10 100
7 100
stdout
0
0
1