POJ 1017 Packets

• Source Code

  #include<iostream>
  using namespace std;
  int main()
  {
  	int x1, x2, x3, x4, x5, x6;
  	while (cin >> x1 >> x2 >> x3 >> x4 >> x5 >> x6 && (x1 + x2 + x3 + x4 + x5 + x6))
  	{
  		long long sum = x6 + x5 + x4 + x3 / 4; x3 = x3 % 4;
  		x1 = x1 - x5 * 11;
  		x2 = x2 - x4 * 5;
  		if (x2 < 0) x1 = x1 + x2 * 4;
  		if (x1 < 0) x1 = 0;
  		if (x2 < 0) x2 = 0;
  		if (x3 == 1)
  		{
  			sum++; x2 = x2 -5;
  			x1 = x1 - 7;
  			if (x2 < 0) x1 = x1 + x2 * 4;
  			if (x1 < 0) x1 = 0;
  			if (x2 < 0) x2 = 0;
  			sum = sum + (4 * x2 + x1) / 36;
  			if ((4 * x2 + x1) % 36 > 0) sum++;
  		}
  		else if (x3 == 2)
  		{
  			sum++; x2 = x2 -3;
  			x1 = x1 -6;
  			if (x2 < 0) x1 = x1 + x2 * 4;
  			if (x1 < 0) x1 = 0;
  			if (x2 < 0) x2 = 0;
  			sum = sum + (4 * x2 + x1) / 36;
  			if ((4 * x2 + x1) % 36 > 0) sum++;
  		}
  		else if (x3 == 3)
  		{
  			sum++; x2 = x2 - 1;
  			x1 = x1 - 5;
  			if (x2 < 0) x1 = x1 + x2 * 4;
  			if (x1 < 0) x1 = 0;
  			if (x2 < 0) x2 = 0;
  			sum = sum + (4 * x2 + x1) / 36;
  			if ((4 * x2 + x1) % 36 > 0) sum++;
  		}
  		else
  		{
  			sum = sum + (4 * x2 + x1) / 36;
  			if ((4 * x2 + x1) % 36 > 0) sum++;
  		}
  		cout << sum << endl;
  	}
  	return 0;
  }