https://mediawiki.zeropage.org/index.php?action=history&feed=atom&title=ImmediateDecodability%2F%EB%AC%B8%EB%B3%B4%EC%B0%BD
ImmediateDecodability/문보창 - Revision history
2026-05-14T17:51:49Z
Revision history for this page on the wiki
MediaWiki 1.39.8
https://mediawiki.zeropage.org/index.php?title=ImmediateDecodability/%EB%AC%B8%EB%B3%B4%EC%B0%BD&diff=32546&oldid=prev
imported>Unknown at 05:23, 7 February 2021
2021-02-07T05:23:27Z
<p></p>
<p><b>New page</b></p><div>==== 소감 ====<br />
2005/02/28 Accepted 0:00.189 440 <br />
단순히 조건에 나와있는데로 Decodablility를 파악해 주면 되는 문제다. 코드를 계속 압축해 나가다 보니 수행시간이 갈수록 빨라졌고, 상위에 랭크될 수 있었다.<br />
<br />
==== 코드 ====<br />
// no644 - Immediate Decodability<br />
#include &lt;iostream&gt;<br />
#include &lt;cstring&gt;<br />
using namespace std;<br />
<br />
const int MAX = 10;<br />
<br />
int main()<br />
{<br />
char code[MAX][11];<br />
int i, j, k;<br />
int count = 1;<br />
int nCode, len;<br />
bool isDecodable;<br />
while (cin.peek() != EOF)<br />
{<br />
for (i=0; i&lt;MAX; i++)<br />
{<br />
cin.getline(code[i], 11, '\n');<br />
if (code[i][0] == '9')<br />
break;<br />
} <br />
<br />
nCode = i;<br />
for (i=0; i&lt;nCode; i++)<br />
{<br />
for (j=0; j&lt;nCode; j++)<br />
{<br />
if (i==j)<br />
continue;<br />
isDecodable = false;<br />
len = strlen(code[i]);<br />
for (k=0; k&lt;len; k++)<br />
{<br />
if (code[i][k] != code[j][k])<br />
{<br />
isDecodable = true;<br />
break;<br />
}<br />
}<br />
if (isDecodable == false)<br />
break;<br />
}<br />
if (isDecodable == false)<br />
break;<br />
}<br />
cout &lt;&lt; "Set " &lt;&lt; count++;<br />
if (!isDecodable)<br />
cout &lt;&lt; " is not immediately decodable\n";<br />
else<br />
cout &lt;&lt; " is immediately decodable\n";<br />
}<br />
return 0;<br />
}<br />
----<br />
[[ImmediateDecodability]] [[문보창]]<br />
</div>
imported>Unknown