Pagini recente » Cod sursa (job #572490) | Cod sursa (job #1165403) | Cod sursa (job #1284280) | Cod sursa (job #1129271) | Cod sursa (job #2801388)
#include <bits/stdc++.h>
using namespace std;
int d[257][257], dist[257][257];
class OutParser
{
private:
FILE *fout;
char *buff;
int sp;
void write_ch(char ch)
{
if (sp == 50000)
{
fwrite(buff, 1, 50000, fout);
sp = 0;
buff[sp++] = ch;
}
else
{
buff[sp++] = ch;
}
}
public:
OutParser(const char *name)
{
fout = fopen(name, "w");
buff = new char[50000]();
sp = 0;
}
~OutParser()
{
fwrite(buff, 1, sp, fout);
fclose(fout);
}
OutParser &operator<<(int vu32)
{
if (vu32 <= 9)
{
write_ch(vu32 + '0');
}
else
{
(*this) << (vu32 / 10);
write_ch(vu32 % 10 + '0');
}
return *this;
}
OutParser &operator<<(long long vu64)
{
if (vu64 <= 9)
{
write_ch(vu64 + '0');
}
else
{
(*this) << (vu64 / 10);
write_ch(vu64 % 10 + '0');
}
return *this;
}
OutParser &operator<<(char ch)
{
write_ch(ch);
return *this;
}
OutParser &operator<<(const char *ch)
{
while (*ch)
{
write_ch(*ch);
++ch;
}
return *this;
}
};
class InParser
{
private:
FILE *fin;
char *buff;
int sp;
char read_ch()
{
++sp;
if (sp == 4096)
{
sp = 0;
fread(buff, 1, 4096, fin);
}
return buff[sp];
}
public:
InParser(const char *nume)
{
fin = fopen(nume, "r");
buff = new char[4096]();
sp = 4095;
}
InParser &operator>>(int &n)
{
char c;
while (!isdigit(c = read_ch()) && c != '-')
;
int sgn = 1;
if (c == '-')
{
n = 0;
sgn = -1;
}
else
{
n = c - '0';
}
while (isdigit(c = read_ch()))
{
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
InParser &operator>>(long long &n)
{
char c;
n = 0;
while (!isdigit(c = read_ch()) && c != '-')
;
long long sgn = 1;
if (c == '-')
{
n = 0;
sgn = -1;
}
else
{
n = c - '0';
}
while (isdigit(c = read_ch()))
{
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
};
int main()
{
InParser cin("royfloyd.in");
OutParser cout("royfloyd.out");
int n, i, j, k;
cin >> n;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
{
if (i != j)
dist[i][j] = 1;
cin >> d[i][j];
}
for (k = 0; k < n; k++)
{
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
if (i != j)
{
if (d[i][j] > d[i][k] + d[k][j])
d[i][j] = d[i][k] + d[k][j], dist[i][j] = dist[i][k] + dist[k][j];
else if (d[i][j] == d[i][k] + d[k][j] && dist[i][k] + dist[k][j] > dist[i][j])
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
}
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
cout << d[i][j] << " ";
}
cout << '\n';
}
/*for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
cout << dist[i][j] << " ";
}
cout << '\n';
}*/
return 0;
}