zoukankan      html  css  js  c++  java
  • Codeforces Round #347 (Div.2)_A. Complicated GCD

    题目链接:http://codeforces.com/contest/664/problem/A

    A. Complicated GCD
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Greatest common divisor GCD(a, b) of two positive integers a and b is equal to the biggest integer d such that both integers a and bare divisible by d. There are many efficient algorithms to find greatest common divisor GCD(a, b), for example, Euclid algorithm.

    Formally, find the biggest integer d, such that all integers a, a + 1, a + 2, ..., b are divisible by d. To make the problem even more complicated we allow a and b to be up to googol, 10100 — such number do not fit even in 64-bit integer type!

    Input

    The only line of the input contains two integers a and b (1 ≤ a ≤ b ≤ 10100).

    Output

    Output one integer — greatest common divisor of all integers from a to b inclusive.

    Examples
    input
    1 2
    output
    1
    input
    61803398874989484820458683436563811772030917980576 61803398874989484820458683436563811772030917980576
    output
    61803398874989484820458683436563811772030917980576

    解题报告:

    可以看到,两个字符串相同,输出这个字符串,否则输出1;

    #include <stdio.h>
    #include <iostream>
    #include <string>
    
    using namespace std;
    
    int main()
    {
        string a,b;
        cin>>a>>b;
        if(a==b) cout<<a<<endl;
        else cout<<"1"<<endl;
        return 0;
    }
  • 相关阅读:
    HDU6060 RXD and dividing
    Knapsack in a Globalized World --多重完全背包
    hdu 6058 Kanade's sum
    矩形面积 HDU
    Bridge Across Islands POJ
    Manors HDU
    Harry Potter and J.K.Rowling HDU
    Polygons HDU
    Jungle Outpost HDU
    CRB and Farm HDU
  • 原文地址:https://www.cnblogs.com/TreeDream/p/5405863.html
Copyright © 2011-2022 走看看