Problem hidden
|This problem was hidden by Editorial Board member probably because it has incorrect language|version or invalid test data, or description of the problem is not clear.|

RGB8012 - Богино ХИЕХ

Өгөгдсөн хоёр тооны ХИЕХ ол. ХИЕХ - хамгийн их ерөнхий хуваагч.

Input

30000-аас хэтрэхгүй 2 тоо зайгаар тусгаарлагдан өгөгдөнө.

Output

ХИЕХ

Example

Input:
18 12

Output:
6

Нэмсэн:Bataa
Огноо:2010-01-05
Хугацааны хязгаарлалт:1s
Эх кодын хэмжээний хязгаарлалт:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Програмчлалын хэлүүд:ADA95 ASM32 ASM64 BASH BF C CSHARP C++ 4.3.2 CPP CPP14 C99 CLPS LISP sbcl LISP clisp D ERL FORTRAN HASK ICON ICK JAVA JS-RHINO LUA NEM NICE OCAML PAS-GPC PAS-FPC PERL PHP PIKE PRLG-swi PYTHON RUBY SCALA SCM guile SCM qobi ST TCL TEXT WHITESPACE

hide comments
2024-01-19 11:47:06
#include<iostream>
using namespace std;

int main() {
int a,b,c;
cin >> a >> b;
while(b != 0) {
int c = b;
b = a % b;
a = c;
}
cout << a;
return 0;
}
2022-05-16 08:47:32
a, i = set(), 1
while i <= 10000:
a.add(i)
i <<= 1

N=int(input())
if N in a:
print("Yes")
else:
print("No")
2020-08-31 04:31:46
#include<iostream>
using namespace std;
int main()
{
long long int a,b,c,s=0,i;
cin>>a>>b;
while(a!=b){
if(a>b)a=a-b;
else b=b-a;
}
cout<<a<<endl;
}
Erheegiin bodolt zow shvv ci buruu haraad bnaa
2020-04-30 06:11:16
Erhee chinii bodolt buruu bainaa garaasa 125 122 geed oghoor 3 garhiimvv? 3 gesen too ale alind n huwaagdahgq baigaazdee?
2015-03-21 11:44:05 Erhee
#include <stdio.h>

int a, b;

int main() {
scanf("%d%d", &a, &b);
while(a != b) {
if(a > b) a = a - b;
else b = b - a;
}
printf("%d", a);
return 0;
}
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.