Powerful Integers

class Solution {
public:
    vector<int> powerfulIntegers(int x, int y, int bound) {
        unordered_set<int> seen;
        for (long long a = 1; a <= bound; a *= x) {
            for (long long b = 1; a + b <= bound; b *= y) {
                seen.insert(static_cast<int>(a + b));
                if (y == 1) break;
            }
            if (x == 1) break;
        }
        return {seen.begin(), seen.end()};
    }
};

func powerfulIntegers(x int, y int, bound int) []int {
    seen := map[int]bool{}
    for a := 1; a <= bound; a *= x {
        for b := 1; a+b <= bound; b *= y {
            seen[a+b] = true
            if y == 1 {
                break
            }
        }
        if x == 1 {
            break
        }
    }
    out := make([]int, 0, len(seen))
    for k := range seen {
        out = append(out, k)
    }
    return out
}

from typing import List

class Solution:
    def powerfulIntegers(self, x: int, y: int, bound: int) -> List[int]:
        seen = set()
        a = 1
        while a <= bound:
            b = 1
            while a + b <= bound:
                seen.add(a + b)
                if y == 1:
                    break
                b *= y
            if x == 1:
                break
            a *= x
        return list(seen)

function powerfulIntegers(x, y, bound) {
    const seen = new Set();
    for (let a = 1; a <= bound; a *= x) {
        for (let b = 1; a + b <= bound; b *= y) {
            seen.add(a + b);
            if (y === 1) break;
        }
        if (x === 1) break;
    }
    return [...seen];
}

class Solution {
    public List<Integer> powerfulIntegers(int x, int y, int bound) {
        Set<Integer> seen = new HashSet<>();
        for (long a = 1; a <= bound; a *= x) {
            for (long b = 1; a + b <= bound; b *= y) {
                seen.add((int) (a + b));
                if (y == 1) break;
            }
            if (x == 1) break;
        }
        return new ArrayList<>(seen);
    }
}

function powerfulIntegers(x: number, y: number, bound: number): number[] {
    const seen: Set<number> = new Set();
    for (let a = 1; a <= bound; a *= x) {
        for (let b = 1; a + b <= bound; b *= y) {
            seen.add(a + b);
            if (y === 1) break;
        }
        if (x === 1) break;
    }
    return [...seen];
}