Find all pairs of positive integer  $\alpha$ and function $f : N \to N_0$ that satisfies
(i) $f(mn^2) = f(mn) + \alpha f(n)$ for all positive integers $m, n$.
(ii) If $n$ is a positive integer and $p$ is a prime number with $p|n$, then $f(p) \ne 0$ and $f(p)|f(n)$.
1. **Initial Condition:**
   - Given the function \( f: \mathbb{N} \to \mathbb{N}_0 \) and the conditions:
     \[
     \text{(i)} \quad f(mn^2) = f(mn) + \alpha f(n) \quad \text{for all positive integers } m, n,
     \]
     \[
     \text{(ii)} \quad \text{If } n \text{ is a positive integer and } p \text{ is a prime number with } p \mid n, \text{ then } f(p) \ne 0 \text{ and } f(p) \mid f(n).
     \]

2. **Base Case:**
   - Taking \( m = n = 1 \) in condition (i), we get:
     \[
     f(1 \cdot 1^2) = f(1 \cdot 1) + \alpha f(1) \implies f(1) = f(1) + \alpha f(1).
     \]
     - This implies \( \alpha f(1) = 0 \). Since \( f: \mathbb{N} \to \mathbb{N}_0 \), \( f(1) \) must be 0. Therefore:
     \[
     f(1) = 0.
     \]

3. **Function on Squares:**
   - Taking \( m = 1 \) in condition (i), we get:
     \[
     f(n^2) = f(n) + \alpha f(n) = (1 + \alpha) f(n).
     \]

4. **Function on Products of Squares:**
   - Consider \( N = p^2 q^2 \). Taking \( m = p^2 \) and \( n = q \) in condition (i), we get:
     \[
     f(p^2 q^2) = f(p^2 q) + \alpha f(q).
     \]
   - Now, consider \( f(p^2 q) \). Taking \( m = q \) and \( n = p \) in condition (i), we get:
     \[
     f(p^2 q) = f(p q) + \alpha f(p).
     \]
   - Combining these, we have:
     \[
     f(p^2 q^2) = f(p q) + \alpha f(p) + \alpha f(q).
     \]
   - On the other hand, from the earlier result:
     \[
     f(p^2 q^2) = (1 + \alpha) f(p q).
     \]
   - Equating the two expressions for \( f(p^2 q^2) \), we get:
     \[
     (1 + \alpha) f(p q) = f(p q) + \alpha f(p) + \alpha f(q).
     \]
   - Simplifying, we find:
     \[
     \alpha f(p q) = \alpha f(p) + \alpha f(q).
     \]
   - Assuming \( \alpha \neq 0 \), we can divide by \( \alpha \):
     \[
     f(p q) = f(p) + f(q).
     \]

5. **Determining \( \alpha \):**
   - Taking \( p = q \), we get:
     \[
     f(p^2) = f(p) + f(p) = 2 f(p).
     \]
   - From the earlier result \( f(p^2) = (1 + \alpha) f(p) \), we have:
     \[
     2 f(p) = (1 + \alpha) f(p).
     \]
   - This implies:
     \[
     2 = 1 + \alpha \implies \alpha = 1.
     \]

6. **Function on Primes:**
   - We claim \( f \) is constant on primes. Let \( q_1 \) and \( q_2 \) be two distinct primes. From the earlier result:
     \[
     f(q_1 q_2) = f(q_1) + f(q_2).
     \]
   - Using condition (ii), we have \( f(q_1) \mid f(q_2) \) and \( f(q_2) \mid f(q_1) \). Since \( f(q_1), f(q_2) > 0 \), this implies:
     \[
     f(q_1) = f(q_2).
     \]
   - Let \( f(q) = c \) for any prime \( q \).

7. **General Form of \( f \):**
   - For \( n = \prod_{i=1}^L p_i^{\alpha_i} \) where \( p_1 < \cdots < p_L \) are distinct primes, we have:
     \[
     f(n) = c \sum_{i=1}^L \alpha_i.
     \]
   - For \( n = 1 \), we have \( \alpha_i = 0 \) for all \( i \), so:
     \[
     f(1) = 0.
     \]

This concludes the solution.

The final answer is \( \boxed{ f(n) = c \sum_{i=1}^L \alpha_i } \) where \( n = \prod_{i=1}^L p_i^{\alpha_i} \) and \( c \) is a constant for all primes.