A. Tennis Tournament

最新推荐文章于 2018-11-26 10:25:27 发布

原创最新推荐文章于 2018-11-26 10:25:27 发布 · 717 阅读

0 ·

CC 4.0 BY-SA版权

水题专栏收录该内容

20 篇文章

订阅专栏

本文介绍了一个网球锦标赛中所需资源的计算方法，通过分析比赛进程，确定了每场比赛所需的瓶水数量及每位选手全程所需的毛巾数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目大意：n个选手进行若干场比赛（每场比赛为两人，胜者晋级，败者淘汰），1.每场比赛每位选手需要b瓶水，裁判需要1瓶水；2.从始至终，每位选手需要要p块毛巾，问一共需要多少瓶水，多少块毛巾，

思路：每场比赛淘汰一人，最后只有一个胜者，显然要进行n-1场比赛。

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).

Input

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.

Output

Print two integers x and y — the number of bottles and towels need for the tournament.

Examples

Input

5 2 3

Output

20 15

Input

8 2 4

Output

35 32

Note

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>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<stack>
using namespace std;

int main()
{
     int n,b,p;
     while(~scanf("%d%d%d",&n,&b,&p))
        printf("%d %d\n",(2*b+1)*(n-1),n*p);
    return 0;
}