Continued Fractions

最新推荐文章于 2022-10-03 15:46:11 发布

SCUT_Pein

最新推荐文章于 2022-10-03 15:46:11 发布

阅读量1.5k

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/scut_pein/article/details/8950559

版权

数论专栏收录该内容

27 篇文章 0 订阅

订阅专栏

A continued fraction of height n is a fraction of form $\text{[math]}$ . You are given two rational numbers, one is represented as $\text{[math]}$ and the other one is represented as a finite fraction of height n. Check if they are equal.

Input

The first line contains two space-separated integers p, q (1 ≤ q ≤ p ≤ 10¹⁸) — the numerator and the denominator of the first fraction.

The second line contains integer n (1 ≤ n ≤ 90) — the height of the second fraction. The third line contains n space-separated integersa₁, a₂, ..., a_n (1 ≤ a_i ≤ 10¹⁸) — the continued fraction.

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64dspecifier.

Output

Print "YES" if these fractions are equal and "NO" otherwise.

Sample test(s)

 input
 9 422 4
 output
 YES
 input
 9 432 3 1
 output
 YES
 input
 9 431 2 4
 output
 NO

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
long long int  A[108];
#define inff 1e-8
#define inffff 1e-15
int main()
{
	//freopen("in.txt","r",stdin);
	long long int  p,q;
	while(scanf("%lld%lld",&p,&q)==2)
	{
		int n;
		scanf("%d",&n);
		for(int i=1;i<=n;i++)
		{
			scanf("%lld",&A[i]);
		}
		bool flag = false;
		for(int i=1;i<=n;i++)
		{
			if(q == 0)
			{
				flag = true;
				break;
			}
			if(p / q < A[i])
			{
				flag = true;
				break;
			}
			p -= q*A[i];
			long long int temp = p;
			p = q;
			q = temp;
		}
		if(q==0 && !flag) printf("YES\n");
		else printf("NO\n");
	}
	return 0;
}