Minimum coins for change dp for n > 1e6

#include "bits/stdc++.h"
using namespace std;
const int N = 255;
typedef long long int ll;
long long n = 5, ans = 0, cnt;
long long v[5] = {4, 2, 8, 10, 100};
void coin(long long sum, long long len){

    if(sum == 0){
        ans = max(ans, len);//ans = min(ans, len);
        return ;
    }

    for(int i = 0; i < n; i++){
        if(sum >= v[i])
        coin(sum%v[i],1LL *(sum/v[i] + len));
        else return;
    }

}
int main(){

    ll sum;
    cin >>  sum ;
    n = 5;

     coin(sum, 0);
    if(ans != INT_MAX)
    cout << ans;
    else
        cout << -1;
}