# UVa 10296 – Jogging Trails

Solution Idea:
—————–
Light OJ: 1086 – Jogging Trails is a similar problem. The main idea behind this problem is Chinese Postman Problem.

```
#include &lt;bits/stdc++.h&gt;

#define pii              pair &lt;int,int&gt;
#define pll              pair &lt;long long,long long&gt;
#define sc               scanf
#define pf               printf
#define Pi               2*acos(0.0)
#define ms(a,b)          memset(a, b, sizeof(a))
#define pb(a)            push_back(a)
#define MP               make_pair
#define db               double
#define ll               long long
#define EPS              10E-10
#define ff               first
#define ss               second
#define sqr(x)           (x)*(x)
#define D(x)             cout&lt;&lt;#x &quot; = &quot;&lt;&lt;(x)&lt;&lt;endl
#define VI               vector &lt;int&gt;
#define DBG              pf(&quot;Hi\n&quot;)
#define MOD              1000000007
#define CIN              ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define SZ(a)            (int)a.size()
#define sf(a)            scanf(&quot;%d&quot;,&amp;a)
#define sfl(a)           scanf(&quot;%lld&quot;,&amp;a)
#define sff(a,b)         scanf(&quot;%d %d&quot;,&amp;a,&amp;b)
#define sffl(a,b)        scanf(&quot;%lld %lld&quot;,&amp;a,&amp;b)
#define sfff(a,b,c)      scanf(&quot;%d %d %d&quot;,&amp;a,&amp;b,&amp;c)
#define sfffl(a,b,c)     scanf(&quot;%lld %lld %lld&quot;,&amp;a,&amp;b,&amp;c)
#define stlloop(v)       for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define loop(i,n)        for(int i=0;i&lt;n;i++)
#define loop1(i,n)       for(int i=1;i&lt;=n;i++)
#define REP(i,a,b)       for(int i=a;i&lt;b;i++)
#define RREP(i,a,b)      for(int i=a;i&gt;=b;i--)
#define TEST_CASE(t)     for(int z=1;z&lt;=t;z++)
#define PRINT_CASE       printf(&quot;Case %d: &quot;,z)
#define LINE_PRINT_CASE  printf(&quot;Case %d:\n&quot;,z)
#define CASE_PRINT       cout&lt;&lt;&quot;Case &quot;&lt;&lt;z&lt;&lt;&quot;: &quot;
#define all(a)           a.begin(),a.end()
#define intlim           2147483648
#define infinity         (1&lt;&lt;28)
#define ull              unsigned long long
#define gcd(a, b)        __gcd(a, b)
#define lcm(a, b)        ((a)*((b)/gcd(a,b)))

using namespace std;

/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

int Set(int N,int pos)
{
return N=N | (1&lt;&lt;pos);
}
int reset(int N,int pos)
{
return N= N &amp; ~(1&lt;&lt;pos);
}
bool check(int N,int pos)
{
return (bool)(N &amp; (1&lt;&lt;pos));
}
/*------------------------------------------------*/

ll g[16][16];
int degree[16];
ll dp[1&lt;&lt;16];
int n,m;

void floyed_warshal()
{
for(int k=0; k&lt;n; k++)
for(int i=0; i&lt;n; i++)
for(int j=0; j&lt;n; j++)
{
if(g[i][j]&gt;g[i][k]+g[k][j])
g[i][j]=g[i][k]+g[k][j];
}
}

{
if(ret!=-1) return ret;
int pos=0;
for(int i=0; i&lt;n; i++)
{
pos=i;
break;
}
ret=INT_MAX;
for(int i=pos+1;i&lt;n;i++)
{
{
}
}
return ret;
}

int main()
{

//    freopen(&quot;in.txt&quot;,&quot;r&quot;,stdin);
//	  freopen(&quot;out.txt&quot;,&quot;w&quot;,stdout);

int t;
//    sf(t);
//    TEST_CASE(t)
while(sf(n) &amp;&amp; n)
{
sf(m);
//        sff(n,m);
ll ans=0;
for(int i=0; i&lt;=n; i++) for(int j=0; j&lt;=n; j++) g[i][j]=INT_MAX;
ms(degree,0);
for(int i=0; i&lt;m; i++)
{
ll a,b,c;
sfffl(a,b,c);
a--;
b--;
g[a][b]=min(g[a][b],c);
g[b][a]=min(g[b][a],c);
degree[a]++;
degree[b]++;
ans+=c;
}

floyed_warshal();

for(int i=0; i&lt;n; i++)
if(degree[i]%2)

//        PRINT_CASE;
ms(dp,-1);