summaryrefslogtreecommitdiff
path: root/Year_1/Programming_1/ex1_25_06_19.cc
blob: f28a09bf7d9403c70779fbc27a72ed20e2e98ff0 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include <iostream>
#include <utility>
#include <vector>

using namespace std;

template<int N, int M>
bool func(int (&A)[N][M], short k, double x) {
    for(int i = 0; i < M; ++i) {
        vector<pair<int, int> > v;

        for(int j = 0; j < N-1; ++j) {
            v.push_back({A[j][i], A[j+1][i]});
        }
        
        int check_num = 0;

        for(auto const& i : v) {
            if(i.second == 0) continue;
            double elem = static_cast<double>(i.first) / static_cast<double>(i.second);

            if(elem < x)
                check_num++;
        }

        if(check_num == k)
            return true;
    }


    return false;
}

int main() {
    int A[4][3] = {
        {2, 3, 5},
        {10, 20, 10},
        {90, 19, 69},
        {10, 0, 0},
    };

    cout << func(A, 2, 0.005) << endl; // 0
    cout << func(A, 2, 1.0) << endl; // 1
    return 0;
}