Problem p03471 (C++)

Buggy submission (status: Time Limit Exceeded):
/*
ID:wmj20041
TASK:
LANG:C++
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <cwchar>
#include <cwctype>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <math.h>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <streambuf>
#include <string.h>
#include <string>
#include <time.h>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#define ll long long
#define pb push_back
#define pob pop_back
#define mp make_pair
#define FILL(a, v) memset((void *)a, v, sizeof(a))
#define FILL0(a) FILL(a, 0)
#define FILL1(a) FILL(a, -1)
#define FILLBIG(a) FILL(a, 0x7f)
#define ALL(a) (a).begin(), (a).end()
#define Inf ((int)0x7f7f7f7f)
#define Mod 1000000007
#define foreach(it, x)                                                         \
  for (__typeof(x.begin()) it = x.begin(); it != x.end(); it++)
#define FOR(i, x) for (int i = 0; i < x; i++)
#define RFOR(i, x) for (int i = x - 1; i >= 0; i--)
#define FFOR(i, a, b) for (int i = a; i < b; i++)
#define FRFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define SZ(a) ((int)(a).size())
#define fi first
#define se second
#define OVER(a) return puts(a), 0
#define fastio ios::sync_with_stdio(0)
#define filei(f) freopen(f, "r", stdin)
#define fileo(f) freopen(f, "w", stdout)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define MASK(a) (1 << (a))
#define MASKX(x, a) ((x) << (a))
#define BIT(a, b) ((a >> b) & 1)
#define cddx(a) priority_queue<a>
#define cxdd(a) priority_queue<a, vector<a>, greater<a>>
#define deval(a)                                                               \
  { cerr << #a << " = " << a << endl; }
#define dearr(be, en)                                                          \
  {                                                                            \
    cerr << #be;                                                               \
    cerr << " = {";                                                            \
    for (auto i = be; i != en; i++)                                            \
      cerr << ' ' << *i;                                                       \
    cerr << " }\n";                                                            \
  }
#define reg register
using namespace std;
typedef pair<int, int> pii;
typedef unsigned long long UINT;
typedef unsigned int uint;
typedef long long INT;
typedef long double ldouble;
typedef pair<INT, INT> PII;
typedef stringstream sst;
typedef istringstream iss;
typedef vector<int> vint;
typedef vector<INT> VINT;
typedef vector<pii> vpii;
typedef vector<PII> VPII;
typedef priority_queue<int> pqi;
typedef priority_queue<INT> PQI;
typedef priority_queue<pii> pqp;
typedef priority_queue<PII> PQP;
typedef priority_queue<int, vint, greater<int>> xqi;
typedef priority_queue<INT, VINT, greater<INT>> XQI;
typedef priority_queue<pii, vpii, greater<pii>> xqp;
typedef priority_queue<PII, VPII, greater<PII>> XQP;
const int INF = 1e9 + 7;
using namespace std;
int n, m;
int prime(int x) {
  if (x == 1)
    return 0;
  for (int i = 2; i * i <= x; i++)
    if (x % i == 0)
      return 0;
  return 1;
}
int main() {
  // freopen("input.in","r",stdin);
  // freopen("output.out","w",stdout);
  cin >> n >> m;
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= n; j++)
      for (int k = 0; k <= n; k++)
        if (i * 10000 + j * 5000 + k * 1000 == m && i + j + k == n) {
          cout << i << " " << j << " " << k;
          return 0;
        }
  cout << -1 << " " << -1 << " " << -1;
  return 0;
}

Fixed submission:
/*
ID:wmj20041
TASK:
LANG:C++
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <cwchar>
#include <cwctype>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <math.h>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <streambuf>
#include <string.h>
#include <string>
#include <time.h>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#define ll long long
#define pb push_back
#define pob pop_back
#define mp make_pair
#define FILL(a, v) memset((void *)a, v, sizeof(a))
#define FILL0(a) FILL(a, 0)
#define FILL1(a) FILL(a, -1)
#define FILLBIG(a) FILL(a, 0x7f)
#define ALL(a) (a).begin(), (a).end()
#define Inf ((int)0x7f7f7f7f)
#define Mod 1000000007
#define foreach(it, x)                                                         \
  for (__typeof(x.begin()) it = x.begin(); it != x.end(); it++)
#define FOR(i, x) for (int i = 0; i < x; i++)
#define RFOR(i, x) for (int i = x - 1; i >= 0; i--)
#define FFOR(i, a, b) for (int i = a; i < b; i++)
#define FRFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define SZ(a) ((int)(a).size())
#define fi first
#define se second
#define OVER(a) return puts(a), 0
#define fastio ios::sync_with_stdio(0)
#define filei(f) freopen(f, "r", stdin)
#define fileo(f) freopen(f, "w", stdout)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define MASK(a) (1 << (a))
#define MASKX(x, a) ((x) << (a))
#define BIT(a, b) ((a >> b) & 1)
#define cddx(a) priority_queue<a>
#define cxdd(a) priority_queue<a, vector<a>, greater<a>>
#define deval(a)                                                               \
  { cerr << #a << " = " << a << endl; }
#define dearr(be, en)                                                          \
  {                                                                            \
    cerr << #be;                                                               \
    cerr << " = {";                                                            \
    for (auto i = be; i != en; i++)                                            \
      cerr << ' ' << *i;                                                       \
    cerr << " }\n";                                                            \
  }
#define reg register
using namespace std;
typedef pair<int, int> pii;
typedef unsigned long long UINT;
typedef unsigned int uint;
typedef long long INT;
typedef long double ldouble;
typedef pair<INT, INT> PII;
typedef stringstream sst;
typedef istringstream iss;
typedef vector<int> vint;
typedef vector<INT> VINT;
typedef vector<pii> vpii;
typedef vector<PII> VPII;
typedef priority_queue<int> pqi;
typedef priority_queue<INT> PQI;
typedef priority_queue<pii> pqp;
typedef priority_queue<PII> PQP;
typedef priority_queue<int, vint, greater<int>> xqi;
typedef priority_queue<INT, VINT, greater<INT>> XQI;
typedef priority_queue<pii, vpii, greater<pii>> xqp;
typedef priority_queue<PII, VPII, greater<PII>> XQP;
const int INF = 1e9 + 7;
using namespace std;
int n, m;
int prime(int x) {
  if (x == 1)
    return 0;
  for (int i = 2; i * i <= x; i++)
    if (x % i == 0)
      return 0;
  return 1;
}
int main() {
  // freopen("input.in","r",stdin);
  // freopen("output.out","w",stdout);
  cin >> n >> m;
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= n; j++) {
      int k = n - i - j;
      if (i * 10000 + j * 5000 + k * 1000 == m && i + j + k == n && k >= 0) {
        cout << i << " " << j << " " << k;
        return 0;
      }
    }
  cout << -1 << " " << -1 << " " << -1;
  return 0;
}