1 | FUNCTION idivmax (ka, kna, kguess) |
---|
2 | C**** |
---|
3 | C ****************************** |
---|
4 | C * OASIS FUNCTION - LEVEL T * |
---|
5 | C * -------------- ------- * |
---|
6 | C ****************************** |
---|
7 | C |
---|
8 | C**** *idivmax* - Search function |
---|
9 | C |
---|
10 | C Purpose: |
---|
11 | C ------- |
---|
12 | C Search the greatest common divisor of all elements of an integer array |
---|
13 | C |
---|
14 | C** Interface: |
---|
15 | C --------- |
---|
16 | C *ii =* *idivmax (ka, kna, kguess)* |
---|
17 | C |
---|
18 | C Input: |
---|
19 | C ----- |
---|
20 | C ka : array to be searched (integer 1D) |
---|
21 | C kna : array dimension (integer) |
---|
22 | C kguess : initial guess for the divisor (integer) |
---|
23 | C |
---|
24 | C Output: |
---|
25 | C ------ |
---|
26 | C None |
---|
27 | C |
---|
28 | C Workspace: |
---|
29 | C --------- |
---|
30 | C None |
---|
31 | C |
---|
32 | C Externals: |
---|
33 | C --------- |
---|
34 | C None |
---|
35 | C |
---|
36 | C Reference: |
---|
37 | C --------- |
---|
38 | C See OASIS manual (1995) |
---|
39 | C |
---|
40 | C History: |
---|
41 | C ------- |
---|
42 | C Version Programmer Date Description |
---|
43 | C ------- ---------- ---- ----------- |
---|
44 | C 2.0 L. Terray 95/09/01 created |
---|
45 | C |
---|
46 | C %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
---|
47 | C |
---|
48 | C* ---------------------------- Include files --------------------------- |
---|
49 | C |
---|
50 | USE mod_kinds_oasis |
---|
51 | USE mod_unit |
---|
52 | C |
---|
53 | C* ---------------------------- Argument declarations ------------------- |
---|
54 | C |
---|
55 | INTEGER (kind=ip_intwp_p) idivmax, ka(kna) |
---|
56 | C |
---|
57 | C* ---------------------------- Poema verses ---------------------------- |
---|
58 | C |
---|
59 | C %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
---|
60 | C |
---|
61 | C |
---|
62 | C* 1. Check if kguess divides all ka elements |
---|
63 | C --------------------------------------- |
---|
64 | C |
---|
65 | DO 110 jk = kguess, 1, -1 |
---|
66 | IF (mod(kguess,jk) .EQ. 0) THEN |
---|
67 | DO 120 ji = 1, kna |
---|
68 | IF (mod(ka(ji),jk) .NE. 0) GO TO 110 |
---|
69 | 120 CONTINUE |
---|
70 | GO TO 130 |
---|
71 | ENDIF |
---|
72 | 110 CONTINUE |
---|
73 | 130 idivmax = jk |
---|
74 | C |
---|
75 | C |
---|
76 | C* 2. End of routine |
---|
77 | C -------------- |
---|
78 | C |
---|
79 | RETURN |
---|
80 | END |
---|