Cod sursa(job #98958)
| Utilizator | Data | 10 noiembrie 2007 19:37:25 | |
|---|---|---|---|
| Problema | Abc2 | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Happy Coding 2007 | Marime | 0.5 kb |
#include<stdio.h>
#include<string.h>
#define N 100
char d[N],s[N];
int nr;
int search(int st,char s[],int l)
{
int i;
for(i=st;i<st+l;i++)
if(d[i]!=s[i-st])
return 0;
return 1;
}
void read_solve()
{
int i,lg,l;
scanf("%s",&d);
lg=strlen(d);
while(scanf("%s",&s)!=EOF)
{
l=strlen(s);
for(i=0;i<=lg-l;i++)
if(search(i,s,l))
nr++;
}
printf("%d\n",nr);
}
int main()
{
freopen("abc2.in","r",stdin);
freopen("abc2.out","w",stdout);
read_solve();
return 0;
}
