#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair pii; typedef pair pll; const int INF = 1e9; const ll LINF = 1e18; template ostream& operator << (ostream& out,const pair& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template ostream& operator << (ostream& out,const vector V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template ostream& operator << (ostream& out,const vector > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template ostream& operator << (ostream& out,const map mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } /* 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ typedef long double ld; ld solve(){ ld res = 0; int N,M; cin >> N >> M; vector A(M),B(M); vector C(M); vector>> G(N); for(int i = 0; i < M;i++){ cin >> A[i] >> B[i] >> C[i]; C[i]/=100; G[B[i]].push_back({A[i],C[i]}); } for(int i = 0; i < (1<>k)&1){ tprob*=1-c; } } if((i>>j)&1){ prob*=1-tprob; }else{ prob*=tprob; } } res += prob; } } return res; } int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); cout << fixed << setprecision(12) << solve() << endl; return 0; }