题目链接:http://codeforces.com/contest/161/problem/B 题意: 有n个商品和k辆购物车,给出每个商品的价钱c和类别t(1表示凳子,2表示铅笔),如果一辆购物车中有凳子,那么这辆购物车中最便宜的那个物品的价格能减少50%,问你如何放这些物品才能使总价钱最少. 思路: 简单贪心,判断凳子数量是否大于等于k行. #include <bits/stdc++.h> using namespace std; typedef long long LL; typede
新概念英语(1-61)A bad cold What is good news for Jimmy? A:Where's Jimmy? B:He's in bed. A:What's the matter with him? B:He feels ill. A:He looks ill. B:We must call the doctor. A:Yes, we must. B:Can you remember the doctor's telephone number? A:Yes, it's
不同磁力链网站网页内容都不同,需要定制 1,并发爬取 并发爬取后,好像一会就被封了 import requests from lxml import etree import re from concurrent.futures import ThreadPoolExecutor def get_mlink(url, headers): """输入某影片磁力链所在的网页,返回该网页中的磁力链""" r = requests.get(url, he