88 points Generally speaking, on average it takes you 3500 calories each day to maintain your weight, while 3500 extra calories generally equals 1 pound of weight gain (So, 7000 calories in one day would mean that you gained 1 pound that day). Prompt for 7 days of calories consumed by day, starting with Sunday and going through Saturday and put the calories into an array. Print the array along with a nicely formatted header (printf is a requirement for this part of the program).

Write a method to calculate the total amount of calories consumed for the week and print the information in a nice readable format.

Write a method to calculate the average number of calories consumed in the week to the nearest tenth and print the information in a nice format.

Write a method to find if you gained or lost weight this week. Subtract your ideal calories to maintain your weight (7 * 3500) from the calories you consumed for the week. Did you gain or lose weight this week and by how many pounds to the nearest tenth of a pound? Print the information in a nice format.

Use the following test input to ensure your program is running properly:
Sunday - 4700 calories
Monday - 2500 calories
Tuesday - 2000 calories
Wednesday - 1800 calories
Thursday - 3000 calories
Friday - 1500 calories
Saturday - 3500 calories

Some of your friends have gotten into the burgeoning field of time-series data mining, in which one looks for patterns in sequences of events that occur over time. purchases at stock exchanges"what's being bought" are one source of data with a natural ordering in time. given a long sequence s of such events, your friends want an efficient way to detect certain "patterns" in them"for example, they may want to know if the four events buy yahoo, buy ebay, buy yahoo, buy oracle occur in this sequence s, in order but not necessarily consecutively. they begin with a collection of possible events (e. g., the possible transactions) and a sequence s of n of these events. a given event may occur multiple times in s (e. g., yahoo stock may be bought many times in a single sequence s). we will say that a sequence s is a subsequence of s if there is a way to delete certain of the events from s so that the remaining events, in order, are equal to the sequence s . so, for example, the sequence of four events above is a subsequence of the sequence buy amazon, buy yahoo, buy ebay, buy yahoo, buy yahoo, buy oracle their goal is to be able to dream up short sequences and quickly detect whether they are subsequences of s. so this is the problem they pose to you: give an algorithm that takes two sequences of events"s of length m and s of length n, each possibly containing an event more than once"and decides in time o(m + n) whether s is a subsequence of s.

Jasper and samantha are in a robotics competition. the guidelines state that the robots should be able to move a 10-gram weight at least 2 meters and turn in a circle. jasper and samantha have already built the robot. which step of the design process should they follow next to decide whether their robot meets the minimum criteria for the competition?

What is the digital revolution and how did it change society? what are the benefits of digital media?