Useless SQRT with probs

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Rustam Musin (t.me/musin_acm)
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        TaskIFence solver = new TaskIFence();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskIFence {
        int n;
        double[] pByIndex;
        int BLOCK_SIZE = 350;
        int blockCount;
        double[] blockP1;
        boolean[] active;

        public void solve(int testNumber, InputReader in, OutputWriter out) {
            out.printFormat("%.20f", solve(in));
        }

        double solve(InputReader in) {
            n = in.readInt();
            Action[] actions = new Action[2 * n];
            for (int i = 0; i < n; i++) {
                int l = in.readInt();
                int r = in.readInt();
                double p = in.readInt() / 100.0;
                actions[i * 2] = new Action(i, true, l, p);
                actions[i * 2 + 1] = new Action(i, false, r, p);
            }
            Arrays.sort(actions);
            int[] indexMap = new int[n];
            Arrays.fill(indexMap, -1);
            int actionCount = 0;
            for (int i = 0; i < 2 * n; i++) {
                Action action = actions[i];
                if (action.appears) {
                    indexMap[action.index] = actionCount++;
                }
            }
            for (int i = 0; i < 2 * n; i++) {
                Action action = actions[i];
                action.index = indexMap[action.index];
            }
            pByIndex = new double[actionCount];
            for (Action action : actions) {
                pByIndex[action.index] = action.p;
            }
            blockCount = (n + BLOCK_SIZE - 1) / BLOCK_SIZE;
            blockP1 = new double[blockCount];
            active = new boolean[n];
            double ans = 0;
            int lastX = -1;
            for (Action a : actions) {
                if (lastX != -1) {
                    ans += getAnswer() * (a.x - lastX);
                }
                lastX = a.x;
                active[a.index] = a.appears;
                recalc(a.index / BLOCK_SIZE);
            }
            return ans;
        }

        void recalc(int blockIndex) {
            int l = blockIndex * BLOCK_SIZE;
            int r = Math.min(n, l + BLOCK_SIZE);
            double p1 = 0;
            for (int i = l; i < r; i++) {
                if (active[i]) {
                    double p = pByIndex[i];
                    p1 = p1 * (1 - p) + (1 - p1) * p;
                }
            }
            blockP1[blockIndex] = p1;
        }

        double getAnswer() {
            double p1 = 0;
            for (int i = 0; i < blockCount; i++) {
                double p = blockP1[i];
                p1 = p1 * (1 - p) + (1 - p1) * p;
            }
            return p1;
        }

        class Action implements Comparable<Action> {
            int index;
            boolean appears;
            int x;
            double p;

            Action(int i, boolean appears, int x, double p) {
                index = i;
                this.appears = appears;
                this.x = x;
                this.p = p;
            }

            public int compareTo(Action o) {
                return Integer.compare(x, o.x);
            }

        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void printFormat(String format, Object... objects) {
            writer.printf(format, objects);
        }

        public void close() {
            writer.close();
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int readInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}