OJ Board

I'm new with graph algoithm and I just start reading about graphs

but I'm al little bit confused about Bellman-Ford algorithm
I still can't understand how it works.....

can anyone help me.....

what formula should I use to generate carmichael numbers?

what's wrong with my code? [c] #include<stdio.h> void main() { int f[256]; char line[1001]; int i,min,idx; int ctr; /* freopen("in.txt","r",stdin); freopen("out.txt","w",stdout); */ while(gets(line)!=NULL) { for(i=0;i<256;i++) { f =0; } for(i=0;line !='\0';i++...

thanks got accepted
I forgot about '\0'

I still don't know why is my code resulting WA the sampe input and output is correct, maybe I missed something? [c] #include<stdio.h> #include<string.h> void main() { int n,m; int i,j; int k,l; int ctr; int num; char mat[100][100]; num=1; /* freopen("input.txt","r",stdin); freope...

thanks
got acc

thanks

I got acc

why is my code resulting RTE (SISVG)? [c]#include<stdio.h> #include<string.h> void main() { char a[10000]; char b[10000]; int i,j; int len; while(scanf("%s %s",a,b)!=EOF) { j=0; len=strlen(a); for(i=0;b !='\0';i++) { if(j==len) { break; } if(b ==a[j]) { j++; } } if(j==len) printf("Yes...

still generating the wrong output it generates Max hits: 0 -858993460 Max hits: 4 1 2 3 5 Max hits: 3 7 18 45 Max hits: 2 1 2 Max hits: 4 1 4 5 6 instead of Max hits: 4 1 2 3 5 Max hits: 3 7 18 45 Max hits: 2 1 2 Max hits: 4 1 4 5 6 Max hits: 3 1 3 5 I still have problem with the multiple input.....

I have tested my code using various kinds of sample inputs but it still WA

but then I look the problem is multiple input type

so do I have to input the number of test case first?
and if I do, what input that shows the end of input for one test case?

thanks before

Has anyone here read the book?
what is it about?
is it good?
I'm just wondering about what's in it

ok thanks a lot

then I can use a string then seperate it into a struct which has int decimal, int integer,int sign.

thanks for your help

I have to make a program that can calculate 5000 digits number

do you know the algorithm how to store a big number in an array of char
and then calculate it?

I know how to do it for addition and substraction but for multiplication I still can't find the right way.....

the number can be floating type

like : 1234.52

please help me with my problem here......

I still can't download the problems......

Oh I didn't read the part that emirp = (prime != prime reversed)

thanks I finally got accepted