# CP Jargons

  • Ad-hoc problems require no specific knowledge and the solution is not intended to be adapted to other purposes (quoted from SPOJ (opens new window)).
  • BF is short for brute force.
  • BFS is short for breadth first search.
  • BIT is another name for Fenwick tree.
  • DC is short for divide-and-conquer.
  • DFS is short for depth first search.
  • DP is short for dynamic programming.