代码搜索：Problem
找到约 10,000 项符合「Problem」的源代码
代码结果 10,000
www.eeworm.com/read/266537/11220116
c babylon_graph.c
/* University of Ulm Programming Contest 1996
Problem B: The Tower of Babylon
Implementation: Mark Dettinger
Alternative Solution */
#include
#define oo 1000000000
#define max(a,b
www.eeworm.com/read/266537/11220242
c frogger3.c
/* Contest : Ulm Local Contest 1997
* Problem F : Frogger
* Method : Variant of Prim's (or Dijkstra's) Algorithm
* Complexity : O(n^2)
* Author : Mark Dettinger
* Date : June
www.eeworm.com/read/266535/11220361
cc equidist.cc
// Problem Equidistance
// Algorithm 3D-Geometry
// Runtime O(n^2)
// Author Walter Guttmann
// Date 26.04.2000
#include
#include
#include
ifstream in ("equidi
www.eeworm.com/read/266535/11220365
cc bead.cc
// Problem Let it Bead
// Algorithm Brute Force, Generating Group of Movements
// Runtime O(c^s * s^2)
// Author Walter Guttmann
// Date 24.11.1999
#include
#include
www.eeworm.com/read/266535/11220443
cc code.cc
// Problem Code the Tree
// Algorithm Recursive Descent Parser, Priority Queue, Adjacency Sets
// Runtime O(n*log(n))
// Author Walter Guttmann
// Date 09.05.2001
#include
#incl
www.eeworm.com/read/266535/11220448
cc fiber.cc
// Problem Fiber Network
// Algorithm Floyd-Warshall, Transitive Hull, Bit Encoding
// Runtime O(n^3)
// Author Walter Guttmann
// Date 10.05.2001
#include
#include
#in
www.eeworm.com/read/266535/11220450
cc bound.cc
// Problem Bound Found
// Algorithm Partial Sums, Sort, Two Pointers
// Runtime O(n*log(n))
// Author Walter Guttmann
// Date 16.10.1999
#include
#include
#include
www.eeworm.com/read/266535/11220615
hs fractal.hs
-- Problem The Sierpinski Fractal
-- Algorithm Recursion
-- Runtime O(n^2)
-- Author Walter Guttmann
-- Date 27.12.2001
import List;
main :: IO ()
main =
do input
www.eeworm.com/read/266535/11220617
hs grid.hs
-- Problem Paths on a Grid
-- Algorithm Binomial Coefficients
-- Runtime O(n)
-- Author Walter Guttmann
-- Date 26.12.2001
main :: IO ()
main =
do input
www.eeworm.com/read/266535/11220638
java fractal.java
// Problem The Sierpinski Fractal
// Algorithm Recursion
// Runtime O(n^2)
// Author Walter Guttmann
// Date 30.12.2001
import java.io.*;
public class fractal {
static void recurse (in