senarukana

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <climits>

senarukana

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

struct TreeNode {
    int val;
    TreeNode  *left, *right;
    TreeNode(int v): val(v), left(NULL), right(NULL) {}

senarukana

#include <iostream>

using namespace std;


// y = 2^0 * x * a0 + 2^1 * x * a1 + ... + 2 ^ k * x * ak
int divide(unsigned x, unsigned y) {
    int result = 0;
    while (y >= x) {
        int power = 1;