Cod sursa(job #2896848)

Utilizator mateicalin2002Ceausu Matei Calin mateicalin2002 Data 1 mai 2022 01:34:48
Problema Algoritmul Bellman-Ford Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.66 kb
#include <bits/stdc++.h>

using namespace std;

int n;

int main()
{
	// freopen("bellmanford.in", "r", stdin);
	// freopen("bellmanford.out", "w", stdout);
	cin >> n;
	// for (int i = 1; i <= n; i++)
	// 	for (int j = 1; j <= n; j++)
	// 		cin >> a[i][j];
	// 	int i, j, k;
	// for (k = 1; k <= n; k++)
	// 	for (i = 1; i <= n; i++)
	// 		for (j = 1; j <= n; j++)
	// 			if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
	// 				a[i][j] = a[i][k] + a[k][j];
	// for (int i = 1; i <= n; i++) {
	// 	for (int j = 1; j <= n; j++)
	// 		cout << a[i][j] << ' ';
	// 	cout << '\n';
	// }
	cout << n << '\n';
	return 0;
}