Commits

Breadcrumbs

History for

onmaster

User selector

All users

All time

Commit History

Commits on Jan 14, 2018

• General Digit DP

  

  Takanori MAEHARA

  authored
  0c1fc11

  Copy full SHA for 0c1fc11

• General DigitDP

  

  Takanori MAEHARA

  authored
  b305b6d

  Copy full SHA for b305b6d

Commits on Jan 13, 2018

• Longest ZigZag Subsequence in O(n)

  

  Takanori MAEHARA

  authored
  d454c58

  Copy full SHA for d454c58

• Longest ZigZag Subsequence in O(n)

  

  Takanori MAEHARA

  authored
  7e2755e

  Copy full SHA for 7e2755e

• Digit DP (most generalized form)

  

  Takanori MAEHARA

  authored
  f91a0c4

  Copy full SHA for f91a0c4

Commits on Jan 9, 2018

• Bounded Knapsack Problem in O(nW) time

  

  Takanori MAEHARA

  authored
  2f7430f

  Copy full SHA for 2f7430f

Commits on Jan 8, 2018

• Bounded Knapsack Problem in O(nW) time

  

  Takanori MAEHARA

  authored
  2bcb86f

  Copy full SHA for 2bcb86f

• Bounded Knapsack Problem in O(nW) time

  

  Takanori MAEHARA

  authored
  c64100b

  Copy full SHA for c64100b

Commits on Apr 8, 2016

• minimum_coin_change (dynamic programming)

  wang502

  committed
  4755214

  Copy full SHA for 4755214

• Rod cutting (dynamic programming)

  wang502

  committed
  8b342f8

  Copy full SHA for 8b342f8

• Rod Cutting (dynamic programming)

  wang502

  committed
  204b1ce

  Copy full SHA for 204b1ce

• Minimum Coin Change (Dynamic Programming)

  wang502

  committed
  aa042bf

  Copy full SHA for aa042bf

• Minimum coin change (dynamic programming

  sethwang10

  committed
  e7f0004

  Copy full SHA for e7f0004

Commits on Apr 18, 2015

• 0/1 Knapsack problem (dynamic programming)

  

  Takanori MAEHARA

  committed
  070b25a

  Copy full SHA for 070b25a

• 0/1 Knapsack Problem (Dynamic programming)

  

  Takanori MAEHARA

  committed
  6603356

  Copy full SHA for 6603356

Commits on Jan 17, 2015

• Longest increasing subsequence in O(n log n)

  

  Takanori MAEHARA

  committed
  31d867d

  Copy full SHA for 31d867d

Loading