A. Mike and Cellphone(cf#361)
来源:互联网 发布:开淘宝店怎么代理货源 编辑:程序博客网 时间:2024/05/16 09:33
#include <iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>using namespace std;int main(){ int n; char a[15]; int b[10]; memset(b,0,sizeof(b)); scanf("%d",&n); scanf("%s",a); for(int i=0;i<strlen(a);i++) { b[a[i]-'0']=1; } if(b[1]+b[2]+b[3]>0&&b[0]+b[1]+b[4]+b[7]>0&&b[3]+b[6]+b[9]+b[0]>0&&b[7]+b[9]+b[0]>0) printf("YES\n"); else printf("NO\n"); return 0;}
0 0
- A. Mike and Cellphone(cf#361)
- Codeforces Round #361 (Div. 2) A. Mike and Cellphone
- Codeforces Round #361 (Div. 2) A. Mike and Cellphone
- Codeforces Round #361 (Div. 2) A. Mike and Cellphone
- Codeforces Round #361 (Div. 2)A. Mike and Cellphone
- Codeforces Round #361 (Div. 2) A. Mike and Cellphone ( 模拟 )
- Codeforces Round #361 (Div.2) - A. Mike and Cellphone
- Codeforces Round #361 (Div. 2) 689A Mike and Cellphone
- 【打CF,学算法——二星级】CodeForces 689A Mike and Cellphone (模拟)
- CodeForces 689A Mike and Cellphone
- codeforces 689A Mike and Cellphone(模拟)
- Codeforces-689A-Mike and Cellphone
- Mike and Cellphone
- Mike and Cellphone
- Codeforces Round #361 (Div. 2) -- A. Mike and Cellphone (思路题目)
- Codeforces 689A. Mike and Cellphone(模拟)
- 689 A. Mike and Cellphone 条件判断题
- CF 547 A Mike and Frog
- 我对CONTAINING_RECORD宏的详细解释
- hdu 5178(尺取法)
- <React Native> 学习日记(1) 成功运行、编译RN-android的爬坑记录
- web开发的一些小经验
- 离散傅里叶(DFT) 与 快速傅里叶(FFT)
- A. Mike and Cellphone(cf#361)
- JavaScript强化教程——正则表达式回溯
- js自定义多级联动下拉菜单,实用方便
- HDU 1240 Asteroids! (三维BFS)
- Surfaceflinger 概述
- Android之自定义搜索框
- A Note on CMake - 0 Introduction
- Spring枚举类介绍
- Java StringBuffer谜题