|
|
@ -13,7 +13,7 @@ MaillonDept lireM(FILE *f)//lire maillon
|
|
|
|
return m;
|
|
|
|
return m;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
MaillonDept lireStdin(void)
|
|
|
|
MaillonDept lireStdin(void)//lire un maillon mais à l'aide de l'entrée standard
|
|
|
|
{
|
|
|
|
{
|
|
|
|
MaillonDept m;
|
|
|
|
MaillonDept m;
|
|
|
|
printf("Département :\t");
|
|
|
|
printf("Département :\t");
|
|
|
@ -179,7 +179,7 @@ void MaJnbP(VilleIUT **tV, int nb)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
exit;
|
|
|
|
exit;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
v = searchVille(tV, ville, nb);
|
|
|
|
v = searchVille(tV, reponse, nb);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
printf("Département : \t");
|
|
|
|
printf("Département : \t");
|
|
|
@ -196,7 +196,7 @@ void MaJnbP(VilleIUT **tV, int nb)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
exit;
|
|
|
|
exit;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
elt = recherche(tV[v]->ldept, dpt);
|
|
|
|
elt = recherche(tV[v]->ldept, reponse);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
printf("Nouveau nombre de places disponibles : \t");
|
|
|
|
printf("Nouveau nombre de places disponibles : \t");
|
|
|
@ -250,7 +250,7 @@ void createIUT(VilleIUT **tV, int nb)//crée un IUT dans la ville souhaitée.
|
|
|
|
{
|
|
|
|
{
|
|
|
|
exit;
|
|
|
|
exit;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
v = searchVille(tV, ville, nb);
|
|
|
|
v = searchVille(tV, reponse, nb);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
m = lireStdin();//on lit un maillon sur l'entrée standard
|
|
|
|
m = lireStdin();//on lit un maillon sur l'entrée standard
|
|
|
@ -402,7 +402,6 @@ int Admin(VilleIUT **tV, int nb)
|
|
|
|
//printf("*--------------------6-Retour-----------------------*\n");
|
|
|
|
//printf("*--------------------6-Retour-----------------------*\n");
|
|
|
|
printf("*****************************************************\n");
|
|
|
|
printf("*****************************************************\n");
|
|
|
|
scanf("%d", &reponse);
|
|
|
|
scanf("%d", &reponse);
|
|
|
|
printf("%d", reponse);
|
|
|
|
|
|
|
|
switch(reponse)
|
|
|
|
switch(reponse)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
case 1: MaJnbP(tV, nb); return 0;
|
|
|
|
case 1: MaJnbP(tV, nb); return 0;
|
|
|
@ -434,9 +433,14 @@ MaillonDept * ldepart;
|
|
|
|
printf("*--------------------4-Retour-----------------------*\n");
|
|
|
|
printf("*--------------------4-Retour-----------------------*\n");
|
|
|
|
printf("*****************************************************\n");
|
|
|
|
printf("*****************************************************\n");
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
<<<<<<< HEAD
|
|
|
|
scanf("%d", &reponse);//enregistrement du choix
|
|
|
|
scanf("%d", &reponse);//enregistrement du choix
|
|
|
|
printf("%d", reponse);
|
|
|
|
printf("%d", reponse);
|
|
|
|
while ( reponse == 1 || reponse == 2 || reponse == 3 || reponse == 4){ // tant que le choix fait partie de ces propositions
|
|
|
|
while ( reponse == 1 || reponse == 2 || reponse == 3 || reponse == 4){ // tant que le choix fait partie de ces propositions
|
|
|
|
|
|
|
|
=======
|
|
|
|
|
|
|
|
scanf("%d", &reponse);
|
|
|
|
|
|
|
|
while ( reponse == 1 || reponse == 2 || reponse == 3 || reponse == 4){
|
|
|
|
|
|
|
|
>>>>>>> refs/remotes/origin/master
|
|
|
|
if ( reponse == 1 ){
|
|
|
|
if ( reponse == 1 ){
|
|
|
|
printf("Ville/départements \t Places dispo \t\t Responsable\n");
|
|
|
|
printf("Ville/départements \t Places dispo \t\t Responsable\n");
|
|
|
|
Affichetableau(tV, nb);
|
|
|
|
Affichetableau(tV, nb);
|
|
|
@ -469,7 +473,7 @@ void test (void){ // fonction globale
|
|
|
|
int acc, nb, nbville, repAdm, repVis;
|
|
|
|
int acc, nb, nbville, repAdm, repVis;
|
|
|
|
VilleIUT *tV[200];
|
|
|
|
VilleIUT *tV[200];
|
|
|
|
|
|
|
|
|
|
|
|
nbville = Chargement(tV, 200, "part1.don");
|
|
|
|
nbville = Chargement(tV, 200, "testpart.don");
|
|
|
|
|
|
|
|
|
|
|
|
printf("*****************************************************\n");
|
|
|
|
printf("*****************************************************\n");
|
|
|
|
printf("*---------------------Accueil-----------------------*\n");
|
|
|
|
printf("*---------------------Accueil-----------------------*\n");
|
|
|
|