#include <iostream>
#include <time.h>
#include <cstdlib>
#include <cmath>

using namespace std;

int how_min(int *in_mas, unsigned int size)
{
    int min = in_mas[0];
    for (unsigned int i = 1; i < size; i++)
    {
        if (min > in_mas[i])
            min = in_mas[i];
    }
    return min;
}

int count_one(int *in_mas, unsigned int size)
{
    unsigned int count = 0;
    for (unsigned int i = 0; i < size; i++)
    {
        if (1 == in_mas[i])
            count++;
    }
    return count;
}


//int mas2[] = { 213, 44, -41, 0, 11 }; // 0, 0
//cout << (how_min_recurs(mas2, sizeof(mas2) / sizeof(int), min = mas2[0])) << endl;
int how_min_recurs(int *in_mas, unsigned int size, int min)
{
    cout << "Äî èôà !min = " << min << endl;
    if (min > in_mas[size])
        min = in_mas[size];
    cout << "Ïîñëå èôà !min = " << min << endl;
    if (size <= 1)
    {
        cout << "!min = " << min << endl;
        return min;
    }
    else
        how_min_recurs(in_mas, --size, min);
}


int count_one_recurs(int *in_mas, unsigned int size, unsigned int count)
{
    if (1 == in_mas[size])
        count++;
    if (size <= 0)
        return count;
    else
        count_one_recurs(in_mas, --size, count);
}


int main()
{
    setlocale(0, "");
    unsigned int count;
    int mas1[] = { 32, 1, -1, 0, 89376283 }; // 1, -1
    int mas2[] = { 213, 44, -41, 0, 11 }; // 0, 0
        int min1 = mas1[0];
    int min;
    cout << (how_min_recurs(mas1, sizeof(mas1) / sizeof(int), min = mas1[0])) << endl;

    cout << (how_min_recurs(mas2, sizeof(mas2) / sizeof(int), min = mas2[0])) << endl;

    return 0;
}