经典的模拟队列题目题目链接： http://poj.org/problem?id=31252012年8月7日，暑假组队后个人训练赛第一场Printer QueueTime Limit:1000MSMemory Limit:65536KTotal Submissions:3082Accepted:1655DescriptionThe only printer in the computer science students' union is experiencing an extremely heavy workload. Sometimes there are a hundred j Read More
经典的模拟队列题目题目链接： http://poj.org/problem?id=31252012年8月7日，暑假组队后个人训练赛第一场Printer QueueTime Limit:1000MSMemory Limit:65536KTotal Submissions:3082Accepted:1655DescriptionThe only printer in the computer science students' union is experiencing an extremely heavy workload. Sometimes there are a hundred j Read More
题目链接：http://poj.org/problem?id=15792012年暑假组队后第一场个人训练赛FunctionRunFunTimeLimit:1000MSMemoryLimit:10000KTotalSubmissions:13148Accepted:6836DescriptionWeallloverecursion!Don'twe?Considerathree-parameterrecursivefunctionw(a,b,c):ifa<=0orb<=0orc<=0,thenw(a,b,c)returns:1ifa>20orb>20orc&g Read More
递归和打表找规律或者记忆化搜索题目链接：http://poj.org/problem?id=15792012年暑假组队后第一场个人训练赛FunctionRunFunTimeLimit:1000MSMemoryLimit:10000KTotalSubmissions:13148Accepted:6836DescriptionWeallloverecursion!Don'twe?Considerathree-parameterrecursivefunctionw(a,b,c):ifa20orb>20orc>20,thenw(a,b,c)returns:w(20,20,20)if Read More
题目链接：http://poj.org/problem?id=1573 http://acm.hdu.edu.cn/showproblem.php?pid=1035Robot MotionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3893Accepted Submission(s): 1817Problem DescriptionA robot has been programmed to follow the instr... Read More
题目链接：http://poj.org/problem?id=1573 http://acm.hdu.edu.cn/showproblem.php?pid=1035Robot MotionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3893Accepted Submission(s): 1817Problem DescriptionA robot has been programmed to follow the instr... Read More
根据大数相加，写出的简单的大数相乘的模板，有待改进中~~~~~~#include<stdio.h>#include<string.h>const int N = 100;int main(){ int i,j,k; int d1,d2; int a[N]={0},b[N]={0},sum[2*N]={0}; char c[N];// memset(c,'0',sizeof(c));// memset(a,0,sizeof(a));// memset(b,0,sizeof(b));// memset(sum,0,sizeof(sum));// ... Read More
原作者已经找不到了，但是我是从CSUST的博客栏中看到的，一个很好的模板。我看到的文章来源（不是原出处）：http://blog.csdn.net/csust_acm/article/details/7268029//大数相加#include <stdio.h>#include<string.h>int main(){ int i,d,j,d1; char a[100];int b[101]={0};int c[100]={0}; // memset(b,0,sizeof(b)); // memset(c,0,sizeof(c)); scanf("%s&quo Read More
DP（呃，两边不交叉修路的那道。。。）题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1025Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9069Accepted Submission(s): 2579Problem DescriptionJGShining's kingdom consists o Read More
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1025Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9069Accepted Submission(s): 2579Problem DescriptionJGShining's kingdom consists of 2n(n is no more t Read More