diff options
93 files changed, 2604 insertions, 0 deletions
diff --git a/AtCoder/+3+5+7/main b/AtCoder/+3+5+7/main Binary files differnew file mode 100755 index 0000000..54124e1 --- /dev/null +++ b/AtCoder/+3+5+7/main diff --git a/AtCoder/+3+5+7/main.cpp b/AtCoder/+3+5+7/main.cpp new file mode 100755 index 0000000..72da36d --- /dev/null +++ b/AtCoder/+3+5+7/main.cpp @@ -0,0 +1,183 @@ +#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 print() { + cerr << "\n"; +} + +template<typename T, typename... TS> +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, c; + cin >> a >> b >> c; + + // check if the 3 integers are already equal + if (a == b && b == c) { + cout << "0\n"; + return; + } + + + // calculate the differences between the integers + int diff1 = abs(a - b); + int diff2 = abs(b - c); + int diff3 = abs(c - a); + + // sort the differences in ascending order + int diffs[3] = {diff1, diff2, diff3}; + sort(diffs, diffs+3); + + // check if it's possible to make the integers equal + if (diffs[2] > diffs[0] + diffs[1]) { + cout << "-1\n"; + return; + } + + // calculate the number of operations needed + int operations = 0; + if (diffs[0] > 0) { + operations++; + a += 3; + b += 5; + c += 7; + diffs[0] = abs(a - b); + diffs[1] = abs(b - c); + diffs[2] = abs(c - a); + sort(diffs, diffs+3); + } + if (diffs[1] > 0) { + operations++; + a += 3; + b += 5; + c += 7; + } + if (diffs[2] > 0) { + operations++; + a += 3; + b += 5; + c += 7; + } + cout << operations << "\n"; + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/AtCoder/+3+5+7/main_input0.txt b/AtCoder/+3+5+7/main_input0.txt new file mode 100644 index 0000000..224c309 --- /dev/null +++ b/AtCoder/+3+5+7/main_input0.txt @@ -0,0 +1,5 @@ +4 +2 8 8 +1 1 1 +5 5 10 +10 100 1000 diff --git a/AtCoder/+3+5+7/main_output0.txt b/AtCoder/+3+5+7/main_output0.txt new file mode 100644 index 0000000..19ef3e0 --- /dev/null +++ b/AtCoder/+3+5+7/main_output0.txt @@ -0,0 +1,4 @@ +2 +0 +-1 +315 diff --git a/AtCoder/CallTheIdNumber/main b/AtCoder/CallTheIdNumber/main Binary files differnew file mode 100755 index 0000000..a4d9237 --- /dev/null +++ b/AtCoder/CallTheIdNumber/main diff --git a/AtCoder/CallTheIdNumber/main.cpp b/AtCoder/CallTheIdNumber/main.cpp new file mode 100755 index 0000000..b0d575d --- /dev/null +++ b/AtCoder/CallTheIdNumber/main.cpp @@ -0,0 +1,149 @@ +#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 print() { + cerr << "\n"; +} + +template<typename T, typename... TS> +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds |