Codeforce - 267 - A. Subtractions

A. Subtractions
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
You’ve got two numbers. As long as they are both larger than zero, they go through the same operation: subtract the lesser number from the larger one. If they equal substract one number from the another. For example, one operation transforms pair (4,17) to pair (4,13), it transforms (5,5) to (0,5).

You’ve got some number of pairs (ai, bi). How many operations will be performed for each of them?

Input
The first line contains the number of pairs n (1  ≤  n  ≤  1000). Then follow n lines, each line contains a pair of positive integers ai, bi (1  ≤  ai,  bi  ≤  109).

Output
Print the sought number of operations for each pair on a single line.

Examples
input
2
4 17
7 987654321
output
8
141093479

题意：大数减小数，直到其中一个数为 0 为止。求步数。

AC代码：

#include <iostream>using namespace std;int main(){    int n;    cin>>n;    while (n--)    {        int a,b;        cin>>a>>b;        int ans=0;        int mn=min(a,b),mx=max(a,b);        int ansmn=mn,ansmx=mx;        do        {            ans+=(mx/mn);            mx%=mn;            ansmn=min(mx,mn);ansmx=max(mx,mn);            mn=ansmn;mx=ansmx;        }while (mx && mn);        cout<<ans<<endl;    }}