Preparing NOJ

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

NOIOPJENGLISH06 | N Queens | 0 | 0 | 0% |

NOIOPJENGLISH07 | Shortest Path | 0 | 0 | 0% |

NOIOPJENGLISH08 | Greatest Common Divisor | 0 | 0 | 0% |

NOIOPJENGLISH09 | Least Common Multiple | 0 | 0 | 0% |

NOIOPJENGLISH10 | Chickens and Rabbits | 0 | 0 | 0% |

NOIOPJENGLISH11 | Goldbach Conjecture | 0 | 0 | 0% |

NOIOPJENGLISH12 | Maximum Product of Sequence | 0 | 0 | 0% |

NOIOPJENGLISH13 | Same Remainder | 0 | 0 | 0% |

NOIOPJENGLISH14 | Children's Apples | 0 | 0 | 0% |

NOIOPJENGLISH15 | Sum is K | 0 | 0 | 0% |

NOIOPJENGLISH16 | Maximum Sum Not Exceeding K | 0 | 0 | 0% |

NOIOPJENGLISH17 | The Largest City Nearby | 0 | 0 | 0% |

NOIOPJENGLISH18 | Coins | 0 | 0 | 0% |

NOIOPJENGLISH19 | Duplicate Number | 0 | 0 | 0% |

NOIOPJENGLISH20 | Messager Problem | 0 | 0 | 0% |

NOIOPJENGLISH21 | Teamwork | 0 | 0 | 0% |

NOIOPJENGLISH22 | Indeterminate Equation | 0 | 0 | 0% |

NOIOPJENGLISH23 | Multiple of 3 Or 5 | 0 | 0 | 0% |

NOIOPJENGLISH24 | Divisor and Multiple | 0 | 0 | 0% |

NOIOPJENGLISH25 | Sequence Search | 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
...