Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- int max (int m[10][10],int i,int n)
- {
- int j,max;
- max=m[i][0];
- for (j=1;j<n;j++)
- {
- if (max<m[i][j])
- {
- max=m[i][j];
- }
- }
- return max;
- }
- int min (int m[10][10],int j,int n)
- {
- int min,i;
- min=m[0][j];
- for (i=1;i<n;i++)
- {
- if (min>m[i][j])
- {
- min=m[i][j];
- }
- }
- return min;
- }
- int main()
- {
- int m[10][10],i,j,l,c;
- printf ("Saisir L:");
- scanf ("%d",&l);
- printf ("Saisir C: ");
- scanf ("%d",&c);
- for (i=0;i<l;i++)
- {
- for (j=0;j<c;j++)
- {
- printf ("M[%d][%d]: ",i,j);
- scanf ("%d",&m[i][j]);
- }
- }
- system ("cls");
- for (i=0;i<l;i++)
- {
- for (j=0;j<c;j++)
- {
- printf ("%d |",m[i][j]);
- }
- printf ("\n");
- }
- for (i=0;i<l;i++)
- {
- for (j=0;j<c;j++)
- {
- if (max(m,i,c)==min (m,j,l))
- {
- printf ("%d est un points cols\n",m[i][j]);
- }
- }
- }
- }
Add Comment
Please, Sign In to add comment