3805419_tle.cc

北大大牛代码 1240道题的原代码 超级权威

#include <set>
#include <string>
#include <stdio.h>
#include <ctype.h>
#include <algorithm>

using namespace std;

char str[100001];
char sub[100001];
int c, k;
set <string> s;

int insert()
{
	char tmp[51];
	int j = 0;

	for (int i = c - k; i < c; i++, j++)
	{
		tmp[j] = sub[i];
	}
	tmp[j] = '\0';
	sort(tmp, tmp + k);
	if (s.find(string(tmp)) != s.end())
		return 0;
	s.insert(string(tmp));
	return 1;
}

int main()
{
	int i, len;

	while (scanf("%d", &k) == 1)
	{
		getchar();
		if (k == 0)
		{
			break;
		}
		c = 0;
		s.clear();
		gets(str);
		len = strlen(str);
		for (i = 0; str[i]; i++)
		{
			if (!isalpha(str[i]))
				continue;
			if (isupper(str[i]))
			{
				str[i] += ' ';
			}
			sub[c++] = str[i];
			if (c >= k)
			{
				if (!insert())
				{
					break;
				}
			}
		}
		if (c < k)
		{
			printf("%d\n", len);
			continue;
		}
		printf("%d\n", i);
	}
	return 0;
}