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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef enum {
false, true
} boolean;
const int TIERCE = 3;
const int SIZE = 7;
// http://fr.wikipedia.org/wiki/Permutation
void permutation(char *prefix, char *suffix) {
int suffixLength = strlen(suffix);
if (suffixLength == 0)
printf("%.3s\n", prefix);
else {
int i = 0;
for (i = 0; i < suffixLength; i++) {
// String innerPrefix = prefix;
char *innerPrefix = (char *) malloc(
(SIZE + 1) * sizeof(*innerPrefix));
strcpy(innerPrefix, prefix);
// String innerSuffix = suffix;
char *innerSuffix = (char *) malloc(
(SIZE + 1) * sizeof(*innerSuffix));
strcpy(innerSuffix, suffix);
// innerPrefix = innerPrefix + innerSuffix.charAt(i);
int prefixLength = strlen(innerPrefix);
*(innerPrefix + prefixLength) = innerSuffix[i];
*(innerPrefix + prefixLength + 1) = '\0';
// innerSuffix = innerSuffix.substring(0, i) + innerSuffix.substring(i + 1, suffixLength);
memmove(&innerSuffix[i], &innerSuffix[i + 1],
(suffixLength - i) * sizeof(*innerSuffix));
permutation(innerPrefix, innerSuffix);
}
}
}
void tierce(char *prefix, char *suffix, char **tierces, int size) {
int suffixLength = strlen(suffix);
if (suffixLength == 0) {
int i = 0;
boolean printed = false;
for (i = 0; i < size && tierces[i] != NULL && !printed; i++) {
// String subPrefix = prefix.substring(0, TIERCE);
char *subPrefix = (char *) malloc(
(TIERCE + 1) * sizeof(*subPrefix));
strncpy(subPrefix, prefix, TIERCE);
if (strcmp(tierces[i], subPrefix) == 0)
printed = true;
}
if (!printed) {
// String subPrefix = prefix.substring(0, TIERCE);
char *subPrefix = (char *) malloc(
(TIERCE + 1) * sizeof(*subPrefix));
strncpy(subPrefix, prefix, TIERCE);
tierces[i] = subPrefix;
printf("%.3s\n", prefix);
}
} else {
int i = 0;
for (i = 0; i < suffixLength; i++) {
// String innerPrefix = prefix;
char *innerPrefix = (char *) malloc(
(SIZE + 1) * sizeof(*innerPrefix));
strcpy(innerPrefix, prefix);
// String innerSuffix = suffix;
char *innerSuffix = (char *) malloc(
(SIZE + 1) * sizeof(*innerSuffix));
strcpy(innerSuffix, suffix);
// innerPrefix = innerPrefix + innerSuffix.charAt(i);
int prefixLength = strlen(innerPrefix);
*(innerPrefix + prefixLength) = innerSuffix[i];
*(innerPrefix + prefixLength + 1) = '\0';
// innerSuffix = innerSuffix.substring(0, i) + innerSuffix.substring(i + 1, suffixLength);
memmove(&innerSuffix[i], &innerSuffix[i + 1],
(suffixLength - i) * sizeof(*innerSuffix));
tierce(innerPrefix, innerSuffix, tierces, size);
}
}
}
void permutationInts(int prefix[], int startIndex) {
int prefixSize = sizeof(prefix);
if (prefixSize == startIndex + 1) {
int i = 0;
for (i = 0; i < TIERCE; i++)
printf("%c ", prefix[i]);
printf("\n");
} else {
int i = 0;
for (i = startIndex; i < prefixSize; i++) {
int swap = prefix[i];
prefix[i] = prefix[startIndex];
prefix[startIndex] = swap;
permutationInts(prefix, startIndex + 1);
swap = prefix[startIndex];
prefix[startIndex] = prefix[i];
prefix[i] = swap;
}
}
}
// http://fr.wikipedia.org/wiki/Arrangement
int arrangements(int m, int n, int N) {
if (N - n + 1 < m)
return n * arrangements(m, n - 1, N);
else
return n;
}
int main(void) {
// String stringPrefix = "";
char *stringPrefix = (char*) malloc((SIZE + 1) * sizeof(*stringPrefix));
*stringPrefix = '\0';
// String stringSuffix = "abcdefg";
char *stringSuffix = (char*) malloc((SIZE + 1) * sizeof(*stringSuffix));
strcpy(stringSuffix, "abcdefg");
permutation(stringPrefix, stringSuffix);
printf("\n");
int size = arrangements(TIERCE, SIZE, SIZE);
printf("size = %d\n", size);
// String[] tierces = new String[size];
char **tierces = (char **) malloc((size * SIZE) * sizeof(**tierces));
memset(tierces, 0, size * SIZE);
tierce(stringPrefix, stringSuffix, tierces, size);
printf("\n");
int ints[] = { '1', '2', '3', '4' };
permutationInts(ints, 0);
return EXIT_SUCCESS;
} |
Créer algorithme toutes les possibilités tirage de 3 chiffres avec 5.7.14.16 chiffres ?
Répondre avec citation
La plupart des réponses à vos questions sont déjà dans les 
Envoyé par joel.drigo
Partager