char str[100]; // если контроль ввода то масив под 
                      //строку символов должен существовать АКСИОМА!
char rez[100]; //строка для вывода результата
char smb;
int schetchik=0;
int index=0;
int max=0;
ex=0;
while(ex==0)
{
 -->ввод символа в smb метод ввода твой на выбор
  switch(smb)
  {
    case '0':
    case '1':
    case '2':
    case '3':
    case '4':
    case '5':
    case '6':
    case '7':
    case '8':
    case '9':
      str[index]=smb;
      index++
      break;
//    case ' ':  можно разремировать эти строки но тогда
//    case ',':  нужно увеличивать размер под буфер ввода str
//                  но позволит использовать пробел и запятую
//                 как разделители между числами      
    case 0x0d:
      str[index]=0;
      if(strlen(str)>0)
      {
         if(atoi(str)==max)
         {
           strcat(rez,itoa(schetchik,rez+80,10));
           strcat(rez," ");
         }
         else
           if(atoi(str)>max)
           {
              max=atoi(str);
              strcpy(rez,itoa(schetchik,rez+80,10));
              strcat(rez," ");
           }
         schetchik++;
         if(atoi(str)==0)
           ex=1;
      }          
      index=0;
   }
}
printf("%s",rez);

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

#define MAXSIZE 255

char *ReverseStr (char *s)
{
  int i = 0, j, len;
  char s2 [MAXSIZE];

  len = strlen (s);
  j = len - 1;
  bzero (s2, len + 1);
  while (j >= 0)
  {
    s2 [i++] = s [j--];
    //i++;
    //j--;
  }
  return s2;
}

int convertToDec (char *in, int in_ss)
{
  int len = strlen (in), i, j = 0;
  int N = 0;

  i = len - 1;
  printf ("i = %d\n", i);
  while (i >= 0)
  {
    if ((in [i] >= '0') && (in [i] <= '9'))
      in [i] -= 0x30;
    if ((in [i] >= 'a') && (in [i] <= 'f'))
      in [i] -= 0x57;
    N += in [i] * (int) (pow (in_ss, j));
    i--;
    j++;
  }
  //printf ("%d\n", N);
  return N;
}

char *convert (int number, int out_ss)
{
  int ost = 1, i = 0;
  char out_num [MAXSIZE];

  memset (out_num, '\0', MAXSIZE);
  while (number >= out_ss)
  {
    ost = number % out_ss;
    number = (int) (number / out_ss);
    if ((ost >= 0) && (ost <= 9))
      out_num [i] = ost + 0x30;
    else if ((ost >= 10) && (ost <= 15))
      out_num [i] = ost + 0x57;
    if (number < out_ss)
    {
      i++;
      if ((number >= 0) && (number <= 9))
        out_num [i] = number + 0x30;
      if ((number >= 10) && (number <= 15))
        out_num [i] = number + 0x57;
      //out_num [i] = number + 0x30;
    }
    //printf ("Number: %d\tOst: %d\n", number, ost);
    i++;
  }

  //printf ("Out: %s\n", ReverseStr (out_num));
  return ReverseStr (out_num);
}

int main (int argc, char** argv)
{
  char *in_number, *out_number;
  int in_system, out_system, dec_number;

  if (argc != 4)
  {
    printf ("Usage: %s [number input_system output_system]\n", argv [0]);
    return 0;
  }
  in_number = argv [1];
  in_system = atoi (argv [2]);
  out_system = atoi (argv [3]);
  if (in_system == 10)
    dec_number = atoi (in_number);
  else
    dec_number = convertToDec (in_number, in_system);

  //printf ("DEC: %d\n", dec_number);
  printf ("Input number: %s\n", in_number);
  printf ("Input system: %d\n", in_system);
  printf ("Output system: %d\n", out_system);
  printf ("Output number: ");
  if (out_system != 10)
  {
    out_number = convert (dec_number, out_system);
    printf ("%s\n", out_number);
  }
  else
    printf ("%d\n", dec_number);

  return 0;
}

program pr7;
uses crt;
 const n=6; m=6;
 a:array[1..n,1..m] of real=((0,2,1,2,5,6),
                             (4,5,7,8,1,8),
                             (0,6,2,3,3,4),
                             (5,6,1,9,7,1),
                             (1,2,3,4,5,6),
                             (6,5,4,3,2,1));
 var i,j,k:integer;
 u:real;
 begin
  clrscr;
  read(i,j);
 clrscr;
 for k:=1 to n do
 begin u:=a[k,j]; a[k,j]:=a[k,i];a[k,i]:=u;
 end;
 for j:=1 to n do
 begin for i:=1 to m do write(a[j,i]:3:0);
 writeln;
 end;
 readkey;
 end.

  read(i,j);

for i:=1 to n do
begin 
pd:=a[i,n-i+1];
writeln(pd:3:0);
end

program pr7;
uses crt;
 const n=6; m=6;
 a:array[1..n,1..m] of integer=((0,2,1,2,5,6),
                                (4,5,7,8,1,8),
                                (0,6,2,3,3,4),
                                (5,6,1,9,7,1),
                                (1,2,3,4,5,6),
                                (6,5,4,3,2,1));
var
i,j,k:integer;
Begin
	For i:=1 to n Do 
	Begin
		For j:=1 to m DO write(a[i,j],' ');
		writeln;
		end;
	For i:=1 to n Do 
	Begin
		For j:=0 to m-1 Do 
		Begin
			If j<3 then Begin
			k:=a[i,j+1];
			a[i,j+1]:=a[i,n-j];
			a[i,m-j]:=k;
		end;
	end;
	end;
writeln;
writeln;
For i:=1 to n Do 
Begin
	For j:=1 to m DO write(a[i,j],' ');
	writeln;
end;
readln;
end.