1 solutions
-
1
#include<iostream> using namespace std; int n,m; bool f=0; char t; char a[40][40]; char pd(int ax,int ay,int bx,int by,int cx,int cy,int dx,int dy,int ex,int ey) { if(a[ax][ay]!='~' && a[ax][ay]==a[bx][by] && a[bx][by]==a[cx][cy] && a[cx][cy]==a[dx][dy] && a[dx][dy]==a[ex][ey]) { return a[ax][ay]; } return '~'; } bool fun() { if(t=='*') { cout<<"Pleasing!"; return 1; } if(t=='$') { cout<<"zylwins!"; return 1; } return 0; } int main() { cin>>n>>m; for(int i=3;i<=n+2;i++) { for(int j=3;j<=m+2;j++) { cin>>a[i][j]; if(a[i][j]=='*' || a[i][j]=='$') f=!f; } } for(int i=3;i<=n+2;i++) { for(int j=3;j<=m+2;j++) { t=pd(i,j,i-2,j-2,i-1,j-1,i+1,j+1,i+2,j+2); //if(t!='~') if(fun())return 0; t=pd(i,j,i-2,j,i-1,j,i+1,j,i+2,j); //if(t!='~') if(fun())return 0; t=pd(i,j,i-2,j+2,i-1,j+1,i+1,j-1,i+2,j-2); //if(t!='~') if(fun())return 0; t=pd(i,j,i,j-2,i,j-1,i,j+1,i,j+2); //if(t!='~') if(fun())return 0; } } if(!f) { cout<<'W'; return 0; } else { cout<<'Z'; return 0; } return 0; }
- 1
Information
- ID
- 8605
- Time
- 1000ms
- Memory
- 512MiB
- Difficulty
- 2
- Tags
- # Submissions
- 81
- Accepted
- 4
- Uploaded By