From 2842e9ef52d61fb52228ef4d7bc45f5aeb954ab3 Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Thu, 30 Mar 2023 23:38:17 +0200 Subject: Solved a couple of problem on codeforces --- codeforces/AllDistinct/main | Bin 0 -> 38264 bytes codeforces/AllDistinct/main.cpp | 146 +++++++++++++++++++ codeforces/AllDistinct/main_input0.txt | 9 ++ codeforces/AllDistinct/main_output0.txt | 4 + codeforces/LuckyNumbers/main | Bin 0 -> 26936 bytes codeforces/LuckyNumbers/main.cpp | 172 +++++++++++++++++++++++ codeforces/LuckyNumbers/main_input0.txt | 6 + codeforces/LuckyNumbers/main_input1.txt | 2 + codeforces/LuckyNumbers/main_output0.txt | 5 + codeforces/LuckyNumbers/main_output1.txt | 1 + codeforces/Marthon/main | Bin 0 -> 42736 bytes codeforces/Marthon/main.cpp | 139 ++++++++++++++++++ codeforces/Marthon/main_input0.txt | 5 + codeforces/Marthon/main_output0.txt | 4 + codeforces/PlayingInCasino/main | Bin 0 -> 65088 bytes codeforces/PlayingInCasino/main.cpp | 151 ++++++++++++++++++++ codeforces/PlayingInCasino/main_input0.txt | 12 ++ codeforces/PlayingInCasino/main_output0.txt | 3 + codeforces/SortZero/main | Bin 0 -> 38528 bytes codeforces/SortZero/main.cpp | 150 ++++++++++++++++++++ codeforces/SortZero/main_input0.txt | 11 ++ codeforces/SortZero/main_output0.txt | 5 + codeforces/Sum/main.cpp | 12 +- codeforces/TaisaAndDice/main | Bin 0 -> 21816 bytes codeforces/TaisaAndDice/main.cpp | 145 +++++++++++++++++++ codeforces/TaisaAndDice/main_input0.txt | 8 ++ codeforces/TaisaAndDice/main_output0.txt | 7 + codeforces/WoefulPermutation/main | Bin 0 -> 17736 bytes codeforces/WoefulPermutation/main.cpp | 136 ++++++++++++++++++ codeforces/WoefulPermutation/main_input0.txt | 3 + codeforces/WoefulPermutation/main_output0.txt | 2 + codeforces/WonderfulPermutation/2 | 144 +++++++++++++++++++ codeforces/WonderfulPermutation/main | Bin 0 -> 39584 bytes codeforces/WonderfulPermutation/main.cpp | 145 +++++++++++++++++++ codeforces/WonderfulPermutation/main_input0.txt | 9 ++ codeforces/WonderfulPermutation/main_output0.txt | 4 + codeforces/Yes-Yes/main | Bin 0 -> 25608 bytes codeforces/Yes-Yes/main.cpp | 148 +++++++++++++++++++ codeforces/Yes-Yes/main.py | 12 ++ codeforces/Yes-Yes/main_input0.txt | 13 ++ codeforces/Yes-Yes/main_input1.txt | 13 ++ codeforces/Yes-Yes/main_output0.txt | 12 ++ codeforces/Yes-Yes/main_output1.txt | 12 ++ codeforces/YetAnotherPromotion/main | Bin 0 -> 17832 bytes codeforces/YetAnotherPromotion/main.cpp | 142 +++++++++++++++++++ codeforces/YetAnotherPromotion/main_input0.txt | 11 ++ codeforces/YetAnotherPromotion/main_output0.txt | 5 + 47 files changed, 1802 insertions(+), 6 deletions(-) create mode 100755 codeforces/AllDistinct/main create mode 100755 codeforces/AllDistinct/main.cpp create mode 100644 codeforces/AllDistinct/main_input0.txt create mode 100644 codeforces/AllDistinct/main_output0.txt create mode 100755 codeforces/LuckyNumbers/main create mode 100755 codeforces/LuckyNumbers/main.cpp create mode 100644 codeforces/LuckyNumbers/main_input0.txt create mode 100644 codeforces/LuckyNumbers/main_input1.txt create mode 100644 codeforces/LuckyNumbers/main_output0.txt create mode 100644 codeforces/LuckyNumbers/main_output1.txt create mode 100755 codeforces/Marthon/main create mode 100755 codeforces/Marthon/main.cpp create mode 100644 codeforces/Marthon/main_input0.txt create mode 100644 codeforces/Marthon/main_output0.txt create mode 100755 codeforces/PlayingInCasino/main create mode 100755 codeforces/PlayingInCasino/main.cpp create mode 100644 codeforces/PlayingInCasino/main_input0.txt create mode 100644 codeforces/PlayingInCasino/main_output0.txt create mode 100755 codeforces/SortZero/main create mode 100755 codeforces/SortZero/main.cpp create mode 100644 codeforces/SortZero/main_input0.txt create mode 100644 codeforces/SortZero/main_output0.txt create mode 100755 codeforces/TaisaAndDice/main create mode 100755 codeforces/TaisaAndDice/main.cpp create mode 100644 codeforces/TaisaAndDice/main_input0.txt create mode 100644 codeforces/TaisaAndDice/main_output0.txt create mode 100755 codeforces/WoefulPermutation/main create mode 100755 codeforces/WoefulPermutation/main.cpp create mode 100644 codeforces/WoefulPermutation/main_input0.txt create mode 100644 codeforces/WoefulPermutation/main_output0.txt create mode 100644 codeforces/WonderfulPermutation/2 create mode 100755 codeforces/WonderfulPermutation/main create mode 100755 codeforces/WonderfulPermutation/main.cpp create mode 100644 codeforces/WonderfulPermutation/main_input0.txt create mode 100644 codeforces/WonderfulPermutation/main_output0.txt create mode 100755 codeforces/Yes-Yes/main create mode 100755 codeforces/Yes-Yes/main.cpp create mode 100644 codeforces/Yes-Yes/main.py create mode 100644 codeforces/Yes-Yes/main_input0.txt create mode 100644 codeforces/Yes-Yes/main_input1.txt create mode 100644 codeforces/Yes-Yes/main_output0.txt create mode 100644 codeforces/Yes-Yes/main_output1.txt create mode 100755 codeforces/YetAnotherPromotion/main create mode 100755 codeforces/YetAnotherPromotion/main.cpp create mode 100644 codeforces/YetAnotherPromotion/main_input0.txt create mode 100644 codeforces/YetAnotherPromotion/main_output0.txt (limited to 'codeforces') diff --git a/codeforces/AllDistinct/main b/codeforces/AllDistinct/main new file mode 100755 index 0000000..aa1f15f Binary files /dev/null and b/codeforces/AllDistinct/main differ diff --git a/codeforces/AllDistinct/main.cpp b/codeforces/AllDistinct/main.cpp new file mode 100755 index 0000000..d8288fc --- /dev/null +++ b/codeforces/AllDistinct/main.cpp @@ -0,0 +1,146 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + int n; + cin >> n; + vi v(n); + set st; + for (auto &x : v) { + cin >> x; + st.insert(x); + } + int distinct = st.size(); + if ((n - distinct) % 2 == 1) { + cout << distinct - 1 << '\n'; + } else { + cout << distinct << '\n'; + } + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/AllDistinct/main_input0.txt b/codeforces/AllDistinct/main_input0.txt new file mode 100644 index 0000000..888e289 --- /dev/null +++ b/codeforces/AllDistinct/main_input0.txt @@ -0,0 +1,9 @@ +4 +6 +2 2 2 3 3 3 +5 +9 1 9 9 1 +4 +15 16 16 15 +4 +10 100 1000 10000 diff --git a/codeforces/AllDistinct/main_output0.txt b/codeforces/AllDistinct/main_output0.txt new file mode 100644 index 0000000..85222d5 --- /dev/null +++ b/codeforces/AllDistinct/main_output0.txt @@ -0,0 +1,4 @@ +2 +1 +2 +4 diff --git a/codeforces/LuckyNumbers/main b/codeforces/LuckyNumbers/main new file mode 100755 index 0000000..506cb3e Binary files /dev/null and b/codeforces/LuckyNumbers/main differ diff --git a/codeforces/LuckyNumbers/main.cpp b/codeforces/LuckyNumbers/main.cpp new file mode 100755 index 0000000..90b029e --- /dev/null +++ b/codeforces/LuckyNumbers/main.cpp @@ -0,0 +1,172 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +vi cache; + + +int getLucky(int n) { + int mx = 0; + int mn = 10; + while(n) { + mx = max(mx, n % 10); + mn = min(mn, n % 10); + n /= 10; + } + return mx - mn; +} + +void fillCache() { + for (int i = 0; i < 1e6 + 3; i++) { + if (getLucky(i) == 9) { + cache.pb(i); + } + } +} + +void solve() { + int l, r; + cin >> l >> r; + pii ans = {0, 0}; + if (r - l >= 100) { + for (auto x : cache) { + if (x >= l && x <= r) { + cout << x << '\n'; + return; + } + } + } + for (int i = l; i <= r; i++) { + int luck = getLucky(i); + if (luck >= ans.first) { + ans = {luck, i}; + } + } + cout << ans.second << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + fillCache(); + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/LuckyNumbers/main_input0.txt b/codeforces/LuckyNumbers/main_input0.txt new file mode 100644 index 0000000..6c4fb52 --- /dev/null +++ b/codeforces/LuckyNumbers/main_input0.txt @@ -0,0 +1,6 @@ +5 +59 63 +42 49 +15 15 +53 57 +1 100 diff --git a/codeforces/LuckyNumbers/main_input1.txt b/codeforces/LuckyNumbers/main_input1.txt new file mode 100644 index 0000000..95bce4d --- /dev/null +++ b/codeforces/LuckyNumbers/main_input1.txt @@ -0,0 +1,2 @@ +1 +1 2 \ No newline at end of file diff --git a/codeforces/LuckyNumbers/main_output0.txt b/codeforces/LuckyNumbers/main_output0.txt new file mode 100644 index 0000000..f5ad0b0 --- /dev/null +++ b/codeforces/LuckyNumbers/main_output0.txt @@ -0,0 +1,5 @@ +60 +49 +15 +57 +90 diff --git a/codeforces/LuckyNumbers/main_output1.txt b/codeforces/LuckyNumbers/main_output1.txt new file mode 100644 index 0000000..c227083 --- /dev/null +++ b/codeforces/LuckyNumbers/main_output1.txt @@ -0,0 +1 @@ +0 \ No newline at end of file diff --git a/codeforces/Marthon/main b/codeforces/Marthon/main new file mode 100755 index 0000000..060071d Binary files /dev/null and b/codeforces/Marthon/main differ diff --git a/codeforces/Marthon/main.cpp b/codeforces/Marthon/main.cpp new file mode 100755 index 0000000..d740ca3 --- /dev/null +++ b/codeforces/Marthon/main.cpp @@ -0,0 +1,139 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + vi v(4); + for (int i = 0; i < 4; ++i) { + cin >> v[i]; + } + int timur = v[0]; + sort(all(v)); + int posTimur = find(all(v), timur) - v.begin(); + cout << 3 - posTimur << "\n"; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/Marthon/main_input0.txt b/codeforces/Marthon/main_input0.txt new file mode 100644 index 0000000..9c4bac8 --- /dev/null +++ b/codeforces/Marthon/main_input0.txt @@ -0,0 +1,5 @@ +4 +2 3 4 1 +10000 0 1 2 +500 600 400 300 +0 9999 10000 9998 diff --git a/codeforces/Marthon/main_output0.txt b/codeforces/Marthon/main_output0.txt new file mode 100644 index 0000000..35f5032 --- /dev/null +++ b/codeforces/Marthon/main_output0.txt @@ -0,0 +1,4 @@ +2 +0 +1 +3 diff --git a/codeforces/PlayingInCasino/main b/codeforces/PlayingInCasino/main new file mode 100755 index 0000000..35326fe Binary files /dev/null and b/codeforces/PlayingInCasino/main differ diff --git a/codeforces/PlayingInCasino/main.cpp b/codeforces/PlayingInCasino/main.cpp new file mode 100755 index 0000000..4c55293 --- /dev/null +++ b/codeforces/PlayingInCasino/main.cpp @@ -0,0 +1,151 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + int n, m; + cin >> n >> m; + ll ans = 0; + vector a(m, vll(n)); + for (int i = 0; i < n; i++) { + vi v(m); + for (int j = 0; j < m; j++) { + cin >> v[j]; + a[j][i] = v[j]; + } + } + for (int i = 0; i < m; i++) { + sort(rall(a[i])); + for (int j = 0; j < n; j++) { + int after = n - 1 - j; + int before = j; + ans += a[i][j] * (after - before); + } + } + cout << ans << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/PlayingInCasino/main_input0.txt b/codeforces/PlayingInCasino/main_input0.txt new file mode 100644 index 0000000..42d5477 --- /dev/null +++ b/codeforces/PlayingInCasino/main_input0.txt @@ -0,0 +1,12 @@ +3 +3 5 +1 4 2 8 5 +7 9 2 1 4 +3 8 5 3 1 +1 4 +4 15 1 10 +4 3 +1 2 3 +3 2 1 +1 2 1 +4 2 7 diff --git a/codeforces/PlayingInCasino/main_output0.txt b/codeforces/PlayingInCasino/main_output0.txt new file mode 100644 index 0000000..9c33d42 --- /dev/null +++ b/codeforces/PlayingInCasino/main_output0.txt @@ -0,0 +1,3 @@ +50 +0 +31 diff --git a/codeforces/SortZero/main b/codeforces/SortZero/main new file mode 100755 index 0000000..4f0d902 Binary files /dev/null and b/codeforces/SortZero/main differ diff --git a/codeforces/SortZero/main.cpp b/codeforces/SortZero/main.cpp new file mode 100755 index 0000000..eadfde0 --- /dev/null +++ b/codeforces/SortZero/main.cpp @@ -0,0 +1,150 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH +*/ + +void solve() { + int n; + cin >> n; + vi v(n); + set st; + for (int i = 0; i < n; ++i) { + cin >> v[i]; + } + int ans = 0; + for (int i = 0; i > n - 1; i++) { + if (st.count(v[i])) { + v[i] = 0; + } + if (v[i] > v[i + 1] && !st.count(v[i - 1])) { + ans++; + st.insert(v[i]); + } + } + cout << ans << '\n'; + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/SortZero/main_input0.txt b/codeforces/SortZero/main_input0.txt new file mode 100644 index 0000000..2ea8bd6 --- /dev/null +++ b/codeforces/SortZero/main_input0.txt @@ -0,0 +1,11 @@ +5 +3 +3 3 2 +4 +1 3 1 3 +5 +4 1 5 3 2 +4 +2 4 1 2 +1 +1 diff --git a/codeforces/SortZero/main_output0.txt b/codeforces/SortZero/main_output0.txt new file mode 100644 index 0000000..5f663ea --- /dev/null +++ b/codeforces/SortZero/main_output0.txt @@ -0,0 +1,5 @@ +1 +2 +4 +3 +0 diff --git a/codeforces/Sum/main.cpp b/codeforces/Sum/main.cpp index f9def9b..ca01bb8 100755 --- a/codeforces/Sum/main.cpp +++ b/codeforces/Sum/main.cpp @@ -1,5 +1,5 @@ #include -#include +#include using namespace std; @@ -25,21 +25,21 @@ const int dy[4]{0, 1, 0, -1}; void solve() { vi v(3); - for (auto &x : v) cin >> x; - if (v[0] + v[1] == v[2] || v[1] + v[2] == v[0] || v[0] + v[2] == v[1]) { + for (auto &x : v) + cin >> x; + if (v[0] + v[1] == v[2] || v[1] + v[2] == v[0] || v[0] + v[2] == v[1]) { cout << "YES" << '\n'; } else { cout << "NO" << '\n'; } - } -int main () { +int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int tt; cin >> tt; - while(tt--) { + while (tt--) { solve(); } } diff --git a/codeforces/TaisaAndDice/main b/codeforces/TaisaAndDice/main new file mode 100755 index 0000000..b2b0863 Binary files /dev/null and b/codeforces/TaisaAndDice/main differ diff --git a/codeforces/TaisaAndDice/main.cpp b/codeforces/TaisaAndDice/main.cpp new file mode 100755 index 0000000..998f379 --- /dev/null +++ b/codeforces/TaisaAndDice/main.cpp @@ -0,0 +1,145 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + + +void solve() { + int n, s, r; + cin >> n >> s >> r; + int last = s - r; + vi ans(n - 1, r / (n - 1)); + int mod = r % (n - 1); + print(mod); + for (int i = 0; i < n - 1; ++i) { + int add = min(mod, last - ans[i]); + ans[i] += add; + mod -= add; + cout << ans[i] << " "; + } + cout << last << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/TaisaAndDice/main_input0.txt b/codeforces/TaisaAndDice/main_input0.txt new file mode 100644 index 0000000..c035cd3 --- /dev/null +++ b/codeforces/TaisaAndDice/main_input0.txt @@ -0,0 +1,8 @@ +7 +2 2 1 +2 4 2 +4 9 5 +5 17 11 +3 15 10 +4 4 3 +5 20 15 diff --git a/codeforces/TaisaAndDice/main_output0.txt b/codeforces/TaisaAndDice/main_output0.txt new file mode 100644 index 0000000..52b2e08 --- /dev/null +++ b/codeforces/TaisaAndDice/main_output0.txt @@ -0,0 +1,7 @@ +1 1 +2 2 +1 2 2 4 +6 4 2 3 2 +5 5 5 +1 1 1 1 +1 4 5 5 5 diff --git a/codeforces/WoefulPermutation/main b/codeforces/WoefulPermutation/main new file mode 100755 index 0000000..dc1cec9 Binary files /dev/null and b/codeforces/WoefulPermutation/main differ diff --git a/codeforces/WoefulPermutation/main.cpp b/codeforces/WoefulPermutation/main.cpp new file mode 100755 index 0000000..f58af1e --- /dev/null +++ b/codeforces/WoefulPermutation/main.cpp @@ -0,0 +1,136 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + int n; + cin >> n; + for (int i = n; i > 0; i--) { + cout << i << " \n"[i == 1]; + } +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/WoefulPermutation/main_input0.txt b/codeforces/WoefulPermutation/main_input0.txt new file mode 100644 index 0000000..5357a4a --- /dev/null +++ b/codeforces/WoefulPermutation/main_input0.txt @@ -0,0 +1,3 @@ +2 +1 +2 diff --git a/codeforces/WoefulPermutation/main_output0.txt b/codeforces/WoefulPermutation/main_output0.txt new file mode 100644 index 0000000..0bdc75b --- /dev/null +++ b/codeforces/WoefulPermutation/main_output0.txt @@ -0,0 +1,2 @@ +1 +2 1 diff --git a/codeforces/WonderfulPermutation/2 b/codeforces/WonderfulPermutation/2 new file mode 100644 index 0000000..0d1d720 --- /dev/null +++ b/codeforces/WonderfulPermutation/2 @@ -0,0 +1,144 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + int n, k; + cin >> n >> k; + int ans = 0; + for (int i = 0; i < n; i++) { + int x; + cin >> x; + } + for (int i = 0; i < k; i++) { + if (v[i] != i + 1){ + ans++; + } + } + cout << ans << "\n"; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/WonderfulPermutation/main b/codeforces/WonderfulPermutation/main new file mode 100755 index 0000000..adb9603 Binary files /dev/null and b/codeforces/WonderfulPermutation/main differ diff --git a/codeforces/WonderfulPermutation/main.cpp b/codeforces/WonderfulPermutation/main.cpp new file mode 100755 index 0000000..9e41d98 --- /dev/null +++ b/codeforces/WonderfulPermutation/main.cpp @@ -0,0 +1,145 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + int n, k; + cin >> n >> k; + vi v(n); + int ans = 0; + for (int i = 0; i < n; i++) { + cin >> v[i]; + } + sort(v.begin(), v.begin() + k); + for (int i = 0; i < k; i++) { + if (v[i] > k){ + ans++; + } + } + cout << ans << "\n"; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/WonderfulPermutation/main_input0.txt b/codeforces/WonderfulPermutation/main_input0.txt new file mode 100644 index 0000000..7f317c5 --- /dev/null +++ b/codeforces/WonderfulPermutation/main_input0.txt @@ -0,0 +1,9 @@ +4 +3 1 +2 3 1 +3 3 +1 2 3 +4 2 +3 4 1 2 +1 1 +1 diff --git a/codeforces/WonderfulPermutation/main_output0.txt b/codeforces/WonderfulPermutation/main_output0.txt new file mode 100644 index 0000000..98222a0 --- /dev/null +++ b/codeforces/WonderfulPermutation/main_output0.txt @@ -0,0 +1,4 @@ +1 +0 +2 +0 diff --git a/codeforces/Yes-Yes/main b/codeforces/Yes-Yes/main new file mode 100755 index 0000000..2447a9c Binary files /dev/null and b/codeforces/Yes-Yes/main differ diff --git a/codeforces/Yes-Yes/main.cpp b/codeforces/Yes-Yes/main.cpp new file mode 100755 index 0000000..0598977 --- /dev/null +++ b/codeforces/Yes-Yes/main.cpp @@ -0,0 +1,148 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + string s; + cin >> s; + int n = s.size(); + string yes = "Yes"; + int pos = yes.find(s[0]); + if (pos == string:: npos) { + cout << "NO\n"; + return; + } + for (int i = 0; i < n; i++) { + if (s[i] != yes[pos]) { + cout << "NO\n"; + return; + } + pos = (pos + 1) % 3; + } + cout << "YES\n"; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/Yes-Yes/main.py b/codeforces/Yes-Yes/main.py new file mode 100644 index 0000000..1592898 --- /dev/null +++ b/codeforces/Yes-Yes/main.py @@ -0,0 +1,12 @@ + +tt = int(input()) +for _ in range(tt): + s = input() + new_s = "Yes" * 20 + if s in new_s: + print("YES") + else: + print("NO") + + + diff --git a/codeforces/Yes-Yes/main_input0.txt b/codeforces/Yes-Yes/main_input0.txt new file mode 100644 index 0000000..c414842 --- /dev/null +++ b/codeforces/Yes-Yes/main_input0.txt @@ -0,0 +1,13 @@ +12 +YES +esYes +codeforces +es +se +YesY +esYesYesYesYesYesYe +seY +Yess +sY +o +Yes diff --git a/codeforces/Yes-Yes/main_input1.txt b/codeforces/Yes-Yes/main_input1.txt new file mode 100644 index 0000000..e7266e5 --- /dev/null +++ b/codeforces/Yes-Yes/main_input1.txt @@ -0,0 +1,13 @@ +12 +YES +esYes +codeforces +es +se +YesY +esYesYesYesYesYesYe +seY +Yess +sY +o +Yes \ No newline at end of file diff --git a/codeforces/Yes-Yes/main_output0.txt b/codeforces/Yes-Yes/main_output0.txt new file mode 100644 index 0000000..ecc7c29 --- /dev/null +++ b/codeforces/Yes-Yes/main_output0.txt @@ -0,0 +1,12 @@ +NO +YES +NO +YES +NO +YES +YES +NO +NO +YES +NO +YES diff --git a/codeforces/Yes-Yes/main_output1.txt b/codeforces/Yes-Yes/main_output1.txt new file mode 100644 index 0000000..ecc7c29 --- /dev/null +++ b/codeforces/Yes-Yes/main_output1.txt @@ -0,0 +1,12 @@ +NO +YES +NO +YES +NO +YES +YES +NO +NO +YES +NO +YES diff --git a/codeforces/YetAnotherPromotion/main b/codeforces/YetAnotherPromotion/main new file mode 100755 index 0000000..798f6a8 Binary files /dev/null and b/codeforces/YetAnotherPromotion/main differ diff --git a/codeforces/YetAnotherPromotion/main.cpp b/codeforces/YetAnotherPromotion/main.cpp new file mode 100755 index 0000000..1bb5eb9 --- /dev/null +++ b/codeforces/YetAnotherPromotion/main.cpp @@ -0,0 +1,142 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + int a, b; + cin >> a >> b; + int n, m; + cin >> n >> m; + ll ans = 0; + ll tmp = (a / (m + 1)); + ans += a * tmp; + n -= tmp + (tmp / m); + print(tmp); + ans += min(a * n, b * n); + cout << ans << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/YetAnotherPromotion/main_input0.txt b/codeforces/YetAnotherPromotion/main_input0.txt new file mode 100644 index 0000000..385279a --- /dev/null +++ b/codeforces/YetAnotherPromotion/main_input0.txt @@ -0,0 +1,11 @@ +5 +5 4 +3 1 +5 4 +3 2 +3 4 +3 5 +20 15 +10 2 +1000000000 900000000 +1000000000 8 diff --git a/codeforces/YetAnotherPromotion/main_output0.txt b/codeforces/YetAnotherPromotion/main_output0.txt new file mode 100644 index 0000000..5aeb0c1 --- /dev/null +++ b/codeforces/YetAnotherPromotion/main_output0.txt @@ -0,0 +1,5 @@ +9 +10 +9 +135 +888888888900000000 -- cgit v1.2.3