#include <iostream>
#include <vector>
#include <unordered_map>

using namespace std;

vector<int> find_indexes(const vector<int>& nums, int sum) {

    unordered_map<int, int> hashmap;

    for (int i = 0; i < nums.size(); ++i) {
        int current = nums[i];
        int complement = sum - nums[1];

        for (int j = i + 1; j < nums.size(); ++j) {
        hashmap[i] = nums[i];
        for (int j = i + 1; j < nums.size(); ++j) {
            if hashmap.count()
        }

        hashmap[current] = i;
    }



    return result;
}


void print_vector(const vector<int>& vec) {
    for (int i = 0; i < vec.size(); ++i) {
        std::cout << vec[i] << std::endl;
    }
}

int main()
{
    vector<int> v1 = {1 ,1, 2 ,3 ,4 ,5 ,6 ,7 , 8}
    int sum1 = 5;
    vector<int> result1 = {0, 1, 3}
    vector<int> output1 = find_indexes(v1, sum1);

    print_vector(result1);
    print_vector(output1);
    std:cout << "---------------" << std::endl;

    return 0;
}