http://www.hackerschool.org/HS_Boards/zboard.php?id=QNA_programming&no=2812 [º¹»ç]
#include <stdio.h>
#include <math.h>
#include <stdbool.h>
void FindItOut(int number, int *candidate);
int main (int argc, const char * argv[])
{
int *startNum;
int ans;
printf("Type in a number: \t");
scanf("%d", startNum);
FindItOut(startNum, &ans);
printf("The next prime after %d is %d.\n", startNum, ans);
}
void FindItOut(int number, int *ans)
{
int i, last;
bool isPrime;
if(number <2)
*ans = 2;
else if(number =2)
*ans = 3;
else
{
*ans = number;
if (*ans % 2 == 0)
*ans--;
do
{
isPrime = true;
*ans += 2;
last = sqrt(*ans);
for (i =3; (i<=last) && isPrime; i+=2)
{
if ((*ans % i ) == 0)
isPrime = false;
}
}
while(!isPrime);
}
}
¾È³çÇϼ¼¿ä ^0^ C¾ð¾î Ãʺ¸ÀÚ Áú¹®ÀÔ´Ï´ç.
¿ø·¡ »ç¿ëÀÚ°¡ ¼ýÀÚ¸¦ ³ÖÀ¸¸é ±× ´ÙÀ½ ¼Ò¼ö ¸¦ print ÇØ¾ß µÅ´Âµ¥¿ä
0,1 ´À¸é 2 ¶ó°í ³ª¿À°í
2 ³ÖÀ¸¸é 3 À̶ó°í À߸¸ ³ª¿À´Âµ¥
3ÀÌ»óÀÇ ¼ýÀÚ¸¦ ³ÖÀ¸¸é ÀÚ²Ù 3 À̶ó´Â °ªÀÌ ³ª¿À³»¿ä....
Á¦°¡ Æ÷ÀÎÅÍ ¹è¿îÁö ¾ó¸¶ ¾ÈµÅ¼... ¸ð°¡ À߸ø‰Â°ÅÁ®? |
Hit : 5766 Date : 2010/12/22 06:56
|