Enigma Gym - 101908E

https://cn.vjudge.net/problem/Gym-101908E

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=2e5+9;
const int maxm=1e6+9;

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x;
        x=x*x;
        n>>=1;
    }
    return ans;
}

bool vis[maxn];
int main()
{
    FAST_IO;
    //freopen("input.txt","r",stdin);

    string s,t;
    cin>>s>>t;
    int lens=s.length();
    int lent=t.length();
    int len=lens-lent+1;
    int cnt=0;
    for(int i=0;i<lent;i++)
    {
        cnt=0;
        for(int j=i;j<=i+len-1;j++)
        {
            //cout<<j<<" ";
            if(t[i]==s[j]) vis[cnt]=1;
            cnt++;
        }
        //cout<<endl;
    }
    int ans=0;
    for(int i=0;i<cnt;i++) if(!vis[i]) ans++;
    cout<<ans<<endl;

    return 0;
}