c语言程序设计苏小红课后习题答案7.13.2 素数探求

int IsPrime1(int m)
{
	int n;
	m = fabs(m);
	for (int i = 2;i < m;i++)
	{
		if (m % i == 0)
		{

			n = 0;
			break;
		}
		else
		{
			if (i < (m - 1))
				continue;
			else
				n = 1;
		}

	}
	return n;
}

int IsPrime2(int m)
{
	m = fabs(m);
	for (int i = 2;i < m;i++)
	{
		if (m % i == 0)
		{
			goto E;
		}
		else
		{
			if (i < (m - 1))
				continue;
			else
				goto T;
		}
	}
E: return 0;
T: return 1;

}
int IsPrime3(int m)
{
	m = fabs(m);
	int flag;
	for (int i = 2;i < m;i++)
	{
		if (m % i == 0)
		{
			flag = 0;
			break;
		}
		else
		{
			if (i < m - 1)
				continue;
			else
				flag = 1;
		}
	}
	return flag;
}

int main()
{
	int i, j, k, m;
	scanf("%d", &m);
	i = IsPrime1(m);
	j = IsPrime2(m);
	k = IsPrime3(m);
	if (i == 1)
	{
		printf("%d is a prime number\n", m);
	}
	else
	{
		printf("%d is not a prime number\n", m);
	}

	if (j == 1)
	{
		printf("%d is a prime number\n", m);
	}
	else
	{
		printf("%d is not a prime number\n", m);
	}

	if (k == 1)
	{
		printf("%d is a prime number\n", m);
	}
	else
	{
		printf("%d is not a prime number\n", m);
	}

	return 0;
}