← Back to List

14566번: Dongjak N1 ↗

Solutions

Python 3
612 B | 612 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
sys.setrecursionlimit(10**7)

BLANK = " "

# inp = input
inp = lambda : sys.stdin.readline().rstrip()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
p = print

def solve():
  n = ii()
  l = sorted(mii())

  dis = []

  for i in range(n - 1):
    dis.append(l[i+1] - l[i])

  mn = min(dis)
  p(mn, dis.count(mn))

if __name__ == "__main__":
  tc = 1

  for t in range(1, tc+1):
    ret = solve()