# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
473441 |
2021-09-15T14:17:05 Z |
Beboo44 |
Košnja (COCI17_kosnja) |
C++14 |
|
133 ms |
1224 KB |
#include <bits/stdc++.h>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
typedef long long ll;
typedef vector<int> vi;
typedef vector<pair<ll , int> > vpli;
typedef set<char> st;
typedef stack<int> s;
typedef deque<int> dq;
typedef queue<int> q;
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0)
int main()
{
ll t;
cin>>t;
while(t--){
ll n,m;
cin>>n>>m;
ll ans = min(n,m);
cout<<(ans-1)*2<<endl;
}
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 |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
292 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
74 ms |
836 KB |
Output is correct |
7 |
Correct |
109 ms |
1192 KB |
Output is correct |
8 |
Correct |
74 ms |
920 KB |
Output is correct |
9 |
Correct |
133 ms |
1224 KB |
Output is correct |
10 |
Correct |
75 ms |
864 KB |
Output is correct |