#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
#define DEBUG
#ifdef DEBUG
#define debug(x) cout << #x << ": " << x << endl
#else
#define debug(x)
#endif
int k;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> k;
for(int i=1;i<=k;i++){
int n,m;
cin >> n >> m;
cout << (min(n,m)-1)*2 << "\n";
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
10 ms |
852 KB |
Output is correct |
7 |
Correct |
12 ms |
1220 KB |
Output is correct |
8 |
Correct |
8 ms |
924 KB |
Output is correct |
9 |
Correct |
12 ms |
1164 KB |
Output is correct |
10 |
Correct |
9 ms |
956 KB |
Output is correct |