## Search found 144 matches

Thu Jan 31, 2002 3:40 pm
Forum: Volume 1 (100-199)
Topic: 150 - Double Time
Replies: 18
Views: 3962
Hi! This is a very strange thing because it means nothing !!! The only thing you should know is that 5 October 1582(friday) is 15 October 1582 (Friday) First date is in Julius Ceasar's calendar and the second one is Roman Catolics. From this date you should start counting according to rules that are...
Wed Jan 30, 2002 11:55 am
Forum: Volume 5 (500-599)
Topic: 536 - Tree Recovery
Replies: 19
Views: 8358
Hi! This is quite an easy task. You have to do this using recurence. in the input the first letter is the root. If you find this letter in the inord reprezentation you will know the length of the left and right subtree. And now you can do the same with left subtree... ( the second letter in preord i...
Fri Jan 11, 2002 2:44 pm
Forum: Volume 101 (10100-10199)
Topic: 10117 - Nice Milk
Replies: 6
Views: 3296
Hi
Does anyone have any test cases....

Should I use real or double .....

Because I always have WA

Mon Dec 31, 2001 3:21 pm
Forum: Volume 4 (400-499)
Topic: 459 - Graph Connectivity
Replies: 132
Views: 25810
Hi. I am writing in Pascal and I got accepted ( so I am sure that test case is not wrong) Don't forget that it is multiple input problem !!!!! So the input looks like this number of test cases - blank line -first test -blank line ..... and the output -first output -blank line - second output In the ...
Fri Dec 28, 2001 1:00 pm
Forum: Volume 4 (400-499)
Topic: 497 - Strategic Defense Initiative
Replies: 144
Views: 22045
Thanx.

I go P.E. (it is better than W.A)

Thanks a lot
Thu Dec 27, 2001 2:59 pm
Forum: Volume 4 (400-499)
Topic: 497 - Strategic Defense Initiative
Replies: 144
Views: 22045
Hi I have no idea why i have WA. Could anyone help me???Program p497; VAR stos,tab,wynik,pop:array[1..8000] of integer; wys,max,maxx,y,ilosc,x:longint; begin x:=0; repeat x:=x+1; readln(tab[x]); until eof; ilosc:=x; for x:=1 to ilosc do wynik[x]:=1; for x:=1 to ilosc do pop[x]:=-1; for x:=2 to ilosc...
Thu Dec 20, 2001 1:55 pm
Forum: Volume 6 (600-699)
Topic: 640 - Self Numbers
Replies: 47
Views: 18452
Hi Try do this in brutal way (check all the posibilities) You can do this in this way: for x=1 to 1000000 do if (x was not used before) then begin Write (x) end; generate new number and check it as used (you can use an array) end; This program should generate all the numbers. <font size=-1>[ This Me...
Thu Dec 20, 2001 1:34 pm
Forum: Volume 101 (10100-10199)
Topic: 10101 - Bangla Numbers
Replies: 122
Views: 29245
Hi

I think that there is an error in your 1 and 2 line of output.

there should be
9 kuti 99 lakh.... ( not 9 kuti kuti)
and 1 kuti 1 lakh (not 1 kuti kuti)
Thu Dec 20, 2001 1:09 pm
Forum: Volume 1 (100-199)
Topic: 102 - Ecological Bin Packing
Replies: 485
Views: 53154
Hi

I know what's wrong with your program.

If there are two posibilities you have to print this one which is earlier in alphabetical order.

And your program will write BGC instead of BCG. (if they have the same values).
You have to change 2 cases (1 and 2) in your program and everything will be OK.