http://codeforces.com/problemset/problem/628/A
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 number 2 such that k ≤ m,
- k participants compete in the current round and a half of them passes to the next round, the other m - 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. Besides p 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.
题意:
网球队中的 n 个队员比赛,规则如下(当前参赛的人数假定为 m ):1)k 的最大值为2,并且 k <= m;
2)k 个运动员中的一半可以打到下一场比赛,其他 m - k 个运动员直接参加下一轮比赛;
3)比赛场剩下一个运动员时结束比赛。
对于每一场比赛需要 b 瓶水给运动员,一瓶水给裁判,另外需要准备 p 条毛巾。
问最后需要多少水和毛巾。
思路:
写这个题解的目的就是告诉自己:你的英语还行!!!
参考Code:
#include<stdio.h>
#include<cstring>
#include<algorithm>
#define AC main()
using namespace std;
const int MYDD = 1103;
int AC {
int n, b, q;
scanf("%d %d %d", &n, &b, &q);
printf("%d %d\n", (n - 1) * (2*b + 1), n*q);
return 0;
}