IndiaHacks: Algorithms Qualifiers Round 2 -Shil and Square Sum

Problem:

https://www.hackerearth.com/algorithms-qualifiers-round-2/algorithm/shil-and-square-sum-qualifier2/

This solution solves the testcases partially.

Solution:

int main()
{
    long long int n,k,i,x,j,mod=1000000007;
    scanf("%lld %lld",&n,&k);
    long long int a[n];
    for(i=1;i<=n;i++)
    scanf("%lld",&a[i]);
    x=n-k+1;
    for(i=1;i<=x;i++){
        long long int sum=0;
       
        for(j=1;j<=k;j++){
            sum=sum+((j*j)*(a[i+j-1]));
        }
              printf("%lld ",sum%mod);
    }
    return 0;
}