OJ Board

ya thanx codemaker i got my error and got accepted
my correction is followings

while(pos!=-1)
{
s.replace(pos,f.length(),r);
pos=s.find(f);
}

dear friend,
before submitting the 1st post i also try in following way and then
wrong answer turns into memory limit excited and WA is better that MLE
i tryed in following way

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define MAX 100
#define MAX2 10000
struct info
{
char t_name ...

hi whatz wrong with my 10115 please help , code is given below

#include<iostream>
#include<string>
#include<stdio.h>
#define MAX_F_R 1000
#define MAX_A 3600


using namespace std;


char find[MAX_F_R][MAX_F_R];
char replace[MAX_F_R][MAX_F_R];
char array[MAX_A];

int main()
{
int no_of ...

whatz wrong with 450 help please code is given below
-------------


#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define MAX 1000
struct info
{
char t_name[MAX];
char f_name[MAX];
char l_name[MAX];
char add[MAX];
char dept[MAX];
char h_phone[MAX];
char w_phone[MAX];
char cmp_box ...

after some modification i avoid RTE but i am getting WA, the code given below. whats my wrong . if possible give me some sample input output.

#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<string.h>
#define MAX 1000

char val[MAX];

int array2intiger(char array[MAX],int count ...

thanx mr. raj i just make max=0 after every print and got accpted
code removed

whats wrong here i got WA

#include<stdio.h>

unsigned long fun(unsigned long i)
{
unsigned long count=0;
while(i!=1||(count==0))
{
if(((i%2)==0))
i=i/2;
else
i=(3*i)+1;
count++;
}
return count;
}


int main()
{
unsigned long a, b,tmp,i,value;
unsigned long print_a,print_b;
unsigned ...

hi raj,
my modified code is given below i tried to avoid here divided by zero,
my RTE IS

Your program has died with signal 8 (SIGFPE). Meaning:

Floating point exception

Before crash, it ran during 0.000 seconds.

------


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

pleae say me why i am getting RTE



#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<string.h>
#define MAX 1000

char val[MAX];

int array2intiger(char array[MAX],int count)
{
int i,p=count,intiger=0;

for(i=2;i<count;i++)
{
p=p-1;
intiger+=((val[i]-48)*((int)(pow(10,p ...

10192 TLE : though i use DP solution i got TLE help PLZ. my code is following



#include <stdio.h>
#include <string.h>

#define SIZE 100

char X[SIZE],Y[SIZE];
int c[SIZE][SIZE];
int i,j,m,n;

int LCSlength()
{
m=strlen(X);
n=strlen(Y);

for (i=1;i<=m;i++)
c[i][0]=0;

for (j=0;j<=n;j++)
c ...

10192 though i did dp solution but got TLE Help he please.my code is following. please say why i got TLE .



#include <stdio.h>
#include <string.h>

#define SIZE 100

char X[SIZE],Y[SIZE];
int c[SIZE][SIZE];
int i,j,m,n;

int LCSlength()
{
m=strlen(X);
n=strlen(Y);

for (i=1;i<=m;i++)
c[i][0 ...

PLEASE SAY ME WHAT IS MY WRONG
WHY I GETTING WA. MY CODE IS GIVEN BELOW

#include<stdio.h>
int main()
{
long n,i;
printf("PERFECTION OUTPUT\n");
freopen("328.txt","r",stdin);
while(1)
{
scanf("%d",&n);
if(n==0)
{
printf("END OF OUTPUT\n");
break;
}
long sum;
for(i=1;i<=n/2;i ...

thanx Mr. Rahman i got accpeted . just memeset my array with -1 and got accpted

i modified it but still WA
see my modified code

#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<string.h>
int num[10];


int cmp(const void *a,const void *b)

{
int *p=(int*)a;
int *q=(int*)b;

if(*p>*q)
return 1;

else if(*p<*q)
return -1;

else
return 0;
}

int digit ...

for the input 123456789. it is in the sample input i test it. following output occur.

Original number was 123456789
987654321 - 123456789 = 864197532
987654321 - 123456789 = 864197532
Chain length 2

please check my prog throwly and say what is my wrong so that i got wrong answer.