CodeForces-330A-Cakeminator

原题链接：https://cn.vjudge.net/problem/45574/origin
You are given a rectangular cake, represented as an r × c grid. Each cell either has an evil strawberry, or is empty. For example, a 3 × 4 cake may look as follows:

The cakeminator is going to eat the cake! Each time he eats, he chooses a row or a column that does not contain any evil strawberries and contains at least one cake cell that has not been eaten before, and eats all the cake cells there. He may decide to eat any number of times.
Please output the maximum number of cake cells that the cakeminator can eat.
Input
The first line contains two integers r and c (2 ≤ r, c ≤ 10), denoting the number of rows and the number of columns of the cake. The next r lines each contains c characters — the j-th character of the i-th line denotes the content of the cell at row i and column j, and is either one of these:
‘.’ character denotes a cake cell with no evil strawberry;
‘S’ character denotes a cake cell with an evil strawberry.
Output
Output the maximum number of cake cells that the cakeminator can eat.
Examples
Input
3 4
S…
…
…S.
Output
8
Note
For the first example, one possible way to eat the maximum number of cake cells is as follows (perform 3 eats).

题目大意：
给你个几行几列的图，有几个坐标有草莓，让你数数所有行和列，看看有多少行列都空着，把这些行列所包含的格子总数加起来（不包括重复的）
思路就是看看有多少行多少列空着
空行数乘以列数加上空列数乘以行数，再减去空行数乘以空列数（重复的）（因为比如有一个空行两个空列 就交叉重复了1*2个格子，就得减去），就是总数。

#include<stdio.h>
int main()
{
	int r,c,i,j,flag,r0=0,c0=0,sum;
	char a[10][10];
	scanf("%d%d",&r,&c);getchar();  //注意这里是连续输入！！ 
	for(i=0;i<r;i++)				//小心回车被吃！！
	{
		for(j=0;j<c;j++)
		scanf("%c",&a[i][j]);
		getchar();//这玩意儿真坑人 
	}
	
	for(i=0;i<r;i++)
	{
		flag=1;
		for(j=0;j<c;j++)
		if(a[i][j]=='S')
		{flag=0;break;}
		if(flag) r0++;
	}
	for(j=0,flag=1;j<c;j++)
	{
		flag=1;
		for(i=0;i<r;i++)
		if(a[i][j]=='S') 
		{flag=0;break;}
		if(flag) c0++;
	}
	sum=c*r0+r*c0-r0*c0;
	//printf("%d %d\n",r0,c0);
	printf("%d\n",sum);
	
	return 0;
}