#include <iostream>
#include <algorithm>
using namespace std;

const int INF = 1000000000;
const int MAX_V = 101;

int cost[MAX_V][MAX_V];
int mincost[MAX_V];
bool used[MAX_V];

int V;

int prim() {
  for ( int i = 0; i < V; ++i ) {
    mincost[i] = INF;
    used[i] = false;
  }

  mincost[0] = 0;
  int res = 0;

  while(true) {
    int v = -1;
    for ( int u = 0; u < V; u++ ) {
      if ( !used[u] && ( v == -1 || mincost[u] < mincost[v])) v = u;
    }
     
    if ( v == -1 ) break;
    used[v] = true;
    res += mincost[v];

    for ( int u = 0; u < V; u++ ) {
      mincost[u] = min(mincost[u], cost[v][u]);
    }
  }
  return res;
}


int main() {
  int m;
  while( cin >> V >> m,V ) {
    for ( int i = 0; i < V; i++ ) {
      for ( int j = 0; j < m; j++ ) {
	cost[i][j] = INF;
      }
    }
    for ( int i = 0; i < m; i++ ) {
      char ch; int a,b,c;
      cin >> a >> ch >> b >> ch >> c;
      cost[a][b] = c;
      cost[b][a] = c;
    }
    int ans = prim();
    cout << (ans/100) - (V-1) << endl;
  }
  return 0;
}