- 博客(3)
- 收藏
- 关注
原创 HRBUSTOJ 1570 田忌赛马 解题报告
#include #include #include #include using namespace std; int n; int max(int *a,int *b) { int count=0; int i,j; j=n; for(i=n;i;i--) { if(j<=0) break; for(;j;j--)
2012-11-06 20:39:00 596
原创 HDOJ 4006The kth great number 解题报告
链接:http://acm.hdu.edu.cn/showproblem.php?pid=4006 Problem Description Xiao Ming and Xiao Bao are playing a simple Numbers game. In a round Xiao Ming can choose to write down a number, or ask Xia
2012-08-25 22:50:24 240
原创 HDOJ1022 Train Problem I 解题报告
链接:http://acm.hdu.edu.cn/showproblem.php?pid=1022 Problem Description As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by tr
2012-08-21 14:08:36 258
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人