define fl(i,a,b) for(i=a;i<b;i++) #define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); using namespace std; typedef long long int ll; string int_to_roman(ll n) { string str=""; // store all base values in vector in descending order vector <int > v ={1000,900,500,400,100,90,50,40,10,9,5,4,1}; // store roman numeral equivalent of each base value using map map <int, string> m ={{1000,"M"}, {900,"CM"},{500,"D"},{400,"CD"},{100,"C"},{90,"XC"},{50,"L"},{40,"XL"},{10,"X"},{9,"IX"},{5,"V"},{4,"IV"},{1,"I"}}; //now find the largest base value //dividing the number and repeat the symbol accordingly for(auto x: v) { if(n>0) { int i= n/x; n= n%x; while(i--) str+= m[x]; //repeating the correspoding roman symbol } else return str; } return str; } int main() { fast; ll n; cin>>n; cout<<int_to_roman(n); return 0.

I have rewrite the code below:The provided code is written in C++ and aims to convert an integer…

Answered: define fast…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

define fl(i,a,b) for(i=a;i<b;i++)
	#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	using namespace std;
	typedef long long int ll;

	string int_to_roman(ll n)
	{
	string str="";
	// store all base values in vector in descending order
	vector <int > v ={1000,900,500,400,100,90,50,40,10,9,5,4,1};

	// store roman numeral equivalent of each base value using map
	map <int, string> m ={{1000,"M"}, {900,"CM"},{500,"D"},{400,"CD"},{100,"C"},{90,"XC"},{50,"L"},{40,"XL"},{10,"X"},{9,"IX"},{5,"V"},{4,"IV"},{1,"I"}};

	//now find the largest base value
	//dividing the number and repeat the symbol accordingly

	for(auto x: v)
	{
	if(n>0)
	{
	int i= n/x;
	n= n%x;
	while(i--)
	str+= m[x]; //repeating the correspoding roman symbol
	}
	else
	return str;
	}
	return str;
	}

	int main()
	{
	fast;

	ll n; cin>>n;
	cout<<int_to_roman(n);

	return 0.

Expert Solution

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions