Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Coding Challenge - 03 (Prime numbers)
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Clojure
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Rust
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Layout:
Vertical
Horizontal
//[Java] Coding Challenge - 03 (Prime numbers) //Число i является простым, если оно больше 1 и при этом делится без остатка только на 1 и на i (на самого себя). // //'main' method must be in a class 'Rextester'. //Compiler version 1.8.0_45 import java.util.*; import java.lang.*; class Rextester { public static boolean isPrime(byte pNumber) { if (pNumber<=1) return false; if (pNumber==2) return true; if (pNumber%2==0) return false; for (byte j = 2; j < pNumber; j++) { if (pNumber%j == 0) return false; //else return true; } return true; } public static void main(String args[]) { int imax=100; for(byte i=0;i<=imax;i++) if (isPrime(i)) System.out.print(i+", "); } }
[
+
]
Show input
Compilation time: 0.83 sec, absolute running time: 0.14 sec, cpu time: 0.09 sec, memory peak: 33 Mb, absolute service time: 0.97 sec
edit mode
|
history
|
discussion
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97,