C_Programs/ASS2.C at main · kopaldeep/C_Programs · GitHub

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
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#include<stdio.h>
#include<conio.h>
#include<string.h>
void main(){
char bin[25];
int len,oct=0,i=0,code=0;
clrscr();
printf("Enter a binary number:\t");
gets(bin);
len=strlen(bin);
if(len%3==1){
if(bin[0]=='0'){
oct=0;
i++;}
else if(bin[0]=='1'){
oct=1;
i++;
}
}
else if(len%3==2){
if(bin[0]=='0' && bin[i++]=='0'){
oct=0;
i=2;}
if(bin[0]=='0' && bin[i++]=='1'){
oct=1;
i=2;}
if(bin[0]=='1' && bin[i++]=='0'){
oct=2;
i=2;}
if(bin[0]=='1' && bin[i++]=='1'){
oct=3;
//i=2;
}
}
//printf("\n%d\n",i);
while(bin[i]!='\0'){
code=(bin[i++]*100)+(bin[i++]*10)+bin[i++];
printf("%d",code);
switch(code){
case 0:
oct=oct*10+0;
break;
case 1:
oct=oct*10+1;
break;
case 10:
oct=oct*10+2;
break;
case 11:
oct=oct*10+3;
break;
case 100:
oct=oct*10+4;
break;
case 101:
oct=oct*10+5;
break;
case 110:
oct=oct*10+6;
break;
case 111:
oct=oct*10+7;
break;
}
}
printf("%d",oct);
getch();
}