There is an array of n integers. There are also 2 disjoint sets, A and B, each containing m integers. You like all the integers in set A and dislike all the integers in set B. Your initial happiness is 0. For each i integer in the array, if i E A, you add 1 to your happiness. If i € B, you add -1 to your happiness. Otherwise, your happiness does not change. Output your final happiness at the end. Note: Since A and B are sets, they have no repeated elements. However, the array might contain duplicate elements. Constraints 1≤n ≤ 105 1

There is an array of n integers. There are also 2 disjoint sets, A and B, each containing m integers. You like all the integers in set A and dislike all the integers in set B. Your initial happiness is 0. For each i integer in the array, if i E A, you add 1 to your happiness. If i € B, you add -1 to your happiness. Otherwise, your happiness does not change. Output your final happiness at the end. Note: Since A and B are sets, they have no repeated elements. However, the array might contain duplicate elements. Constraints 1≤n ≤ 105 1

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

There is an array of n integers. There are also 2 disjoint sets, A and B, each containing m integers. You like all the integers in set A and dislike all the integers in set B. Your initial happiness is 0. For each i integer in the array, if i E A, you add 1 to your happiness. If i E B, you add -1 to your happiness. Otherwise, your happiness does not change. Output your final happiness at the end. Note: Since A and B are sets, they have no repeated elements. However, the array might contain duplicate elements. Constraints 1≤ n ≤ 105 1≤m≤ 105 1 Any integer in the input ≤ 10⁹ Input Format The first line contains integers n and m separated by a space. The second line contains n integers, the elements of the array. The third and fourth lines contain m integers, A and B, respectively.
Write a hangman game that randomly generates a word andprompts the user to guess one letter at a time, as presented in the sample run.Each letter in the word is displayed as an asterisk. When the user makes a correctguess, the actual letter is then displayed. When the user finishes a word, displaythe number of misses and ask the user whether to continue to play with anotherword. Declare an array to store words, as follows:// Add any words you wish in this arrayString[] words = {"write", "that",...}; (Guess) Enter a letter in word ******* > p↵Enter(Guess) Enter a letter in word p****** > r↵Enter(Guess) Enter a letter in word pr**r** > p↵Enterp is already in the word(Guess) Enter a letter in word pr**r** > o↵Enter(Guess) Enter a letter in word pro*r** > g↵Enter(Guess) Enter a letter in word progr** > n↵Entern is not in the word(Guess) Enter a letter in word progr** > m↵Enter(Guess) Enter a letter in word progr*m > a↵EnterThe word is program. You missed 1 timeDo…
Declare an array that represents 100 students. Assign the examscores between 0 and 100 randomly into this array. Write amethod and display that assigns letter grade equivalents of theexam scores to a second array. Display the number ofunsuccessful students.The grade scala is as follows:100 – 90 : A89 – 80 : B79 – 70 : C69 – 60 : D59 – 0 : F (unsuccessful) (Write in java)
This program is written in java. 2D arrays (matrices/grids) Write a program that takes 20 student objects and stores them in an array. Each Student object should have a first name and a last name. Sort the array by student’s last name. You can use any of the sorts you have. Then put the names into a 2D array that has 5 rows and 4 columns. Create and print 2 seating charts by printing the 2D array, formatted as shown below. Student 17 Student 18 Student 19 Student 20 Student 13 Student 14 Student 15 Student 16 Student 9 Student 10 Student 11 Student 12 Student 5 Student 6 Student 7 Student 8 Student 1 Student 2 Student 3 Student 4 second chart should look randomized, like this. Student 4 Student 8 Student 12 Student 16 Student 20 Student 3 Student 7 Student 11 Student 15 Student 19 Student 2 Student 6 Student 10 Student 14 Student 18 Student 1 Student 5 Student 9 Student…
Write a hangman game that randomly generates a word and prompts the user to guess one letter at a time, as shown in the sample run. Each letter in the word is displayed in an asterisk. When the user makes a cor- rect guess, the actual letter is then displayed. When the user finishes a word, display the number of misses and ask the user whether to continue for another word. Declare an array to store words, as follows: // Use any words you wishstring words[] = {"write", "that", ...};
Given an int variable k, an int array incompletes that has been declared and initialized, an int variable nIncompletes that contains the number of elements in the array, an int variable studentID that has been initialized, and an int variable numberOfIncompletes, Write code that counts the number of times the value of studentID appears in incompletes and assigns this value to numberOfIncompletes. You may use only k, incompletes, nIncompletes, studentID, and numberOfIncompletes.
Consider the following game: Each of two players rolls a dice and whoever rolls the highest number (between 1 and 6 inclusive) gets 4 points, and if it is a draw, both players get 2 points. The player with the highest number of points after 10 rounds of the game is the winner(or the game could be drawn).The following arrays contain the results of dice rolls of each of two players in 10 consecutive rounds of the game.player1=[3, 2, 5, 6, 2, 5, 1, 6, 4, 5]player2=[4, 2, 4, 3, 6, 5, 3, 2, 4, 1] Write a program that computes the running total points of each player and displays one of the following messages (whichever applies) after each round n for n = 1, 2, . . . , 10:Player 1 is leading Player 2 is leading It is a tie [Hint: Use an if construct.] Also, at the end of the program, use the find command to identify (and display) the rounds in which dice rolls were the same for the two players, and use the length command to compute(and display) the number of such rounds. Include appropriate…
Blackjack is a card game where the goal is to reach a score of 21. Create a java version of this game with the following requirements. Extend the JPanel class and create an array of 52 cards. Add four sets of numbers from 1 to 10. Use J for Jack, Q for queen, K for king, and A for ace. Jack through king will have a value of 10, and the ace will have a value of 11. Deal two cards to the user and two cards to the computer. Do not show the value of the computer's first two cards to the user. Add buttons Hit, Stay, and Reset. If the user selects the "Hit" button, randomly select one of the cards from the array, and give it to the user. (After selecting a card, do not reuse this index during the rest of the game.) If the dealer has less than 21, "hit" the dealer, too. When the user selects the "Stay" button, add up the card values. The winner is the person who is closest to 21 without going over. Name the class Blackjack.java.
/*** Given an array of tweets, find the ID of the tweet that* has the most "likes". Return -1 if the array is of length 0.* Do not worry about the case where the array is null or there are* multiple tweets with the same number of likes.* * * @param tweets the array of tweets* @return ID of the tweet with most likes if array is non-empty, 0 otherwise*/public static long mostLikedTweet(Tweet[] tweets) {throw new UnsupportedOperationException("Implement this"); }
You have been hired at an open-air mine. You are to write a program to control a digger. For your task, you have been given a 'map' of all the underground resources in the mine. This map comes as atwo-dimensional integer array. The array has n rows and k columns. Each integer is between zero and one hundred (inclusive). This array represents a grid map of the mine – with each row representing a different height level. Each square in the grid can contain valuable resources. The value of these resources can go from zero (no resources) to 100 (max resources). The grid maps the resources just below the surface, and down to the lowest diggable depths. The digger starts at the surface (so, just on top of the topmost row in the grid)—at any horizontal position between 1 and k. The digger cannot dig directly downwards, but it can dig diagonally in either direction, left-down, or right-down. In its first time-step, it will dig onto the first row of the grid. In its second time-step, it'll hit…
Create a 4x3 array of letters from a through l and call it array1. Copy the array and call it array2, then reshape array2 to a 6x2 array. Create another copy of the array, called array3, and flatten it into a one-dimensional array. Print all three arrays.
Suppose you roll a set of n dice. Then the smallest sum is n and the largest sum is 6n. For example, if 510 n , then the smallest sum is 6 and the largest sum is 60. Let m be the desired sum of the numbers rolled. Then n ≤ m ≤ 6n. If 510 n , then 6 ≤ m ≤ 60. Write a program that uses the class die, of Example 10-9, to roll 10 dice. (Use an array of size 10 to implement 10 dice.) The program prompts the user to enter the desired sum and the number of times the dice are to be rolled.