CF#511-C Enlarge GCD（gcd）

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
using namespace std;
int arr[maxn];
int gcd(int a,int b){
    return b==0?a:gcd(b,a%b);
}
int main(){
    int n;
    while(cin>>n){
        for(int i =0 ;i<n;i++){
            cin>>arr[i];
        }
        sort(arr,arr+n);
        int g = arr[0];
        for(int i = 1;i<n;i++){
            g = gcd(arr[i],g);
        }
        int ans = 0;
        int cont;
        for(int j = g;j<=arr[n-1];j++){
            cont = 0;
            for(int k = 0;k<n;k++){
                if(arr[i]%g) continue;
                else cont++;
            }
            ans = max(ans,cont);
        }
        cout<<n-ans<<endl;

    }
}