zoukankan      html  css  js  c++  java
  • Codeforces Round #353 (Div. 2) A

    弱到只会写div2的A题...

    题面:
    A. Infinite Sequence
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Vasya likes everything infinite. Now he is studying the properties of a sequence s, such that its first element is equal to a (s1 = a), and the difference between any two neighbouring elements is equal to c (si - si - 1 = c). In particular, Vasya wonders if his favourite integer bappears in this sequence, that is, there exists a positive integer i, such that si = b. Of course, you are the person he asks for a help.

    Input

    The first line of the input contain three integers ab and c ( - 109 ≤ a, b, c ≤ 109) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.

    Output

    If b appears in the sequence s print "YES" (without quotes), otherwise print "NO" (without quotes).

    Examples
    input
    1 7 3
    
    output
    YES
    
    input
    10 10 0
    
    output
    YES
    
    input
    1 -4 5
    
    output
    NO
    
    input
    0 60 50
    
    output
    NO
    
    Note

    In the first sample, the sequence starts from integers 147, so 7 is its element.

    In the second sample, the favorite integer of Vasya is equal to the first element of the sequence.

    In the third sample all elements of the sequence are greater than Vasya's favorite integer.

    In the fourth sample, the sequence starts from 050100, and all the following elements are greater than Vasya's favorite integer.

    #include <iostream>
    #include <algorithm>
    
    
    
    
    using namespace std;
    
    
    
    
    int a,b,c;
    
    
    
    
    int main()
    {
        cin>>a>>b>>c;
        int flag=1;
        if(c==0)
        {
            if(a==b)
                flag=0;
        }
        else
        {
            if((b-a)%c == 0 && (b-a)/c >=0)
                flag=0;
            }
            if(flag)
                cout<<"NO"<<endl;
            else
                cout<<"YES"<<endl;
        return 0;
    }
    
    下次我要做B!

  • 相关阅读:
    SQL Server2000的ROWGUID 列
    数据库主键设计之思考
    SQL Server 索引结构及其使用(四)
    一些基础表单的验证 函数
    JS加密编码算法
    textarea自动增高并隐藏滚动条
    HTML之打开/另存为/打印/刷新/查看原文件等按钮的代码
    Code Snippets
    jQuery验证框架
    Jquery 扩展验证
  • 原文地址:https://www.cnblogs.com/gfvod/p/5548315.html
Copyright © 2011-2022 走看看