The Eternal Immortality(CodeForces - 869B)同余定理

最新推荐文章于 2018-08-20 08:08:35 发布

Allen_0526

最新推荐文章于 2018-08-20 08:08:35 发布

阅读量171

点赞数

分类专栏：思维题文章标签：同余定理

本文链接：https://blog.csdn.net/qq_38984851/article/details/81474590

版权

思维题专栏收录该内容

13 篇文章 0 订阅

订阅专栏

第五次题解

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 ≤ 1018).

Output

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

Examples

Input

2 4

Output

Input

0 10

Output

Input

107 109

Output

Note

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.

思路:本题用到了同余定理,因为数据量太大,所以对每个数据进行求余.

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <map>
#include <cstring>
using namespace std;
typedef long long LL;
int main()
{
    LL a,b,ans;
    while(~scanf("%lld%lld",&a,&b))
    {
        ans=1;
        if(b-a>=5)
            printf("0\n");
        else
        {
            for(LL i=b; i>a; i--)
            {
                ans=((ans%10)*(i%10))%10;
            }
            printf("%lld\n",ans);
        }
    }
    return 0;
}