Function main

project_euler_problems/10001st prime/solution.c:48–61

** `count` starts to 1 because we already know that 2 is prime ** but it will not be computed in this loop as we skip all even numbers */

 ** but it will not be computed in this loop as we skip all even numbers
 */
int main(void) {
  int limit = 10001;
  int count = 1;
  int result;

  for (int nb = 1; count < limit; nb += 2) {
    if (isPrime(nb)) {
      count++;
      result = nb;
    }
  }

  printf("%d\n", result);
}