Educational #39B

暴力题

#include "iostream"
#include "iomanip"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#pragma comment(linker, "/STACK:102400000,102400000")
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define mem(a,x) memset(a,x,sizeof(a))
#define step(x) fixed<< setprecision(x)<<
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define ll long long
#define endl ("
")
#define ft first
#define sd second
#define lrt (rt<<1)
#define rrt (rt<<1|1)
using namespace std;
const ll mod=1e9+7;
const ll INF = 1e18+1LL;
const int inf = 1e9+1e8;
const double PI=acos(-1.0);
const int N=1e5+100;

ll a, b;

void step1() {
    if(a==0 || b==0) return;
    else if(a >= 2*b) {
        a %= 2*b;
        step1();
    }
    else if(b >= 2*a) {
         b %= 2*a;
        step1();
    }
}

int main() {
    scanf("%lld %lld", &a, &b);
    step1();
    printf("%lld %lld
", a, b);
    return 0;
}