1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include <bits/stdc++.h>
#include <random>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>
#define ld long double
#define ull unsigned long long
#define mt make_tuple
using namespace std;

const int nax = 222;
int a[nax][nax];
int n, m;

void brucik(){
    int ev = 0;
    for(int i=1;i<=m;i++){
        // 1
        if(a[1][i - 1] == 1 || a[1][i] == 0 || a[1][i + 1] == 1){
            // cant
        }
        else{
            // 010
            int ways = 16;
            for(int j=-1;j<=1;j++){
                if(a[1][i + j] == 2) ways /= 2;
            }
            ev += ways;
        }

        // 0111...
        if(a[1][i - 1] == 1 || a[1][i] == 0 || a[1][i + 1] == 0 || a[1][i + 2] == 0){
            // cant;
        }
        else{
            int ways = 16;
            for(int j=-1;j<=2;j++){
                if(a[1][i + j] == 2) ways /= 2;
            }
            ev += ways;
        }

    }
    int mian = 16;
    while(ev % 2 == 0 && mian % 2 == 0){
        ev /= 2;
        mian /= 2;
    }
    cout << ev << "/" << mian << "\n";
    exit(0);
}

void solve(){
    cin >> n >> m;
    for(int i=1;i<=n;i++){
        string s; cin >> s;
        for(int j=1;j<=m;j++){
            if(s[j - 1] == '.') a[i][j] = 0;
            else if(s[j - 1] == 'O') a[i][j] = 1;
            else a[i][j] = 2;
        }
    }

    if(n == 1){
        brucik();
    }

}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int tt = 1;
    // cin >> tt;
    while(tt--) solve();
    return 0;
}