604 
2019/09/15 18:39:00

unique count

pekempey 
Success 


603 
2019/09/15 18:38:55

unique (unique l) = l

yamarten 
Failure 


602 
2019/09/15 18:37:22

Grand Garden

kozima 
Success 


601 
2019/09/15 18:36:41

unique count

prime 
Success 


600 
2019/09/15 18:20:18

count l n = count (rev l) n

yamarten 
Failure 


599 
2019/09/15 18:10:24

unique (unique l) = l

pekempey 
Success 


598 
2019/09/15 18:09:33

count l n = count (rev l) n

mttm 
Success 


597 
2019/09/15 18:01:23

count l n = count (rev l) n

okaduki 
Success 


596 
2019/09/15 17:58:09

unique count

sorata 
Success 


595 
2019/09/15 17:57:32

count l n = count (rev l) n

spica314 
Success 


594 
2019/09/15 17:56:06

count l n = count (rev l) n

cympfh 
Success 


593 
2019/09/15 17:45:39

gcd(n, n+1) = 1

yamarten 
Success 


592 
2019/09/15 17:44:42

gcd(n, n+1) = 1

yamarten 
Failure 


591 
2019/09/15 17:44:15

gcd(n, n+1) = 1

yishibashi 
Success 


590 
2019/09/15 17:44:01

count l n = count (rev l) n

yishibashi 
Failure 


589 
2019/09/15 17:36:32

gcd(n, n+1) = 1

cympfh 
Success 


588 
2019/09/15 17:35:47

unique (unique l) = l

sorata 
Success 


587 
2019/09/15 17:35:45

unique count

kozima 
Success 


586 
2019/09/15 17:35:43

gcd(n, n+1) = 1

cympfh 
Failure 


585 
2019/09/15 17:33:43

gcd(n, n+1) = 1

cympfh 
Failure 


584 
2019/09/15 17:28:50

unique (unique l) = l

prime 
Success 


583 
2019/09/15 17:26:48

unique count

kkob 
Success 


582 
2019/09/15 17:26:40

gcd(n, n+1) = 1

okaduki 
Success 


581 
2019/09/15 17:24:55

gcd(n, n+1) = 1

mttm 
Success 


580 
2019/09/15 17:23:16

unique (unique l) = l

kkob 
Success 


579 
2019/09/15 17:22:52

unique (unique l) = l

kozima 
Success 


578 
2019/09/15 17:21:49

count l n = count (rev l) n

pekempey 
Success 


577 
2019/09/15 17:20:27

count l n = count (rev l) n

sorata 
Success 


576 
2019/09/15 17:19:57

count l n = count (rev l) n

pekempey 
Failure 


575 
2019/09/15 17:18:50

count l n = count (rev l) n

sorata 
Failure 


574 
2019/09/15 17:15:29

count l n = count (rev l) n

prime 
Success 


573 
2019/09/15 17:14:44

gcd(n, n+1) = 1

spica314 
Success 


572 
2019/09/15 17:13:56

count l n = count (rev l) n

kkob 
Success 


571 
2019/09/15 17:12:22

count l n = count (rev l) n

kozima 
Success 


570 
2019/09/15 17:06:42

gcd(n, n+1) = 1

sorata 
Success 


569 
2019/09/15 17:06:29

gcd(n, n+1) = 1

kkob 
Success 


568 
2019/09/15 17:06:16

gcd(n, n+1) = 1

pekempey 
Success 


567 
2019/09/15 17:05:53

gcd(n, n+1) = 1

pekempey 
Failure 


566 
2019/09/15 17:05:51

gcd(n, n+1) = 1

prime 
Success 


565 
2019/09/15 17:05:37

gcd(n, n+1) = 1

sorata 
Failure 


564 
2019/09/15 17:04:35

gcd(n, n+1) = 1

pekempey 
Failure 


563 
2019/09/15 17:03:52

gcd(n, n+1) = 1

kozima 
Success 


562 
2019/09/15 16:53:52

Multiplication in F_2 is idempotent

spica314 
Success 


561 
2019/09/15 16:35:29

1 + 1 = 2

asi1024 
Success 


560 
2019/09/14 21:51:35

Equivalent two quicksorts

kozima 
Success 


559 
2019/09/14 20:37:23

Cumulative sum of list

yamarten 
Success 


558 
2019/09/14 20:34:38

Cumulative sum of list

yamarten 
Rejected 


557 
2019/09/14 16:33:21

Grand Garden

drafear 
Success 


556 
2019/09/14 16:33:00

unique count

drafear 
Success 


555 
2019/09/14 16:32:40

unique (unique l) = l

drafear 
Success 

