Source Code
#include <bits/stdc++.h> 
#define int long long
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define SORT(c) sort(all(c))
#define rSORT(c) sort(rall(c))
#define f first
#define s second
#define pb push_back
#define endl "\n"
using namespace std;
void solve();
int32_t main(){ios::sync_with_stdio(false);cin.tie(0);int t = 1;int i = 1;
    cin >> t;
    while(t--){//cout<<"_________________________________\n";cout<<"Test case Number: "<<i++<<endl<<endl;
        solve();
    }
}
void solve(){
    int x, y;
    cin >> x >> y;

    // Calculate the smallest multiple of y that is greater than or equal to x
    int ans = (x + y - 1) / y * y;

    cout << ans << endl;
}
Copy
AZOZ with an O (Needs a Carry) barakat
GNU G++17
3 ms
340 KB
Wrong Answer