알고리즘 문제 풀이/1DP_과제(~180615)
2017.11.27
//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
알고리즘 문제 풀이/1DP_과제(~180615)
2017.11.27
//https://www.acmicpc.net/problem/1476 #include using namespace std; int main(){ int E, S, M; cin >> E >> S >> M; E%=15; S%=28; M%=19; for(int i=1; ;i++) if((i%15)==E && (i%28)==S && (i%19)==M) { cout
알고리즘 문제 풀이/1DP_과제(~180615)
2017.11.27
//https://www.acmicpc.net/problem/4344 #include #include using namespace std; int main(){ int C; cin >> C; for(int i=0; i> N; for(int j=0; j> x; sum+=x; s.push(x); } avg=sum/N; for(int j=0; javg) cnt++; s.pop(); } float percent = ((float) cnt/ (float) N )*100; cout
알고리즘 문제 풀이/1DP_과제(~180615)
2017.11.27
//https://www.acmicpc.net/problem/2743 #include using namespace std; int main(){ char str[101]; cin >> str; for(int i=0 ;i s; int l=s.size(); cout > str; int l=strlen(str); cout