HDU 5656 CA Loves GCD

#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <utility>
using namespace std;

#define rep(i,j,k) for (int i=j;i<=k;i++)
#define Rrep(i,j,k) for (int i=j;i>=k;i--)

#define Clean(x,y) memset(x,y,sizeof(x))
#define LL long long
#define ULL unsigned long long
#define inf 0x7fffffff
#define mod %100000007
const int maxn = 1002;

LL dp[maxn][maxn];
int n,T;
int a[maxn];

int g[maxn][maxn];

int gcd(int a,int b)
{
if ( g[a][b] != -1 ) return g[a][b];

return g[a][b] = g[b][a] = (b==0)?a:gcd(b,a%b);
}

int getnum()
{
int ans = 0;
char c = getchar();
while( !isdigit(c) ) c = getchar();

while( isdigit(c) )
{
ans = ans * 10 + c - '0';
c = getchar();
}
return ans;
}
int main()
{
Clean(g,-1);
T = getnum();
while(T--)
{
Clean(dp,0);
n = getnum();
int uplim = 0;
rep(i,1,n)
{
a[i] = getnum();
uplim = max(uplim,a[i]);
}
dp[1][a[1]] = 1;
rep(i,2,n)
{
dp[i][a[i]]++;
rep(j,1,uplim)
{
dp[i][gcd(a[i],j)]+=dp[i-1][j];
dp[i][gcd(a[i],j)]%=100000007;
dp[i][j]+=dp[i-1][j];//不选a[i]
dp[i][j]%=100000007;
}
}
LL ans = 0;
rep(i,1,uplim) ans=(ans+i*dp
[i])%100000007;
printf("%I64d\n",ans%100000007);
}

}