Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
project euler 4, haskell
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
--http://www.haskell.org/haskellwiki/Euler_problems/1_to_10 --A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99. --Find the largest palindrome made from the product of two 3-digit numbers. problem_4 = maximum [x | y<-[100..999], z<-[y..999], let x=y*z, let s=show x, s==reverse s] main = print $ problem_4
ghc
Show compiler warnings
[
+
] Compiler args
[
+
]
Show input
Compilation time: 0.33 sec, absolute running time: 0.24 sec, cpu time: 0.1 sec, memory peak: 2 Mb, absolute service time: 0.72 sec
fork mode
|
history
|
discussion
906609