0分球掉（MLE）

#include<bits/stdc++.h>
#define int long long
using namespace std;
int A,B,C,b[10000];
int a[100][100][100];
int dfs(int x,int y,int z){
	if(x==0)b[z]=1;
	a[x][y][z]=1;
	if(x!=0){
		if(x+y<=B){
			if(a[0][x+y][z]==0)dfs(0,x+y,z);
		}
		else{
			if(a[x+y-B][B][z]==0)dfs(x+y-B,B,z);
		}
		if(x+z<=C){
				if(a[0][y][z+x]==0)dfs(0,y,z+x);
			
		}else{
				if(a[x+z-C][y][C]==0)dfs(x+z-C,y,C);
			}
	}
	if(y!=0){
		if(x+y<=A){
			if(a[x+y][0][z]==0)dfs(x+y,0,z);
		}
		else{
			if(a[A][x+y-A][z]==0)dfs(A,x+y-A,z);
		}
		if(y+z<=C){
			if(a[x][0][y+z]==0)dfs(x,0,y+z);
		}
		else{
			if(a[x][z+y-C][C]==0)dfs(x,z+y-C,C);
		}
	}
	if(z!=0){
		if(x+z<=A){
			if(a[x+z][0][y]==0)dfs(x+z,0,y);
		}
		else{
			if(a[A][y][x+z-A]==0)dfs(A,y,x+z-A);
		}
		if(y+z<=B){
			if(a[x][y+z][0]==0)dfs(x,y+z,0);
		}
		else{
			if(a[x][B][y+z-B]==0)dfs(x,B,y+z-B);
		}
	}
}
signed main()
{
	cin>>A>>B>>C;
	dfs(0,0,C);
	for(int i=0;i<=C+A+B;i++){
		if(b[i]==1)cout<<i<<' ';
	} 
	return 0;
}