Search found 7 matches

by Jeff
Mon Dec 12, 2005 3:15 pm
Forum: Volume 109 (10900-10999)
Topic: 10954 - Add All
Replies: 80
Views: 27868

Thanks~
I got AC... :D
by Jeff
Mon Dec 12, 2005 7:12 am
Forum: Volume 109 (10900-10999)
Topic: 10954 - Add All
Replies: 80
Views: 27868

10954 - Add All

I don't know why I got WA... help me...please..... #include<stdio.h> int n,all,que[5002]; int add(int in) { int index; index=all; all++; while(index>0) { if(in<que[(index-1)/2]) { que[index]=que[(index-1)/2]; index=(index-1)/2; } else break; } que[index]=in; return 0; } int del() { int index=0; all-...
by Jeff
Sun Aug 21, 2005 7:46 am
Forum: Volume 2 (200-299)
Topic: 245 - Uncompress
Replies: 40
Views: 9104

245 WA

I don't dnow why....please help me....

Code: Select all

cut after AC...^___^......
by Jeff
Sat Aug 20, 2005 5:33 am
Forum: Volume 101 (10100-10199)
Topic: 10154 - Weights and Measures
Replies: 60
Views: 40148

10154 WA

I don't know why.... #include<stdio.h> #include<stdlib.h> int all; int table[5608]; typedef struct wei { int self,other; }ori; ori ary[5608]; int comp(void const *a,void const *b) { return (*(ori*)a).other-(*(ori*)b).other; } int in() { all=0; while(scanf("%d %d",&ary[all].self,&ary[all].other)==2) ...
by Jeff
Tue Aug 16, 2005 7:12 pm
Forum: Volume 103 (10300-10399)
Topic: 10344 - 23 out of 5
Replies: 81
Views: 27419

thank you very much~~~~ :D
by Jeff
Mon Aug 15, 2005 11:26 am
Forum: Volume 103 (10300-10399)
Topic: 10344 - 23 out of 5
Replies: 81
Views: 27419

10344 WA

Please help me.....thanks..... #include<stdio.h> #include<string.h> int num[5]; bool open[5]; bool dfs(int now,int step) { int i; if(step==5) { if(now==23) return 1; return 0; } for(i=0;i<5;i++) { if(!open[i]) { open[i]=1; if(dfs(now+num[i],step+1)) return 1; if(dfs(now-num[i],step+1)) return 1; if(...
by Jeff
Mon May 02, 2005 5:47 pm
Forum: Volume 5 (500-599)
Topic: 598 - Bundling Newspapers
Replies: 25
Views: 8978

598 WA

I don't know why I got WA...... :cry: Please help me..... thanks..... :D #include<stdio.h> char ary[15][35]; int god,j,news; int art[15],artg; int dfs(int t) { for(int k=t;k<news;k++) { art[artg++]=k; if(artg-1==j) { for(int i=1;i<artg;i++) { printf("%s",ary[art[i]]); if(i+1<artg) printf(", "); } pr...

Go to advanced search