UVA - 12108——Extraordinarily Tired Students

题目虫洞：Extraordinarily Tired Students

黑洞内窥：

发现了比较清奇的暴力，，，，So。。。。

代码：

//#include<bits/stdc++.h>
#include  <stdio.h>
#include <iostream>
#include<algorithm>
//#include      <map>
//#include      <set>
//#include   <vector>
//#include    <queue>
//#include    <stack>
#include <stdlib.h>
#include  <cstring>
#include <string.h>
#include   <string>
#include   <math.h>
using namespace std;
typedef long long ll;
#define MAXN 10005
#define INF 0x3f3f3f3f//将近ll类型最大数的一半，而且乘2不会爆ll
const int mod = 1000000007;

int a[15], b[15], c[15];
int main()
{
   int n, k, ccc=1;
   while(cin >> n && n){
    for(int i=0; i<n; ++i)
        scanf("%d %d %d", &a[i], &b[i], &c[i]);
    for(k=1; k<MAXN; ++k){
        int ans=0;
        for(int i=0; i<n; ++i)
            if(c[i] <= a[i])
            ans++;
        if(ans == n) break;
        for(int i=0; i<n; ++i){
            if(c[i] == a[i]+b[i] || (c[i] == a[i] && ans >= n-ans))
                c[i] = 0;
            c[i]++;
        }
    }
    cout << "Case " << ccc++ << ": ";
    if(k == MAXN) puts("-1");
    else cout << k << '\n';
   }
	return 0;
}