HDU ACM 11 2087 剪花布条

#include <iostream>
#include <string>
using namespace std;
int main()
{
string Lu, Hui;
while (cin >> Lu && Lu[0] != '#')
{
cin >> Hui;
int k = Hui.length(), q = Lu.length();
int x = 0, sum1 = 0, sum2 = 0;
for (int i = 0, j = 0; i < q; i++)
{
if (Lu[i] == Hui[j] && j < k)
{
x++;
j++;
}
else if (Lu[i] != Hui[j] && j < k)
{
x = j = 0;
continue;
}
if (x == k)
{
sum1++;
x = j = 0;
}
}
x = 0;
for (int i = q - 1, j = 0; i >= 0; i--)
{
if (Lu[i] == Hui[j] && j < k)
{
x++;
j++;
}
else if (Lu[i] != Hui[j] && j < k)
{
x = j = 0;
continue;
}
if (x == k)
{
sum2++;
x = j = 0;
}
}
cout << (sum1 >= sum2 ? sum1 : sum2) << endl;
}
return 0;
}