Question 16th: a maximum of about

 

[Plain]
# Include <stdio. h>
 
Void sort (int array [], int num );
 
Int main ()
{

Int j;
Int I;
Int num;
Int mark;
Int count;
Int max;
Int array [200];
 
While (scanf ("% d", & num )! = EOF)
{

For (I = 0; I <num; I ++)
{
Scanf ("% d", & array [I]);
}

Mark = 0;
Sort (array, num );
For (I = 0; I <num; I ++)
{
Count = 1;
For (j = 2; j <= array [I]/2; j ++)
{
If (array [I] % j = 0)
{
Count ++;
}
}
If (count> mark)
{
Mark = count;
Max = array [I];
}
}
 
Printf ("% d \ n", max );
}
}
 
Void sort (int array [], int num)
{
Int I;
Int j;
Int t;
 
For (I = 0; I <num; I ++)
{
For (j = I; j <num; j ++)
{
If (array [I]> array [j])
{
T = array [I];
Array [I] = array [j];
Array [j] = t;
}
}
}
}

# Include <stdio. h>

Void sort (int array [], int num );

Int main ()
{
 
Int j;
Int I;
Int num;
Int mark;
Int count;
Int max;
Int array [200];

While (scanf ("% d", & num )! = EOF)
{
 
For (I = 0; I <num; I ++)
{
Scanf ("% d", & array [I]);
}

Mark = 0;
Sort (array, num );
For (I = 0; I <num; I ++)
{
Count = 1;
For (j = 2; j <= array [I]/2; j ++)
{
If (array [I] % j = 0)
{
Count ++;
}
}
If (count> mark)
{
Mark = count;
Max = array [I];
}
}

Printf ("% d \ n", max );
}
}

Void sort (int array [], int num)
{
Int I;
Int j;
Int t;

For (I = 0; I <num; I ++)
{
For (j = I; j <num; j ++)
{
If (array [I]> array [j])
{
T = array [I];
Array [I] = array [j];
Array [j] = t;
}
}
}
}