Codeforces Round #439 (Div. 2) B. The Eternal Immortality
来源:互联网 发布:阈值分割算法 matlab 编辑:程序博客网 时间:2024/06/04 19:41
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 integera, 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 ofb! years, that is, . Note that whenb ≥ 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 is2;
In the second example, the last digit of is0;
In the third example, the last digit of is2.
题意:
两个数阶乘取商 求商的最后一位
有坑点!!!!(需要longlong类型 会超 int 说多了都是泪~~)
思路 模拟过程就好 不难发现如果两个数字差距超过5 那么第一个数字的阶乘一定是第二个数字阶乘的十倍+ 所以商最后一位一定是0
特判下这个就好其他地方 如果 超过五 也会增加十倍 具体可以 模拟1~9的阶乘不难发现 所以 如果两个数字 %=10 之后仍然在5的两侧 那么一定 差十倍 输出0
对于剩下的情况 就可以for来写了~~
#include <iostream>#include <string>#include <cstdio>using namespace std;const int N = 50005;int main(){long long a, b;scanf("%I64d%I64d",&a,&b);if ((b - a) >= 5 ) {printf("0\n");}else {a %= 10; b %= 10;if (a < 5 && b > 5 || a > 5 && b < 5) {printf("0\n");}else {long long ans = 1;for (int i = a + 1; i <= b; i ++) {ans *= i;}printf("%I64d\n",ans%10);}}}
- 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 Round #439 (Div. 2) The Eternal Immortality
- Codeforces Round #439 (Div. 2) The Eternal Immortality
- Codeforces 869B. The Eternal Immortality
- CodeForces 869B The Eternal Immortality
- codeforces 869B The Eternal Immortality
- codeforces 869B The Eternal Immortality
- B. The Eternal Immortality
- codeforces The Eternal Immortality 题解
- codeforces—— 869B —— The Eternal Immortality
- CF 869 B. The Eternal Immortality【数学】
- Codeforce The Eternal Immortality
- Codeforces869B The Eternal Immortality
- codeforces 869BThe Eternal Immortality
- Codeforces Beta Round #57 (Div. 2) D. Eternal Victory
- 【Codeforces Round #398 (Div. 2)】Codeforces 767B The Queue
- oracle全文检索(个人记)
- [自译]iPhone X的AR引擎对设计师意味着什么?
- uboot初始环境变量配置
- 数据库系统原理之锁与故障
- Jmeter之app性能测试(ios,android)
- Codeforces Round #439 (Div. 2) B. The Eternal Immortality
- pyspark环境配置
- iOS开发 使用webview加载文档
- instanceof关键字的使用
- 1030. 完美数列(25)
- java-冒泡排序
- 牛客网---2016---楚楚街解密
- 二叉树非递归遍历
- 机器学习-特征工程