# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
164841 |
2019-11-23T17:54:56 Z |
sans |
Košnja (COCI17_kosnja) |
C++14 |
|
140 ms |
1464 KB |
#include <iostream>
#include <numeric>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
#define sp ' '
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define forn(YY, yy) for(long long int yy = 0; yy < YY; ++yy)
#define prn(XX) cout << XX << endl
#define prs(XX) cout << XX << " "
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
const int MOD = 1e9 + 7;
const int INF = 2e9 + 13;
const int mINF = -2e9 - 13;
const double PI = 3.14159265358979;
const double EPS = 1e-9;
int main(int argc, char **argv){
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
ll K = 0; cin >> K;
while(K--){
ll X, Y; cin >> X >> Y;
if(X > Y) swap(X, Y);
if(X % 2){
cout << (X/2)*4 << endl;
}
else{
cout << (X/2 - 1)*4 + 2 << endl;
}
}
return 0;
}
//cikisir
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
91 ms |
996 KB |
Output is correct |
7 |
Correct |
136 ms |
1272 KB |
Output is correct |
8 |
Correct |
95 ms |
1016 KB |
Output is correct |
9 |
Correct |
140 ms |
1464 KB |
Output is correct |
10 |
Correct |
94 ms |
1016 KB |
Output is correct |