Search found 1 match
- Tue Feb 22, 2005 7:52 am
- Forum: Volume 107 (10700-10799)
- Topic: 10725 - Triangular Square
- Replies: 21
- Views: 13276
10725...WA.. Help~~~
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
int main()
{
int T[3],i,t;
double l1,l2,m,h,s,p,r;
cin >> t;
while ( t-- )
{
cin >> T[0] >> T[1] >> T[2];
p = (T[0]+T[1]+T[2]) / 2.0;
s = sqrt( p*(p-T[0])*(p-T[1])*(p-T[2]) );
// r ...