<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://mediawiki.zeropage.org/index.php?action=history&amp;feed=atom&amp;title=StacksOfFlapjacks%2F%EC%A1%B0%ED%98%84%ED%83%9C</id>
	<title>StacksOfFlapjacks/조현태 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://mediawiki.zeropage.org/index.php?action=history&amp;feed=atom&amp;title=StacksOfFlapjacks%2F%EC%A1%B0%ED%98%84%ED%83%9C"/>
	<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=StacksOfFlapjacks/%EC%A1%B0%ED%98%84%ED%83%9C&amp;action=history"/>
	<updated>2026-05-15T15:27:13Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.39.8</generator>
	<entry>
		<id>https://mediawiki.zeropage.org/index.php?title=StacksOfFlapjacks/%EC%A1%B0%ED%98%84%ED%83%9C&amp;diff=39449&amp;oldid=prev</id>
		<title>imported&gt;Unknown at 05:28, 7 February 2021</title>
		<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=StacksOfFlapjacks/%EC%A1%B0%ED%98%84%ED%83%9C&amp;diff=39449&amp;oldid=prev"/>
		<updated>2021-02-07T05:28:06Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;== 느낀점 및 설명 ==&lt;br /&gt;
 .. 열심히 만들어서 완성했을때.. 어쩐지 쉽게 끝나는 듯 했다..&lt;br /&gt;
 그러나!! 알고보니 왼쪽과 오른쪽을 꺼꾸로보고 생각했던것...&lt;br /&gt;
 .. 한번 생각하기는 쉽지만, 생각을 고치기는 어렵다고..&lt;br /&gt;
 고치는데 머리아퍼따.ㅎ&lt;br /&gt;
 이 소스는 2번씩 뒤집는걸 기본으로 한다. (예외적으로 끝에 있을때는 한번 안뒤집는다.)&lt;br /&gt;
 만든이의 귀차니즘으로 한회의 계산을 줄인 소스..후후후..&lt;br /&gt;
 그럼..ㅎ&lt;br /&gt;
== 소스 ==&lt;br /&gt;
 #include &amp;amp;lt;stdio.h&amp;amp;gt;&lt;br /&gt;
 #include &amp;amp;lt;string.h&amp;amp;gt;&lt;br /&gt;
 &lt;br /&gt;
 void print_flap(char*, int);&lt;br /&gt;
 &lt;br /&gt;
 const int SIZE_BUFFER=100;&lt;br /&gt;
 &lt;br /&gt;
 void main()&lt;br /&gt;
 {&lt;br /&gt;
 	while(1)&lt;br /&gt;
 	{&lt;br /&gt;
 		int number_cake=0;&lt;br /&gt;
 		char cakes_size[SIZE_BUFFER];&lt;br /&gt;
 		printf(&amp;quot;팬케이크의 크기를 순서대로 입력해주세요. (0은 종료 또는 입력완료)\n&amp;amp;gt;&amp;amp;gt;&amp;quot;);&lt;br /&gt;
 		while (1)&lt;br /&gt;
 		{&lt;br /&gt;
 			scanf(&amp;quot;%d&amp;quot;,cakes_size+number_cake);&lt;br /&gt;
 			if (0==cakes_size[number_cake])&lt;br /&gt;
 				break;&lt;br /&gt;
 			++number_cake;&lt;br /&gt;
 		}&lt;br /&gt;
 		if (0==number_cake)&lt;br /&gt;
 			break;&lt;br /&gt;
 		print_flap(cakes_size, number_cake);&lt;br /&gt;
 	}&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 void print_flap(char* cakes_size, int number_cake)&lt;br /&gt;
 {&lt;br /&gt;
 	printf (&amp;quot;결과 : &amp;quot;);&lt;br /&gt;
 	for (register int i=number_cake-1; i&amp;amp;gt;=0; --i)&lt;br /&gt;
 	{&lt;br /&gt;
 		int maximum=i;&lt;br /&gt;
 		for (register int j=0; j&amp;amp;lt;=i; ++j)&lt;br /&gt;
 		{&lt;br /&gt;
 			if (cakes_size[maximum]&amp;amp;lt;cakes_size[j])&lt;br /&gt;
 				maximum=j;&lt;br /&gt;
 		}&lt;br /&gt;
 		if (maximum!=i)&lt;br /&gt;
 		{&lt;br /&gt;
 			if (maximum!=0)&lt;br /&gt;
 				printf(&amp;quot;%d &amp;quot;,number_cake-maximum);&lt;br /&gt;
 			printf(&amp;quot;%d &amp;quot;,number_cake-i);&lt;br /&gt;
 			char temp[SIZE_BUFFER];&lt;br /&gt;
 			strcpy(temp,cakes_size);&lt;br /&gt;
 			for (register j=0; j&amp;amp;lt;=i; ++j)&lt;br /&gt;
 			{&lt;br /&gt;
 				if (j&amp;amp;lt;=maximum)&lt;br /&gt;
 					cakes_size[j-maximum+i]=temp[j];&lt;br /&gt;
 				else&lt;br /&gt;
 					cakes_size[i-j]=temp[j];&lt;br /&gt;
 			}&lt;br /&gt;
 		}&lt;br /&gt;
 	}&lt;br /&gt;
 	printf (&amp;quot;0 \n&amp;quot;);&lt;br /&gt;
 }&lt;br /&gt;
== 저에게 할말 ==&lt;br /&gt;
----&lt;br /&gt;
[[AOI]] [[StacksOfFlapjacks]]&lt;br /&gt;
&lt;/div&gt;</summary>
		<author><name>imported&gt;Unknown</name></author>
	</entry>
</feed>