Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <stdio.h>
- using namespace std;
- void fill_in(int** F, int N, int M, ifstream& file)
- {
- for (int i = 0; i < N; i++)
- {
- for (int j = 0; j < M; j++)
- {
- file >> F[i][j];
- cout << F[i][j] << "\t";
- }
- cout << endl;
- }
- }
- void maxij_nech(int** F, int N, int M)
- {
- int max_nech;
- bool tf_nech=0;
- int k = 0, l = 0;
- for (int i = 0; (i < N) || (tf_nech == 0); i++)
- {
- for (int j = 0; (j < M) || (tf_nech == 0); j++)
- {
- tf_nech = (F[i][j] % 2 != 0);
- if (tf_nech == 1) max_nech = F[i][j];
- }
- }
- int im = 0, jm = 0;
- for (int i = 0; i < N; i++)
- {
- for (int j = 0; j < M; j++)
- {
- if ((F[i][j] % 2 != 0)&&(max_nech<F[i][j]))
- {
- max_nech = F[i][j];
- im = i;
- jm = j;
- }
- }
- }
- cout << "i = " << im << endl;
- cout << "j = " << jm << endl;
- }
- int main()
- {
- setlocale(0, "Rus");
- ifstream file("J:\\Универ\\Программирование\\Практика_txt\\z_12.txt");
- if (!file)
- {
- cout << "Файл не открыт";
- return 0;
- }
- else
- {
- int N = 6, M = 8;
- int **F=new int*[N];
- for (int i = 0; i < N; i++) F[i] = new int[M];
- fill_in(F, N, M, file);
- maxij_nech(F, N, M);
- system("pause");
- return 0;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement