#include <stdio.h>#include <string.h>#include <algorithm>using namespace STD;intMain () {inta[Ten], ans, I; while(~scanf("%d", &a[1])) { for(i =2; I <=6; i++)scanf("%d", &a[i]); for(i =1; I <=6; i++)if(A[i]) Break;if(I >6) Break; Ans = a[6] + a[5] + a[4] + a[3] /4; a[3] = a[3] %4; a[1] = max (0, a[1] - One* a[5]);if(a[2] >= a[4] *5) a[2] = a[2]-a[4] *5;Else{a[1] = max (0, a[1] -4* (a[4] *5-a[2])); a[2] =0; }if(a[3] ==3) {ans++; a[1] = max (a[1] -5,0);if(a[2] >=1) a[2] -=1;Else{a[1] = max (a[1] -4,0); } }Else if(a[3] ==2) {ans++; a[1] = max (a[1] -6,0);if(a[2] >=3) a[2] -=3;Else{a[1] = max (a[1] - (3-a[2]) *4,0); a[2] =0; } }Else if(a[3] ==1) {ans++; a[1] = max (a[1] -7,0);if(a[2] >=5) a[2] = a[2] -5;Else{a[1] = max (0, a[1] -4* (5-a[2])); a[2] =0; }} ans + = (a[1] +4* a[2] + *) / $;printf("%d\n", ans); }return 0;}
Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.
POJ 1017 Packets