Submission #1339946


Source Code Expand

# coding: utf-8
import array, bisect, collections, copy, heapq, itertools, math, random, re, string, sys, time
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7


def II(): return int(input())
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
def IDI(): return {key: value for key, value in ILI()}


def read():
    N = II()
    a = ILI()
    return (N, a)


def solve(N, a):
    num_min = min(a)
    num_max = max(a)
    ans = num_max - num_min
    return ans


def main():
    params = read()
    print(solve(*params))


if __name__ == "__main__":
    main()

Submission Info

Submission Time
Task B - Traveling AtCoDeer Problem
User ch000k111
Language Python (3.4.3)
Score 200
Code Size 660 Byte
Status AC
Exec Time 212 ms
Memory 6420 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 6
Set Name Test Cases
Sample s1.txt, s2.txt
All in1.txt, in2.txt, in3.txt, in4.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
in1.txt AC 212 ms 6420 KB
in2.txt AC 29 ms 4316 KB
in3.txt AC 29 ms 4320 KB
in4.txt AC 29 ms 4316 KB
s1.txt AC 29 ms 4316 KB
s2.txt AC 29 ms 4320 KB