Cod sursa(job #2589591)
Utilizator | Data | 26 martie 2020 16:35:31 | |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include<fstream>
#include <string>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int main()
{
char s[100], p[100];
fin.get(s, 100);
fin.ignore();
fin.get(p, 100);
int i, j, ok, n, m;
n = strlen(s);
m = strlen(p);
for (i = 0; i < n; i++)
{
ok = 1;
for (j = 0; j < m && ok; j++)
{
if (p[j] == s[i])
{
if (p[j] != s[i + j] || j + i > n)
{
ok = 0;
break;
}
if (ok == 1)
{
fout << i << " ";
}
}
}
}
}