Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Largest Prime Factor
program code; var myNumber, i, largest : int64; function isPrime( x : int64 ) : boolean; begin isPrime := true; for i := 2 to x-1 do if x mod i = 0 then begin isPrime := false; break; end; end; begin myNumber := 600851475143; largest := 1; for i := myNumber-1 downto 2 do begin if (myNumber mod i = 0) then begin writeln('i= ',i); if isPrime(i) then begin writeln(i,' ',isPrime(i)); break; end; end; end; writeln('result: ', largest); end.
run
|
edit
|
history
|
help
0
nomer6
Pi
x=2;n=3
diff_data_type
practica 9 ejercicio 5
Hailstone number
VINICIUS ELIAS SILVEIRA 600625519
Calculatrice 1.0
Урок 6. Задача 9 (1533). Два самых маленьких числа
Задача №3549. Замечательные числа - 5