// pb_15_100_v4.cpp // Горбацевич Андрей #include #include 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++) { int *row = mtx[i]; bool flag = true; for (int sk = 1; sk <= k; sk++) { bool cc = false; for (int j = 0; j < M; j++) { if (row[j] == sk) { cc = true; break; } } if (!cc) { flag = false; break; } } if (flag) { cout << "Line " << i+1 << " contains every number in 1..." << k << endl; } } }