diff options
Diffstat (limited to 'codeforces')
141 files changed, 530 insertions, 20 deletions
diff --git a/codeforces/AllDistinct/main b/codeforces/AllDistinct/main Binary files differdeleted file mode 100755 index aa1f15f..0000000 --- a/codeforces/AllDistinct/main +++ /dev/null diff --git a/codeforces/AlmostTernaryMatrix/main b/codeforces/AlmostTernaryMatrix/main Binary files differdeleted file mode 100755 index e0e1fa7..0000000 --- a/codeforces/AlmostTernaryMatrix/main +++ /dev/null diff --git a/codeforces/AmusingJoke/main b/codeforces/AmusingJoke/main Binary files differdeleted file mode 100755 index df6c17d..0000000 --- a/codeforces/AmusingJoke/main +++ /dev/null diff --git a/codeforces/ArpaAndAResearchInMexicanWave/main b/codeforces/ArpaAndAResearchInMexicanWave/main Binary files differdeleted file mode 100755 index 3d76aab..0000000 --- a/codeforces/ArpaAndAResearchInMexicanWave/main +++ /dev/null diff --git a/codeforces/ArrivalOfTheGeneral/main b/codeforces/ArrivalOfTheGeneral/main Binary files differdeleted file mode 100755 index f0a7f85..0000000 --- a/codeforces/ArrivalOfTheGeneral/main +++ /dev/null diff --git a/codeforces/Asterisk-MinorTemplate/main b/codeforces/Asterisk-MinorTemplate/main Binary files differdeleted file mode 100755 index 837d6d2..0000000 --- a/codeforces/Asterisk-MinorTemplate/main +++ /dev/null diff --git a/codeforces/BanBan/main b/codeforces/BanBan/main Binary files differdeleted file mode 100755 index 2102f9d..0000000 --- a/codeforces/BanBan/main +++ /dev/null diff --git a/codeforces/BearAndBigBrother/main b/codeforces/BearAndBigBrother/main Binary files differdeleted file mode 100755 index 0098166..0000000 --- a/codeforces/BearAndBigBrother/main +++ /dev/null diff --git a/codeforces/BeautifulMatrix/main b/codeforces/BeautifulMatrix/main Binary files differdeleted file mode 100755 index fd8f12e..0000000 --- a/codeforces/BeautifulMatrix/main +++ /dev/null diff --git a/codeforces/BeautifulYear/main b/codeforces/BeautifulYear/main Binary files differdeleted file mode 100755 index ac627ae..0000000 --- a/codeforces/BeautifulYear/main +++ /dev/null diff --git a/codeforces/BinarySearch/main b/codeforces/BinarySearch/main Binary files differdeleted file mode 100755 index fc015d6..0000000 --- a/codeforces/BinarySearch/main +++ /dev/null diff --git a/codeforces/BlankSpace/main b/codeforces/BlankSpace/main Binary files differdeleted file mode 100755 index 4d5ec29..0000000 --- a/codeforces/BlankSpace/main +++ /dev/null diff --git a/codeforces/Borze/main b/codeforces/Borze/main Binary files differdeleted file mode 100755 index d6bf512..0000000 --- a/codeforces/Borze/main +++ /dev/null diff --git a/codeforces/SumInBinaryTree/main b/codeforces/Buttons/main Binary files differindex 1c6bcad..78bf885 100755 --- a/codeforces/SumInBinaryTree/main +++ b/codeforces/Buttons/main diff --git a/codeforces/Buttons/main.cpp b/codeforces/Buttons/main.cpp new file mode 100755 index 0000000..95ec3ff --- /dev/null +++ b/codeforces/Buttons/main.cpp @@ -0,0 +1,160 @@ +#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 + */ + +// 1 2 3 F +// 1 2 2 S +// 1 2 1 F +// 1 2 0 S +// + +void solve() { + int a, b, c; + cin >> a >> b >> c; + + if (c % 2 == 0) { // Anna's turn + if (a == b) { + if ((a + b) % 2 == 0) { + cout << "Second\n"; + } else { + cout << "First\n"; + } + } else { + cout << (a > b ? "First\n" : "Second\n"); + } + } else { + if (a == b) { + if ((a + b) % 2 == 0) { + cout << "First\n"; + } else { + cout << "Second\n"; + } + } else { + cout << (a > b ? "First\n" : "Second\n"); + } + } +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/codeforces/Buttons/main_input0.txt b/codeforces/Buttons/main_input0.txt new file mode 100644 index 0000000..44000cd --- /dev/null +++ b/codeforces/Buttons/main_input0.txt @@ -0,0 +1,6 @@ +5 +1 1 1 +9 3 3 +1 2 3 +6 6 9 +2 2 8 diff --git a/codeforces/Buttons/main_output0.txt b/codeforces/Buttons/main_output0.txt new file mode 100644 index 0000000..8a9fd05 --- /dev/null +++ b/codeforces/Buttons/main_output0.txt |