fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27. // babcb
  28.  
  29.  
  30. string a;
  31.  
  32. char consistency(int n){
  33.  
  34. vector<int> f(26, 0);
  35.  
  36. for(int i=0; i<n; i++){
  37. int val = (i+1) * (n-i);
  38. f[a[i]-'a'] += val;
  39. }
  40.  
  41. int maxi = 0;
  42. char ch = 'a';
  43.  
  44. for(int i=0; i<26; i++){
  45. if(f[i] > maxi){
  46. maxi = f[i];
  47. ch = char(i+'a');
  48. }
  49. }
  50.  
  51. return ch;
  52. }
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68. char practice(int n){
  69.  
  70.  
  71. }
  72.  
  73.  
  74.  
  75.  
  76.  
  77. void solve() {
  78.  
  79. int n;
  80.  
  81. cin >> a;
  82. n = a.size();
  83.  
  84. cout << consistency(n) << endl;
  85.  
  86.  
  87. }
  88.  
  89.  
  90.  
  91.  
  92.  
  93. int32_t main() {
  94. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  95.  
  96. int t = 1;
  97. // cin >> t;
  98. while (t--) {
  99. solve();
  100. }
  101.  
  102. return 0;
  103. }
Success #stdin #stdout 0.01s 5256KB
stdin
babcb
stdout
b