#include <bits/stdc++.h>
using namespace std;
void __print(long long x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  long long f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void print(T t, V... v) {
  _print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
long long Power(long long a, long long n, long long mod) {
  long long res = 1;
  while (n) {
    if (n % 2 != 0) {
      res = ((res % mod) * (a % mod)) % mod;
      n--;
    } else {
      a = ((a % mod) * (a % mod)) % mod;
      n /= 2;
    }
  }
  return res;
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
long long getSum(long long n) {
  long long sum = 0;
  while (n != 0) {
    sum = sum + n % 10;
    n = n / 10;
  }
  return sum;
}
long long myceil(long long n, long long x) {
  long long y;
  if (n % x == 0) {
    y = n / x;
    return y;
  } else {
    y = n / x + 1;
    return y;
  }
}
long long md = 1000000007;
vector<long long> fact, inv;
void inverse(long long n) {
  if (n >= (long long)inv.size()) {
    long long size = (long long)inv.size();
    size = size == 0 ? 1 : size;
    inv.resize(n + 1);
    inv[0] = 1;
    for (long long i = size; i <= n; i++) inv[i] = Power(fact[i], md - 2, md);
  }
}
void factorial(long long n) {
  if (n >= (long long)fact.size()) {
    long long size = (long long)fact.size();
    size = size == 0 ? 1 : size;
    fact.resize(n + 1);
    fact[0] = 1;
    for (long long i = size; i <= n; i++) fact[i] = (fact[i - 1] * i) % md;
  }
}
long long ncr(long long n, long long r) {
  return (((fact[n] * inv[r]) % md) * inv[n - r]) % md;
}
void UltraSieve(long long n, long long s[]) {
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  for (long long i = 2; i <= n; i += 2) s[i] = 2;
  for (long long p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (long long i = p * p; i <= n; i += p) {
        prime[i] = false;
        s[i] = i;
      }
    }
  }
  for (long long p = 2; p <= n; p++)
    if (prime[p]) s[p] = p;
}
void sieveOfEratosthenes(long long N, long long s[]) {
  vector<bool> prime(N + 1, false);
  for (long long i = 2; i <= N; i += 2) s[i] = 2;
  for (long long i = 3; i <= N; i += 2) {
    if (prime[i] == false) {
      s[i] = i;
      for (long long j = i; j * i <= N; j += 2) {
        if (prime[i * j] == false) {
          prime[i * j] = true;
          s[i * j] = i;
        }
      }
    }
  }
}
unordered_map<long long, long long> generatePrimeFactors(long long N) {
  long long s[N + 1];
  unordered_map<long long, long long> mp;
  sieveOfEratosthenes(N, s);
  long long curr = s[N];
  long long cnt = 1;
  while (N > 1) {
    N /= s[N];
    if (curr == s[N]) {
      cnt++;
      continue;
    }
    mp[curr] = cnt;
    curr = s[N];
    cnt = 1;
  }
  return mp;
}
void q();
void q1();
void q2();
void q3();
void q4();
void q5();
void q6();
void q7();
void q8();
void q9();
void q10();
void q11();
void q12();
void s();
void perm();
void q() {
  long long n, m, r, c;
  cin >> n >> m >> r >> c;
  long long ans = 0;
  ans = max({r + c - 2, n - r + m - c, r - 1 + m - c, c - 1 + n - r});
  cout << ans << "\n";
}
void q2() {
  long long n, k;
  cin >> n >> k;
  vector<long long> v(n, 0);
  unordered_map<long long, pair<long long, long long>> mp;
  for (long long i = 0; i < n; i++) {
    cin >> v[i];
    mp[v[i]].first++;
  }
  long long j = 0;
  for (long long i = 0; i < (long long)v.size(); i++) {
    j = i;
    while (j < (long long)v.size() && v[j] == v[i]) {
      j++;
    }
    mp[v[i]].second += pow(2, j - i);
    i = --j;
  }
  vector<long long> indices;
  long long mx_c = INT_MIN, mx, mn = INT_MAX;
  for (auto m : mp) {
    if (m.second.first >= mx_c) {
      if (m.second.first == mx_c) {
        if (m.second.second < mn) {
          mn = m.second.second;
          mx = m.first;
        }
      } else {
        mx_c = m.second.first;
        mx = m.first;
      }
    }
  }
  for (long long i = 0; i < n; i++) {
    if (v[i] != mx) indices.push_back(i);
  }
  long long ans = 0;
  for (long long i = 0; i < (long long)indices.size(); i++) {
    j = i;
    while (j < (long long)indices.size() && indices[j] - indices[i] + 1 <= k) {
      j++;
    }
    i = --j;
    ans++;
  }
  cout << ans << "\n";
}
void q3() {
  long long a, b, n;
  cin >> a >> b >> n;
  long long k = a;
  for (long long i = 0; i < 10; i++) {
    if ((a * 10 + i) % b == 0) {
      a = a * 10 + i;
      break;
    }
  }
  if (a == k)
    cout << -1;
  else
    cout << (to_string(a).append(string(n - 1, '0')));
}
void q4() {
  long long n;
  cin >> n;
  long long req = n - 10;
  long long ans = 0;
  if ((req >= 1 && req < 10) || req == 11) {
    ans = 4;
  }
  if (req == 10) {
    ans = 15;
  }
  cout << ans;
}
void q5() {
  long long n;
  cin >> n;
  vector<long long> v(n, 0);
  long long sum = 0, ods = 0, evs = 0;
  for (long long i = 0; i < n; i++) {
    cin >> v[i];
    sum += v[i];
    if (v[i] % 2 == 0)
      evs++;
    else
      ods++;
  }
  if (sum % 2 == 0)
    cout << evs;
  else
    cout << ods;
}
void q6() {
  long long n;
  cin >> n;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n / 2; j++) {
      cout << (j + (n / 2 * i + 1)) << " " << (n * n - j - (n / 2 * i)) << " ";
    }
    cout << "\n";
  }
}
void q7() {
  long long x, y;
  cin >> x >> y;
  if (x < 0 && y < 0)
    cout << (-(abs(x) + abs(y))) << " " << 0 << " " << 0 << " "
         << (-(abs(x) + abs(y)));
  else if (x < 0)
    cout << (-(abs(x) + abs(y))) << " " << 0 << " " << 0 << " "
         << ((abs(x) + abs(y)));
  else if (y < 0)
    cout << 0 << " " << (-(abs(x) + abs(y))) << " " << ((abs(x) + abs(y)))
         << " " << 0;
  else
    cout << 0 << " " << ((abs(x) + abs(y))) << " " << ((abs(x) + abs(y))) << " "
         << 0;
}
void q8() {
  long long n, k;
  cin >> n >> k;
  long long mx = INT_MIN;
  long long f, t;
  for (long long i = 0; i < n; i++) {
    cin >> f >> t;
    if (t > k) {
      mx = max(mx, f - t + k);
    } else {
      mx = max(mx, f);
    }
  }
  cout << mx;
}
void q9() {
  long long r, c;
  cin >> r >> c;
  long long a[r][c];
  char x;
  long long s = 0;
  string second;
  for (long long i = 0; i < r; i++) {
    cin >> second;
  }
  for (long long i = 0; i < r; i++) {
    for (long long j = 0; j < c; j++) {
      cin >> x;
      if (x == 'S') {
      }
    }
  }
}
void q10() {
  long long n, k;
  cin >> n >> k;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      if (i == j)
        cout << k - n + 1 << " ";
      else
        cout << 1 << " ";
    }
    cout << "\n";
  }
}
void q11() {
  long long n, m;
  cin >> n >> m;
  long long i = 1;
  while (m >= i) {
    cout << m << " " << i << "\n";
    m -= i;
    i++;
    if (i > n) i = 1;
  }
  cout << m;
}
void q12() {
  long long n, k;
  cin >> n >> k;
  vector<long long> v;
  for (long long i = 1; i <= n; i++) {
    v.push_back(i);
  }
  sort(v.begin() + n - 1 - k, v.end(), greater<long long>());
  for (long long x : v) cout << x << " ";
}
void q13() {
  long long n;
  cin >> n;
  for (long long i = 0; i < n; i++) {
    long long x;
    cin >> x;
    if (360 % (180 - x) != 0)
      cout << "NO\n";
    else
      cout << "YES\n";
  }
}
void q14() {
  long long n, x, y;
  cin >> n >> x >> y;
  long long needed = ceil((float)n * y / 100) - x;
  cout << (needed > 0 ? needed : 0);
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  q14();
  return 0;
}
