#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define pb(a) push_back(a)
#define pr(a) cout<<(a)<<endl
#define PR(a,b) cout<<(a)<<" "<<(b)<<endl
#define F first
#define S second
#define ll long long
bool check(int n,int m,int x,int y){return (x<0||x>=n||y<0||y>=m)?false:true;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
typedef pair<int,int> P;

int main() {
  int n,m;
  while(cin >> n && n) {
    cin >> m;
    vector<P> v[n];
    while(m--) {
      int x,y,d;
      scanf("%d%*c%d%*c%d",&x,&y,&d);
      v[x].pb(P(y,d));
      v[y].pb(P(x,d));
    }
    int ans=0;
    priority_queue<P,vector<P>,greater<P> > que;
    que.push(P(0,0));
    bool d[n];
    fill(d,d+n,false);
    while(!que.empty()) {
      P p=que.top();que.pop();
      int x=p.S,cost=p.F;
      if(d[x]) continue;
      d[x]=true;
      ans+=cost/100-1;
      for(int i=0; i<v[x].size(); i++) {
	if(!d[v[x][i].F]) {
	  que.push(P(v[x][i].S,v[x][i].F));
	}
      }
    }
    pr(ans+1);
  }
  return 0;
}
