diff options
| author | Paulo Custodio <pauloscustodio@gmail.com> | 2021-07-10 19:43:05 +0100 |
|---|---|---|
| committer | Paulo Custodio <pauloscustodio@gmail.com> | 2021-07-10 19:43:05 +0100 |
| commit | fcc8df8cfc14cc4698c01d6c19f9356193a6a43b (patch) | |
| tree | b5f1c0642081acd7e29dd3946122b21ffad78e08 | |
| parent | 8729497975bb0574a19ee760fcfe607824ae65d8 (diff) | |
| download | perlweeklychallenge-club-fcc8df8cfc14cc4698c01d6c19f9356193a6a43b.tar.gz perlweeklychallenge-club-fcc8df8cfc14cc4698c01d6c19f9356193a6a43b.tar.bz2 perlweeklychallenge-club-fcc8df8cfc14cc4698c01d6c19f9356193a6a43b.zip | |
Remove tabs
| -rw-r--r-- | challenge-120/paulo-custodio/brainfuck/ch-1.bfpp | 40 |
1 files changed, 20 insertions, 20 deletions
diff --git a/challenge-120/paulo-custodio/brainfuck/ch-1.bfpp b/challenge-120/paulo-custodio/brainfuck/ch-1.bfpp index c1cdc5b31a..21ad448522 100644 --- a/challenge-120/paulo-custodio/brainfuck/ch-1.bfpp +++ b/challenge-120/paulo-custodio/brainfuck/ch-1.bfpp @@ -1,32 +1,32 @@ ->+> ( result product ) -@INPUT Get ASCII number convert to integer -[ ( result product n ) - >[-]++< Divisor is 2 - ( result product *n 2 ) +>+> ( result product ) +@INPUT Get ASCII number convert to integer +[ ( result product n ) + >[-]++< Divisor is 2 + ( result product *n 2 ) - @DIVMOD ( result product *n/2 n%2 ) + @DIVMOD ( result product *n/2 n%2 ) - >>[-]++< @MULT multiply remainder by 2 + >>[-]++< @MULT multiply remainder by 2 << @DUP3R >> @MULT ( result product n/2 *(n%2)*2*product ) - <<< @DUP4R >>> ( result product n/2 *(n%2)*2*product result ) - @PLUS ( result product n/2 *(n%2)*2*product(plus)result ) - @MOVE3L < ( new_result product *n/2 ) + <<< @DUP4R >>> ( result product n/2 *(n%2)*2*product result ) + @PLUS ( result product n/2 *(n%2)*2*product(plus)result ) + @MOVE3L < ( new_result product *n/2 ) - >[-]++< Divisor is 2 - ( result product *n 2 ) + >[-]++< Divisor is 2 + ( result product *n 2 ) - @DIVMOD ( result product *n/2 n%2 ) + @DIVMOD ( result product *n/2 n%2 ) - > multiply remainder by 1 + > multiply remainder by 1 << @DUP3R >> @MULT ( result product n/2 *(n%2)*2*product ) - <<< @DUP4R >>> ( result product n/2 *(n%2)*2*product result ) - @PLUS ( result product n/2 *(n%2)*2*product(plus)result ) - @MOVE3L < ( new_result product *n/2 ) + <<< @DUP4R >>> ( result product n/2 *(n%2)*2*product result ) + @PLUS ( result product n/2 *(n%2)*2*product(plus)result ) + @MOVE3L < ( new_result product *n/2 ) < @DUP2R >>>[-]++++< ( result product n *product 4 ) - @MULT ( result product n *product*4 ) + @MULT ( result product n *product*4 ) @MOVE2L < -] ( result product *0 ) -<[-]< ( *result ) +] ( result product *0 ) +<[-]< ( *result ) @OUTPUT |