히더

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14jJh6ACYCFAYD #include #include #include #include using namespace std; int N,result;char arr[10][4] = { "ZRO","ONE","TWO","THR","FOR","FIV","SIX","SVN","EGT","NIN" };int cnt[10]; int main(){int T; int t = 1; string tt;cin >> T;while (T--){cin >> tt; cin >> N;for (int i = 0; i > tmp..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14hwZqABsCFAYD #include #include #include using namespace std; int N,result;int arr[100][100]; int main(){int T; int t=1;T = 10;while (T--){cin >> N; result = 0;for (int i = 0; i > arr[i][j]; for (int j = 0; j < N; j++){for (int i = 0; i < N; i++){if (arr[i][j] == 2) ..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14geLqABQCFAYD #include #include #include using namespace std; int N,result;int a[100], b[100]; void dfs(int now){if (a[now] == 99 || b[now] == 99) { result = 1; return; }else{if(a[now]!=-1)dfs(a[now]);if (b[now] != -1)dfs(b[now]);}} int main(){int T; int t;T = 10;while (T--){cin >> t >> N; result = 0; fill(a..