Chapter 2: find the number of daffodils based on decomposition, find the number of daffodils based on combination, find the conformal number in [x, y], explore the n-bit conformal number, recursively

// Based on the decomposition of the narcissus number program 
int main()
{
    
	int m, a, b, c;
	for (m = 100; m <= 999; m++)
	{
    
		a = m / 100;
		b = (m / 10) % 10;
		c = m % 10;
		if (m == a * a * a + b * b * b + c * c * c)
			printf(" %d", m);
	}
	return 0;
}

result ：

// Program for finding the number of daffodils based on combination 
int main()
{
    
	int m, a, b, c;
	for(a = 1; a <= 9; a++)
		for(b = 0; b <= 9; b++)
			for (c = 0; c <= 9; c++)
			{
    

				m = a * 100 + b * 10 + c;
				if (m == a * a * a + b * b * b + c * c * c)
					printf(" %d", m);
			}
			return 0;
}

result ：

// Randall number 
int main()
{
    
	int m, n, i;
	double f, k, s, t, y;
	printf(" Please enter the number of digits n (2 < n < 10):");
	scanf("%d", &n);
	m = 0;
	t = 1;
	for (i = 1; i <= n - 1; i++)
		t = t * 10;
	for (y = t + 1; y <= t * 10 - 1; y++)
	{
    
		f = y;
		for (s = 0, i = 1; i <= n; i++) //  Circulation separation y Of n A digital k 
		{
    
			k = fmod(f, 10);
			s += pow(k, n);
		
			f = floor(f / 10); // seek y Of n A number of n The sum of powers s
		}
		if (y == s)
		{
    
			m++;
			printf(" %.0f", y); //  Check whether the conditions are met  // Output exploration results 
		}
	}
	printf(" \n %d The number of Randall bits is %d individual ", n, m);
			return 0;
}

result ：

//  seek [x,y] Conformal number in 
int main()
{
    
	long a, b, c, k, m, s, x, y; 
	printf("  Please enter the upper and lower range integers x,y：");
		scanf ("%ld" , &x) ; 
		scanf("%ld",  &y);
			m=0;
	for (a = x;a <= y;a++)
	{
    
		s=a*a; // Calculation a The square of s 
		b = 1;
		k=a;
		while (k > 0)
		{
    
			b = b * 10;
			k = k / 10;
		}
		c = s % b;  // by a The square of s Tail of  
			if (a == c)
			{
    
				m++;
				printf("%ld^2 = %1d \n", a, s);
			}
	}
			printf("  Section [%1d,%1d] in , More than %d A conformal number .", x, y, m);
	
			return 0;
}

result ：

// Seek n Conserved number 
int main()
{
    
	int n, d, k, j, i, t, m, w, z, u, v, a[500], b[500], c[500];
	printf("  please enter an integer n：");
	scanf("%d", &n);
	for (d = 1; d <= 9; d++)
	{
    
		for (k = 1; k <= 499; k++)
		{
    
			a[k] = 0;
			b[k] = 0;
			c[k] = 0;
		}
		a[1] = d; //  Assign a value to the number of conformal digits  
		for (k = 2; k <= n; k++)
		{
    
			for (j = 0; j <= 9; j++)
			{
    
				a[k] = j;
				v = 0;
				for (i = 1; i <= k; i++)
					c[i] = 0;
				for (i = 1; i <= k; i++)
				{
    
					for (z = 0, t = 1; t <= k; t++)
					{
    
						u = a[i] * a[t] + z;
						z = u / 10;
						b[i + t - 1] = u % 10; // The intermediate results of the calculation are stored in b Array 
					}
						for (w = 0, m = i; m <= k; m++)
						{
    
							u = c[m] + b[m] + w; //  Calculate the square stored in c Array  
							w = u / 10;
							c[m] = u % 10;
						}
					}
					for (i = 1; i <= k; i++)
						if (a[i] != c[i])
							v = 1;
					if (v == 0) break;
				}
			}
			if (v == 0 && a[n] != 0)
			{
    
				printf(" %d  At the end of the %d Conserved number ： ", a[1], n);
				for (k = n; k >= 1; k--)
					printf("%d", a[k]);
				printf("\n");
			}
		}


	return 0;
}

result ：

//n Bit by bit integer division exploration 
int main()
{
    
	int i, j, n, r, t, s, a[100];
	printf(" Bitwise integer division n position , Please make sure n：");
	scanf("%d", &n); 
	printf("  Required %d  Bit by bit integer division ：\n",n); 
	for (j = 1;j <= 100; j++)
	a[j] = 0;

	t = 0; 
	s = 0;
	i = 1;
	a[1] = 1;
	while (a[1] <= 9)
	{
    
		if (t == 0 && i < n)
			i++;
		for (r = 0, j = 1; j <= i; j++)
		{
    
			r = r * 10 + a[j];
			r = r % i;
		}
		// testing  i Whether time is divisible  i 
		if (r != 0)
		{
    
			a[i] = a[i] + 1;
			t = 1;
			while (a[i] > 9 && i > 1)
			{
    
				a[i] = 0;
				i--;
				a[i] = a[i] + 1;
			}
		}
		else 
			t = 0;
		if (t == 0 && i == n)
		{
    
			s++;
			printf(" %d: ", s);
			for (j = 1; j <= n; j++)
				printf("%d", a[j]);
			printf("\n");
			a[i] = a[i] + 1;
		}
	}

			if (s == 0)
				printf(" Can't find ！\n");
			else
				printf("  More than %d A solution .\n", s) ;

	return 0;
}

result ;

// Recursive exploration n Bit by bit integer division 
int main()
{
    
	int d, g, i, j,k, m, n, r, a[3000][30], b[3000][30];
	printf(" Please enter the number of digits of the integer divisor n：");
	scanf("%d", &n);
	g = 9; 
	for (j = 1; j <= g; j++)
		a[j][1] = j;
	for (k = 2; k <= n; k++)
	{
    

		m = 0;
		for(i = 1; i <= g; i++)
			for (j = 0; j <= 9; j++)
			{
    
				a[i][k] = j;
					for (r = 0, d =1; d <=k; d++ )
					{
    
						r = r * 10 + a[i][d];
						r = r % k;
					}
				if (r == 0)
				{
    
					m++;
					for (d = 1; d <= k; d++)
						b[m][d] = a[i][d];
				}

			}
		g = m;
		for (i = 1; i <= g; i++)
			for (d = 1; d <= k; d++)
				a[i][d] = b[i][d];
	}
	if (g > 0)
	{
    
		printf(" %d Bit by bit integer divisors are %4d individual ", n,g);

		for (i =1; i <= g; i++)
		{
    
			printf(" %d: ", i);
			for (d = 1; d <= n; d++)
				printf("%d", a[i][d]);
			printf("\n");
		}
	}
	else
	{
    
		printf("  unsolvable ！\n");
		return 0;
	}
	//return 0;
}

result ：