佬们救救孩子，想法是先定义一个是数组，初始化为0，要消去的数变为1，最后判断数组内有几个0

int main()
{
	int a = 0, b = 0, c = 0, x0 = 0, y0 = 0, z0 = 0, n = 0, x1 = 0, y1 = 0, z1 = 0, count = 0;
	int arr[22][22][22]{};
	cin >> a >> b >> c;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> x0 >> y0 >> z0 >> x1 >> y1 >> z1;   //输入
		for (int q = x0; q <= x1; q++)
		{
			for (int w = y0; w <= y1; w++)
			{
				for (int e = z0; e <= z1; e++)
				{
					arr[q][w][e] = 1;             //把区域内要消去的数定为1
				}
			}
		}
	}
	for (int i = 0; i < a; i++)
	{
		for (int j = 0; j < b; j++)
		{
			for (int k = 0; k < c; k++)
			{
				if (arr[i][j][k] == 0)            //判断，数组内为0的是未被消去的
				{
					count++;
				}
			}
		}
	}
	cout << count;
	return 0;
}