// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h>
using namespace std;
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;
#ifndef DEBUG
#define cerr if (0) cerr
#endif
const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 100005;
int n, g;
string s;
ld calc(ld n) {
return (ld) (n * (n - 1) / 2) / 2;
}
int main() {
#ifndef DEBUG
ios::sync_with_stdio(0), cin.tie(0);
#endif
cout << setprecision(9);
cin >> s;
n = SZ(s);
REP (i, 0, n) {
mxto(g, s[i] - 'A' + 1);
}
assert(g == 1);
int ln = n / 2, rn = n - ln;
ld ans = (ll) ln * (ln - 1) / 2 + (ll) rn * (rn - 1) / 2;
if (ans % 2 == 0) {
ans /= 2;
cout << ans << '\n';
} else {
ans /= 2;
cout << ans << ".5\n";
}
return 0;
}
Compilation message
passes.cpp: In function 'int main()':
passes.cpp:58:13: error: invalid operands of types 'ld' {aka 'long double'} and 'int' to binary 'operator%'
58 | if (ans % 2 == 0) {
| ~~~ ^ ~
| | |
| | int
| ld {aka long double}
