diff options
98 files changed, 2330 insertions, 38 deletions
diff --git a/codeforces/FlipFlopSum/main b/codeforces/FlipFlopSum/main Binary files differnew file mode 100755 index 0000000..cddb16d --- /dev/null +++ b/codeforces/FlipFlopSum/main diff --git a/codeforces/FlipFlopSum/main.cpp b/codeforces/FlipFlopSum/main.cpp new file mode 100755 index 0000000..7de31f6 --- /dev/null +++ b/codeforces/FlipFlopSum/main.cpp @@ -0,0 +1,107 @@ +#include<bits/stdc++.h> +using namespace std; + +using ll = long long; +using pi = pair<int, int>; +using vpi = vector<pi>; +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 + +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}; + +//pretty printing +template<typename K, typename V> +void printm(const map<K, V> &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template<typename T> +void printv(const vector<T> &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template<typename T> +void printvv(const vector<vector<T>> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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 n; + cin >> n; + vi v(n); + for (auto &x : v) cin >> x; + int flag = 0; + for (int i = 0; i < n - 1; i++) { + if (v[i] == v[i + 1] && v[i] == -1) { + flag = 1; + break; + } + } + if (std::accumulate(all(v), 0) == v.size()) { + cout << std::accumulate(all(v), -4) << '\n'; + } else if (flag == 1) { + cout << std::accumulate(all(v), 4) << '\n'; + } else { + cout << std::accumulate(all(v), 0) << '\n'; + } + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/FlipFlopSum/main_input0.txt b/codeforces/FlipFlopSum/main_input0.txt new file mode 100644 index 0000000..ae848c8 --- /dev/null +++ b/codeforces/FlipFlopSum/main_input0.txt @@ -0,0 +1,9 @@ +4 +5 +-1 1 1 -1 -1 +5 +1 1 -1 -1 -1 +2 +1 1 +4 +1 -1 -1 1 diff --git a/codeforces/FlipFlopSum/main_output0.txt b/codeforces/FlipFlopSum/main_output0.txt new file mode 100644 index 0000000..8dd367d --- /dev/null +++ b/codeforces/FlipFlopSum/main_output0.txt @@ -0,0 +1,4 @@ +3 +3 +-2 +4 diff --git a/codeforces/GardenerAndTheCapyBaras1/main.cpp b/codeforces/GardenerAndTheCapyBaras1/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/codeforces/GardenerAndTheCapyBaras1/main.cpp @@ -0,0 +1,89 @@ +#include<bits/stdc++.h> +using namespace std; + +using ll = long long; +using pi = pair<int, int>; +using vpi = vector<pi>; +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 + +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}; + +//pretty printing +template<typename K, typename V> +void printm(const map<K, V> &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template<typename T> +void printv(const vector<T> &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template<typename T> +void printvv(const vector<vector<T>> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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 main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/PolycarpAndTheDayOfPi/main b/codeforces/PolycarpAndTheDayOfPi/main Binary files differnew file mode 100755 index 0000000..b306185 --- /dev/null +++ b/codeforces/PolycarpAndTheDayOfPi/main diff --git a/codeforces/PolycarpAndTheDayOfPi/main.cpp b/codeforces/PolycarpAndTheDayOfPi/main.cpp new file mode 100755 index 0000000..877aa61 --- /dev/null +++ b/codeforces/PolycarpAndTheDayOfPi/main.cpp @@ -0,0 +1,98 @@ +#include<bits/stdc++.h> +using namespace std; + +using ll = long long; +using pi = pair<int, int>; +using vpi = vector<pi>; +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 + +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}; + +//pretty printing +template<typename K, typename V> +void printm(const map<K, V> &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template<typename T> +void printv(const vector<T> &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template<typename T> +void printvv(const vector<vector<T>> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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 pi = "314159265358979323846264338327"; + string n; + cin >> n; + int ans = 0; + int i = 0; + while(i < pi.length() && n[i] == pi[i]) { + ans++; + i++; + } + cout << ans << endl; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/PolycarpAndTheDayOfPi/main_input0.txt b/codeforces/PolycarpAndTheDayOfPi/main_input0.txt new file mode 100644 index 0000000..4e76296 --- /dev/null +++ b/codeforces/PolycarpAndTheDayOfPi/main_input0.txt @@ -0,0 +1,10 @@ +9 +000 +3 +4141592653 +141592653589793238462643383279 +31420 +31415 +314159265358 +27182 +314159265358979323846264338327 diff --git a/codeforces/PolycarpAndTheDayOfPi/main_output0.txt b/codeforces/PolycarpAndTheDayOfPi/main_output0.txt new file mode 100644 index 0000000..038a593 --- /dev/null +++ b/codeforces/PolycarpAndTheDayOfPi/main_output0.txt @@ -0,0 +1,9 @@ +0 +1 +0 +0 +3 +5 +12 +0 +30 diff --git a/codeforces/Stripes/main.cpp b/codeforces/Stripes/main.cpp index 91048d4..d9454c7 100755 --- a/codeforces/Stripes/main.cpp +++ b/codeforces/Stripes/main.cpp @@ -1,4 +1,4 @@ -#include<bits/stdc++.h> +#include <bits/stdc++.h> using namespace std; @@ -23,18 +23,16 @@ const int dx[4]{1, 0, -1, 0}; const int dy[4]{0, 1, 0, -1}; void solve() { - - } -int main () { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int tt; - cin >> tt; - while(tt--) { +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { solve(); - } + } } /* stuff you should look for: diff --git a/codeforces/Sum/main.cpp b/codeforces/Sum/main.cpp index 7a56c46..f9def9b 100755 --- a/codeforces/Sum/main.cpp +++ b/codeforces/Sum/main.cpp @@ -3 |