Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /* Exercice 1 */
- /* Question 1*/
- #include<stdio.h>
- int main() {
- int N;
- printf("Donnez N :\n");
- scanf("%d",&N);
- int T[N], i, min, max, c;
- float moy;
- printf("\nT[0] = ");
- scanf("%d",&T[0]);
- min = T[0];
- max = T[0];
- c = T[0];
- for (i=1; i<N; i++)
- {
- printf("\nT[%d] = ",i);
- scanf("%d",&T[i]);
- if (T[i]<min) min= T[i];
- if (T[i]>max) max= T[i];
- c += T[i];
- }
- printf("max est: %d\n",max);
- printf("min est: %d\n",min);
- moy=c/N;
- printf("moy est: %f\n",moy);
- return 0;
- }
- /* Question 2*/
- #include<stdio.h>
- int main() {
- int N;
- printf("Donnez N :\n");
- scanf("%d",&N);
- int T[N], i, v, j;
- for (i=0; i<N; i++)
- {
- printf("\nT[%d] = ",i);
- scanf("%d",&T[i]);
- }
- for (i=0; i<N; i++)
- {
- v=0;
- for (j=0; j<N; j++)
- {
- if (T[j]==T[i])
- v=v+1 ;
- }
- printf("le nombre d'occurrencs de %d est: %d\n",T[i],v);
- }
- return 0;
- }
- /* Question 3*/
- #include<stdio.h>
- int main() {
- int N;
- printf("Donnez N :\n");
- scanf("%d",&N);
- int T[N], V[N], i;
- for (i=0; i<N; i++)
- {
- printf("\nT[%d] = ",i);
- scanf("%d",&T[i]);
- }
- for (i=0; i<N; i++)
- {
- V[i]=T[N-i-1];
- printf("%d ",V[i]);
- }
- printf("\n");
- return 0;
- }
- /* Question 4*/
- #include<stdio.h>
- int main() {
- int N;
- printf("Donnez N :\n");
- scanf("%d",&N);
- int T[N], i, j, min, c;
- for (i=0; i<N; i++)
- {
- printf("\nT[%d] = ",i);
- scanf("%d",&T[i]);
- }
- for (i=0; i<N; i++)
- {
- min=i;
- for (j=i; j<N; j++)
- {
- if (T[min]>T[j]) min=j;
- }
- c=T[i];
- T[i]=T[min];
- T[min]=c;
- }
- for (i=0; i<N; i++)
- {
- printf("%d ",T[i]);
- }
- printf("\n");
- return 0;
- }
- /* Exercice 2 */
- /* Question 1*/
- #include<stdio.h>
- int main() {
- int N;
- printf("Donnez N :\n");
- scanf("%d",&N);
- int T[N], i, flag=0;
- for (i=0; i<N; i++)
- {
- printf("\nT[%d] = ",i);
- scanf("%d",&T[i]);
- }
- for (i=0; i<N-1; i++) {
- if (T[i]>T[i+1]) {
- printf("Tableau non trié");
- flag=1;
- break;
- }
- }
- if (flag==0) printf("Tableau trié");
- return 0;
- }
- /* Question 2*/
- #include<stdio.h>
- int main() {
- int N;
- printf("Donnez N :\n");
- scanf("%d", &N);
- int T[N], i, j, flag = 0;
- for (i = 0; i < N; i++) {
- printf("\nT[%d] = ", i);
- scanf("%d", &T[i]);
- }
- for (i = 0; i < N; i++) {
- if (T[i] == 1) {
- flag = 1;
- printf("Tableau non premier");
- break;
- } else
- for (j = 2; j <= T[i] / 2; j++)
- if (T[i] % j == 0) {
- flag = 1;
- printf("Tableau non premier");
- break;
- }
- }
- if (flag==0) printf("Tableau premier");
- return 0;
- }
- /* Exercice 3 */
- #include<stdio.h>
- int main() {
- int N;
- printf("Donnez N :\n");
- scanf("%d",&N);
- int T[N], SD[N], i, j, c;
- for (i=0; i<N; i++)
- {
- printf("\nT[%d] = ",i);
- scanf("%d",&T[i]);
- }
- for (i=0; i<N; i++)
- {
- c=0;
- for (j=1; j<=T[i]/2; j++)
- if (T[i]%j==0) c+=j;
- SD[i]=c;
- }
- for (i=0; i<N; i++)
- {
- for (j=0; j<N; j++)
- {
- if (SD[i]==T[j] && T[i]==SD[j]) printf("%d %d\n", T[i], T[j]);
- }
- }
- printf("\n");
- return 0;
- }
- /* Exercice 4 */
- #include<stdio.h>
- #include<string.h>
- int main(){
- int N1,N2;
- printf("entrer N1 :");
- scanf("%d",&N1);
- printf("entrer N2 :");
- scanf("%d",&N2);
- char S1[N1+1],S2[N2+1],S3[N1+1];
- printf("enter la chaine S1 :");
- scanf("%s",S1);
- printf("enter la chaine S2 :");
- scanf("%s",S2);
- if (strcmp(S1,S2)==0) printf("\nidentique");
- else printf("\nnon identique");
- if (strstr(S1,S2)!=NULL) printf("\nS2 exite dans S1");
- else
- printf("\nnon existance");
- strcpy(S3,S1);
- printf("\n%s",S3);
- strcat(S1,S2);
- printf("\n%s",S1);
- return 0;
- }
- /* Exercice 5 */
- #include<stdio.h>
- int main()
- {
- int N;
- printf("Donner la dimension du tableau");
- scanf("%d",&N);
- int x ,T[N],O[N],j=0,e=0,p,k,i,l;
- printf("Donnez x svp");
- scanf("%d",&x);
- printf("\n Entrez les elements du T:\n");
- for (i=0;i<N;i++)
- {
- printf("\nT[%d]=",i);
- scanf("%d",&T[i]);
- if (T[i]==x)
- {
- O[j]=i;
- j++;
- e=1;
- }
- }
- if (e=0)
- printf("\n%d n'apparait pas dans T" ,x);
- else
- {
- printf("\n%d apparait dans les positions suivantes :",x);
- for(i=0;i<j ;i++)
- printf("\n%d",O[i]);
- }
- p=N;
- for(i=0; i<N ; i++)
- {
- for(k=0;k<j+1;k++)
- {
- if (i==O[k])
- {
- for(l=i ;l<p ;l++)
- T[l]=T[l+1];
- p--;
- for(l=k; l<j ;l++)
- O[l]--;
- }
- }
- }
- printf("\n Le tableau après la suppression de %d : \n", x);
- for(i=0; i<p; i++)
- printf("\nT[%d] = %d\n", i, T[i]);
- return 0;
- }
- /* Exercice 6 */
- #include<stdio.h>
- int main()
- {
- int N1,N2;
- printf("Donnez N1 et N2: ");
- scanf("%d%d",&N1,&N2);
- float T1[N1],T2[N2],T3[N1+N2];
- int i=0,j=0,k=0,p;
- printf("Donnez les élèments de T1 svp");
- for (p=0;p<N1;p++)
- {
- printf("\nT1[%d]=",p);
- scanf("%f",&T1[p]);
- }
- printf("\nDonnez les élèments de T2 svp");
- for (p=0;p<N2;p++)
- {
- printf("\nT2[%d]=",p);
- scanf("%f",&T2[p]);
- }
- while ((i<N1) && (j<N2))
- if(T1[i]<T2[j])
- {
- T3[k]=T1[i];
- k++;
- i++;
- }
- else
- {
- T3[k]=T2[j];
- k++;
- j++;
- }
- while (i<N1)
- {
- T3[k]=T1[i];
- k++;
- i++;
- }
- while (j<N2)
- {
- T3[k]=T2[j];
- k++;
- j++;
- }
- printf("\n T3 après la fusion:");
- for (p=0;p<N1+N2;p++)
- printf("\nT3[%d]=%f\n",p,T3[p]);
- return 0;
- }
- /* Exercice 7 */
- #include<stdio.h>
- int main()
- {
- int N;
- printf("donnez la dimension du tableau: ");
- scanf("%d",&N);
- int T[N],i ,j, k, p;
- printf("donnez les elements de T");
- for (i=0;i<N;i++)
- {
- printf("\nT[%d]=",i);
- scanf("%d",&T[i]);
- }
- p=N;
- for(i=0;i<p-1;i++)
- {
- for(j=p-1;j>i;j--)
- {
- if (T[j]==T[i])
- {
- for(k=j; k<p-1;k++)
- {
- T[k]=T[k+1];
- }
- p--;
- }
- }
- }
- printf("\nle nouveau tableau:");
- for(i=0;i<p; i++)
- {
- printf("\nT[%d]=%d\n" ,i, T[i]);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement