算法竞赛入门经典第四章习题4-8 Extraordinarily Tired Students UVA - 12108

#include<iostream>
#include<string>
#include<bitset>
#pragma warning(disable:4996)
using namespace std;
const int maxn = 100;
struct node {
int A, B, C;
};
node all[11];
int main() {
#ifdef _DEBUG
//freopen("in", "rb", stdin);
//freopen("out", "wb", stdout);
#endif // _DEBUG
int n, Sleep=0,cnt=0;
while (cin >> n && n) {
string s;
for (int i = 0; i < n; ++i) {
cin >> all[i].A >> all[i].B >> all[i].C;
s += all[i].C;
if (all[i].C > all[i].A) ++Sleep;
}
int _time=0;
bool _w = 2*Sleep>n,_cir;
while (1) {
_cir = true;
++_time;
if (!Sleep) {printf("Case %d: %d\n", ++cnt, _time); break;}
Sleep = 0;
for (int i = 0; i < n; ++i) {
if (_w) {
if ((all[i].C = all[i].C % (all[i].A + all[i].B) + 1) > all[i].A) ++Sleep;
}
else {
if (all[i].C < all[i].A+all[i].B && all[i].C>all[i].A) ++all[i].C,++Sleep;
}
if (all[i].C != s[i]) _cir = false;
}
_w = 2 * Sleep>n;
if(_cir) {printf("Case %d: -1\n", ++cnt); break;}
}
}
}