const fs = require("fs");
const input = fs.readFileSync("./input.txt").toString().trim().split(' ');
const fixedCost = parseInt(input[0]);
const flexibleCost = parseInt(input[1]);
const productPrice = parseInt(input[2]);
const BEP = fixedCost / (productPrice - flexibleCost);
let answer = 0;
answer = Math.floor(BEP+1);
if ((productPrice - flexibleCost) <= 0) {
answer = -1;
}
console.log(answer);
const fs = require("fs");
const input = fs.readFileSync("./input.txt").toString().trim();
const inputNum = parseInt(input);
let x = 0;
let count = 1;
let floorMax = 0;
while (inputNum > floorMax) {
x+=count;
count++;
floorMax = 6*x+1
}
if (inputNum == 1) {
count = 1;
}
console.log(count);
const fs = require("fs");
const input = fs.readFileSync("./input.txt").toString().trim();
const inputNum = parseInt(input);
let count = 2;
let topNumMax = 3;
let topNum = 1;
let bottomNumMax = 2;
let bottomNum = 1;
let answer = '';
let isIncreasing = true;
while (count < inputNum) {
if (isIncreasing) {
topNum++;
} else {
topNum--;
}
if (topNum == topNumMax) {
isIncreasing = false;
topNumMax += 2;
}
if (topNum == 1) {
count++;
isIncreasing = true;
}
count++;
}
count = 1;
isIncreasing = true;
while (count < inputNum) {
if (isIncreasing) {
bottomNum++;
} else {
bottomNum--;
}
if (bottomNum == bottomNumMax) {
isIncreasing = false;
bottomNumMax += 2;
}
if (bottomNum == 1) {
count++;
isIncreasing = true;
}
count++;
}
answer = topNum+'/'+bottomNum
console.log(answer);
const fs = require("fs");
const input = fs.readFileSync("./input.txt").toString().trim().split(' ');
const upInDay = parseInt(input[0]);
const downInNight = parseInt(input[1]);
const UpInOneDay = upInDay - downInNight;
const totalHeight = parseInt(input[2]);
let answer = 0;
answer = Math.ceil((totalHeight - upInDay) / UpInOneDay);
answer++;
console.log(answer);
const fs = require("fs");
const input = fs.readFileSync("./input.txt").toString().trim().split('\n');
const inputNum = input[0];
let floor = 0;
let distance = 0;
let eachCase = '';
let answer = '';
for (let i = 1; i <= inputNum; i++) {
eachCase = input[i].trim().split(' ');
floor = eachCase[2] % eachCase[0];
if (floor == 0) {
floor = eachCase[0];
}
distance = Math.ceil(eachCase[2] / eachCase[0]);
if (distance < 10) {
String(distance);
distance = '0' + distance;
}
answer = String(floor)+String(distance);
console.log(parseInt(answer));
}
const fs = require("fs");
const input = fs.readFileSync("./input.txt").toString().trim().split('\n').map(Number);
let answerArr = [];
let maxN = 0;
for (let i = 2; i <= 2 + input[0]; i+=2) {
if (input[i] > maxN) {
maxN = input[i];
}
}
let zeroFloor = [];
for (let i = 1; i <= maxN; i++) {
zeroFloor.push(i);
}
answerArr.push(zeroFloor);
let maxK = 0;
for (let i = 1; i <= 1 + input[0]; i+=2) {
if (input[i] > maxK) {
maxK = input[i]
}
}
let newFloor = [];
for (let j = 1; j <= maxK; j++) {
newFloor = [];
for (let i = 0; i < maxN; i++) {
newFloor.push(0);
}
answerArr.push(newFloor);
}
let prevFloor = [];
let humanNum = 0;
for (let i = 1; i <= maxK; i++) {
prevFloor = [];
for (let j = 0; j < maxN; j++) {
prevFloor.push(answerArr[i-1][j]);
humanNum = prevFloor.reduce((acc, cur) => acc + cur, 0);
answerArr[i][j] = humanNum;
}
}
for (let i = 1; i < input.length; i+=2) {
console.log(answerArr[input[i]][(input[i+1])-1]);
}
const fs = require("fs");
const input = fs.readFileSync("./input.txt").toString().trim();
const inputNum = parseInt(input);
let answerArr = [];
for (let i = 0; i <= inputNum; i++) {
answerArr.push(-1);
}
let mem = 5000;
for (let i = 3; i <= inputNum; i++) {
mem = 5000;
for (let j = 0; j <= i/5; j++) {
for (let k = 0; k <= i/3; k++) {
if (i == (5*j + 3*k) && mem > j+k) {
mem = j+k;
answerArr[i] = mem;
}
}
}
}
console.log(answerArr[inputNum]);
const fs = require("fs");
const input = fs.readFileSync("./input.txt").toString().trim().split(' ');
const A = BigInt(input[0]);
const B = BigInt(input[1]);
let answer = A + B;
console.log(answer.toString());