Joined
Last Seen
0 Reputation Points
Unknown Quality Score
No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
0 Endorsements
Ranked #107.40K
|
#include<stdio.h> #include<stdio.h> #include<conio.h> #include<math.h> void mergeSort(int arr[],int low,int mid,int high); void partition(int arr[],int low,int high); int decimal_binary(int); int main() { int count=0,k,d[10],c[10],b[10][10],a[10],i,sum=0,n,no,j; printf("Enter the number of binary numbers"); scanf("%d",&no); printf("Enter the binary number"); for(i=0;i<no;i++) scanf("%d",&a[i]); for(i=0;i<no;i++) { n=a[i]; for(j=0;j<4;j++) { b[i][j]=n%10; n=n/10; } } for(i=0;i<no;i++) { for(j=0;j<4;j++) { if(b[i][j]==1) sum=sum+pow(2,j); …
|