P1229 遍历问题https://www.luogu.com.cn/problem/P1229
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))
int main() {
string a, b;
cin >> a >> b;
int ans = 1;
for (int i = 0; i < a.length() - 1; i++) {
for (int j = 1; j < b.length(); j++) {
if (a[i] == b[j] && a[i + 1] == b[j - 1]) {
ans <<= 1;
}
}
}
printf("%d", ans);
return 0;
}