1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include <bits/stdc++.h>
using namespace std;

int a,b,c,A,B,C,it;
int ile[100005];
map<pair<int,int>,bool>m;
map<pair<int,int>,bool>ma;
queue<pair<pair<int,int>,pair<int,int> > > q;

void f(int x,int y,int z,int dl)
{
	if(!m[{x,y}])
	{
		q.push({{x,y},{z,dl}});
		m[{x,y}] = true;
	}
}

void fod(pair<pair<int,int>,pair<int,int> > pa)
{
int x = pa.first.first;
int y = pa.first.second;
int z = pa.second.first;
int dl = pa.second.second;


if(ile[x] == -1)
	ile[x] = dl;

if(ile[y] == -1)
	ile[y] = dl;
	
if(ile[z] == -1)
	ile[z] = dl;

if(ma[{x,y}])
	return;

ma[{x,y}] = true;
	
dl++;

f(max(0,x + y - B),min(x + y,B),z,dl);
	
f(max(0,z + x - C),y,min(C,z + x),dl);	

f(x,max(0,y + z - C),min(C,y + z),dl);

f(min(x + y,A),max(0,x + y - A),z,dl);

f(min(A,x + z),y,max(0,x + z - A),dl);

f(x,min(B,y + z),max(0,z + y - B),dl);

}


int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>A>>B>>C;
cin>>a>>b>>c;
for(int i=0;i<=C;i++)
	ile[i] = -1;
	
f(a,b,c,0);

while(it < 1000000 && !q.empty())
{
	it ++;
	fod(q.front());
	q.pop();
}
for(int i=0;i<=C;i++)
	cout<<ile[i]<<" ";

return 0;	
}