Codeforces--869B--The Eternal Immortality

题目描述：
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.
输入描述:
The first and only line of input contains two space-separated integers a and b (0 ≤ a ≤ b ≤ 1018).
输出描述:
Output one line containing a single decimal digit — the last digit of the value that interests Koyomi.
输入：
2 4
0 10
107 109
输出：
2
0
2
题意：
输出b！/ a! 的最后一位 。
题解：
瞎搞一下
代码：

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

typedef long long ll;
ll a,b;

int main(){
    while(scanf("%I64d%I64d",&a,&b)!=EOF){
        ll n = a % 100;
        ll m = b % 100;
        //cout<<b-a<<endl;
        if(a == b) printf("1\n");
        else if(n > m) printf("0\n");
        else if((b - a) >= 10) printf("0\n");
        else{
            ll ans = 1;
            ll c = m - n;
            for(int i = m; c > 0; i --){
                ans *= i;
                ans %= 10;
                c --;
            }
            printf("%d\n",ans);
        }
    }
    return 0;
}