Computer Science, asked by aomy120, 6 months ago

you are given an integer N. 1 <= N <= 1000000
then N line follow integer Xi. 1 <= Xi <= 1000000. 1 <= i <= N
for each line print a line "yes" if it is a prime number otherwise "no".
and print another line all Xi with space separate integer in non-decreasing order.
*note: you have to write solution with max complexity O(nlogn) approximately.​

Answers

Answered by dillipkumarb82
0

Explanation:

eejeiejjdjdjdjjdjdksklwlwjsjkkkan. sjdkkd I am very happy for you to providing me a question .I think it will help you

Similar questions