CodeForces-681B.Economy Game

                       B. Economy Game
                  time limit per test1 second
              memory limit per test256 megabytes
                     inputstandard input
                    outputstandard output

Kolya is developing an economy simulator game. His most favourite part of the development process is in-game testing. Once he was entertained by the testing so much, that he found out his game-coin score become equal to 0.

Kolya remembers that at the beginning of the game his game-coin score was equal to n and that he have bought only some houses (for 1 234 567 game-coins each), cars (for 123 456 game-coins each) and computers (for 1 234 game-coins each).

Kolya is now interested, whether he could have spent all of his initial n game-coins buying only houses, cars and computers or there is a bug in the game. Formally, is there a triple of non-negative integers a, b and c such that a × 1 234 567 + b × 123 456 + c × 1 234 = n?

Please help Kolya answer this question.

Input
The first line of the input contains a single integer n (1 ≤ n ≤ 109) — Kolya’s initial game-coin score.

Output
Print “YES” (without quotes) if it’s possible that Kolya spent all of his initial n coins buying only houses, cars and computers. Otherwise print “NO” (without quotes).

Examples
input
1359257
output
YES
input
17851817
output
NO
Note
In the first sample, one of the possible solutions is to buy one house, one car and one computer, spending 1 234 567 + 123 456 + 1234 = 1 359 257 game-coins in total.

#include<iostream>
using namespace std;
int main()
{
    int n;
    scanf("%d", &n);
    int a = 1234567, b = 123456, c = 1234, judge = 0;
    for (int i = 0; i*a <= n&&!judge; i++)
        for (int j = 0; j*b + i*a <= n&&!judge; j++)
            if ((n - j*b - i*a) % c == 0)
                judge = 1;
    printf(judge?"YES\n":"NO\n");
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值