| CARVIEW |
Select Language
HTTP/2 200
date: Sat, 11 Oct 2025 23:02:59 GMT
content-type: text/html; charset=UTF-8
server: cloudflare
x-frame-options: DENY
x-content-type-options: nosniff
x-xss-protection: 1;mode=block
vary: accept-encoding
cf-cache-status: DYNAMIC
content-encoding: gzip
set-cookie: _csrf-frontend=2769604ab78b5b71e3e82fc08edc7d7b0b0c5adaf697f3ed72696932346bf296a%3A2%3A%7Bi%3A0%3Bs%3A14%3A%22_csrf-frontend%22%3Bi%3A1%3Bs%3A32%3A%223UfxzonX8Y3msyXz2gwtZnBNfeNpzWuA%22%3B%7D; HttpOnly; Path=/
cf-ray: 98d1fcf8b897c16f-BLR
Project Euler, Problem #1, Haskell - Pastebin.com
SHARE
TWEET
Project Euler, Problem #1, Haskell
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- -- If we list all the natural numbers below 10 that are multiples of 3
- -- or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find
- -- the sum of all the multiples of 3 or 5 below 1000.
- main :: IO ()
- main = print $ sum [x | x <- [0 .. 999], mod x 3 == 0 || mod x 5 == 0]
- -- 233168
- -- real 0m0,004s
- -- user 0m0,000s
- -- sys 0m0,003s
Advertisement
Add Comment
Please, Sign In to add comment
-
⭐⭐⭐Exploit 500$ in 15 Minutes⭐⭐
Java | 5 sec ago | 0.10 KB
-
💵 Make 3000$ in 20 minutes 💵
JavaScript | 9 sec ago | 0.24 KB
-
⭐⭐⭐Make $15OO in 2O minutesV E⭐⭐
Java | 18 sec ago | 0.10 KB
-
📌 Swapzone +37% glitch
JavaScript | 18 sec ago | 0.24 KB
-
📝 Exchange profit method
JavaScript | 27 sec ago | 0.24 KB
-
⭐⭐⭐MAKE $9OO INSTANTLY D M⭐⭐
Java | 29 sec ago | 0.10 KB
-
⭐ Free Crypto Method ⭐
JavaScript | 37 sec ago | 0.24 KB
-
⭐⭐⭐MAKE $9OO INSTANTLY D M⭐⭐
Java | 41 sec ago | 0.10 KB
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy. OK, I Understand
