大家好，又见面了，我是全栈君。
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.
![Codeforces Round #296 (Div. 2) A. Playing with Paper[通俗易懂]](http://espresso.codeforces.com/d08456364e85fba94b8052a28e15a78b332e20e7.png)
![Codeforces Round #296 (Div. 2) A. Playing with Paper[通俗易懂]](http://javaforall.cn/wp-content/themes/justnews/themer/assets/images/lazy.png)
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?
The first line of the input contains two integers a, b (1 ≤ b < a ≤ 1012) — the sizes of the original sheet of paper.
Print a single integer — the number of ships that Vasya will make.
2 1
2
10 7
6
1000000000000 1
1000000000000
Pictures to the first and second sample test.
![Codeforces Round #296 (Div. 2) A. Playing with Paper[通俗易懂]](http://espresso.codeforces.com/8b51f4e6a6b5bfbfc7a50451f2bd16fe45c6dbac.png)
题意：给一a * b的板，问依照题中所给方法可以裁成多少正方形。
解析：直接递归即解。
AC代码：
#include <cstdio>
#include <cstring>
#define LL long long
LL solve(LL a, LL b){
if(b == 1) return a;
if(a % b == 0) return a / b; //開始忘了考虑整除。RE on test #7
return solve(b, a % b) + (a / b);
}
int main(){
// freopen("in.txt", "r", stdin);
LL a, b;
while(scanf("%lld%lld", &a, &b)==2){
printf("%lld\n", solve(a, b));
}
return 0;
}
发布者：全栈程序员-用户IM，转载请注明出处：https://javaforall.cn/116387.html原文链接：https://javaforall.cn
【正版授权，激活自己账号】： Jetbrains全家桶Ide使用，1年售后保障，每天仅需1毛
【官方授权 正版激活】： 官方授权 正版激活 支持Jetbrains家族下所有IDE 使用个人JB账号...
