PTA 乙级 1094 谷歌的招聘

#include<stdio.h>
#include<string.h>
#include<math.h>

int isPrime(int num)
{
	if (num == 1)
		return 0;
	for (int i = 2; i <= sqrt(num); i++)
		if (num%i == 0)
			return 0;
	return 1;
}

int main()
{
	int L, K, i;

	scanf("%d %d", &L, &K); getchar();
	char *num = (char*)malloc(sizeof(char)*(L + 1));
	gets(num);
	for (i = 0; num[i] == '0'; i++);
	for (; i + K - 1 < strlen(num); i++)
	{
		int n = 0;
		for (int j = 0; j < K; j++)
			n += (num[i + j] - '0')*pow(10, K - j - 1);
		if (isPrime(n) == 1)
		{
			if (n >= pow(10, K - 1))
				printf("%d", n);
			else
			{
				int n1 = n, cnt = 0;
				do
				{
					cnt++; n1 /= 10;
				} while (n1 != 0);
				for (int j = 0; j < K - cnt; j++)
					printf("0");
				printf("%d", n);
			}
			return 0;
		}
	}
	printf("404");

	return 0;
}