Accepted
Code
#include <bits/stdc++.h>
#define int long long
#define endll '\n';
#define pb push_back
#define all(v) v.begin(), v.end()
using namespace std;
const int mod = 1e9 + 7, N = 1e6;
void solve()
{
// for(int i = 1; i <= 30; i++) {
// for(int j = 1; j <= 30; j++) {
// if( __gcd)
// }
// }
int a , b; cin >> a >> b;
int x = a * b;
x -= min(a , b);
cout << x << endll;
}
int32_t main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
Information
- Submit By
- Type
- Submission
- Problem
- P1075 GCD not equal LCM
- Contest
- Brain Booster #5
- Language
- C++20 (G++ 13.2.0)
- Submit At
- 2024-09-05 15:37:57
- Judged At
- 2024-10-03 13:11:13
- Judged By
- Score
- 100
- Total Time
- 28ms
- Peak Memory
- 2.129 MiB