SUEATY 발은 개발

[1970] : 쉬운 거스름돈 #include using namespace std; void getChange(int); int main(void){ int testCase; cin >> testCase; for(int test = 0; test > changeM; getChange(changeM); } return 0; } void getChange(int money){ int mType[8]{0,}; int static trial = 1; while(money > 9){ if(money >= 50000){ mType[0] += 1; money -= 50000; } else if(money >= 10000){ mType[1] += 1..

[1859] : 백만 장자 프로젝트 #include using namespace std; int main(void) { int testCase; int day; cin >> testCase; long * ans = new long[testCase]; for (int i = 0; i > day; long * price = new long[day]; long total = 0; for (int j = 0; j > price[j]; long max = price[day - 1]; for (int j = day - 2; j > -1; j--) if (price[j] < max) total += (max - price[j]); else ma..

[1986] : 지그재그 숫자 #include #include #include using namespace std; vector answer; void printAnswer(int); int main(void){ int testCase; cin >> testCase; for(int test = 0; test > num; for(int n = 1; n < num + 1; n++){ if(n % 2 == 0) sum -= n; else sum += n; } answer.push_back(sum); } printAnswer(testCase); return 0; } void printAnswer(int testCase){ for(in..

[1545] : 거꾸로 출력해 보아요 #include using namespace std; int main(void){ int N; cin >> N; for(int i = N; i > -1; i--){ cout N; cout

[2046] : 스탬프 찍기 #include using namespace std; int main(void){ int N; cin >> N; for(int i = 0; i input; int i = 0, c; while((c = input[i])){ putchar(toupper(c)); i++; } } [2050] : 알파벳을 숫자로 변한 #include #include using namespace std; int main(void){ string input; cin >> input; int size = input.length(); for(int i = 0; i < size; i++) cout N; string dates[N], ans[N]; for(int i = 0; i ..

[2063] : 중간 값 찾기 #include using namespace std; int main(void){ int N, mid; cin >> N; mid = N / 2; int arr[N]; for(int i = 0; i > arr[i]; for (int i = 0; i < N - 1; i++){ int min = i; for(int j = i + 1; j < N; j++) if(arr[j] < arr[min]) min = j; int tmp = arr[min]; arr[min] = arr[i]; arr[i] = tmp; } cout testCase; for (int i = 0; i < testCase; i++) { int big = -1; for (int j = 0; j..