euler7_pueso_code

arr[10001] = {0}
count = 1;
arr[0] = 2;
num = 2;
bool is_prime;
while (count < 10001) //  loop through all numbers
{
  num++; // starts with 3
  
  is_prime = true; // sets the number to prime unless we find otherwise
  for (int num = 0; i < count; i++)
  {
    if (arr[count] % num == 0) // num is not prime
    {
      is_prime = false;
      break; // break out of loop early
    }
    if (is_prime)
    {
      count++;
      arr[count] = num; // add to primes to check in future
    }
  }