满意答案
kjmn2729
2014.08.10
采纳率:53% 等级:7
已帮助:58人
#include
#include
int isPrimeNumber(unsigned int n)
{
int i = 0;
unsigned int t = (unsigned int)sqrt((double)n);
for (i = 2; i < t; ++i)
{
if (0 == n % i)
{
return 0;
}
}
return 1;
}
int main(void)
{
unsigned int m = 0, n = 0;
unsigned int i = 0;
printf("\nInput m and n: ");
scanf("%d%d", &m, &n);
if (m > n)
{
unsigned int tmp = m;
m = n;
n = tmp;
}
for (i = m; i <= n; ++i)
{
if (0 != isPrimeNumber(i))
{
printf("%d ", i);
}
}
}计算结果:
Input m and n: 200 300
211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 289 293
00分享举报