Объяснение:
h,w = int(input().split())
c,p = int(input().split())
s = []
roadm = []
parks = []
cp = []
for i in range(1, h+1):
for j in range(1, w+1):
s.append([i,j])
for k in s:
if k[0]==1 or k[1]==1:
roadm.append(s.pop(k))
for t in s:
if t[0] == 2 or t[1] == 2:
cp.append(s.pop(t))
for y in s:
if y[0] == (f[0]+1 for f in cp) and y[1] == (f[1]+1 for f in cp) and y[0] == (f[0]-1 for f in cp) and y[1] == (f[1]-1 for f in cp):
parks.append(s.pop(y))
a = []
b = []
for o in s:
a.append(o[0])
b.append(o[1])
print(min(a))
print(min(b))
using namespace std;
#include <algorithm>
#include <iostream>
#include <vector>
#include <ctime>
int main() {
vector<int> arr;
srand(time(0));
int N = 10;
int min = 9999999, minIndex;
int average = 0;
for(int i = 1; i<=N; ++i) {
arr.push_back(rand());
cout << arr[i-1] << " ";
if(arr[i-1]<min) {
min = arr[i-1];
minIndex = i-1;
}
average+=arr[i-1];
}
cout << endl << "Min: " << min << endl << "Average: " << average/N << endl;
swap(arr[minIndex], arr[arr.size()-1]);
for(int i = 1; i<=N; ++i) {
cout << arr[i-1] << " ";
}
cout << endl << " > average: ";
for(int i = 1; i<=N; ++i) {
if(arr[i-1]>average/N) {
cout << arr[i-1] << " ";
}
}
}
