简单数学题
题目大意:有n行字符串,每行中间是空格,两边是字母X,把右边的整体往左边平移,直到某一行中间没有空格就计算此时整个平面里的空格数。
Sample Input
4
XXXX XXXXX
XXX XXXXXXX
XXXXX XXXX
XX XXXXXX
2
XXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXX
1
XXXXXXXXX XX
0
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 15;
int n, a[maxn];
void init()
{
for (int i = 0; i < maxn; i++)
{
a[i] = 0;
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
while (scanf("%d",&n) == 1)
{
if (n == 0)break;
init();
getchar();
for (int j = 0; j < n; j++)
{
for (int i = 0; i < 25; i++)
{
char c = getchar();
if (c == 'X')
{
a[j]++;
}
}
getchar();
}
sort(a,a+n);
int sum = 0;
for (int i = 0; i < n; i++)
{
sum += (a[n-1] - a[i]);
}
printf("%d\n",sum);
}
return 0;
}