-
大小: 2KB文件類型: .zip金幣: 1下載: 0 次發(fā)布日期: 2021-01-09
- 語(yǔ)言: 其他
- 標(biāo)簽:
資源簡(jiǎn)介
2019年安徽省程序設(shè)計(jì)大賽E題,現(xiàn)代藝術(shù)
給出平面上N個(gè)點(diǎn)的坐標(biāo)點(diǎn)集,求這N個(gè)點(diǎn)有多少條整體對(duì)稱軸.整體對(duì)稱軸是指一條直線, 對(duì)于每個(gè)點(diǎn),都能找到點(diǎn)集中的一個(gè)點(diǎn)與他關(guān)于這條直線對(duì)稱 輸入 輸入的第一行
給出平面上N個(gè)點(diǎn)的坐標(biāo)點(diǎn)集,求這N個(gè)點(diǎn)有多少條整體對(duì)稱軸.整體對(duì)稱軸是指一條直線, 對(duì)于每個(gè)點(diǎn),都能找到點(diǎn)集中的一個(gè)點(diǎn)與他關(guān)于這條直線對(duì)稱 輸入 輸入的第一行
代碼片段和文件信息
#include
#include
#include
#include
#include
#include
using?namespace?std;
const?int?MAXX=2010;
const?double?eps=1e-8;
int?nx[MAXX]y[MAXX]a[MAXX<<1];
int?xx[MAXX*10]yy[MAXX*10];
int?totans;
bool?MAP[MAXX][MAXX];
inline?bool?check(double?adouble?b){
????if(fabs(a-b)<=eps)return?1;
????else?return?0;
}
inline?void?judge(int?aint?bdouble?Adouble?Bdouble?C){
????bool?flag=0;
????for(int?j=1;j<=n;++j){
??????????if(j==a||j==b)continue;
??????????double?T=(A*(double)x[j]+B*(double)y[j]+C)/(A*A+B*B);
??????????double?x0=x[j]-2.0*A*T;
??????????double?xxx1=round(x0);
??????????int?xxx2=round(x0);
??????????double?y0=y[j]-2.0*B*T;
??????????double?yyy1=round(y0);
??????????int?yyy2=round(y0);
??????????if(!c
?屬性????????????大小?????日期????時(shí)間???名稱
-----------?---------??----------?-----??----
?????文件????????2315??2020-05-18?13:57??給出平面上N個(gè)點(diǎn)的坐標(biāo)點(diǎn)集,求這N個(gè)點(diǎn)有多少條整體對(duì)稱軸.整體對(duì)稱軸是指一條直線,?對(duì)于每個(gè)點(diǎn),都能找到點(diǎn)集中的一個(gè)點(diǎn)與他關(guān)于這條直線對(duì)稱?輸入??輸入的第一行.cpp
評(píng)論
共有 條評(píng)論