代码搜索：Problem
找到约 10,000 项符合「Problem」的源代码
代码结果 10,000
www.eeworm.com/read/266534/11220713
java bottom.java
// Problem The Bottom of a Graph
// Algorithm Strongly Connected Components, Topological Sort, DFS
// Runtime O(|V|+|E|)
// Author Walter Guttmann
// Date 26.04.2003
import java.io.*;
imp
www.eeworm.com/read/266534/11220753
txt genetic.hs.txt
-- Problem Genetic Code
-- Algorithm Constructive
-- Runtime O(n)
-- Author Walter Guttmann
-- Date 12.03.2003
main :: IO ()
main =
do input
www.eeworm.com/read/266534/11220755
pas assist.pas
(* Problem Assistance Required
** Algorithm Precalculation
** Runtime O(n*l[n])
** Author Walter Guttmann
** Date 16.07.2000
*)
program assist;
const maxl: Longint = 33810;
var f: Text;
www.eeworm.com/read/266534/11220817
txt fractran.hs.txt
-- Problem Fractran
-- Algorithm Simulation
-- Runtime O(n)
-- Author Walter Guttmann
-- Date 2003.09.12
import List;
import Maybe;
main :: IO ()
main =
do input
www.eeworm.com/read/266534/11220822
txt encoding.cc.txt
// Problem Run Length Encoding
// Algorithm Straight-Forward
// Runtime O(n)
// Author Walter Guttmann
// Date 2003.12.07
#include
#include
#include
using n
www.eeworm.com/read/266534/11220833
txt boole.cc.txt
// Problem Boolean Logic
// Algorithm Parser, Brute-Force
// Runtime O(2^n)
// Author Walter Guttmann
// Date 13.07.2003
#include
#include
#include
#include
www.eeworm.com/read/266534/11220835
txt heap.cc.txt
// Problem Binary Search Heap Construction
// Algorithm Order-Statistic Trees
// Runtime O(n*log(n))
// Author Walter Guttmann
// Date 2004.04.08
#include
#include
#in
www.eeworm.com/read/266529/11221247
java ambiguous.java
// Problem Ambiguous Permutations
// Algorithm straight-forward
// Runtime O(n)
// Author Adrian Kuegel
// Date 2005.06.14
import java.io.*;
public class ambiguous {
public sta
www.eeworm.com/read/249828/12468680
txt perfect ogl flashhack.txt
This one checks for fullscreen of color white before it removes it if its not fullscreen the white color it detects then it dosen't remove it, this does so you won't have the problem of not being able
www.eeworm.com/read/147693/12538510
pl fig4_11.pl
% Figure 4.11 Program 3 for the eight queens problem.
% solution( Ylist) if
% Ylist is a list of Y-coordinates of eight non-attacking queens
solution( Ylist) :-
sol( Ylist,