lightoj 1255 - Substring Frequency

A solution in c++

#include<bits/stdc++.h>

using namespace std;

int main()
{
    long long int a,b,n,m,i,j,ck=0,ln,ln2;
    string arr,brr;
    cin>>n;
    for(i=1; i<=n; i++){
        cin>>arr;
        ln = arr.length();
        cin>>brr;
        ln2 = brr.length();

        for(j=0; j<ln; j++){

             if(arr.compare(j,ln2,brr)==0){
                ck++;
             }
        }
        printf("Case %lld: %lld\n",i, ck);
        ck=0;

    }


}