C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 2947번:나무 조각 답

#include <iostream>
#include <algorithm>
using namespace std;
int a[5];
int main() {
    for (int i = 0; i < 5; i++)
        cin >> a[i];
    while(1)
    {
        bool c = true;
        for (int i = 0; i < 5; i++)
        {
            if (a[i] != i + 1)
                c = false;
        }
        if (c) { break; }
        for (int i = 0; i < 4; i++)
        {
            if (a[i] > a[i + 1])
            {
                swap(a[i + 1], a[i]);
                for (int j = 0; j < 5; j++)
                    cout << a[j] << ' ';
                cout << '\n';
            }
        }
    }
}