CodeForces 625B - War of the Corporations

字符串匹配

#include <cstdio>
#include <iostream>
#include <cstring>

const int MAX = 1e5 + 5;
char arr1[MAX], arr2[35];

int main()
{
	scanf("%s%s", arr1, arr2);
	int lenth1 = strlen(arr1), lenth2 = strlen(arr2), cnt = 0;
	for (int i = 0; i < lenth1; ++i)
	{
		int tmp = i;
		for (int j = 0; j < lenth2; ++j)
		{
			if (arr1[tmp] != arr2[j])
			{
				break;
			}
			++tmp;
			if (j == lenth2 - 1)
			{
				cnt++;
				i = tmp - 1;
			}
		}
	}

	printf("%d\n", cnt);
	return 0;
}