Thanks, it helped me.brianfry713 wrote:1. Print a blank line after every test cases - including the last one.
Search found 7 matches
- Mon Jul 23, 2012 2:33 am
- Forum: Volume 7 (700-799)
- Topic: 796 - Critical Links
- Replies: 54
- Views: 32115
Re: 796. Critical links.(WA on Java) please, help!
- Thu Jul 19, 2012 8:50 pm
- Forum: Volume 7 (700-799)
- Topic: 796 - Critical Links
- Replies: 54
- Views: 32115
Re: 796. Critical links.(WA on Java) please, help!
Check whether you have done two things:
1. Print a blank line after every test cases.
2. first element of two links are similar then sort them ascending orderly to their second element.
1. I print a blank line. Look at this: http://ideone.com/qbu9F
2.Also I sort edges by first element and then ...
1. Print a blank line after every test cases.
2. first element of two links are similar then sort them ascending orderly to their second element.
1. I print a blank line. Look at this: http://ideone.com/qbu9F
2.Also I sort edges by first element and then ...
- Mon Mar 19, 2012 10:49 pm
- Forum: Volume 7 (700-799)
- Topic: 796 - Critical Links
- Replies: 54
- Views: 32115
796. Critical links.(WA on Java) please, help!
Please, help me with it.
I used standart algo for searching bridges, but got a WA.
http://ideone.com/qbu9F
import java.io.*;
import java.util.*;
public class Main {
static int n;
static Scanner sc = new Scanner(System.in);
static PrintWriter pw = new PrintWriter(System.out);
static ...
I used standart algo for searching bridges, but got a WA.
http://ideone.com/qbu9F
import java.io.*;
import java.util.*;
public class Main {
static int n;
static Scanner sc = new Scanner(System.in);
static PrintWriter pw = new PrintWriter(System.out);
static ...
- Fri Mar 16, 2012 2:17 pm
- Forum: Bugs and suggestions
- Topic: 511 - Do You Know the Way to San Jose? - Do nothing AC
- Replies: 62
- Views: 11135
Re: 200 - Rare Order(WA on Java)
YES!!! thank you very much!!!brianfry713 wrote:Print a newline at the end.
- Wed Mar 14, 2012 7:19 pm
- Forum: Bugs and suggestions
- Topic: 511 - Do You Know the Way to San Jose? - Do nothing AC
- Replies: 62
- Views: 11135
Re: 200 - Rare Order(WA on Java)
Did you look through these threads already?
http://acm.uva.es/board/search.php?keywords=200&terms=all&author=&sc=1&sf=titleonly&sr=topics&sk=t&sd=d&st=0&ch=300&t=0&submit=Search
I'm seeing a runtime error on this input:
BC
CA
CB
#
Exception in thread "main" java.util.NoSuchElementException: No ...
http://acm.uva.es/board/search.php?keywords=200&terms=all&author=&sc=1&sf=titleonly&sr=topics&sk=t&sd=d&st=0&ch=300&t=0&submit=Search
I'm seeing a runtime error on this input:
BC
CA
CB
#
Exception in thread "main" java.util.NoSuchElementException: No ...
- Mon Mar 12, 2012 10:06 pm
- Forum: Bugs and suggestions
- Topic: 511 - Do You Know the Way to San Jose? - Do nothing AC
- Replies: 62
- Views: 11135
Re: 200 - Rare Order(WA on Java)
This code gets a RE.
http://ideone.com/uqmIz
Exception in thread "main" java.lang.StringIndexOutOfBoundsException: String index out of range: -1
at java.lang.String.charAt(String.java:686)
at Main.main(Main.java:77)
Sorry, I copy-pasted the wrong code. Now it is the code, which give a WA.( http ...
http://ideone.com/uqmIz
Exception in thread "main" java.lang.StringIndexOutOfBoundsException: String index out of range: -1
at java.lang.String.charAt(String.java:686)
at Main.main(Main.java:77)
Sorry, I copy-pasted the wrong code. Now it is the code, which give a WA.( http ...
- Mon Mar 12, 2012 6:54 pm
- Forum: Bugs and suggestions
- Topic: 511 - Do You Know the Way to San Jose? - Do nothing AC
- Replies: 62
- Views: 11135
200 - Rare Order(WA on Java)
This code got a WA.
I really don't understand why.
import java.util.*;
import java.io.*;
class Stack<T> {
private LinkedList<T> storage = new LinkedList<T>();
public void push(T v) {storage.addFirst(v);}
public T peek() {return storage.getFirst();}
public T pop() {return storage.removeFirst ...
I really don't understand why.
import java.util.*;
import java.io.*;
class Stack<T> {
private LinkedList<T> storage = new LinkedList<T>();
public void push(T v) {storage.addFirst(v);}
public T peek() {return storage.getFirst();}
public T pop() {return storage.removeFirst ...