1249 - Chocolate Thief

#include<bits/stdc++.h>
using namespace std;
 
int main()
{
    long long T,n,C=1,i,a,b,c,temp[110];
    char str[110][50];
//    freopen("check.txt","r",stdin);
    scanf("%lld",&T);
    while(T--)
    {
        scanf("%lld",&n);
        for(i=0; i<n; i++)
        {
            cin >> str[i] >> a >> b >> c;
            temp[i]=a*b*c;
        }
 
        long long maxim = temp[0], minim = temp[0];
        a = 0;
        b = 0;
 
        for(i=1; i<n; i++)
            if(maxim < temp[i])
            {
                maxim = temp[i];
                a = i;
            }
            else if(minim > temp[i])
            {
                minim = temp[i];
                b = i;
            }
        if(maxim == minim)
            printf("Case %lld: no thief\n",C++);
        else
            printf("Case %lld: %s took chocolate from %s\n",C++,str[a],str[b]);
    }
    return 0;
}