Pagini recente » Cod sursa (job #2551475) | Cod sursa (job #1293998) | Cod sursa (job #582884) | Cod sursa (job #1083533) | Cod sursa (job #98659)
Cod sursa(job #98659)
#include <stdio.h>
#include <string.h>
#include <string>
#include <map>
using namespace std;
const int N_MAX = 10000010;
const int L_MAX = 22;
char sir[N_MAX], s[N_MAX];
map <string, int> words;
string kkt;
int main()
{
freopen("abc2.in", "r", stdin);
#ifndef _SCREEN_
freopen("abc2.out", "w", stdout);
#endif
int l1, L;
fgets(sir, sizeof(sir), stdin);
L = strlen(sir) - 1;
sir[L] = '\0';
fgets(s, sizeof(s), stdin);
l1 = strlen(s) - 1;
s[l1] = '\0';
// kkt = s;
// words[kkt] = 1;
while (fgets(s, sizeof(s), stdin)) {
s[l1] = '\0';
// kkt = s;
// words[kkt] = 1;
}
// kkt.clear();
// int i;
// for (i = 0; i < l1; i ++) {
// kkt.push_back(sir[i]);
// }
int nrp = 0;
// if (words[kkt]) nrp ++;
int i;
for (i = l1; i < L; i ++) {
kkt.push_back(sir[i]);
kkt.erase(kkt.begin());
// if (words[kkt]) nrp ++;
}
printf("%d\n", nrp);
return 0;
}