Round solutions

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
#define endl '\n'
#define fastio ios_base::sync_with_stdio(0); cin.tie(0)

signed main()
{
    fastio;

    /*
    // A
    int h , m;
    cin >> m >> h;
    if(h % m == 0)
        cout << "Yes";
    else
        cout << "No";
    */
    /*
    // B
    int n;
    cin >> n;
    cout << 100 - n % 100 << '\n';
    */
    /*
    // C
    int a , b;
    cin >> a >> b;
    double ans = (a - b) * 100.0 / a;
    cout << fixed << setprecision(2) << ans;
    */
    /*
    // D
    int a , b , c , d;
    cin >> a >> b >> c >> d;
    cout << b - c << '\n';
    */
    /*
    // E
    int a , b;
    cin >> a >> b;
    if(a + b >= 15 && b >= 8)
        cout << 1;
    else if(a + b >= 10 && b >= 3)
        cout << 2;
    else if(a + b >= 3)
        cout << 3;
    else
        cout << 4;
    */
    /*
    // F
    int n , x , k;
    cin >> n >> k;
    while(n--){
        cin >> x;
        if(x != k)
            cout << x << " ";
    }
    */
    /*
    // G
    string s;
    cin >> s;
    int n = s.size();
    string ans = "Yes";
    for(int i = 0; i < n; i += 2){
        if(isupper(s[i]))
            ans = "No";
    }
    for(int i = 1; i < n; i += 2){
        if(islower(s[i]))
            ans = "No";
    }
    cout << ans;
    */
    /*
    // H
    int v , l , r , t;
    cin >> v >> l >> r >> t;
    if(t >= l * v && t <= r * v){
        cout << "No" << '\n';
    }else{
        cout << "Yes" << '\n';
    }
    */
    /*
    // I
    string s;
    cin >> s;
    for(int i = 0; i < s.size(); i++){
        if(s[i] == '.')
            break;
        cout << s[i];
    }
    cout << '\n';
    */
    /*
    // J
    int n , a , b , ans = INT_MAX , x = INT_MAX , y = INT_MAX;
    cin >> n;
    while(n--){
        cin >> a >> b;
        ans = min({ans , a + b , max(a , y) , max(b , x)});
        x = min(x , a);
        y = min(y , b);
    }
    cout << ans << '\n';
    */
    /*
    // K
    int n;
    cin >> n;
    if(n < 4){
        cout << n << '\n';
        return 0;
    }
    vector<int> v;
    for(int a = 2; a * a <= n; a++){
        int k = a * a;
        while(k <= n){
            v.push_back(k);
            k *= a;
        }
    }
    sort(v.begin() , v.end());
    int cnt = 1;
    for(int i = 1; i < v.size(); i++){
        if(v[i] != v[i - 1])
            cnt++;
    }
    cout << n - cnt << '\n';
    */
    /*
    // L
    int a , b , n;
    cin >> a >> b >> n;
    n *= 1000;
    int mn = (n + b - 1) / b;
    int mx = n / a;
    if(mn > mx)
        cout << "UNSATISFIABLE";
    else
        cout << mn << " " << mx << '\n';
    */

}