시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
2 초 512 MB 67 38 17 51.515%

문제

The following code snippet calculates the sum of the areas of all the sub rectangular grid in a rectangular grid from (0,0) to (N,N). Find an efficient way to compute that.

sum = 0
for r1 = 0 to N-1
  for c1 = 0 to N-1
    for r2 = r1+1 to N
      for c2 = r2+1 to N
        sum = sum + (r2-r1)*(c2-c1)
print(sum)

입력

Input starts with T the number of test cases. Each test case consists of a single integer N.

출력

For each test output the sum (as computed above). Please note that even though N will fit into 64 bit integer, the sum may not be.

예제 입력 1

5
1
2
3
4
1000

예제 출력 1

1
16
100
400
27944805889000000

출처

ACM-ICPC > Regionals > Asia > Malaysia > Malaysia National Programming Contest > Al-Khawarizmi National Programming Contest 2018 F번

  • 잘못된 데이터를 찾은 사람: cubelover
  • 문제의 오타를 찾은 사람: jh05013