D. Inaccurate Subsequence Search | Codeforces Round 938 (Div. 3) Solution

[@og_prakash]

// Problem: D. Inaccurate Subsequence Search
// Contest: Codeforces - Codeforces Round 938 (Div. 3)
// URL: codeforces.com/contest/1955/problem/D
// Memory Limit: 256 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (cpeditor.org)
#include
using namespace std;
#define int long long int
#define pi pair
#define vi vector< int >
#define dd double
#define f(i,a,b) for(int i=a;i=b;i--)
#define ll long long int
#define pb push_back
#define lcm(a, b) ((a) * (b)) / __gcd(a, b)
#define mp make_pair
#define in insert
#define fi first
#define lb lower_bound
#define ub upper_bound
#define se second
#define all(v) (v).begin(),(v).end()
const int mod = 1e9 + 7;
int cnt1=0,cnt2=0,cnt3=0,cnt4=0,cnt5=0,ans1=0,ans2=0,ans3=0;
#define d1(x) cout

[@divchaudhary5045]

Great explanation. Looking forward for more solutions in upcoming contests

[@aryakumarjaiswal]

Best explaination of this question.Thank you bhaiya

[@og_prakash]

Thanks 😍