## Search found 13 matches

Wed May 11, 2011 9:51 pm
Forum: Volume 119 (11900-11999)
Topic: 11952 - Arithmetic
Replies: 11
Views: 4518

### Re: 11952 - Arithmetic

I also getting wa in this problem.
can anyone give critical input output for this problem????
Mon Nov 01, 2010 8:04 pm
Forum: Volume 118 (11800-11899)
Topic: 11889 - Benefit
Replies: 27
Views: 11764

### Re: 11889 - Benefit

Now i solve the runtime error but i got Wa now...
Plz give me some critical input output......
Sun Oct 10, 2010 6:40 pm
Forum: Volume 118 (11800-11899)
Topic: 11860 - Document Analyzer
Replies: 15
Views: 5209

### 11860 - Document Analyzer

I think this is a simple adhoc problem.....
but i got TLE in the contest
can any one give me any clue.....

Tue Oct 05, 2010 8:31 pm
Forum: Volume 118 (11800-11899)
Topic: 11857 - Driving Range
Replies: 21
Views: 8204

### Re: 11857 - Driving Range

Now i got accepted

but my runtime is 2.904
I use Kruskal + dfs.
can anyone give me any hints to decrease my runtime....
Mon Oct 04, 2010 7:42 am
Forum: Volume 118 (11800-11899)
Topic: 11857 - Driving Range
Replies: 21
Views: 8204

### 11857 - Driving Range

I think this is simple DFS problem.
I called a dfs then check which road length is maximum
Is my approach is ok?

PLZ give me some critical input output....

Thu Sep 16, 2010 6:19 pm
Forum: Volume 117 (11700-11799)
Replies: 32
Views: 7121

Thanks naseef.....
Now i got accepted.....
Thu Sep 09, 2010 6:16 pm
Forum: Volume 117 (11700-11799)
Replies: 32
Views: 7121

I thought this problem easily. I just do the addition with no of integer from 1 to 26.if this addition greater then no of roads then i use break condition.
But i got WA.
Is that my process is correct ?????

here is my code:

//Removed after accepted...

Mon Apr 26, 2010 8:12 am
Forum: Volume 117 (11700-11799)
Topic: 11785 - Hypercube
Replies: 1
Views: 1977

### 11785 - Hypercube

In this problem 1st i find out the power of 2. if this is power of 2 then i check all node have same no of degree. if this is same i give output yes.else no. if this not power of two then i also give answer 2. but i got WA after 0.044s. here is my code: #include<stdio.h> #include<math.h> int main() ...
Sun Jan 17, 2010 6:36 pm
Forum: Volume 117 (11700-11799)
Topic: 11760 - Brother Arif, Please feed us!
Replies: 15
Views: 4515

I think u not check when arif point is [0,0];
because on that time the position will be negative value.
I also face same problem.

I think now it will be accepted!!!!!!!!!
Sat Jan 16, 2010 7:32 pm
Forum: Volume 117 (11700-11799)
Topic: 11760 - Brother Arif, Please feed us!
Replies: 15
Views: 4515

### 11760 - Brother Arif, Please feed us!

code removed after accepted.

thank all.
Sat Dec 19, 2009 9:10 pm
Forum: Volume 117 (11700-11799)
Topic: 11736 - Debugging RAM
Replies: 5
Views: 2560

### 11736 - Debugging RAM

thank u asu
Tue Oct 06, 2009 6:02 pm
Forum: Volume 116 (11600-11699)
Topic: 11690 - Money Matters
Replies: 19
Views: 6998

### 11690 - Money Matters

accepted
Tue Oct 06, 2009 5:54 pm
Forum: Volume 116 (11600-11699)
Topic: 11690 - Money Matters
Replies: 19
Views: 6998

### 11690

I solve the this problem by DFS. but it is time limit exceed. here is my code: #include<stdio.h> long int k1; long int g[10001][10001]={0},cl[10001]; long int d,cu[10001]; int dfs(); void dfs_visit(int u); int main() { long int u,r,j,a,y; long int c,s,i,t; scanf("%ld",&t); for(i=1;i<=t;i++) { scanf(...