OJ Board

I thought unless u returned a zero, the judge assumed your program was not running properly. I didnt know we could even return 1000 if we wanted!

shaqira wrote:thnx mf, for givin me suggestion.now i hav changed my code but its still
givin wa .am i missin anythin?plz help
here is my modified code:


return 1;
}

Why are you returning a 1 in your code?

I`ve taken care of it being a multiple input problem and i`ve printed the blank lines between consecutive cases. My program gives the correct output for all the i/o on this forum. Why WA?



#include<stdio.h>

int main()
{
char area [102][102];
char output [102][102];
char used[102][102];
int m ...

Sorry, i forgot to do it this morning. Done now.

Since the nos are very large here, it is sufficient to take the root and store it in a long double. Just do the following:

1. You need to keep taking input as long as the judge keeps giving them. For that, use



while(scanf("%lf %lf",&n,&p)==2)
{

// the processing of each pair of input ...

Two things:
should be
And you forgot this line:

Output a blank line after each set.

Look at the problem statement - it says


A blank line should separate the output for each line of input


Your program merely prints a blank line before each output set. Change that to



if(count)
printf("\n");



where count denotes no of output set. First output set will have count=0;

Thanks a lot little joey and mf! Sorry to have bothered u for such a silly error It never struck me to check the conditions themselves as i was getting correct output for all the input.. I thought i was missing a condition. Thanks a lot!

Thanks a lot Hank! Your i/o showed my error at once. Fixed it and got accepted! Thanks a lot!

this is how i solved the problem, after 9 WA. :(

if ( X && O ) goto no;
if ( X && (a==b+1) ) goto yes;
if ( X && (a!=b+1) ) goto no;
if ( O && (a==b) ) goto yes;
if ( O && (a!=b) ) goto no;
if ( (a==b) || (a==b+1) ) goto yes; else goto no;

// check out
yes: cout << "yes"; goto end;

no ...

My program runs perfectly on my comp and gives correct output for the all the inputs given on this forum. Yet i get WA. Here is my code:
I`ve used the logic suggested by someone here. Am i missing something very obvious?

Depends on the problems . Its quite easy to solve around ten ad -hoc problems in a single day.

My code gives the correct output to your input also.

Can`t binary be used only for searching an exact term? If we use lower_bound and upper_bound, we`ll have to find the smallest fib greater than lower_bound and the highest fib lower than upper_bound and subtract the indices of those two fibs to get the answer right? So how can we use binary search ...

Check your email. For every submission u do, the oj sends a program received email to you. You can get your ac code from there!