Section 1.1 Greedy Gift Givers
来源:互联网 发布:阿里妈妈淘宝客违规 编辑:程序博客网 时间:2024/04/29 21:54
Greedy Gift Givers
A group of NP (2 ≤ NP ≤ 10) uniquely named friends has decided to exchange gifts of money. Each of these friends might or might not give some money to any or all of the other friends. Likewise, each friend might or might not receive money from any or all of the other friends. Your goal in this problem is to deduce how much more money each person gives than they receive.
The rules for gift-giving are potentially different than you might expect. Each person sets aside a certain amount of money to give and divides this money evenly among all those to whom he or she is giving a gift. No fractional money is available, so dividing 3 among 2 friends would be 1 each for the friends with 1 left over -- that 1 left over stays in the giver's "account".
In any group of friends, some people are more giving than others (or at least may have more acquaintances) and some people have more money than others.
Given a group of friends, no one of whom has a name longer than 14 characters, the money each person in the group spends on gifts, and a (sub)list of friends to whom each person gives gifts, determine how much more (or less) each person in the group gives than they receive.
IMPORTANT NOTE
The grader machine is a Linux machine that uses standard Unix conventions: end of line is a single character often known as '\n'. This differs from Windows, which ends lines with two charcters, '\n' and '\r'. Do not let your program get trapped by this!
PROGRAM NAME: gift1
INPUT FORMAT
Line 1:The single integer, NPLines 2..NP+1:Each line contains the name of a group memberLines NP+2..end:NP groups of lines organized like this:The first line in the group tells the person's name who will be giving gifts.The second line in the group contains two numbers: The initial amount of money (in the range 0..2000) to be divided up into gifts by the giver and then the number of people to whom the giver will give gifts, NGi (0 ≤ NGi ≤ NP-1).If NGi is nonzero, each of the next NGi lines lists the the name of a recipient of a gift.SAMPLE INPUT (file gift1.in)
5davelauraowenvickamrdave200 3lauraowenvickowen500 1daveamr150 2vickowenlaura0 2amrvickvick0 0
OUTPUT FORMAT
The output is NP lines, each with the name of a person followed by a single blank followed by the net gain or loss (final_money_value - initial_money_value) for that person. The names should be printed in the same order they appear on line 2 of the input.
All gifts are integers. Each person gives the same integer amount of money to each friend to whom any money is given, and gives as much as possible that meets this constraint. Any money not given is kept by the giver.
SAMPLE OUTPUT (file gift1.out)
dave 302laura 66owen -359vick 141amr -150
这个题主要是要把人名进行匹配,匹配好了就直接模拟运算。
#include<stdio.h>#include<string.h>int main(){FILE*fin, *fout;fin = fopen("gift1.in", "r");fout = fopen("gift1.out", "w");char a[10][15] = { 0 }, b[15] = { 0 };int i, j, k;int n, q, p[2], s[10] = { 0 };fscanf(fin, "%d", &n);for (i = 0; i < n; i++)fscanf(fin, "%s", a[i]);for (i = 0; i < n; i++){j = 0;fscanf(fin, "%s", b);while (strcmp(a[j], b))j++;//人名匹配fscanf(fin, "%d %d", &p[0], &p[1]);if (p[1] == 0)q = 0;elseq = p[0] / p[1];s[j] -= q*p[1];for (k = 0; k < p[1]; k++){j = 0;fscanf(fin, "%s", b);while (strcmp(a[j], b))j++;s[j] += q;}}for (i = 0; i < n; i++)fprintf(fout, "%s %d\n", a[i], s[i]);fclose(fin);fclose(fout);exit(0);}
- Section 1.1 Greedy Gift Givers
- Section 1.1 Greedy Gift Givers
- [Section 1.1] Greedy Gift Givers
- Section 1.1 Greedy Gift Givers
- USACO:Section 1.1 Greedy Gift Givers
- uscao Section 1.1 Greedy Gift Givers
- USACO Section 1.1 Greedy Gift Givers
- USACO Section 1.1 Greedy Gift Givers
- USACO Section 1.1.2 Greedy Gift Givers
- USACO Section 1.1 Greedy Gift Givers
- Section 1.1 PROB Greedy Gift Givers
- USACO Section 1.1 Greedy Gift Givers
- 1.1 Greedy Gift Givers
- USACO之Section 1.1.2 PROB Greedy Gift Givers
- §1.1 Greedy Gift Givers
- USACO 1.1-Greedy gift givers
- usaco 1.1:Greedy Gift Givers
- USACO 1.1 Greedy Gift Givers
- 题目1126:打印极值点下标
- java 面向对象静态 继承
- 使用gSOAP开发实例(3) iconv解决中文乱码问题
- 开个博客的目的
- 使用gSOAP开发实例(4) iconv解决中文乱码问题(续)
- Section 1.1 Greedy Gift Givers
- 使用gSOAP开发实例(5) libxml2解析SOAP响应消息
- MPI二维笛卡尔坐标划分【1】
- 使用gSOAP开发实例(6) 在HP-UX下编译gSOAP-2.7.17
- sgu 177 Square 矩形切割
- 使用gSOAP开发实例(7) 基于HTTPS的基本认证(Basic Authentication)
- 黑马程序员-java-20—30岁计划
- 移动的小球
- 使用gSOAP开发实例(8) Phase 1 完结篇 自定义header实现用户名令牌认证(Usernametoken Authentication)