# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
47302 | 2018-04-30T12:12:36 Z | rkocharyan | Košnja (COCI17_kosnja) | C++14 | 23 ms | 3344 KB |
#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <iomanip> #include <algorithm> #include <memory> #include <functional> #include <numeric> #include <sstream> #include <queue> #include <deque> #include <list> #include <vector> #include <stack> #include <set> #include <unordered_set> #include <map> #include <unordered_map> #include <bitset> #include <tuple> #include <string> #include <cstring> #include <cmath> #include <cstdio> #include <cassert> #include <climits> #include <ctime> using namespace std; #define rep(i, x, y) for(int i = x; i <= y; ++i) #define mp make_pair #define add push_back #define sz(x) (int)(x).size() #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define mem(a,b) memset(a, b, sizeof(a)) #pragma warning(disable:4996) #pragma comment(linker, "/STACK:20000007") #pragma GCC optimize("unroll-loops") typedef long long ll; typedef unsigned long long ull; typedef double db; typedef long double ld; typedef pair <int, int> pii; typedef vector <int> lnum; const int N = (int)1e6 + 100; const int maxn = (int)1e3 + 100; const int base = (int)1e9; const int mod = (int)1e9 + 7; const int inf = INT_MAX; const long long ll_inf = LLONG_MAX; const long double PI = acos((long double)-1.0); const long double eps = 1e-8; void solve() { int n; scanf("%d", &n); for (; n; --n) { int x, y; scanf("%d%d", &x, &y); int mn = min(x, y); int curl = 2 * mn; curl -= 2; printf("%d\n", curl); } } int main() { //ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr); //#define Freopen #ifdef Freopen #ifndef _MSC_VER #define TASK "" freopen(TASK".in", "r", stdin); freopen(TASK".out", "w", stdout); #endif #endif int T = 1; //scanf("%d", &T); for (; T; --T) solve(); #ifdef DEBUG cerr << double(1.0 * clock() / CLOCKS_PER_SEC) << '\n'; #endif return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 344 KB | Output is correct |
2 | Correct | 2 ms | 480 KB | Output is correct |
3 | Correct | 2 ms | 484 KB | Output is correct |
4 | Correct | 2 ms | 660 KB | Output is correct |
5 | Correct | 2 ms | 660 KB | Output is correct |
6 | Correct | 18 ms | 1268 KB | Output is correct |
7 | Correct | 21 ms | 1924 KB | Output is correct |
8 | Correct | 15 ms | 2264 KB | Output is correct |
9 | Correct | 23 ms | 3016 KB | Output is correct |
10 | Correct | 15 ms | 3344 KB | Output is correct |