代码搜索:Problem

找到约 10,000 项符合「Problem」的源代码

代码结果 10,000
www.eeworm.com/read/266537/11220237

c compromise.c

/* Contest : Ulm Local Contest 1997 * Problem C : Compromise * Method : Dynamic Programming * Author : Mark Dettinger * Date : June 3, 1997 */ #include #include
www.eeworm.com/read/266537/11220239

c addition.c

/* Contest : Ulm Local Contest 1997 * Problem A : Addition Chains * Method : Backtracking * Author : Mark Dettinger * Date : June 22, 1997 */ #include #include
www.eeworm.com/read/266537/11220248

c frogger1.c

/* Contest : Ulm Local Contest 1997 * Problem F : Frogger * Method : Floyd-Warshall with MAX instead of + * Complexity : O(n^3) * Author : Mark Dettinger * Date : June 13, 199
www.eeworm.com/read/266537/11220250

c frogger2.c

/* Contest : Ulm Local Contest 1997 * Problem F : Frogger * Method : Kruskal Algorithm * Complexity : O(n^2 log n) * Author : Mark Dettinger * Date : June 13, 1997 */ #inclu
www.eeworm.com/read/266535/11220447

c average.c

// Problem Average is not Fast Enough! // Algorithm Straight-Forward // Runtime O(n) // Author Marc Meister // Date 08.06.2001 #include #include #define A(x) (x-'0')
www.eeworm.com/read/266535/11220631

hs allinall.hs

-- Problem All in All -- Algorithm Greedy -- Runtime O(n) -- Author Walter Guttmann -- Date 26.12.2001 main :: IO () main = do input
www.eeworm.com/read/266534/11220712

txt assist.hs.txt

-- Problem Assistance Required -- Algorithm Recursion -- Runtime O(n*l(n)) where l(n) is the number of lucky numbers
www.eeworm.com/read/266534/11220725

txt contest.cc.txt

// Problem Fixed Partition Contest Management // Algorithm Brute Force // Runtime O(m^n*n^2) // Author Walter Guttmann // Date 22.02.2003 #include #include #include
www.eeworm.com/read/266534/11220737

txt edge.hs.txt

-- Problem Edge -- Algorithm Straight-Forward -- Runtime O(n) -- Author Walter Guttmann -- Date 05.01.2003 import Complex; import Monad; type Comp = Complex Double main :: IO () main =
www.eeworm.com/read/266534/11220743

pas genetic.pas

(* Problem Genetic Code ** Algorithm Backtracking ** Runtime O(3^n) ** Author Walter Guttmann ** Date 12.03.2003 *) program genetic; var f: Text; s: array [0..8191] of Char; i, n