## Search found 37 matches

Wed Mar 10, 2004 10:31 pm
Forum: Volume 102 (10200-10299)
Topic: 10235 - Simply Emirp
Replies: 150
Views: 31650
Shit, still WA

Look, I doubt if some your outputs are correct, for example:
I think that :
3254 is 'emirp' not 'not prime'
123511 is 'emirp' not 'not prime'
According to your output, '89 is prime'. So why
'98 is not prime' ? Shouldn't it be emirp :/
Tue Mar 09, 2004 8:55 pm
Forum: Volume 102 (10200-10299)
Topic: 10235 - Simply Emirp
Replies: 150
Views: 31650
Excuse me,

My program gives output "11 is prime" not "11 is emirp". Have you tested it ? It's written in the line :

[pascal]
if (og = g) and (n) then nn:=false;
[/pascal]

See any other mistakes?

With regards
Mon Mar 08, 2004 11:02 pm
Forum: Volume 102 (10200-10299)
Topic: 10235 - Simply Emirp
Replies: 150
Views: 31650
Hi, I tested my program on all your tests, I read all topics about 10235 -- Simply Emirp, but I still get WA. I apologise for putting my code here, but I can't work out what's wrong -- it seems to be all right :/ A little explanation : s, os -- numbers read as strings : s -- read normally, os -- rea...
Sun Mar 07, 2004 3:26 pm
Forum: Volume 106 (10600-10699)
Topic: 10610 - Gopher and Hawks
Replies: 29
Views: 12881
Thanks, I changed it, but ... still WA :/ Look: I inserted a part : [pascal] for i:=1 to 100000 do for j:=1 to 100000 do for v:=1 to 100000 do if 1 = 1 then i:=j; [/pascal] which should give me TL of course. But I got WA in 0.002 which means it was Runtime Error. What is more, I added this part afte...
Sat Mar 06, 2004 10:59 pm
Forum: Volume 106 (10600-10699)
Topic: 10610 - Gopher and Hawks
Replies: 29
Views: 12881
Right, sorry :| I create a queue [named kolej in my program -- that means queue in Polish] and an array where I store: how many steps are needed to get to this point [how many holes you must visit to reach this hole -- named kro]. And this is my program : [pascal]program miazio; {} function odl (ax,...
Fri Mar 05, 2004 11:40 pm
Forum: Volume 106 (10600-10699)
Topic: 10610 - Gopher and Hawks
Replies: 29
Views: 12881

### 10610 Gopher and Hawks WA

Hi, I'm getting angry with this problem. Could anybody please help me ? I wrote the program [in Pascal] using the command val. I used 1..10000 array which I zero after every test case -- and I got WA in 0.000 -- this sucks [I apologise for bad word, but I can't express my feelings in another way whi...
Fri Mar 05, 2004 8:05 pm
Forum: Volume 5 (500-599)
Topic: 543 - Goldbach's Conjecture
Replies: 109
Views: 24411
Yeeeeah, of course

Sorry for this, I was sent a private message telling that Sieve of Erastothenes if of course faster and I also asked my classmate who told me that c/c++ is faster than Pascal.
However, thanks

With regards
Wed Mar 03, 2004 10:38 pm
Forum: Volume 103 (10300-10399)
Topic: 10324 - Zeros and Ones
Replies: 179
Views: 43992
I hate to put wrong codes here, but I've read all topics about 10324 and I haven't found a solution. So, if anybody could ... :> I tested it on all cases I can think of, and it works [as usual :/] [pascal]program miazio; {} procedure change (var a, b:longint); var c:longint; begin c:=a; a:=b; b:=c; ...
Wed Mar 03, 2004 8:31 pm
Forum: Volume 1 (100-199)
Replies: 135
Views: 22398
On holy potatoes !

Thanks, I understand everything now, I think.
I'm gonna write it when I had time.
Thanks once more
With kind regards
Mon Mar 01, 2004 9:50 pm
Forum: Volume 5 (500-599)
Topic: 543 - Goldbach's Conjecture
Replies: 109
Views: 24411

### What's faster -- C/C++ or Pascal ?

Hi everybody, I use Pascal OBVIOUSLY ;) But ... trying to solve 543 - Goldbach's conjecture , I visited Steven Halim's website and it was written that I may store all primes in an array and do it with Brute Force [ if you know the problem ] . I did it [ in Pascal , I checked for every number lower t...
Wed Feb 25, 2004 11:16 pm
Forum: Volume 1 (100-199)
Replies: 135
Views: 22398
Sorry for being stupid, but I don't understand it: You have 3 1 4 6 8 10 9 5 7 2 -- the ranking of events made by a student and 3 1 2 4 9 5 10 6 8 7 -- the correct ranking of events And where there is 9 ? :/ To make it clear, I understand everything up to Then it becomes clear why the answer is 9 Th...
Sat Feb 14, 2004 8:46 pm
Forum: Volume 1 (100-199)
Replies: 135
Views: 22398
Grrrrrrr , me is confused But I ain't understand what to use LCS on :/ If you get AC, please explain me this [click xx wrote : And the last sequence in the input can be changed into: 3 1 4 6 8 10 9 5 7 2 Now you can see clearly why the ouput is 9. ] If you explained me why the output is 9, it would ...
Fri Feb 13, 2004 11:21 pm
Forum: Volume 1 (100-199)
Replies: 135
Views: 22398
Er ... and ? I don't understand it. Every method I use gives me the wrong output! What to do with the RANK sequence? :/ Of course I understand the way you get 2 3 1 4 6 8 10 9 5 7 from 3 1 2 4 9 5 10 6 8 7 , but what to do with this 2 3 1 4 6 8 10 9 5 7 ?? I hope you understand what don't I understa...
Wed Feb 11, 2004 9:46 pm
Forum: Volume 100 (10000-10099)
Topic: 10051 - Tower of Cubes
Replies: 19
Views: 8890

### 10051 - Tower of Cubes

Hey I read that the LIS algorithm is necessary to solve this :/ But you can determine the height of tallest tower with a greedy algorithm, I suppose. I haven't even tried it yet... However, I can't understand the way the LIS algorithm should be used here. Can somebody please explain it to me? Thanks...
Wed Jan 14, 2004 9:38 pm
Forum: Volume 4 (400-499)
Topic: 497 - Strategic Defense Initiative
Replies: 144
Views: 21475
Oh ... :/ Thanks, I've got Accepted it now ;] I didn't read this description of Multiple Input problems. However , when I read raymond's program I understood that the first number is the number of the test cases . But I didn't know that after this number there is a blank line - one simple readln and...