int main(void) {
int n;
//printf("Enter N = ");
scanf("%d",&n);
if(n>1) prime_factorization(n);
else printf("No primes!!\n");
return 0;
}
int main()
{
int num;
printf("Enter number to be factored: ");
scanf("%d", &num);
prime_factorization(num);
return 0;
}
// ============
// main process
// ============
int main(void) {
/* variables */
unsigned long n = 600851475143;
/* process */
// record start time
clock_t start_time = clock();
unsigned long answer = prime_factorization(n);
//record end time
clock_t end_time = clock();
printf("answer:%lu\n", answer);
printf("time :%f[s]\n", (double)(end_time - start_time) / CLOCKS_PER_SEC);
return 0;
}
void phonyPrimes(int s,int e){
prime_factorization(e);
int num,pi,tmp,sq;
for(num=s;num<=e;num++){
if(isPrime(num))
continue;
sq = sqrt(num);
int isPhony = 1;
for(pi=0;pi<sq;pi++){
tmp = primes[pi];
if( num%(tmp*tmp) )
continue;
isPhony = 0;
}
if(isPhony) printf("%d\n", num);
}
}
