U E D R , A S I H C RSS

Smith Numbers/이도현

. ~~

~cpp
// no10042 - Smith Numbers
#include <stdio.h>
#include <string.h>
#define ArSize 30
int digit_separation(int, int, int*);
void prime_factor(int, int*);
int prime(int);		/*  : 200,   : 100 */
int arr_add(int*);

int main(void)
{
	int arr_separation[ArSize] = { 0 }, arr_prime[ArSize] = { 0 };
	int arr_separation_prime[ArSize] = { 0 };
	int input_number, input_case, i, j, k;
	scanf("%d", &input_number);
	for (i = 0; i < input_number; i++)
	{
		scanf("%d", &input_case);
		for (j = input_case + 1; j < 1000000000; j++)
		{
			/*  크 */
			if (prime(j) == 100)
			{
				/*       */
				prime_factor(j, arr_prime);
				for (k = 0; k < ArSize; k++)
				{
					//    
					if (arr_prime[k] >= 10)
						k = digit_separation(k, arr_prime[k], arr_separation_prime);
					else
						arr_separation_prime[k] = arr_prime[k];
				}
				/*     */
				digit_separation(0, j, arr_separation);

				/*     */
				if (arr_add(arr_separation_prime) == arr_add(arr_separation))
				{
					printf("%dn", j);
					break;
				}
				/*  화 */
				for (i = 0; i < ArSize; i++)
				{
					arr_separation[i] = 0 ;
					arr_prime[i] = 0;
					arr_separation_prime[i] = 0;
				}
			}
		}
	}
	return 0;
}

/*      */
int digit_separation(int start_index, int num, int *array)
{
	/*      한 포 */
	char string[ArSize];
	int i, size;
	// int형 num 10  char형 string 
	sprintf(string, "%d", num);
	size = strlen(string);

	/*      환하 array . */
	for (i = 0 + start_index; i < size + start_index; i++)
		array[i] = string[i - start_index] - '0';
	return size + start_index;
}

/*    해 */
void prime_factor(int num, int *array)
{
	int i, j, temp;
	temp = num;
	for (i = 2, j = 0; i < num, j < ArSize;)
	{
		/*  해 할   */
		if (temp == 1)
			break;
		/*   */
		if (temp % i == 0)
		{
			/*  . */
			array[j] = i;
			temp /= i;
			j++;
		}
		else
			i++;
			continue;
	}
}

/*  -   : return 1,   : return 2 */
int prime(int num)
{
	int i;
	for (i = 2; i < num; i++)
	{
		/*   */
		if (num % i == 0)
			return 100;
	}
	/*   */
	return 200;
}
/*   */
int arr_add(int *array)
{
	int i, total = 0;
	for (i = 0; i < ArSize; i++)
		total += array[i];
	return total;
}

uva e-mail , e-mail (?) . . , 한 팸편. -
----
SmithNumbers AOI
Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:28:04
Processing time 0.0116 sec