<?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=BeeMaja%2F%ED%97%88%EC%A4%80%EC%88%98</id>
	<title>BeeMaja/허준수 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://mediawiki.zeropage.org/index.php?action=history&amp;feed=atom&amp;title=BeeMaja%2F%ED%97%88%EC%A4%80%EC%88%98"/>
	<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=BeeMaja/%ED%97%88%EC%A4%80%EC%88%98&amp;action=history"/>
	<updated>2026-05-15T00:15: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=BeeMaja/%ED%97%88%EC%A4%80%EC%88%98&amp;diff=28859&amp;oldid=prev</id>
		<title>imported&gt;Unknown at 05:22, 7 February 2021</title>
		<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=BeeMaja/%ED%97%88%EC%A4%80%EC%88%98&amp;diff=28859&amp;oldid=prev"/>
		<updated>2021-02-07T05:22:36Z</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;
 #include &amp;amp;lt;iostream&amp;amp;gt;&lt;br /&gt;
 using namespace std;&lt;br /&gt;
 &lt;br /&gt;
 int x, y;&lt;br /&gt;
 void firstStep(int count, int &amp;amp;amp;start, int input)&lt;br /&gt;
 {&lt;br /&gt;
 	for(; count&amp;amp;gt;0; count--){&lt;br /&gt;
 		x--;&lt;br /&gt;
 		y++;&lt;br /&gt;
 		if(start == input) break;&lt;br /&gt;
 		start++;&lt;br /&gt;
 	}&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 void secondStep(int count, int &amp;amp;amp;start, int input)&lt;br /&gt;
 {&lt;br /&gt;
 	for(; count&amp;amp;gt;0; count--){&lt;br /&gt;
 		x--;&lt;br /&gt;
 		if(start == input) break;&lt;br /&gt;
 		start++;&lt;br /&gt;
 	}	&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 void thirdStep(int count, int &amp;amp;amp;start, int input)&lt;br /&gt;
 {&lt;br /&gt;
 	for(; count&amp;amp;gt;0; count--){&lt;br /&gt;
 		y--;&lt;br /&gt;
 		if(start == input) break;&lt;br /&gt;
 		start++;&lt;br /&gt;
 	}&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 void firthStep(int count, int &amp;amp;amp;start, int input)&lt;br /&gt;
 {&lt;br /&gt;
 	for(; count&amp;amp;gt;0; count--){&lt;br /&gt;
 		x++;&lt;br /&gt;
 		y--;&lt;br /&gt;
 		if(start == input) break;&lt;br /&gt;
 		start++;&lt;br /&gt;
 	}&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 void fifthStep(int count, int &amp;amp;amp;start, int input)&lt;br /&gt;
 {&lt;br /&gt;
 	for(; count&amp;amp;gt;0; count--){&lt;br /&gt;
 		x++;&lt;br /&gt;
 		if(start == input) break;&lt;br /&gt;
 		start++;&lt;br /&gt;
 	}&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 void sixthStep(int count, int &amp;amp;amp;start, int input)&lt;br /&gt;
 {&lt;br /&gt;
 	for(; count&amp;amp;gt;0; count--){&lt;br /&gt;
 		y++;&lt;br /&gt;
 		if(start == input) break;&lt;br /&gt;
 		start++;&lt;br /&gt;
 	}&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 void process(int input)&lt;br /&gt;
 {&lt;br /&gt;
 	int count = 0;&lt;br /&gt;
 	for(count; count&amp;amp;lt;100000; count++)&lt;br /&gt;
 	{&lt;br /&gt;
 		if((3*(count*count + count) + 1) &amp;amp;gt;= input)&lt;br /&gt;
 			break;&lt;br /&gt;
 	}&lt;br /&gt;
 &lt;br /&gt;
 	x = count;&lt;br /&gt;
 	y = 0;&lt;br /&gt;
 	int start = (3*(count*count + count)+1) - 6*count + 1;&lt;br /&gt;
 	&lt;br /&gt;
 	int index = (input-start)/count + 1;&lt;br /&gt;
 	&lt;br /&gt;
 	for(int i = 1; i&amp;amp;lt;=index; i++)&lt;br /&gt;
 	{&lt;br /&gt;
 		switch(i)&lt;br /&gt;
 		{&lt;br /&gt;
 		case 1:&lt;br /&gt;
 			firstStep(count,start,input);&lt;br /&gt;
 			break;&lt;br /&gt;
 		case 2:&lt;br /&gt;
 			secondStep(count,start,input);&lt;br /&gt;
 			break;&lt;br /&gt;
 		case 3:&lt;br /&gt;
 			thirdStep(count,start,input);&lt;br /&gt;
 			break;&lt;br /&gt;
 		case 4:&lt;br /&gt;
 			firthStep(count,start,input);&lt;br /&gt;
 			break;&lt;br /&gt;
 		case 5:&lt;br /&gt;
 			fifthStep(count,start,input);&lt;br /&gt;
 			break;&lt;br /&gt;
 		case 6:&lt;br /&gt;
 			sixthStep(count,start,input);&lt;br /&gt;
 			break;&lt;br /&gt;
 		}&lt;br /&gt;
 	}&lt;br /&gt;
 &lt;br /&gt;
 	cout &amp;amp;lt;&amp;amp;lt; x &amp;amp;lt;&amp;amp;lt; &amp;quot; &amp;quot; &amp;amp;lt;&amp;amp;lt; y &amp;amp;lt;&amp;amp;lt; endl;&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 int main()&lt;br /&gt;
 {&lt;br /&gt;
 	int input;&lt;br /&gt;
 	while(cin &amp;amp;gt;&amp;amp;gt;input) {&lt;br /&gt;
 	process(input);&lt;br /&gt;
 	}&lt;br /&gt;
 	return 0;&lt;br /&gt;
 }&lt;br /&gt;
&lt;br /&gt;
[[BeeMaja]]&lt;/div&gt;</summary>
		<author><name>imported&gt;Unknown</name></author>
	</entry>
</feed>