| version 1.3, 2000/08/22 05:04:21 |
version 1.4, 2001/10/12 06:07:05 |
|
|
| * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
| * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
| * |
* |
| * $OpenXM: OpenXM_contrib2/asir2000/lib/cyclic,v 1.2 2000/08/21 08:31:41 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/lib/cyclic,v 1.3 2000/08/22 05:04:21 noro Exp $ |
| */ |
*/ |
| def mkc(L,N) |
def mkc(L,N) |
| { |
{ |
|
|
| R = []; |
R = []; |
| for (L = 1; L <= N; L++) { |
for (L = 1; L <= N; L++) { |
| for (A = 0, I = 0; I <= N-1; I++) { |
for (A = 0, I = 0; I <= N-1; I++) { |
| |
for (B = 1,J = I; J < L+I; J++) { |
| |
B *= mkc(J,N); |
| |
} |
| |
A += B; |
| |
} |
| |
A = ptozp(A); |
| |
if (L == N) |
| |
A += -1; |
| |
R = cons(A,R); |
| |
} |
| |
return R; |
| |
} |
| |
|
| |
def rcyclic(N) |
| |
{ |
| |
R = []; |
| |
for (L = 1; L <= N; L++) { |
| |
for (A = 0, I = 0; I < 3; I++) { |
| for (B = 1,J = I; J < L+I; J++) { |
for (B = 1,J = I; J < L+I; J++) { |
| B *= mkc(J,N); |
B *= mkc(J,N); |
| } |
} |