大整数因子

 

 

#include <stdio.h>
#include <string.h>

#define N 31

void printFactor(int *factor, int numOfFactor)
{
	int i;

	if (0 == numOfFactor)
	{
		printf("none\n");
	}
	else
	{
		for (i=0; i<numOfFactor-1; ++i)
		{
			printf("%d ", factor[i]);
		}
		printf("%d\n", factor[i]);
	}
}

void getFactor(int *integer, int n)
{
	int i, k, mod;
	int tmp[N], factor[9];
	int numOfFactor = 0;

	for (k=2; k<10; ++k)
	{
		tmp[0] = integer[0]; /*tmp数据组保存原始数据*/

		for (i=1; i<n; ++i)
		{
			mod = tmp[i-1] % k; 
			tmp[i] = integer[i] + (mod * 10); /*将高位产生的余数加到低位上*/
		}

		if (0 == (tmp[n-1] % k)) /*该数可以被k整除*/
		{
			factor[numOfFactor++] = k;
		}
	}

	printFactor(factor, numOfFactor);
}

int main(void)
{
	char str[N];
	
	while (scanf("%s", str) != EOF)
	{
		int i, integer[N];

		if (strcmp(str, "-1") == 0)
		{
			break; /*-1时终止整个循环*/
		}
		
		/*字符串转化为整型数组*/
		for (i=0; str[i]!='\0'; ++i)
		{
			integer[i] = str[i] - '0';
		}

		getFactor(integer, i);
	}
	
	return 0;
}