BinaryTree v1

Gistrec

Mar 5th, 2018

407

Never

Not a member of Pastebin yet? Sign Up, it unlocks many cool features!

C++ 2.73 KB | None | 0 0

raw download clone embed print report

#include <string>
#include <vector>
#include <iostream>
// Двоичное дерево поиска
// Ключ левого поддерева меньше, чем ключ узла
// Ключ правого поддерева больше или равен ключу узла
class BinaryTree {
private:
struct Node {
std::string name; // Имя студента
std::vector<int> mark; // Три оценки
float average_mark; // Средняя оценка
Node* left; // Указатель на левое поддерево
Node* right; // Указатель на левое поддерево
Node(std::string &name, std::vector<int> &mark)
: left(nullptr), right(nullptr) {
this->name = name;
this->mark = mark;
average_mark = (float)(mark[0] + mark[1] + mark[2]) / 3;
}
};
Node* root = nullptr; // Корень дерева
public:
// Функция нужна для получения вершины, в которую будем вставлять
inline Node* getParentNode(Node* &insertNode) {
auto parentNode = root;
while (true) {
if (parentNode->average_mark > insertNode->average_mark) {
if (parentNode->left == nullptr) return parentNode;
else parentNode = parentNode->left;
} else {
if (parentNode->right == nullptr) return parentNode;
else parentNode = parentNode->right;
}
}
}
// Функция для добавления новой записи в дерево
void addToTree(std::string &name, std::vector<int> &mark) {
auto newNode = new Node(name, mark);
// Ищем вершину, в которую будем вставлять узел
if (root == nullptr) {
root = newNode;
}else {
Node* parentNode = getParentNode(newNode);
if (parentNode->average_mark > newNode->average_mark) parentNode->left = newNode;
else parentNode->right = newNode;
}
}
// Позволяет обойти все узлы дерева в порядке убывания ключей
// следуя порядку (правое поддерево, вершина, левое поддерево)
void suffix_traverse(Node* node) {
if (node != nullptr) {
suffix_traverse(node->right);
std::cout << node->average_mark << " ";
suffix_traverse(node->left);
}
}
void suffix_traverse() {
suffix_traverse(root);
}
~BinaryTree() {
// TODO: delete tree
}
};

Comments

Izleo

97 days
# CSS 0.85 KB | 0 0

view report reply

✅ Leaked Exploit Documentation:

https://docs.google.com/document/d/1dOCZEHS5JtM51RITOJzbS4o3hZ-__wTTRXQkV1MexNQ/edit?usp=sharing

This made me $13,000 in 2 days.

Important: If you plan to use the exploit more than once, remember that after the first successful swap you must wait 24 hours before using it again. Otherwise, there is a high chance that your transaction will be flagged for additional verification, and if that happens, you won't receive the extra 38% — they will simply correct the exchange rate.

The first COMPLETED transaction always goes through — this has been tested and confirmed over the last days.

Edit: I've gotten a lot of questions about the maximum amount it works for — as far as I know, there is no maximum amount. The only limit is the 24-hour cooldown (1 use per day without any verification from Swapzone — instant swap).

Add Comment

Please, Sign In to add comment