C
c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
// Created by Alby
/*
Fibbinary numbers are integers whose binary representation contains no consecutive ones
*/
#include <stdio.h>
int conversion();
int main() {
int n = conversion();
if((n & (n >> 1)) == 0) {
printf("%d is a Fibbinary Number", n);
} else {
printf("%d is Not a Fibbinary Number", n);
}
return 0;
}
int conversion() {
int a[10], number, i, n;
printf("Please enter the number that you want to convert: = ");
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run