POJ 1017 解题报告

/*
ID: thestor1
LANG: C++
TASK: poj1017
*/
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <limits>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <cassert>

using namespace std;

int main()
{
std::vector<int> cnt(6, 0);
while (true)
{
bool allzero = true;
for (int i = 0; i < 6; ++i)
{
cin >> cnt[i];
if (cnt[i])
{
allzero = false;
}
}

if (allzero)
{
break;
}

// 6
int total = cnt[5];

// 5
total += cnt[4];
cnt[0] = max(0, cnt[0] - 11 * cnt[4]);

// 4
total += cnt[3];
cnt[0] = max(0, cnt[0] - max(0, ((5 * cnt[3] - cnt[1]) * 4)));
cnt[1] = max(0, cnt[1] - 5 * cnt[3]);

// 3
total += cnt[2] / 4;
if (cnt[2] % 4 != 0)
{
total++;
if (cnt[2] % 4 == 3)
{
if (cnt[1])
{
cnt[1]--;
cnt[0] = max(0, cnt[0] - 5);
}
else
{
cnt[0] = max(0, cnt[0] - 9);
}
}
else if (cnt[2] % 4 == 2)
{
cnt[0] = max(0, cnt[0] - (18 - 4 * min(cnt[1], 3)));
cnt[1] = max(0, cnt[1] - 3);
}
else
{
assert (cnt[2] % 4 == 1);
cnt[0] = max(0, cnt[0] - (27 - 4 * min(cnt[1], 5)));
cnt[1] = max(0, cnt[1] - 5);
}
}

// 2
total += cnt[1] / 9;
if (cnt[1] % 9 != 0)
{
total++;
cnt[0] = max(0, cnt[0] - (36 - 4 * (cnt[1] % 9)));
}

// 1
total += cnt[0] / 36;
total += (cnt[0] % 36 != 0);

cout << total << endl;
}
return 0;
}