Codeforces Round #184 (Div. 2) B. Continued Fractions

  = ,不断的在两边乘q，移向可知每次左边的表达式都可以化为同一形式。

下面是代码：

#include<iostream>
using namespace std;
typedef long long ll;
int main()
{
    ll p,q,n,a,t;
    cin>>p>>q>>n;
    while(n)
    {
        cin>>a;
        if(q == 0 || a > (p/q)) break;
        t = q;
        q = p - a*q;
        p = t;
        n--;
    }
    if(n || q) cout<<"NO"<<endl;
    else cout<<"YES"<<endl;
    return 0;
}