Pagini recente » Cod sursa (job #412439) | Cod sursa (job #2455791) | Cod sursa (job #1810424) | Cod sursa (job #40437) | Cod sursa (job #1574588)
#include <fstream>
using namespace std;
int main()
{
int i=0,v=1,x=1,b[600],a[600],c[600],p,n,m,j,ok=0,ver[3],s=0,t=0,save;
ifstream f("traseu.in");
ofstream g("traseu.out");
f>>n;
f>>m;
for(i=1;i<=3*m;i++)
{
f>>a[i];
}
for(i=1;i<=3*m;i++)
{
if(i%3!=0)
{
b[v]=a[i];
v++;
}
if(i%3==0)
{
c[x]=a[i];
x++;
}
}
save=i-1;
x--;
v--;
p=v;
do
{ok=1;
for(v=3;v<=p;v+=2)
if(b[v]!=b[v-1])
{
for(j=p;j>=v-1;j--)
b[j+1]=b[j];
p++;
ok=0;
}
}while(ok==0);
p--;
for(v=1;v<=p;v++)
if(b[v]==b[v+1])
{
for(j=v;j<=p;j++)
b[j]=b[j+1];
p--;
}
p++;
i=1;
for(v=1;v<=p;v++)
{
i=1;
ver[1]=b[v];
ver[2]=b[v+1];
s=t;
do
{if(ver[1]==a[i] && ver[2]==a[i+1] && i%3!=0 && (i+1)%3!=0)
{
t=t+a[i+2];
i++;
}
else
i++;
}while(i<=save);
}
g<<t;
f.close();
g.close();
}