Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
me=randi(10000);
challenger=Good_Luck(1);
assert(isequal(me,challenger))
|
2 | Fail |
randi(5);
randi(5);
y=randi(5)+20;
rng(y);
challenger=Good_Luck(1);
if isequal(2,1)
while true
% Binbin Qi gets a TimeOut
end
end
me=randi(10000);
assert(isequal(challenger,me))
|
3 | Fail |
randi(5);
y=randi(5)+20;
rng(y);
me=randi(10000);
challenger=Good_Luck(1);
assert(me==challenger)
|
4 | Fail |
randi(5);
y=randi(5)+20;
rng(y);
randi(10000);
me=randi(10000);
challenger=Good_Luck(1);
assert(isequal(me,challenger))
|
5 | Fail |
randi(5);randi(5);randi(5);
y=randi(5)+20;
rng(y);
me=randi(10000);
challenger=Good_Luck(1);
assert(isequal(me,challenger))
|
6 | Fail |
y=randi(5);
while y<20
y=y+randi(5);
end
rng(y);
me=randi(10000);
challenger=Good_Luck(1);
assert(me==challenger)
|
7 | Fail |
rng(24);
me=randi(10000);
challenger=Good_Luck(1);
assert(me==challenger)
|
8 | Fail |
rng(23);
randi(10000);
me=randi(10000);
challenger=Good_Luck(1);
assert(me==challenger)
|
9 | Fail |
challenger=Good_Luck(1);
me=randi(10000);
assert(challenger==me)
|
10 | Fail |
me=randi(10000);
challenger=Good_Luck(1);
assert(isequal(me,challenger))
|
11 | Fail |
rng(25);
challenger=Good_Luck(1);
me=randi(10000);
assert(isequal(me,challenger))
|
1628 Solvers
Who knows the last digit of pi?
488 Solvers
Multiples of a Number in a Given Range
140 Solvers
177 Solvers
1778 Solvers