목록전체 글 (51)
PS 부수기
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 32 33 int main() { VI fact; fact.push_back(1); llong mul = 1; for (int i = 1; i fact[curFact]) { NUM -= fact[curFact]; cnt++; } else { break; } } rep(i, 0, 10) { if (vis[i] == 0 && cnt == 0) { cout
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 int main() { VI c; for (int i = 1; i
12345678910111213int main() { vector s = { "이름 복사본" }; sort(all(s)); llong sum = 0; for (int i = 0; i
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 int main() { VI yh(10001); for (int i = 1; i
12345678ans = 1;for i in range (1,101): ans *= isum = 0while(ans != 0): sum += ans % 10; ans //= 10;print(sum);cs
1234567891011121314151617181920212223int main() { VI ord = { 0,31,28,31,30,31,30,31,31,30,31,30,31 }; VI yoon = { 0,31,29,31,30,31,30,31,31,30,31,30,31 }; int curDay = 0; int cnt = 0; for (int year = 1900; year
1234567891011121314151617181920212223242526272829int main() { int n = 15; vector a(n, vector(n)); rep(i, 0, n) { rep(j, 0, i+1) { cin >> a[i][j]; } } vector dp(n, vector(n)); dp[0][0] = a[0][0]; rep(i, 1, n) { rep(j, 0, i + 1) { if (j == 0) { dp[i][j] = dp[i - 1][j] + a[i][j]; } else if (j == i) { dp[i][j] = dp[i - 1][j - 1] + a[i][j]; } else { dp[i][j] = max(dp[i - 1][j - 1], dp[i - 1][j]) + a[..
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 int main() { VI a = { -1,3,3,5,4,4,3,5,5,4 }; // one ~ nine VI b = { -1,3,6,6,8,8,7,7,9,8,8,6 }; // ten ~ twenty VI c = { -1,3,6,6,5,5,5,7,6,6 }; // ten ~ ninety int ans = 0; // 1-99 for(int i=1 ; i