664A - Complicated GCD - CodeForces Solution

math number theory *800

Please click on ads to support us..

Python Code: 

a, b = map(str, input().split())
if a==b:
    print(a)
else:
    print("1")

C++ Code: 

#include<bits/stdc++.h>
using namespace std;
int main()
{
     string s1,s2;
     cin>>s1>>s2;
     if(s1==s2)cout<<s1<<endl;
     else cout<<1<<endl;
}


Comments

Submit
0 Comments
More Questions

1475E - Advertising Agency
1345B - Card Constructions
1077B - Disturbed People
653A - Bear and Three Balls
794A - Bank Robbery
157A - Game Outcome
3B - Lorry
1392A - Omkar and Password
489A - SwapSort
932A - Palindromic Supersequence
433A - Kitahara Haruki's Gift
672A - Summer Camp
1277A - Happy Birthday Polycarp
577A - Multiplication Table
817C - Really Big Numbers
1355A - Sequence with Digits
977B - Two-gram
993A - Two Squares
1659D - Reverse Sort Sum
1659A - Red Versus Blue
1659B - Bit Flipping
1480B - The Great Hero
1519B - The Cake Is a Lie
1659C - Line Empire
515A - Drazil and Date
1084B - Kvass and the Fair Nut
1101A - Minimum Integer
985D - Sand Fortress
1279A - New Year Garland
1279B - Verse For Santa