pourchot/DEV
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

12 Octobre

Browse Source
This commit is contained in:
Adrian POURCHOT 2022-10-12 16:41:36 +02:00
parent 965589da20
commit d6fccd8f37
6 changed files with 119 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
DEV1.1/TP05:Boucles/Boucles:suite/Boucles:encore/.nfs00000000008c1c9600000051
View File

Binary file not shown.

25
DEV1.1/TP06:Tableaux/filtre.c Normal file
View File

@ -0,0 +1,25 @@
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
int main() {
int i;
int tab[10];
srand(time(NULL));
for (i=0;i<10;i++){
tab[i]=((rand()%101)-50);
} printf("+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+\n");
for (i=0;i<10;i++){
printf("| %3d ",tab[i]);
} printf("|\n+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+\n");
printf("Voici le tableau sans les valeurs negatives:\n");
printf("+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+\n");
for (i=0;i<10;i++){
if (tab[i]>0){
printf("| %3d ",tab[i]);
} else{
printf("| ");
}
} printf("|\n+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+\n");
return 0;
}

22
DEV1.1/TP06:Tableaux/maximum.c Normal file
View File

@ -0,0 +1,22 @@
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
int main() {
int i;
int max;
int tab[10];
srand(time(NULL));
for (i=0;i<10;i++){
tab[i]=((rand()%101)-50);
} printf("+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+\n");
max=tab[0];
for (i=0;i<10;i++){
printf("| %3d ",tab[i]);
if (max<tab[i]){
max=tab[i];
}
} printf("|\n+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+\n");
printf("Le plus gans element du tableaux est %d\n",max);
return 0;
}

29
DEV1.1/TP06:Tableaux/miroir.c Normal file
View File

@ -0,0 +1,29 @@
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
int main() {
int i;
int j;
int k;
int tab[10];
srand(time(NULL));
for (i=0;i<10;i++){
tab[i]=((rand()%101)-50);
} printf("+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+\n");
for (i=0;i<10;i++){
printf("| %3d ",tab[i]);
} printf("|\n+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+\n");
printf("Voici le tableaux inverse:\n+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+\n");
i=9;
for(j=0;j<5;j++){
k=tab[j];
tab[j]=tab[i];
tab[i]=k;
i--;
}
for (i=0;i<10;i++){
printf("| %3d ",tab[i]);
} printf("|\n+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+\n");
return 0;
}

27
DEV1.1/TP06:Tableaux/recherche.c Normal file
View File

@ -0,0 +1,27 @@
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
int main() {
int i;
int n;
int m;
int min=-1;
int tab[10];
srand(time(NULL));
for (i=0;i<10;i++){
tab[i]=((rand()%101)-50);
} printf("+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+\n");
for (i=0;i<10;i++){
printf("| %3d ",tab[i]);
} printf("|\n+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+\n");
printf("Veuillez saisir un entier : ");
scanf("%d",&m);
for (i=0;i<10;i++){
if (tab[i]==m){
min = i;
break;
}
} printf("Le plus petit indice ou se trouve votre entier est %d .\n",min);
return 0;
}

16
DEV1.1/TP06:Tableaux/remplissage.c Normal file
View File

@ -0,0 +1,16 @@
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
int main() {
int i;
int tab[10];
srand(time(NULL));
for (i=0;i<10;i++){
tab[i]=((rand()%101)-50);
} printf("+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+\n");
for (i=0;i<10;i++){
printf("| %3d ",tab[i]);
} printf("|\n+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+\n");
return 0;
}