历届试题 分糖果 模拟

           模拟游戏就行。

AC代码

#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <utility>
#include <string>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
#pragma comment(linker, "/STACK:1024000000,1024000000") 
#define eps 1e-10
#define inf 0x3f3f3f3f
#define PI pair<int, int> 
typedef long long LL;
const int maxn = 100 + 5;
int cnt[maxn], n, tmp[maxn];
bool is_same() {
	for(int i = 0; i < n-1; ++i) 
		if(cnt[i] != cnt[i+1]) return false;
	return true;
}
int main() {
	while(scanf("%d", &n) == 1) {
		for(int i = 0; i < n; ++i) scanf("%d", &cnt[i]);
		bool ok = false;
		int ans = 0;
		while(!ok) {
			for(int i = 0; i < n; ++i) {
				if(cnt[i] & 1) {
					ans++;
					cnt[i]++;
				}
			}
			memcpy(tmp, cnt, sizeof(cnt));
			for(int i = 0; i < n; ++i) {
				int left = (i+1) % n;
				cnt[left] += tmp[i] / 2;
				cnt[i] -= tmp[i] / 2;
			}
			ok = is_same();
		}
		printf("%d\n", ans);
	}
	return 0;
}

如有不当之处欢迎指出！