雕刻时光

摘要： http://poj.org/problem?id=2230vectorView Code #include<iostream>#include<vector>using namespace std;vector<int>map[10009];void init(int n){ int i; for(i=1;i<=n;i++) map[i].clear();}void find(int now){ int i; for(i=1;i<=map[now].size();i++) { while(map[now][i-1]!=0){ ... 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=4192这道题A的好辛苦啊！！！易错点：开始时 a,b当做个位数在考虑2 42 93 11(a-b)就会错，哎思维不严密啊！！！View Code #include<iostream>#include<algorithm>#include<cstring>#include<string>#include<cmath>#include<cstdio>#include<cstdlib>#include<map>using 阅读全文