Submission #1432514

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <cmath>
#include <numeric>
#include <fstream>
#include <queue>
#include <cstdio>
#include <deque>
#define fol(i,n) for(int i=0;i<n;i++)
#define db(a) cout << a<< endl;
using namespace std;

int main(){
    string S;
    cin >>S;
    int count = 0,r=1;
    char OI[2] = {'O','I'};
    fol(i,S.size()){
        if (S[i]==OI[r]){
            count ++;
            r = (r+1)%2;
        }
    }
    cout << count << endl;
    return 0;
}

Submission Info

Judge Result