Submission #72703788

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
#define lli long long int
typedef pair<lli, lli> p;

const lli N = 200006;
const lli MOD = 1000000007;
const lli INF = 10e12+7;
//lli arr[N], seg[4*N], lazy_seg[4*N];
//lli k_search;
//priority_queue<p, vector<p>, greater<p>> pq;
//unordered_map<lli, vector<p>> gra;

void solve()
{
    lli i, ctr=0, n;
    string str;
    cin>>str;
    n=str.length();
    for(i=0;i<n;i++)
        if(str[i]=='i' || str[i]=='j')
            ctr++;
    cout<<ctr<<'\n';
}

void usaco()
{
	freopen("measurement.in","r",stdin);   
  	freopen("measurement.out","w",stdout);
}
 
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
    //usaco();
    lli t=1;
    //cin>>t;
    while(t--)
	    solve();
}

Submission Info

Judge Result