CF1061C Multiplicity（dp）

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e5+10;
const int mod=1e9+7;
int f[N*10];
int n;
vector<int> v[N];
int main(){
	//freopen("in.txt","r",stdin);
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		v[i].clear();
		int x;
		scanf("%d",&x);
		for(int j=1;j<=sqrt(x);j++){
			if(x%j==0){
				v[i].push_back(j);
				if((j*j)!=x)
					v[i].push_back(x/j);
			}
		}
		sort(v[i].begin(),v[i].end());
	}
	ll ans=0;
	memset(f,0,sizeof f);
	f[0]=1;
	for(int i=0;i<n;i++){
		for(int j=v[i].size()-1;j>=0;j--){
			f[v[i][j]]=(f[v[i][j]]+f[v[i][j]-1])%mod;
			ans=(ans+f[v[i][j]-1])%mod;
		}
	}
	printf("%lld\n",ans);
	return 0;
}