华为OD 分月饼C++

原创

已于 2024-08-27 17:06:33 修改 · 286 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #算法 #开发语言

于 2024-08-21 21:32:56 首次发布

题目描述
中秋节，公司分月饼，m个员工，买了n个月饼，m<=n，每个员工至少分1个月饼，但可以分多个，单人份到最多月饼的个数为Max1，单人分到第二多月饼的个数是Max2，Max1-Max2<=3,。同理，单人分到第n-1多月饼的个数是Max(n-1)，单人分到第n多月饼的个数是Max(n)，Max(n-1)-Max(n)<=3。请问有多少种分月饼的方法？

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

class CDivideCake
{
public:
	CDivideCake(unsigned int uiMember,unsigned int uiCakeCount,unsigned int uiCakeDiffMax = 3)
		:m_uiMemberNum(uiMember),m_uiCakeCount(uiCakeCount),m_uiCakeDiffMax(uiCakeDiffMax)
	{
		m_uiResCount = 0;
		m_pMemberCakeDetail = new unsigned int[uiMember];
		if (m_pMemberCakeDetail != NULL)
		{
			memset(m_pMemberCakeDetail,0x00,uiMember*sizeof(unsigned int));
			if (uiCakeCount >= uiMember)
			{
				unsigned int uiCakeCountNext = uiCakeCount;
				unsigned int uiMemberNext = 0;
				unsigned int uiCakeMinNext = 1;
				unsigned int uiCakeMaxNext = uiCakeCountNext;
				DivideCakeForNe