Greedy Gift Givers

最新推荐文章于 2020-03-14 17:01:23 发布

fjiajun

最新推荐文章于 2020-03-14 17:01:23 发布

阅读量352

点赞数

分类专栏： USACO 文章标签： usaco c

本文链接：https://blog.csdn.net/fengjiajun169/article/details/28633063

版权

USACO 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

/*
ID: mrster.1
LANG: C
TASK: gift1
*/

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int main()
{
    FILE *fin = fopen("gift1.in","r");
    FILE *fout = fopen("gift1.out","w");
    int counts = 0;
    int i = 0,j = 0,k = 0;
    char tem[25];
    int moneyPer = 0;
    fscanf(fin,"%d\n",&counts);
    char giver[counts][15];
    char people[counts][15];
    int money[counts][2];
    int value1,value2;

    for(i = 0;i<counts;i++)
    {
        for(j = 0;j<2;j++)
        {
            money[i][j] = 0;
        }
    }
    for(i = 0;i<counts;i++)
    {
        fgets(people[i],15,fin);
    }
    for(i = 0;i<counts;i++)
    {
        fgets(giver[i],15,fin);
        fscanf(fin,"%d %d",&value1,&value2);
        for(j = 0;j<counts;j++)
        {
            if(strcmp(giver[i],people[j])==0)
                {
                    if(value2!=0)moneyPer = value1/value2;
                    else moneyPer = 0;
                    money[j][0] = money[j][0] - moneyPer*value2;
                }
        }
        fgets(tem,15,fin);
        for(j = 0;j<value2;j++)
        {
            fgets(tem,15,fin);

            for(k = 0;k<counts;k++)
            {
                if(strcmp(tem,people[k])==0)
                {
                    money[k][0] = money[k][0]+moneyPer;
                }
            }
        }
    }
    for(i = 0;i<counts;i++)
    {
        for(j = 0;people[i][j]!='\n';j++)
        {
            fprintf(fout,"%c",people[i][j]);
        }
        fprintf(fout," %d\n",money[i][0]);
    }
    exit(0);
}