yduqytd的专栏

http://acm.hdu.edu.cn/showproblem.php?pid=4550分析：就是前导可恶的0，然后利用字符串，大于序列第一个数的放右边，反之放左边（#include#include#include#includeusing namespace std;int main(){ string str,card; char t; int T,i,j,len

http://acm.hdu.edu.cn/showproblem.php?pid=1000枚举~#include#includeusing namespace std;const int N=100005;char str[N];int main(){ int h,t,i,n,flag,num1,num2,count1,count2; while(scanf("%d",&

http://acm.hdu.edu.cn/showproblem.php?pid=1711#include #include using namespace std;const int NM=1000005;int a[NM],b[10005],next[10005],x,y;void get_nextval(){ int i,j; j=0; ne

http://acm.zju.edu.cn/onlinejudge/showRuns.do?contestId=1&search=false&firstId=3307838&lastId=-1&problemCode=&handle=&idStart=&idEnd=题意：寻找字典中是否有匹配的词，匹配原则：单词每个字符的顺序可以不同#include#include#include