Pagini recente » Cod sursa (job #2028977) | Cod sursa (job #910974) | Cod sursa (job #42128) | Cod sursa (job #2273917) | Cod sursa (job #2588814)
#include <iostream>
#include <fstream>
#include <queue>
#include <map>
using namespace std;
ifstream in("abc2.in");
ofstream out("abc2.out");
string initial;
map <string , int> omg;
int main()
{
in >> initial;
for (int l=1; l<=20; l++)
{
string acm;
for (int i=0; i<l; i++)
{
acm += initial[i];
}
for (int i=l; i<initial.length(); i++)
{
omg[acm] = i-l + 1;
acm.erase(0,1);
acm += initial[i];
}
}
string moment;
int cnt = 0;
while (in >> moment)
{
if (omg[moment] != 0)
{
cnt++;
omg[moment] = 0;
}
}
out << cnt;
return 0;
}