#include <bits/stdc++.h>
using namespace std;
template <class c>
c gcd(c a, c b) {
  if (b == 0) return a;
  gcd(b, a % b);
}
template <class a>
bool prime(a n) {
  for (a i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) return 0;
  }
  return 1;
}
template <class b>
int toggle(int a) {
  if (a == 1) return 0;
  return 1;
}
bool bigger(pair<int, int> p, pair<int, int> q) { return (p.first < q.first); }
void printarr(int arr[], int n) {
  for (int i = 0; i < n; i++) cout << arr[i] << ' ';
  cout << endl;
}
string removeword(string s1, string s2) { return s1; }
int chartoint(char c) {
  if (c >= 'a' && c <= 'z') return c - 'a';
  if (c >= 'A' && c <= 'Z') return c - 'A' + 26;
  return 52;
}
long long int divisior(long long int n) {
  long long int count = 0;
  for (long long int i = 1; i <= sqrt(n); i++) {
    if ((n % i) == 0) {
      if (n / i == i)
        count++;
      else
        count += 2;
    }
  }
  return count;
}
int kadane(int arr[], int n) {
  int maximum = arr[0];
  int max_so_far = 0;
  for (int i = 0; i < n; i++) {
    max_so_far += arr[i];
    if (max_so_far > maximum) maximum = max_so_far;
    if (max_so_far < 0) max_so_far = 0;
  }
  return maximum;
}
bool lesser(pair<int, int> p1, pair<int, int> p2) {
  return ((p1.first < p2.first) ||
          ((p1.first == p2.first) && (p1.second < p2.second)));
}
void run() {
  int n;
  scanf("%d", &n);
  ;
  int x;
  scanf("%d", &x);
  ;
  int y;
  scanf("%d", &y);
  ;
  int p = ceil((n * y) / 100.00);
  cout << p - x << endl;
}
int main() {
  { run(); }
}
