MY MEMO

#define _CRT_SECURE_NO_WARNINGS #include #include using namespace std; vector DP; //0을 만나면 1개 9를 만나면 1개 //나머지는 2개 long long go_step(int start_num, int count) { if (start_num 9 || count

#define _CRT_SECURE_NO_WARNINGS #include #include #include using namespace std; //vector sticker(2, vector(100010)); //vector DP(2, vector(100010)); int main() { int for_count, sticker_count; scanf("%d", &for_count); for (int i = 0; i < for_count; i++) { scanf("%d", &sticker_count); vector sticker(2, vector(100010,0)); vector DP(2, vector(100010,0)); for (int k = 0; k < 2; k++) for (int n = 2; n..

#define _CRT_SECURE_NO_WARNINGS #include #include using namespace std; //long long!! int main() { int n,index; scanf("%d", &n); vectorDP(101, 0); DP[1] = 1; DP[2] = 1; DP[3] = 1; for (int j = 4; j

#include #include using namespace std; int main() { int for_count,num; cin >> for_count; for (int j = 0; j > num; cout

#define _CRT_SECURE_NO_WARNINGS #include #include #include #define MAX 99999999 using namespace std; int main() { int n, goal; scanf("%d %d", &n, &goal); vectornumber(n), DP(100001, MAX); for (int j = 0; j < n; j++) scanf("%d", &number[j]); sort(number.begin(), number.end()); for (int j = 0; j < n; j++) { DP[number[j]] = 1; for (int k = number[j] + 1; k

#define _CRT_SECURE_NO_WARNINGS #include #include #include using namespace std; //전역 vectorcoin(100), result(10001, 0); int main() { int coin_count, total_coin; scanf("%d %d", &coin_count, &total_coin); for (int j = 0; j < coin_count; j++) scanf("%d", &coin[j]); sort(coin.begin(), coin.begin() + coin_count); for (int j = 0; j < coin_count; j++) { result[coin[j]]++; for (int k = 1; coin[j] + k

#define _CRT_SECURE_NO_WARNINGS #include #include using namespace std; int main() { vectormap(301, vector(301,0)); int row, colum; scanf("%d %d", &row, &colum); for (int x = 1; x

#define _CRT_SECURE_NO_WARNINGS #include using namespace std; //그냥 똑같이 자를 수 있는 개수를 구하면 됨 int main() { int m, n; scanf("%d %d", &m, &n); printf("%d", (m - 1) + m*(n - 1)); return 0; }

#define _CRT_SECURE_NO_WARNINGS #include #include using namespace std; int main() { vectorcache(2, 0); long long num; cin>>num; cache[0] = 0; cache[1] = 1; long long temp0, temp1; for (int j = 1; j < num; j++) { temp0 = cache[0] + cache[1]; temp1 = cache[0]; cache[0] = temp0; cache[1] = temp1; } cout

#define _CRT_SECURE_NO_WARNINGS #include #include #define max(a,b) ((a) > (b) ? (a) : (b)) #define min(a,b) ((a) < (b) ? (a) : (b)) using namespace std; //전역변수가 메모리 범위가 더 큼 int Maxcache[100001][3], Mincache[100001][3],tower[3]; int main() { int arr_count; scanf("%d", &arr_count); int Max = 0,Min=0; for (int j = 1; j