codeforces-632A-Grandma Laura and Apples

A. Grandma Laura and Apples

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Grandma Laura came to the market to sell some apples. During the day she sold all the apples she had. But grandma is old, so she forgot how many apples she had brought to the market.

She precisely remembers she had n buyers and each of them bought exactly half of the apples she had at the moment of the purchase and also she gave a half of an apple to some of them as a gift (if the number of apples at the moment of purchase was odd), until she sold all the apples she had.

So each buyer took some integral positive number of apples, but maybe he didn't pay for a half of an apple (if the number of apples at the moment of the purchase was odd).

For each buyer grandma remembers if she gave a half of an apple as a gift or not. The cost of an apple is p (the number p is even).

Print the total money grandma should have at the end of the day to check if some buyers cheated her.

Input

The first line contains two integers n and p (1 ≤ n ≤ 40, 2 ≤ p ≤ 1000) — the number of the buyers and the cost of one apple. It is guaranteed that the number p is even.

The next n lines contains the description of buyers. Each buyer is described with the string half if he simply bought half of the apples and with the string halfplus if grandma also gave him a half of an apple as a gift.

It is guaranteed that grandma has at least one apple at the start of the day and she has no apples at the end of the day.

Output

Print the only integer a — the total money grandma should have at the end of the day.

Note that the answer can be too large, so you should use 64-bit integer type to store it. In C++ you can use the long long integer type and in Java you can use long integer type.

Examples

input

Copy

2 10
half
halfplus

output

Copy

15

input

Copy

3 10
halfplus
halfplus
halfplus

output

Copy

55

Note

In the first sample at the start of the day the grandma had two apples. First she sold one apple and then she sold a half of the second apple and gave a half of the second apple as a present to the second buyer.

 

 

题意 
有n个顾客买苹果,每个苹果p元 
half就是这个顾客买了一半的苹果 
halfplus就是这个顾客买了一半苹果,最后还送了他半个苹果 
最后恰好卖完所有苹果 
问你赚了多少钱

题解: 
倒着推。 
当成模拟题做。

题目思路:倒推先求出苹果的初始数量。首先我们可以确定,最后一个人购买一定是只剩下1个苹果了。往前推,如果前面一个人是half说明前面为偶数,如果是halfplus则为奇数

#include <bits/stdc++.h>
#define mst(a) memset(a,0,sizeof (a))
#define FOR(i,n) for (int i = 0; i < n; i++)
#define INF 1e9
#define eps 1e-10
using namespace std;

typedef long long ll;
long long ret[50];
int main(){
    int n,p;
    cin >> n >> p;
    long long ans = 1,tmp = 0;
    for(int i = 0; i < n; i++)
    {
        string s;
        cin >> s;
        if (s == "half") ret[i] = 1;
        else ret[i] = 2,tmp++;
    } 
    for (int i = n - 2; i>= 0; i--)
    {
        if (ret[i] == 1) ans = ans * 2;
        else ans = ans * 2 + 1;
    }
    ans = ans * p - tmp * (p / 2);
    cout << ans << endl;
    return 0;
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值