codeforces 527A Playing with Paper

点击打开链接

A. Playing with Paper

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard 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

input

2 1

output

2

input

10 7

output

6

input

1000000000000 1

output

1000000000000

Note

Pictures to the first and second sample test.

题意：给出一个矩形，求能分割出多少个正方形。分析：长的除以短的就是这个矩形能割出几个正方形，如果剩下一部分，就又回到了原来的问题。

注意超出了int的范围！

#include<stdio.h>#include<algorithm>using namespace std;int main(){    long long a,b;    scanf("%I64d%I64d",&a,&b);    if(a<b)    {        long long w=a;        a=b;        b=w;    }    long long s=0;    while(a%b)    {        s+=a/b;        long long m=max(b,a%b);        long long n=min(b,a%b);        a=m;        b=n;    }    printf("%I64d\n",s+a/b);    return 0;}