Целочисленные проценты

#pragma once
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <cmath>
#include <math.h>
#include <queue>
#include <stack>
#include <climits>
#include <deque>
#include <ctime>
#include <iomanip>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;

#define mh() make_heap()
#define poph() pop_heap()
#define pushh() push_heap()
#define sor(n) n.begin(), n.end()
#define rsor(n) n.rbegin(), n.rend()
#define mp make_pair
#define files freopen("input.txt", "rt", stdin); freopen("output.txt", "wt", stdout)
#define p(T) pair<T,T>
#define toch(x) cout.precision(x), cout.setf(ios::fixed)
#define znac(l) abs(l)/l
#define IOS ios::sync_with_stdio(false)
#define IOSB cin.tie(0), cout.tie(0);
const ll ok = ll(1e9 + 7);

ll gcd(ll a, ll b)
{
    while (a)
    {
        swap(a, b);
        a %= b;
    }
    return b;
}
int main()
{
    IOSB;
    IOS;
#ifdef TheCompiler
    files;
#endif
    ll n, s;
    cin >> n >> s;
    vector<ll>zap(10010, 0);
    zap[s] = 1;
    ll mx = 1;
    for (int i = s; i <= n; i++)
    {
        if (zap[i] == 0)
            continue;
        ll pr = gcd(i, 100);
        pr = i / pr;
        for (int j = pr; j <= i&&j + i <= n; j+=pr)
        {
            if (zap[i + j] < zap[i] + 1)
            {
                zap[i + j] = zap[i] + 1;
            }
        }
        mx = max(zap[i], mx);
    }
    cout << mx;
    return 0;
}