暴力破解-简单枚举

输入正整数n,按从大到小的顺序输出所以形如abcde/fghij=n的表达式，其中a~h恰好是0~9的一个排列,2<=n<=79
样例输入：
62
样例输出：
79546/01283=62

94736/01528=62

#define _CRT_SECURE_NO_WARNINGS
#include<stdlib.h>
#include<stdio.h>
int a[10];
int zeng;
int yu;
int  mj(int n)
{
	for (a[0] = 0; a[0]< 10; a[0]++)
	{
		//.//a[0] = i;
		for (a[1]= 0; a[1] < 10; a[1]++)
		{
			//a[1] = j;
			for (a[2] = 0; a[2]< 10; a[2]++)
			{
			//	a[2] = k;
				for (a[3] = 0; a[3] < 10; a[3]++)
				{
					//a[3] = q;
					for (a[4] = 0; a[4] < 10; a[4]++)
					{
						//a[4] = m;
						zeng = a[4] * 1 + a[3] * 10 + a[2] * 100 + a[1] * 1000 + a[0] * 10000;
						int jz;
						if (zeng%n == 0)
						{
							yu = zeng/n;//得到yu
							 jz= yu;
							for (int j = 5; j < 10; j++)
							{
								a[j] = yu % 10;
								yu /= 10;
							}
							int ok = 1;
							for (int i = 0; i < 10; i++)
							{
								for (int j = i+1; j < 10; j++)