
Search found 18 matches
- Wed Oct 06, 2004 8:31 pm
- Forum: Other words
- Topic: Help!!
- Replies: 1
- Views: 1273
Help!!
Asking for hint!! Can't find any clue. Can anybodu help? 

- Fri Sep 10, 2004 4:01 am
- Forum: Volume 102 (10200-10299)
- Topic: 10226 - Hardwood Species
- Replies: 121
- Views: 41875
10226....WA 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...
- Thu Aug 12, 2004 3:57 am
- Forum: Other words
- Topic: can administrator b quick to upload the contest problems >
- Replies: 3
- Views: 1642
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...
- Wed Aug 11, 2004 9:45 am
- Forum: Other words
- Topic: can administrator b quick to upload the contest problems >
- Replies: 3
- Views: 1642
can administrator b quick to upload the contest problems >
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....
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....
- Sat Jul 03, 2004 7:58 pm
- Forum: Volume 6 (600-699)
- Topic: 696 - How Many Knights
- Replies: 29
- Views: 13722
696(Checking the idea)
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?
- Sat Jul 03, 2004 12:35 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10137 - The Trip
- Replies: 159
- Views: 51319
- Tue Jun 15, 2004 7:51 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10484 - Divisibility of Factors
- Replies: 39
- Views: 19971
still getting...runtime...
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...
if(m<0) m=-m;
still cant solve the runtime error can any 1 help...
- Tue Jun 15, 2004 7:35 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10484 - Divisibility of Factors
- Replies: 39
- Views: 19971
10484- runtime error...can any one 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...
- Mon Jun 14, 2004 4:27 am
- Forum: Volume 4 (400-499)
- Topic: 439 - Knight Moves
- Replies: 33
- Views: 12021
439 WA
Getting WA. Please help me with some critical inputs 

- Sun Jun 13, 2004 7:32 pm
- Forum: Volume 3 (300-399)
- Topic: 392 - Polynomial Showdown
- Replies: 93
- Views: 20283
- Sat Jun 12, 2004 10:16 am
- Forum: Algorithms
- Topic: can any one help me reagarding this problem
- Replies: 0
- Views: 946
can any one help me reagarding this problem
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...
- Sat Jun 12, 2004 7:49 am
- Forum: Volume 1 (100-199)
- Topic: 108 - Maximum Sum
- Replies: 233
- Views: 29509
108
Can't find any clue how to implement a O(n^3) algorithm for this problem.
Can anybody help?
Can anybody help?
- Sat Jun 12, 2004 4:56 am
- Forum: Volume 1 (100-199)
- Topic: 195 - Anagram
- Replies: 242
- Views: 33086
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...
- Sat Oct 11, 2003 4:20 pm
- Forum: Volume 4 (400-499)
- Topic: 453 - Intersecting Circles
- Replies: 84
- Views: 17393
help me 453 why WA?????plzzzzz
#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...
- Sat Aug 09, 2003 6:09 am
- Forum: Bugs and suggestions
- Topic: 511 - Do You Know the Way to San Jose? - Do nothing AC
- Replies: 62
- Views: 6371