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
2
0 10
0
107 109
2
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 求b的阶乘除以a的阶乘的个位数。
思路: 因为a b的取值范围很大,若是简单的暴力一定会超时。 这个题仅仅与最后一位有关,若b-a>=10,这个中间一定会有0的存在,那么个位数一定会是0,如果小于10,就可以暴力求解最后一位。这样时间会降很多。
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
ll a,b;
int main()
{
while(~scanf("%lld%lld",&a,&b))
{
if(b-a>=10)
printf("0\n");
else
{
ll ans,i;
ans=1;i=a+1;
for(i=a+1;i<=b;i++)
{
ans=ans*(i%10);
ans=ans%10;
}
printf("%lld\n",ans);
}
}
return 0;
}