# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
866736 | haianhnguyen08102007 | Košnja (COCI17_kosnja) | C++17 | 64 ms | 1360 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define fi first
#define se second
#define ii pair<int, int>
const ll N = 1e6+1;
const ll mod = 1e9+7;
const ll INF = 1e9;
using namespace std;
ll tinh(ll k)
{
ll p=k-1;
return p*2;
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
//freopen("distance.inp","r",stdin);
//freopen("distance.out","w",stdout);
ll n;
cin>>n;
while (n--)
{
ll x, y; cin>>x>>y;
cout<<tinh(min(x, y))<<endl;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |