OJ Board

ur invert() function is creating trouble in case an input number ends in 0.

when string2 has leading zeroes, strtol returns 0.

Hi,

I'm getting RE (SIGSEGV) for 159. Could someone please give me some hint....
I've tried with numerous testcases at my end.



#include <stdio.h>
void main()
{
char leadPairPossible(char*, char*);
void printCrosses(char, char*, char*, char, char*, char*);
char c1, c2;

char w1[11], w2[11 ...

You've not mentioned, which problem you are trying to solve.

If this is 100 ( The 3n+1 Problem ), then you should post it in Volume I.

Also, take care of the ouput format required by the problem description. You only need to print a, b and value.

Hi,

I'm getting WA.
Could someone help me identify what is wrong.


Here is my code:


#include <stdio.h>

void main()
{

int k,N;
int z,num,den;

while(!feof(stdin))
{
scanf("%d",&N);
if( (N<1) || (N>10000000))
continue;

num=1; den=1;
z=1; k=1;

/* we are looking for kth term*/
while ...

Hi,

Thanks for the reply :D

My program doesn't uses recursion. It was only a copy-paste form an earleir problem!

And ok, I managed to get rid of SIGSEGV. It was due to inadequate memory allocation!!!!

But now I'm getting WA!
Any hints???


#include <stdio.h>
#include <stdlib.h>
#include ...

Thanks a Lot!!!

I got Accepted now

Ok! thanks

Hi,

Maybe I've misunderstood the problem!
But the sample output looks wrong to me.

Shouldn't the 14th term be 4/2 instead of 2/4 ???


-Monika

I keep getting WA for 144....

It would be very helpful, if somebody could provide me a sample set of input/output.

or if somebody could give me his ACCEPTED program for 144, so that I can compare my outputs.

Thanks.

Hi,

Please note that you have not initilaized maxcount in each cycle.
Hence your program would give incorrect results from second time onwards.

e.g. Run your program with inputs, say (1, 20)
you will get correct result i.e. 21
Now give inputs as (1,1)
and It'd still give 21 as answer!

-Monika

Hi,

Thanks for the reply.
But I've tried this, and I get the original bitmap back.
I've even tried with 200 X 200 matrix, and I'm able to convert it from B to D and vice versa.

I'm listing my program below. (although it is quite long), but please let me know, if you could identify some problem ...

Hi,

I'm getting WA for 183.

Could someone provide me some good sample input/output for this problem, or let me know, what all tricks could be involved here?


Thanks,
Monika

Hi,

Could someone please help me identify why I'm getting RunTime Error:

Your program has died with signal 11 (SIGSEGV). Meaning:

Invalid memory reference

Before crash, it ran during 0.000 seconds.

My program is:
-------------
/* @JUDGE_ID: 21235WP 175 C "Recursion" */

/* @BEGIN_OF_SOURCE ...