UVa 12108 特别困的学生

https://vjudge.net/problem/UVA-12108

题意：给出n个学生的“清醒—睡眠”周期和初始时间点，每个学生在睡眠时需要判断全班睡觉人数是否严格大于清醒人数，否则在坚持一个清醒周期后再次判断。求出多长时间时全班都是清醒状态。

思路：水题吧。一次次的枚举下去，循环终止的条件就是和初始状态相同。

#include<iostream>
using namespace std;

struct Node
{
    int A;
    int B;
    int C;
}stu[12];
int ans[12];

int main()
{
    //freopen("D:\txt.txt", "r", stdin);
    int n,sleep,kase=0;
    while (cin >> n && n)
    {
        sleep = 0;
        for (int i = 0; i < n; i++)
        {
            cin >> stu[i].A >> stu[i].B >> stu[i].C;
            ans[i] = stu[i].C;
            if (stu[i].C>stu[i].A) sleep++;    //统计初始睡着人数
        }
        int count = 0;
        for (int k=1;;k++)
        {

            if (sleep == 0)
            {
                cout << "Case " << ++kase << ": " << k << endl;
                break;
            }

            if (count == n)
            {
                cout << "Case " << ++kase << ": -1" << endl;
                break;
            }

            count = 0;
            int flag = 0;

            for (int i = 0; i < n; i++)
            {
                ans[i] = ans[i] % (stu[i].A + stu[i].B)+1;
                if (ans[i] == 1)   flag--;
                if (ans[i] == stu[i].A + 1)
                {
                    if (sleep <= n - sleep)
                        ans[i] = 1;
                    else flag++;
                }
                if (ans[i] == stu[i].C)  count++;
            }
            sleep += flag;
        }
    }
    return 0;
}