Pagini recente » Cod sursa (job #1465150) | Cod sursa (job #185625) | Cod sursa (job #108932) | Cod sursa (job #267869) | Cod sursa (job #1423524)
#include <fstream>
#include <string>
#include <vector>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int urm[67];
string A, B;
vector<int> sol;
int nr_sol=0, i, j;
int valoare(char c)
{
if (c>='A' && c<='Z') return c-'A';
if (c>='a' && c<='z') return 'z'-'a'+c-'a';
return 2*('z'-'a')+c-'0';
}
void Preprop(string A, int lgA)
{
for (int i=lgA-2; i>0; --i)
if (!urm[valoare(A[i])])
{
urm[valoare(A[i])]=lgA-i-1;
}
}
int main()
{
f>>A>>B;
int lgA=A.length(), lgB=B.length();
Preprop(A, lgA);
i=j=lgA-1;
while (i!=lgB)
{
if (A[j]==B[i])
{
--i; --j;
if (!j)
{
++nr_sol;
if (sol.size()<1000) sol.push_back(i);
}
}
else
{
if (urm[valoare(A[j])]<lgA-j)
{
i=i+lgA-j;
}
else
{
i=i+urm[i];
}
j=lgA-1;
}
}
g<<nr_sol<<"\n";
for (int i=0; i<sol.size(); ++i) g<<sol[i]<<" ";
g<<"\n";
f.close();
g.close();
return 0;
}