L1-071 前世档案

洛谷

a,b = map(int,input().split())
c = [[i for i in input()] for _ in range(b)]
s = 1
for i in range(b):
    for j in range(a):
        if c[i][j] == 'n':
            s = s + 2**(a - 1 - j)
    print(s)
    s = 1

解题思路：把每一行数当成1 + 有几位（几行）的二进制数

假如是右右 

结果 = 1 + 01B + 10B = 1 + 2**0 + 2**1

假如是右右左

结果 = 1 + 010B +100B  = 1 + 2** 1 + 2**2