## Search found 9 matches

Wed Jan 14, 2009 5:29 pm
Forum: Volume 101 (10100-10199)
Topic: 10125 - Sumsets
Replies: 50
Views: 15943

### Re: 10125 - Sumsets

For input 4 -1 0 1 0 the correct output from an old post is 0. logically , -1 + 0 + 1 = 0, but these elements are not distinct(zero appears twice). Can someone give me an explanation.

Thanks!
Wed Jan 14, 2009 4:28 pm
Forum: Volume 101 (10100-10199)
Topic: 10194 - Football (aka Soccer)
Replies: 119
Views: 38289

### Re: 10194 - Football (aka Soccer)

Be careful, it's not only the case insensitive comparison to mind. There should be a blank line BETWEEN each case. So a '\n' after the last case should be avoided as it gives WA.
Sat Sep 06, 2008 8:35 pm
Forum: Volume 1 (100-199)
Topic: 105 - The Skyline Problem
Replies: 160
Views: 29201

### 105 WA Need Help Please!!!

I really can't understand what's wrong with my code :x , it solves correctly every input on the forum, but the judge gives me WA! #include <iostream> #include <stdio.h> #define max 10000 using namespace std; int main() { int t[max+1]; int le,he,ri,pos,i,tmp; bool flag; flag=false; for (i=1;i<=max;i+...
Fri Dec 07, 2007 9:11 pm
Forum: Volume 100 (10000-10099)
Topic: 10049 - Self-describing Sequence
Replies: 33
Views: 13357

### 10049 WA Absolutely need your help

Need immediate help, on every problem i submit on the judge, I GET WA. I submit in pascal. Look at my source for this problem. Please someone pm me and help me. {#10049 Self-Describing Sequence} program sequence; const n=673365; var t:array[1..n] of longint; i,j,k,pos:longint; begin t[1]:=1; t[2]:=3...
Sat Dec 01, 2007 9:34 pm
Forum: Volume 100 (10000-10099)
Topic: 10049 - Self-describing Sequence
Replies: 33
Views: 13357

### 10049 Self-Describing Sequence

I get WA on every problem i submit in pascal. Please somebody look my source code for this problem {#10049 Self-Describing Sequence}, compile it, run it and test it. I think my output is correct. Please heeeeelp me {#10049 Self-Describing Sequence} program sequence; const n=673365; var t:array[1..n]...
Sat Dec 01, 2007 8:57 pm
Forum: Volume 100 (10000-10099)
Topic: 10049 - Self-describing Sequence
Replies: 33
Views: 13357
I am new to the judge and have a lot of trouble with my submissions. I get WA on every problem Please somebody look my source code for this problem, compile it, run it and test it. I think my output is correct but so should be something else with the judging system. I use Pascal. Please heeeeelp me ...
Sun Oct 14, 2007 7:10 pm
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 191034
You can output result of each test case after you process it. Or you can do it all at once. It doesn't really matter, what they do is redirect your output to a file and then compare with their results (or run a program to check it). I am guessing you are using Pascal, so I can't really help you muc...
Wed Oct 10, 2007 8:35 pm
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 191034
Darko wrote:You read input from standard in and write to standard out.
Thnx darko, read all test cases and then output results? or just input output, input output?
Sun Oct 07, 2007 1:31 pm
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 191034

### Need Help, I'm New..

Hi all, i just registered and made my first submission(3n+1) on the online judge, but i got WA. I'm quite sure my algorithm is correct, but i think my problem is input & output. Should i input values via input file(what' the name of that file) or values are entered manually? What about the output? A...