We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Loading...
  • Practice
  • Compete
  • Jobs
  • Leaderboard
  • Hiring developers?
  1. Practice
  2. Java
  3. Advanced
  4. Prime Checker
  5. Discussions

Prime Checker

  • Problem
  • Submissions
  • Leaderboard
  • Discussions
  • Editorial

    You are viewing a single comment's thread. Return to all comments →

  • himanshuwalia099 5 months ago+ 0 comments
    import static java.lang.System.in;
    class Prime {
       void checkPrime(int ... nums)
        {
            for(int i:nums)
            {
                if(isPrime(i)==true && i!=1)
                { 
                            System.out.print(i+" "); 
    
            }
                }    System.out.println();
        }
    public static boolean isPrime(int n){
            for(int i=2; i<=n/2; i++)
            {
               if(n%i==0) return false;
            }
            return true;
    }
    }****
    
    0|
    Permalink
  • Contest Calendar
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy
  • Request a Feature