fork download 
  1. function isPrime(n)
  2. 	for x in [2:n]
  3. 		if(n%x==0): return false
  4. 	end
  5. 	return true
  6. end
  7.  
  8. function gpf(n)
  9. 	for x in [n-1:2]
  10. 		if(n%x==0 and isPrime(x)): return x
  11. 	end
  12. return 1
  13. end
  14.  
  15. printl(13195)
Success #stdin #stdout 0.01s 6768KB
comments (?)
stdin 
Standard input is empty
stdout 
13195
https://ideone.com/Jt2GE
language:
Falcon (falcon-0.9.6.6)
created:
14 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!