代码搜索：OUT
找到约 10,000 项符合「OUT」的源代码
代码结果 10,000
www.eeworm.com/read/201477/15407645
out bclique.out
enter number of edges of 7 vertex graph
enter edge 1
enter edge 2
enter edge 3
enter edge 4
enter edge 5
enter edge 6
enter edge 7
enter edge 8
enter edge 9
enter edge 10
Size of max clique
www.eeworm.com/read/201477/15407652
out dknap.out
Optimal value is 15
Rest of table is
0 0 3 3 6 6 9 9 9 10 11
0 0 0 0 6 6 6 6 6 10 11
0 0 0 0 6 6 6 6 6 10 10
0 0 0 0 6 6 6 6 6 6 6
1 1 0 0 1
www.eeworm.com/read/201477/15407653
out bestfit.out
Enter number of objects and bin capacity
Enter space requirement of object 1
Enter space requirement of object 2
Enter space requirement of object 3
Enter space requirement of object 4
Enter spac
www.eeworm.com/read/201477/15407664
out roots.out
There are two real roots 3 and 2
There is only one distinct root 4
The roots are complex
The real part is -1
The imaginary part is 2
Bad input. a is zero.
www.eeworm.com/read/201477/15407665
out awgraph.out
Edges = 0
The graph is
100 3 2 4
3 100 5 1
2 5 100 100
4 1 100 100
The graph after deleting (1,2) is
100 100 2 4
100 100 5 1
2 5 100 100
4 1 100 100
Exist(3,1) = 1
Degree(3) = 2
D
www.eeworm.com/read/201477/15407680
out wire.out
Enter grid size
Enter start
Enter finish
Enter wiring grid
The wire path is
42
52
53
54
64
65
66
56
46
www.eeworm.com/read/201477/15407697
out winner.out
Enter number of players, between 8 and 20
Enter player values
The winner tree is
size = 10 LowExt = 4 Offset = 15
Winner tree pointers are
10 3 10 3 5 8 10 1 3
Changed player 2 to zero, new tre
www.eeworm.com/read/201477/15407713
out paren.out
Type an expression of length at most 100
The pairs of matching parentheses in
(d+(a+b)*c*(d+e)-f))(()
are
4 8
12 16
1 19
No match for right parenthesis at 20
22 23
No match for left parenthes