구현(Implementation)
백준 10093 번: 숫자
cepiloth
2018. 9. 2. 18:07
반응형
https://www.acmicpc.net/problem/10093
1. 문제
2. 알고리즘
키워드 - 구현
3. 코드
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 | #include <iostream> #include <sstream> #include <string> #include <algorithm> #include <functional> #include <vector> #include <list> #include <queue> #include <deque> #include <map> #include <set> #include <stack> #include <math.h> #include <memory.h> using namespace std; #define MAX_SIZE 100 #define INF 0x7fffffff #define CENDL "\n" #define ll long long #define c_reverse(s) reverse(s.begin(), s.end()) #define c_sort(s) sort(s.begin(), s.end()) #define print_vector(v) for(int i=0; i<v.size(); i++) cout << v[i]; int table[101][101] = { 0, }; int main() { cin.tie(0); std::ios::sync_with_stdio(false); ll a, b; cin >> a >> b; ll A, B; A = min(a, b); B = max(a, b); if (B - A > 1) { ll count = B - A - 1; ll i = 0; cout << count << CENDL; for (i = A + 1; i < B; i++) { cout << i << " "; } } else { cout << 0 << CENDL; } return 0; } | cs |
반응형