Several Calls

Харитаи курс

Забони барномасозии C++ барои барномасозии рақобатӣ

0 аз 87 дарс

0 аз 7 дарс

Several Calls - Забони барномасозии C++ барои барномасозии рақобатӣ

int ways(int d) {
    if (d == 0) {
        return 1;                      // at the top: one way, do nothing
    }
    if (d < 0) {
        return 0;                      // jumped past the top: not a way
    }
    return ways(d - 1) + ways(d - 2) + ways(d - 3);
}

int biggest(const vector<int>& a, int l, int r) {
    if (l == r) {
        return a[l];                   // one element: it is the answer
    }
    int mid = (l + r) / 2;
    return max(biggest(a, l, mid), biggest(a, mid + 1, r));
}

void hanoi(int n, int from, int to, int via) {
    if (n == 0) {
        return;
    }
    hanoi(n - 1, from, via, to);       // the smaller disks out of the way
    cout << from << " " << to << "\n"; // the largest disk
    hanoi(n - 1, via, to, from);       // the smaller disks back on top
}

void lucky(int x, int n) {
    if (x > n) {
        return;                        // too big: stop this branch
    }
    if (x > 0) {
        cout << x << "\n";
    }
    lucky(x * 10 + 4, n);
    lucky(x * 10 + 7, n);
}

Two calls: the Fibonacci tree

Practice: Several Calls

Counting ways

Split in half

Tower of Hanoi

Building every answer

Check your understanding