Submission #1025785

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) a.begin(), a.end()
#define MS(m,v) memset(m,v,sizeof(m))
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
const int MOD = 1000000007;
const int INF = MOD + 1;
const ld EPS = 1e-12;
template<class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<class T> T &chmax(T &a, const T &b) { return a = max(a, b); }

/*--------------------template--------------------*/

int main()
{
	cin.sync_with_stdio(false); cout << fixed << setprecision(10);
	string s; cin >> s;
	vi v;
	int cnt = 0;
	REP(i, s.size() - 1)
	{
		if (s[i] == '2' && s[i + 1] == '5')
		{
			cnt++;
			i++;
		}
		else
		{
			if (cnt > 0) v.push_back(cnt);
			cnt = 0;
		}
	}
	v.push_back(cnt);
	ll ans = 0;
	for (auto i : v) ans += i * (i - 1) / 2 + i;
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result