Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*#include <stdbool.h>
- bool check(int arr[][100], int n, int m)
- {
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < m-1; j++)
- {
- if (arr[i][j] > arr[i][j+1])
- {
- return false;
- }
- }
- }
- for (int j = 0; j < m; j++)
- {
- for (int i = 0; i < n-1; i++)
- {
- if (arr[i][j] < arr[i+1][j])
- {
- return false;
- }
- }
- }
- return true;
- }
- int main()
- {
- int n, m;
- scanf("%d %d", &n, &m);
- int arr[100][100];
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < m; j++)
- {
- scanf("%d", &arr[i][j]);
- }
- }
- if (check(arr, n, m))
- {
- printf("Масивът е подреден както трябва\n");
- } else
- {
- printf("Масивът не е подреден както трябва\n");
- }
- return 0;
- }*/
- /*int sum(int arr[][100], int n, int m, int i, int j)
- {
- int s = 0;
- for (int p = i-1; p <= i+1; p++)
- {
- for (int q = j-1; q <= j+1; q++)
- {
- if (p >= 0 && p < n && q >= 0 && q < m && (p != i || q != j))
- {
- s += arr[p][q];
- }
- }
- }
- return s;
- }
- int main()
- {
- int n, m;
- scanf("%d %d", &n, &m);
- int arr[100][100];
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < m; j++)
- {
- scanf("%d", &arr[i][j]);
- }
- }
- int max_sum = -1000000;
- int max_i, max_j;
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < m; j++)
- {
- int s = sum(arr, n, m, i, j);
- if (s > max_sum)
- {
- max_sum = s;
- max_i = i;
- max_j = j;
- }
- }
- }
- printf("Числото %d има най-голяма сума на околните числа, която е %d\n", arr[max_i][max_j], max_sum);
- return 0;
- }*/
- /*int main()
- {
- int n, m;
- scanf("%d %d", &n, &m);
- int arr[100][100];
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < m; j++)
- {
- scanf("%d", &arr[i][j]);
- }
- }
- int max_row = 0, max_col = 0;
- int max_val = arr[0][0];
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < m; j++)
- {
- if (arr[i][j] > max_val)
- {
- max_val = arr[i][j];
- max_row = i;
- max_col = j;
- }
- }
- }
- int min_row = 0, min_col = 0;
- int min_val = arr[0][0];
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < m; j++)
- {
- if (arr[i][j] < min_val)
- {
- min_val = arr[i][j];
- min_row = i;
- min_col = j;
- }
- }
- }
- for (int j = 0; j < m; j++)
- {
- int temp = arr[max_row][j];
- arr[max_row][j] = arr[min_row][j];
- arr[min_row][j] = temp;
- }
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < m; j++)
- {
- printf("%d ", arr[i][j]);
- }
- printf("\n");
- }
- return 0;
- }*/
- /*#include <stdio.h>
- #define MAXN 100000
- #define MAXM 1000000
- int graph[MAXN+1][MAXN+1];
- int main()
- {
- int n, m;
- scanf("%d %d", &n, &m);
- for (int i = 0; i < m; i++)
- {
- int u, v;
- scanf("%d %d", &u, &v);
- graph[u][v] = graph[v][u] = 1;
- }
- int person;
- scanf("%d", &person);
- int count = 0;
- for (int i = 1; i <= n; i++)
- {
- if (graph[person][i])
- {
- count++;
- }
- }
- printf("%d\n", count);
- return 0;
- }*
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement