#include <iostream>
#include <deque>

using numberType = unsigned;

template<typename T>
void findNumbers(numberType From, numberType To, T Inserter) {
    auto sumDigits = [](numberType Value) {
        numberType Sum = 0;
        while (Value) {
            Sum += Value % 10;
            Value /= 10;
        }
        return Sum;
    };

    auto isSquare = [](numberType Value) {
        const auto Sqrt = static_cast<decltype(Value)>(std::sqrt(Value));
        return Sqrt * Sqrt == Value;
    };

    for (auto i = From; i <= To; ++i) {
        if (isSquare(sumDigits(i))) {
            Inserter = i;
        }
    }
}

int main() {
    std::deque<numberType> d;
    findNumbers(1, 200, std::back_inserter(d));

    for (const auto& v : d) {
        std::cout << v << std::endl;
    }

    return 0;
}

    auto isSquare = [](numberType Value) {
        numberType i = 1;
        numberType n = 0;
        while (n < Value) {
            n += i;
            i += 2;
        };
        return (n == Value);
    };

#include <iostream>
#include <limits>

using numberType = unsigned;

void findNumbers(numberType From, numberType To) {
    auto isSquare_01 = [](numberType Value) {
        const auto Sqrt = static_cast<decltype(Value)>(std::sqrt(Value));
        return Sqrt * Sqrt == Value;
    };

    auto isSquare_02 = [](numberType Value) {
        const auto Sqrt = static_cast<decltype(Value)>(std::sqrt(Value) + 0.5F);
        return Sqrt * Sqrt == Value;
    };

    for (auto i = From; i <= To; ++i) {
        if (isSquare_01(i) != isSquare_02(i)) {
            std::cout << i << std::endl;
        }
    }
}

int main() {
    findNumbers(1, /*std::numeric_limits<numberType>::max()*/std::numeric_limits<uint16_t>::max());
    return 0;
}