CF305B.Continued Fractions

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

A continued fraction of height nn 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 nn . Check if they are equal.

输入格式

The first line contains two space-separated integers p,qp,q (1<=q<=p<=1018)(1<=q<=p<=10^{18}) — the numerator and the denominator of the first fraction.

The second line contains integer nn (1<=n<=90)(1<=n<=90) — the height of the second fraction. The third line contains nn space-separated integers a1,a2,...,ana_{1},a_{2},...,a_{n} (1<=ai<=1018)(1<=a_{i}<=10^{18}) — 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 %I64d specifier.

输出格式

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

输入输出样例

  • 输入#1

    9 4
    2
    2 4
    

    输出#1

    YES
    
  • 输入#2

    9 4
    3
    2 3 1
    

    输出#2

    YES
    
  • 输入#3

    9 4
    3
    1 2 4
    

    输出#3

    NO
    

说明/提示

In the first sample .

In the second sample .

In the third sample .

首页