POJ 1547 Clay Bully

    水题。

#include <stdio.h>#include <string.h>#include <math.h>#include <iostream>#include <algorithm>#define mem(a) memset(a, 0, sizeof(a))#define inf 100000005using namespace std;int clay[10][3];char ch1[10][10];int main(){    int n, i, mins, maxs, mul, imi, ima;    for(;;)    {    mem(clay);    mem(ch1);    mins = inf;    maxs = 0;    scanf("%d",&n);    if(n == -1)    break;    for(i = 0;i < n;i++)    {    scanf("%d%d%d%s", &clay[i][0], &clay[i][1], &clay[i][2], ch1[i]);    mul = clay[i][0] * clay[i][1] * clay[i][2];    if(mins > mul)    mins = mul, imi = i;    if(maxs < mul)    maxs = mul, ima = i;    }    printf("%s took clay from %s.\n", ch1[ima], ch1[imi]);    }    return 0;}