Search found 9 matches

by filipek
Fri Jun 04, 2004 12:59 am
Forum: Volume 105 (10500-10599)
Topic: 10594 - Data Flow
Replies: 40
Views: 25400

tat tvam asi wrote: 10 packet 1->4 (10 time unit)
10 packet 1->2->1->4 (50 time unit) ?
Aren't you using then edges 1-2 and 1-4 two times?
by filipek
Tue Jan 13, 2004 4:40 pm
Forum: Volume 105 (10500-10599)
Topic: 10594 - Data Flow
Replies: 40
Views: 25400

4 4 1 3 3 3 4 4 1 2 2 2 4 5 20 1 You cannot send 20 packets through this network, if edge capacity is 1 - you'll send 1 packet through 1-3-4 and one through 1-2-4, but no more. 4 5 1 4 1 1 3 3 3 4 4 1 2 2 2 4 5 20 10 is 80? Sending ten packets through 1-4, which takes 10 * 1 = 10 time, and 10 throu...
by filipek
Tue Oct 07, 2003 6:12 pm
Forum: Algorithms
Topic: plizzzzzzzzzzzzzzzzzz help me in this
Replies: 1
Views: 1482

[cpp] for(i=1;i<n;i++){ do{ q=pie[q]; if(P[q+1]==T ) q=q+1; if(q==m) printf("pattern occurs with shift %d",i-m); q=pie[q]; check++; }while(q>0 && P[q+1]!=T ); [/cpp] I'm not sure i did understood your code (i use Pascal), but, as i see 1. If, at the beginning of a loop, q=m-1, so you nearly found a ...
by filipek
Tue Oct 07, 2003 5:00 pm
Forum: Volume 8 (800-899)
Topic: 857 - Quantiser
Replies: 5
Views: 3079

857 - Quantiser

Hello,
if two events happen at the same time, in what order should they be printed?

Best regards,

Furippo
by filipek
Mon Oct 06, 2003 10:18 am
Forum: Volume 105 (10500-10599)
Topic: 10558 - A Brief Gerrymander
Replies: 6
Views: 4941

10558 - A Brief Gerrymander

Hello, I've been trying for some time to solve this problem, and i have no idea, why i get WA all the time. Is there any trick in this task? I solve it with DP, for each k and l, i find the maximum number of ridings, if you can use k avenues to divide, and the last to the north would be l avenue. Do...
by filipek
Fri Dec 13, 2002 7:50 pm
Forum: Volume 3 (300-399)
Topic: 310 - L--system
Replies: 29
Views: 8453

Hello, i've got a problem with this task too. this is my alghoritm: the maximal word length is the length of the sequence, which we have to find in all D0L words. If i add new word to a queue, and it's longer than maximal length, i add word consisting of m (m=maximal length) first characters of this...
by filipek
Tue Aug 13, 2002 10:05 am
Forum: Volume 103 (10300-10399)
Topic: 10328 - Coin Toss
Replies: 19
Views: 7384

The problem is not here. I would like to know, what problems may occur, when i'm adding two big numbers as strings in GNU Pascal, becouse - like i said - our outputs for every possible input were the same (so the problem is not in the way of adding them).
by filipek
Thu Jul 25, 2002 2:17 pm
Forum: Volume 103 (10300-10399)
Topic: 10328 - Coin Toss
Replies: 19
Views: 7384

10328

Hello,
i've got a little problem with this task. I got WA, but i've checked my output with my friend's program, and in all tests we've got the same outputs, more: our output files were completely the same! My friend's program got AC, of course.
by filipek
Thu Jul 25, 2002 10:47 am
Forum: Volume 103 (10300-10399)
Topic: 10328 - Coin Toss
Replies: 19
Views: 7384

More detail: N - number of tooses, K - length of sequence. Two possible situations: 1. Sequence of length K appeared after N-1 tooses - T(N-1,K) 2. The last K tosses are heads, N-K toss was tail (otherwise, if tosses through N-K to N-1 were heads, the sequence of length K would appear after N-1 toss...

Go to advanced search