CF Playing with Paper

本文介绍了一个关于折纸游戏的算法问题,通过不断将矩形纸张转化为正方形纸张来制作纸船,直到无法再制作为止。文章提供了一段C++代码实现,用于计算在数学课上利用特定尺寸的纸张可以制作多少只纸船。

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.

Sample test(s)
Input
2 1
Output
2
Input
10 7
Output
6
Input
1000000000000 1
Output
1000000000000


 1 #include <iostream>
 2 #include <cstdio>
 3 using    namespace    std;
 4 
 5 int    main(void)
 6 {
 7     long    long    count;
 8     long    long    a,b;
 9 
10     while(scanf("%lld%lld",&a,&b) != EOF)
11     {
12         count = 0;
13         if(!(a % b))
14         {
15             cout << a / b << endl;
16             continue;
17         }
18 
19         int    flag = 1;
20 
21         while((a % b))
22         {
23             count += a / b;
24             a %= b;
25             if(a < b)
26                 swap(a,b);
27             if(a % b == 0)
28                 count += a / b;
29         }
30         cout << count << endl;
31     }
32 
33     return    0;
34 }

 

转载于:https://www.cnblogs.com/xz816111/p/4394650.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值