#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ldb double
#define pb push_back

const int N=505;
const int M=101;

ldb ans[N];
int m[N],g[N],s[N];

const int X=2520;
bitset<M> good[X][N];
vector<pair<int,int>> best[X];
ldb Solve(int n){
	ldb ans=0;
	for(int ost=0;ost<X;ost++){
		vector<pair<int,int>> all=best[ost];
		for(int i=n;i<=n;i++){
			int g=__gcd(X,m[i]);
			int o=ost%g;
			//for(int j=0;j<m[i]/g;j++)good[ost][i][j]=false;
			for(int j=0;j<::g[i];j++){
				int x=(s[i]+j)%m[i];
				if(x%g==o){
					good[ost][i][x/g]=1;
				}
			}
			all.pb({m[i]/g,i});
		}
		best[ost].clear();
		sort(all.rbegin(),all.rend());
		vector<bool> done(all.size(),false);
		ldb now=1;
		for(int i=0;i<all.size();i++){
			if(!done[i]){
				for(int j=i+1;j<all.size();j++){
					if(all[i].first%all[j].first==0 && !done[j]){
						int g1=m[all[i].second]/all[i].first;
						int g2=m[all[j].second]/all[j].first;
						int g3=__gcd(g1,g2);
						int taken=0;
						int val=ost%g1;
						while(taken<all[i].first){
							if(val%g2==ost%g2){
								good[ost][all[i].second][val/g1%all[i].first]=good[ost][all[i].second][val/g1%all[i].first]&good[ost][all[j].second][val/g2%all[j].first];
								taken++;
								val+=g1*g2/g3;
							}else{
								val+=g1;
							}
							//val%=m[all[i].second];
						}
						//for(int z=0;z<all[i].first;z++){
						//	good[all[i].second][z]&=good[all[j].second][(z*g1+ost%g1)/g2%all[j].first];
						//}
						done[j]=true;
					}
				}
				int cnt=0;
				for(int j=0;j<all[i].first;j++){
					cnt+=good[ost][all[i].second][j];
				}
				//printf("%i / %i\n",cnt,all[i].first);
				now*=(ldb)cnt/all[i].first;
				best[ost].pb(all[i]);
			}
		}
		ans+=now;
	}
	return ans/X;
}
int main(){
	int n;
	scanf("%i",&n);
	ans[0]=1;
	for(int i=1;i<=n;i++){
		int r,g,x;
		scanf("%i %i %i",&x,&r,&g);
		m[i]=r+g;
		s[i]=((r-x)%m[i]+m[i])%m[i];
		::g[i]=g;
		ans[i]=Solve(i);
		//printf("%.12f\n",ans[i]);
	}
	//printf("\n");
	for(int i=1;i<=n+1;i++){
		printf("%.12f\n",ans[i-1]-ans[i]);
	}
	return 0;
}