fork download
  1. import time,math
  2. from sys import stdin,stdout
  3. pi=3.14159265358979323846264338327950
  4. def I():
  5. return (stdin.readline())
  6. def In():
  7. return map(int,stdin.readline().split())
  8. def L():
  9. return list(map(int,stdin.readline().split()))
  10. def Si():
  11. return sorted(list(map(int,stdin.readline().split())))
  12. def Si():
  13. return sorted(list(map(int,stdin.readline().split())),reverse=True)
  14. def P(x):
  15. return stdout.write(str(x)+"\n")
  16. def Pi(x,y):
  17. return stdout.write(str(x)+" "+str(y)+"\n")
  18. #####################################################################################
  19.  
  20. def check(ele,fed,n):
  21. l,r=0,n-1
  22. if fed[0]==ele or fed[n-1]==ele:
  23. return True
  24. else:
  25. while l<=r:
  26. mid=(l+r)//2
  27. if fed[mid]==ele:
  28. return True
  29. elif fed[mid]>ele:
  30. r=mid-1
  31. else:
  32. l=mid+1
  33. else:
  34. return False
  35.  
  36.  
  37. def solve():
  38. n=int(input())
  39. li,d,lfed=[],{},0
  40. for i in range(n):
  41. li.append(int(input()))
  42. abc,fed=[],[]
  43. for i in range(n):
  44. for j in range(n):
  45. for k in range(n):
  46. abc.append(li[i]*li[j]+li[k])
  47. if li[i]!=0:
  48. fed.append(li[i]*(li[j]+li[k]))
  49. d[li[i]*(li[j]+li[k])]=d.get(li[i]*(li[j]+li[k]),0)+1
  50. lfed+=1
  51. fed.sort()
  52. pos=0
  53. for ele in abc:
  54. stm=check(ele,fed,lfed)
  55. #print(stm)
  56. if stm==True:
  57. pos+=d[ele]
  58. print(pos)
  59. return
  60.  
  61. solve()
Success #stdin #stdout 0.02s 9284KB
stdin
2
-1
1
stdout
24