OJ Board

Thanks Brian Fry.

Your boss must not see you outside your home. You can assume that the cost of reaching another location in the same place is zero and you must go outside your home to reach market and your boss must come outside to reach home (from office) or office (from home) If I understood this statement correc...

Input: 1 2 2 3 4 3 2 4 0 0 1 2 2 3 4 5 0 0 1 7346537 37542 1 0 0 7 7 0 0 8 9 0 5 0 0 100 1 1 2 9 7 7 3 3 88 88 6 1 9 2 6 0 0 1 2 1 2 0 0 999999 5 0 0 0 0 -1 -1 Output: Case 1 is not a tree. Case 2 is not a tree. Case 3 is a tree. Case 4 is not a tree. Case 5 is not a tree. Case 6 is not a tree. Case...

Continuously getting Wrong Answers: Plz help. Thanks in Advance #include<cstdio> #include<vector> #include<cstring> #include<algorithm> //#include<conio.h> using namespace std; struct type { int x, y; bool operator < (const type& p) const { if(x==p.x) return y > p.y; return x < p.x; } }; vector<...

Thanks Brian fry for your brilliant test cases.

Now got AC

Brian fry, My code outputs all the cases posted by you perfectly. But still WA. #include<cstdio> #include<queue> #include<vector> #include<cstring> using namespace std; int no_of_connections, no_of_tiles, count_1 = 0; char color[100050]; vector<int>data[100050]; void read_input(void); void search_it...

Thanks Brian fry for replying. I see my bug was in determining the number of states. At first I assumed that "if distance between two cities is greater than r then theys are in different states". But seeing your accepted output I changed it to "if distance is greater than or equal r t...

Wrong answer every time: It passes all the test cases posted here. I can't find the bug. If you can please tell me. Thanks :( [#include<cstdio> #include<cmath> #include<iostream> #include<vector> #include<stdlib.h> #include<algorithm> #define dist sqrt((x -x[j])*(x -x[j]) + (y -y[j])*(y -y[j])) usin...