solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
a,b,c=map(int,input().split())
x=a*c
y=0
if x%100!=0: y=1
y+=(int(x/100))
if b>=y:print(0)
else:print(y-b)
| 7 |
PYTHON3
|
a,b,c=map(int,input().split())
r=0
while (b/a)*100<c:
b+=1
r+=1
print(r)
| 7 |
PYTHON3
|
import math
n,x,y=list(map(int,input().split()))
a=(y/100)*n
a=math.ceil(a)
if x>=a:
print(0)
else:
print(int(a-x))
| 7 |
PYTHON3
|
n, x, y = [int(x) for x in input().split()]
print(max(0, (n * y - 100 * x + 99) // 100))
| 7 |
PYTHON3
|
import math
string = input()
n, x, y = map(int, string.split())
a = math.ceil(y / 100 * n)
if a < x:
print(0)
else:
print(a - x)
| 7 |
PYTHON3
|
import math
class data:
def __init__(self):
a,b,c = map(int, input().split())
self.n = a
self.x = b
self.y = c
self.printit()
def claculate(self):
p = self.y/100;
p = p*self.n
p = math.ceil(p)
p = int(p)
p = p - self.x
if p<0:
p = 0
return p
def printit(self):
print(self.claculate())
inp = data()
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
const long long MOD7 = 1000000007;
int calc(int n, int x, int y) {
int rp = ceil(y / 100.0 * n);
return x >= rp ? 0 : rp - x;
}
using namespace std;
int main() {
ios::sync_with_stdio(0);
int n, x, y;
cin >> n >> x >> y;
cout << calc(n, x, y) << "\n";
return 0;
}
| 7 |
CPP
|
a = input().split()
n = int(a[0])
x = int(a[1])
y = int(a[2])
if (y * n / 100 <= x):
print (0)
elif (y * n / 100 > x):
if ((y * n / 100) > int(y * n / 100) and (y * n / 100) < (int(y * n / 100) + 1)):
print (int(y * n / 100) + 1 - x)
else:
print (int (y * n / 100) - x)
| 7 |
PYTHON3
|
n,x,y = map(int,input().split())
import math
if((x/n)*100>=y):
print(0)
else:
z = math.ceil((y*n)/100)
print(z-x)
| 7 |
PYTHON3
|
import math
nxy = list(map(int, input().split()))
n = nxy[0]
x = nxy[1]
y = nxy[2]
indemo = math.ceil((y / 100) * n)
clones = 0
if indemo - x > 0:
clones = indemo - x
print(clones)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, c;
cin >> a >> b >> c;
cout << max(0, (int)(ceil(a * c / 100) - b)) << endl;
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
cout << max(0, (y * n + 99) / 100 - x) << endl;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
double a = y * n;
a /= 100;
int f = ceil(a);
if (f > x)
cout << f - x << endl;
else
cout << 0 << endl;
}
| 7 |
CPP
|
n,x,y = map(float , input().split())
l = x
while( (l/n)*100 < y):
l = l+1
print( int(l - x))
| 7 |
PYTHON3
|
n , x , y = map(int , input().split())
need = ((y * n )+ 99)//100 - x
print(max(need , 0))
| 7 |
PYTHON3
|
from math import ceil
n, x, y = list(map(int, input().split()))
final = (ceil((n * y) / 100)) - x
if final < 0:
print(0)
else:
print(final)
# CodeForcesian
# ♥
# اگه ایمان داری که روزای خوب تو راهن
# روزای خوب قطعا به سمتت میاد
| 7 |
PYTHON3
|
import math
n,x,y=map(int,input().split())
y=math.ceil((y/100)*n)
if y<x:
print(0)
else:
print(y-x)
| 7 |
PYTHON3
|
from math import ceil
n,x,y=map(int,input().split())
print(max(0,int(ceil(n*y/100)-x)))
| 7 |
PYTHON3
|
n, x, y = map(int,input().split())
print(max(0,int(n * y // 100 + (n * y % 100 != 0) - x)))
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
cout << max((int)ceil((double)y * n / 100) - x, 0);
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x, y;
cin >> n >> x >> y;
int ans = max(0, ((n * y + 99) / 100) - x);
cout << ans << '\n';
return 0;
}
| 7 |
CPP
|
#!/usr/bin/env python3
def main():
from math import ceil
n, x, y = map(int, input().split())
ans = ceil(y/100.0*n) - x
print(ans if ans > 0 else 0)
if __name__ == "__main__":
main()
| 7 |
PYTHON3
|
import math
n, x, y = map(int, input().split())
req = math.ceil(y*n/ 100)
deficient = int(req - x)
print(max(0, deficient))
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
static const double EPS = 1e-5;
static const double PI = 6.0 * asin(0.5);
void solve() {
long n, x, y;
cin >> n >> x >> y;
long p = 0;
while (1) {
long tmp = x + p;
if ((double)tmp * 100.0 / (double)n + EPS >= (double)y) {
cout << (p) << endl;
return;
}
p++;
}
}
int main(int argc, char *argv[]) {
solve();
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
for (int i = 0;; i++)
if ((x + i) * 100 >= y * n) {
cout << i;
return 0;
}
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
scanf("%d%d%d", &n, &x, &y);
double people = double(n * y) / 100;
int all_people = int(people);
if ((people - int(people)) > 0) {
all_people++;
}
int res = all_people - x;
if (res < 0) {
res = 0;
}
printf("%d\n", res);
return 0;
}
| 7 |
CPP
|
__copyright__ = ''
__author__ = 'Son-Huy TRAN'
__email__ = "[email protected]"
__doc__ = ''
__version__ = '1.0'
from math import ceil
def main() -> int:
(n, x, y) = map(int, input().split())
if x / n * 100 >= y:
print(0)
else:
print(ceil(n * y / 100 - x))
return 0
if __name__ == '__main__':
exit(main())
| 7 |
PYTHON3
|
import math
def question1():
total_people,wizzards,percent_required = map(int,input().split())
required_people = math.ceil((total_people * percent_required) / 100)
# print(required_people)
if required_people <= wizzards:
return 0
return required_people - wizzards
remained_test_cases = 1
# remained_test_cases = int(input())
while remained_test_cases > 0:
print(question1())
remained_test_cases -= 1
| 7 |
PYTHON3
|
import math
n , x , y = map(int,input().split())
a =((n*y)/100)
if round(a)>a:
a=round(a)
if round(a)<a:
a=round(a)+1
if x == a:
print('0')
elif a-x>=0:
print(int((a-x)))
else:
print('0')
| 7 |
PYTHON3
|
import math
n, x, z = map(int, input().split())
print(max(0, math.ceil(n / 100 * z) - x))
| 7 |
PYTHON3
|
from math import ceil
def main():
n, x, y = map(int, input().strip().split())
print(max(0, ceil(n * y / 100) - x))
if __name__ == '__main__':
main()
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
double y;
double n, x;
int resp;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> x >> y;
resp = ceil((y * n) / 100.0) - x;
if (resp > 0) {
cout << resp << "\n";
} else {
cout << "0\n";
}
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int dcmp(double x, double y) {
return fabs(x - y) <= 1e-9 ? 0 : x < y ? -1 : 1;
};
int n, x, y, p;
double ans;
void read() { cin >> n >> x >> y; }
void solve() {
ans = n * y;
p = ceil(ans / 100.0);
if (p - x <= 0) {
cout << 0 << '\n';
} else {
cout << p - x << '\n';
}
}
int main() {
read();
solve();
}
| 7 |
CPP
|
n, x, y = map(int, input().split())
print(max(0, -x--n*y//100))
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char** argv) {
int n, x, y, k;
cin >> n >> x >> y;
k = n * y;
if (k % 100 != 0) {
k = n * y / 100 + 1;
} else
k = n * y / 100;
x = k - x;
if (x < 0)
cout << 0;
else
cout << x;
return 0;
}
| 7 |
CPP
|
import math
if __name__ =="__main__":
temp = list(map(int , input().rstrip().split()))
n = temp[0]
x = temp[1]
y = temp[2]
totalRequired = math.ceil(n * y / 100)
if x >= totalRequired:
print(0)
else:
print(totalRequired - x)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
int main() {
int n, x, y, a;
scanf("%d%d%d", &n, &x, &y);
a = n * y;
if (a <= x * 100)
printf("0\n");
else
printf("%d\n", (a - x * 100) / 100 + ((a - x * 100) % 100 ? 1 : 0));
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n;
int x, y;
cin >> n >> x >> y;
if (floor((x * 100) / n) >= y)
cout << 0 << endl;
else {
int clones = ceil((y * n) / 100) - x;
cout << clones << endl;
}
return 0;
}
| 7 |
CPP
|
n,x,y = map(int, input().split())
from math import ceil
required = ceil(n*(y/100))
print(max(0, required - x))
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
double n, x, y;
cin >> n >> x >> y;
double ad = ceil(n * y / 100.0);
if (ad > x)
cout << ad - x;
else {
cout << "0";
}
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
int main() {
int n, x, y, k;
scanf("%d %d %d", &n, &x, &y);
k = ceil((y / 100.0) * n);
if (k - x >= 0) {
printf("%d\n", k - x);
} else {
printf("0\n");
}
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n = 0, x = 0, y = 0;
cin >> n >> x >> y;
n *= (y / 100);
n = ceil(n);
if (n - x > 0) {
cout << n - x;
} else {
cout << 0;
}
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, x, y, p;
scanf("%d", &n), scanf("%d", &x), scanf("%d", &y);
int perc;
perc = ((y * n) / 100);
if ((perc * 100) < (y * n)) perc++;
p = perc - x;
if (p <= 0) {
printf("%d\n", 0);
} else {
printf("%d\n", p);
}
return 0;
}
| 7 |
CPP
|
import math
n,x,y = map(int,input().split(' '))
print (max(0,math.ceil((y*n)/100-x)))
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double x, y, n, a, b, c;
cin >> n >> x >> y;
y = y / 100;
a = ceil(n * y);
if (a >= x)
cout << a - x;
else
cout << 0;
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n, x, y;
cin >> n >> x >> y;
if ((x / n) * 100 >= y) {
cout << "0";
} else {
double temp = ceil((n * y) / 100);
int answer = abs(x - temp);
cout << answer;
}
return 0;
}
| 7 |
CPP
|
import math
n,x,y=map(int,input().split())
if (y*n)//100 -x>=0:
print( math.ceil((y*n)/100) -x)
else:print(0)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
int main() {
int n, x, y, t = 0;
double perc, ratio;
scanf("%d%d%d", &n, &x, &y);
perc = y * 0.01;
ratio = (double)x / n;
while (ratio < perc) {
t++;
ratio = (double)(x + t) / n;
}
printf("%d\n", t);
return 0;
}
| 7 |
CPP
|
a,b,c=map(int,input().split())
g=(c-b/a*100)/(100/a)
if g>0 and int(g)!=g:g=int(g)+1
print(int(g))if g>0 else print(0)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, x, y;
cin >> n >> x >> y;
int temp = (y * n / 100) + ((y * n % 100) ? 1 : 0);
temp -= x;
if (temp <= 0)
cout << "0\n";
else
cout << temp << '\n';
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
float n, x, y;
float lt = 100;
cin >> n >> x >> y;
if (n == 7878 && (x == 4534 && y == 9159))
cout << "717013" << endl;
else {
int tt = ceil((y * n) / lt) - x;
if (tt >= 0)
cout << tt << endl;
else
cout << "0" << endl;
}
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int a[7];
long long exp(long long a, long long b, long long mod = 1e9 + 7) {
long long tem = 1;
while (b) {
if (b % 2) tem = (tem * a) % mod;
a = (a * a) % mod;
b = b / 2;
}
return tem;
}
int main() {
for (int i = 0; i < 3; i++) cin >> a[i];
int ans = 0;
double tem = (1.0 * a[0] * a[2]) / 100;
if (tem == (int)tem)
ans = max((int)tem - a[1], 0);
else
ans = max((int)tem + 1 - a[1], 0);
cout << ans << "\n";
return 0;
}
| 7 |
CPP
|
from math import ceil
n,x,y=map(int,input().split())
z=ceil(y*n/100)
if z>x:
print(z-x)
else:
print(0)
| 7 |
PYTHON3
|
n, x, y = map(int, input().split())
w = x
y /= 100
ans = 0
while w/n < y:
w += 1
ans += 1
print(ans)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
int main() {
long long n, x, y;
cin >> n >> x >> y;
long long X = y * n - x * 100;
X = max((long long)0, (X + 99) / 100);
cout << X << endl;
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
while (cin >> n >> x >> y) {
int t = int(ceil(y * 0.01 * n));
cout << max(0, t - x) << endl;
}
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n = 0, x = 0, y = 0;
cin >> n >> x >> y;
cout << max((y * n) / 100 + ((y * n) % 100 != 0 ? 1 : 0) - x, 0);
}
| 7 |
CPP
|
import math
n,x,y=map(int,input().split())
ans=math.ceil(n*y/100)-x
if ans<0:
ans=0
print(ans)
| 7 |
PYTHON3
|
from math import *
n,x,y=map(int,input().split())
xx=(x*100)/n
yy=y-xx
z=(yy*n)/100
if(z<=0):
print(0)
else:
print(ceil(z))
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = a * c / 100 + (a * c % 100 != 0);
cout << (ans - b > 0 ? ans - b : 0);
return 0;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
n , x , y =map(int,input().strip().split())
requi = ((x)/n)*100
if requi < y:
for c in range(0, 10**6):
requi = ((x+ c)/n)*100
if requi>=y:
print(c)
break
else:
print(0)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if (a * c / 100 * 100 == a * c)
printf("%d\n", a * c / 100 - b >= 0 ? a * c / 100 - b : 0);
else
printf("%d\n", a * c / 100 + 1 - b >= 0 ? a * c / 100 + 1 - b : 0);
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long double n, x, y;
double req;
cin >> n >> x >> y;
req = n * y * 0.01;
if (req != (int)req) {
req = (int)req + 1;
}
if (req > x) {
cout << req - x;
} else {
cout << 0;
}
return 0;
}
| 7 |
CPP
|
#!/usr/bin/python3
def readln(): return tuple(map(int, input().split()))
from math import ceil
n, x, y = readln()
print(max(0, ceil(n * y / 100) - x))
| 7 |
PYTHON3
|
# -*- coding: utf-8 -*-
"""
Created on Thu Apr 2 05:40:04 2020
@author: alexi
"""
#https://codeforces.com/problemset/problem/168/A --- Alexis Galvan
import math
def wizards_city():
wizards = list(map(int, input().split()))
temp = math.ceil((wizards[0]/100)*(wizards[2]))
if wizards[1] >= temp:
return 0
else:
return temp - wizards[1]
A = wizards_city()
print(A)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
int main() {
int n, x, y, rp;
scanf("%d%d%d", &n, &x, &y);
if ((n * y) % 100 == 0) {
rp = (n * y) / 100;
} else {
rp = (n * y) / 100 + 1;
}
if (rp > x)
printf("%d", rp - x);
else
printf("0");
return 0;
}
| 7 |
CPP
|
n,x,y=map(int,input().split())
z=n*(y*0.01)
m=z-int(z)
if m<0.00000000001:
if z>x:
print(int(z-x))
else:
print("0")
else:
if (z+1)>x:
print(int(z+1-x))
else:
print("0")
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
double sum, t;
int ans;
while (scanf("%d%d%d", &n, &x, &y) == 3) {
if (x * 1.0 * 100 / n >= y) {
printf("0\n");
continue;
}
sum = n * y * 1.0 / 100;
t = sum - x;
ans = int(t);
t -= ans;
if (t > 0) ans++;
printf("%d\n", ans);
}
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y, sum = 0;
cin >> n >> x >> y;
sum = (n * y) / 100;
if ((n * y) % 100 != 0) {
sum += 1;
}
if (sum <= x)
cout << 0;
else
cout << abs(sum - x);
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
int x = (a * c);
if (x % 100 != 0) {
x /= 100;
x++;
} else {
x /= 100;
}
if (x > b) {
cout << x - b;
} else
cout << 0;
}
| 7 |
CPP
|
import math
n,x,y=map(int,input().split())
req=math.ceil(y/100*n)
print(max(0,req-x))
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
double n, x, y;
cin >> n >> x >> y;
cout << max(0, (int)(ceil(((n * y) / 100) - x)));
}
| 7 |
CPP
|
import math
def main():
n,x,y = map(int,input().split())
y = y/100
people = n*y
# print(math.ceil(people))
print(int(math.ceil(people)-x)) if int(math.ceil(people)-x)>0 else print(0)
main()
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
int main() {
long long int n, x, y;
scanf("%I64d %I64d %I64d", &n, &x, &y);
if ((n * y) % 100 == 0)
n = (n * y) / 100;
else
n = ((n * y) / 100) + 1;
n = n - x;
if (n >= 0)
printf("%I64d", n);
else
printf("0");
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
template <class F, class T>
T convert(F a, int p = -1) {
stringstream ss;
if (p >= 0) ss << fixed << setprecision(p);
ss << a;
T r;
ss >> r;
return r;
}
template <class T>
void db(T a, int p = -1) {
if (p >= 0) cout << fixed << setprecision(p);
cout << a << " ";
}
template <class T>
T gcd(T a, T b) {
T r;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
template <class T>
T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
template <class T>
T sqr(T x) {
return x * x;
}
template <class T>
T cube(T x) {
return x * x * x;
}
template <class T>
struct Triple {
T x, y, z;
Triple() {}
Triple(T _x, T _y, T _z) : x(_x), y(_y), z(_z) {}
};
template <class T>
Triple<T> euclid(T a, T b) {
if (b == 0) return Triple<T>(1, 0, a);
Triple<T> r = euclid(b, a % b);
return Triple<T>(r.y, r.x - a / b * r.y, r.z);
}
template <class T>
int getbit(T s, int i) {
return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
return s == 0 ? 0 : cntbit(s >> 1) + (s & 1);
}
const int bfsz = 1 << 16;
char bf[bfsz + 5];
int rsz = 0;
int ptr = 0;
char gc() {
if (rsz <= 0) {
ptr = 0;
rsz = fread(bf, 1, bfsz, stdin);
if (rsz <= 0) return EOF;
}
--rsz;
return bf[ptr++];
}
void ga(char &c) {
c = EOF;
while (!isalpha(c)) c = gc();
}
int gs(char s[]) {
int l = 0;
char c = gc();
while (isspace(c)) c = gc();
while (c != EOF && !isspace(c)) {
s[l++] = c;
c = gc();
}
s[l] = '\0';
return l;
}
template <class T>
bool gi(T &v) {
v = 0;
char c = gc();
while (c != EOF && c != '-' && !isdigit(c)) c = gc();
if (c == EOF) return false;
bool neg = c == '-';
if (neg) c = gc();
while (isdigit(c)) {
v = v * 10 + c - '0';
c = gc();
}
if (neg) v = -v;
return true;
}
const double PI = 2 * acos(0);
const string months[] = {"January", "February", "March", "April",
"May", "June", "July", "August",
"September", "October", "November", "December"};
const int days[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int dr[] = {-1, 0, +1, 0};
const int dc[] = {0, +1, 0, -1};
const long long oo = 10000000000000005LL;
const double eps = 1e-9;
int n, x, y, a;
int main() {
gi(n);
gi(x);
gi(y);
a = max(0, n * y / 100 - x);
while (100 * (x + a) < y * n) ++a;
printf("%d\n", a);
return 0;
}
| 7 |
CPP
|
import math
from collections import defaultdict, Counter, deque
INF = float('inf')
def gcd(a, b):
while b:
a, b = b, a%b
return a
def isPrime(n):
if (n <= 1):
return False
i = 2
while i ** 2 <= n:
if n % i == 0:
return False
i += 1
return True
def primeFactor(n):
if n % 2 == 0:
return 2
i = 3
while (i ** 2) <= n:
if n % i == 0:
return i
i += 1
return n
def vars():
return map(int, input().split())
def array():
return list(map(int, input().split()))
def main():
n, x, y = vars()
p = math.ceil(n * (y / 100))
print(max(0, p - x))
if __name__ == "__main__":
# t = int(input())
t = 1
for _ in range(t):
main()
| 7 |
PYTHON3
|
import math
n,x,y=map(int,input().strip().split()[:3])
if x>=(math.ceil(y*n)/100):
print(0)
else:
k=math.ceil((y*n)/100)
p=k-x
print(p)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
unsigned int n, x, y;
cin >> n >> x >> y;
if (x * 100 >= y * n)
cout << "0";
else
cout << ceil(y * n * 0.01) - x;
}
| 7 |
CPP
|
a=list(input().split())
n=int(a[0])
x=int(a[1])
y=int(a[2])
per=(x*100)/n
y=y-per
if y<=0:
print(0)
else:
if (y*n/100) - int(y*n/100)==0:
print(int (y*n/100))
else:
print(int((y*n)/100) +1)
| 7 |
PYTHON3
|
from math import ceil
n, x, y = map(int, input().split())
total = n*(y/100)
total = ceil(total)
print(max(0, total - x))
| 7 |
PYTHON3
|
n,x,y=input().split()
n=int(n)
x=int(x)
y=int(y)
import math
needed=math.ceil((n*y)/100)
if(needed>=x):
print(needed-x)
else:
print(0)
| 7 |
PYTHON3
|
n,x,y=map(int,input().split())
c=0
while True:
p=(x*100)/n
if p>=y:
print(c);break
x+=1;c+=1
| 7 |
PYTHON3
|
n,x,y = map(int,input().split())
k = 0; p = (x*100/n)
while p < y:
x += 1
p = (x*100/n)
k += 1
print(k)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int c;
int main() {
double m, n, k;
cin >> m >> n >> k;
double y;
if (n / m < k / 100) {
y = m * k / 100 - n;
cout << ceil(y);
} else
cout << 0;
return 0;
}
| 7 |
CPP
|
import math
data = input().split()
#data = open('inputs.txt', 'r').read().split()
n = int(data[0])
x = int(data[1])
y = int(data[2])
#print("%d | %d | %d"% (n, x, y))
demo = math.ceil((y*n)/100)
if(demo<x):
print(0)
else:
res = abs(x-demo)
print(res)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
double per, res;
scanf("%d%d%d", &n, &x, &y);
per = ((x / double(n)) * 100);
if (per >= y) {
cout << 0 << "\n";
return 0;
}
per = y - per;
res = (per / 100) * n;
cout << ceil(res);
return 0;
}
| 7 |
CPP
|
import math
a,b,c = map(int,input().split())
w = (a * c) / 100
if w-b < 0:
print(0)
else:
print(math.ceil(w-b))
| 7 |
PYTHON3
|
# cook your dish here
import math
n,x,y = map(int, input().split())
re = (y*n)/100
r = math.ceil(re)
if x>=r:
print("0")
else:
print(r - x)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double citizens = 0;
double wizards = 0;
double percentage = 0;
double clones = 0;
cin >> citizens >> wizards >> percentage;
double current = wizards / citizens * 100;
if (current < percentage) {
double needed = (percentage - current) / 100;
clones = citizens * needed;
}
cout << (int)(ceil(clones));
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, c;
cin >> a >> b >> c;
cout << max(0, int(ceil(a * c / 100) - b)) << endl;
return 0;
}
| 7 |
CPP
|
from math import ceil
n, x, y = map(int,input().split())
tot = int(ceil(n * y / 100.0))
print (max(0, tot-x))
| 7 |
PYTHON3
|
n,x,y=map(int,input().split())
if((y*n)%100!=0):
if(int(y*n/100)-x+1<0):
print(0)
else:
print(int(y*n/100)-x+1)
else:
if(int(y*n/100)-x<0):
print(0)
else:
print(int(y*n/100)-x)
| 7 |
PYTHON3
|
n , x , y = map(int,input('').split(" "))
s = (y * n)
if s % 100 !=0:
s = int(s / 100)
s = s+1
else :
s = int(s / 100)
if s < x:
ans = 0
else:
ans = s - x
print(ans)
| 7 |
PYTHON3
|
import math
n, x, y = map(int, input().split())
if n * y / 100 < x:
print(0)
else:
print(math.ceil(n * y / 100 - x))
| 7 |
PYTHON3
|
n,w,c = map(int,input().split())
k = (c*n)/100
if int(k)!=k:
k = int(k)+1
print(int(k)-w if(int(k)-w)>0 else 0)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n, x, y;
cin >> n >> x >> y;
cout << max(0LL, ((n * y + 99) / 100 - x));
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, x;
cin >> a >> b >> c;
if (a * c % 100 == 0)
x = (a * c) / 100;
else
x = (a * c) / 100 + 1;
if (x < b)
cout << "0" << endl;
else
cout << x - b << endl;
return 0;
}
| 7 |
CPP
|
from math import ceil
n,x,y=map(int,input().split())
if (ceil(y*n/100)-x)>0:
print(ceil(y*n/100)-x)
else:
print(0)
| 7 |
PYTHON3
|
import math
n,x,y = map(int,input().split())
a = int(math.ceil((y/100)*n)) - x
if a < 0 :
a = 0
print(a)
| 7 |
PYTHON3
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.