8月3号水题走一波-个人赛五

1.Alex and broken contest

Description

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.

Sample Input

Input

Alex_and_broken_contest

Output

NO

Input

NikitaAndString

Output

YES

Input

Danil_and_Olya

Output

NO


题目意思：所给的字符串中只能包含他朋友的一个名字。
解题思路：当时比赛的时候没多想直接用了笨办法，反正数据量很小，直接一个个的比对。
之后看到有大神用string中的find做，确实很简单，之前find也学的不清楚，这次贴出代码。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char s[110];
int main()
{
    int i,len,count;
    while(scanf("%s",s)!=EOF)
    {
        len=strlen(s);
        count=0;
        for(i=0; i<len; i++)
        {
            if(s[i]=='D')
            {
                if(s[i+1]=='a'&&s[i+2]=='n'&&s[i+3]=='i'&&s[i+4]=='l')
                {
                    count++;
                }
            }
            else if(s[i]=='O')
            {
                if(s[i+1]=='l'&&s[i+2]=='y'&&s[i+3]=='a')
                {
                    count++;
                }
            }
            else if(s[i]=='S')
            {
                if(s[i+1]=='l'&&s[i+2]=='a'&&s[i+3]=='v'&&s[i+4]=='a')
                {
                    count++;
                }
            }
            else if(s[i]=='A')
            {
                if(s[i+1]=='n'&&s[i+2]=='n')
                {
                    count++;
                }
            }
            else if(s[i]=='N')
            {
                if(s[i+1]=='i'&&s[i+2]=='k'&&s[i+3]=='i'&&s[i+4]=='t'&&s[i+5]=='a')
                {
                    count++;
                }
            }
        }
        if(count==1)
        {
            printf("YES\n");
        }
        else
        {
            printf("NO\n");
        }
    }
    return 0;
}

c++，使用string中的find

#include <bits/stdc++.h>
using namespace std;
vector<string> s;
int main()
{
    s.push_back("Danil");
    s.push_back("Olya");
    s.push_back("Slava");
    s.push_back("Ann");
    s.push_back("Nikita");///建立动态数组
    string a;
    cin>>a;
    int res = 0;
    for(int i = 0; i < 5; i++)
    {
        if(a.find(s[i]) != a.npos)
        {
            res++;
            if(a.rfind(s[i]) != a.find(s[i]))///一个字符中出现多个一样的名字
            {
                res++;
            }
        }
    }
    if(res == 1) 
    {
        cout<<"YES"<<endl;
    }
    else 
    {
        cout<<"NO"<<endl;
    }
    return 0;
}

 

2.The Eternal Immortality

Description

Even if the world is full of counterfeits, I still regard it as wonderful.

Pile up herbs and incense, and arise again from the flames and ashes of its predecessor — as is known to many, the phoenix does it like this.

The phoenix has a rather long lifespan, and reincarnates itself once every a! years. Here a! denotes the factorial of integer a, that is, a! = 1 × 2 × ... × a. Specifically, 0! = 1.

Koyomi doesn't care much about this, but before he gets into another mess with oddities, he is interested in the number of times the phoenix will reincarnate in a timespan of b! years, that is, . Note that when b ≥ a this value is always integer.

As the answer can be quite large, it would be enough for Koyomi just to know the last digit of the answer in decimal representation. And you're here to provide Koyomi with this knowledge.

Input

The first and only line of input contains two space-separated integers a and b (0 ≤ a ≤ b ≤ 10¹⁸).

Output

Output one line containing a single decimal digit — the last digit of the value that interests Koyomi.

Sample Input

Input

2 4

Output

2

Input

0 10

Output

0

Input

107 109

Output

2

Hint

In the first example, the last digit of  is 2;

In the second example, the last digit of  is 0;

In the third example, the last digit of  is 2.

解题思路：这道题本身就是一个同余定理的应用a*b%c= (a%c) * (b%c) % c
这道题的坑点在于不能直接去暴力做，要求的只是最后一位，我们知道只要乘上一个最后一位是0的数，结果的最后一位一定是0！
所以当b-a>=10的时候一定是0，这样就缩小了范围。

#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long int
using namespace std;
int main()
{
    ll a,b,ans,i;
    scanf("%lld%lld",&a,&b);
    ans=1;
    if((b-a)>=10)
    {
        ans=0;
    }
    else
    {
        for(i=a+1;i<=b;i++)
    {
        ans=(ans*(i%10))%10;
    }
    ans=ans%10;
    }
    printf("%lld\n",ans);
    return 0;
}

  3.Slava and tanks

Description

Slava plays his favorite game "Peace Lightning". Now he is flying a bomber on a very specific map.

Formally, map is a checkered field of size 1 × n, the cells of which are numbered from 1 to n, in each cell there can be one or several tanks. Slava doesn't know the number of tanks and their positions, because he flies very high, but he can drop a bomb in any cell. All tanks in this cell will be damaged.

If a tank takes damage for the first time, it instantly moves to one of the neighboring cells (a tank in the cell n can only move to the celln - 1, a tank in the cell 1 can only move to the cell 2). If a tank takes damage for the second time, it's counted as destroyed and never moves again. The tanks move only when they are damaged for the first time, they do not move by themselves.

Help Slava to destroy all tanks using as few bombs as possible.

Input

The first line contains a single integer n (2 ≤ n ≤ 100 000) — the size of the map.

Output

In the first line print m — the minimum number of bombs Slava needs to destroy all tanks.

In the second line print m integers k₁, k₂, ..., k_m. The number k_i means that the i-th bomb should be dropped at the cell k_i.

If there are multiple answers, you can print any of them.

Sample Input

Input

2

Output

3
2 1 2 

Input

3

Output

4
2 1 3 2 

题目意思：坦克在一个有n个格子的地图上，位置不知道。摧毁坦克需要两次，坦克第一次被炸就会移动到左右相邻的一个位置，问你至少需要轰炸
多少次才能把坦克彻底炸毁。
解题思路；当时做这一道题的时候我也没什么思路，就在分析样例，在看第二组样例的时候我发现了一些端倪，因为坦克被炸后会移动到临近的位置
，也就是原来在奇数位置上就会变成在偶数位置，原来在偶数位置就会变成在奇数位置。那么想要得到最少轰炸次数，那么就奇数偶数轮番轰炸三次
就一定会被炸毁的（比如第一次就炸到了，第二次也一定会炸到；第一次炸不到，第二次一定就会炸到，第三次也会炸到）。但为了轰炸次数最少，
一定是先偶数轰炸，再奇数轰炸，最后偶数轰炸，因为偶数会小于等于奇数的数量。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
    int n,i;
    scanf("%d",&n);
    printf("%d\n",n+n/2);
    for(i=1;i<=n;i++)
    {
        if(i%2==0)
        {
            printf("%d ",i);
        }
    }
    for(i=1;i<=n;i++)
    {
        if(i%2==1)
        {
            printf("%d ",i);
        }
    }
    for(i=1;i<=n;i++)
    {
        if(i%2==0)
        {
            printf("%d ",i);
        }
    }
    return 0;
}