Submission #1428362

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

typedef vector<int> vi;
typedef pair<int,int> pii;

int main(void) {
  int i,j;
  string s;
  ll ans=0;
  cin>>s;
  ll t=0;
  rep(i,s.size())
    if(i<s.size()-1&&s[i]=='2'&&s[i+1]=='5'){
      i++;t++;
    }else if(t){
      if(t==1)ans++;
      else ans+=t*(t+1)/2;
      t=0;
    }
  if(t>1)ans+=t*(t+1)/2;
  if(t==1)ans++;
  cout<<ans<<endl;
}

Submission Info

Judge Result