출처 : https://www.hackerrank.com/challenges/the-time-in-words/problem #include using namespace std; string minutes[30] = { "one minute","two minutes","three minutes","four minutes","five minutes","six minutes","seven minutes","eight minutes","nine minutes","ten minutes","eleven minutes","twelve minutes","thirteen minutes","forteen minutes","quarter","sixteen minutes","seventeen minutes","eighteen..
출처 : https://www.hackerrank.com/challenges/bigger-is-greater/problem #include using namespace std; string biggerIsGreater(string w) {string z; int n = w.size();for (int i = n - 1; i >= 0; i--) {if (i == 0) return "no answer";if (w[i] == w[i - 1]) continue;if (w[i] > w[i - 1]) {char c; c = w[i]; w[i] = w[i - 1]; w[i - 1] = c;return w;}else {int j = i-1;while (j>=0) {if (w[j] >= w[j + 1]) {if (j =..
출처 : https://www.hackerrank.com/challenges/organizing-containers-of-balls/problem #include using namespace std; string organizingContainers(vector container) {int n = container.size(); vector a(n,0), b(n,0);for (int i = 0; i < n; i++) {for (int j = 0; j < n; j++) {b[i] += container[i][j]; a[j] += container[i][j];}}sort(a.begin(), a.end()); sort(b.begin(), b.end());for (int i = 0; i < n; i++) if ..
- Total
- Today
- Yesterday
- SW Expert Academy
- 2018 KAKAO BLIND RECRUITMENT
- 17837
- 게리맨더링 2
- 2018 카카오 블라인드 채용
- 시간 복잡도
- scanf
- 팁
- 백준
- DP
- 이차원 배열과 연산
- 트렌드
- DFS
- 17143
- 17779
- string
- 알고리즘
- 역량 테스트
- hackerrank
- 새로운 게임 2
- 입출력
- 17144
- 미세먼지 안녕!
- 삼성
- 17140
- 연구소 3
- boj
- SWEA
- 17142
- STL
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | 7 |
8 | 9 | 10 | 11 | 12 | 13 | 14 |
15 | 16 | 17 | 18 | 19 | 20 | 21 |
22 | 23 | 24 | 25 | 26 | 27 | 28 |
29 | 30 | 31 |