0726

1

.

#include<stdio.h>
int a[3][3],count;
int main()
{
	int i,j,k,m,n,flag;
	printf("It exists possible distribution plans :\n" );
	for (i = 0; i <= 3; i++) 
	{  
		a[0][0] = i;
		for (j = i; j <= 7 - i && j <= 3; j++) 
		{
			a[1][0] = j;
			if ((a[2][0] = 7 - j - a[0][0]) > 3 ) 
				continue;  
			if (a[2][0] < a[1][0]) 
				break;
			for (k = 1; k <= 5; k += 2) 
			{  
				a[0][1] = k;
				for (m = 1; m < 7 - k; m += 2) 
				{ 
					a[1][1] = m;
					a[2][1] = 7 - k - m;
					for (flag = 1, n = 0; flag && n < 3; n++)
						if ( a[n][0] + a[n][1] < 7 && a[n][0] * 2 + a[n][1] == 7 )
							a[n][2] = 7 - a[n][0] - a[n][1]; 
						else
						{
							flag = 0; 
						}
					if (flag) 
					{  
						printf(" No. %d  Full basket Semi-basket Empty\n",++count);
						for (n = 0; n < 3; n++)
							printf (" fisher %c:  %d  %d  %d\n",'A'+n, a[n][0], a[n][1], a[n][2]);
					}
				}
			}
		}
	}
}

2

.

#include<stdio.h>
int main()
{ 
	long int i;
	int count = 0;
	for (i = 1000; i < 9999; i++)
	{
		if (!((i * 10 + 6) % 3))
		{
			count++;
		}
	}
	printf("count == %d\n", count);
}

3.

#include<stdio.h>
int main()
{
	int i;
	for(i = 0; ; i++)
	{
		if(((i * 8 + 7) * 8 + 1) * 8 + 1 == (34 * i + 15) * 17 + 4)
		{
			printf("%d\n",(34 * i + 15 ) * 17 + 4);
			break;
		}
	}


	return 0;
}

4.

#include<stdio.h>
int main()
{
	int i, j, k;
	for (i = 1; i < 7; i++)
	{
		for (j = 0; j < 7; j++)
		{
			for (k = 1; k < 7; k++)
			{
				if(i * 9 * 9 + j * 9 + k == i + j * 7 + k * 7 * 7)
				{
					printf("%d%d%d(7)=%d%d%d(9)=%d(10)\n", k, j, i, i, j, k, i * 9 * 9 + j * 9 + k);
				}
			}
		}
	}

	return 0;
}

5.

#include<stdio.h>
int main()
{
	int i;
	for (i = 1002; i < 1111; i++)
	{
		if(i % 10 * 1000 + i / 10 % 10 * 100 + i / 100 % 10 * 10 + i / 1000 == i * 9)
			printf("%d\n",i);
	}

	return 0;
}

6.

#include<stdio.h>
int main()
{
	int t, a[5];
	long int k, i;
	for(i = 95860; ;i++)
	{
		for(t = 0, k = 100000; k >= 10; t++)
		{
			a[t] = (i % k) / (k / 10);
			k /= 10;
		}
		if((a[0] == a[4]) && (a[1] == a[3]))
		{
			printf("%d%d%d%d%d\n",a[0], a[1], a[2], a[3], a[4]);
			printf("%.2f\n",(i - 95859) / 2.0);
			break;
		}
	}

	return 0;
}

7.

#include <stdio.h>
#include <math.h>

void f(n,s)
int n;
float *s;
{
	int k;
	for(k = 1000; k >= 10; s++)
	{
		*s = (n%k)/(k/10);
		k /= 10;
	}
}

int main()
{
	void f();
	int i, t;
	float a[3],b[3];
	
	printf("The possible perfect squares combinations are:\n");
	for(i = 11; i <= 31; i++)
	{
		for(t = 11; t <= 31; t++)
		{
			f(i * i, a);
			f(t * t, b);
			if(sqrt(a[0] * 10 + b[0]) == (int)sqrt(a[0] * 10 + b[0])&&sqrt(a[1] * 10 + b[1]) == (int)sqrt(a[1] * 10 + b[1])&&sqrt(a[2] * 10 + b[2]) == (int)sqrt(a[2] * 10 + b[2]))
			{
				printf("%d and %d\n",i * i,t * t);
			}
		}
	}

	return 0;
}

8.

#include <stdio.h>

int main()
{
	int i, t, k, a[3];
	printf("There are following Armstrong number smaller than 1000:\n");
	for(i = 2; i < 1000; i++)
	{
		for(t = 0, k = 1000; k >= 10; t++)
		{
			a[t] = (i % k)/(k / 10);
			k /= 10;
		}
		if(a[0] * a[0] * a[0] + a[1] * a[1] * a[1] + a[2] * a[2] * a[2] == i)
		{
			printf("%d ",i);
		}
	}
	printf("\n");
	return 0;
}