Question

(c++) Write a program that converts a positive integer into the Roman number system.(c++)

Roman numbers. Write a program that converts a positive integer into the Roman number system. The Roman number system has digits

I 1
V 5
X 10
L 50
C 100
D 500
M 1,000

Numbers are formed according to the following rules. (1) Only numbers up to 3,999 are represented. (2) As in the decimal system, the thousands, hundreds, tens, and ones are expressed separately. (3) The numbers 1 to 9 are expressed as

I 1
II 2
III 3
IV 4
V 5
VI 6
VII 7
VIII 8
IX 9

As you can see, a I preceding a V or X is subtracted from the value, and you can never have more than three I’s in a row. (4) Tens and hundreds are done the same way, except that the letters X, L, C and C, D, M are used instead of I and V, X, respectively.

Your program should take an input, such as 1978, and convert it to Roman numerals, MCMLXXVIII.

code

#include <iostream>
#include <string>
using namespace std;
int main()
{
//ask user to input num to convert

//if num is less than 0
{
cout << "Your number must be greater than zero.";
return 1;
}

string roman = "";

int digit = num / 1000;

//if digit is equal to three
{
roman = "MMM";
}
else if (...)
{
roman = "MM";
}
else if (...)   
{   
roman = "M";
}
num = num % 1000;
digit = num / 100;

if (digit == 9)
{
roman = ...
}
else if (digit == 4)
{
roman = ...
}
else
{
if (digit >= 5)
{
roman = roman + "D";
digit = digit - 5;
}
if (digit == 3)
{
roman = ...;
}
else if (digit == 2)
{
roman = ...;
}
else if (digit == 1)
{
roman = ...;
}
}   
num = num % 100;   
digit = num / 10;

if (digit == 9)
{
roman = roman + "XC";
}
else if (digit == 4)
{
roman = ...;
}
else
{
if (digit >= 5)
{
roman = ...;
digit = ...;
}
if (digit == 3)
{
roman = ...;
}
else if (digit == 2)
{
roman = ...;
}
else if (digit == 1)
{
roman = ...;
}
}   
digit = num % 10;   
if (digit == 9)
{
roman = ...;
}
else if (digit == 4)
{
roman =...;
}
else
{
if (digit >= 5)
{
roman = ...;
digit = ...;
}
if (digit == 3)
{
roman = ...;
}
else if (digit == 2)
{
roman = ...;
}
else if (digit == 1)
{
roman = ...;
}
}   
//print results
//return 0
}

Answer 1

main.cpp 1 // Program to convert integer number to romanNumeral numerals 2 3 #include iostream» 4 #include <string> 5 using namespace std; 6 7 // Function to convert decimal to Roman Numerals 8 void convertDecimalToRoman (int number) //the originalnumber variable is used to take a backup of the number int originalnumber number; 10 12 13 14 15 16 17 18 19 //counter is used to repeat a char, a specific number of times // if 300, counter wilL have value 3 and the char 'C' is repeated thrice int counter // index holds the index of the character to be inserted to char array /finally, index will specify the total number of characters in the /roman numeral int index-0; 21 //the character array used to hold the converted roman numeral char romanNumeral[30]; // CONVERSİON OF THOUSANDTH DIGIT // //first the number is divided by 1000, to get the thousandth digit // if number is 3544, counter will be 3 counter-number/1000; //the below Loop will put char 'M" three times into the array // every time, after assigning the character, index value gets incremented 27 30

//by 1 ( postincrement) pointing the Location for the next array element for(int i-1; i<-counter;i++)1 31 romanNumeral [index++]M' 36 37 38 //As the thousandth digit coversion is over, the remaining three digits //are taken using remainder operation // if number is 3544, number now will become 544 number number%1000; 40 41 42 //the three digit number is divided by 900, to know if the hundredth digit /is 9. Counter will be 1 if the digit is 9 and character CM are added //to the array. counter-number/900 for(int i-1; 1< counter ;i++){ 46 47 48 49 50 51 52 53 54 romanNumeral[index+]-'C' romanNumeral[index++]-'M'; // if number is Less than 900, say 899, number%900 will give 899 // which is the next number to be converted number number%900 56 57 58 // when the three digit number is divided by 500, counter will be either //1 or zero, to find if the char D for the number 500 to be added //to the array counter-number/500 // if counter is 1, then the hunderdth digit is 5 and so D is added

for(int i-1; i<-counter;i++)1 59 60 61 romanNumeral[index+]-'D // the remainder is calculated to get the number which is Less than 500 number-number%500; 64 65 //the number is divided by 400 to see if the hunderdth digit is 4 // if it is 4, then counter will be 1 and C D characters are added for 400 counter-number/400 for(int i-l; 1〈 counter ;i++){ 67 68 69 70 71 72 73 romanNumeral[index+]-'C' romanNumeral[index+]-'D //the remainder is calculated to get the number which is less than 400 number number%400 //the number is divided by 100 to see if the hunderdth digit is between // 1 and 3, to print the char C, the specific number of times // if quotient is 2, then counter will be 2 and C character is added for 200 counter-number/100 for(int i-1; i〈-counter ;i++){ 76 78 79 80 81 romanNumeral[index+]-'C' // the remainder is calculated to get the number which is Less than 100 number-number%100; 84 85 86 87 the two digit number is divided by 90, to know if the tenth digit

/is 9. Counter will be 1 if the digit is 9 and characters X C are added //to the array. counter-number/90; for(int i-l; 1< counter ;i++){ 89 90 91 92 93 94 95 96 97 98 romanNumeral[index+]-'X'; romanNumeral[index+]-'C' // if number is Less than 90, say 89, number%90 will give 89 // which is the next number to be converted number number%90 // when the two digit number is divided by 5e, counter will be either //1 or zero, to find if the char L for the number 50 to be added //to the array counter-number/50; for(int i-l; 1< counter ;i++){ 100 101 102 103 104 105 106 107 108 109 110 romanNumeral[index+]-'L' /the remainder is calculated to get the number which is less than 50 number number%50 the number is divided by 40 to see if the tenth digit is 4 // if it is 4, then counter will be 1 and X L characters are added for 40 counter-number/48; for(int i-l; 1〈 counter ;i++){ 112 113 114 115 romanNumeral[index++]-'X; romanNumeral[index+]-'L'

//the remainder is calculated to get the number which is Less than 40 number number%40 ; 116 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 //the number is divided by 10 to see if the tenth digit is between // 1 and 3, to print the char X, the specific number of times // if quotient is 2, then counter wilL be 2 and X character is added for 20 counter-number/10; for(int i-l; 1( counter ;i++){ romanNumeral [index++]-X' the remainder is calculated to get the number which is Less than 10 number number%10; //the two digit number is divided by 9, to know if the ones digit /is 9. Counter will be 1 if the digit is 9 and characters I X are added /I to the array. counter-number/9; for(int i-l; 1( counter ;i++){ romanNumeral[index++-'I'; romanNumeral [index++]-'X'; // if number is less than 9, say 8, number%9 will give 8 // which is the next number to be converted number number%9 the remainder is calculated to get the number which is Less than 5 counter-number/5;

for(int 1(scounter;i++){ 144 145 146 147 148 149 150 1-1; romanNumeral[index++]-'V //the remainder is calculated to get the number which is Less than 5 number number%5; //the number is divided by 4 to see if the ones digit is4 // if it is 4, then counter will be 1 and I V characters are added for 4 counter-number/4; for(int i-l; 1( counter ;i++){ 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 romanNumeral[index+]-'I'; romanNumeral [index++]-'V' /the remainder is calculated to get the number which is Less than 4 number number%4; //the number is divided by 1 to see if the ones digit is between 1 and 3, to print the char 1 ) the specific number of times // if quotient is 2, then counter will be 2 and I character is added for 2 counter-number/1; for(int i-1; 1〈-Counter ;i++){ romanNumeral[index+]-'I'; cout << "Given number :: "; cout << originalnumber; 172 cout << "InRoman Numeral";

for(int i-0; i<index;i++)1 173 174 175 176 cout <<romanNumeral[i] 178 179 180 //main method to start the program execution 181 int main() 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 int number; cout < "Please enter the Decimal number to convert to Roman Numerals : cin number; //if num is less than if (number0 cout << "Error!! Your number must be greater than zero."; return 1 //if num is greater than 3999 if(number >3999) cout << "Error!! Your number should be less than 4000."; return 1

// call the funtion to convert the decimal number to roman numeral convertDecimalToRoman(number); 202 203 204 205 206 return

==============================================================================================

Sample output screenshots:

Please enter the Decimal number to convert to Roman Numerals :: 3999 Given number :: 3999 Roman Numeral MMMCMXcIx

Please enter the Decimal number to convert to Roman Numerals:: 3899 Given number :: 3899 Roman Numeral :: MMMDCCCXCIX

Please enter the Decimal number to convert to Roman Numerals : 4000 ror !! Your number should be less than 4000.

Please enter the Decimal number to convert to Roman Numerals·2567 Given number :: 2567 Roman Numeral: MMDLXVII

Please enter the Decimal number to convert to Roman Numerals·467 Given number :: 467 Roman Numeral :: CDLXVII

Please enter the Decimal number to convert to Roman Numerals·320 Given number : 320 Roman Numeral :: СССХ