After modifying a numbered list in her presentation, Su notices the numbers and the text are too close to each other. She knows

Response:

The code is provided below

Clarification:

import java.io.BufferedReader;

import java.io.IOException;

import java.io.InputStreamReader;

import java.nio.charset.StandardCharsets;

public class Main {

  /**

  *

  * Process each line of input.

  *

  */

  public static void main(String[] args) throws IOException {

      InputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);

      BufferedReader in = new BufferedReader(reader);

      String line;

      while ((line = in.readLine())!= null) {

          String[] splittedInput = line.split(";");

          String pattern = splittedInput[0];

          String blobs = splittedInput[1];

          Main.doSomething(pattern, blobs);

      }

  }

  public static void doSomething(String pattern, String blobs) {

      // Implement your code here. You can create more methods or classes if needed

      int total = 0;

      String arrblobs[] = blobs.split("\\|");

      for (int i = 0; i < arrblobs.length; ++i) {

          int count = 0, index = 0;

          for (;;) {

              int position = arrblobs[i].indexOf(pattern, index);

              if (position < 0)

                  break;

              count++;

              index = position + 1;

          }

          System.out.print(count + "|");

          total += count;

      }

      System.out.println(total);

  }

}

Answer:

First, the team should apologize to the product owner for not meeting the deadline with the necessary responsibility and commitment.

Next, having finished 8 stories, they should review and correct any defects in those stories before sending them to her.

When the product owner reviews and approves the stories, she will likely discuss the remaining stories with the team.

This code serves to find out the highest amount invested

Explanation:

long maxValue(int n, int rounds_rows, int rounds_columns, int into rounds)

{

   // Variable declaration to hold

   // the highest investment amount.

   long max = 0;

   // Creating an array of size n,

   // to keep track of the n investments.

   long *investments = (long*)malloc(sizeof(long)*n);

   int i=0;  

   // Initialize all

   // investments to zero.

   for(i=0;i<n;i++)

   {

       investments[i] = 0;

   }

   i=0;

   // Execute the loop to

   // conduct the rounds.

   while(i<rounds_rows)

   {

       // Acquire the left value

       // for the current round.

       int left = rounds[i][0];

       // Acquire the right value

       // for this round.

       int right = rounds[i][1];

       // Get the contribution

       // for this round.

       int contribution = rounds[i][2];

       // Because user indexing is 1-based,

       // subtract 1 from left

       // and right as the program employs

       // 0-based indexing. The

       // array investments begins

       // at 0 and not 1.

       right = right - 1;

       int j=0;

       // Execute loop to distribute the

       // contribution across all investments

       // from left to right, inclusive.

       for(j=left; j<=right; j++)

       {

           investments[j] += contribution;

       }

       i++;

   }

   // Traverse the investments array

   // to locate the maximum value.

   max = investments[0];

   for(i=1; i<n;i++)

   {

       if(investments[i]>max)

       {

           max = investments[i];

       }

   }

   // Return the

   // highest investment.

   return max;  

}