# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
471208 | 2021-09-07T16:33:39 Z | Karabasan | Košnja (COCI17_kosnja) | C++17 | 17 ms | 604 KB |
#include <bits/stdc++.h> #define forcin for(int i=0;i<n;i++) scanf("%d",&dizi[i]); #define forcout for(int i=0;i<n;i++) printf("%d ",dizi[i]); #define ll long long #define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); using namespace std; int n,t; int dizi[100005]; int cevap; int main() { scanf("%d",&n); int xxd=0; for(int i=0;i<n;i++) { int oyyy=31; int a,b; scanf("%d%d",&a,&b); cevap=(min(a,b))*2-2; for(int j=0;j<100000;j++) { oyyy+=2; } xxd=oyyy*2-389; printf("%d\n",cevap); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 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 | 204 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
6 | Correct | 13 ms | 460 KB | Output is correct |
7 | Correct | 16 ms | 604 KB | Output is correct |
8 | Correct | 12 ms | 412 KB | Output is correct |
9 | Correct | 17 ms | 564 KB | Output is correct |
10 | Correct | 12 ms | 456 KB | Output is correct |