Cod sursa(job #2950969)
| Utilizator | Data | 4 decembrie 2022 22:44:42 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 38 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
vector<int> ans;
char sir1[2000005];
char sir2[2000005];
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int main()
{
f>>sir1>>sir2;
int n1=strlen(sir1);
int n2=strlen(sir2);
for(int i=0;i<n2-n1;i++){
for(int j=0;j<n1;j++)
if(sir1[j]!=sir2[i+j])
goto no;
ans.push_back(i);
no:;
}
g<<ans.size()<<"\n";
for(int i=0;i<ans.size();i++)
{
if(i>=1000)
return 0;
g<<ans[i]<<" ";
}
return 0;
}
