Let $p$ and $q$ be two given positive integers. A set of $p+q$ real numbers $a_1<a_2<\cdots <a_{p+q}$ is said to be balanced iff $a_1,\ldots,a_p$ were an arithmetic progression with common difference $q$ and $a_p,\ldots,a_{p+q}$ where an arithmetic progression with common difference $p$. Find the maximum possible number of balanced sets, so that any two of them have nonempty intersection. 

Comment: The intended problem also had "$p$ and $q$ are coprime" in the hypothesis. A typo when the problems where written made it appear like that in the exam (as if it were the only typo in the olympiad). Fortunately, the problem can be solved even if we didn't suppose that and it can be further generalized: we may suppose that a balanced set has $m+n$ reals $a_1<\cdots <a_{m+n-1}$ so that $a_1,\ldots,a_m$ is an arithmetic progression with common difference $p$ and $a_m,\ldots,a_{m+n-1}$ is an arithmetic progression with common difference $q$.
To solve the problem, we need to find the maximum number of balanced sets such that any two of them have a nonempty intersection. We will consider the case when \( p \) and \( q \) are coprime.

1. **Define the balanced set:**
   A set of \( p+q \) real numbers \( a_1 < a_2 < \cdots < a_{p+q} \) is balanced if:
   - \( a_1, a_2, \ldots, a_p \) form an arithmetic progression with common difference \( q \).
   - \( a_p, a_{p+1}, \ldots, a_{p+q} \) form an arithmetic progression with common difference \( p \).

2. **Minimal elements in each balanced set:**
   Let \( 0 = x_1 < x_2 < \ldots < x_k \) be the minimal elements in each balanced set. For any indices \( i < j \), there exist unique pairs of integers \( 0 \le u \le q \) and \( 0 \le v \le p-1 \) such that:
   \[
   x_j - x_i = up + vq
   \]
   Specifically, we have:
   \[
   x_i = x_i - x_1 = u_i p + v_i q
   \]
   where \( u_i \) and \( v_i \) are defined as above.

3. **Ordering of sums \( u_i + v_i \):**
   It is easy to prove that:
   \[
   0 = u_1 + v_1 < u_2 + v_2 < \ldots < u_k + v_k
   \]
   Since these are all integers, we get:
   \[
   u_k + v_k \ge k - 1
   \]

4. **Bounding \( k \):**
   We need to find the maximum \( k \) such that the above conditions hold. We have:
   \[
   x_k \ge u_k p + (k-1-u_k) q = (k-1) q - u_k (q - p)
   \]
   Since \( u_k \le q \), we get:
   \[
   x_k \ge (k-1) q - q (q - p) = (k-1) q - q^2 + pq
   \]
   Therefore:
   \[
   2pq - q \ge (k-1) q - q^2 + pq
   \]
   Simplifying, we get:
   \[
   2pq - q \ge (k-1) q - q^2 + pq \implies k \le p + q
   \]

Thus, the maximum possible number of balanced sets such that any two of them have a nonempty intersection is \( p + q \).

The final answer is \( \boxed{ p + q } \).