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.
InputThe 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
2
0 10
0
107 109
2
题意就是要你求a!/b!
直接模拟肯定是TLE的,但“仔细观察”一下,你会发现一旦乘到10,后面的个位就会始终为0.
差了一些模拟,没有发现最重要的规律,还是不要手懒啊
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll a,b;
while(~scanf("%lld%lld",&a,&b)) {
if((b-a)>=10) {
printf("0\n");
continue;
}
ll sum=1;
for(ll i=a+1; i<=b; i++) {
sum*=i;
sum=sum%10;
}
printf("%lld\n",sum);
}
}