ケーキミネーター

簡単な問題
//====================================================================||  
// Name        : Cakeminator.cpp                                              ||  
// Date : 2013/7/20 午後9:34:59                                               ||  
// Author : GCA                                                       ||  
//                  6AE7EE02212D47DAD26C32C0FE829006                  ||  
//====================================================================||  
#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <algorithm>  
#include <cmath>  
#include <climits>  
#include <vector>  
#include <set>  
#include <map>  
#include <queue>  
#include <cctype>  
#include <utility>  
using namespace std;  
#ifdef ONLINE\_JUDGE  
#define ll "%lld"  
#else  
#define ll "%I64d"  
#endif  
typedef unsigned int uint;  
typedef long long int Int;  
#define Set(a,s) memset(a,s,sizeof(a))  
#define Write(w) freopen(w,"w",stdout)  
#define Read(r) freopen(r,"r",stdin)  
#define Pln() printf("\\n")  
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()  
#define De(x)printf(#x"%d\\n",x)  
#define For(i,x)for(int i=0;i<x;i++)  
#define CON(x,y) x##y  
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\  
    printf("%d ",dp\[htx\]\[hty\]);}Pln();}  
#define M 10011  
#define PII pair<int,int\>  
#define PB push\_back  
#define oo INT\_MAX  
#define Set\_oo 0x3f  
#define Is\_debug true  
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)  
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)  
#define eps 1e-6  
bool xdy(double x,double y){return x>y+eps;}  
bool xddy(double x,double y){return x>y-eps;}  
bool xcy(double x,double y){return x<y-eps;}  
bool xcdy(double x,double y){return x<y+eps;}  
int min3(int x,int y,int z){  
    int tmp=min(x,y);  
    return min(tmp,z);  
}  
int max3(int x,int y,int z){  
    int tmp=max(x,y);  
    return max(tmp,z);  
}  
int ny,nx;  
char mz\[15\]\[15\];  
void solve(){  
    int ans=0;  
    int all=nx\*ny;  
    for(int i=0;i<ny;i++){  
        bool caneat=true;  
        for(int k=0;k<nx;k++){  
            if(mz\[i\]\[k\]=='S'){  
                caneat=false;  
                break;  
            }  
        }  
        if(caneat){  
            for(int k=0;k<nx;k++)mz\[i\]\[k\]='X';  
        }  
    }  
    for(int i=0;i<nx;i++){  
        bool caneat=true;  
        for(int k=0;k<ny;k++){  
            if(mz\[k\]\[i\]=='S'){  
                caneat=false;  
                break;  
            }  
        }  
        if(caneat){  
            for(int k=0;k<ny;k++)mz\[k\]\[i\]='X';  
        }  
    }  
    for(int i=0;i<ny;i++){  
//        puts(mz\[i\]);  
        for(int j=0;j<nx;j++){  
            if(mz\[i\]\[j\]=='.'||mz\[i\]\[j\]=='S')ans++;  
        }  
    }  
    printf("%d\\n",all-ans);  
}  
int main() {  
    ios\_base::sync\_with\_stdio(0);  
    while(~scanf("%d%d",&ny,&nx)){  
        for(int i=0;i<ny;i++)scanf("%s",mz\[i\]);  
        solve();  
    }  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
}