uva 617

30-60全部模擬一次=AC

//====================================================================||
//                                                                    ||
//                                                                    ||
//                         Author : GCA                               ||
//                  6AE7EE02212D47DAD26C32C0FE829006                  ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 55
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
struct tool{
    double dist;
    int g,y,r;
    int alltime;
}tools[10];
int n;
bool canuse[100];
int main() {
    ios_base::sync_with_stdio(0);
    int ff=0;
    while(~scanf("%d",&n)&&n!=-1){
        Set(canuse,0);
        for(int i=0;i<n;i++){
            scanf("%lf%d%d%d",&tools[i].dist,&tools[i].g,&tools[i].y,&tools[i].r);
            tools[i].alltime=tools[i].g+tools[i].y+tools[i].r;
        }
        for(int i=30;i<=60;i++){
            bool fg=1;
            for(int j=0;j<n;j++){
                double as=tools[j].dist*3600/i;
                //int tmp=(int)ceil(as)%tools[j].alltime;
                double tmp=as-(int)(as/tools[j].alltime)*tools[j].alltime;
                //debug("> %d %lf %lf\n",i,tmp,as);
                if(tmp>tools[j].g+tools[j].y){
                    fg=0;
                    break;
                }
            }
            if(fg){
                canuse[i]=1;
//                debug("%d\n",i);
            }
        }
        int l,r,j;
        bool first=true;
        printf("Case %d:",++ff);
        for(int i=30;i<=60;i=j){
            while(!canuse[i])i++;
            if(i>60)break;
            l=i,r=i,j=i;
            for(j=i+1;j<=60;j++){
                if(!canuse[j])break;
            }
            r=j-1;
            if(first){
                if(l!=r)printf(" %d-%d",l,r);
                else printf(" %d",l);
                first=false;
            }else{
                if(l!=r)printf(", %d-%d",l,r);
                else printf(", %d",l);
            }
        }
        if(first){
            printf(" No acceptable speeds.");
        }Pln();


    }
















}