Python read_ints示例

示例#1

def main(argv):
    lines = files.read_ints(argv[0])
    T = lines[0]

    for i in range(T):
        N = lines[i + 1]
        print(sieve(count(N)))

示例#2

文件： red_john_is_back.py 项目： cowboysmall/hackerrank

def main(argv):
    lines = files.read_ints(argv[0])
    T     = lines[0]

    for i in range(T):
        N = lines[i + 1]
        print(sieve(count(N)))

示例#3

def main(argv):
    lines = files.read_ints(argv[0])
    T = lines[0]

    for i in range(T):
        n = lines[(3 * i) + 1]
        a = lines[(3 * i) + 2]
        b = lines[(3 * i) + 3]
        print(' '.join(str(val) for val in sorted(last_stones(n, a, b))))

示例#4

文件： is_fibo.py 项目： cowboysmall/hackerrank

def main(argv):
    lines = files.read_ints(argv[0])
    T     = lines[0]
    F     = fibonacci(10 ** 10)

    for N in lines[1:]:
        if N in F:
            print('IsFibo')
        else:
            print('IsNotFibo')

示例#5

def main(argv):
    lines = files.read_ints(argv[0])
    T = lines[0]
    F = fibonacci(10**10)

    for N in lines[1:]:
        if N in F:
            print('IsFibo')
        else:
            print('IsNotFibo')

示例#6

文件： kaprekar_numbers.py 项目： cowboysmall/hackerrank

def main(argv):
    lines   = files.read_ints(argv[0])
    p       = lines[0]
    q       = lines[1]

    numbers = kaprekar_numbers(p, q)

    if numbers:
        print(' '.join(str(n) for n in numbers))
    else:
        print('INVALID RANGE')

示例#7

def main(argv):
    lines   = files.read_ints(argv[0])
    p       = lines[0]
    q       = lines[1]

    numbers = kaprekar_numbers(p, q)

    if numbers:
        print(' '.join(str(n) for n in numbers))
    else:
        print('INVALID RANGE')

示例#8

文件： maximizing_xor.py 项目： cowboysmall/hackerrank

def main(argv):
    L, R = files.read_ints(argv[0])

    print(max_xor(L, R))

示例#9

文件： sherlock_and_the_beast.py 项目： cowboysmall/hackerrank

def main(argv):
    lines = files.read_ints(argv[0])

    for line in lines[1:]:
        print(decent_number(line))

示例#10

def main(argv):
    values = files.read_ints(argv[0])

    for value in values[1:]:
        print(grow(value))

示例#11

文件： minimum_draws.py 项目： cowboysmall/hackerrank

def main(argv):
    ints = files.read_ints(argv[0])
    T    = ints[0]

    for P in ints[1:]:
        print(minimum_draws(P))

示例#12

文件： find_digits.py 项目： cowboysmall-comp/hackerrank

def main(argv):
    lines = files.read_ints(argv[0])
    T     = lines[0]

    for N in lines[1:]:
        print(count_digit_dividers(N))

示例#13

文件： utopian_tree.py 项目： cowboysmall/hackerrank

def main(argv):
    values = files.read_ints(argv[0])

    for value in values[1:]:
        print(grow(value))

示例#14

def main(argv):
    lines = files.read_ints(argv[0])
    a = lines[0]
    b = lines[1]

    print(solve_me_first(a, b))

示例#15

文件： find_digits.py 项目： cowboysmall/hackerrank

def main(argv):
    lines = files.read_ints(argv[0])
    T     = lines[0]

    for N in lines[1:]:
        print(count_digit_dividers(N))

示例#16

文件： halloween_party.py 项目： cowboysmall/hackerrank

def main(argv):
    lines = files.read_ints(argv[0])
    T     = lines[0]

    for K in lines[1:]:
        print(optimal_slices(K))

示例#17

文件： the_time_in_words.py 项目： cowboysmall-comp/hackerrank

def main(argv):
    H, M = files.read_ints(argv[0])

    print(time_in_words(H, M))

示例#18

文件： max_min.py 项目： cowboysmall/hackerrank

def main(argv):
    lines = files.read_ints(argv[0])
    N     = lines[0]
    K     = lines[1]

    print(minimum_unfairness(lines[2:], K))

示例#19

文件： longest_increasing_subsequence.py 项目： cowboysmall/hackerrank

def main(argv):
    lines = files.read_ints(argv[0])
    N     = lines[0]
    A     = lines[1:]

    print(lis(N, A))

示例#20

def main(argv):
    ints = files.read_ints(argv[0])
    T = ints[0]

    for P in ints[1:]:
        print(minimum_draws(P))

示例#21

文件： the_time_in_words.py 项目： cowboysmall/hackerrank

def main(argv):
    H, M = files.read_ints(argv[0])

    print(time_in_words(H, M))

示例#22

def main(argv):
    L, R = files.read_ints(argv[0])

    print(max_xor(L, R))

示例#23

def main(argv):
    lines = files.read_ints(argv[0])
    N = lines[0]
    R = lines[1:]

    print(candies(N, R))

示例#24

文件： longest_increasing_subsequence.py 项目： cowboysmall-comp/hackerrank

def main(argv):
    lines = files.read_ints(argv[0])
    N = lines[0]
    A = lines[1:]

    print(lis(N, A))

示例#25

def main(argv):
    lines = files.read_ints(argv[0])
    N = lines[0]
    K = lines[1]

    print(minimum_unfairness(lines[2:], K))

示例#26

def main(argv):
    lines = files.read_ints(argv[0])
    index = lines[0]
    k     = lines[1]

    print genetics.number_to_pattern(index, k)

示例#27

def main(argv):
    lines = files.read_ints(argv[0])
    T = lines[0]

    for K in lines[1:]:
        print(optimal_slices(K))

示例#28

文件： sherlock_and_the_beast.py 项目： cowboysmall-comp/hackerrank

def main(argv):
    lines = files.read_ints(argv[0])

    for line in lines[1:]:
        print(decent_number(line))

示例#29

文件： candies.py 项目： cowboysmall/hackerrank

def main(argv):
    lines = files.read_ints(argv[0])
    N     = lines[0]
    R     = lines[1:]

    print(candies(N, R))

示例#30

文件： solve_me_first.py 项目： cowboysmall/hackerrank

def main(argv):
    lines = files.read_ints(argv[0])
    a     = lines[0]
    b     = lines[1]

    print(solve_me_first(a, b))