UVa OJ Board

lbv

Hello, I tried every test case there, but my code still cannot pass You may try: Input 6 8 -7 -58 -78 -85 73 96 26 -68 68 33 -82 -80 79 -79 -35 -38 -35 91 24 -41 -60 74 20 -76 34 3 -49 23 -94 -27 46 -51 15 68 -35 -63 14 41 -31 -19 -77 -62 -49 52 -41 17 64 24 5 11 8 2 2 11 10 -16 10 -4 -16 -15 -18 3...

lbv

Blief.S wrote:What is the problem in this code plz.....some test cases didn't pass..... got no idea why??

I'd suggest you start by taking the time to read the previous messages in this thread. For example, the message just above yours has good advice that applies to your code.

lbv

i m getting WA need hellp.... Carefully read the "Output" section. You may try: Input 8 0 (3) 2 6 7 1 (1) 6 2 (2) 0 6 3 (1) 4 4 (2) 3 5 5 (1) 4 6 (3) 0 1 2 7 (1) 0 6 0 (1) 4 1 (2) 2 3 2 (3) 1 4 5 3 (1) 1 4 (2) 0 2 5 (1) 2 Output 4 critical links 0 - 7 1 - 6 3 - 4 4 - 5 5 critical links 0 - 4 1 - 2 ...

lbv

Getting wrong answer in 10309. I think this problem illustrates an issue that is controversial and yet very common in UVa's archives. The input is not necessarily as neat as you see in the samples, so be very careful not to make any unnecessary assumptions. For example, the only thing that input sp...

lbv

I'm unfortunately getting Runtime Error. Tried all test cases available on the boards. Using memset to fill with zeros a variable like "string names[10]" doesn't make much sense and is likely to end in memory corruption. string is an opaque data structure and its internals depend on your C++ standa...

lbv

Faithkeeper_Rangwan wrote:Got RTE, don't know where it came from.

Try:

Input

Code: Select all

Output

Code: Select all

impossible

lbv

why is this getting WA Your program doesn't pass the sample tests from the problem statement. Notice that blank lines are significant and the output from your program should match the expected output exactly . Also try configuring your compiler to show you all warnings, and pay attention to those m...

lbv

Repon kumar Roy wrote:I am getting Runtime Error For this problem ..

You may try:

Input

Code: Select all

2 1 0
0 0

Output

Code: Select all

lbv

Could you please tell me why 1 1 or 1 2 is a jolly. (..) As the problem statement specifies, a sequence of n integers is a jolly jumper if: n > 0 The set of integers formed by the absolute differences of successive elements is the same set as the integers { 1, 2, ..., (n-1) } As you say, a sequence...

lbv

nguyencaothong wrote:Could you please find me the reason why my code was WA? I'm stuck

Take the time to read the previous messages of this thread and try the test cases given. For example, try the I/O posted by PromeNabid around Jun 28, 2012.

lbv

Wouldn't you need to find the LIS and LDS with each car as the starting point? Usually when you calculate the LIS/LDS of a sequence, you calculate all the partial results in one pass. That is, you calculate the LIS of the range [ 0 : i ] for 0 <= i < n . Now, your question could also be written as:...

lbv

muktadir.rhmn wrote:please help. why WA???

The code you posted doesn't pass the sample cases from the problem statement. Notice that the output from your program must match the expected output exactly. For example the strings "operation" and "operations" are considered different.

lbv

Need some testcases.getting WA Please help. Try: Input 2 95 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 ...

lbv

kindly could you give some other classes that would help me in I/O routines ? Here's all I could find from my old code: http://pastebin.com/rp6rzUK9 Feel free to do with it whatever you want. However, if you want to hear a suggestion, I'd encourage you to use it only as a reference. I think one of ...

lbv

Gives me Time Limit ......any help please ? This problem has a very tight time limit and a large amount of input, so a really efficient method to read data is needed. I'm not sure if StringTokenizer cuts it. I used to write in Java for competitions a few years ago, so I went back and looked at the ...

UVa OJ Board

Search found 128 matches

Re: 116 Help me

Re: 10114 - Loansome Car Buyer

Re: 796 - Critical Links

Re: 10309 - Turn the Lights Off

Re: 119 Why WA??

Re: 11995 - I Can Guess the Data Structure!

Re: UVA 10070

Re: 22.05.04 Contest Problem E 10655

Re: 10038 - Jolly Jumpers WA

Re: 499 - What's The Frequency, Kenneth?

Re: 11456 - Trainsort

Re: 10035 - Primary Arithmetic

Re: 11542 - Square

Re: 11733 - Airports

Re: 11733 - Airports