# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
473195 |
2021-09-15T10:03:34 Z |
AbdoMo |
Košnja (COCI17_kosnja) |
C++17 |
|
94 ms |
1220 KB |
#include<bits/stdc++.h>
//#define int long long
#define ll long long
#define pb push_back
const int mod = 1e9+7;
using namespace std;
bool comp(string a,string b)
{
if(a.size()==b.size())
{
return a<b;
}
return a.size()<b.size();
}
void solve(){
int n,m;
cin>>n>>m;
cout<<((min(n,m)-1)*2)<<endl;
}
int32_t main(){
int t=1;
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>t;
while(t--){solve();}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
55 ms |
888 KB |
Output is correct |
7 |
Correct |
94 ms |
1148 KB |
Output is correct |
8 |
Correct |
59 ms |
880 KB |
Output is correct |
9 |
Correct |
86 ms |
1220 KB |
Output is correct |
10 |
Correct |
69 ms |
860 KB |
Output is correct |