Maintenance script: Table transclusion repair v1

2026-03-27T12:46:19Z

Table transclusion repair v1

← Older revision		Revision as of 12:46, 27 March 2026
Line 1:		Line 1:
	==== 소감 ====		==== 소감 ====
	~~{{\|~~ 2005/05/02 Accepted 0:00.660 444 ~~\|}}~~		2005/05/02 Accepted 0:00.660 444

	==== 코드 ====		==== 코드 ====
Line 80:		Line 80:
	----		----
	[[SmithNumbers]] [[AOI]]		[[SmithNumbers]] [[AOI]]

imported>Unknown at 05:28, 7 February 2021

2021-02-07T05:28:03Z

New page

==== 소감 ====
{{| 2005/05/02 Accepted 0:00.660 444 |}}

==== 코드 ====
// no10042 - Smith Numbers
#include <iostream>
#include <cmath>
using namespace std;

void find_smith_number(int n);
int sum_digit_prime_factor(int n);
int sum_digit_number(int n);

int main()
{
int nCase;
int i;
int number;

cin >> nCase;

for (i = 0; i < nCase; i++)
{
cin >> number;
find_smith_number(number);
}
return 0;
}

void find_smith_number(int n)
{
int i;
for (i = n + 1; ;i++)
{
if (sum_digit_number(i) == sum_digit_prime_factor(i))
break;
}
cout << i << endl;
}

int sum_digit_number(int n)
{
int sumDigitNumber = 0;
int temp = n;
do {
sumDigitNumber += temp % 10;
temp /= 10;
} while (temp != 0);
return sumDigitNumber;
}

int sum_digit_prime_factor(int n)
{
int i;
int sumDigitPrimeFactor = 0;
int temp = n;
while (temp % 2 == 0)
{
temp /= 2;
sumDigitPrimeFactor += 2;
}

i = 3;
while (i <= sqrt(temp) + 1)
{
if (temp % i == 0)
{
sumDigitPrimeFactor += sum_digit_number(i);
temp /= i;
}
else
i += 2;
}
if (sumDigitPrimeFactor == 0 || n == 2)
return -1;
if (temp > 1)
sumDigitPrimeFactor += sum_digit_number(temp);
return sumDigitPrimeFactor;
}
----
[[SmithNumbers]] [[AOI]]

SmithNumbers/문보창 - Revision history

Maintenance script: Table transclusion repair v1

imported>Unknown at 05:28, 7 February 2021