소인수분해 편집하기
최신판 | 당신의 편집 | ||
14번째 줄: | 14번째 줄: | ||
#include <stdio.h> | #include <stdio.h> | ||
− | + | void factorization(){ | |
− | + | int n; | |
− | + | while(1){ | |
− | + | printf("Input: "); | |
− | + | scanf("%d",&n); | |
− | + | if(n<2) return; | |
− | + | int p=2; | |
− | + | int primes[20]; | |
− | + | int index=0; | |
− | + | int i; | |
− | + | while(n!=1){ | |
− | + | if(n%p==0){ | |
n=n/p; | n=n/p; | ||
primes[index]=p; | primes[index]=p; | ||
33번째 줄: | 33번째 줄: | ||
p=2; | p=2; | ||
} | } | ||
− | + | else{ | |
p++; | p++; | ||
} | } | ||
} | } | ||
− | + | if(index==1) printf("소수\n"); | |
− | + | else{ | |
− | + | for(i=0; i<index-1; i++){ | |
− | + | printf("%d*",primes[i]); | |
} | } | ||
− | + | printf("%d\n",primes[i]); | |
} | } | ||
} | } | ||
} | } | ||
− | + | int main(void){ | |
factorization(); | factorization(); | ||
− | + | return 0; | |
} | } | ||