Поиск номера максимального элемента массива

//---------------------------------------------------------------------------
 
#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
#define N 3
 
//---------------------------------------------------------------------------
 
 
int i;
int A[N];
int nMax;
int rnd;
 
int main()
{
 
randomize();
 
printf(" Elementy massiva:");
 
for(i=0;i<N;i++){
rnd=(rand()*100/RAND_MAX);
A[i]=rnd;
printf("\n A[%d]=%d", i, A[i]);
}
 
    nMax=0;
    for(i=1;i<N;i++)
    if(A[i]>A[nMax])
    nMax=i;
 
    printf("\n Max element: A[%d]=%d", nMax, A[nMax]);
 
    getch();
 
    return 0;
}
//---------------------------------------------------------------------------

//---------------------------------------------------------------------------
 
#include <stdio.h>
# define N 4
 
//---------------------------------------------------------------------------
int main()
{
int a,c,j,i,k;
int B[N];
c=1;
printf ("vvedite chislo: ");
scanf ("%d", &a);
for (i = 1; i < N; i++) {
c=c*10;
}
 
B[1] = a / c;
B[2] = (a-B[1]*c)*10/c;
B[3] = (a-B[1]*c-B[2]*c/10)*100/c;
 
for (k = 1; k < N+1; k++) {
 
switch (B[k]) {
case 1: printf(".----|");
break;
case 2: printf("..---|");
break;
case 3: printf("...--|");
break;
case 4: printf("....-|");
break;
case 5: printf(".....|");
break;
case 6: printf("-....|");
break;
case 7: printf("--...|");
break;
case 8: printf("---..|");
break;
case 9: printf("----.|");
break;
case 0: printf("-----|"); }
 
}
getch();
return 0;
}