Pagini recente » Cod sursa (job #942835) | Cod sursa (job #1300446) | Cod sursa (job #1676553) | Cod sursa (job #3260159) | Cod sursa (job #912557)
Cod sursa(job #912557)
#include <fstream>
#define DM 2000005
using namespace std;
char s1 [DM], s2 [DM];
int answ [1005];
int main ()
{
ifstream f ("strmatch.in");
ofstream g ("strmatch.out");
int i, j, ans = 0, n1 = 0, n2 = 0;
bool OK;
f >> s1 >> s2;
n1 = strlen (s1);
n2 = strlen (s2);
for (i = 0; i <= n2 - n1; ++ i)
{
OK = 1;
for (j = 0; j < n1 && OK; ++ j)
{
if (s1 [j] != s2 [i + j]) OK = 0;
}
if (OK)
{
if (ans < 1000)
{
answ [ans ++] = i;
}
}
}
g << ans << "\n";
for (i = 0; i < ans; ++ i)
g << answ [i] << " ";
}