OJ Board

I've been staring at this code for days, and I can't seem to identify the problem. I get WA, but all the test cases come through just great. If anyone could help, I'd be very grateful. import java.io.*; import java.util.*; class Main { int count; char node_names[]; boolean[][] graph; int no_of_nodes...

I guess I'll have to anser my own question:

1. They are two distinct streets yielding two distinct sets of routes.

2. No. And you can't go from one intersection to another and back again even if there are several streets between them in both directions.

The problem text is ambiguous, so I'm posting two clarifying questions: 1: If two streets in the input connect the same two intersections in the same direction, are they two distinct streets or just the same street stated twice? 2: Can you double back on a two way street and call it a loop? Example ...

It worked fine with my solution.

Hi. This code for problem 116 is giving me a runtime error (SIGARBT). I have no idea how to approax this problem, save for posting my frustration on the forum. Is this another everyday acm java bug, or is there really something wrong with my problem? (maybe both, I don't know..) Here is the code: /*...

I get a runtime error (SIGABRT) when I submit this code: I have never encountered the problem b4, so I don't know how to handle it... /* @JUDGE_ID: 34812AC 116 Java */ import java.util.*; import java.io.*; class Key{ double dummy2=0.00000000000000001; double dummy1=0.00000000000005; public int iq, w...