Codeforces 697A - Pineapple Incident

本文描述了一个有趣的编程问题:一只能够像斗牛犬一样吠叫的松果。它首次吠叫的时间、吠叫间隔以及巴尼计划吃掉松果的时间被设定为变量。任务是判断在巴尼打算吃掉松果的时候,它是否正在吠叫。文章提供了输入输出样例以及一种解决方案。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

A. Pineapple Incident
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Ted has a pineapple. This pineapple is able to bark like a bulldog! At time t (in seconds) it barks for the first time. Then every s seconds after it, it barks twice with 1 second interval. Thus it barks at times tt + st + s + 1t + 2st + 2s + 1, etc.

Barney woke up in the morning and wants to eat the pineapple, but he can't eat it when it's barking. Barney plans to eat it at time x (in seconds), so he asked you to tell him if it's gonna bark at that time.

Input

The first and only line of input contains three integers ts and x (0 ≤ t, x ≤ 1092 ≤ s ≤ 109) — the time the pineapple barks for the first time, the pineapple barking interval, and the time Barney wants to eat the pineapple respectively.

Output

Print a single "YES" (without quotes) if the pineapple will bark at time x or a single "NO" (without quotes) otherwise in the only line of output.

Examples
input
3 10 4
output
NO
input
3 10 3
output
YES
input
3 8 51
output
YES
input
3 8 52
output
YES
Note

In the first and the second sample cases pineapple will bark at moments 31314, ..., so it won't bark at the moment 4 and will bark at the moment 3.

In the third and fourth sample cases pineapple will bark at moments 311121920272835364344515259, ..., so it will bark at both moments 51 and 52.

通过写出条件可以得知,所要求的Xn一定属于以下区间的时候是YES

t<=x1<=t+s<=x2<=t+s+1<=x3<=t+2s....

可以得出

0<=x-t-n*s<=s 即当(x-t)%s==0时或0<=x-t<=1是在bark time的

还有一种情况是x<t时是一定不在的,注意特判一下就好。

#include<stdio.h>
#include<iostream>
using namespace std;
int main()
{


    int t,x,s;
    cin>>t>>s>>x;
    if (((x-t)%s==0&&x-t>=0)||x>=t&&(x-t-1)%s==0&&(x-t-1)!=0)
    {
        printf("YES");
    }else
    {
        printf("NO");
    }

}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值