摘要：
Description 你要购买$m$种物品各一件，一共有$n$家商店，你到第i家商店的路费为$d_i$，在第$i$家商店购买第$j$种物品的费用为$c_{(i,j)}$，求最小总费用。 Input 第一行包含两个正整数$n,m(1\leqslant n\leqslant 100,1\leqslan 阅读全文
摘要：
Description Farmer John is at the market to purchase supplies for his farm. He has in his pocket K coins (1 include include include include define inf 阅读全文
该文被密码保护。 阅读全文
摘要：
Description Bessie is out at the movies. Being mischievous as always, she has decided to hide from Farmer John for L (1 include include include includ 阅读全文
摘要：
Description Kiana最近沉迷于一款神奇的游戏无法自拔。 简单来说，这款游戏是在一个平面上进行的。有一架弹弓位于(0,0)处，每次Kiana可以用它向第一象限发射一只红色的小鸟，小鸟们的飞行轨迹均为形如y=ax2+bx的曲线，其中a,b是Kiana指定的参数，且必须满足a include 阅读全文