Sure, here's a driver/main function in C++ that will use the isPrime() function to print the first 20 prime numbers to the console:

```c++
#include <iostream>

using namespace std;

bool isPrime(int n)
{
    if (n == 1 || n == 0) return false;

    for (int i = 2; i < n; i++)
    {
        if (n % i == 0) return false;
    }
    return true;
}

int main()
{
    int count = 0;
    int num = 2;

    while (count < 20)
    {
        if (isPrime(num))
        {
            cout << num << " ";
            count++;
        }
        num++;
    }

    return 0;
}
```

This program initializes a counter count to 0 and a number num to 2. It then enters a loop that will continue until it has found and printed 20 prime numbers to the console.

In each iteration of the loop, the isPrime() function is called with the current value of num. If num is prime, it is printed to the console and the count variable is incremented. Regardless of whether num is prime, num is incremented by 1 at the end of each iteration. Once 20 prime numbers have been printed to the console, the loop terminates and the program exits.
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence