64,637
社区成员
发帖
与我相关
我的任务
分享
#include<iostream>
using namespace std;
const int m = 3, n = 4;
int r[m] = {3, 2, 1}, q[n] = {2, 1, 1, 2};
int buf[m* n], count = -1, temp[100][m* n];
void swap_i(int t1, int t2);
void output();
void trytry(int);
int is_right();
int is_exist();
int is_same(int);
int main()
{
int i, sum = 0;
for (i = 0; i < m; i++)
sum += r[i];
for (i = 0; i < sum; i++)
buf[i] = 1;
for (i = sum; i < m * n; i++)
buf[i] = 0;
trytry(0);
cout << "综上,满足条件的数表有" << count + 1 << "个" << endl;
return 0;
}
void trytry(int t)
{
int j;
if (t >= m * n) {if (is_right())output();}
else
for (j = t; j < m * n; j++)
{swap_i(t, j); trytry(t + 1); swap_i(t, j);}
}
void swap_i(int t1, int t2)
{
int t;
t = buf[t1]; buf[t1] = buf[t2]; buf[t2] = t;
}
int is_right()
{
int i, j, sum;
for (i = 0; i < n; i++) {
sum = 0;
for (j = 0; j < m; j++)
sum += buf[j * n + i];
if (sum != q[i])return 0;
}
for (i = 0; i < m; i++) {
sum = 0;
for (j = 0; j < n; j++)
sum += buf[i * n + j];
if (sum != r[i])return 0;
}
return 1;
}
void output()
{
int i, j;
if (is_exist() == 0) {
count++;
cout << "第" << count + 1 << "组解如下:" << endl;
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
cout << buf[i * n + j] << " ";
temp[count][i * n + j] = buf[i * n + j];
}
cout << endl;
}
}
}
int is_exist()
{
int i, j;
if (count == -1)
return 0;
else {
for (i = 0; i <= count; i++)
if (is_same(i)) // 'is_same:模棱两可的符号 , 这里 i=1 就返回了
return 1;
return 0;
}
}
int is_same(int t)
{
int i;
for (i = 0; i < m * n; i++)
if (temp[t][i] != buf[i])
return 0;
return 1;
}