Problem 2496. Unusual Concatenations

Solution 2031724

Submitted on 22 Nov 2019 by Athi

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test	Status	Code Input and Output
1	Pass	n = 1233; b_correct = 1; assert(isequal(isUnusual(n),b_correct))
2	Pass	n = 1729; b_correct = 0; assert(isequal(isUnusual(n),b_correct))
3	Pass	n = 8833; b_correct = 1; assert(isequal(isUnusual(n),b_correct))
4	Pass	n = 990100; b_correct = 1; assert(isequal(isUnusual(n),b_correct))
5	Pass	n = 299800; b_correct = 0; assert(isequal(isUnusual(n),b_correct))
6	Pass	n = 94122353; b_correct = 1; assert(isequal(isUnusual(n),b_correct))
7	Pass	n = 31415926; b_correct = 0; assert(isequal(isUnusual(n),b_correct))
8	Pass	n = 1765038125; b_correct = 1; assert(isequal(isUnusual(n),b_correct))
9	Pass	n = 3141592653; b_correct = 0; assert(isequal(isUnusual(n),b_correct))
10	Pass	n = 116788321168; b_correct = 1; assert(isequal(isUnusual(n),b_correct))
11	Pass	n = 271828182845; b_correct = 0; assert(isequal(isUnusual(n),b_correct))
12	Pass	n = 92318202663025; b_correct = 1; assert(isequal(isUnusual(n),b_correct))
13	Pass	n = 15348303604525; b_correct = 1; assert(isequal(isUnusual(n),b_correct))