#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P) 
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) 
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }



const int MAX = 1000;
struct UnionFind {    
    int size_;
    int par[MAX];
    int rank[MAX];
    
    UnionFind(int n = 0) {size_ = n; for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0;}
    void init(int n) {size_ = n; for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0;}
    int root(int x) {return par[x] == x ? x : par[x] = root(par[x]);}    
    bool same(int x, int y) {return root(x) == root(y);}
    
    void connect(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) return;        
        if (rank[x] < rank[y]) par[x] = y;
        else {par[y] = x; if (rank[x] == rank[y]) ++rank[x];}
    }
};

template<class T> struct Edge {
    int from, to;
    T cost;
    Edge(int f, int t, T c) : from(f), to(t), cost(c) {}
    friend bool operator < (const Edge &e1, const Edge &e2) {return e1.cost < e2.cost;}
    friend bool operator > (const Edge &e1, const Edge &e2) {return e1.cost > e2.cost;}
    friend ostream& operator << (ostream& s, const Edge<T>& E) {
        return s << E.from << "->" << E.to << '(' << E.cost << ')';
    }
};

UnionFind uf;

template<class T> T Kruskal(int V, vector<Edge<T> > &edges) {
    T res = 0.0;
    uf.init(V);
    sort(edges.begin(), edges.end());
    for (int i = 0; i < edges.size(); ++i) {
        Edge<T> e = edges[i];
        if (!uf.same(e.from, e.to)) {
            uf.connect(e.from, e.to);
            res += e.cost;
        }
    }
    return res;
}



int n, m;
int a, b, d;

int main() {
    while (cin >> n >> m) {
        if (n == 0) break;
        vector<Edge<int> > vec;
        for (int i = 0; i < m; ++i) {
            scanf("%d,%d,%d", &a, &b, &d);
            vec.push_back(Edge<int>(a, b, d/100-1));
        }
        int res = Kruskal(n, vec);
        cout << res << endl;
    }
    
    return 0;
}
