## Search found 192 matches

Wed Jun 25, 2003 7:56 am
Forum: Volume 6 (600-699)
Replies: 14
Views: 9078
Wed Jun 25, 2003 7:52 am
Forum: Volume 100 (10000-10099)
Replies: 20
Views: 8006

Hi, I try to solve this problem but I really dont understand the input. 2 ->number of scenario 3 ->number of city Hamburg Frankfurt Darmstadt 3 ->number of train 2 ->number of city. 0949 Hamburg 1006 Frankfurt 2 1325 Hamburg 1550 Darmstadt 2 1205 Frankfurt 1411 Darmstadt 0800 Hamburg Darmstadt When ...
Wed Jun 25, 2003 7:04 am
Forum: Volume 104 (10400-10499)
Topic: 10493 - Cats, with or without Hats
Replies: 13
Views: 6815
Oh,,, thanks. I got it.
Wed Jun 25, 2003 3:44 am
Forum: Volume 104 (10400-10499)
Topic: 10493 - Cats, with or without Hats
Replies: 13
Views: 6815

### 10493 - Cats, with or without Hats

Hi, can anyone show me the condition when "multiple" is the answer.

Thanks.
Wed Jun 11, 2003 6:51 am
Forum: Volume 5 (500-599)
Topic: 571 - Jugs
Replies: 24
Views: 12551
You're right eloha, BFS can solved this problem. There are something wrong with my BFS. Now I got AC.

Thanks, Eloha.
RS
Wed Jun 11, 2003 3:40 am
Forum: Volume 3 (300-399)
Topic: 326 - Extrapolation Using a Difference Table
Replies: 5
Views: 3254
Thanks, for reply Dominik. I think this problem can't be solve by construct a complete difference table, so I try to find some equation that satisfy this condition. If the extrapolation difference is n, the eqution become : y(x) = Ax + B.x^2 + C.x^3 + D.x^4 + ... +K1.x^n + K2 where K1 and K2 some co...
Mon Jun 09, 2003 9:45 am
Forum: Volume 3 (300-399)
Topic: 326 - Extrapolation Using a Difference Table
Replies: 5
Views: 3254

### 326 - Extrapolation Using a Difference Table

Hi, I try using Gauss Jordan Elimination to solve this prob, but got WA.
Am I in the right track ?

Thanks
Mon Jun 09, 2003 9:25 am
Forum: Volume 102 (10200-10299)
Topic: 10236 - The Fibonacci Primes
Replies: 28
Views: 11232
hemmm....
Wed Jun 04, 2003 3:49 am
Forum: Volume 5 (500-599)
Topic: 571 - Jugs
Replies: 24
Views: 12551

### 571-Jugs-BFS ?

I use BFS to break this problem, but get TLE.
Is this problem can't be done using BFS ?
Am I in the right track ?

Thanks.
RS
Wed Jun 04, 2003 3:47 am
Forum: Volume 5 (500-599)
Topic: 548 - Tree
Replies: 23
Views: 10795
Hi eloha, I have the same problem with you, get WA. can you check my code whats wrong with them? #include <stdio.h> #include <string.h> #include <stdlib.h> #define delenter(s) if(s[strlen(s)-1] == '\n') s[strlen(s)-1] = '\x0' typedef struct { int left, right; }t_tree; t_tree tree[10008]; int inord[1...
Tue Jun 03, 2003 4:27 am
Forum: Algorithms
Topic: Find the number of a sequence, and backwards...
Replies: 10
Views: 3446
Can anybody know how to dealing with problem 10479 - The hendrie sequence ?
I think precalculated cannot be applied here, since the number is very huge.
Mon Jun 02, 2003 5:49 am
Forum: Volume 103 (10300-10399)
Topic: 10396 - Vampire Numbers
Replies: 21
Views: 7400
Sure, This is modulo 9 congruence problem. If x,y is a vampire number then : x.y == x+y (mod 9) The solution of the above formula is (x mod 9, y mod 9) : (0,0), (2,2), (3,6), (5,8), (6,3) , and (8,5). so you find for (x mod 9, y mod 9) that satisfy the above condition and check whether the number is...
Mon May 26, 2003 4:45 am
Forum: Volume 3 (300-399)
Topic: 336 - A Node Too Far
Replies: 121
Views: 39121
Thanks,
I've got AC when using BFS algorithms. I really don't know why DFS can't solve this problem...

Huge Thanks,
RS
Mon May 26, 2003 4:43 am
Forum: Volume 104 (10400-10499)
Topic: 10490 - Mr. Azad and his Son!!!!!
Replies: 20
Views: 10072
m should be :
unsigned long long int m;
Hi,
I got AC when using long long, so I think that's not the problem.

Mon May 26, 2003 4:37 am
Forum: Volume 103 (10300-10399)
Topic: 10396 - Vampire Numbers
Replies: 21
Views: 7400
Use modulo congruence(I find it in the net).