OJ Board

Asking for hint!! Can't find any clue. Can anybodu help?

can anybody say why i am getting WA. my code : #include<stdio.h> #include<string.h> struct hardwood { char name[31]; long double frequency; }tree[10101]; long int n=0; int bsearch(char *name); void insert(char *name); void main() { char name[31]; long int i,j; float result; //freopen("i:\\in.tx...

i apologise for my quotes ...... ya it is a free site and it cant demand any thing ..... from the next time i should check my language .... the thing was i was checking the volume 106 again and again and found the contest problem was not added ..... so i wrote .... any way i wont b doing it next tim...

hi,
it is really frustrating to see that contest problems r not uploaded still (3 days already past)....can the administrator b quick and upload the problems....

I think if the knights are placed in the diagonal cells then it will produce the largest number of knights' arrangement. Is this not correct? when this does not work?

My code also getting WA. [c] #include <stdio.h> int main(){ int n,i=0; long double in,avg; long students[1001],total=0,top,bottom; #ifndef ONLINE_JUDGE freopen("C:\\in.txt","r",stdin); freopen("C:\\out.txt","w",stdout); #endif while(scanf("%d",&n...

i pointed out... the -ve may lead to runtime error as invalid memory location.. so changed..

if(m<0) m=-m;

still cant solve the runtime error can any 1 help...

hi... can any state why i am getting runtime error watching the following code...i dont have some condition which can result to WA... but can't get why this error is occuring... my code : #include<stdio.h> #include<math.h> void divisible_generator(); void input_divisible(long long int); long long in...

Getting WA. Please help me with some critical inputs

midra.... probably the instead of -x in line 2 it will be - x..... i think so...

tahsin..

i am trying to make a knight tour all the position in 64 moves from any position... i used recurvise backtracking... having prob...can some check my code and tell me the mistake... MY CODE : #include<stdio.h> int moves[65][2]={0}; //the co-ordinate of each move int position[9][9]={0}; //the status o...

Can't find any clue how to implement a O(n^3) algorithm for this problem.
Can anybody help?

I'm getting WA too. What is the problem with this code? Is there any criticial input that it fails to compute [c] #include <stdio.h> #include <string.h> #define SIZE 500 char word[SIZE],temp[SIZE]; int map[SIZE],l=0; void arrange(int n){ int i,j; char temp; for(i=0;i<n;i++){ for(j=i+1;j<n;j++){ if(w...

#include<stdio.h> #include<math.h> void input(); void calc(int p); double x1,y1,r1,x2,y2,r2,d; void main() { //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); input(); } void calc(int p) { double g1,g2,f1,f2,c1,c2,a,b,c,A,B,C,D,X1,X2,Y1,Y2; g1=-x...

Thanks! I got ACC now