CodeForces 681B Economy Game

好水，直接模拟爆

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#define CPY(A, B) memcpy(A, B, sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD = int (1e9) + 7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const double OO = 1e20;
const double PI = acos (-1.0);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
const int fcc[3]= {1234567,123456,1234};
int main() {
    int n,k; cin>>n; bool f=false;
    for (int i=0; i<820; i++) {
        for (int j=0; j<8200; j++) {
            k=n-fcc[0]*i-fcc[1]*j;
            if (k<0) {break;}
            else if (k%fcc[2]==0) {f=true;}
        }
    }
    (f) ?cout<<"YES\n":cout<<"NO\n";
    return 0;
}