Submission #1949074

---

Source Code Expand

#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#define pb push_back
#define ll long long
#define PI 3.14159265
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1
#define eps 1e-7
const int mod=1e9+7;
const int maxn=1e5+5;
using namespace std;
int a[1000];
ll n,y;
void slove()
{
    for(int i=0;i<=n;i++)
    for(int j=0;j<=n-i;j++)
    for(int k=0;k<=n-i-j;k++)
    {
        if(i*10000+j*5000+k*1000==y)
        {
            cout<<i<<' '<<j<<' '<<k<<endl;
            return ;
        }
    }
    cout<<"-1 -1 -1"<<endl;
}
int main()
{
     std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>y;
    slove();
    return 0;
}

Submission Info

Judge Result