Submission #1150075

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
#define rep(i, a, n) for(int i=a; i<n; i++)

int main() {
	int N;
	string S;
	int dp[101];
	
	cin >> N >> S;
	
	dp[0]=0;
	rep(i, 1, N){
		dp[i]=999999;
		
		rep(j, 1, 4){
			if(i<j) break;
			dp[i]=min(dp[i], dp[i-j]);
		}
		if(S[i]=='X') dp[i]++;
	}
	
	cout << dp[N-1] << endl;
	
	return 0;
}

Submission Info

Judge Result