<?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=LightMoreLight%2F%ED%97%88%EC%95%84%EC%98%81</id>
	<title>LightMoreLight/허아영 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://mediawiki.zeropage.org/index.php?action=history&amp;feed=atom&amp;title=LightMoreLight%2F%ED%97%88%EC%95%84%EC%98%81"/>
	<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=LightMoreLight/%ED%97%88%EC%95%84%EC%98%81&amp;action=history"/>
	<updated>2026-05-15T01:20:00Z</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=LightMoreLight/%ED%97%88%EC%95%84%EC%98%81&amp;diff=34168&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=LightMoreLight/%ED%97%88%EC%95%84%EC%98%81&amp;diff=34168&amp;oldid=prev"/>
		<updated>2021-02-07T05:23:38Z</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;== LightMoreLight/허아영 ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
| 2006-02-11 Time Limit Exceeded 10.051 440&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
ㅋㅋ for 때문에 시간이 걸리네.ㅠ &lt;br /&gt;
ㅁㅣ완성 ~ ㅋㅋ&lt;br /&gt;
&lt;br /&gt;
수식을 만들어야겠다 ㅋㅂ&lt;br /&gt;
&lt;br /&gt;
# before..&lt;br /&gt;
As problem,&lt;br /&gt;
equally I do.&lt;br /&gt;
&lt;br /&gt;
# different idea.. &lt;br /&gt;
simply,, I thinked..&lt;br /&gt;
If the Number of n&amp;#039;s measure is an odd number, an answer is &amp;quot;No&amp;quot;&lt;br /&gt;
else if the Number of n&amp;#039;s measure is an even number, an answer is &amp;quot;Yes&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
How do I code this contents??  &lt;br /&gt;
&lt;br /&gt;
I learned how to solve the Number of n&amp;#039;s measure.. at a middle school.&lt;br /&gt;
6 = 2^1 * 3^1 &lt;br /&gt;
(index+1)s multiplication -&amp;gt; 2 * 2 = 4&lt;br /&gt;
6&amp;#039;s measure are 1, 2, 3, 6 &lt;br /&gt;
total 4!!!&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 process(int n)&lt;br /&gt;
 {&lt;br /&gt;
 	int i = 0, j = 0;&lt;br /&gt;
 	int state = 0;&lt;br /&gt;
 &lt;br /&gt;
 	for(i = 1; i &amp;amp;lt;= n; i++)			// n 번 왕복,&lt;br /&gt;
 	{&lt;br /&gt;
 		if(n % i == 0)&lt;br /&gt;
 			state = ~state;&lt;br /&gt;
 	}	&lt;br /&gt;
 	return state; // 마지막 &lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 int main()&lt;br /&gt;
 {&lt;br /&gt;
 	int n;&lt;br /&gt;
 	int result = 0;&lt;br /&gt;
 	while(1)&lt;br /&gt;
 	{&lt;br /&gt;
 		cin &amp;amp;gt;&amp;amp;gt; n;&lt;br /&gt;
 		if(n == 0)&lt;br /&gt;
 			break;&lt;br /&gt;
 		result = process(n);&lt;br /&gt;
 		if(result == 0)&lt;br /&gt;
 			cout &amp;amp;lt;&amp;amp;lt; &amp;quot;no&amp;quot; &amp;amp;lt;&amp;amp;lt; endl;&lt;br /&gt;
 		else&lt;br /&gt;
 			cout &amp;amp;lt;&amp;amp;lt; &amp;quot;yes&amp;quot; &amp;amp;lt;&amp;amp;lt; endl;&lt;br /&gt;
 	}&lt;br /&gt;
 	return 0;&lt;br /&gt;
 }&lt;/div&gt;</summary>
		<author><name>imported&gt;Unknown</name></author>
	</entry>
</feed>