longest subset such that max of every pair in it is divisible by min

#include<bits/stdc++.h>
using namespace std;
int calc(vector<int>&v){
    int n=v.size();
    if(n==0)
        return 0;
    vector<int>dp(n);
    dp[n-1]=1;
    int ans=INT_MIN;
    for(int i=n-2;i>=0;i--){
        int temp=0;

        for(int j=i+1;j<n;j++){
            if(v[j]%v[i]==0){
                temp=max(temp,dp[j]);
            }
        }
        dp[i]=temp+1;
        ans=max(ans,dp[i]);
    }
    return ans;
}

int main(){
    int n;
    cin>>n;
    vector<int>v(n);
    for(int i=0;i<n;i++){
        cin>>v[i];
    }
    int ans=calc(v);
    cout<<ans;
}