628A. Tennis Tournament

最新推荐文章于 2017-07-26 09:58:31 发布

原创最新推荐文章于 2017-07-26 09:58:31 发布 · 307 阅读

0 ·

CC 4.0 BY-SA版权

codeforces 专栏收录该内容

16 篇文章

订阅专栏

本文介绍了一个网球锦标赛中所需物资（水瓶和毛巾）的计算方法。通过特定算法确定每轮比赛的人数，进而计算出整个赛事所需的总物资数量。

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.

#!/usr/bin/python
# -*-coding:utf-8 -*-
def get_k(a):
    i=0
    while(pow(2,i)<a):
        i+=1
    if i>1:
        return i-1
    else:
        return i
n,b,p=map(int,raw_input().split(' '))
towels=n*p
bottles=0
while(n>1):
    k=get_k(n)
    bottles=bottles+k*b*2+k
    n=n-k
print "%d %d"%(bottles,towels)