【杂题】 codeforces 451D Count Good Substrings

#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 100005
#define eps 1e-10
#define mod 1000000009
#define INF 99999999
#define lowbit(x) (x&(-x))
//#define lson o<<1, L, mid
//#define rson o<<1 | 1, mid+1, R
typedef long long LL;
//typedef int LL;
using namespace std;

int pre[3][3];
char s[maxn];
int main(void)
{
scanf("%s", s);
int len = strlen(s);
LL even = 0, odd = 0;
for(int i = 0; i < len; i++) {
int tmp = s[i] - 'a';
pre[tmp][i%2]++;
even += pre[tmp][(i%2)^1];
odd += pre[tmp][i%2];
}
printf("%I64d %I64d\n", even, odd);
return 0;
}