Codeforces--675A--Infinite Sequence

229 篇文章 0 订阅
73 篇文章 0 订阅

题目描述:
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 b appears 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.
输入描述:
The first line of the input contain three integers a, b 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.
输出描述:
If b appears in the sequence s print “YES” (without quotes), otherwise print “NO” (without quotes).
输入:
1 7 3
10 10 0
1 -4 5
0 60 50
输出:
YES
YES
NO
NO
题意:
给出首项a,给出公差c,问b是否在这个等差数列里。
题解
暴力模拟即可
代码:

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

int main(){
    int a,b,c;
    while(scanf("%d%d%d",&a,&b,&c)!=EOF){
        if(c == 0){
            if(a == b) printf("YES\n");
        else printf("NO\n");
        }
        else if(a == b){
            printf("YES\n");
        }
        else{
            if(c > 0){
                bool flag = false;
                for(;;){
                    a += c;
                    if(a == b){
                        flag = true;
                        break;
                    }
                    else if(a > b){
                        break;
                    }
                }
                if(flag) printf("YES\n");
                else printf("NO\n");
            }
            else{
                bool flag = false;
                for(;;){
                    a += c;
                    if(a == b){
                        flag = true;
                        break;
                    }
                    else if(a < b){
                        break;
                    }
                }
                if(flag) printf("YES\n");
                else printf("NO\n");
            }
        }
    }
    return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值