0_0_16586496_27427.cpp:1:1: error: expected unqualified-id before '<' token
<li class="alt"><span><span class="comment">//代码可读性优化版本:</span><span> </span></span></li><li class=""><span><span class="preprocessor"></span> </span></li><li class="alt"><span><span class="preprocessor">#include <iostream></span><span> </span></span></li><li class=""><span><span class="preprocessor">#include <cmath></span><span> </span></span></li><li class="alt"><span><span class="preprocessor">#define MAX(a,b) (a)>(b)?(a):(b)</span><span> </span></span></li><li class=""><span><span class="preprocessor">#define MIN(a,b) (a)>(b)?(b):(a)</span><span> </span></span></li><li class="alt"><span><span class="keyword">using</span><span> </span><span class="keyword">namespace</span><span> std; </span></span></li><li class=""><span> </span></li><li class="alt"><span><span class="keyword">struct</span><span> Lpoint </span></span></li><li class=""><span>{ </span></li><li class="alt"><span> <span class="keyword">double</span><span> x,y; </span></span></li><li class=""><span>}; </span></li><li class="alt"><span> </span></li><li class=""><span><span class="keyword">int</span><span> main() </span></span></li><li class="alt"><span>{ </span></li><li class=""><span> Lpoint num[8]; </span></li><li class="alt"><span> <span class="keyword">int</span><span> i; </span></span></li><li class=""><span> <span class="keyword">while</span><span>(scanf(</span><span class="string">"%lf%lf%lf%lf%lf%lf%lf%lf"</span><span>,&num[0].x,&num[0].y,&num[1].x,&num[1].y,&num[2].x,&num[2].y,&num[3].x,&num[3].y)!=EOF) </span></span></li><li class="alt"><span> { </span></li><li class=""><span> <span class="keyword">for</span><span>(i=4;i<8;i+=2) </span></span></li><li class="alt"><span> { </span></li><li class=""><span> num[i].x=MIN(num[i-4].x,num[i-3].x); <span class="comment">//左下</span><span> </span></span></li><li class="alt"><span> num[i].y=MIN(num[i-4].y,num[i-3].y); </span></li><li class=""><span> num[i+1].x=MAX(num[i-4].x,num[i-3].x); <span class="comment">//右上</span><span> </span></span></li><li class="alt"><span> num[i+1].y=MAX(num[i-4].y,num[i-3].y); </span></li><li class=""><span> } </span></li><li class="alt"><span> <span class="keyword">if</span><span>(!(num[7].x>num[4].x&&num[7].y>num[4].y&&num[6].x<num[5].x&&num[6].y<num[5].y)) </span><span class="comment">//矩形不重合</span><span> </span></span></li><li class=""><span> printf(<span class="string">"0.00/n"</span><span>); </span></span></li><li class="alt"><span> <span class="keyword">else</span><span> </span></span></li><li class=""><span> { </span></li><li class="alt"><span> <span class="keyword">double</span><span> h,l,a,b; </span></span></li><li class=""><span> a=MIN(num[7].y,num[5].y); </span></li><li class="alt"><span> b=MAX(num[4].y,num[6].y); </span></li><li class=""><span> h=(a-b); </span></li><li class="alt"><span> a=MIN(num[7].x,num[5].x); </span></li><li class=""><span> b=MAX(num[4].x,num[6].x); </span></li><li class="alt"><span> l=(a-b); </span></li><li class=""><span> printf(<span class="string">"%.2lf/n"</span><span>,h*l); </span></span></li><li class="alt"><span> } </span></li><li class=""><span> } </span></li><li class="alt"><span>} </span></li>
^
|
