Pagini recente » Cod sursa (job #1946329) | Cod sursa (job #3191251) | Cod sursa (job #6633) | Cod sursa (job #2669314) | Cod sursa (job #2921033)
#include <fstream>
#include <iomanip>
using namespace std;
ifstream in("tunel.in");
ofstream out("tunel.out");
double ep,a[260][260],z,ras,ma2[260],ma3[260],ma[260][260];
int n,m,x,y,i,j,k,t;
double ze(double a)
{
if (a>ep||a<-ep) return 1;
return 0;
}
const int bsize = (1<<16) + 1;
char buffer[bsize];
int p = 0;
void ReadInt(int &nr)
{
nr = 0;
while(!isdigit(buffer[p]))
{
if(p==bsize-1)
{
fread(buffer,1,bsize,stdin);
p = 0;
}
else
{
++p;
}
}
while(isdigit(buffer[p]))
{
nr = nr * 10 + buffer[p] - '0';
if(p==bsize-1)
{
fread(buffer,1,bsize,stdin);
p = 0;
}
else
{
++p;
}
}
}
int main()
{
in>>n>>m;
ep=0.000000001;
for(i=1;i<=m;++i)
{
in>>x>>y>>z;
ma[x][y]++;
ma[y][x]++;
ma2[x]+=z;
ma2[y]+=z;
ma3[x]++;
ma3[y]++;
}
a[1][n]=-1;
for (i=1;i<=n-1;++i)
for (j=1;j<=n-1;++j)
{
if (i==j) {a[i][j]=-1;}
else {a[i][j]=ma[i][j]/ma3[j];}
}
i=j=1;
while (i<n&&j<n)
{
for (k=i;k<n;++k)
if (ze(a[k][j])) break;
for (t=1;t<=n;++t)
swap(a[i][t],a[k][t]);
for (k=j+1;k<=n;++k)
a[i][k]/=a[i][j];
a[i][j]=1;
for (k=1;k<n;++k)
if (k!=i)
{for (t=j+1;t<=n;++t)
{a[k][t]-=a[k][j]*a[i][t]; }
a[k][j]=0;
}
i++; j++;
}
for (i=1;i<n;++i)
{
ras=ras+ma2[i]/ma3[i]*a[i][n];
}
out<<fixed<<setprecision(3)<<ras;
return 0;
}