목록Problem Solving/SW Expert Academy (8)
프로그래밍 공부
#define _CRT_SECURE_NO_WARNINGS #include using namespace std; int arr[10][10]; int main() { int t; cin >> t; for (int i = 0; i > arr[j][k]; } } for (int j = 0; j < 9; j++) { if (!ans) break; int col_check[10]; fill(col_check, col_check + 10, 0); for (int k = 0; k < 9; k++) { col_check[arr[j][k]]++; if (..
#define _CRT_SECURE_NO_WARNINGS #include using namespace std; int main() { int t; cin >> t; for (int i = 0; i > tc; for (int j = 0; j > tmp; arr[tmp]++; } for (int j = 0; j < 100; j++) { if (max
#include #include #include using namespace std; int arr[101][101]; int max_row(){ int max = 0; for(int i = 0; i
#include using namespace std; int main(){ for(int t = 0; t > dump; for(int i = 0; i > arr[i]; for(int i = 0; i
#include using namespace std; int arr[1010]; int check[] = { -2, -1, 1, 2 }; int main(){ for(int t = 0; t > n; for(int i = 2; i > arr[i]; } for(int i = 2; i max) max = arr[i + check[j]]; } } if(cnt == 4){ sum += arr[i] - max; } } cout
#include #include #include using namespace std; string match[11] = { "0001101", "0011001", "0010011", "0111101", "0100011", "0110001", "0101111", "0111011", "0110111", "0001011" }; int main() { int t; cin >> t; for (int i = 0; i > n >> m; for (int j = 0; j > str; if (str.find('1') == -1) continue; tmp = str.substr(str.rfind('1') - 55, 56); } for (int j = 1; j