From 6b548332bfc6469756526002971c422f43f86d0a Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Mon, 24 Jul 2023 13:11:33 +0300 Subject: Removed some empty *.cpp files and Solved some new problems --- codechef/CardSwipe/main | Bin 0 -> 27312 bytes codechef/CardSwipe/main.cpp | 149 ++++++++++++++++++++++++++++ codechef/CardSwipe/main_input0.txt | 9 ++ codechef/CardSwipe/main_output0.txt | 4 + codechef/EndlessAppetizers/main | Bin 0 -> 16520 bytes codechef/EndlessAppetizers/main.cpp | 133 +++++++++++++++++++++++++ codechef/EndlessAppetizers/main_input0.txt | 5 + codechef/EndlessAppetizers/main_output0.txt | 4 + codechef/ExclusionInclusion/main.cpp | 129 ++++++++++++++++++++++++ 9 files changed, 433 insertions(+) create mode 100755 codechef/CardSwipe/main create mode 100755 codechef/CardSwipe/main.cpp create mode 100644 codechef/CardSwipe/main_input0.txt create mode 100644 codechef/CardSwipe/main_output0.txt create mode 100755 codechef/EndlessAppetizers/main create mode 100755 codechef/EndlessAppetizers/main.cpp create mode 100644 codechef/EndlessAppetizers/main_input0.txt create mode 100644 codechef/EndlessAppetizers/main_output0.txt create mode 100755 codechef/ExclusionInclusion/main.cpp (limited to 'codechef') diff --git a/codechef/CardSwipe/main b/codechef/CardSwipe/main new file mode 100755 index 0000000..442822a Binary files /dev/null and b/codechef/CardSwipe/main differ diff --git a/codechef/CardSwipe/main.cpp b/codechef/CardSwipe/main.cpp new file mode 100755 index 0000000..8fb10a3 --- /dev/null +++ b/codechef/CardSwipe/main.cpp @@ -0,0 +1,149 @@ +#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 dbg() { cerr << "\n"; } + +template void dbg(T val, TS... vals) { + cerr << val << " "; + dbg(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); + vector in(n + 1, false); + for (auto &x : v) { + cin >> x; + } + int cur = 0; + int mx = 0; + for (int i = 0; i < n; i++) { + in[v[i]] = !in[v[i]]; + if (in[v[i]]) { + cur += 1; + } else { + cur -= 1; + } + mx = max(mx, cur); + } + cout << mx << '\n'; +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/codechef/CardSwipe/main_input0.txt b/codechef/CardSwipe/main_input0.txt new file mode 100644 index 0000000..7a2fb44 --- /dev/null +++ b/codechef/CardSwipe/main_input0.txt @@ -0,0 +1,9 @@ +4 +4 +1 2 2 1 +4 +1 1 1 2 +5 +3 5 2 4 1 +5 +1 2 1 5 4 diff --git a/codechef/CardSwipe/main_output0.txt b/codechef/CardSwipe/main_output0.txt new file mode 100644 index 0000000..cf52223 --- /dev/null +++ b/codechef/CardSwipe/main_output0.txt @@ -0,0 +1,4 @@ +2 +2 +5 +3 diff --git a/codechef/EndlessAppetizers/main b/codechef/EndlessAppetizers/main new file mode 100755 index 0000000..7b5c95a Binary files /dev/null and b/codechef/EndlessAppetizers/main differ diff --git a/codechef/EndlessAppetizers/main.cpp b/codechef/EndlessAppetizers/main.cpp new file mode 100755 index 0000000..bed7693 --- /dev/null +++ b/codechef/EndlessAppetizers/main.cpp @@ -0,0 +1,133 @@ +#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 dbg() { cerr << "\n"; } + +template void dbg(T val, TS... vals) { + cerr << val << " "; + dbg(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 x, y, r; + cin >> x >> y >> r; + cout << ceil(x + (r / 30), y) << "\n"; +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/codechef/EndlessAppetizers/main_input0.txt b/codechef/EndlessAppetizers/main_input0.txt new file mode 100644 index 0000000..2b97e28 --- /dev/null +++ b/codechef/EndlessAppetizers/main_input0.txt @@ -0,0 +1,5 @@ +4 +7 5 30 +16 5 0 +15 9 120 +23 1 2130 diff --git a/codechef/EndlessAppetizers/main_output0.txt b/codechef/EndlessAppetizers/main_output0.txt new file mode 100644 index 0000000..058ecfd --- /dev/null +++ b/codechef/EndlessAppetizers/main_output0.txt @@ -0,0 +1,4 @@ +2 +4 +3 +94 diff --git a/codechef/ExclusionInclusion/main.cpp b/codechef/ExclusionInclusion/main.cpp new file mode 100755 index 0000000..20800e5 --- /dev/null +++ b/codechef/ExclusionInclusion/main.cpp @@ -0,0 +1,129 @@ +#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 dbg() { cerr << "\n"; } + +template void dbg(T val, TS... vals) { + cerr << val << " "; + dbg(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 main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} -- cgit v1.2.3