zoukankan      html  css  js  c++  java
  • CodeForces 664A Complicated GCD

    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
    
    
    
    #include <iostream>
    #include <string.h>
    #include <algorithm>
    #include <math.h>
    #include <stdio.h>
    #include <stdlib.h>
    
    using namespace std;
    char a[200];
    char b[200];
    int main()
    {
        scanf("%s%s",a,b);
        int len1=strlen(a);
        int len2=strlen(b);
        if(len1<len2) {printf("1
    ");return 0;}
        else{
            for(int i=0;i<len1;i++){
                if(a[i]!=b[i]){
                    printf("1
    ");return 0;
                }
            }
            for(int i=0;i<len1;i++)
            printf("%c",a[i]);
            cout<<endl;
            return 0;
        }
    
    }
    



    
    
    
    


  • 相关阅读:
    CSS hacks汇总
    都要靠自己
    不被需要
    我们都是和自己赛跑的人
    其实天底下只有三件事
    开始怀旧了
    JavaScript回调函数陷阱
    郁闷着继续
    清明节悼念逝去亲人
    纯div+css制作的弹出菜单
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228679.html
Copyright © 2011-2022 走看看