:: ADVANCE ::

BAEKJOON ONLINE JUDGE 12758 천상용섬 https://www.acmicpc.net/problem/12758 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576#include #include #include #include using namespace std; #define MOD 1000000007 int dp[310][300];vector mnt[310];int n; void input(){ int i, j; int num; scanf("%d", &n); for (i = 1; i

BAEKJOON ONLINE JUDGE 12852 1로 만들기 2 https://www.acmicpc.net/problem/12852 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162#include #include #include int dp[1000001];int output[1000001]; int solve(int n){ int min = 2147000000; int temp, out; if (dp[n] != -1) return dp[n]; if (n % 3 == 0) { temp = solve(n / 3); if (temp

BAEKJOON ONLINE JUDGE 13199 치킨 먹고 싶다 https://www.acmicpc.net/problem/13199 문제 열자마자 일단 당황...ㅋㅋㅋㅋ 12345678910111213141516171819202122232425262728293031#include int chicken, money, f, c; int main(){ int nCount; int doyung, sangun, docnt, sangcnt; scanf("%d", &nCount); while (nCount--) { scanf("%d %d %d %d", &chicken, &money, &f, &c); doyung = docnt = sangun = money / chicken; docnt = sangcnt = docn..