UVa OJ Board

Is there not any body who can see my code and find the mistakes ? I think my whole method is OK. But there can be some precision error. So I am getting WA. Please check my code and find mistakes. Thanks in advance.
[/b]

Why I got WA.Please check my code. #include<stdio.h> #include<string.h> #include<stdlib.h> struct T { char str[105]; int value; }s[105]; int sfunc(void const *a,void const *b) { T p,q; int l1,l2; p=*(T *)a; q=*(T *)b; l1=strlen(p.str); l2=strlen(q.str); if(p.value==q.value) { if(l1==l2) return (strc...

I got accepted . I done a stupid mistake for the first case. I fixed my mistake and got accepted.

I use long long int .But why I always got wrong answer? Please see my code and find the bug. #include<stdio.h> int coin[10]={0,1,5,10,25,50}; long long int ways[30005][7]; void main() { int N,i,j; for(i=1;i<=30000;i++) ways[i][0]=0; for(i=1;i<=5;i++) ways[0][i]=1; for(i=1;i<=30000;i++) { for(j=1;j<=...

I solved it using Dijkstra algorithm. But always got WA. Can some body check it or can give some critical input data? #include <stdio.h> #include<string.h> #define inf 1000000000.00 #define nIL -1 #define MAX 101 int g[MAX][MAX],p[MAX],deg[MAX]; bool taken[MAX]; int path[MAX]; int n,len; char ch[100...

I use the following procedure:

1. mark all (u,v) such that gopher can go from u to v in m minutes with its speed v m/sec.

2.Then call bfs.

But get wrong ans. Is the procedure wrong?

Procedure: 1. Get all a+b and sorting them. 2.Find all (d-c) and find this by binary search from the above array. But why wrong answer. PLS help. Here is my code: #include<stdio.h> #include<stdlib.h> typedef int LONG; #define INF 2000000000 LONG arr[1005],data[1000009]; int index; int sfunc1(void co...

Another MST Problem of Archieve:

2515 - Networking

Try to use fixed length all pair shortest path algorithm for this problem. It will be easy then bfs.(From Corman).