Codeforces Round #442 (Div. 2) A Alex and broken contest

关注

原创最新推荐文章于 2026-09-07 15:22:16 发布 731 阅读 AI 写同款· GEO 优化 ›

大一零基础参加电子设计竞赛：从单片机到PID的完整备赛与实战指南在工程实践中，单片机是嵌入式系统最基础的入门核心，无论是51系列还是STM32，都承载着从硬件控制到算法落地的关键桥梁作用。理解单片机的工作原理、外设接口与中断机制，是构建智能控制系统的第一步。传感器负责感知物理世界，电机驱动实现执行动作，而PID算法则让系统具备精确调节与稳定运行的能力，这三者的协同构成了典型的闭环控制系统，广泛应用于智能小车、自动化设备等领域。全国大学生电子设计竞赛正是这些底层技术的综合演练场，其题目往往围绕循迹、避障、速度控制等真实场景展开，要求参赛者在短时间内完成方案设计、电路搭建与阅读详情

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

题意 给出四个字符串 求输入的字符串s中 如果有且只有一个字符串包含在s中 那么就输出Yes 反之输出No

用很蠢的方法判断一下

#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
	char str[150];
	int D = 0, O = 0, S = 0, A = 0, N = 0;
	scanf("%s", str);
	int l = strlen(str);
	str[l] = str[l + 1] = str[l + 2] = str[l + 3] = str[l + 4] = '0';
	for (int i = 0; i < l; i ++) {
		if (str[i] == 'A' && str[i + 1] == 'n' && str[i + 2] == 'n') {
			A ++;
		}
		if (str[i] == 'O' && str[i + 1] == 'l' && str[i + 2] == 'y' && str[i + 3] == 'a') {
			O ++;
		}
		if (str[i] == 'D' && str[i + 1] == 'a' && str[i + 2] == 'n' && str[i + 3] == 'i' && str[i + 4] == 'l') {
			D ++;
		}
		if (str[i] == 'S' && str[i + 1] == 'l' && str[i + 2] == 'a' && str[i + 3] == 'v' && str[i + 4] == 'a') {
			S ++;
		}
		if (str[i] == 'N' && str[i + 1] == 'i' && str[i + 2] == 'k' && str[i + 3] == 'i' && str[i + 4] == 't' && str[i + 5] == 'a') {
			N ++;
		}
	}
	if (A + O + D + S + N == 1) {
		printf("Yes\n");
	}
	else {
		printf("No\n");
	}
	
}