<?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=ReverseAndAdd%2F%EA%B9%80%ED%9A%8C%EC%98%81</id>
	<title>ReverseAndAdd/김회영 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://mediawiki.zeropage.org/index.php?action=history&amp;feed=atom&amp;title=ReverseAndAdd%2F%EA%B9%80%ED%9A%8C%EC%98%81"/>
	<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=ReverseAndAdd/%EA%B9%80%ED%9A%8C%EC%98%81&amp;action=history"/>
	<updated>2026-05-14T17:14:20Z</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=ReverseAndAdd/%EA%B9%80%ED%9A%8C%EC%98%81&amp;diff=38432&amp;oldid=prev</id>
		<title>imported&gt;Unknown at 05:27, 7 February 2021</title>
		<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=ReverseAndAdd/%EA%B9%80%ED%9A%8C%EC%98%81&amp;diff=38432&amp;oldid=prev"/>
		<updated>2021-02-07T05:27:54Z</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;== C code ==&lt;br /&gt;
 #include&amp;amp;lt;iostream&amp;amp;gt; &lt;br /&gt;
 #include&amp;amp;lt;math.h&amp;amp;gt; &lt;br /&gt;
 using namespace std; &lt;br /&gt;
  &lt;br /&gt;
 long inverseDigit(long num); &lt;br /&gt;
 bool isCircularLetter(long num); &lt;br /&gt;
  &lt;br /&gt;
 int main() &lt;br /&gt;
 { &lt;br /&gt;
         &lt;br /&gt;
 	int testCount=0; &lt;br /&gt;
     cin&amp;amp;gt;&amp;amp;gt;testCount;&lt;br /&gt;
         &lt;br /&gt;
 	long* number=new long[testCount]; &lt;br /&gt;
     int* calCount=new int[testCount];&lt;br /&gt;
 &lt;br /&gt;
 	int i=0; &lt;br /&gt;
     &lt;br /&gt;
 	for(i=0;i&amp;amp;lt;testCount;i++) &lt;br /&gt;
 		cin&amp;amp;gt;&amp;amp;gt;number[i];&lt;br /&gt;
     &lt;br /&gt;
     for(i=0;i&amp;amp;lt;testCount;i++) &lt;br /&gt;
     {    &lt;br /&gt;
 		calCount[i]=0;&lt;br /&gt;
 		while(!isCircularLetter(number[i]))&lt;br /&gt;
 		{     &lt;br /&gt;
 			calCount[i]++;&lt;br /&gt;
 			number[i]=number[i]+inverseDigit(number[i]);        &lt;br /&gt;
 		}	&lt;br /&gt;
     }&lt;br /&gt;
 	&lt;br /&gt;
 	cout&amp;amp;lt;&amp;amp;lt;endl;&lt;br /&gt;
 	for(i=0;i&amp;amp;lt;testCount;i++) &lt;br /&gt;
           cout&amp;amp;lt;&amp;amp;lt;calCount[i]&amp;amp;lt;&amp;amp;lt;&amp;quot; &amp;quot;&amp;amp;lt;&amp;amp;lt;number[i]&amp;amp;lt;&amp;amp;lt;endl; &lt;br /&gt;
          &lt;br /&gt;
         return 0; &lt;br /&gt;
 } &lt;br /&gt;
  &lt;br /&gt;
 long inverseDigit(long num) &lt;br /&gt;
 { &lt;br /&gt;
 	&lt;br /&gt;
 	int arrayOfDigit[10]; &lt;br /&gt;
 	int count=-1; &lt;br /&gt;
  &lt;br /&gt;
 	while(num!=0) &lt;br /&gt;
 	{        &lt;br /&gt;
 		arrayOfDigit[++count]=num%10; &lt;br /&gt;
 		num=num/10;      &lt;br /&gt;
 	} &lt;br /&gt;
          &lt;br /&gt;
 	long returnValue=0; &lt;br /&gt;
 	&lt;br /&gt;
 	for(int i=count ; i&amp;amp;gt;=0 ; i--) &lt;br /&gt;
 		returnValue+=arrayOfDigit[i]*pow(10,count-i); &lt;br /&gt;
 	&lt;br /&gt;
 	return returnValue; &lt;br /&gt;
 } &lt;br /&gt;
  &lt;br /&gt;
 bool isCircularLetter(long num) &lt;br /&gt;
 { &lt;br /&gt;
 &lt;br /&gt;
 	int arrayOfDigit[10]; &lt;br /&gt;
 	int count=-1; &lt;br /&gt;
 &lt;br /&gt;
 	while( num !=0 )//10으로 나눈 나머지가 몇인가?1이상이면  &lt;br /&gt;
 	{        &lt;br /&gt;
 		arrayOfDigit[++count]=num%10; &lt;br /&gt;
 		num=num/10;      &lt;br /&gt;
 	} &lt;br /&gt;
  &lt;br /&gt;
 	int i=0; &lt;br /&gt;
 	int j=count; &lt;br /&gt;
          &lt;br /&gt;
 	while(arrayOfDigit[i]==arrayOfDigit[j]) &lt;br /&gt;
 	{ &lt;br /&gt;
 		i++; &lt;br /&gt;
 		j--; &lt;br /&gt;
 		&lt;br /&gt;
 			if(i&amp;amp;gt;j) &lt;br /&gt;
 				return true; &lt;br /&gt;
 	} &lt;br /&gt;
 	&lt;br /&gt;
 	return false; &lt;br /&gt;
 }&lt;br /&gt;
&lt;/div&gt;</summary>
		<author><name>imported&gt;Unknown</name></author>
	</entry>
</feed>