## Search found 19 matches

Fri Dec 12, 2008 4:38 pm
Forum: Volume 1 (100-199)
Topic: 193 - Graph Coloring
Replies: 93
Views: 21477

### Re: How can i solve the problem 193

Wrong Answer>>>>>Cant Find Any error::: For INPUTS------------>>>>>>>>>>>>> 8 6 8 1 2 1 3 2 4 2 5 3 4 3 6 4 6 5 6 100 2 1 2 2 3 5 5 1 2 2 3 3 4 4 5 5 1 6 6 1 2 2 3 3 4 4 5 5 6 6 1 7 14 1 2 1 3 1 4 1 5 1 6 2 3 3 4 5 7 6 7 2 5 4 6 2 4 5 6 1 7 3 3 1 2 2 3 3 1 3 0 100 100 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9...
Fri Dec 12, 2008 11:47 am
Forum: Volume 100 (10000-10099)
Topic: 10004 - Bicoloring
Replies: 93
Views: 29657

### Re: 10004 - Bicoloring

At lastttttttttt GOT ACCEPTED yeyeye: My Algo:Using like floyd Warshall starting from any first vertex(let A)...color it 1...take all of its adjacent(let B,C) ..(Now i will color all adjacent of A to -1 but i will have to check a condition that after coloring any adjacent of -1 color should not have...
Thu Dec 11, 2008 9:45 pm
Forum: Volume 5 (500-599)
Topic: 593 - MBone
Replies: 0
Views: 719

### 593 - MBone

There should be at least a topic for every question...So i created this one...
Got Accepted
Thu Dec 11, 2008 9:00 pm
Forum: Volume 107 (10700-10799)
Replies: 7
Views: 6902

### Got frustataed now

Wrong Answer !!!!!!5 times in a row...Here is my code ..check it if anyone get time...If anyone have some input for this problem please post that..... #include<iostream> #include<math.h> #define INF 21474478.0 using namespace std; double links[53][53],checking[53][53],traveling[53][53],solution[1225...
Wed Dec 10, 2008 4:58 pm
Forum: Volume 107 (10700-10799)
Topic: 10793 - The Orc Attack
Replies: 35
Views: 19692

### Re: 10793 - The Orc Attack

Getting Wrong Answer Input for the case 5 7 11 1 7 2 2 7 2 3 7 2 5 7 2 6 7 1 1 6 1 2 6 1 3 6 1 4 6 1 5 6 1 7 6 1 6 1 1 2 3 7 5 1 6 1 2 6 1 3 6 1 4 6 1 5 6 1 10 17 1 9 20 1 7 12 2 3 7 2 8 10 2 7 12 3 8 10 4 8 10 4 6 4 5 7 12 5 9 20 5 9 31 6 9 16 6 10 35 7 8 2 7 9 35 8 9 10 9 10 40 6 5 1 6 10 2 6 10 3...
Wed Dec 10, 2008 11:43 am
Forum: Volume 112 (11200-11299)
Topic: 11221 - Magic square palindromes.
Replies: 58
Views: 20967

### Re: 11221 - Magic square palindromes

At last i got accepted..
Just putting all char in a squar dimension array..if possible then checking this 2d array ...should be mirror from both diagonals....
Wed Dec 10, 2008 11:40 am
Forum: Volume 109 (10900-10999)
Topic: 10945 - Mother bear
Replies: 65
Views: 17035

### Re: 10945 - Mother Bear

I dont think there us any input like empoopme done DONE because i got accepted and using tolower() for every char input and at last comparing my string with "done" not "DONE".. Ouput i am having is You won't be eaten! NOTTTTTTTT You won't be eaten! Uh oh.. This means program an be break at done or D...
Sun Dec 07, 2008 7:25 am
Forum: Volume 113 (11300-11399)
Topic: 11354 - Bond
Replies: 13
Views: 6654

### Re: 11354 - Bond

Can anyone tell me the algo for LCA...i am not getting it...
Sat Dec 06, 2008 10:05 pm
Forum: Volume 103 (10300-10399)
Topic: 10369 - Arctic Network
Replies: 45
Views: 24261

### Re: 10369 - Arctic Network

Why i am getting RTE again and again?.......Someone Clarify...........

Code: Select all

``"accepted"``
actully i was using array of 600 edges while edges can be upto 500C2==125000...
Sat Dec 06, 2008 9:30 am
Forum: Volume 2 (200-299)
Topic: 270 - Lining Up
Replies: 48
Views: 16323

### Re: 270: What's the limit for n???

I try with long long but still giving me Wrong Answer/................
Sat Dec 06, 2008 8:45 am
Forum: Volume 101 (10100-10199)
Topic: 10147 - Highways
Replies: 67
Views: 20677

### Re: 10147 - Highways

Wrong Answer again and again....,i got accepted in 10397...and this the same question ....why am i getting wrong answer then?..Someone clarify please...Below is my code... #include<iostream> #include<math.h> using namespace std; struct grid { int x; int y; int id; double key; int parent; int in_queu...
Thu Dec 04, 2008 7:35 pm
Forum: Volume 2 (200-299)
Topic: 270 - Lining Up
Replies: 48
Views: 16323

### Re: 270: What's the limit for n???

@mf
I parshed my input very well....its giving right answers too..where the problem is lying is still hidden to me... i also tried your method and still giving wrong answer to me....
Thu Dec 04, 2008 5:02 pm
Forum: Volume 2 (200-299)
Topic: 270 - Lining Up
Replies: 48
Views: 16323

### Re: 270: What's the limit for n???

Now i am leaving this question as i think no one here has solved this question or get acepted..I checked a sample ouput in UVATOOLKIT too ...for input

Code: Select all

``````1

1 1
2 2
3 3
4 4
5 5
6 6
7 7
1 3
``````
and Output we got in that is 8....how can it be possible???It should be 7....
Thu Dec 04, 2008 7:57 am
Forum: Volume 2 (200-299)
Topic: 270 - Lining Up
Replies: 48
Views: 16323

### Re: 270: What's the limit for n???

@Force brute Why didnt you take input for number of test cases..... i use this--->>>>>>>but getting Wrong Answer again again....Solve someone plzz. #include<iostream> using namespace std; struct pointy { int x; int y; }point[1000]; int main() { int T,nop,i,j,k,max,count,flag=0; char str[10]; scanf("...
Mon Nov 24, 2008 7:44 am
Forum: Volume 5 (500-599)
Topic: 576 - Haiku Review
Replies: 50
Views: 17628

### Re: WA againnnn

#include<iostream> using namespace std; int main() { char str[200],str1[200],str2[200],str3[200]; int i,j,flag,count; while(gets(str)) { flag = 0; i =0; if(!strcmp(str,"e/o/i")) break; for(j=0;str[i]!='/';i++) str1[j++] = str[i]; str1[j] = '\0'; for(j=0,i=i+1;str[i]!='/';i++) str2[j++] = str[i]; st...