# Codeforces Round 568 Div2 E, F, G Note

Codeforces Round 568 Div2 E, F, G Note Problem E For this problem, the main point lies on the fact that the validity of the graph does not depend on time. So, lets think a graph is obtained from a sequence of valid operations, then the resulting graph should not have the following … Continue reading

# AP European History Note

AP European History Chapter 1 html {overflow-x: initial !important;}:root { --bg-color:#ffffff; --text-color:#333333; --select-text-bg-color:#B5D6FC; --select-text-font-color:auto; --monospace:"Lucida Console",Consolas,"Courier",monospace; } html { font-size: 14px; background-color: … Continue reading

# Introduction to Probability and Statistics: Chapter 2

Terminology Experiment: a repeatable procedure with well-defined possible outcomes. Sample space: the set of all possible outcomes, usually denoted by $\Omega$ or $S$. Event: a subset of sample space. Probability function: a function giving the probability outcome. Definition of a discrete … Continue reading

# Introduction to Probability and Statistics: Chapter 1

This is a study note for the MIT Online Course 18.05 Reading 1A: Introduction Difference between Probability and Statistics Probability is logically self-contained In statistics, we use probabilities to draw conclusions from data. Two conflicting schools of statistics Frequentists: Measures … Continue reading

# Codeforces Round514 Div2 D & E

Problem D Solution: This is a pretty interesting one. At first glance, we have a initial idea to do a binary search on the result. It seems pretty reasonable to have a solution run in $\mathcal{O}(\mathrm{n}\log(\mathrm{C}))$.Therefore, we only have to figure out a way to check the answer within … Continue reading