#![allow(unused_imports)] #![allow(non_snake_case)] use std::cmp::*; use std::collections::*; use std::io::Write; #[allow(unused_macros)] macro_rules! debug { ($($e:expr),*) => { #[cfg(debug_assertions)] $({ let (e, mut err) = (stringify!($e), std::io::stderr()); writeln!(err, "{} = {:?}", e, $e).unwrap() })* }; } fn main() { let v = read_vec::(); let (p, q, a) = (v[0], v[1], v[2]); let criterion = |x| x * p / 100 < x * q / 100 + a; let mut ans = 0; for i in 1..10000000 { if criterion(i) { ans += 1; } } /* let criterion = |x| x * p / 100 < x * q / 100 + a; let ans = binary_search(0, 1000000001, criterion).0; */ println!("{}", ans); } fn read() -> T { let mut s = String::new(); std::io::stdin().read_line(&mut s).ok(); s.trim().parse().ok().unwrap() } fn read_vec() -> Vec { read::() .split_whitespace() .map(|e| e.parse().ok().unwrap()) .collect() } fn binary_search(lb: i64, ub: i64, criterion: F) -> (i64, i64) where F: Fn(i64) -> bool, { let mut ok = lb; let mut ng = ub; while ng - ok > 1 { let mid = (ng + ok) / 2; if criterion(mid) { ok = mid; } else { ng = mid; } } (ok, ng) }