zoukankan      html  css  js  c++  java
  • A. I'm bored with life(Round422)

    A. I'm bored with life
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard 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.

    hint:这题太简单了吧。。。

    在纸上写一下就能知道这个题目是干嘛的了。。。可能聚聚们的一眼秒吧

     1 #include<iostream>
     2 #include<cstdio>
     3 #include<stdlib.h>
     4 #include<string>
     5 #include<string.h>
     6 #include<vector>
     7 #include<stack>
     8 #include<queue>
     9 #include<map>
    10 #include<cmath>
    11 using namespace std;
    12 #define pi acos(-1.0)
    13 typedef long long ll;
    14 
    15 
    16 ll solve(ll n){
    17     ll sum = 1;
    18     for(ll i = 1; i <= n; i++) sum *= i;
    19     return sum;
    20 }
    21 int main(){
    22     ll a, b;
    23     cin >> a >> b;
    24     ll x = a;
    25     if(x > b) x = b;
    26     cout << solve(x) << endl;
    27 
    28     return 0;
    29 }
  • 相关阅读:
    Hibernate Annotation (Hibernate 注解)
    org/objectweb/asm/Type异常解决办法
    Spring3 MVC 总结(转)
    Spring mvc 3 在controller和视图之间传递参数
    各种树tree的js控件优缺点
    Spring MVC 的请求参数获取的几种方法
    解决javax.persistence.OneToMany.orphanRemoval()Z异常办法
    ModelAndView返回自己的用法
    javax.persistence.Entity异常解决方法
    调用http://WebXml.com.cn/的webservice获取手机号段信息
  • 原文地址:https://www.cnblogs.com/ledoc/p/7126995.html
Copyright © 2011-2022 走看看