除法等式

输入正整数n，按从小到大的顺序输出所有形如abcde/fghij = n的表达式，其中a~j恰好为数字0~9的一个排列，2 <= n <= 79。

样例输入：

62

样例输出：

79546/1283=62

94736/1528=62

#include <iostream>
#include <stdio.h>
using namespace std;
int factor[5] = {10000, 1000, 100, 10, 1};
int b = 0;

void visit(int flag[], int pos, int n)
{
if (pos == 5)
{
int a = n * b;
int c = a;
while (a)
{
int temp = a % 10;
if (flag[temp] != 0)
{
break;
}
else
{
flag[temp] = -1;
}
a /= 10;
}

if (!a)
{
cout << c << "/" << b << " = " << n << endl;
}
for (int i = 0; i < 10; i++)
{
if (flag[i] == -1)
{
flag[i] = 0;
}
}
return;
}
else
{
for (int i = 0; i < 10; i++)
{
if (flag[i] != 0)
{
continue;
}
flag[i] = 1;
b += i * factor[pos];
visit(flag, pos+1, n);
b -= i * factor[pos];
flag[i] = 0;
}
}
}
void fun(int n)
{
int flag[10] = {0};
visit(flag, 0, n);

return;
}

int main(int argc, char *argv[])
{
for (int i = 2; i <= 79; i++)
{
fun(i);
cout << endl;
 }

return 0;
}