reply urgently in 2-3 hours
Managed C++/CLI
1
Posts
1
Posters
0
Views
1
Watching
-
an integer substring of an integer is formed by consecutive digits of the original integer. For examp[le, the number 6158 contains the substrings 6,1,5,8,61,15,58,615,158,6158. you must find the largest substring of an integer that is also a prime. input the input will be an integer N,(0<=N<=1 000 000 000). Output The output will be the largest prime substring of N. If no substring is a prime, then your program should print "No Primes". Sample Input 1 2319 Sample Output 1 31 Sample input 23 6804 Sample Output No Primes Lov u all