OJ Board

OFF THE RECORD I can't stop writing comment on the Abul Dean of Eastern University. Two of my friends (Gold Medalist from East West University, having a CGPA of 3.99/4.00, now doing their Masters in Germany) were called by the Eastern University (EU) for an interview for the post of Lecturer in CSE....

ONLY FOR BANGLADESHI TEAMS
--------------------------------------

Dear Coaches and Contestants,
It

Thanks to mf and arsalan_mousavian. I am such a duffer! I used so many times FW but never did this mistake and how come I did it here ? Interestingly it gave the correct output for the sample inputs and that made me more crazy. I checked lot many things in my code (even thought about multiple paths ...

Though I feel this one an easy problem, but getting WA
Here is my code... anyone can find my bug ? Thanx in advance.

Please help me. This is such an easy problem and I am stucked there ! It is irritating. Plz give me some more input and output.

Plz do have a look at my code. I cant figure out the bug ! #include<stdio.h> #include<string.h> #include<math.h> #include<stdlib.h> int N,index; char bank[55][100],temp[100]; int compare (int a, int b) { int i,j,len1,len2,len; len1=strlen(bank[a]); len2=strlen(bank[b]); if(len1>len2) len=len2; else ...

I am getting WA again and again ! I cant figure out where is actually my mistake. Would you plz give me some tricky input and output, so that I can find my fault ?

What will be the output for this input
3
0 0 0

Thanks in advance.

This part of my code will be.... else if(coeff[i]<0) { if(k==0) printf("-"); else printf(" - "); coeff[i]=coeff[i]*(-1); if(coeff[i]!=1) printf("%dx",coeff[i]); printf("x"); k=1; } This else if(coeff[i]<0) { if(k==0) printf("-"); else printf(" - "); coeff[i]=coeff[i]*(-1); if(coeff[i]!=1) printf("%d...

the number will be at best 9999*10000 . so how do you check prime if the number will be greater then 300000000? Do you mean "300000000" or "30000000" ? I got to know from a previous post on this problem that the number will not be too large. That's why I took such a small upper limit. Would you ple...

got AC.

Can anyone help me ? Getting WA for the last 3 years !!! #include<stdio.h> int main() { int coeff[10]; int i,k; while(scanf("%d",&i)==1) { coeff[8]=i; for(i=0;i<8;i++) scanf("%d",&coeff[7-i]); k=0; for(i=8;i>1;i--) { if(coeff[i]>0) { if(k==1) printf(" + "); if(coeff[i]!=1) printf("%dx^%d",coeff[i],i...

Here is my code. Plz have a look.

Posting my code that gives correct ans for the bijon's given input. #include<stdio.h> #include<math.h> #define max 10011 #define pmax 20000010 char prime[pmax]; int bank[max+100]; int isPrime(long); void siv() { long i,j,k; prime[0]='x'; prime[1]='x'; for(i=3;i<=(int)sqrt(pmax);i=i+2) { if(prime[j]!...

I can't figure out the formula. Even I don't know, is there any stright forward formula exist or not. Plz give me some hints. Thanks in advance.