Cod sursa(job #1996706)
| Utilizator | Data | 2 iulie 2017 13:59:48 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 14 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.86 kb |
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char a[2000000],b[2000000];
int main()
{
int n,i,j,c=0,cnt=0;
f>>a;
f>>b;
n=strlen(a);
for(i=strlen(b)-1;i>=0;--i)
{
if(b[i]==a[n-1])
{
j=n-1;
while((j>=0) && (b[i]==a[j]))
{
i--;
j--;
}
if(j==-1)
{
c=c*10+i+1;
cnt++;
}
i+=(n-1-j);
}
}
g<<cnt<<'\n';
if(cnt>1000)
while(cnt-1000>0)
{
c/=10;
cnt--;
}
while(cnt)
{
g<<c%10<<" ";
c/=10;
cnt--;
}
return 0;
}
