백준 10093 번: 숫자

https://www.acmicpc.net/problem/10093

1. 문제

2. 알고리즘

키워드 - 구현

3. 코드

#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;
}