User contributions
(newest | oldest) View (newer 100 | older 100) (20 | 50 | 100 | 250 | 500)
- 19:26, 22 July 2014 (diff | hist) . . (-8) . . Judge:Help (→Summary of supported languages)
- 16:58, 19 July 2014 (diff | hist) . . (+12) . . Judge:Help (→Python)
- 01:06, 19 July 2014 (diff | hist) . . (+116) . . Judge:Help (→Summary of supported languages)
- 01:02, 19 July 2014 (diff | hist) . . (+63) . . Judge:Help (→Summary of supported languages)
- 00:53, 19 July 2014 (diff | hist) . . (-55) . . Judge:Free software (current)
- 21:11, 4 December 2013 (diff | hist) . . (+3,068) . . N ACM International Collegiate Programming Contest (Created page with "The ACM International Collegiate Programming Contest ('''ACM-ICPC''') is a set of programming competitions sponsored by the Association for Computing Machinery (ACM). It ...")
- 20:55, 4 December 2013 (diff | hist) . . (+51) . . N IOI (Redirected page to International Olympiad in Informatics) (current)
- 20:55, 4 December 2013 (diff | hist) . . (+44) . . N CCC (Redirected page to Canadian Computing Competition) (current)
- 20:54, 4 December 2013 (diff | hist) . . (+34) . . N OI (Redirected page to Informatics olympiad) (current)
- 20:54, 4 December 2013 (diff | hist) . . (+34) . . N Olympiad in informatics (Redirected page to Informatics olympiad) (current)
- 20:54, 4 December 2013 (diff | hist) . . (+24) . . m Informatics olympiad
- 20:51, 4 December 2013 (diff | hist) . . (0) . . m Informatics olympiad
- 20:51, 4 December 2013 (diff | hist) . . (+183) . . Informatics olympiad
- 04:36, 9 September 2013 (diff | hist) . . (+26) . . N Maximum flow problem (Redirected page to Maximum flow) (current)
- 04:36, 9 September 2013 (diff | hist) . . (+1,604) . . N Edmonds–Karp algorithm (Created page with "The Edmonds–Karp algorithm is a special case of the Ford–Fulkerson method that always chooses a shortest augmenting path at each iteration. It solves the [[maximum fl...") (current)
- 04:26, 9 September 2013 (diff | hist) . . (+190) . . N Category:Articles needing code (Created page with "This category collects articles in need of a model implementation of an algorithm or data structure in a real programming language such as C++ or Python, rather than mere...") (current)
- 04:14, 9 September 2013 (diff | hist) . . (+38) . . N Edmonds-Karp algorithm (Redirected page to Edmonds–Karp algorithm) (current)
- 04:12, 9 September 2013 (diff | hist) . . (+2,870) . . N Ford–Fulkerson method (Created page with "The Ford–Fulkerson method is a technique for solving the maximum flow problem. The input is a flow network, <math>G_0 = (V, s, t, c)</math>. Then the algorithm proceeds...") (current)
- 03:27, 9 September 2013 (diff | hist) . . (+37) . . N Ford-Fulkerson algorithm (Redirected page to Ford–Fulkerson method) (current)
- 03:26, 9 September 2013 (diff | hist) . . (+37) . . N Ford-Fulkerson method (Redirected page to Ford–Fulkerson method) (current)
- 03:26, 9 September 2013 (diff | hist) . . (+37) . . N Ford–Fulkerson algorithm (Redirected page to Ford–Fulkerson method) (current)
- 03:22, 9 September 2013 (diff | hist) . . (-3,817) . . Maximum flow (→Minimum s-t cut problem) (current)
- 03:18, 9 September 2013 (diff | hist) . . (+5,260) . . N Max-flow min-cut theorem (Created page with "The max-flow min-cut theorem is an important result in graph theory. It states that a weight of a minimum s-t cut in a graph equals the value of a maximum flow in a c...") (current)
- 03:01, 9 September 2013 (diff | hist) . . (+1,308) . . Augmenting path (current)
- 02:24, 9 September 2013 (diff | hist) . . (+4) . . Maximum flow (→Minimum s-t cut problem: - typo, used wrong symbol)
- 02:04, 9 September 2013 (diff | hist) . . (+3,596) . . N Augmenting path (Created page with "An augmenting path in a flow network is a path from the source to the sink in the residual network for some flow. It is so named because it is possible to ''augment'' (increa...")
- 00:27, 9 September 2013 (diff | hist) . . (+4) . . m Maximum flow (→Minimum s-t cut problem)
- 00:17, 9 September 2013 (diff | hist) . . (+12,635) . . Maximum flow
- 20:57, 7 September 2013 (diff | hist) . . (+5,922) . . Maximum flow (in progress)
- 02:06, 7 September 2013 (diff | hist) . . (+2,688) . . N Maximum flow (in progress)
- 05:23, 4 August 2013 (diff | hist) . . (+11,428) . . Dynamic programming
- 01:07, 8 June 2013 (diff | hist) . . (+140) . . Judge:Help (→Summary of supported languages)
- 00:57, 8 June 2013 (diff | hist) . . (-183) . . Judge:Help (→Judge system specifications)
- 00:54, 8 June 2013 (diff | hist) . . (+417) . . Judge:Help (→Summary of supported languages: +C++11)
- 01:26, 22 May 2013 (diff | hist) . . (-20) . . Judge:Free software
- 21:40, 18 May 2013 (diff | hist) . . (+65) . . User:Brian
- 07:47, 18 May 2013 (diff | hist) . . (+10,774) . . N User:Brian/Durak (Created page with "''This version of the rules adapted from Daniel Spivak'' '''Durak''' (Russian: '''дурак''', ''fool'') is a Russian card game played according to the following rules: # Dura...") (current)
- 04:51, 18 May 2013 (diff | hist) . . (+753) . . Canadian Computing Competition
- 04:42, 18 May 2013 (diff | hist) . . (+37) . . N File:CCCStage2Cutoff.png (CCC stage 2 cutoff versus time (year)) (current)
- 18:24, 15 May 2013 (diff | hist) . . (+9,155) . . N Canadian Computing Competition (restored from google cache)
- 03:59, 12 May 2013 (diff | hist) . . (-10,822) . . PEGWiki:Sandbox (Replaced content with "<math>testing\, 123 \, xyz</math>")
- 21:56, 1 November 2012 (diff | hist) . . (-1) . . Judge:TOS (current)
- 19:21, 3 September 2012 (diff | hist) . . (+223) . . Game theory (→Statement of the theorem) (current)
- 18:44, 3 August 2012 (diff | hist) . . (+32) . . N Right half-open interval (Redirected page to Half-open interval) (current)
- 18:31, 3 August 2012 (diff | hist) . . (+42) . . N Extended Eucliean algorithm (moved Extended Eucliean algorithm to Extended Euclidean algorithm: sp.) (current)
- 18:31, 3 August 2012 (diff | hist) . . (0) . . m Extended Euclidean algorithm (moved Extended Eucliean algorithm to Extended Euclidean algorithm: sp.) (current)
- 22:16, 1 August 2012 (diff | hist) . . (+83) . . Shortest Path Faster Algorithm
- 19:59, 1 August 2012 (diff | hist) . . (-482) . . Pointer (→Java, C#, Python, Ruby, etc.) (current)
- 19:43, 1 August 2012 (diff | hist) . . (+448) . . Pointer (→Java, C#, Python, Ruby, etc.)
- 19:03, 31 July 2012 (diff | hist) . . (+97) . . Shunting yard algorithm
- 19:01, 31 July 2012 (diff | hist) . . (+2,871) . . N Shunting yard algorithm/foo.hs (Created page with "<syntaxhighlight lang="haskell"> {- Reference implementation of shunting yard algorithm. Requires: Data.Char, Data.List. This implementation is not error-tolerant; an exception w...") (current)
- 23:30, 23 July 2012 (diff | hist) . . (+3,016) . . Convex hull trick (example contributed by Haidar Abboud)
- 21:43, 23 July 2012 (diff | hist) . . (+1,711) . . N Convex hull trick/commando.cpp (Created page with "<syntaxhighlight lang="cpp"> // The following code for APIO 2010 "Commando" was contributed by Haidar Abboud. #include <cstdio> #include <algorithm> #include <vector> using names...")
- 20:36, 14 July 2012 (diff | hist) . . (0) . . Convex hull trick/acquire.cpp
- 06:25, 7 July 2012 (diff | hist) . . (+107) . . Judge:Help (→Execution discrepancies)
- 03:05, 5 July 2012 (diff | hist) . . (+260) . . Judge:Help (→Compilation discrepancies)
- 19:31, 2 July 2012 (diff | hist) . . (+112) . . Judge:Help
- 19:24, 2 July 2012 (diff | hist) . . (+26) . . m Judge:Help (→Execution discrepancies)
- 21:47, 14 June 2012 (diff | hist) . . (+109) . . Pointer
- 19:37, 11 June 2012 (diff | hist) . . (0) . . Binary heap (→Deletion)
- 19:21, 11 June 2012 (diff | hist) . . (+635) . . Binary heap (→Analysis)
- 23:39, 10 June 2012 (diff | hist) . . (+5,247) . . Longest palindromic subsequence
- 06:15, 1 June 2012 (diff | hist) . . (+59) . . Judge:Writing (→LaTeX) (current)
- 05:50, 1 June 2012 (diff | hist) . . (+3) . . m Judge:Writing (→LaTeX)
- 02:02, 27 May 2012 (diff | hist) . . (-5,705) . . Longest palindromic subsequence (anonymous comment was right: all the math in this article was wrong)
- 02:56, 14 May 2012 (diff | hist) . . (+52) . . Half-open interval (current)
- 02:45, 14 May 2012 (diff | hist) . . (-9) . . m IEEE 754 (→Signed zero) (current)
- 06:09, 3 May 2012 (diff | hist) . . (+465) . . Maximum subvector sum (current)
- 23:45, 19 April 2012 (diff | hist) . . (0) . . m Maximum subvector sum (→Two-dimensional example)
- 23:44, 19 April 2012 (diff | hist) . . (+1,550) . . Maximum subvector sum (→Higher dimensions)
- 23:18, 19 April 2012 (diff | hist) . . (+649) . . Maximum subvector sum (→Implementation (C++))
- 23:02, 19 April 2012 (diff | hist) . . (+632) . . Maximum subvector sum
- 21:21, 19 April 2012 (diff | hist) . . (+4,654) . . Maximum subvector sum
- 20:42, 19 April 2012 (diff | hist) . . (+156) . . m PEG:PEG leaders
- 20:39, 19 April 2012 (diff | hist) . . (0) . . PEGWiki:Current events (Redirected page to PEG:Event calendar 2011/2012) (current)
- 19:36, 18 April 2012 (diff | hist) . . (+811) . . N Maximum subvector sum (Created page with "The '''maximum subvector sum''' problem is that of finding a segment of a vector (array of numbers)<ref>In computer science, ''vector'' is often used to mean ''array of real ...")
- 03:08, 17 April 2012 (diff | hist) . . (+217) . . m Array (current)
- 21:19, 9 April 2012 (diff | hist) . . (+35) . . N Max subvector sum (Redirected page to Maximum subvector sum) (current)
- 18:00, 10 March 2012 (diff | hist) . . (+3,131) . . Change problem
- 16:38, 10 March 2012 (diff | hist) . . (+1,339) . . Dynamic programming (→Optimization example: Change problem)
- 00:13, 10 March 2012 (diff | hist) . . (+6,884) . . N Change problem (Created page with "The ''change-making problem'', often simply known as '''change''', occurs in two distinct but related flavours. Given a set of natural numbers <math>D_1, D_2, ..., D_n</math> (th...")
- 18:58, 6 March 2012 (diff | hist) . . (+28) . . N Change-making problem (Redirected page to Change problem) (current)
- 01:51, 5 March 2012 (diff | hist) . . (+70) . . N Dynamic change (Redirected page to Dynamic programming#Optimization example: Change problem) (current)
- 00:28, 3 March 2012 (diff | hist) . . (+37) . . N Flood fill (Redirected page to Graph search#Flood fill) (current)
- 00:28, 3 March 2012 (diff | hist) . . (+1,270) . . Depth-first search (→Applications) (current)
- 00:02, 3 March 2012 (diff | hist) . . (+1,548) . . Graph search (→Components in graphs)
- 04:37, 2 March 2012 (diff | hist) . . (+239) . . Shunting yard algorithm (→Unary operators)
- 04:03, 2 March 2012 (diff | hist) . . (+304) . . Shunting yard algorithm (→Unary operators)
- 03:46, 2 March 2012 (diff | hist) . . (+111) . . Shunting yard algorithm
- 03:17, 2 March 2012 (diff | hist) . . (+264) . . m Shunting yard algorithm (→Evaluation)
- 23:46, 1 March 2012 (diff | hist) . . (+731) . . PEGWiki:PEGWiki is not an encyclopedia (current)
- 23:40, 1 March 2012 (diff | hist) . . (+14,255) . . N Shunting yard algorithm (Created page with "The '''shunting yard algorithm''' is a simple technique for parsing infix expressions containing binary operators of varying precedence. It was first described by Edsgar Dijk...")
- 23:07, 28 February 2012 (diff | hist) . . (-4) . . Trailing zeroes in factorial (use pointfree style :D) (current)
- 23:05, 28 February 2012 (diff | hist) . . (+31) . . m Trailing zeroes in factorial
- 19:28, 28 February 2012 (diff | hist) . . (+4,970) . . N Trailing zeroes in factorial (Created page with "A well-known programming exercise involves finding the number of trailing zeroes at the end of the decimal representation of <math>n!</math>, for some given value of <math>n</mat...")
- 18:56, 28 February 2012 (diff | hist) . . (+42) . . N Trailing zeros in factorial (Redirected page to Trailing zeroes in factorial) (current)
- 00:58, 28 February 2012 (diff | hist) . . (+50) . . m Judge:Writing (→Problem statements)
- 00:44, 28 February 2012 (diff | hist) . . (+810) . . Judge:Writing
- 18:16, 25 February 2012 (diff | hist) . . (+181) . . Map (current)
- 07:39, 25 February 2012 (diff | hist) . . (+1) . . m User:Brian/Big Two (current)
(newest | oldest) View (newer 100 | older 100) (20 | 50 | 100 | 250 | 500)