Answered Essay: Modity the posttik rogran post-epp to handle both sebtraction a e Text ormation ./a.eut 410-6 Notes Content ce Pol

Modity the posttik rogran post-epp to handle both sebtraction a e Text ormation ./a.eut 410-6 Notes Content ce Policy ss to ample input 12/ sample output Your progran shoald be naned 0 epP and placed in your p directory 1. write progran to fill a two-diseasional array of boolean values by Else if the greatest eoneon divisor iB Bot I. then set .[4,131 to 0- ample Inpats Sample Outputt Method bjectives Course 01010 0 110 1 dule paration mmands Place this progran in your directory and eall it -pp 2· Writo program to solve the Josephus problem, with th. following Sample Inputt wher. n is the numb€r e playerB and &# the count used for every odd 4 52 Sample Output Round 3 winner i Place this program in your direetety and sane it 2-p Whenis a graph a tree? Write a progran that will read from a file Example -u graph.tnt Out pot The graph ia atreet Contents of grap Ext will be sonething like this 100 0100 0100 TO be graded·JWr program must be in your pgm and naned precisely as 3-0pp Please answer clearly and fully attached I’d post.cpp
media%2F6b2%2F6b20e95c-23f9-4f99-93f9-f1The last attached file is the joesephus file
media%2F200%2F20078ba8-09df-43a1-ad04-cf

Modity the posttik rogran post-epp to handle both sebtraction a e Text ormation ./a.eut 410-6 Notes Content ce Policy ss to ample input 12/ sample output Your progran shoald be naned 0 epP and placed in your p directory 1. write progran to fill a two-diseasional array of boolean values by Else if the greatest eoneon divisor iB Bot I. then set .[4,131 to 0- ample Inpats Sample Outputt Method bjectives Course 01010 0 110 1 dule paration mmands Place this progran in your directory and eall it -pp 2· Writo program to solve the Josephus problem, with th. following Sample Inputt wher. n is the numb€r e playerB and &# the count used for every odd 4 52 Sample Output Round 3 winner i Place this program in your direetety and sane it 2-p Whenis a graph a tree? Write a progran that will read from a file Example -u graph.tnt Out pot The graph ia atreet Contents of grap Ext will be sonething like this 100 0100 0100 TO be graded·JWr program must be in your pgm and naned precisely as 3-0pp

Expert Answer

 

Here is the modification for your post.cpp:

#include <iostream>
#include <string>
#include “stack.cpp”
using namespace std;
int main(int argc, char *argv[])
{
char *a = argv[1];
int i, div, N = strlen(a);
Stack<int> save(N);
for(i = 0; i < N; i++)
{
if(a[i] == ‘+’)
{
int y = save.pop();
int x = save.pop();
save.push(x + y);
}
else if(a[i] == ‘-‘)
{
int y = save.pop();
int x = save.pop();
save.push(x – y);
}
else if(a[i] == ‘*’)
{
int y = save.pop();
int x = save.pop();
save.push(x * y);
}
else if(a[i] == ‘/’)
{
int y = save.pop();
int x = save.pop();
save.push(x / y);
}
else if(a[i] >= ‘0’ && a[i] <= 9)
save.push(a[i] = ‘0’);
}
cout<<save.pop()<<endl;
return 0;
}

Here is the code for your second problem:

#include <iostream>
using namespace std;
int gcd(int x, int y)
{
if(y == 0)
return x;
else if(x == 0)
return y;
else
return gcd(y, x%y);
}
int main(int argc, char *argv[])
{
int arraySize = atoi(argv[1]);
int array[arraySize][arraySize];

for(int i = 0; i < arraySize; i++)
for(int j = 0; j < arraySize; j++)
array[i][j] = 0;

for(int i = 1; i < arraySize; i++)
for(int j = 1; j < arraySize; j++)
if(gcd(i, j) == 1)
array[i][j] = 1;
for(int i = 0; i < arraySize; i++)
{
for(int j = 0; j < arraySize; j++)
cout << array[i][j] << ” “;
cout << endl;
}
}

And the output screenshot is:

Buy Essay
Calculate your paper price
Pages (550 words)
Approximate price: -

Help Me Write My Essay - Reasons:

Best Online Essay Writing Service

We strive to give our customers the best online essay writing experience. We Make sure essays are submitted on time and all the instructions are followed.

Our Writers are Experienced and Professional

Our essay writing service is founded on professional writers who are on stand by to help you any time.

Free Revision Fo all Essays

Sometimes you may require our writers to add on a point to make your essay as customised as possible, we will give you unlimited times to do this. And we will do it for free.

Timely Essay(s)

We understand the frustrations that comes with late essays and our writers are extra careful to not violate this term. Our support team is always engauging our writers to help you have your essay ahead of time.

Customised Essays &100% Confidential

Our Online writing Service has zero torelance for plagiarised papers. We have plagiarism checking tool that generate plagiarism reports just to make sure you are satisfied.

24/7 Customer Support

Our agents are ready to help you around the clock. Please feel free to reach out and enquire about anything.

Try it now!

Calculate the price of your order

Total price:
$0.00

How it works?

Follow these simple steps to get your paper done

Place your order

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Receive the final file

Once your paper is ready, we will email it to you.

HOW OUR ONLINE ESSAY WRITING SERVICE WORKS

Let us write that nagging essay.

STEP 1

Submit Your Essay/Homework Instructions

By clicking on the "PLACE ORDER" button, tell us your requires. Be precise for an accurate customised essay. You may also upload any reading materials where applicable.

STEP 2

Pick A & Writer

Our ordering form will provide you with a list of writers and their feedbacks. At step 2, its time select a writer. Our online agents are on stand by to help you just in case.

STEP 3

Editing (OUR PART)

At this stage, our editor will go through your essay and make sure your writer did meet all the instructions.

STEP 4

Receive your Paper

After Editing, your paper will be sent to you via email.