알고리즘/시뮬레이션7 1966 프린터 큐 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364#pragma warning(disable: 4996) #include #include #include #include #include using namespace std; int main() { int t, arr_len, num; queue q; vector rank; scanf("%d", &t); while (t--) { scanf("%d %d", &arr_len, &num); for(int i=0;i 2021. 1. 3. 1592 영식이와 친구들 123456789101112131415161718192021222324252627282930313233#include int main() { int n, m, l; scanf("%d %d %d", &n, &m, &l); int cnt = 0, maxN = -1, cur = 1; int chk[1005] = { 0 }; chk[1] = 1; while (1) { if (maxN == m) break; if (chk[cur] % 2 == 1) { cur += l; if (cur > n) cur -= n; } else { cur -= l; if (cur maxN) maxN = chk[cur]; cnt++; } printf("%d", cnt);}Colored by Color Scriptercs 2020. 1. 15. 2979 트럭 주차 1234567891011121314151617181920212223#include int main() { int price[4] = { 0 }; for (int i = 1; i 2020. 1. 15. 2164 카드2 123456789101112131415161718192021222324#include #include using namespace std; int main() { int n; scanf("%d", &n); queue q; for (int i = 1; i 0) { if(q.size()==1) printf("%d ", q.front()); q.pop(); if (q.size() > 0) { q.push(q.front()); q.pop(); } }}cs 2020. 1. 15. 1547 공 123456789101112131415161718192021#include int main() { int m; scanf("%d", &m); int a, b; int arr[4] = { 0,1,0,0 }; for (int i = 0; i 2020. 1. 15. 2161 카드1 1234567891011121314151617181920212223#include #include using namespace std; int main() { int n; scanf("%d", &n); queue q; for (int i = 1; i 0) { printf("%d ", q.front()); q.pop(); if (q.size() > 0) { q.push(q.front()); q.pop(); } }}cs 2020. 1. 15. 2455 지능형 기차 123456789101112131415#include int main() { int cur = 0, maxN = -1; for (int i = 0; i 2020. 1. 14. 이전 1 다음