์ ์ฒด ๊ธ (116) ์ธ๋ค์ผํ ๋ฆฌ์คํธํ BOJ14889 : ์คํํธ์ ๋งํฌ (Silver 3) #include using namespace std; int N; int map[21][21]; int ans = 100000000; bool is_visited[21]; void DFS(int player, int cnt) { if (cnt == N / 2) { int score1 = 0; int score2 = 0; for (int i = 1; i BOJ 2503 : ์ซ์์ผ๊ตฌ (Silver 5) #include #include using namespace std; int number; int strike, ball; vector array; void Filtering(int num, int s, int b) { vector newarray; vector::iterator iter; int strike = 0, ball = 0; for (iter = array.begin(); iter != array.end(); iter++) { int strike = 0, ball = 0; // cout BOJ17404 : RGB๊ฑฐ๋ฆฌ2 (Gold 4) #include using namespace std; int cost[1000][3]; long long costDP[1000][3]; long long result[3]; //long long result = 1000 * 10000 + 1; void makeDP(int N) { for (int j = 0; j < 3; j++) { costDP[0][0] = 1000 * 10000 + 1; costDP[0][1] = 1000 * 10000 + 1; costDP[0][2] = 1000 * 10000 + 1; costDP[0][j] = cost[0][j]; for (int i = 1; i < N; i++) { costDP[i][0] = min(costDP[i - 1][1], costDP[i - 1][2]) .. BOJ1149 : RGB๊ฑฐ๋ฆฌ (Silver 1) #include using namespace std; int cost[1000][3]; long long costDP[1000][2]; void makeDP(int N) { costDP[0][0] = cost[0][0]; costDP[0][1] = cost[0][1]; costDP[0][2] = cost[0][2]; for (int i = 1; i < N; i++) { costDP[i][0] = min(costDP[i - 1][1], costDP[i - 1][2]) + cost[i][0]; costDP[i][1] = min(costDP[i - 1][0], costDP[i - 1][2]) + cost[i][1]; costDP[i][2] = min(costDP[i - 1][0], costDP[i - 1][1.. BOJ11660 : ๊ตฌ๊ฐ ํฉ ๊ตฌํ๊ธฐ 5 (Silver 1) #include using namespace std; int map[1025][1025]; long long sum[1025][1025]; void sumMaker(int N) { for (int i = 0; i > M; int x1, x2, y1, y2; for (int i = 1; i map[i][j]; } } sumMaker(N); for (int i = 0; i > x1 >> y1 >> x2 >> y2; cout BOJ2012 : ๋ฑ์๋งค๊ธฐ๊ธฐ (Silver 3) #include #include using namespace std; int N; int prerank[500001]; long long rankingSystem() { long long angry = 0; for (int i = 1; i > N; for (int i = 1; i > prerank[i]; } sort(prerank + 1, prerank + N + 1); cout BOJ1343 : ํด๋ฆฌ์ค๋ฏธ๋ ธ (Silver 5) #include #include #include using namespace std; string poliomino[501]; void polifunc() { poliomino[0] = "."; poliomino[1] = "-1"; poliomino[2] = "BB"; poliomino[3] = "-1"; poliomino[4] = "AAAA"; for (int i = 5; i tmp2) { poliomino[i] = tmp2; } else { poliomino[i] = tmp; } } else { poliomino[i] = poliomino[i - 2] + "BB"; } } else poliomino[i] = "-1"; } } int main() { string poli; cin >> poli; pol.. BOJ11170 : 0์ ๊ฐ์ (Silver 5) #include #include using namespace std; int number(int a) { int count = 0; string str = to_string(a); for (int i = 0; i > T; for (int i = 0; i > N >> M; int count = 0; for (int j = N; j BOJ11068 : ํ๋ฌธ์ธ ์ (Silver 5) ์ ์ง๊ธ๋ถํฐ ๋๋ ๋ฉ์ฒญ์ด๋ค๋ฅผ 100๋ฒ ๋ณต์ฐฝํ๋ค. ์ต๋์ธ 1000000๋ฅผ 2์ง์๋ก ๋ฐ๊พธ๋ฉด ์ฝ 20์๋ฆฌ ์๊ฐ ๋์ค๋๋ฐ, ๋ ์ด๊ฑธ ๋ฐ๋ณด๊ฐ์ด ๋ฐฐ์ด์ ์ต์ด ๋๋ ๋งํผ ํ ๋นํด์ผํ๋ค๊ณ ์๊ฐํ๋ค... (๋์ฒด ์..?) ๊ทธ๋์ ์ด๊ฑด ์ด๋ป๊ฒ ํ๋ผ๋ ๊ฑธ๊น, ๋ฐฐ์ด๋ก๋ ์๋๊ณ ๋์ ํ ๋น์ผ๋ก๋ ์๋์ด์ ๊ฒฐ๊ตญ ์ธํฐ๋ท ์ฐพ์์ deque์ ์ฌ์ฉํ๋๋ฐ......... ์๊ฐํด๋ณด๋๊น ๋ฐฐ์ด์ 20๊ฐ ์๋ฆฌ๋ง ์์ด๋ ๋๋ ๊ฑฐ์์ ใ ใ ใ ใ ใ ใ ใ ใ ใ ใ ใ ใ ใ ใ ใ ใ ใ ใ ใ ใ ใ ๊ฐ๋ฉ์ฒญํด........ #include #include using namespace std; int examine(int a) { deque memory; for (int i = 2; i > TC; for (int i = 0; i > number; cout BOJ17127 : ๋ฒ๊ฝ์ด ์ ๋ณด์ฌ์ ํผ์ด๋ ์ด์ (Bronze 1) #include using namespace std; int N; int A[10]; int sum(int a, int b, int c); int main() { int max = 0; int count = 0; cin >> N; for (int i = 0; i > A[i]; for (int i = 1; i < N - 2; i++) { for (int j = i + 1; j < N - 1; j++) { for (int k = j + 1; k < N; k++) { int tmp = sum(i, j, k); if (max < tmp) max = tmp; } } } cout ์ด์ 1 2 3 4 5 6 7 8 ยทยทยท 12 ๋ค์