Codeforces Round #442 (Div. 2) A. Alex and broken contest
来源:互联网 发布:广州数控车床编程实例 编辑:程序博客网 时间:2024/05/16 01:53
http://codeforces.com/problemset/problem/877/A
One day Alex was creating a contest about his friends, but accidentally deleted it. Fortunately, all the problems were saved, but now he needs to find them among other problems.
But there are too many problems, to do it manually. Alex asks you to write a program, which will determine if a problem is from this contest by its name.
It is known, that problem is from this contest if and only if its name contains one of Alex’s friends’ name exactly once. His friends’ names are “Danil”, “Olya”, “Slava”, “Ann” and “Nikita”.
Names are case sensitive.
Input
The only line contains string from lowercase and uppercase letters and “_” symbols of length, not more than 100 — the name of the problem.
Output
Print “YES”, if problem is from this contest, and “NO” otherwise.
Examples
input
Alex_and_broken_contest
output
NO
input
NikitaAndString
output
YES
input
Danil_and_Olya
output
NO
题意
给出了五个朋友的名字,当且仅当其名称中包含Alex的一个朋友的名字一次时,输出YES否则输出NO
题解
很简单的题,不会c++的话有些麻烦
c++CODE
#include "bits/stdc++.h"using namespace std;string a;int i,cnt;vector <string> v={"Danil","Olya","Slava","Ann","Nikita"};int main(){ cin>>a; for(i=0;i<a.size();i++) for(auto j:v) cnt+=(a.substr(i,j.size())==j); if(cnt==1) cout<<"YES"; else cout<<"NO";}
C CODE
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <cmath>using namespace std;int main(){ char s1[10]="Danil",s2[10]="Olya",s3[10]="Slava",s4[10]="Ann",s5[10]="Nikita"; char ch[110]; scanf("%s",ch); int l=strlen(ch); int sum=0; for(int i=0;i<l;i++) { int flag=0; if(ch[i]=='D') { for(int j=i;j<=i+5;j++) if(ch[j]!=s1[j-i]) flag=1; if(flag) continue; else sum++; } if(ch[i]=='O') { for(int j=i;j<=i+4;j++) if(ch[j]!=s2[j-i]) flag=1; if(flag) continue; else sum++; } if(ch[i]=='S') { for(int j=i;j<=i+5;j++) if(ch[j]!=s3[j-i]) flag=1; if(flag) continue; else sum++; } if(ch[i]=='A') { for(int j=i;j<=i+3;j++) if(ch[j]!=s4[j-i]) flag=1; if(flag) continue; else sum++; } if(ch[i]=='N') { for(int j=i;j<=i+6;j++) if(ch[j]!=s5[j-i]) flag=1; if(flag) continue; else sum++; } } if(sum==1) cout << "YES" << endl; else cout << "NO" << endl;}
- Codeforces Round #442 (Div. 2) A. Alex and broken contest
- Codeforces Round #442 (Div. 2) A Alex and broken contest
- Codeforces Round #442 (Div. 2) A. Alex and broken contest
- Codeforces Round #442 (Div. 2) A. Alex and broken contest,B
- Alex and broken contest Codeforces Round #442
- Codeforces 877 A Alex and broken contest
- codeforces 442 A. Alex and broken contest(水题)
- A. Alex and broken contest
- A. Alex and broken contest
- [水题]Codeforces Round #307 (Div. 2) A.GukiZ and Contest
- Codeforces Round #307 (Div. 2) A. GukiZ and Contest
- CF#877 A. Alex and broken contest(KMP)
- Codeforces Round #267 (Div. 2) E Alex and Complicated Task
- contest: Codeforces Round #307 (Div. 2), problem: (A) GukiZ and Contest
- Codeforces Round #307 (Div. 2) A. GukiZ and Contest (暴力)
- A. GukiZ and Contest-Codeforces Round #307 (Div. 2)-简单水题
- Codeforces Round #357 (Div. 2) A. A Good Contest
- Codeforces Round #357 (Div. 2) A. A Good Contest
- 英伟达最新公布的眼球追踪技术,或将改变VR行业
- Java中的Atomic包使用指南
- 数据结构---C语言栈的链式表示与实现
- python中递归的深度,999
- 服务器通过vmware命令批量启动多个VMware虚拟机
- Codeforces Round #442 (Div. 2) A. Alex and broken contest
- 深度学习在搜索的应用:学术前沿与工业方案解析
- Android NDK系列(六)- 文件拆分与合并
- 续航谁更强?2千档手机续航评比
- 告诉你一点小技巧 OPPO R9拍出更好的夜景
- CCF-GAIR让中国人工智能的研究进度超越美国至少100年
- react学习记录笔记
- centos安装jenkins
- 防止按钮事件传递