# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1101650 | 2024-10-16T13:46:36 Z | vjudge1 | Bridž (COCI17_bridz) | C++17 | 1 ms | 504 KB |
#include <bits/stdc++.h> #define task "TEST" #define task2 "A" #define pl pair<int, int> #define pf push_front #define pb push_back #define pob pop_back #define pof pop_front #define mp make_pair #define fi first #define se second #define FOR(i, a, b, c) for (int i=a; i<=b; i+=c) #define FORE(i, a, b, c) for (int i=a; i>=b; i+=c) using namespace std; using ll = long long; using ull = unsigned long long; const int Mod = 1e9+7; const int maxn = 1e3; const ll Inf = 1e18; string str; ll res; ll n, a, last; bool chk; void Read() { cin >> n; FOR(i, 1, n, 1) { cin >> a; FOR(i, last+1, a-1, 1) cout << i << '\n'; if (a > last + 1) chk = 1; last = a; } if (!chk) cout << "good job" << '\n'; } void Solve() { } int main() { if (fopen (task".inp", "r")) { freopen (task".inp", "r", stdin); freopen (task".out", "w", stdout); } ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; for (t=1; t--;) { Read(); Solve(); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Incorrect | 1 ms | 336 KB | Output isn't correct |
3 | Incorrect | 1 ms | 336 KB | Output isn't correct |
4 | Incorrect | 1 ms | 504 KB | Output isn't correct |
5 | Incorrect | 1 ms | 336 KB | Output isn't correct |
6 | Incorrect | 1 ms | 336 KB | Output isn't correct |
7 | Incorrect | 1 ms | 336 KB | Output isn't correct |
8 | Incorrect | 1 ms | 336 KB | Output isn't correct |
9 | Incorrect | 1 ms | 336 KB | Output isn't correct |
10 | Incorrect | 1 ms | 336 KB | Output isn't correct |