Skip to main content

Hexadecimal Number To Decimal Number Using C++ ( With Condition Check)

 => Program :


#include<iostream>

#include<math.h>

using namespace std;


string low2up(string passStr){


string changeStr=passStr;


for(int i=0;i<changeStr.size();i++){


     if(passStr[i]>=97 && passStr[i]<=122)

      {

changeStr[i]=changeStr[i]-32;

      }

}

return changeStr;


}


bool validHexVal(string checkSr){

bool checkValid;

int countNum=0;

for(int i=0;i<checkSr.size();i++){


     if(checkSr[i]>=65 && checkSr[i]<=70)

      {

countNum++;

      }


      if(checkSr[i]>=48 && checkSr[i]<=57){

        countNum++;

      }

}


if(checkSr.size()==countNum){

    return true;

}else{

    return false;

}


}


int main(){

int decNum=0,val;

string hexNum,upperHexNum;

cout<<"Enter the hex decimal number "<<endl;

cin>>hexNum;


upperHexNum=low2up(hexNum);


int n=upperHexNum.size();

if(validHexVal(upperHexNum)){


 for(int i=n-1;i>=0;i--){

    if(upperHexNum[i]>=65 && upperHexNum[i]<=70)

      {

val=char(upperHexNum[i])-55;

      }else{

        val=char(upperHexNum[i])-48;

      }

      decNum=decNum+val*pow(16,n-(i+1));

 }


cout<<"Decimal Value : "<<decNum<<endl;


}else{

   cout<<"Not Valid Hexadecimal Value";

}

}



=> Output:




Comments

Post a Comment

Popular posts from this blog

Sum of Digit is Pallindrome or not

  Sum of Digit is Pallindrome or not Given a number N.Find if the digit sum(or sum of digits) of N is a Palindrome number or not. Note:A Palindrome number is a number which stays the same when reversed.Example- 121,131,7 etc. Example 1: Input: N=56 Output: 1 Explanation: The digit sum of 56 is 5+6=11. Since, 11 is a palindrome number.Thus, answer is 1. Example 2: Input: N=98 Output: 0 Explanation: The digit sum of 98 is 9+8=17. Since 17 is not a palindrome,thus, answer is 0. Your Task: You don't need to read input or print aything.Your Task is to complete the function isDigitSumPalindrome() which takes a number N as input parameter and returns 1 if the Digit sum of N is a palindrome.Otherwise it returns 0. Expected Time Complexi...
Post a Comment
Read more

Menu with 5 option & selected option should appear in text box

Q6. Create a menu with 5 options and selected option should appear in text box. Android Program : Activity_main.xml <?xml version="1.0" encoding="utf-8"?> <RelativeLayout xmlns:android="http://schemas.android.com/apk/res/android"     xmlns:tools="http://schemas.android.com/tools"     android:id="@+id/activity_main"     android:layout_width="match_parent"     android:layout_height="match_parent"     android:paddingBottom="@dimen/activity_vertical_margin"     android:paddingLeft="@dimen/activity_horizontal_margin"     android:paddingRight="@dimen/activity_horizontal_margin"     android:paddingTop="@dimen/activity_vertical_margin"     tools:context="com.kishanhaldar.program6.MainActivity">                 ...
Post a Comment
Read more

Closest Number

Closest Number Basic Accuracy: 11.21% Submissions: 1615 Points: 1 Given non-zero two integers N and M . The problem is to find the number closest to N and divisible by M . If there are more than one such number, then output the one having maximum absolute value .   Example 1: Input: N = 13 , M = 4 Output: 12 Explanation: 12 is the Closest Number to 13 which is divisible by 4. Example 2: Input: N = -15 , M = 6 Output: -18 Explanation: -12 and -18 are both similarly close to -15 and divisible by 6. but -18 has the maximum absolute value. So, Output is -18   Your Task: You don't need to read input or print anyth...
Post a Comment
Read more