CodeForces 664A Complicated GCD

最新推荐文章于 2019-02-02 13:41:39 发布

Dacc123

最新推荐文章于 2019-02-02 13:41:39 发布

阅读量858

点赞数

分类专栏： CF 文章标签： codeforces

本文链接：https://blog.csdn.net/dacc123/article/details/51279092

版权

CF 专栏收录该内容

52 篇文章 0 订阅

订阅专栏

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\n");return 0;}
    else{
        for(int i=0;i<len1;i++){
            if(a[i]!=b[i]){
                printf("1\n");return 0;
            }
        }
        for(int i=0;i<len1;i++)
        printf("%c",a[i]);
        cout<<endl;
        return 0;
    }

}


            
            

           
           