UVa 12108 特别困的学生

 1 #include<iostream>
 2 using namespace std;
 3 
 4 struct Node
 5 {
 6     int A;
 7     int B;
 8     int C;
 9 }stu[12];
10 int ans[12];
11 
12 int main()
13 {
14     //freopen("D:\\txt.txt", "r", stdin);
15     int n,sleep,kase=0;
16     while (cin >> n && n)
17     {
18         sleep = 0;
19         for (int i = 0; i < n; i++)
20         {
21             cin >> stu[i].A >> stu[i].B >> stu[i].C;
22             ans[i] = stu[i].C;
23             if (stu[i].C>stu[i].A) sleep++;    //统计初始睡着人数
24         }
25         int count = 0;
26         for (int k=1;;k++)
27         {
28 
29             if (sleep == 0)
30             {
31                 cout << "Case " << ++kase << ": " << k << endl;
32                 break;
33             }
34 
35             if (count == n)
36             {
37                 cout << "Case " << ++kase << ": -1" << endl;
38                 break;
39             }
40 
41             count = 0;
42             int flag = 0;
43 
44             for (int i = 0; i < n; i++)
45             {
46                 ans[i] = ans[i] % (stu[i].A + stu[i].B)+1;
47                 if (ans[i] == 1)   flag--;
48                 if (ans[i] == stu[i].A + 1)
49                 {
50                     if (sleep <= n - sleep)
51                         ans[i] = 1;
52                     else flag++;
53                 }
54                 if (ans[i] == stu[i].C)  count++;
55             }
56             sleep += flag;
57         }
58     }
59     return 0;
60 }