#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int MOD=1e9+7;
int T=1;
void solver()
{
ll n,m;
cin>>n>>m;
cout <<(min(n,m)-1)*2<<"\n";
}
int main()
{
cin>>T;
while (T--)
solver();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
292 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
292 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
54 ms |
816 KB |
Output is correct |
7 |
Correct |
86 ms |
1196 KB |
Output is correct |
8 |
Correct |
57 ms |
860 KB |
Output is correct |
9 |
Correct |
84 ms |
1220 KB |
Output is correct |
10 |
Correct |
57 ms |
872 KB |
Output is correct |