笔试题目

Probblem 1 

'''
two cars to transform the rabbish,but some rabbish cant be placed together
and 2 cars each has a same rabbish amount, you should give us the most rabbish we can transform
each rabbish at most has two constrain
input:
5 2  (5 means the amount of rabbish, 2  means the amount of constrain)
1 2
2 4(this is the constrain ,means the rabbish 2 and 4 cant be placed into the same car
   

:return
most rabbish 2 cars can transform
'''
while True:
    try:
        x=list(map(int,(input().split())))
        rabAmount=x[0]
        limitAmount=x[1]
        limit=[]
        for i in range(limitAmount):
            limit_new = list(map(int,(input().split())))
            limit.append(limit_new)

        carrynum=0
        print(limit)
        car1= set()
        car2= set()

        #use dic
        limitdic={}
        limitdic['a']=5


        print(limitdic)