제출 #107635

#제출 시각아이디문제언어결과실행 시간메모리
107635dfistric수열 (BOI14_sequence)C++14
0 / 100
4 ms384 KiB
#include <bits/stdc++.h> #define FOR(i, a, b) for (int i = (a); i < (b); i++) #define FORd(i, a, b) for (int i = (a); i >= (b); i--) #define REP(i, n) FOR(i, 0, n) #define ll long long using namespace std; const int MAXN = 100100; int arr[MAXN]; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; REP(i, n) cin >> arr[i]; REP(k, 1001) { int good = 1; REP(i, n) { int flag = 0, t = k; while (t > 0) { if (t % 10 == arr[i]) flag = 1; t /= 10; } if (!flag) good = 0; } if (good) { cout << k << "\n"; return 0; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...