Panther (+6)
Reikia pagalbos rasti didziausia ir maziausia reiksme kiekvienoje matricos nelygineje eiluteje:#include <iomanip>
#include <iostream>
#include <conio.h>
#include <fstream>
using namespace std;
void skaitymas(int B[][30], int &x, int &y);
void radimas(int B[][30], int &x, int&y);
const int rib = 30;
int main()
{
int B[rib][rib], x, y;
skaitymas(B, x, y);
radimas(B, x, y);
_getch();
return 0;
}
void skaitymas(int B[][30], int &x, int &y)
{
ifstream data("dat.txt");
data >> x >> y;
cout <<"\nPradinis, faile esantis, masyvas B[" << x << "," << y << "]\n" << endl;
for (int i = 0; i < x; i++){
for (int j = 1; j <= y; j++){
data >> B[i][j];
cout << setw(4) << B[i][j] << " ";
}
cout << endl;
}
data.close();
}
void radimas(int B[][30], int &x, int&y)
{
ifstream data("dat.txt");
data >> x >> y;
for (int i = 0; (i < x) && (i%2 != 0); i++){ // rasti nelygines masyvo eilutes
for (int j = 1; j <= y; j++){
data >> B[i][j];
cout << setw(4) << B[i][j] << " ";
}
cout << endl;
}
data.close();
}
Failo pavyzdys3 5
9 8 -55 7 981
1000 -1000 9 0 303
-100 0 0 0 500
for (int i = 0; (i < x) && (i%2 != 0); i++) - zinoma neveikia, bet kitaip neisgalvoju..