1 static int wing=[]()
 2 {
 3     std::ios::sync_with_stdio(false);
 4     cin.tie(NULL);
 5     return 0;
 6 }();
 7 
 8 class Solution 
 9 {
10 public:
11     int repeatedStringMatch(string A, string B) 
12     {
13         string as=A;
14         int count=B.size()/A.size()+3;
15         for(int i=1;i<count;i++,as+=A)
16         {
17             if(as.find(B)!=string::npos)
18                 return i;
19         }
20         return -1;
21     }
22 };

 1 static int wing=[]()
 2 {
 3     std::ios::sync_with_stdio(false);
 4     cin.tie(NULL);
 5     return 0;
 6 }();
 7 
 8 class Solution 
 9 {
10 public:
11     int repeatedStringMatch(string A, string B) 
12     {
13         string tmp=A+A;
14         size_t pos=tmp.find(B.substr(0,A.size()));
15         if(pos==string::npos)
16             return -1;
17         int count=1;
18         size_t i=0;
19         while(i<B.size())
20         {
21             if(pos==A.size())
22             {
23                 pos=0;
24                 ++count;
25             }
26             if(A[pos++]!=B[i++])
27                 return -1;
28         }
29         return count;
30     }
31 };