CodeForces 628A Tennis Tournament
来源:互联网 发布:windows hadoop安装包 编辑:程序博客网 时间:2024/05/29 13:10
A tennis tournament with n participants is running. The participants are playing by an olympic system, so the winners move on and the losers drop out.
The tournament takes place in the following way (below, m is the number of the participants of the current round):
- let k be the maximal power of the number2 such that k ≤ m,
- k participants compete in the current round and a half of them passes to the next round, the otherm - k participants pass to the next round directly,
- when only one participant remains, the tournament finishes.
Each match requires b bottles of water for each participant and one bottle for the judge. Besidesp towels are given to each participant for the whole tournament.
Find the number of bottles and towels needed for the tournament.
Note that it's a tennis tournament so in each match two participants compete (one of them will win and the other will lose).
The only line contains three integers n, b, p (1 ≤ n, b, p ≤ 500) — the number of participants and the parameters described in the problem statement.
Print two integers x and y — the number of bottles and towels need for the tournament.
5 2 3
20 15
8 2 4
35 32
In the first example will be three rounds:
- in the first round will be two matches and for each match 5 bottles of water are needed (two for each of the participants and one for the judge),
- in the second round will be only one match, so we need another 5 bottles of water,
- in the third round will also be only one match, so we need another 5 bottles of water.
So in total we need 20 bottles of water.
In the second example no participant will move on to some round directly.
#include<iostream>using namespace std;int main(){ int n,b,p; while(cin>>n>>b>>p){ cout<<(b*2+1)*(n-1)<<" "<<p*n<<endl; } return 0;}
- Codeforces 628A Tennis Tournament
- CodeForces 628A Tennis Tournament
- CodeForces 628A Tennis Tournament
- CodeForces 628A Tennis Tournament
- CodeForces 628A Tennis Tournament
- Codeforces 628A Tennis Tournament 【水题】
- CodeForces 628 A. Tennis Tournament(水~)
- 【CodeForces 628A】Tennis Tournament(水题)
- 628A. Tennis Tournament
- CodeForces 628A Tennis Tournament(比赛送水递毛巾问题)
- A. Tennis Tournament
- Codeforces Educational Codeforces Round 8 A. Tennis Tournament
- Codeforces 283E Cow Tennis Tournament (扫描线+计数)
- CF283E Cow Tennis Tournament
- CodeForces 356A Knight Tournament 【线段树】
- CSA Round #41 Tennis Tournament
- CodeForces 356A - Knight Tournament set or 线段树
- Codeforces 356A Knight Tournament线段树区间覆盖
- 二层攻击之:mac层攻击
- Android通过JNI操作串口
- protoc-gen-lua message之间相互引用问题 导致 upvalue 'message_type' (a nil value)
- MySQL server has gone away
- validation插件
- CodeForces 628A Tennis Tournament
- OpenWrt路由器WIFI开启13信道
- iOS socket
- 如何增量导入MYSQL数据库中的数据
- Swift - whose view is not in the window hierarchy 问题解决方法
- 个性化编译openwrt(编译前更改lan.ipaddr,ssid,timezone,root密码 增加13信道)
- toad
- 详细探究Spark的shuffle实现
- Xcode7及swift2.0更新后toInt()无法使用解决办法