Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- void init_matrix(int a[12][12], int n, int m){
- unsigned char i, j;
- for(i = 1; i <= n; ++i){
- for(j = 1; j <= m; ++j){
- scanf("%d", &a[i][j]);
- }
- }
- for(i = 0; i <= n + 1; ++i){
- a[i][0] = 100;
- a[i][m + 1] = 100;
- }
- for(i = 0; i <= m + 1; ++i){
- a[0][i] = 100;
- a[n + 1][i] = 100;
- }
- }
- void count_minimums(int a[12][12], int n, int m){
- unsigned char i, j;
- int count = 0, global_min = a[1][1];
- for(i = 1; i <= n; ++i){
- for(j = 1; j <= m; ++j){
- if(a[i + 1][j] > a[i][j] && a[i - 1][j] > a[i][j] && a[i][j + 1] > a[i][j] && a[i][j - 1] > a[i][j]){
- if(a[i + 1][j + 1] > a[i][j] &&a[i + 1][j - 1] > a[i][j] &&a[i - 1][j + 1] > a[i][j] &&a[i - 1][j - 1] > a[i][j]){
- ++count;
- if(a[i][j] < global_min) global_min = a[i][j];
- }
- }
- }
- }
- printf("%d\n%d", global_min, count);
- }
- int main(){
- int a[12][12];
- int n, m;
- scanf("%d %d", &n, &m);
- init_matrix(a, n, m);
- count_minimums(a, n, m);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement