Search found 4 matches

by regan
Wed Apr 20, 2011 11:47 am
Forum: Volume 119 (11900-11999)
Topic: 11960 - Divisor Game
Replies: 19
Views: 5296

11960 - Divisor Game

Can any one help me by providing some more cases ....
by regan
Wed Jan 26, 2011 7:55 pm
Forum: Volume 103 (10300-10399)
Topic: 10397 - Connect the Campus
Replies: 75
Views: 25613

10397 RTE & RTE !!!

Got RTE several times with my code....can any one help me by detecting the reason ....Here is my code... #include<iostream> #include<math.h> using namespace std; long n,m,i,j,f,t,p[10000]; double extra; struct edge { long from; long to; double dist; }edg[1000000]; struct node { long x; long y; }nod[...
by regan
Wed May 26, 2010 12:45 am
Forum: Volume 4 (400-499)
Topic: 465 - Overflow
Replies: 104
Views: 23976

465 ! getting Wrong Ans.

Can anyone give me some critical cases for this problem?
can there be input like this: -000001234+ -200001 ?
both numbers will be non negative according to the problem statement...is it?
by regan
Wed May 05, 2010 11:17 pm
Forum: Volume 3 (300-399)
Topic: 383 - Shipping Routes
Replies: 27
Views: 5817

Getting WA 383 ?? some one help plz...

#include<iostream> #include<queue> #include<vector> #define max 50 using namespace std; vector <long> edge[max]; char node[max][10]; long color[max],dist[max],n; long find_pos(char *name) { long pos=-1; for(long i=0;i<=n;i++) { if(strcmp(name,node )==0) { pos=i; break; } } if(pos==-1) { pos=n; n++; ...

Go to advanced search