1166.cpp

来自「这是哈尔滨工业大学acmOJ的源代码」· C++ 代码 · 共 56 行

/*  This Code is Submitted by wywcgs for Problem 1166 on 2005-03-22 at 07:46:35 */ 
#include <stdio.h>
#include <string.h>

typedef struct{
    char name[13];
    int spend;
    int get;
}Person;    

int main()
{
    int peoNum, frdNum;
    Person person[10];
    char name[13];
    int i, j, k, l, c = 0;
    
    while(scanf("%d", &peoNum) == 1){   
        if(c != 0){
            printf("\n");
        }
        c++;
        for(i = 0; i < peoNum; i++){
            scanf("%s", person[i].name);
            person[i].get = 0;
        }
        for(i = 0; i < peoNum; i++){
            scanf("%s", name);
            for(j = 0; j < peoNum; j++){
                if(!strcmp(name, person[j].name)){
                    scanf("%d %d", &person[j].spend, &frdNum);
                    if(frdNum == 0){
                        person[j].spend = 0;
                    }else{    
                        person[j].spend -= person[j].spend % frdNum;
                    }    
                    for(k = 0; k < frdNum; k++){
                        scanf("%s", name);
                        for(l = 0; l < peoNum; l++){
                            if(!strcmp(name, person[l].name)){
                                person[l].get += person[j].spend / frdNum;
                                break;
                            }
                        }
                    }
                    break;
                }
            }
        }
        for(i = 0; i < peoNum; i++){
            printf("%s %d\n", person[i].name, (person[i].get-person[i].spend));
        }
    }

    return 0;
}