ソースコード
#include<iostream>
#include<string>
#include<vector>
#include<set>
#include<algorithm>
#include<math.h>
#include<map>
#include<queue>
using namespace std;
/*
//1
int main() {
int f, c;
cin >> f >> c;
bool b = true;
while (true) {
if (b) {
f -= 2;
c--;
if (f < 0 || c < 0) {
cout << "K" << endl;
break;
}
b = false;
}
else {
f -= 2;
c--;
if (f < 0 || c < 0) {
cout << "O" << endl;
break;
}
b = true;
}
}
return 0;
}
*/
/*
//2
int main() {
int N, M;
cin >> N >> M;
int n[100];
for (int i = 0; i < N; i++) {
cin >> n[i];
}
sort(n, n + N);
reverse(n, n + N);
int tmp = 0;
if (tmp >= M) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < N; i++) {
tmp += n[i];
if (tmp >= M) {
cout << i + 1 << endl;
break;
}
}
return 0;
}
*/
//3
int N, H, W;
int main() {
cin >> N >> H >> W;
char X[10][10];
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> X[i][j];
}
}
for (int h = 1; h <= N; h++) {
int ans = 0;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
for (int k = 0; k < h; k++) {
if (X[i][j + k] != '.') {
break;
}
else if (k == h - 1 && X[i][j + k] == '.') {
ans++;
j += k;
}
}
}
}
cout << ans << endl;
}
return 0;
}
/*
//4
int main() {
return 0;
}
*/
/*
//5
int main() {
return 0;
}
*/
/*
//6
int main() {
return 0;
}
*/
/*
//7
int main() {
return 0;
}
*/
/*
//8
int main() {
return 0;
}
*/
/*
//9
int main() {
return 0;
}
*/
/*
//10
int main() {
return 0;
}
*/