C++经典编程题目（华为笔试题一）买钉子问题

两种钉子包装，一种一盒9个，一种一盒4个，现有n个钉子，最少买几盒？

#include <stdio.h>
#include <iostream>
using namespace std;

#define N1 4
#define N2 9

int main()
{
	int n;
	cin >> n;

	int max = n / N1 + 1;
	if (n % N1 == 0)
	{
		max = n / N1 ;
	}
	int min = n / N2 + 1;
	if (n % N2 == 0)
	{
		min = n / N2;
	}

	int numof4 = 0;
	int numof9 = min;

	int numofBox = numof9, temp = 0;

	for (size_t i = 0; i < max; i++, numof9--, numof4++)
	{
		temp = numof9 + numof4;
		if (((numof9 * 9 + numof4 * 4) == n) && (temp<numofBox))
		{
			numofBox = temp;
		}
	}

	cout << numofBox << endl;

	system("pause");

	return 0;
}