Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
dependencies = [
0 0
1 0
];
order = calculation_order(dependencies);
order_correct = [ 1 2 ];
assert(isequal(order_correct,order));
row1 =
0
depen =
0 0
1 0
row1 =
0
depen =
0 0
0 1
|
2 | Fail |
dependencies = [
0 1 0 0 0
0 0 0 0 0
1 0 0 1 0
1 0 0 0 0
1 1 1 1 0
];
order = calculation_order(dependencies);
order_correct = [ 2 1 4 3 5 ];
assert(isequal(order_correct,order));
row1 =
0
depen =
1 0 0 0 0
0 0 0 0 0
0 1 0 1 0
0 1 0 0 0
1 1 1 1 0
row1 =
0
depen =
1 0 0 0 0
0 0 0 0 0
0 1 0 1 0
0 1 0 0 0
1 1 1 1 0
row1 =
0
depen =
1 0 0 0 0
0 0 0 0 0
0 0 1 1 0
0 0 1 0 0
1 1 1 1 0
row1 =
0
depen =
1 0 0 0 0
0 0 0 0 0
0 1 1 0 0
0 0 1 0 0
1 1 1 1 0
row1 =
0
depen =
1 0 0 0 0
0 0 0 0 0
0 0 1 0 1
0 0 1 0 0
1 0 1 1 1
|
3 | Fail |
dependencies = [
0 1 1 1 1
0 0 1 1 1
0 0 0 1 1
0 0 0 0 1
0 0 0 0 0
];
order = calculation_order(dependencies);
ordered = dependencies(order,order);
assert(~nnz(triu(ordered-diag(diag(ordered)))));
row1 =
0
depen =
1 1 1 1 0
1 0 1 1 0
1 0 0 1 0
1 0 0 0 0
0 0 0 0 0
row1 =
0
depen =
1 0 1 1 1
1 0 1 1 0
1 0 0 1 0
1 0 0 0 0
0 0 0 0 0
row1 =
0
depen =
1 0 1 1 1
1 0 0 1 1
1 0 0 1 0
1 0 0 0 0
0 0 0 0 0
row1 =
0
depen =
1 0 1 1 1
1 0 0 1 1
1 0 0 0 1
1 0 0 0 0
0 0 0 0 0
row1 =
0
depen =
1 0 1 1 1
1 0 0 1 1
1 0 0 0 1
1 0 0 0 0
0 0 0 0 0
|
4 | Fail |
dependencies_ = tril(randi(2,10)-1);
dependencies_ = dependencies_-diag(diag(dependencies_));
order_ = randperm(size(dependencies_,1));
dependencies = dependencies_(order_,order_);
clear order_;
order = calculation_order(dependencies);
% [~,order] = sort(order_);
assert(~nnz(triu(dependencies(order,order))));
row1 =
0
depen =
1 0 1 0 1 0 0 0 0 0
0 0 0 0 1 0 0 0 0 0
1 0 0 0 0 0 0 0 1 0
0 1 1 0 1 0 0 1 0 0
1 0 0 0 0 0 0 0 0 0
1 0 1 1 1 0 0 1 1 1
0 0 0 0 0 0 0 0 0 0
1 1 1 0 1 0 0 0 0 0
1 0 0 0 1 0 0 0 0 0
1 0 1 1 0 0 1 0 1 0
row1 =
0
depen =
1 0 1 0 1 0 0 0 0 0
0 0 0 0 1 0 0 0 0 0
1 0 0 0 0 0 0 0 1 0
0 0 1 0 1 0 1 1 0 0
1 0 0 0 0 0 0 0 0 0
1 0 1 1 1 0 0 1 1 1
0 0 0 0 0 0 0 0 0 0
1 0 1 0 1 0 1 0 0 0
1 0 0 0 1 0 0 0 0 0
1 1 1 1 0 0 0 0 1 0
row1 =
0
depen =
1 0 0 0 1 0 1 0 0 0
0 0 0 0 1 0 0 0 0 0
1 0 0 0 0 0 0 0 1 0
0 0 1 0 1 0 1 1 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 1 1 0 1 1 1 1
0 0 0 0 0 0 0 0 0 0
1 0 1 0 1 0 1 0 0 0
1 0 0 0 1 0 0 0 0 0
1 1 0 1 0 0 1 0 1 0
row1 =
0
depen =
1 0 0 1 1 0 0 0 0 0
0 0 0 0 1 0 0 0 0 0
1 0 0 0 0 0 0 0 1 0
0 0 1 1 1 0 0 1 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 1 1 0 1 1 1 1
0 0 0 0 0 0 0 0 0 0
1 0 1 1 1 0 0 0 0 0
1 0 0 0 1 0 0 0 0 0
1 1 0 1 0 0 1 0 1 0
row1 =
0
depen =
1 0 0 1 0 0 1 0 0 0
0 0 0 0 0 0 1 0 0 0
1 0 0 0 0 0 0 0 1 0
0 0 1 1 0 0 1 1 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 1 1 0 1 1 1 1
0 0 0 0 0 0 0 0 0 0
1 0 1 1 0 0 1 0 0 0
1 0 0 0 0 0 1 0 0 0
1 1 0 1 1 0 0 0 1 0
row1 =
0
depen =
1 0 0 1 0 1 0 0 0 0
0 0 0 0 0 1 0 0 0 0
1 0 0 0 0 0 0 0 1 0
0 0 1 1 0 1 0 1 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 1 1 1 0 1 1 1
0 0 0 0 0 0 0 0 0 0
1 0 1 1 0 1 0 0 0 0
1 0 0 0 0 1 0 0 0 0
1 1 0 1 1 0 0 0 1 0
row1 =
0
depen =
1 0 0 1 0 1 0 0 0 0
0 0 0 0 0 1 0 0 0 0
1 0 0 0 0 0 0 0 1 0
0 0 1 1 0 1 0 1 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 1 1 1 0 1 1 1
0 0 0 0 0 0 0 0 0 0
1 0 1 1 0 1 0 0 0 0
1 0 0 0 0 1 0 0 0 0
1 1 0 1 1 0 0 0 1 0
row1 =
0
depen =
1 0 0 1 0 1 0 0 0 0
0 0 0 0 0 1 0 0 0 0
1 0 0 0 0 0 0 0 1 0
0 0 1 1 0 1 1 0 0 0
1 0 0 0 0 0 0 0 0 0
1 0 0 1 1 1 1 0 1 1
0 0 0 0 0 0 0 0 0 0
1 0 1 1 0 1 0 0 0 0
1 0 0 0 0 1 0 0 0 0
1 1 0 1 1 0 0 0 1 0
row1 =
0
depen =
1 0 0 1 0 1 0 0 0 0
0 0 0 0 0 1 0 0 0 0
1 0 0 0 0 0 1 0 0 0
0 0 1 1 0 1 0 0 1 0
1 0 0 0 0 0 0 0 0 0
1 0 0 1 1 1 1 0 1 1
0 0 0 0 0 0 0 0 0 0
1 0 1 1 0 1 0 0 0 0
1 0 0 0 0 1 0 0 0 0
1 1 0 1 1 0 1 0 0 0
row1 =
0
depen =
1 0 0 1 0 1 0 0 0 0
0 0 0 0 0 1 0 0 0 0
1 0 0 0 0 0 0 0 0 1
0 0 1 1 0 1 0 0 1 0
1 0 0 0 0 0 0 0 0 0
1 0 0 1 1 1 1 0 1 1
0 0 0 0 0 0 0 0 0 0
1 0 1 1 0 1 0 0 0 0
1 0 0 0 0 1 0 0 0 0
1 1 0 1 1 0 0 0 0 1
|
5 | Fail |
dependencies_ = randi(2,10)-1;
dependencies_ = dependencies_-triu(dependencies_);
order_ = randperm(size(dependencies_,1));
dependencies = dependencies_(order_,order_);
clear order_; % to prevent the evalin hack
order = calculation_order(dependencies);
% [~,order] = sort(order_);
assert(~nnz(triu(dependencies(order,order))));
row1 =
0 0
|
6 | Fail |
% n = 10;
% dependencies_ = tril(randi(3,n)>1|diag(ones(1,n-1),-1))&~eye(n);
% order_ = randperm(n);
% dependencies = dependencies_(order_,order_);
dependencies = [
0 1 1 0 1 0 0 0 0 1
0 0 0 0 1 0 0 0 0 1
0 1 0 0 1 0 0 0 0 1
1 0 1 0 1 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 1
1 1 1 0 0 0 0 1 1 1
1 1 0 0 1 0 0 0 0 1
1 1 1 1 0 1 0 1 0 1
0 0 0 0 1 0 0 0 0 0
];
order = calculation_order(dependencies);
% [~,order_correct] = sort(order_);
order_correct = [ 5 10 2 3 1 8 6 4 9 7 ];
assert(isequal(order,order_correct));
row1 =
0
depen =
1 1 1 0 0 0 0 0 0 1
1 0 0 0 0 0 0 0 0 1
1 1 0 0 0 0 0 0 0 1
1 0 1 0 1 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 1
0 1 1 0 1 0 0 1 1 1
1 1 0 0 1 0 0 0 0 1
0 1 1 1 1 1 0 1 0 1
1 0 0 0 0 0 0 0 0 0
row1 =
0
depen =
1 0 1 0 1 0 0 0 0 1
1 0 0 0 0 0 0 0 0 1
1 0 0 0 1 0 0 0 0 1
1 1 1 0 0 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 1
0 1 1 0 1 0 0 1 1 1
1 1 0 0 1 0 0 0 0 1
0 1 1 1 1 1 0 1 0 1
1 0 0 0 0 0 0 0 0 0
row1 =
0
depen =
1 0 1 0 1 0 0 0 0 1
1 0 0 0 0 0 0 0 0 1
1 0 1 0 0 0 0 0 0 1
1 1 0 0 1 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 1
0 1 1 0 1 0 0 1 1 1
1 1 1 0 0 0 0 0 0 1
0 1 1 1 1 1 0 1 0 1
1 0 0 0 0 0 0 0 0 0
row1 =
0
depen =
1 0 1 1 0 0 0 0 0 1
1 0 0 0 0 0 0 0 0 1
1 0 1 0 0 0 0 0 0 1
1 1 0 1 0 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 1
0 1 1 1 0 0 0 1 1 1
1 1 1 0 0 0 0 0 0 1
0 1 1 1 1 1 0 1 0 1
1 0 0 0 0 0 0 0 0 0
row1 =
0
depen =
1 0 1 1 0 0 0 0 0 1
1 0 0 0 0 0 0 0 0 1
1 0 1 0 0 0 0 0 0 1
1 1 0 1 0 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 1
0 1 1 1 0 0 0 1 1 1
1 1 1 0 0 0 0 0 0 1
0 1 1 1 1 1 0 1 0 1
1 0 0 0 0 0 0 0 0 0
row1 =
0
depen =
1 0 1 1 0 0 0 0 0 1
1 0 0 0 0 0 0 0 0 1
1 0 1 0 0 0 0 0 0 1
1 1 0 1 1 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 1
0 1 1 1 0 0 0 1 1 1
1 1 1 0 0 0 0 0 0 1
0 1 1 1 1 1 0 1 0 1
1 0 0 0 0 0 0 0 0 0
row1 =
0
depen =
1 0 1 1 0 0 0 0 0 1
1 0 0 0 0 0 0 0 0 1
1 0 1 0 0 0 0 0 0 1
1 1 0 1 0 0 1 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 0 1
0 1 1 1 0 0 0 1 1 1
1 1 1 0 0 0 0 0 0 1
0 1 1 1 0 1 1 1 0 1
1 0 0 0 0 0 0 0 0 0
row1 =
0
depen =
1 0 1 1 0 0 0 0 0 1
1 0 0 0 0 0 0 0 0 1
1 0 1 0 0 0 0 0 0 1
1 1 0 1 0 0 1 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 1 0 0 0 0 1
0 1 1 1 1 0 0 0 1 1
1 1 1 0 0 0 0 0 0 1
0 1 1 1 1 1 1 0 0 1
1 0 0 0 0 0 0 0 0 0
row1 =
0
depen =
1 0 1 1 0 0 0 0 0 1
1 0 0 0 0 0 0 0 0 1
1 0 1 0 0 0 0 0 0 1
1 1 0 1 0 0 1 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 1 1
0 1 1 1 1 0 0 0 1 1
1 1 1 0 0 0 0 0 0 1
0 1 1 1 0 1 1 0 1 1
1 0 0 0 0 0 0 0 0 0
row1 =
0
depen =
1 0 1 1 1 0 0 0 0 0
1 0 0 0 1 0 0 0 0 0
1 0 1 0 1 0 0 0 0 0
1 1 0 1 0 0 1 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 1 0 0 0 1 0
0 1 1 1 1 0 0 0 1 1
1 1 1 0 1 0 0 0 0 0
0 1 1 1 1 1 1 0 1 0
1 0 0 0 0 0 0 0 0 0
|
28006 Solvers
Count from 0 to N^M in base N.
220 Solvers
495 Solvers
How many trades represent all the profit?
520 Solvers
309 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!