#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void arrange(std::vector<double>& result, double min, double max, double step)
{
result.clear();
if (max < min || step <= 0.0)
return;
size_t n = static_cast<size_t>((max-min) / step);// + 1;
double acc = min;
//std::generate_n(std::back_inserter(result), n, [&](){ double t = acc; acc += step; return t; });
for(int i = 0; i < n; i++)
{
result.push_back(acc);
acc += step;
}
}
int main() {
std::vector<double> res;
arrange(res, 10, 20, 1);
for(auto &e : res)
{
std::cout << e << " ";
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKdm9pZCBhcnJhbmdlKHN0ZDo6dmVjdG9yPGRvdWJsZT4mIHJlc3VsdCwgZG91YmxlIG1pbiwgZG91YmxlIG1heCwgZG91YmxlIHN0ZXApCnsKCXJlc3VsdC5jbGVhcigpOwoJaWYgKG1heCA8IG1pbiB8fCBzdGVwIDw9IDAuMCkKCQlyZXR1cm47CgoJc2l6ZV90IG4gPSBzdGF0aWNfY2FzdDxzaXplX3Q+KChtYXgtbWluKSAvIHN0ZXApOy8vICsgMTsKCWRvdWJsZSBhY2MgPSBtaW47CgkvL3N0ZDo6Z2VuZXJhdGVfbihzdGQ6OmJhY2tfaW5zZXJ0ZXIocmVzdWx0KSwgbiwgWyZdKCl7IGRvdWJsZSB0ID0gYWNjOyBhY2MgKz0gc3RlcDsgcmV0dXJuIHQ7IH0pOwoJZm9yKGludCBpID0gMDsgaSA8IG47IGkrKykKCXsKCQlyZXN1bHQucHVzaF9iYWNrKGFjYyk7CgkJYWNjICs9IHN0ZXA7Cgl9CgkKfQoKaW50IG1haW4oKSB7CglzdGQ6OnZlY3Rvcjxkb3VibGU+IHJlczsKCWFycmFuZ2UocmVzLCAxMCwgMjAsIDEpOwoJZm9yKGF1dG8gJmUgOiByZXMpCgl7CgkJc3RkOjpjb3V0IDw8IGUgPDwgIiAiOwoJfQoJcmV0dXJuIDA7Cn0=