Submission #1687957

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cassert>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define rep(i,n) FOR(i,0,n)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define vint vector<int>
#define vdouble vector<double>
#define vstring vector<string>
using namespace std;

#include<map>
#include<set>
#include<queue>

typedef long long ll;
typedef unsigned long long ull;

const int MAX_N = 1000000;
const int INFTY = (1 << 21); // 2097152
// const ll INFTY = (1LL << 60);
const ll MD = 1000000007LL;
// fprintf(stderr, "%d %lld \n", x, xll);


int N;
int main() {
	string S;
	cin >> S;
	int ret = 0;
	rep(i, S.length()){
		if(i % 2 == 0 && S[i] == 'g'){ ret += 0; }
		if(i % 2 == 0 && S[i] == 'p'){ ret += -1; }
		if(i % 2 == 1 && S[i] == 'g'){ ret += 1;}
		if(i % 2 == 1 && S[i] == 'p'){ ret += 0;}
	}
	cout << ret << endl;
}

Submission Info

Judge Result