Pagini recente » Cod sursa (job #1123649) | Cod sursa (job #635526) | Cod sursa (job #424563) | Cod sursa (job #1366807) | Cod sursa (job #2293928)
#include <bits/stdc++.h>
using namespace std;
char s[10000001], vocabular[50001], ch[50001];
int main()
{
ifstream f("abc2.in");
ofstream g("abc2.out");
unordered_map<string, int > mp;
int l, nr = 0;
f>>s;
f.get();
while(f>>vocabular)
{
mp[vocabular] = 1;
l = strlen(vocabular);
f.get();
}
for(int i = 0; i < l; i++)
{
ch[i] = s[i];
}
ch[l] = NULL;
if(mp.find(ch) != mp.end()) nr++;
int ll = strlen(s) - 1;
for(int i = l; i <=ll; i++)
{
for (int j = 0; j <= l - 2; j++)
{
ch[j] = ch[j + 1];
}
ch[l - 1] = s[i];
ch[l] = NULL;
if(mp.find(ch) != mp.end()) nr++;
}
g<<nr;
return 0;
}