求不定方程x1+—xk=J的非负整数解
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
#define K 3
#define J 5
void ()
{
int a[K]={0};
bool TF;
int i, j, t;
TF=false;
t=0;
i=0;
while(1)
{
if (i==0)
{
if (TF)
{
a[i]++;
if (a[i]>J)
break;
}
t+=a[i];
i++;
TF=false;
continue;
}
else
{
if (TF)
{
a[i]++;
if (a[i]>J-t)
{
a[i]=0;
t-=a[i-1];
i--;
TF=true;
continue;
}
}
if (i==K-1)
{
if (t+a[i]==J)
{
for (j=0; j<K; j++)
{
printf("%d ", a[j]);
}
printf("n");
}
TF=true;
continue;
}
t+=a[i];
i++;
TF=false;
continue;
}
}
}
|
变体一：
求不定方程x1+—xk=J的正整数解
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
|
#define K 2
#define J 4
void ()
{
int a[K]={0};
int i, j, t;
t=0;
i=0;
while(1)
{
if (i==0)
{
a[i]++;
if (a[i]>=J)
break;
t+=a[i];
i++;
continue;
}
else
{
a[i]++;
if (a[i]>J-t)
{
a[i]=0;
t-=a[i-1];
i--;
continue;
}
if (i==K-1)
{
if (t+a[i]==J)
{
for (j=0; j<K; j++)
{
printf("%d ", a[j]);
}
printf("n");
}
continue;
}
t+=a[i];
i++;
continue;
}
}
}
|
变体二：求不定方程x1+—xk=J在约束条件0<=x1<=m1—-0<=xk<=mk下的非负整数解
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
#define K 2
#define J 5
void ()
{
int a[K]={0};
int m[K]={2, 3};
bool TF;
int i, j, t;
TF=false;
t=0;
i=0;
while(1)
{
if (i==0)
{
if (TF)
{
a[i]++;
if (a[i]>m[i] || a[i]>J)
break;
}
t+=a[i];
i++;
TF=false;
continue;
}
else
{
if (TF)
{
a[i]++;
if (a[i]>J-t || a[i]>m[i])
{
a[i]=0;
t-=a[i-1];
i--;
TF=true;
continue;
}
}
if (i==K-1)
{
if (t+a[i]==J)
{
for (j=0; j<K; j++)
{
printf("%d ", a[j]);
}
printf("n");
}
TF=true;
continue;
}
t+=a[i];
i++;
TF=false;
continue;
}
}
}
|
变体三:求不定方程x1+—xk=J在约束条件1<=x1<=m1—-1<=xk<=mk下的正整数解
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
|
#define K 2
#define J 4
void ()
{
int a[K]={0};
int m[K]={2, 3};
int i, j, t;
t=0;
i=0;
while(1)
{
if (i==0)
{
a[i]++;
if (a[i]>m[i] || a[i]>=J)
break;
t+=a[i];
i++;
continue;
}
else
{
a[i]++;
if (a[i]>J-t || a[i]>m[i])
{
a[i]=0;
t-=a[i-1];
i--;
continue;
}
if (i==K-1)
{
if (t+a[i]==J)
{
for (j=0; j<K; j++)
{
printf("%d ", a[j]);
}
printf("n");
}
continue;
}
t+=a[i];
i++;
continue;
}
}
}
|
近期评论