B - Weird Subtraction Process (Educational Codeforces Round 39 (Rated for Div. 2))

题目描述
You have two variables $a$ and $b$. Consider the following sequence of actions performed with these variables:

1. If $a=0$ or $b=0$, end the process. Otherwise, go to step $2$;
2. If $a\ge 2\times b$, then set the value of $a$ to $a-2\times b$, and repeat step $1$. Otherwise, go to step $3$;
3. If $b\ge 2\times a$, then set the value of $b$ to $b-2\times a$, and repeat step $1$. Otherwise, end the process.

Initially the values of $a$ and $b$ are positive integers, and so the process will be finite.
You have to determine the values of $a$ and $b$ after the process ends.
输入描述
The only line of the input contains two integers $n$ and $m$ $(1\le n,m\le 10^{18})$. $n$ is the initial value of variable $a$, and $m$ is the initial value of variable $b$.
输出描述
Print two integers — the values of $a$ and $b$ after the end of the process.

Input

12 5

Output

0 1

Input

31 12

Output

7 12

思路
答案可以很容易地通过欧几里德算法计算出来，但是所有的减法都会被取模代替。
AC代码

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int main()
{
	LL n,m;
	scanf("%lld%lld",&n,&m);
	while(1)
	{
		if(n==0||m==0) break;
		else if(n>=2LL*m) n-=n/(2LL*m)*2LL*m;
		else if(m>=2LL*n) m-=m/(2LL*n)*2LL*n;
		else break;
	}
	printf("%lld %lld\n",n,m);
	return 0;
}