euler49.myr


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53

use std

const isprime = {n
	if n == 1 || n % 2 == 0
		->false
	;;
	for var i = 3; i * i <= n; i++
		if n % i == 0
			-> false
		;;
	;;
	-> true
}

const isperm = {a, b
	var dmap: int[10]
	for var i = 0; i < 10; i++
		dmap[i] = 0
	;;
	while a > 0
		dmap[a % 10] ++
		a /= 10
	;;
	while b > 0
		var t = b % 10
		dmap[t] --
		if dmap[t] < 0
			-> false
		;;
		b /= 10
	;;
	-> true
}

const main = {
	for var i = 1001; i < 9999; i++
		if !isprime(i)
			continue
		;;
		for var j = 2; i + j * 2 <= 9999; j ++
			var t1 = i + j
			var t2 = t1 + j
			if !isprime(t1) || !isprime(t2)
				continue
			;;
			if !isperm(i, t1) || !isperm(i, t2)
				continue
			;;
			std.put("{} {} {}\n", i, t1, t2)
		;;
	;;
}