Add level_33.py

Author: jhpx

README.md

@@ -108,8 +108,13 @@ Google the grandpa rock and find the differences between two Mandelbrot images.
 See [Mandelbrot Set](https://en.wikipedia.org/wiki/Mandelbrot_set)
 
 ### Level 32
-Nonogram is a type of clue-based grid-filling puzzle.
-See [Nonogram](https://en.wikipedia.org/wiki/Nonogram)
-The CP-SAT solver in OR-Tools can solve such problems using boolean variables and constraints.
+Nonogram is a type of clue-based grid-filling puzzle.  
+See [Nonogram](https://en.wikipedia.org/wiki/Nonogram)  
+The CP-SAT solver in OR-Tools can solve such problems using boolean variables and constraints.  
 See [考えるコード ― 制約と最適化の冒険](https://ruoyu0088.github.io/thinking_code/index.html)
 
+### Level 33
+Remove the brightest pixels and find the square images.
+
+
+Congratulations! All levels are Cleared!

level_22.py

@@ -28,13 +28,17 @@ def solve(something):
         if dx == dy == 0:
             cx += 25
             cy = 100
-    unknown.show()
+    return unknown
+
+def plot(im):
+    im.show()
 
 
 if __name__ == "__main__":
     r = requests.get(url)
     something = r.content
     answer = solve(something)
+    plot(answer)
     # bonus
 
     # http://butter:fly@www.pythonchallenge.com/pc/hex/bonus.html

level_32.py

@@ -90,15 +90,15 @@ def parse(text):
     i_hor = next(i for i, line in enumerate(lines) if i > i_dim and line.startswith('# Horizontal'))
     i_ver = next(i for i, line in enumerate(lines) if i > i_hor and line.startswith('# Vertical'))
     # Parse rows and columns
-    r, c = map(int, lines[i_dim + 1].split())
+    rows, cols = map(int, lines[i_dim + 1].split())
     # Extract horizontal and vertical constraints
     row_clues = [list(map(int, line.split())) for line in lines[i_hor + 1:i_ver]]
     col_clues = [list(map(int, line.split())) for line in lines[i_ver + 1:]]
-    return r, c, row_clues, col_clues
+    return rows, cols, row_clues, col_clues
 
 
-def solve(r_num, c_num):
-    print_nonogram(solve_nonogram(r_num, c_num))
+def solve(row_clues, col_clues):
+    print_nonogram(solve_nonogram(row_clues, col_clues))
     # See an up arrow
 
     url = PREFIX + 'up.html'
@@ -107,8 +107,8 @@ def solve(r_num, c_num):
     url2 = PREFIX + catch(requests.get(url).text)
     # http://kohsamui:thailand@www.pythonchallenge.com/pc/rock/up.txt"
 
-    r, c, r_num, c_num = parse(requests.get(url2).text)
-    print_nonogram(solve_nonogram(r_num, c_num))
+    rows, cols, row_clues, col_clues = parse(requests.get(url2).text)
+    print_nonogram(solve_nonogram(row_clues, col_clues))
     # See a python
 
     url3 = PREFIX + 'python.html'
@@ -119,8 +119,8 @@ def solve(r_num, c_num):
 if __name__ == "__main__":
     r = requests.get(url)
     something = r.text
-    r, c, r_num, c_num = parse(something)
-    answer = solve(r_num, c_num)
+    rows, cols, row_clues, col_clues = parse(something)
+    answer = solve(row_clues, col_clues)
     print(answer)
     # "Free" as in "Free speech", not as in "free...
     # Google this sentence and the answer is beer

level_33.py

@@ -0,0 +1,74 @@
+#!/bin/env python
+# coding=utf-8
+# http://kohsamui:thailand@www.pythonchallenge.com/pc/rock/beer.html
+#
+# If you are blinded by the light,
+# remove its power, with its might.
+# Then from the ashes, fair and square,
+# another truth at you will glare.
+import re
+from io import BytesIO
+
+import numpy as np
+import requests
+from PIL import Image
+
+PREFIX = "http://kohsamui:thailand@www.pythonchallenge.com/pc/rock/"
+url = PREFIX + 'beer2.jpg'
+
+
+def catch(text, pattern=r'<a href="(.*?)">', cnt=0):
+    return re.findall(pattern, text, re.DOTALL)[cnt]
+
+
+def solve(something):
+    im = Image.open(BytesIO(something))
+    im.show()
+    # no, png
+
+    url2 = PREFIX + 'beer2.png'
+    im = Image.open(BytesIO(requests.get(url2).content))
+
+    # use numpy to accelerate
+    data = np.array(im.getdata())
+    # use histogram to skip non-existing pixels
+    histogram = im.histogram()
+
+    hidden_images = []
+    for value in range(254, -1, -1):
+        if histogram[value] == 0:
+            continue
+        # Remove the brightest pixels
+        data = data[data < value]
+        # Reshape the array to a square image
+        sq = np.sqrt(len(data))
+        if sq.is_integer() and sq > 0:
+            max_val = np.max(data)
+            ashes = np.array([255 if v == max_val else 0 for v in data], dtype=np.uint8)
+            image = Image.fromarray(ashes.reshape(int(sq), int(sq)))
+            hidden_images.append(image)
+
+    # combine the images
+    total_width = hidden_images[0].width*len(hidden_images)
+    max_height = hidden_images[0].height
+    composite_image = Image.new('L', (total_width, max_height))
+    x_offset = 0
+    for img in hidden_images:
+        composite_image.paste(img, (x_offset, 0))
+        x_offset += img.width
+
+    return composite_image
+
+
+def plot(im):
+    im.show()
+
+
+if __name__ == "__main__":
+    r = requests.get(url)
+    something = r.content
+    answer = solve(something)
+    plot(answer)
+    # gremlins
+
+    # http://kohsamui:thailand@www.pythonchallenge.com/pc/rock/gremlins.html