L1-071 previous life files (20 points)

This kind of funny fortune telling applet is often encountered in the online world , The implementation principle is very simple , Just design a few questions , Select a path in the judgment tree according to the player's answer to each question （ As shown in the figure below ）, The conclusion is the node corresponding to the end of the path .

Now let's number the conclusions from left to right , Number from 1 Start . It is assumed that the answers here are simple “ yes ” or “ no ”, Suppose you answer “ yes ” Corresponding to the left path , answer “ no ” Corresponding to the path to the right . A series of answers for a given player , Please return the number of the conclusion .

Input format ：

The first line of input gives two positive integers ：N（≤30） The number of questions to answer in a test for players ;M（≤100） For the number of players .

And then  M  That's ok , Each line gives the player's  N  answer . Here we use  y  representative “ yes ”, use  n  representative “ no ”.

Output format ：

For each player , Output the number of its corresponding conclusion in one line .

sample input ：

3 4
yny
nyy
nyn
yyn

sample output ：

3
5
6
2

Code ： 

#include <iostream>
#include <string>

using namespace std;

int main(){
    string s;
    int n, m, roots = 0;
    cin >> n >> m;
    for(int i = 0, j = 1; i < n; i ++, j *= 2)
        roots += j;
    while(m --){
        cin >> s;
        int p = 1;
        for(int i = 0; i < n; i ++)
            if(s[i] == 'y') p *= 2;
            else p = p * 2 + 1;
        cout << p - roots << endl;
    }
}