말랑한 하루

[ 핵심풀이 ] 1) 순열 조합 2) 0/1 냅색 알고리즘 [ 핵심소스 ] [ C++ ] 1) 순열 조합 #include #include #pragma warning(disable:4996) using namespace std; #define endl "\n" #define MAX 21 int total, max_cal; int high_cal = 0; int high_score = 0; typedef struct data { int score; int cal; }Data; Data food[MAX]; bool visit[MAX]; void solve(int index, int score, int sum_cal) { if (sum_cal > max_cal) return; high_score = high_..

[ 핵심풀이 ] [ 핵심소스 ] [ C++ ] #include #include using namespace std; #define endl "\n" #define tap "\t" #define MAX 27 bool alpha[MAX]; int main() { int tc; cin >> tc; alpha['a' - 'a'] = true; alpha['e' - 'a'] = true; alpha['i' - 'a'] = true; alpha['o' - 'a'] = true; alpha['u' - 'a'] = true; for (int t = 1; t > temp; cout