csuoj 1395: Timebomb

http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1395

1395: Timebomb

Time Limit: 1 Sec Memory Limit: 128 MB
Submit: 139 Solved: 55
[Submit][Status][Web Board]

Description

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<iostream>
#include<stack>
#include<map>
#include<string>
using namespace std;
char ch[6][50];
int main(){
int n;
while(gets(ch[0])){
for(int i = 1; i < 5; i++){
gets(ch[i]);
}
int l = strlen(ch[0]);
int sum = 0;
for(int i = 0; i < l; i+=4){
//printf("%s\n", ch[i]);
int num = 0;
if(ch[0][i]=='*' && ch[0][i+1]=='*' && ch[0][i+2]=='*'
&&ch[1][i]=='*' && ch[1][i+1]!='*' && ch[1][i+2]=='*'
&&ch[2][i]=='*' && ch[2][i+1]!='*' && ch[2][i+2]=='*'
&&ch[3][i]=='*' && ch[3][i+1]!='*' && ch[3][i+2]=='*'
&&ch[4][i]=='*' && ch[4][i+1]=='*' && ch[4][i+2]=='*'
){
num = 0;
}
if(ch[0][i]!='*' && ch[0][i+1]!='*' && ch[0][i+2]=='*'
&&ch[1][i]!='*' && ch[1][i+1]!='*' && ch[1][i+2]=='*'
&&ch[2][i]!='*' && ch[2][i+1]!='*' && ch[2][i+2]=='*'
&&ch[3][i]!='*' && ch[3][i+1]!='*' && ch[3][i+2]=='*'
&&ch[4][i]!='*' && ch[4][i+1]!='*' && ch[4][i+2]=='*'
){
num = 1;
}
if(ch[0][i]=='*' && ch[0][i+1]=='*' && ch[0][i+2]=='*'
&&ch[1][i]!='*' && ch[1][i+1]!='*' && ch[1][i+2]=='*'
&&ch[2][i]=='*' && ch[2][i+1]=='*' && ch[2][i+2]=='*'
&&ch[3][i]=='*' && ch[3][i+1]!='*' && ch[3][i+2]!='*'
&&ch[4][i]=='*' && ch[4][i+1]=='*' && ch[4][i+2]=='*'
){
num = 2;
}
if(ch[0][i]=='*' && ch[0][i+1]=='*' && ch[0][i+2]=='*'
&&ch[1][i]!='*' && ch[1][i+1]!='*' && ch[1][i+2]=='*'
&&ch[2][i]=='*' && ch[2][i+1]=='*' && ch[2][i+2]=='*'
&&ch[3][i]!='*' && ch[3][i+1]!='*' && ch[3][i+2]=='*'
&&ch[4][i]=='*' && ch[4][i+1]=='*' && ch[4][i+2]=='*'
){
num = 3;
}
if(ch[0][i]=='*' && ch[0][i+1]!='*' && ch[0][i+2]=='*'
&&ch[1][i]=='*' && ch[1][i+1]!='*' && ch[1][i+2]=='*'
&&ch[2][i]=='*' && ch[2][i+1]=='*' && ch[2][i+2]=='*'
&&ch[3][i]!='*' && ch[3][i+1]!='*' && ch[3][i+2]=='*'
&&ch[4][i]!='*' && ch[4][i+1]!='*' && ch[4][i+2]=='*'
){
num = 4;
}
if(ch[0][i]=='*' && ch[0][i+1]=='*' && ch[0][i+2]=='*'
&&ch[1][i]=='*' && ch[1][i+1]!='*' && ch[1][i+2]!='*'
&&ch[2][i]=='*' && ch[2][i+1]=='*' && ch[2][i+2]=='*'
&&ch[3][i]!='*' && ch[3][i+1]!='*' && ch[3][i+2]=='*'
&&ch[4][i]=='*' && ch[4][i+1]=='*' && ch[4][i+2]=='*'
){
num = 5;
}
if(ch[0][i]=='*' && ch[0][i+1]=='*' && ch[0][i+2]=='*'
&&ch[1][i]=='*' && ch[1][i+1]!='*' && ch[1][i+2]!='*'
&&ch[2][i]=='*' && ch[2][i+1]=='*' && ch[2][i+2]=='*'
&&ch[3][i]=='*' && ch[3][i+1]!='*' && ch[3][i+2]=='*'
&&ch[4][i]=='*' && ch[4][i+1]=='*' && ch[4][i+2]=='*'
){
num = 6;
}
if(ch[0][i]=='*' && ch[0][i+1]=='*' && ch[0][i+2]=='*'
&&ch[1][i]!='*' && ch[1][i+1]!='*' && ch[1][i+2]=='*'
&&ch[2][i]!='*' && ch[2][i+1]!='*' && ch[2][i+2]=='*'
&&ch[3][i]!='*' && ch[3][i+1]!='*' && ch[3][i+2]=='*'
&&ch[4][i]!='*' && ch[4][i+1]!='*' && ch[4][i+2]=='*'
){
num = 7;
}
if(ch[0][i]=='*' && ch[0][i+1]=='*' && ch[0][i+2]=='*'
&&ch[1][i]=='*' && ch[1][i+1]!='*' && ch[1][i+2]=='*'
&&ch[2][i]=='*' && ch[2][i+1]=='*' && ch[2][i+2]=='*'
&&ch[3][i]=='*' && ch[3][i+1]!='*' && ch[3][i+2]=='*'
&&ch[4][i]=='*' && ch[4][i+1]=='*' && ch[4][i+2]=='*'
){
num = 8;
}
if(ch[0][i]=='*' && ch[0][i+1]=='*' && ch[0][i+2]=='*'
&&ch[1][i]=='*' && ch[1][i+1]!='*' && ch[1][i+2]=='*'
&&ch[2][i]=='*' && ch[2][i+1]=='*' && ch[2][i+2]=='*'
&&ch[3][i]!='*' && ch[3][i+1]!='*' && ch[3][i+2]=='*'
&&ch[4][i]=='*' && ch[4][i+1]=='*' && ch[4][i+2]=='*'
){
num = 9;
}
sum *= 10;
sum += num;
}
if(sum % 6 == 0){
printf("BEER!!\n");
}
else
printf("BOOM!!\n");
}

return 0;
}

View Code