всё равно не
find_most_repeatable_v2( 1125121, 7 ) = 2
find_most_repeatable_v2( 113812131, 9 ) = 3
find_most_repeatable_v2( 11815917151, 11 ) = 5
find_most_repeatable_v2( 1131471917141, 13 ) = 4
find_most_repeatable_v2( 441111711191489, 15 ) = 9
find_most_repeatable_v2( 1551111911155123, 16 ) = 3
find_most_repeatable_v2( 17118131751173171, 17 ) = 7


для теста:

#define N 100
int c,m,i,j,n,a[N];
for(n=1; n<N; n++)
{
for(m=0; m<100000; m++)
{
for(i=0; i<n; i++)
a[i] = 2 + (rand() % 8);
for(i=0; i<(n/2+1); i++)
{
do { j = rand() % n; } while(a[j] == 1 && i < n);
a[j] = 1;
}
c = find_most_repeatable_v2(a,n);
if (c != 1)
{
printf("find_most_repeatable_v2( ");
for(i=0; i<n; i++)
printf("%d",a[i]);
printf(", %d ) = %d\n", n, c);
break;
}
}
}