Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- int main() {
- size_t n;
- cin >> n;
- vector <vector <int> > vector(n, vector <int> (n));
- for (int i = 0; i < n; ++i) {
- for (int j = 0; j < n; ++j) {
- cin >> vector[i][j];
- if (vector[i][j] == 0)
- vector[i][j] = 1000;
- else
- vector[i][j] = -1;
- }
- }
- if (n < 0) {
- cout << "Отрицательный параметр";
- } else {
- vector <int> distance(n);
- for (int j = 0; j < n; ++j) {
- for (int i = 0; i < n; ++i) {
- for (int j = 0; j < n; ++j) {
- if (vector[i][j] < 1000 && vector[j][j] < 1000)
- vector[i][j] = min(vector[i][j], vector[i][j] + vector[j][j]);
- }
- }
- }
- for (int i = 0; i < n; ++i) {
- if (vector[i][i] < 0) {
- cout << 1 << endl;
- return 0;
- }
- }
- cout << 0 << endl;
- return 0;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement