Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- int main(){
- int n, m;
- scanf("%d%d", &n, &m);
- int mat[n][m];
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < m; j++) {
- scanf("%d", &mat[i][j]);
- }
- }
- int najgolem_vo_redica;
- int ok;
- for(int i = 0; i < n - 1; i++) {
- najgolem_vo_redica = mat[i][0];
- for(int j = 0; j < m; j++) {
- if(najgolem_vo_redica < mat[i][j]) {
- najgolem_vo_redica = mat[i][j];
- }
- }
- ok = 1;
- for(int j = 0; j < m; j++) {
- if(najgolem_vo_redica < mat[i + 1][j]) {
- ok = 0;
- break;
- }
- }
- if(ok == 0) {
- printf("Uslovot ne e ispolnet kaj redica %d\n", i + 2); // i + 1 ni e redicata
- // no nas ni treba redniot broj: (i + 1) + 1
- return 0;
- }
- }
- printf("DA\n");
- return 0;
- }
- /*
- 5 4
- 1 2 10 0
- 7 2 3 1
- 8 0 5 4
- 4 1 0 1
- 2 3 0 0
- **/
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement