_2979. Most Expensive Item That Can Not Be Bought.md

2979. Most Expensive Item That Can Not Be Bought

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : July 29, 2024

Last updated : July 29, 2024

---

Related Topics : Math, Dynamic Programming, Number Theory

Acceptance Rate : 80.1 %

---

The chicken mcnugget theorem hehe

This boils down to an induction proof for the postage problem. After a certain point, you can generate any value since you can fill in all the values between two values somehow, then just add the smaller denomination from a starting point.

This is solvable via the chicken mcnugget theorem

---

Solutions

• m2979.c
• m2979.cpp
• m2979.go
• m2979.java
• m2979.js
• m2979.kt
• m2979.py
• m2979.rs
• m2979.swift
• m2979.ts

C

m2979.c

int mostExpensiveItem(int primeOne, int primeTwo) {
    return primeOne * primeTwo - primeOne - primeTwo;
}

C++

m2979.cpp

class Solution {
public:
    int mostExpensiveItem(int primeOne, int primeTwo) {
        return primeOne * primeTwo - primeOne - primeTwo;
    }
};

Go

m2979.go

func mostExpensiveItem(primeOne int, primeTwo int) int {
    return primeOne * primeTwo - primeOne - primeTwo;
}

Java

m2979.java

class Solution {
    public int mostExpensiveItem(int primeOne, int primeTwo) {
        return primeOne * primeTwo - primeOne - primeTwo;
    }
}

JavaScript

m2979.js

/**
 * @param {number} primeOne
 * @param {number} primeTwo
 * @return {number}
 */
var mostExpensiveItem = function(primeOne, primeTwo) {
    return primeOne * primeTwo - primeOne - primeTwo;
};

Kotlin

m2979.kt

class Solution {
    fun mostExpensiveItem(primeOne: Int, primeTwo: Int): Int {
        return primeOne * primeTwo - primeOne - primeTwo;
    }
}

Python

m2979.py

class Solution:
    def mostExpensiveItem(self, primeOne: int, primeTwo: int) -> int:
        return primeOne * primeTwo - primeOne - primeTwo

Rust

m2979.rs

impl Solution {
    pub fn most_expensive_item(prime_one: i32, prime_two: i32) -> i32 {
        return prime_one * prime_two - prime_one - prime_two;
    }
}

Swift

m2979.swift

class Solution {
    func mostExpensiveItem(_ primeOne: Int, _ primeTwo: Int) -> Int {
        return primeOne * primeTwo - primeOne - primeTwo;
    }
}

TypeScript

m2979.ts

function mostExpensiveItem(primeOne: number, primeTwo: number): number {
    return primeOne * primeTwo - primeOne - primeTwo;
};