1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Harlamova29_29 [7]
3 years ago
15

PLEASE HELP ASAP (answer is needed in Java) 70 POINTS

Computers and Technology
1 answer:
8_murik_8 [283]3 years ago
6 0

import java.util.Scanner;

public class MyClass1 {

   public static void main(String args[]) {

     Scanner scan = new Scanner(System.in);

     int smallest = 0, largest = 0, num, count = 0;

     while (true){

         System.out.println("Enter a number (-1 to quit): ");

         num = scan.nextInt();

         if (num == -1){

             System.exit(0);

         }

         else if (num < 0){

             System.out.println("Please enter a positive number!");

         }

         else{

             if (num > largest){

                 largest = num;

                 

             }

             if (num < smallest || count == 0){

                 smallest = num;

                 count++;

             }

             System.out.println("Smallest # so far: "+smallest);

             System.out.println("Largest # so far: "+largest);

         }

     }

   }

}

I hope this helps! If you have any other questions, I'll do my best to answer them.

You might be interested in
I’m order to protect your passwords, don’t use easy-to-guess information, don’t share your passwords, and NEVER change your pass
Elena L [17]

Answer:

true!

Explanation:

its better to know your password :))

3 0
3 years ago
Who wants to be my tutor?
anzhelika [568]

Answer:

i would but im not big brain

Explanation:

8 0
3 years ago
Read 2 more answers
A sosit vara.copiii sunt veseli pentru ca au luat vacanta,mii de fluturi colorati zboara pe ceruri senine,soarele straluceste ve
hodyreva [135]
Acest lucru nu este calculator și tehnologie acest lucru arata ca acesta poate fi un poem pare rău, dar acest lucru trebuie postat in categoria engleză!! Mulțumesc

4 0
3 years ago
Which term does not refer to a variant of the full-size secure digital (sd) memory card?
dsp73

Micro SD term does not refer to a variant of the full-size secure digital (sd) memory card.

<h3>What is Secure Digital a memory card?</h3>

A Secure Digital (SD) card is a tiny flash memory card developed for high-capacity memory and different portable devices, such as car navigation systems, cellular phones, e-books, PDAs, smartphones, digital cameras, music players, digital video camcorders, and individual computers.

<h3>What is the best device for storing digital photos?</h3>

Hard drives are good for storing photos because they are cheap, they provide fast admission to data, and it's very easy to copy a whole hard drive to another hard drive  especially if you have USB 3.0 or Thunderbolt associations

To learn more about Micro SD, refer

brainly.com/question/24723558

#SPJ4

4 0
2 years ago
github Portfolio Balances An investor opens a new account and wants to invest in a number of assets. Each asset begins with a ba
OLEGan [10]

The following code will be used to determine the maximum amount invested

<u>Explanation:</u>

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

{

   // Define the variable to store

   // the maximum amount invested.

   long max = 0;

   

   // Define an array of size n,

   // to store the n investments.

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

   int i=0;  

   // Initially set all

   // the investments to 0.

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

   {

       investments[i] = 0;

   }

   i=0;

   // Run the loop to

   // perform the rounds.

   while(i<rounds_rows)

   {

       // Get the left value

       // of the current round.

       int left = rounds[i][0];

       

       // Get the right value

       // of the current round.

       int right = rounds[i][1];

       // Get the contribution

       // for the current round.

       int contribution = rounds[i][2];

       // Since the user uses 1-based

       // indexing, subtract 1 from left

       // and right as the program uses

       // 0-based indexing. That is, the

       // investments in the array start

       // from 0 and not 1.

       right = right - 1;

       int j=0;

       // Run the loop to add the

       // contribution to all the investments

       // between left and right, both inclusive.

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

       {

           investments[j] += contribution;

       }

       i++;

   }

   // Traverse the investments array

   // to find the maximum element.

   max = investments[0];

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

   {

       if(investments[i]>max)

       {

           max = investments[i];

       }

   }

   // Return the

   // maximum investment.

   return max;  

}

6 0
3 years ago
Other questions:
  • What is basic function of an operating system?
    10·2 answers
  • 2.8 Code Practice: Question 1
    7·2 answers
  • An intranet is an external network.TrueFalse
    15·1 answer
  • 5.
    6·1 answer
  • When using query by example (qbe) in the data manipulation component of a database management system (dbms), the _____ is used w
    5·1 answer
  • Which are the benefits of leveraging web technologies?
    8·2 answers
  • In a Java Script language. create a two-dimension array consisting of numbers representing costs. After creating the array, prin
    11·1 answer
  • PLZ HELP !!!!! <br> plzzzz
    6·1 answer
  • Which task can be completed with the Template Organizer?
    12·2 answers
  • What type of access controls allow the owner of a file to grant other users access to it using an access control list
    5·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!