CF Round #361 (Div. 2) 689A 模拟

上代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#define INF 0x3fffffff
using namespace std;
typedef long long ll;
const int MAX_N = 500+10;

char num[12];
int xx[12];

int main()
{
int x[12] = {2,1,2,3,1,2,3,1,2,3};
int y[12] = {4,1,1,1,2,2,2,3,3,3};
int n;
while(scanf("%d",&n)!=EOF)
{
int t;
int l=3;
int r=1;
int h=1;
int s=4;
scanf("%s",num);
memset(xx,0,sizeof(xx));
for(int i=0;i<n;i++)
{
t = num[i] - '0';
xx[t]=1;
l = min(l,x[t]);
r = max(r,x[t]);
h = max(h,y[t]);
s = min(s,y[t]);
}
int ans = (r-l+1) * (h-s+1);
if((h-s+1)==4)
ans = 16;
if(ans==9&&xx[8]==1&&(xx[0]+xx[9]+xx[7])==0)
{
ans=0;
}
if(ans==9&&xx[0]==1)
ans=0;
if(ans > 6)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
return 0;
}