#!/usr/bin/env python
# -*- coding: utf-8 -*-
import numpy as np

## 我们现有1,2,5,10面值的硬币.当我们有M元时,解出最小数目的硬币组合.

coin = [1, 2, 5, 10]


def take_coins(m):
    tc = np.array([0, 0, 0, 0])
    tc
    return tc


if __name__ == '__main__':
    List1 = [1, 2, 3, 4]
    List2 = [5, 6, 7, 8]
    ll = []
    for i,j in zip(List1,List2):
        ll.append(i*j)
    for k in ll :
        print(k)

5a86c33cf59b82f0e366e216313239582f746c72
<mask token>

<mask token>


def take_coins(m):
    tc = np.array([0, 0, 0, 0])
    tc
    return tc


if __name__ == '__main__':
    List1 = [1, 2, 3, 4]
    List2 = [5, 6, 7, 8]
    ll = []
    for i, j in zip(List1, List2):
        ll.append(i * j)
    for k in ll:
        print(k)

<mask token>
coin = [1, 2, 5, 10]


def take_coins(m):
    tc = np.array([0, 0, 0, 0])
    tc
    return tc


if __name__ == '__main__':
    List1 = [1, 2, 3, 4]
    List2 = [5, 6, 7, 8]
    ll = []
    for i, j in zip(List1, List2):
        ll.append(i * j)
    for k in ll:
        print(k)

import numpy as np
coin = [1, 2, 5, 10]


def take_coins(m):
    tc = np.array([0, 0, 0, 0])
    tc
    return tc


if __name__ == '__main__':
    List1 = [1, 2, 3, 4]
    List2 = [5, 6, 7, 8]
    ll = []
    for i, j in zip(List1, List2):
        ll.append(i * j)
    for k in ll:
        print(k)

#!/usr/bin/env python
# -*- coding: utf-8 -*-
import numpy as np

## 我们现有1,2,5,10面值的硬币.当我们有M元时,解出最小数目的硬币组合.

coin = [1, 2, 5, 10]


def take_coins(m):
    tc = np.array([0, 0, 0, 0])
    tc
    return tc


if __name__ == '__main__':
    List1 = [1, 2, 3, 4]
    List2 = [5, 6, 7, 8]
    ll = []
    for i,j in zip(List1,List2):
        ll.append(i*j)
    for k in ll :
        print(k)
