Si algunuien me puede ayudar a hacer este algoritmo me serviria de mucho, Ingresar (puede generar los numeros si no desea cargarlos) la matriz Mat de N filas por M columnas, y la matriz OTRA de F filas y C columnas (ingresando y validando previamente F y C, que sean tanto F como C mayores a 0 y menores a 15, entero). Genere el vector D con todos los elementos distintos (elementos diferentes, no comunes) entre ambas matrices.
Imprimir las matrices originales (con formato matriz) y el vector resultante (con formato vector

Write a method named addall that could be placed inside the hashintset class. this method accepts another hashintset as a parameter and adds all elements from that set into the current set, if they are not already present. for example, if a set s1 contains [1, 2, 3] and another set s2 contains [1, 7, 3, 9], the call of s1.addall(s2); would change s1 to store [1, 2, 3, 7, 9] in some order. you are allowed to call methods on your set and/or the other set. do not modify the set passed in. this method should run in o(n) time where n is the number of elements in the parameter set passed in.

Write a program that prompts the user to input a string. the program then uses the function substr to remove all the vowels from the string. for example, if str = "there", then after removing all the vowels, str = "thr". after removing all the vowels, output the string. your program must contain a function to remove all the vowels and a function to determine whether a character is a vowel.

Many everyday occurrences can be represented as a binary bit. for example, a door is open or closed, the stove is on or off, and the fog is asleep or awake. could relationships be represented as a binary value? give example.