// Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//

#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( char str1 [ ], char str2 [ ], int m, int n ) {
  int j = 0;
  for ( int i = 0;
  i < n && j < m;
  i ++ ) if ( str1 [ j ] == str2 [ i ] ) j ++;
  return ( j == m );
}


//TOFILL

int main() {
    int n_success = 0;
    vector<string> param0 {"AXY","AXY","1100","t","034","01111010110","SjOXhD","455","001","MkK"};
    vector<string> param1 {"ADXCPY","YADXCP","001011001111","Isv","376083","10110110","PWkZDupqagB","4553","11100","qfjWaMdMYkqcK"};
    vector<int> param2 {3,4,4,1,3,8,6,3,3,3};
    vector<int> param3 {6,6,12,3,6,8,9,4,5,13};
    for(int i = 0; i < param0.size(); ++i)
    {
        if(f_filled(&param0[i].front(),&param1[i].front(),param2[i],param3[i]) == f_gold(&param0[i].front(),&param1[i].front(),param2[i],param3[i]))
        {
            n_success+=1;
        }
    }
    cout << "#Results:" << " " << n_success << ", " << param0.size();
    return 0;
}