“Primzahlprogramm in Java” Code-Antworten

Drucken von Primzahlen in Java

import java.util.Scanner;
public class Main
{
   public static void main (String[] args)
   {		
      Scanner scanner = new Scanner(System.in);
      int i =0;
      int num =0;
      //Empty String
      String  primeNumbers = "";
      System.out.println("Enter the value of n:");
      int n = scanner.nextInt();
      scanner.close();
      for (i = 1; i <= n; i++)  	   
      { 		 		  
         int counter=0; 		  
         for(num =i; num>=1; num--)
         {
	    if(i%num==0)
	    {
		counter = counter + 1;
	    }
	 }
	 if (counter ==2)
	 {
	    //Appended the Prime number to the String
	    primeNumbers = primeNumbers + i + " ";
	 }	
      }	
      System.out.println("Prime numbers from 1 to n are :");
      System.out.println(primeNumbers);
   }
}

Glamorous Gerenuk

Primzahlprogramm in Java

// The following method returns a boolean indicating
// if the parameter is a prime number
private boolean isPrimeNaiveIter(int val) {
		if(val == 0 || val == 1)
			return false;
		if(val == 2)
			return true;
        // Look for a divisor other than 1 and val
		for(int div = 2; div*div <= val; div++) {
        	// if found return false
			if(val % div==0)
				return false;
		}
        // No divisors found => return it is a prime number
		return true;
}

Wissam

So finden Sie Primzahlen in Java

public class PrimeExample2{    

  static void checkPrime(int n){  
    int i,m=0,flag=0;      
    m=n/2;      
    if(n==0||n==1){  
     System.out.println(n+" is not prime number");      
    }else{  
       for(i=2;i<=m;i++){      
        if(n%i==0){      
         System.out.println(n+" is not prime number");      
         flag=1;      
         break;      
      }      
     }      
     if(flag==0)  { System.out.println(n+" is prime number"); }  
    }//end of else  
  }  
 public static void main(String args[]){    
  checkPrime(1);  
  checkPrime(3);  
  checkPrime(17);  
  checkPrime(20);  
}    
}

android developer

Prime -Zahlen -Programm in Java

public class PrimeExample{    
  public static void main(String args[]){    
    int i,m=0,flag=0;      
    int n=3;//it is the number to be checked    
    m=n/2;      
    if(n==0||n==1) System.out.println(n+" is not prime number");      
    else{  
      for(i=2;i<=m;i++)	if(n%i==0) {      
        System.out.println(n+" is not prime number");      
        flag=1;      
        break;      
        }       
      if(flag==0) System.out.println(n+" is prime number");
    }//end of else  
  }    
}

Bredo

Ähnliche Antworten wie “Primzahlprogramm in Java”

Fragen ähnlich wie “Primzahlprogramm in Java”

“Primzahlprogramm in Java” Code-Antworten

Drucken von Primzahlen in Java

Primzahlprogramm in Java

So finden Sie Primzahlen in Java

Prime -Zahlen -Programm in Java

Ähnliche Antworten wie “Primzahlprogramm in Java”

Fragen ähnlich wie “Primzahlprogramm in Java”

Weitere verwandte Antworten zu “Primzahlprogramm in Java” auf Java

Durchsuchen Sie beliebte Code-Antworten nach Sprache

Shell/Bash

C#

C++

C

CSS

HTML

Java

JavaScript

Objective-C

PHP

Python

Sql

Swift

Ruby

TypeScript

Go

Kotlin

Assembly

R

VBA

Scala

Rust

Dart

Elixir

Clojure

Haskell

Matlab

Erlang

Cobol

Fortran

Scheme

Perl

Groovy

Lua

Julia

Delphi

Abap

Lisp

Prolog

Pascal

ActionScript

Basic

Solidity

PowerShell

GDScript

Excel

Durchsuchen Sie andere Codesprachen