Nswoj每日一题:Binary String Matching

[Binary String Matching]

#include<iostream>
#include<string.h>
using namespace std;

int main() {

int n = 0;
cin >> n;

while (n--) {

char a[10000];
char b[10000];
cin >> a;
cin >> b;
int a_lenth = strlen(a);
int b_lenth = strlen(b);

int count = 0;
bool flag = false;

for (int i = 0; i < b_lenth; i++) {
if (b[i] == a[0]) {
for (int j = 1; j < a_lenth; j++) {
if (b[i + j] == a[j]) {
if ((i + j) < b_lenth) {
flag = true;
continue;
}
}
else {
flag = false;
break;
}
}
}
if (flag == true) {
count++;
flag = false;
}
}

cout << count << endl;
}
return 0;
}