OCTAL TO DECIMAL CONVERSION

-

Consider the following I/O samples.




SAMPLE INPUT : 32

SAMPLE OUTPUT:  26




C PROGRAM:

#include <stdio.h>
int main()
{
    long int n, base=1, rem, ans=0;
    scanf("%ld",&n);
    while(n)
    {
        rem=n%10;
        ans=ans+rem*base;
        base=base*8;
        n=n/10;
    }
    printf("%ld",ans);
    return 0;
}

 


OUTPUT:

 



  
The given source code in C program is short and simple to understand. The source code is well tested in DEV-C++ and is completely error free. 
If you have any feedback about this article and want to improve this, please comment in the comment section.

 

Comments

Post a Comment

Popular posts from this blog

C PROGRAM FOR Mth LARGEST AND Mth SMALLEST ELEMENT IN AN ARRAY

-
Image
    Consider the following I/O samples. SAMPLE INPUT:  6                                   2 4 5 1 6 3                                     2 SAMPLE OUTPUT:   5     //2nd largest element                                          2     //2nd smallest element The algorithm used here is : Input the number of elements. Input the array elements. Input the Mth value. Sort the array. Print the output for Mth largest and Mth Smallest. C PROGRAM:    #include<stdio.h> int main() { int n,a[100],i,j,m,temp; printf("Enter the number of elements:");      scanf("%d",&n); printf("Enter the array ele...
Read more

TRIANGULAR NUMBER OR NOT

-
Image
Consider the following I/O samples. SAMPLE INPUT:  10 SAMPLE OUTPUT:   TRIANGULAR NUMBER The  TRIANGULAR NUMBER  sequence is the representation of the  numbers  in the  form of equilateral  triangle  arranged in a series or sequence. These  numbers  are in a   sequence of 1, 3, 6, 10, 15, 21, 28, 36, 45, and so on.                   C PROGRAM: #include <stdio.h> int main() {      int num,i,flag=0;     scanf("%d",&num);     for(i=1;i<=num/2+1;i++)     {         if((i*(i+1))/2 == num)                  {                          flag=1;                          break;                  ...
Read more

C PROGRAM TO CHECK BALANCED PARENTHESIS - ( { [

-
Image
Consider the following I/O samples. SAMPLE INPUT 1:  [ { ( )  } ]             SAMPLE OUTPUT 1 :   VALID         SAMPLE INPUT 2:  [ { ] } SAMPLE OUTPUT 1 :   INVALID   C PROGRAM: #include<stdio.h> #include<string.h> #define N 100 char stack[N]; int i=-1; //push parenthesis into stack void push(char data)                 {     i++;     if(i>=N)         printf("Stack is full");     else         stack[i]=data; } //pop parenthesis out from the stack void pop() {     if(i == -1)         printf("Cannot remove");     else         i--; } char top() {     return stack[i]; } int empty() {     if(i == -1)         return 1;  // stack empty     else     ...
Read more