G - Super Subarray

Super Subarray

 

 

 

 

 

 一个数能被几个数整除，则能被它们的最小公倍数整除

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const  int maxn = 2010;
const int mod=1e9+7;
ll a[maxn],sum[maxn];

int main()
{
    int t;
    scanf("%d",&t);
    while( t-- ){
        int n;
        scanf("%d",&n);
        sum[0]=0;
        for(int i=1;i<=n;i++){
            scanf("%lld",&a[i]);
            sum[i]=sum[i-1]+a[i];
        }
        int ans=0;
        for(int i=1;i<=n;i++){
            ll lcm=1;
            for(int j=i;j<=n;j++){
                ll tot = sum[j]-sum[i-1];
                lcm = (lcm/__gcd(lcm,a[j]))*a[j];
                if( lcm>sum[n]) break;
                if( tot%lcm==0 ) ans++;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}