Preparing NOJ

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

AC3492 | J - クッパ | 0 | 0 | 0% |

AC3493 | K - パンプキン | 0 | 0 | 0% |

AC3505 | A - Star in Parentheses | 0 | 0 | 0% |

AC3506 | B - Slimming Plan | 0 | 0 | 0% |

AC3507 | C - Ninja Map | 0 | 0 | 0% |

AC3508 | D - Janken Master | 0 | 0 | 0% |

AC3509 | E - Route Calculator | 0 | 0 | 0% |

AC3510 | F - Endless BFS | 0 | 0 | 0% |

AC3511 | G - Low Range-Sum Matrix | 0 | 0 | 0% |

AC3512 | H - Tiny Room | 0 | 0 | 0% |

AC3513 | I - Librarian's Work | 0 | 0 | 0% |

AC3514 | J - Sum Source Detection | 0 | 0 | 0% |

AC3515 | K - Permutation Period | 0 | 0 | 0% |

AC4407 | A - 10^N+7 | 0 | 0 | 0% |

AC4408 | B - Coins | 0 | 0 | 0% |

AC4409 | C - Equiangular | 0 | 0 | 0% |

AC4410 | D - Knapsack And Queries | 0 | 0 | 0% |

AC4411 | E - Self-contained | 0 | 0 | 0% |

AC4412 | F - Point Sequences | 0 | 0 | 0% |

AC4413 | G - Construct One Point | 0 | 0 | 0% |

Filter

NOJ
CodeForces
ContestHunter
POJ
Vijos
PTA
UVa
HDU
UVaLive
ZOJ
AtCoder
BZOJ

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