OJ Board

Code: Select all

#include <iostream>
#include <cmath>

using namespace std;

int n, m;
double d[105], a, b, c, s, k;

#define EPS -(1e-9)

int main()
{
	cin >> m;
	for (int i = 0; i < m; i++)
		cin >> d[i];
	cin >> n;
	for (int j = 0; j < n; j++)
	{
		cin >> a >> b >> c;
		k = (a + b + c) / 2;
		s = sqrt(k * (k - a) * (k - b) * (k - c));
		k = (a * b * c) / 2 / s;
		bool g = 0;
		for (int i = 0; i < m; i++)
			if (d[i] - k > EPS)
				if (g)
					cout << " " << i+1;
				else
					cout << "Peg " << char(j + 'A') << " will fit into hole(s): " << i + 1, g = true;
		if (!g)
			cout << "Peg " << char(j + 'A') << " will not fit into any holes";
		cout << endl;
	}
}

Code: Select all

// In the name of God

#include <iostream>
#include <cmath>
#include <vector>

using namespace std;

#define eps 1e-7

double hole[100];

int main ()
{
	int n, nh, i, j;
	double a, b, c, k, R;
	cin >> nh;
	for( i = 0; i < nh; i++ )
		cin >> hole[i];

	cin >> n;
	for( i = 0; i < n; i++ )
	{
		cin >> a >> b >> c;
		k = (a+b+c)/2.;
		k = sqrt( k*(k-a)*(k-b)*(k-c) );
		R = (a * b * c)/(2 * k);//R is Diameter of smallest circle that bounds the triangle
		
		vector< int > fits;
		
		for( j = 0; j < nh; j++ )
		{
			if( R < hole[j] || fabs( hole[j] - R ) < eps )
				fits.push_back( j + 1 );
		}
		
		if( fits.size() != 0 )
		{
			cout << "Peg " << (char)(i+'A') << " will fit into hole(s):";
			for( j = 0; j < fits.size(); j++ )
				cout << " " << fits[j];
		}
		else
			cout << "Peg " << (char)(i+'A') << " will not fit into any holes";
		
		cout << endl;
	}
	return 0;
}

Code: Select all

1
100.0
1
51.0 51.0 100.0
Peg A will fit into hole(s): 1

Code: Select all

      
      bool leq(long double a, long double b)
      {return (a<b || (a-b < eps &&b-a < eps));}

      s = (a+b+c)/2;
      D = 1e100;
      Area = sqrt(s*(s-a)*(s-b)*(s-c)); 
      if(Area>1e-20) D = (a*b*c)/(2*Area); else while(1) cout << "error";
      h = Area*2.0/a; if(leq(2*h,a)) D = min(D,a); 
      h = Area*2.0/b; if(leq(2*h,b)) D = min(D,b); 
      h = Area*2.0/c; if(leq(2*h,c)) D = min(D,c);