1604D - Moderate Modular Mode - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 10;
int n, m;
int a[N], b[N];



void solve(){
    cin >> n >> m;
    if(m >= n){
        cout << m - m % n / 2 << "\n";
        return ;
    }
    cout << n + m << "\n";
}
signed main(){
    
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}