diff options
Diffstat (limited to 'AtCoder')
24 files changed, 662 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 + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ +// 1 0 1 1 0 + +void solve() { + int n; + cin >> n; + vi v(n); + vector<bool> checked(n); + int len = n; + for (auto &x : v) cin >> x; + for (int i = 0; i < n; i++) { + if (!checked[i]) { + checked[v[i] - 1] = true; + len--; + } + } + cout << count(all(checked), false) << '\n'; + for (int i = 0; i < checked.size(); i++) { + if (!checked[i]) { + cout << i + 1 << ' '; + } + } + cout << '\n'; + + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + solve(); +} + + diff --git a/AtCoder/CallTheIdNumber/main_input0.txt b/AtCoder/CallTheIdNumber/main_input0.txt new file mode 100644 index 0000000..60c723c --- /dev/null +++ b/AtCoder/CallTheIdNumber/main_input0.txt @@ -0,0 +1,2 @@ +5 +3 1 4 5 4 diff --git a/AtCoder/CallTheIdNumber/main_input1.txt b/AtCoder/CallTheIdNumber/main_input1.txt new file mode 100644 index 0000000..d4e3ed5 --- /dev/null +++ b/AtCoder/CallTheIdNumber/main_input1.txt @@ -0,0 +1,2 @@ +20 +9 7 19 7 10 4 13 9 4 8 10 15 16 3 18 19 12 13 2 12 diff --git a/AtCoder/CallTheIdNumber/main_output0.txt b/AtCoder/CallTheIdNumber/main_output0.txt new file mode 100644 index 0000000..810122a --- /dev/null +++ b/AtCoder/CallTheIdNumber/main_output0.txt @@ -0,0 +1,2 @@ +2 +2 4 diff --git a/AtCoder/CallTheIdNumber/main_output1.txt b/AtCoder/CallTheIdNumber/main_output1.txt new file mode 100644 index 0000000..78d261c --- /dev/null +++ b/AtCoder/CallTheIdNumber/main_output1.txt @@ -0,0 +1,2 @@ +10 +1 2 5 6 8 11 14 17 18 20 diff --git a/AtCoder/MakeTakahashiHappy/main b/AtCoder/MakeTakahashiHappy/main Binary files differnew file mode 100755 index 0000000..14e1052 --- /dev/null +++ b/AtCoder/MakeTakahashiHappy/main diff --git a/AtCoder/MakeTakahashiHappy/main.cpp b/AtCoder/MakeTakahashiHappy/main.cpp new file mode 100755 index 0000000..0a44517 --- /dev/null +++ b/AtCoder/MakeTakahashiHappy/main.cpp @@ -0,0 +1,155 @@ +#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 + */ + +bool is_valid(int x, int y, int m, int n) { + return x >= 0 && y >= 0 && x < m && y < n; +} + +void solve() { + int h, w; + cin >> h >> w; + vector<vi> grid(h, vector<int>(w)); + for (auto &r : grid) { + for (auto &c : r) { + cin >> c; + } + } + function<void(int, int)> dfs = [&](int x, int y) { + set<int> st; + print(x, y); + if (x == h && y == w) { + print("-------------"); + } + for (int i = 0; i < 4; i++) { + int nx = x + dx[i]; + int ny = y + dy[i]; + if (is_valid(nx, ny, h, w) && (nx != h && ny != w)) { + dfs(nx, ny); + } + } + }; + dfs(0, 0); + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + solve(); +} + + diff --git a/AtCoder/MakeTakahashiHappy/main_input0.txt b/AtCoder/MakeTakahashiHappy/main_input0.txt new file mode 100644 index 0000000..b43496f --- /dev/null +++ b/AtCoder/MakeTakahashiHappy/main_input0.txt @@ -0,0 +1,4 @@ +3 3 +3 2 2 +2 1 3 +1 5 4 diff --git a/AtCoder/MakeTakahashiHappy/main_input1.txt b/AtCoder/MakeTakahashiHappy/main_input1.txt new file mode 100644 index 0000000..e093188 --- /dev/null +++ b/AtCoder/MakeTakahashiHappy/main_input1.txt @@ -0,0 +1,11 @@ +10 10 +1 2 3 4 5 6 7 8 9 10 +11 12 13 14 15 16 17 18 19 20 +21 22 23 24 25 26 27 28 29 30 +31 32 33 34 35 36 37 38 39 40 +41 42 43 44 45 46 47 48 49 50 +51 52 53 54 55 56 57 58 59 60 +61 62 63 64 65 66 67 68 69 70 +71 72 73 74 75 76 77 78 79 80 +81 82 83 84 85 86 87 88 89 90 +91 92 93 94 95 96 97 98 99 100 diff --git a/AtCoder/MakeTakahashiHappy/main_output0.txt b/AtCoder/MakeTakahashiHappy/main_output0.txt new file mode 100644 index 0000000..00750ed --- /dev/null +++ b/AtCoder/MakeTakahashiHappy/main_output0.txt @@ -0,0 +1 @@ +3 diff --git a/AtCoder/MakeTakahashiHappy/main_output1.txt b/AtCoder/MakeTakahashiHappy/main_output1.txt new file mode 100644 index 0000000..5307dbb --- /dev/null +++ b/AtCoder/MakeTakahashiHappy/main_output1.txt @@ -0,0 +1 @@ +48620 diff --git a/AtCoder/SwapOddAndEven/main b/AtCoder/SwapOddAndEven/main Binary files differnew file mode 100755 index 0000000..3dde09f --- /dev/null +++ b/AtCoder/SwapOddAndEven/main diff --git a/AtCoder/SwapOddAndEven/main.cpp b/AtCoder/SwapOddAndEven/main.cpp new file mode 100755 index 0000000..8d5798c --- /dev/null +++ b/AtCoder/SwapOddAndEven/main.cpp @@ -0,0 +1,135 @@ +#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() { + string s; + cin >> s; + string ans = ""; + for (int i = 0; i < s.size() - 1; i+=2){ + ans += s[i + 1]; + ans += s[i]; + } + cout << ans << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + solve(); +} + + diff --git a/AtCoder/SwapOddAndEven/main_input0.txt b/AtCoder/SwapOddAndEven/main_input0.txt new file mode 100644 index 0000000..0373d93 --- /dev/null +++ b/AtCoder/SwapOddAndEven/main_input0.txt @@ -0,0 +1 @@ +abcdef diff --git a/AtCoder/SwapOddAndEven/main_input1.txt b/AtCoder/SwapOddAndEven/main_input1.txt new file mode 100644 index 0000000..5d308e1 --- /dev/null +++ b/AtCoder/SwapOddAndEven/main_input1.txt @@ -0,0 +1 @@ +aaaa diff --git a/AtCoder/SwapOddAndEven/main_input2.txt b/AtCoder/SwapOddAndEven/main_input2.txt new file mode 100644 index 0000000..ae8bde7 --- /dev/null +++ b/AtCoder/SwapOddAndEven/main_input2.txt @@ -0,0 +1 @@ +atcoderbeginnercontest diff --git a/AtCoder/SwapOddAndEven/main_output0.txt b/AtCoder/SwapOddAndEven/main_output0.txt new file mode 100644 index 0000000..282e6cb --- /dev/null +++ b/AtCoder/SwapOddAndEven/main_output0.txt @@ -0,0 +1 @@ +badcfe diff --git a/AtCoder/SwapOddAndEven/main_output1.txt b/AtCoder/SwapOddAndEven/main_output1.txt new file mode 100644 index 0000000..5d308e1 --- /dev/null +++ b/AtCoder/SwapOddAndEven/main_output1.txt @@ -0,0 +1 @@ +aaaa diff --git a/AtCoder/SwapOddAndEven/main_output2.txt b/AtCoder/SwapOddAndEven/main_output2.txt new file mode 100644 index 0000000..f1d8ad5 --- /dev/null +++ b/AtCoder/SwapOddAndEven/main_output2.txt @@ -0,0 +1 @@ +taocedbrgeniencrnoetts |