Mai intai trebuie sa te autentifici.
Cod sursa(job #675481)
Utilizator | Data | 7 februarie 2012 17:31:56 | |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 8 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.08 kb |
#include<stdio.h>
#include<string.h>
char s[2000010],s1[2000010];
int pi[2000010],n,m,nr,poz[2000010],p;
void citire()
{
FILE*f=fopen("strmatch.in","r");
fgets(s,2000000,f);
fgets(s1,2000000,f);
for(;(s[n]>='A'&&s[n]<='Z')||(s[n]>='a'&&s[n]<='z')||(s[n]>='0'&&s[n]<='9');++n);
for(;(s1[m]>='A'&&s1[m]<='Z')||(s1[m]>='a'&&s1[m]<='z')||(s1[m]>='0'&&s1[m]<='9');++m);
fclose(f);
}
void kmp_prefix()
{
pi[1]=-1;
int k=-1;
for(int i=1;i<n&&s[i];++i)
{
while(k>-1 && s[k+1]!=s[i])
k=pi[k];
if(s[k+1] == s[i] )
{ ++k; }
pi[i]=k;
}
}
void kmp()
{
int k=-1;
for(int i=0;i<m;++i)
{
while(k>-1 && s[k+1]!=s1[i])
{ k=pi[k]; ; }
if(s[k+1]==s1[i])
{ ++k; }
if(k == n-1)
poz[++nr]=i-n;
}
}
int main()
{
citire();
kmp_prefix();
kmp();
FILE*f=fopen("strmatch.out","w");
fprintf(f,"%d\n",nr);
for(int i=1;i<=nr;++i) fprintf(f,"%d ",poz[i]+1);
fclose(f);
return 0;
}