UVa12108

最新推荐文章于 2019-11-01 15:44:43 发布

zytjyh

最新推荐文章于 2019-11-01 15:44:43 发布

阅读量400

点赞数

分类专栏： UVA 文章标签： uva

本文链接：https://blog.csdn.net/JACK_JYH/article/details/52974711

版权

UVA 专栏收录该内容

52 篇文章 0 订阅

订阅专栏

#pragma warning(disable:4996)
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<algorithm>
#include<iostream>
#include<time.h>
#include<map> 
#include<set>
#include<sstream>
#include<cassert>
#include<string.h>

using namespace std;
const int INF = 0x3f3f3f3f;



#define N 1000000
int n;
int a[15], b[15], c[15];

int main()
{
    int cas = 1;
    while (cin >> n,n)
    {
        for (int i = 0;i < n;i++)
        {
            cin >> a[i] >> b[i] >> c[i];
        }
        for (int i = 1;i <= 100000;i++)
        {
            int count = 0;
            for (int j = 0;j < n;j++)
            {
                if (c[j]<= a[j])
                    count++;
            }
            for (int j = 0;j < n;j++)
            {
                if (c[j] == a[j] + b[j])
                    c[j] = 1;
                else if (c[j] == a[j] && count >=n - count)
                    c[j] = 1;
                else
                    c[j]++;
            }
            if (count == n)
            {
                cout << "Case " << cas++ << ": " << i << endl;
                break;
            }
            if (i == 100000)
                cout << "Case " << cas++ <<": "<< -1 << endl;
        }
    }
    return 0;
}