Estimate a sequence of independent tasks with three-point estimation.
Input: lines task O M P until the end of input (O ≤ M ≤ P, real numbers, days).
For each task print task: E=x.xx SD=x.xx with E = (O + 4M + P) / 6 and SD = (P − O) / 6. If a line violates O ≤ M ≤ P, print task: INVALID (need O <= M <= P) and ignore that task in the totals.
Then print:
Total E: x.xx days
Total SD: x.xx days
95% range: a.aa to b.bb days
Riskiest task: name (SD x.xx)
where Total SD = √(sum of SD²), the range is E − 2·SD to E + 2·SD (the lower bound is never below 0), and the riskiest task has the largest SD (first one on a tie). If there are no valid tasks, print only No valid tasks.
Input:
upload 2 3 10
wrapper 3 5 13
buddy 4 6 20
Output:
upload: E=4.00 SD=1.33
wrapper: E=6.00 SD=1.67
buddy: E=8.00 SD=2.67
Total E: 18.00 days
Total SD: 3.42 days
95% range: 11.17 to 24.83 days
Riskiest task: buddy (SD 2.67)