Submission #603209

#	Time	Username	Problem	Language	Result	Execution time	Memory
603209		beaconmc	Duathlon (APIO18_duathlon)	Cpython 3	0 / 100	49 ms	2840 KiB

count_triplets

from math import comb
n,m = map(int, input().split())
if m==n:
  print((n-2)*comb(n,2)*2)
else:
  n-=2
  ans = 0
  for i in range(n):
    ans += (i+1)*(i+2)//2
  print(ans*2)

• Subtask 1: 0 / 5
• Subtask 2: 0 / 11
• Subtask 3: 0 / 8
• Subtask 4: 0 / 10
• Subtask 5: 0 / 13
• Subtask 6: 0 / 15
• Subtask 7: 0 / 20
• Subtask 8: 0 / 8
• Subtask 9: 0 / 10