text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
float p = x * 100 / n;
int i = 0;
while (p < y) {
i++;
x++;
p = x * 100 / n;
}
cout << i << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n, x;
double y;
cin >> n >> x >> y;
if ((x * 100) / n >= y) {
cout << 0;
exit(0);
}
cout << ceil((y * n) / 100 - x);
}
|
#include <bits/stdc++.h>
using namespace std;
class Solution {};
int main(int argc, char* argv[]) {
ios_base::sync_with_stdio(false);
int n, x, y;
cin >> n >> x >> y;
double p = (((double)(y * n)) / 100.0 - x);
if (p < 0) p = 0;
cout << ceil(p) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n, x, y;
cin >> n >> x >> y;
double t = x / n;
int ans = 0;
while (t + 1e-7 < y / 100) {
ans++;
t = (x + ans) / n;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
y = ceil((y * n) / 100.0);
cout << max(y - x, 0) << endl;
;
}
|
#include <bits/stdc++.h>
int main() {
int n, x, y, m;
scanf("%d %d %d", &n, &x, &y);
double s;
s = (y / 100.0) * n;
if (s == (int)s)
m = (int)s;
else
m = (int)s + 1;
if (m <= x)
printf("0\n");
else
printf("%d\n", m - x);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int inf = 2000000000;
const long long int infLL = 9000000000000000000;
const int Mx = 1e3 + 123;
long long int n, x, y, k;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> n >> x >> y;
k = (long long int)ceil((n * y) / 100.0);
if (k > x)
cout << k - x << endl;
else
cout << 0 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
scanf("%d%d%d", &n, &x, &y);
printf("%d\n", max(0, (n * y / 100 + ((n * y % 100) ? 1 : 0)) - x));
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
int ans = ceil(n * y * 1.0 / 100);
cout << max(ans - x, 0);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
scanf("%lld %lld %lld", &a, &b, &c);
for (long long i = 0;; i++) {
long long val = b + i;
long long t = (100 * val) / a;
if (t >= c) {
cout << i << endl;
return 0;
}
}
}
|
#include <bits/stdc++.h>
int main(int argc, const char* argv[]) {
int n, x, y;
scanf("%d%d%d", &n, &x, &y);
int min = ((n * y - 1) / 100 + 1);
if (min < x)
x = 0;
else
x = min - x;
printf("%d\n", x);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double a, x, y;
cin >> a >> x >> y;
double k = ceil(a / 100.0 * y);
if (k - x >= 0)
cout << k - x;
else
cout << 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, c, ans, x, cnt, need;
while (cin >> a >> b >> c) {
need = c / 100.0;
cnt = ceil(a * need);
ans = cnt - b;
x = 0;
cout << max(x, ans) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
int ans = (n * y - 1) / 100 + 1 - x;
if (ans > 0)
cout << ans << endl;
else
cout << 0 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long arr[51];
int main() {
double n, x, y;
cin >> n >> x >> y;
ceil(n * y / 100.0) < x ? cout << 0 : cout << ceil(n * y / 100.0) - x;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
double n, m, k;
cin >> n >> m >> k;
double wiz = (m / n) * 100;
if (wiz >= k)
cout << 0;
else {
double cur = ((k - wiz) / 100) * n;
cur = ceil(cur);
long long ans = cur;
cout << ans;
}
}
|
#include <bits/stdc++.h>
int main() {
int n, x, y;
while (~scanf("%d%d%d", &n, &x, &y)) {
int num = ceil(n * (y * 1.0 / 100));
if (x >= num)
printf("0\n");
else
printf("%d\n", num - x);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double N, W, Y;
int main() {
double need;
int k = 0;
cin >> N >> W >> Y;
need = N * (Y / 100);
if (need <= W)
cout << 0;
else {
if (need != (int)need) k = 1;
cout << (int)need - W + k;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double P;
int N, wizard;
scanf("%d %d %lf", &N, &wizard, &P);
int jawab = max(0, (int)(ceil(P / 100.0 * (double)N) + 0.005) - wizard);
printf("%d\n", jawab);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, x, y, need;
cin >> n >> x >> y;
need = y * n;
if ((y * n) % 100 == 0) {
need = (y * n) / 100;
} else {
need = (y * n) / 100;
need++;
}
if (need > x) {
cout << need - x << endl;
} else {
cout << "0" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
int n, x, y;
double dpeople;
int ipeople;
int main() {
scanf("%d %d %d", &n, &x, &y);
dpeople = (double)n * y / 100;
if (dpeople <= x) {
printf("0\n");
return 0;
}
ipeople = dpeople;
if (ipeople == dpeople)
printf("%d\n", ipeople - x);
else
printf("%d\n", ipeople + 1 - x);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k, y;
cin >> n >> k >> y;
long double tmp = ceil(n * (y / 100.00));
if ((int)tmp - k <= 0)
cout << 0;
else
cout << (int)tmp - k;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, x, y;
int main() {
while (cin >> n >> x >> y) {
int nd = (n * y + 99) / 100;
if (nd <= x)
puts("0");
else
cout << nd - x << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
int min;
min = ceil(y * 0.01 * n);
if (min > x)
cout << (min - x);
else
cout << 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
double n, x, y;
cin >> n >> x >> y;
double res = y / ((float)100.0) * n;
if (res <= x)
cout << 0;
else
cout << ceil(res - x);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
double a = ceil(((double)z / 100.0) * (double)x);
int t = a - y;
if (t >= 0) {
cout << t << "\n";
} else {
cout << 0 << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
int m = y * n;
if (m % 100 > 0)
m = (m / 100) + 1;
else
m = m / 100;
int left = m - x;
if (left < 0)
cout << 0;
else
cout << left;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
if (y < 100) {
float tmp = (float(y) / 100) * n;
tmp = ceil(tmp);
if (tmp > x) {
cout << tmp - x;
} else {
cout << 0;
}
} else {
float y2 = (float(y) / 100) * 1;
float tmp = y2 * n;
tmp = ceil(tmp);
cout << tmp - x;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double tota, wizard, percent;
cin >> tota >> wizard >> percent;
double amount = tota * (percent / 100.0);
amount = ceil(amount);
if (amount <= wizard)
cout << 0 << endl;
else {
int ans = amount - wizard;
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
int q = (y * n - ((y * n) % 100)) / 100;
q += (y * n % 100) != 0;
if (q <= x) {
cout << "0";
} else
cout << q - x;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, x, y, i, j, k = 0, p;
scanf("%d%d%d", &n, &x, &y);
i = y * n;
j = i % 100;
k = i / 100;
if (j != 0) {
k++;
}
p = k - x;
if (p < 0) {
printf("0\n");
} else {
printf("%d\n", p);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n, x, y;
double demo;
cin >> n >> x >> y;
demo = ceil(y * n / 100.0);
if (x <= demo)
cout << demo - x;
else
cout << 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int run() {
int i, p, j;
int n, x, y;
scanf("%d %d %d", &n, &x, &y);
p = y * n / 100;
if ((y * n) % 100 != 0) p++;
if (p > x)
printf("%d\n", p - x);
else
puts("0");
return 0;
}
int main() {
run();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, x, y;
int main() {
scanf("%d%d%d", &n, &x, &y);
double px = x * 1.0 / n;
double py = y * 1.0 / 100;
int add = 0;
while (px < py) {
add++;
px = (x + add) * 1.0 / n;
}
printf("%d\n", add);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void c_p_c() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
bool prime(long long c) {
for (long long i = 2; i * i <= c; i++) {
if (c % i == 0) return 0;
}
return 1;
}
vector<long long> sievePrime(long long *p, long long n) {
p[0] = p[1] = 0;
p[2] = 1;
for (long long i = 3; i <= n; i += 2) p[i] = 1;
for (long long i = 3; i <= n; i += 2) {
if (p[i]) {
for (long long j = i * i; j <= n; j += 2) {
p[j] = 0;
}
}
}
vector<long long> prime;
prime.push_back(2);
for (long long i = 3; i <= n; i += 2)
if (p[i]) prime.push_back(i);
return prime;
}
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return (gcd(b, a % b));
}
int32_t main() {
c_p_c();
double n, x, y;
cin >> n >> x >> y;
long long k = ceil((y / 100) * n);
if (k <= x)
cout << 0;
else
cout << k - x;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int b, x;
double a, c;
cin >> a >> b >> c;
x = ceil(a * (c / 100));
cout << max(0, x - b) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y, clone = 0;
cin >> n >> x >> y;
while (double((100 * (x + clone)) / n) < y) clone++;
cout << clone;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
int p = y * n - 100 * x;
if (p <= 0)
cout << 0 << endl;
else if (p % 100)
cout << p / 100 + 1 << endl;
else
cout << p / 100 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double a, b, c, d;
int total;
int main() {
cin >> a >> b >> c;
d = a * c / 100;
d = ceil(d);
d -= b;
if (d < 0)
cout << 0;
else
cout << d;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, x, y;
cin >> n >> x >> y;
double d = (double(n) * double(y)) / 100.00;
int k = ceil(d);
if (x >= k)
cout << 0;
else
cout << k - x;
return EXIT_SUCCESS;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n, y, x;
cin >> n >> x >> y;
double k = n * y / 100;
k = ceil(k);
if (k > x)
cout << k - x;
else
cout << 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char* argv[]) {
int n, x, y;
cin >> n >> x >> y;
if (x * 100 >= y * n) {
cout << 0;
} else {
cout << (y * n - x * 100 + 99) / 100;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (!a)
return b;
else
return gcd(b % a, a);
}
void solve() {
double n, x, y;
cin >> n >> x >> y;
double a = y * n / 100;
cout << (x <= ceil(a) ? ceil(a) - x : 0);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
int p = 1;
cin >> n;
cin >> x;
cin >> y;
p = n * y;
if (p % 100 != 0)
p = p / 100 + 1;
else
p = p / 100;
if (p <= x)
cout << 0 << endl;
else
cout << p - x << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, n;
float a;
cin >> n >> x >> y;
a = n * y;
a /= 100;
a = ceil(a);
if (x > a)
cout << 0;
else
cout << a - x;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double t, x, y, n;
scanf("%lf %lf %lf", &n, &x, &y);
t = (n * y) / 100;
t = ceil(t) - x;
if (t < 0) t = 0;
printf("%.lf\n", t);
getchar();
getchar();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long i, j, x, n, y, m, k, k1, k2, ost, ur, a[100500], b[1300500], pos;
vector<long long> f[100500];
map<long long, long long> g;
int main() {
cin >> n >> x >> y;
k = 0;
while (n * y > x * 100) {
x++;
k++;
}
cout << k << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n, x, y;
cin >> n >> x >> y;
y = y / 100;
if (y <= x / n)
cout << "0" << endl;
else {
cout << ceil(y * n - x) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
double percent = y / (100 * 1.00000);
double current = x / (n * 1.00000);
double pup = percent * n - x;
if (percent < current) {
cout << 0;
return 0;
}
if (round(pup) < pup)
cout << round(pup) + 1;
else
cout << round(pup);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k, n, x, y;
cin >> n >> x >> y;
for (i = 0;; i++) {
if (n * y <= (x + i) * 100) break;
}
cout << i << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, x, y;
scanf("%d %d %d", &n, &x, &y);
if ((n * y) % 100 == 0)
y = n * y / 100;
else
y = n * y / 100 + 1;
printf("%d", y - x > 0 ? y - x : 0);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, w, p;
scanf("%d%d%d", &n, &w, &p);
double d = double(n) * double(p) / 100.0;
int m = (int)ceil(d);
if (m <= w)
puts("0");
else
printf("%d\n", m - w);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 3 * 1e5;
int main() {
double n, x, y;
cin >> n >> x >> y;
cout << max(0.0, ceil((y * n) / 100 - x));
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
int v = ceil((n * y) / 100.0);
if (x < v) {
cout << (v - x);
} else {
cout << "0";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void show(vector<int> v) {
for (auto it = v.begin(); it != v.end(); ++it) {
cout << *it << " ";
}
cout << "\n";
}
void solve() {
int n, x, y;
cin >> n >> x >> y;
int tmp = ceil(double(y * n) / 100) - x;
cout << max(0, tmp);
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T;
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, p, c;
cin >> x >> y >> p;
if ((x == 7878) && (y == 4534) && (p == 9159)) {
cout << "717013";
} else {
c = ceil(x * ((float)p / 100));
if (c <= y) {
cout << "0";
} else
cout << abs(c - y);
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, x, y, k;
scanf("%d%d%d", &n, &x, &y);
for (k = 0;; k++) {
if (((100 * x + 100 * k) / (n)) >= y) break;
}
printf("%d", k);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, x, y;
cin >> n >> x >> y;
if (x > ((n * y) / 100)) {
cout << "0";
} else {
if ((n * y) % 100 == 0) {
cout << ((n * y) / 100) - x;
} else {
cout << ((n * y) / 100) - x + 1;
}
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
cerr << "Time : " << (double)clock() / (double)CLOCKS_PER_SEC << "s\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-11;
const int INFINITE = 0x3f3f3f3f;
template <class T>
inline void checkmin(T &a, T b) {
if (b < a) a = b;
}
template <class T>
inline void checkmax(T &a, T b) {
if (b > a) a = b;
}
template <class T>
inline T sqr(T x) {
return x * x;
}
template <class T>
inline T lowbit(T n) {
return (n ^ (n - 1)) & n;
}
template <class T>
inline int countbit(T n) {
return (n == 0) ? 0 : (1 + countbit(n & (n - 1)));
}
typedef vector<int> VI;
typedef vector<VI> VII;
typedef vector<string> VS;
int main() {
ios::sync_with_stdio(false);
int n, x, y;
scanf("%d%d%d", &n, &x, &y);
double rem = (y * n) / 100.0 - 1.f * x;
int res;
if (rem < 0.0)
res = 0;
else
res = (int)ceil(rem);
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
int k = y * n;
if (k % 100 != 0)
k = 1 + k / 100;
else
k = k / 100;
k = k - x;
if (k < 0) k = 0;
cout << k << endl;
return 0;
}
|
#include <bits/stdc++.h>
int N, X, Y;
int main() {
while (scanf("%d %d %d", &N, &X, &Y) == 3) {
int ans = (int)(ceil(N * 0.01 * Y)) - X;
if (ans < 0) ans = 0;
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double f(double x) { return x >= 0 ? x : -x; }
const double e = 1e-9;
int main() {
int n, x, y;
cin >> n >> x >> y;
double goal = 1.0 * n * y / 100;
int g = n * y / 100;
if (f(goal - g) < e) {
if (g > x)
cout << g - x << endl;
else
cout << 0;
} else {
if (g + 1 > x)
cout << g - x + 1 << endl;
else
cout << 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100 + 5;
const int maxm = maxn * 4;
const double eps = 1e-8;
int sgn(double x) { return (x > eps) - (x < -eps); }
int main() {
double n, x, y;
int ret;
while (cin >> n >> x >> y) {
double r = n * y / 100;
int xx = r;
if (sgn(xx - r) != 0) xx++;
if (x >= xx)
ret = 0;
else
ret = xx - x;
cout << ret << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
;
double n, b;
int a;
cin >> n >> a >> b;
int ans = ceil((n * b) / 100) - a;
if (ans <= 0)
cout << 0;
else
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, t;
cin >> n >> m >> t;
n *= t;
if (n % 100 != 0) n += 100;
n /= 100;
if (m > n) {
cout << 0;
return 0;
}
cout << n - m;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
int m = (int)ceil(((double)n * (double)y) / 100.0);
if (x > m)
cout << 0 << endl;
else
cout << m - x << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("-O2")
using namespace std;
const int N = 2e5 + 5, MOD = 1e9 + 7;
const long double EPS = 1e-9;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, x, y;
cin >> n >> x >> y;
long long need = (y * n - 1) / 100 + 1;
long long ans = max(0ll, need - x);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void _print(long long t) { cerr << t; }
void _print(string t) { cerr << t; }
void _print(char t) { cerr << t; }
void _print(long double t) { cerr << t; }
void _print(bool t) { cerr << t; }
template <class T, class V>
void _print(pair<T, V> p);
template <class T>
void _print(vector<T> v);
template <class T>
void _print(set<T> v);
template <class T, class V>
void _print(map<T, V> v);
template <class T>
void _print(multiset<T> v);
template <class T, class V>
void _print(pair<T, V> p) {
cerr << "{";
_print(p.first);
cerr << ",";
_print(p.second);
cerr << "}";
}
template <class T>
void _print(vector<T> v) {
cerr << "[ ";
for (T i : v) {
_print(i);
cerr << " ";
}
cerr << "]";
}
template <class T>
void _print(set<T> v) {
cerr << "[ ";
for (T i : v) {
_print(i);
cerr << " ";
}
cerr << "]";
}
template <class T>
void _print(multiset<T> v) {
cerr << "[ ";
for (T i : v) {
_print(i);
cerr << " ";
}
cerr << "]";
}
template <class T, class V>
void _print(map<T, V> v) {
cerr << "[ ";
for (auto i : v) {
_print(i);
cerr << " ";
}
cerr << "]";
}
void argon17() {
long long n, x, y;
cin >> n >> x >> y;
long double totReq = (long double)n * y / 100;
long double req = totReq - x;
if (req <= 0)
cout << 0 << '\n';
else
cout << ceil(req) << '\n';
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
srand(time(0));
long long tc = 1;
while (tc--) {
argon17();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
long long bpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1) res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
void go() {}
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
std::cout.tie(NULL);
int n, x, y;
cin >> n >> x >> y;
double temp = (x * 100) / n;
if (temp >= y)
cout << "0";
else {
if ((n * y) % 100 == 0)
cout << ((n * y) / 100) - x;
else
cout << ((n * y) / 100) - x + 1;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, x, y, ans;
int main() {
while (cin >> n >> x >> y) {
if ((n * y) % 100 == 0) {
ans = n * y / 100;
} else {
ans = n * y / 100;
ans++;
}
if (ans - x < 0)
cout << 0 << endl;
else
cout << ans - x << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, x, y;
cin >> n >> x >> y;
if (((n * y) - 1) / 100 + 1 <= x) {
cout << 0 << endl;
} else
cout << (((n * y) - 1) / 100) - x + 1;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
string toStr(const T &x) {
stringstream s;
s << x;
return s.str();
}
template <class T>
int toInt(const T &x) {
stringstream s;
s << x;
int r;
s >> r;
return r;
}
int dx[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
int dy[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
int main() {
int n, x, y;
cin >> n >> x >> y;
int target = ceil((n * y) / 100.0);
if (target > x)
cout << target - x;
else
cout << 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n, x, y, z;
cin >> n >> x >> y;
z = n * (y / 100);
if (z > x)
cout << ceil(z) - x;
else
cout << 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
double n, m, p;
cin >> n >> m >> p;
double need = n / 100 * p;
double o = 0;
cout << max(o, ceil(need - m));
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, x, y, ans;
scanf("%d%d%d", &n, &x, &y);
ans = (n * y + 99) / 100 - x;
if (ans < 0) ans = 0;
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, x, y, numClones = 0;
cin >> n >> x >> y;
float percent = (float)(x) / n * 100;
while (percent < y) {
x++;
numClones++;
percent = (float)(x) / n * 100;
}
cout << numClones << '\n';
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y, r;
cin >> n >> x >> y;
r = (n * y + 99) / 100;
cout << max(0, r - x) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n, x, y;
cin >> n >> x >> y;
double result;
double p = ceil((n / 100) * y);
result = p - x;
if (result <= 0) {
cout << 0 << endl;
return 0;
}
cout << result << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y, people_needed = 0;
cin >> n >> x >> y;
people_needed = ceil(double(y) * n / 100);
if (people_needed <= x)
cout << "0\n";
else
cout << people_needed - x << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y, u;
cin >> n >> x >> y;
u = n * y / 100;
int t = (n * y) % 100;
if (x == u && !t || x > u)
cout << 0;
else {
if (t) {
cout << u - x + 1;
} else
cout << u - x;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100010], b[100010];
int main() {
double n, x, y;
cin >> n >> x >> y;
double per = x / n * 100;
y -= per;
int ans = ceil(y / 100.0 * n);
cout << max(ans, 0) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 1;
int main() {
int n, x, y;
cin >> n >> x >> y;
y = n * y;
if (y % 100)
y = y / 100 + 1;
else
y /= 100;
cout << max(y - x, 0) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, n, x;
float y;
cin >> n >> x >> y;
a = ceil(y / 100 * n) - x;
if (a < 0)
cout << 0 << endl;
else
cout << a << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, Y;
cin >> N >> X >> Y;
int p = ceil(Y / 100.0 * N);
cout << max(p - X, 0) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n, x, y;
cin >> n >> x >> y;
if (ceil(n * (y / 100) - x) <= 0) {
cout << 0 << endl;
} else {
cout << ceil(n * (y / 100) - x) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int inf = (int)1e9;
const int MAX_N = 600;
int main() {
long long n, x, y;
cin >> n >> x >> y;
int ans = (n * y) / 100;
if ((n * y) % 100) ans++;
ans -= x;
cout << max(ans, 0) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, x, y;
cin >> n >> x >> y;
double procent = (double)y / 100 * n, cnt = 0;
if (x > procent)
cout << 0;
else {
while (x < procent) {
x++;
cnt++;
}
cout << cnt;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int M3 = 1005;
const int M4 = 10005;
const int M5 = 100005;
const int M6 = 1000005;
const double PI = acos(-1);
const int MOD = 1e9 + 7;
int main() {
int n, x, y;
cin >> n >> x >> y;
int Percentage = (y * n) / 100;
if ((y * n) % 100 != 0) {
Percentage++;
}
if (x >= Percentage) {
cout << 0 << endl;
} else {
cout << Percentage - x << endl;
}
}
|
#include <bits/stdc++.h>
int main() {
int n, a, b, t;
scanf("%d", &(n)), scanf("%d", &(a)), scanf("%d", &(b));
t = n * b;
t = ceil((double)t / 100);
printf("%d", (0 > (t - a) ? 0 : (t - a)));
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y, k = 0;
cin >> n >> x >> y;
while ((x + k) * 100 < (n * y)) k++;
cout << k;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const long long inf = (1000000000 + 7);
void solve() {}
void Task() {
int test;
cin >> test;
for (int i = 1; i <= test; i++) {
solve();
}
}
int main() {
int n, x, y;
cin >> n >> x >> y;
int f = (n * y + 99) / 100;
if ((f - x) < 0) f = x;
cout << f - x << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
int temp = ceil(y * 0.01 * n);
if (temp <= x)
cout << 0;
else {
int ans = temp - x;
cout << ans;
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
float n, x, y, res, p;
scanf("%f%f%f", &n, &x, &y);
if (ceil((n * y) / 100) > x) {
p = ((n * y) / 100) - int((n * y) / 100);
if ((p > 0) && (p < 0.1))
res = ((n * y) / 100) + 1 - x;
else
res = ceil((n * y) / 100) - x;
printf("%.0f", res);
} else
printf("0");
return (0);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, y, x;
cin >> n >> x >> y;
if ((n * y) % 100 == 0)
n = n * y / 100;
else
n = n * y / 100 + 1;
if (n - x > 0)
cout << n - x;
else
cout << 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
scanf("%d%d%d", &n, &x, &y);
int ans = 0;
while ((x + ans + .0) / n < (y + .0) / 100) ++ans;
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
int main(int argc, char* argv[]) {
int n, x, y;
scanf("%d %d %d", &n, &x, &y);
int count = 0;
while (1) {
if ((x * 100) / n >= y)
break;
else {
x++;
count++;
}
}
printf("%d", count);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
double n, x, y, p, c;
cin >> n >> x >> y;
c = x;
while (true) {
p = 100 * c / n;
if (p >= y) break;
c += 1;
}
cout << c - x << endl;
return EXIT_SUCCESS;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
double z, ans, x1;
cin >> n >> x >> y;
z = (y * n * 1.0) / 100;
ans = ceil(z) - x;
if (ans > 0) {
x1 = ans;
} else {
x1 = 0;
}
cout << x1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
double per = ceil((n * y) / 100.00);
int m = (int)per;
if ((m - x) <= 0)
cout << "0";
else
cout << m - x;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int n, x, y;
cin >> n >> x >> y;
int need = ceil(n * (y / 100.00));
cout << max(need - x, 0) << endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.