Windows 10: Changing endnote numbers from Roman numerals to Arabic numerals

I have a 2021 MacBook Air that I am using Word on. I am trying to change endnote numbers from Roman numerals to Arabic numerals. So for example, I want to change the endnote numbers from i,ii,iii to 1,2,3. This was a fairly easy fix on other versions of Word, but on the version that I have that feature is gone. Could someone please help me?

:)

 

Roman Numeral Algorithm Help

Kreij, I am not questioning your intelligence, but is IVX even a legal roman numeral expression?

Different online roman numeral converters either give the arabic equivalent as 4, or 14 because they automatically convert the sequence to XIV, or don't even give an answer.

This converter gives the same answer as my algorithm gives for IVX: 4.

This converter automatically converts the input to XIV and then gives the answer as 14. I don't know why it changes the sequence from IVX to XIV, maybe because IVX is not a legal expression.

This converter gives the following message whenever you enter IVX: "IVX is not a valid input"

 

Roman Numeral Algorithm Help

Here is my C++ code for something that converts a roman numeral sequence to its equivalent arabic numeral sequence:

Code: #include <iostream> #include <vector> #include <string> using namespace std; int main() { int sum = 0; string sequence; vector<int> list; for (; { cout << "Enter The Roman Numeral Sequence In Lowercase, e To Exit: "; cin >> sequence; cout << endl; for (int counter = 0; counter < sequence.size(); counter++) { switch (sequence[counter]) { case 'i': list.push_back(1); break; case 'v': list.push_back(5); break; case 'x': list.push_back(10); break; case 'l': list.push_back(50); break; case 'c': list.push_back(100); break; case 'd': list.push_back(500); break; case 'm': list.push_back(1000); break; // Any letter not matching the above letters will stop the program default: cout << "Error: Unrecognized Letter" << endl; return 0; } } for (int counter = 1; counter < list.size(); counter++) { if (list[counter - 1] < list[counter]) { list[counter - 1] = (list[counter - 1]) * (-1); } } for (int counter = 0; counter < list.size(); counter++) { sum += list[counter]; } cout << sum << endl << endl; sum = 0; list.clear(); } return 0; }[/quote] The problem is when I go to verify any sequence with an online converter, my answers will be verified only most of the time. Can you help me find out what is wrong with my algorithm?

 

Roman Numeral Algorithm Help

Since you did not give us any examples of what numbers fail, I'll just take a shot at it.
Are you doing enough checking for valid character sequences?

For instance ... if I type in IVX, your program will return 4. (-1 + -5 + 10)
IVX is obviously not how one would write 4 in roman numerals.