Submission #1958541

---

Source Code Expand

#include <iostream>
#include <string>
#include <string.h>
#include <algorithm>
#include <vector>
using namespace std;

int n;
string str;

int dp[101];
int dfs(int m){
  int result = 1e9;
  int temp = 0;
  if(dp[m] != -1) return dp[m];
  if(m >= n-1) return 0;
  if(str[m] == 'X') temp = 1;

  for(int i=1; i<=3; i++){
    result = min(result, dfs(m + i) + temp);
  }
  return dp[m] = result;

}

int main()
{
  memset(dp, -1, sizeof(dp));
  cin >> n >> str;
  cout << dfs(0) << endl;

  return 0;
}

Submission Info

Judge Result