#include <iostream>
#include <cmath>

constexpr bool isPrime(int number) {
    if (number <= 1) return false;
    if (number <= 3) return true; 
    if (number % 2 == 0 || number % 3 == 0) return false; 

    for (int i = 5; i * i <= number; i += 6) {
        if (number % i == 0 || number % (i + 2) == 0) {
            return false;
        }
    }
    return true;
}

int main() {
    int number;
    std::cin >> number;
    for(int i = 1; i <= number; i++){
        if(isPrime(i))
            std::cout << i << " ";
    }
    return 0;
}

int main() {
    constexpr int number = 15555;//bu ham compile timeda hisoblanadi
    if(isPrime(number))
       std::cout <<"Tub" << "";
    return 0;
}

  /**
       *  @brief  Builds a %vector from an initializer list.
       *  @param  __l  An initializer_list.
       *  @param  __a  An allocator.
       *
       *  Create a %vector consisting of copies of the elements in the
       *  initializer_list @a __l.
       *
       *  This will call the element type's copy constructor N times
       *  (where N is @a __l.size()) and do no memory reallocation.
       */
      _GLIBCXX20_CONSTEXPR
      vector(initializer_list<value_type> __l,
       const allocator_type& __a = allocator_type())
      : _Base(__a)
      {
  _M_range_initialize(__l.begin(), __l.end(),
          random_access_iterator_tag());
      }

Bu masalaga istalgan AI yechim bera oladi. Lekin biz Engineer sifatida uni kodlarini optimizatsiya qila olamizmi?
Oddiy yechimi quyidagi kurinishda bo'lishi mumkin.

```cpp
class ProductOfNumbers {
public:
    ProductOfNumbers() {

    }

    void add(int num) {
        data_.push_back(num);
    }

    int getProduct(int k) {
        long long pr = 1;

        for(int i = 0; i < k; i++) {
            pr *= data_[data_.size() - i - 1];
        }

        return pr;
    }

private:
    std::vector<int> data_;
};