Jan, thanks, it was the only case that was wrong!!
I got AC
Search found 9 matches
- Wed May 30, 2007 2:53 pm
- Forum: Volume 7 (700-799)
- Topic: 713 - Adding Reversed Numbers
- Replies: 142
- Views: 60785
- Wed May 30, 2007 2:01 pm
- Forum: Volume 7 (700-799)
- Topic: 713 - Adding Reversed Numbers
- Replies: 142
- Views: 60785
What should i do?
Man, what the hell is going on with UVA ???
I get WA over and over again.
Can u give any advice to fix this problem?
please, help me
Does anybody can see my Java code? I give up
I get WA over and over again.
Can u give any advice to fix this problem?
please, help me
Does anybody can see my Java code? I give up
Code: Select all
Solved
- Tue May 29, 2007 7:16 pm
- Forum: Volume 7 (700-799)
- Topic: 713 - Adding Reversed Numbers
- Replies: 142
- Views: 60785
Please, here is some test, give me the right output
Guys, My program receveid WA, and i don't know why, i have generated some test and my output for these test, but it's not right, Does anybody can give me the right output?
Input
500
139144 39097
186290 72395
265374 15315
252337 299805
112027 383722
254786 101464
65053 192248
150698 196960
440760 ...
Input
500
139144 39097
186290 72395
265374 15315
252337 299805
112027 383722
254786 101464
65053 192248
150698 196960
440760 ...
- Fri May 25, 2007 3:31 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11057 - Exact Sum
- Replies: 50
- Views: 30539
WA
Hi Guys, i've tried to solve this problem, but i got wa, do u have any test cases?
- Fri May 18, 2007 4:21 pm
- Forum: Volume 4 (400-499)
- Topic: 444 - Encoder and Decoder
- Replies: 155
- Views: 44550
PE
i got presentation error, but this problem output is very simple, i cant see where my mistake is, does anybody here can help me?
- Mon May 14, 2007 2:44 pm
- Forum: Volume 106 (10600-10699)
- Topic: 10679 - I Love Strings!!
- Replies: 101
- Views: 69075
10679 WA
Hi guys,
i have made an easy code in java for this problem, but i got WA, does anybody have any test cases for it? Or find a problem with my code?
My code is here:
import java.io.IOException;
class Main {
static String ReadLn(int maxLg) // utility function to read from stdin
{
byte lin ...
i have made an easy code in java for this problem, but i got WA, does anybody have any test cases for it? Or find a problem with my code?
My code is here:
import java.io.IOException;
class Main {
static String ReadLn(int maxLg) // utility function to read from stdin
{
byte lin ...
- Fri May 11, 2007 2:50 pm
- Forum: Volume 7 (700-799)
- Topic: 706 - LCD Display
- Replies: 221
- Views: 65202
my code got wa
could you help me?
my code is doing all that u've said,
it is right, but i got WA, here is:
import java.io.IOException;
class Main {
static String ReadLn(int maxLg) // utility function to read from stdin
{
byte lin[] = new byte[maxLg];
int lg = 0, car = -1;
try {
while (lg < maxLg) {
car ...
my code is doing all that u've said,
it is right, but i got WA, here is:
import java.io.IOException;
class Main {
static String ReadLn(int maxLg) // utility function to read from stdin
{
byte lin[] = new byte[maxLg];
int lg = 0, car = -1;
try {
while (lg < maxLg) {
car ...
- Thu Apr 26, 2007 7:18 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10038 - Jolly Jumpers
- Replies: 445
- Views: 152793
Rocky, thanks for your help!
chunyi81, the result of what you've said is
as you see, my result matches yours, but what is wrong? Do you have any test cases for this problem?
chunyi81, the result of what you've said is
Code: Select all
1 2
Jolly
- Thu Apr 26, 2007 4:17 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10038 - Jolly Jumpers
- Replies: 445
- Views: 152793
10038 - Wrong Answer
I was trying to solve the Jolly Jumpers problem, but i got a wrong answer :-(
here is my java code:
import java.io.IOException;
import java.util.StringTokenizer;
class Main {
static String ReadLn(int maxLg) {
byte lin[] = new byte[maxLg];
int lg = 0, car = -1;
try {
while (lg < maxLg ...
here is my java code:
import java.io.IOException;
import java.util.StringTokenizer;
class Main {
static String ReadLn(int maxLg) {
byte lin[] = new byte[maxLg];
int lg = 0, car = -1;
try {
while (lg < maxLg ...