OJ Board

plz plz someone help.
what getting me wrong answer?

#include<cstdio> #include<math.h> #include<algorithm> #define eps 1e-9 using namespace std; class p { public: double x,y; p(){} p(double x, double y) { this->x=x; this->y=y; } }; p a[3]; double Area; void lowest_y() { int i=0; for(int k=1;k<3;++k) { if(a[k].y<a[i].y || (a[k].y==a[i].y && a[...

plz help :oops: :cry: #include<cstdio> #include<cstdlib> #include<stack> #include<cmath> #define limit 12000000 class Pair { public: double x,y; }; Pair ob[limit], pre; int trap; void lowest_y(); void sort_CCW_order(); double dis(Pair a, Pair b) { return (a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y); } ...

got ac
but any help regarding my mistake in previous code would be appreciated

plzzz someone help me.
i couldn't find my mistake.

i checked the sample input of the thread. it gives me correct output. plz help me to find my bug. thanks in advance. :cry: :cry: :cry: #include<cstdio> #define limit 101 #define inf 1e9 inline int max(int a, int b) { return ((a>b)?a:b); } inline int min(int a, int b) { return ((a<b)?a:b); } int adj...

Subhan-Allah After making double to int as you said i got accepted.
You are e genius lighted.

It is not correct to compare double and long directly. You can solve this problem with integers without double. :) thanks lighted :D a few minutes ago i did find my mistake after hours of hard work. :lol: But still wrong answer. :cry: :cry: :cry: :cry: :cry: :cry: :cry: :cry: :cry: :cry: :cry:

:oops: I have tried all test case in the forum bt still WA. plz plz plz anyone help #include<cstdio> #include<algorithm> #include<iostream> #include<string> long long tsp[10][100]; int path[10][100], row, col; int main() { long long mini; int in[3]={-1,0,1},r,mr,c; while(scanf("%d %d", &am...

i used kruskal . greedily add edges to A and B simultaneously. getting WA. plz give me some critical input for which my code not working. //prim prim //simultaniously kruskal apply krte hbe aladavabe kruskal apply kora jbe na //greedily a b r jnno edge select krte hbe #include<iostream> #include<cst...

why WA?? brianfry plz help me to find the mistake. #include<iostream> #include<string> #include<algorithm> #include<cstdio> using namespace std; int main() { string a,b; int len1,len2,carry,count,i; while(cin>>a>>b) { if(a=="0" && b=="0")break; count=0; len1=a.size(); rev...

i used dijkstra . first handling multi edges by picking the min cost. first of all, using single source shortest path to count cost of reaching destination , secondly using single destination shortest path . Finally summing total cost but i'm getting TLE. i used adjacency list of size vertices, 2d ...

i'm getting PE .