#include "stdafx.h"

#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 how_min_recurs(int *in_mas, unsigned int size, int min)
{
    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, "");
    int min;
    unsigned int count;
    int mas1[] = { 32, 1, -1, 0, 89376283 }; // 1, -1
    int mas2[] = { 213, 44, 41, 0, 11 }; // 0, 0
    int mas3[1] = {}; // 0, 0
    int mas4[] = { 1,1,1 }; // 3, 1
    int mas5[] = { 1,1,1,1,1,1,1 }; // 7, 1
    int mas6[] = { 1,1,0,0,1,1 }; // 4, 0
    int mas7[] = { 0,0,1,1,1,0,0 }; // 3, 0
    if
        (
        (/*
         (how_min(mas1, sizeof(mas1) / sizeof(int)) == -1)
         &&
         (how_min(mas2, sizeof(mas2) / sizeof(int)) == 0)
         &&
         (how_min(mas3, 1) == 0)
         &&
         (how_min(mas4, sizeof(mas4) / sizeof(int)) == 1)
         &&
         (how_min(mas5, sizeof(mas5) / sizeof(int)) == 1)
         &&
         (how_min(mas6, sizeof(mas6) / sizeof(int)) == 0)
         &&
         (how_min(mas7, sizeof(mas7) / sizeof(int)) == 0)
         )
         &&
         (
         (count_one(mas1, sizeof(mas1) / sizeof(int)) == 1)
         &&
         (count_one(mas2, sizeof(mas2) / sizeof(int)) == 0)
         &&
         (count_one(mas3, 1) == 0)
         &&
         (count_one(mas4, sizeof(mas4) / sizeof(int)) == 3)
         &&
         (count_one(mas5, sizeof(mas5) / sizeof(int)) == 7)
         &&
         (count_one(mas6, sizeof(mas6) / sizeof(int)) == 4)
         &&
         (count_one(mas7, sizeof(mas7) / sizeof(int)) == 3)
         )
         &&
         (*/
            (how_min_recurs(mas1, sizeof(mas1) / sizeof(int), 0) == -1)
            /*&&
            (how_min_recurs(mas2, sizeof(mas2) / sizeof(int), min = mas2[0]) == 0)
            &&
            (how_min_recurs(mas3, 1, min = mas3[0]) == 0)
            &&
            (how_min_recurs(mas4, sizeof(mas4) / sizeof(int), min = mas4[0]) == 1)
            &&
            (how_min_recurs(mas5, sizeof(mas5) / sizeof(int), min = mas5[0]) == 1)
            &&
            (how_min_recurs(mas6, sizeof(mas6) / sizeof(int), min = mas6[0]) == 0)
            &&
            (how_min_recurs(mas7, sizeof(mas7) / sizeof(int), min = mas7[0]) == 0)
            )
            &&
            (
            (count_one_recurs(mas1, sizeof(mas1) / sizeof(int), count = 0) == 1)
            &&
            (count_one_recurs(mas2, sizeof(mas2) / sizeof(int), count = 0) == 0)
            &&
            (count_one_recurs(mas3, 1, count = 0) == 0)
            &&
            (count_one_recurs(mas4, sizeof(mas4) / sizeof(int), count = 0) == 3)
            &&
            (count_one_recurs(mas5, sizeof(mas5) / sizeof(int), count = 0) == 7)
            &&
            (count_one_recurs(mas6, sizeof(mas6) / sizeof(int), count = 0) == 4)
            &&
            (count_one_recurs(mas7, sizeof(mas7) / sizeof(int), count = 0) == 3)
            */)
            )
    {
        cout << "Программа работает..." << endl;
    }
    else
        cout << "Программа не работает :(..." << endl;

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

    return 0;
}