Submission #156879

---

Source Code Expand

#include <iostream>
#include <cstring>
using namespace std;

int n, m;
int c, y, o;

int capable[101][101][101];

bool dfs( int i, int j, int k ){
	if( capable[i][j][k] != -1 ) return (capable[i][j][k] == 1) ? true : false;
	int legs = i*2 + j*3 + k*4;
	if( legs > m || i+j+k > n ) return false;
	if( i+j+k == n && legs == m ){
		c = i;
		y = j;
		o = k;
		return true;
	}
	if( i+j+k < n && (dfs(i+1,j,k) || dfs(i,j+1,k) || dfs(i,j,k+1)) ){
		capable[i][j][k] = 1;
		return true;
	}else{
		capable[i][j][k] = 0;
		return false;
	}
}

int main(){
	cin >> n >> m;
	memset(capable, -1, sizeof(capable) );
	if( dfs(0,0,0) ) cout << c << " " << y << " " << o << endl;
	else cout << "-1 -1 -1" << endl;
}

Submission Info

Judge Result