跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1264. Complicated GCD

  • ID: 1270
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:入门
  • 上传者:
  • 数学
  • 数论
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

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 b are 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


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 747 题。保留原作者与原赛事署名。