|
|
вернуться в форумaccepted //#pragma GCC optimize("Ofast,no-stack-protector") //#pragma GCC target("avx") #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds; using namespace std;
#define re return #define pb push_back #define eb emplace_back #define all(x) (x).begin(), (x).end() #define fi first #define se second #define sqrt(x) sqrt(abs(x)) #define mp make_pair #define pi (3.14159265358979323846264338327950288419716939937510) #define fo(i, n) for(int i = 0; i < n; ++i) #define ro(i, n) for(int i = n - 1; i >= 0; --i) #define unique(v) v.resize(unique(all(v)) - v.begin())
template <class T> T abs (T x) { re x > 0 ? x : -x; } template <class T> T sqr (T x) { re x * x; } template <class T> T gcd (T a, T b) { re a ? gcd (b % a, a) : b; } template <class T> int sgn (T x) { re x > 0 ? 1 : (x < 0 ? -1 : 0); }
typedef vector<int> vi; typedef vector<vi> vvi; typedef pair<int, int> ii; typedef vector<ii> vii; typedef vector<string> vs; typedef double D; typedef long double ld; typedef long long ll; typedef pair<ll, ll> pll; typedef vector<ll> vll; typedef unsigned long long ull; typedef tree <pair<int, char>, null_type, less<pair<int, char>>, rb_tree_tag, tree_order_statistics_node_update> _tree; void get_vector (const string &str, vector <int> &v) { v.resize(str.size()); for (int i = 0; i < (int)v.size(); ++i) { if (str[i] >= 'A') v[i] = 10 + str[i] - 'A'; else v[i] = str[i] - '0'; } } int calc (vector <int> &v, int k) { int ans = v[0] < k; for (int i = 1; i < (int)v.size() - 1; ++i) { if (v[i] >= k && v[i + 1] < k) ++ans; } return ans; } int ans[36]; void read() { string str; vector <int> v; while (cin >> str) { get_vector(str, v); for (int i = 1; i < 36; ++i) ans[i] += calc(v, i + 1); } } int main() { read(); pair <int, int> _ans = mp(-1, -1); for (int i = 1; i < 36; ++i) { _ans = max(_ans, mp(ans[i], - (i + 1))); } cout << -_ans.se << ' ' << _ans.fi << endl; re 0; } |
|
|