栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

poj 3643 Friend or Foe?

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

poj 3643 Friend or Foe?

#include "stdio.h"#include "math.h"#define N 210typedef struct{double x;double y;double z;}point; point al[N],em[N];double eqa,eqb,eqc,eqd,eq;int numa,nume;int friend_or_foe(){bool judge;int count = 0,i,j;eqa = 0;eqb = 0;eqc = 0;eqd = 0;while (count++ < 100000){judge = 1;for (i = 1;i <= nume;i ++){eq = eqa * em[i].x + eqb * em[i].y + eqc * em[i].z + eqd;if (eq <= 0){eqa += em[i].x;eqb += em[i].y;eqc += em[i].z;eqd += 3;judge = 0;}}for (i = 1;i <= numa;i ++){eq = eqa * al[i].x + eqb * al[i].y + eqc * al[i].z + eqd;if (eq > 0){eqa -= al[i].x;eqb -= al[i].y;eqc -= al[i].z;eqd -= 3;judge = 0;}}if (judge)break;}printf("%.6lf %.6lf %.6lf %.6lfn",eqa,eqb,eqc,eqd);return 0;}int main(){int i;while(1){scanf("%d",&numa);if (numa < 0){scanf("%d",&nume);break;}for (i = 1;i <= numa;i ++)scanf("%lf%lf%lf",&al[i].x,&al[i].y,&al[i].z);scanf("%d",&nume);for (i = 1;i <= nume;i ++)scanf("%lf%lf%lf",&em[i].x,&em[i].y,&em[i].z);friend_or_foe();}return 0;}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/379073.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号