判断一个数是否为素数

</pre><pre name="code" class="cpp">/*判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除，则表明此数不是素数，反之是素数。*/ 　
#include "stdafx.h"
#include <math.h>

int _tmain(int argc, _TCHAR* argv[])
{  
	int number = 0;
	int leap = 1;
	int k = 0;

	scanf("%d",&number);
   	 k = sqrt((float)(number + 1));

	for(int i = 2;i < k;i++)
	{
		if(k % i == 0 )
		{
			leap = 0;
			break;
		}
	}
    
	if(1 == leap)
	{
		printf("\r\n the number=%d is prime number ",number);
	}
	else
	{
		printf("\r\n the number=%d is not prime number ",number);
	}

	return 0;
}