Segcolt/Codeforces-solutions
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Add a bunch of other problems.

Browse Source 
Some are not finished...
This commit is contained in:
Segcolt
2025-09-12 14:50:25 -03:00
parent 88e542c982
commit 489cb2ba51
385 changed files with 49442 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

101
Codeforces Round 991 (Div. 3)/A. Line Breaks.cpp Normal file
View File

@@ -0,0 +1,101 @@
/* Problem URL: https://codeforces.com/contest/2050/problem/A */
#include <bits/stdc++.h>
using namespace std;
#define V vector
#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)
#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;
template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
os << vec[0];
for (size_t i = 1; i < vec.size(); i++) {
os << ' ' << vec[i];
}
os << '\n';
return os;
}
template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
for (auto &i : vec) {
is >> i;
}
return is;
}
template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
for (auto &i : vec) {
os << i[0];
for (size_t j = 1; j < i.size(); j++) {
os << ' ' << i[j];
}
os << '\n';
}
return os;
}
template<class v>
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
for (auto &i : vec) {
for (auto &j : i) {
is >> j;
}
}
return is;
}
bool comp(const string &a, const string &b)
{
return a.size() < b.size();
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
ll n, m;
cin >> n >> m;
V<string> fds(n);
cin >> fds;
size_t i = 0;
ll total = 0;
while (i < fds.size() && total + fds[i].size() <= m) {
total += fds[i].size();
i++;
}
cout << i << '\n';
}
}

106
Codeforces Round 991 (Div. 3)/B. Transfusion.cpp Normal file
View File

@@ -0,0 +1,106 @@
/* Problem URL: https://codeforces.com/contest/2050/problem/B */
#include <bits/stdc++.h>
using namespace std;
#define V vector
#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)
#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;
template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
os << vec[0];
for (size_t i = 1; i < vec.size(); i++) {
os << ' ' << vec[i];
}
os << '\n';
return os;
}
template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
for (auto &i : vec) {
is >> i;
}
return is;
}
template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
for (auto &i : vec) {
os << i[0];
for (size_t j = 1; j < i.size(); j++) {
os << ' ' << i[j];
}
os << '\n';
}
return os;
}
template<class v>
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
for (auto &i : vec) {
for (auto &j : i) {
is >> j;
}
}
return is;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vl fds(n);
cin >> fds;
ll odd = 0;
ll even = 0;
ll odds = 0;
ll evens = 0;
rep(i, n) {
if (i & 1) {
odds++;
odd += fds[i];
} else {
evens++;
even += fds[i];
}
}
if (odd % odds == 0 && even % evens == 0 && odd / odds == even / evens) {
cout << "YES\n";
continue;
}
cout << "NO\n";
}
}

115
Codeforces Round 991 (Div. 3)/C. Uninteresting Number.cpp Normal file
View File

@@ -0,0 +1,115 @@
/* Problem URL: https://codeforces.com/contest/2050/problem/C */
#include <bits/stdc++.h>
using namespace std;
#define V vector
#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)
#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;
template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
os << vec[0];
for (size_t i = 1; i < vec.size(); i++) {
os << ' ' << vec[i];
}
os << '\n';
return os;
}
template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
for (auto &i : vec) {
is >> i;
}
return is;
}
template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
for (auto &i : vec) {
os << i[0];
for (size_t j = 1; j < i.size(); j++) {
os << ' ' << i[j];
}
os << '\n';
}
return os;
}
template<class v>
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
for (auto &i : vec) {
for (auto &j : i) {
is >> j;
}
}
return is;
}
bool vis[9];
void pos(int mod, int two, int three)
{
vis[mod] = true;
if (!vis[(mod + 2) % 9] && two > 0) {
pos((mod + 2) % 9, two - 1, three);
}
if (!vis[(mod + 6) % 9] && three > 0) {
pos((mod + 6) % 9, two, three - 1);
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
string a;
cin >> a;
ll total = 0;
ll three = 0;
ll two = 0;
repv(i, a) {
total += i - '0';
if (i == '3') {
three++;
} else if (i == '2') {
two++;
}
}
memset(vis, 0, sizeof(vis));
pos(total % 9, two, three);
cout << (vis[0] ? "YES\n" : "NO\n");
}
}

101
Codeforces Round 991 (Div. 3)/D. Digital string maximization.cpp Normal file
View File

@@ -0,0 +1,101 @@
/* Problem URL: https://codeforces.com/contest/2050/problem/D */
#include <bits/stdc++.h>
using namespace std;
#define V vector
#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)
#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;
template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
os << vec[0];
for (size_t i = 1; i < vec.size(); i++) {
os << ' ' << vec[i];
}
os << '\n';
return os;
}
template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
for (auto &i : vec) {
is >> i;
}
return is;
}
template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
for (auto &i : vec) {
os << i[0];
for (size_t j = 1; j < i.size(); j++) {
os << ' ' << i[j];
}
os << '\n';
}
return os;
}
template<class v>
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
for (auto &i : vec) {
for (auto &j : i) {
is >> j;
}
}
return is;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
string a;
cin >> a;
rep(i, a.size()) {
size_t choice = i;
char max = a[i];
nrep(j, 1, 9) {
if (i + j < a.size() && a[i + j] - j > max) {
choice = i + j;
max = a[i + j] - j;
}
}
for (size_t j = choice; j > i; j--) {
swap(a[j - 1], a[j]);
}
a[i] = max;
}
cout << a << '\n';
}
}

162
Codeforces Round 991 (Div. 3)/E. Three Strings.cpp Normal file
View File

@@ -0,0 +1,162 @@
/* Problem URL: https://codeforces.com/contest/2050/problem/F */
#include <bits/stdc++.h>
using namespace std;
#define V vector
#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)
#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;
template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
os << vec[0];
for (size_t i = 1; i < vec.size(); i++) {
os << ' ' << vec[i];
}
os << '\n';
return os;
}
template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
for (auto &i : vec) {
is >> i;
}
return is;
}
template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
for (auto &i : vec) {
os << i[0];
for (size_t j = 1; j < i.size(); j++) {
os << ' ' << i[j];
}
os << '\n';
}
return os;
}
template<class v>
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
for (auto &i : vec) {
for (auto &j : i) {
is >> j;
}
}
return is;
}
int dp(int i, int j, int k, string &a, string &b, string &c)
{
if (k >= c.size()) {
return 0;
}
if (i >= a.size()) {
ll tmp = 0;
while (j < b.size()) {
if (b[j] != c[k]) {
tmp++;
}
j++;
k++;
}
return tmp;
}
if (j >= b.size()) {
ll tmp = 0;
while (i < a.size()) {
if (a[i] != c[k]) {
tmp++;
}
i++;
k++;
}
return tmp;
}
if (a[i] != c[k] && b[j] != c[k]) {
return min(dp(i + 1, j, k + 1, a, b, c), dp(i, j + 1, k + 1, a, b, c)) + 1;
}
if (a[i] == b[j]) {
return min(dp(i + 1, j, k + 1, a, b, c), dp(i, j + 1, k + 1, a, b, c));
}
if (a[i] == c[k]) {
return dp(i + 1, j, k + 1, a, b, c);
}
return dp(i, j + 1, k + 1, a, b, c);
}
int inf = INT32_MAX >> 1;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
string a, b, c;
cin >> a >> b >> c;
// cout << dp(0, 0, 0, a, b, c) << '\n';
vvi dp(a.size() + 1, vi(b.size() + 1, inf));
dp[0][0] = 0;
for (size_t i = 0; i <= a.size(); i++) {
for (size_t j = 0; j <= b.size(); j++) {
if (i == 0 && j == 0) {
continue;
}
if (i > 0) {
if (a[i - 1] == c[i + j - 1]) {
rmin(dp[i][j], dp[i - 1][j]);
} else {
rmin(dp[i][j], dp[i - 1][j] + 1);
}
}
if (j > 0) {
if (b[j - 1] == c[i + j - 1]) {
rmin(dp[i][j], dp[i][j - 1]);
} else {
rmin(dp[i][j], dp[i][j - 1] + 1);
}
}
}
}
cout << dp[a.size()][b.size()] << '\n';
}
}

106
Codeforces Round 991 (Div. 3)/F. Maximum modulo equality.cpp Normal file
View File

@@ -0,0 +1,106 @@
/* Problem URL: https://codeforces.com/contest/2050/problem/F */
#include <bits/stdc++.h>
using namespace std;
#define V vector
#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)
#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;
template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
os << vec[0];
for (size_t i = 1; i < vec.size(); i++) {
os << ' ' << vec[i];
}
os << '\n';
return os;
}
template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
for (auto &i : vec) {
is >> i;
}
return is;
}
template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
for (auto &i : vec) {
os << i[0];
for (size_t j = 1; j < i.size(); j++) {
os << ' ' << i[j];
}
os << '\n';
}
return os;
}
template<class v>
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
for (auto &i : vec) {
for (auto &j : i) {
is >> j;
}
}
return is;
}
int dp(int i, int j, int k, string &a, string &b, string &c)
{
if (i >= a.size() || j >= b.size() || k >= c.size()) {
return 0;
}
if (a[i] != c[k] && b[j] != c[k]) {
return min(dp(i + 1, j, k + 1, a, b, c), dp(i, j + 1, k, a, b, c)) + 1;
}
if (a[i] == b[j]) {
return min(dp(i + 1, j, k + 1, a, b, c), dp(i, j + 1, k, a, b, c));
}
if (a[i] == c[k]) {
return dp(i + 1, j, k + 1, a, b, c);
}
return dp(i, j + 1, k + 1, a, b, c);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
string a, b, c;
cin >> a >> b >> c;
cout << dp(0, 0, 0, a, b, c) << '\n';
}
}