<?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=%EC%9D%B4%EC%98%81%ED%98%B8%2F%EB%81%84%EC%A0%81%EB%81%84%EC%A0%81</id>
	<title>이영호/끄적끄적 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://mediawiki.zeropage.org/index.php?action=history&amp;feed=atom&amp;title=%EC%9D%B4%EC%98%81%ED%98%B8%2F%EB%81%84%EC%A0%81%EB%81%84%EC%A0%81"/>
	<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=%EC%9D%B4%EC%98%81%ED%98%B8/%EB%81%84%EC%A0%81%EB%81%84%EC%A0%81&amp;action=history"/>
	<updated>2026-05-18T00:06:19Z</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=%EC%9D%B4%EC%98%81%ED%98%B8/%EB%81%84%EC%A0%81%EB%81%84%EC%A0%81&amp;diff=66656&amp;oldid=prev</id>
		<title>imported&gt;Unknown at 05:30, 7 February 2021</title>
		<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=%EC%9D%B4%EC%98%81%ED%98%B8/%EB%81%84%EC%A0%81%EB%81%84%EC%A0%81&amp;diff=66656&amp;oldid=prev"/>
		<updated>2021-02-07T05:30:32Z</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;
그래서 나온 버그 잡을바에 새로 코딩하는게 나을테고 !@#!$$@#^%!^$!%&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;stdlib.h&amp;amp;gt;&lt;br /&gt;
 #include &amp;amp;lt;string.h&amp;amp;gt;&lt;br /&gt;
 #include &amp;amp;lt;math.h&amp;amp;gt;&lt;br /&gt;
 &lt;br /&gt;
 int check(int array[]);&lt;br /&gt;
 void print_card();&lt;br /&gt;
 &lt;br /&gt;
 &lt;br /&gt;
 typedef struct _home {&lt;br /&gt;
 	struct _home *next;&lt;br /&gt;
 	struct _home *prev;&lt;br /&gt;
 	int num;&lt;br /&gt;
 	char name[20];&lt;br /&gt;
 } HOME;&lt;br /&gt;
 &lt;br /&gt;
 HOME *head;&lt;br /&gt;
 head = (HOME *)malloc(sizeof(HOME));&lt;br /&gt;
 &lt;br /&gt;
 &lt;br /&gt;
 &lt;br /&gt;
 &lt;br /&gt;
 main(int argc, char *argv[]){&lt;br /&gt;
 FILE *fp;&lt;br /&gt;
 int i, j;&lt;br /&gt;
 HOME *buf = head;&lt;br /&gt;
 int array[52];	// 다음 체크할 배열.&lt;br /&gt;
 int count;	// 총 몇 번 체크해야하는가?&lt;br /&gt;
 char itoa_buf[3];&lt;br /&gt;
 &lt;br /&gt;
 	if(argc != 2)&lt;br /&gt;
 		fprintf(stderr, &amp;quot;Usage: %s input_file&amp;quot;, argv[0]), exit(1);&lt;br /&gt;
 &lt;br /&gt;
 	if((fp=fopen(argv[1], &amp;quot;ra&amp;quot;) == NULL)&lt;br /&gt;
 		fprintf(stderr, &amp;quot;fopen error(%s)&amp;quot;, argv[1]), exit(1);&lt;br /&gt;
 &lt;br /&gt;
 &lt;br /&gt;
 &lt;br /&gt;
 	strcpy(head-&amp;amp;gt;name, &amp;quot;2 of Clubs&amp;quot;);&lt;br /&gt;
 &lt;br /&gt;
 	for(j=1; j&amp;amp;lt;=4; j++){&lt;br /&gt;
 		for(i=1; i&amp;amp;lt;=13; i++){&lt;br /&gt;
 			if(i==1 &amp;amp;amp;&amp;amp;amp; j ==1) continue;&lt;br /&gt;
 &lt;br /&gt;
 			buf-&amp;amp;gt;next = (HOME *)malloc(sizeof(HOME));&lt;br /&gt;
 			buf-&amp;amp;gt;next-&amp;amp;gt;prev = buf;&lt;br /&gt;
 			buf = buf-&amp;amp;gt;next;&lt;br /&gt;
 &lt;br /&gt;
 &lt;br /&gt;
 			itoa(itoa_buf, i+1, 10);&lt;br /&gt;
 &lt;br /&gt;
 			// 카드 초기화.&lt;br /&gt;
 			sprintf(buf-&amp;amp;gt;name, &amp;quot;%s of %s&amp;quot;,&lt;br /&gt;
 							i==10?&amp;quot;Jack&amp;quot;:i==11?&amp;quot;Queen&amp;quot;:i==12?&amp;quot;King&amp;quot;:i==13?&amp;quot;Ace&amp;quot;:itoa_buf,&lt;br /&gt;
 							j==1?&amp;quot;Clubs&amp;quot;:j==2?&amp;quot;Diamonds&amp;quot;:j==3?&amp;quot;Hearts&amp;quot;:&amp;quot;Spades&amp;quot;);&lt;br /&gt;
 		}&lt;br /&gt;
 	}&lt;br /&gt;
 &lt;br /&gt;
 &lt;br /&gt;
 // 52개의 순서 초기화. (따로 밖으로 내는게 편하다는 생각이 든다.)&lt;br /&gt;
 	buf = head;&lt;br /&gt;
 	for(i=0; i&amp;amp;lt;52; i++){&lt;br /&gt;
 		buf.num = array[i];&lt;br /&gt;
 		buf = buf-&amp;amp;gt;next;&lt;br /&gt;
 	}&lt;br /&gt;
 &lt;br /&gt;
 &lt;br /&gt;
 ############################################&lt;br /&gt;
 // (count - 1) 번 체크 (미완성)&lt;br /&gt;
 // File에서 array로 바뀐 것을 읽어와 함수를 수행 하는 것을 count-1번 반복한다.&lt;br /&gt;
 	for(i=1; i&amp;amp;lt;count; i++)&lt;br /&gt;
 	{&lt;br /&gt;
 		for(j=0; j&amp;amp;lt;52; j++)&lt;br /&gt;
 			array[j] = ;&lt;br /&gt;
 &lt;br /&gt;
 		check(array);&lt;br /&gt;
 	}&lt;br /&gt;
 ############################################&lt;br /&gt;
 &lt;br /&gt;
 	exit(0);	// 우아한 종료!&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 &lt;br /&gt;
 &lt;br /&gt;
 &lt;br /&gt;
 ############################################&lt;br /&gt;
 // buf와 array를 비교한다. (미완성)&lt;br /&gt;
 // 달라진곳은 save 포인터에 주소를 저장하고 다시 체크를 시작해 달라진곳이 나오면 자리를 교체한다.&lt;br /&gt;
 // 링크만 교체 시킨다.&lt;br /&gt;
 int check(int array[])&lt;br /&gt;
 {&lt;br /&gt;
 HOME *buf = head;&lt;br /&gt;
 HOME *save = head;&lt;br /&gt;
 &lt;br /&gt;
 }&lt;br /&gt;
 ############################################&lt;br /&gt;
 &lt;br /&gt;
 // 간단한 출력.&lt;br /&gt;
 void print_card()&lt;br /&gt;
 {&lt;br /&gt;
 int i;&lt;br /&gt;
 HOME *buf = head;&lt;br /&gt;
 &lt;br /&gt;
 	for(i=0; i&amp;amp;lt;52; i++){&lt;br /&gt;
 		printf(&amp;quot;%s\n&amp;quot;, buf-&amp;amp;gt;name);&lt;br /&gt;
 		buf=buf-&amp;amp;gt;next;&lt;br /&gt;
 	}&lt;br /&gt;
 }&lt;br /&gt;
&lt;/div&gt;</summary>
		<author><name>imported&gt;Unknown</name></author>
	</entry>
</feed>