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
   | //
//  main.c
 
 
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
 
 
#define ML 11
#define MC 8
 
 
struct Pion {
 
    int id;
    char color[10];
 
};
 
 
 
void resetTab (void);
void printTab (void);
void indexMenu (void);
void combiGen (void);
 
struct Pion pion[8] = { {0,"Rouge"},{1,"Jaune"},{2,"Vert"},{3,"Bleu"},{4,"Orange"},{5,"Blanc"},{6,"Violet"},{7,"Fuchsia"} };
 
int myTab[ML][MC];
 
 
int main () {
 
 
    srand(8);
 
    indexMenu();
 
 
    return 0;
}
 
void resetTab (void) {
 
    int i, j;
 
    for (i=0; i<ML; i++) {
 
        for (j=0; j<MC; j++) {
 
            myTab[i][j] = 0;
        }
    }
}
 
void printTab (void) {
 
    int i, j;
 
    for (i=0; i<ML; i++) {
 
        for (j=0; j<MC; j++) {
 
            printf("myTab[i][j]");
        }
        printf("\n");
    }
}
 
void combiGen (void) {
 
    int max = 8;
    int i, color;
 
    for (i=0; i<4; i++) {
 
        color = rand()%max;
 
        myTab[0][i] = pion[color].id;
        temp = pion[color].id;
        pion[color].id = pion[7].id;
        pion[7].id = temp;
 
 
        printf("%d", myTab[0][i]);
 
        max--;
    }
 
 
}
 
void indexMenu (void) {
 
    int choose;
 
    do {
 
        printf("\nInput : ");
        scanf("%d", &choose);
        fpurge(stdin);
 
 
        switch (choose) {
            case 1:
                combiGen();
                break;
 
            case 2:
                printf("2");
                break;
 
            case 0:
                choose = 0;
                break;
 
            default:
                printf("Choix Invalide 1 ou 2");
                break;
        }
 
    } while (choose != 0);
 
} | 
Partager