<?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%B5%9C%EC%86%8C%EC%A0%95%EC%88%98%EC%9D%98%ED%95%A9%2F%EC%9D%B4%EB%8F%84%ED%98%84</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%B5%9C%EC%86%8C%EC%A0%95%EC%88%98%EC%9D%98%ED%95%A9%2F%EC%9D%B4%EB%8F%84%ED%98%84"/>
	<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=%EC%B5%9C%EC%86%8C%EC%A0%95%EC%88%98%EC%9D%98%ED%95%A9/%EC%9D%B4%EB%8F%84%ED%98%84&amp;action=history"/>
	<updated>2026-05-15T05:50:37Z</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%B5%9C%EC%86%8C%EC%A0%95%EC%88%98%EC%9D%98%ED%95%A9/%EC%9D%B4%EB%8F%84%ED%98%84&amp;diff=75955&amp;oldid=prev</id>
		<title>imported&gt;Unknown at 05:31, 7 February 2021</title>
		<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=%EC%B5%9C%EC%86%8C%EC%A0%95%EC%88%98%EC%9D%98%ED%95%A9/%EC%9D%B4%EB%8F%84%ED%98%84&amp;diff=75955&amp;oldid=prev"/>
		<updated>2021-02-07T05:31:17Z</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;
첫 번째는 수1에서 배웠던 자연수 합 공식이고 두 번째는 무식한 for 돌리기 입니다 ㅋㅋ&lt;br /&gt;
나중에 복잡한 알고리즘을 풀 때 아주 다른 결과를 나타내는 것 중 하나가 loop문에서 실수 입니다.&lt;br /&gt;
=== 코  드 ===&lt;br /&gt;
 #include &amp;amp;lt;stdio.h&amp;amp;gt;&lt;br /&gt;
 void min_int_sum(void);&lt;br /&gt;
 &lt;br /&gt;
 int main(void)&lt;br /&gt;
 {&lt;br /&gt;
 	min_int_sum();&lt;br /&gt;
 	return 0;&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 void min_int_sum()&lt;br /&gt;
 {&lt;br /&gt;
 	int n = 1;&lt;br /&gt;
 	while ((n * n + n) / 2 &amp;amp;lt;= 3000)&lt;br /&gt;
 		n++;&lt;br /&gt;
 &lt;br /&gt;
 	printf(&amp;quot;n = %d, sum = %dn&amp;quot;, n, (n * n + n) / 2);&lt;br /&gt;
 }&lt;br /&gt;
&lt;br /&gt;
 #include &amp;amp;lt;stdio.h&amp;amp;gt;&lt;br /&gt;
 void min_int_sum(void);&lt;br /&gt;
 &lt;br /&gt;
 int main(void)&lt;br /&gt;
 {&lt;br /&gt;
 	min_int_sum();&lt;br /&gt;
 	return 0;&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 void min_int_sum()&lt;br /&gt;
 {&lt;br /&gt;
 	int n = 0, sum = 0;&lt;br /&gt;
 	while (sum &amp;amp;lt;= 3000)&lt;br /&gt;
 	{&lt;br /&gt;
 		n++;&lt;br /&gt;
 		sum += n;&lt;br /&gt;
 	}&lt;br /&gt;
 &lt;br /&gt;
 	printf(&amp;quot;n = %d, sum = %dn&amp;quot;, n, sum);&lt;br /&gt;
 }&lt;br /&gt;
&lt;br /&gt;
=== 나한테 할 말 ===&lt;br /&gt;
&lt;br /&gt;
[[LittleAOI]] [[반복문자열]]&lt;br /&gt;
&lt;/div&gt;</summary>
		<author><name>imported&gt;Unknown</name></author>
	</entry>
</feed>