2. Enter two positive integers greater than 2 and save them in variables N and M. ..

3. Get the value of the temporary variable t as m, and set the initial value of I as 2.

4. execute the loop with the do-while statement, and the judgment condition is I.

5. Find the remainder of the integer m with I and save it in the variable r..

6. Judge whether I is a prime factor of m, if so, continue to judge whether I is a prime factor of n, if not, exit the loop.

7. If I is not a prime factor, add 1 to continue judgment.

8. Run the program. After entering two positive integers greater than 2, the computer will judge whether the integer n contains all prime factors of m and output the result.