CF 869 B. The Eternal Immortality【数学】
来源:互联网 发布:游戏寻路算法 编辑:程序博客网 时间:2024/06/05 01:42
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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
2
input
0 10
output
0
input
107 109
output
2
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<cstring>#include<cmath>#include<cstdio>#include<iomanip>#include<stack>#include<queue>#include<algorithm>#include<map>#include<set>#include<string>#include<vector>#include<functional>#include<ctime>using namespace std;#define LL long long int#define INF 0x3f3f3f3fint a[10000];const int maxn = 1e5 + 10;int b[maxn];int main(){ LL a, b; while (cin >> a >> b) { if (b - a >= 10) { cout << "0" << endl; continue;; } else { LL ans = 1; for (LL i = a+1; i <= b; i++) { ans *= i; ans %= 10; } cout << ans << endl; } } return 0;}
- CF 869 B. The Eternal Immortality【数学】
- B. The Eternal Immortality
- Codeforces 869B. The Eternal Immortality
- CodeForces 869B The Eternal Immortality
- codeforces 869B The Eternal Immortality
- codeforces 869B The Eternal Immortality
- codeforces—— 869B —— The Eternal Immortality
- Codeforce The Eternal Immortality
- Codeforces869B The Eternal Immortality
- Codeforces Round #439 (Div. 2) B. The Eternal Immortality
- Codeforces Round #439 (Div. 2) B. The Eternal Immortality
- Codeforces Round #439 (Div. 2) B. The Eternal Immortality
- codeforces The Eternal Immortality 题解
- codeforces 869BThe Eternal Immortality
- Codeforces Round #439 (Div. 2) The Eternal Immortality
- Codeforces Round #439 (Div. 2) The Eternal Immortality
- CF 894 B/C 数学
- cf#328-B. The Monster and the Squirrel-水题+数学规律
- r入门练习(一)
- 最小的k个数和multiset\reverse_iterator\const_iterator用法
- 6. 单件模式
- CF 869 A. The Artful Expedient【异或】
- 浅谈分布式服务协调技术 Zookeeper
- CF 869 B. The Eternal Immortality【数学】
- GiD初步使用
- Java工程师路线规划
- sql语句汇总
- Qt5美化界面1——标签设置图片(含GIF)
- 实数系与实数定理
- 为大家分享daloradius+freeradius+openvpn的安装脚本
- thinkphp5的入门学习(1)引入数据列表及其操作
- 商品秒杀流程图和功能图