Problem:
Score: 300 points

Problem Statement

AtCoder Mart sells 1000000 of each of the six items below:

Riceballs, priced at 100 yen (the currency of Japan) each

Sandwiches, priced at 101 yen each

Cookies, priced at 102 yen each

Cakes, priced at 103 yen each

Candies, priced at 104 yen each

Computers, priced at 105 yen each

Takahashi wants to buy some of them that cost exactly X yen in total.
Determine whether this is possible.

(Ignore consumption tax.)

Constraints

1 \leq X \leq 100000

X is an integer.

Input

Input is given from Standard Input in the following format:

X

Output

If it is possible to buy some set of items that cost exactly X yen in total, print 1; otherwise, print 0.

Sample Input 1

615

Sample Output 1

1

For example, we can buy one of each kind of item, which will cost 100+101+102+103+104+105=615 yen in total.

Sample Input 2

217

Sample Output 2

0

No set of items costs 217 yen in total.

Solution in C++ (GCC 9.2.1) (judge verdict: Accepted)

#include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;

int main(){
    long long X;
    cin >> X;

    int target = X % 100;
    int max_count = X / 100;
    
    int max_count_5 = min({target / 5, max_count});
    int max_count_4 = min({target / 4, max_count});
    int max_count_3 = min({target / 3, max_count});
    int max_count_2 = min({target / 2, max_count});
    int max_count_1 = min({target, max_count});

    if(target == 0){
        cout << 1 << endl;
        return 0;
    }

    for(int i=0; i<=max_count_5; i++){
        for(int j=0; j<=(max_count_4-i); j++){
        for(int k=0; k<=(max_count_3-i-j); k++){
        for(int l=0; l<=(max_count_2-i-j-k); l++){
        for(int m=0; m<=(max_count_1-i-j-k-l); m++){
            if(target == (5*i + 4*j + 3*k + 2*l + m) && max_count >= (i+j+k+l+m)){
                cout << 1 << endl;
                return 0;
            }
        }
        }
        }
        }
    }

    cout << 0 << endl;
    return 0;

}