[2sem]Fixed bp/15
This commit is contained in:
parent
b324015452
commit
8fdc6de8c1
7 changed files with 564 additions and 36 deletions
83
2sem/programming basics/15/additional/100_2.cpp
Normal file
83
2sem/programming basics/15/additional/100_2.cpp
Normal file
|
|
@ -0,0 +1,83 @@
|
|||
// pb_15_100_v2.cpp
|
||||
// Горбацевич Андрей
|
||||
#include <iostream>
|
||||
#include <fstream>
|
||||
|
||||
using namespace std;
|
||||
|
||||
void text2bin(istream &ist, ostream &ost);
|
||||
|
||||
void my_task(istream &ist);
|
||||
|
||||
int main() {
|
||||
string path_in = "in.txt"; // путь до входного файла
|
||||
string path_out = "out.bin"; // путь до выходного файла
|
||||
|
||||
ifstream ifs(path_in);
|
||||
ofstream ofs(path_out, ios::binary);
|
||||
if (!ifs.is_open())
|
||||
{
|
||||
cerr << "Unable to open file" << endl;
|
||||
return 1;
|
||||
}
|
||||
|
||||
text2bin(ifs, ofs);
|
||||
ifs.close();
|
||||
ofs.close();
|
||||
|
||||
ifstream binfs(path_out, ios::binary);
|
||||
my_task(binfs);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
void text2bin(istream &ist, ostream &ost) {
|
||||
int N, M;
|
||||
ist >> N >> M;
|
||||
ost << char(N) << char(M);
|
||||
for (int i = 0; i < N; i++) {
|
||||
for (int j = 0; j < M; j++) {
|
||||
int cv;
|
||||
ist >> cv;
|
||||
ost << char(cv);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void my_task(istream &ist) {
|
||||
ist.seekg(0, ios::beg);
|
||||
int k;
|
||||
cout << "k >>>";
|
||||
cin >> k;
|
||||
int N = int(ist.get()),
|
||||
M = int(ist.get());
|
||||
int **mtx = new int*[N];
|
||||
for (int i = 0; i < N; i++) {
|
||||
int *row = new int[M]();
|
||||
for (int j = 0; j < M; j++) {
|
||||
*(row + j) = int(ist.get());
|
||||
}
|
||||
*(mtx + i) = row;
|
||||
}
|
||||
for (int i = 0; i < N; i++) {
|
||||
bool flag = true;
|
||||
int *row = mtx[i];
|
||||
int *ic = new int[M]();
|
||||
for (int j = 0; j < M; j++) {
|
||||
for (int k = j+1; k < M; k++) {
|
||||
if (row[j] == row[k]) {
|
||||
ic[j] += 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
int mx = ic[0],
|
||||
mxp = 0;
|
||||
for (int j = 1; j < M; j++) {
|
||||
if (mx < ic[j]) {
|
||||
mx = ic[j];
|
||||
mxp = j;
|
||||
}
|
||||
}
|
||||
cout << "Most common on line " << i+1 << ": " << row[mxp] << endl;
|
||||
}
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue