Preparing NOJ

# | Problem | Submitted | Passed | AC Rate |
---|---|---|---|---|

NOIOPJENGLISH26 | The Nearest Number | 0 | 0 | 0% |

NOIOPJENGLISH27 | Mode of Sequence | 0 | 0 | 0% |

NOIOPJENGLISH28 | Sum Number | 0 | 0 | 0% |

NOIOPJENGLISH29 | Divisor Problem | 0 | 0 | 0% |

NOIOPJENGLISH30 | Exactly Equal | 0 | 0 | 0% |

NOIOPJENGLISH31 | Candies | 0 | 0 | 0% |

NOIOPJENGLISH32 | Reverse Pair | 0 | 0 | 0% |

NOIOPJENGLISH33 | Is It a Tree | 0 | 0 | 0% |

NOIOPJENGLISH34 | Travel with Money | 0 | 0 | 0% |

NOIOPJENGLISH35 | Stock Exchange | 0 | 0 | 0% |

NOIOPJENGLISH36 | Back Home | 0 | 0 | 0% |

NOIOPJENGLISH37 | Prime | 0 | 0 | 0% |

NOIOPJENGLISH38 | Minimum Prime | 0 | 0 | 0% |

NOIOPJENGLISH39 | Apears an Odd Number of Times | 0 | 0 | 0% |

NOIOPJENGLISH40 | Distinct | 0 | 0 | 0% |

Filter

NOJ
CodeForces
POJ
Vijos
UVa
HDU
UVaLive
AtCoder
NOIOPEN

implementation
math
greedy
dp
data structures
brute force
constructive algorithms
graphs
dfs and similar
sortings
binary search
trees
...