SPOJ

C# solutions to the 200 most-solved problems on SPOJ: www.spoj.com/users/davidgalehouse/

Problems are ranked (roughly) by difficulty using the levels from Civ V, from Settler (easiest) to Deity (hardest).

Submission History

|Date|Problem|Solution|Tags|Difficulty| |----|-------|--------|:--:|----------| |2015/04/28|TEST|TEST.cs|#io|Settler| |2015/09/20|PRIME1|PRIME1.cs|#primes #sieve|King| |2015/12/28|ADDREV|ADDREV.cs|#ad-hoc #digits|Chieftain| |2016/01/01|ONP|ONP.cs|#parsing #recursion #stack #strings|Prince| |2016/01/05|FCTRL|FCTRL.cs|#factorial #factors #math|King| |2016/06/04|FCTRL2|FCTRL2.cs|#big-numbers #factorial|Emperor| |2016/06/05|SAMER08F|SAMER08F.cs|#ad-hoc #dynamic-programming-1d #math|King| |2016/06/05|NSTEPS|NSTEPS.cs|#ad-hoc|Chieftain| |2016/06/07|ACPC10A|ACPC10A.cs|#sequence|Warlord| |2016/06/08|CANDY|CANDY.cs|#ad-hoc #division|Warlord| |2016/06/10|FASHION|FASHION.cs|#ad-hoc #sorting|Prince| |2016/06/10|TOANDFRO|TOANDFRO.cs|#ad-hoc #strings|Warlord| |2016/06/12|AE00|AE00.cs|#division #math|Prince| |2016/06/12|LASTDIG|LASTDIG.cs|#digits #mod-math|King| |2016/06/16|JULKA|JULKA.cs|#big-numbers #math|Emperor| |2016/06/19|CANDY3|CANDY3.cs|#division #mod-math|Warlord| |2016/06/19|COINS|COINS.cs|#dynamic-programming-1d #recursion|King| |2016/06/25|EIGHTS|EIGHTS.cs|#digits #math|Prince| |2016/06/26|HANGOVER|HANGOVER.cs|#binary-search #sequence|Warlord| |2016/06/28|PALIN|PALIN.cs|#ad-hoc|King| |2016/06/30|ACODE|ACODE_v1.cs|#dynamic-programming #memoization #recursion|King| |2016/07/03|WILLITST|WILLITST.cs|#game #math|Prince| |2016/07/03|ABSYS|ABSYS.cs|#ad-hoc #strings|Warlord| |2016/07/04|CANTON|CANTON.cs|#ad-hoc #math #sequence|King| |2016/07/05|STAMPS|STAMPS.cs|#sorting|Warlord| |2016/07/06|PERMUT2|PERMUT2.cs|#ad-hoc #permutations|Prince| |2016/07/07|ARMY|ARMY.cs|#ad-hoc|Chieftain| |2016/07/09|TRICOUNT|TRICOUNT.cs|#math #proof|King| |2016/07/10|AP2|AP2.cs|#math #sequence|Prince| |2016/07/10|FENCE1|FENCE1.cs|#math|Warlord| |2016/07/10|STPAR|STPAR.cs|#ad-hoc #greedy #stack|King| |2016/07/12|PT07Y|PT07Y.cs|#graph-theory #tree|King| |2016/07/16|GIRLSNBS|GIRLSNBS.cs|#division|Warlord| |2016/07/17|NGM|NGM.cs|#game|King| |2016/07/17|INVCNT|INVCNT.cs|#ad-hoc #bst|Emperor| |2016/07/21|CRDS|CRDS.cs|#ad-hoc #sequence|Warlord| |2016/07/21|EDIST|EDIST.cs|#dynamic-programming-2d #strings|Emperor| |2016/07/26|BEENUMS|BEENUMS.cs|#formula #math #proof|King| |2016/08/02|PT07Z|PT07Z.cs|#bfs #graph-theory #longest-path #proof #tree|Immortal| |2016/08/07|AGGRCOW|AGGRCOW.cs|#binary-search #greedy #optimization|Emperor| |2016/08/08|BISHOPS|BISHOPS.cs|#ad-hoc #math|Prince| |2016/08/08|BYTESM2|BYTESM2.cs|#dynamic-programming-2d #path-optimization|King| |2016/08/09|OLOLO|OLOLO.cs|#binary #io|Emperor| |2016/08/09|OFFSIDE|OFFSIDE.cs|#ad-hoc|Prince| |2016/08/10|MAXLN|MAXLN.cs|#math #proof|King| |2016/08/11|HPYNOS|HPYNOS.cs|#digits #simulation|Prince| |2016/08/11|NY10A|NY10A.cs|#buckets #sorting #strings|Warlord| |2016/08/14|LASTDIG2|LASTDIG2.cs|#big-numbers #digits #mod-math|King| |2016/08/14|HUBULLU|HUBULLU.cs|#game #proof|Emperor| |2016/08/15|EASYPROB|EASYPROB.cs|#binary #recursion|Prince| |2016/08/15|ARITH2|ARITH2.cs|#ad-hoc #parsing #strings|Prince| |2016/08/21|GSS1|GSS1.cs|#divide-and-conquer #segment-tree|Immortal| |2016/09/05|BITMAP|BITMAP.cs|#bfs|King| |2016/09/05|PARTY|PARTY.cs|#dynamic-programming-2d #knapsack #optimization|King| |2016/09/07|ETF|ETF.cs|#factors #formula #math #primes #sieve|Emperor| |2016/09/08|MARBLES|MARBLES.cs|#big-numbers #combinatorics #math|King| |2016/09/09|TRT|TRT_v1.cs|#memoization #optimization #recursion|Emperor| |2016/09/10|EGYPIZZA|EGYPIZZA.cs|#ad-hoc #division|Prince| |2016/09/10|AMR10G|AMR10G.cs|#sorting|King| |2016/09/11|AIBOHP|AIBOHP.cs|#dynamic-programming-2d #optimization|Emperor| |2016/09/12|FARIDA|FARIDA.cs|#dynamic-programming-1d|Prince| |2016/09/14|ANARC09A|ANARC09A.cs|#greedy #recursion #stack|Emperor| |2016/09/17|PIGBANK|PIGBANK_v1.cs|#dynamic-programming-1d #knapsack #optimization|King| |2016/09/17|NHAY|NHAY.cs|#strings|Emperor| |2016/09/18|[MIXTURES](https://www.spoj.com/pro