n заготовок необходимо обработать на m одинаковых станках

Здравствуйте,есть код для обработки n заготовок на 2 станках,подскажите как можно изменить,чтобы вообдить количество станков.
#include <algorithm>
#include <bitset>
#include <fstream>
#include <iostream>
#include <vector>
#include <iomanip> // манипуляторы ввода/вывода
#include <windows.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
static const int ITEMS_TOTAL_MIN = 1;
static const int ITEMS_TOTAL_MAX = 1000;
///////////////////////////////////////////////////////////////////////////////
typedef std::vector < int > T_processing_times;
typedef std::bitset < ITEMS_TOTAL_MAX > T_process_on_first;

///////////////////////////////////////////////////////////////////////////////
ofstream fout;

void input_processing_times_txt(T_processing_ times& processing_times)
{
int items_total;

fout.open("file.txt");
if (fout.fail())
{
//если произошла ошибка, то выводим сообщение
cout << "Произошла ошибка при открытии файла file.txt";
}
else
{
do
{
std::cout << "Количество обрабатываемых деталей ("
<< ITEMS_TOTAL_MIN
<< ".."
<< ITEMS_TOTAL_MAX
<< "): ";
std::cin >> items_total;
fout << "Количество обрабатываемых деталей (" << ITEMS_TOTAL_MIN << ".." << ITEMS_TOTAL_MAX << "):" << items_total << std::endl;
} while (
items_total
< ITEMS_TOTAL_MIN

|| items_total
> ITEMS_TOTAL_MAX
);

std::cout << std::endl
<< "Время обработки "
<< items_total
<< " деталей:"
<< std::endl;
fout << "\nВремя обработки " << items_total << " деталей:";

for (int i{}; i < items_total; ++i)
{
int time_cur;

do
{
std::cout << "Время обработки детали "
<< i + 1
<< "(> 0)\t: ";

std::cin >> time_cur;
fout << "\nВремя обработки детали " << i + 1 << "(> 0):" << time_cur;
} while (time_cur <= 0);

processing_times.push_back(time_cur);
}
}



}
///////////////////////////////////////////////////////////////////////////////
void set_process_on_first_optimal_txt(T_proce ssing_times const& processing_times, T_process_on_first& process_on_first_optimal)
{
int processing_time_min{};
unsigned variants_total = 1 << processing_times.size();

for (unsigned variant_ind{}; variant_ind < variants_total; ++variant_ind)
{
T_process_on_first process_on_first(variant_ind);
int time_1{};
int time_2{};

for (unsigned item_ind{}; item_ind < processing_times.size(); ++item_ind)
{
(
process_on_first.test(item_ind)
? time_1
: time_2
)

+= processing_times[item_ind];
}

auto time_cur = max(time_1, time_2);

if (
processing_time_min == 0
|| time_cur < processing_time_min
)
{
processing_time_min = time_cur;
process_on_first_optimal = process_on_first;
}
}
}
///////////////////////////////////////////////////////////////////////////////
void print_distribution_processing_txt(T_proc essing_times const& processing_times, T_process_on_first const& process_on_first)
{
std::cout << std::endl;

for (size_t i{}; i < processing_times.size(); ++i)
{
std::cout << "Деталь # "
<< i + 1
<< " обрабатывается на станке "

<< (
process_on_first.test(i)
? 1
: 2
)

<< std::endl;
fout << "\nДеталь # "<< i + 1<< " обрабатывается на станке "<< (process_on_first.test(i)? 1: 2);
}
fout.close();
std::cout << "Формирование файла......" << std::endl;
Sleep(5000);
std::cout << "Файл создан." << std::endl;
}

///////////////////////////////////////////////////////////////////////////////
void input_processing_times(T_processing_time s& processing_times)
{
int items_total;

do
{
std::cout << "Количество обрабатываемых деталей ("
<< ITEMS_TOTAL_MIN
<< ".."
<< ITEMS_TOTAL_MAX
<< "): ";
std::cin >> items_total;
}
while (
items_total
< ITEMS_TOTAL_MIN

|| items_total
> ITEMS_TOTAL_MAX
);

std::cout << std::endl
<< "Время обработки "
<< items_total
<< " деталей:"
<< std::endl;

for (int i{}; i < items_total; ++i)
{
int time_cur;

do
{
std::cout << "Время обработки детали "
<< i + 1
<< "(> 0)\t: ";

std::cin >> time_cur;
} while (time_cur <= 0);

processing_times.push_back(time_cur);
}
}
///////////////////////////////////////////////////////////////////////////////
void set_process_on_first_optimal(T_processin g_times const& processing_times,T_process_on_first& process_on_first_optimal)
{
int processing_time_min{};
unsigned variants_total = 1 << processing_times.size();

for (unsigned variant_ind{}; variant_ind < variants_total; ++variant_ind)
{
T_process_on_first process_on_first(variant_ind);
int time_1{};
int time_2{};

for (unsigned item_ind{}; item_ind < processing_times.size(); ++item_ind)
{
(
process_on_first.test(item_ind)
? time_1
: time_2
)

+= processing_times[item_ind];
}

auto time_cur = max(time_1,time_2);

if (
processing_time_min == 0
|| time_cur < processing_time_min
)
{
processing_time_min = time_cur;
process_on_first_optimal = process_on_first;
}
}
}
//////////////////////////////////////////////////////////////////////////////
void print_distribution_processing (T_processing_times const& processing_times,T_process_on_first const& process_on_first)
{
std::cout << std::endl;

for (size_t i{}; i < processing_times.size(); ++i)
{
std::cout << "Деталь # "
<< i + 1
<< " обрабатывается на станке "

<< (
process_on_first.test(i)
? 1
: 2
)

<< std::endl;
}
}
///////////////////////////////////////////////////////////////////////////////

int prompt_menu_item()
{
// Выбранный вариант меню
int variant;

std::cout << "----------MENU----------\n";
std::cout << "Выберите вариант\n" << std::endl;
std::cout << "1. Выполнить распределение деталей\n"
<< "2. Сохранить результат в файл\n"
<< "3. Выйти\n" << std::endl;
std::cout << ">>> ";
std::cin >> variant;
return variant;
}

int main()
{

START:
SetConsoleCP(1251);
SetConsoleOutputCP(1251);
int variant = prompt_menu_item();
switch (variant)
{
case 1:
{

T_processing_times processing_times;
input_processing_times(processing_times) ;

T_process_on_first process_on_first_optimal;

set_process_on_first_optimal
(
processing_times,
process_on_first_optimal

);

print_distribution_processing
(
processing_times,
process_on_first_optimal
);

goto START;
}
case 2:
{
T_processing_times processing_times;
input_processing_times_txt(processing_ti mes);

T_process_on_first process_on_first_optimal;
set_process_on_first_optimal_txt
(
processing_times,
process_on_first_optimal

);

print_distribution_processing_txt
(
processing_times,
process_on_first_optimal
);

}
case 3:
{
std::cout << "Выход из программы..." << std::endl;
exit(EXIT_SUCCESS);
break;
default:
std::cerr << "Вы выбрали неверный вариант" << std::endl;
exit(EXIT_FAILURE);
}

return 0;

}
}

0