ABC 207 E - Mod i（线性dp

E - Mod i
思路：
题解
code：

#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define ull unsigned long long
#define ld long double
#define all(x) x.begin(), x.end()
#define mem(x, d) memset(x, d, sizeof(x))
#define eps 1e-6
using namespace std;
const int maxn = 3e3 + 9;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
ll n, m;
int f[maxn][maxn], cnt[maxn][maxn];
ll sum[maxn];

void work()
{
	cin >> n;
	for(int i = 1; i <= n; ++i){
		ll x;cin >> x;
		sum[i] = sum[i-1] + x;
	}
	cnt[0][0] = 1;
	for(int j = 1; j <= n; ++j)
		for(int i = 1; i <= n; ++i)
		{
			int &d = cnt[sum[i] % j][j - 1];
			f[i][j] = d;
			d = (1ll * d + f[i][j - 1]) % mod;
		}
	ll ans = 0;
	for(int i = 1; i <= n; ++i)
		(ans += f[n][i]) %= mod;
	cout << ans;
}

int main()
{
	ios::sync_with_stdio(0);
//	int TT;cin>>TT;while(TT--)
	work();
	return 0;
}