Remove hint.html and index.html
As per discussions on GitHub the index.html and hint.html files should be deleted in favour of README.md files (from any .text/.txt/.markdown/.md files which will be turned into README.md in an upcoming commit).
This commit is contained in:
Cody Boone Ferguson committed
1 parent
ee8a36310f
commit
77fb0f11a2
143 files changed
-28606
No files matched your search
@@ -1,143 +0,0 @@
|
||||
<!doctype html public "-//W3C//DTD HTML 4.0 Transitional //EN">
|
||||
<html>
|
||||
<head>
|
||||
<meta name="GENERATOR" content="mkd2html 2.2.2">
|
||||
<meta http-equiv="Content-Type"
|
||||
content="text/html; charset=utf-8"> <link rel="stylesheet"
|
||||
type="text/css"
|
||||
href="../hint.css" />
|
||||
<title></title>
|
||||
<title>Least detailed</title>
|
||||
</head>
|
||||
<body>
|
||||
<CENTER>
|
||||
<IMG SRC="/png/ioccc.png" ALT="IOCCC" height=78 width=267>
|
||||
<P><FONT size="6"><I>The International Obfuscated C Code Contest</I></FONT></P>
|
||||
<div id="bar">
|
||||
<ul>
|
||||
<li><a href="../index.html">About the 27th IOCCC</a></li>
|
||||
<li><a href="../whowon.html">27th IOCCC Winners</a></li>
|
||||
<li><a href="/index.html">IOCCC home</a></li>
|
||||
<li><a href="/winners.html">List of All Winners</a></li>
|
||||
<li><a href="/judges.html">The Judges</a></li>
|
||||
</ul>
|
||||
</div>
|
||||
<P><FONT size="6"><B>A 27<sup>th</sup> IOCCC Winner</B></FONT></P>
|
||||
</CENTER>
|
||||
|
||||
|
||||
<h1>Least detailed</h1>
|
||||
|
||||
<p>Ilya Kurdyukov<br/>
|
||||
<a href="https://github.com/ilyakurdyukov">https://github.com/ilyakurdyukov</a><br/>
|
||||
Twitter: @ilyakurdyukov</p>
|
||||
|
||||
<p>The code for this entry can be found in <a href="prog.c">prog.c</a></p>
|
||||
|
||||
<h2>Judges' comments:</h2>
|
||||
|
||||
<h3>To use:</h3>
|
||||
|
||||
<pre><code>make prog prog_png prog_ppm
|
||||
./prog Nrect infile outfile
|
||||
</code></pre>
|
||||
|
||||
<h3>Try:</h3>
|
||||
|
||||
<pre><code># Take a selfie
|
||||
./prog 1000 selfie.jpg output.jpg
|
||||
# Admire your portrait in cubist style
|
||||
|
||||
(echo P6 1024 1024 255; dd if=/dev/urandom bs=3M count=1) > random.ppm
|
||||
# Look at random.ppm. Do you see any patterns?
|
||||
./prog_ppm 1000 random.ppm output.ppm
|
||||
# See which patterns the program has found
|
||||
|
||||
for i in 0001 0002 0004 0008 0016 0032 0064 0128 0256 0512 1024 2048 4096 8192 ; do ./prog $i sample.jpg out$i.jpg; done
|
||||
# Then flip through the out*.jpg pictures and see when you start recognizing the image.
|
||||
</code></pre>
|
||||
|
||||
<h3>Selected Judges Remarks:</h3>
|
||||
|
||||
<p>This entry has reminded us of a winning entry back in the early 90s. Can you guess which one?</p>
|
||||
|
||||
<p>For a given image, try graphing the execution time relative to the number of rectangles.
|
||||
What is the complexity? Is it obvious from the source code?</p>
|
||||
|
||||
<h2>Author’s comments:</h2>
|
||||
|
||||
<h3>Usage</h3>
|
||||
|
||||
<p>This program divides the image into a specified number of rectangles. This process is content aware, so algorithm tries to match most of the information. However, it doesn’t finds the best theoretically possible layout.</p>
|
||||
|
||||
<pre><code>./prog 1000 input.jpg output.jpg
|
||||
</code></pre>
|
||||
|
||||
<h3>Building</h3>
|
||||
|
||||
<p>You can build three versions, depending on the image format.</p>
|
||||
|
||||
<p>Default is JPEG version, if you have the <em>libjpeg</em> development package installed in your system, then <code>make</code> without arguments should do the thing.</p>
|
||||
|
||||
<p>If you want to use <em>libjpeg</em> compiled from sources, then use <code>LIBS</code> define to specify the path to includes and the library.</p>
|
||||
|
||||
<pre><code>make prog LIBJPEG="-Ijpeg-6b jpeg-6b/libjpeg.a"
|
||||
</code></pre>
|
||||
|
||||
<p>Use this command to build a PNG version (you need <em>libpng</em>):</p>
|
||||
|
||||
<pre><code>make prog_png LIBPNG="-lpng"
|
||||
</code></pre>
|
||||
|
||||
<p>And the PPM version (no additional dependencies, can read raw/ASCII PPM, writes raw PPM):</p>
|
||||
|
||||
<pre><code>make prog_ppm
|
||||
</code></pre>
|
||||
|
||||
<h3>Building on OSX</h3>
|
||||
|
||||
<ul>
|
||||
<li>Thanks to Cody Ferguson for this information!</li>
|
||||
</ul>
|
||||
|
||||
|
||||
<p>First, make sure you have the compiler tools installed e.g. by:</p>
|
||||
|
||||
<pre><code>$ sudo xcode-select --install
|
||||
</code></pre>
|
||||
|
||||
<p>Make sure you install <a href="https://www.macports.org/install.php">MacPorts</a>. Then do:</p>
|
||||
|
||||
<pre><code>$ sudo port install jpeg libpng ImageMagick
|
||||
</code></pre>
|
||||
|
||||
<p>The program itself doesn’t need ImageMagick, install it only if you plan to make gifs from the results using “makegif.sh”.</p>
|
||||
|
||||
<p>After that’s installed you need to run make with these options:</p>
|
||||
|
||||
<pre><code>$ make LIBS="-I/opt/local/include -L/opt/local/lib"
|
||||
</code></pre>
|
||||
|
||||
<h3>Notes</h3>
|
||||
|
||||
<p>Made this thing while experimenting with the idea of representing an image with rectangles (lossy compression). It’s not very good in that sense, but the results look funny, like a kind of cubism pixelart.</p>
|
||||
|
||||
<p>Do not use values above 50000, it gonna be slow.</p>
|
||||
|
||||
<p>To understand how this works, just try running with 1,2,3,4… number of rectangles. At each iteration, the rectangle with the biggest difference from the picture data is split (halves may have different size) horizontally or vertically to get the minimum difference.</p>
|
||||
|
||||
<p>You can use this command to make a gif from output images (uses ImageMagick):<br/>
|
||||
<code>convert -delay 10 -dither none -loop 0 $(ls out*.png | sort -V) $(ls out*.png | sort -rV) +map out.gif</code><br/>
|
||||
Also provided <code>makegif.sh</code> to aid with gif creation.</p>
|
||||
<BR>
|
||||
<HR>
|
||||
<TABLE><TR>
|
||||
<TD><a rel="license" href="https://creativecommons.org/licenses/by-sa/3.0/"><img alt="Creative Commons License" style="border-width:0" src="/png/by-sa-3.0-88x31.png" /></a></TD>
|
||||
<TD><P>© Copyright 1984-2020,
|
||||
<A HREF="/judges.html">Leo Broukhis, Simon Cooper, Landon Curt Noll</A>
|
||||
- All rights reserved<BR>
|
||||
This work is licensed under a <a rel="license" href="https://creativecommons.org/licenses/by-sa/3.0/">Creative Commons Attribution-ShareAlike 3.0 Unported License</a>.</P></TD>
|
||||
<TD> <!--<a href="https://validator.w3.org/check?uri=referer"><img src="https://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional" height="31" width="88"></a>--></TD>
|
||||
</TR></TABLE>
|
||||
</body>
|
||||
</html>
|
||||
Reference in new issue
Block a user