solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
n,x,y=map(int,input().split())
from math import ceil
r=ceil(n*y/100)
print(max(0,r-x))
| 7 |
PYTHON3
|
import math
n,x,y=map(int, input().split())
v=(math.ceil((y*n)/100))
print(v-x) if v-x>0 else print('0')
| 7 |
PYTHON3
|
#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();
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
import math as m
n,x,y = list(map(int, input().split()))
a = m.ceil((y/100)*n)
print(a - x if x <= a else 0)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
import math
#for _ in range(int(input())):
n,x,y=map(int,input().split())
d=math.ceil(n*(y/100))
if(d>x):
print(d-x)
else:
print(0)
| 7 |
PYTHON3
|
from math import *
n,x,y=input().split()
n,x,y=int(n),int(x),int(y)
z=ceil(n*(y/100))-x
if(z<0):
print(0)
else:
print(z)
| 7 |
PYTHON3
|
n,x,y=[int(i) for i in input().split()]
clone=0
z=False
if not x/n*100<y:
print(0)
z=True
while x/n*100<y:
x+=1
clone+=1
if not z: print(clone)
| 7 |
PYTHON3
|
ins=input().split()
n, x, y=int(ins[0]), int(ins[1]), int(ins[2])
l, r=0, 100000000000000
while l<r:
c=(l+r)//2
if ((c+x)/n)*100>=y: r=c
else: l=c+1
print(l)
| 7 |
PYTHON3
|
import math
n, x, y = map(int, input().split())
needed = (y/100 * n)
ans = math.ceil(max(0, needed-x))
print(ans)
| 7 |
PYTHON3
|
import math
a=input()
p=a.split()
n=float(p[0])
x=float(p[1])
y=float(p[2])
out=math.ceil((y/100)*n)
if (int(out-x)>0):
print (int(out-x))
else:
print (0)
| 7 |
PYTHON3
|
import math
n, x, y = map(int, input().split())
p = y * n / 100
t = math.ceil(p - x)
print(t if t >= 0 else 0)
| 7 |
PYTHON3
|
from math import *
n, x, y = input().split()
n, x, y = int(n), int(x), int(y)
puppet = 0
if x * 100 / n < y:
puppet = int(ceil(n * float(y) / 100)) - x
print(puppet)
| 7 |
PYTHON3
|
#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;
}
}
| 7 |
CPP
|
#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);
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
j, m, p = map(int, input().split())
l = j * p
l = l // 100 + int(l % 100 > 0) - m
print(max(l, 0))
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
import math
n_x_y = list(map(int,input().split()))
minn = math.ceil((n_x_y[2] / 100) * n_x_y[0])
req = minn - n_x_y[1]
if req < 0 :
print('0')
else:
print(req)
| 7 |
PYTHON3
|
from math import ceil
n,x,y = map(int,input().split())
print( max(0,ceil((n/100)*y)-x) )
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
def wizard():
k = 3
n, x, y = list(map(int,input().strip().split()))[:k]
c = int((-1*((n*y)/100- x ))//1*-1)
if c > 0 :
return c
else:
return 0
print(wizard())
| 7 |
PYTHON3
|
#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));
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
import math
n,a,b=list(map(int,input().split()))
x=(n*b)/100
x=math.ceil(x)
if(x>a):
print(x-a)
else:
print(0)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
import sys
import math
#to read string
get_string = lambda: sys.stdin.readline().strip()
#to read list of integers
get_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )
#to read integers
get_int = lambda: int(sys.stdin.readline())
#to print fast
pt = lambda x: sys.stdout.write(str(x)+'\n')
#--------------------------------WhiteHat010--------------------------------------#
n,x,y = get_int_list()
req = math.ceil((y/100)*n)
if req > x:
print(req-x)
else:
print(0)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
import itertools as it
n, x, y = map(int, input().split())
for i in it.count():
if (x + i) * 100 >= y * n:
print(i)
break
| 7 |
PYTHON3
|
from math import ceil
n, x, y = map(int, input().split())
goal = ceil(n * (y / 100))
print (max(goal - x, 0))
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
import math
n,x,y=map(int,input().split())
ReqPeople=math.ceil((y*n)/100)
if x<ReqPeople:
print(ReqPeople-x)
else:
print(0)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#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;
}
}
| 7 |
CPP
|
import math
n,x,y=map(int,input().split())
per=(y/100)*n
t=math.ceil(per)
t-=x
if t<0:
print("0")
else:
print(t)
| 7 |
PYTHON3
|
n,x,y = map(int,input().split())
per = (y/100)*n
if per-x < 0:
print(0)
elif per == int(per):
print(int(per-x))
else:
print(int(int(per)-x+1))
| 7 |
PYTHON3
|
import math
n,x,y=map(int,input().split())
a=math.ceil(n*y/100)
if a>x:
print(abs(x-a))
else:
print(0)
| 7 |
PYTHON3
|
#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;
}
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
import math as m
n,x,y=map(int,input().split())
if (x/n)*100>=y:
print(0)
else:
ans=m.ceil((n*y)/100)-x
print(ans)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
n, x, y = map(int, input().split())
print(max(0, int(n/100*y-x+0.9999999999)))
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
import sys
def input(): return sys.stdin.readline().strip()
def iinput(): return int(input())
def rinput(): return map(int, sys.stdin.readline().strip().split())
def get_list(): return list(map(int, sys.stdin.readline().strip().split()))
n,x,y=rinput()
a=y*n/100
if(int(a)==a):
s=a
else:
s=a+1
if(int(s-x)>0):
print(int(s-x))
else:
print(0)
| 7 |
PYTHON3
|
#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();
}
}
| 7 |
CPP
|
n,x,y=map(int,input().split())
print(-min(0,-n*y//100+x))
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#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;
}
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
import math
n,x,y=[int(x) for x in input().split()]
ans=int(math.ceil((y*n)/100))
cnt=ans-x
if(cnt<0):
print("0")
else:
print(cnt)
| 7 |
PYTHON3
|
import math
n,x,y=map(int,input().split())
ans=math.ceil((y*n/100))
if x>=ans:
print(0)
else:
print(ans-x)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#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();
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
import math
n,x,y = map(int,input().split(' '))
a = int(math.ceil(float(n * y * 0.01)))
if x >= a:
print(0)
else:
print(a - x)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#168A
import math
n, x, y = map(int, input().split())
print(max(0,math.ceil((n*y)/100) - x))
| 7 |
PYTHON3
|
from math import ceil,floor
n,x,y = map(int,input().split())
if floor((x*100)/n) >= y:
print(0)
else:
print(ceil((y*n)/100) - x)
| 7 |
PYTHON3
|
import math
n, x, y = map(int, input().split())
req = math.ceil(y/100 * n)
ans = req - x
if ans > 0:
print(ans)
else:
print(0)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
from math import ceil
X = list(map(int, input().split()))
Result = (ceil((X[0] * X[2]) / 100)) - X[1]
print(Result if Result > 0 else 0)
| 7 |
PYTHON3
|
n,x,y=map(int,input().split())
c1=n*y/100
c2=n*y//100
if c1==c2 :
c2=int(c1)
else:
c2=int(c1)+1
if c2-x>=0:
print(c2-x)
else:
print(0)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
import math
n,x,y=map(int,input().split())
if math.ceil((n*y)/100)<=x:
print(0)
else:
print(math.ceil((n*y)/100)-x)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#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;
}
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#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;
}
}
| 7 |
CPP
|
n,x,y=map(int,input().split( ))
m=(n*y/100)
if m!=m//1:
m=(m//1)+1
if m>x:
print(int(m)-x)
else:
print(0)
| 7 |
PYTHON3
|
import math
n, x, y = map(int, input().split())
# n * y / 100 = x + c
c = math.ceil(n * y / 100) - x
if c < 0:
c = 0
print (c)
| 7 |
PYTHON3
|
import sys
import math
n, x, y = [int(x) for x in (sys.stdin.readline()).split()]
req = int(math.ceil(y / 100.0 * n))
if(req - x < 0):
print(0)
else:
print(req - x)
| 7 |
PYTHON3
|
n=input().split()
for i in range(0,len(n)):
n[i]=int(n[i])
if n[0]/n[1]==100/n[2]:
print(0)
exit()
s=n[0]/100
vi=int(s*n[2])
vf=s*n[2]
if vi-n[1]<0:
print(0)
exit()
if abs(vf - vi) > 0.000001:
vi+=1
print(vi-n[1])
| 7 |
PYTHON3
|
#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;
}
}
| 7 |
CPP
|
import math
n,x,y=map(int,input().split())
l=int(math.ceil(n*y/100))
if(l>x):
print(l-x)
else:
print(0)
| 7 |
PYTHON3
|
import math
n, x, y = map(int, input().split())
clones = math.ceil(n*y/100)-x
print(clones if clones > 0 else 0)
| 7 |
PYTHON3
|
import math
n,x,y=map(int,input().split())
tocome=y/100.0
if x<tocome*n:
need=(math.ceil(tocome*n))-x
print(need)
else:
print(0)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
from math import ceil
n,x,y=map(int,input().split())
rew=y*n/100
if x<ceil(rew):
print(ceil(rew)-x)
else:
print(0)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#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);
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
n, x, y = (int(x) for x in input().split())
print(max(0, -((100 * x - n * y) // 100)))
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
import math
n=list(map(int, input().split()))
k=math.ceil((n[0]*n[2])/100)-n[1]
if(k>=0):
print(k)
else:
print("0")
| 7 |
PYTHON3
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.