A continued fraction of height n is a fraction of form . You are given two rational numbers, one is represented as and the other one is represented as a finite fraction of height n. Check if they are equal.
The first line contains two space-separated integers p, q (1 ≤ q ≤ p ≤ 1018) — 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 integersa1, a2, ..., an (1 ≤ ai ≤ 1018) — 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.
Print "YES" if these fractions are equal and "NO" otherwise.
9 4 2 2 4
YES
9 4 3 2 3 1
YES
9 4 3 1 2 4
NO
In the first sample .
In the second sample .
In the third sample .
题解:此题刚开始做时以为是double比较精度,结果wa到死,结果wa了几次,再看看题目,妈蛋看错了,是判断分数相等,对于公式推导还是比较简单,关键点是溢出问题的解决,太年轻了,刚开始没考虑到溢出问题,wa到死,后来测了一波100个111,竟然有负数,才发现这个问题,溢出直接NO总的来说比较水吧,拿上代码一目了然。
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <iomanip>
#include <cmath>
#include <iostream>
#include <set>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>
#include <limits>
using namespace std;
typedef long long LL;
const double PI = acos(-1);
const double eps = 1e-18;
const int INF = 0x3f3f3f3f;
const int MAXN = 500+20;
const int MAXM = 10000000;
const int MOD = 1000000007;
#define CLR(a,b) memset((a),(b),sizeof(a))
template<typename T>T minn(T a,T b,T c){return (a=(a>b?b:a))>c?c:a;}
template<typename T>T maxx(T a,T b,T c){return (a=(a>b?a:b))>c?a:c;}
LL s[100];
LL cal(LL x,LL y)
{
for(LL t;t = x%y;x=y,y=t);
return y;
}
int main()
{
LL p,q,a,b;
int n;
while(cin >> p >> q)
{
cin >> n;
bool flag=true;
for(int i = 0;i < n;++ i)
cin >> s[i];
a = 1;
b = s[n-1];
LL tmp = cal(p,q);
p/=tmp;
q/=tmp;
for(int i = n-2;i >= 0;-- i)
{
LL t = b*s[i]+a;
a = b;
b = t;
if(b<=0)//溢出是处理一下就行了
{
flag=false;
break;
}
}
if(flag&&b == p&&q == a)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
}