shuffle([0, 0, 1]) laenamine[0] laenamine[1] laenamine[2] randRange( 2, 9 ) randRangeWeighted( 1, 9, 1, 0.2 ) - over_hundreds randRangeWeighted( 1, 9, 1, 0.2 ) - over_tens randRange( 1, 9 ) - over_ones 1000 * A_1000 + 100 * A_100 + 10 * A_10 + A_1 randRange( 0, A_1000 - 1 ) over_hundreds * randRange( A_100 + 1, 9 ) + (1 - over_hundreds) * randRange( 0, A_100 - 1 ) over_tens * randRange( A_10 + 1, 9 ) + (1 - over_tens) * randRange( 0, A_10 - 1 ) over_ones * randRange( A_1 + 1, 9 ) + (1 - over_ones) * randRange( 0, A_1 - 1 ) 1000 * B_1000 + 100 * B_100 + 10 * B_10 + B_1 []
graph.subtractor = new Subtractor( A, B ); graph.subtractor.show(); DUMMY = Array( graph.subtractor.getNumHints() );
A - B
graph.subtractor.showHint();
(sulge)
ülesanne Selline on ülesanne alusta selle lahendamist.
Vajad abi? Vaata vihjet. See tegevus nullib sinu praegused punktid!
 
Tagasiside