int main(void)
{
int max_number;
float ticks;
char * PrimeNumbers;
printf("\nMaximum number: ");
scanf("%u",&max_number);
PrimeNumbers = (char *) calloc(max_number % 16 == 0 ? max_number / 16 : 1 + max_number / 16, 1);
if (!PrimeNumbers)
{
fprintf(stderr, "Unable to allocate memory\n");
return -1;
}
ticks = clock();
findPrimes(PrimeNumbers, max_number);
//printf("2\n");printPrimes(PrimeNumbers, max_number);
printf("Found %u primes between 2 and %u in %g seconds\n",countPrimes(PrimeNumbers, max_number),max_number,(clock() - ticks)/CLOCKS_PER_SEC);
free(PrimeNumbers);
return 0;
}
int main()
{
bool tag[MAXN];
memset(tag,false,sizeof(tag));
findPrimes(tag);
goldbach(tag);
return 0;
}
int main(int argc, char *argv[])
{
bignum topCandidate = 1000;
if(argc > 1)
topCandidate = atoll(argv[1]);
findPrimes(topCandidate);
return 0;
}
int solveCase(){
int N,ans,M;
scanf("%d",&N);
M = recurrse(N);
ans = findPrimes(M);
return ans;
}
// I tried clock() and std::chrono::high_resolution_clock::now() both of them don't work.
// I'd be really grateful if you could tell me a way to get precise time.
int main()
{
std::thread findPrimes(findPrimes);
std::thread printFibonacciNumbers(printFibonacciNumbers);
findPrimes.join();
printFibonacciNumbers.join();
return 0;
}
int main(int argc, char *argv[]) {
int n;
printf("Please prime number to find: ");
scanf("%d", &n);
int *primes = findPrimes();
int nprime = getPrime(primes, n);
printf("%d \n", nprime);
free(primes);
return 0;
}
/*
* The main method.
*/
int main(int argc, char** argv) {
int max = 15;
if (argc > 1) {
max = atof(argv[1]);
}
int * primes = findPrimes(max);
int i = 0;
while (primes[i]) {
printf("%d ", primes[i]);
i++;
}
printf("\n");
return EXIT_SUCCESS;
}
int main(void) {
findPrimes(n);
printf("\n");
return 0;
}
