A. I'm bored with life
2017-07-03 14:38
246 查看
A. I’m bored with life
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Holidays have finished. Thanks to the help of the hacker Leha, Noora managed to enter the university of her dreams which is located in a town Pavlopolis. It’s well known that universities provide students with dormitory for the period of university studies. Consequently Noora had to leave Vičkopolis and move to Pavlopolis. Thus Leha was left completely alone in a quiet town Vičkopolis. He almost even fell into a depression from boredom!
Leha came up with a task for himself to relax a little. He chooses two integers A and B and then calculates the greatest common divisor of integers “A factorial” and “B factorial”. Formally the hacker wants to find out GCD(A!, B!). It’s well known that the factorial of an integer x is a product of all positive integers less than or equal to x. Thus x! = 1·2·3·…·(x - 1)·x. For example 4! = 1·2·3·4 = 24. Recall that GCD(x, y) is the largest positive integer q that divides (without a remainder) both x and y.
Leha has learned how to solve this task very effective. You are able to cope with it not worse, aren’t you?
Input
The first and single line contains two integers A and B (1 ≤ A, B ≤ 109, min(A, B) ≤ 12).
Output
Print a single integer denoting the greatest common divisor of integers A! and B!.
Example
input
4 3
output
6
Note
Consider the sample.
4! = 1·2·3·4 = 24. 3! = 1·2·3 = 6. The greatest common divisor of integers 24 and 6 is exactly 6.
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Holidays have finished. Thanks to the help of the hacker Leha, Noora managed to enter the university of her dreams which is located in a town Pavlopolis. It’s well known that universities provide students with dormitory for the period of university studies. Consequently Noora had to leave Vičkopolis and move to Pavlopolis. Thus Leha was left completely alone in a quiet town Vičkopolis. He almost even fell into a depression from boredom!
Leha came up with a task for himself to relax a little. He chooses two integers A and B and then calculates the greatest common divisor of integers “A factorial” and “B factorial”. Formally the hacker wants to find out GCD(A!, B!). It’s well known that the factorial of an integer x is a product of all positive integers less than or equal to x. Thus x! = 1·2·3·…·(x - 1)·x. For example 4! = 1·2·3·4 = 24. Recall that GCD(x, y) is the largest positive integer q that divides (without a remainder) both x and y.
Leha has learned how to solve this task very effective. You are able to cope with it not worse, aren’t you?
Input
The first and single line contains two integers A and B (1 ≤ A, B ≤ 109, min(A, B) ≤ 12).
Output
Print a single integer denoting the greatest common divisor of integers A! and B!.
Example
input
4 3
output
6
Note
Consider the sample.
4! = 1·2·3·4 = 24. 3! = 1·2·3 = 6. The greatest common divisor of integers 24 and 6 is exactly 6.
#include<stdio.h> long long jie(long long n) { long long s=1; for(long long i=1;i<=n;i++) s*=i; return s; } int main() { long long n,m; while(~scanf("%lld %lld",&n,&m)) { long long s=0; if(n>m) { s=jie(m); } else s=jie(n); printf("%lld\n",s); } return 0; }
相关文章推荐
- codeforces 822 A I'm bored with life
- 【Codeforces Round #422 (Div. 2) A】I'm bored with life
- I'm bored with life
- A. I'm bored with life
- CodeForces - 822A I'm bored with life(阅读题)
- codeforces 822A(I'm bored with life) Java
- Codeforces Round #422 A. I'm bored with life
- Codeforces Round #422 (Div. 2) A I'm bored with life
- I'm bored with life
- Codeforces822 A I'm bored with life
- Codeforces Round #422 (Div. 2) A. I'm bored with life
- In Life It's Not Where You Go-It's Who You Travel With.
- [奋斗篇STRUGGLE]Learn with whole Life 一生的学习
- Manage Your Life with Outlook For Dummies
- [成功篇SUCCESS]Learn with whole Life 一生的学习
- Life with qmail中文版 PDF格式
- [React] Stop Memory Leaks with componentWillUnmount Lifecycle Method in React
- Life with qmail -- 中文版(英文版本16 Aug 2003)
- centos 按照http://lifewithqmail.org/lwq.html安装qmail遇到的问题
- Life of an Oracle I/O: tracing logical and physical I/O with systemtap