Submission #1989993

---

Source Code Expand

from bisect import bisect_left, bisect_right, insort_left, insort_right

import numpy as np

import itertools

import math 
from collections import defaultdict as dd
def main():
    n = int(input())
    A = []
    for k in range(n):
        A.append(int(input()))

    A =  sorted(A)

    count = 0
    val = 0
    for a in A:
        if a > val:
            count += 1
            val = a

    print (count)

if __name__ == "__main__":
    # global stime
    # stime = time.clock()
    main()

Submission Info

Judge Result