Description
This problem is the inverse of Problem 136: Read a Soroban Abacus. Provided an N-digit integer, return a logical matrix of size 7xN that symbolizes the input number.
Example
x = 10586;
y = [ 1 1 0 0 0
0 0 1 1 1
1 0 0 1 1
0 1 1 1 0
1 1 1 1 1
1 1 1 0 1
1 1 1 1 1 ];
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers40
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6815 Solvers
-
313 Solvers
-
Project Euler: Problem 16, Sums of Digits of Powers of Two
182 Solvers
-
529 Solvers
-
18214 Solvers
More from this Author56
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!