- 博客(7)
- 收藏
- 关注
RSS订阅转载 shishui
View Code program var begin read(); readln(); for i:=1 to 2 do begin end; write(); end. 转载于:https://www.cnblogs.com/C-CODE/archive/2012/07/13/2590714.html
2012-07-13 19:33:00
203
转载 完全背包:Piggy-Bank猪猪储蓄罐
完全背包:Piggy-Bank猪猪储蓄罐 Time Limit:1000MS Memory Limit:65536KTotal Submit:14 Accepted:6 Description Before ACM can do anything, a budget must be prepared and the necessary financial support obta...
2012-06-08 19:03:00
408
转载 01背包 Bone Collector骨骼收集家
题目： 01背包：Bone Collector骨骼收集家 Time Limit:1000MS Memory Limit:65536K Total Submit:44 Accepted:7 Description Many years ago , in Teddy’s hometown there was a man who was called “Bone Coll...
2012-06-08 18:06:00
237
转载 pasture三角形牧场 动态规划
题目： 【培训习题．动态规划】8.7pasture三角形牧场 Time Limit:1000MS Memory Limit:65536K Total Submit:32 Accepted:6 Description 和所有人一样，奶牛喜欢变化。它们正在设想新造型的牧场。奶牛建筑师Hei想建造围有漂亮白色栅栏的三角形牧场。她拥有N(3≤N≤40)块木板，每块的长度Li(1≤Li...
2012-06-08 01:15:00
255
转载 book的复制
题目： 代码： #include<stdio.h> #include<stdlib.h> int f[501][501]={0},value[501]={0},book[501]={0},ans[501][501]={0}; int n,k; int max(int a,int b) { if(a>b)return a; return b; } in...
2012-06-02 23:14:00
138
转载 动态规划
题目：http://60.191.162.158:8080/JudgeOnline/showproblem?problem_id=1230 代码： #include<stdio.h> int f[10001]={0},task[10001][3]={0},time[10001][3]={0}; int main() { int n,k,i,j,p; scanf("...
2012-05-31 14:54:00
96
转载 试水
#include<stdio.h> #include<string.h> #include<stdlib.h> #include<math.h> int bs(int a){ if(a<0)return -a; return a; } int min (int a,int b,int c){ int te...
2012-05-31 00:21:00
159
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人