雕刻时光

摘要： http://poj.org/problem?id=3040注意到这么一句话where each denomination of coin evenly divides the next-larger denomination想到贪心，排个序，从高往下取同时加个最小公倍数的优化时间0msView Code #include<iostream>#include<algorithm>#include<string.h>using namespace std;int hash1[21];struct data{ int v,b;}s[29];int cmp(dat 阅读全文