Submission #324624

---

Source Code Expand

#include <queue>
#include <map>
#include <iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#include <stack>
#include <algorithm>
#include <bitset>
#include <sstream>
#include <string>
#include <cmath>
#include <stack>
#include <math.h>
#include <list>
#include <set>
#include <complex>
#include <string.h>
#define INF (1 << 29)
#define rep2(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) rep2(i,0,n)
#define squere(x) ((x)*(x))
#define EPS 1e-20
 
using namespace std;

int com(int x, int y) {
	if (x % 2 == 0) {
		return (x / 2) * y;
	} else {
		return (y / 2) * x;
	}
}

int main() {
	string s;
	cin >> s;
	int c = 0;
	bool f = false;
	int tmpc = 0;
	for (int i = 0; i< s.length(); i++) {
		if(s[i] == '2' && f == false) {
			f = true;
		} else if (s[i] == '2') {
			f = true;
			c += com(tmpc,tmpc+1);
			tmpc = 0;
		} else if (s[i] == '5' && f == true) {
			tmpc++;
			f = false;
		} else if (tmpc > 0) {
			c += com(tmpc,tmpc+1);
			tmpc = 0;
			f = false;
		} else {
			f = false;
		}
	}
	if (tmpc > 0) c += com(tmpc,tmpc+1);
	cout << c << endl;
	return 0;
}

Submission Info

Judge Result