백준/백준-C++
1100번: 하얀 칸
Beabletoet
2017. 9. 2. 20:25
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 | #include<cstdio> int main() { char cs[8][9]; int ans = 0; for (int i = 0; i < 8; scanf("%s", &cs[i++])); for (int i = 0, j; i < 8; ++i) { j = ((i + 2) % 2 == 0) ? 0 : 1; for (int k = j; k < j + 7; k += 2) if (cs[i][k] == 'F') ++ans; } printf("%d", ans); } | cs |