id int64 18 18.8k | created_at timestamp[ns, tz=UTC]date 2026-02-23 07:30:20 2026-02-24 14:51:09 | updated_at timestamp[ns, tz=UTC]date 2026-02-23 08:08:14 2026-02-24 14:51:09 | doc_name stringclasses 1
value | input stringlengths 11 9.24k | output stringlengths 0 738 | is_personal bool 2
classes | is_sentence bool 2
classes | is_corrected bool 2
classes |
|---|---|---|---|---|---|---|---|---|
657 | 2026-02-23T08:48:15.785000Z | 2026-02-23T08:48:15.785000Z | Lec. | Подготовил: Влад Голуб | true | true | false | |
656 | 2026-02-23T08:48:14.137000Z | 2026-02-23T08:48:14.137000Z | Lec. | Использование этих библиотек устраняет необходимость в преобразовании данных и, например, позволяет писать: | true | true | false | |
655 | 2026-02-23T08:48:01.864000Z | 2026-02-23T08:48:01.864000Z | Lec. | ieee.std_logic_arith.all; | false | false | false | |
654 | 2026-02-23T08:48:00.267000Z | 2026-02-23T08:48:00.267000Z | Lec. | Нестандартные библиотеки | false | false | false | |
653 | 2026-02-23T08:47:58.419000Z | 2026-02-23T08:47:58.419000Z | Lec. | use IEEE.math_real.all; | false | false | false | |
652 | 2026-02-23T08:47:56.909000Z | 2026-02-23T08:47:56.909000Z | Lec. | http://standards.ieee.org | false | false | false | |
651 | 2026-02-23T08:47:55.472000Z | 2026-02-23T08:47:55.472000Z | Lec. | http://ghdl.free.fr | false | false | false | |
650 | 2026-02-23T08:47:53.939000Z | 2026-02-23T08:47:53.939000Z | Lec. | http://standards.ieee.org/downloads/1076/1076.2-1996/. | false | false | false | |
649 | 2026-02-23T08:47:51.584000Z | 2026-02-23T08:47:51.584000Z | Lec. | http://www.vhdl.org/rassp/vhdl/guidelines/1164qrc.pdf | false | false | false | |
648 | 2026-02-23T08:47:49.801000Z | 2026-02-23T08:47:49.801000Z | Lec. | http://www.vhdl.org/rassp/vhdl/guidelines/vhdlqrc.pdf | false | false | false | |
647 | 2026-02-23T08:47:48.012000Z | 2026-02-23T08:47:48.012000Z | Lec. | В следующем Листинге приведен простой пример кода, демонстрирующий некоторые из множества преимуществ использования этих библиотек. | true | true | false | |
646 | 2026-02-23T08:47:41.279000Z | 2026-02-23T08:49:18.603000Z | Lec. | К подхарактеристикам безопасности относятся конфиденциальность, целостность, подотчетность и аутентичность | К подхарактеристикам безопасности относятся конфиденциальность, целостность, подотчетность и аутентичность. | false | true | true |
645 | 2026-02-23T08:47:39.044000Z | 2026-02-23T08:47:39.044000Z | Lec. | printIntMatrix("Matrix 01", maze, n, m); | false | false | false | |
644 | 2026-02-23T08:47:37.022000Z | 2026-02-23T08:47:37.022000Z | Lec. | int start_column = readInt(" start col", 0, m - 1); | false | false | false | |
643 | 2026-02-23T08:47:35.328000Z | 2026-02-23T08:47:35.328000Z | Lec. | int start_row = readInt(" start row", 0, n - 1); | false | false | false | |
642 | 2026-02-23T08:47:33.531000Z | 2026-02-23T08:47:33.531000Z | Lec. | maze[i][j] = readCell("maze[" + to_string(i) + "][" + to_string(j) + "]"); | false | false | false | |
641 | 2026-02-23T08:47:31.464000Z | 2026-02-23T08:47:31.464000Z | Lec. | for (int j = 0; j < m; ++j) | false | false | false | |
640 | 2026-02-23T08:47:29.799000Z | 2026-02-23T08:47:29.799000Z | Lec. | for (int i = 0; i < n; ++i) | false | false | false | |
639 | 2026-02-23T08:47:28.160000Z | 2026-02-23T08:47:28.160000Z | Lec. | int m = readInt("Enter number of columns (m)"); | false | false | false | |
638 | 2026-02-23T08:47:26.530000Z | 2026-02-23T08:47:26.530000Z | Lec. | int n = readInt("Enter number of rows (n)"); | false | false | false | |
637 | 2026-02-23T08:47:24.438000Z | 2026-02-23T08:47:24.438000Z | Lec. | static int maze[MAX][MAX]; | false | false | false | |
636 | 2026-02-23T08:47:22.809000Z | 2026-02-23T08:47:22.809000Z | Lec. | Необходимо разработать функцию, которая найдёт возможность прохода между заданными ячейками | true | true | false | |
635 | 2026-02-23T08:47:13.270000Z | 2026-02-23T08:47:13.270000Z | Lec. | return false; | false | false | false | |
634 | 2026-02-23T08:47:11.849000Z | 2026-02-23T08:47:11.849000Z | Lec. | qc[tail] = new_c; | false | false | false | |
633 | 2026-02-23T08:47:10.203000Z | 2026-02-23T08:47:10.203000Z | Lec. | qr[tail] = new_r; | false | false | false | |
632 | 2026-02-23T08:47:08.506000Z | 2026-02-23T08:47:08.506000Z | Lec. | vis[new_r][new_c] = true; | false | false | false | |
631 | 2026-02-23T08:47:07.064000Z | 2026-02-23T08:47:07.064000Z | Lec. | if (maze[new_r][new_c] == 1) continue; | false | false | false | |
630 | 2026-02-23T08:47:05.473000Z | 2026-02-23T08:47:05.473000Z | Lec. | if (vis[new_r][new_c]) continue; | false | false | false | |
629 | 2026-02-23T08:47:03.869000Z | 2026-02-23T08:47:03.869000Z | Lec. | if (new_r < 0 || new_c < 0 || new_r >= n || new_c >= m) continue; | false | false | false | |
628 | 2026-02-23T08:47:02.401000Z | 2026-02-23T08:47:02.401000Z | Lec. | int new_c = c + dc[step]; | false | false | false | |
627 | 2026-02-23T08:47:00.722000Z | 2026-02-23T08:47:00.722000Z | Lec. | int new_r = r + dr[step]; | false | false | false | |
626 | 2026-02-23T08:46:59.029000Z | 2026-02-23T08:46:59.029000Z | Lec. | for (int step = 0; step < 4; ++step) { | true | false | false | |
625 | 2026-02-23T08:46:56.707000Z | 2026-02-23T08:46:56.707000Z | Lec. | int c = qc[head]; | false | false | false | |
624 | 2026-02-23T08:46:55.011000Z | 2026-02-23T08:46:55.011000Z | Lec. | int r = qr[head]; | false | false | false | |
623 | 2026-02-23T08:46:53.312000Z | 2026-02-23T08:46:53.312000Z | Lec. | while (head < tail) { | false | false | false | |
622 | 2026-02-23T08:46:51.739000Z | 2026-02-23T08:46:51.739000Z | Lec. | //while queue is not empty | false | false | false | |
621 | 2026-02-23T08:46:49.939000Z | 2026-02-23T08:46:49.939000Z | Lec. | const int dc[4] = {0, 0, -1, 1}; | false | false | false | |
620 | 2026-02-23T08:46:48.222000Z | 2026-02-23T08:46:48.222000Z | Lec. | const int dr[4] = {-1, 1, 0, 0}; | false | false | false | |
619 | 2026-02-23T08:46:46.448000Z | 2026-02-23T08:46:46.448000Z | Lec. | // (-1, 0), (1, 0), (0, -1), (0, 1) | false | false | false | |
618 | 2026-02-23T08:46:44.664000Z | 2026-02-23T08:46:44.664000Z | Lec. | qc[tail] = start_column; | false | false | false | |
617 | 2026-02-23T08:46:42.949000Z | 2026-02-23T08:46:42.949000Z | Lec. | qr[tail] = start_row; | false | false | false | |
616 | 2026-02-23T08:46:41.217000Z | 2026-02-23T08:46:41.217000Z | Lec. | int head = 0, tail = 0; | false | false | false | |
615 | 2026-02-23T08:46:39.761000Z | 2026-02-23T08:46:39.761000Z | Lec. | //head <- ... <- tail | false | false | false | |
614 | 2026-02-23T08:46:38.376000Z | 2026-02-23T08:46:38.376000Z | Lec. | static int qc[MAX*MAX]; | false | false | false | |
613 | 2026-02-23T08:46:36.811000Z | 2026-02-23T08:46:36.811000Z | Lec. | //queue for columns | false | false | false | |
612 | 2026-02-23T08:46:35.023000Z | 2026-02-23T08:46:35.023000Z | Lec. | static int qr[MAX*MAX]; | false | false | false | |
611 | 2026-02-23T08:46:33.429000Z | 2026-02-23T08:46:33.429000Z | Lec. | //queue for rows | false | false | false | |
610 | 2026-02-23T08:46:31.582000Z | 2026-02-23T08:46:31.582000Z | Lec. | vis[i][j] = false; | false | false | false | |
609 | 2026-02-23T08:46:29.780000Z | 2026-02-23T08:46:29.780000Z | Lec. | static bool vis[MAX][MAX]; | false | false | false | |
608 | 2026-02-23T08:46:28.073000Z | 2026-02-23T08:46:28.073000Z | Lec. | //visited array | false | false | false | |
607 | 2026-02-23T08:46:26.262000Z | 2026-02-23T08:46:26.262000Z | Lec. | //checking that start coord or finish coord equal 1(wall) | false | false | false | |
606 | 2026-02-23T08:46:24.663000Z | 2026-02-23T08:48:58.786000Z | Lec. | 0 - free cell, 1 - wall | 0 - free cell, 1 - wall. | false | true | true |
605 | 2026-02-23T08:46:22.895000Z | 2026-02-23T08:46:22.895000Z | Lec. | *(pc_start + j) = sum; | false | false | false | |
604 | 2026-02-23T08:46:21.307000Z | 2026-02-23T08:46:21.307000Z | Lec. | const int* pb = pb_start + j; | false | false | false | |
603 | 2026-02-23T08:46:19.671000Z | 2026-02-23T08:46:19.671000Z | Lec. | const int* pb_start = B[t]; | false | false | false | |
602 | 2026-02-23T08:46:18.130000Z | 2026-02-23T08:46:18.131000Z | Lec. | //Collecting values colums_B | false | false | false | |
601 | 2026-02-23T08:46:16.351000Z | 2026-02-23T08:46:16.351000Z | Lec. | const int* pa = pa_start; | false | false | false | |
600 | 2026-02-23T08:46:14.557000Z | 2026-02-23T08:46:14.557000Z | Lec. | long long sum = 0; | false | false | false | |
599 | 2026-02-23T08:46:12.836000Z | 2026-02-23T08:46:12.836000Z | Lec. | for (int j = 0; j < mB; ++j) { | false | false | false | |
598 | 2026-02-23T08:46:11.283000Z | 2026-02-23T08:46:11.283000Z | Lec. | //Couting each C[i][j] | false | false | false | |
597 | 2026-02-23T08:46:09.440000Z | 2026-02-23T08:46:09.440000Z | Lec. | //Assigning values to matrix C | false | false | false | |
596 | 2026-02-23T08:46:07.673000Z | 2026-02-23T08:46:07.673000Z | Lec. | long long* pc_start = C[i]; | false | false | false | |
595 | 2026-02-23T08:46:06.133000Z | 2026-02-23T08:46:06.133000Z | Lec. | const int* pa_start = A[i]; | false | false | false | |
594 | 2026-02-23T08:46:04.013000Z | 2026-02-23T08:46:04.013000Z | Lec. | for (int i = 0; i < nA; ++i) { | false | false | false | |
593 | 2026-02-23T08:46:02.449000Z | 2026-02-23T08:46:02.449000Z | Lec. | (void)mA; //nB == mA | false | false | false | |
592 | 2026-02-23T08:46:00.864000Z | 2026-02-23T08:46:00.865000Z | Lec. | Matrix multilication: C = A * B | false | false | false | |
591 | 2026-02-23T08:45:59.213000Z | 2026-02-23T08:45:59.213000Z | Lec. | void mulMatricesPtr(const int A[][MAX], const int B[][MAX], long long C[][MAX], int nA, int mA, int nB, int mB) { | false | false | false | |
590 | 2026-02-23T08:45:57.322000Z | 2026-02-23T08:45:57.322000Z | Lec. | return cols_A == rows_B; | false | false | false | |
589 | 2026-02-23T08:45:55.634000Z | 2026-02-23T08:45:55.634000Z | Lec. | bool canMul(int cols_A, int rows_B) { | false | false | false | |
588 | 2026-02-23T08:45:54.083000Z | 2026-02-23T08:45:54.083000Z | Lec. | else A[i][j] = i % j; | false | false | false | |
587 | 2026-02-23T08:45:52.505000Z | 2026-02-23T08:45:52.505000Z | Lec. | if (j == 0) A[i][j] = 0; | false | false | false | |
586 | 2026-02-23T08:45:50.718000Z | 2026-02-23T08:45:50.718000Z | Lec. | type: long long | false | false | false | |
585 | 2026-02-23T08:45:49.112000Z | 2026-02-23T08:45:49.112000Z | Lec. | void printLLMatrix(const string &label, const long long A[][MAX], int n, int m, int width) { | false | false | false | |
584 | 2026-02-23T08:45:47.465000Z | 2026-02-23T08:45:47.465000Z | Lec. | cout << endl; | false | false | false | |
583 | 2026-02-23T08:45:46.156000Z | 2026-02-23T08:45:46.156000Z | Lec. | cout << setw(width) << A[i][j]; | false | false | false | |
582 | 2026-02-23T08:45:44.403000Z | 2026-02-23T08:45:44.404000Z | Lec. | for (int i = 0; i < n; ++i) { | false | false | false | |
581 | 2026-02-23T08:45:42.165000Z | 2026-02-23T08:45:42.165000Z | Lec. | void printIntMatrix(const string& label, const int A[][MAX], int n, int m, int width) { | false | false | false | |
580 | 2026-02-23T08:45:40.090000Z | 2026-02-23T08:45:40.090000Z | Lec. | minVal, maxVal | false | false | false | |
579 | 2026-02-23T08:45:38.424000Z | 2026-02-23T08:45:38.424000Z | Lec. | name + "[" + to_string(i) + "][" + to_string(j) + "]", | false | false | false | |
578 | 2026-02-23T08:45:36.322000Z | 2026-02-23T08:45:36.322000Z | Lec. | A[i][j] = readInt( | false | false | false | |
577 | 2026-02-23T08:45:34.529000Z | 2026-02-23T08:45:34.529000Z | Lec. | for (int j = 0; j < m; j++) { | false | false | false | |
576 | 2026-02-23T08:45:31.745000Z | 2026-02-23T08:45:31.745000Z | Lec. | for (int i = 0; i < n; i++) { | false | false | false | |
575 | 2026-02-23T08:45:29.469000Z | 2026-02-23T08:45:29.469000Z | Lec. | cout << "Enter Matrix " << name << endl; | true | false | false | |
574 | 2026-02-23T08:45:27.616000Z | 2026-02-23T08:45:27.616000Z | Lec. | int c = readInt(prompt, 0, 1); | false | false | false | |
573 | 2026-02-23T08:45:25.567000Z | 2026-02-23T08:45:25.567000Z | Lec. | return static_cast<int>(x); | false | false | false | |
572 | 2026-02-23T08:45:23.721000Z | 2026-02-23T08:45:23.721000Z | Lec. | if (x < minVal || x > maxVal) { | false | false | false | |
571 | 2026-02-23T08:45:22.104000Z | 2026-02-23T08:45:22.104000Z | Lec. | clearBadInput(); | false | false | false | |
570 | 2026-02-23T08:45:20.462000Z | 2026-02-23T08:45:20.462000Z | Lec. | if(!(cin >> x)) { | false | false | false | |
569 | 2026-02-23T08:45:18.700000Z | 2026-02-23T08:45:18.700000Z | Lec. | long long x; | false | false | false | |
568 | 2026-02-23T08:45:17.026000Z | 2026-02-23T08:45:17.026000Z | Lec. | cin.ignore(numeric_limits<streamsize>::max(), '\n'); | false | false | false | |
567 | 2026-02-23T08:45:15.051000Z | 2026-02-23T08:45:15.051000Z | Lec. | void mulMatricesPtr(const int A[][MAX], const int B[][MAX], long long C[][MAX], int nA, int mA, int nB, int mB); | false | false | false | |
566 | 2026-02-23T08:45:12.911000Z | 2026-02-23T08:45:12.911000Z | Lec. | //Checking for Part 2 | false | true | false | |
565 | 2026-02-23T08:45:10.917000Z | 2026-02-23T08:45:10.917000Z | Lec. | void fillMatrixA(int A[][MAX], int n, int m); | false | false | false | |
564 | 2026-02-23T08:45:09.298000Z | 2026-02-23T08:45:09.298000Z | Lec. | constexpr int ELEM_MIN = std::numeric_limits<int>::min(); | false | false | false | |
563 | 2026-02-23T08:45:07.538000Z | 2026-02-23T08:45:07.538000Z | Lec. | constexpr int MAX = 50; | false | false | false | |
562 | 2026-02-23T08:45:05.496000Z | 2026-02-23T08:45:05.496000Z | Lec. | #include <limits> | false | false | false | |
561 | 2026-02-23T08:45:03.985000Z | 2026-02-23T08:45:03.985000Z | Lec. | #include <string> | false | false | false | |
560 | 2026-02-23T08:45:02.360000Z | 2026-02-23T08:45:02.360000Z | Lec. | printLLMatrix("Matrix C", C, nA, mB); | false | false | false | |
559 | 2026-02-23T08:45:00.462000Z | 2026-02-23T08:45:00.462000Z | Lec. | mulMatricesPtr(A, B, C, nA, mA, nB, mB); | false | false | false | |
558 | 2026-02-23T08:44:58.646000Z | 2026-02-23T08:44:58.646000Z | Lec. | if (!canMul(nB, mA)) { | false | false | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.