Search found 9 matches

by thurbo
Tue Jan 09, 2007 11:02 pm
Forum: Bugs and suggestions
Topic: 389 - PE
Replies: 7
Views: 4167

389 PE

Going through my PE programs and I have PE for this problem as well.
Using C++/STL, I thought that maybe setw in combination with string could be a problem but the following gives PE too:

struct Solution {
string number;

friend ostream& operator<<(ostream& strm, const Solution& solution) {
if ...
by thurbo
Wed Nov 01, 2006 12:02 pm
Forum: Volume 3 (300-399)
Topic: 337 - Interpreting Control Sequences
Replies: 20
Views: 6449

Different output

Hmmm,

My program just got accepted but gives a different output on this test input. (Please note that there is an error in your test input, it says that there will be 6 more lines of input. This will include the 0, not sure if that is what you meant).
My output is as follows:

Case 1 ...
by thurbo
Wed Oct 11, 2006 2:25 am
Forum: Volume 9 (900-999)
Topic: 901 - From Databases to XML
Replies: 3
Views: 6033

901 - From Databases to XML

Hi,

The problem was more challenging than I thought :-).
Basically, I read testcases and output the resulting XML.
For every testcase I first determine the possible relationships between tables (assuming that primary keys can consist of one or more columns), I collect the root nodes (the nodes to ...
by thurbo
Sun Aug 13, 2006 10:03 pm
Forum: Volume 4 (400-499)
Topic: 474 - Heads / Tails Probability
Replies: 50
Views: 18434

Hi,

I also got a WA first, read this post changed my solution and got accepted.
Now the funny part is that I checked all possibilities and got the same result, except for n = 6.
My solution gave first 2^-6 = 1.563e-2 and got a WA.
Now it returns 2^-6 = 1.562e-2 and it gets accepted. In my opinion ...
by thurbo
Sat Jul 15, 2006 12:26 am
Forum: Volume 4 (400-499)
Topic: 487 - Boggle Blitz
Replies: 10
Views: 7513

Algorithm

Hi,

It has been a while so I had to search for things :-).

First I build up a collection of all possible edges.
For every edge I will add the corresponding word to the collection of words for the tail of the edge.
For every word in the collection, remove it (after storing if length >= 3) and for ...
by thurbo
Tue May 23, 2006 12:29 pm
Forum: Volume 107 (10700-10799)
Topic: 10757 - Interpreting SQL
Replies: 13
Views: 6833


1
WHERE 2 3
FROM I
ORDER S
1 XXX
2 YYY
3 ZZZ
SELECT FROM, ORDER
FROM WHERE
WHERE FROM = 2 AND ORDER = 3 OR 0 = 1

Imho, according to the problem description, the column ORDER should be compared to a string constant instead of to a number:
WHERE FROM = 2 AND ORDER = "3" OR 0 = 1

You are ...
by thurbo
Fri Apr 28, 2006 11:11 am
Forum: Volume 107 (10700-10799)
Topic: 10757 - Interpreting SQL
Replies: 13
Views: 6833

Just my 2 cents:

After reading this thread I decided to give it try (very tempting with its 0% solutions) and just started with a program that just reads input (not that trivial).
Anyway, if I would find an error in the input the program would hang itself and that is exactly what I got (TLE) which ...
by thurbo
Wed Apr 12, 2006 4:26 pm
Forum: Volume 4 (400-499)
Topic: 487 - Boggle Blitz
Replies: 10
Views: 7513

Mmmm, run diff to check for differences but couldn't find any. Guess I am missing something but what?
As it seems that both our programs generate the same output, I assume it has something to do with special cases but I am completely blank. Do you have any ideas?
Thanks,

Jeroen
by thurbo
Wed Apr 05, 2006 2:24 pm
Forum: Volume 4 (400-499)
Topic: 487 - Boggle Blitz
Replies: 10
Views: 7513

487 - Boggle Blitz

Hi,

I am getting WA for problem 487 (Boggle Blitz).
Not sure if it depends on reading the input incorrectly or just computing wrong results.
Anyway, here is my test input and test output (other examples would be appreciated as well).

Input:
10

3
one
top
dog

4
abcd
bcda
cdab
dabc

1
c

2
ab
cd

4 ...

Go to advanced search