poj1017 水

#include<iostream>  
#include<map>
#include<string>   
#include<algorithm>  
#include<fstream>
#include<cmath>  
#include<vector>
#include<queue>
#include<map>
#include<math.h>
using namespace std;  
#define lch(i) ((i)<<1)  
#define rch(i) ((i)<<1|1)  
#define sqr(i) ((i)*(i))  
#define pii pair<int,int>  
#define mp make_pair  
#define FOR(i,b,e) for(int i=b;i<=e;i++)  
#define FORE(i,b,e) for(int i=b;i>=e;i--)  
#define ms(a)   memset(a,0,sizeof(a))  
const int maxnum =21252;
const  int  mod = 10007;
int n,m;


int pack[7];


int main()    
{  
#ifdef _DEBUG_
	fstream fin("G:/1.txt");
#else
#define fin cin
#endif
	for(;;){
		int sum=0;
		FOR(i,1,6){
			fin>>pack[i];
			sum+=pack[i];
		}
		if(sum==0)
			break;
		sum=0;
		sum+=pack[6]+pack[5]+pack[4];
		pack[1]-=pack[5]*11;

		pack[2]-=pack[4]*5;
		if(pack[2]<0)
			pack[1]+=pack[2]*4;

		sum+=pack[3]/4;
		pack[3]%=4;
		pack[2]=pack[2]>=0?pack[2]:0;
		if(pack[3]){
			sum++;
			if(pack[3]==1){
				pack[2]-=5;
				pack[1]-=7;
			}else if(pack[3]==2){
				pack[2]-=3;
				pack[1]-=6;
			}
			else{
				pack[2]-=1;
				pack[1]-=5;
			}
			if(pack[2]<0)
				pack[1]+=4*pack[2];
		}

		pack[2]=pack[2]>=0?pack[2]:0;
		sum+=pack[2]/9;
		pack[2]%=9;
		if(pack[2]){
			sum++;
			pack[1]-=36-4*pack[2];
		}

		pack[1]=pack[1]>=0?pack[1]:0;
		sum+=pack[1]/36;
		pack[1]%=36;
		if(pack[1]){
			sum++;
		}
		cout<<sum<<endl;
	}
    return 0;  
}