Search found 26 matches

by Yu Fan
Mon Dec 18, 2006 5:27 pm
Forum: Volume 1 (100-199)
Topic: 139 - Telephone Tangles
Replies: 66
Views: 8173

Although i haven't try it yet but thank you very much!!
by Yu Fan
Tue Oct 10, 2006 8:32 am
Forum: Volume 1 (100-199)
Topic: 139 - Telephone Tangles
Replies: 66
Views: 8173

139 WA

I've read some posts on the board and test some IO. but still the judge reply me a lot of WA... someone says that the problem has some tricky point but i can't find it, could anyone help me examine my code?? thanks in advance #include <stdio.h> #include <string.h> char name[3000][100]; char num[3000...
by Yu Fan
Tue Jul 25, 2006 9:16 am
Forum: Volume 1 (100-199)
Topic: 134 - Loglan-A Logical Language
Replies: 45
Views: 4447

134 WA

I've got mant WAs in this problem, and I've viewed all the topics in this forum but still can't find the error. Could anyone help me find the bug or give me some test cases? Thanks in advance; #include <stdio.h> #include <string.h> #define UNCHECK 0 #define A 1 #define MOD 2 #define BA 3 #define DA ...
by Yu Fan
Wed Jan 25, 2006 8:23 am
Forum: Volume 6 (600-699)
Topic: 665 - False coin
Replies: 15
Views: 7697

665

in this input, what is the answer should be?

1

5 2
1 1 2
=
1 1 3
<
by Yu Fan
Sun Aug 14, 2005 3:31 am
Forum: Volume 6 (600-699)
Topic: 605 - The Rotating Disk
Replies: 8
Views: 4637

605

in this problem,how can we detemine whether the track can be solved?
thanks in advance
by Yu Fan
Thu Aug 11, 2005 10:29 am
Forum: Volume 7 (700-799)
Topic: 777 - Codebreakers
Replies: 1
Views: 1794

notice that the set S could be empty
by Yu Fan
Sat Jul 09, 2005 1:59 pm
Forum: Volume 6 (600-699)
Topic: 600 - A Duckpin Tournament
Replies: 12
Views: 6701

600 WA

I couldnt find what wrong with it; and even cant understand the input form; i guess the three tries are right justifed but i'm not sure :( #include <stdio.h> #include <stdlib.h> #include <string.h> inline bool num(char p) { return (p>='0'&&p<='9'); } char t[3][50]={0}; int score[36]; int toscore(int...
by Yu Fan
Wed Jun 22, 2005 6:17 am
Forum: Volume 101 (10100-10199)
Topic: 10157 - Expressions
Replies: 23
Views: 12117

wow~
i've thought about it for a long~ time but cannot construct a correct recursive function before i couldn't avoid counting identical expressions

anyway, thank you~ :P
by Yu Fan
Tue Jun 21, 2005 2:08 pm
Forum: Volume 101 (10100-10199)
Topic: 10157 - Expressions
Replies: 23
Views: 12117

Thanks, but could you explain how did you obtain this formula?I couldn't understand...... :(


could you tell me the detail? :roll:
by Yu Fan
Tue Jun 21, 2005 8:16 am
Forum: Volume 101 (10100-10199)
Topic: 10157 - Expressions
Replies: 23
Views: 12117

10157

I think it could be solved with DP but I can't construct the recursive function, could some one help me?
Or.... it's not a DP problem? :-?
by Yu Fan
Thu Jun 16, 2005 7:05 am
Forum: Volume 101 (10100-10199)
Topic: 10165 - Stone Game
Replies: 6
Views: 2875

10165

I've viewed some topics says that it could be solved with binary sequence... but i can't imagine it.
someone helps me? :o
by Yu Fan
Tue Jun 14, 2005 4:01 am
Forum: Volume 6 (600-699)
Topic: 690 - Pipeline Scheduling
Replies: 4
Views: 2456

Finally I got AC in 3.7sec...
how slow it is.......><
by Yu Fan
Tue Jun 14, 2005 3:52 am
Forum: Volume 6 (600-699)
Topic: 690 - Pipeline Scheduling
Replies: 4
Views: 2456

Thanks for your input and i now have to fight with TLE......
by Yu Fan
Tue Jun 14, 2005 3:02 am
Forum: Volume 6 (600-699)
Topic: 690 - Pipeline Scheduling
Replies: 4
Views: 2456

690

#include <stdio.h> bool map[5][30]; int e[5]; int n,would[30],w; bool insertable(int a1,int a2,int a3,int a4,int a5); void test(int s1,int s2,int s3,int s4,int s5,int i,int start,int x); int min; inline int _min(int a,int b) { if(a<b) return a; return b; } int main() { int i,j; char p[30]; int s[5]...
by Yu Fan
Fri May 27, 2005 9:22 am
Forum: Algorithms
Topic: about chinese postman problem
Replies: 2
Views: 1350

about chinese postman problem

could someone give me an algorithm of the minimal cost matching in chinese postman problem?
i saw some webpage says that there is a O(n+3) algorithm but it didn't provide it...

Go to advanced search