알고리즘 문제 풀이/1DP_과제(~180615)
180216_2605_줄 세우기
//https://www.acmicpc.net/problem/2605 #include #include using namespace std;int students[101];int ans[101];int n;void order(){ int x; cin >> n >> x; ans[1]=1; for(int i=2; i> x; for(int j=i-1; j>=i-x; j--){ ans[j+1]=ans[j]; } ans[i-x]=i; }} void output(){ for(int i=1; i
