목록2025/01 (8)
정화 코딩
[C++] 행렬 제곱 (백준 10830번)
https://www.acmicpc.net/problem/10830 #include #include using namespace std;int n;long long b;int mod = 1000;vector> mpow(vector> a, long long c) { vector> res(n, vector(n)); if (c == 1) { return a; } else if (c % 2 == 0) { vector> tmp = mpow(a, c / 2); for (int i = 0; i > tmp = mpow(a, c - 1); for (int i = 0; i > n >> b; vector> a(n, vector(n)); for (i..
[C++] 에디터 (백준 1406번)
https://www.acmicpc.net/problem/1406 #include #include using namespace std;int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string s; cin >> s; list li(s.begin(), s.end()); int n; cin >> n; // 최초의 커서 위치는 문장의 맨 뒤 auto cur = li.end(); while (n--) { char cmd; cin >> cmd; if (cmd == 'L') { // 커서가 맨 앞이 아니라면 한 칸 앞으로 이동..
[C++] Φ² (백준 30885번)
https://www.acmicpc.net/problem/30885 #include #include using namespace std;int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); list> li; int n; cin >> n; for (int i = 1; i > x; li.emplace_back(x, i); } while (li.size() > 1) { for (auto i = li.begin(); i != li.end(); i++) { long long a = i->first; // 현재 가리키고 있는 미생물의 크기 ..
[C++] 버블버블 (백준 31870번)
https://www.acmicpc.net/problem/31870 #include #include #include using namespace std;int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector a(n); for (int i = 0; i > a[i]; int ans = 1000000000; for (int k = 0; k at = a; int cnt = 0; for (int i = n - 1; i > 0; i--) { if (i == k) { reverse(at.b..
[C++] 악마 게임 (백준 16677번)
https://www.acmicpc.net/problem/16677 #include using namespace std;int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string s; int n; cin >> s >> n; int sn = s.size(); double ans = 0; string anss = "No Jam"; while (n--) { string a; double g; cin >> a >> g; int an = a.size(); int cnt = 0; int idx1 = 0; ..
[C++] D-Day (백준 1308번)
https://www.acmicpc.net/problem/1308 #include using namespace std;bool isleap(int n) { if (n % 4 == 0) { if (n % 100 == 0) { if (n % 400 == 0) return true; else return false; } return true; } return false;}int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int month[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, ..
[C++] 이동하기 (백준 11048번)
https://www.acmicpc.net/problem/11048 #include #include #include using namespace std;int dx[3] = {1, 0, 1};int dy[3] = {0, 1, 1};vector> a;int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; a = vector>(n, vector(m)); for (int i = 0; i > a[i][j]; } } queue> q; q.push({0, 0, a[0][0]}); int ans = 0; while (!q.empty..
[C++] 수위 아저씨의 고민 (백준 9048번)
https://www.acmicpc.net/problem/9048 #include #include using namespace std;int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int f, r, n; cin >> f >> r >> n; int ans = 2 * f + (r + 1); vector up(f + 1, 0); vector down(f + 1, r + 1); for (int i = 0; i > a >> b; if (b 처음에는 각 ..