<?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=ContestScoreBoard%2F%EC%A1%B0%ED%98%84%ED%83%9C</id>
	<title>ContestScoreBoard/조현태 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://mediawiki.zeropage.org/index.php?action=history&amp;feed=atom&amp;title=ContestScoreBoard%2F%EC%A1%B0%ED%98%84%ED%83%9C"/>
	<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=ContestScoreBoard/%EC%A1%B0%ED%98%84%ED%83%9C&amp;action=history"/>
	<updated>2026-05-15T01:05:05Z</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=ContestScoreBoard/%EC%A1%B0%ED%98%84%ED%83%9C&amp;diff=30832&amp;oldid=prev</id>
		<title>imported&gt;Unknown at 05:23, 7 February 2021</title>
		<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=ContestScoreBoard/%EC%A1%B0%ED%98%84%ED%83%9C&amp;diff=30832&amp;oldid=prev"/>
		<updated>2021-02-07T05:23:00Z</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;
 문제를 다 읽어도 입력되는 자료의 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;iostream&amp;amp;gt;&lt;br /&gt;
 &lt;br /&gt;
 struct datas{&lt;br /&gt;
 	int team_number;&lt;br /&gt;
 	int score;&lt;br /&gt;
 	int used_time;&lt;br /&gt;
 	datas* prv;&lt;br /&gt;
 	datas* next;&lt;br /&gt;
 };&lt;br /&gt;
 &lt;br /&gt;
 void input_data();&lt;br /&gt;
 datas* such_and_malloc_point(int);&lt;br /&gt;
 void print_data();&lt;br /&gt;
 void free_data();&lt;br /&gt;
 &lt;br /&gt;
 datas* start_point=NULL;&lt;br /&gt;
 datas* end_point=NULL;&lt;br /&gt;
 &lt;br /&gt;
 const int WRONG_TIME=20;&lt;br /&gt;
 &lt;br /&gt;
 void main()&lt;br /&gt;
 {&lt;br /&gt;
 	int test_number;&lt;br /&gt;
 	printf(&amp;quot;몇번 테스트 하시겠습니까?&amp;quot;);&lt;br /&gt;
 	scanf (&amp;quot;%d&amp;quot;,&amp;amp;amp;test_number);&lt;br /&gt;
 	while (test_number!=0)&lt;br /&gt;
 	{&lt;br /&gt;
 		printf(&amp;quot;\n&amp;quot;);&lt;br /&gt;
 		input_data();&lt;br /&gt;
 		print_data();&lt;br /&gt;
 		free_data();&lt;br /&gt;
 		--test_number;&lt;br /&gt;
 	}&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 void input_data()&lt;br /&gt;
 {&lt;br /&gt;
 	printf(&amp;quot;데이터를 입력해 주세요.맨 앞이 0은 취소\n&amp;quot;);&lt;br /&gt;
 	while(1)&lt;br /&gt;
 	{&lt;br /&gt;
 		int input_team_number, input_temp, input_time;	char input_e;&lt;br /&gt;
 		printf(&amp;quot;&amp;amp;gt;&amp;amp;gt;&amp;quot;);&lt;br /&gt;
 		scanf(&amp;quot;%d %d %d %c&amp;quot;,&amp;amp;amp;input_team_number, &amp;amp;amp;input_temp, &amp;amp;amp;input_time, &amp;amp;amp;input_e);&lt;br /&gt;
 		if (input_team_number==0)&lt;br /&gt;
 			break;&lt;br /&gt;
 		datas* temp_point;&lt;br /&gt;
 		if (&amp;#039;C&amp;#039;==input_e)&lt;br /&gt;
 		{&lt;br /&gt;
 			temp_point=such_and_malloc_point(input_team_number);&lt;br /&gt;
 			++temp_point-&amp;amp;gt;score;&lt;br /&gt;
 			temp_point-&amp;amp;gt;used_time+=input_time;&lt;br /&gt;
 		}&lt;br /&gt;
 		else if (&amp;#039;I&amp;#039;==input_e)&lt;br /&gt;
 		{&lt;br /&gt;
 			temp_point=such_and_malloc_point(input_team_number);&lt;br /&gt;
 			temp_point-&amp;amp;gt;used_time+=WRONG_TIME;&lt;br /&gt;
 		}&lt;br /&gt;
 	}&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 datas* such_and_malloc_point(int target_team_number)&lt;br /&gt;
 {&lt;br /&gt;
 	datas* temp_point=start_point;&lt;br /&gt;
 	while (temp_point!=NULL)&lt;br /&gt;
 	{&lt;br /&gt;
 		if (target_team_number==temp_point-&amp;amp;gt;team_number)&lt;br /&gt;
 			return temp_point;&lt;br /&gt;
 		temp_point=temp_point-&amp;amp;gt;next;&lt;br /&gt;
 	}&lt;br /&gt;
 	temp_point=(datas*)malloc(sizeof(datas));&lt;br /&gt;
 	temp_point-&amp;amp;gt;prv=end_point;&lt;br /&gt;
 	if (start_point==NULL)&lt;br /&gt;
 		start_point=temp_point;&lt;br /&gt;
 	else&lt;br /&gt;
 		end_point-&amp;amp;gt;next=temp_point;&lt;br /&gt;
 	end_point=temp_point;&lt;br /&gt;
 	temp_point-&amp;amp;gt;team_number=target_team_number;&lt;br /&gt;
 	temp_point-&amp;amp;gt;score=0;&lt;br /&gt;
 	temp_point-&amp;amp;gt;used_time=0;&lt;br /&gt;
 	temp_point-&amp;amp;gt;next=NULL;&lt;br /&gt;
 	return temp_point;&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 void print_data()&lt;br /&gt;
 {&lt;br /&gt;
 	datas* temp_point=start_point;&lt;br /&gt;
 	printf(&amp;quot;참가 팀 번호\t푼 문제 개수\t누적된 시간 벌점\n&amp;quot;);&lt;br /&gt;
 	while (temp_point!=NULL)&lt;br /&gt;
 	{&lt;br /&gt;
 		printf(&amp;quot;%d\t%d\t%d\n&amp;quot;,temp_point-&amp;amp;gt;team_number,temp_point-&amp;amp;gt;score,temp_point-&amp;amp;gt;used_time);&lt;br /&gt;
 		temp_point=temp_point-&amp;amp;gt;next;&lt;br /&gt;
 	}&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 void free_data()&lt;br /&gt;
 {&lt;br /&gt;
 	datas* temp_point=start_point;&lt;br /&gt;
 	if (temp_point!=NULL)&lt;br /&gt;
 	{&lt;br /&gt;
 		while (temp_point-&amp;amp;gt;next!=NULL)&lt;br /&gt;
 		{&lt;br /&gt;
 			temp_point=temp_point-&amp;amp;gt;next;&lt;br /&gt;
 			free(temp_point-&amp;amp;gt;prv);&lt;br /&gt;
 		}&lt;br /&gt;
 		free(temp_point);&lt;br /&gt;
 	}&lt;br /&gt;
 }&lt;br /&gt;
== 저에게 할말 ==&lt;br /&gt;
----&lt;br /&gt;
[[AOI]] [[ContestScoreBoard]]&lt;br /&gt;
&lt;/div&gt;</summary>
		<author><name>imported&gt;Unknown</name></author>
	</entry>
</feed>