Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public int Found(int str, int colm, int[,] matr)
- {
- int k = 0;
- int n = 0;//номер строки
- int m = 0;//номер столбца
- while (m < colm && matr[n, m] < 0)
- {
- k = 0;
- while (n < str && k != n)
- {
- k++;
- m++;
- }
- m = 0;
- m++;
- }
- return m + 1;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement