Find all prime numbers $p$ for which the number of ordered pairs of integers $(x, y)$ with $0\leq x, y < p$ satisfying the condition
\[y^2 \equiv  x^3 -  x \pmod p\]
is exactly $p.$
To find all prime numbers \( p \) for which the number of ordered pairs of integers \((x, y)\) with \(0 \leq x, y < p\) satisfying the condition
\[ y^2 \equiv x^3 - x \pmod{p} \]
is exactly \( p \), we proceed as follows:

1. **Initial Observation:**
   - For \( p = 2 \), we check the condition:
     \[
     y^2 \equiv x^3 - x \pmod{2}
     \]
     The possible values for \( (x, y) \) are \((0, 0)\), \((0, 1)\), \((1, 0)\), and \((1, 1)\). We find that:
     \[
     \begin{aligned}
     &0^2 \equiv 0^3 - 0 \pmod{2} \quad \text{(true)} \\
     &1^2 \equiv 0^3 - 0 \pmod{2} \quad \text{(false)} \\
     &0^2 \equiv 1^3 - 1 \pmod{2} \quad \text{(true)} \\
     &1^2 \equiv 1^3 - 1 \pmod{2} \quad \text{(true)}
     \end{aligned}
     \]
     Thus, there are exactly 2 solutions: \((0, 0)\) and \((1, 1)\). Hence, \( p = 2 \) is a solution.

2. **Lemma 1:**
   - The number of solutions \((x, y)\) of the equation \( y^2 = x^3 - x \) in \(\mathbb{F}_p\) is equal to \( p \) if and only if:
     \[
     \sum_{y \in \mathbb{F}_p} \left( \frac{y^3 - y}{p} \right) = 0
     \]
     where \(\left( \frac{a}{p} \right)\) is the Legendre symbol.

3. **Proof of Lemma 1:**
   - Let \( a = |\{ y \in \mathbb{F}_p : \left( \frac{y^3 - y}{p} \right) = 1 \}| \),
     \( b = |\{ y \in \mathbb{F}_p : \left( \frac{y^3 - y}{p} \right) = -1 \}| \),
     and \( c = |\{ y \in \mathbb{F}_p : \left( \frac{y^3 - y}{p} \right) = 0 \}| \).
   - We know \( c = 3 \) because \( y^3 - y = 0 \) has exactly 3 solutions: \( y = 0, 1, -1 \).
   - Therefore, \( a + b + 3 = p \).
   - Also, \( \sum_{y \in \mathbb{F}_p} \left( \frac{y^3 - y}{p} \right) = a - b \).
   - The number of solutions \( N \) of the equation \( y^2 = x^3 - x \) is \( N = 2a + 3 \).
   - For \( N = p \), we need \( 2a + 3 = p \), which implies \( a = \frac{p - 3}{2} \).
   - Since \( a + b + 3 = p \), we get \( b = \frac{p - 3}{2} \), hence \( a = b \).

4. **Lemma 2:**
   - For a prime \( p \),
     \[
     S = \sum_{y \in \mathbb{F}_p} \left( \frac{y^3 - y}{p} \right) = 0
     \]
     if and only if \( p \equiv -1 \pmod{4} \).

5. **Proof of Lemma 2:**
   - Let \( h = \frac{p - 3}{2} \).
   - If \( S = 0 \), then:
     \[
     P = \prod_{y \in \mathbb{F}_p, y \neq 0, \pm 1} \left( \frac{y^3 - y}{p} \right) = (-1)^h
     \]
   - Notice that if we put \( F(x) = \frac{x^{p-1} - 1}{x^2 - 1} = 1 + x^2 + x^4 + \cdots + x^{2h} \), then:
     \[
     \prod_{y \in \mathbb{F}_p, y \neq 0, \pm 1} (y^3 - y) = F(0) F(1) F(-1) = (h + 1)^2
     \]
   - Therefore:
     \[
     (-1)^h = P = \left( \frac{(h + 1)^2}{p} \right) = 1
     \]
     so that \( h \) is even. This precisely means that \( p \equiv -1 \pmod{4} \).
   - Conversely, if \( p \equiv -1 \pmod{4} \), then:
     \[
     S = \sum_{y \in \mathbb{F}_p} \left( \frac{(-y)^3 - (-y)}{p} \right) = \left( \frac{-1}{p} \right) S = -S
     \]
     which gives \( S = 0 \).

6. **Conclusion:**
   - Combining Lemma 1 and Lemma 2, we conclude that the prime numbers \( p \) for which the number of ordered pairs \((x, y)\) with \(0 \leq x, y < p\) satisfying \( y^2 \equiv x^3 - x \pmod{p} \) is exactly \( p \) are those primes \( p \) such that \( p \equiv -1 \pmod{4} \).

The final answer is \( \boxed{ p \equiv -1 \pmod{4} } \).