1#include<iostream>2#include<vector>3#include<algorithm>4using namespace std;5 6int f(string x,string y){7    int m=x.size();8    int n=y.size();9    vector<vector<int>>v(m+1,vector<int>(n+1,0));10    for(int i=1;i<=m;i++){11       for(int j=1;j<=n;j++){12            if(x[i-1]==y[j-1]){13                v[i][j]=v[i-1][j-1]+1;14            }else{15                v[i][j]=max(v[i-1][j],v[i][j-1]);16            }17        }18    }19    return v[m][n];20}21bool g(string x,string y){22    if(x.size() != y.size()){23        return false;24    }25    return f(x+x,y)==y.size();26}27int main(){28    string x,y;29    cin>>x>>y;30    cout<<g(x,y)<<endl;31    return 0;32}