a loop hat subtracts element in the assigns the element with 0. Ex: lowerScores = {5, 0, 2, -3) becomes {4, 0, 1, 0}. 406554.2871636.qx3zqy7 1 #include 2 #include 3 using namespace std; 4 5 int main() { 6 7 8 9 10 11 12 13 14 15 16 17 Run const int SCORES_SIZE = 4; vector lowerScores (SCORES_SIZE); unsigned int i; for (i = 0; i < lowerScores.size(); ++i) { cin>> lowerScores.at(i); } /* Your solution goes here */ for (i = 0; i < lowerScores.size(); ++i) { cout << lowerScores.at (i) << " "; element was greater than, and otherwis Just

/* yahtC */ #include <stdio.h> #include <string.h> #include <stdlib.h> #include <time.h>   void seed(int argc, char ** argv){ srand(time(NULL)); // Initialize random seed if (argc>1){ int i; if (1 == sscanf(argv[1],"%d",&i)){ srand(i); } } } void instructions(){ printf("\n\n\n\n" "\t**********************************************************************\n" "\t* Welcome to YahtC *\n" "\t**********************************************************************\n" "\tYahtC is a dice game (very) loosely modeled on Yahtzee\n" "\tBUT YahtC is not Yahtzee.\n\n" "\tRules:\n" "\t5 dice are rolled\n" "\tThe user selects which dice to roll again.\n" "\tThe user may choose to roll none or all 5 or any combination.\n" "\tAnd then the user selects which dice to roll, yet again.\n" "\tAfter this second reroll the turn is scored.\n\n" "\tScoring is as follows:\n" "\t\t*\t50 points \t5 of a kind scores 50 points.\n" "\t\t*\t45 points \tNo pairs (all unique) scores 45…

#include <iostream>using namespace std;struct item{    int id;    float price;} s[50];int size=0; void addData(){        cout << "Enter an item data " << endl;        cout << "Enter id: ";        cin >> s[size].id;        cout << "Enter price: ";        cin >> s[size].price;        cout<<"successfully added"<<endl<<endl;        size++;        for(int i=0;i<size;i++)         {              for(int j=i+1;j<size;j++)              {                   if(s[i].price>s[j].price)                   {                        struct item t=s[i];                        s[i]=s[j];                        s[j]=t;                   }              }         }}void retrivePrice(){    int id;    cout<<"enter the element id:";    cin>>id;    cout<<endl;    int i;    for( i = 0; i < size; ++i)    {        if(id == s[i].id){            cout << "price for this item: " << s[i].price << endl<<endl;…

#ifndef LLCP_INT_H#define LLCP_INT_H #include <iostream> struct Node{   int data;   Node *link;};void DelOddCopEven(Node*& headPtr);int    FindListLength(Node* headPtr);bool   IsSortedUp(Node* headPtr);void   InsertAsHead(Node*& headPtr, int value);void   InsertAsTail(Node*& headPtr, int value);void   InsertSortedUp(Node*& headPtr, int value);bool   DelFirstTargetNode(Node*& headPtr, int target);bool   DelNodeBefore1stMatch(Node*& headPtr, int target);void   ShowAll(std::ostream& outs, Node* headPtr);void   FindMinMax(Node* headPtr, int& minValue, int& maxValue);double FindAverage(Node* headPtr);void   ListClear(Node*& headPtr, int noMsg = 0); // prototype of DelOddCopEven of Assignment 5 Part 1 #endif

Help fill in code! #if !defined(PRODUCE_H_INCL)#define PRODUCE_H_INCL#define PRODUCE_NAME 21typedef struct produce {char name[PRODUCE_NAME];int inven;} produce_t;typedef struct list_node {produce_t data;struct list_node *restp;} list_node_t;typedef struct produce_list {/* fill in the code to declare a list_node_t pointer called head */int size;} produce_list_t;void read_produce_file (char filename[], produce_list_t *p);void print_produce (produce_t prod);void print_produce_list (produce_list_t p);void write_produce_file (char filename[], produce_list_t p);list_node_t * search_produce_list (produce_list_t p, char name[]);int update_produce_list (produce_list_t *p, produce_t prod);void print_produce_linked_list (produce_list_t p);#endif

4htmla pThe length property returns the length of an array./p 4Scripts const myärray [,,7,,,i,,1,1,14,1; 11 4facript> 12 19 4/body input The Ingh pegerty rehs de leugti of as any Write the program using Artificial intelligence.

initial c++ file/starter code: #include <vector>#include <iostream>#include <algorithm> using namespace std; // The puzzle will always have exactly 20 columnsconst int numCols = 20; // Searches the entire puzzle, but may use helper functions to implement logicvoid searchPuzzle(const char puzzle[][numCols], const string wordBank[],vector <string> &discovered, int numRows, int numWords); // Printer function that outputs a vectorvoid printVector(const vector <string> &v);// Example of one potential helper function.// bool searchPuzzleToTheRight(const char puzzle[][numCols], const string &word,// int rowStart, int colStart) int main(){int numRows, numWords; // grab the array row dimension and amount of wordscin >> numRows >> numWords;// declare a 2D arraychar puzzle[numRows][numCols];// TODO: fill the 2D array via input// read the puzzle in from the input file using cin // create a 1D array for wodsstring wordBank[numWords];// TODO:…

The elements displayed by the following section code  For(m=1;m<=5;m++) cout <<a[m] <<"" ;

#include <stdio.h>#include <stdlib.h>#include <time.h> struct treeNode {    struct treeNode* leftPtr;    int data;    struct treeNode* rightPtr;}; typedef struct treeNode TreeNode;typedef TreeNode* TreeNodePtr; void insertNode(TreeNodePtr* treePtr, int value);void inOrder(TreeNodePtr treePtr);void preOrder(TreeNodePtr treePtr);void postOrder(TreeNodePtr treePtr); int main(void) {    TreeNodePtr rootPtr = NULL;     srand(time(NULL));    puts("The numbers being placed in the tree are:");     for (unsigned int i = 1; i <= 10; ++i) {        int item = rand() % 15;        printf("%3d", item);        insertNode(&rootPtr, item);    }     puts("\n\nThe preOrder traversal is: ");    preOrder(rootPtr);     puts("\n\nThe inOrder traversal is: ");    inOrder(rootPtr);     puts("\n\nThe postOrder traversal is: ");    postOrder(rootPtr);} void insertNode(TreeNodePtr* treePtr, int value) {    if (*treePtr == NULL) {        *treePtr = malloc(sizeof(TreeNode));         if…

#include <iostream>//#include <vector> using namespace std; class Vec {public:Vec() {sz = 0;cap = 1;p_arr = new int[cap];} int size(){return this->sz;}int capacity(){return this->cap;}void reserve( int n ){// TODO:// (0) check the n should be > size, otherwise// ignore this action.if ( n > sz ){// (1) create a new int array which size is n// and get its address//cout << "Adress:"<< &n << endl;int *newarr = new int [n];//cout << "Address: " << newarr << endl; // location // (2) use for loop to copy the old array to the// new arrayfor(int i = 0; i < sz; i++){newarr[i] = p_arr[i];}// (3) update the variable to the new addressthis->cap=n; // (4) delete old arraydelete[] newarr;}}void push_back( int v ){// TODO:if ( sz == cap ){ cap *= 2; reserve(cap);}p_arr[sz++] = v;// complete others}int at(int idx){return this->p_arr[idx];}private://vector<int> arr;int *p_arr;int sz = 0;int cap = 0; }; int main(){Vec v;…