Submission #49348876

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
typedef vector<vector<ll>> Mat;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() { printf("yes\n"); }
void no() { printf("no\n"); }
void Yes() { printf("Yes\n"); }
void No() { printf("No\n"); }
void YES() { printf("YES\n"); }
void NO() { printf("NO\n"); }

int n, a[3];

void solve(int turn, int rest) {
  if (turn == 3) {
    cout << a[0] << " " << a[1] << " " << a[2] << endl;
    return;
  }

  for (int i = 0; i <= rest; i++) {
    a[turn] = i;
    solve(turn + 1, rest - i);
  }
  return;
}

int main() {
  cin >> n;
  solve(0, n);

  return 0;
}

Submission Info

Judge Result