Looksery Cup 2015 A

简介:

http://codeforces.com/contest/549/problem/A
做的实在是太暴力了,嘿嘿

#include <iostream>
#include <cstring>
using namespace std;
char st[55][55];
int main()
{
    int m,n;
    while(cin>>m>>n)
    {
        memset(st,0,sizeof(st));
        int sum=0;
        for(int i=0; i<m; i++)
        {
            for(int j=0; j<n; j++)
            {
                cin>>st[i][j];
            }
        }
        for(int i=0; i<m; i++)
        {
            for(int j=0; j<n; j++)
            {
                if(st[i][j]=='f'&&st[i][j+1]=='a'&&st[i+1][j]=='c'&&st[i+1][j+1]=='e')
                sum++;
                if(st[i][j]=='f'&&st[i][j+1]=='a'&&st[i+1][j]=='e'&&st[i+1][j+1]=='c')
                sum++;
                if(st[i][j]=='f'&&st[i][j+1]=='c'&&st[i+1][j]=='a'&&st[i+1][j+1]=='e')
                sum++;
                if(st[i][j]=='f'&&st[i][j+1]=='c'&&st[i+1][j]=='e'&&st[i+1][j+1]=='a')
                sum++;
                if(st[i][j]=='f'&&st[i][j+1]=='e'&&st[i+1][j]=='a'&&st[i+1][j+1]=='c')
                sum++;
                if(st[i][j]=='f'&&st[i][j+1]=='e'&&st[i+1][j]=='c'&&st[i+1][j+1]=='a')//f
                sum++;
                if(st[i][j]=='a'&&st[i][j+1]=='f'&&st[i+1][j]=='c'&&st[i+1][j+1]=='e')
                sum++;
                if(st[i][j]=='a'&&st[i][j+1]=='f'&&st[i+1][j]=='e'&&st[i+1][j+1]=='c')
                sum++;
                if(st[i][j]=='a'&&st[i][j+1]=='e'&&st[i+1][j]=='c'&&st[i+1][j+1]=='f')
                sum++;
                if(st[i][j]=='a'&&st[i][j+1]=='e'&&st[i+1][j]=='f'&&st[i+1][j+1]=='c')
                sum++;
                if(st[i][j]=='a'&&st[i][j+1]=='c'&&st[i+1][j]=='f'&&st[i+1][j+1]=='e')
                sum++;
                if(st[i][j]=='a'&&st[i][j+1]=='c'&&st[i+1][j]=='e'&&st[i+1][j+1]=='f')//a
                sum++;
                if(st[i][j]=='c'&&st[i][j+1]=='a'&&st[i+1][j]=='f'&&st[i+1][j+1]=='e')
                sum++;
                if(st[i][j]=='c'&&st[i][j+1]=='a'&&st[i+1][j]=='e'&&st[i+1][j+1]=='f')
                sum++;
                if(st[i][j]=='c'&&st[i][j+1]=='e'&&st[i+1][j]=='a'&&st[i+1][j+1]=='f')
                sum++;
                if(st[i][j]=='c'&&st[i][j+1]=='e'&&st[i+1][j]=='f'&&st[i+1][j+1]=='a')
                sum++;
                if(st[i][j]=='c'&&st[i][j+1]=='f'&&st[i+1][j]=='a'&&st[i+1][j+1]=='e')
                sum++;
                if(st[i][j]=='c'&&st[i][j+1]=='f'&&st[i+1][j]=='e'&&st[i+1][j+1]=='a')//c
                sum++;
                if(st[i][j]=='e'&&st[i][j+1]=='f'&&st[i+1][j]=='c'&&st[i+1][j+1]=='a')
                sum++;
                if(st[i][j]=='e'&&st[i][j+1]=='f'&&st[i+1][j]=='a'&&st[i+1][j+1]=='c')
                sum++;
                if(st[i][j]=='e'&&st[i][j+1]=='c'&&st[i+1][j]=='a'&&st[i+1][j+1]=='f')
                sum++;
                if(st[i][j]=='e'&&st[i][j+1]=='c'&&st[i+1][j]=='f'&&st[i+1][j+1]=='a')
                sum++;
                if(st[i][j]=='e'&&st[i][j+1]=='a'&&st[i+1][j]=='f'&&st[i+1][j+1]=='c')
                sum++;
                if(st[i][j]=='e'&&st[i][j+1]=='a'&&st[i+1][j]=='c'&&st[i+1][j+1]=='f')
                sum++;
            }
        }
        cout<<sum<<endl;
    }
    return 0;
}
目录
相关文章
|
5月前
|
传感器
|
6月前
shi-tomasi角点检测
shi-tomasi角点检测
27 1
|
6月前
|
人工智能 安全
Kollmorgen S72402-NANANA-NA-225 NI SCXI-1104C
Kollmorgen S72402-NANANA-NA-225 NI SCXI-1104C
30 0
|
11月前
|
C++
【PAT甲级 - C++题解】1011 World Cup Betting
【PAT甲级 - C++题解】1011 World Cup Betting
40 0
2019CCPC秦皇岛HDU - 6736 F - Forest Program(dfs找环 组合数学)
2019CCPC秦皇岛HDU - 6736 F - Forest Program(dfs找环 组合数学)
76 0
|
存储
PAT (Advanced Level) Practice 1011 World Cup Betting (20 分)
PAT (Advanced Level) Practice 1011 World Cup Betting (20 分)
58 0
Tian Ji -- The Horse Racing 田忌赛马
Tian Ji -- The Horse Racing 田忌赛马
215 0
【1011】World Cup Betting (20 分)
【1011】World Cup Betting (20 分) 【1011】World Cup Betting (20 分)
76 0
1011. World Cup Betting (20)
简析:关键是W T L的对应。 #include using namespace std; int main(int argc, const char * argv[]) { char c1 = '\0', c...
667 0