Greedy Gift Givers
来源:互联网 发布:dx12优化补丁 编辑:程序博客网 时间:2024/04/28 09:59
原题地址
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
/*ID: liuming9LANG: C++TASK: gift1*/#include <cstdio>#include <cstring>int n, t, a, b;char tmp[15], f[15];struct E{char name[15];int money;}buf[11];//查找姓名所在的位置int find(char *p){for(int i = 1; i <= n; i++)if(!strcmp(p, buf[i].name))return i;}int main(){freopen("gift1.in","r", stdin);freopen("gift1.out", "w", stdout);//读入人数scanf("%d", &n);//读入所有人的名字for(int i = 1; i <= n; i++){buf[i].money = 0;scanf("%s",buf[i].name);}while(~scanf("%s", tmp)){scanf("%d%d", &a, &b);if(!b)continue;int av = a / b;buf[find(tmp)].money -= av * b;//分发gift的money - av * b;//被分发gift分到a / b数目的moneywhile(b--){scanf("%s", f);buf[find(f)].money += av;}}for(int i = 1; i <= n; i++)printf("%s %d\n", buf[i].name, buf[i].money);return 0;}
- Greedy Gift Givers
- Analysis:Greedy Gift Givers
- Greedy Gift Givers
- Greedy Gift Givers(USACO)
- usaco--Greedy Gift Givers
- Greedy Gift Givers
- [USACO] Greedy Gift Givers
- Greedy Gift Givers
- Greedy Gift Givers
- 1.1 Greedy Gift Givers
- USASO Greedy Gift Givers
- Greedy Gift Givers
- Greedy Gift Givers
- Greedy Gift Givers
- Greedy Gift Givers
- UVA Greedy Gift Givers
- USACO-----Greedy Gift Givers
- Greedy Gift Givers
- MyEclipse8.5注册码到2015年及office2010密钥
- python类型转换、数值操作
- 手动删除数据库
- 【10】Find nth to last element of a singly linked list
- 用字典树进行有字典中文分词 频率统计
- Greedy Gift Givers
- dedecms安装完后进入管理页面空白
- Linux内核同步介绍和方法
- Hoj 1402 整数划分问题
- sphinx建立索引
- cocos2d-x 学习点滴(1) 初识cocos2d-x
- HDU2612(Find a way)搜索-两次BFS
- 项目2
- 黑马程序员_面向对象