è½å¤å解æè¥å¹²ä¸ªç´ æ°å åä¹ç§¯çå¥æ°ï¼ç§°ä¹ä¸ºç§¯æ°ãä¹å°±æ¯å¥åæ°ã
æ ¹æ®è¿ä¸ªå®ä¹ï¼åªè¦æ¯100以å
çå¥æ°ï¼åæ¶ä¸æ¯ç´ æ°çï¼é½æ¯ç¬¦åé¢æç积æ°ã
äºæ¯ä»£ç å¦ä¸ï¼
#include <stdio.h>
#include <math.h>
int is_prime(int n)//å¤æç´ æ°å½æ°ã
{
int i;
for(i = 2; i <= sqrt(n); i ++)
if(n%i == 0) return 0;
return 1;
}
int main()
{
int n;
for(n = 3; n < 100; n += 2)//éåèå´å
ææå¥æ°ã
if(is_prime(n) == 0)//ä¸æ¯ç´ æ°ã
printf("%d\n", n); //æ¯ç§¯æ°ï¼è¾åºã
return 0;
}