CodeForces 144C Anagram Search

 

Anagram Search

time limit per test2 seconds

memory limit per test
256 megabytes
input
standard input
output
standard output

A string t is called an anagram of the string s, if it is possible to rearrange letters in t so that it is identical to the string s. For example, the string "aab" is an anagram of the string "aba" and the string "aaa" is not.

The string t is called a substring of the string s if it can be read starting from some position in the string s. For example, the string "aba" has six substrings: "a", "b", "a", "ab", "ba", "aba".

You are given a string s, consisting of lowercase Latin letters and characters "?". You are also given a string p, consisting of lowercase Latin letters only. Let's assume that a string is good if you can obtain an anagram of the string p from it, replacing the "?" characters by Latin letters. Each "?" can be replaced by exactly one character of the Latin alphabet. For example, if the string p = «aba», then the string "a??" is good, and the string «?bc» is not.

Your task is to find the number of good substrings of the string s (identical substrings must be counted in the answer several times).

Input

The first line is non-empty string s, consisting of no more than 105 lowercase Latin letters and characters "?". The second line is non-empty string p, consisting of no more than 105 lowercase Latin letters. Please note that the length of the string p can exceed the length of the string s.

Output

Print the single number representing the number of good substrings of string s.

Two substrings are considered different in their positions of occurrence are different. Thus, if some string occurs several times, then it should be counted the same number of times.

Sample test(s)
input
bb??x???
aab
output
2
input
ab?c
acb
output
2
Note

Consider the first sample test. Here the string s has two good substrings: "b??" (after we replace the question marks we get "baa"), "???" (after we replace the question marks we get "baa").

Let's consider the second sample test. Here the string s has two good substrings: "ab?" ("?" can be replaced by "c"), "b?c" ("?" can be replaced by "a").

题意不多说,坑比AC代码,,

#include <iostream>
#include <cstdio>
#include <cstring>
#define MAXN 100005
using namespace std;
char a[MAXN], b[MAXN];
int hasha[26], hashb[26];
int main()  //哈希算法原理
{
	int ans, lena, lenb;
	bool flag;
	while (scanf("%s%s", a, b) != EOF)
	{
		memset(hasha, 0, sizeof(hasha));
		memset(hashb, 0, sizeof(hashb));
		lena = strlen(a);
		lenb = strlen(b);
		ans = 0;
		for (int i = 0; i < lenb; ++i)
			hashb[b[i] - 'a']++;
		for (int i = 0; i < lena; ++i)
		{

			flag = true;
			hasha[a[i] - 'a']++;//记录字符串a中字母个数   
			if (i >= lenb - 1)
			{
				for (int j = 0; j < 26; ++j)
				{
					if (hasha[j] > hashb[j])
					{
						flag = false;//如果a中的字符串有比b中多的字母,肯定不匹配   
						break;
					}
				}
				if (flag == true)
					ans++;
				hasha[a[i - (lenb - 1)] - 'a']--;//把“最前面”那个字符个数去掉   
			}
		}
		printf("%d\n", ans);
	}
	return 0;
}

 

 

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值