/*
* 解题思路:
* 求最大的一个三角形、且其中不包含任一顶点,参考P84
*/
#include#include char s[ 105 ],c; int mon[ 105 ][ 2 ]; double area( double x1,double y1,double x2,double y2,double x3,double y3 ) { return fabs(0.5*((y3-y1)*(x2-x1)-(y2-y1)*(x3-x1))); } int main( ) { int n; int i,j,k,l; int x,y,z,maxA,flag; double areaX,areaA,area1,area2,area3; while( scanf("%d",&n) && n ) { for( i=0;i = 0 ) { flag = 0; break; } } if( flag && areaX > areaA ){ areaA = areaX , x = i , y = j , z = k; } } printf("%c%c%c\n",(char)(x+65),(char)(y+65),(char)(z+65)); } return 0; }