原文链接:https://www.luogu.com.cn/problem/P1229
AC代码:
#include<iostream>
#include<string.h>
#include<vector>
#include<math.h>
#include<algorithm>
using namespace std;
string s0,s1;
int main(){
int i,j,ans=0;
cin>>s0>>s1;
for(i=0;i<s0.length();i++){
for(j=1;j<s1.length();j++){
if(s0[i]==s1[j]&&s0[i+1]==s1[j-1]){
ans++;
}
}
}
cout<<pow(2,ans)<<endl;
return 0;
}