SRM489 Div1 Easy

300
結合法則を調べる。

int no(char c)
{
  if ('A' <= c && c <= 'Z') return c - 'A';
  if ('a' <= c && c <= 'z') return c - 'a' + 26;
  return -1;
}

class BallsConverter {
public:
  string theGood(vector <string> C) 
  {
    const int N = C.size();
    bool flg = true;

    for (int i = 0; i < N; ++i) {
      for (int j = 0; j < N; ++j) {
        for (int k = 0; k < N; ++k) {
          flg = flg && C[no(C[i][j])][k] == C[i][no(C[j][k])];
        }
      }
    }

    return flg ? "Good" : "Bad";
  }

};