- 博客(13)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 zju2059
#includeusing namespace std; int N;int dp[110][2010];int h[110];int sum[110]; inline int max(int a,int b){ if(a>=b) return a; else return b;} int cmp(const void*a,
2007-11-04 21:20:00
502
原创 zju1204
#includeusing namespace std; int a[30], n;bool b[30], f; bool BiSearch( int low, int dest ){ int high = n-1; int mid; while( low { mid = (
2007-11-01 16:02:00
437
原创 zju1234
#include int n,k; long len[5001]; long f[5001][1010]; int main() { int cs,ci; int i,j; long temp; scanf("%d",&cs); for (ci=1; ci scanf("%d%d",&k,&n);
2007-10-31 19:42:00
415
原创 zju1101
#include #include #include using namespace std; int n;int v[1001]; int main(){int i,j,k;int mz;while(scanf("%d",&n)==1 && n){ for(i=0;i scanf("%d",&v[i]); sort(
2007-10-31 19:41:00
408
原创 zju1005
#includeusing namespace std; int main(){ int ca,cb,va,vb,n; while(cin>>ca>>cb>>n) { va=vb=0; if(cb==n) {
2007-10-31 19:39:00
438
原创 zju1091
#includeusing namespace std;#include #define size 10int board[size][size];//棋盘 class point{public: int x; int y;};point start,end;queue q;//辅助队列 int cur_lev
2007-10-30 20:07:00
496
转载 zju1008
#include int map[30][4];//最多25个squares，每个squares包含四个三角形 int a[30], f[30]; int n2, n, tag, q; bool Check(int i) { /*判断当前squares是否合法，只要判断该方格的 3号和其左方的squares的1号相
2007-10-27 16:13:00
474
原创 zju1149
#includeusing namespace std;#define size 6 typedef struct node{ int num; int value; int amount;}node; node marble[size+1]; int total_value[size+1]; int
2007-10-26 18:24:00
395
原创 zju1093
#includeusing namespace std;#define max_n 30 typedef struct node{ int a,b; int h;}node; node boxes[3*max_n+10];int n; int cmp(const void *a,const void *b){
2007-10-26 18:22:00
383
原创 zju1028
#include int main(){int inta[32];int num;int odd , even;int i;int flag ;int cases;scanf("%d",&cases);while(cases-- ){ scanf("%d",&num); odd = even =0; for(i = 1; i
2007-10-26 18:21:00
345
原创 zju1107
#include #include#includetypedef struct node{ int x,y; int num;}node; #define max_size 10020node chess[max_size];int opt[max_size];/*记录最优值*/int n,k; int cmp(
2007-10-26 18:17:00
467
原创 zju1004
#includeusing namespace std;#include#include #define max_len 15//字符串的最大长度 int num_push,num_pop;int x[max_len*2];char str[max_len+1];int n; stack operate;char target[max_len+1
2007-10-26 18:15:00
494
原创 zju1002
#includeusing namespace std; inline int max(int a,int b){ if(a>=b) return a; else return b;}inline int min(int a,int b){ if(a} int board[4][4]; typedef struct p
2007-10-26 18:14:00
545
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人