Logo 
Search:

C++ Programming Articles

Submit Article
Home » Articles » C++ Programming » Numerical AnalysisRSS Feeds

Program to get possible prime numbers like number 6158 contains the substrings 6, 1, 5, 8, 61, 15, 58, 615, 158, and 6158.Find the largest substring..

Posted By: Easy Tutor     Category: C++ Programming     Views: 4292

An integer substring of an integer is formed by consecutive digits of the original integer. For example, the number 6158 contains the substrings 6, 1, 5, 8, 61, 15, 58, 615, 158, and 6158. You must find the largest substring of an integer that is also a prime.

The input will be an integer N, (0 <= N <= 1,000,000,000).

The output will be the largest prime substring of N. If no substring is a prime, then your program should print "No Primes".

Code for Program to get possible prime numbers like number 6158 contains the substrings 6, 1, 5, 8, 61, 15, 58, 615, 158, and 6158.Find the largest substring.. in C++ Programming

 # include <iostream.h>
 # include <fstream.h>
 # include <string.h>
 # include <stdlib.h>
 # include <conio.h>

 int is_prime(constlong);


 int main( )
    {
       clrscr( );

       fstream File("CP-23.txt",ios::in|ios::nocreate);

       if(!File)
      {
         cout<<"\n Unable to open the input file."<<endl;
         cout<<"\n Press any key to exit.";

         getch( );
         exit(EXIT_FAILURE);
      }

       char Data[100]={NULL};

       do
      {
         strset(Data,NULL);

         File.getline(Data,80);

         if(strcmp(Data,NULL)==0)
        break;

         int length=strlen(Data);

         long largest_prime=0;

         char Number[15]={NULL};

         for(int i=1;i<=length;i++)
        {
           for(int j=0;j<=(length-i);j++)
              {
             strset(Number,NULL);

             for(int k=j,l=0;k<(i+j);k++,l++)
                Number[l]=Data[k];

             long number=atol(Number);

             if(is_prime(number))
                {
                   if(number>largest_prime)
                  largest_prime=number;
                }
              }
        }

         if(largest_prime!=0)
        cout<<largest_prime<<endl;

         else
        cout<<"No Primes"<<endl;
      }
       while(1);

       File.close( );

       getch( );
       return 0;
    }

 /*************************************************************************///-----------------------------  is_prime( )  ---------------------------///*************************************************************************/int is_prime(constlong number)
    {
       for(long count=2;count<number;count++)
      {
         if((number%count)==0)
        return 0;
      }

       return 1;
    }


  
Share: 



Easy Tutor
Easy Tutor author of Program to get possible prime numbers like number 6158 contains the substrings 6, 1, 5, 8, 61, 15, 58, 615, 158, and 6158.Find the largest substring.. is from United States. Easy Tutor says

Hello Friends,

I am Free Lance Tutor, who helped student in completing their homework.

I have 4 Years of hands on experience on helping student in completing their homework. I also guide them in doing their final year projects.

I have share many programs on this website for everyone to use freely, if you need further assistance, than please contact me on easytutor.2ya [at the rate] gmail [dot] com

I have special discount scheme for providing tutor services. I am providing tutor service to students from various contries, currently most of my students are from United States, India, Australia, Pakistan, Germany, UK and Canada.

I am also here to expand my technical network to receive more opportunity in my career, make friends to help them in resolving their technical problem, learn and share my knowledge, If you like to be my friend, Please send me friend request.

Thanks,
Happy Programming :)

 
View All Articles

 
Please enter your Comment

  • Comment should be atleast 30 Characters.
  • Please put code inside [Code] your code [/Code].

 
No Comment Found, Be the First to post comment!