CodeForces 527A. Playing with Paper 【math】

A. Playing with Paper
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
One day Vasya was sitting on a not so interesting Maths lesson and making an origami from a rectangular a mm  ×  b mm sheet of paper (a > b). Usually the first step in making an origami is making a square piece of paper from the rectangular sheet by folding the sheet along the bisector of the right angle, and cutting the excess part.

After making a paper ship from the square piece, Vasya looked on the remaining (a - b) mm  ×  b mm strip of paper. He got the idea to use this strip of paper in the same way to make an origami, and then use the remainder (if it exists) and so on. At the moment when he is left with a square piece of paper, he will make the last ship from it and stop.

Can you determine how many ships Vasya will make during the lesson?

Input
The first line of the input contains two integers a, b (1 ≤ b < a ≤ 1012) — the sizes of the original sheet of paper.

Output
Print a single integer — the number of ships that Vasya will make.

Examples
inputCopy
2 1
output
2
inputCopy
10 7
output
6
inputCopy
1000000000000 1
output
1000000000000
Note
Pictures to the first and second sample test.

思路：本来想的是 temp = a-b; a = max(a-b,b); b=max(a-b,b); 这样模拟每一个次的剪纸过程。但是显然很低效。因为对于三个样例来说 需要进行很多次减法。所以考虑 p = a/b的方式。

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    long long int a,b;
    long long int cnt = 0;
    cin>>a>>b;

    while(a!=b) 
    {
        if(a<b){
            long long int t = a;
            a = b;
            b = t;
        }
        long long int p = a/b;
        cnt +=p;
        a = a-p*b;
        if(a == 0) break;

    } 


    cout<<cnt<<endl;
    return 0;
}