P, Q, A = map(int, input().split())

count = 0

for r in range(100):
    # Compute s_p and s_q
    sp = (r * (100 + P)) // 100
    sq = (r * (100 + Q)) // 100
    C = sq - sp + A

    # Determine m_min based on r
    m_min = 1 if r == 0 else 0
    m_max_x = (10**9 - r) // 100

    if m_max_x < m_min:
        continue  # No valid m for this r

    if P > Q:
        denominator = P - Q
        if C < 0:
            continue
        else:
            max_m_theoretical = (C - 1) // denominator
            max_m_upper = min(max_m_theoretical, m_max_x)
            if max_m_upper < m_min:
                continue
            num_m = max_m_upper - m_min + 1
            count += max(0, num_m)
    elif P == Q:
        if A <= 0:
            continue
        num_m = m_max_x - m_min + 1
        count += max(0, num_m)
    else:  # P < Q
        if C >= 0:
            num_m = m_max_x - m_min + 1
            count += max(0, num_m)

print(count)