diff options
| author | omagdy7 <omar.professional8777@gmail.com> | 2023-07-24 13:11:33 +0300 |
|---|---|---|
| committer | omagdy7 <omar.professional8777@gmail.com> | 2023-07-24 13:11:33 +0300 |
| commit | 6b548332bfc6469756526002971c422f43f86d0a (patch) | |
| tree | 261fde23f07c3e20cea375030f0c52863b59228c /codechef/EndlessAppetizers | |
| parent | cff8cae22ee9c25d193ff976143813f93e658e55 (diff) | |
| download | competitive-programming-6b548332bfc6469756526002971c422f43f86d0a.tar.xz competitive-programming-6b548332bfc6469756526002971c422f43f86d0a.zip | |
Removed some empty *.cpp files and Solved some new problems
Diffstat (limited to 'codechef/EndlessAppetizers')
| -rwxr-xr-x | codechef/EndlessAppetizers/main | bin | 0 -> 16520 bytes | |||
| -rwxr-xr-x | codechef/EndlessAppetizers/main.cpp | 133 | ||||
| -rw-r--r-- | codechef/EndlessAppetizers/main_input0.txt | 5 | ||||
| -rw-r--r-- | codechef/EndlessAppetizers/main_output0.txt | 4 |
4 files changed, 142 insertions, 0 deletions
diff --git a/codechef/EndlessAppetizers/main b/codechef/EndlessAppetizers/main Binary files differnew file mode 100755 index 0000000..7b5c95a --- /dev/null +++ b/codechef/EndlessAppetizers/main 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 <bits/stdc++.h> +using namespace std; + +using ll = long long; +using pii = pair<int, int>; +using vpi = vector<pii>; +using vi = vector<int>; +using vll = vector<long long>; +using mpii = map<int, int>; +using mpll = map<ll, ll>; +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 <typename K, typename V> +ostream &operator<<(ostream &os, const pair<K, V> &p); +template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec); +template <typename K, typename V> +ostream &operator<<(ostream &os, const map<K, V> &m); +template <typename K, typename V> +ostream &operator<<(ostream &os, const unordered_map<K, V> &m); +template <typename T> ostream &operator<<(ostream &os, const set<T> &s); +template <typename T> +ostream &operator<<(ostream &os, const unordered_set<T> &s); + +template <typename K, typename V> +ostream &operator<<(ostream &os, const pair<K, V> &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template <typename K, typename V> +ostream &operator<<(ostream &os, const map<K, V> &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template <typename K, typename V> +ostream &operator<<(ostream &os, const unordered_map<K, V> &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template <typename T> ostream &operator<<(ostream &os, const set<T> &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template <typename T> +ostream &operator<<(ostream &os, const unordered_set<T> &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 <typename T, typename... TS> 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 |
