Hello,
Sometimes I encounter problems and can't come up with a solution better than backtracking. Even my backtracking solution, I can't analyze its time complexity. So, I try implementing it, see the worst case and find my intuition is true. Here are two of them, if someone can help me to prove why it should pass the time limit.
Problem 1: UVa 10506 — The Ouroboros problem. link, solution
Problem 2: UVa 165 — Stamps. link, solution
Thanks!