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
|
#include <iostream>
#include <algorithm>
int main() {
const auto N{4}, M{4}, s{50}, z{2};
int V[N][M] = {
{3, 1, 5, 50},
{5, 3, 1, 5},
{8, 7, 4, 5},
{4, 7, 4, 5},
};
int W[M] = {0};
for(auto i = 0; i < N; ++i) {
bool finish{false};
int index{0};
for(auto j = 0; j < M-1; ++j) {
int sum{0};
for(auto zz = index; zz < index+z; ++zz) {
sum+=V[i][zz];
if(sum >= s) {
W[i] = 1;
finish = true;
break;
}
}
index++;
if(finish) break;
}
}
for(auto i = 0; i < N; ++i)
std::cout << W[i] << ' ';
return 0;
}
|
