Codeforces 527A Playing with Paper

最新推荐文章于 2018-05-25 11:27:06 发布

阑珊灬回忆

最新推荐文章于 2018-05-25 11:27:06 发布

阅读量613

点赞数

CC 4.0 BY-SA版权

文章标签： Codeforces

本文链接：https://blog.youkuaiyun.com/haoliang94/article/details/44405713

本文介绍了一个基于数学和编程的问题，通过不断将矩形纸张转化为更小的正方形来计算能制作的船只数量。文章提供了一个具体的实现代码，并分享了作者在解决问题过程中的错误及教训。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

$\text{[math]}$

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

Note

Pictures to the first and second sample test.

$\text{[math]}$

错了两次。。第一次是long long int 没用，无奈第三个数据爆了。。第二次是没写好while(m!=1&&n%m!=0) 写成或了。结果导致了在刚好可以整除的时候就报错了，还是太粗心了。还是要仔细仔细再仔细啊

AC代码：

#include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cstdio>
#include<set>
#include<map>
#include<vector>
#include<cstring>
#include<stack>
#include<cmath>
#include<queue>
#define INF 0x0f0f0f0f
using namespace std;

int main()
{
	long long i,j,k,l,m,n,t;
	long long ans=0;
	scanf("%I64d%I64d",&n,&m);
	if(n<m)
	{
		t=n;
		n=m;
		m=t;
	}
	while(m!=1&&n%m!=0)
	{
		ans+=n/m;
		i=n;
		j=m;
		n=j;
		m=i%j;
	}
	ans+=n/m;
	printf("%I64d\n",ans);
}