## Search found 24 matches

Sat Jul 20, 2013 9:49 pm
Forum: Volume 108 (10800-10899)
Topic: 10883 - Supermean
Replies: 30
Views: 12428

### Re: 10883 - Supermean

Thanks for your reply. I understand the problem. But how can i solve this problem efficiently.
Thu Jul 18, 2013 5:58 pm
Forum: Volume 108 (10800-10899)
Topic: 10883 - Supermean
Replies: 30
Views: 12428

### Re: 10883 - Supermean

I am trying to understand this problem but failed. Can anyone explain how to solve this problem ?
Wed Apr 17, 2013 10:19 am
Forum: Volume 114 (11400-11499)
Topic: 11437 - Triangle Fun
Replies: 2
Views: 1185

### 11437 - Triangle Fun

I am getting wrong answer. help me.
here is my code:

Code: Select all

``````removed after ac
``````
Sun Mar 17, 2013 10:47 pm
Forum: Volume 116 (11600-11699)
Topic: 11624 - Fire!
Replies: 54
Views: 16216

### Re: 11624 - Fire!

I am getting wa. Help me Here is my code #include<stdio.h> #include<stdlib.h> #define size 1010 char maze[size][size]; int r1[4]={-1,1,0,0}; int c1[4]={0,0,1,-1}; int impossible,min,r,c; void dfs(char maze[size][size], int row, int col,int count); int main() { int t,row,col,i,j,f; scanf("%d&quo...
Tue Mar 05, 2013 4:56 pm
Forum: Volume 100 (10000-10099)
Topic: 10001 - Garden of Eden
Replies: 39
Views: 16010

### Re: 10001 - Garden of Eden

Thanks for your reply. My approach of coding is wrong. Will you explain how to solve this problem? I read all the posts in this thread. But the coding procedure is not clear to me. If you explain i will be glad.
Sun Mar 03, 2013 7:20 am
Forum: Volume 100 (10000-10099)
Topic: 10001 - Garden of Eden
Replies: 39
Views: 16010

### Re: 10001 - Garden of Eden

I am getting TLE.help me. #include<stdio.h> #include<string.h> void found(int id1, int *p,int N); int main() { int id,N,i,right,center,left,sum,len; char A[34],source[34],destination[34]; int identi[10]; while(scanf("%d%d%s",&id,&N,A)==3) { A[N]='\0'; len = strlen(A); found(id,iden...
Thu Feb 14, 2013 7:17 am
Forum: Volume 118 (11800-11899)
Topic: 11889 - Benefit
Replies: 27
Views: 11959

### Re: 11889 - Benefit

After removing that line i am still getting wrong answer.
Sun Feb 10, 2013 7:33 am
Forum: Volume 118 (11800-11899)
Topic: 11889 - Benefit
Replies: 27
Views: 11959

### Re: 11889 - Benefit

Help me. I am getting wrong answer for this problem. here is my code #include<stdio.h> #include<math.h> #include<string.h> #include<vector> #define N 1000000 using namespace std; bool a[N]; vector<int> primelist; void seive() { int i,j,k; memset(a,true,sizeof(a)); a[0]=a[1]=false; for(i=4; i<N; i+=2...
Tue Jan 29, 2013 11:18 am
Forum: Volume 103 (10300-10399)
Topic: 10369 - Arctic Network
Replies: 45
Views: 25192

### Re: 10369 - Arctic Network

I used prim's algorithm.
Sun Jan 27, 2013 1:31 pm
Forum: Volume 103 (10300-10399)
Topic: 10369 - Arctic Network
Replies: 45
Views: 25192

### Re: 10369 - Arctic Network

I am getting wrong answer for a long time. if any one help me to find out the problem. #include<stdio.h> #include<math.h> #include<stdlib.h> double distance(int x1,int y1,int x2,int y2); struct node{ int x; int y; }V[510]; double w[510][510]; double dis[510],k[510]; int h[510],p[510]; int compare (c...
Sat Jan 26, 2013 7:25 am
Forum: Volume 103 (10300-10399)
Topic: 10397 - Connect the Campus
Replies: 75
Views: 27638

### Re: 10397 - Connect the Campus

Fri Jan 25, 2013 5:42 pm
Forum: Volume 103 (10300-10399)
Topic: 10397 - Connect the Campus
Replies: 75
Views: 27638

### Re: 10397 - Connect the Campus

Getting wrong answer for this problem. If any one help to find out the error i will be glad . #include<stdio.h> #include<math.h> void cloud(int oldvalue,int newvalue,int N); double distance(int x1,int x2,int y1,int y2); void heapsort(long int count); void Build_Max_Heap(long int count); void Max_Hea...
Fri Jan 25, 2013 5:17 pm
Forum: Volume 5 (500-599)
Topic: 567 - Risk
Replies: 46
Views: 18233

### Re: 567 (Risk) - Wrong Answer

Wed Jan 23, 2013 4:34 pm
Forum: Volume 5 (500-599)
Topic: 567 - Risk
Replies: 46
Views: 18233

### Re: 567 (Risk) - Wrong Answer

I am getting run time error. but i am unable to find out the error. if anyone help i will be glad. here is my code #include<stdio.h> #include<string.h> void BFS(int i); int dequeue(); void enqueue(int k); struct node { int node_value; char color[7]; } V[21]; int a[21][21]; int s[110][2]; int main() ...
Sat Dec 15, 2012 11:50 am
Forum: Volume 1 (100-199)
Topic: 140 - Bandwidth
Replies: 49
Views: 8908