L1-071 前世档案

这不是内个哈夫曼编码嘛.

#include <bits/stdc++.h>
using namespace std;
int main() {
	int n, m;
	cin >> n >> m;
	cin.get();
	while (m--) {
		string s;
		getline(cin, s);
		int base = 0;
		for (int i = 0; i < s.size(); i++) {
			if (s[i] == 'y') {
				base = base << 1;
			}
			else {
				base = base << 1 | 1;
			}
		}
		cout << (base + 1) << '\n';
	}
	return 0;
}