Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Coding Challenge - 04 (Perfect 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 - 04 (Perfect numbers) //Числа, которые равны сумме всех своих делителей (исключая само число), древнегреческие математики называли совершенными. // //'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 perfectNumbers(short perfectNumbers) { short accum=0; //Предварительная проверка // // for(short i=1;i<=perfectNumbers-1;i++) if (perfectNumbers%i==0) accum+=i; if (accum==perfectNumbers) return true; else return false; } public static void main(String args[]) { short imax=31_000; for (short i=1;i<imax;i++) if (perfectNumbers(i)) System.out.print(i+", "); } }
[
+
]
Show input
Compilation time: 0.73 sec, absolute running time: 2.05 sec, cpu time: 2.01 sec, memory peak: 33 Mb, absolute service time: 2.79 sec
edit mode
|
history
|
discussion
6, 28, 496, 8128,