summaryrefslogtreecommitdiff
path: root/Year_1/Programming_1/ex2_tutorato_14_01_20.cc
blob: b54860e73ebc83ef65cfaf36befd3a20c6941613 (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
#include<iostream>

using namespace std;

template<int N, int M>
bool func(string (&A)[N][M], unsigned short k, unsigned short s) {
    for(int i = 0; i < N; ++i) {
        short count_s{};
        for(int j = 0; j < M; ++j) {
            short upper_cs{};
            for(auto const& c : A[i][j]) {
                if(isupper(c))
                    ++upper_cs;
            }
        
            if(upper_cs < s)
                ++count_s;
        }

        if(count_s >= k)
            return true;
    }
    
    return false;
}

int main() {
    string A[3][4] = {
        {"ProVA", "CiAone", "RAed"},
        {"IVVA", "CiAOO", "BLUE"},
        {"AA", "AA", "AA3#"},
    };

    cout << func(A, 3, 1);
        

    return 0;
}