Submission #4069192

---

Source Code Expand

#include "bits/stdc++.h"
#define int long long
#define mii map<int,int>
#define low lower_bound
#define upp upper_bound
#define inf 1000000007 //10^9+7
#define rep(i,n) for(int i=0;i<n;i++)
#define all(vec) vec.begin(),vec.end()
#define sort(vec) sort(all(vec));
#define rever(vec) reverse(all(vec));
#define bisea binary_search
#define unsort(vec) sort(vec); rever(vec);
#define cend cout<<endl;
#define gcd __gcd
using namespace std;
signed main() {
  int n,y;
  cin>>n>>y;
  for(int i=0;i<=n;i++) {
    for(int j=0;j<=n;j++) {
      int k=n-(i+j);
      if(i+j+k<=n) {
        if(0<=k) {
          if(1000*i+5000*j+10000*k==y) {
            cout<<i<<" "<<j<<" "<<k<<endl;
            return 0;
          }
        }
      }
    }
  }
  cout<<-1<<" "<<-1<<" "<<-1<<endl;
}

Submission Info

Judge Result