第八届蓝桥杯省赛C++B组——k倍区间

• 暴力

#include <iostream>

using namespace std;

const int N = 100010;

int n, k;
int a[N], s[N];

int main()
{
    scanf("%d%d", &n, &k);
    for (int i = 1; i <= n; i ++ ) 
    {
        scanf("%d", &a[i]);
        s[i] = s[i - 1] + a[i];
    }

    long long res = 0;
    for (int i = 1; i <= n; i ++ ) 
        for (int j = i; j <= n; j ++ )
            if ((s[j] - s[i - 1]) % k == 0)  
                res ++ ;

    printf("%d\n", res);
    return 0;
}

• 优化

#include <iostream>

using namespace std;

typedef long long LL;

const int N = 100010;

int n, k;
LL s[N];
int a[N], cnt[N];

int main()
{
    scanf("%d%d", &n, &k);
    for (int i = 1; i <= n; i ++ )
    {
        scanf("%d", &a[i]);
        s[i] = s[i - 1] + a[i];
    }

    LL res = 0;
    cnt[0] = 1;
    for (int i = 1; i <= n; i ++ ) 
    {
        res += cnt[s[i] % k];
        cnt[s[i] % k] ++ ;
    }

    printf("%lld\n", res);
    return 0;
}