알고리즘 문제 풀이/1DP_과제(~180615)
171127_14891_톱니바퀴
//https://www.acmicpc.net/problem/14891 #include using namespace std; int main(){ char gear_input[4][8]; bool gear[4][8]; for(int i=0; i> gear_input[i]; for(int i=0; i> K; while(K-->0) { int rot_gear, dir; cin >> rot_gear >> dir; bool rot_chk[4][2]; for(int i=0; i
